Tip 1: Practice the most frequently asked DSA questions from companies like Amazon and Microsoft.
Tip 2: Focus on solving questions on your own as much as possible.
Tip 3: Don’t waste time on the quantity of questions at the expense of quality.
Tip 4: If it’s been a while since your last interview, do mock interviews with a friend.
Tip 5: For virtual interviews, always have a backup data source (e.g., mobile data in case Wi-Fi fails). During the interview, try to maintain eye contact periodically.
Tip 6: Keep your resume concise (1 page) and have strong knowledge of the tech stack you’ve listed.
Tip 1: Keep it short, to 1 page.
Tip 2: Prepare it well.
Tip 3: Focus more on the problem and the solution rather than on the tools used to solve the problem.
A total of 8 questions:
4 MCQs (on OOP and expected output type questions) + 2 coding questions, one of which involved class implementation.



If there exists no subarray in the given sequence whose sum is divisible by ‘K’ then simply return ‘0’.
Suppose the given array is ‘ARR’ = { 5, 0, 2, 3, 1} and ‘K = 5’.
As we can see in below image, there are a total of 6 subarrays that have the total sum divisible by ‘K’
So we return the integer 6.




1. The array follows 0-based indexing, so you need to return the 0-based index of the element.
2. Note that the element at the equilibrium index won’t be considered for either left sum or right sum.
3. If there are multiple indices which satisfy the given condition, then return the left-most index i.e if there are indices i,j,k…. which are equilibrium indices, return the minimum among them
4. If no such index is present in the array, return -1.
This round was with the AJIO team; the panel consisted of two members and took place around 4 PM. The interviewer’s focus was on approach.



If the given sequence ‘ARR’ has ‘N’ elements then the sorted wave array looks like -
‘ARR[0] >= ARR[1]’ and ‘ARR[1] <= ARR[2]’
‘ARR[2] >= ARR[3]’ and ‘ARR[3] <= ARR[4]’
‘ARR[4] >= ARR[5]’ and ‘ARR[5] <= ARR[6]’ And so on.
1. ‘ARR[0]’ must be greater than or equal to ‘ARR[1]’.
2. There can be multiple arrays that look like a wave array but you have to return only one.
3. We have an internal function that will check your solution and return 'True' in case your array is one of the solutions otherwise return 'False'.
The given array ‘ ARR = { 4, 3, 5, 2, 3, 1, 2 } ’
The below figure is a visual representation of the given ‘ARR’ and you can see we can express ‘ARR’ in a waveform array because
4>3 and 3<5
5>2 and 2<3
3>1 and 1<2
And it follows the condition of wave array.

Try to solve this problem in linear time complexity.



It was a managerial round. The person conducting the interview held the position of a technical architect. As informed by the recruiter, he was previously a technical architect at Amazon.
How does Facebook store comments?
1. How do you tackle problems?
2. Your long-term goal?
3. Have you even worked under pressure ?

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?