Section 1Understand Problem
Section 01
Understand the problem
Restate the problem precisely. Interviewers reward candidates who pause, define the contract, and name the guarantees before coding.
Problem statement
There are `n` cities connected by some number of flights. You are given an array `flights` where `flights[i] = [fromᵢ, toᵢ, priceᵢ]`. You are also given three integers `src`, `dst`, and `k`, return the *cheapest price* from `src` to `dst` with at most `k` stops. If there is no such route, return `-1`.
Example
n=4, flights=[[0,1,100],[1,2,100],[2,0,100],[1,3,600],[2,3,200]], src=0, dst=3, k=1 → 700
Constraints
1 ≤ n ≤ 100 · 0 ≤ flights.length ≤ (n · (n − 1) / 2) · 0 ≤ k ≤ n − 1
Audio recording unsupported on this browser.
WPM—Fillers0Pace—Thinking0%
Explain the problem in your own words
0 words0 chars
AI Review
Write your thinking above first.
Once you've drafted a response, click Submit for AI review and a senior engineer will critique your reasoning.
Ready to submit Section 1?
The reviewer will check whether you stated inputs, output, guarantees, and any assumption you flagged.
Write at least a couple of sentences explaining the problem before submitting.