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

LeetCode Topics

Array

0011-container-with-most-water
0088-merge-sorted-array
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0169-majority-element
0189-rotate-array
0952-word-subsets
1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
1895-minimum-number-of-operations-to-move-all-balls-to-each-box
2048-build-array-from-permutation
2215-finding-3-digit-even-numbers
2292-counting-words-with-a-given-prefix
2533-bitwise-xor-of-all-pairings
2766-find-the-prefix-common-array-of-two-arrays
2792-neighboring-bitwise-xor
3309-count-prefix-and-suffix-pairs-i
3822-fill-a-special-grid
3849-equal-sum-grid-partition-i

String

0952-word-subsets
1502-construct-k-palindrome-strings
1895-minimum-number-of-operations-to-move-all-balls-to-each-box
2221-check-if-a-parentheses-string-can-be-valid
2292-counting-words-with-a-given-prefix
3309-count-prefix-and-suffix-pairs-i
3455-minimum-length-of-string-after-operations
3871-minimum-deletions-for-at-most-k-distinct-characters

Prefix Sum

1895-minimum-number-of-operations-to-move-all-balls-to-each-box
3849-equal-sum-grid-partition-i

Trie

3309-count-prefix-and-suffix-pairs-i

Rolling Hash

3309-count-prefix-and-suffix-pairs-i

String Matching

2292-counting-words-with-a-given-prefix
3309-count-prefix-and-suffix-pairs-i

Hash Function

3309-count-prefix-and-suffix-pairs-i

Hash Table

0169-majority-element
0952-word-subsets
1502-construct-k-palindrome-strings
2215-finding-3-digit-even-numbers
2766-find-the-prefix-common-array-of-two-arrays
3455-minimum-length-of-string-after-operations
3871-minimum-deletions-for-at-most-k-distinct-characters

Greedy

0011-container-with-most-water
0122-best-time-to-buy-and-sell-stock-ii
1502-construct-k-palindrome-strings
2221-check-if-a-parentheses-string-can-be-valid
2509-minimize-xor
3845-maximum-sum-of-edge-values-in-a-graph
3871-minimum-deletions-for-at-most-k-distinct-characters

Counting

0169-majority-element
1502-construct-k-palindrome-strings
3455-minimum-length-of-string-after-operations
3871-minimum-deletions-for-at-most-k-distinct-characters

Two Pointers

0011-container-with-most-water
0088-merge-sorted-array
0189-rotate-array

Sorting

0088-merge-sorted-array
0169-majority-element
2215-finding-3-digit-even-numbers
3845-maximum-sum-of-edge-values-in-a-graph
3859-maximum-product-of-two-digits
3871-minimum-deletions-for-at-most-k-distinct-characters

Divide and Conquer

0169-majority-element
3822-fill-a-special-grid

Stack

2221-check-if-a-parentheses-string-can-be-valid

Math

0189-rotate-array
3859-maximum-product-of-two-digits

Bit Manipulation

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

Dynamic Programming

0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii

Brainteaser

2533-bitwise-xor-of-all-pairings

Breadth-First Search

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

Graph

1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
3845-maximum-sum-of-edge-values-in-a-graph

Heap (Priority Queue)

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

Matrix

1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid
3822-fill-a-special-grid
3849-equal-sum-grid-partition-i

Shortest Path

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

Simulation

2048-build-array-from-permutation

Enumeration

2215-finding-3-digit-even-numbers
3849-equal-sum-grid-partition-i

Depth-First Search

3845-maximum-sum-of-edge-values-in-a-graph