β The questions that are also listed in the Top Interview are marked withγπ γ.
# | Title | Solution | Diffuiculty | Category | Topics |
---|---|---|---|---|---|
1.π | Two Sum | Java / Go / JS / C# | Easy | Algorithms | Array / Hash Table |
2.π | Add Two Numbers | Go / Java / JS / C# | Medium | Algorithms | Linked List / Math / Recursion |
3.π | Longest Substring Without Repeating Characters | Go / Java / JS / C# | Medium | Algorithms | Hash Table / Two Pointers / String / Sliding Window |
4.π | Median of Two Sorted Arrays | Java / JS | Hard | Algorithms | Array / Binary Search / Divide and Conquer |
5.π | Longest Palindromic Substring | Java | Medium | Algorithms | String / Dynamic Programming |
10.π | Regular Expression Matching | Java | Hard | Algorithms | String / Dynamic Programming / Backtracking |
11.π | Container With Most Water | Java | Medium | Algorithms | Array / Two Pointers |
15.π | 3Sum | Medium | Algorithms | Array / Two Pointers | |
17.π | Letter Combinations of a Phone Number | Medium | Algorithms | String / Backtracking / Depth-first Search / Recursion | |
19.π | Remove Nth Node From End of List | Medium | Algorithms | Linked List / Two Pointers | |
20.π | Valid Parentheses | Go / JS / C# | Easy | Algorithms | String / Stack |
21.π | Merge Two Sorted Lists | Go / JS / C# | Easy | Algorithms | Linked List / Recursion |
22.π | Generate Parentheses | Medium | Algorithms | String / Backtracking | |
23.π | Merge k Sorted Lists | Hard | Algorithms | Linked List / Divide and Conquer / Heap | |
32. | Longest Valid Parentheses | Hard | Algorithms | String / Dynamic Programming | |
33.π | Search in Rotated Sorted Array | Medium | Algorithms | Array / Binary Search | |
34.π | Find First and Last Position of Element in Sorted Array | Medium | Algorithms | Array / Binary Search | |
39. | Combination Sum | Medium | Algorithms | Array / Backtracking | |
41.π | First Missing Positive | Hard | Algorithms | Array | |
42.π | Trapping Rain Water | Hard | Algorithms | Array / Two Pointers / Dynamic Programming / Stack | |
45. | Jump Game II | Hard | Algorithms | Array / Greedy | |
46.π | Permutations | Medium | Algorithms | Backtracking | |
48.π | Rotate Image | Medium | Algorithms | Array | |
49.π | Group Anagrams | Medium | Algorithms | Hash Table / String | |
53.π | Maximum Subarray | C# / Go | Easy | Algorithms | Array / Divide and Conquer / Dynamic Programming |
55.π | Jump Game | Medium | Algorithms | Array / Greedy | |
56.π | Merge Intervals | Medium | Algorithms | Array / Sort | |
62.π | Unique Paths | Medium | Algorithms | Array / Dynamic Programming | |
64. | Minimum Path Sum | Medium | Algorithms | Array / Dynamic Programming | |
70.π | Climbing Stairs | C# / Go | Easy | Algorithms | Dynamic Programming |
72. | Edit Distance | Hard | Algorithms | String / Dynamic Programming | |
75.π | Sort Colors | Medium | Algorithms | Array / Two Pointers / Sort | |
76.π | Minimum Window Substring | Hard | Algorithms | Hash Table / Two Pointers / String / Sliding Window | |
78.π | Subsets | Medium | Algorithms | Array / Backtracking / Bit Manipulation | |
79.π | Word Search | Medium | Algorithms | Array / Backtracking | |
84.π | Largest Rectangle in Histogram | Hard | Algorithms | Array / Stack | |
85. | Maximal Rectangle | Hard | Algorithms | Array / Hash Table / Dynamic Programming / Stack | |
94.π | Binary Tree Inorder Traversal | Medium | Algorithms | Hash Table / Stack / Tree | |
96. | Unique Binary Search Trees | Medium | Algorithms | Dynamic Programming / Tree | |
98.π | Validate Binary Search Tree | Medium | Algorithms | Tree / Depth-first Search / Recursion | |
101.π | Symmetric Tree | C# / Go | Easy | Algorithms | Tree / Depth-first Search / Breadth-first Search |
102.π | Binary Tree Level Order Traversal | Medium | Algorithms | Tree / Breadth-first Search | |
104.π | Maximum Depth of Binary Tree | C# / Go | Easy | Algorithms | Tree / Depth-first Search / Recursion |
105.π | Construct Binary Tree from Preorder and Inorder Traversal | Medium | Algorithms | Array / Tree / Depth-first Search | |
114. | Flatten Binary Tree to Linked List | Medium | Algorithms | Tree / Depth-first Search | |
121.π | Best Time to Buy and Sell Stock | C# / Go | Easy | Algorithms | Array / Dynamic Programming |
124.π | Binary Tree Maximum Path Sum | Hard | Algorithms | Tree / Depth-first Search / Recursion | |
128.π | Longest Consecutive Sequence | Hard | Algorithms | Array / Union Find | |
136.π | Single Number | C# / Go | Easy | Algorithms | Hash Table / Bit Manipulation |
138.π | Copy List with Random Pointer | Medium | Algorithms | Hash Table / Linked List | |
139.π | Word Break | Medium | Algorithms | Dynamic Programming | |
141.π | Linked List Cycle | C# / Go | Easy | Algorithms | Linked List / Two Pointers |
142. | Linked List Cycle II | Medium | Algorithms | Linked List / Two Pointers | |
146.π | LRU Cache | Medium | Algorithms | Design | |
148.π | Sort List | Medium | Algorithms | Linked List / Sort | |
152.π | Maximum Product Subarray | Medium | Algorithms | Array / Dynamic Programming | |
155.π | Min Stack | C# / Go | Easy | Algorithms | Stack / Design |
160.π | Intersection of Two Linked Lists | C# / Go | Easy | Algorithms | Linked List |
169.π | Majority Element | C# / Go | Easy | Algorithms | Array / Divide and Conquer / Bit Manipulation |
198.π | House Robber | Medium | Algorithms | Dynamic Programming | |
200.π | Number of Islands | Medium | Algorithms | Depth-first Search / Breadth-first Search / Union Find | |
206.π | Reverse Linked List | C# / Go | Easy | Algorithms | Linked List |
207.π | Course Schedule | Medium | Algorithms | Depth-first Search / Breadth-first Search / Graph / Topological Sort | |
208.π | Implement Trie (Prefix Tree) | Medium | Algorithms | Design / Trie | |
215.π | Kth Largest Element in an Array | Medium | Algorithms | Divide and Conquer / Heap | |
221. | Maximal Square | Medium | Algorithms | Dynamic Programming | |
226. | Invert Binary Tree | C# / Go | Easy | Algorithms | Tree |
230.π | Kth Smallest Element in a BST | Medium | Algorithms | Binary Search / Tree | |
234.π | Palindrome Linked List | C# / Go | Easy | Algorithms | Linked List / Two Pointers |
236.π | Lowest Common Ancestor of a Binary Tree | Medium | Algorithms | Tree | |
238.π | Product of Array Except Self | Medium | Algorithms | Array | |
239.π | Sliding Window Maximum | Hard | Algorithms | Heap / Sliding Window / Dequeue | |
240.π | Search a 2D Matrix II | Medium | Algorithms | Binary Search / Divide and Conquer | |
253.π | Meeting Rooms II π | - | Medium | - | - |
279.π | Perfect Squares | Medium | Algorithms | Math / Dynamic Programming / Breadth-first Search | |
283.π | Move Zeroes | C# / Go | Easy | Algorithms | Array / Two Pointers |
287.π | Find the Duplicate Number | Medium | Algorithms | Array / Two Pointers / Binary Search | |
295.π | Find Median from Data Stream | Hard | Algorithms | Heap / Design | |
297.π | Serialize and Deserialize Binary Tree | Hard | Algorithms | Tree / Design | |
300.π | Longest Increasing Subsequence | Medium | Algorithms | Binary Search / Dynamic Programming | |
309. | Best Time to Buy and Sell Stock with Cooldown | Medium | Algorithms | Dynamic Programmin | |
322.π | Coin Change | Medium | Algorithms | Dynamic Programming | |
337. | House Robber III | Medium | Algorithms | Dynamic Programming / Tree / Depth-first Search | |
338. | Counting Bits | Medium | Algorithms | Dynamic Programming / Bit Manipulation | |
347.π | Top K Frequent Elements | Medium | Algorithms | Hash Table / Heap | |
394. | Decode String | Medium | Algorithms | Stack / Depth-first Search | |
406. | Queue Reconstruction by Height | Medium | Algorithms | Greedy | |
416. | Partition Equal Subset Sum | Medium | Algorithms | Dynamic Programming | |
437. | Path Sum III | Medium | Algorithms | Tree | |
438. | Find All Anagrams in a String | Medium | Algorithms | Hash Table | |
448. | Find All Numbers Disappeared in an Array | C# / Go | Easy | Algorithms | Array |
494. | Target Sum | Medium | Algorithms | Dynamic Programming / Depth-first Search | |
543. | Diameter of Binary Tree | C# / Go | Easy | Algorithms | Tree |
560. | Subarray Sum Equals K | Medium | Algorithms | Array / Hash Table | |
581. | Shortest Unsorted Continuous Subarray | Medium | Algorithms | Array | |
617. | Merge Two Binary Trees | C# / Go | Easy | Algorithms | Tree |
621. | Task Scheduler | Medium | Algorithms | Array / Greedy / Queue | |
647. | Palindromic Substrings | Medium | Algorithms | String / Dynamic Programming | |
739. | Daily Temperatures | Medium | Algorithms | Hash Table / Stack | |
763. | Partition Labels | Medium | Algorithms | Two Pointers / Greedy |