430. Flatten a Multilevel Doubly Linked 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

138. Copy List with Random Pointer

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

234. Palindrome Linked List

Given the head of a singly linked list, return true if it is a palindrome.

328. Odd Even Linked List

Given the head of a singly linked list, group all the nodes with odd indices together followed by the nodes with even indices, and return the reordered list.

21. Merge Two Sorted Lists

Merge two sorted linked lists and return it as a sorted list. The list should be made by splicing together the nodes of the first two lists.

203. Remove Linked List Elements

Given the head of a linked list and an integer val, remove all the nodes of the linked list that has Node.val == val, and return the new head.

206. Reverse Linked List

Given the head of a singly linked list, reverse the list, and return the reversed list.

61. Rotate List

Given the head of a linked list, rotate the list to the right by k places.

2. Add Two Numbers

You are given two non-empty linked lists representing two non-negative integers.

160. Intersection of Two Linked Lists

Write a program to find the node at which the intersection of two singly linked lists begins.

Your browser is out-of-date!

Update your browser to view this website correctly. Update my browser now

×