Candy Distribution Coding Challenge | Dataford Interview Questions

Write a code so that 1 candy is given to the 1st boy, then 2 candies to the 2nd boy, 3 candies to the 3rd boy, and so on up to K candies, then return to the 1st boy and continue with (N+1) candies until you finish; for example, K=7 and N=3 should output (1,2,3,1). Treat K as the total number of candies and N as the number of boys. Return the 1-based boy numbers receiving each allocation, including the final partial allocation when fewer candies remain.

Constraints

1 <= k <= 10^9
1 <= n <= 10^5
Return one 1-based recipient number for every allocation.
The final allocation may contain fewer candies than its requested amount.

Function Signature

def distribute_candies(k, n):

Your question is Candy Distribution Coding Challenge. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Constraints

1 <= k <= 10^9
1 <= n <= 10^5
Return one 1-based recipient number for every allocation.
The final allocation may contain fewer candies than its requested amount.

Function Signature

def distribute_candies(k, n):

Your question is Candy Distribution Coding Challenge. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.