Solution: Rearranging Fruits

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:

1. Select two indexes, $i$ and $j$, and swap the fruit at index $i$ in basket1 with the fruit at index $j$ ...