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

LeetCode Topics

Array

0001-two-sum
0035-search-insert-position
0108-convert-sorted-array-to-binary-search-tree
0118-pascals-triangle
0167-two-sum-ii-input-array-is-sorted
0200-number-of-islands
0209-minimum-size-subarray-sum
0212-word-search-ii
0219-contains-duplicate-ii
0421-maximum-xor-of-two-numbers-in-an-array
0463-island-perimeter
0733-flood-fill
0934-bitwise-ors-of-subarrays
0940-fruit-into-baskets
1032-satisfiability-of-equality-equations
1036-rotting-oranges
1050-construct-binary-search-tree-from-preorder-traversal
1402-count-square-submatrices-with-all-ones
1510-find-lucky-integer-in-an-array
1813-maximum-erasure-value
2020-remove-one-element-to-make-the-array-strictly-increasing
2170-count-number-of-maximum-bitwise-or-subsets
2229-maximum-fruits-harvested-after-at-most-k-steps
2237-longest-palindrome-by-concatenating-two-letter-words
2316-count-hills-and-valleys-in-an-array
2400-minimum-score-after-removals-on-a-tree
2479-meeting-rooms-iii
2497-maximum-matching-of-players-with-trainers
2498-smallest-subarrays-with-maximum-bitwise-or
2527-count-subarrays-with-fixed-bounds
3194-find-words-containing-character
3241-divide-array-into-arrays-with-max-difference
3307-find-the-maximum-sum-of-node-values
3491-find-the-maximum-length-of-valid-subsequence-ii
3648-find-the-maximum-number-of-fruits-collected
3788-maximum-unique-subarray-sum-after-deletion
3789-maximize-subarrays-after-removing-one-conflicting-pair
3791-fruits-into-baskets-iii

Dynamic Programming

0118-pascals-triangle
0826-soup-servings
0934-bitwise-ors-of-subarrays
1402-count-square-submatrices-with-all-ones
1986-largest-color-value-in-a-directed-graph
3307-find-the-maximum-sum-of-node-values
3491-find-the-maximum-length-of-valid-subsequence-ii
3648-find-the-maximum-number-of-fruits-collected

Greedy

1529-max-difference-you-can-get-from-changing-an-integer
2237-longest-palindrome-by-concatenating-two-letter-words
2497-maximum-matching-of-players-with-trainers
3241-divide-array-into-arrays-with-max-difference
3307-find-the-maximum-sum-of-node-values
3360-minimum-deletions-to-make-string-k-special
3788-maximum-unique-subarray-sum-after-deletion

Bit Manipulation

0421-maximum-xor-of-two-numbers-in-an-array
0934-bitwise-ors-of-subarrays
2170-count-number-of-maximum-bitwise-or-subsets
2400-minimum-score-after-removals-on-a-tree
2498-smallest-subarrays-with-maximum-bitwise-or
3307-find-the-maximum-sum-of-node-values

Tree

0094-binary-tree-inorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0437-path-sum-iii
0513-find-bottom-left-tree-value
0515-find-largest-value-in-each-tree-row
0669-trim-a-binary-search-tree
0799-minimum-distance-between-bst-nodes
1030-smallest-string-starting-from-leaf
1050-construct-binary-search-tree-from-preorder-traversal
1427-all-elements-in-two-binary-search-trees
2400-minimum-score-after-removals-on-a-tree
3307-find-the-maximum-sum-of-node-values
3633-maximize-the-number-of-target-nodes-after-connecting-trees-i

Sorting

1427-all-elements-in-two-binary-search-trees
2479-meeting-rooms-iii
2497-maximum-matching-of-players-with-trainers
3241-divide-array-into-arrays-with-max-difference
3307-find-the-maximum-sum-of-node-values
3360-minimum-deletions-to-make-string-k-special

String

0076-minimum-window-substring
0208-implement-trie-prefix-tree
0212-word-search-ii
0438-find-all-anagrams-in-a-string
1030-smallest-string-starting-from-leaf
1032-satisfiability-of-equality-equations
1302-delete-characters-to-make-fancy-string
1567-maximum-number-of-vowels-in-a-substring-of-given-length
2237-longest-palindrome-by-concatenating-two-letter-words
3194-find-words-containing-character
3360-minimum-deletions-to-make-string-k-special
3396-valid-word
3754-maximum-manhattan-distance-after-k-changes

Backtracking

0113-path-sum-ii
0212-word-search-ii
1030-smallest-string-starting-from-leaf
2170-count-number-of-maximum-bitwise-or-subsets

Depth-First Search

0094-binary-tree-inorder-traversal
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0200-number-of-islands
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0437-path-sum-iii
0463-island-perimeter
0513-find-bottom-left-tree-value
0515-find-largest-value-in-each-tree-row
0547-number-of-provinces
0669-trim-a-binary-search-tree
0733-flood-fill
0744-network-delay-time
0799-minimum-distance-between-bst-nodes
0801-is-graph-bipartite
1030-smallest-string-starting-from-leaf
1427-all-elements-in-two-binary-search-trees
1442-number-of-operations-to-make-network-connected
2400-minimum-score-after-removals-on-a-tree
2403-count-unreachable-pairs-of-nodes-in-an-undirected-graph
3633-maximize-the-number-of-target-nodes-after-connecting-trees-i

Binary Tree

0094-binary-tree-inorder-traversal
0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0437-path-sum-iii
0513-find-bottom-left-tree-value
0515-find-largest-value-in-each-tree-row
0669-trim-a-binary-search-tree
0799-minimum-distance-between-bst-nodes
1030-smallest-string-starting-from-leaf
1050-construct-binary-search-tree-from-preorder-traversal
1427-all-elements-in-two-binary-search-trees

Breadth-First Search

0200-number-of-islands
0463-island-perimeter
0513-find-bottom-left-tree-value
0515-find-largest-value-in-each-tree-row
0547-number-of-provinces
0733-flood-fill
0744-network-delay-time
0799-minimum-distance-between-bst-nodes
0801-is-graph-bipartite
1036-rotting-oranges
1442-number-of-operations-to-make-network-connected
2403-count-unreachable-pairs-of-nodes-in-an-undirected-graph
3633-maximize-the-number-of-target-nodes-after-connecting-trees-i

Hash Table

0001-two-sum
0076-minimum-window-substring
0208-implement-trie-prefix-tree
0219-contains-duplicate-ii
0421-maximum-xor-of-two-numbers-in-an-array
0438-find-all-anagrams-in-a-string
0940-fruit-into-baskets
1510-find-lucky-integer-in-an-array
1813-maximum-erasure-value
1986-largest-color-value-in-a-directed-graph
2237-longest-palindrome-by-concatenating-two-letter-words
2479-meeting-rooms-iii
3360-minimum-deletions-to-make-string-k-special
3754-maximum-manhattan-distance-after-k-changes
3788-maximum-unique-subarray-sum-after-deletion

Counting

1510-find-lucky-integer-in-an-array
1986-largest-color-value-in-a-directed-graph
2237-longest-palindrome-by-concatenating-two-letter-words
3360-minimum-deletions-to-make-string-k-special
3754-maximum-manhattan-distance-after-k-changes

Graph

0547-number-of-provinces
0744-network-delay-time
0801-is-graph-bipartite
1032-satisfiability-of-equality-equations
1442-number-of-operations-to-make-network-connected
1986-largest-color-value-in-a-directed-graph
2403-count-unreachable-pairs-of-nodes-in-an-undirected-graph

Topological Sort

1986-largest-color-value-in-a-directed-graph

Memoization

1986-largest-color-value-in-a-directed-graph

Math

0826-soup-servings
1411-convert-binary-number-in-a-linked-list-to-integer
1529-max-difference-you-can-get-from-changing-an-integer
2202-sum-of-k-mirror-numbers
3172-divisible-and-non-divisible-sums-difference
3682-count-the-number-of-arrays-with-k-matching-adjacent-elements
3754-maximum-manhattan-distance-after-k-changes

Linked List

0109-convert-sorted-list-to-binary-search-tree
0114-flatten-binary-tree-to-linked-list
1411-convert-binary-number-in-a-linked-list-to-integer

Stack

0094-binary-tree-inorder-traversal
0114-flatten-binary-tree-to-linked-list
1050-construct-binary-search-tree-from-preorder-traversal

Binary Search Tree

0035-search-insert-position
0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree
0167-two-sum-ii-input-array-is-sorted
0209-minimum-size-subarray-sum
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0669-trim-a-binary-search-tree
0799-minimum-distance-between-bst-nodes
1050-construct-binary-search-tree-from-preorder-traversal
1427-all-elements-in-two-binary-search-trees
2229-maximum-fruits-harvested-after-at-most-k-steps
2498-smallest-subarrays-with-maximum-bitwise-or
3791-fruits-into-baskets-iii

Divide and Conquer

0108-convert-sorted-array-to-binary-search-tree
0109-convert-sorted-list-to-binary-search-tree

Monotonic Stack

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

Union Find

0200-number-of-islands
0547-number-of-provinces
0801-is-graph-bipartite
1032-satisfiability-of-equality-equations
1442-number-of-operations-to-make-network-connected
2403-count-unreachable-pairs-of-nodes-in-an-undirected-graph

Matrix

0200-number-of-islands
0212-word-search-ii
0463-island-perimeter
0733-flood-fill
1036-rotting-oranges
1402-count-square-submatrices-with-all-ones
3648-find-the-maximum-number-of-fruits-collected

Combinatorics

3682-count-the-number-of-arrays-with-k-matching-adjacent-elements

Two Pointers

0167-two-sum-ii-input-array-is-sorted
2497-maximum-matching-of-players-with-trainers

Enumeration

2170-count-number-of-maximum-bitwise-or-subsets
2202-sum-of-k-mirror-numbers
3789-maximize-subarrays-after-removing-one-conflicting-pair

Heap (Priority Queue)

0744-network-delay-time
2479-meeting-rooms-iii

Shortest Path

0744-network-delay-time

Simulation

2479-meeting-rooms-iii

Sliding Window

0076-minimum-window-substring
0209-minimum-size-subarray-sum
0219-contains-duplicate-ii
0438-find-all-anagrams-in-a-string
0940-fruit-into-baskets
1567-maximum-number-of-vowels-in-a-substring-of-given-length
1813-maximum-erasure-value
2229-maximum-fruits-harvested-after-at-most-k-steps
2498-smallest-subarrays-with-maximum-bitwise-or
2527-count-subarrays-with-fixed-bounds

Prefix Sum

0209-minimum-size-subarray-sum
2229-maximum-fruits-harvested-after-at-most-k-steps
3789-maximize-subarrays-after-removing-one-conflicting-pair

Queue

2527-count-subarrays-with-fixed-bounds

Monotonic Queue

2527-count-subarrays-with-fixed-bounds

Segment Tree

3789-maximize-subarrays-after-removing-one-conflicting-pair
3791-fruits-into-baskets-iii

Trie

0208-implement-trie-prefix-tree
0212-word-search-ii
0421-maximum-xor-of-two-numbers-in-an-array

Design

0208-implement-trie-prefix-tree

Ordered Set

3791-fruits-into-baskets-iii

Probability and Statistics

0826-soup-servings