← Back to Directory

Rubrik

Large Enterprises

Screna has 2 Rubrik interview write-ups. The most reported round is the technical phone screen (2).

2 interview notes · updated Jun 2026

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.”

View Post

Rubrik·Software Engineer·Technical Phone Screen

Apr 2026
Rubrik SWE interview with a tree/BFS problem that looks deceptively clean until you actually try to implement it. The problem involves validating BFS traversal queries against a tree defined by two parallel edge vectors.
  • You're given two equal-length vectors defining a tree's edges, where position in the vectors encodes hierarchy. Given a list of candidate BFS traversals, determine which ones are valid for that tree.

“The edge encoding threw me off at first.”

View Post