# Daily Coding Challenge #99

This is a series of Daily Coding Challenge. Each day I show a few solutions written in C++. The questions are from coding practice/contest sites such as HackerRank, LeetCode, Codeforces, Atcoder and etc.

/*
LeetCode - Distribute Candies to People

We distribute some number of candies, to a row of n = num_people people in the following way:

We then give 1 candy to the first person, 2 candies to the second person, and so on until we give n candies to the last person.

Then, we go back to the start of the row, giving n + 1 candies to the first person, n + 2 candies to the second person, and so on until we give 2 * n candies to the last person.

This process repeats (with us giving one more candy each time, and moving to the start of the row after we reach the end) until we run out of candies.  The last person will receive all of our remaining candies (not necessarily one more than the previous gift).

Return an array (of length num_people and sum candies) that represents the final distribution of candies.

Example 1:

Input: candies = 7, num_people = 4
Output: [1,2,3,1]
Explanation:
On the first turn, ans[0] += 1, and the array is [1,0,0,0].
On the second turn, ans[1] += 2, and the array is [1,2,0,0].
On the third turn, ans[2] += 3, and the array is [1,2,3,0].
On the fourth turn, ans[3] += 1 (because there is only one candy left), and the final array is [1,2,3,1].
Example 2:

Input: candies = 10, num_people = 3
Output: [5,2,3]
Explanation:
On the first turn, ans[0] += 1, and the array is [1,0,0].
On the second turn, ans[1] += 2, and the array is [1,2,0].
On the third turn, ans[2] += 3, and the array is [1,2,3].
On the fourth turn, ans[0] += 4, and the final array is [5,2,3].

Constraints:

1 <= candies <= 10^9
1 <= num_people <= 1000
*/

class Solution {
public:
vector<int> distributeCandies(int candies, int num_people) {
vector<int> ans(num_people,0);
for(int i=0;candies>0;candies-=++i){
ans[i%num_people]+=min(candies,i+1);
}
return ans;
}
};

class Solution2 {
public:
vector<int> distributeCandies(int candies, int num_people) {
vector<int> ans(num_people,0);
queue<int> q;
for(int i=0;i<num_people;i++) q.push(i);
int give=1, gave=0;
while(!q.empty()||candies<1){
int p = q.front();
q.pop();
if(give>candies){
if(candies>0) ans[p]+=candies;
break;
}
ans[p]+=give;
gave+=give, candies-=give;
give++;
q.push(p);
}
return ans;
}
};


/*
LeetCode - Numbers With Same Consecutive Differences

Return all non-negative integers of length N such that the absolute difference between every two consecutive digits is K.

Note that every number in the answer must not have leading zeros except for the number 0 itself. For example, 01 has one leading zero and is invalid, but 0 is valid.

You may return the answer in any order.

Example 1:

Input: N = 3, K = 7
Output: [181,292,707,818,929]
Explanation: Note that 070 is not a valid number, because it has leading zeroes.
Example 2:

Input: N = 2, K = 1
Output: [10,12,21,23,32,34,43,45,54,56,65,67,76,78,87,89,98]

Note:

1 <= N <= 9
0 <= K <= 9
*/

class Solution {
public:
vector<int> numsSameConsecDiff(int N, int K) {
if(N == 1) return {0,1,2,3,4,5,6,7,8,9};
// bfs approach
deque<int> q{1,2,3,4,5,6,7,8,9};
while(--N>0){
for(int i=q.size();i>0;i--){
int n = q.front();
q.pop_front();
for(int j=0;j<10;j++){
if(abs((n%10)-j)==K){
q.push_back(n*10+j);
}
}
}
}
return vector<int>{q.begin(),q.end()};
}
};


There are other programming solutions in the following repositories below. Star and watch for timely updates!

## wingkwong / timus

Posted on by:

### Wing-Kam

Consultant by day. Developer by night. AWS certified. Exploring #CloudNative currently.