DSA

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

LeetCode Topics

Array

0042-trapping-rain-water
0045-jump-game-ii
0055-jump-game
0057-insert-interval
0078-subsets
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0135-candy
0215-kth-largest-element-in-an-array
0229-majority-element-ii
0435-non-overlapping-intervals
0455-assign-cookies
0496-next-greater-element-i
0735-asteroid-collision
0890-lemonade-change
0943-sum-of-subarray-minimums
0966-binary-subarrays-with-sum
1034-subarrays-with-k-different-integers
1036-rotting-oranges
1046-max-consecutive-ones-iii
1050-construct-binary-search-tree-from-preorder-traversal
1370-count-number-of-nice-subarrays
1538-maximum-points-you-can-obtain-from-cards
2227-sum-of-subarray-ranges

Backtracking

0078-subsets

Bit Manipulation

0078-subsets
0222-count-complete-tree-nodes

Stack

0020-valid-parentheses
0042-trapping-rain-water
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0094-binary-tree-inorder-traversal
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0155-min-stack
0232-implement-queue-using-stacks
0402-remove-k-digits
0496-next-greater-element-i
0678-valid-parenthesis-string
0735-asteroid-collision
0937-online-stock-span
0943-sum-of-subarray-minimums
1050-construct-binary-search-tree-from-preorder-traversal
2227-sum-of-subarray-ranges

Design

0155-min-stack
0232-implement-queue-using-stacks
0295-find-median-from-data-stream
0355-design-twitter
0789-kth-largest-element-in-a-stream
0937-online-stock-span

Queue

0232-implement-queue-using-stacks

String

0003-longest-substring-without-repeating-characters
0020-valid-parentheses
0076-minimum-window-substring
0402-remove-k-digits
0678-valid-parenthesis-string
1460-number-of-substrings-containing-all-three-characters

Hash Table

0003-longest-substring-without-repeating-characters
0076-minimum-window-substring
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0229-majority-element-ii
0355-design-twitter
0496-next-greater-element-i
0893-all-nodes-distance-k-in-binary-tree
0966-binary-subarrays-with-sum
1034-subarrays-with-k-different-integers
1370-count-number-of-nice-subarrays
1460-number-of-substrings-containing-all-three-characters

Monotonic Stack

0042-trapping-rain-water
0084-largest-rectangle-in-histogram
0085-maximal-rectangle
0402-remove-k-digits
0496-next-greater-element-i
0937-online-stock-span
0943-sum-of-subarray-minimums
1050-construct-binary-search-tree-from-preorder-traversal
2227-sum-of-subarray-ranges

Sorting

0215-kth-largest-element-in-an-array
0229-majority-element-ii
0295-find-median-from-data-stream
0435-non-overlapping-intervals
0455-assign-cookies

Counting

0229-majority-element-ii
1034-subarrays-with-k-different-integers

Two Pointers

0042-trapping-rain-water
0295-find-median-from-data-stream
0455-assign-cookies

Dynamic Programming

0042-trapping-rain-water
0045-jump-game-ii
0055-jump-game
0085-maximal-rectangle
0435-non-overlapping-intervals
0678-valid-parenthesis-string
0943-sum-of-subarray-minimums

Simulation

0735-asteroid-collision

Greedy

0045-jump-game-ii
0055-jump-game
0135-candy
0402-remove-k-digits
0435-non-overlapping-intervals
0455-assign-cookies
0678-valid-parenthesis-string
0890-lemonade-change

Matrix

0085-maximal-rectangle
1036-rotting-oranges

Data Stream

0295-find-median-from-data-stream
0789-kth-largest-element-in-a-stream
0937-online-stock-span

Sliding Window

0003-longest-substring-without-repeating-characters
0076-minimum-window-substring
0966-binary-subarrays-with-sum
1034-subarrays-with-k-different-integers
1046-max-consecutive-ones-iii
1370-count-number-of-nice-subarrays
1460-number-of-substrings-containing-all-three-characters
1538-maximum-points-you-can-obtain-from-cards

Binary Search

0222-count-complete-tree-nodes
1046-max-consecutive-ones-iii

Prefix Sum

0966-binary-subarrays-with-sum
1046-max-consecutive-ones-iii
1370-count-number-of-nice-subarrays
1538-maximum-points-you-can-obtain-from-cards

Math

0507-perfect-number
1370-count-number-of-nice-subarrays

Divide and Conquer

0023-merge-k-sorted-lists
0105-construct-binary-tree-from-preorder-and-inorder-traversal
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0215-kth-largest-element-in-an-array

Heap (Priority Queue)

0023-merge-k-sorted-lists
0215-kth-largest-element-in-an-array
0295-find-median-from-data-stream
0355-design-twitter
0789-kth-largest-element-in-a-stream

Quickselect

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

Linked List

0023-merge-k-sorted-lists
0024-swap-nodes-in-pairs
0355-design-twitter

Merge Sort

0023-merge-k-sorted-lists

Tree

0094-binary-tree-inorder-traversal
0100-same-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
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0110-balanced-binary-tree
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0222-count-complete-tree-nodes
0236-lowest-common-ancestor-of-a-binary-tree
0543-diameter-of-binary-tree
0789-kth-largest-element-in-a-stream
0893-all-nodes-distance-k-in-binary-tree
1050-construct-binary-search-tree-from-preorder-traversal

Binary Search Tree

0789-kth-largest-element-in-a-stream
1050-construct-binary-search-tree-from-preorder-traversal

Binary Tree

0094-binary-tree-inorder-traversal
0100-same-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
0106-construct-binary-tree-from-inorder-and-postorder-traversal
0110-balanced-binary-tree
0144-binary-tree-preorder-traversal
0145-binary-tree-postorder-traversal
0222-count-complete-tree-nodes
0236-lowest-common-ancestor-of-a-binary-tree
0543-diameter-of-binary-tree
0789-kth-largest-element-in-a-stream
0893-all-nodes-distance-k-in-binary-tree
1050-construct-binary-search-tree-from-preorder-traversal

Depth-First Search

0094-binary-tree-inorder-traversal
0100-same-tree
0104-maximum-depth-of-binary-tree
0110-balanced-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
0547-number-of-provinces
0893-all-nodes-distance-k-in-binary-tree

Breadth-First Search

0100-same-tree
0102-binary-tree-level-order-traversal
0103-binary-tree-zigzag-level-order-traversal
0104-maximum-depth-of-binary-tree
0547-number-of-provinces
0893-all-nodes-distance-k-in-binary-tree
1036-rotting-oranges

Recursion

0024-swap-nodes-in-pairs

Union Find

0547-number-of-provinces

Graph

0547-number-of-provinces