How to approach this prob?

#1

please help me with the approach

I have asked a doubt but no one is responding?
#2

??? please help me with this

#3

Hey @chemant077
Sorry for the delay buddy. This is a bfs question. From your initial position on board, do a bfs and keep track of least time taken to reach any cell on the grid. Return the lowest time needed to reach ending cell.

#4

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.