|All-time Popular Problems|
|Construct Tree from Inorder & Preorder|
|Sum of two large numbers|
|Level order traversal in spiral form|
|Spirally traversing a matrix|
|Angle between hour and minute hand|
|Binary Tree to DLL|
|Smallest Positive missing number|
|Height of Binary Tree|
|Largest Number formed from an Array|
Given pointer to the head node of a linked list, the task is to reverse the linked list.
You need to complete a method reverse() that takes head as argument and returns new head.
There are multiple test cases. For each test case, this method will be called individually. The first line of input contains number of test cases. Every test case has two lines, number of nodes first line and data values in next line.
Reverse the linked list and return head of the modified list.
1 2 3 4 5 6
6 5 4 3 2 1