Data Structures & Algorithms — Beginner

Data Structures & Algorithms — Foundations: 10 topics and 23 interactive cards with runnable examples and quizzes.

Topics

1. Thinking Like a Computer Scientist — What Are Data Structures & Algorithms? · Big-O: Measuring the Cost · Why O(n²) Will Hurt You
2. Arrays & Lists — The Workhorse — What Is a List, Really? · The Cost of List Operations · Two-Pointer Technique
3. Stacks — Last In, First Out — What Is a Stack? · Stacks in Action: Balanced Brackets
4. Queues — First In, First Out — What Is a Queue? · Why Not Just Use a List?
5. Linked Lists — Nodes on a Chain — Nodes and Pointers · Reversing a Linked List
6. Searching — Finding the Needle — Linear Search · Binary Search
7. Sorting — Putting Things in Order — Bubble Sort (To Understand, Not To Use) · The Sorts You Actually Use
8. Recursion — Functions That Call Themselves — Base Case + Recursive Case · When Recursion Gets Expensive
9. Hash Tables — Instant Lookups — Why dict Is So Fast · Collisions (The Honest Footnote)
10. Mini-Projects & Practice — Project: Bracket Validator · Project: Word Frequency Counter · Project: Pair Finder (Two-Sum)