Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Technical round with 2 DSA based questions.



The given linked lists may or may not be null.
If the first list is: 1 -> 4 -> 5 -> NULL and the second list is: 2 -> 3 -> 5 -> NULL
The final list would be: 1 -> 2 -> 3 -> 4 -> 5 -> 5 -> NULL
If one of the given lists is NULL, return the head of the other list.
The data of the head of the first node should be less than or equal to the data of the head of the second node.
Traverse both the linked lists simultaneously.
If the current node of the second linked list is smaller than the current node of the first linked list, insert the current node of the second linked list before the current node of the first linked list.
This is done by making the next node of the previous node of the first linked list as the current node of the second linked list. Further, make the next node of this node as the current node of the first linked list.
If the first list has reached the end and the second list hasn’t, point its next node to the head of the second list.


You are given ‘N’ as 21, the only number whose sum of digits and the number itself equals 21 is 15 as 15 + 1 + 5 = 21. Hence the answer is [15].
The intuition behind this approach is that any integer’s sum of digits can’t be very high, so we check only 1000 numbers less than and greater than the given number. So we will traverse from 1 to 1000, and find the number whose sum of digits is with the number itself is equal to the given number.
Technical round with questions on OOPs and Selenium.
How to access the method using object?
Write a selenium framework in notepad?

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