https://shio-chan-dev.github.io/jeanblog/tags/leetcode-74/Recent content in LeetCode 74 on Jeanphilo BlogHugo -- 0.165.0en-usThu, 13 Aug 2026 00:00:00 +0000https://shio-chan-dev.github.io/jeanblog/alg/leetcode/binary-search/74-search-a-2d-matrix/Thu, 13 Aug 2026 00:00:00 +0000https://shio-chan-dev.github.io/jeanblog/alg/leetcode/binary-search/74-search-a-2d-matrix/<p>You are given an <code>m x n</code> integer matrix <code>matrix</code> and an integer <code>target</code>. Return <code>True</code> if <code>target</code> is in the matrix; otherwise, return <code>False</code>.</p> <p>The matrix satisfies two conditions:</p> <ul> <li>Every row is sorted in non-decreasing order.</li> <li>The first integer of each row is strictly greater than the last integer of the previous row.</li> </ul> <p>The required time complexity is <code>O(log(m * n))</code>.</p> <p>For example, consider this matrix:</p> <div class="highlight"><pre tabindex="0" style="color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;-webkit-text-size-adjust:none;"><code class="language-text" data-lang="text"><span style="display:flex;"><span>1 3 5 7 </span></span><span style="display:flex;"><span>10 11 16 20 </span></span><span style="display:flex;"><span>23 30 34 60 </span></span></code></pre></div><ul> <li>When <code>target = 3</code>, return <code>True</code>.</li> <li>When <code>target = 13</code>, return <code>False</code>.</li> </ul> <p>The constraints are:</p>