Round 1 (Coding Round): Technical questions on topics like OS, DSA, etc.
- Question 1: Queries problem (easy): Given two arrays, Array1 (a multidimensional array) and Queries array (contains an array of L, R of many queries: Eg: [[2,3][3,4]…] ) The problem was to do a certain operation from L(left index) to R (right index) in a given array (multi-dimensional) and return the array of answers for all the queries.
- Question 2: Multiverse (medium-hard): Given an array of elements, the problem was to find the next Multiverse-greater element of every element in the array. However, the Multiverse-greater is a number that has the sum of digits greater than the sum of digits of another number.
- Multiverse Greater- 123>400 ( Since 1+2+3>4+0+0) If the sum is the same, we can take the base case of including the number higher, in general, Suppose: Among 72,36: the number 72 would be considered greater since 7+2=3+6 and 72>36
Round 2: (Technical Interview): The question was asked on my final year project.
- Question 1: To find the most frequent element in an array in O(n) time complexity and O(1) space complexity. (Search Moore voting algo)
-
Question 2: Romans standing in a circle, the first person kills 2nd person and gives the knife to 3rd, the 3rd kills the 4th and gives it 5th, the 5th kills 6th and gives it to 1st and so on. I was asked to write the mathematical equation to calculate the last person alive given the N (number of people standing circularly).
The interviewer expected a more optimal approach. https://www.geeksforgeeks.org/find-last-element-deleting-every-second-element-array-n-integers - The interview asked questions on Polymorphism, Full Outer Join, and Deadlock.
Rounds 3 and 4:Technical and Managerial: Asked coding questions on graphs and projects
Round 5: (HR) Could not qualify for this round
Article Tags :
Recommended Articles