1. Array Burst Problem

Given an input length, String array and burst length(>0) as input, the output should be an array which is a shrunk input array such that the sequentially repeating elements more than or equal to burst length should be removed. This has to be repeated till the array cannot be shrunk any further. Use single characters in the string array for simplicity as shown in sample test cases.

Sample case 1 :
Input :
8
a
b
c
c
c
d
e
e
3
Output:
a
b
d
e
e

2. Birthday Party and Return Gift

A birthday party was attended by N number of kids and each kid was given an unique id ranging from 1 to N. As a return gift, there are T toys that must be given to the kids.

The party host decides the best way to do this is by sitting the kids down in a circle ordered by ascending id and then starting with a random number D (between 1 and N) and distribute one toy at a time to each sequentially numbered kid and till all toys are distributed.

For example if the host picks a random number (D), 2, then gift distribution order would be (2,3,4,5,.., N-1,N, 1,2,3,4..) untill all T toys are distributed. But the very last toy is damaged. The task is to find and display the id number of the last kid, who will recieve the damaged toy, so that the kid can be informed about the same and the host will ask him to go and exchange from the shop.
Input :
N - The number of kids
T - The number of toys
D - Random number from where distribution should start

Output :
For each test case print the id number of the kid who receives the damaged toy.

Sample Input :
5
2
1

Sample Output:
2

Comments (24)