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 challengesFriend Provinces

Gamified challenge · Adjacency matrix

Friend Provinces

friends is an n × n grid: friends[i][j] = 1 when persons i and j are friends, else 0. It is symmetric, and everyone is their own friend (friends[i][i] = 1).

Friendship spreads: friends of friends of friends all belong to the same province. Write provinces(friends) that returns how many provinces the town has. An empty town (n = 0) has 0.

Example: [[1, 1, 0], [1, 1, 0], [0, 0, 1]] → 2: persons 0 and 1 form one province, person 2 is alone in another.

Sign in to play Friend Provinces

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