How to solve Unique path problemby@Shakhawat-Hossain
9,089 reads
9,089 reads

How to solve Unique path problem

by Shakhawat Hossain4mAugust 20th, 2019
Read on Terminal Reader
Read this story w/o Javascript
tldt arrow

Too Long; Didn't Read

Dynamic Programming is a technique in computer programming that helps to efficiently solve a class of problems that have overlapping sub-problems and optimal substructure property. The problem asks for how many unique paths start from top-left of a grid to the bottom-right. The solution to this scenario is not Dynamic Programming. The approach we tried is not dynamic programming. It is the base of dynamic programming. The main factor of this algorithm is O(m*n) Complexity is the size of the full grid.

Company Mentioned

Mention Thumbnail
featured image - How to solve Unique path problem
Shakhawat Hossain HackerNoon profile picture
Shakhawat Hossain

Shakhawat Hossain

@Shakhawat-Hossain

I am a Full Stack developer, experience with building websites and web applications.

Learn More
LEARN MORE ABOUT @SHAKHAWAT-HOSSAIN'S
EXPERTISE AND PLACE ON THE INTERNET.

Share Your Thoughts

About Author

Shakhawat Hossain HackerNoon profile picture
Shakhawat Hossain@Shakhawat-Hossain
I am a Full Stack developer, experience with building websites and web applications.

TOPICS

THIS ARTICLE WAS FEATURED IN...

Permanent on Arweave
Read on Terminal Reader
Read this story in a terminal
 Terminal
Read this story w/o Javascript
Read this story w/o Javascript
 Lite
L O A D I N G
. . . comments & more!