APR 1 |
Reverse String |
String |
LINK |
|
APR 2 |
Valid Palindrome II |
String |
LINK |
💡 |
APR 3 |
Next Permutation |
Two Pointers |
LINK |
💡 |
APR 4 |
Swapping Nodes in a Linked List |
Linked List |
LINK |
💡 |
APR 5 |
Container With Most Water |
Two Pointers |
LINK |
💡 |
APR 6 |
3Sum With Multiplicity |
Hash Table |
LINK |
|
APR 7 |
Last Stone Weight |
Heap |
LINK |
💡 |
APR 8 |
Kth Largest Element in a Stream |
Heap |
LINK |
💡 |
APR 9 |
Top K Frequent Elements |
Heap, Hash Table |
LINK |
💡 |
APR 10 |
Baseball Game |
Stack |
LINK |
|
APR 11 |
Shift 2D Grid |
Matrix |
LINK |
|
APR 12 |
Game of Life |
Matrix |
LINK |
💡 |
APR 13 |
Spiral Matrix II |
Matrix |
LINK |
💡 |
APR 14 |
Search in a Binary Search Tree |
Binary Search Tree |
LINK |
💡 |
APR 15 |
Trim a Binary Search Tree |
Binary Search Tree |
LINK |
💡 |
APR 16 |
Convert BST to Greater Tree |
Binary Search Tree |
LINK |
💡 |
APR 17 |
Increasing Order Search Tree |
Binary Search Tree |
LINK |
|
APR 18 |
Kth Smallest Element in a BST |
Binary Search Tree |
LINK |
💡 |
APR 19 |
Recover Binary Search Tree |
Binary Search Tree |
LINK |
💡 |
APR 20 |
Binary Search Tree Iterator |
Binary Search Tree, Stack |
LINK |
💡 |
APR 21 |
Design HashSet |
Hash Table |
LINK |
|
APR 22 |
Design HashMap |
Hash Table |
LINK |
|
APR 23 |
Encode and Decode TinyURL |
Hash Table |
LINK |
|
APR 24 |
Design Underground System |
Hash Table |
LINK |
|
APR 25 |
Peeking Iterator |
Design |
LINK |
|
APR 26 |
Min Cost to Connect All Points |
Minimum Spanning Tree |
|
💡 |
APR 27 |
Smallest String With Swaps |
Graph |
|
💡 |
APR 28 |
Path With Minimum Effort |
Priority Queue, Graph |
LINK |
|
APR 29 |
Is Graph Bipartite? |
Graph |
LINK |
💡 |
APR 30 |
Evaluate Division |
Graph |
|
💡 |