Linked List Problems

Filter

Topics

Arrays Strings 2D Arrays Searching & Sorting Backtracking Linked List Stacks & Queues Greedy Binary Trees Binary Search Trees Heaps & Hashing Graphs Tries DP Bit Manipulation Segment Trees

1

Reverse Linked List

Easy

2

Linked List Cycle

Easy

3

Merge Two Sorted Lists

Easy

4

Delete without Head node

Easy

5

Remove duplicates from an unsorted linked list

Easy

6

Sort a linked list of 0s-1s-or-2s

Easy

7

Multiply two numbers represented linked lists

Easy

8

Remove nth node from end of list

Medium

9

Reorder List

Medium

10

Detect and remove loop in a linked list

Medium

11

Write a Function to get the Intersection Point of two Linked Lists

Medium

12

Flatten a linked list with next and child pointers

Medium

13

Linked list in zig-zag fashion

Medium

14

Reverse a doubly linked list

Medium

15

Delete nodes which have a greater value on right side

Medium

16

Segregate even and odd Elements in a Linked List

Medium

17

Point to next higher value node in a linked list with an Arbitrary Pointer

Medium

18

Rearrange a given linked list in place

Medium

19

Sort Biotonic Doubly Linked Lists

Medium

20

Merge K Sorted Lists

Hard

21

Merge sort for linked list

Hard

22

Quicksort on singly-linked list

Hard

23

Sum of two linked lists

Hard

24

Flattening a linked list

Hard

25

Clone a linked list with next and random Pointer

Hard

26

Subtract two numbers represented as linked lists

Hard