LeetCode |
1. Two Sum |
π’Easy |
Array, Hash Table |
Problem Set / Algorithms |
LeetCode |
3. Longest Substring Without Repeating Characters |
π Medium |
Sliding Window, Hash Table, Two Pointers, String |
Problem Set / Algorithms |
LeetCode |
35. Search Insert Position |
π’Easy |
Array, Binary Search |
Problem Set / Algorithms |
LeetCode |
53. Maximum Subarray |
π’Easy |
Array, Divide and Conquer, Dynamic Programming |
Problem Set / Algorithms |
LeetCode |
62. Unique Paths |
π Medium |
Array, Dynamic Programming |
Problem Set / Algorithms |
LeetCode |
64. Minimum Path Sum |
π Medium |
Array, Dynamic Programming |
Problem Set / Algorithms |
LeetCode |
70. Climbing Stairs |
π’Easy |
Math, Dynamic Programming, Memoization |
Problem Set / Algorithms |
LeetCode |
74. Search a 2D Matrix |
π Medium |
Array, Binary Search, Matrix |
Problem Set / Algorithms |
LeetCode |
94. Binary Tree Inorder Traversal |
π Medium |
Hash Table, Stack, Tree |
Problem Set / Algorithms |
LeetCode |
98. Validate Binary Search Tree |
π Medium |
Tree, Depth-first Search |
Problem Set / Algorithms |
LeetCode |
101. Symmetric Tree |
π’Easy |
Tree, Depth-first Search, Breadth-first Search |
Problem Set / Algorithms |
LeetCode |
102. Binary Tree Level Order Traversal |
π Medium |
Tree, Breadth-first Search |
Problem Set / Algorithms |
LeetCode |
104. Maximum Depth of Binary Tree |
π’Easy |
Tree, Depth-first Search |
Problem Set / Algorithms |
LeetCode |
107. Binary Tree Level Order Traversal II |
π’Easy |
Tree, Breadth-first Search |
Problem Set / Algorithms |
LeetCode |
111. Minimum Depth of Binary Tree |
π’Easy |
Tree, Depth-first Search, Breadth-first Search |
Problem Set / Algorithms |
LeetCode |
118. Pascal's Triangle |
π’Easy |
Array, Dynamic Programming |
Problem Set / Algorithms |
LeetCode |
121. Best Time to Buy and Sell Stock |
π’Easy |
Array, Dynamic Programming |
Problem Set / Algorithms |
LeetCode |
122. Best Time to Buy and Sell Stock II |
π’Easy |
Array, Greedy |
Problem Set / Algorithms |
LeetCode |
124. Binary Tree Maximum Path Sum |
π΄Hard |
Dynamic Programming, Tree, Depth-first Search, Binary Tree |
Problem Set / Algorithms |
LeetCode |
130. Surrounded Regions |
π Medium |
Depth-first Search, Breadth-first Search, Union Find |
Problem Set / Algorithms |
LeetCode |
139. Word Break |
π Medium |
Hash Table, String, Dynamic Programming, Trie, Memoization |
Problem Set / Algorithms |
LeetCode |
144. Binary Tree Preorder Traversal |
π Medium |
Stack, Tree |
Problem Set / Algorithms |
LeetCode |
145. Binary Tree Postorder Traversal |
π΄Hard |
Stack, Tree |
Problem Set / Algorithms |
LeetCode |
198. House Robber |
π Medium |
Array, Dynamic Programming |
Problem Set / Algorithms |
LeetCode |
200. Number of Islands |
π Medium |
Depth-first Search, Breadth-first Search, Union Find |
Problem Set / Algorithms |
LeetCode |
206. Reverse Linked List |
π’Easy |
Linked List |
Problem Set / Algorithms |
LeetCode |
208. Implement Trie (Prefix Tree) |
π Medium |
Hash Taable , String , Design , Trie |
Problem Set / Algorithms |
LeetCode |
213. House Robber II |
π Medium |
Array, Dynamic Programming |
Problem Set / Algorithms |
LeetCode |
230. Kth Smallest Element in a BST |
π Medium |
Binary Search, Tree |
Problem Set / Algorithms |
LeetCode |
237. Delete Node in a Linked List |
π’Easy |
Linked List |
Problem Set / Algorithms |
LeetCode |
278. First Bad Version |
π’Easy |
Binary Search, Interactive |
Problem Set / Algorithms |
LeetCode |
300. Longest Increasing Subsequence |
π Medium |
Array, Binary Search, Dynamic Programming |
Problem Set / Algorithms |
LeetCode |
501. Find Mode in Binary Search Tree |
π’Easy |
Tree |
Problem Set / Algorithms |
LeetCode |
509. Fibonacci Number |
π’Easy |
Math, Dynamic Programming, Recursion, Memoization |
Problem Set / Algorithms |
LeetCode |
518. Coin Change II |
π Medium |
Array, Dynamic Programming |
Problem Set / Algorithms |
LeetCode |
559. Maximum Depth of N-ary Tree |
π’Easy |
Depth-first Search, Breadth-first Search |
Problem Set / Algorithms |
LeetCode |
675. Cut Off Trees for Golf Event |
π΄Hard |
Breadth-first Search |
Problem Set / Algorithms |
LeetCode |
700. Search in a Binary Search Tree |
π’Easy |
Tree |
Problem Set / Algorithms |
LeetCode |
701. Insert into a Binary Search Tree |
π Medium |
Tree |
Problem Set / Algorithms |
LeetCode |
704. Binary Search |
π’Easy |
Array, Binary Search |
Problem Set / Algorithms |
LeetCode |
746. Min Cost Climbing Stairs |
π’Easy |
Array, Dynamic Programming |
Problem Set / Algorithms |
LeetCode |
938. Range Sum of BST |
π’Easy |
Tree, Recursion |
Problem Set / Algorithms |
LeetCode |
957. Prison Cells After N Days |
π Medium |
Hash Table |
Problem Set / Algorithms |
LeetCode |
997. Find the Town Judge |
π’Easy |
Graph |
Problem Set / Algorithms |
LeetCode |
1137. N-th Tribonacci Number |
π’Easy |
Math, Dynamic Programming, Memoization |
Problem Set / Algorithms |
LeetCode |
1143. Longest Common Subsequence |
π Medium |
String, Dynamic Programming |
Problem Set / Algorithms |
LeetCode |
1221. Split a String in Balanced Strings |
π’Easy |
String, Greedy |
Problem Set / Algorithms |
LeetCode |
1710. Maximum Units on a Truck |
π’Easy |
Greedy, Sort |
Problem Set / Algorithms |
LeetCode |
TreasureIsland |
|
Depth-first Search, Breadth-first Search |
Interview Question / Amazon |
LeetCode |
TreasureIslandCenk |
|
Depth-first Search, Breadth-first Search |
Interview Question / Amazon |