Two pointers: turning O(n²) scans into one pass
Two indexes moving with a purpose can replace nested loops. The trick is knowing which pointer to move and why it is safe to skip what you skip.
WRITING / NOTES FROM THE FORGE
DSA
6 articles tagged DSA.
Binary search is a decision rule, not a trick
Once you see binary search as "find the first place a condition becomes true", a whole family of interview problems collapses into one template.
How to Prepare for Coding Interviews: A 12-Week Roadmap
How to prepare for coding interviews in 12 weeks: a week-by-week plan for data structures, patterns, mock interviews, and communicating clearly under pressure.
Graph Algorithms Every Developer Should Know: BFS, DFS, and Dijkstra
Graph algorithms every developer should know: when to use BFS, DFS, or Dijkstra, how each works, and correct Python code for routing and dependency problems.
Dynamic Programming for Beginners: A Step-by-Step Method
Dynamic programming for beginners: a repeatable five-step method to define state, write the recurrence, and move from memoization to tabulation with code.
Big O Notation Explained With Practical Examples
Big O notation explained with real code: how to read O(1), O(log n), O(n log n) and O(n²), drop constants correctly, and reason about space as well as time.