Search⌘ K
AI Features

Solution: Rearranging Fruits

Solution: Rearranging Fruits asks you to make two baskets' sorted contents identical by swapping fruits across them, where each swap costs the cheaper fruit. Return minimum cost or report impossible.

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 costs.

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 ...