Review: Linked List Problems Posted on January 22, 2018September 3, 2019 by braindenny Linked List demands skills of managing pointers very well. Most problems are not that hard for you to solve. But to get bug-free, you need to think it through. Key Points: Add a dummyNode, if head node might be changed How to process current node? Make sure the pointers are in-order How to move to next node? If you have changed the original node, the next pointer might not be what you want Whether we need to maintain the previous node? Common Problems: Insert a Node in Sorted List Remove a Node from Linked List 3. Reverse a Linked List Merge Two Linked Lists Find the Middle of a Linked List The most impressive problems to me: Sort List See all linkedlist problems: #linkedlist Review: Linked List ProblemsLintCode: Middle of Linked ListLintCode: Insert Node in Sorted Linked ListLintCode: Find Node in Linked ListLintCode: Count Linked List NodesLintCode: Convert Linked List to Array ListLintCode: Convert Array List to Linked ListLeetcode: Swap Nodes in PairsLeetcode: Split Linked List in PartsLeetcode: Split Array Largest SumLeetcode: Sort ListLeetcode: Rotate ListLeetcode: RLE IteratorLeetcode: Reverse Nodes in k-GroupLeetcode: Reverse Linked List IILeetcode: Reverse Linked ListLeetcode: Reorder ListLeetcode: Remove Zero Sum Consecutive Nodes from Linked ListLeetcode: Remove Nth Node From End of ListLeetcode: Remove Linked List ElementsLeetcode: Remove Duplicates from Sorted List IILeetcode: Remove Duplicates from Sorted ListLeetcode: Prison Cells After N DaysLeetcode: Print Immutable Linked List in ReverseLeetcode: Plus One Linked ListLeetcode: Partition ListLeetcode: Palindrome Linked ListLeetcode: Odd Even Linked ListLeetcode: Numbers At Most N Given Digit SetLeetcode: Nth Magical NumberLeetcode: Middle of the Linked ListLeetcode: Merge Two Sorted ListsLeetcode: Merge k Sorted ListsLeetcode: Linked List Cycle IILeetcode: Linked List CycleLeetcode: Linked List ComponentsLeetcode: LFU CacheLeetcode: Intersection of Two Linked ListsLeetcode: Insertion Sort ListLeetcode: Insert into a Cyclic Sorted ListLeetcode: Flip Columns For Maximum Number of Equal RowsLeetcode: Flatten Binary Tree to Linked ListLeetcode: Flatten a Multilevel Doubly Linked ListLeetcode: Exam RoomLeetcode: Design Linked ListLeetcode: Delete Node in a Linked ListLeetcode: Delete Columns to Make Sorted IILeetcode: Copy List with Random PointerLeetcode: Convert Binary Search Tree to Sorted Doubly Linked ListLeetcode: Bag of TokensLeetcode: Add Two Numbers IILeetcode: Add Two Numbers See more blog_posts. Post Views: 9