Amagi Interview Experience (On-Campus)
1st Round Details (Online test): The online round was on the HirePro platform. It consisted of 4 sections.
- Aptitude – 20 questions (30 minutes)
- Logical and analytical reasoning – 20 questions (30 minutes)
- Technical – 10 questions (15 minutes)
- Coding – 2 questions (45 minutes)
- (Easy) Given a string, return the k’th element in the string after it is lexicologically sorted. And also find the number of times that element is repeated in the string
- (Medium) A person wants to buy ‘N’ pens. There are ‘M’ shops, where each shop has ‘n’ pens in stock, each pen costs ‘p’ and the delivery cost is ‘d’. Find the minimum cost to buy N pens.
2nd Round Details (F2F technical round 1): Introduced myself and jumped right into coding. The following 4 questions were asked.
- Given 3 points on a 2-D plane, check if the three points are collinear. This was a pretty straight forward question and can be solved with O(1) time complexity.
- Given a number ‘n’, get the first ‘n’ numbers in the Fibonacci series, and return the sum of all the numbers in the prime number indices of the series.
- Given a binary tree, find the sum of all leaf nodes.
- Given an array of integers, find the longest subarray whose sum is zero. This was a dynamic programming question that could be solved with space complexity of O(n) and time complexity of O(n).
In this round, I had to explain my approach first and then code it from scratch and execute it without any errors, covering all the edge cases. I was able to get all the questions right.
3rd Round Details (F2F technical round 2): After an elaborate introduction, the interviewer asked me basic questions on DBMS(subqueries, joins, and normalization), CN(routing algorithms), OS(deadlocks and semaphores), DSA(binary trees, heaps). After this, I was asked to code 2 problems.
- Given an array of integers that represent the stock price of a commodity, find the days on which a person should buy and sell stock to maximize the profit. This was again a dynamic programming question that could be solved with time complexity of O(n) and space complexity of O(n).
- Given a binary search tree, print the right view. I was asked to cover all edge cases and optimize the code. This was done with the time complexity of O(n).
After this, we had a general discussion regarding my interests and goals.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, Amazon. Google and Microsoft Test Serieses.