Fair Candy Swap Problem

Fair Candy Swap Problem — ExecCode Easy DSA Practice

Solve the Fair Candy Swap problem on ExecCode. Free online easy DSA practice in Arrays - Logic Building. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given two integer arrays aliceSizes and bobSizes where aliceSizes[i] is the number of candies of the i^th box of candy that Alice has and bobSizes[j] is the number of candies of the j^th box of candy that Bob has. Your task is to compute the required answer and return a n integer array answer where answer[0] is the number of candies in the box that Alice must exchange, and answer[1] is the number of candies in the box that Bob must exchange. Alice and Bob have a different total number of candies. Since they are friends, they would like to exchange one candy box each so that after the exchange, they both have the same total amount of candy. The total amount of candy a person has is the sum of the number of candies in each box they have. If there are multiple answers, you may return any one of them.

Examples

Input {"aliceSizes": [1, 1], "bobSizes": [2, 2]}; Output [1, 2]. Input {"aliceSizes": [1, 2], "bobSizes": [2, 3]}; Output [1, 2]

Constraints

1 <= aliceSizes.length, bobSizes.length <= 10^4 1 <= aliceSizes[i], bobSizes[j] <= 10^5 Alice and Bob have a different total number of candies. There will be at least one valid answer for the given input.

Practice Fair Candy Swap free on ExecCode. Browse DSA problems, topic map, and placement guides.