I am confused around similar types of problem:\n\n1) [shortest path in binary matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/) : I know this problem can be solved using BFS. I am confused around why can\'t it be solved using Dynamic Programming?\nI can use recursion with meomisation, keeping the track of visited nodes.\n\n2) [Mininum path sum](https://leetcode.com/problems/minimum-path-sum/) - This problem is solved using Dynamic Programming. My question is why can\'t this problem be solved using BFS ?\n\nLeetcoders, it will be of great help if anyone can please help me solve the confusion around this.

I am confused around similar types of problem:\n\n1) shortest path in binary matrix : I know this problem can be solved using BFS. I am confused around why can\