PracHub
QuestionsLearningGuidesInterview Prep

Quick Overview

Traverse a simulated HTTP maze with breadth-first search to return the shortest route from a start URL to an exit. Handle links, malformed input, successful responses, non-retriable client errors, and bounded retries for server failures.

  • hard
  • Ramp
  • Coding & Algorithms
  • Software Engineer

Traverse an HTTP Maze with Retry Handling

Company: Ramp

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: hard

Interview Round: Onsite

Quick Answer: Traverse a simulated HTTP maze with breadth-first search to return the shortest route from a start URL to an exit. Handle links, malformed input, successful responses, non-retriable client errors, and bounded retries for server failures.

Last updated: Jul 15, 2026
Loading…
PracHub

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

Product

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

Browse

  • By Company
  • By Role
  • By Category
  • Topic Hubs
  • SQL Questions
  • AI Coding 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.

Related Coding Questions

  • Find User Airport at a Time - Ramp (medium)
  • Find an Exit in a URL Maze - Ramp (medium)
  • Maximize Earnings by Converting Days Off into Workdays - Ramp (medium)
  • Minimum Character Changes to Make Every k-Length Block a Palindrome - Ramp (medium)