Optimizing Battery Usage for Robots in Grid

[Ananya-vastare]

The algorithm used in this program implements a recursive approach to optimize the path taken by a robot navigating a grid while minimizing battery usage. Starting from the top-left corner of the grid, the robot explores potential moves to the right and downward, systematically checking for valid paths while avoiding obstacles represented by 1. The algorithm uses depth-first search (DFS) principles to explore each possible path until it reaches the bottom-right corner, which serves as the destination. Each successful move is outputted, providing a clear representation of the route taken. This method ensures that the robot efficiently conserves battery life by minimizing the number of moves required to reach its target, ultimately enhancing the robot's operational efficiency in a constrained environment.

[Ananya-vastare]

@pankaj-bind please assign this issue to me thank you

[pankaj-bind]

Do not raise a PR without creating and issue, you have to wait until I assign you that issue.