Repeated Shortest Strictly Increasing Path Queries from the Top-Left

CodingUberLast reported September 2026Low Frequency

Reported: 1× across candidate reports
First seen: September 2026
Last reported: September 2026
Reported outcome: pass

Problem Overview

Uber coding question, reconstructed from 1 candidate report (September 2026). Candidates reported 1 follow-up. The write-up includes a Python solution that passes 5 test cases.

1 candidate-reported follow-up — the probes candidates report being asked, with the trigger for each
The full problem statement — full requirements, constraints, and edge cases
Approach and trade-offs — what passing candidates did, and the mistakes that sink people

Unlock the full Uber catalog

Full problem statements, candidate-reported follow-ups, and walkthroughs — for every Uber question.

Unlock with Pro

Already a member? Sign in

Verified Source

Every question is reconstructed from multiple independent candidate reports. Follow-ups candidates reported, not invented ones.

Codex Fact-Checked

Technical claims, formulas, and scale numbers are reviewed against primary sources.

Interviewer Follow-ups

The follow-ups candidates reported, with the trigger that prompts each one — plus the mistakes that sink people.