College-friendly notes on algorithm specification, complexity, arrays, strings, linked structures, stacks, queues, hash tables, trees, heaps, graph traversal and shortest paths. Includes correctness invariants, worked traces, complexity analysis, search experiments and a help-desk scheduling project. Basic programming and discrete-math familiarity are useful but key reasoning is introduced. Digital study notes with lifetime online access; no internship certificate.
What you’ll study
4 sections · 8 detailed chapters · about 40 minutes of reading · lifetime access. Chapter text is available online and as a downloadable PDF after purchase.
01 · Reasoning About Algorithms
Problem statements and complexity5 min read
Arrays, strings and two-pointer patterns5 min read
02 · Linear and Hash-Based Structures
Linked lists, stacks and queues5 min read
Hash tables and collision handling5 min read
03 · Trees, Graphs and Search
Trees, heaps and binary search trees5 min read
Graphs, BFS, DFS and shortest paths5 min read
04 · Practice and Review
Guided lab: compare search strategies5 min read
Mini project: choose a structure for a help-desk queue5 min read