Linked List - Michael's Blog

Linked List

A collection of 5 posts

Intersection of Two Linked Lists

160. Intersection of Two Linked Lists [https://leetcode.com/problems/intersection-of-two-linked-lists/] LintCode-380.Intersection of Two Linked Lists [http://www.lintcode.com/en/problem/intersection-of-two-linked-lists/] Write a program to find the node at which the intersection of two singly linked lists begins. For example, the following two linked lists: A: a1

Reverse Nodes in k-Group

25. Reverse Nodes in k-Group [https://leetcode.com/problems/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

Remove Duplicates from Unsorted List

LintCode-217.Remove Duplicates from Unsorted List [http://www.lintcode.com/en/problem/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?

Rotate List

LintCode-170.Rotate List [http://www.lintcode.com/en/problem/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 { * int

Swap Two Nodes in Linked List

LintCode-511.Swap Two Nodes in Linked List [http://www.lintcode.com/en/problem/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