BeginnerCoder
Donate
Algorithms Foundations course cover

Algorithms Foundations

Think like a problem-solver — implement and run classic algorithms.

1
Lesson 1 — Find the maximum
basics · 7 min
→2
Lesson 2 — Reverse a string
easy · 8 min
→3
Lesson 3 — Linear search
easy · 8 min
→4
Lesson 4 — Binary search
medium · 11 min
→5
Lesson 5 — Bubble sort
medium · 10 min
→6
Lesson 6 — Recursion: factorial
medium · 10 min
→7
Lesson 7 — GCD (Euclid)
medium · 9 min
→8
Lesson 8 — Reverse in place
medium · 9 min
→9
Lesson 9 — Prefix sums
medium · 9 min
→10
Lesson 10 — Two-sum with hashmap
medium · 9 min
→11
Lesson 11 — Fibonacci
hard · 11 min
→12
Lesson 12 — Binary search: first occurrence (lower bound)
hard · 12 min
→13
Lesson 13 — Bubble sort with early exit
hard · 12 min
→14
Lesson 14 — Two pointers
hard · 12 min
→15
Lesson 15 — Merge sorted lists
hard · 12 min
→16
Lesson 16 — Max subarray
hard · 13 min
→17
Lesson 17 — Count primes
hard · 12 min
→18
Lesson 18 — Anagram check
hard · 11 min
→19
Lesson 19 — Sliding window
hard · 11 min
→20
Lesson 20 — Coin change (DP)
hard · 13 min
→21
Lesson 21 — Backtracking: subsets
hard · 12 min
→22
Lesson 22 — Dijkstra (expert)
hard · 13 min
→23
Lesson 23 — Quicksort
very hard · 15 min
→24
Lesson 24 — Merge sort
very hard · 15 min
→25
Lesson 25 — Ultimate: Dijkstra with path
★ ultimate · 15 min
→