A collection of LeetCode questions to ace the coding interviews! - Created using LeetHub 2.0 for Firefox

LeetCode Topics

Math

0070-climbing-stairs
1477-product-of-the-last-k-numbers
1631-number-of-sub-arrays-with-odd-sum
1889-check-if-number-is-a-sum-of-powers-of-three
2348-count-number-of-texts
2448-count-number-of-bad-pairs
2649-count-total-number-of-colored-cells
2802-find-the-punishment-number-of-an-integer
3227-find-missing-and-repeated-values
3635-smallest-divisible-digit-product-ii

Dynamic Programming

0070-climbing-stairs
0905-length-of-longest-fibonacci-subsequence
1000-delete-columns-to-make-sorted-iii
1170-shortest-common-supersequence
1290-make-array-strictly-increasing
1631-number-of-sub-arrays-with-odd-sum
2205-find-good-days-to-rob-the-bank
2348-count-number-of-texts
3716-longest-subsequence-with-decreasing-adjacent-difference

Memoization

0070-climbing-stairs

Array

0407-trapping-rain-water-ii
0658-find-k-closest-elements
0854-making-a-large-island
0905-length-of-longest-fibonacci-subsequence
0925-construct-binary-tree-from-preorder-and-postorder-traversal
1000-delete-columns-to-make-sorted-iii
1290-make-array-strictly-increasing
1364-tuple-with-same-product
1477-product-of-the-last-k-numbers
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
1631-number-of-sub-arrays-with-odd-sum
1819-construct-the-lexicographically-largest-valid-sequence
1876-map-of-highest-peak
1878-check-if-array-is-sorted-and-rotated
1927-maximum-ascending-subarray-sum
2107-find-unique-binary-string
2145-grid-game
2205-find-good-days-to-rob-the-bank
2448-count-number-of-bad-pairs
2473-max-sum-of-a-pair-with-equal-sum-of-digits
2533-bitwise-xor-of-all-pairings
2551-apply-operations-to-an-array
2564-most-profitable-path-in-a-tree
2685-first-completely-painted-row-or-column
2707-merge-two-2d-arrays-by-summing-values
2764-maximum-number-of-fish-in-a-grid
2766-find-the-prefix-common-array-of-two-arrays
2792-neighboring-bitwise-xor
3219-make-lexicographically-smallest-array-by-swapping-elements
3227-find-missing-and-repeated-values
3332-minimum-operations-to-exceed-threshold-value-ii
3372-longest-strictly-increasing-or-strictly-decreasing-subarray
3429-special-array-i
3434-find-the-number-of-distinct-colors-among-the-balls
3716-longest-subsequence-with-decreasing-adjacent-difference

Hash Table

0905-length-of-longest-fibonacci-subsequence
0925-construct-binary-tree-from-preorder-and-postorder-traversal
1364-tuple-with-same-product
1387-find-elements-in-a-contaminated-binary-tree
1460-number-of-substrings-containing-all-three-characters
1915-check-if-one-string-swap-can-make-strings-equal
2107-find-unique-binary-string
2348-count-number-of-texts
2434-design-a-number-container-system
2448-count-number-of-bad-pairs
2473-max-sum-of-a-pair-with-equal-sum-of-digits
2685-first-completely-painted-row-or-column
2707-merge-two-2d-arrays-by-summing-values
2766-find-the-prefix-common-array-of-two-arrays
3227-find-missing-and-repeated-values
3434-find-the-number-of-distinct-colors-among-the-balls
3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii

Bit Manipulation

2509-minimize-xor
2533-bitwise-xor-of-all-pairings
2766-find-the-prefix-common-array-of-two-arrays
2792-neighboring-bitwise-xor

Greedy

2456-construct-smallest-number-from-di-string
2509-minimize-xor
3635-smallest-divisible-digit-product-ii

Brainteaser

2533-bitwise-xor-of-all-pairings

Breadth-First Search

0297-serialize-and-deserialize-binary-tree
0407-trapping-rain-water-ii
0820-find-eventual-safe-states
0854-making-a-large-island
1387-find-elements-in-a-contaminated-binary-tree
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
1558-course-schedule-iv
1876-map-of-highest-peak
2564-most-profitable-path-in-a-tree
2583-divide-nodes-into-the-maximum-number-of-groups
2764-maximum-number-of-fish-in-a-grid

Graph

0820-find-eventual-safe-states
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
1558-course-schedule-iv
2246-maximum-employees-to-be-invited-to-a-meeting
2564-most-profitable-path-in-a-tree
2583-divide-nodes-into-the-maximum-number-of-groups

Heap (Priority Queue)

0407-trapping-rain-water-ii
0658-find-k-closest-elements
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
2434-design-a-number-container-system
2473-max-sum-of-a-pair-with-equal-sum-of-digits
3332-minimum-operations-to-exceed-threshold-value-ii

Matrix

0407-trapping-rain-water-ii
0854-making-a-large-island
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
1876-map-of-highest-peak
2145-grid-game
2685-first-completely-painted-row-or-column
2764-maximum-number-of-fish-in-a-grid
3227-find-missing-and-repeated-values

Shortest Path

1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid

String

0297-serialize-and-deserialize-binary-tree
1000-delete-columns-to-make-sorted-iii
1093-recover-a-tree-from-preorder-traversal
1170-shortest-common-supersequence
1460-number-of-substrings-containing-all-three-characters
1915-check-if-one-string-swap-can-make-strings-equal
2021-remove-all-occurrences-of-a-substring
2107-find-unique-binary-string
2348-count-number-of-texts
2456-construct-smallest-number-from-di-string
2463-minimum-recolors-to-get-k-consecutive-black-blocks
3447-clear-digits
3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii
3635-smallest-divisible-digit-product-ii

Backtracking

1819-construct-the-lexicographically-largest-valid-sequence
2107-find-unique-binary-string
2456-construct-smallest-number-from-di-string
2802-find-the-punishment-number-of-an-integer
3635-smallest-divisible-digit-product-ii

Number Theory

3635-smallest-divisible-digit-product-ii

Prefix Sum

1477-product-of-the-last-k-numbers
1631-number-of-sub-arrays-with-odd-sum
2145-grid-game
2205-find-good-days-to-rob-the-bank

Depth-First Search

0297-serialize-and-deserialize-binary-tree
0820-find-eventual-safe-states
0854-making-a-large-island
1093-recover-a-tree-from-preorder-traversal
1387-find-elements-in-a-contaminated-binary-tree
1558-course-schedule-iv
2246-maximum-employees-to-be-invited-to-a-meeting
2564-most-profitable-path-in-a-tree
2764-maximum-number-of-fish-in-a-grid

Topological Sort

0820-find-eventual-safe-states
1558-course-schedule-iv
2246-maximum-employees-to-be-invited-to-a-meeting

Union Find

0854-making-a-large-island
2583-divide-nodes-into-the-maximum-number-of-groups
2764-maximum-number-of-fish-in-a-grid
3219-make-lexicographically-smallest-array-by-swapping-elements

Sorting

0658-find-k-closest-elements
1290-make-array-strictly-increasing
2473-max-sum-of-a-pair-with-equal-sum-of-digits
3219-make-lexicographically-smallest-array-by-swapping-elements

Design

0297-serialize-and-deserialize-binary-tree
1387-find-elements-in-a-contaminated-binary-tree
1477-product-of-the-last-k-numbers
2434-design-a-number-container-system

Ordered Set

2434-design-a-number-container-system

Simulation

2021-remove-all-occurrences-of-a-substring
2551-apply-operations-to-an-array
3332-minimum-operations-to-exceed-threshold-value-ii
3434-find-the-number-of-distinct-colors-among-the-balls
3447-clear-digits

Counting

1364-tuple-with-same-product
1915-check-if-one-string-swap-can-make-strings-equal
2448-count-number-of-bad-pairs

Stack

2021-remove-all-occurrences-of-a-substring
2456-construct-smallest-number-from-di-string
3447-clear-digits

Data Stream

1477-product-of-the-last-k-numbers

Tree

0297-serialize-and-deserialize-binary-tree
0925-construct-binary-tree-from-preorder-and-postorder-traversal
1093-recover-a-tree-from-preorder-traversal
1387-find-elements-in-a-contaminated-binary-tree
2564-most-profitable-path-in-a-tree

Binary Tree

0297-serialize-and-deserialize-binary-tree
0925-construct-binary-tree-from-preorder-and-postorder-traversal
1093-recover-a-tree-from-preorder-traversal
1387-find-elements-in-a-contaminated-binary-tree

Divide and Conquer

0925-construct-binary-tree-from-preorder-and-postorder-traversal

Two Pointers

0658-find-k-closest-elements
2551-apply-operations-to-an-array
2707-merge-two-2d-arrays-by-summing-values

Binary Search

0658-find-k-closest-elements
1290-make-array-strictly-increasing

Sliding Window

0658-find-k-closest-elements
1460-number-of-substrings-containing-all-three-characters
2463-minimum-recolors-to-get-k-consecutive-black-blocks
3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii