Industry-relevant training in Business, Technology, and Design to help professionals and graduates upskill for real-world careers.
Fun, engaging games to boost memory, math fluency, typing speed, and English skills—perfect for learners of all ages.
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.
Test your understanding with targeted questions related to the topic.
Question 1
Easy
If you are at (0,0), how many paths are there to (0,0)?
💡 Hint: Consider what it means to stay in the same place.
Question 2
Easy
Name two ways you can reach the point (2,1) in a grid starting from (0,0).
💡 Hint: Think about moving in increments of 1.
Practice 4 more questions and get performance evaluation
Engage in quick quizzes to reinforce what you've learned and check your comprehension.
Question 1
What is the formula for calculating paths to point (i,j) in a grid?
💡 Hint: Think about where you can move to reach (i,j).
Question 2
True or False: In a grid with holes, all path values are affected by zero values.
💡 Hint: Consider the flow of paths in relation to holes.
Solve 1 more question and get performance evaluation
Push your limits with challenges.
Question 1
Given a 5x5 grid with holes at (2,2) and (3,3), write a function to compute paths from (0,0) to (4,4) programmatically. Show your results for multiple layouts of holes.
💡 Hint: Map out the grid with a two-dimensional array for ease.
Question 2
Describe a scenario where using memoization might fail compared to dynamic programming when adding complexity (like adding more holes or larger grid sizes).
💡 Hint: Consider performance and time with increasing complexity in problem.
Challenge and get performance evaluation