Tip 1 : practice from gfg, interview bits and so on
Tip 2 : learn theory
Tip 1 : skills should be cleanly defined
Tip 2 : precise and short
It started with introduction. He then touched upon my projects and internship experience. 2 coding question were given and it was supposed to be solved by sharing screen . Interviewer was very helpful . Any language can be used to solve



If the given list is (1 -> -2 -> 0 -> 4) and N=2:

Then the 2nd node from the end is 0.
1) Calculate the length of the Linked List. Let the length be len.
2) Print the (len – n + 1)th node from the beginning of the Linked List.



This is a visualization of the Circular Linked List, represented by:
1 2 3 4 5 -1

The Circular Linked List before/after deletion may happen to be empty. In that case, only print -1.
All integers in the list are unique.

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?