Fruits Into Baskets II

Given arrays fruits and baskets of equal length, simulate placing each fruit type in order into the leftmost unused basket with capacity >= the fruit quantity (each basket holds at most one type) and return how many fruit types cannot be placed. The core challenge is a left-to-right greedy "first-fit" matching that counts unmatched items.