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

LeetCode Topics

Array

0004-median-of-two-sorted-arrays
0014-longest-common-prefix
0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0036-valid-sudoku
0037-sudoku-solver
0039-combination-sum
0040-combination-sum-ii
0042-trapping-rain-water
0066-plus-one
0074-search-a-2d-matrix
0078-subsets
0081-search-in-rotated-sorted-array-ii
0085-maximal-rectangle
0090-subsets-ii
0121-best-time-to-buy-and-sell-stock
0153-find-minimum-in-rotated-sorted-array
0162-find-peak-element
0215-kth-largest-element-in-an-array
0216-combination-sum-iii
0239-sliding-window-maximum
0496-next-greater-element-i
0498-diagonal-traverse
0503-next-greater-element-ii
0540-single-element-in-a-sorted-array
0560-subarray-sum-equals-k
0561-array-partition
0643-maximum-average-subarray-i
0704-binary-search
0735-asteroid-collision
0744-find-smallest-letter-greater-than-target
0792-binary-search
0881-boats-to-save-people
0904-fruit-into-baskets
0907-sum-of-subarray-minimums
0930-binary-subarrays-with-sum
0961-n-repeated-element-in-size-2n-array
1004-max-consecutive-ones-iii
1200-minimum-absolute-difference
1207-unique-number-of-occurrences
1248-count-number-of-nice-subarrays
1262-greatest-sum-divisible-by-three
1266-minimum-time-visiting-all-points
1282-group-the-people-given-the-group-size-they-belong-to
1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold
1351-count-negative-numbers-in-a-sorted-matrix
1353-find-resultant-array-after-removing-anagrams
1356-sort-integers-by-the-number-of-1-bits
1390-four-divisors
1402-count-square-submatrices-with-all-ones
1423-maximum-points-you-can-obtain-from-cards
1431-kids-with-the-greatest-number-of-candies
1458-max-dot-product-of-two-subsequences
1470-shuffle-the-array
1536-minimum-swaps-to-arrange-a-binary-grid
1582-special-positions-in-a-binary-matrix
1586-longest-subarray-of-1s-after-deleting-one-element
1621-number-of-subsequences-that-satisfy-the-given-sum-condition
1628-count-submatrices-with-all-ones
1672-richest-customer-wealth
1684-count-the-number-of-consistent-strings
1877-minimize-maximum-pair-sum-in-array
1878-get-biggest-three-rhombus-sums-in-a-grid
1975-maximum-matrix-sum
1980-find-unique-binary-string
1984-minimum-difference-between-highest-and-lowest-of-k-scores
2104-sum-of-subarray-ranges
2125-number-of-laser-beams-in-a-bank
2144-minimum-cost-of-buying-candies-with-discount
2169-simple-bank-system
2373-largest-local-values-in-a-matrix
2401-longest-nice-subarray
2418-sort-the-people
2433-find-the-original-array-of-prefix-xor
2574-left-and-right-sum-differences
2657-find-the-prefix-common-array-of-two-arrays
2798-number-of-employees-who-met-the-target
2917-count-pairs-whose-sum-is-less-than-target
2943-maximize-area-of-square-hole-in-grid
2975-maximum-square-area-by-removing-fences-from-a-field
2976-minimum-cost-to-convert-string-i
2977-minimum-cost-to-convert-string-ii
3010-divide-an-array-into-subarrays-with-minimum-cost-i
3013-divide-an-array-into-subarrays-with-minimum-cost-ii
3047-find-the-largest-area-of-square-inside-two-rectangles
3075-maximize-happiness-of-selected-children
3190-find-minimum-operations-to-make-all-elements-divisible-by-three
3242-count-elements-with-maximum-frequency
3251-maximum-area-of-longest-diagonal-rectangle
3296-minimum-number-of-seconds-to-make-mountain-height-zero
3314-construct-the-minimum-bitwise-array-i
3315-construct-the-minimum-bitwise-array-ii
3379-transformed-array
3453-separate-squares-i
3454-separate-squares-ii
3459-find-the-minimum-area-to-cover-all-ones-ii
3461-find-the-minimum-area-to-cover-all-ones-i
3507-minimum-pair-removal-to-sort-array-i
3512-minimum-operations-to-make-array-sum-divisible-by-k
3581-the-two-sneaky-numbers-of-digitville
3606-coupon-code-validator
3634-minimum-removals-to-balance-array
3637-trionic-array-i
3640-trionic-array-ii
3651-minimum-cost-path-with-teleportations
3701-compute-alternating-sum
3719-longest-balanced-subarray-i
3721-longest-balanced-subarray-ii
3733-length-of-longest-v-shaped-diagonal-segment
3748-sort-matrix-by-diagonals
3778-transform-array-by-parity
4008-restore-finishing-order

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
0540-single-element-in-a-sorted-array
0704-binary-search
0744-find-smallest-letter-greater-than-target
0792-binary-search
1004-max-consecutive-ones-iii
1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold
1351-count-negative-numbers-in-a-sorted-matrix
1621-number-of-subsequences-that-satisfy-the-given-sum-condition
2917-count-pairs-whose-sum-is-less-than-target
3296-minimum-number-of-seconds-to-make-mountain-height-zero
3453-separate-squares-i
3454-separate-squares-ii
3600-maximize-spanning-tree-stability-with-upgrades

Dynamic Programming

0022-generate-parentheses
0042-trapping-rain-water
0070-climbing-stairs
0085-maximal-rectangle
0121-best-time-to-buy-and-sell-stock
0338-counting-bits
0392-is-subsequence
0712-minimum-ascii-delete-sum-for-two-strings
0799-champagne-tower
0907-sum-of-subarray-minimums
1262-greatest-sum-divisible-by-three
1402-count-square-submatrices-with-all-ones
1458-max-dot-product-of-two-subsequences
1586-longest-subarray-of-1s-after-deleting-one-element
1628-count-submatrices-with-all-ones
1653-minimum-deletions-to-make-string-balanced
1888-minimum-number-of-flips-to-make-the-binary-string-alternating
2977-minimum-cost-to-convert-string-ii
3129-find-all-possible-stable-binary-arrays-i
3130-find-all-possible-stable-binary-arrays-ii
3640-trionic-array-ii
3651-minimum-cost-path-with-teleportations
3733-length-of-longest-v-shaped-diagonal-segment

Matrix

0036-valid-sudoku
0037-sudoku-solver
0074-search-a-2d-matrix
0085-maximal-rectangle
0498-diagonal-traverse
1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold
1351-count-negative-numbers-in-a-sorted-matrix
1402-count-square-submatrices-with-all-ones
1536-minimum-swaps-to-arrange-a-binary-grid
1582-special-positions-in-a-binary-matrix
1628-count-submatrices-with-all-ones
1672-richest-customer-wealth
1878-get-biggest-three-rhombus-sums-in-a-grid
1975-maximum-matrix-sum
2125-number-of-laser-beams-in-a-bank
2373-largest-local-values-in-a-matrix
3459-find-the-minimum-area-to-cover-all-ones-ii
3461-find-the-minimum-area-to-cover-all-ones-i
3651-minimum-cost-path-with-teleportations
3733-length-of-longest-v-shaped-diagonal-segment
3748-sort-matrix-by-diagonals

Stack

0020-valid-parentheses
0042-trapping-rain-water
0085-maximal-rectangle
0155-min-stack
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0234-palindrome-linked-list
0496-next-greater-element-i
0503-next-greater-element-ii
0735-asteroid-collision
0907-sum-of-subarray-minimums
1628-count-submatrices-with-all-ones
1653-minimum-deletions-to-make-string-balanced
2104-sum-of-subarray-ranges
2236-maximum-twin-sum-of-a-linked-list

Monotonic Stack

0042-trapping-rain-water
0085-maximal-rectangle
0496-next-greater-element-i
0503-next-greater-element-ii
0907-sum-of-subarray-minimums
1628-count-submatrices-with-all-ones
2104-sum-of-subarray-ranges

Enumeration

1925-count-square-sum-triples
2975-maximum-square-area-by-removing-fences-from-a-field
3010-divide-an-array-into-subarrays-with-minimum-cost-i
3459-find-the-minimum-area-to-cover-all-ones-ii
3713-longest-balanced-substring-i

Sliding Window

0003-longest-substring-without-repeating-characters
0239-sliding-window-maximum
0424-longest-repeating-character-replacement
0643-maximum-average-subarray-i
0904-fruit-into-baskets
0930-binary-subarrays-with-sum
1004-max-consecutive-ones-iii
1248-count-number-of-nice-subarrays
1423-maximum-points-you-can-obtain-from-cards
1586-longest-subarray-of-1s-after-deleting-one-element
1888-minimum-number-of-flips-to-make-the-binary-string-alternating
1984-minimum-difference-between-highest-and-lowest-of-k-scores
2401-longest-nice-subarray
3013-divide-an-array-into-subarrays-with-minimum-cost-ii
3634-minimum-removals-to-balance-array

Simulation

0067-add-binary
0498-diagonal-traverse
0735-asteroid-collision
1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one
1545-find-kth-bit-in-nth-binary-string
1680-concatenation-of-consecutive-binary-numbers
2169-simple-bank-system
2288-count-operations-to-obtain-zero
3379-transformed-array
3498-reverse-degree-of-a-string
3507-minimum-pair-removal-to-sort-array-i
3701-compute-alternating-sum

Sorting

0147-insertion-sort-list
0148-sort-list
0215-kth-largest-element-in-an-array
0242-valid-anagram
0561-array-partition
0761-special-binary-string
0881-boats-to-save-people
1200-minimum-absolute-difference
1262-greatest-sum-divisible-by-three
1353-find-resultant-array-after-removing-anagrams
1356-sort-integers-by-the-number-of-1-bits
1621-number-of-subsequences-that-satisfy-the-given-sum-condition
1877-minimize-maximum-pair-sum-in-array
1878-get-biggest-three-rhombus-sums-in-a-grid
1984-minimum-difference-between-highest-and-lowest-of-k-scores
2144-minimum-cost-of-buying-candies-with-discount
2418-sort-the-people
2917-count-pairs-whose-sum-is-less-than-target
2943-maximize-area-of-square-hole-in-grid
3010-divide-an-array-into-subarrays-with-minimum-cost-i
3075-maximize-happiness-of-selected-children
3606-coupon-code-validator
3634-minimum-removals-to-balance-array
3748-sort-matrix-by-diagonals
3778-transform-array-by-parity

Counting

1356-sort-integers-by-the-number-of-1-bits
1684-count-the-number-of-consistent-strings
3242-count-elements-with-maximum-frequency
3713-longest-balanced-substring-i
3778-transform-array-by-parity
3872-find-most-frequent-vowel-and-consonant

Two Pointers

0019-remove-nth-node-from-end-of-list
0042-trapping-rain-water
0141-linked-list-cycle
0142-linked-list-cycle-ii
0148-sort-list
0151-reverse-words-in-a-string
0160-intersection-of-two-linked-lists
0234-palindrome-linked-list
0392-is-subsequence
0696-count-binary-substrings
0881-boats-to-save-people
0908-middle-of-the-linked-list
1621-number-of-subsequences-that-satisfy-the-given-sum-condition
1877-minimize-maximum-pair-sum-in-array
2216-delete-the-middle-node-of-a-linked-list
2236-maximum-twin-sum-of-a-linked-list
2481-strictly-palindromic-number
2917-count-pairs-whose-sum-is-less-than-target

Divide and Conquer

0004-median-of-two-sorted-arrays
0023-merge-k-sorted-lists
0109-convert-sorted-list-to-binary-search-tree
0148-sort-list
0190-reverse-bits
0191-number-of-1-bits
0215-kth-largest-element-in-an-array
0761-special-binary-string
1382-balance-a-binary-search-tree
3719-longest-balanced-subarray-i
3721-longest-balanced-subarray-ii

String

0003-longest-substring-without-repeating-characters
0008-string-to-integer-atoi
0014-longest-common-prefix
0017-letter-combinations-of-a-phone-number
0020-valid-parentheses
0022-generate-parentheses
0058-length-of-last-word
0067-add-binary
0151-reverse-words-in-a-string
0205-isomorphic-strings
0242-valid-anagram
0392-is-subsequence
0424-longest-repeating-character-replacement
0696-count-binary-substrings
0712-minimum-ascii-delete-sum-for-two-strings
0761-special-binary-string
0771-jewels-and-stones
0812-rotate-string
1028-recover-a-tree-from-preorder-traversal
1264-maximum-number-of-words-you-can-type
1353-find-resultant-array-after-removing-anagrams
1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one
1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n
1461-check-if-a-string-contains-all-binary-codes-of-size-k
1545-find-kth-bit-in-nth-binary-string
1653-minimum-deletions-to-make-string-balanced
1678-goal-parser-interpretation
1684-count-the-number-of-consistent-strings
1689-partitioning-into-minimum-number-of-deci-binary-numbers
1758-minimum-changes-to-make-alternating-binary-string
1784-check-if-binary-string-has-at-most-one-segment-of-ones
1888-minimum-number-of-flips-to-make-the-binary-string-alternating
1980-find-unique-binary-string
2032-largest-odd-number-in-string
2125-number-of-laser-beams-in-a-bank
2418-sort-the-people
2483-minimum-penalty-for-a-shop
2976-minimum-cost-to-convert-string-i
2977-minimum-cost-to-convert-string-ii
3280-convert-date-to-binary
3453-generate-binary-strings-without-adjacent-zeros
3462-vowels-game-in-a-string
3498-reverse-degree-of-a-string
3606-coupon-code-validator
3713-longest-balanced-substring-i
3714-longest-balanced-substring-ii
3872-find-most-frequent-vowel-and-consonant

Hash Table

0003-longest-substring-without-repeating-characters
0017-letter-combinations-of-a-phone-number
0036-valid-sudoku
0037-sudoku-solver
0141-linked-list-cycle
0142-linked-list-cycle-ii
0160-intersection-of-two-linked-lists
0205-isomorphic-strings
0242-valid-anagram
0424-longest-repeating-character-replacement
0496-next-greater-element-i
0560-subarray-sum-equals-k
0771-jewels-and-stones
0865-smallest-subtree-with-all-the-deepest-nodes
0904-fruit-into-baskets
0930-binary-subarrays-with-sum
0961-n-repeated-element-in-size-2n-array
1123-lowest-common-ancestor-of-deepest-leaves
1207-unique-number-of-occurrences
1248-count-number-of-nice-subarrays
1264-maximum-number-of-words-you-can-type
1267-remove-zero-sum-consecutive-nodes-from-linked-list
1282-group-the-people-given-the-group-size-they-belong-to
1353-find-resultant-array-after-removing-anagrams
1461-check-if-a-string-contains-all-binary-codes-of-size-k
1684-count-the-number-of-consistent-strings
1980-find-unique-binary-string
2169-simple-bank-system
2418-sort-the-people
2657-find-the-prefix-common-array-of-two-arrays
2975-maximum-square-area-by-removing-fences-from-a-field
3013-divide-an-array-into-subarrays-with-minimum-cost-ii
3242-count-elements-with-maximum-frequency
3507-minimum-pair-removal-to-sort-array-i
3581-the-two-sneaky-numbers-of-digitville
3606-coupon-code-validator
3713-longest-balanced-substring-i
3714-longest-balanced-substring-ii
3719-longest-balanced-subarray-i
3721-longest-balanced-subarray-ii
3872-find-most-frequent-vowel-and-consonant
4008-restore-finishing-order

Memoization

0070-climbing-stairs
3733-length-of-longest-v-shaped-diagonal-segment

Math

0002-add-two-numbers
0029-divide-two-integers
0050-powx-n
0066-plus-one
0067-add-binary
0070-climbing-stairs
0231-power-of-two
0382-linked-list-random-node
0762-prime-number-of-set-bits-in-binary-representation
1248-count-number-of-nice-subarrays
1266-minimum-time-visiting-all-points
1390-four-divisors
1411-convert-binary-number-in-a-linked-list-to-integer
1486-xor-operation-in-an-array
1523-count-odd-numbers-in-an-interval-range
1622-fancy-sequence
1680-concatenation-of-consecutive-binary-numbers
1878-get-biggest-three-rhombus-sums-in-a-grid
1925-count-square-sum-triples
2032-largest-odd-number-in-string
2119-a-number-after-a-double-reversal
2125-number-of-laser-beams-in-a-bank
2235-add-two-integers
2288-count-operations-to-obtain-zero
2413-smallest-even-multiple
2481-strictly-palindromic-number
3047-find-the-largest-area-of-square-inside-two-rectangles
3190-find-minimum-operations-to-make-all-elements-divisible-by-three
3279-alice-and-bob-playing-flower-game
3280-convert-date-to-binary
3296-minimum-number-of-seconds-to-make-mountain-height-zero
3462-vowels-game-in-a-string
3512-minimum-operations-to-make-array-sum-divisible-by-k
3581-the-two-sneaky-numbers-of-digitville
3830-find-closest-person

Backtracking

0017-letter-combinations-of-a-phone-number
0022-generate-parentheses
0037-sudoku-solver
0039-combination-sum
0040-combination-sum-ii
0078-subsets
0090-subsets-ii
0216-combination-sum-iii
0401-binary-watch
1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n
1980-find-unique-binary-string
3453-generate-binary-strings-without-adjacent-zeros

Greedy

0561-array-partition
0881-boats-to-save-people
1262-greatest-sum-divisible-by-three
1282-group-the-people-given-the-group-size-they-belong-to
1382-balance-a-binary-search-tree
1536-minimum-swaps-to-arrange-a-binary-grid
1689-partitioning-into-minimum-number-of-deci-binary-numbers
1877-minimize-maximum-pair-sum-in-array
1975-maximum-matrix-sum
2032-largest-odd-number-in-string
2144-minimum-cost-of-buying-candies-with-discount
3075-maximize-happiness-of-selected-children
3296-minimum-number-of-seconds-to-make-mountain-height-zero
3600-maximize-spanning-tree-stability-with-upgrades

Trie

0014-longest-common-prefix
2977-minimum-cost-to-convert-string-ii

Brainteaser

2481-strictly-palindromic-number
3462-vowels-game-in-a-string

Game Theory

3462-vowels-game-in-a-string

String Matching

0812-rotate-string

Linked List

0002-add-two-numbers
0019-remove-nth-node-from-end-of-list
0023-merge-k-sorted-lists
0024-swap-nodes-in-pairs
0083-remove-duplicates-from-sorted-list
0109-convert-sorted-list-to-binary-search-tree
0141-linked-list-cycle
0142-linked-list-cycle-ii
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
0382-linked-list-random-node
0908-middle-of-the-linked-list
1267-remove-zero-sum-consecutive-nodes-from-linked-list
1411-convert-binary-number-in-a-linked-list-to-integer
1765-merge-in-between-linked-lists
2216-delete-the-middle-node-of-a-linked-list
2236-maximum-twin-sum-of-a-linked-list
3507-minimum-pair-removal-to-sort-array-i

Recursion

0002-add-two-numbers
0024-swap-nodes-in-pairs
0050-powx-n
0203-remove-linked-list-elements
0206-reverse-linked-list
0231-power-of-two
0234-palindrome-linked-list
1545-find-kth-bit-in-nth-binary-string

Merge Sort

0023-merge-k-sorted-lists
0148-sort-list

Heap (Priority Queue)

0023-merge-k-sorted-lists
0215-kth-largest-element-in-an-array
0239-sliding-window-maximum
1878-get-biggest-three-rhombus-sums-in-a-grid
3013-divide-an-array-into-subarrays-with-minimum-cost-ii
3296-minimum-number-of-seconds-to-make-mountain-height-zero
3507-minimum-pair-removal-to-sort-array-i
3650-minimum-cost-path-with-edge-reversals

Reservoir Sampling

0382-linked-list-random-node

Randomized

0382-linked-list-random-node

Tree

0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-tree
0129-sum-root-to-leaf-numbers
0538-convert-bst-to-greater-tree
0865-smallest-subtree-with-all-the-deepest-nodes
1022-sum-of-root-to-leaf-binary-numbers
1028-recover-a-tree-from-preorder-traversal
1038-binary-search-tree-to-greater-sum-tree
1123-lowest-common-ancestor-of-deepest-leaves
1161-maximum-level-sum-of-a-binary-tree
1339-maximum-product-of-splitted-binary-tree
1382-balance-a-binary-search-tree

Binary Search Tree

0109-convert-sorted-list-to-binary-search-tree
0538-convert-bst-to-greater-tree
1038-binary-search-tree-to-greater-sum-tree
1382-balance-a-binary-search-tree

Binary Tree

0109-convert-sorted-list-to-binary-search-tree
0110-balanced-binary-tree
0129-sum-root-to-leaf-numbers
0538-convert-bst-to-greater-tree
0865-smallest-subtree-with-all-the-deepest-nodes
1022-sum-of-root-to-leaf-binary-numbers
1028-recover-a-tree-from-preorder-traversal
1038-binary-search-tree-to-greater-sum-tree
1123-lowest-common-ancestor-of-deepest-leaves
1161-maximum-level-sum-of-a-binary-tree
1339-maximum-product-of-splitted-binary-tree
1382-balance-a-binary-search-tree

Bit Manipulation

0029-divide-two-integers
0067-add-binary
0078-subsets
0090-subsets-ii
0190-reverse-bits
0191-number-of-1-bits
0231-power-of-two
0338-counting-bits
0401-binary-watch
0461-hamming-distance
0476-number-complement
0693-binary-number-with-alternating-bits
0762-prime-number-of-set-bits-in-binary-representation
0868-binary-gap
1009-complement-of-base-10-integer
1356-sort-integers-by-the-number-of-1-bits
1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one
1461-check-if-a-string-contains-all-binary-codes-of-size-k
1486-xor-operation-in-an-array
1680-concatenation-of-consecutive-binary-numbers
1684-count-the-number-of-consistent-strings
2220-minimum-bit-flips-to-convert-number
2401-longest-nice-subarray
2433-find-the-original-array-of-prefix-xor
2657-find-the-prefix-common-array-of-two-arrays
3314-construct-the-minimum-bitwise-array-i
3315-construct-the-minimum-bitwise-array-ii
3453-generate-binary-strings-without-adjacent-zeros

Design

0155-min-stack
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
1622-fancy-sequence
2169-simple-bank-system

Depth-First Search

0110-balanced-binary-tree
0129-sum-root-to-leaf-numbers
0538-convert-bst-to-greater-tree
0865-smallest-subtree-with-all-the-deepest-nodes
1022-sum-of-root-to-leaf-binary-numbers
1028-recover-a-tree-from-preorder-traversal
1038-binary-search-tree-to-greater-sum-tree
1123-lowest-common-ancestor-of-deepest-leaves
1161-maximum-level-sum-of-a-binary-tree
1339-maximum-product-of-splitted-binary-tree
1382-balance-a-binary-search-tree

Database

0175-combine-two-tables
1693-daily-leads-and-partners

Queue

0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0239-sliding-window-maximum

Monotonic Queue

0239-sliding-window-maximum

Number Theory

2413-smallest-even-multiple

Quickselect

0215-kth-largest-element-in-an-array

Prefix Sum

0560-subarray-sum-equals-k
0930-binary-subarrays-with-sum
1004-max-consecutive-ones-iii
1248-count-number-of-nice-subarrays
1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold
1423-maximum-points-you-can-obtain-from-cards
1878-get-biggest-three-rhombus-sums-in-a-grid
2483-minimum-penalty-for-a-shop
2574-left-and-right-sum-differences
3129-find-all-possible-stable-binary-arrays-i
3130-find-all-possible-stable-binary-arrays-ii
3714-longest-balanced-substring-ii
3719-longest-balanced-subarray-i
3721-longest-balanced-subarray-ii

Breadth-First Search

0865-smallest-subtree-with-all-the-deepest-nodes
1123-lowest-common-ancestor-of-deepest-leaves
1161-maximum-level-sum-of-a-binary-tree

Geometry

1266-minimum-time-visiting-all-points
3047-find-the-largest-area-of-square-inside-two-rectangles

Segment Tree

1622-fancy-sequence
3454-separate-squares-ii
3719-longest-balanced-subarray-i
3721-longest-balanced-subarray-ii

Line Sweep

3454-separate-squares-ii

Doubly-Linked List

3507-minimum-pair-removal-to-sort-array-i

Ordered Set

3507-minimum-pair-removal-to-sort-array-i

Counting Sort

0561-array-partition

Graph Theory

2976-minimum-cost-to-convert-string-i
2977-minimum-cost-to-convert-string-ii
3600-maximize-spanning-tree-stability-with-upgrades
3650-minimum-cost-path-with-edge-reversals

Shortest Path

2976-minimum-cost-to-convert-string-i
2977-minimum-cost-to-convert-string-ii
3650-minimum-cost-path-with-edge-reversals

Rolling Hash

1461-check-if-a-string-contains-all-binary-codes-of-size-k

Hash Function

1461-check-if-a-string-contains-all-binary-codes-of-size-k

Union-Find

3600-maximize-spanning-tree-stability-with-upgrades

Minimum Spanning Tree

3600-maximize-spanning-tree-stability-with-upgrades