Leetcode-Prep

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

LeetCode Topics

Hash Table

0037-sudoku-solver
0076-minimum-window-substring
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0141-linked-list-cycle
0142-linked-list-cycle-ii
0169-majority-element
0217-contains-duplicate
0242-valid-anagram
0268-missing-number
0347-top-k-frequent-elements
0387-first-unique-character-in-a-string
0763-partition-labels
1832-check-if-the-sentence-is-pangram

Linked List

0141-linked-list-cycle
0142-linked-list-cycle-ii
0148-sort-list
0206-reverse-linked-list
0876-middle-of-the-linked-list

Two Pointers

0011-container-with-most-water
0015-3sum
0027-remove-element
0075-sort-colors
0080-remove-duplicates-from-sorted-array-ii
0125-valid-palindrome
0141-linked-list-cycle
0142-linked-list-cycle-ii
0148-sort-list
0287-find-the-duplicate-number
0344-reverse-string
0541-reverse-string-ii
0763-partition-labels
0876-middle-of-the-linked-list

Array

0011-container-with-most-water
0015-3sum
0027-remove-element
0037-sudoku-solver
0039-combination-sum
0051-n-queens
0066-plus-one
0075-sort-colors
0078-subsets
0080-remove-duplicates-from-sorted-array-ii
0090-subsets-ii
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0136-single-number
0162-find-peak-element
0169-majority-element
0217-contains-duplicate
0268-missing-number
0287-find-the-duplicate-number
0347-top-k-frequent-elements
0410-split-array-largest-sum
0628-maximum-product-of-three-numbers
0704-binary-search
0852-peak-index-in-a-mountain-array
0875-koko-eating-bananas
0896-monotonic-array
1011-capacity-to-ship-packages-within-d-days
1482-minimum-number-of-days-to-make-m-bouquets
2951-find-the-peaks
2976-minimum-cost-to-convert-string-i
3300-minimum-element-after-replacement-with-digit-sum

String

0076-minimum-window-substring
0125-valid-palindrome
0242-valid-anagram
0344-reverse-string
0387-first-unique-character-in-a-string
0541-reverse-string-ii
0763-partition-labels
1832-check-if-the-sentence-is-pangram
2976-minimum-cost-to-convert-string-i

Graph Theory

2976-minimum-cost-to-convert-string-i

Shortest Path

2976-minimum-cost-to-convert-string-i

Greedy

0011-container-with-most-water
0410-split-array-largest-sum
0763-partition-labels

Sorting

0015-3sum
0075-sort-colors
0148-sort-list
0169-majority-element
0217-contains-duplicate
0242-valid-anagram
0268-missing-number
0347-top-k-frequent-elements
0628-maximum-product-of-three-numbers

Divide and Conquer

0105-construct-binary-tree-from-preorder-and-inorder-traversal
0148-sort-list
0169-majority-element
0347-top-k-frequent-elements

Merge Sort

0148-sort-list

Queue

0387-first-unique-character-in-a-string

Counting

0169-majority-element
0347-top-k-frequent-elements
0387-first-unique-character-in-a-string

Bit Manipulation

0029-divide-two-integers
0078-subsets
0090-subsets-ii
0136-single-number
0231-power-of-two
0268-missing-number
0287-find-the-duplicate-number

Math

0029-divide-two-integers
0050-powx-n
0066-plus-one
0069-sqrtx
0070-climbing-stairs
0231-power-of-two
0268-missing-number
0326-power-of-three
0509-fibonacci-number
0628-maximum-product-of-three-numbers
1523-count-odd-numbers-in-an-interval-range
3300-minimum-element-after-replacement-with-digit-sum

Binary Search

0069-sqrtx
0162-find-peak-element
0268-missing-number
0278-first-bad-version
0287-find-the-duplicate-number
0374-guess-number-higher-or-lower
0410-split-array-largest-sum
0704-binary-search
0852-peak-index-in-a-mountain-array
0875-koko-eating-bananas
1011-capacity-to-ship-packages-within-d-days
1482-minimum-number-of-days-to-make-m-bouquets

Heap (Priority Queue)

0347-top-k-frequent-elements

Bucket Sort

0347-top-k-frequent-elements

Quickselect

0347-top-k-frequent-elements

Dynamic Programming

0070-climbing-stairs
0124-binary-tree-maximum-path-sum
0410-split-array-largest-sum
0509-fibonacci-number

Recursion

0050-powx-n
0206-reverse-linked-list
0231-power-of-two
0326-power-of-three
0509-fibonacci-number

Memoization

0070-climbing-stairs
0509-fibonacci-number

Sliding Window

0076-minimum-window-substring

Backtracking

0037-sudoku-solver
0039-combination-sum
0051-n-queens
0078-subsets
0090-subsets-ii
0113-path-sum-ii

Matrix

0037-sudoku-solver

Interactive

0278-first-bad-version
0374-guess-number-higher-or-lower

Prefix Sum

0410-split-array-largest-sum

Tree

0098-validate-binary-search-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0124-binary-tree-maximum-path-sum
0199-binary-tree-right-side-view
0236-lowest-common-ancestor-of-a-binary-tree
0543-diameter-of-binary-tree
0559-maximum-depth-of-n-ary-tree

Depth-First Search

0098-validate-binary-search-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0124-binary-tree-maximum-path-sum
0199-binary-tree-right-side-view
0236-lowest-common-ancestor-of-a-binary-tree
0543-diameter-of-binary-tree
0559-maximum-depth-of-n-ary-tree

Breadth-First Search

0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0111-minimum-depth-of-binary-tree
0112-path-sum
0199-binary-tree-right-side-view
0559-maximum-depth-of-n-ary-tree

Binary Tree

0098-validate-binary-search-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0124-binary-tree-maximum-path-sum
0199-binary-tree-right-side-view
0236-lowest-common-ancestor-of-a-binary-tree
0543-diameter-of-binary-tree

Binary Search Tree

0098-validate-binary-search-tree

Enumeration

2951-find-the-peaks