π Python Coding Adventures
Embark on a cosmic coding journey! β¨ Choose your chapter and explore the Python universe. π
π `Course 1` to `Course 17` are based on **Python Crash Course**, designed to make learning Python fun and interactive.
π§ Starting from `Course 18`, the learning path switches to **Grokking Algorithms, Second Edition** β labels follow the textbook's own chapter numbers, so the later cards focus on algorithms, problem solving, and strategy.
π― Each chapter still uses interactive **multiple-choice questions** and small projects, so we can keep learning Python while changing to a new algorithm textbook.
π² **Newest**: `Chapter 7 β Trees` π² and `Project 7 β World Cup 2026 Bracket Tree` π go hand in hand. Learn tree concepts in Chapter 7, then predict the real 2026 World Cup tournament as a binary tree in Project 7.
Python Crash Course Track π
π
Course 1
Intro to Python
π
Course 2
Getting Started with Python
π§©
Course 3
Variables & Data Types
βοΈ
Course 4
Working with Python Lists
β
Course 5
If Statements & Logic
π
Course 6
Dictionaries
π©π»βπ
Course 7
User Input & While Loops
π½
Course 8
Functions
π±
Course 9
Classes
π―
Course 10
File and Exceptions
π»
Course 11
Testing Your Code
π
Course 12
Review Basics
πͺ
Course 13
Tic-Tak-Toe
π
Course 14
Gem-Hunter
π
Course 15
Tic-Tak-Toe Review
π€
Course 16
Intro to AI
π
Course 17
Python Crash Course Review
Grokking Algorithms Track π§
Labels match the textbook's chapter numbers (Grokking Algorithms, 2nd Edition).
π
π Intro
About Grokking Algorithms
πͺ
Chapter 1
Binary Search
π¦
Chapter 2
Selection Sort
πͺ
Chapter 3
Recursion
β‘
Chapter 4
Quicksort & D&C
π
Chapter 5
Hash Tables
π£οΈ
Chapter 6
Breadth-First Search
π²
Chapter 7 NEW
Trees
π³
Chapter 8 SOON
Balanced Trees
Projects π‘
π¨
Project 1
Unity Robot
β
Project 3
Two Player Tic-Tac-Toe
βοΈ
Project 4
δΊεζ£
π’
Project 5
ζ’ζ°ε
π‘
Project 6
Binary Search Beacon Race
π
Project 7 NEW
World Cup 2026 Bracket Tree