About the time complexity of grid based dp

#1

why will the time complexity of the brute force approach be O(2^n) in grid based dp problems where we are to find the shortest weighted path frm given source to destination?

#2

@Senjuti256 beacuse we are using adjacency matrix instead of adjacency list.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.

#4

How is the time complexity O(2^n)?