LeetCode Topics

A collection of LeetCode questions to ace the coding interview!

LeetCode Topics

Array


0001-two-sum
0121-best-time-to-buy-and-sell-stock
0228-summary-ranges
0532-k-diff-pairs-in-an-array
0661-image-smoother

Hash Table


0001-two-sum
0387-first-unique-character-in-a-string
0532-k-diff-pairs-in-an-array

Dynamic Programming


0121-best-time-to-buy-and-sell-stock

Matrix


0661-image-smoother

String


0020-valid-parentheses
0028-find-the-index-of-the-first-occurrence-in-a-string
0058-length-of-last-word
0125-valid-palindrome
0344-reverse-string
0387-first-unique-character-in-a-string

Stack


0020-valid-parentheses

Two Pointers


0028-find-the-index-of-the-first-occurrence-in-a-string
0125-valid-palindrome
0344-reverse-string
0532-k-diff-pairs-in-an-array

String Matching


0028-find-the-index-of-the-first-occurrence-in-a-string

Bit Manipulation


0476-number-complement

Queue


0387-first-unique-character-in-a-string

Counting


0387-first-unique-character-in-a-string

Binary Search


0532-k-diff-pairs-in-an-array

Sorting


0532-k-diff-pairs-in-an-array

Name		Name	Last commit message	Last commit date
Latest commit History 506 Commits
0001-two-sum		0001-two-sum
0002-add-two-numbers		0002-add-two-numbers
0003-longest-substring-without-repeating-characters		0003-longest-substring-without-repeating-characters
0007-reverse-integer		0007-reverse-integer
0009-palindrome-number		0009-palindrome-number
0013-roman-to-integer		0013-roman-to-integer
0014-longest-common-prefix		0014-longest-common-prefix
0015-3sum		0015-3sum
0017-letter-combinations-of-a-phone-number		0017-letter-combinations-of-a-phone-number
0018-4sum		0018-4sum
0019-remove-nth-node-from-end-of-list		0019-remove-nth-node-from-end-of-list
0020-valid-parentheses		0020-valid-parentheses
0021-merge-two-sorted-lists		0021-merge-two-sorted-lists
0024-swap-nodes-in-pairs		0024-swap-nodes-in-pairs
0025-reverse-nodes-in-k-group		0025-reverse-nodes-in-k-group
0026-remove-duplicates-from-sorted-array		0026-remove-duplicates-from-sorted-array
0027-remove-element		0027-remove-element
0028-find-the-index-of-the-first-occurrence-in-a-string		0028-find-the-index-of-the-first-occurrence-in-a-string
0031-next-permutation		0031-next-permutation
0033-search-in-rotated-sorted-array		0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array		0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position		0035-search-insert-position
0037-sudoku-solver		0037-sudoku-solver
0041-first-missing-positive		0041-first-missing-positive
0042-trapping-rain-water		0042-trapping-rain-water
0046-permutations		0046-permutations
0048-rotate-image		0048-rotate-image
0049-group-anagrams		0049-group-anagrams
0050-powx-n		0050-powx-n
0051-n-queens		0051-n-queens
0053-maximum-subarray		0053-maximum-subarray
0054-spiral-matrix		0054-spiral-matrix
0056-merge-intervals		0056-merge-intervals
0058-length-of-last-word		0058-length-of-last-word
0061-rotate-list		0061-rotate-list
0062-unique-paths		0062-unique-paths
0070-climbing-stairs		0070-climbing-stairs
0073-set-matrix-zeroes		0073-set-matrix-zeroes
0074-search-a-2d-matrix		0074-search-a-2d-matrix
0075-sort-colors		0075-sort-colors
0079-word-search		0079-word-search
0081-search-in-rotated-sorted-array-ii		0081-search-in-rotated-sorted-array-ii
0083-remove-duplicates-from-sorted-list		0083-remove-duplicates-from-sorted-list
0088-merge-sorted-array		0088-merge-sorted-array
0090-subsets-ii		0090-subsets-ii
0094-binary-tree-inorder-traversal		0094-binary-tree-inorder-traversal
0096-unique-binary-search-trees		0096-unique-binary-search-trees
0098-validate-binary-search-tree		0098-validate-binary-search-tree
0100-same-tree		0100-same-tree
0101-symmetric-tree		0101-symmetric-tree
0102-binary-tree-level-order-traversal		0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal		0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree		0104-maximum-depth-of-binary-tree
0108-convert-sorted-array-to-binary-search-tree		0108-convert-sorted-array-to-binary-search-tree
0111-minimum-depth-of-binary-tree		0111-minimum-depth-of-binary-tree
0112-path-sum		0112-path-sum
0118-pascals-triangle		0118-pascals-triangle
0121-best-time-to-buy-and-sell-stock		0121-best-time-to-buy-and-sell-stock
0124-binary-tree-maximum-path-sum		0124-binary-tree-maximum-path-sum
0125-valid-palindrome		0125-valid-palindrome
0128-longest-consecutive-sequence		0128-longest-consecutive-sequence
0131-palindrome-partitioning		0131-palindrome-partitioning
0135-candy		0135-candy
0136-single-number		0136-single-number
0138-copy-list-with-random-pointer		0138-copy-list-with-random-pointer
0141-linked-list-cycle		0141-linked-list-cycle
0142-linked-list-cycle-ii		0142-linked-list-cycle-ii
0144-binary-tree-preorder-traversal		0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal		0145-binary-tree-postorder-traversal
0148-sort-list		0148-sort-list
0151-reverse-words-in-a-string		0151-reverse-words-in-a-string
0153-find-minimum-in-rotated-sorted-array		0153-find-minimum-in-rotated-sorted-array
0160-intersection-of-two-linked-lists		0160-intersection-of-two-linked-lists
0169-majority-element		0169-majority-element
0175-combine-two-tables		0175-combine-two-tables
0189-rotate-array		0189-rotate-array
0199-binary-tree-right-side-view		0199-binary-tree-right-side-view
0200-number-of-islands		0200-number-of-islands
0202-happy-number		0202-happy-number
0203-remove-linked-list-elements		0203-remove-linked-list-elements
0205-isomorphic-strings		0205-isomorphic-strings
0206-reverse-linked-list		0206-reverse-linked-list
0215-kth-largest-element-in-an-array		0215-kth-largest-element-in-an-array
0217-contains-duplicate		0217-contains-duplicate
0222-count-complete-tree-nodes		0222-count-complete-tree-nodes
0225-implement-stack-using-queues		0225-implement-stack-using-queues
0226-invert-binary-tree		0226-invert-binary-tree
0228-summary-ranges		0228-summary-ranges
0229-majority-element-ii		0229-majority-element-ii
0230-kth-smallest-element-in-a-bst		0230-kth-smallest-element-in-a-bst
0232-implement-queue-using-stacks		0232-implement-queue-using-stacks
0234-palindrome-linked-list		0234-palindrome-linked-list
0235-lowest-common-ancestor-of-a-binary-search-tree		0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree		0236-lowest-common-ancestor-of-a-binary-tree
0237-delete-node-in-a-linked-list		0237-delete-node-in-a-linked-list
0238-product-of-array-except-self		0238-product-of-array-except-self
0242-valid-anagram		0242-valid-anagram
0257-binary-tree-paths		0257-binary-tree-paths
0258-add-digits		0258-add-digits
0268-missing-number		0268-missing-number

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Repository files navigation

LeetCode Topics

Array

Hash Table

Dynamic Programming

Matrix

String

Stack

Two Pointers

String Matching

Bit Manipulation

Queue

Counting

Binary Search

Sorting

About

Uh oh!

Languages

ankan24/LeetCode-Solutions

Folders and files

Latest commit

History

Repository files navigation

LeetCode Topics

Array

Hash Table

Dynamic Programming

Matrix

String

Stack

Two Pointers

String Matching

Bit Manipulation

Queue

Counting

Binary Search

Sorting

About

Topics

Resources

Uh oh!

Stars

Watchers

Forks

Languages