Solution: Rearranging Fruits

Understand how to apply greedy techniques to minimize the cost of swapping fruits between two baskets so they become identical. Explore the use of frequency counts, sorting, and cost optimization to solve the problem efficiently with clear steps, and learn how to handle cases where matching the baskets is impossible.

We'll cover the following...

Statement
Solution
- Time complexity
- Space complexity

Statement

Given two 0-indexed integer arrays, basket1 and basket2, representing the cost of each fruit in the basket. Each basket contains $n$ fruits. Make the two baskets identical, i.e., both arrays should have the same costs.

To achieve this, perform the following operation as many times as necessary:

Select two indexes, $i$ and $j$ , and swap the fruit at index $i$ in basket1 with the fruit at index $j$ in basket2.
The cost of this swap is min(basket1[i], basket2[j]).

The two baskets are considered identical if, after sorting the fruits by cost, both baskets contain exactly the same costs.

Return the minimum cost required to make the baskets identical, or $-1$ ...