Easy
🔍 Searching
Linear Search
Brute-force check every element. O(n) is the simplest search there is—and frankly, for small arrays in memory, it's usually all you need.
Complexity hidden for beginners
8 min
Start Beginner
AI WisdomAll tracks
Track
Beginner
First-time Python learners
Time to build real engineering habits. We'll trace how loops, functions, and arrays actually work under the hood so you don't just guess-and-run your scripts.
Loops & iteration
Functions & scope
List operations
10 algorithms in this track
Easy
Counting
Count Occurrences
Building a frequency map. Watch a hash dictionary accumulate tallies in a single pass. This is a foundational pattern for log analysis.
Complexity hidden for beginners
8 min
Start Easy
Array
Find Min & Max
Tracking boundaries. Look at how one pass is enough to track both limits simultaneously without wasting CPU cycles sorting the data.
Complexity hidden for beginners
8 min
Start Easy
Math
Sum & Average
The accumulator pattern. See how sum() elegantly iterates arrays underneath. You'll write this pattern a thousand times before you retire.
Complexity hidden for beginners
6 min
Start Easy
Loops
Loop Explorer
Watch how loop bodies modify shared state variables across passes. Getting iteration boundaries right is how you prevent off-by-one errors in prod.
Complexity hidden for beginners
12 min
Start Easy
Array
Reverse a List
The two-pointer squeeze. Watch them march inward and swap elements. A classic O(n) in-place technique that saves you from allocating new arrays.
Complexity hidden for beginners
8 min
Start Easy
Strings
Check Palindrome
Symmetry checking. See how the two-pointer approach confirms matches from both ends while instantly bailing at the first failed check.
Complexity hidden for beginners
8 min
Start Easy
Math
FizzBuzz
The classic interview gatekeeper. See how modulo operators dictate flow control across a loop, and why the order of your conditions is everything.
Complexity hidden for beginners
6 min
Start Easy
Math
Factorial (Iterative)
Multiplying 1 to n. Witness the accumulator pattern grow exponentially. This teaches you why base conditions and correctly starting at 1 (not 0) are vital.
Complexity hidden for beginners
6 min
Start Medium
Math
Fibonacci (Iterative)
Generating sequences with rolling variables. Understand why tracking just the last two values in O(1) space completely destroys the recursive approach.
Time: O(n)
Space: O(1)
8 min
Start