Google logoGoogle
Coding·45 minMembers

2D Points Connected Components by Radius

Members only

Given 2D points and radius `r`, connect two points when their distance is at most `r`; connectivity is transitive, and the output is the final number of clusters. The interviewer accepted or preferred...

SWE
graph
dfs
bfs
union-find
clustering
medium
Frequency
Low
Last asked
2026-08-04
Stage
phone-screen

Log in to continue reading the full content

Comments

Sign in to join the discussion
Loading...