How should I practice Count Friend Circles?

Start by reading the full statement, solve the visible examples, then compare the pattern against related OpenAI onsite interview problems in FastPrep.

Is Count Friend Circles associated with OpenAI?

FastPrep tags this as a OpenAI onsite interview coding practice problem when the problem catalog has that company and stage context.

Problem · Graph

Count Friend Circles

● Medium

OpenAIFULLTIMEONSITE INTERVIEW

Problem statement

You are given an n x n matrix isConnected. If isConnected[i][j] = 1, person i and person j are direct friends.

A friend circle is a group of directly or indirectly connected people with no friendship to anyone outside the group.

The problem statement continues

Pro

Examples

Example 1

isConnected = [[1,1,0],[1,1,0],[0,0,1]]return = 2

People 0 and 1 form one friend circle, while person 2 forms another.

FastPrep Pro

Reported in 1 OpenAI interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

Full problem statement and constraints
2 more worked examples, explained
Guided hints and editorial
Run your code on real test cases

$8.25/month

$99 billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week