Tip 1 : Practice coding
Tip 2 : practice aptitude
Tip 3 : prepare for the core subjects
Tip 1 : Write short resume
Tip 2 : Never lie about things
It had 10 MCQ questions and 2 coding questions. The coding questions were easy but they had to be solved in C programming language.



Each pair should be sorted i.e the first value should be less than or equals to the second value.
Return the list of pairs sorted in non-decreasing order of their first value. In case if two pairs have the same first value, the pair with a smaller second value should come first.
use loop



Assume that the Indexing for the linked list always starts from 0.
If the position is greater than or equal to the length of the linked list, you should return the same linked list without any change.
The following images depict how the deletion has been performed.


compare each node with given value and remove the pointer
The second round was an interview with the Manager, where mostly the coding questions were asked of easy to medium level of difficulty.



1) A prime number is a number that has only two factors: 1 and the number itself.
2) 1 is not a prime number.

A substring is a contiguous sequence of characters within a string.
Example: "cod" is a substring of "coding". Whereas "cdng" is not as the characters taken are not contiguous
It was with the other members of the company. The questions that were asked in this round were based on a linked list (easy difficulty level). A few questions related to a project on the C programming language in the resume were also asked.



If the given list is {1 -> -2 -> 3} (which is sorted on absolute value), the returned list should be {-2 -> 1 -> 3}.

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