DSA(sequence of widgets)

We are given a sequence of widgets, each with a fixed width. We need to simulate placing them into rows of total width 4. We fill each row sequentially and once it reaches exactly 4, we move to the next row. If any row exceeds 4 or ends below 4, the layout is invalid. So the problem reduces to checking if we can partition the array into groups that sum to exactly 4.