How should I practice Retryable URL Maze?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Ramp phone screen problems in FastPrep.

Is Retryable URL Maze associated with Ramp?

FastPrep tags this as a Ramp phone screen coding practice problem when the problem catalog has that company and stage context.

Retryable URL Maze

Ramp● MediumFULLTIMEPHONE SCREEN

Learn

Problem statement

Model a URL maze with deterministic per-endpoint response sequences. Each row in responses is [url, attempt1, attempt2, ...]. An attempt is:

503 or MALFORMED: failed attempt;
NEXT:a,b,...: successful response listing next URLs;
CONGRATS: terminal success.

Starting at start, perform BFS with visited de-duplication. When a URL is dequeued, consume at most maxRetries + 1 attempts, stopping at its first valid NEXT or CONGRATS. An exhausted URL adds no neighbors.

Return the first BFS path from start to a URL that yields CONGRATS. Preserve NEXT order for ties. Return an empty array when no success is reachable.

Function

solveUrlMaze(start: String, responses: String[][], maxRetries: int) → String[]

Examples

Example 1

start = "start"responses = [["start","503","NEXT:a,b"],["a","NEXT:c"],["b","CONGRATS"],["c","CONGRATS"]]maxRetries = 1return = ["start","b"]

The start succeeds on its retry; BFS reaches b before the deeper c path.

Example 2

start = "start"responses = [["start","503","503"],["a","CONGRATS"]]maxRetries = 1return = []

The start exhausts its two allowed attempts and exposes no neighbor.

Constraints

1 <= responses.length <= 10^4.
Every URL appears as the first field of at most one row.
0 <= maxRetries <= 20.