JUN 1 |
Running Sum of 1D Array |
Link |
Array |
💡 |
JUN 2 |
Transpose Matrix |
Link |
Matrix |
💡 |
JUN 3 |
Range Sum Query 2D- Immutable |
Link |
Matrix |
|
JUN 4 |
N Queens |
Link |
Backtracking |
💡 |
JUN 5 |
N Queens II |
Link |
Backtracking |
💡 |
JUN 6 |
Intersection of Two Linked Lists |
Link |
Linked List |
💡 |
JUN 7 |
Merge Sorted Array |
Link |
Array |
💡 |
JUN 8 |
Remove Palindromic Subsequences |
Link |
String |
💡 |
JUN 9 |
Two Sum II Input - Array is Isolated |
Link |
Array |
💡 |
JUN 10 |
Longest substring without repeating characters |
Link |
String, Hashtable |
💡 |
JUN 11 |
Min operations to reduce X to 0 |
|
Binary Search, Hashtable |
💡 |
JUN 12 |
Maximum Erasure value |
Link |
Hashtable |
|
JUN 13 |
Triangle |
Link |
DP |
|
JUN 14 |
Delete operation for 2 strings |
Link |
Strings, DP |
💡 |
JUN 15 |
Longest string chain |
Link |
DP |
|
JUN 16 |
Longest Palindromic Substring |
Link |
DP |
💡 |
JUN 17 |
Binary tree cameras |
Link |
Tree |
💡 |
JUN 18 |
Prefix and suffix search |
|
Trie |
|
JUN 19 |
Search Suggestions System |
Link |
Binary Search |
💡 |
JUN 20 |
Short Encoding of Words |
|
Trie, Hashtable |
|
JUN 21 |
Furthest Building You Can Reach |
|
Greedy, Heap |
💡 |
JUN 22 |
Kth Largest Element in an Array |
Link |
Array |
💡 |
JUN 23 |
Course Schedule III |
Link |
Greedy, Heap |
💡 |
JUN 24 |
Construct Target Array With Multiple Sums |
|
Array |
|
JUN 25 |
Non-decreasing Array |
|
Array |
|
JUN 26 |
Maximum Points You Can Obtain from Cards |
|
Sliding Window |
💡 |
JUN 27 |
Partitioning Into Minimum Number Of Deci-Binary Numbers |
|
Greedy |
|
JUN 28 |
Minimum Deletions to Make Character Frequencies Unique |
Link |
Greedy |
|
JUN 29 |
Queue Reconstruction by Height |
Link |
Greedy |
💡 |
JUN 30 |
Minimum Moves to Equal Array Elements II |
Link |
Array |
💡 |