Interview Question
- 0of 0 votes
Answersin a NxN matrix, a robot is moving in a direction. there are some blocks where it can change its direction(left/right/uturn/up/down). find an optimal path to go between 2 points..
- caa0453 December 03, 2017 in United States
travel rule :
1) robot must move in right direction from the starting point...
2) robot move in a clock wise direction
3) some square road block is there, where robot can not pass( can be 1x1 or 3x3 .. size is odd no square) but can go adjacent to wall in clockwise direction.
4) 1 cell = 1 step
plz help me with the algo.. or pesudo code.. how to determine the moving direction ( right or moving clockwise)| Report Duplicate | Flag | PURGE
Algorithm
Email me when people comment.
Email me when people comment.
Loading...
An error occurred in subscribing you.
Email me when people comment.
Email me when people comment.
Loading...
An error occurred in subscribing you.
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.