1

Introduction to LinkedList, learn about struct, and how is node represented

2

Inserting a node in LinkedList

3

Inserting a node at start in LinkedList

4

Inserting a node at End in LinkedList

5

Deleting a Head node in LinkedList

6

Deleting a node at the end of LinkedList

7

Find the length of the linkedlist [learn traversal]

8

Search an element in the LL

1

Introduction to DLL, learn about struct, and how is node represented

2

Insert a node in DLL

3

Delete a node in DLL

4

Reverse a DLL

1

Middle of a LinkedList [TortoiseHare Method]

2

Reverse a LinkedList [Iterative]

3

Reverse a LL [Recursive]

4

Detect a loop in LL

5

Find the starting point in LL

6

Length of Loop in LL

7

Check if LL is palindrome or not

8

Segrregate odd and even nodes in LL

9

Remove Nth node from the back of the LL

10

Delete the middle node of LL

11

Sort LL

12

Sort a LL of 0's 1's and 2's by changing links

13

Find the intersection point of Y LL

14

Add 1 to a number represented by LL

15

Add 2 numbers in LL

1

Delete all occurrences of a key in DLL

2

Find pairs with given sum in DLL

3

Remove duplicates from sorted DLL

1

Reverse LL in group of given size K

2

Rotate a LL

3

Flattening of LL

4

Clone a Linked List with random and next pointer

5

Design Browser History