There were 3 rounds of interviews, 2 technical and 1 HR, ln First round I was asked about OOPs, 2 medium level DSA questions, asked to write code on paper and explain the approach. Questions: 1. Given an array find its equilibrium point: index of array where left subarray sum=right subarray sum Ex: 2 2 1 4 Output: 2(index of 1) 2. Given a number N find i power N, where i is imaginary number(square root of -1). In second round I was asked about my projects and had a deep discussion on them, then again two more DSA questions, I managed to solve 1. Questions: 1.Implement a stack with 3 operations push, pop and getMin: returns minimum element in a stack. Ensure that all three operations has o(1) time complexity 2.Print maximum number of a using given four keys(its on GFG, you can check it out.)