Part of the Haskell series:
- The Haskell Learning PlanThis post!
- The Basics of Haskell
- Haskell Algorithms
Phase 1: Foundations (Weeks 1–4)
Week 1
- Effective Haskell - Chapters 1 & 2 ✅
- Real World Haskell - Chapters 1 & 2 ✅
- Classic Algorithms -
Week 2
- Effective Haskell - Chapters 3 & 4
- Real World Haskell - Chapters 3
- Classic Algorithms
- Linked List
- Binary Tree
- Searching
Week 3
- Effective Haskell - Chapter 5
- Real World Haskell - Chapter 4
- Build Arithmetric Express Evaluator
- Use Stack
Week 4
- Effective Haskell - Chapter 6
- Leetcode Problems
- Two Sum
- Reverse a Linked List
- Valid Parentheses
Phase 2: Intermediate Concepts (Weeks 5–8)
Week 5
- Effective Haskell - Chapters 7 & 8
- Real World Haskell - Chapters 5 & 6
- Build Conway’s Game of Life
Week 6
- Effective Haskell - Chapter 9
- Real World Haskell - Chapter 7
- Monads - A deep dive
Week 7
- Effective Haskell - Chapters 10 & 11
- Real World Haskell - Chapters 8 & 9
- Leetcode Problems
- Merge Two Sorted Lists
- Binary Tree Inorder Traversal
- Maximum Subarray (Kadane’s Algorithm)
- Climbing Stairs (Fibonacci Variant)
Week 8
- Effective Haskell - Chapter 12
- Real World Haskell - Chapter 10
- Build a CLI Task Manager