NeetCode #333LC-61MediumLinked List
← Back to All Problems#333 · #61 · Rotate List(旋转链表)
📌 Problem Statement & Constraints
Given the head of a linked list, rotate it to the right by
k places and return the head. Constraints: the number of nodes is in [0, 500], -100 <= Node.val <= 100, 0 <= k <= 2 * 10^9.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!