2.2.4 - Column by Column Computation
Enroll to start learning
You’ve not yet enrolled in this course. Please enroll for free to listen to audio lessons, classroom podcasts and take practice test.
Practice Questions
Test your understanding with targeted questions
How many paths exist from (0,0) to (1,1) in a grid with no obstacles?
💡 Hint: Consider the two possible movements: right then up, or up then right.
What is the number of paths from (0,0) to (0,0)?
💡 Hint: Think about staying in the same spot.
4 more questions available
Interactive Quizzes
Quick quizzes to reinforce your learning
How many ways can you reach (0,0) from (0,0)?
💡 Hint: Think about the simplest path.
Dynamic programming guarantees fewer calls than memoization.
💡 Hint: Reflect on the efficiencies of direct vs recursive strategies.
1 more question available
Challenge Problems
Push your limits with advanced challenges
How would you compute paths in a grid of size 100x100 with random holes placed throughout?
💡 Hint: Think about the memory storage needed for computations.
Propose a new method to slim down the computations further in this grid-path scenario.
💡 Hint: Integrate heuristic searches that rely on grid layout.
Get performance evaluation
Reference links
Supplementary resources to enhance your learning experience.