Linked Lists
Linear data structures where elements are stored in nodes, connected by pointers.
Types
List Operations (CRUD)
EasyComprehensive Create, Read, Update, Delete for Singly, Doubly, and Circular Lists.
List Operations (CRUD)
EasyComprehensive Create, Read, Update, Delete for Singly, Doubly, and Circular Lists.
Singly Linked List
EasyBasic linked list with unidirectional pointers.
Doubly Linked List
MediumLinked list with bidirectional pointers (prev/next).
Circular Linked List
MediumLast node points back to the first node.
Advanced Algorithms
Reversal Algorithms
HardIterative, recursive, and K-group reversal techniques.
Cycle Detection
HardDetect cycles using Floyd's Cycle-Finding Algorithm.
Intersection of Two Lists
MediumFind the node where two linked lists merge.
Union of Two Lists
MediumCreate a new list with unique elements from two lists.
Merge Operations
HardMerge sorted lists, K-sorted lists, and alternating merge.
Palindrome Operations
MediumCheck palindrome and convert to palindrome.
Reordering Operations
HardRemove Nth node, Rotate list, Swap pairs, Odd-Even reordering.
Sorting Algorithms
HardMerge Sort and Insertion Sort on Linked Lists.
Cloning Algorithms
MediumDeep Copy and Clone with Random Pointer.