Associate Developer Intern

A train follows a route in which it visits ‘N’ stations, and the train keeps moving back and forth on the track. The train moves from station 1 to station ‘N’, from ‘N’ to 1, and again from 1 to ‘N’. It moves on forever like this.

Train stops exactly ‘V[i]’ minutes on the ‘ith’ platform. ‘V’ is an array of ‘N’ length. The train moves very fast, so it takes no time to travel from one station to another.

You are given ‘Q’ queries in the array ‘query’. For the ‘ith’ query, you need to find the station on which the train is standing on ‘query[i]ith’ minute. The train starts its journey in the 0th minute.

Your task is to find the station where the train is present after each query.

Example :

‘N’ = 4, ‘V’ = [4,3,1,2], ‘Q’ = 3, ‘query’ = [5, 12, 3].
Train visits the station in the following manner:
For the period [0, 3], the train will be at station 1. (0th, 1st, 2nd, and 3rd) for 4 minutes on station 1.
For the period [4, 6], the train will be at station 2. 
For the period [7, 7], the train will be at station 3.
For the period [8, 9], the train will be at station 4. 
For the period [10, 11], the train will be at station 4.
For the period [12, 12], the train will be at station 3.

First Query: In the 5th minute, the train will be at station number 2. Hence, 2 will be the answer.
Second query: In the 12th minute, the train will be at station number 3. Hence, 3 will be the answer.
Third Query: In the 3rd minute, the train will be at station number 1. Hence, 1 will be the answer.
The final output will be: [2, 3, 1]

You have been given an integer array/list(ARR) of size N that contains only integers, 0 and 1. Write a function to sort this array/list. Think of a solution which scans the array/list only once and don't require use of an extra array/list.

Note:

You need to change in the given array/list itself. Hence, no need to return or print anything. 

• Tell me about yourself
• Why do you want to join HCL Technologies?
• Where do you see yourself in 5 years?