https://dmytros.blog/tags/greedy/ Recent content in Greedy on Dmytro's Blog https://dmytros.blog/images/papermod-cover.png https://dmytros.blog/images/papermod-cover.png Hugo en Sun, 26 Apr 2026 08:45:38 +0300 https://dmytros.blog/posts/leetcode-150-jump-game-ii/ Sun, 26 Apr 2026 08:45:38 +0300 https://dmytros.blog/posts/leetcode-150-jump-game-ii/ <h3 id="the-problem">The problem</h3> <p>You are given a <strong>0-indexed</strong> array of integers <code>nums</code> of length <code>n</code>. You are initially positioned at index 0.</p> <p>Each element <code>nums[i]</code> represents the maximum length of a forward jump from index <code>i</code>. In other words, if you are at index <code>i</code>, you can jump to any index <code>(i + j)</code> where:</p> <ul> <li><code>0 &lt;= j &lt;= nums[i]</code> and</li> <li><code>i + j &lt; n</code></li> </ul> <p>Return <em>the minimum number of jumps to reach index</em> <code>n - 1</code>. The test cases are generated such that you can reach index <code>n - 1</code>.</p>