🧩 Algorithms Foundations
Think like a problem-solver — implement and run classic algorithms.
1→2→3→4→5→6→7→8→9→10→11→12→13→14→15→16→
Lesson 1 — Find the maximum
basics · 7 min
Lesson 2 — Reverse a string
easy · 8 min
Lesson 3 — Linear search
easy · 8 min
Lesson 4 — Binary search
medium · 11 min
Lesson 5 — Bubble sort
medium · 10 min
Lesson 6 — Fibonacci
hard · 11 min
Lesson 7 — Binary search
hard · 12 min
Lesson 8 — Bubble sort
hard · 12 min
Lesson 9 — Two pointers
hard · 12 min
Lesson 10 — Recursion: factorial
medium · 10 min
Lesson 11 — Merge sorted lists
hard · 12 min
Lesson 12 — Max subarray
hard · 13 min
Lesson 13 — GCD (Euclid)
medium · 9 min
Lesson 14 — Count primes
hard · 12 min
Lesson 15 — Reverse in place
medium · 9 min
Lesson 16 — Anagram check
hard · 11 min