Total students applied : 275
Total students who have given the test : 227
Online Test: There were two coding questions
1. Longest Decreasing subsequence (Link : LIS) ( A variation to longest increasing
subsequence problem).
a. (1 <= N <= 1000).
b. -1e9 <= A[i] < 1e9.
2. Given an array find the mode, median and mode of the array elements. Return mean,
median in a double data type and mode in integer data type.
Some fundamental questions on C programming and Data structures. No questions on OS, CN
and DB.
The test was conducted on mettl platform, Students struggled to submit their code on the
platform as it was not as convenient as hackerrank/hackerearth
Shortlised Candidates : 45
Round 1 ( Problem solving)
1. Given an array where every number occurs twice and only one number occurs thrice.
Find the number that repeated thrice.
a. Note : All the repeated elements occur in pairs i.e all the repeated elements are
adjacent to each other.
Example : [1, 1, 2, 2, 3, 3, 3, 4, 4, 6, 6]
Output : 3
Solution : I explained an O(n) approach where we traverse and check for the element which has
repeated thrice and also i have suggested an O(n) exor approach.
Interviewer asked me to Optimize it further, to which i came up with an O(logn) Binary search
solution based on the indices and the element present at that index.
Round 2(Problem Solving)
1. Given a 2d grid map of ‘F’s (Females) and 'M's (Males), count the number of female
groups. A female is surrounded by a male and is formed by connecting adjacent females
horizontally or vertically.
Example :
F M F F
F M M F
M M M M
F F M F
Result : 4 (Number of female Groups)
Original Problem Link : Number of Islands
2. The problem was formed so big just to confuse the candidate, At the heart of it basically
you are given a DAF and you have to print the topological sort of it.
a. Problem link : Course Schedule
3. A message containing letters from A-Z is being encoded to numbers using the following
mapping:
'A' -> 1
'B' -> 2
...
'Z' -> 26
Example :
Given encoded message "12", it could be decoded as "AB" (1 2) or "L" (12).
The number of ways decoding "12" is 2.
I have told the interviewer that I have already seen the question before on SPOJ. She
has changed the question once I let her know
4. Given an Undirected graph. Convert it to directed graph such that there are no transitive
relationship between nodes. First prove whether it is convertible or not? If convertible
how would you convert.
Solution : Greedy Approach :- If a node has an incoming edge it should not have
any outgoing edge. Start from root and assign edges in a greedy manner. But
before all this just check if there is a loop of odd length. If an odd length loop exits
then we cannot convert.
Round 3(Problem Solving + CS Fundamentals)
1. He asked me a problem on the discrete binary search very similar to Allocate Books or
Aggresive Cows .
Initially I took my time to come up with a bruteforce solution, which he proved
wrong by few test cases. Then he subtly dropped me a hint by a question(What is the
maximum number your answer can be ?) . With this help I was able to solve the problem
with discrete binary search.
2. https://www.geeksforgeeks.org/k-maximum-sum-combinations-two-arrays/
Some OS Questions from Memory management and threads
Final Round(Bar Raiser) : This was an online interview with some very senior person from
amazon.
1) Check whether a BST is height balanced or not.
2) Some Standard math puzzle on knock out matches tournament
3) Behavioural questions like why Amazon?
4) Weakness
5) Strength
6) Why M.Tech after B.Tech?
Got the offer XD.
