Westin Intern Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Hard

Timing was 11 am. Platform was quite well.

Q1. Rat in a Maze
You are given a starting position for a rat which is stuck in a maze at an initial point (0, 0) (the maze can be thought of as a 2-dimensional plane). The maze would be given in the form of a...read more
Ans. Bactracking
Approach: We can start the traversal of the paths from the rat’s starting position, i.e. (0,0) keeping track of the visited cells during the traversal. We will recursively go through all the paths possible until the last index of the grid (destination) is reached, and add the path information using which the rat successfully reached the end.
 
Algorithm is as follows:
 
1. Take the starting position of th...read more
Answered by CodingNinjas
Add your answer
Q2. Minimum Cost to Destination
You have been given an N*M matrix where there are 'N' rows and 'M' columns filled with '0s' and '1s'.


'1' means you can use the cell,...read more
Ans. Backtracking
Maintain a visited array and try to explore all the possibilities with the help of backtracking.
1. Start with (0, 0) and mark it as visited and try to move in all 4 directions.
2. Say at any point we are at (i, j) then the cost of reaching (x,y) will be the minimum of these four cases.
   1. Option 1 -  Left: cost of reaching from (i, j-1)
   2. Option 2 - Right: cost of reaching from (i, j+1)
   3. Option 3 - Up: 1 + cost of rea...read more
Answered by CodingNinjas
View 2 more answers