Given `gas` and `cost` arrays, implement `canCompleteCircuit(gas, cost)` returning the starting index from which you can travel the full circle once, or `-1` if impossible. A unique answer exists when possible.
+ 1 hidden test run on Submit.
A single greedy pass identifies the unique start in O(n) time.
Run your code to see results.