Tip 1 : Be clear like crystal with your ds concepts and its implementation, practice questions on stacks, queues and linked lists.
Tip 2 : Practice puzzles from gfg it will definiitely help you
Tip 3 : Go through your projects thouroughly
Tip 1 : Have some good development projects on resume
Tip 2 : They will ask you almost everything mentioned on your resume.
It was an MCQ round with questions on quantitative knowledge and basic coding. 1 coding questions sealed this round.



1. ‘N’ contains only digits ‘0’ to ‘9’ and English letters ‘A’ to ‘F’.
2. Decimal equivalent of 0 is 0, 1 is 1, . . .9 is 9, A is 10, B is 11, . . . F is 15.
What do you understand by Data abstraction?
How Data Abstraction is achieved using OOPS concepts?
What is inheritance? Explain the different kinds of inheritance
It was a coding round with few questions on software enginering.



The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Can you solve this problem in O(N) time and O(1) space complexity?
It was a technical interview round and it was totally based on data structures and puzzles. The interviewer was friendly and asked questions on ds and puzzles.



V is the number of vertices present in graph G and vertices are numbered from 0 to V-1.
E is the number of edges present in graph G.
The Graph may not be connected i.e there may exist multiple components in a graph.
It was a technical round 2.It was totally based on your resume and was also focussed on backend .
Questions were asked from the projects mentioned in the resume.
Difference between delete and truncate?
It was a hr round and questions were asked about your family, thoughts on work load and strengths and weaknesses.
How many members does your family have?
What are your strength and weakness?
How many hours you can work?
Tip 1 : Be confident
Tip 2 : Be patient and spontaneous

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