0001 |
Easy |
Two Sum |
Array, HashMap |
solution |
0002 |
Medium |
Add Two numbers |
LinkedList, Recursion |
solution |
0003 |
Medium |
Longest Substring Without Repeating Characters |
Hash Table, String, Sliding Window |
solution |
0004 |
Hard |
Median of Two Sorted Arrays |
Array, Binary Search, Divide and Conquer |
solution |
0011 |
Medium |
Container With Most Water |
Array, Two Pointers, Greedy |
solution |
0015 |
Medium |
Three sum |
Array, Two Pointers, Sorting |
solution |
0019 |
Medium |
Remove Nth Node From End Of List |
Linked List, Two Pointers |
solution |
0021 |
Easy |
Merge Two Sorted Lists |
Linked List, Recursion |
solution |
0022 |
Medium |
Generate Parentheses |
String, Dynamic Programming, Backtracking |
solution |
0023 |
Hard |
Merge K sorted Lists |
Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort |
solution |
0025 |
Hard |
Reverse Nodes in k-Group |
Linked List, Recursion |
solution |
0033 |
Medium |
Search in Rotated Sorted Array |
Array, Binary Search |
solution |
0036 |
Medium |
Valid Sudoku |
Array, HashTable, Matrix |
solution |
0042 |
Hard |
Trapping Rain Water |
Array, Two Pointers, Dynamic Programming, Stack |
solution |
0049 |
Medium |
Group Anagrams |
Array, HashTable, String, Sorting |
solution |
0074 |
Medium |
Search a 2D Matrix |
Array, Binary Search, Matrix |
solution |
0076 |
Hard |
Minimum Window Substring |
Hash Table, String, Sliding Window |
solution |
0084 |
Hard |
Largest Rectangle in Histogram |
Array, Stack, Monotonic Stack |
solution |
0098 |
Medium |
Validate Binary Search Tree |
Tree, Depth-First Search, Binary Search Tree, Binary Tree |
solution |
0100 |
Easy |
Same Tree |
Tree, Depth-First Search, Breadth-First Search, Binary Tree |
solution |
0102 |
Medium |
Binary Tree Level Order Traversal |
Tree, Breadth-First Search, Binary Tree |
solution |
0104 |
Easy |
Maximum Depth of Binary Tree |
Tree, Depth-First Search, Breadth-First Search, Binary Tree |
solution |
0110 |
Easy |
Balanced Binary Tree |
Tree, Depth-First Search, Binary Tree |
solution |
0111 |
Easy |
Minimum Depth of Binary Tree |
Tree, Depth-First Search, Breadth-First Search, Binary Tree |
solution |
0121 |
Easy |
Best Time to Buy and Sell Stock |
Array |
solution |
0125 |
Easy |
Valid Palindrome |
String, Two Pointers |
solution |
0128 |
Medium |
Longest Consecutive Sequence |
Array, HashSet |
solution |
0138 |
Medium |
Copy List with Random Pointer |
Linked List, Hash Table |
solution |
0141 |
Easy |
Linked List Cycle |
Hash Table, Linked List, Two Pointers |
solution |
0143 |
Medium |
Reorder List |
Linked List, Two Pointers, Stack, Recursion |
solution |
0146 |
Medium |
LRU Cache |
Hash Table, Design, Linked List, Doubly-Linked List |
solution |
0150 |
Medium |
Evaluate Reverse Polish Notation |
Array, Math, Stack |
solution |
0153 |
Medium |
Find Minimum in Rotated Sorted Array |
Array, Binary Search |
solution |
0155 |
Medium |
Min Stack |
Stack, Design |
solution |
0167 |
Medium |
Two Sum II - Input Array Is Sorted |
Array, Two Pointers |
solution |
0169 |
Easy |
Majority Element |
Array, HashTable, Counting |
solution |
0199 |
Medium |
Binary Tree Right Side View |
Tree, Depth-First Search, Breadth-First Search, Binary Tree |
solution |
0206 |
Easy |
Reverse Linked List |
Linked List, Recursion |
solution |
0217 |
Easy |
Contains Duplicate |
Array |
solution |
0219 |
Easy |
Contains Duplicate II |
Array |
solution |
0226 |
Easy |
Invert Binary Tree |
Tree, Depth-First Search, Breadth-First Search, Binary Tree |
solution |
0230 |
Medium |
Kth Smallest Element in a BST |
Tree, Depth-First Search, Binary Search Tree, Binary Tree |
solution |
0238 |
Medium |
Product of Array Except Self |
Array |
solution |
0239 |
Hard |
Sliding Window Maximum |
Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue |
solution |
0242 |
Easy |
Valid Anagram |
String, HashTable |
solution |
0297 |
Medium |
Find the Duplicate Number |
Array, Two Pointers, Binary Search, Bit Manipulation |
solution |
0347 |
Medium |
Top K Frequent Elements |
Array, HashMap, Bucket Sort |
Solution |
0392 |
Easy |
Is Subsequence |
Two Pointers, String, Dynamic Programming |
solution |
0424 |
Medium |
Longest Repeating Character Replacement |
HashTable, String, Sliding Windows |
solution |
0543 |
Easy |
Diameter of Binary Tree |
Tree, Depth-First Search, Binary Tree |
solution |
0567 |
Medium |
Permutation in String |
Hash Table, Two Pointers, String, Sliding Window |
solution |
0704 |
Easy |
Binary Search |
Array, Binary Search |
solution |
0739 |
Medium |
Daily Temperatures |
Array, Stack, Monotonic Stack |
solution |
0853 |
Medium |
Car Fleet |
Array, Stack, Sorting, Monotonic Stack |
solution |
0875 |
Medium |
Koko Eating Bananas |
Array, Binary Search |
solution |
0981 |
Medium |
Time Based Key-Value Store |
Hash Table, String, Binary Search, Design |
solution |
1448 |
Medium |
Count Good Nodes in Binary Tree |
Tree, Depth-First Search, Breadth-First Search, Binary Tree |
solution |
1768 |
Easy |
Merge Strings Alternately |
Two Pointers, String |
solution |