Contains all the possible DSA codes I made over time, feel free to use it, will be updating it frequently.

Nothing on YouTube really beats the indepth explanations he gives, take my word mate🧙♂️
Helps ace those theoretical questions in college exams😉
-
A2OJ problem links 😔actual site retired in 2019, read more here
The below resources will help you out in hard times I suppose :-
Tracking my progress across core DSA topics.
✅ = Completed | 🚧 = In Progress
| Topic | Status |
|---|---|
Core Foundations |
|
| Arrays | ✅ |
| Strings | |
| Recursion & Backtracking | ✅ |
| Bit Manipulation | 🚧 |
Linear Data Structures |
|
| Linked List (Singly, Doubly, Circular) | ✅ |
| Stack | 🚧 |
| Queue & Deque | 🚧 |
Non-Linear Data Structures |
|
| Trees (Binary Tree, BST) | ✅ |
| Binary Heap / Priority Queue | 🚧 |
| Graphs (DFS, BFS, Shortest Paths, MST) | ✅ |
| Tries | |
Algorithms |
|
| Searching (Binary Search & Variants) | ✅ |
| Sorting (Merge, Quick, Heap, etc.) | ✅ |
| Divide and Conquer | 🚧 |
| Greedy Algorithms | |
| Dynamic Programming (1D, 2D, Knapsack, LIS, etc.) | ✅ |
Advanced Topics |
|
| Segment Trees & Fenwick Tree (BIT) | |
| Disjoint Set Union (Union-Find) | ✅ |
| String Algorithms (KMP, Z-Algorithm, Rabin-Karp) | |
| Graph Advanced (Flow, Bridges, Articulation Points, Kosaraju and Tarjan) | ✅ |