LeetCode Reverse Nodes in k-Group 25. Reverse Nodes in k-Group 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
LintCode Remove Duplicates from Unsorted List LintCode-217.Remove Duplicates from Unsorted List Write code to remove duplicates from an unsorted linked list. Example Given 1->3->2->1->4. Return 1->3->2->4 Challenge (hard) How would you solve this problem if a temporary buffer is not allowed?
LintCode Rotate List LintCode-170.Rotate List Given a list, rotate the list to the right by k places, where k is non-negative. Example Given 1->2->3->4->5 and k = 2, return 4->5->1->2->3. /** * Definition for singly-linked list. * public class ListNode
LintCode Swap Two Nodes in Linked List LintCode-511.Swap Two Nodes in Linked List Given a linked list and two values v1 and v2. Swap the two nodes in the linked list with values v1 and v2. It's guaranteed there is no duplicate values in the linked list. If v1 or v2 does not exist in the
