Tip 1 : Focus on DSA first.
Tip 2 : Secondly focus on DBMS
Tip 3 : OS and aptitude are seldom asked.
Tip 1 : Be through with your projects.
Tip 2 : Write only what you have done.
Just put some random values in function params to get output.



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?
Using loop and changing pointer nodes

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