Education : BTech in IT from tier-3 college
Current Company : Top MNC in Bangalore
Experience : 2.4 years

1. 1st Round, HackerEarth Hiring Challenge (90 mins):

    * There is a function F(l,r) which is 0 if And(l,r) < k else it is Or(l,r) + Sum(l,r). Find the maximum value of this function F over an interval in a given array. And, Or, Sum are standard operations over a given range in array. Also are given T test cases.
    
    * Assume there is a 3-D array with dimensions N*N*N where A[i][j][k] = i*k*(i+j+k). Lets say Sum(A) is sum of all elements in this 3-D array. Now you are given an integer S. Find a dimension N such that Sum(A) for that N is just smaller than S. Given T test cases where T < 1000000.

2. 2nd Round, Peer to Peer Hackathon (180 mins):

   Given an array of integers denoting duration of each task and an integer m denoting number of technicians to do these tasks.
   a) Find the earliest time by which all tasks can be done.
   b) Minimum number of additional technicians required if 1 technician can only do atmost 8 hours of task.
   c) In a) above, find the number of different optimal solutions possible where a solution is unique if its combination of tasks is unique.

3. 3rd Round, Technical Interview (60 mins):
   * Code Paint's Auto-fill color function. Interviewer pushed for extensive optimizations.

4. 4th Round, Design and HM (60 mins):
   * Design BookMyShow.
   * Behavioural Questions

Compensation Link