https://dmytros.blog/tags/gas-station/ Recent content in Gas Station on Dmytro's Blog https://dmytros.blog/images/papermod-cover.png https://dmytros.blog/images/papermod-cover.png Hugo en Sat, 02 May 2026 10:02:45 +0300 https://dmytros.blog/posts/leetcode-150-gas-station/ Sat, 02 May 2026 10:02:45 +0300 https://dmytros.blog/posts/leetcode-150-gas-station/ <h3 id="the-problem">The problem</h3> <p>There are <code>n</code> gas stations along a circular route, where the amount of gas at the <code>ith</code> station is <code>gas[i]</code>.</p> <p>You have a car with an unlimited gas tank and it costs <code>cost[i]</code> of gas to travel from the <code>ith</code> station to its next <code>(i + 1)th</code> station. You begin the journey with an empty tank at one of the gas stations.</p> <p>Given two integer arrays <code>gas</code> and <code>cost</code>, return <em>the starting gas station&rsquo;s index if you can travel around the circuit once in the clockwise direction, otherwise return</em> <code>-1</code>. If there exists a solution, it is <strong>guaranteed</strong> to be <strong>unique</strong>.</p>