LinkedList

IdProblemInputOutputLevel0 / 16
L1Delete N Nodes After M Nodes of a Linked ListEasy
L1

Delete N Nodes After M Nodes of a Linked List : ---- Input : ----- Output :

L2Middle of the Linked List1-2-3-4-53Easy
L2

Middle of the Linked List : ---- Input : 1-2-3-4-5 ----- Output : 3

L3Delete Node in a Linked List1-2-3-4 31-2-4Easy
L3

Delete Node in a Linked List : ---- Input : 1-2-3-4 3 ----- Output : 1-2-4

L4Reverse Linked List1-2-3-44-3-2-1Easy
L4

Reverse Linked List : ---- Input : 1-2-3-4 ----- Output : 4-3-2-1

L5Merge Two Sorted Lists1-2-3 / 2-4-51-2-2-3-4-5Easy
L5

Merge Two Sorted Lists : ---- Input : 1-2-3 / 2-4-5 ----- Output : 1-2-2-3-4-5

L6Remove Duplicates from Sorted List1-2-3-1-31-2-3Easy
L6

Remove Duplicates from Sorted List : ---- Input : 1-2-3-1-3 ----- Output : 1-2-3

L7Linked List CycleDetect CycleTrue / FalseEasy
L7

Linked List Cycle : ---- Input : Detect Cycle ----- Output : True / False

L8Intersection of Two Linked ListsEasy
L8

Intersection of Two Linked Lists : ---- Input : ----- Output :

L9Palindrome Linked List1-2-2-1TrueEasy
L9

Palindrome Linked List : ---- Input : 1-2-2-1 ----- Output : True

L10Remove Linked List ElementsEasy
L10

Remove Linked List Elements : ---- Input : ----- Output :

L11Convert Binary Search Tree to Sorted Doubly Linked ListEasy
L11

Convert Binary Search Tree to Sorted Doubly Linked List : ---- Input : ----- Output :

L12Plus One Linked ListMedium
L12

Plus One Linked List : ---- Input : ----- Output :

L13Next Greater Node In Linked List5-3-4-2-15 4 4 2 1Medium
L13

Next Greater Node In Linked List : ---- Input : 5-3-4-2-1 ----- Output : 5 4 4 2 1

L14Linked List ComponentsMedium
L14

Linked List Components : ---- Input : ----- Output :

L15Odd Even Linked ListMedium
L15

Odd Even Linked List : ---- Input : ----- Output :

L16Add Two Numbers IIMedium
L16

Add Two Numbers II : ---- Input : ----- Output :