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

LeetCode Topics

Array

0011-container-with-most-water
0033-search-in-rotated-sorted-array
0041-first-missing-positive
0063-unique-paths-ii
0064-minimum-path-sum
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0120-triangle
0130-surrounded-regions
0153-find-minimum-in-rotated-sorted-array
0154-find-minimum-in-rotated-sorted-array-ii
0167-two-sum-ii-input-array-is-sorted
0198-house-robber
0200-number-of-islands
0213-house-robber-ii
0217-contains-duplicate
0238-product-of-array-except-self
0239-sliding-window-maximum
0322-coin-change
0396-rotate-function
0416-partition-equal-subset-sum
0486-predict-the-winner
0494-target-sum
0542-01-matrix
0682-baseball-game
0721-accounts-merge
0733-flood-fill
0739-daily-temperatures
0827-making-a-large-island
0853-car-fleet
0874-walking-robot-simulation
0877-stone-game
0977-squares-of-a-sorted-array
0994-rotting-oranges
1008-construct-binary-search-tree-from-preorder-traversal
1020-number-of-enclaves
1091-shortest-path-in-binary-matrix
1260-shift-2d-grid
1306-jump-game-iii
1340-jump-game-v
1345-jump-game-iv
1356-sort-integers-by-the-number-of-1-bits
1391-check-if-there-is-a-valid-path-in-a-grid
1406-stone-game-iii
1464-maximum-product-of-two-elements-in-an-array
1536-minimum-swaps-to-arrange-a-binary-grid
1559-detect-cycles-in-2d-grid
1594-maximum-non-negative-product-in-a-matrix
1631-path-with-minimum-effort
1665-minimum-initial-energy-to-finish-tasks
1674-minimum-moves-to-make-array-complementary
1722-minimize-hamming-distance-after-swap-operations
1727-largest-submatrix-with-rearrangements
1732-find-the-highest-altitude
1765-map-of-highest-peak
1848-minimum-distance-to-the-target-element
1855-maximum-distance-between-a-pair-of-values
1861-rotating-the-box
1928-minimum-cost-to-reach-destination-in-time
1979-find-greatest-common-divisor-of-array
1980-find-unique-binary-string
2033-minimum-operations-to-make-a-uni-value-grid
2035-partition-array-into-two-arrays-to-minimize-sum-difference
2078-two-furthest-houses-with-different-colors
2144-minimum-cost-of-buying-candies-with-discount
2452-words-within-two-edits-of-dictionary
2515-shortest-distance-to-target-string-in-a-circular-array
2540-minimum-common-value
2553-separate-the-digits-in-an-array
2574-left-and-right-sum-differences
2615-sum-of-distances
2784-check-if-array-is-good
2946-matrix-similarity-after-cyclic-shifts
3020-find-the-maximum-number-of-elements-in-subset
3070-count-submatrices-with-top-left-element-and-sum-less-than-k
3093-longest-common-suffix-queries
3212-count-submatrices-with-equal-frequency-of-x-and-y
3225-maximum-score-from-grid-operations
3296-minimum-number-of-seconds-to-make-mountain-height-zero
3300-minimum-element-after-replacement-with-digit-sum
3417-zigzag-grid-traversal-with-skip
3488-closest-equal-element-queries
3623-count-number-of-trapezoids-i
3637-trionic-array-i
3643-flip-square-submatrix-vertically
3653-xor-after-range-multiplication-queries-i
3660-jump-game-ix
3741-minimum-distance-between-three-equal-elements-ii
3742-maximum-path-score-in-a-grid
3761-minimum-absolute-distance-between-mirror-pairs
3838-weighted-word-mapping

Hash Table

0041-first-missing-positive
0076-minimum-window-substring
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0126-word-ladder-ii
0127-word-ladder
0138-copy-list-with-random-pointer
0217-contains-duplicate
0387-first-unique-character-in-a-string
0433-minimum-genetic-mutation
0653-two-sum-iv-input-is-a-bst
0721-accounts-merge
0863-all-nodes-distance-k-in-binary-tree
0874-walking-robot-simulation
0947-most-stones-removed-with-same-row-or-column
0987-vertical-order-traversal-of-a-binary-tree
1345-jump-game-iv
1461-check-if-a-string-contains-all-binary-codes-of-size-k
1674-minimum-moves-to-make-array-complementary
1980-find-unique-binary-string
2540-minimum-common-value
2615-sum-of-distances
2784-check-if-array-is-good
3020-find-the-maximum-number-of-elements-in-subset
3120-count-the-number-of-special-characters-i
3121-count-the-number-of-special-characters-ii
3488-closest-equal-element-queries
3518-smallest-palindromic-rearrangement-ii
3623-count-number-of-trapezoids-i
3741-minimum-distance-between-three-equal-elements-ii
3761-minimum-absolute-distance-between-mirror-pairs

String

0076-minimum-window-substring
0125-valid-palindrome
0126-word-ladder-ii
0127-word-ladder
0387-first-unique-character-in-a-string
0433-minimum-genetic-mutation
0657-robot-return-to-origin
0721-accounts-merge
1461-check-if-a-string-contains-all-binary-codes-of-size-k
1871-jump-game-vii
1980-find-unique-binary-string
2075-decode-the-slanted-ciphertext
2452-words-within-two-edits-of-dictionary
2515-shortest-distance-to-target-string-in-a-circular-array
2833-furthest-point-from-origin
2839-check-if-strings-can-be-made-equal-with-operations-i
3014-minimum-number-of-pushes-to-type-word-i
3093-longest-common-suffix-queries
3120-count-the-number-of-special-characters-i
3121-count-the-number-of-special-characters-ii
3518-smallest-palindromic-rearrangement-ii
3838-weighted-word-mapping

Backtracking

0126-word-ladder-ii
0494-target-sum
1980-find-unique-binary-string

Greedy

0011-container-with-most-water
1536-minimum-swaps-to-arrange-a-binary-grid
1665-minimum-initial-energy-to-finish-tasks
1727-largest-submatrix-with-rearrangements
2078-two-furthest-houses-with-different-colors
2144-minimum-cost-of-buying-candies-with-discount
3014-minimum-number-of-pushes-to-type-word-i
3296-minimum-number-of-seconds-to-make-mountain-height-zero

Matrix

0063-unique-paths-ii
0064-minimum-path-sum
0130-surrounded-regions
0200-number-of-islands
0542-01-matrix
0733-flood-fill
0827-making-a-large-island
0994-rotting-oranges
1020-number-of-enclaves
1091-shortest-path-in-binary-matrix
1260-shift-2d-grid
1391-check-if-there-is-a-valid-path-in-a-grid
1536-minimum-swaps-to-arrange-a-binary-grid
1559-detect-cycles-in-2d-grid
1594-maximum-non-negative-product-in-a-matrix
1631-path-with-minimum-effort
1727-largest-submatrix-with-rearrangements
1765-map-of-highest-peak
1861-rotating-the-box
2033-minimum-operations-to-make-a-uni-value-grid
2946-matrix-similarity-after-cyclic-shifts
3070-count-submatrices-with-top-left-element-and-sum-less-than-k
3212-count-submatrices-with-equal-frequency-of-x-and-y
3225-maximum-score-from-grid-operations
3417-zigzag-grid-traversal-with-skip
3643-flip-square-submatrix-vertically
3742-maximum-path-score-in-a-grid

Bit Manipulation

0190-reverse-bits
0222-count-complete-tree-nodes
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
1461-check-if-a-string-contains-all-binary-codes-of-size-k
1680-concatenation-of-consecutive-binary-numbers
2035-partition-array-into-two-arrays-to-minimize-sum-difference

Sorting

0217-contains-duplicate
0721-accounts-merge
0853-car-fleet
0977-squares-of-a-sorted-array
0987-vertical-order-traversal-of-a-binary-tree
1340-jump-game-v
1356-sort-integers-by-the-number-of-1-bits
1464-maximum-product-of-two-elements-in-an-array
1665-minimum-initial-energy-to-finish-tasks
1727-largest-submatrix-with-rearrangements
2033-minimum-operations-to-make-a-uni-value-grid
2035-partition-array-into-two-arrays-to-minimize-sum-difference
2144-minimum-cost-of-buying-candies-with-discount
2784-check-if-array-is-good
3536-maximum-product-of-two-digits

Counting

0387-first-unique-character-in-a-string
1356-sort-integers-by-the-number-of-1-bits
2833-furthest-point-from-origin
3518-smallest-palindromic-rearrangement-ii

Math

0062-unique-paths
0396-rotate-function
0486-predict-the-winner
0762-prime-number-of-set-bits-in-binary-representation
0788-rotated-digits
0877-stone-game
1406-stone-game-iii
1680-concatenation-of-consecutive-binary-numbers
1979-find-greatest-common-divisor-of-array
2033-minimum-operations-to-make-a-uni-value-grid
2946-matrix-similarity-after-cyclic-shifts
3014-minimum-number-of-pushes-to-type-word-i
3296-minimum-number-of-seconds-to-make-mountain-height-zero
3300-minimum-element-after-replacement-with-digit-sum
3518-smallest-palindromic-rearrangement-ii
3536-maximum-product-of-two-digits
3623-count-number-of-trapezoids-i
3754-concatenate-non-zero-digits-and-multiply-by-sum-i
3761-minimum-absolute-distance-between-mirror-pairs
3783-mirror-distance-of-an-integer

Binary Search

0033-search-in-rotated-sorted-array
0153-find-minimum-in-rotated-sorted-array
0154-find-minimum-in-rotated-sorted-array-ii
0167-two-sum-ii-input-array-is-sorted
0222-count-complete-tree-nodes
1631-path-with-minimum-effort
1855-maximum-distance-between-a-pair-of-values
2035-partition-array-into-two-arrays-to-minimize-sum-difference
2540-minimum-common-value
3296-minimum-number-of-seconds-to-make-mountain-height-zero
3488-closest-equal-element-queries

Heap (Priority Queue)

0239-sliding-window-maximum
0743-network-delay-time
0787-cheapest-flights-within-k-stops
1464-maximum-product-of-two-elements-in-an-array
1631-path-with-minimum-effort
3296-minimum-number-of-seconds-to-make-mountain-height-zero

Simulation

0657-robot-return-to-origin
0682-baseball-game
0874-walking-robot-simulation
1260-shift-2d-grid
1680-concatenation-of-consecutive-binary-numbers
2075-decode-the-slanted-ciphertext
2553-separate-the-digits-in-an-array
2946-matrix-similarity-after-cyclic-shifts
3417-zigzag-grid-traversal-with-skip
3653-xor-after-range-multiplication-queries-i
3838-weighted-word-mapping

Prefix Sum

0238-product-of-array-except-self
1674-minimum-moves-to-make-array-complementary
1732-find-the-highest-altitude
1871-jump-game-vii
2574-left-and-right-sum-differences
2615-sum-of-distances
3070-count-submatrices-with-top-left-element-and-sum-less-than-k
3212-count-submatrices-with-equal-frequency-of-x-and-y
3225-maximum-score-from-grid-operations

Tree

0098-validate-binary-search-tree
0099-recover-binary-search-tree
0100-same-tree
0101-symmetric-tree
0103-binary-tree-zigzag-level-order-traversal
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0110-balanced-binary-tree
0112-path-sum
0114-flatten-binary-tree-to-linked-list
0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers
0173-binary-search-tree-iterator
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0450-delete-node-in-a-bst
0543-diameter-of-binary-tree
0653-two-sum-iv-input-is-a-bst
0662-maximum-width-of-binary-tree
0671-second-minimum-node-in-a-binary-tree
0687-longest-univalue-path
0700-search-in-a-binary-search-tree
0701-insert-into-a-binary-search-tree
0863-all-nodes-distance-k-in-binary-tree
0987-vertical-order-traversal-of-a-binary-tree
1008-construct-binary-search-tree-from-preorder-traversal

Depth-First Search

0098-validate-binary-search-tree
0099-recover-binary-search-tree
0100-same-tree
0101-symmetric-tree
0110-balanced-binary-tree
0112-path-sum
0114-flatten-binary-tree-to-linked-list
0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers
0130-surrounded-regions
0199-binary-tree-right-side-view
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0543-diameter-of-binary-tree
0547-number-of-provinces
0653-two-sum-iv-input-is-a-bst
0662-maximum-width-of-binary-tree
0671-second-minimum-node-in-a-binary-tree
0687-longest-univalue-path
0721-accounts-merge
0733-flood-fill
0743-network-delay-time
0785-is-graph-bipartite
0787-cheapest-flights-within-k-stops
0802-find-eventual-safe-states
0827-making-a-large-island
0863-all-nodes-distance-k-in-binary-tree
0947-most-stones-removed-with-same-row-or-column
0987-vertical-order-traversal-of-a-binary-tree
1020-number-of-enclaves
1306-jump-game-iii
1319-number-of-operations-to-make-network-connected
1391-check-if-there-is-a-valid-path-in-a-grid
1559-detect-cycles-in-2d-grid
1631-path-with-minimum-effort
1722-minimize-hamming-distance-after-swap-operations
3310-remove-methods-from-project

Binary Tree

0098-validate-binary-search-tree
0099-recover-binary-search-tree
0100-same-tree
0101-symmetric-tree
0103-binary-tree-zigzag-level-order-traversal
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0110-balanced-binary-tree
0112-path-sum
0114-flatten-binary-tree-to-linked-list
0124-binary-tree-maximum-path-sum
0129-sum-root-to-leaf-numbers
0173-binary-search-tree-iterator
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0450-delete-node-in-a-bst
0543-diameter-of-binary-tree
0653-two-sum-iv-input-is-a-bst
0662-maximum-width-of-binary-tree
0671-second-minimum-node-in-a-binary-tree
0687-longest-univalue-path
0700-search-in-a-binary-search-tree
0701-insert-into-a-binary-search-tree
0863-all-nodes-distance-k-in-binary-tree
0987-vertical-order-traversal-of-a-binary-tree
1008-construct-binary-search-tree-from-preorder-traversal

Two Pointers

0011-container-with-most-water
0125-valid-palindrome
0143-reorder-list
0167-two-sum-ii-input-array-is-sorted
0653-two-sum-iv-input-is-a-bst
0977-squares-of-a-sorted-array
1855-maximum-distance-between-a-pair-of-values
1861-rotating-the-box
2035-partition-array-into-two-arrays-to-minimize-sum-difference
2095-delete-the-middle-node-of-a-linked-list
2130-maximum-twin-sum-of-a-linked-list
2540-minimum-common-value
3643-flip-square-submatrix-vertically

Dynamic Programming

0062-unique-paths
0063-unique-paths-ii
0064-minimum-path-sum
0120-triangle
0124-binary-tree-maximum-path-sum
0198-house-robber
0213-house-robber-ii
0322-coin-change
0396-rotate-function
0416-partition-equal-subset-sum
0486-predict-the-winner
0494-target-sum
0542-01-matrix
0787-cheapest-flights-within-k-stops
0788-rotated-digits
0877-stone-game
1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance
1340-jump-game-v
1406-stone-game-iii
1594-maximum-non-negative-product-in-a-matrix
1871-jump-game-vii
1928-minimum-cost-to-reach-destination-in-time
1976-number-of-ways-to-arrive-at-destination
2035-partition-array-into-two-arrays-to-minimize-sum-difference
3225-maximum-score-from-grid-operations
3660-jump-game-ix
3742-maximum-path-score-in-a-grid

Breadth-First Search

0100-same-tree
0101-symmetric-tree
0103-binary-tree-zigzag-level-order-traversal
0112-path-sum
0126-word-ladder-ii
0127-word-ladder
0130-surrounded-regions
0199-binary-tree-right-side-view
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0322-coin-change
0433-minimum-genetic-mutation
0542-01-matrix
0547-number-of-provinces
0653-two-sum-iv-input-is-a-bst
0662-maximum-width-of-binary-tree
0721-accounts-merge
0733-flood-fill
0743-network-delay-time
0785-is-graph-bipartite
0787-cheapest-flights-within-k-stops
0802-find-eventual-safe-states
0827-making-a-large-island
0863-all-nodes-distance-k-in-binary-tree
0987-vertical-order-traversal-of-a-binary-tree
0994-rotting-oranges
1020-number-of-enclaves
1091-shortest-path-in-binary-matrix
1306-jump-game-iii
1319-number-of-operations-to-make-network-connected
1345-jump-game-iv
1391-check-if-there-is-a-valid-path-in-a-grid
1559-detect-cycles-in-2d-grid
1631-path-with-minimum-effort
1765-map-of-highest-peak
3310-remove-methods-from-project

Divide and Conquer

0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0190-reverse-bits
3653-xor-after-range-multiplication-queries-i

Geometry

3623-count-number-of-trapezoids-i

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

0130-surrounded-regions
0200-number-of-islands
0547-number-of-provinces
0721-accounts-merge
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
1391-check-if-there-is-a-valid-path-in-a-grid
1559-detect-cycles-in-2d-grid
1631-path-with-minimum-effort
1722-minimize-hamming-distance-after-swap-operations

Trie

2452-words-within-two-edits-of-dictionary
3093-longest-common-suffix-queries

Sliding Window

0076-minimum-window-substring
0239-sliding-window-maximum
1871-jump-game-vii

Database

0175-combine-two-tables
0178-rank-scores
0180-consecutive-numbers
0181-employees-earning-more-than-their-managers
0184-department-highest-salary
0262-trips-and-users
0584-find-customer-referee
0585-investments-in-2016
0586-customer-placing-the-largest-number-of-orders
0596-classes-with-at-least-5-students
0601-human-traffic-of-stadium
0608-tree-node
0620-not-boring-movies
1045-customers-who-bought-all-products
1070-product-sales-analysis-iii
1141-user-activity-for-the-past-30-days-i
1193-monthly-transactions-i
1280-students-and-examinations
1341-movie-rating

Linked List

0114-flatten-binary-tree-to-linked-list
0138-copy-list-with-random-pointer
0143-reorder-list
2095-delete-the-middle-node-of-a-linked-list
2130-maximum-twin-sum-of-a-linked-list

Stack

0114-flatten-binary-tree-to-linked-list
0143-reorder-list
0173-binary-search-tree-iterator
0682-baseball-game
0739-daily-temperatures
0853-car-fleet
1008-construct-binary-search-tree-from-preorder-traversal
2130-maximum-twin-sum-of-a-linked-list

Binary Search Tree

0098-validate-binary-search-tree
0099-recover-binary-search-tree
0173-binary-search-tree-iterator
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst
0653-two-sum-iv-input-is-a-bst
0700-search-in-a-binary-search-tree
0701-insert-into-a-binary-search-tree
1008-construct-binary-search-tree-from-preorder-traversal

Monotonic Stack

0739-daily-temperatures
0853-car-fleet
1008-construct-binary-search-tree-from-preorder-traversal

Design

0173-binary-search-tree-iterator

Iterator

0173-binary-search-tree-iterator

Graph Theory

0207-course-schedule
0210-course-schedule-ii
0547-number-of-provinces
0743-network-delay-time
0785-is-graph-bipartite
0787-cheapest-flights-within-k-stops
0802-find-eventual-safe-states
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
1928-minimum-cost-to-reach-destination-in-time
1976-number-of-ways-to-arrive-at-destination
3310-remove-methods-from-project

Topological Sort

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

Enumeration

3020-find-the-maximum-number-of-elements-in-subset

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

Queue

0239-sliding-window-maximum
0387-first-unique-character-in-a-string

Combinatorics

0062-unique-paths
3518-smallest-palindromic-rearrangement-ii

Ordered Set

2035-partition-array-into-two-arrays-to-minimize-sum-difference

Bitmask

2035-partition-array-into-two-arrays-to-minimize-sum-difference

Number Theory

1979-find-greatest-common-divisor-of-array

Monotonic Queue

0239-sliding-window-maximum

Recursion

0143-reorder-list
0486-predict-the-winner

Game Theory

0486-predict-the-winner
0877-stone-game
1406-stone-game-iii

Minimax

1406-stone-game-iii

Zero-Sum Game

1406-stone-game-iii