Tip 1 : Practice DSA Question if not implementation at least you need to know all the theory
Tip 2 : OOPs and DBMS are majorly asked interview soo don't forgot to practice it well
Tip 3 : With Technical knowledge puzzle question are also important as the logic and reasoning part is very important.
Tip 1 : Try to speak True in resume Don't write things which you don't know just to showcase because question are based on that
Tip 2 : Mention Some good project and skill of you and also if you have done good on any coding platform or win any sort of competition mention them.
The round was in the morning around 10. The round contains MCQ question from Aptitude, Reasoning and Communication. Then there was 1 coding question to solve, and the time to solve it was 45 min.
Aptitude(20 Question ) , Reasoning(20 Question), Programming Question(10 Question)
Number Of MCQs - 50



For the given tree:

The path 1 -> 3 -> 7 produces the maximum i.e, 11.
1) Find maximum sum from leaf to root in left subtree of X (we can use this post for this and next steps)
2) Find maximum sum from leaf to root in right subtree of X.
3) Add the above two calculated values and X->data and compare the sum with the maximum value obtained so far and update the maximum value.
4) Return the maximum value.
It was in the morning around 11 and the interviewer join on Teams call.



Input:
'num1' : 1 -> 2 -> 3 -> NULL
'num2' : 4 -> 5 -> 6 -> NULL
Output: 5 -> 7 -> 9 -> NULL
Explanation: 'num1' represents the number 321 and 'num2' represents 654. Their sum is 975.
Traverse the two linked lists in order to add preceding zeros in case a list is having lesser digits than the other one.
Start from the head node of both lists and call a recursive function for the next nodes.
Continue it till the end of the lists.
Creates a node for current digits sum and returns the carry.
There are 5 lanes on a race track. One needs to find out the 3 fastest horses among total of 25. Find out the minimum number of races to be conducted in order to determine the fastest three.
Tip 1 : The approach entails conducting 5 races where each race group would involve 5 horses.
Tip 2 : In the ensuing step, a sixth race is conducted between winners of first 5 races to determine the 3 fastest horses (marked A1, B1, A=and C1). The seventh race is conducted between horses B1, C1, second and third horse from the horse A1’s group (A2, A3), second horse from horse B1’s group (B2).
Tip 3 : The horses that finish 1st and 2nd in the seventh race, are actually the 2nd and the 3rd fastest horses among all horses.
It was the manger round. It was in the morning around 10 some scenario based question was asked.
Describe a situation where you weren’t satisfied with your job. What could have made it better?
Tip 1 : Think and answer which is better for company
It was easy Compared to other rounds it was basically to identify a person.
The round happened in the morning around 9.
Tell me about yourself.
What are your strengths and weaknesses?
Tip 1 : This type of question are placed to make yourself comfortable.
Tip 2 : Be confident while answering
Tip 3 : Look in the eye's of interviewer as much as possible

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