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

LeetCode Topics

Array

0026-remove-duplicates-from-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0049-group-anagrams
0054-spiral-matrix
0108-convert-sorted-array-to-binary-search-tree
0215-kth-largest-element-in-an-array
0349-intersection-of-two-arrays
0560-subarray-sum-equals-k
0628-maximum-product-of-three-numbers
0733-flood-fill
0877-stone-game
1140-stone-game-ii
1260-shift-2d-grid
1386-cinema-seat-allocation
1979-find-greatest-common-divisor-of-array
2091-removing-minimum-and-maximum-from-array
2149-rearrange-array-elements-by-sign
2333-minimum-sum-of-squared-difference
2778-sum-of-squares-of-special-elements
2897-apply-operations-on-array-to-maximize-sum-of-squares
2913-subarrays-distinct-element-sum-of-squares-i
2958-length-of-longest-subarray-with-at-most-k-frequency
2996-smallest-missing-integer-greater-than-sequential-prefix-sum
3069-distribute-elements-into-two-arrays-i
3471-find-the-largest-almost-missing-integer
3513-number-of-unique-xor-triplets-i
3514-number-of-unique-xor-triplets-ii
3550-smallest-index-with-digit-sum-equal-to-index
3702-longest-subsequence-with-non-zero-bitwise-xor
3731-find-missing-elements
3867-sum-of-gcd-of-formed-pairs
3876-construct-uniform-parity-array-ii
3903-smallest-stable-index-i
3904-smallest-stable-index-ii
3942-minimum-operations-to-sort-a-permutation

Two Pointers

0005-longest-palindromic-substring
0026-remove-duplicates-from-sorted-array
0028-find-the-index-of-the-first-occurrence-in-a-string
0349-intersection-of-two-arrays
0653-two-sum-iv-input-is-a-bst
2149-rearrange-array-elements-by-sign
3867-sum-of-gcd-of-formed-pairs

Divide and Conquer

0023-merge-k-sorted-lists
0108-convert-sorted-array-to-binary-search-tree
0215-kth-largest-element-in-an-array

Tree

0104-maximum-depth-of-binary-tree
0108-convert-sorted-array-to-binary-search-tree
0653-two-sum-iv-input-is-a-bst
2265-count-nodes-equal-to-average-of-subtree

Binary Search Tree

0034-find-first-and-last-position-of-element-in-sorted-array
0108-convert-sorted-array-to-binary-search-tree
0349-intersection-of-two-arrays
0653-two-sum-iv-input-is-a-bst
2333-minimum-sum-of-squared-difference

Binary Tree

0104-maximum-depth-of-binary-tree
0108-convert-sorted-array-to-binary-search-tree
0653-two-sum-iv-input-is-a-bst
2265-count-nodes-equal-to-average-of-subtree

Hash Table

0017-letter-combinations-of-a-phone-number
0049-group-anagrams
0349-intersection-of-two-arrays
0560-subarray-sum-equals-k
0653-two-sum-iv-input-is-a-bst
1386-cinema-seat-allocation
2897-apply-operations-on-array-to-maximize-sum-of-squares
2913-subarrays-distinct-element-sum-of-squares-i
2958-length-of-longest-subarray-with-at-most-k-frequency
2996-smallest-missing-integer-greater-than-sequential-prefix-sum
3016-minimum-number-of-pushes-to-type-word-ii
3090-maximum-length-substring-with-two-occurrences
3471-find-the-largest-almost-missing-integer
3731-find-missing-elements

Depth-First Search

0104-maximum-depth-of-binary-tree
0653-two-sum-iv-input-is-a-bst
0733-flood-fill
2265-count-nodes-equal-to-average-of-subtree

Breadth-First Search

0104-maximum-depth-of-binary-tree
0653-two-sum-iv-input-is-a-bst
0733-flood-fill

String

0005-longest-palindromic-substring
0017-letter-combinations-of-a-phone-number
0020-valid-parentheses
0022-generate-parentheses
0028-find-the-index-of-the-first-occurrence-in-a-string
0032-longest-valid-parentheses
0049-group-anagrams
0678-valid-parenthesis-string
0856-score-of-parentheses
0921-minimum-add-to-make-parentheses-valid
1021-remove-outermost-parentheses
1081-smallest-subsequence-of-distinct-characters
1541-minimum-insertions-to-balance-a-parentheses-string
1614-maximum-nesting-depth-of-the-parentheses
1927-sum-game
3014-minimum-number-of-pushes-to-type-word-i
3016-minimum-number-of-pushes-to-type-word-ii
3090-maximum-length-substring-with-two-occurrences
3499-maximize-active-section-with-trade-i
3517-smallest-palindromic-rearrangement-i

Backtracking

0017-letter-combinations-of-a-phone-number
0022-generate-parentheses

Linked List

0002-add-two-numbers
0023-merge-k-sorted-lists
0024-swap-nodes-in-pairs
2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points

Math

0002-add-two-numbers
0029-divide-two-integers
0628-maximum-product-of-three-numbers
0836-rectangle-overlap
0877-stone-game
1140-stone-game-ii
1927-sum-game
1979-find-greatest-common-divisor-of-array
3014-minimum-number-of-pushes-to-type-word-i
3345-smallest-divisible-digit-product-i
3513-number-of-unique-xor-triplets-i
3514-number-of-unique-xor-triplets-ii
3536-maximum-product-of-two-digits
3550-smallest-index-with-digit-sum-equal-to-index
3622-check-divisibility-by-digit-sum-and-product
3658-gcd-of-odd-and-even-sums
3723-maximize-sum-of-squares-of-digits
3867-sum-of-gcd-of-formed-pairs
3871-count-commas-in-range-ii
3876-construct-uniform-parity-array-ii

Recursion

0002-add-two-numbers
0024-swap-nodes-in-pairs

Sorting

0049-group-anagrams
0215-kth-largest-element-in-an-array
0349-intersection-of-two-arrays
0628-maximum-product-of-three-numbers
2333-minimum-sum-of-squared-difference
2996-smallest-missing-integer-greater-than-sequential-prefix-sum
3016-minimum-number-of-pushes-to-type-word-ii
3517-smallest-palindromic-rearrangement-i
3536-maximum-product-of-two-digits
3731-find-missing-elements
3867-sum-of-gcd-of-formed-pairs

Heap (Priority Queue)

0023-merge-k-sorted-lists
0215-kth-largest-element-in-an-array
2333-minimum-sum-of-squared-difference

Quickselect

0215-kth-largest-element-in-an-array

Matrix

0054-spiral-matrix
0733-flood-fill
1260-shift-2d-grid

Number Theory

1979-find-greatest-common-divisor-of-array
3658-gcd-of-odd-and-even-sums
3867-sum-of-gcd-of-formed-pairs

Simulation

0054-spiral-matrix
1260-shift-2d-grid
2149-rearrange-array-elements-by-sign
3069-distribute-elements-into-two-arrays-i
3867-sum-of-gcd-of-formed-pairs

Dynamic Programming

0005-longest-palindromic-substring
0022-generate-parentheses
0032-longest-valid-parentheses
0678-valid-parenthesis-string
0877-stone-game
1140-stone-game-ii

Stack

0020-valid-parentheses
0032-longest-valid-parentheses
0678-valid-parenthesis-string
0856-score-of-parentheses
0921-minimum-add-to-make-parentheses-valid
1021-remove-outermost-parentheses
1081-smallest-subsequence-of-distinct-characters
1541-minimum-insertions-to-balance-a-parentheses-string
1614-maximum-nesting-depth-of-the-parentheses

Greedy

0678-valid-parenthesis-string
0921-minimum-add-to-make-parentheses-valid
1081-smallest-subsequence-of-distinct-characters
1386-cinema-seat-allocation
1541-minimum-insertions-to-balance-a-parentheses-string
1927-sum-game
2091-removing-minimum-and-maximum-from-array
2333-minimum-sum-of-squared-difference
2897-apply-operations-on-array-to-maximize-sum-of-squares
3014-minimum-number-of-pushes-to-type-word-i
3016-minimum-number-of-pushes-to-type-word-ii
3723-maximize-sum-of-squares-of-digits

Monotonic Stack

1081-smallest-subsequence-of-distinct-characters

Enumeration

2778-sum-of-squares-of-special-elements
3345-smallest-divisible-digit-product-i
3499-maximize-active-section-with-trade-i
3514-number-of-unique-xor-triplets-ii

Bit Manipulation

0029-divide-two-integers
1386-cinema-seat-allocation
2897-apply-operations-on-array-to-maximize-sum-of-squares
3513-number-of-unique-xor-triplets-i
3514-number-of-unique-xor-triplets-ii
3702-longest-subsequence-with-non-zero-bitwise-xor

Counting Sort

3016-minimum-number-of-pushes-to-type-word-ii
3517-smallest-palindromic-rearrangement-i

Merge Sort

0023-merge-k-sorted-lists

Game Theory

0877-stone-game
1140-stone-game-ii
1927-sum-game

Manacher

0005-longest-palindromic-substring

Minimax

1140-stone-game-ii

Prefix Sum

0560-subarray-sum-equals-k
1140-stone-game-ii
3903-smallest-stable-index-i
3904-smallest-stable-index-ii

Zero-Sum Game

1140-stone-game-ii

Sliding Window

2958-length-of-longest-subarray-with-at-most-k-frequency
3090-maximum-length-substring-with-two-occurrences

Geometry

0836-rectangle-overlap

String Matching

0028-find-the-index-of-the-first-occurrence-in-a-string

Z Algorithm

0028-find-the-index-of-the-first-occurrence-in-a-string

Knuth–Morris–Pratt Algorithm

0028-find-the-index-of-the-first-occurrence-in-a-string

Boyer–Moore String-Search Algorithm

0028-find-the-index-of-the-first-occurrence-in-a-string

Bracket Sequences

0020-valid-parentheses
0032-longest-valid-parentheses
0678-valid-parenthesis-string
0856-score-of-parentheses
0921-minimum-add-to-make-parentheses-valid
1021-remove-outermost-parentheses
1541-minimum-insertions-to-balance-a-parentheses-string
1614-maximum-nesting-depth-of-the-parentheses

Binary Indexed Tree

2913-subarrays-distinct-element-sum-of-squares-i

Segment Tree

2913-subarrays-distinct-element-sum-of-squares-i