**3000 people appeared for the recruitment **
Round 1
The duration was 90 mins and 25 fill ups were given ( not MCQ's)
10 - C programming snippets (Predict the output)
15 - Quantitative and Logical Aptitudes.

Round 2 - Duration 2.30 hrs
Only 60 members were shortlisted
There were 5 programming questions we were allowed to use only C, C++ ,Java (No Python and JS were allowed to use)
The questions were evaluated one by one and we were not allowed to do in our own order.
Question 1
Design a M x N matrix and fill the matrix using Fibonacii sequence in spiral order
INPUT:
M=3,N=4
OUTPUT:
0 1 1 2
34 55 89 3
21 13 8 5

Different Hidden Test cases were given and tested
Question 2
Find the given 2 Strings are Anagram of each other

1. INPUT:
   tests
   esstt
   OUTPUT:
   true
   2)INPUT:
   skyblue
   kysllueb
   OUTPUT:
   false
   Question 3
   You are given a postive integer N and a 1-indiced Array intercity
   There are N number of cities from 1 to N having Bus Terminus in each cities
   You have intercity bus terminus in the cities which are in the array intercity.

Find the Maximum distance a person has to travel to other city without intercity terminus.

Input:
N=5
intercity={1,5}
Output:
2

Explanation:
The nearest intercity distance from City 1 is intercity 1. So distance is 0
The nearest intercity distance from City 2 is intercity 1. So distance is 1
The nearest intercity distance from City 3 is intercity 1 or intercity 5. So distance is 2
The nearest intercity distance from City 4 is intercity 5. So distance is 1
The nearest intercity distance from City 5 is intercity 5. So distance is 0.
Among these 5 values 2 holds the maximum distance. Hence 2 is output

Question 4
Map the Leadership according to Hierarchy
Indirect reports should come under hierarchy
(eg: If B is reporting to A and C is reporting to B then C is indirectly reporting to A)

1. Input:
   A->A
   B->A
   C->B
   D->B
   E->D
   F->E
   OUTPUT:
   A->BCDEF
   B->CDEF
   C->
   D->EF
   E->F
   F->
2. INPUT:
   A->B
   B->C
   C->D
   D->E
   E->F
   OUTPUT:
   A->
   B->A
   C->BA
   D->CBA
   E->DCBA
   F->EDCBA

Question 5
Find the index of the Largest sub array which has equal amount of 0's and 1's and if there is no such array return -1
Input format: The size of input array,array elements
1)Input:
6
0 1 1 0 1 0
Output:
0 to 5
2)INPUT:
7
0 0 1 0 1 0 1
OUTPUT:
1 to 6
3) INPUT:
3
1 1 1
OUTPUT:
-1
I used Kadane's algorithm to solve this!
Round 3 Duration 1.30 hrs
Only 9 were shortlisted!!
Advanced Coding Round
We were asked to design a Call Taxi Application using Object Oriented Programming approach using Data Structures.
Question
You are a developer at a company that is planning to provide doorstep drop for the employees after work.Write a program for this bearing in the mind following:

1. You can assume the home addresses of the employees as A,B,C,D etc. The office location can be stored as X. You are free to use any distance to each of these locations from office.
2. Assume there are sufficient cabs to service all the employees at any given time.
3. Cabs can be of different types (normal,AC,luxury) and they are allocated based on the designation of the employees. Their charges also vary depending on the type of cab.
   4)Your software should be able to generate reports for any time period (total cost per month, total cost per employee, total cost for a given employee in a given period, trips done by a given employee etc...)

Many additional constraints were also given such as locations when we solved the problem.

Round 4 - Technical Interview- Duration 45 mins
Only 4 were shortlisted
2 puzzles were given to test our logical thinking
Questions from my resume were asked and some questions from round 2 were asked to explained to see our approach of solving
And a small program was asked to to be hand written

I was unfortunate got rejected in this round 💔!!!!!
2 candidates were selected and proceeded with HR interview

But it's okay I consoled myself that I made the top 4 out of 3000 members :)