PracHub
QuestionsPremiumLearningGuidesInterview PrepNEWCoaches
|Home/Coding & Algorithms/Uber

Produce a valid deployment order

Last updated: Mar 29, 2026

Quick Overview

This question evaluates proficiency in graph algorithms and dependency resolution, including concepts such as topological ordering, cycle detection, and complexity analysis, plus systems-level reasoning about service deployment dependencies.

  • Medium
  • Uber
  • Coding & Algorithms
  • Software Engineer

Produce a valid deployment order

Company: Uber

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: Medium

Interview Round: Technical Screen

You are given N services and a list of dependency pairs (A, B) meaning service B must be deployed before service A. Compute any valid deployment order of all services. If no valid order exists due to cycles, detect the cycle and return an appropriate indication. Describe and implement your approach (e.g., Kahn’s BFS-based algorithm or a DFS-based topological sort), analyze time and space complexity, and explain how you would handle partial deployments, retries, and failure recovery in production.

Quick Answer: This question evaluates proficiency in graph algorithms and dependency resolution, including concepts such as topological ordering, cycle detection, and complexity analysis, plus systems-level reasoning about service deployment dependencies.

Related Interview Questions

  • Implement stream queries and bounded-difference subarrays - Uber (medium)
  • Implement Minesweeper and Word Search - Uber (medium)
  • Implement Store Autocomplete - Uber (medium)
  • Simulate a Rank-Based Tournament - Uber (medium)
  • Implement Cache Eviction And Seat Assignment - Uber (medium)
Uber logo
Uber
Aug 12, 2025, 12:00 AM
Software Engineer
Technical Screen
Coding & Algorithms
10
0

You are given N services and a list of dependency pairs (A, B) meaning service B must be deployed before service A. Compute any valid deployment order of all services. If no valid order exists due to cycles, detect the cycle and return an appropriate indication. Describe and implement your approach (e.g., Kahn’s BFS-based algorithm or a DFS-based topological sort), analyze time and space complexity, and explain how you would handle partial deployments, retries, and failure recovery in production.

Comments (0)

Sign in to leave a comment

Loading comments...

Browse More Questions

More Coding & Algorithms•More Uber•More Software Engineer•Uber Software Engineer•Uber Coding & Algorithms•Software Engineer Coding & Algorithms
PracHub

Master your tech interviews with 7,500+ real questions from top companies.

Product

  • Questions
  • Learning Tracks
  • Interview Guides
  • Resources
  • Premium
  • For Universities
  • Student Access

Browse

  • By Company
  • By Role
  • By Category
  • Topic Hubs
  • SQL Questions
  • Compare Platforms
  • Discord Community

Support

  • support@prachub.com
  • (916) 541-4762

Legal

  • Privacy Policy
  • Terms of Service
  • About Us

© 2026 PracHub. All rights reserved.