A collection of LeetCode questions to ace the coding interview! - Created using LeetHub v2

LeetCode Topics

String

0003-longest-substring-without-repeating-characters
0005-longest-palindromic-substring
0017-letter-combinations-of-a-phone-number
0022-generate-parentheses
0125-valid-palindrome
0131-palindrome-partitioning
0151-reverse-words-in-a-string
0242-valid-anagram
0257-binary-tree-paths
0392-is-subsequence
0438-find-all-anagrams-in-a-string
0443-string-compression
1146-greatest-common-divisor-of-strings
1567-maximum-number-of-vowels-in-a-substring-of-given-length
1777-determine-if-two-strings-are-close
2470-removing-stars-from-a-string

Dynamic Programming

0005-longest-palindromic-substring
0022-generate-parentheses
0121-best-time-to-buy-and-sell-stock
0131-palindrome-partitioning
0392-is-subsequence
1586-longest-subarray-of-1s-after-deleting-one-element

Backtracking

0017-letter-combinations-of-a-phone-number
0022-generate-parentheses
0131-palindrome-partitioning
0257-binary-tree-paths

Database

0584-find-customer-referee
0595-big-countries
1258-article-views-i

Tree

0094-binary-tree-inorder-traversal
0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0107-binary-tree-level-order-traversal-ii
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0116-populating-next-right-pointers-in-each-node
0129-sum-root-to-leaf-numbers
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0250-count-univalue-subtrees
0257-binary-tree-paths
0270-closest-binary-search-tree-value
0285-inorder-successor-in-bst
0366-find-leaves-of-binary-tree
0404-sum-of-left-leaves
0501-find-mode-in-binary-search-tree
0530-minimum-absolute-difference-in-bst
0637-average-of-levels-in-binary-tree
0653-two-sum-iv-input-is-a-bst
0671-second-minimum-node-in-a-binary-tree
0774-maximum-depth-of-n-ary-tree
0775-n-ary-tree-preorder-traversal
0776-n-ary-tree-postorder-traversal
0783-search-in-a-binary-search-tree
0799-minimum-distance-between-bst-nodes
0904-leaf-similar-trees
0975-range-sum-of-bst
1005-univalued-binary-tree
1035-cousins-in-binary-tree
1079-sum-of-root-to-leaf-binary-numbers
1114-binary-search-tree-to-greater-sum-tree
1116-maximum-level-sum-of-a-binary-tree
1243-sum-of-nodes-with-even-valued-grandparent
1254-deepest-leaves-sum
1450-delete-leaves-with-a-given-value
1498-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
1544-count-good-nodes-in-binary-tree
1609-find-all-the-lonely-nodes
1883-find-distance-in-a-binary-tree
2126-count-nodes-equal-to-sum-of-descendants
2347-count-nodes-equal-to-average-of-subtree
2493-reverse-odd-levels-of-binary-tree

Depth-First Search

0094-binary-tree-inorder-traversal
0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0116-populating-next-right-pointers-in-each-node
0129-sum-root-to-leaf-numbers
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0250-count-univalue-subtrees
0257-binary-tree-paths
0270-closest-binary-search-tree-value
0285-inorder-successor-in-bst
0366-find-leaves-of-binary-tree
0404-sum-of-left-leaves
0501-find-mode-in-binary-search-tree
0530-minimum-absolute-difference-in-bst
0637-average-of-levels-in-binary-tree
0653-two-sum-iv-input-is-a-bst
0671-second-minimum-node-in-a-binary-tree
0774-maximum-depth-of-n-ary-tree
0775-n-ary-tree-preorder-traversal
0776-n-ary-tree-postorder-traversal
0799-minimum-distance-between-bst-nodes
0904-leaf-similar-trees
0975-range-sum-of-bst
1005-univalued-binary-tree
1035-cousins-in-binary-tree
1079-sum-of-root-to-leaf-binary-numbers
1114-binary-search-tree-to-greater-sum-tree
1116-maximum-level-sum-of-a-binary-tree
1243-sum-of-nodes-with-even-valued-grandparent
1254-deepest-leaves-sum
1450-delete-leaves-with-a-given-value
1498-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
1544-count-good-nodes-in-binary-tree
1609-find-all-the-lonely-nodes
1883-find-distance-in-a-binary-tree
2126-count-nodes-equal-to-sum-of-descendants
2347-count-nodes-equal-to-average-of-subtree
2493-reverse-odd-levels-of-binary-tree

Breadth-First Search

0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0107-binary-tree-level-order-traversal-ii
0111-minimum-depth-of-binary-tree
0112-path-sum
0116-populating-next-right-pointers-in-each-node
0199-binary-tree-right-side-view
0226-invert-binary-tree
0404-sum-of-left-leaves
0530-minimum-absolute-difference-in-bst
0637-average-of-levels-in-binary-tree
0653-two-sum-iv-input-is-a-bst
0774-maximum-depth-of-n-ary-tree
0799-minimum-distance-between-bst-nodes
1005-univalued-binary-tree
1035-cousins-in-binary-tree
1116-maximum-level-sum-of-a-binary-tree
1243-sum-of-nodes-with-even-valued-grandparent
1254-deepest-leaves-sum
1498-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
1544-count-good-nodes-in-binary-tree
1609-find-all-the-lonely-nodes
1883-find-distance-in-a-binary-tree
2493-reverse-odd-levels-of-binary-tree

Binary Tree

0094-binary-tree-inorder-traversal
0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0107-binary-tree-level-order-traversal-ii
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0116-populating-next-right-pointers-in-each-node
0129-sum-root-to-leaf-numbers
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0250-count-univalue-subtrees
0257-binary-tree-paths
0270-closest-binary-search-tree-value
0285-inorder-successor-in-bst
0366-find-leaves-of-binary-tree
0404-sum-of-left-leaves
0501-find-mode-in-binary-search-tree
0530-minimum-absolute-difference-in-bst
0637-average-of-levels-in-binary-tree
0653-two-sum-iv-input-is-a-bst
0671-second-minimum-node-in-a-binary-tree
0783-search-in-a-binary-search-tree
0799-minimum-distance-between-bst-nodes
0904-leaf-similar-trees
0975-range-sum-of-bst
1005-univalued-binary-tree
1035-cousins-in-binary-tree
1079-sum-of-root-to-leaf-binary-numbers
1114-binary-search-tree-to-greater-sum-tree
1116-maximum-level-sum-of-a-binary-tree
1243-sum-of-nodes-with-even-valued-grandparent
1254-deepest-leaves-sum
1450-delete-leaves-with-a-given-value
1498-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree
1544-count-good-nodes-in-binary-tree
1609-find-all-the-lonely-nodes
1883-find-distance-in-a-binary-tree
2126-count-nodes-equal-to-sum-of-descendants
2347-count-nodes-equal-to-average-of-subtree
2493-reverse-odd-levels-of-binary-tree

Array

0001-two-sum
0011-container-with-most-water
0015-3sum
0026-remove-duplicates-from-sorted-array
0035-search-insert-position
0121-best-time-to-buy-and-sell-stock
0162-find-peak-element
0167-two-sum-ii-input-array-is-sorted
0215-kth-largest-element-in-an-array
0217-contains-duplicate
0238-product-of-array-except-self
0268-missing-number
0283-move-zeroes
0334-increasing-triplet-subsequence
0347-top-k-frequent-elements
0349-intersection-of-two-arrays
0643-maximum-average-subarray-i
0735-asteroid-collision
0907-koko-eating-bananas
1014-k-closest-points-to-origin
1046-max-consecutive-ones-iii
1066-fixed-point
1319-unique-number-of-occurrences
1392-find-the-difference-of-two-arrays
1528-kids-with-the-greatest-number-of-candies
1586-longest-subarray-of-1s-after-deleting-one-element
1603-running-sum-of-1d-array
1798-max-number-of-k-sum-pairs
2392-successful-pairs-of-spells-and-potions
3869-smallest-index-with-digit-sum-equal-to-index

Hash Table

0001-two-sum
0003-longest-substring-without-repeating-characters
0017-letter-combinations-of-a-phone-number
0217-contains-duplicate
0242-valid-anagram
0268-missing-number
0347-top-k-frequent-elements
0349-intersection-of-two-arrays
0438-find-all-anagrams-in-a-string
0653-two-sum-iv-input-is-a-bst
1319-unique-number-of-occurrences
1392-find-the-difference-of-two-arrays
1777-determine-if-two-strings-are-close
1798-max-number-of-k-sum-pairs
1883-find-distance-in-a-binary-tree
2413-smallest-number-in-infinite-set

Prefix Sum

0238-product-of-array-except-self
1046-max-consecutive-ones-iii
1603-running-sum-of-1d-array

Sorting

0015-3sum
0215-kth-largest-element-in-an-array
0217-contains-duplicate
0242-valid-anagram
0268-missing-number
0347-top-k-frequent-elements
0349-intersection-of-two-arrays
1014-k-closest-points-to-origin
1777-determine-if-two-strings-are-close
1798-max-number-of-k-sum-pairs
2392-successful-pairs-of-spells-and-potions

Binary Search

0035-search-insert-position
0162-find-peak-element
0167-two-sum-ii-input-array-is-sorted
0268-missing-number
0270-closest-binary-search-tree-value
0278-first-bad-version
0349-intersection-of-two-arrays
0374-guess-number-higher-or-lower
0907-koko-eating-bananas
1046-max-consecutive-ones-iii
1066-fixed-point
2392-successful-pairs-of-spells-and-potions

Interactive

0278-first-bad-version
0374-guess-number-higher-or-lower

Math

0007-reverse-integer
0268-missing-number
1014-k-closest-points-to-origin
1146-greatest-common-divisor-of-strings
3869-smallest-index-with-digit-sum-equal-to-index

Bit Manipulation

0268-missing-number

Two Pointers

0005-longest-palindromic-substring
0011-container-with-most-water
0015-3sum
0026-remove-duplicates-from-sorted-array
0125-valid-palindrome
0151-reverse-words-in-a-string
0167-two-sum-ii-input-array-is-sorted
0283-move-zeroes
0349-intersection-of-two-arrays
0392-is-subsequence
0443-string-compression
0653-two-sum-iv-input-is-a-bst
0908-middle-of-the-linked-list
1798-max-number-of-k-sum-pairs
2392-successful-pairs-of-spells-and-potions

Linked List

0116-populating-next-right-pointers-in-each-node
0908-middle-of-the-linked-list

Greedy

0011-container-with-most-water
0334-increasing-triplet-subsequence

Sliding Window

0003-longest-substring-without-repeating-characters
0438-find-all-anagrams-in-a-string
0643-maximum-average-subarray-i
1046-max-consecutive-ones-iii
1567-maximum-number-of-vowels-in-a-substring-of-given-length
1586-longest-subarray-of-1s-after-deleting-one-element

Divide and Conquer

0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements
1014-k-closest-points-to-origin

Heap (Priority Queue)

0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements
1014-k-closest-points-to-origin
2413-smallest-number-in-infinite-set

Bucket Sort

0347-top-k-frequent-elements

Counting

0347-top-k-frequent-elements
1777-determine-if-two-strings-are-close

Quickselect

0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements
1014-k-closest-points-to-origin

Stack

0094-binary-tree-inorder-traversal
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0735-asteroid-collision
0775-n-ary-tree-preorder-traversal
0776-n-ary-tree-postorder-traversal
2470-removing-stars-from-a-string

Simulation

0735-asteroid-collision
2470-removing-stars-from-a-string

Design

0969-number-of-recent-calls
2413-smallest-number-in-infinite-set

Queue

0969-number-of-recent-calls

Data Stream

0969-number-of-recent-calls

Binary Search Tree

0230-kth-smallest-element-in-a-bst
0270-closest-binary-search-tree-value
0285-inorder-successor-in-bst
0501-find-mode-in-binary-search-tree
0530-minimum-absolute-difference-in-bst
0653-two-sum-iv-input-is-a-bst
0783-search-in-a-binary-search-tree
0799-minimum-distance-between-bst-nodes
0975-range-sum-of-bst
1114-binary-search-tree-to-greater-sum-tree

Geometry

1014-k-closest-points-to-origin

Ordered Set

2413-smallest-number-in-infinite-set