Total unique paths in a 2D matrix - Dynamic Programming
Calculate the total number of unique paths to reach from top left to bottom right in a 2D matrix using dynamic programming.
"Rat maze problem"
📖 Suggested books
Introduction to Algorithms - https://amzn.to/3IdqpHu
Data Structures And Algorithms Made Easy: Data Structures - https://amzn.to/3vuqVJE
SPEAKING JAVASCRIPT AN IN-DEPTH GUIDE FOR PROGRAMMERS - https://amzn.to/3i149FU
Cracking the Coding Interview - https://amzn.to/3jJnzjm
DESIGNING DATA-INTENSIVE APPLICATIONS - https://amzn.to/3GqD4Wa
Atomic Habits: The life-changing million-copy bestseller - https://amzn.to/3IcETHm
System Design Interview - An insider's guide - https://amzn.to/3jDZtqa
DEEP WORK: RULES FOR FOCUSED SUCCESS IN A DISTRACTED WORLD - https://amzn.to/3GrumHg
