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.
If we have only one line (or equaly column) of length >= 3 - there is no way of traveling through all cells and get back visiting each cell only once. What should be an answer in this case?
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Travelling Salesman in a Grid
You are viewing a single comment's thread. Return to all comments →
If we have only one line (or equaly column) of length >= 3 - there is no way of traveling through all cells and get back visiting each cell only once. What should be an answer in this case?