GamifiedGamified challengesPracticeRaceLeaderboardPricing

Learn data structures by watching them move, then doing it yourself. Press M anytime to toggle sound.

A product of Amypo Technologies, Coimbatore.

Learn

  • All topics
  • Learning path
  • How it works
  • About dotprep

Practice

  • Practice arena
  • Daily challenge
  • Gamified challenges
  • Race mode
  • Leaderboard

Interview prep

  • Java interview
  • Coding questions
  • Company questions
  • System design
  • Jobs & careers

You

  • Dashboard
  • Settings
  • Pricing
  • Create account

© 2026 dotprep

Content last updated 20 November 2026

GamifiedGamified challengesPracticeRaceLeaderboardPricing
Log inStart free
Gamified challengesCity Hub Finder

Gamified challenge · All-pairs shortest paths

City Hub Finder

There are n cities, 0 to n - 1. Each entry [u, v, length] of roads is a two-way road. The distance between two cities is the length of the shortest route between them, possibly through other cities.

For each city, count the other cities whose distance is at most limit. Write hub(n, roads, limit) that returns the city with the fewest such neighbours; if several cities tie, return the largest city number.

Example: roads [[0,1,3],[1,2,1],[1,3,4],[2,3,1]], n = 4, limit = 4. Cities 0 and 3 each reach 2 others within 4 (cities 1 and 2 reach 3), so the answer is 3.

Sign in to play City Hub Finder

This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.

Sign in with Google

or log in with email · create an account