Skip to content

Simply DSA

Structured revision notes for Data Structures & Algorithms. Focusing on logical breakdowns, pattern recognition, and backend engineering applications.

🛠️ Workflow

Standardized approach for every problem solution.

graph LR A[Analysis] --> B{Pattern ID} B --> C[Visualization] C --> D[Complexity] D --> E[Implementation]

🗂️ Modules

Module Topic Focus Status
01. Basics Cyclic Sort, patterns 🟢 Done
02. Arrays Two Pointers, Sliding Window 🟢 Done
03. Sorting Merge Sort, Binary Search 🟢 Done
04. Bit Manipulation XOR, Bit Masking 🟢 Done
05. Maths Primes, GCD, Modulo 🟢 Done
06. Hashing & Strings Maps, Sets, Tries 🟢 Done
07. Recursion Backtracking, Subsets 🟢 Done
08. Linked Lists & Stacks Monotonic Stack, Reversal 🟢 Done
09. Trees BST, DFS/BFS, Traversals 🟢 Done
10. Heaps Priority Queues 🟢 Done
11. Dynamic Programming 1D/2D DP, Knapsack 🟢 Done
12. Graphs BFS, DFS, MST, Shortest Path 🟢 Done

📚 References