- Enumerate through the list to find the last node, count the size along the way.
- Make a loop, by connection last to first
- Get modulo of |k/size| - avoiding extra rotation
- Enumerate again
*size-k*nodes - Break the loop and return new head

code:

```
ListNode *rotateRight(ListNode *head, int k)
{
if(head == NULL || head->next == NULL||k==0) return head;
ListNode* node = head;
int size =1;
while(node->next != NULL)
{
size++;
node = node->next;
}
//loop the list
node->next=head;
//handle the case of k>size
k = k%size;
//find the node to break the loop at
while(--size >= k)
{
node=node->next;
}
ListNode* first = node->next;
node->next=NULL;
return first;
}
```