Grid Unique Paths | Recusion | Memoization | DP | Dynammic Problem Blind 75 Playlist | Interview Questions | Recursion | C++ | Java | DSA | Placements
In this video, we break down the Unique Paths problem (LeetCode Blind 75 #25) step by step β one of the most important Dynamic Programming problems for coding interviews.
We start with a simple recursion approach to build intuition and then optimise it using Memoisation (Top-Down DP) so you can understand how interviewers expect you to think.
If you're preparing for FAANG / product-based companies, this problem is a must-do for mastering DP patterns.
π What you'll learn:
β’ How to think in terms of recursion
β’ Identifying overlapping subproblems
β’ Converting recursion β memoization
β’ Writing clean DP code
β±οΈ Timestamps:
00:00 - Problem Understanding & Intuition
00:57 - Recursion Approach
05:20 - Memoisation (Top-Down DP)
π Source Code + Notes: https://github.com/yannigoyal/Blind75/tree/main/25_Unique_Paths
π If you found this helpful, consider subscribing to more Blind 75 explanations.
