## Rotate List

Question Given a list, rotate the list to the right by k places, where k is non-negative. For example: Given 1->2->3->4->5->NULL and k = 2, return 4->5->1->2->3->NULL. This question is provided by LeetCode.

Question Given a list, rotate the list to the right by k places, where k is non-negative. For example: Given 1->2->3->4->5->NULL and k = 2, return 4->5->1->2->3->NULL. This question is provided by LeetCode.

Question Given a linked list, swap every two adjacent nodes and return its head. For example, Given 1->2->3->4, you should return the list as 2->1->4->3. Your algorithm should use only constant space. You may not modify the values in the list, only nodes itself can be changed. This question is provided by LeetCode.

Question Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is. You may not alter the values in the nodes, only nodes itself Read the full article…

Question Reverse a linked list from position m to n. Do it in-place and in one-pass. For example: Given 1->2->3->4->5->NULL, m = 2 and n = 4, return 1->4->3->2->5->NULL. Note: Given m, n satisfy the following condition: 1 ? m ? n ? length of list. This question is provided by LeetCode.

Question Given a linked list, remove the nth node from the end of list and return its head. This question is provided by LeetCode.

Question Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. This question is provided by LeetCode.

Question Given a sorted linked list, delete all duplicates such that each element appear only once. This question is provided by LeetCode.

QUESTION Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the original relative order of the nodes in each of the two partitions. This question is provided by LeetCode.

QUESTION Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. This question is provided by LeetCode.

QUESTION Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. This question is provided by LeetCode.