Online Test (90 minutes):
● The test consists of 6 coding questions and 5 MCQs based on DS/Algo.
● Coding Questions
- The janitor of a high school is extremely efficient. By the end of each day, all of the school’s waste is in plastic bags weighing between 1.01 pounds and 3.00 pounds. All plastic bags are then taken to the trash bins outside. One trip is described as selecting a number of bags which together do not weigh more than 3.00 pounds, dumping them in the outside trash can and returning to the school. Given the number of plastic bags n, and the weights of each bag, determine the minimum number of trips the janitor has to make.
Example
● n = 5
● weight = [1.01,1.99, 2.5, 1.5, 1.01]
● The janitor can carry all plastic bags out in 3 trips :
● [1.01 + 1.99, 2.5, 1.5 + 1.01].
- For a given array of integers, determine the maximum value in the segment from each index to the highest index element, inclusive. After that has been determined, determine the number of times that highest value occurs in the segment. A number of queries will then be given, where each query represents an index within the array. Create a return array with one value for each query : the number of times the maximum value occurs in a segment starting at that index.
- You have just arrived in a new city and would love to see its sights. Each sight is located in a square and you have assigned each a beauty value. Each road to a square takes an amount of time to travel and you have limited time for sightseeing. Determine the maximum value of beauty that you can visit during your time in the city. Start and finish at your hotel, the location of sight zero.
Example
● n = 4
● m = 3
● max_t = 30
● beauty = [5, 10, 15, 20]
● u = [0, 1, 0]
● v = [1, 2, 3]
● t = [6, 7, 10]
● n = 4 squares are chosen in the map, including the hotel at square 0.
● m = 3 bidirectional roads that connect them.
● Edges are between squares u[i] and v[i], and t[i] is the time to travel edge i
● beauty array represents the beauty values for squares 0, 1, 2 and 3 respectively.
- An automated packaging system is responsible for packing boxes. A box is certified to hold a certain weight. Given an integer total, calculate the number of possible ways to achieve total as sum of the weights of items weighing integer weights from 1 to k inclusive.
Example
● total = 8
● k = 2
● Output = 5
- A taxi driver knows the pickup and drop locations of people who are requesting taxi services. All the locations are in km from the starting point. The starting point is at 0 km. For each km travelled by passenger, the driver charges 1 unit of money per passenger. Moreover, the taxi itself is very fancy. Therefore, some people are even willing to pay an extra tip if they get to travel in the taxi. 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 indices 1, 2 and 5.
● The amount paid by the passenger at index 1 : 9-2+2 = 9
● The amount paid by the passenger at index 2 : 11-9+3 = 5
● The amount paid by the passenger at index 5 : 17-12+1 = 6
● The total amount paid by the passenger is 9+5+6 = 20.
- This i don’t remember exactly but based on string, prefix-suffix type.
Platform : HackerRank
I solved 4 coding questions completely and for
one 8/12 Test Cases passed.
12 students were shortlisted for the interviews.
Interviews:
Round 1 : Technical (60 minutes):
● Held on HackerRank CodePair.
● Started with a formal introduction.
● Then she moved on to coding questions.
○ I first gave the O(n+m) space complexity solution. But she asked me to give O(n) or O(m) space complexity solution. Then, i gave the O(n) space solution.
○ I have to write a code for it. Then she gave some test cases which my solution was able to pass.
○ Next question was based on multi-source bfs. I have to discuss the approach, time and space complexity of the solution first and then move on to write a code for the same.
8 students were shortlisted for next round.
Round 2 : Technical (60 minutes):
● Held on HackerRank CodePair.
● Started with a formal introduction.
● Then he moved on to coding questions.
● The theme for this round was also the same. First approach, then discussion on time and space complexity and then working code.
● Questions were:
○ Similar to this https://www.spoj.com/problems/AGGRCOW/ . (Binary Search on Answer)
6 students were shortlisted for next round.
Round 3 : Hiring Manager (60-80 minutes):
● Held on Google Meet.
● Started with a formal introduction.
● Then he asked me about the things written in my resume.
● Had a discussion on my projects and internship.
● Questions on the project were mostly based on the technical challenges faced and how you solved them, what problem you have tried to solve by making this project. What was the team size in which you worked. Why you used that particular thing to implement apart from others.
● He asked me the subjects I am comfortable with apart from DS/Algo. I said OS, DBMS and OOPs.
● He asked about DBMS.
● Questions were on NoSql Database.
● What is Scalability?
● How NoSql databases help in achieving scalability.
● Difference between RDBMS and NoSql databases.
● Then some behavioral and conditional questions like what are my strength/weakness. What will you do if you are stuck in a particular situation etc….
● Why didn’t you get a PPO from Microsoft (Internship).
5 students were shortlisted for next round.
Round 4 : HR (30 minutes):
● Held on Google Meet.
● Started with formal introduction.
● Then discussion on my hobbies.
● What you have learnt from your internship at Microsoft?
● Then some 2-3 conditional questions
● Why do you want to join Myntra??
Verdict: Finally 4 students were selected for the full time role at Myntra and I was one of them.
All the best!
- Nikhil Sethi
- CSE 2k21
Comments
Post a Comment