# [LeetCode 92] Reverse Linked List II [Java]

**2018-03-28

1. Description Reverse a linked list from position m to n. Do it in-place and in one-pass. Note: Given m, n satisfy the following condition: 1 ≤ m ...

1. Description Reverse a linked list from position m to n. Do it in-place and in one-pass. Note: Given m, n satisfy the following condition: 1 ≤ m ...

1. Description Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. 2. E...

1. Description 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 sh...

1. Description Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a he...

1. Description Given a sorted linked list, delete all duplicates such that each element appear only once. 2. Example Given 1->1->2, return 1->2....

1. Description Given a list, rotate the list to the right by k places, where k is non-negative. 2. Example Given 1->2->3->4->5->NULL and k = 2, ...

1. Description Given a linked list, swap every two adjacent nodes and return its head. Your algorithm should use only constant space. You may not m...

1. Description 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 t...

1. Description Sort a linked list in O(n log n) time using constant space complexity. 2. Runtime Distribution 3. Submission Details 4. Example ...

1. Description Reverse a singly linked list. 2. Runtime Distribution 3. Submission Details 4. Code [restabs alignment="osc-tabs-right" responsive...