There are cities. For every pair of cities, there is either a direct road between them or a direct underground (metro) connection (possibly not both).
Prove that either: (i) using only roads, it is possible to travel between any two cities; or (ii) using only metro connections, it is possible to travel between any two cities.
Sign in or create an account to reveal answers, view the solution, and save your progress. Create a free account to unlock practice and keep track of your work.
One puzzle per day. Cryptarithm, Magic Square, Summit. No sign-up required to play.
Play daily puzzle →Interactive problems and curated lessons—water pouring, magic squares, knight's tour, and more.
Browse library →See how you rank. Top solvers by problems solved correctly. Sign in to climb the ranks.
View leaderboard →