Rotate List

Asked in:
Amazon

Problem Description

Given a list, rotate the list to the right by k places, where k is non-negative.

Problem Constraints

1 <= B <= 10⁹

Input Format

The first argument is ListNode A, pointing to the head of the list.
The second argument is an integer B, representing the value of k.

Output Format

Return the rotated list.

Example Input

A = 1->2->3->4->5->NULL
B = 2

Example Output

4->5->1->2->3->NULL

Example Explanation

Given list: A = 1->2->3->4->5->NULL
Given B = 2;
After rotating A once, A = 5->1->2->3->4->NULL
After rotating A again, A = 4->5->1->2->3->NULL
Hence after rotating the given list A, for B = 2, return 4->5->1->2->3->NULL

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.