DP 9. Unique Paths 2 | DP on Grid with Maze Obstacles

Description

Lecture Notes/C++/Java Codes: https://takeuforward.org/data-structure/grid-unique-paths-2-dp-9/

Problem Link: https://bit.ly/3JMHc2l

Pre-req for this Series: https://www.youtube.com/watch?v=yVdKa8dnKiE&list=PLgUwDviBIf0rGlzIn_7rsaR2FQ5e6ZOL9

Make sure to join our telegram group for discussions: https://linktr.ee/takeUforward

Full Playlist: https://www.youtube.com/watch?v=FfXoiwwnxFw&list=PLgUwDviBIf0qUlt5H_kiKYaNSqJ81PMMY

In this video, we will be solving the grid unique paths problem with obstacles. Its an extension of the previous problem, so please make sure you watch the previous problem in order to understand this in depth.

If you have not yet checked our SDE sheet, you should definitely do it: https://takeuforward.org/interviews/strivers-sde-sheet-top-coding-interview-problems/

You can also get in touch with me at my social handles: https://linktr.ee/takeUforward

Designed under CodEX ©2025 Nexus

Designed under CodEX ©2025 Nexus

Designed under CodEX ©2025 Nexus