Code Room
CodingEasy
Question
Given an unsorted list of closed integer intervals [start, end], two intervals belong to the same cluster when they overlap or touch at an endpoint — directly, or through a chain of other intervals. Return the number of clusters. Example: [[1,3],[2,4],[7,9],[10,11]] has 3 clusters: {[1,3],[2,4]}, {[7,9]}, and {[10,11]}.
Implement
count_clusters(intervals: list[list[int]]) → intExamples
in
[[[1,3],[2,4],[7,9],[10,11]]]out3What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
Learn the concepts
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.
Run or narrate your approach, then ask the coach.