Skip to content

Latest commit

 

History

History
275 lines (273 loc) · 18.2 KB

README.md

File metadata and controls

275 lines (273 loc) · 18.2 KB

Leetcode

Collection of LeetCode questions to ace the coding interview!

Array
0015-3sum
0075-sort-colors
0167-two-sum-ii-input-array-is-sorted

Two Pointers
0015-3sum
0075-sort-colors
0167-two-sum-ii-input-array-is-sorted

Sorting
0015-3sum
0075-sort-colors

Binary Search
0167-two-sum-ii-input-array-is-sorted

LeetCode Topics

Array
0004-median-of-two-sorted-arrays
0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0041-first-missing-positive
0046-permutations
0134-gas-station
0137-single-number-ii
0153-find-minimum-in-rotated-sorted-array
0215-kth-largest-element-in-an-array
0239-sliding-window-maximum
0268-missing-number
0322-coin-change
0621-task-scheduler
0902-minimum-number-of-refueling-stops
1056-capacity-to-ship-packages-within-d-days
1791-richest-customer-wealth
2876-number-of-employees-who-met-the-target

Bit Manipulation
0137-single-number-ii
0222-count-complete-tree-nodes
0231-power-of-two
0268-missing-number

Hash Table
0017-letter-combinations-of-a-phone-number
0041-first-missing-positive
0208-implement-trie-prefix-tree
0268-missing-number
0621-task-scheduler
0778-reorganize-string
1029-vertical-order-traversal-of-a-binary-tree

String
0014-longest-common-prefix
0017-letter-combinations-of-a-phone-number
0020-valid-parentheses
0091-decode-ways
0208-implement-trie-prefix-tree
0241-different-ways-to-add-parentheses
0778-reorganize-string

Backtracking
0017-letter-combinations-of-a-phone-number
0046-permutations

Math
0070-climbing-stairs
0231-power-of-two
0241-different-ways-to-add-parentheses
0258-add-digits
0268-missing-number

Binary Search
0004-median-of-two-sorted-arrays
0034-find-first-and-last-position-of-element-in-sorted-array
0035-search-insert-position
0153-find-minimum-in-rotated-sorted-array
0222-count-complete-tree-nodes
0268-missing-number
1056-capacity-to-ship-packages-within-d-days

Sorting
0215-kth-largest-element-in-an-array
0268-missing-number
0295-find-median-from-data-stream
0621-task-scheduler
0778-reorganize-string
1029-vertical-order-traversal-of-a-binary-tree

Greedy
0134-gas-station
0621-task-scheduler
0778-reorganize-string
0902-minimum-number-of-refueling-stops

Queue
0239-sliding-window-maximum

Sliding Window
0239-sliding-window-maximum

Heap (Priority Queue)
0023-merge-k-sorted-lists
0215-kth-largest-element-in-an-array
0239-sliding-window-maximum
0295-find-median-from-data-stream
0621-task-scheduler
0778-reorganize-string
0902-minimum-number-of-refueling-stops

Monotonic Queue
0239-sliding-window-maximum

Matrix
1791-richest-customer-wealth

Stack
0020-valid-parentheses
0155-min-stack

Design
0155-min-stack
0208-implement-trie-prefix-tree
0295-find-median-from-data-stream

Linked List
0023-merge-k-sorted-lists

Divide and Conquer
0004-median-of-two-sorted-arrays
0023-merge-k-sorted-lists
0215-kth-largest-element-in-an-array

Merge Sort
0023-merge-k-sorted-lists

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

Dynamic Programming
0070-climbing-stairs
0091-decode-ways
0241-different-ways-to-add-parentheses
0322-coin-change
0902-minimum-number-of-refueling-stops

Counting
0621-task-scheduler
0778-reorganize-string

Two Pointers
0295-find-median-from-data-stream

Data Stream
0295-find-median-from-data-stream

Tree
0099-recover-binary-search-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst
1029-vertical-order-traversal-of-a-binary-tree

Breadth-First Search
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0199-binary-tree-right-side-view
0207-course-schedule
0322-coin-change
1029-vertical-order-traversal-of-a-binary-tree

Binary Tree
0099-recover-binary-search-tree
0101-symmetric-tree
0102-binary-tree-level-order-traversal
0104-maximum-depth-of-binary-tree
0199-binary-tree-right-side-view
0222-count-complete-tree-nodes
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst
1029-vertical-order-traversal-of-a-binary-tree

Depth-First Search
0099-recover-binary-search-tree
0101-symmetric-tree
0104-maximum-depth-of-binary-tree
0199-binary-tree-right-side-view
0207-course-schedule
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
1029-vertical-order-traversal-of-a-binary-tree

Binary Search Tree
0099-recover-binary-search-tree
0230-kth-smallest-element-in-a-bst
0235-lowest-common-ancestor-of-a-binary-search-tree
0450-delete-node-in-a-bst

Trie
0014-longest-common-prefix
0208-implement-trie-prefix-tree

Memoization
0070-climbing-stairs
0241-different-ways-to-add-parentheses

Recursion
0231-power-of-two
0241-different-ways-to-add-parentheses

Graph
0207-course-schedule

Topological Sort
0207-course-schedule

Simulation
0258-add-digits

Number Theory
0258-add-digits