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.

Description Alice and Bob have a different total number of candies. 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 tha…

Practice Fair Candy Swap free on ExecCode. Browse more ExecCode DSA problems.