Login to view details

Profile

IT Services

CTC/Stipend

Criteria

Session

2021-22

Status

Accepted Offer

Round 1

90 mins

Medium

This round started with 3 coding questions out of which 2 are as as follow:

1)FC Codelona is trying to assemble a team from a roster of available players. They have a minimum number of players they want to sign and each player needs to have a skill rating within a certain range. Given a list of players skill levels with desired upper and lower bounds, determine how many teams can be created from the list.

Example

skills [12, 4, 6, 13, 5, 10]

minPlayers=3 minLevel 4

maxLevel = 10

• The list includes players with skill levels[12,4,6, 13. 5 ,10]

• They want to hire at least 3players with skill levels between 4 and 10 inclusive

•Four of the players with the following skill levels (4,6,5,10) meet the criteria

• There are 5 ways to form a team of 3 players, (4,5,6) (4,6 10) (4, 5,10) (5,6,10) and

(4,5,6.10)

• Return S

2) A taxi driver knows the pick-up and drop-off locations of people who are requesting anseraces the lications an in km from the starting point. The starting point is at 0 km For each km travelled by a passenger, the driver charges 1 unit of money per pastanger Morever the tas very fancy Therefore some people are even willing to play an extra tip if they get to travel in the tax at any point of time the taxi can only accommodate one passenger. Determine the maximum amount the driver can earn.

Example

pickup [0,2,9, 10, 11,12) drop [5.9,11,11,14 17] tip [1,2,3,2,2,1]

The way to earn the most money is by accepting passengers at edices 1, 2 and 5

The amount paid by the passenger at inder 1: 9-2+2=9

The amount paid by the passenges at inder 2: 11-9+3=5

The amount paid by the passenges at inder 5: 17-12+1=6

The total amount pad by the passengers is 9+5+6= 20

Therefore, the return value is 20

3)Eric is the most methodical employee at the Acme company. His manager assigned him a number of tasks for the quarter, and gave him a list of notes regarding the order they must be performed. Each note states that some task must be completed before some related task. If he goes to perform some task and sees that a rule exists requiring that this task be performed before an already completed task, then he cannot perform the task. Help Eric determine the maximum number of tasks he can complete.

For example, Eric has n=7tasks to complete. His manager gives him m-6 notes on the order tasks must be performed. Here is a graph of the dependencies.The dependent array, a = [1, 2, 3, 4, 6, 5]. His principal tasks array, b = [7, 6, 4, 1, 2, 1]. Here is a graph of the dependencies.

a= (1,2,3,4,6,5)

b= (7,6,4,1,2,1)

From the graph, it is easy to see that task 6 must be performed before task 2 and vice versa. He can only complete one of those two tasks before the other, so he must choose either task 6 or 2 .He can complete 7-1=6 task.

Round 2

60 mins

Medium

This round started with two coding questions on leet-code platform and I was expected to explain them the complete approach along with getting all TC's done. Luckily for one I was able to get to the best solution with all TC's done but for other there was some syntactic error due to which all TC's were not getting corrected. At last I explained him my complete approach and he himself was thinking it in that way only. So I was lucky enough to get through it.

Links for the questions are:

1)https://leetcode.com/problems/find-all-anagrams-in-a-string/

2)https://leetcode.com/problems/validate-binary-search-tree/submissions/

Round 3

60 mins

Difficult

This round started with he sharing me a google doc where I was expected to write DFA for a game called TIC TAC TOE. Interviewer was very helpful he guided me throughout and helped me with hints as an when I was going of the track. Another questions was that you have k sorted arrays of length n1,n2,n3.......nk and you have to merge them. I was expected to write a pseudo code for that and since I was aware about all such things hence I was able to tackle all his questions related to this. Also at last he asked me about time complexity of various logic or code which I presented to him for this second question. Finally he asked me to ask questions and the interview ended up.

Round 4

60 mins

Difficult

This round started with normal greeting and basic introduction and a discussion about how currently in online mode our exams are conducted. Later we asked me to open up a doc and start writing class definition for Chess Game. I was expected to write just how properly things will be stored and how/what all functions will be there no functionality for functions. Basically he was checking for my out of the box thinking skills and how good I am in system design.

Below mentioned link contains the answer to my problem:

https://www.geeksforgeeks.org/design-a-chess-game/

Round 5

15 mins

Easy

This round started with 3 coding questions out of which 2 are as as follow:

1)FC Codelona is trying to assemble a team from a roster of available players. They have a minimum number of players they want to sign and each player needs to have a skill rating within a certain range. Given a list of players skill levels with desired upper and lower bounds, determine how many teams can be created from the list.

Example

skills [12, 4, 6, 13, 5, 10]

minPlayers=3 minLevel 4

maxLevel = 10

• The list includes players with skill levels[12,4,6, 13. 5 ,10]

• They want to hire at least 3players with skill levels between 4 and 10 inclusive

•Four of the players with the following skill levels (4,6,5,10) meet the criteria

• There are 5 ways to form a team of 3 players, (4,5,6) (4,6 10) (4, 5,10) (5,6,10) and

(4,5,6.10)

• Return S

2) A taxi driver knows the pick-up and drop-off locations of people who are requesting anseraces the lications an in km from the starting point. The starting point is at 0 km For each km travelled by a passenger, the driver charges 1 unit of money per pastanger Morever the tas very fancy Therefore some people are even willing to play an extra tip if they get to travel in the tax at any point of time the taxi can only accommodate one passenger. Determine the maximum amount the driver can earn.

Example

pickup [0,2,9, 10, 11,12) drop [5.9,11,11,14 17] tip [1,2,3,2,2,1]

The way to earn the most money is by accepting passengers at edices 1, 2 and 5

The amount paid by the passenger at inder 1: 9-2+2=9

The amount paid by the passenges at inder 2: 11-9+3=5

The amount paid by the passenges at inder 5: 17-12+1=6

The total amount pad by the passengers is 9+5+6= 20

Therefore, the return value is 20

3)Eric is the most methodical employee at the Acme company. His manager assigned him a number of tasks for the quarter, and gave him a list of notes regarding the order they must be performed. Each note states that some task must be completed before some related task. If he goes to perform some task and sees that a rule exists requiring that this task be performed before an already completed task, then he cannot perform the task. Help Eric determine the maximum number of tasks he can complete.

For example, Eric has n=7tasks to complete. His manager gives him m-6 notes on the order tasks must be performed. Here is a graph of the dependencies.The dependent array, a = [1, 2, 3, 4, 6, 5]. His principal tasks array, b = [7, 6, 4, 1, 2, 1]. Here is a graph of the dependencies.

a= (1,2,3,4,6,5)

b= (7,6,4,1,2,1)

From the graph, it is easy to see that task 6 must be performed before task 2 and vice versa. He can only complete one of those two tasks before the other, so he must choose either task 6 or 2 .He can complete 7-1=6 task.