Tag Archives: linkedlist

Partition List

leetcode 86. 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. For example, Given 1->4->3->2->5->2 and x = 3, return 1->2->2->4->3->5. Solution.… Read More »

Linked List Cycle II

leetcode 142. Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Solution. First of all, we know that we can use slow / fast pointer to check if it has cycle. Assume they meet at point Z. We know slow walks distance of a + b,… Read More »