Rubrik·Software Engineer·Technical Phone Screen
May 2026
Rubrik SWE interview with a graph/interval connectivity problem that sounds deceptively clean until you actually have to think about the complexity tradeoffs. One round, algorithmic focus.
- You have N people, each assigned a work-time interval. Two people are connected if their intervals overlap, and connectivity is transitive (so if A overlaps B and B overlaps C, they're all in the same group even if A and C don't overlap directly). Find the size of the largest connected group.
“My first instinct was just sort by start time and merge intervals, which gets you the groups but I fumbled explaining why that works for transitivity.”