leetcode-Java

LeetCode Topics

Linked List

0002-add-two-numbers
0021-merge-two-sorted-lists
0023-merge-k-sorted-lists
0024-swap-nodes-in-pairs
0061-rotate-list
0082-remove-duplicates-from-sorted-list-ii
0092-reverse-linked-list-ii
0143-reorder-list
0147-insertion-sort-list
0148-sort-list
0160-intersection-of-two-linked-lists
0328-odd-even-linked-list
0382-linked-list-random-node
0445-add-two-numbers-ii
0622-design-circular-queue
0705-design-hashset
0706-design-hashmap
0707-design-linked-list
0817-linked-list-components
2095-delete-the-middle-node-of-a-linked-list
2487-remove-nodes-from-linked-list

Two Pointers

0011-container-with-most-water
0015-3sum
0016-3sum-closest
0018-4sum
0026-remove-duplicates-from-sorted-array
0027-remove-element
0028-find-the-index-of-the-first-occurrence-in-a-string
0031-next-permutation
0061-rotate-list
0075-sort-colors
0080-remove-duplicates-from-sorted-array-ii
0082-remove-duplicates-from-sorted-list-ii
0088-merge-sorted-array
0143-reorder-list
0148-sort-list
0151-reverse-words-in-a-string
0160-intersection-of-two-linked-lists
0167-two-sum-ii-input-array-is-sorted
0283-move-zeroes
0287-find-the-duplicate-number
0295-find-median-from-data-stream
0344-reverse-string
0349-intersection-of-two-arrays
0455-assign-cookies
0611-valid-triangle-number
0647-palindromic-substrings
0763-partition-labels
0948-bag-of-tokens
0969-pancake-sorting
0986-interval-list-intersections
1048-longest-string-chain
1498-number-of-subsequences-that-satisfy-the-given-sum-condition
1574-shortest-subarray-to-be-removed-to-make-array-sorted
2095-delete-the-middle-node-of-a-linked-list
2149-rearrange-array-elements-by-sign

Hash Table

0001-two-sum
0003-longest-substring-without-repeating-characters
0012-integer-to-roman
0013-roman-to-integer
0017-letter-combinations-of-a-phone-number
0037-sudoku-solver
0041-first-missing-positive
0049-group-anagrams
0073-set-matrix-zeroes
0128-longest-consecutive-sequence
0133-clone-graph
0160-intersection-of-two-linked-lists
0169-majority-element
0205-isomorphic-strings
0208-implement-trie-prefix-tree
0229-majority-element-ii
0242-valid-anagram
0268-missing-number
0347-top-k-frequent-elements
0349-intersection-of-two-arrays
0389-find-the-difference
0391-perfect-rectangle
0421-maximum-xor-of-two-numbers-in-an-array
0424-longest-repeating-character-replacement
0442-find-all-duplicates-in-an-array
0451-sort-characters-by-frequency
0496-next-greater-element-i
0525-contiguous-array
0560-subarray-sum-equals-k
0594-longest-harmonious-subsequence
0621-task-scheduler
0705-design-hashset
0706-design-hashmap
0763-partition-labels
0817-linked-list-components
0846-hand-of-straights
0895-maximum-frequency-stack
0930-binary-subarrays-with-sum
0947-most-stones-removed-with-same-row-or-column
0992-subarrays-with-k-different-integers
1048-longest-string-chain
1248-count-number-of-nice-subarrays
1331-rank-transform-of-an-array
1358-number-of-substrings-containing-all-three-characters
1386-cinema-seat-allocation
1781-sum-of-beauty-of-all-substrings
1980-find-unique-binary-string
2248-intersection-of-multiple-arrays
2283-check-if-number-has-equal-digit-count-and-digit-value
2418-sort-the-people
2958-length-of-longest-subarray-with-at-most-k-frequency
2996-smallest-missing-integer-greater-than-sequential-prefix-sum
3591-check-if-any-element-has-prime-frequency
3737-count-subarrays-with-majority-element-i

Math

0002-add-two-numbers
0007-reverse-integer
0009-palindrome-number
0012-integer-to-roman
0013-roman-to-integer
0029-divide-two-integers
0048-rotate-image
0050-powx-n
0062-unique-paths
0066-plus-one
0070-climbing-stairs
0096-unique-binary-search-trees
0204-count-primes
0223-rectangle-area
0231-power-of-two
0268-missing-number
0282-expression-add-operators
0371-sum-of-two-integers
0382-linked-list-random-node
0391-perfect-rectangle
0412-fizz-buzz
0445-add-two-numbers-ii
0492-construct-the-rectangle
0628-maximum-product-of-three-numbers
0738-monotone-increasing-digits
0836-rectangle-overlap
1248-count-number-of-nice-subarrays
1524-number-of-sub-arrays-with-odd-sum
1922-count-good-numbers
2235-add-two-integers
3178-find-the-child-who-has-the-ball-after-k-seconds
3513-number-of-unique-xor-triplets-i
3514-number-of-unique-xor-triplets-ii
3536-maximum-product-of-two-digits
3558-number-of-ways-to-assign-edge-weights-i
3591-check-if-any-element-has-prime-frequency
3875-construct-uniform-parity-array-i
3876-construct-uniform-parity-array-ii

Recursion

0002-add-two-numbers
0021-merge-two-sorted-lists
0024-swap-nodes-in-pairs
0050-powx-n
0143-reorder-list
0231-power-of-two
1106-parsing-a-boolean-expression
1922-count-good-numbers
2487-remove-nodes-from-linked-list

Array

0001-two-sum
0004-median-of-two-sorted-arrays
0011-container-with-most-water
0014-longest-common-prefix
0015-3sum
0016-3sum-closest
0018-4sum
0026-remove-duplicates-from-sorted-array
0027-remove-element
0031-next-permutation
0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0037-sudoku-solver
0039-combination-sum
0041-first-missing-positive
0045-jump-game-ii
0046-permutations
0047-permutations-ii
0048-rotate-image
0049-group-anagrams
0051-n-queens
0053-maximum-subarray
0054-spiral-matrix
0055-jump-game
0056-merge-intervals
0057-insert-interval
0059-spiral-matrix-ii
0063-unique-paths-ii
0064-minimum-path-sum
0066-plus-one
0073-set-matrix-zeroes
0074-search-a-2d-matrix
0075-sort-colors
0078-subsets
0079-word-search
0080-remove-duplicates-from-sorted-array-ii
0081-search-in-rotated-sorted-array-ii
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0088-merge-sorted-array
0090-subsets-ii
0118-pascals-triangle
0120-triangle
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0123-best-time-to-buy-and-sell-stock-iii
0128-longest-consecutive-sequence
0130-surrounded-regions
0134-gas-station
0135-candy
0136-single-number
0137-single-number-ii
0153-find-minimum-in-rotated-sorted-array
0162-find-peak-element
0167-two-sum-ii-input-array-is-sorted
0169-majority-element
0179-largest-number
0188-best-time-to-buy-and-sell-stock-iv
0198-house-robber
0200-number-of-islands
0204-count-primes
0213-house-robber-ii
0215-kth-largest-element-in-an-array
0216-combination-sum-iii
0221-maximal-square
0228-summary-ranges
0229-majority-element-ii
0239-sliding-window-maximum
0240-search-a-2d-matrix-ii
0268-missing-number
0283-move-zeroes
0287-find-the-duplicate-number
0300-longest-increasing-subsequence
0303-range-sum-query-immutable
0309-best-time-to-buy-and-sell-stock-with-cooldown
0312-burst-balloons
0322-coin-change
0324-wiggle-sort-ii
0347-top-k-frequent-elements
0349-intersection-of-two-arrays
0391-perfect-rectangle
0406-queue-reconstruction-by-height
0410-split-array-largest-sum
0416-partition-equal-subset-sum
0421-maximum-xor-of-two-numbers-in-an-array
0435-non-overlapping-intervals
0442-find-all-duplicates-in-an-array
0452-minimum-number-of-arrows-to-burst-balloons
0455-assign-cookies
0493-reverse-pairs
0494-target-sum
0496-next-greater-element-i
0518-coin-change-ii
0525-contiguous-array
0540-single-element-in-a-sorted-array
0542-01-matrix
0560-subarray-sum-equals-k
0561-array-partition
0594-longest-harmonious-subsequence
0611-valid-triangle-number
0621-task-scheduler
0622-design-circular-queue
0624-maximum-distance-in-arrays
0628-maximum-product-of-three-numbers
0643-maximum-average-subarray-i
0654-maximum-binary-tree
0673-number-of-longest-increasing-subsequence
0695-max-area-of-island
0704-binary-search
0705-design-hashset
0706-design-hashmap
0714-best-time-to-buy-and-sell-stock-with-transaction-fee
0717-1-bit-and-2-bit-characters
0724-find-pivot-index
0733-flood-fill
0739-daily-temperatures
0778-swim-in-rising-water
0817-linked-list-components
0827-making-a-large-island
0846-hand-of-straights
0860-lemonade-change
0875-koko-eating-bananas
0896-monotonic-array
0907-sum-of-subarray-minimums
0912-sort-an-array
0930-binary-subarrays-with-sum
0946-validate-stack-sequences
0948-bag-of-tokens
0969-pancake-sorting
0986-interval-list-intersections
0992-subarrays-with-k-different-integers
0994-rotting-oranges
1004-max-consecutive-ones-iii
1008-construct-binary-search-tree-from-preorder-traversal
1011-capacity-to-ship-packages-within-d-days
1020-number-of-enclaves
1029-two-city-scheduling
1043-partition-array-for-maximum-sum
1046-last-stone-weight
1048-longest-string-chain
1051-height-checker
1091-shortest-path-in-binary-matrix
1248-count-number-of-nice-subarrays
1260-shift-2d-grid
1277-count-square-submatrices-with-all-ones
1283-find-the-smallest-divisor-given-a-threshold
1331-rank-transform-of-an-array
1381-design-a-stack-with-increment-operation
1386-cinema-seat-allocation
1423-maximum-points-you-can-obtain-from-cards
1441-build-an-array-with-stack-operations
1464-maximum-product-of-two-elements-in-an-array
1475-final-prices-with-a-special-discount-in-a-shop
1498-number-of-subsequences-that-satisfy-the-given-sum-condition
1502-can-make-arithmetic-progression-from-sequence
1524-number-of-sub-arrays-with-odd-sum
1539-kth-missing-positive-number
1574-shortest-subarray-to-be-removed-to-make-array-sorted
1631-path-with-minimum-effort
1662-check-if-two-string-arrays-are-equivalent
1749-maximum-absolute-sum-of-any-subarray
1752-check-if-array-is-sorted-and-rotated
1779-find-nearest-point-that-has-the-same-x-or-y-coordinate
1967-number-of-strings-that-appear-as-substrings-in-word
1980-find-unique-binary-string
2089-find-target-indices-after-sorting-array
2091-removing-minimum-and-maximum-from-array
2104-sum-of-subarray-ranges
2149-rearrange-array-elements-by-sign
2239-find-closest-number-to-zero
2248-intersection-of-multiple-arrays
2418-sort-the-people
2616-minimize-the-maximum-difference-of-pairs
2706-buy-two-chocolates
2826-sorting-three-groups
2958-length-of-longest-subarray-with-at-most-k-frequency
2980-check-if-bitwise-or-has-trailing-zeros
2996-smallest-missing-integer-greater-than-sequential-prefix-sum
3069-distribute-elements-into-two-arrays-i
3513-number-of-unique-xor-triplets-i
3514-number-of-unique-xor-triplets-ii
3591-check-if-any-element-has-prime-frequency
3689-maximum-total-subarray-value-i
3737-count-subarrays-with-majority-element-i
3875-construct-uniform-parity-array-i
3876-construct-uniform-parity-array-ii
3903-smallest-stable-index-i
3904-smallest-stable-index-ii

Binary Search

0004-median-of-two-sorted-arrays
0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0074-search-a-2d-matrix
0081-search-in-rotated-sorted-array-ii
0153-find-minimum-in-rotated-sorted-array
0162-find-peak-element
0167-two-sum-ii-input-array-is-sorted
0222-count-complete-tree-nodes
0240-search-a-2d-matrix-ii
0268-missing-number
0287-find-the-duplicate-number
0300-longest-increasing-subsequence
0349-intersection-of-two-arrays
0410-split-array-largest-sum
0493-reverse-pairs
0540-single-element-in-a-sorted-array
0611-valid-triangle-number
0704-binary-search
0778-swim-in-rising-water
0875-koko-eating-bananas
1004-max-consecutive-ones-iii
1011-capacity-to-ship-packages-within-d-days
1283-find-the-smallest-divisor-given-a-threshold
1498-number-of-subsequences-that-satisfy-the-given-sum-condition
1539-kth-missing-positive-number
1574-shortest-subarray-to-be-removed-to-make-array-sorted
1631-path-with-minimum-effort
2089-find-target-indices-after-sorting-array
2616-minimize-the-maximum-difference-of-pairs
2826-sorting-three-groups

Bit Manipulation

0029-divide-two-integers
0078-subsets
0090-subsets-ii
0136-single-number
0137-single-number-ii
0190-reverse-bits
0191-number-of-1-bits
0222-count-complete-tree-nodes
0231-power-of-two
0268-missing-number
0287-find-the-duplicate-number
0371-sum-of-two-integers
0389-find-the-difference
0421-maximum-xor-of-two-numbers-in-an-array
1386-cinema-seat-allocation
2220-minimum-bit-flips-to-convert-number
2980-check-if-bitwise-or-has-trailing-zeros
3226-number-of-bit-changes-to-make-two-integers-equal
3513-number-of-unique-xor-triplets-i
3514-number-of-unique-xor-triplets-ii

Sorting

0015-3sum
0016-3sum-closest
0018-4sum
0047-permutations-ii
0049-group-anagrams
0056-merge-intervals
0075-sort-colors
0088-merge-sorted-array
0147-insertion-sort-list
0148-sort-list
0169-majority-element
0179-largest-number
0215-kth-largest-element-in-an-array
0229-majority-element-ii
0242-valid-anagram
0268-missing-number
0295-find-median-from-data-stream
0324-wiggle-sort-ii
0347-top-k-frequent-elements
0349-intersection-of-two-arrays
0389-find-the-difference
0406-queue-reconstruction-by-height
0435-non-overlapping-intervals
0442-find-all-duplicates-in-an-array
0451-sort-characters-by-frequency
0452-minimum-number-of-arrows-to-burst-balloons
0455-assign-cookies
0561-array-partition
0594-longest-harmonious-subsequence
0611-valid-triangle-number
0621-task-scheduler
0628-maximum-product-of-three-numbers
0846-hand-of-straights
0912-sort-an-array
0948-bag-of-tokens
0969-pancake-sorting
1029-two-city-scheduling
1048-longest-string-chain
1051-height-checker
1331-rank-transform-of-an-array
1464-maximum-product-of-two-elements-in-an-array
1498-number-of-subsequences-that-satisfy-the-given-sum-condition
1502-can-make-arithmetic-progression-from-sequence
1859-sorting-the-sentence
2089-find-target-indices-after-sorting-array
2248-intersection-of-multiple-arrays
2418-sort-the-people
2616-minimize-the-maximum-difference-of-pairs
2706-buy-two-chocolates
2996-smallest-missing-integer-greater-than-sequential-prefix-sum
3536-maximum-product-of-two-digits

Divide and Conquer

0004-median-of-two-sorted-arrays
0023-merge-k-sorted-lists
0053-maximum-subarray
0148-sort-list
0169-majority-element
0190-reverse-bits
0191-number-of-1-bits
0215-kth-largest-element-in-an-array
0240-search-a-2d-matrix-ii
0324-wiggle-sort-ii
0347-top-k-frequent-elements
0493-reverse-pairs
0654-maximum-binary-tree
0912-sort-an-array
3737-count-subarrays-with-majority-element-i

Merge Sort

0023-merge-k-sorted-lists
0148-sort-list
0493-reverse-pairs
0912-sort-an-array
3737-count-subarrays-with-majority-element-i

Counting

0169-majority-element
0229-majority-element-ii
0347-top-k-frequent-elements
0451-sort-characters-by-frequency
0594-longest-harmonious-subsequence
0621-task-scheduler
0992-subarrays-with-k-different-integers
1781-sum-of-beauty-of-all-substrings
2248-intersection-of-multiple-arrays
2283-check-if-number-has-equal-digit-count-and-digit-value
3591-check-if-any-element-has-prime-frequency
3737-count-subarrays-with-majority-element-i

Dynamic Programming

0022-generate-parentheses
0032-longest-valid-parentheses
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
0085-maximal-rectangle
0095-unique-binary-search-trees-ii
0096-unique-binary-search-trees
0115-distinct-subsequences
0118-pascals-triangle
0120-triangle
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0123-best-time-to-buy-and-sell-stock-iii
0124-binary-tree-maximum-path-sum
0132-palindrome-partitioning-ii
0188-best-time-to-buy-and-sell-stock-iv
0198-house-robber
0213-house-robber-ii
0221-maximal-square
0300-longest-increasing-subsequence
0309-best-time-to-buy-and-sell-stock-with-cooldown
0312-burst-balloons
0322-coin-change
0410-split-array-largest-sum
0416-partition-equal-subset-sum
0435-non-overlapping-intervals
0494-target-sum
0516-longest-palindromic-subsequence
0518-coin-change-ii
0542-01-matrix
0583-delete-operation-for-two-strings
0647-palindromic-substrings
0673-number-of-longest-increasing-subsequence
0714-best-time-to-buy-and-sell-stock-with-transaction-fee
0787-cheapest-flights-within-k-stops
0907-sum-of-subarray-minimums
1043-partition-array-for-maximum-sum
1048-longest-string-chain
1092-shortest-common-supersequence
1277-count-square-submatrices-with-all-ones
1312-minimum-insertion-steps-to-make-a-string-palindrome
1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1373-maximum-sum-bst-in-binary-tree
1524-number-of-sub-arrays-with-odd-sum
1749-maximum-absolute-sum-of-any-subarray
1976-number-of-ways-to-arrive-at-destination
2616-minimize-the-maximum-difference-of-pairs
2826-sorting-three-groups

Simulation

0054-spiral-matrix
0059-spiral-matrix-ii
0412-fizz-buzz
0946-validate-stack-sequences
1260-shift-2d-grid
1441-build-an-array-with-stack-operations
2149-rearrange-array-elements-by-sign
3069-distribute-elements-into-two-arrays-i
3178-find-the-child-who-has-the-ball-after-k-seconds
3271-hash-divided-string

Union-Find

0128-longest-consecutive-sequence
0130-surrounded-regions
0200-number-of-islands
0547-number-of-provinces
0684-redundant-connection
0695-max-area-of-island
0778-swim-in-rising-water
0785-is-graph-bipartite
0827-making-a-large-island
0947-most-stones-removed-with-same-row-or-column
1020-number-of-enclaves
1319-number-of-operations-to-make-network-connected
1631-path-with-minimum-effort
1971-find-if-path-exists-in-graph

Matrix

0037-sudoku-solver
0048-rotate-image
0054-spiral-matrix
0059-spiral-matrix-ii
0063-unique-paths-ii
0064-minimum-path-sum
0073-set-matrix-zeroes
0074-search-a-2d-matrix
0079-word-search
0085-maximal-rectangle
0130-surrounded-regions
0200-number-of-islands
0221-maximal-square
0240-search-a-2d-matrix-ii
0542-01-matrix
0695-max-area-of-island
0733-flood-fill
0778-swim-in-rising-water
0827-making-a-large-island
0994-rotting-oranges
1020-number-of-enclaves
1091-shortest-path-in-binary-matrix
1260-shift-2d-grid
1277-count-square-submatrices-with-all-ones
1631-path-with-minimum-effort

Prefix Sum

0303-range-sum-query-immutable
0410-split-array-largest-sum
0525-contiguous-array
0560-subarray-sum-equals-k
0724-find-pivot-index
0930-binary-subarrays-with-sum
1004-max-consecutive-ones-iii
1248-count-number-of-nice-subarrays
1423-maximum-points-you-can-obtain-from-cards
1524-number-of-sub-arrays-with-odd-sum
3737-count-subarrays-with-majority-element-i
3903-smallest-stable-index-i
3904-smallest-stable-index-ii

Backtracking

0017-letter-combinations-of-a-phone-number
0022-generate-parentheses
0037-sudoku-solver
0039-combination-sum
0046-permutations
0047-permutations-ii
0051-n-queens
0077-combinations
0078-subsets
0079-word-search
0090-subsets-ii
0095-unique-binary-search-trees-ii
0216-combination-sum-iii
0257-binary-tree-paths
0282-expression-add-operators
0494-target-sum
1980-find-unique-binary-string

Greedy

0011-container-with-most-water
0045-jump-game-ii
0055-jump-game
0122-best-time-to-buy-and-sell-stock-ii
0134-gas-station
0135-candy
0179-largest-number
0324-wiggle-sort-ii
0410-split-array-largest-sum
0435-non-overlapping-intervals
0452-minimum-number-of-arrows-to-burst-balloons
0455-assign-cookies
0561-array-partition
0611-valid-triangle-number
0621-task-scheduler
0624-maximum-distance-in-arrays
0714-best-time-to-buy-and-sell-stock-with-transaction-fee
0738-monotone-increasing-digits
0763-partition-labels
0846-hand-of-straights
0860-lemonade-change
0921-minimum-add-to-make-parentheses-valid
0948-bag-of-tokens
0969-pancake-sorting
1029-two-city-scheduling
1386-cinema-seat-allocation
2091-removing-minimum-and-maximum-from-array
2616-minimize-the-maximum-difference-of-pairs
2706-buy-two-chocolates
3689-maximum-total-subarray-value-i

Enumeration

0204-count-primes
3499-maximize-active-section-with-trade-i
3514-number-of-unique-xor-triplets-ii

Number Theory

0204-count-primes
3591-check-if-any-element-has-prime-frequency

String

0003-longest-substring-without-repeating-characters
0006-zigzag-conversion
0008-string-to-integer-atoi
0012-integer-to-roman
0013-roman-to-integer
0014-longest-common-prefix
0017-letter-combinations-of-a-phone-number
0020-valid-parentheses
0022-generate-parentheses
0028-find-the-index-of-the-first-occurrence-in-a-string
0032-longest-valid-parentheses
0038-count-and-say
0049-group-anagrams
0072-edit-distance
0079-word-search
0115-distinct-subsequences
0132-palindrome-partitioning-ii
0151-reverse-words-in-a-string
0179-largest-number
0205-isomorphic-strings
0208-implement-trie-prefix-tree
0214-shortest-palindrome
0242-valid-anagram
0257-binary-tree-paths
0282-expression-add-operators
0297-serialize-and-deserialize-binary-tree
0344-reverse-string
0389-find-the-difference
0412-fizz-buzz
0424-longest-repeating-character-replacement
0451-sort-characters-by-frequency
0516-longest-palindromic-subsequence
0551-student-attendance-record-i
0583-delete-operation-for-two-strings
0647-palindromic-substrings
0686-repeated-string-match
0763-partition-labels
0796-rotate-string
0921-minimum-add-to-make-parentheses-valid
1021-remove-outermost-parentheses
1048-longest-string-chain
1092-shortest-common-supersequence
1106-parsing-a-boolean-expression
1312-minimum-insertion-steps-to-make-a-string-palindrome
1358-number-of-substrings-containing-all-three-characters
1392-longest-happy-prefix
1662-check-if-two-string-arrays-are-equivalent
1781-sum-of-beauty-of-all-substrings
1784-check-if-binary-string-has-at-most-one-segment-of-ones
1859-sorting-the-sentence
1967-number-of-strings-that-appear-as-substrings-in-word
1980-find-unique-binary-string
2283-check-if-number-has-equal-digit-count-and-digit-value
2418-sort-the-people
3271-hash-divided-string
3499-maximize-active-section-with-trade-i

Stack

0020-valid-parentheses
0032-longest-valid-parentheses
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0094-binary-tree-inorder-traversal
0143-reorder-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0155-min-stack
0173-binary-search-tree-iterator
0225-implement-stack-using-queues
0445-add-two-numbers-ii
0496-next-greater-element-i
0654-maximum-binary-tree
0739-daily-temperatures
0895-maximum-frequency-stack
0901-online-stock-span
0907-sum-of-subarray-minimums
0921-minimum-add-to-make-parentheses-valid
0946-validate-stack-sequences
1008-construct-binary-search-tree-from-preorder-traversal
1021-remove-outermost-parentheses
1106-parsing-a-boolean-expression
1381-design-a-stack-with-increment-operation
1441-build-an-array-with-stack-operations
1475-final-prices-with-a-special-discount-in-a-shop
1574-shortest-subarray-to-be-removed-to-make-array-sorted
2104-sum-of-subarray-ranges
2487-remove-nodes-from-linked-list

Trie

0014-longest-common-prefix
0208-implement-trie-prefix-tree
0421-maximum-xor-of-two-numbers-in-an-array

String Matching

0028-find-the-index-of-the-first-occurrence-in-a-string
0214-shortest-palindrome
0686-repeated-string-match
0796-rotate-string
1392-longest-happy-prefix

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
0621-task-scheduler
0703-kth-largest-element-in-a-stream
0743-network-delay-time
0778-swim-in-rising-water
0787-cheapest-flights-within-k-stops
0912-sort-an-array
1046-last-stone-weight
1464-maximum-product-of-two-elements-in-an-array
1631-path-with-minimum-effort

Bucket Sort

0347-top-k-frequent-elements
0451-sort-characters-by-frequency
0912-sort-an-array

Design

0155-min-stack
0173-binary-search-tree-iterator
0208-implement-trie-prefix-tree
0225-implement-stack-using-queues
0295-find-median-from-data-stream
0297-serialize-and-deserialize-binary-tree
0303-range-sum-query-immutable
0622-design-circular-queue
0703-kth-largest-element-in-a-stream
0705-design-hashset
0706-design-hashmap
0707-design-linked-list
0895-maximum-frequency-stack
0901-online-stock-span
0933-number-of-recent-calls
1381-design-a-stack-with-increment-operation

Queue

0225-implement-stack-using-queues
0239-sliding-window-maximum
0622-design-circular-queue
0933-number-of-recent-calls

Monotonic Stack

0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0496-next-greater-element-i
0654-maximum-binary-tree
0739-daily-temperatures
0901-online-stock-span
0907-sum-of-subarray-minimums
1008-construct-binary-search-tree-from-preorder-traversal
1475-final-prices-with-a-special-discount-in-a-shop
1574-shortest-subarray-to-be-removed-to-make-array-sorted
2104-sum-of-subarray-ranges
2487-remove-nodes-from-linked-list

Sliding Window

0003-longest-substring-without-repeating-characters
0239-sliding-window-maximum
0424-longest-repeating-character-replacement
0594-longest-harmonious-subsequence
0643-maximum-average-subarray-i
0930-binary-subarrays-with-sum
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
1423-maximum-points-you-can-obtain-from-cards
2958-length-of-longest-subarray-with-at-most-k-frequency

Monotonic Queue

0239-sliding-window-maximum

Data Stream

0295-find-median-from-data-stream
0703-kth-largest-element-in-a-stream
0901-online-stock-span
0933-number-of-recent-calls

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
0111-minimum-depth-of-binary-tree
0130-surrounded-regions
0133-clone-graph
0199-binary-tree-right-side-view
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0226-invert-binary-tree
0297-serialize-and-deserialize-binary-tree
0310-minimum-height-trees
0322-coin-change
0542-01-matrix
0547-number-of-provinces
0684-redundant-connection
0695-max-area-of-island
0733-flood-fill
0743-network-delay-time
0778-swim-in-rising-water
0785-is-graph-bipartite
0787-cheapest-flights-within-k-stops
0802-find-eventual-safe-states
0827-making-a-large-island
0841-keys-and-rooms
0965-univalued-binary-tree
0994-rotting-oranges
1020-number-of-enclaves
1091-shortest-path-in-binary-matrix
1319-number-of-operations-to-make-network-connected
1631-path-with-minimum-effort
1971-find-if-path-exists-in-graph

Tree

0094-binary-tree-inorder-traversal
0095-unique-binary-search-trees-ii
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
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0124-binary-tree-maximum-path-sum
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0173-binary-search-tree-iterator
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0226-invert-binary-tree
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0297-serialize-and-deserialize-binary-tree
0450-delete-node-in-a-bst
0543-diameter-of-binary-tree
0563-binary-tree-tilt
0654-maximum-binary-tree
0700-search-in-a-binary-search-tree
0701-insert-into-a-binary-search-tree
0703-kth-largest-element-in-a-stream
0965-univalued-binary-tree
1008-construct-binary-search-tree-from-preorder-traversal
1373-maximum-sum-bst-in-binary-tree
2331-evaluate-boolean-binary-tree
3558-number-of-ways-to-assign-edge-weights-i

Depth-First Search

0079-word-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
0124-binary-tree-maximum-path-sum
0130-surrounded-regions
0133-clone-graph
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0226-invert-binary-tree
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0297-serialize-and-deserialize-binary-tree
0310-minimum-height-trees
0543-diameter-of-binary-tree
0547-number-of-provinces
0563-binary-tree-tilt
0684-redundant-connection
0695-max-area-of-island
0733-flood-fill
0743-network-delay-time
0778-swim-in-rising-water
0785-is-graph-bipartite
0787-cheapest-flights-within-k-stops
0802-find-eventual-safe-states
0827-making-a-large-island
0841-keys-and-rooms
0947-most-stones-removed-with-same-row-or-column
0965-univalued-binary-tree
1020-number-of-enclaves
1319-number-of-operations-to-make-network-connected
1373-maximum-sum-bst-in-binary-tree
1631-path-with-minimum-effort
1971-find-if-path-exists-in-graph
2331-evaluate-boolean-binary-tree
3558-number-of-ways-to-assign-edge-weights-i

Binary Tree

0094-binary-tree-inorder-traversal
0095-unique-binary-search-trees-ii
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
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0124-binary-tree-maximum-path-sum
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0173-binary-search-tree-iterator
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0226-invert-binary-tree
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0297-serialize-and-deserialize-binary-tree
0450-delete-node-in-a-bst
0543-diameter-of-binary-tree
0563-binary-tree-tilt
0654-maximum-binary-tree
0700-search-in-a-binary-search-tree
0701-insert-into-a-binary-search-tree
0703-kth-largest-element-in-a-stream
0965-univalued-binary-tree
1008-construct-binary-search-tree-from-preorder-traversal
1373-maximum-sum-bst-in-binary-tree
2331-evaluate-boolean-binary-tree

Binary Search Tree

0095-unique-binary-search-trees-ii
0096-unique-binary-search-trees
0098-validate-binary-search-tree
0173-binary-search-tree-iterator
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst
0700-search-in-a-binary-search-tree
0701-insert-into-a-binary-search-tree
0703-kth-largest-element-in-a-stream
1008-construct-binary-search-tree-from-preorder-traversal
1373-maximum-sum-bst-in-binary-tree

Quickselect

0215-kth-largest-element-in-an-array
0324-wiggle-sort-ii
0347-top-k-frequent-elements

Rolling Hash

0214-shortest-palindrome
1392-longest-happy-prefix

Hash Function

0214-shortest-palindrome
0705-design-hashset
0706-design-hashmap
1392-longest-happy-prefix

Memoization

0070-climbing-stairs

Iterator

0173-binary-search-tree-iterator

Graph Theory

0133-clone-graph
0207-course-schedule
0210-course-schedule-ii
0310-minimum-height-trees
0547-number-of-provinces
0684-redundant-connection
0743-network-delay-time
0785-is-graph-bipartite
0787-cheapest-flights-within-k-stops
0802-find-eventual-safe-states
0841-keys-and-rooms
0947-most-stones-removed-with-same-row-or-column
1319-number-of-operations-to-make-network-connected
1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1791-find-center-of-star-graph
1971-find-if-path-exists-in-graph
1976-number-of-ways-to-arrive-at-destination

Topological Sort

0207-course-schedule
0210-course-schedule-ii
0310-minimum-height-trees
0802-find-eventual-safe-states
1976-number-of-ways-to-arrive-at-destination

Shortest Path

0743-network-delay-time
0787-cheapest-flights-within-k-stops
1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1976-number-of-ways-to-arrive-at-destination

Combinatorics

0062-unique-paths

Segment Tree

0406-queue-reconstruction-by-height
0493-reverse-pairs
0673-number-of-longest-increasing-subsequence
3737-count-subarrays-with-majority-element-i

Binary Indexed Tree

0406-queue-reconstruction-by-height
0493-reverse-pairs
0673-number-of-longest-increasing-subsequence

Ordered Set

0493-reverse-pairs
0895-maximum-frequency-stack

Geometry

0223-rectangle-area
0391-perfect-rectangle
0836-rectangle-overlap

Sweep Line

0391-perfect-rectangle
0986-interval-list-intersections

DP on Trees

0543-diameter-of-binary-tree
0563-binary-tree-tilt

Hungarian Algorithm

1029-two-city-scheduling

Successive Shortest Path Algorithm

1029-two-city-scheduling

Kosaraju's Algorithm

0802-find-eventual-safe-states

Tarjan's SCC Algorithm

0802-find-eventual-safe-states

Cartesian Tree

0654-maximum-binary-tree

Reservoir Sampling

0382-linked-list-random-node

Randomized

0382-linked-list-random-node

Counting Sort

0561-array-partition
0912-sort-an-array
1051-height-checker

Radix Sort

0912-sort-an-array

Bubble Sort

1051-height-checker