Leetcode Problem 888. Fair Candy Swap

888. Fair Candy Swap

Leetcode Solutions

Solve the Equation Approach

  1. Calculate the sum of candies for Alice (SA) and Bob (SB).
  2. Compute the difference d = (SB - SA) / 2.
  3. Create a set setB containing all of Bob's candy sizes for constant time look-up.
  4. Iterate through each candy size x in Alice's array. a. Calculate the required candy size y that Alice needs to receive using the equation y = x + d. b. Check if y is in setB. c. If y is found, return the pair [x, y] as the answer.
  5. Since the problem guarantees at least one valid answer, the loop will always return a result before completion.
UML Thumbnail

Brute Force Approach

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...