Tip 1: Prepare some Projects
Tip 2: Practice At least 250 Questions of DS algo
Tip 3: Do at least two application based projects
Tip 1: Have some projects on your resume.
Tip 2: Do not put false things on your resume.



1. If the size of the linked list is 1, then return the head
2. Find mid using The Tortoise and The Hare Approach
3. Store the next of mid in head2, i.e., the correct sub-linked list.
4. Now, Make the next midpoint null.
5. Recursively call mergeSort() on the left and right sub-linked lists and store the new head of the left and right linked list.
6. Call merge() given the arguments new heads of left and right sub-linked lists and store the final head returned after merging.
7. Return the final head of the merged linked list.



1. The helper function ‘knows’ is already implemented for you.
2. ‘knows(A, B)’ returns "false", if A doesn't know B.
3. You should not implement helper function ‘knows’, or speculate about its implementation.
4. You should minimize the number of calls to function ‘knows(A, B)’.
5. There are at least 2 people at the party.
6. At most one celebrity will exist.






Tell me about yourself.
Tell me about your project and internship experience.
What are your hobbies?
Tip 1 : Focus on the way you present your projects.
Tip 2 : Be polite and confident

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?