Leetcode Problem 2929. Distribute Candies Among Children II

Core Logic Steps

1. Initialize count to 0, which will hold the total number of distributions.
2. Iterate over the number of candies a given to the first child, starting from max(0, n - 2 * limit) to min(limit, n).
3. For each a, calculate the range for the second child b:
   • The minimum candies for b is max(0, n - a - limit).
   • The maximum candies for b is min(limit, n - a).
4. Calculate the number of ways b can be chosen within the range and add it to count.
5. Return count as the total number of distributions.