Reverse a linked list by k Nodes
Reverse a linked list by k Nodes

input:
k=4
45 43 10 34 74 NULL
output:
74 45 43 10 34 NULL
corner test cases 
a. NULL
b. 1 NULL
c. k=4
1 2 NULL (ie k is greater than node count in the list)
devrezo/iaap