Python Grid Interview Challenge with Recursion & Dynamic Programming

Published: 27 October 2021
on channel: Coderbyte

2,234

As part of our back-to-basic series, Liz revisits two concepts she struggled with early in her coding career: recursion and dynamic programming. Liz walks through how to solve a classic grid interview question using both concepts in Python.

The Challenge:
Write a function to return the number of possible paths from one corner of a grid to its opposite corner

Video Overview:
0:41 The problem
0:56 Walkthrough of examples
3:22 Recursive python solution
27:28 Stepping through with a debugger
35:26 Dynamic programming python solution
49:01 Walkthrough with a debugger
58:28 Recap

Please subscribe to our channel!

If you have any recommendations for videos you’d like to see, please comment below.

Additional Resources:
Practice hundreds of real coding challenges at https://coderbyte.com/
Need more practice? Check out our channel for more videos on preparing for a coding interview / coderbytedevelopers

On this page of the site you can watch the video online Python Grid Interview Challenge with Recursion & Dynamic Programming with a duration of hours minute second in good quality, which was uploaded by the user Coderbyte 27 October 2021, share the link with friends and acquaintances, this video has already been watched 2,234 times on youtube and it was liked by 56 viewers. Enjoy your viewing!