LeetCode Topics

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

LeetCode Topics

Array


0011-container-with-most-water
0014-longest-common-prefix
0015-3sum
0018-4sum
0031-next-permutation
0039-combination-sum
0040-combination-sum-ii
0042-trapping-rain-water
0046-permutations
0049-group-anagrams
0051-n-queens
0053-maximum-subarray
0073-set-matrix-zeroes
0074-search-a-2d-matrix
0075-sort-colors
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
0121-best-time-to-buy-and-sell-stock
0128-longest-consecutive-sequence
0130-surrounded-regions
0134-gas-station
0135-candy
0136-single-number
0152-maximum-product-subarray
0169-majority-element
0209-minimum-size-subarray-sum
0215-kth-largest-element-in-an-array
0238-product-of-array-except-self
0239-sliding-window-maximum
0283-move-zeroes
0287-find-the-duplicate-number
0300-longest-increasing-subsequence
0322-coin-change
0347-top-k-frequent-elements
0378-kth-smallest-element-in-a-sorted-matrix
0485-max-consecutive-ones
0496-next-greater-element-i
0503-next-greater-element-ii
0518-coin-change-ii
0523-continuous-subarray-sum
0542-01-matrix
0560-subarray-sum-equals-k
0594-longest-harmonious-subsequence
0643-maximum-average-subarray-i
0692-top-k-frequent-words
0713-subarray-product-less-than-k
0724-find-pivot-index
0739-daily-temperatures
0882-peak-index-in-a-mountain-array
0904-fruit-into-baskets
0918-maximum-sum-circular-subarray
0930-binary-subarrays-with-sum
0932-monotonic-array
0940-fruit-into-baskets
0945-snakes-and-ladders
0974-subarray-sums-divisible-by-k
0992-subarrays-with-k-different-integers
1004-max-consecutive-ones-iii
1248-count-number-of-nice-subarrays
1293-three-consecutive-odds
1350-remove-sub-folders-from-the-filesystem
1424-maximum-candies-you-can-get-from-boxes
1478-maximum-number-of-events-that-can-be-attended
1510-find-lucky-integer-in-an-array
1621-number-of-subsequences-that-satisfy-the-given-sum-condition
1631-path-with-minimum-effort
1851-maximum-number-of-events-that-can-be-attended-ii
1995-finding-pairs-with-a-certain-sum
2048-build-array-from-permutation
2073-time-needed-to-buy-tickets
2144-maximum-difference-between-increasing-elements
2150-kth-smallest-product-of-two-sorted-arrays
2204-find-subsequence-of-length-k-with-the-largest-sum
2215-finding-3-digit-even-numbers
2270-find-all-lonely-numbers-in-the-array
2271-rearrange-array-elements-by-sign
2320-find-all-k-distant-indices-in-an-array
2387-partition-array-such-that-maximum-difference-is-k
2478-longest-nice-subarray
2720-minimize-the-maximum-difference-of-pairs
2965-find-missing-and-repeated-values
3142-longest-unequal-adjacent-groups-subsequence-ii
3143-longest-unequal-adjacent-groups-subsequence-i
3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros
3194-find-words-containing-character
3227-find-missing-and-repeated-values
3241-divide-array-into-arrays-with-max-difference
3307-find-the-maximum-sum-of-node-values
3321-type-of-triangle
3490-find-the-maximum-length-of-valid-subsequence-i
3491-find-the-maximum-length-of-valid-subsequence-ii
3627-find-minimum-time-to-reach-last-room-i
3628-find-minimum-time-to-reach-last-room-ii
3639-zero-array-transformation-i
3647-zero-array-transformation-iii
3741-reschedule-meetings-for-maximum-free-time-ii
3743-reschedule-meetings-for-maximum-free-time-i
3747-maximum-difference-between-adjacent-elements-in-a-circular-array

Dynamic Programming


0005-longest-palindromic-substring
0042-trapping-rain-water
0053-maximum-subarray
0072-edit-distance
0121-best-time-to-buy-and-sell-stock
0131-palindrome-partitioning
0152-maximum-product-subarray
0300-longest-increasing-subsequence
0322-coin-change
0518-coin-change-ii
0542-01-matrix
0647-palindromic-substrings
0787-cheapest-flights-within-k-stops
0918-maximum-sum-circular-subarray
1143-longest-common-subsequence
1851-maximum-number-of-events-that-can-be-attended-ii
2028-the-earliest-and-latest-rounds-where-players-compete
2395-longest-binary-subsequence-less-than-or-equal-to-k
3142-longest-unequal-adjacent-groups-subsequence-ii
3143-longest-unequal-adjacent-groups-subsequence-i
3307-find-the-maximum-sum-of-node-values
3490-find-the-maximum-length-of-valid-subsequence-i
3491-find-the-maximum-length-of-valid-subsequence-ii
3618-find-the-original-typed-string-ii
3629-total-characters-in-string-after-transformations-i
3630-total-characters-in-string-after-transformations-ii
3637-count-number-of-balanced-permutations

Math


0002-add-two-numbers
0050-powx-n
0523-continuous-subarray-sum
1248-count-number-of-nice-subarrays
1411-convert-binary-number-in-a-linked-list-to-integer
1529-max-difference-you-can-get-from-changing-an-integer
2202-sum-of-k-mirror-numbers
2704-maximum-difference-by-remapping-a-digit
2965-find-missing-and-repeated-values
3172-divisible-and-non-divisible-sums-difference
3201-distribute-candies-among-children-ii
3227-find-missing-and-repeated-values
3321-type-of-triangle
3600-find-the-k-th-character-in-string-game-i
3601-find-the-k-th-character-in-string-game-ii
3629-total-characters-in-string-after-transformations-i
3630-total-characters-in-string-after-transformations-ii
3637-count-number-of-balanced-permutations
3682-count-the-number-of-arrays-with-k-matching-adjacent-elements
3754-maximum-manhattan-distance-after-k-changes

Recursion


0002-add-two-numbers
0021-merge-two-sorted-lists
0024-swap-nodes-in-pairs
0025-reverse-nodes-in-k-group
0050-powx-n
0143-reorder-list
0206-reverse-linked-list
0234-palindrome-linked-list
3600-find-the-k-th-character-in-string-game-i
3601-find-the-k-th-character-in-string-game-ii

Simulation


2048-build-array-from-permutation
2073-time-needed-to-buy-tickets
2260-divide-a-string-into-groups-of-size-k
2271-rearrange-array-elements-by-sign
2696-minimum-string-length-after-removing-substrings
3600-find-the-k-th-character-in-string-game-i

Graph


0207-course-schedule
0210-course-schedule-ii
0547-number-of-provinces
0787-cheapest-flights-within-k-stops
1424-maximum-candies-you-can-get-from-boxes
2438-find-closest-node-to-given-two-nodes
3627-find-minimum-time-to-reach-last-room-i
3628-find-minimum-time-to-reach-last-room-ii

Heap (Priority Queue)


0215-kth-largest-element-in-an-array
0239-sliding-window-maximum
0347-top-k-frequent-elements
0378-kth-smallest-element-in-a-sorted-matrix
0451-sort-characters-by-frequency
0692-top-k-frequent-words
0703-kth-largest-element-in-a-stream
0767-reorganize-string
0787-cheapest-flights-within-k-stops
1478-maximum-number-of-events-that-can-be-attended
1631-path-with-minimum-effort
2204-find-subsequence-of-length-k-with-the-largest-sum
3445-lexicographically-minimum-string-after-removing-stars
3627-find-minimum-time-to-reach-last-room-i
3628-find-minimum-time-to-reach-last-room-ii
3647-zero-array-transformation-iii

Matrix


0073-set-matrix-zeroes
0074-search-a-2d-matrix
0130-surrounded-regions
0378-kth-smallest-element-in-a-sorted-matrix
0542-01-matrix
0945-snakes-and-ladders
1631-path-with-minimum-effort
2965-find-missing-and-repeated-values
3227-find-missing-and-repeated-values
3627-find-minimum-time-to-reach-last-room-i
3628-find-minimum-time-to-reach-last-room-ii

Shortest Path


0787-cheapest-flights-within-k-stops
3627-find-minimum-time-to-reach-last-room-i
3628-find-minimum-time-to-reach-last-room-ii

String


0003-longest-substring-without-repeating-characters
0005-longest-palindromic-substring
0014-longest-common-prefix
0020-valid-parentheses
0049-group-anagrams
0072-edit-distance
0076-minimum-window-substring
0125-valid-palindrome
0131-palindrome-partitioning
0151-reverse-words-in-a-string
0242-valid-anagram
0316-remove-duplicate-letters
0344-reverse-string
0387-first-unique-character-in-a-string
0424-longest-repeating-character-replacement
0438-find-all-anagrams-in-a-string
0443-string-compression
0451-sort-characters-by-frequency
0557-reverse-words-in-a-string-iii
0567-permutation-in-string
0647-palindromic-substrings
0692-top-k-frequent-words
0767-reorganize-string
1058-lexicographically-smallest-equivalent-string
1143-longest-common-subsequence
1350-remove-sub-folders-from-the-filesystem
1358-number-of-substrings-containing-all-three-characters
1460-number-of-substrings-containing-all-three-characters
1763-longest-nice-substring
2140-longest-subsequence-repeated-k-times
2260-divide-a-string-into-groups-of-size-k
2395-longest-binary-subsequence-less-than-or-equal-to-k
2520-using-a-robot-to-print-the-lexicographically-smallest-string
2696-minimum-string-length-after-removing-substrings
3142-longest-unequal-adjacent-groups-subsequence-ii
3143-longest-unequal-adjacent-groups-subsequence-i
3194-find-words-containing-character
3360-minimum-deletions-to-make-string-k-special
3396-valid-word
3445-lexicographically-minimum-string-after-removing-stars
3617-find-the-original-typed-string-i
3618-find-the-original-typed-string-ii
3629-total-characters-in-string-after-transformations-i
3630-total-characters-in-string-after-transformations-ii
3637-count-number-of-balanced-permutations
3683-find-the-lexicographically-largest-string-from-the-box-i
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

Combinatorics


3201-distribute-candies-among-children-ii
3637-count-number-of-balanced-permutations
3682-count-the-number-of-arrays-with-k-matching-adjacent-elements

Greedy


0011-container-with-most-water
0134-gas-station
0135-candy
0316-remove-duplicate-letters
0767-reorganize-string
1478-maximum-number-of-events-that-can-be-attended
1529-max-difference-you-can-get-from-changing-an-integer
2140-longest-subsequence-repeated-k-times
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
2704-maximum-difference-by-remapping-a-digit
2720-minimize-the-maximum-difference-of-pairs
3143-longest-unequal-adjacent-groups-subsequence-i
3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros
3241-divide-array-into-arrays-with-max-difference
3307-find-the-maximum-sum-of-node-values
3360-minimum-deletions-to-make-string-k-special
3445-lexicographically-minimum-string-after-removing-stars
3647-zero-array-transformation-iii
3741-reschedule-meetings-for-maximum-free-time-ii
3743-reschedule-meetings-for-maximum-free-time-i

Hash Table


0003-longest-substring-without-repeating-characters
0049-group-anagrams
0073-set-matrix-zeroes
0076-minimum-window-substring
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
0169-majority-element
0242-valid-anagram
0347-top-k-frequent-elements
0387-first-unique-character-in-a-string
0424-longest-repeating-character-replacement
0438-find-all-anagrams-in-a-string
0451-sort-characters-by-frequency
0496-next-greater-element-i
0523-continuous-subarray-sum
0560-subarray-sum-equals-k
0567-permutation-in-string
0594-longest-harmonious-subsequence
0692-top-k-frequent-words
0767-reorganize-string
0904-fruit-into-baskets
0930-binary-subarrays-with-sum
0940-fruit-into-baskets
0974-subarray-sums-divisible-by-k
0992-subarrays-with-k-different-integers
1248-count-number-of-nice-subarrays
1358-number-of-substrings-containing-all-three-characters
1460-number-of-substrings-containing-all-three-characters
1510-find-lucky-integer-in-an-array
1763-longest-nice-substring
1995-finding-pairs-with-a-certain-sum
2204-find-subsequence-of-length-k-with-the-largest-sum
2215-finding-3-digit-even-numbers
2270-find-all-lonely-numbers-in-the-array
2520-using-a-robot-to-print-the-lexicographically-smallest-string
2965-find-missing-and-repeated-values
3227-find-missing-and-repeated-values
3360-minimum-deletions-to-make-string-k-special
3445-lexicographically-minimum-string-after-removing-stars
3629-total-characters-in-string-after-transformations-i
3630-total-characters-in-string-after-transformations-ii
3753-maximum-difference-between-even-and-odd-frequency-i
3754-maximum-manhattan-distance-after-k-changes

Sorting


0015-3sum
0018-4sum
0049-group-anagrams
0075-sort-colors
0088-merge-sorted-array
0148-sort-list
0169-majority-element
0215-kth-largest-element-in-an-array
0242-valid-anagram
0347-top-k-frequent-elements
0378-kth-smallest-element-in-a-sorted-matrix
0451-sort-characters-by-frequency
0594-longest-harmonious-subsequence
0692-top-k-frequent-words
0767-reorganize-string
1478-maximum-number-of-events-that-can-be-attended
1621-number-of-subsequences-that-satisfy-the-given-sum-condition
1851-maximum-number-of-events-that-can-be-attended-ii
2204-find-subsequence-of-length-k-with-the-largest-sum
2215-finding-3-digit-even-numbers
2387-partition-array-such-that-maximum-difference-is-k
3241-divide-array-into-arrays-with-max-difference
3307-find-the-maximum-sum-of-node-values
3321-type-of-triangle
3360-minimum-deletions-to-make-string-k-special
3647-zero-array-transformation-iii

Enumeration


2140-longest-subsequence-repeated-k-times
2202-sum-of-k-mirror-numbers
2215-finding-3-digit-even-numbers
3201-distribute-candies-among-children-ii
3683-find-the-lexicographically-largest-string-from-the-box-i
3741-reschedule-meetings-for-maximum-free-time-ii
3761-maximum-difference-between-even-and-odd-frequency-ii

Counting


0169-majority-element
0347-top-k-frequent-elements
0387-first-unique-character-in-a-string
0451-sort-characters-by-frequency
0594-longest-harmonious-subsequence
0692-top-k-frequent-words
0767-reorganize-string
0992-subarrays-with-k-different-integers
1510-find-lucky-integer-in-an-array
2140-longest-subsequence-repeated-k-times
2270-find-all-lonely-numbers-in-the-array
3360-minimum-deletions-to-make-string-k-special
3629-total-characters-in-string-after-transformations-i
3630-total-characters-in-string-after-transformations-ii
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
0018-4sum
0019-remove-nth-node-from-end-of-list
0031-next-permutation
0042-trapping-rain-water
0061-rotate-list
0075-sort-colors
0088-merge-sorted-array
0125-valid-palindrome
0141-linked-list-cycle
0142-linked-list-cycle-ii
0143-reorder-list
0148-sort-list
0151-reverse-words-in-a-string
0234-palindrome-linked-list
0283-move-zeroes
0287-find-the-duplicate-number
0344-reverse-string
0443-string-compression
0557-reverse-words-in-a-string-iii
0567-permutation-in-string
0647-palindromic-substrings
0908-middle-of-the-linked-list
1621-number-of-subsequences-that-satisfy-the-given-sum-condition
2271-rearrange-array-elements-by-sign
2320-find-all-k-distant-indices-in-an-array
3683-find-the-lexicographically-largest-string-from-the-box-i

Divide and Conquer


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
0148-sort-list
0169-majority-element
0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements
0918-maximum-sum-circular-subarray
1763-longest-nice-substring

Prefix Sum


0209-minimum-size-subarray-sum
0238-product-of-array-except-self
0523-continuous-subarray-sum
0560-subarray-sum-equals-k
0713-subarray-product-less-than-k
0724-find-pivot-index
0930-binary-subarrays-with-sum
0974-subarray-sums-divisible-by-k
1004-max-consecutive-ones-iii
1248-count-number-of-nice-subarrays
3618-find-the-original-typed-string-ii
3639-zero-array-transformation-i
3647-zero-array-transformation-iii
3761-maximum-difference-between-even-and-odd-frequency-ii

Bit Manipulation


0090-subsets-ii
0136-single-number
0222-count-complete-tree-nodes
0287-find-the-duplicate-number
1763-longest-nice-substring
2478-longest-nice-subarray
3307-find-the-maximum-sum-of-node-values
3600-find-the-k-th-character-in-string-game-i
3601-find-the-k-th-character-in-string-game-ii

Tree


0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0102-binary-tree-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
0108-convert-sorted-array-to-binary-search-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0222-count-complete-tree-nodes
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0543-diameter-of-binary-tree
0703-kth-largest-element-in-a-stream
0783-minimum-distance-between-bst-nodes
0799-minimum-distance-between-bst-nodes
0938-range-sum-of-bst
1161-maximum-level-sum-of-a-binary-tree
3307-find-the-maximum-sum-of-node-values
3633-maximize-the-number-of-target-nodes-after-connecting-trees-i
3645-maximize-the-number-of-target-nodes-after-connecting-trees-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
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0130-surrounded-regions
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0207-course-schedule
0210-course-schedule-ii
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0386-lexicographical-numbers
0430-flatten-a-multilevel-doubly-linked-list
0543-diameter-of-binary-tree
0547-number-of-provinces
0783-minimum-distance-between-bst-nodes
0785-is-graph-bipartite
0787-cheapest-flights-within-k-stops
0797-all-paths-from-source-to-target
0799-minimum-distance-between-bst-nodes
0938-range-sum-of-bst
1161-maximum-level-sum-of-a-binary-tree
1350-remove-sub-folders-from-the-filesystem
1631-path-with-minimum-effort
2438-find-closest-node-to-given-two-nodes
3633-maximize-the-number-of-target-nodes-after-connecting-trees-i
3645-maximize-the-number-of-target-nodes-after-connecting-trees-ii

Breadth-First Search


0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0116-populating-next-right-pointers-in-each-node
0130-surrounded-regions
0207-course-schedule
0210-course-schedule-ii
0322-coin-change
0542-01-matrix
0547-number-of-provinces
0783-minimum-distance-between-bst-nodes
0785-is-graph-bipartite
0787-cheapest-flights-within-k-stops
0797-all-paths-from-source-to-target
0799-minimum-distance-between-bst-nodes
0945-snakes-and-ladders
1161-maximum-level-sum-of-a-binary-tree
1424-maximum-candies-you-can-get-from-boxes
1631-path-with-minimum-effort
3633-maximize-the-number-of-target-nodes-after-connecting-trees-i
3645-maximize-the-number-of-target-nodes-after-connecting-trees-ii

Union Find


0128-longest-consecutive-sequence
0547-number-of-provinces
1058-lexicographically-smallest-equivalent-string
1631-path-with-minimum-effort

Stack


0020-valid-parentheses
0042-trapping-rain-water
0094-binary-tree-inorder-traversal
0114-flatten-binary-tree-to-linked-list
0143-reorder-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0155-min-stack
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0234-palindrome-linked-list
0316-remove-duplicate-letters
0496-next-greater-element-i
0503-next-greater-element-ii
0739-daily-temperatures
0901-online-stock-span
2520-using-a-robot-to-print-the-lexicographically-smallest-string
2696-minimum-string-length-after-removing-substrings
3445-lexicographically-minimum-string-after-removing-stars

Trie


0014-longest-common-prefix
0386-lexicographical-numbers
0440-k-th-smallest-in-lexicographical-order
0692-top-k-frequent-words
1350-remove-sub-folders-from-the-filesystem

Sliding Window


0003-longest-substring-without-repeating-characters
0076-minimum-window-substring
0209-minimum-size-subarray-sum
0239-sliding-window-maximum
0424-longest-repeating-character-replacement
0438-find-all-anagrams-in-a-string
0567-permutation-in-string
0594-longest-harmonious-subsequence
0643-maximum-average-subarray-i
0713-subarray-product-less-than-k
0904-fruit-into-baskets
0930-binary-subarrays-with-sum
0940-fruit-into-baskets
0992-subarrays-with-k-different-integers
1004-max-consecutive-ones-iii
1248-count-number-of-nice-subarrays
1358-number-of-substrings-containing-all-three-characters
1460-number-of-substrings-containing-all-three-characters
1763-longest-nice-substring
2478-longest-nice-subarray
3743-reschedule-meetings-for-maximum-free-time-i
3761-maximum-difference-between-even-and-odd-frequency-ii

Binary Search


0074-search-a-2d-matrix
0209-minimum-size-subarray-sum
0222-count-complete-tree-nodes
0287-find-the-duplicate-number
0300-longest-increasing-subsequence
0378-kth-smallest-element-in-a-sorted-matrix
0713-subarray-product-less-than-k
0882-peak-index-in-a-mountain-array
1004-max-consecutive-ones-iii
1621-number-of-subsequences-that-satisfy-the-given-sum-condition
1631-path-with-minimum-effort
1851-maximum-number-of-events-that-can-be-attended-ii
2150-kth-smallest-product-of-two-sorted-arrays
2720-minimize-the-maximum-difference-of-pairs

Memoization


2028-the-earliest-and-latest-rounds-where-players-compete
2395-longest-binary-subsequence-less-than-or-equal-to-k

Backtracking


0039-combination-sum
0040-combination-sum-ii
0046-permutations
0051-n-queens
0090-subsets-ii
0131-palindrome-partitioning
0797-all-paths-from-source-to-target
2140-longest-subsequence-repeated-k-times

Design


0146-lru-cache
0155-min-stack
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0703-kth-largest-element-in-a-stream
0707-design-linked-list
0901-online-stock-span
1995-finding-pairs-with-a-certain-sum

Linked List


0002-add-two-numbers
0019-remove-nth-node-from-end-of-list
0021-merge-two-sorted-lists
0024-swap-nodes-in-pairs
0025-reverse-nodes-in-k-group
0061-rotate-list
0083-remove-duplicates-from-sorted-list
0092-reverse-linked-list-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0141-linked-list-cycle
0142-linked-list-cycle-ii
0143-reorder-list
0146-lru-cache
0148-sort-list
0206-reverse-linked-list
0234-palindrome-linked-list
0328-odd-even-linked-list
0430-flatten-a-multilevel-doubly-linked-list
0707-design-linked-list
0908-middle-of-the-linked-list
1411-convert-binary-number-in-a-linked-list-to-integer

Queue


0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0239-sliding-window-maximum
0387-first-unique-character-in-a-string
0918-maximum-sum-circular-subarray
2073-time-needed-to-buy-tickets

Monotonic Queue


0239-sliding-window-maximum
0918-maximum-sum-circular-subarray

Binary Tree


0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0102-binary-tree-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
0108-convert-sorted-array-to-binary-search-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0222-count-complete-tree-nodes
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0543-diameter-of-binary-tree
0703-kth-largest-element-in-a-stream
0783-minimum-distance-between-bst-nodes
0799-minimum-distance-between-bst-nodes
0938-range-sum-of-bst
1161-maximum-level-sum-of-a-binary-tree

Binary Search Tree


0098-validate-binary-search-tree
0108-convert-sorted-array-to-binary-search-tree
0235-lowest-common-ancestor-of-a-binary-search-tree
0703-kth-largest-element-in-a-stream
0783-minimum-distance-between-bst-nodes
0799-minimum-distance-between-bst-nodes
0938-range-sum-of-bst

Monotonic Stack


0042-trapping-rain-water
0316-remove-duplicate-letters
0496-next-greater-element-i
0503-next-greater-element-ii
0739-daily-temperatures
0901-online-stock-span

Topological Sort


0207-course-schedule
0210-course-schedule-ii

Doubly-Linked List


0146-lru-cache
0430-flatten-a-multilevel-doubly-linked-list

Database


0197-rising-temperature
0570-managers-with-at-least-5-direct-reports
0577-employee-bonus
0595-big-countries
0596-classes-with-at-least-5-students
0619-biggest-single-number
0620-not-boring-movies
1045-customers-who-bought-all-products
1068-product-sales-analysis-i
1075-project-employees-i
1148-article-views-i
1211-queries-quality-and-percentage
1251-average-selling-price
1378-replace-employee-id-with-the-unique-identifier
1633-percentage-of-users-attended-a-contest
1661-average-time-of-process-per-machine
1683-invalid-tweets
1729-find-followers-count
1757-recyclable-and-low-fat-products
1934-confirmation-rate

Data Stream


0703-kth-largest-element-in-a-stream
0901-online-stock-span

Bucket Sort


0347-top-k-frequent-elements
0451-sort-characters-by-frequency
0692-top-k-frequent-words

Quickselect


0215-kth-largest-element-in-an-array
0347-top-k-frequent-elements

Merge Sort


0148-sort-list

Graph Theory


0547-number-of-provinces
0785-is-graph-bipartite
0787-cheapest-flights-within-k-stops
0797-all-paths-from-source-to-target

Union-Find


0130-surrounded-regions
0547-number-of-provinces
0785-is-graph-bipartite

Name		Name	Last commit message	Last commit date
Latest commit History 1,657 Commits
0002-add-two-numbers		0002-add-two-numbers
0003-longest-substring-without-repeating-characters		0003-longest-substring-without-repeating-characters
0005-longest-palindromic-substring		0005-longest-palindromic-substring
0011-container-with-most-water		0011-container-with-most-water
0014-longest-common-prefix		0014-longest-common-prefix
0015-3sum		0015-3sum
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
0031-next-permutation		0031-next-permutation
0039-combination-sum		0039-combination-sum
0040-combination-sum-ii		0040-combination-sum-ii
0042-trapping-rain-water		0042-trapping-rain-water
0046-permutations		0046-permutations
0047-permutations-ii		0047-permutations-ii
0049-group-anagrams		0049-group-anagrams
0050-powx-n		0050-powx-n
0051-n-queens		0051-n-queens
0053-maximum-subarray		0053-maximum-subarray
0061-rotate-list		0061-rotate-list
0072-edit-distance		0072-edit-distance
0073-set-matrix-zeroes		0073-set-matrix-zeroes
0074-search-a-2d-matrix		0074-search-a-2d-matrix
0075-sort-colors		0075-sort-colors
0076-minimum-window-substring		0076-minimum-window-substring
0078-subsets		0078-subsets
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
0092-reverse-linked-list-ii		0092-reverse-linked-list-ii
0094-binary-tree-inorder-traversal		0094-binary-tree-inorder-traversal
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
0104-maximum-depth-of-binary-tree		0104-maximum-depth-of-binary-tree
0105-construct-binary-tree-from-preorder-and-inorder-traversal		0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal		0106-construct-binary-tree-from-inorder-and-postorder-traversal
0108-convert-sorted-array-to-binary-search-tree		0108-convert-sorted-array-to-binary-search-tree
0110-balanced-binary-tree		0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree		0111-minimum-depth-of-binary-tree
0112-path-sum		0112-path-sum
0114-flatten-binary-tree-to-linked-list		0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node		0116-populating-next-right-pointers-in-each-node
0121-best-time-to-buy-and-sell-stock		0121-best-time-to-buy-and-sell-stock
0125-valid-palindrome		0125-valid-palindrome
0128-longest-consecutive-sequence		0128-longest-consecutive-sequence
0130-surrounded-regions		0130-surrounded-regions
0131-palindrome-partitioning		0131-palindrome-partitioning
0134-gas-station		0134-gas-station
0135-candy		0135-candy
0136-single-number		0136-single-number
0141-linked-list-cycle		0141-linked-list-cycle
0142-linked-list-cycle-ii		0142-linked-list-cycle-ii
0143-reorder-list		0143-reorder-list
0144-binary-tree-preorder-traversal		0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal		0145-binary-tree-postorder-traversal
0146-lru-cache		0146-lru-cache
0148-sort-list		0148-sort-list
0151-reverse-words-in-a-string		0151-reverse-words-in-a-string
0152-maximum-product-subarray		0152-maximum-product-subarray
0155-min-stack		0155-min-stack
0167-two-sum-ii-input-array-is-sorted		0167-two-sum-ii-input-array-is-sorted
0169-majority-element		0169-majority-element
0197-rising-temperature		0197-rising-temperature
0200-number-of-islands		0200-number-of-islands
0206-reverse-linked-list		0206-reverse-linked-list
0207-course-schedule		0207-course-schedule
0209-minimum-size-subarray-sum		0209-minimum-size-subarray-sum
0210-course-schedule-ii		0210-course-schedule-ii
0215-kth-largest-element-in-an-array		0215-kth-largest-element-in-an-array
0222-count-complete-tree-nodes		0222-count-complete-tree-nodes
0225-implement-stack-using-queues		0225-implement-stack-using-queues
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
0238-product-of-array-except-self		0238-product-of-array-except-self
0239-sliding-window-maximum		0239-sliding-window-maximum
0242-valid-anagram		0242-valid-anagram
0283-move-zeroes		0283-move-zeroes
0287-find-the-duplicate-number		0287-find-the-duplicate-number
0300-longest-increasing-subsequence		0300-longest-increasing-subsequence
0316-remove-duplicate-letters		0316-remove-duplicate-letters
0322-coin-change		0322-coin-change
0328-odd-even-linked-list		0328-odd-even-linked-list
0344-reverse-string		0344-reverse-string
0347-top-k-frequent-elements		0347-top-k-frequent-elements
0378-kth-smallest-element-in-a-sorted-matrix		0378-kth-smallest-element-in-a-sorted-matrix
0386-lexicographical-numbers		0386-lexicographical-numbers
0387-first-unique-character-in-a-string		0387-first-unique-character-in-a-string
0424-longest-repeating-character-replacement		0424-longest-repeating-character-replacement
0430-flatten-a-multilevel-doubly-linked-list		0430-flatten-a-multilevel-doubly-linked-list
0438-find-all-anagrams-in-a-string		0438-find-all-anagrams-in-a-string
0440-k-th-smallest-in-lexicographical-order		0440-k-th-smallest-in-lexicographical-order
0443-string-compression		0443-string-compression
0451-sort-characters-by-frequency		0451-sort-characters-by-frequency

Folders and files

Latest commit

History

Repository files navigation

LeetCode Topics

Array

Dynamic Programming

Math

Recursion

Simulation

Graph

Heap (Priority Queue)

Matrix

Shortest Path

String

Combinatorics

Greedy

Hash Table

Sorting

Enumeration

Counting

Two Pointers

Divide and Conquer

Prefix Sum

Bit Manipulation

Tree

Depth-First Search

Breadth-First Search

Union Find

Stack

Trie

Sliding Window

Binary Search

Memoization

Backtracking

Design

Linked List

Queue

Monotonic Queue

Binary Tree

Binary Search Tree

Monotonic Stack

Topological Sort

Doubly-Linked List

Database

Data Stream

Bucket Sort

Quickselect

Merge Sort

Graph Theory

Union-Find

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Uh oh!

Contributors

Uh oh!

Languages

Packages