Notes (Foundations)
Core data structures and algorithms for coding interviews. Topics are written to SDE-3 level: concept overview, core algorithms, advanced variations, pattern recognition, code, interview strategy, and quick revision.
Data structures
data-structures/ — Arrays, Linked List, Stack, Queue, Tree, Heap, Hashing, Graphs. Each topic file includes:
When to use which technique
Core algorithms with complexity
Common interview problems (Easy / Medium / Hard)
Pattern recognition, code, SDE-3 trade-offs, interview strategy, quick revision
Algorithms
algorithms/ — Searching (binary search, BS on answer), Sorting, Divide and Conquer, Maths, String, Bit Manipulation, Greedy, Backtracking, Graph, Union Find, Dynamic Programming, Recursion, Miscellaneous. Same SDE-3 structure where expanded.
Other notes (foundations root)
Brief comparison (Hello World, main vs if __name__) for interview language choice.
Course notes: algorithms, time complexity, merge sort.
Next steps: Use SDE3_DSA_ROADMAP.md for problem order and patterns/ for pattern-based practice.
Last updated