Rishabh has given you a linked list in the form of its head node A. He has also given you an integer B.
You need to change the value of each node to its nearest multiple of B that is <= current value.
1 <= size of list <= 105
1 <= value of each node <= 105
1 <= B <= 105
First argument is the head pointer of linked list A.
Second argument is the integer B.
Return the head of the changed linked list.
A = 1 -> 2 -> 3 B = 2
A = 3 -> 4 -> 5 B = 3
0 -> 2 -> 2
3 -> 3 -> 3
All numbers have been replaced by nearest multiples of 2.
All numbers have been replaced by nearest multiples of 3.
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.