🧩 The Problem:
Given a singly linked list, rotate it to the right by k nodes.
Example: If the list is 1 → 2 → 3 → 4 → 5 → NULLand k = 2 then,rotate 1: 5 → 1 → 2 → 3 → 4 → NULL
rotate 2: 4 → 5 → 1 → 2 → 3 → NULL
the rotated list becomes( final output...
