Linked List
A linked list is a linear data structure that consists of nodes. Each Node contains a data field and a pointer to the next Node. In Linked List, unlike arrays, elements are not stored at contiguous memory locations but rather at different memory locations. The various elements in a linked list are linked together using pointers. There are majorly two types of Linked list: Singly Linked List and Doubly Linked List. This category contains all the information you need to know about Linked Lists.
Top Problems related to Linked List
MergeSort Linked List

Print Reverse LinkedList

Delete Alternate Nodes

Rearrange odd and even places

Delete a Node from Linked List
Find a Node in Linked List
Cycle Detection in a Singly Linked List

Detect and Remove Loop

Deletion In Circular Linked List

Intersection of Two Linked Lists
Sum Between Zeroes

Implement Stack With Linked List

MergeSort Linked List

Delete N nodes after M nodes of a linked list

Reverse Alternate Nodes of a Singly Linked List

Add First and Second Half

Add First and Second Reversed Half

Find Pairs

Swap Nodes in Pairs

Remove String

Match Number
