Linked-List

Add two numbers represented as linked lists where digits are stored in reverse order

Detect if a linked list has a cycle and find the starting point of the cycle

Create a deep copy of a linked list where each node has a random pointer

Delete a node from a linked list when you only have access to that node

Detect if a linked list has a cycle using Floyd's cycle detection algorithm

Find the middle node of a linked list using the two-pointer technique

Flatten a binary tree into a linked list in-place using preorder traversal.

Flatten a multilevel doubly linked list into a single level

Implement a queue using arrays or linked lists with O(1) time complexity for all operations.

Design and implement a stack data structure with push, pop, top, and empty operations

Find the intersection node of two linked lists

Merge k sorted linked lists into one sorted linked list

Merge two sorted linked lists into one sorted linked list

Check if a linked list is a palindrome using O(1) extra space

Partition a linked list around a value x such that all nodes less than x come before nodes greater than or equal to x

Remove all duplicate values from a sorted linked list

Remove the nth node from the end of a linked list in one pass

Reorder a linked list by interleaving nodes from the beginning and end

Reverse a singly linked list in-place

Reverse every k consecutive nodes in a linked list

Rotate a linked list to the right by k places

Sort a linked list in O(n log n) time using constant extra space

Swap every two adjacent nodes in a linked list