Tip 1 : Practice maximum questions of linked lists and stacks.
Tip 2 : DBMS concepts should be crystal clear.
Tip 3 : If you are not able to complete something in-depth, clearly mention that to the interviewer.
Tip 4 : Practice a mock interview and try to solve any random question in front of your friend.
Tip 1 : Mention maximum projects you have one and be prepared to explain them.
Tip 2 : Don't mention anything you are not confident in.
A lot of variety of C snippets were there in 1 section which majorly included usage of data structures. Apart from them 1 section was a bunch of easy aptitude questions. It was taken at around 12 pm and was proctored remotely. Only 7 students were shortlisted.
Data structures were asked like linked list and stacks. Hashmaps were also there. some basic questions of DBMS were asked and the interviewer asked if i know networking for which i said no. After that there was a 5 minute simple straightforward round with H.R


1. If the list is empty, the function immediately returns None because there is no middle node to find.
2. If the list has only one node, then the only node in the list is trivially the middle node, and the function returns that node.
I explained the slow and fast pointer approach.

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