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

LeetCode Topics

Array

0001-two-sum
0004-median-of-two-sorted-arrays
0039-combination-sum
0048-rotate-image
0063-unique-paths-ii
0064-minimum-path-sum
0066-plus-one
0074-search-a-2d-matrix
0079-word-search
0122-best-time-to-buy-and-sell-stock-ii
0123-best-time-to-buy-and-sell-stock-iii
0136-single-number
0153-find-minimum-in-rotated-sorted-array
0198-house-robber
0213-house-robber-ii
0300-longest-increasing-subsequence
0307-range-sum-query-mutable
0312-burst-balloons
0322-coin-change
0376-wiggle-subsequence
0410-split-array-largest-sum
0413-arithmetic-slices
0416-partition-equal-subset-sum
0419-battleships-in-a-board
0473-matchsticks-to-square
0474-ones-and-zeroes
0518-coin-change-ii
0523-continuous-subarray-sum
0553-optimal-division
0646-maximum-length-of-pair-chain
0658-find-k-closest-elements
0698-partition-to-k-equal-sum-subsets
0717-1-bit-and-2-bit-characters
0740-delete-and-earn
0759-set-intersection-size-at-least-two
0787-sliding-puzzle
0853-most-profit-assigning-work
0904-fruit-into-baskets
0948-sort-an-array
1011-capacity-to-ship-packages-within-d-days
1018-binary-prefix-divisible-by-5
1025-minimum-cost-for-tickets
1262-greatest-sum-divisible-by-three
1325-path-with-maximum-probability
1397-search-suggestions-system
1468-check-if-n-and-its-double-exist
1548-check-if-all-1s-are-at-least-length-k-places-away
1590-make-sum-divisible-by-p
1695-maximum-erasure-value
1700-minimum-time-to-make-rope-colorful
1755-defuse-the-bomb
1878-check-if-array-is-sorted-and-rotated
1972-rotating-the-box
2089-maximum-matrix-sum
2175-count-nodes-with-the-highest-score
2262-solving-questions-with-brainpower
2274-keep-multiplying-found-values-by-two
2375-minimum-obstacle-removal-to-reach-corner
2435-paths-in-matrix-whose-sum-is-divisible-by-k
2552-maximum-sum-of-distinct-subarrays-with-length-k
2555-maximize-win-from-two-segments
2640-maximum-number-of-integers-to-choose-from-a-range-i
2711-minimum-time-to-visit-a-cell-in-a-grid
3381-maximum-subarray-sum-with-length-divisible-by-k
3433-count-mentions-per-user
3476-find-minimum-operations-to-make-all-elements-divisible-by-three
3501-delete-nodes-from-linked-list-present-in-array
3512-minimum-operations-to-make-array-sum-divisible-by-k
3517-shortest-distance-after-road-addition-queries-i
3531-count-covered-buildings
3562-maximum-profit-from-trading-stocks-with-discounts
3577-count-the-number-of-computer-unlocking-permutations
3578-count-partitions-with-max-min-difference-at-most-k
3583-count-special-triplets
3606-coupon-code-validator
3610-find-x-sum-of-all-k-long-subarrays-i
3623-count-number-of-trapezoids-i
3640-trionic-array-ii
3834-minimum-operations-to-convert-all-elements-to-zero

Hash Table

0001-two-sum
0003-longest-substring-without-repeating-characters
0133-clone-graph
0146-lru-cache
0395-longest-substring-with-at-least-k-repeating-characters
0409-longest-palindrome
0424-longest-repeating-character-replacement
0523-continuous-subarray-sum
0740-delete-and-earn
0904-fruit-into-baskets
1015-smallest-integer-divisible-by-k
1468-check-if-n-and-its-double-exist
1590-make-sum-divisible-by-p
1695-maximum-erasure-value
2059-unique-length-3-palindromic-subsequences
2274-keep-multiplying-found-values-by-two
2444-longest-ideal-subsequence
2552-maximum-sum-of-distinct-subarrays-with-length-k
2640-maximum-number-of-integers-to-choose-from-a-range-i
3381-maximum-subarray-sum-with-length-divisible-by-k
3501-delete-nodes-from-linked-list-present-in-array
3531-count-covered-buildings
3583-count-special-triplets
3606-coupon-code-validator
3610-find-x-sum-of-all-k-long-subarrays-i
3623-count-number-of-trapezoids-i
3834-minimum-operations-to-convert-all-elements-to-zero

Linked List

0002-add-two-numbers
0146-lru-cache
3501-delete-nodes-from-linked-list-present-in-array

Math

0002-add-two-numbers
0029-divide-two-integers
0048-rotate-image
0062-unique-paths
0066-plus-one
0069-sqrtx
0096-unique-binary-search-trees
0263-ugly-number
0279-perfect-squares
0357-count-numbers-with-unique-digits
0523-continuous-subarray-sum
0553-optimal-division
1015-smallest-integer-divisible-by-k
2288-count-operations-to-obtain-zero
3433-count-mentions-per-user
3476-find-minimum-operations-to-make-all-elements-divisible-by-three
3512-minimum-operations-to-make-array-sum-divisible-by-k
3577-count-the-number-of-computer-unlocking-permutations
3623-count-number-of-trapezoids-i

Recursion

0002-add-two-numbers

Sliding Window

0003-longest-substring-without-repeating-characters
0395-longest-substring-with-at-least-k-repeating-characters
0413-arithmetic-slices
0424-longest-repeating-character-replacement
0658-find-k-closest-elements
0904-fruit-into-baskets
1695-maximum-erasure-value
1755-defuse-the-bomb
2552-maximum-sum-of-distinct-subarrays-with-length-k
2555-maximize-win-from-two-segments
3578-count-partitions-with-max-min-difference-at-most-k
3610-find-x-sum-of-all-k-long-subarrays-i

Dynamic Programming

0062-unique-paths
0063-unique-paths-ii
0064-minimum-path-sum
0072-edit-distance
0091-decode-ways
0095-unique-binary-search-trees-ii
0096-unique-binary-search-trees
0122-best-time-to-buy-and-sell-stock-ii
0123-best-time-to-buy-and-sell-stock-iii
0198-house-robber
0213-house-robber-ii
0279-perfect-squares
0300-longest-increasing-subsequence
0312-burst-balloons
0322-coin-change
0357-count-numbers-with-unique-digits
0376-wiggle-subsequence
0397-integer-replacement
0410-split-array-largest-sum
0413-arithmetic-slices
0416-partition-equal-subset-sum
0473-matchsticks-to-square
0474-ones-and-zeroes
0518-coin-change-ii
0553-optimal-division
0646-maximum-length-of-pair-chain
0698-partition-to-k-equal-sum-subsets
0740-delete-and-earn
0803-cheapest-flights-within-k-stops
0972-knight-dialer
1025-minimum-cost-for-tickets
1262-greatest-sum-divisible-by-three
1474-longest-zigzag-path-in-a-binary-tree
1700-minimum-time-to-make-rope-colorful
2262-solving-questions-with-brainpower
2397-count-number-of-ways-to-place-houses
2435-paths-in-matrix-whose-sum-is-divisible-by-k
2444-longest-ideal-subsequence
3562-maximum-profit-from-trading-stocks-with-discounts
3578-count-partitions-with-max-min-difference-at-most-k
3640-trionic-array-ii

Combinatorics

0062-unique-paths
3577-count-the-number-of-computer-unlocking-permutations

Two Pointers

0658-find-k-closest-elements
0853-most-profit-assigning-work
1468-check-if-n-and-its-double-exist
1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence
1972-rotating-the-box
2414-move-pieces-to-obtain-a-string

Matrix

0048-rotate-image
0063-unique-paths-ii
0064-minimum-path-sum
0074-search-a-2d-matrix
0079-word-search
0419-battleships-in-a-board
0787-sliding-puzzle
1972-rotating-the-box
2089-maximum-matrix-sum
2375-minimum-obstacle-removal-to-reach-corner
2435-paths-in-matrix-whose-sum-is-divisible-by-k
2711-minimum-time-to-visit-a-cell-in-a-grid

Greedy

0122-best-time-to-buy-and-sell-stock-ii
0376-wiggle-subsequence
0397-integer-replacement
0402-remove-k-digits
0409-longest-palindrome
0410-split-array-largest-sum
0646-maximum-length-of-pair-chain
0759-set-intersection-size-at-least-two
0853-most-profit-assigning-work
1262-greatest-sum-divisible-by-three
1700-minimum-time-to-make-rope-colorful
2089-maximum-matrix-sum
2640-maximum-number-of-integers-to-choose-from-a-range-i
3834-minimum-operations-to-convert-all-elements-to-zero

Breadth-First Search

0102-binary-tree-level-order-traversal
0133-clone-graph
0207-course-schedule
0210-course-schedule-ii
0279-perfect-squares
0310-minimum-height-trees
0322-coin-change
0404-sum-of-left-leaves
0530-minimum-absolute-difference-in-bst
0547-number-of-provinces
0655-print-binary-tree
0787-sliding-puzzle
0801-is-graph-bipartite
0803-cheapest-flights-within-k-stops
0820-find-eventual-safe-states
0871-keys-and-rooms
1558-course-schedule-iv
1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero
2375-minimum-obstacle-removal-to-reach-corner
2711-minimum-time-to-visit-a-cell-in-a-grid
3517-shortest-distance-after-road-addition-queries-i

Depth-First Search

0079-word-search
0110-balanced-binary-tree
0133-clone-graph
0207-course-schedule
0210-course-schedule-ii
0235-lowest-common-ancestor-of-a-binary-search-tree
0310-minimum-height-trees
0404-sum-of-left-leaves
0419-battleships-in-a-board
0530-minimum-absolute-difference-in-bst
0547-number-of-provinces
0606-construct-string-from-binary-tree
0655-print-binary-tree
0801-is-graph-bipartite
0803-cheapest-flights-within-k-stops
0820-find-eventual-safe-states
0871-keys-and-rooms
1474-longest-zigzag-path-in-a-binary-tree
1558-course-schedule-iv
1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero
2175-count-nodes-with-the-highest-score
2201-valid-arrangement-of-pairs
2872-maximum-number-of-k-divisible-components
3562-maximum-profit-from-trading-stocks-with-discounts

Graph

0133-clone-graph
0207-course-schedule
0210-course-schedule-ii
0310-minimum-height-trees
0547-number-of-provinces
0801-is-graph-bipartite
0803-cheapest-flights-within-k-stops
0820-find-eventual-safe-states
0871-keys-and-rooms
1325-path-with-maximum-probability
1558-course-schedule-iv
1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero
2201-valid-arrangement-of-pairs
2375-minimum-obstacle-removal-to-reach-corner
2711-minimum-time-to-visit-a-cell-in-a-grid
3189-find-champion-ii
3517-shortest-distance-after-road-addition-queries-i

Heap (Priority Queue)

0658-find-k-closest-elements
0789-kth-largest-element-in-a-stream
0803-cheapest-flights-within-k-stops
0948-sort-an-array
1325-path-with-maximum-probability
1397-search-suggestions-system
2375-minimum-obstacle-removal-to-reach-corner
2711-minimum-time-to-visit-a-cell-in-a-grid
3610-find-x-sum-of-all-k-long-subarrays-i

Shortest Path

0803-cheapest-flights-within-k-stops
1325-path-with-maximum-probability
2375-minimum-obstacle-removal-to-reach-corner
2711-minimum-time-to-visit-a-cell-in-a-grid

Bit Manipulation

0029-divide-two-integers
0136-single-number
0397-integer-replacement
0473-matchsticks-to-square
0698-partition-to-k-equal-sum-subsets
1018-binary-prefix-divisible-by-5
2059-unique-length-3-palindromic-subsequences

Union Find

0547-number-of-provinces
0801-is-graph-bipartite

Binary Search

0004-median-of-two-sorted-arrays
0069-sqrtx
0074-search-a-2d-matrix
0153-find-minimum-in-rotated-sorted-array
0300-longest-increasing-subsequence
0410-split-array-largest-sum
0658-find-k-closest-elements
0853-most-profit-assigning-work
1011-capacity-to-ship-packages-within-d-days
1397-search-suggestions-system
1468-check-if-n-and-its-double-exist
2555-maximize-win-from-two-segments
2640-maximum-number-of-integers-to-choose-from-a-range-i

Divide and Conquer

0004-median-of-two-sorted-arrays
0307-range-sum-query-mutable
0395-longest-substring-with-at-least-k-repeating-characters
0948-sort-an-array

Eulerian Circuit

2201-valid-arrangement-of-pairs

String

0003-longest-substring-without-repeating-characters
0006-zigzag-conversion
0072-edit-distance
0079-word-search
0091-decode-ways
0395-longest-substring-with-at-least-k-repeating-characters
0402-remove-k-digits
0409-longest-palindrome
0424-longest-repeating-character-replacement
0474-ones-and-zeroes
0606-construct-string-from-binary-tree
1397-search-suggestions-system
1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence
1700-minimum-time-to-make-rope-colorful
2059-unique-length-3-palindromic-subsequences
2414-move-pieces-to-obtain-a-string
2444-longest-ideal-subsequence
3606-coupon-code-validator

String Matching

1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence

Sorting

0646-maximum-length-of-pair-chain
0658-find-k-closest-elements
0759-set-intersection-size-at-least-two
0853-most-profit-assigning-work
0948-sort-an-array
1262-greatest-sum-divisible-by-three
1397-search-suggestions-system
1468-check-if-n-and-its-double-exist
2274-keep-multiplying-found-values-by-two
2640-maximum-number-of-integers-to-choose-from-a-range-i
3433-count-mentions-per-user
3531-count-covered-buildings
3606-coupon-code-validator

Backtracking

0039-combination-sum
0079-word-search
0095-unique-binary-search-trees-ii
0357-count-numbers-with-unique-digits
0473-matchsticks-to-square
0698-partition-to-k-equal-sum-subsets

Tree

0095-unique-binary-search-trees-ii
0096-unique-binary-search-trees
0102-binary-tree-level-order-traversal
0110-balanced-binary-tree
0235-lowest-common-ancestor-of-a-binary-search-tree
0404-sum-of-left-leaves
0530-minimum-absolute-difference-in-bst
0606-construct-string-from-binary-tree
0655-print-binary-tree
0789-kth-largest-element-in-a-stream
1474-longest-zigzag-path-in-a-binary-tree
2175-count-nodes-with-the-highest-score
2872-maximum-number-of-k-divisible-components
3562-maximum-profit-from-trading-stocks-with-discounts

Binary Search Tree

0095-unique-binary-search-trees-ii
0096-unique-binary-search-trees
0235-lowest-common-ancestor-of-a-binary-search-tree
0530-minimum-absolute-difference-in-bst
0789-kth-largest-element-in-a-stream

Binary Tree

0095-unique-binary-search-trees-ii
0096-unique-binary-search-trees
0102-binary-tree-level-order-traversal
0110-balanced-binary-tree
0235-lowest-common-ancestor-of-a-binary-search-tree
0404-sum-of-left-leaves
0530-minimum-absolute-difference-in-bst
0606-construct-string-from-binary-tree
0655-print-binary-tree
0789-kth-largest-element-in-a-stream
1474-longest-zigzag-path-in-a-binary-tree
2175-count-nodes-with-the-highest-score

Bitmask

0473-matchsticks-to-square
0698-partition-to-k-equal-sum-subsets

Memoization

0397-integer-replacement
0698-partition-to-k-equal-sum-subsets

Merge Sort

0948-sort-an-array

Bucket Sort

0948-sort-an-array

Radix Sort

0948-sort-an-array

Counting Sort

0948-sort-an-array
3583-count-special-triplets

Prefix Sum

0410-split-array-largest-sum
0523-continuous-subarray-sum
1590-make-sum-divisible-by-p
2059-unique-length-3-palindromic-subsequences
3381-maximum-subarray-sum-with-length-divisible-by-k
3578-count-partitions-with-max-min-difference-at-most-k

Stack

0402-remove-k-digits
3834-minimum-operations-to-convert-all-elements-to-zero

Monotonic Stack

0402-remove-k-digits
3834-minimum-operations-to-convert-all-elements-to-zero

Design

0146-lru-cache
0307-range-sum-query-mutable
0789-kth-largest-element-in-a-stream

Doubly-Linked List

0146-lru-cache

Topological Sort

0207-course-schedule
0210-course-schedule-ii
0310-minimum-height-trees
0820-find-eventual-safe-states
1558-course-schedule-iv

Trie

1397-search-suggestions-system

Binary Indexed Tree

0307-range-sum-query-mutable

Segment Tree

0307-range-sum-query-mutable

Data Stream

0789-kth-largest-element-in-a-stream

Simulation

2274-keep-multiplying-found-values-by-two
2288-count-operations-to-obtain-zero
3433-count-mentions-per-user

Geometry

3623-count-number-of-trapezoids-i

Queue

3578-count-partitions-with-max-min-difference-at-most-k

Monotonic Queue

3578-count-partitions-with-max-min-difference-at-most-k

Brainteaser

3577-count-the-number-of-computer-unlocking-permutations