Arrays & Hashing
1. Contains Duplicate (Easy)
2. Valid Anagram (Easy)
3. Two Sum (Easy)
4. Group Anagrams (Medium)
5. Top K Frequent Elements (Medium)
6. Product of Array Except Self (Medium)
7. Valid Sudoku (Medium)
8. Encode and Decode Strings (Medium)
9. Longest Consecutive Sequence (Medium)
Two Pointers
10. Valid Palindrome (Easy)
11. Two Sum II (Input Array Is Sorted) (Medium)
12. 3Sum (Medium)
13. Container With Most Water (Medium)
14. Trapping Rain Water (Hard)
Sliding Window
15. Best Time to Buy and Sell Stock (Easy)
16. Longest Substring Without Repeating Characters (Medium)
17. Longest Repeating Character Replacement (Medium)
18. Permutation in String (Medium)
19. Minimum Window Substring (Hard)
20. Sliding Window Maximum (Hard)
Stack
21. Valid Parentheses (Easy)
22. Min Stack (Medium)
23. Evaluate Reverse Polish Notation (Medium)
24. Generate Parentheses (Medium)
25. Daily Temperatures (Medium)
26. Car Fleet (Medium)
27. Largest Rectangle in Histogram (Hard)
Binary Search
28. Binary Search (Easy)
29. Search a 2D Matrix (Medium)
30. Koko Eating Bananas (Medium)
31. Find Minimum in Rotated Sorted Array (Medium)
32. Search in Rotated Sorted Array (Medium)
33. Time Based Key-Value Store (Medium)
34. Median of Two Sorted Arrays (Hard)
Linked List
35. Reverse Linked List (Easy)
36. Merge Two Sorted Lists (Easy)
37. Reorder List (Medium)
38. Remove Nth Node From End of List (Medium)
39. Copy List with Random Pointer (Medium)
40. Add Two Numbers (Medium)
41. Linked List Cycle (Easy)
42. Find the Duplicate Number (Medium)
43. LRU Cache (Hard)
44. Merge k Sorted Lists (Hard)
45. Reverse Nodes in k-Group (Hard)
Trees
46. Invert Binary Tree (Easy)
47. Maximum Depth of Binary Tree (Easy)
48. Same Tree (Easy)
49. Subtree of Another Tree (Easy)
50. Lowest Common Ancestor of a BST (Easy)
51. Binary Tree Level Order Traversal (Medium)
52. Validate Binary Search Tree (Medium)
53. Kth Smallest Element in a BST (Medium)
54. Construct Binary Tree from Preorder and Inorder
Traversal (Medium)
55. Binary Tree Maximum Path Sum (Hard)
56. Serialize and Deserialize Binary Tree (Hard)
Tries
57. Implement Trie (Prefix Tree) (Medium)
58. Design Add and Search Words Data Structure (Medium)
59. Word Search II (Hard)
Heap / Priority Queue
60. Kth Largest Element in a Stream (Easy)
61. Last Stone Weight (Easy)
62. K Closest Points to Origin (Medium)
63. Find Median from Data Stream (Hard)
Backtracking
64. Subsets (Medium)
65. Combination Sum (Medium)
66. Permutations (Medium)
67. Subsets II (Medium)
68. Combination Sum II (Medium)
69. Word Search (Medium)
70. Palindrome Partitioning (Medium)
71. Letter Combinations of a Phone Number (Medium)
72. N-Queens (Hard)
Graphs
73. Number of Islands (Medium)
74. Clone Graph (Medium)
75. Max Area of Island (Medium)
76. Pacific Atlantic Water Flow (Medium)
77. Surrounded Regions (Medium)
78. Rotting Oranges (Medium)
79. Course Schedule (Medium)
80. Course Schedule II (Medium)
81. Redundant Connection (Medium)
82. Word Ladder (Hard)
Advanced Graphs
83. Reconstruct Itinerary (Hard)
84. Min Cost to Connect All Points (Medium)
85. Network Delay Time (Medium)
86. Swim in Rising Water (Hard)
87. Alien Dictionary (Hard)
88. Cheapest Flights Within K Stops (Medium)
1D Dynamic Programming
89. Climbing Stairs (Easy)
90. House Robber (Medium)
91. House Robber II (Medium)
92. Longest Palindromic Substring (Medium)
93. Palindromic Substrings (Medium)
94. Decode Ways (Medium)
95. Coin Change (Medium)
96. Maximum Product Subarray (Medium)
97. Word Break (Medium)
98. Longest Increasing Subsequence (Medium)
2D Dynamic Programming
99. Unique Paths (Medium)
100. Longest Common Subsequence (Medium)
101. Best Time to Buy and Sell Stock with Cooldown (Medium)
102. Coin Change II (Medium)
103. Target Sum (Medium)
104. Interleaving String (Medium)
105. Edit Distance (Hard)
106. Burst Balloons (Hard)
107. Regular Expression Matching (Hard)
Greedy
108. Maximum Subarray (Easy)
109. Jump Game (Medium)
110. Jump Game II (Medium)
111. Gas Station (Medium)
112. Hand of Straights (Medium)
113. Merge Triplets to Form Target Triplet (Medium)
114. Partition Labels (Medium)
Bit Manipulation
115. Single Number (Easy)
116. Number of 1 Bits (Easy)
117. Counting Bits (Easy)
118. Reverse Bits (Easy)
119. Missing Number (Easy)
120. Sum of Two Integers (Medium)
Math & Geometry
121. Rotate Image (Medium)
122. Spiral Matrix (Medium)
123. Set Matrix Zeroes (Medium)
124. Happy Number (Easy)
125. Plus One (Easy)
126. Pow(x, n) (Medium)
127. Multiply Strings (Medium)
128. Detect Squares (Medium)
Intervals
129. Insert Interval (Medium)
130. Merge Intervals (Medium)
131. Non-overlapping Intervals (Medium)
132. Meeting Rooms (Easy)
133. Meeting Rooms II (Medium)
Advanced Data Structures
134. Find Median from Data Stream (Hard)
135. Sliding Window Median (Hard)
Miscellaneous
136. Roman to Integer (Easy)
137. Integer to Roman (Medium)
138. Random Pick with Weight (Medium)
139. Implement Rand10() Using Rand7() (Medium)
