LeetCode - Remove Nth Node From End of List
Question Definition
Given a linked list, remove the nth node from the end of list and return its head.
More …Given a linked list, remove the nth node from the end of list and return its head.
More …Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.
More …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.
More …Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.
You should try to do it in place. The program should run in O(1) space complexity and O(nodes) time complexity.
More …Given a linked list, return the node where the cycle begins. If there is no cycle, return null.
More …