Leetcode-Problems

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

LeetCode Topics

Array

0001-two-sum
0014-longest-common-prefix
0026-remove-duplicates-from-sorted-array
0027-remove-element
0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0039-combination-sum
0041-first-missing-positive
0042-trapping-rain-water
0045-jump-game-ii
0046-permutations
0048-rotate-image
0053-maximum-subarray
0055-jump-game
0056-merge-intervals
0057-insert-interval
0063-unique-paths-ii
0064-minimum-path-sum
0066-plus-one
0075-sort-colors
0078-subsets
0081-search-in-rotated-sorted-array-ii
0090-subsets-ii
0108-convert-sorted-array-to-binary-search-tree
0118-pascals-triangle
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0136-single-number
0153-find-minimum-in-rotated-sorted-array
0154-find-minimum-in-rotated-sorted-array-ii
0162-find-peak-element
0169-majority-element
0189-rotate-array
0198-house-robber
0200-number-of-islands
0213-house-robber-ii
0217-contains-duplicate
0268-missing-number
0283-move-zeroes
0287-find-the-duplicate-number
0322-coin-change
0416-partition-equal-subset-sum
0442-find-all-duplicates-in-an-array
0448-find-all-numbers-disappeared-in-an-array
0463-island-perimeter
0485-max-consecutive-ones
0494-target-sum
0506-relative-ranks
0518-coin-change-ii
0560-subarray-sum-equals-k
0645-set-mismatch
0695-max-area-of-island
0718-maximum-length-of-repeated-subarray
0724-find-pivot-index
0733-flood-fill
0792-binary-search
0907-koko-eating-bananas
1036-rotting-oranges
1056-capacity-to-ship-packages-within-d-days
1171-shortest-path-in-binary-matrix
2038-nearest-exit-from-entrance-in-maze
2058-concatenation-of-array
2316-count-hills-and-valleys-in-an-array
2480-find-subarrays-with-equal-sum
3430-count-days-without-meetings

Hash Table

0001-two-sum
0041-first-missing-positive
0141-linked-list-cycle
0142-linked-list-cycle-ii
0160-intersection-of-two-linked-lists
0169-majority-element
0202-happy-number
0217-contains-duplicate
0242-valid-anagram
0268-missing-number
0442-find-all-duplicates-in-an-array
0448-find-all-numbers-disappeared-in-an-array
0560-subarray-sum-equals-k
0645-set-mismatch
2480-find-subarrays-with-equal-sum

Math

0002-add-two-numbers
0007-reverse-integer
0009-palindrome-number
0048-rotate-image
0062-unique-paths
0066-plus-one
0069-sqrtx
0070-climbing-stairs
0189-rotate-array
0202-happy-number
0231-power-of-two
0268-missing-number
0326-power-of-three
0342-power-of-four
1013-fibonacci-number
1236-n-th-tribonacci-number
1411-convert-binary-number-in-a-linked-list-to-integer
2481-strictly-palindromic-number

Linked List

0002-add-two-numbers
0019-remove-nth-node-from-end-of-list
0021-merge-two-sorted-lists
0023-merge-k-sorted-lists
0024-swap-nodes-in-pairs
0061-rotate-list
0083-remove-duplicates-from-sorted-list
0086-partition-list
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0141-linked-list-cycle
0142-linked-list-cycle-ii
0160-intersection-of-two-linked-lists
0203-remove-linked-list-elements
0206-reverse-linked-list
0234-palindrome-linked-list
0237-delete-node-in-a-linked-list
0838-design-linked-list
0908-middle-of-the-linked-list
1411-convert-binary-number-in-a-linked-list-to-integer
2216-delete-the-middle-node-of-a-linked-list

Recursion

0002-add-two-numbers
0021-merge-two-sorted-lists
0024-swap-nodes-in-pairs
0203-remove-linked-list-elements
0206-reverse-linked-list
0231-power-of-two
0234-palindrome-linked-list
0326-power-of-three
0342-power-of-four
1013-fibonacci-number

Two Pointers

0019-remove-nth-node-from-end-of-list
0026-remove-duplicates-from-sorted-array
0027-remove-element
0028-find-the-index-of-the-first-occurrence-in-a-string
0042-trapping-rain-water
0061-rotate-list
0075-sort-colors
0086-partition-list
0141-linked-list-cycle
0142-linked-list-cycle-ii
0160-intersection-of-two-linked-lists
0189-rotate-array
0202-happy-number
0234-palindrome-linked-list
0283-move-zeroes
0287-find-the-duplicate-number
0908-middle-of-the-linked-list
2216-delete-the-middle-node-of-a-linked-list
2481-strictly-palindromic-number

String

0014-longest-common-prefix
0020-valid-parentheses
0022-generate-parentheses
0028-find-the-index-of-the-first-occurrence-in-a-string
0032-longest-valid-parentheses
0058-length-of-last-word
0072-edit-distance
0131-palindrome-partitioning
0242-valid-anagram
0257-binary-tree-paths
0516-longest-palindromic-subsequence
0583-delete-operation-for-two-strings
1030-smallest-string-starting-from-leaf
1250-longest-common-subsequence

String Matching

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

Binary Search

0033-search-in-rotated-sorted-array
0034-find-first-and-last-position-of-element-in-sorted-array
0069-sqrtx
0081-search-in-rotated-sorted-array-ii
0153-find-minimum-in-rotated-sorted-array
0154-find-minimum-in-rotated-sorted-array-ii
0162-find-peak-element
0222-count-complete-tree-nodes
0268-missing-number
0287-find-the-duplicate-number
0718-maximum-length-of-repeated-subarray
0792-binary-search
0907-koko-eating-bananas
1056-capacity-to-ship-packages-within-d-days

Brainteaser

2481-strictly-palindromic-number

Dynamic Programming

0022-generate-parentheses
0032-longest-valid-parentheses
0042-trapping-rain-water
0045-jump-game-ii
0053-maximum-subarray
0055-jump-game
0062-unique-paths
0063-unique-paths-ii
0064-minimum-path-sum
0070-climbing-stairs
0072-edit-distance
0118-pascals-triangle
0121-best-time-to-buy-and-sell-stock
0122-best-time-to-buy-and-sell-stock-ii
0131-palindrome-partitioning
0198-house-robber
0213-house-robber-ii
0322-coin-change
0416-partition-equal-subset-sum
0494-target-sum
0516-longest-palindromic-subsequence
0518-coin-change-ii
0583-delete-operation-for-two-strings
0718-maximum-length-of-repeated-subarray
1013-fibonacci-number
1236-n-th-tribonacci-number
1250-longest-common-subsequence

Greedy

0045-jump-game-ii
0055-jump-game
0122-best-time-to-buy-and-sell-stock-ii

Stack

0020-valid-parentheses
0032-longest-valid-parentheses
0042-trapping-rain-water
0094-binary-tree-inorder-traversal
0114-flatten-binary-tree-to-linked-list
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0234-palindrome-linked-list

Monotonic Stack

0042-trapping-rain-water

Prefix Sum

0560-subarray-sum-equals-k
0724-find-pivot-index

Bit Manipulation

0078-subsets
0090-subsets-ii
0136-single-number
0191-number-of-1-bits
0222-count-complete-tree-nodes
0231-power-of-two
0268-missing-number
0287-find-the-duplicate-number
0342-power-of-four
0645-set-mismatch

Divide and Conquer

0023-merge-k-sorted-lists
0053-maximum-subarray
0108-convert-sorted-array-to-binary-search-tree
0169-majority-element
0191-number-of-1-bits

Sorting

0056-merge-intervals
0075-sort-colors
0169-majority-element
0217-contains-duplicate
0242-valid-anagram
0268-missing-number
0506-relative-ranks
0645-set-mismatch
3430-count-days-without-meetings

Counting

0169-majority-element

Heap (Priority Queue)

0023-merge-k-sorted-lists
0506-relative-ranks

Design

0838-design-linked-list

Merge Sort

0023-merge-k-sorted-lists

Memoization

0070-climbing-stairs
1013-fibonacci-number
1236-n-th-tribonacci-number

Backtracking

0022-generate-parentheses
0039-combination-sum
0046-permutations
0078-subsets
0090-subsets-ii
0113-path-sum-ii
0131-palindrome-partitioning
0257-binary-tree-paths
0494-target-sum
1030-smallest-string-starting-from-leaf

Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0107-binary-tree-level-order-traversal-ii
0108-convert-sorted-array-to-binary-search-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0129-sum-root-to-leaf-numbers
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0404-sum-of-left-leaves
0513-find-bottom-left-tree-value
0543-diameter-of-binary-tree
0904-leaf-similar-trees
1030-smallest-string-starting-from-leaf

Depth-First Search

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0129-sum-root-to-leaf-numbers
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0404-sum-of-left-leaves
0463-island-perimeter
0513-find-bottom-left-tree-value
0543-diameter-of-binary-tree
0695-max-area-of-island
0733-flood-fill
0904-leaf-similar-trees
1030-smallest-string-starting-from-leaf

Binary Tree

0094-binary-tree-inorder-traversal
0098-validate-binary-search-tree
0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0107-binary-tree-level-order-traversal-ii
0108-convert-sorted-array-to-binary-search-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0129-sum-root-to-leaf-numbers
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0226-invert-binary-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0404-sum-of-left-leaves
0513-find-bottom-left-tree-value
0543-diameter-of-binary-tree
0904-leaf-similar-trees
1030-smallest-string-starting-from-leaf

Breadth-First Search

0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0107-binary-tree-level-order-traversal-ii
0112-path-sum
0116-populating-next-right-pointers-in-each-node
0117-populating-next-right-pointers-in-each-node-ii
0199-binary-tree-right-side-view
0200-number-of-islands
0207-course-schedule
0210-course-schedule-ii
0226-invert-binary-tree
0322-coin-change
0404-sum-of-left-leaves
0463-island-perimeter
0513-find-bottom-left-tree-value
0695-max-area-of-island
0733-flood-fill
1036-rotting-oranges
1171-shortest-path-in-binary-matrix
2038-nearest-exit-from-entrance-in-maze

Binary Search Tree

0098-validate-binary-search-tree
0108-convert-sorted-array-to-binary-search-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree

Sliding Window

0718-maximum-length-of-repeated-subarray

Rolling Hash

0718-maximum-length-of-repeated-subarray

Hash Function

0718-maximum-length-of-repeated-subarray

Matrix

0048-rotate-image
0063-unique-paths-ii
0064-minimum-path-sum
0200-number-of-islands
0463-island-perimeter
0695-max-area-of-island
0733-flood-fill
1036-rotting-oranges
1171-shortest-path-in-binary-matrix
2038-nearest-exit-from-entrance-in-maze

Combinatorics

0062-unique-paths

Union Find

0200-number-of-islands
0695-max-area-of-island

Graph

0207-course-schedule
0210-course-schedule-ii

Topological Sort

0207-course-schedule
0210-course-schedule-ii

Simulation

2058-concatenation-of-array

Trie

0014-longest-common-prefix