Online Round (50 + 90 mins)
2 Separate online rounds were hosted on Hackerrank .
Online Aptitude Round
Online Aptitude Round consisted of 30 questions.
Online Coding Round
Online Coding Round consisted of 3 questions.
Ques 1) You have to classify a string as “GOOD”, “BAD” or “MIXED”. A string is composed of lowercase alphabets and ‘?’. A ‘?’ is to be replaced by any of the lowercase alphabets. Now you have to classify the string on the basis of some rules. If there are more than 3 consonants together, the string is considered to be “BAD”. If there are more than 5 vowels together, the also string is considered to be “BAD”. A string is “GOOD” if its not “BAD”. Now when question marks are involved, they can be replaced with consonants or vowels to make new strings. If all the choices lead to “GOOD” strings then the input is considered as “GOOD”, and if all the choices lead to “BAD” strings then the input is “BAD”, else the string is “MIXED”.
Ques 2) We are given a count of songs to be played – n, highest volume allowed – h, initial volume – i, and list of allowed volume change A[] of size n. The singer can either increase/decrease the volume of sound system for the next song by the allowed volume change A[j] for jth song from the volume of the j-1th song. The aim is to maximize the volume of last sound. Find the maximum volume that can be attained, or return -1 if there is no possibility of changing volume due to the given constrains. (Volume cannot be in negative.)
Ques 3) We are given an array with n elements from {1,2,3,4}. Find the number of minimum changes required to be performed so that no two adjacent numbers are same.
Around 15 students were shortlisted for the PI
Round 1 (60mins)
The interview started of with questions about The online test, general questions on “tell me about yourself”. Then he asked me a relative velocity problem from physics section to warm things up.
Round 2 (45mins)
The interviewer asked about my GSoC project – the idea of the project, the challenges I faced etc. She also asked some OS concepts like CPU scheduling, multi-queue scheduling etc. I was given some design questions which eventually got reduced to :
Ques 1) Implement Hash Map / Unorder Map
Ques 2) Implement Least Recently Used Cache Various approaches and corresponding space & time complexities for above implementations were discussed in this round.
Round 3 (60mins)
In third interview round, interviewer deep dived in my Machine and Deep Learning projects. He asked me about types of Machine learning algorithms. Asked me to explain supervised and unsupervised algorithms. Also asked me which one I had used in my projects. He also went on to understand the work flow of my projects. I also told about my other projects which were not on resume as the discussion went towards unsupervised learning.
Then I was asked following puzzles and questions.
Ques 1) 21 matchstick puzzle and variants - How to make 4 equilateral triangles with 6 identical match sticks?
Ques 2) Tickets movie hall probability puzzle and then he introduced some variation in the original puzzle - Suppose you’re on a game show, and you’re given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what’s behind the doors, opens another door, say No. 3, which has a goat. He then says to you, “Do you want to pick door No. 2?” Is it to your advantage to switch your choice?
Ques 3) Count number of ways for “Rat in a maze” problem - Given a maze with obstacles, count number of paths to reach rightmost-bottommost cell from topmost-leftmost cell. A cell in given maze has value -1 if it is a blockage or dead end, else 0. From a given cell, we are allowed to move to cells (i+1, j) and (i, j+1) only.
Ques 4) Find a pair with given sum in a Balanced BST.
Round 4 (20mins)
Questions like why do you want to join Adobe were asked. I showed interests in ML and AI, so the interviewer discussed some recent advances and news. I was also asked that how would I develop an application for Blood Donation Management within a week.
Thanks for Reading
Placewit grows the best engineers by providing an interactive classroom experience and by helping them develop their skills and get placed in amazing companies. Learn more at Placewit . Follow us on Instagram and Facebook for daily learning.