# HackerRank Kindergarten Adventures problem solution

In this Hackerrank Kindergarten Adventures problem, we have given an array that represents the time that each student needs to complete the drawing. so we need to find the index point where we can start collecting the drawing so a maximum number of students can complete the drawing.

## Problem solution in Python programming.

```n = int(input().strip())
a = list(map(int, input().strip().split()))
b = [0 for i in range(n)]
for i in range(n):
v = a[i]
if 0 == v or v >= n - 1:
continue
i1 = i - v + 1
i2 = i + 1
if i1 < 0:
i1 += n
if i2 >= n:
i2 -= n;
b[i1] -= 1
b[i2] += 1
result, mv, tmp = 0, 0, 0
for i in range(n):
tmp += b[i]
if 0 == i or tmp > mv:
result = i
mv = tmp
#print(b)
print(result + 1)```

## Problem solution in Java Programming.

```import java.io.*;
import java.util.*;

public class Solution {

public static void main(String[] args) {
/* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
Scanner in = new Scanner(System.in);
int n = in.nextInt();
List<Integer> start = new ArrayList<Integer>();
List<Integer> end = new ArrayList<Integer>();
for(int i = 0; i < n; i++){
int drawTime = in.nextInt();
if(drawTime != 0 && drawTime != n){
int s = i + 1;
int e = i + n - drawTime;
if(s == n){
}else if (e >= n){
}else{
}
}
}
Collections.sort(start);
Collections.sort(end);
int maxIndex = 0;
int maxValue = 0;
int currValue = 0;
int sp = 0;
int ep = 0;
while(sp < start.size()){
int sv = start.get(sp);
int ev = end.get(ep);
if(sv <= ev){
currValue++;
if(currValue > maxValue){
maxValue = currValue;
maxIndex = sv;
}
sp++;
}else {
currValue--;
ep++;
}
}
System.out.println(maxIndex+1);
}
}```

## Problem solution in C++ programming.

```#include <bits/stdc++.h>
using namespace std;

int main() {
int N;
cin >> N;
vector<int> A(N);
for(int i = 0; i < N; i++) {
cin >> A[i];
}

int start = 0;

vector<int> D(N+1, 0);
for(int i = 0; i < N; i++) {
if(A[i] <= i) {
start++;
D[i-A[i]]--;
D[i]++;
} else {
D[i-A[i]+N]--;
D[i]++;
}
}

int best = start;
int bi = 0;
int cur = start;
for(int i = 0; i < N; i++) {
if(cur > best) {
best = cur;
bi = i;
}
cur += D[i];
}

cout << (bi+1) << endl;
}```

## Problem solution in C programming.

```#include <assert.h>
#include <limits.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int main() {
int n;
scanf("%d", &n);
int * arr = malloc(sizeof(int) * n);
memset(arr, 0, sizeof(int) * n);
for (int i = 0; i < n; i++) {
int t;
scanf("%d", &t);
if (0 < t && t < n) {
arr[(i + 1) % n]++;
arr[(i - (t - 1) + n) % n]--;
}
}
int runningSum = arr[0];
int maxRunningSum = runningSum;
int index = 0;
for (int i = 1; i < n; i++) {
runningSum += arr[i];
if (runningSum > maxRunningSum) {
maxRunningSum = runningSum;
index = i;
}
}
free(arr);
printf("%d\n", index + 1);

return 0;
}
```

## Problem solution in JavaScript programming.

```'use strict';

const fs = require('fs');

process.stdin.resume();
process.stdin.setEncoding('utf-8');

let inputString = '';
let currentLine = 0;

process.stdin.on('data', inputStdin => {
inputString += inputStdin;
});

process.stdin.on('end', _ => {
inputString = inputString.trim().split('\n').map(str => str.trim());

main();
});

return inputString[currentLine++];
}

/*
* Complete the solve function below.
*/

function solve(t) {
let n = t.length;
let diffArr = [];
for (let i = 0; i < t.length; i++) {
if (t[i] >= n || t[i] === 0) continue;
// add one to next index
let addToIndex = (i + 1) % n;
// subtract one from ending index
let endIndex = i - t[i] + 1;
if (endIndex < 0) endIndex += n;
diffArr[endIndex] = ~~diffArr[endIndex] - 1;
}

let maxIndex = 0;
let currentMax = Number.MIN_SAFE_INTEGER;
let sum = 0;
for (let i = 0; i < diffArr.length; i++) {
sum += ~~diffArr[i];
if (sum > currentMax) {
maxIndex = i;
currentMax = sum;
}
}
return maxIndex + 1;
}

function main() {
const ws = fs.createWriteStream(process.env.OUTPUT_PATH);

const t = readLine().split(' ').map(tTemp => parseInt(tTemp, 10));

let id = solve(t);

ws.write(id + "\n");

ws.end();
}```