How should I practice Rotate a Linked List to the Right?

Start by reading the full statement, solve the visible examples, then compare the pattern against related NVIDIA phone screen problems in FastPrep.

Is Rotate a Linked List to the Right associated with NVIDIA?

FastPrep tags this as a NVIDIA phone screen coding practice problem when the problem catalog has that company and stage context.

NVIDIA● MediumNEW GRADPHONE SCREEN

Given the head head of a singly linked list and a nonnegative integer k, move the final node to the front k times and return the new head.

A complete rotation preserves order. An empty list returns an empty list. The resulting list must terminate; it must not contain a cycle.

rotateRight(head: ListNode, k: int) → ListNode

head = [1,2,3,4,5]k = 2return = [4,5,1,2,3]

The final two nodes become the first two, without reversing them.

head = [0,1,2]k = 4return = [2,0,1]

Four rightward rotations equal one rotation for a three-node list.

head = []k = 7return = []

Rotating an empty list leaves it empty.