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

LeetCode Topics

Stack

0020-valid-parentheses
0042-trapping-rain-water
0094-binary-tree-inorder-traversal
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0155-min-stack
0225-implement-stack-using-queues

Design

0155-min-stack
0225-implement-stack-using-queues
0933-number-of-recent-calls

Queue

0225-implement-stack-using-queues
0933-number-of-recent-calls

Data Stream

0933-number-of-recent-calls

Array

0001-two-sum
0011-container-with-most-water
0015-3sum
0018-4sum
0026-remove-duplicates-from-sorted-array
0031-next-permutation
0041-first-missing-positive
0042-trapping-rain-water
0048-rotate-image
0053-maximum-subarray
0055-jump-game
0056-merge-intervals
0073-set-matrix-zeroes
0075-sort-colors
0088-merge-sorted-array
0121-best-time-to-buy-and-sell-stock
0152-maximum-product-subarray
0169-majority-element
0189-rotate-array
0215-kth-largest-element-in-an-array
0435-non-overlapping-intervals
0646-maximum-length-of-pair-chain
1200-minimum-absolute-difference
3218-minimum-cost-for-cutting-cake-i
3219-minimum-cost-for-cutting-cake-ii

Dynamic Programming

0042-trapping-rain-water
0053-maximum-subarray
0055-jump-game
0070-climbing-stairs
0121-best-time-to-buy-and-sell-stock
0152-maximum-product-subarray
0435-non-overlapping-intervals
0646-maximum-length-of-pair-chain
3218-minimum-cost-for-cutting-cake-i

Greedy

0011-container-with-most-water
0055-jump-game
0435-non-overlapping-intervals
0646-maximum-length-of-pair-chain
1221-split-a-string-in-balanced-strings
1663-smallest-string-with-a-given-numeric-value
3218-minimum-cost-for-cutting-cake-i
3219-minimum-cost-for-cutting-cake-ii

Sorting

0015-3sum
0018-4sum
0056-merge-intervals
0075-sort-colors
0088-merge-sorted-array
0169-majority-element
0215-kth-largest-element-in-an-array
0435-non-overlapping-intervals
0646-maximum-length-of-pair-chain
1200-minimum-absolute-difference
3218-minimum-cost-for-cutting-cake-i
3219-minimum-cost-for-cutting-cake-ii

String

0008-string-to-integer-atoi
0012-integer-to-roman
0013-roman-to-integer
0020-valid-parentheses
0028-find-the-index-of-the-first-occurrence-in-a-string
1221-split-a-string-in-balanced-strings
1663-smallest-string-with-a-given-numeric-value

Counting

0169-majority-element
1221-split-a-string-in-balanced-strings

Two Pointers

0011-container-with-most-water
0015-3sum
0018-4sum
0026-remove-duplicates-from-sorted-array
0028-find-the-index-of-the-first-occurrence-in-a-string
0031-next-permutation
0042-trapping-rain-water
0075-sort-colors
0088-merge-sorted-array
0189-rotate-array
3218-minimum-cost-for-cutting-cake-i

Tree

0094-binary-tree-inorder-traversal
0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0236-lowest-common-ancestor-of-a-binary-tree
0543-diameter-of-binary-tree
0572-subtree-of-another-tree

Depth-First Search

0094-binary-tree-inorder-traversal
0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0236-lowest-common-ancestor-of-a-binary-tree
0543-diameter-of-binary-tree
0572-subtree-of-another-tree

Breadth-First Search

0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree

Binary Tree

0094-binary-tree-inorder-traversal
0100-same-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0236-lowest-common-ancestor-of-a-binary-tree
0543-diameter-of-binary-tree
0572-subtree-of-another-tree

Hash Table

0001-two-sum
0012-integer-to-roman
0013-roman-to-integer
0041-first-missing-positive
0073-set-matrix-zeroes
0169-majority-element

Math

0012-integer-to-roman
0013-roman-to-integer
0048-rotate-image
0050-powx-n
0070-climbing-stairs
0189-rotate-array

Memoization

0070-climbing-stairs

String Matching

0028-find-the-index-of-the-first-occurrence-in-a-string
0572-subtree-of-another-tree

Hash Function

0572-subtree-of-another-tree

Divide and Conquer

0053-maximum-subarray
0169-majority-element
0215-kth-largest-element-in-an-array

Heap (Priority Queue)

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

Quickselect

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

Recursion

0050-powx-n

Monotonic Stack

0042-trapping-rain-water

Matrix

0048-rotate-image
0073-set-matrix-zeroes