Tip 1 : Practise Common algorithms Problem + Java + Oops + Development Questions.
Tip 2 : Explain your thought process and Approach and communicate well with the Interviewer. Be Attentive
Tip 3 : Practise some behavioral Questions and be honest and Confident to answer them while Interviewing.
Tip 1 : Make ATS friendly resume, clean and well-written with bullet points
Tip 2 : Prepare well what you have mentioned in your resume.
It was Java and data Structure Rounds.


Input String: "abcdeapapqarr"
Expected Output: 'a'
Since 'a' has appeared four times in the string which happens to be the highest frequency character, the answer would be 'a'.
Assume all the characters in the given string to be in lowercase always.
I discussed my brute force Approach and optimize one with the Interviewer and later started coding. while coding I was explaining my thought process in each process. I used a hashmap to store the frequency of each letter and later Iterate through the map and returned the character regarding the highest frequency.
OOPs, Interface, Abstraction, and Collections
I have explained real-world Examples to the Interviewer. while answering them.
It was a 45-60 Minutes Coding round



a) Duplicate elements may be present.
b) If no such element is present return -1.
Input: Given a sequence of five numbers 2, 4, 5, 6, 8.
Output: 6
Explanation:
In the given sequence of numbers, number 8 is the largest element, followed by number 6 which is the second-largest element. Hence we return number 6 which is the second-largest element in the sequence.
In the first traversal find the maximum element.
In the second traversal find the greatest element in the remaining excluding the previous greatest.
SQL VS NoSQL
MongoDB Aggregation Pipeline
Tip 1 : I have explained these problems answer with my previous projects use cases and business requirements
It was a telephonic round with CTO



The given array is sorted in non-decreasing order.
I Used Linear and binary search and discussed space and time complexity.

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