
The first line contains an Integer 'T' which denotes the number of test cases or queries to be run. Then the test cases follow.
The first line of each test case contains the size of the square matrix 'N'.
The second and final line of each test case contains the N*N Integers separated by a single space (the matrix is entered row-wise)
For each test case, print the modified singly linked list which should only be connected using the right pointer.
Output for every test case will be printed in a separate line.
You do not need to print anything, it has already been taken care of. Just implement the given function.
1 <= 'T' <= 10
1 <= 'N' <= 10^2
-10^9 <= data <= 10^9
Where 'N' is the size of the square matrix.
Time Limit: 1sec
Starting from head of the linked list traverse first to the extreme bottom of the matrix and then go to the extreme right of the matrix. Update head to the right of the head and then again go from here to the second extreme bottom of matrix and then go to the second extreme right of the matrix and so on, update head to its right after every traversal, follow down and right path until ur head reaches null. Make shape of ‘L’ starting from the head of the linked list and update the head to its right node. With traversal of matrix, you have to change links from down to right in the updated linked list