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

LeetCode Topics

Linked List

0002-add-two-numbers
0019-remove-nth-node-from-end-of-list
0021-merge-two-sorted-lists
0023-merge-k-sorted-lists
0024-swap-nodes-in-pairs
0083-remove-duplicates-from-sorted-list
0109-convert-sorted-list-to-binary-search-tree
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0141-linked-list-cycle
0142-linked-list-cycle-ii
0143-reorder-list
0146-lru-cache
0147-insertion-sort-list
0148-sort-list
0160-intersection-of-two-linked-lists
0203-remove-linked-list-elements
0206-reverse-linked-list
0234-palindrome-linked-list
0237-delete-node-in-a-linked-list
0328-odd-even-linked-list
0725-split-linked-list-in-parts
0817-design-hashmap
0908-middle-of-the-linked-list
1411-convert-binary-number-in-a-linked-list-to-integer
1484-linked-list-in-binary-tree
2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points
2216-delete-the-middle-node-of-a-linked-list
2299-merge-nodes-in-between-zeros
2903-insert-greatest-common-divisors-in-linked-list

Divide and Conquer

0023-merge-k-sorted-lists
0053-maximum-subarray
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0148-sort-list
0215-kth-largest-element-in-an-array
0240-search-a-2d-matrix-ii
0347-top-k-frequent-elements
0654-maximum-binary-tree
0948-sort-an-array
1014-k-closest-points-to-origin
2113-find-the-kth-largest-integer-in-the-array

Heap (Priority Queue)

0023-merge-k-sorted-lists
0215-kth-largest-element-in-an-array
0239-sliding-window-maximum
0295-find-median-from-data-stream
0347-top-k-frequent-elements
0451-sort-characters-by-frequency
0506-relative-ranks
0658-find-k-closest-elements
0692-top-k-frequent-words
0744-network-delay-time
0802-k-th-smallest-prime-fraction
0803-cheapest-flights-within-k-stops
0948-sort-an-array
1014-k-closest-points-to-origin
1127-last-stone-weight
1463-the-k-weakest-rows-in-a-matrix
1478-maximum-number-of-events-that-can-be-attended
1574-maximum-product-of-two-elements-in-an-array
2094-remove-stones-to-minimize-the-total
2113-find-the-kth-largest-integer-in-the-array
2204-find-subsequence-of-length-k-with-the-largest-sum
2695-find-score-of-an-array-after-marking-all-elements
3226-minimum-number-game
3332-minimum-operations-to-exceed-threshold-value-ii

Merge Sort

0023-merge-k-sorted-lists
0148-sort-list
0948-sort-an-array

Recursion

0002-add-two-numbers
0021-merge-two-sorted-lists
0024-swap-nodes-in-pairs
0050-powx-n
0143-reorder-list
0203-remove-linked-list-elements
0206-reverse-linked-list
0231-power-of-two
0234-palindrome-linked-list
0326-power-of-three
0342-power-of-four
1951-find-the-winner-of-the-circular-game
3600-find-the-k-th-character-in-string-game-i
3601-find-the-k-th-character-in-string-game-ii

Stack

0020-valid-parentheses
0042-trapping-rain-water
0094-binary-tree-inorder-traversal
0114-flatten-binary-tree-to-linked-list
0143-reorder-list
0145-binary-tree-postorder-traversal
0150-evaluate-reverse-polish-notation
0225-implement-stack-using-queues
0234-palindrome-linked-list
0654-maximum-binary-tree
0682-baseball-game
0735-asteroid-collision
0739-daily-temperatures
0775-n-ary-tree-preorder-traversal
0776-n-ary-tree-postorder-traversal
0874-backspace-string-compare
0933-increasing-order-search-tree
1078-remove-outermost-parentheses
1128-remove-all-adjacent-duplicates-in-string
1298-reverse-substrings-between-each-pair-of-parentheses
1497-design-a-stack-with-increment-operation
1720-crawler-log-folder
1818-maximum-score-from-removing-substrings
2021-remove-all-occurrences-of-a-substring
2221-check-if-a-parentheses-string-can-be-valid
2520-using-a-robot-to-print-the-lexicographically-smallest-string
2846-robot-collisions
3447-clear-digits

Tree

0094-binary-tree-inorder-traversal
0096-unique-binary-search-trees
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0107-binary-tree-level-order-traversal-ii
0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0129-sum-root-to-leaf-numbers
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0404-sum-of-left-leaves
0437-path-sum-iii
0513-find-bottom-left-tree-value
0515-find-largest-value-in-each-tree-row
0543-diameter-of-binary-tree
0572-subtree-of-another-tree
0617-merge-two-binary-trees
0623-add-one-row-to-tree
0637-average-of-levels-in-binary-tree
0653-two-sum-iv-input-is-a-bst
0654-maximum-binary-tree
0764-n-ary-tree-level-order-traversal
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
0784-insert-into-a-binary-search-tree
0893-all-nodes-distance-k-in-binary-tree
0904-leaf-similar-trees
0933-increasing-order-search-tree
0975-range-sum-of-bst
0988-flip-equivalent-binary-trees
1005-univalued-binary-tree
1029-vertical-order-traversal-of-a-binary-tree
1030-smallest-string-starting-from-leaf
1079-sum-of-root-to-leaf-binary-numbers
1116-maximum-level-sum-of-a-binary-tree
1254-deepest-leaves-sum
1427-all-elements-in-two-binary-search-trees
1450-delete-leaves-with-a-given-value
1484-linked-list-in-binary-tree
1731-even-odd-tree
2384-root-equals-sum-of-children
2416-evaluate-boolean-binary-tree
2646-kth-largest-sum-in-a-binary-tree
2677-cousins-in-binary-tree-ii

Depth-First Search

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
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
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0129-sum-root-to-leaf-numbers
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0207-course-schedule
0210-course-schedule-ii
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0386-lexicographical-numbers
0404-sum-of-left-leaves
0437-path-sum-iii
0463-island-perimeter
0513-find-bottom-left-tree-value
0515-find-largest-value-in-each-tree-row
0543-diameter-of-binary-tree
0547-number-of-provinces
0572-subtree-of-another-tree
0617-merge-two-binary-trees
0623-add-one-row-to-tree
0637-average-of-levels-in-binary-tree
0653-two-sum-iv-input-is-a-bst
0684-redundant-connection
0733-flood-fill
0744-network-delay-time
0774-maximum-depth-of-n-ary-tree
0775-n-ary-tree-preorder-traversal
0776-n-ary-tree-postorder-traversal
0801-is-graph-bipartite
0803-cheapest-flights-within-k-stops
0813-all-paths-from-source-to-target
0871-keys-and-rooms
0893-all-nodes-distance-k-in-binary-tree
0904-leaf-similar-trees
0933-increasing-order-search-tree
0975-range-sum-of-bst
0988-flip-equivalent-binary-trees
1005-univalued-binary-tree
1029-vertical-order-traversal-of-a-binary-tree
1030-smallest-string-starting-from-leaf
1079-sum-of-root-to-leaf-binary-numbers
1116-maximum-level-sum-of-a-binary-tree
1254-deepest-leaves-sum
1350-remove-sub-folders-from-the-filesystem
1427-all-elements-in-two-binary-search-trees
1442-number-of-operations-to-make-network-connected
1450-delete-leaves-with-a-given-value
1484-linked-list-in-binary-tree
2121-find-if-path-exists-in-graph
2416-evaluate-boolean-binary-tree
2439-longest-cycle-in-a-graph
2677-cousins-in-binary-tree-ii
2793-count-the-number-of-complete-components

Binary Tree

0094-binary-tree-inorder-traversal
0096-unique-binary-search-trees
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0107-binary-tree-level-order-traversal-ii
0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0129-sum-root-to-leaf-numbers
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0404-sum-of-left-leaves
0437-path-sum-iii
0513-find-bottom-left-tree-value
0515-find-largest-value-in-each-tree-row
0543-diameter-of-binary-tree
0572-subtree-of-another-tree
0617-merge-two-binary-trees
0623-add-one-row-to-tree
0637-average-of-levels-in-binary-tree
0653-two-sum-iv-input-is-a-bst
0654-maximum-binary-tree
0783-search-in-a-binary-search-tree
0784-insert-into-a-binary-search-tree
0893-all-nodes-distance-k-in-binary-tree
0904-leaf-similar-trees
0933-increasing-order-search-tree
0975-range-sum-of-bst
0988-flip-equivalent-binary-trees
1005-univalued-binary-tree
1029-vertical-order-traversal-of-a-binary-tree
1030-smallest-string-starting-from-leaf
1079-sum-of-root-to-leaf-binary-numbers
1116-maximum-level-sum-of-a-binary-tree
1254-deepest-leaves-sum
1427-all-elements-in-two-binary-search-trees
1450-delete-leaves-with-a-given-value
1484-linked-list-in-binary-tree
1731-even-odd-tree
2384-root-equals-sum-of-children
2416-evaluate-boolean-binary-tree
2646-kth-largest-sum-in-a-binary-tree
2677-cousins-in-binary-tree-ii

Breadth-First Search

0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-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
0117-populating-next-right-pointers-in-each-node-ii
0199-binary-tree-right-side-view
0207-course-schedule
0210-course-schedule-ii
0226-invert-binary-tree
0322-coin-change
0404-sum-of-left-leaves
0463-island-perimeter
0513-find-bottom-left-tree-value
0515-find-largest-value-in-each-tree-row
0542-01-matrix
0547-number-of-provinces
0617-merge-two-binary-trees
0623-add-one-row-to-tree
0637-average-of-levels-in-binary-tree
0653-two-sum-iv-input-is-a-bst
0684-redundant-connection
0733-flood-fill
0744-network-delay-time
0764-n-ary-tree-level-order-traversal
0774-maximum-depth-of-n-ary-tree
0801-is-graph-bipartite
0803-cheapest-flights-within-k-stops
0813-all-paths-from-source-to-target
0871-keys-and-rooms
0893-all-nodes-distance-k-in-binary-tree
1005-univalued-binary-tree
1029-vertical-order-traversal-of-a-binary-tree
1116-maximum-level-sum-of-a-binary-tree
1254-deepest-leaves-sum
1424-maximum-candies-you-can-get-from-boxes
1442-number-of-operations-to-make-network-connected
1484-linked-list-in-binary-tree
1731-even-odd-tree
2121-find-if-path-exists-in-graph
2646-kth-largest-sum-in-a-binary-tree
2677-cousins-in-binary-tree-ii
2793-count-the-number-of-complete-components
3517-shortest-distance-after-road-addition-queries-i

Array

0001-two-sum
0011-container-with-most-water
0015-3sum
0016-3sum-closest
0026-remove-duplicates-from-sorted-array
0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0040-combination-sum-ii
0041-first-missing-positive
0042-trapping-rain-water
0045-jump-game-ii
0046-permutations
0049-group-anagrams
0053-maximum-subarray
0055-jump-game
0063-unique-paths-ii
0064-minimum-path-sum
0073-set-matrix-zeroes
0088-merge-sorted-array
0090-subsets-ii
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0118-pascals-triangle
0120-triangle
0121-best-time-to-buy-and-sell-stock
0128-longest-consecutive-sequence
0134-gas-station
0135-candy
0136-single-number
0150-evaluate-reverse-polish-notation
0152-maximum-product-subarray
0162-find-peak-element
0164-maximum-gap
0167-two-sum-ii-input-array-is-sorted
0189-rotate-array
0198-house-robber
0213-house-robber-ii
0215-kth-largest-element-in-an-array
0217-contains-duplicate
0219-contains-duplicate-ii
0220-contains-duplicate-iii
0229-majority-element-ii
0239-sliding-window-maximum
0240-search-a-2d-matrix-ii
0283-move-zeroes
0300-longest-increasing-subsequence
0322-coin-change
0347-top-k-frequent-elements
0349-intersection-of-two-arrays
0350-intersection-of-two-arrays-ii
0377-combination-sum-iv
0380-insert-delete-getrandom-o1
0463-island-perimeter
0491-non-decreasing-subsequences
0494-target-sum
0506-relative-ranks
0518-coin-change-ii
0523-continuous-subarray-sum
0532-k-diff-pairs-in-an-array
0542-01-matrix
0560-subarray-sum-equals-k
0594-longest-harmonious-subsequence
0654-maximum-binary-tree
0658-find-k-closest-elements
0673-number-of-longest-increasing-subsequence
0682-baseball-game
0689-maximum-sum-of-3-non-overlapping-subarrays
0733-flood-fill
0735-asteroid-collision
0739-daily-temperatures
0747-min-cost-climbing-stairs
0792-binary-search
0802-k-th-smallest-prime-fraction
0817-design-hashmap
0882-peak-index-in-a-mountain-array
0890-lemonade-change
0909-stone-game
0917-boats-to-save-people
0941-sort-array-by-parity
0948-sort-an-array
0967-minimum-falling-path-sum
1014-k-closest-points-to-origin
1016-subarray-sums-divisible-by-k
1039-find-the-town-judge
1105-uncrossed-lines
1127-last-stone-weight
1137-height-checker
1231-replace-elements-with-greatest-element-on-right-side
1293-three-consecutive-odds
1346-maximize-the-topmost-element-after-k-moves
1350-remove-sub-folders-from-the-filesystem
1388-greatest-sum-divisible-by-three
1424-maximum-candies-you-can-get-from-boxes
1463-the-k-weakest-rows-in-a-matrix
1468-check-if-n-and-its-double-exist
1478-maximum-number-of-events-that-can-be-attended
1487-cinema-seat-allocation
1497-design-a-stack-with-increment-operation
1510-find-lucky-integer-in-an-array
1511-count-number-of-teams
1524-string-matching-in-an-array
1574-maximum-product-of-two-elements-in-an-array
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves
1720-crawler-log-folder
1741-sort-array-by-increasing-frequency
1755-defuse-the-bomb
1786-count-the-number-of-consistent-strings
1798-max-number-of-k-sum-pairs
1803-average-waiting-time
1851-maximum-number-of-events-that-can-be-attended-ii
1878-check-if-array-is-sorted-and-rotated
1951-find-the-winner-of-the-circular-game
1963-find-xor-sum-of-all-pairs-bitwise-and
2026-merge-triplets-to-form-target-triplet
2094-remove-stones-to-minimize-the-total
2107-find-unique-binary-string
2113-find-the-kth-largest-integer-in-the-array
2132-convert-1d-array-into-2d-array
2144-maximum-difference-between-increasing-elements
2150-kth-smallest-product-of-two-sorted-arrays
2204-find-subsequence-of-length-k-with-the-largest-sum
2292-counting-words-with-a-given-prefix
2308-divide-array-into-equal-pairs
2320-find-all-k-distant-indices-in-an-array
2350-find-closest-number-to-zero
2358-number-of-ways-to-split-array
2387-partition-array-such-that-maximum-difference-is-k
2448-count-number-of-bad-pairs
2502-sort-the-people
2551-apply-operations-to-an-array
2614-maximum-count-of-positive-integer-and-negative-integer
2640-maximum-number-of-integers-to-choose-from-a-range-i
2695-find-score-of-an-array-after-marking-all-elements
2727-number-of-senior-citizens
2756-buy-two-chocolates
2766-find-the-prefix-common-array-of-two-arrays
2792-neighboring-bitwise-xor
2846-robot-collisions
3219-make-lexicographically-smallest-array-by-swapping-elements
3226-minimum-number-game
3242-count-elements-with-maximum-frequency
3309-count-prefix-and-suffix-pairs-i
3332-minimum-operations-to-exceed-threshold-value-ii
3373-maximum-prime-difference
3476-find-minimum-operations-to-make-all-elements-divisible-by-three
3490-find-the-maximum-length-of-valid-subsequence-i
3517-shortest-distance-after-road-addition-queries-i
3685-count-subarrays-of-length-three-with-a-condition
3741-reschedule-meetings-for-maximum-free-time-ii
3747-maximum-difference-between-adjacent-elements-in-a-circular-array

Sorting

0015-3sum
0016-3sum-closest
0049-group-anagrams
0088-merge-sorted-array
0147-insertion-sort-list
0148-sort-list
0164-maximum-gap
0215-kth-largest-element-in-an-array
0217-contains-duplicate
0220-contains-duplicate-iii
0229-majority-element-ii
0242-valid-anagram
0295-find-median-from-data-stream
0347-top-k-frequent-elements
0349-intersection-of-two-arrays
0350-intersection-of-two-arrays-ii
0389-find-the-difference
0451-sort-characters-by-frequency
0506-relative-ranks
0532-k-diff-pairs-in-an-array
0594-longest-harmonious-subsequence
0658-find-k-closest-elements
0692-top-k-frequent-words
0802-k-th-smallest-prime-fraction
0917-boats-to-save-people
0941-sort-array-by-parity
0948-sort-an-array
1014-k-closest-points-to-origin
1029-vertical-order-traversal-of-a-binary-tree
1137-height-checker
1388-greatest-sum-divisible-by-three
1427-all-elements-in-two-binary-search-trees
1463-the-k-weakest-rows-in-a-matrix
1468-check-if-n-and-its-double-exist
1478-maximum-number-of-events-that-can-be-attended
1574-maximum-product-of-two-elements-in-an-array
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves
1741-sort-array-by-increasing-frequency
1798-max-number-of-k-sum-pairs
1851-maximum-number-of-events-that-can-be-attended-ii
2113-find-the-kth-largest-integer-in-the-array
2204-find-subsequence-of-length-k-with-the-largest-sum
2387-partition-array-such-that-maximum-difference-is-k
2502-sort-the-people
2640-maximum-number-of-integers-to-choose-from-a-range-i
2646-kth-largest-sum-in-a-binary-tree
2695-find-score-of-an-array-after-marking-all-elements
2756-buy-two-chocolates
2846-robot-collisions
3219-make-lexicographically-smallest-array-by-swapping-elements
3226-minimum-number-game
3360-minimum-deletions-to-make-string-k-special

Quickselect

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

String

0005-longest-palindromic-substring
0014-longest-common-prefix
0017-letter-combinations-of-a-phone-number
0020-valid-parentheses
0028-find-the-index-of-the-first-occurrence-in-a-string
0030-substring-with-concatenation-of-all-words
0043-multiply-strings
0049-group-anagrams
0072-edit-distance
0091-decode-ways
0093-restore-ip-addresses
0115-distinct-subsequences
0125-valid-palindrome
0208-implement-trie-prefix-tree
0242-valid-anagram
0257-binary-tree-paths
0290-word-pattern
0299-bulls-and-cows
0344-reverse-string
0345-reverse-vowels-of-a-string
0383-ransom-note
0387-first-unique-character-in-a-string
0389-find-the-difference
0392-is-subsequence
0438-find-all-anagrams-in-a-string
0451-sort-characters-by-frequency
0520-detect-capital
0541-reverse-string-ii
0567-permutation-in-string
0583-delete-operation-for-two-strings
0692-top-k-frequent-words
0742-to-lower-case
0782-jewels-and-stones
0874-backspace-string-compare
0953-reverse-only-letters
0961-long-pressed-name
1030-smallest-string-starting-from-leaf
1078-remove-outermost-parentheses
1128-remove-all-adjacent-duplicates-in-string
1250-longest-common-subsequence
1298-reverse-substrings-between-each-pair-of-parentheses
1350-remove-sub-folders-from-the-filesystem
1502-construct-k-palindrome-strings
1524-string-matching-in-an-array
1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence
1720-crawler-log-folder
1786-count-the-number-of-consistent-strings
1818-maximum-score-from-removing-substrings
2021-remove-all-occurrences-of-a-substring
2107-find-unique-binary-string
2113-find-the-kth-largest-integer-in-the-array
2140-longest-subsequence-repeated-k-times
2221-check-if-a-parentheses-string-can-be-valid
2260-divide-a-string-into-groups-of-size-k
2292-counting-words-with-a-given-prefix
2395-longest-binary-subsequence-less-than-or-equal-to-k
2502-sort-the-people
2520-using-a-robot-to-print-the-lexicographically-smallest-string
2727-number-of-senior-citizens
2816-lexicographically-smallest-palindrome
3267-find-longest-special-substring-that-occurs-thrice-i
3309-count-prefix-and-suffix-pairs-i
3349-maximum-length-substring-with-two-occurrences
3360-minimum-deletions-to-make-string-k-special
3447-clear-digits
3455-minimum-length-of-string-after-operations
3617-find-the-original-typed-string-i
3618-find-the-original-typed-string-ii
3753-maximum-difference-between-even-and-odd-frequency-i
3754-maximum-manhattan-distance-after-k-changes
3761-maximum-difference-between-even-and-odd-frequency-ii

Simulation

0043-multiply-strings
0682-baseball-game
0735-asteroid-collision
0874-backspace-string-compare
1803-average-waiting-time
1951-find-the-winner-of-the-circular-game
2021-remove-all-occurrences-of-a-substring
2132-convert-1d-array-into-2d-array
2260-divide-a-string-into-groups-of-size-k
2278-find-three-consecutive-integers-that-sum-to-a-given-number
2299-merge-nodes-in-between-zeros
2551-apply-operations-to-an-array
2645-pass-the-pillow
2695-find-score-of-an-array-after-marking-all-elements
2846-robot-collisions
3226-minimum-number-game
3332-minimum-operations-to-exceed-threshold-value-ii
3447-clear-digits
3600-find-the-k-th-character-in-string-game-i

Math

0002-add-two-numbers
0007-reverse-integer
0043-multiply-strings
0050-powx-n
0062-unique-paths
0070-climbing-stairs
0096-unique-binary-search-trees
0150-evaluate-reverse-polish-notation
0172-factorial-trailing-zeroes
0189-rotate-array
0231-power-of-two
0263-ugly-number
0326-power-of-three
0342-power-of-four
0367-valid-perfect-square
0371-sum-of-two-integers
0380-insert-delete-getrandom-o1
0398-random-pick-index
0523-continuous-subarray-sum
0909-stone-game
1014-k-closest-points-to-origin
1236-n-th-tribonacci-number
1411-convert-binary-number-in-a-linked-list-to-integer
1529-max-difference-you-can-get-from-changing-an-integer
1889-check-if-number-is-a-sum-of-powers-of-three
1951-find-the-winner-of-the-circular-game
1963-find-xor-sum-of-all-pairs-bitwise-and
2202-sum-of-k-mirror-numbers
2278-find-three-consecutive-integers-that-sum-to-a-given-number
2448-count-number-of-bad-pairs
2645-pass-the-pillow
2704-maximum-difference-by-remapping-a-digit
2903-insert-greatest-common-divisors-in-linked-list
2998-count-symmetric-integers
3201-distribute-candies-among-children-ii
3373-maximum-prime-difference
3476-find-minimum-operations-to-make-all-elements-divisible-by-three
3600-find-the-k-th-character-in-string-game-i
3601-find-the-k-th-character-in-string-game-ii
3682-count-the-number-of-arrays-with-k-matching-adjacent-elements
3754-maximum-manhattan-distance-after-k-changes

Binary Search Tree

0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0096-unique-binary-search-trees
0098-validate-binary-search-tree
0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0162-find-peak-element
0167-two-sum-ii-input-array-is-sorted
0222-count-complete-tree-nodes
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0240-search-a-2d-matrix-ii
0300-longest-increasing-subsequence
0349-intersection-of-two-arrays
0350-intersection-of-two-arrays-ii
0367-valid-perfect-square
0374-guess-number-higher-or-lower
0532-k-diff-pairs-in-an-array
0653-two-sum-iv-input-is-a-bst
0658-find-k-closest-elements
0783-search-in-a-binary-search-tree
0784-insert-into-a-binary-search-tree
0792-binary-search
0802-k-th-smallest-prime-fraction
0882-peak-index-in-a-mountain-array
0933-increasing-order-search-tree
0975-range-sum-of-bst
1427-all-elements-in-two-binary-search-trees
1463-the-k-weakest-rows-in-a-matrix
1468-check-if-n-and-its-double-exist
1851-maximum-number-of-events-that-can-be-attended-ii
2150-kth-smallest-product-of-two-sorted-arrays
2614-maximum-count-of-positive-integer-and-negative-integer
2640-maximum-number-of-integers-to-choose-from-a-range-i
3267-find-longest-special-substring-that-occurs-thrice-i

Queue

0225-implement-stack-using-queues
0239-sliding-window-maximum
0387-first-unique-character-in-a-string
1951-find-the-winner-of-the-circular-game

Backtracking

0017-letter-combinations-of-a-phone-number
0040-combination-sum-ii
0046-permutations
0052-n-queens-ii
0090-subsets-ii
0093-restore-ip-addresses
0113-path-sum-ii
0257-binary-tree-paths
0491-non-decreasing-subsequences
0494-target-sum
0813-all-paths-from-source-to-target
1030-smallest-string-starting-from-leaf
2107-find-unique-binary-string
2140-longest-subsequence-repeated-k-times

Bit Manipulation

0090-subsets-ii
0136-single-number
0222-count-complete-tree-nodes
0231-power-of-two
0338-counting-bits
0342-power-of-four
0371-sum-of-two-integers
0389-find-the-difference
0397-integer-replacement
0476-number-complement
0491-non-decreasing-subsequences
1054-complement-of-base-10-integer
1487-cinema-seat-allocation
1786-count-the-number-of-consistent-strings
1963-find-xor-sum-of-all-pairs-bitwise-and
2308-divide-array-into-equal-pairs
2766-find-the-prefix-common-array-of-two-arrays
2792-neighboring-bitwise-xor
3600-find-the-k-th-character-in-string-game-i
3601-find-the-k-th-character-in-string-game-ii

Greedy

0011-container-with-most-water
0045-jump-game-ii
0055-jump-game
0134-gas-station
0135-candy
0397-integer-replacement
0890-lemonade-change
0917-boats-to-save-people
1346-maximize-the-topmost-element-after-k-moves
1388-greatest-sum-divisible-by-three
1478-maximum-number-of-events-that-can-be-attended
1487-cinema-seat-allocation
1502-construct-k-palindrome-strings
1529-max-difference-you-can-get-from-changing-an-integer
1616-minimum-difference-between-largest-and-smallest-value-in-three-moves
1818-maximum-score-from-removing-substrings
2026-merge-triplets-to-form-target-triplet
2094-remove-stones-to-minimize-the-total
2140-longest-subsequence-repeated-k-times
2221-check-if-a-parentheses-string-can-be-valid
2387-partition-array-such-that-maximum-difference-is-k
2395-longest-binary-subsequence-less-than-or-equal-to-k
2520-using-a-robot-to-print-the-lexicographically-smallest-string
2640-maximum-number-of-integers-to-choose-from-a-range-i
2704-maximum-difference-by-remapping-a-digit
2756-buy-two-chocolates
2816-lexicographically-smallest-palindrome
3360-minimum-deletions-to-make-string-k-special
3741-reschedule-meetings-for-maximum-free-time-ii

Hash Table

0001-two-sum
0017-letter-combinations-of-a-phone-number
0030-substring-with-concatenation-of-all-words
0041-first-missing-positive
0049-group-anagrams
0073-set-matrix-zeroes
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0128-longest-consecutive-sequence
0141-linked-list-cycle
0142-linked-list-cycle-ii
0146-lru-cache
0160-intersection-of-two-linked-lists
0208-implement-trie-prefix-tree
0217-contains-duplicate
0219-contains-duplicate-ii
0229-majority-element-ii
0242-valid-anagram
0290-word-pattern
0299-bulls-and-cows
0347-top-k-frequent-elements
0349-intersection-of-two-arrays
0350-intersection-of-two-arrays-ii
0380-insert-delete-getrandom-o1
0383-ransom-note
0387-first-unique-character-in-a-string
0389-find-the-difference
0398-random-pick-index
0438-find-all-anagrams-in-a-string
0451-sort-characters-by-frequency
0491-non-decreasing-subsequences
0523-continuous-subarray-sum
0532-k-diff-pairs-in-an-array
0560-subarray-sum-equals-k
0567-permutation-in-string
0594-longest-harmonious-subsequence
0653-two-sum-iv-input-is-a-bst
0692-top-k-frequent-words
0782-jewels-and-stones
0817-design-hashmap
0893-all-nodes-distance-k-in-binary-tree
1016-subarray-sums-divisible-by-k
1029-vertical-order-traversal-of-a-binary-tree
1039-find-the-town-judge
1468-check-if-n-and-its-double-exist
1487-cinema-seat-allocation
1502-construct-k-palindrome-strings
1510-find-lucky-integer-in-an-array
1741-sort-array-by-increasing-frequency
1786-count-the-number-of-consistent-strings
1798-max-number-of-k-sum-pairs
2107-find-unique-binary-string
2204-find-subsequence-of-length-k-with-the-largest-sum
2308-divide-array-into-equal-pairs
2448-count-number-of-bad-pairs
2502-sort-the-people
2520-using-a-robot-to-print-the-lexicographically-smallest-string
2640-maximum-number-of-integers-to-choose-from-a-range-i
2677-cousins-in-binary-tree-ii
2695-find-score-of-an-array-after-marking-all-elements
2766-find-the-prefix-common-array-of-two-arrays
3242-count-elements-with-maximum-frequency
3267-find-longest-special-substring-that-occurs-thrice-i
3349-maximum-length-substring-with-two-occurrences
3360-minimum-deletions-to-make-string-k-special
3455-minimum-length-of-string-after-operations
3753-maximum-difference-between-even-and-odd-frequency-i
3754-maximum-manhattan-distance-after-k-changes

Two Pointers

0005-longest-palindromic-substring
0011-container-with-most-water
0015-3sum
0016-3sum-closest
0019-remove-nth-node-from-end-of-list
0026-remove-duplicates-from-sorted-array
0028-find-the-index-of-the-first-occurrence-in-a-string
0042-trapping-rain-water
0088-merge-sorted-array
0125-valid-palindrome
0141-linked-list-cycle
0142-linked-list-cycle-ii
0143-reorder-list
0148-sort-list
0160-intersection-of-two-linked-lists
0167-two-sum-ii-input-array-is-sorted
0189-rotate-array
0234-palindrome-linked-list
0283-move-zeroes
0295-find-median-from-data-stream
0344-reverse-string
0345-reverse-vowels-of-a-string
0349-intersection-of-two-arrays
0350-intersection-of-two-arrays-ii
0392-is-subsequence
0532-k-diff-pairs-in-an-array
0541-reverse-string-ii
0567-permutation-in-string
0653-two-sum-iv-input-is-a-bst
0658-find-k-closest-elements
0802-k-th-smallest-prime-fraction
0874-backspace-string-compare
0908-middle-of-the-linked-list
0917-boats-to-save-people
0941-sort-array-by-parity
0953-reverse-only-letters
0961-long-pressed-name
1468-check-if-n-and-its-double-exist
1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence
1798-max-number-of-k-sum-pairs
2216-delete-the-middle-node-of-a-linked-list
2320-find-all-k-distant-indices-in-an-array
2551-apply-operations-to-an-array
2816-lexicographically-smallest-palindrome

Number Theory

2903-insert-greatest-common-divisors-in-linked-list
3373-maximum-prime-difference

Trie

0014-longest-common-prefix
0208-implement-trie-prefix-tree
0386-lexicographical-numbers
0440-k-th-smallest-in-lexicographical-order
0692-top-k-frequent-words
1350-remove-sub-folders-from-the-filesystem
3309-count-prefix-and-suffix-pairs-i

Matrix

0063-unique-paths-ii
0064-minimum-path-sum
0073-set-matrix-zeroes
0240-search-a-2d-matrix-ii
0463-island-perimeter
0542-01-matrix
0733-flood-fill
0967-minimum-falling-path-sum
1463-the-k-weakest-rows-in-a-matrix
2132-convert-1d-array-into-2d-array

Dynamic Programming

0005-longest-palindromic-substring
0042-trapping-rain-water
0045-jump-game-ii
0053-maximum-subarray
0055-jump-game
0062-unique-paths
0063-unique-paths-ii
0064-minimum-path-sum
0070-climbing-stairs
0072-edit-distance
0091-decode-ways
0096-unique-binary-search-trees
0115-distinct-subsequences
0118-pascals-triangle
0120-triangle
0121-best-time-to-buy-and-sell-stock
0152-maximum-product-subarray
0198-house-robber
0213-house-robber-ii
0300-longest-increasing-subsequence
0322-coin-change
0338-counting-bits
0377-combination-sum-iv
0392-is-subsequence
0397-integer-replacement
0494-target-sum
0518-coin-change-ii
0542-01-matrix
0576-out-of-boundary-paths
0583-delete-operation-for-two-strings
0673-number-of-longest-increasing-subsequence
0688-knight-probability-in-chessboard
0689-maximum-sum-of-3-non-overlapping-subarrays
0747-min-cost-climbing-stairs
0803-cheapest-flights-within-k-stops
0909-stone-game
0967-minimum-falling-path-sum
1105-uncrossed-lines
1236-n-th-tribonacci-number
1250-longest-common-subsequence
1263-number-of-dice-rolls-with-target-sum
1388-greatest-sum-divisible-by-three
1511-count-number-of-teams
1851-maximum-number-of-events-that-can-be-attended-ii
2090-number-of-ways-to-arrive-at-destination
2395-longest-binary-subsequence-less-than-or-equal-to-k
3490-find-the-maximum-length-of-valid-subsequence-i
3618-find-the-original-typed-string-ii

Monotonic Stack

0042-trapping-rain-water
0654-maximum-binary-tree
0739-daily-temperatures

Memoization

0070-climbing-stairs
0397-integer-replacement
1236-n-th-tribonacci-number
2395-longest-binary-subsequence-less-than-or-equal-to-k

Counting

0229-majority-element-ii
0299-bulls-and-cows
0347-top-k-frequent-elements
0383-ransom-note
0387-first-unique-character-in-a-string
0451-sort-characters-by-frequency
0594-longest-harmonious-subsequence
0692-top-k-frequent-words
1502-construct-k-palindrome-strings
1510-find-lucky-integer-in-an-array
1786-count-the-number-of-consistent-strings
2140-longest-subsequence-repeated-k-times
2308-divide-array-into-equal-pairs
2448-count-number-of-bad-pairs
2614-maximum-count-of-positive-integer-and-negative-integer
3242-count-elements-with-maximum-frequency
3267-find-longest-special-substring-that-occurs-thrice-i
3360-minimum-deletions-to-make-string-k-special
3455-minimum-length-of-string-after-operations
3753-maximum-difference-between-even-and-odd-frequency-i
3754-maximum-manhattan-distance-after-k-changes

Bucket Sort

0164-maximum-gap
0220-contains-duplicate-iii
0347-top-k-frequent-elements
0451-sort-characters-by-frequency
0692-top-k-frequent-words
0948-sort-an-array

Radix Sort

0164-maximum-gap
0948-sort-an-array

String Matching

0028-find-the-index-of-the-first-occurrence-in-a-string
0572-subtree-of-another-tree
1524-string-matching-in-an-array
1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence
2292-counting-words-with-a-given-prefix
3309-count-prefix-and-suffix-pairs-i

Sliding Window

0030-substring-with-concatenation-of-all-words
0219-contains-duplicate-ii
0220-contains-duplicate-iii
0239-sliding-window-maximum
0438-find-all-anagrams-in-a-string
0567-permutation-in-string
0594-longest-harmonious-subsequence
0658-find-k-closest-elements
1755-defuse-the-bomb
3267-find-longest-special-substring-that-occurs-thrice-i
3349-maximum-length-substring-with-two-occurrences
3761-maximum-difference-between-even-and-odd-frequency-ii

Binary Indexed Tree

0673-number-of-longest-increasing-subsequence
1511-count-number-of-teams

Hash Function

0572-subtree-of-another-tree
0817-design-hashmap
3309-count-prefix-and-suffix-pairs-i

Counting Sort

0948-sort-an-array
1137-height-checker

Geometry

1014-k-closest-points-to-origin

Design

0146-lru-cache
0208-implement-trie-prefix-tree
0225-implement-stack-using-queues
0295-find-median-from-data-stream
0380-insert-delete-getrandom-o1
0817-design-hashmap
1497-design-a-stack-with-increment-operation

Data Stream

0295-find-median-from-data-stream

Union Find

0128-longest-consecutive-sequence
0547-number-of-provinces
0684-redundant-connection
0801-is-graph-bipartite
1442-number-of-operations-to-make-network-connected
2121-find-if-path-exists-in-graph
2793-count-the-number-of-complete-components
3219-make-lexicographically-smallest-array-by-swapping-elements

Prefix Sum

0523-continuous-subarray-sum
0560-subarray-sum-equals-k
1016-subarray-sums-divisible-by-k
2358-number-of-ways-to-split-array
3618-find-the-original-typed-string-ii
3761-maximum-difference-between-even-and-odd-frequency-ii

Monotonic Queue

0239-sliding-window-maximum

Graph

0207-course-schedule
0210-course-schedule-ii
0547-number-of-provinces
0684-redundant-connection
0744-network-delay-time
0801-is-graph-bipartite
0803-cheapest-flights-within-k-stops
0813-all-paths-from-source-to-target
0871-keys-and-rooms
1039-find-the-town-judge
1424-maximum-candies-you-can-get-from-boxes
1442-number-of-operations-to-make-network-connected
1916-find-center-of-star-graph
2090-number-of-ways-to-arrive-at-destination
2121-find-if-path-exists-in-graph
2439-longest-cycle-in-a-graph
2793-count-the-number-of-complete-components
3189-find-champion-ii
3517-shortest-distance-after-road-addition-queries-i

Combinatorics

0062-unique-paths
3201-distribute-candies-among-children-ii
3682-count-the-number-of-arrays-with-k-matching-adjacent-elements

Shortest Path

0744-network-delay-time
0803-cheapest-flights-within-k-stops
2090-number-of-ways-to-arrive-at-destination

Ordered Set

0220-contains-duplicate-iii

Rolling Hash

3309-count-prefix-and-suffix-pairs-i

Topological Sort

0207-course-schedule
0210-course-schedule-ii
2090-number-of-ways-to-arrive-at-destination
2439-longest-cycle-in-a-graph

Doubly-Linked List

0146-lru-cache

Enumeration

2140-longest-subsequence-repeated-k-times
2202-sum-of-k-mirror-numbers
2998-count-symmetric-integers
3201-distribute-candies-among-children-ii
3741-reschedule-meetings-for-maximum-free-time-ii
3761-maximum-difference-between-even-and-odd-frequency-ii

Randomized

0380-insert-delete-getrandom-o1
0398-random-pick-index

Interactive

0374-guess-number-higher-or-lower

Segment Tree

0673-number-of-longest-increasing-subsequence

Reservoir Sampling

0398-random-pick-index

Game Theory

0909-stone-game