We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
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
Repair Roads
You are viewing a single comment's thread. Return to all comments →
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