Tip 1 : Read Interview Experience from internet resources and understand the type of questions asked.
Tip 2 : Learn about Low Level System Design because this is one of the most important round. Basically OOPs concept play a crucial role here.
Tip 3 : Practice DSA questions
Tip 1 : Highlight your skills like Java, Machine Learning, Web Development in the Resume
Tip 2 : Do not add something in the resume which you are not aware about.
Tip 3 : Make it single page Resume.
Tip 4 : Internship/Job Experience is a plus point
It was scheduled on Google Meet. The timing was 10 am to 11:30 am in morning. I was there with 8 other candidates at the call. We were shared the problem statement through google doc. There were two interviewers who calmly explained the question. We were asked to share our screen and code on any IDE of any choice. After 90 minutes we were asked to share our code through gmail to recruiter's mail. Later another 30 minutes was reserved for one to one call to explain the code and execute the working code infront of them.
I was asked to design Coding Contest Platform. There were 10 functionalities/requirements in the question. 7 must to solve and 3 were optional(bonus). It was a very detailed question. I am explaining the functionalities in brief
1) Create User : includes returning id and saving in database
2) Create Question
3) Give List of Questions Present in Database
4) Create Contest
5) Give List of Questions present in DB.
6) Attend contest
7) Run the contest : basically write an algorithm to calculate the score. Algorithm was explained in the question as well.
Bonus : Leader Board : Show scores, Contest History , Contest Withdrawal.
Tip 1 : I practiced a Low Level System Problem daily. Basically Practice is the key because everything has to be implemented in 90 minutes time.
Tip 2 : I used to practice from internet resources as well
Tip 3 : Strengthen your OOPs concept as you will need to deal with Objects and other OOPs concept.
The round was scheduled at 3 pm. Again the interview happened on Google Meet. Two leetcode medium level questions were shared through google doc. I was asked to share my screen. The interviewer explained the code and also provided a test case for better understanding. The interviewer was very friendly and helping. He helped me with few edge cases and some hints too.



Note: Since the number of ways can be very large, return the answer modulo 1000000007.
N=3

We can climb one step at a time i.e. {(0, 1) ,(1, 2),(2,3)} or we can climb the first two-step and then one step i.e. {(0,2),(1, 3)} or we can climb first one step and then two step i.e. {(0,1), (1,3)}.
Step 1 : I used recursion to find out all possible moves and selected minimum jumps from those.
Step 2 : Interviewer asked to make to provide optimal Solution.
Step 3 : I was able to solve in O(n) using Dynamic Programming using top to bottom approach.



FrequencyStack() : Creates a new FrequencyStack.
void push(int element) : Pushes the element onto the top of the stack.
int pop() : Returns and remove the most frequent element in the stack. If there are multiple elements with the same maximum frequency then return the integer which is closest to the stack top.
0 : It means we have to pop the element with maximum frequency and return this element.
1 ‘element’ : It means we have to push ‘element’ onto the top of the stack.
Note: If a pop operation is used in an empty stack nothing happens to the stack, but you have to return -1.
Step 1 : First I gave linked list approach which was inserting in O(n) time but pop operation was O(1).
Step 2 : Then I tried to make insert operation as O(1).
Step 3 : I came up with HashMap Approach.
Basically this was Hiring Manager round. The round was scheduled at 6:30 pm in the evening. I was asked about my current project in the company.
Tip 1 : You need to prepare your Resume thoroughly.
Tip 2 : The basic Fundamentals about your technical skills should be very good.
Tip 3 : Prepare for behavioural questions in advance.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?