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.

Given a non-empty, singly linked list with head node head, return a middle node of linked list.

Given a linked list, rotate the list to the right by k places, where k is non-negative.

You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

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.

Given a node from a cyclic linked list which is sorted in ascending order, write a function to insert a value into the list such that it remains a cyclic sorted list. The given node can be a reference to any single node in the list, and may not be necessarily the smallest value in the cyclic list.

You are given a doubly linked list which in addition to the next and previous pointers, it could have a child pointer, which may or may not point to a separate doubly linked list. These child lists may have one or more children of their own, and so on, to produce a multilevel data structure, as s...

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.

Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…

Sort a linked list in O(n log n) time using constant space complexity.

Given a non-negative integer represented as non-empty a singly linked list of digits, plus one to the integer.

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.

Given a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the given target.

Given a node from a cyclic linked list which has been sorted, write a function to insert a value into the list such that it remains a cyclic sorted list. The given node can be any single node in the list. Return the inserted new node.

Problem Insert a node in a sorted linked list. Example Given list = 1->4->6->8 and val = 5. Return 1->4->5->6->8. Solution {代码...}

Implement a stack. You can use any data structure inside a stack except stack itself to implement it.

You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in forward order, such that the 1's digit is at the head of the list. Write a function that adds the two numbers and returns the sum as a linked list.

For example,Given 1->2->3->4, you should return the list as 2->1->4->3.

Head loop through the list: Store head.next, head points to tail, tail becomes head, head goes to stored head.next;

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 given linked list, do nothing.

Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.

Remove all elements from a linked list of integers that have value val.

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.

Given 1->2->3->4->null, reorder it to 1->4->2->3->null.

Sort a linked list in O(n log n) time using constant space complexity.

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.

A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.

Problem Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. Example Given lists: {代码...} return -1->2->4->null. Note 分治做法中，merge()函数依然是将链表结点两两进行比较，然后在sort()函数中迭代merge两个二分后sort()的结果。PriorityQueue更为...

Given a sorted linked list, delete all duplicates such that each element appear only once.

Merge two sorted (ascending) linked lists and return it as a new sorted list. The new sorted list should be made by splicing together the nodes of the two lists and sorted in ascending order.