You are given a $2 ext{D}$ integer array triplets, where triplets[i] $= [a_i, b_i, c_i]$ describes the $i^{ ext{th}}$ triplet, and an integer array target $= [x, y, z]$ representing the desired target triplet.

You can perform the following operation any number of times:

• Select two distinct indices i and j ($0 \leq i, j <$ triplets.length) and update triplets[j] to become $[\max(a_i, a_j), \max(b_i, b_j), \max(c_i, c_j)]$.

Return true if it is possible to make target an element of triplets, or false otherwise.

Constraints:

• $1 \leq$ triplets.length $\leq 10^5$

• triplets[i].length $==$ target.length $== 3$

• $1 \leq a_i, b_i, c_i, x, y, z \leq 1000$

Input: triplets = [[4, 6, 2], [3, 5, 7]]-List[List[int]], target = [4, 6, 2]-List[int]
Output: true-bool
Explanation: The target triplet [4, 6, 2] is already an element of triplets, so it is possible to form the target.

Input: triplets = [[2, 9, 4], [5, 3, 6], [1, 7, 8]]-List[List[int]], target = [5, 7, 6]-List[int]
Output: false-bool
Explanation: The first triplet exceeds the target in its second value, and the third exceeds it in its third value. The remaining triplet cannot provide the required second value of 7, so the target cannot be formed.

Input: triplets = [[3, 2, 8], [6, 4, 1], [2, 5, 7]]-List[List[int]], target = [6, 5, 8]-List[int]
Output: true-bool
Explanation: Merging the triplets coordinate-wise with maximum values can produce [6, 5, 8], which matches the target.

Input: triplets = [[9, 4, 2]]-List[List[int]], target = [9, 4, 3]-List[int]
Output: false-bool
Explanation: The only triplet has a third value of 2, so it cannot be increased to the target’s third value of 3.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.