# Description : Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null. # There is a cycle in a linked list if there is some node in the list that ...

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