1.
Two Pointers (Fast and Slow Pointers)
2. Sliding Window Technique
3. Line Sweep Algorithms
4. Prefix Sum Mastery
5. Bit Manipulation Wonders, Bitwise XOR
6. Monotonic Stack Brilliance, Stacks
7. Heap and Priority Queue, Two Heaps
8. Linked List Mastery, In Place manipulation of LL, Dummy Node
9. Binary Search Unveiled (LC), Introduction to Modified Binary
search
10. String Manipulation
11. Greedy Techniques
12. Recursive Prowess
13. Backtracking Magic
14. Trees Decoded, Binary Tree Traversal, Tree DFS and Tree
BFS
15. Trie Triumphs
16. Graph Essentials, Union Find
17. Dynamic Programming Dynamics, Topological Sort
(Educative) 0/1 Knapsack and Unbounded Knapsack (DG)
18. Merge Intervals
19. K-way Merge
20. Top K elements
21. Subsets
22. Cyclic Sort
23. Sort& Search, Sorting algorithms
24. Matrices, Matrix Traversal
25. HashMap, Hash Tables
26. Custom Data Structures
27. Ordered Set
28. Multi-threaded
29. Palindromic Sequence
30. LCS
31. Monotonic Queues
32. Counting Pattern
33. Overlapping Intervals
34. Simulation Pattern
35. Linear Sorting Algorithm Pattern
36. Meet in the Middle Pattern
37. MO's Algorithm Pattern
38. Serialize and Deserialize Pattern
39. Clone Pattern
40. Articulation Points and Bridges Pattern
41. Segment Tree Pattern
42. Binary Indexed Tree Pattern
43. Kadane’s algorithm