https://dmytros.blog/tags/merge-triplets-to-form-target-triplet/ Recent content in Merge Triplets to Form Target Triplet on Dmytro's Blog https://dmytros.blog/images/papermod-cover.png https://dmytros.blog/images/papermod-cover.png Hugo en Wed, 13 May 2026 07:40:07 +0300 https://dmytros.blog/posts/leetcode-150-merge-triplets-to-form-target-triplet/ Wed, 13 May 2026 07:40:07 +0300 https://dmytros.blog/posts/leetcode-150-merge-triplets-to-form-target-triplet/ <h3 id="the-problem">The problem</h3> <p>A <strong>triplet</strong> is an array of three integers. You are given a 2D integer array <code>triplets</code>, where <code>triplets[i] = [ai, bi, ci]</code> describes the <code>i-th</code> <strong>triplet</strong>. You are also given an integer array <code>target = [x, y, z]</code> that describes the <strong>triplet</strong> you want to obtain.</p> <p>To obtain <code>target</code>, you may apply the following operation on <code>triplets</code> <strong>any number</strong> of times (possibly <strong>zero</strong>):</p> <ul> <li> <p>Choose two indices (<strong>0-indexed</strong>) <code>i</code> and <code>j</code> (<code>i != j</code>) and <strong>update</strong> <code>triplets[j]</code> to become <code>[max(ai, aj), max(bi, bj), max(ci, cj)]</code>.</p>