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

LeetCode Topics

Linked List

0086-partition-list
0114-flatten-binary-tree-to-linked-list
0143-reorder-list
0146-lru-cache
0148-sort-list
0237-delete-node-in-a-linked-list
0328-odd-even-linked-list
3501-delete-nodes-from-linked-list-present-in-array

Two Pointers

0042-trapping-rain-water
0086-partition-list
0143-reorder-list
0148-sort-list
0611-valid-triangle-number
0874-backspace-string-compare
2265-partition-array-according-to-given-pivot
2392-successful-pairs-of-spells-and-potions

Array

0042-trapping-rain-water
0084-largest-rectangle-in-histogram
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0150-evaluate-reverse-polish-notation
0239-sliding-window-maximum
0496-next-greater-element-i
0503-next-greater-element-ii
0611-valid-triangle-number
0682-baseball-game
0735-asteroid-collision
0739-daily-temperatures
0830-largest-triangle-area
0883-car-fleet
1018-largest-perimeter-triangle
1421-find-numbers-with-even-number-of-digits
1612-avoid-flood-in-the-city
1802-number-of-students-unable-to-eat-lunch
2169-simple-bank-system
2195-time-needed-to-buy-tickets
2265-partition-array-according-to-given-pivot
2324-find-triangular-sum-of-an-array
2392-successful-pairs-of-spells-and-potions
3242-count-elements-with-maximum-frequency
3383-taking-maximum-energy-from-the-mystic-dungeon
3501-delete-nodes-from-linked-list-present-in-array
3612-adjacent-increasing-subarrays-detection-i

Simulation

0682-baseball-game
0735-asteroid-collision
0874-backspace-string-compare
1642-water-bottles
1802-number-of-students-unable-to-eat-lunch
2169-simple-bank-system
2195-time-needed-to-buy-tickets
2265-partition-array-according-to-given-pivot
2324-find-triangular-sum-of-an-array

Stack

0020-valid-parentheses
0042-trapping-rain-water
0071-simplify-path
0084-largest-rectangle-in-histogram
0094-binary-tree-inorder-traversal
0114-flatten-binary-tree-to-linked-list
0143-reorder-list
0144-binary-tree-preorder-traversal
0150-evaluate-reverse-polish-notation
0155-min-stack
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0496-next-greater-element-i
0503-next-greater-element-ii
0682-baseball-game
0735-asteroid-collision
0739-daily-temperatures
0874-backspace-string-compare
0883-car-fleet
0886-score-of-parentheses
1128-remove-all-adjacent-duplicates-in-string
1320-remove-all-adjacent-duplicates-in-string-ii
1802-number-of-students-unable-to-eat-lunch

Recursion

0143-reorder-list

Divide and Conquer

0105-construct-binary-tree-from-preorder-and-inorder-traversal
0148-sort-list

Sorting

0148-sort-list
0611-valid-triangle-number
0883-car-fleet
1018-largest-perimeter-triangle
2392-successful-pairs-of-spells-and-potions
2887-sort-vowels-in-a-string

Merge Sort

0148-sort-list

Hash Table

0105-construct-binary-tree-from-preorder-and-inorder-traversal
0146-lru-cache
0387-first-unique-character-in-a-string
0496-next-greater-element-i
1612-avoid-flood-in-the-city
2169-simple-bank-system
3242-count-elements-with-maximum-frequency
3501-delete-nodes-from-linked-list-present-in-array

String

0020-valid-parentheses
0071-simplify-path
0257-binary-tree-paths
0387-first-unique-character-in-a-string
0874-backspace-string-compare
0886-score-of-parentheses
1128-remove-all-adjacent-duplicates-in-string
1320-remove-all-adjacent-duplicates-in-string-ii
2887-sort-vowels-in-a-string

Counting

0387-first-unique-character-in-a-string
3242-count-elements-with-maximum-frequency

Monotonic Stack

0042-trapping-rain-water
0084-largest-rectangle-in-histogram
0496-next-greater-element-i
0503-next-greater-element-ii
0739-daily-temperatures
0883-car-fleet

Design

0146-lru-cache
0155-min-stack
0225-implement-stack-using-queues
0232-implement-queue-using-stacks
2169-simple-bank-system

Math

0150-evaluate-reverse-polish-notation
0830-largest-triangle-area
1018-largest-perimeter-triangle
1421-find-numbers-with-even-number-of-digits
1642-water-bottles
2324-find-triangular-sum-of-an-array
3676-smallest-number-with-all-set-bits

Binary Search

0222-count-complete-tree-nodes
0611-valid-triangle-number
1612-avoid-flood-in-the-city
2392-successful-pairs-of-spells-and-potions

Greedy

0611-valid-triangle-number
1018-largest-perimeter-triangle
1612-avoid-flood-in-the-city

Dynamic Programming

0042-trapping-rain-water
0124-binary-tree-maximum-path-sum

Geometry

0830-largest-triangle-area

Doubly-Linked List

0146-lru-cache

Combinatorics

2324-find-triangular-sum-of-an-array

Heap (Priority Queue)

0239-sliding-window-maximum
1612-avoid-flood-in-the-city

Queue

0225-implement-stack-using-queues
0232-implement-queue-using-stacks
0239-sliding-window-maximum
0387-first-unique-character-in-a-string
1802-number-of-students-unable-to-eat-lunch
2195-time-needed-to-buy-tickets

Prefix Sum

3383-taking-maximum-energy-from-the-mystic-dungeon

Sliding Window

0239-sliding-window-maximum

Monotonic Queue

0239-sliding-window-maximum

Tree

0094-binary-tree-inorder-traversal
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
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
0114-flatten-binary-tree-to-linked-list
0124-binary-tree-maximum-path-sum
0144-binary-tree-preorder-traversal
0222-count-complete-tree-nodes
0226-invert-binary-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0404-sum-of-left-leaves
0543-diameter-of-binary-tree
0563-binary-tree-tilt
0572-subtree-of-another-tree
0662-maximum-width-of-binary-tree
0687-longest-univalue-path
1092-maximum-difference-between-node-and-ancestor
1544-count-good-nodes-in-binary-tree

Depth-First Search

0094-binary-tree-inorder-traversal
0100-same-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0110-balanced-binary-tree
0111-minimum-depth-of-binary-tree
0112-path-sum
0113-path-sum-ii
0114-flatten-binary-tree-to-linked-list
0124-binary-tree-maximum-path-sum
0144-binary-tree-preorder-traversal
0226-invert-binary-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0404-sum-of-left-leaves
0543-diameter-of-binary-tree
0563-binary-tree-tilt
0572-subtree-of-another-tree
0662-maximum-width-of-binary-tree
0687-longest-univalue-path
1092-maximum-difference-between-node-and-ancestor
1544-count-good-nodes-in-binary-tree

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
0111-minimum-depth-of-binary-tree
0112-path-sum
0226-invert-binary-tree
0404-sum-of-left-leaves
0662-maximum-width-of-binary-tree
1544-count-good-nodes-in-binary-tree

Binary Tree

0094-binary-tree-inorder-traversal
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
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
0114-flatten-binary-tree-to-linked-list
0124-binary-tree-maximum-path-sum
0144-binary-tree-preorder-traversal
0222-count-complete-tree-nodes
0226-invert-binary-tree
0236-lowest-common-ancestor-of-a-binary-tree
0257-binary-tree-paths
0404-sum-of-left-leaves
0543-diameter-of-binary-tree
0563-binary-tree-tilt
0572-subtree-of-another-tree
0662-maximum-width-of-binary-tree
0687-longest-univalue-path
1092-maximum-difference-between-node-and-ancestor
1544-count-good-nodes-in-binary-tree

String Matching

0572-subtree-of-another-tree

Hash Function

0572-subtree-of-another-tree

Backtracking

0113-path-sum-ii
0257-binary-tree-paths

Bit Manipulation

0222-count-complete-tree-nodes
3676-smallest-number-with-all-set-bits