solulubeta
Sign in
NeetCode 150 / Greedy
15.06 · Problem

Merge Triplets to Form Target Triplet

Medium Greedy: keep only safe triplets 1 video LC 1899 Pro

This problem is part of solulu Pro

Merging two triplets takes the element-wise maximum: [a, b, c] and [x, y, z] become [max(a,x), max(b,y), max(c,z)]. Can you merge some of the given triplets (any number of times, in any combination) to obtain exactly…

Lifetime ₹1,999 ₹999 · Launch offer
Mark this problem as solved when you are finished.

Item 127 of 150 · updated 2026-10-12