NAME : BHARANIDHARAN.

ROLE : SOFTWARE DEVELOPER

PACKAGE: 18 LPA

OFFER : INTERNSHIP CUM FULL TIME

LOCATION : BANGLORE

NO OF ROUNDS : 6

CONTACT :

https://www.linkedin.com/in/bharani-dharan-99b9361bb
6381108668

ROUNDS :

1st round:-
Quantitative aptitude questions, topics covered work and time ,percentage ,train and
distance, boat stream, Interests,Number series, Logical reasoning, Clock and calendar.

2nd round:-
2 programming questions(one medium one hard).

3rd round:-
1. Self introduction
2. Asked 3 quantitative aptitude from first round and coding question from second round.
4th round:-
1. Again asked coding question from second round but in constant time complexity.
2. Asked one puzzle https://www.geeksforgeeks.org/puzzle-bag-of-coins/
3. One coding question:
In a given intervals we have to check whether the intervals are overlapping or
not. Eg: (1,11),(5,12) is overlapping.
4. One dbms query:-
a. Table structure is (agent_id,parcel_id,time)
Time column contains dd/mm/yyyy hh:mm , one agent can deliver more
than one parcel on the same day.
We have to provide a month wise attendance sheet as the output.
Attendance will be considered only if an agent delivers at least one parcel.
5. Asked general question:
Consider a book my show scenario people can book seats whoever books first
will get the seat others should wait. She expected a queue as the answer.
 6. Asked what techstack i used in projects and little details about them.

5th round:-
1.again asked coding questions which were in 2nd round.
2.asked one puzzle:-
https://www.geeksforgeeks.org/puzzle-9-find-the-fastest-3-horses/
3.what is oops ,how it works, how it makes coding better.
4. Do we need two separate classes for rectangle and square. In which the class
contains only one member function which returns an area.
5.asked one graph question:-
N number of cities , they are connected via roads with distance of some kms and
it needs different amounts of fuel to travel from one city to another . input will be like
A->B 15km,2 litre (B->A also) likewise
Start and end city will be given. We have to return whether we can reach the end city, if
we can then return the minimum distance and the total fuel u have initially will also be
given. (UCS)
6th round:-
1.self intro
2.project and techstack explanation.
3.one coding question
https://www.hackerrank.com/challenges/minimum-average-waiting-time/problem
Every round went for approx 1 hr . 6th round - 2 hrs 40 mins.