About the assignment

You have an mxn grid containing 0s and 1s. This is a maze where 1 represents a block of wall and 0 is space. You have a robot at a given position in the grid. The robot can move in all 4 directions. We want the robot to come out of the maze from a fixed exit position in the grid.

1. Given the grid, the starting position of the robot and the exit position as inputs, write a program to check if a path exists to move from the starting position to the exit position.
2. Explain multiple approaches and write code for any one of them. Explain time and space complexities well.
3. Create a new problem which is a modification of this question and explain the expected solution in a few lines.

I submitted the assignment within an hour.

I am currently pursuing B.tech in Information Technology and just completed my pre-final year. Searching for a summer internship, I applied for the CP-Intern at HeyCoach (off-campus).

On 3rd May, 2024; I got a call from the recruiter of HeyCoach, she asked if it was the right time to talk. I replied yes it is. Then, she asked for a brief introduction and about my tech stack. Afterwards, she provided information about the company and the tools I will be working on. Additionally, She told me that I had to contribute 2 hours daily and asked if I was okay with it. I replied with a yes and asked if the hours were flexible. She responded affirmatively. She then sent an assignment to my e-mail and asked me that I had to revert within 2 hours.