Gas station
There are n gas stations in a circle; gas[i] is fuel available and cost[i] is fuel to reach the next station. Return the start index to complete one loop, or -1.
Implement
can_complete_circuit(gas: list[int], cost: list[int]) → intExamples
in
[[1,2,3,4,5],[3,4,5,1,2]]out3What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[[1,2,3,4,5],[3,4,5,1,2]]3not run yetsample