Login to view details

Profile

Software Engineer

CTC/Stipend

Criteria

Session

2021-22

Status

Accepted Offer

Round 1

90 mins

Medium

July 30, 8 pm

This round had 3 coding questions.

I solved 2 completely and 1 partially.

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.

18 students were shortlisted for next round.

Round 2

60 mins

Medium

July 31, 12-1 pm

2 hackerrank coding questions for half hour each.

1) https://www.hackerrank.com/challenges/non-divisible-subset/problem

2) https://www.hackerrank.com/challenges/sherlock-and-valid-string/problem

Interviewer was recently graduated(2-3) years and very friendly.

8 students were shortlisted for next round.

Round 3

60 mins

Medium

July 31, 2.30-3.30 pm

Resume discussion for 15 minutes (Easy)

internship project, personal project discussion

1 leetcode coding question for 45 minutes.

https://leetcode.com/problems/divide-two-integers/

Interviewer was recently graduated(2-3) years and very friendly.

5 students were shortlisted for next round.

Round 4

60 mins

Difficult

July 31, 6-7 pm

only 1 question for 1 hour

question: Implement search bar functionality like google showing top 5 words as suggestions based on the frequency of search.

Solution was to be explained in shared google doc.

I used Trie data structure.

This round was to assess DS/ALGO knowledge.

Thorough questions about time/space complexity of given solution were asked.

Interviewer was experienced.

5 students were shortlisted for next round.

Round 5

15 mins

Easy

July 30, 8 pm

This round had 3 coding questions.

I solved 2 completely and 1 partially.

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.

18 students were shortlisted for next round.

Additional

Focus was on DS/ALGO.