Link to the question:- https://www.interviewbit.com/problems/rook-movement/
I tried BFS where in each state I store min steps,direction (up,down,left or right). I am getting TLE for large inputs.
Can someone help me ?
Thanks.
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
Link to the question:- https://www.interviewbit.com/problems/rook-movement/
I tried BFS where in each state I store min steps,direction (up,down,left or right). I am getting TLE for large inputs.
Can someone help me ?
Thanks.
| Name |
|---|



Why do you need to store the direction? BFS will never revisit the same cell due to the shortest number of steps property. And I also don't understand how you can get TLE because the input is small. Try posting your code here.
I thought that direction is required.
Consider the eg:-
000111
000000
where '1' denotes obstacles.
We can visit (1,2) in 2 steps in 2 ways from (0,0):-
1) (0,2) and (1,2)
2) (1,0) and (1,2).
Now if destination is (1,3), we would prefer 2nd) option over first as using first option would give 3 steps as answer but optimal answer to reach (1,3) should be 2.
Anyway, your method works as well. Just that I don't understand how you got TLE. Posting some code would certainly help people to determine the cause of the problem.
Added my code.