...

/

Solution: Rearranging Fruits

Solution: Rearranging Fruits

Let’s solve the Rearranging Fruits problem using the Greedy Techniques pattern.

Statement

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

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

  1. Select two indexes, ii and jj, and swap the fruit at index ii in basket1 with the fruit at index jj ...

Access this course and 1400+ top-rated courses and projects.