Tip 1 : Do at-least 2 projects.
Tip 2 : Practice on coding ninjas.
Tip 1 : Mention if you have any experience in past.
Tip 2 : Put your competitive profiles URL.
Smooth platform of Hackerrank.
Nice user interface.
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?
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Suppose list1 is [2, 133, 12, 12], what is max(list1) in Python?