1 |
Easy |
Two Sum |
![](icons/java.svg) |
Array, Hash Table |
15 |
Medium |
3 Sum |
![](icons/java.svg) |
Array, Two Pointers |
19 |
Medium |
Remove Nth Node From End of List |
![](icons/java.svg) |
Linked List |
21 |
Easy |
Merge Two Sorted Lists |
![](icons/java.svg) |
Linked List |
26 |
Easy |
Remove Duplicates from Sorted Array |
![](icons/java.svg) |
Array |
33 |
Medium |
Search in Rotated Sorted Array |
![](icons/java.svg) |
Array, Binary Search |
34 |
Medium |
Find First and Last Position of Element in Sorted Array |
![](icons/java.svg) |
Array, Binary Search |
39 |
Medium |
Combination Sum |
![](icons/java.svg) |
Backtracking |
46 |
Easy |
Permutations |
![](icons/java.svg) |
Backtracking |
51 |
Hard |
N-Queens |
![](icons/java.svg) |
Backtracking |
53 |
Medium |
Maximum Subarray |
![](icons/java.svg) |
Array, Dynamic Programming, Kadane Algorithm, Divide and Conquer |
54 |
Medium |
Spiral Matrix |
![](icons/java.svg) |
Array |
56 |
Medium |
Merge Intervals |
![](icons/java.svg) |
Array, Graph, Connected Component |
62 |
Medium |
Unique Paths |
![](icons/java.svg) |
Dynamic Programming |
66 |
Easy |
Plus One |
![](icons/java.svg) |
Array |
69 |
Easy |
Sqrt(x) |
![](icons/java.svg) |
Binary Search |
70 |
Easy |
Climbing Stairs |
![](icons/java.svg) |
Dynamic Programming |
72 |
Hard |
Edit Distance |
![](icons/java.svg) |
Dynamic Programming |
75 |
Hard |
Sort Colors |
![](icons/java.svg) |
Dynamic Programming |
83 |
Easy |
Remove Duplicates from Sorted List |
![](icons/java.svg) |
Linked List |
94 |
Medium |
Binary Tree Inorder Traversal |
![](icons/java.svg) |
Binary Tree, Morris Traversal |
98 |
Medium |
Validate Binary Search Tree |
![](icons/java.svg) |
Linked List |
101 |
Easy |
Symmetric Tree |
![](icons/java.svg) |
BFS |
102 |
Medium |
Binary Tree Level Order Traversal |
![](icons/java.svg) |
BFS |
104 |
Easy |
Maximum Depth of Binary Tree |
![](icons/java.svg) |
BST |
108 |
Easy |
Convert Sorted Array to Binary Search Tree |
![](icons/java.svg) |
BST |
110 |
Easy |
Balanced Binary Tree |
![](icons/java.svg) |
BST |
112 |
Easy |
Path Sum |
![](icons/java.svg) |
Binary Tree |
121 |
Easy |
Best Time to Buy and Sell Stock |
![](icons/java.svg) |
Dynamic Programming |
122 |
Easy |
Best Time to Buy and Sell Stock II |
![](icons/java.svg) |
Array |
125 |
Easy |
Valid Palindrome |
![](icons/java.svg) |
String, Two Pointers |
130 |
Medium |
Surrounded Regions |
![](icons/java.svg) |
DFS |
134 |
Medium |
Gas Station |
![](icons/java.svg) |
Array |
141 |
Easy |
Linked List Cycle |
![](icons/java.svg) |
Linked List, Floyd's Cycle Finding Algorithm |
144 |
Medium |
Binary Tree Preorder Traversal |
![](icons/java.svg) |
Binary Tree, Morris Traversal |
145 |
Medium |
Binary Tree Postorder Traversal |
![](icons/java.svg) |
Binary Tree |
146 |
Medium |
LRU Cache |
![](icons/java.svg) |
LinkedHashMap |
150 |
Medium |
Evaluate Reverse Polish Notation |
![](icons/java.svg) |
Stack |
151 |
Medium |
Reverse Words in a String |
![](icons/java.svg) |
String |
160 |
Easy |
Intersection of Two Linked Lists |
![](icons/java.svg) |
Linked List |
162 |
Medium |
Find Peak Element |
![](icons/java.svg) |
Array |
167 |
Easy |
Two Sum II - Input array is sorted |
![](icons/java.svg) |
Array, Two Pointers |
198 |
Medium |
House Robber |
![](icons/java.svg) |
Dynamic Programming |
200 |
Medium |
Number of Islands |
![](icons/java.svg) |
2D Array, DFS |
206 |
Easy |
Reverse Linked List |
![](icons/java.svg) |
Linked List |
207 |
Medium |
Course Schedule |
![](icons/java.svg) |
Topological Sort |
210 |
Medium |
Course Schedule II |
![](icons/java.svg) |
Topological Sort |
215 |
Medium |
Kth Largest Element in an Array |
![](icons/java.svg) |
Heap, Quickselect |
226 |
Easy |
Invert Binary Tree |
![](icons/java.svg) |
Array |
230 |
Medium |
Kth Smallest Element in a BST |
![](icons/java.svg) |
Array |
234 |
Easy |
Palindrome Linked List |
![](icons/java.svg) |
Linked List |
235 |
Medium |
Lowest Common Ancestor of a Binary Search Tree |
![](icons/java.svg) |
Binary Search Tree |
237 |
Easy |
Delete Node in a Linked List |
![](icons/java.svg) |
BST |
238 |
Medium |
Product of Array Except Self |
![](icons/java.svg) |
Array |
266 |
Easy |
Palindrome Permutation |
![](icons/java.svg) |
String |
270 |
Easy |
Closest Binary Search Tree Value |
![](icons/java.svg) |
BST, Binary Search |
283 |
Easy |
Move Zeroes |
![](icons/java.svg) |
Array |
285 |
Medium |
Inorder Successor in BST |
![](icons/java.svg) |
BST |
287 |
Medium |
Find the Duplicate Number |
![](icons/java.svg) |
Array, HashSet |
322 |
Medium |
Coin Change |
![](icons/java.svg) |
Dynamic Programming |
346 |
Easy |
Moving Average from Data Stream |
![](icons/java.svg) |
Queue |
349 |
Easy |
Intersection of Two Arrays |
![](icons/java.svg) |
Array |
359 |
Easy |
Logger Rate Limiter |
![](icons/java.svg) |
HashMap |
383 |
Easy |
Ransom Note |
![](icons/java.svg) |
HashMap |
387 |
Easy |
First Unique Character in a String |
![](icons/java.svg) |
String |
392 |
Easy |
Is Subsequence |
![](icons/java.svg) |
Array, Two Pointers |
443 |
Medium |
String Compression |
![](icons/java.svg) |
BST |
450 |
Medium |
Delete Node in a BST |
![](icons/java.svg) |
BST |
509 |
Easy |
Fibonacci Number |
![](icons/java.svg) |
Recursion |
511 |
Easy |
Game Play Analysis I |
![](icons/sql.svg) |
SQL |
542 |
Medium |
01 Matrix |
![](icons/sql.svg) |
BST |
543 |
Easy |
Diameter of Binary Tree |
![](icons/sql.svg) |
BST |
547 |
Medium |
Number of Provinces |
![](icons/sql.svg) |
Union Find |
586 |
Easy |
Customer Placing the Largest Number of Orders |
![](icons/sql.svg) |
SQL |
595 |
Easy |
Big Countries |
![](icons/sql.svg) |
SQL |
613 |
Easy |
Shortest Distance in a Line |
![](icons/sql.svg) |
SQL |
622 |
Medium |
Design Circular Queue |
![](icons/sql.svg) |
Array |
627 |
Easy |
Swap Salary |
![](icons/sql.svg) |
SQL |
684 |
Medium |
Redundant Connection |
![](icons/java.svg) |
Union Find |
701 |
Medium |
Insert into a Binary Search Tree |
![](icons/java.svg) |
BST |
704 |
Easy |
Binary Search |
![](icons/java.svg) |
Array, Binary Search |
709 |
Easy |
To Lower Case |
![](icons/java.svg) |
String |
743 |
Medium |
Network Delay Time |
![](icons/java.svg) |
Dijkstra's Algorithm |
746 |
Easy |
Min Cost Climbing Stairs |
![](icons/java.svg) |
Dynamic Programming |
760 |
Easy |
Find Anagram Mappings |
![](icons/java.svg) |
Array, HashTable |
771 |
Easy |
Jewels and Stones |
![](icons/java.svg) |
Array, HashSet |
787 |
Medium |
Cheapest Flights Within K Stops |
![](icons/java.svg) |
Dijkstra's Algorithm |
841 |
Medium |
Keys and Rooms |
![](icons/java.svg) |
DFS |
845 |
Medium |
Longest Mountain in Array |
![](icons/java.svg) |
Array |
896 |
Easy |
Monotonic Array |
![](icons/java.svg) |
Array |
938 |
Easy |
Range Sum of BST |
![](icons/java.svg) |
BST |
947 |
Medium |
Most Stones Removed with Same Row or Column |
![](icons/java.svg) |
Union Find |
973 |
Medium |
K Closest Points to Origin |
![](icons/java.svg) |
Heap |
977 |
Easy |
Squares of a Sorted Array |
![](icons/java.svg) |
Array, Two Pointers |
994 |
Medium |
Rotting Oranges |
![](icons/java.svg) |
BST Pointers |
1008 |
Medium |
Construct Binary Search Tree from Preorder Traversal |
![](icons/java.svg) |
BST |
1020 |
Medium |
Number of Enclaves |
![](icons/sql.svg) |
DFS |
1069 |
Easy |
Product Sales Analysis II |
![](icons/sql.svg) |
SQL |
1091 |
Medium |
Shortest Path in Binary Matrix |
![](icons/sql.svg) |
BFS |
1108 |
Easy |
Defanging an IP Address |
![](icons/java.svg) |
String |
1119 |
Easy |
Remove Vowels from a String |
![](icons/java.svg) |
String |
1162 |
Medium |
As Far from Land as Possible |
![](icons/java.svg) |
String |
1173 |
Easy |
Single-Row Keyboard |
![](icons/java.svg) |
String |
1200 |
Easy |
Minimum Absolute Difference |
![](icons/java.svg) |
Array, Sorting |
1303 |
Easy |
Find the Team Size |
![](icons/sql.svg) |
SQL |
1334 |
Medium |
Find the City With the Smallest Number of Neighbors at a Threshold Distance |
![](icons/java.svg) |
Dijkstra's Algorithm |
1350 |
Easy |
Students With Invalid Departments |
![](icons/sql.svg) |
SQL |
1378 |
Easy |
Replace Employee ID With The Unique Identifier |
![](icons/sql.svg) |
SQL |
1431 |
Easy |
Kids With the Greatest Number of Candies |
![](icons/java.svg) |
Array |
1464 |
Easy |
Maximum Product of Two Elements in an Array |
![](icons/java.svg) |
Array |
1470 |
Easy |
Shuffle the Array |
![](icons/java.svg) |
Array |
1480 |
Easy |
Running Sum of 1d Array |
![](icons/java.svg) |
Array |
1512 |
Easy |
Number of Good Pairs |
![](icons/sql.svg) |
Array |
1571 |
Easy |
Warehouse Manager |
![](icons/sql.svg) |
SQL |
1581 |
Easy |
Customer Who Visited but Did Not Make Any Transactions |
![](icons/sql.svg) |
SQL |
1587 |
Easy |
Bank Account Summary II |
![](icons/sql.svg) |
SQL |
1623 |
Easy |
All Valid Triplets That Can Represent a Country |
![](icons/sql.svg) |
SQL |
1672 |
Easy |
Richest Customer Wealth |
![](icons/sql.svg) |
Array |
1683 |
Easy |
Invalid Tweets |
![](icons/sql.svg) |
SQL |
1693 |
Easy |
Recyclable and Low Fat Products |
![](icons/sql.svg) |
SQL |
1741 |
Easy |
Find Total Time Spent by Each Employee |
![](icons/sql.svg) |
SQL |
1757 |
Easy |
Recyclable and Low Fat Products |
![](icons/sql.svg) |
SQL |
1821 |
Easy |
Find Customers With Positive Revenue this Year |
![](icons/sql.svg) |
SQL |
1853 |
Easy |
Convert Date Format |
![](icons/sql.svg) |
SQL |