https://dmytros.blog/tags/minimum-interval-to-include-each-query/ Recent content in Minimum Interval to Include Each Query on Dmytro's Blog https://dmytros.blog/images/papermod-cover.png https://dmytros.blog/images/papermod-cover.png Hugo en Thu, 04 Jun 2026 09:37:51 +0300 https://dmytros.blog/posts/leetcode-150-minimum-interval-to-include-each-query/ Thu, 04 Jun 2026 09:37:51 +0300 https://dmytros.blog/posts/leetcode-150-minimum-interval-to-include-each-query/ <h3 id="the-problem">The problem</h3> <p>You are given a 2D integer array <code>intervals</code>, where <code>intervals[i] = [lefti, righti]</code> describes the <code>ith</code> interval starting at <code>lefti</code> and ending at <code>righti</code> <strong>(inclusive)</strong>. The <strong>size</strong> of an interval is defined as the number of integers it contains, or more formally <code>righti - lefti + 1</code>.</p> <p>You are also given an integer array <code>queries</code>. The answer to the <code>jth</code> query is the <strong>size of the smallest interval</strong> <code>i</code> such that <code>lefti &lt;= queries[j] &lt;= righti</code>. If no such interval exists, the answer is <code>-1</code>.</p>