CS Foundations & Interview Prep

Master Arrays, Linked Lists, Hash Tables, Trees, and Graphs — and know when each shines.

Learn the two-pointer and sliding-window patterns that unlock a huge class of array and string problems.

Recognize overlapping subproblems and derive recurrences — the pattern most interviews test and most candidates fear.

Master tree traversals and graph algorithms (BFS/DFS, shortest paths, topological sort) as reusable interview patterns.

Understand Git from the object model up — blobs, trees, commits, and refs — so version-control questions never trip you up.

Apply SOLID principles and classic patterns (Factory, Strategy, Observer) to reason clearly in design rounds.