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

LeetCode Topics

String

0003-longest-substring-without-repeating-characters
0020-valid-parentheses
0038-count-and-say
0044-wildcard-matching
0076-minimum-window-substring
0115-distinct-subsequences
0132-palindrome-partitioning-ii
0424-longest-repeating-character-replacement
0443-string-compression
0721-accounts-merge
0868-push-dominoes
1170-shortest-common-supersequence
1197-parsing-a-boolean-expression
1250-longest-common-subsequence
1460-number-of-substrings-containing-all-three-characters
1885-count-number-of-homogenous-substrings
2260-divide-a-string-into-groups-of-size-k
2487-optimal-partition-of-string
3360-minimum-deletions-to-make-string-k-special
3451-string-compression-iii
3617-find-the-original-typed-string-i
3754-maximum-manhattan-distance-after-k-changes

Dynamic Programming

0044-wildcard-matching
0053-maximum-subarray
0115-distinct-subsequences
0118-pascals-triangle
0120-triangle
0123-best-time-to-buy-and-sell-stock-iii
0124-binary-tree-maximum-path-sum
0132-palindrome-partitioning-ii
0152-maximum-product-subarray
0198-house-robber
0213-house-robber-ii
0300-longest-increasing-subsequence
0309-best-time-to-buy-and-sell-stock-with-cooldown
0312-burst-balloons
0322-coin-change
0416-partition-equal-subset-sum
0494-target-sum
0542-01-matrix
0714-best-time-to-buy-and-sell-stock-with-transaction-fee
0803-cheapest-flights-within-k-stops
0868-push-dominoes
1121-partition-array-for-maximum-sum
1170-shortest-common-supersequence
1224-minimum-falling-path-sum-ii
1250-longest-common-subsequence
1559-cherry-pickup-ii
2090-number-of-ways-to-arrive-at-destination
3532-time-taken-to-mark-all-nodes

Hash Table

0001-two-sum
0003-longest-substring-without-repeating-characters
0073-set-matrix-zeroes
0076-minimum-window-substring
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0128-longest-consecutive-sequence
0133-clone-graph
0141-linked-list-cycle
0142-linked-list-cycle-ii
0169-majority-element
0229-majority-element-ii
0268-missing-number
0424-longest-repeating-character-replacement
0560-subarray-sum-equals-k
0721-accounts-merge
0797-rabbits-in-forest
0893-all-nodes-distance-k-in-binary-tree
0940-fruit-into-baskets
0966-binary-subarrays-with-sum
1029-vertical-order-traversal-of-a-binary-tree
1370-count-number-of-nice-subarrays
1460-number-of-substrings-containing-all-three-characters
1500-count-largest-group
2487-optimal-partition-of-string
2552-maximum-sum-of-distinct-subarrays-with-length-k
2626-count-the-number-of-good-subarrays
2915-count-of-interesting-subarrays
3193-maximum-strong-pair-xor-i
3360-minimum-deletions-to-make-string-k-special
3656-minimum-number-of-operations-to-make-elements-in-array-distinct
3754-maximum-manhattan-distance-after-k-changes
3809-properties-graph

Sliding Window

0003-longest-substring-without-repeating-characters
0076-minimum-window-substring
0424-longest-repeating-character-replacement
0940-fruit-into-baskets
0966-binary-subarrays-with-sum
1046-max-consecutive-ones-iii
1370-count-number-of-nice-subarrays
1460-number-of-substrings-containing-all-three-characters
1538-maximum-points-you-can-obtain-from-cards
2478-longest-nice-subarray
2552-maximum-sum-of-distinct-subarrays-with-length-k
2626-count-the-number-of-good-subarrays
3193-maximum-strong-pair-xor-i

Array

0001-two-sum
0015-3sum
0018-4sum
0026-remove-duplicates-from-sorted-array
0031-next-permutation
0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0048-rotate-image
0053-maximum-subarray
0054-spiral-matrix
0056-merge-intervals
0073-set-matrix-zeroes
0074-search-a-2d-matrix
0075-sort-colors
0081-search-in-rotated-sorted-array-ii
0088-merge-sorted-array
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0118-pascals-triangle
0120-triangle
0123-best-time-to-buy-and-sell-stock-iii
0128-longest-consecutive-sequence
0130-surrounded-regions
0136-single-number
0152-maximum-product-subarray
0153-find-minimum-in-rotated-sorted-array
0162-find-peak-element
0169-majority-element
0189-rotate-array
0198-house-robber
0200-number-of-islands
0213-house-robber-ii
0229-majority-element-ii
0268-missing-number
0283-move-zeroes
0287-find-the-duplicate-number
0300-longest-increasing-subsequence
0309-best-time-to-buy-and-sell-stock-with-cooldown
0312-burst-balloons
0322-coin-change
0416-partition-equal-subset-sum
0455-assign-cookies
0463-island-perimeter
0485-max-consecutive-ones
0494-target-sum
0540-single-element-in-a-sorted-array
0542-01-matrix
0560-subarray-sum-equals-k
0695-max-area-of-island
0714-best-time-to-buy-and-sell-stock-with-transaction-fee
0721-accounts-merge
0733-flood-fill
0797-rabbits-in-forest
0890-lemonade-change
0940-fruit-into-baskets
0948-sort-an-array
0966-binary-subarrays-with-sum
1036-rotting-oranges
1046-max-consecutive-ones-iii
1050-construct-binary-search-tree-from-preorder-traversal
1073-number-of-enclaves
1121-partition-array-for-maximum-sum
1171-shortest-path-in-binary-matrix
1224-minimum-falling-path-sum-ii
1370-count-number-of-nice-subarrays
1478-maximum-number-of-events-that-can-be-attended
1538-maximum-points-you-can-obtain-from-cards
1559-cherry-pickup-ii
1656-count-good-triplets
1663-detect-cycles-in-2d-grid
1753-path-with-minimum-effort
1878-check-if-array-is-sorted-and-rotated
2015-determine-whether-matrix-can-be-obtained-by-rotation
2160-minimum-operations-to-make-a-uni-value-grid
2180-maximum-number-of-tasks-you-can-assign
2212-removing-minimum-and-maximum-from-array
2271-rearrange-array-elements-by-sign
2280-count-good-triplets-in-an-array
2478-longest-nice-subarray
2497-maximum-matching-of-players-with-trainers
2552-maximum-sum-of-distinct-subarrays-with-length-k
2626-count-the-number-of-good-subarrays
2915-count-of-interesting-subarrays
3193-maximum-strong-pair-xor-i
3348-minimum-cost-walk-in-weighted-graph
3430-count-days-without-meetings
3524-minimum-number-of-flips-to-make-binary-grid-palindromic-ii
3526-minimum-number-of-flips-to-make-binary-grid-palindromic-i
3656-minimum-number-of-operations-to-make-elements-in-array-distinct
3657-check-if-grid-can-be-cut-into-sections
3809-properties-graph

Bit Manipulation

0136-single-number
0222-count-complete-tree-nodes
0268-missing-number
0287-find-the-duplicate-number
2478-longest-nice-subarray
3193-maximum-strong-pair-xor-i
3348-minimum-cost-walk-in-weighted-graph
3600-find-the-k-th-character-in-string-game-i

Trie

3193-maximum-strong-pair-xor-i

Matrix

0048-rotate-image
0054-spiral-matrix
0073-set-matrix-zeroes
0074-search-a-2d-matrix
0130-surrounded-regions
0200-number-of-islands
0463-island-perimeter
0542-01-matrix
0695-max-area-of-island
0733-flood-fill
1036-rotting-oranges
1073-number-of-enclaves
1171-shortest-path-in-binary-matrix
1224-minimum-falling-path-sum-ii
1559-cherry-pickup-ii
1663-detect-cycles-in-2d-grid
1753-path-with-minimum-effort
2015-determine-whether-matrix-can-be-obtained-by-rotation
2160-minimum-operations-to-make-a-uni-value-grid
3524-minimum-number-of-flips-to-make-binary-grid-palindromic-ii
3526-minimum-number-of-flips-to-make-binary-grid-palindromic-i

Two Pointers

0015-3sum
0018-4sum
0026-remove-duplicates-from-sorted-array
0031-next-permutation
0075-sort-colors
0088-merge-sorted-array
0141-linked-list-cycle
0142-linked-list-cycle-ii
0189-rotate-array
0234-palindrome-linked-list
0283-move-zeroes
0287-find-the-duplicate-number
0443-string-compression
0455-assign-cookies
0868-push-dominoes
0908-middle-of-the-linked-list
2271-rearrange-array-elements-by-sign
2497-maximum-matching-of-players-with-trainers
3524-minimum-number-of-flips-to-make-binary-grid-palindromic-ii
3526-minimum-number-of-flips-to-make-binary-grid-palindromic-i

Divide and Conquer

0053-maximum-subarray
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0169-majority-element
0948-sort-an-array
2280-count-good-triplets-in-an-array

Sorting

0015-3sum
0018-4sum
0056-merge-intervals
0075-sort-colors
0088-merge-sorted-array
0169-majority-element
0229-majority-element-ii
0268-missing-number
0455-assign-cookies
0721-accounts-merge
0948-sort-an-array
1029-vertical-order-traversal-of-a-binary-tree
1478-maximum-number-of-events-that-can-be-attended
2160-minimum-operations-to-make-a-uni-value-grid
2180-maximum-number-of-tasks-you-can-assign
2497-maximum-matching-of-players-with-trainers
3360-minimum-deletions-to-make-string-k-special
3430-count-days-without-meetings
3657-check-if-grid-can-be-cut-into-sections

Math

0048-rotate-image
0050-powx-n
0189-rotate-array
0268-missing-number
0797-rabbits-in-forest
1370-count-number-of-nice-subarrays
1500-count-largest-group
1885-count-number-of-homogenous-substrings
2160-minimum-operations-to-make-a-uni-value-grid
3600-find-the-k-th-character-in-string-game-i
3754-maximum-manhattan-distance-after-k-changes

Binary Search

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
0222-count-complete-tree-nodes
0268-missing-number
0287-find-the-duplicate-number
0300-longest-increasing-subsequence
0540-single-element-in-a-sorted-array
1046-max-consecutive-ones-iii
1753-path-with-minimum-effort
2180-maximum-number-of-tasks-you-can-assign
2280-count-good-triplets-in-an-array

Recursion

0044-wildcard-matching
0050-powx-n
0206-reverse-linked-list
0234-palindrome-linked-list
1197-parsing-a-boolean-expression
3600-find-the-k-th-character-in-string-game-i

Counting

0169-majority-element
0229-majority-element-ii
3360-minimum-deletions-to-make-string-k-special
3754-maximum-manhattan-distance-after-k-changes

Greedy

0044-wildcard-matching
0455-assign-cookies
0714-best-time-to-buy-and-sell-stock-with-transaction-fee
0797-rabbits-in-forest
0890-lemonade-change
1478-maximum-number-of-events-that-can-be-attended
2180-maximum-number-of-tasks-you-can-assign
2212-removing-minimum-and-maximum-from-array
2487-optimal-partition-of-string
2497-maximum-matching-of-players-with-trainers
3360-minimum-deletions-to-make-string-k-special

Heap (Priority Queue)

0744-network-delay-time
0803-cheapest-flights-within-k-stops
0948-sort-an-array
1478-maximum-number-of-events-that-can-be-attended
1753-path-with-minimum-effort

Merge Sort

0948-sort-an-array
2280-count-good-triplets-in-an-array

Bucket Sort

0948-sort-an-array

Radix Sort

0948-sort-an-array

Counting Sort

0948-sort-an-array

Stack

0020-valid-parentheses
0094-binary-tree-inorder-traversal
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0155-min-stack
0173-binary-search-tree-iterator
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0234-palindrome-linked-list
1050-construct-binary-search-tree-from-preorder-traversal
1197-parsing-a-boolean-expression

Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0099-recover-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
0105-construct-binary-tree-from-preorder-and-inorder-traversal
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
0222-count-complete-tree-nodes
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
0662-maximum-width-of-binary-tree
0783-search-in-a-binary-search-tree
0784-insert-into-a-binary-search-tree
0893-all-nodes-distance-k-in-binary-tree
1029-vertical-order-traversal-of-a-binary-tree
1050-construct-binary-search-tree-from-preorder-traversal
3532-time-taken-to-mark-all-nodes

Depth-First Search

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0099-recover-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
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0463-island-perimeter
0543-diameter-of-binary-tree
0547-number-of-provinces
0662-maximum-width-of-binary-tree
0695-max-area-of-island
0721-accounts-merge
0733-flood-fill
0744-network-delay-time
0801-is-graph-bipartite
0803-cheapest-flights-within-k-stops
0871-keys-and-rooms
0893-all-nodes-distance-k-in-binary-tree
1029-vertical-order-traversal-of-a-binary-tree
1073-number-of-enclaves
1442-number-of-operations-to-make-network-connected
1663-detect-cycles-in-2d-grid
1753-path-with-minimum-effort
2438-find-closest-node-to-given-two-nodes
2439-longest-cycle-in-a-graph
2793-count-the-number-of-complete-components
3532-time-taken-to-mark-all-nodes
3809-properties-graph

Binary Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0099-recover-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
0105-construct-binary-tree-from-preorder-and-inorder-traversal
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
0222-count-complete-tree-nodes
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
0662-maximum-width-of-binary-tree
0783-search-in-a-binary-search-tree
0784-insert-into-a-binary-search-tree
0893-all-nodes-distance-k-in-binary-tree
1029-vertical-order-traversal-of-a-binary-tree
1050-construct-binary-search-tree-from-preorder-traversal

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
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0322-coin-change
0463-island-perimeter
0542-01-matrix
0547-number-of-provinces
0662-maximum-width-of-binary-tree
0695-max-area-of-island
0721-accounts-merge
0733-flood-fill
0744-network-delay-time
0801-is-graph-bipartite
0803-cheapest-flights-within-k-stops
0871-keys-and-rooms
0893-all-nodes-distance-k-in-binary-tree
1029-vertical-order-traversal-of-a-binary-tree
1036-rotting-oranges
1073-number-of-enclaves
1171-shortest-path-in-binary-matrix
1442-number-of-operations-to-make-network-connected
1663-detect-cycles-in-2d-grid
1753-path-with-minimum-effort
2439-longest-cycle-in-a-graph
2793-count-the-number-of-complete-components
3809-properties-graph

Binary Search Tree

0098-validate-binary-search-tree
0099-recover-binary-search-tree
0173-binary-search-tree-iterator
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst
0783-search-in-a-binary-search-tree
0784-insert-into-a-binary-search-tree
1050-construct-binary-search-tree-from-preorder-traversal

Monotonic Stack

1050-construct-binary-search-tree-from-preorder-traversal

Design

0155-min-stack
0173-binary-search-tree-iterator
0225-implement-stack-using-queues
0232-implement-queue-using-stacks

Iterator

0173-binary-search-tree-iterator

Union Find

0128-longest-consecutive-sequence
0130-surrounded-regions
0200-number-of-islands
0547-number-of-provinces
0695-max-area-of-island
0721-accounts-merge
0801-is-graph-bipartite
1073-number-of-enclaves
1442-number-of-operations-to-make-network-connected
1663-detect-cycles-in-2d-grid
1753-path-with-minimum-effort
2793-count-the-number-of-complete-components
3348-minimum-cost-walk-in-weighted-graph
3809-properties-graph

Graph

0133-clone-graph
0207-course-schedule
0210-course-schedule-ii
0547-number-of-provinces
0744-network-delay-time
0801-is-graph-bipartite
0803-cheapest-flights-within-k-stops
0871-keys-and-rooms
1442-number-of-operations-to-make-network-connected
1916-find-center-of-star-graph
2090-number-of-ways-to-arrive-at-destination
2438-find-closest-node-to-given-two-nodes
2439-longest-cycle-in-a-graph
2793-count-the-number-of-complete-components
3348-minimum-cost-walk-in-weighted-graph
3532-time-taken-to-mark-all-nodes
3809-properties-graph

Prefix Sum

0560-subarray-sum-equals-k
0966-binary-subarrays-with-sum
1046-max-consecutive-ones-iii
1370-count-number-of-nice-subarrays
1538-maximum-points-you-can-obtain-from-cards
2915-count-of-interesting-subarrays

Backtracking

0494-target-sum

Simulation

0054-spiral-matrix
2260-divide-a-string-into-groups-of-size-k
2271-rearrange-array-elements-by-sign
3600-find-the-k-th-character-in-string-game-i

Linked List

0141-linked-list-cycle
0142-linked-list-cycle-ii
0206-reverse-linked-list
0234-palindrome-linked-list
0237-delete-node-in-a-linked-list
0328-odd-even-linked-list
0908-middle-of-the-linked-list

Enumeration

1656-count-good-triplets

Binary Indexed Tree

2280-count-good-triplets-in-an-array

Segment Tree

2280-count-good-triplets-in-an-array

Ordered Set

2280-count-good-triplets-in-an-array

Queue

0225-implement-stack-using-queues
0232-implement-queue-using-stacks
2180-maximum-number-of-tasks-you-can-assign

Monotonic Queue

2180-maximum-number-of-tasks-you-can-assign

Topological Sort

0207-course-schedule
0210-course-schedule-ii
2090-number-of-ways-to-arrive-at-destination
2439-longest-cycle-in-a-graph

Shortest Path

0744-network-delay-time
0803-cheapest-flights-within-k-stops
2090-number-of-ways-to-arrive-at-destination