Overview
-
Get familiar and competent with a wide range of algorithmic thinking skills, so you can solve new problems as they present themselves in a constantly changing world.
Syllabus
-
Introduction
- Exploration of algorithmic thinking
- The two-sum interview problem
- The two-sum interview problem solution
- Number placement puzzle
- Triominoes puzzle
- Triominoes puzzle solution
- Introduction to divide and conquer
- Quicksort introduction
- Implementing Quicksort in Python
- Challenge: Implementing Fibonacci function in Python
- Solution: Implementing Fibonacci function in Python
- Coins on a star puzzle
- Coins on a star puzzle solution
- Introduction to transform and conquer
- Presort for mode finding
- Number placement puzzle revisited
- Challenge: Implement number puzzle solution in Python
- Solution: Implement number puzzle solution in Python
- Introduction to dynamic programming
- Top-down dynamic programming example
- Bottom-up dynamic programming example
- The knapsack problem: Theory
- The knapsack problem: Python implementation
- Challenge: The knapsack problem
- Solution: The knapsack problem
- What are hash tables?
- Python code for hash tables
- Python dictionaries
- Two-sum problem revisited
- Challenge: Ransom note
- Solution: Ransom note
- Next steps
