Find earliest time all riders become connected

Quick Overview

This question evaluates graph connectivity and dynamic event-processing skills, testing conceptual understanding of connectivity in undirected graphs as well as practical algorithmic implementation for tracking when components merge; it belongs to the Coding & Algorithms category.

Find earliest time all riders become connected

Company: Uber

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Technical Screen

Overview: This question evaluates graph connectivity and dynamic event-processing skills, testing conceptual understanding of connectivity in undirected graphs as well as practical algorithmic implementation for tracking when components merge; it belongs to the Coding & Algorithms category.

|Home/Coding & Algorithms/Uber
Uber logo
Uber
Jan 22, 2026
mediumSoftware EngineerTechnical ScreenCoding & Algorithms
48
0
Loading...

Submit Your Answer to Earn 20XP

Sign in to leave a comment

Loading comments...