1p3a_oj Question

Count Non-Friend Pairs Using Union-Find Algorithm

SWE coding 0

Question Details

Given a 2D array connections representing relationships between people, where each element is a sub-array [a, b] indicating a direct relationship between two people. Assume the people are numbered

Full Details

🔒

Unlock all Snap questions

Full insider details, leaked discussions, and candidate experiences.

or every company, $100/year →

About This Question

This is a reported interview question from a snap interview for a swe role during the coding round.

It covers the following topics: Union Find, Arrays, Matrix .

Difficulty rating: 0