- Related Questions & Answers
- Distribute Candies in C++
- Find the minimum and maximum amount to buy all N candies in Python
- Distribute Coins in Binary Tree in C++
- Boats to Save People in C++
- Maximum Candies You Can Get from Boxes in C++
- Maximum number of candies that can be bought in C
- Minimum number of mails required to distribute all the questions using C++.
- Distribute extra horizontal and vertical space in a GridBagLayout with Java
- Why people prefer smartphones to laptops nowadays?
- Best ways to discover people to talk on twitter
- How can you make people listen to you?
- Why do people get angry frequently?
- Why do many people like to dance a lot?
- Why are people interested in rumors and gossips?
- Why do people donate for social causes?

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

Suppose we want to distribute some number of candies to a row of n people in the following way −

- We then give 1 candy to the first people, 2 candies to the second people, and so on until we give n candies to the last people.
- After that, we go back to the start of the row again, give n + 1 candies to the first people, n + 2 candies to the second people, and so on until we give 2 * n candies to the last people.

We will repeat this process until we run out of candies. The last people will get all of our remaining candies (not necessarily one more than the previous gift).

We have to return an array that represents the final distribution of candies. So suppose candies are 7, and n = 3, then the output will be [2, 2, 3]. So at first the first person will get 1. the array is [1, 0, 0], second one has got 2, then array is [1, 2, 0], third one has got 3, then array is [1, 2, 3], and finally first one again got 1, so array is [2, 2, 3]

To solve this, we will follow these steps −

- res is an array of n elements, and fill with 0
- index := 0
- while candies > 0
- res[index mod n] := res[index mod n] + min of candies and index + 1
- candies := candies – 1
- index := index + 1

- return res

Let us see the following implementation to get better understanding −

class Solution(object): def distributeCandies(self, candies, num_people): res = [0 for i in range(num_people)] index = 0 while candies>0: res[index%num_people] += min(candies,index+1) candies-=(index+1) index+=1 return res ob1 = Solution() print(ob1.distributeCandies(8, 3))

8 3

[3, 2, 3]

Advertisements