Intuit

Details

Job status

FTE + Internship (mandatory)

Criteria

Round 1

27/07/23

Questions

1. Lost in Woods

   String parsing basically.

   Input

   12
   S_**___*_**D
   

   ‘S’ - start ‘D’ - destination * - obstacle _ - path

   If path exists can walk (W) else if an obstacle exists, can jump(J) over all the obstacles.

   Output

   WJWWJJ
   

2. Efficient Gardner

3. Furious Dhoni

   N x M matrix and each cell contains a value ranging from -1000 to 1000, both N and M can range from 1 to 1000.

   Given a ball which can start from any location, the ball can move to the right or down to its adjacent neighbor. If the ball goes from x1 y1 to x2 y2 (right or down), then the reward obtained is matrix[x2][y2] - matrix[x1][y1].

   Find the largest reward that can be obtained in the path where the ball moves only right or down.

4. Don’t remember..