• + 1 comment

    For the test case 1 of 1 how the path is (0,1)->(0,2)->(0,3) ? If the robo starts with 1 it can end up with 2 or 3. If it starts with 2 it can end in 1 or 3. If it starts with 3 it can reach 1 or 2. So for the other path one more robot is needed rite. Can u kindly explain