Get started
Start with DSA Fundamentals
Programming Fundamentals
Back to modulesModule 06 · 0/31
Module 06
Linked List Data Structures
0/3110183
Singly Linked List: Fundamentals0/5
Doubly Linked List: Fundamentals0/4
Medium Problems of Singly Linked List0/15
- 1Middle of a Linked ListEasy
- 2Reverse Linked List (Iterative)Easy
- 3Reverse Linked List (Recursive)Easy
- 4Detect a Loop in Linked ListMed.
- 5Find Starting Point of Loop in Linked ListMed.
- 6Length of Loop in Linked ListEasy
- 7Check if Linked List is PalindromeMed.
- 8Segregate Odd and Even NodesMed.
- 9Remove Nth Node from End of ListMed.
- 10Delete Middle Node of Linked ListMed.
- 11Sort a Linked ListMed.
- 12Sort a Linked List of 0s, 1s and 2sMed.
- 13Find Intersection Point of Y Linked ListMed.
- 14Add 1 to a Linked List NumberMed.
- 15Add Two Numbers in Linked ListMed.