6 Linked List

Major:
Remove Nth Node From End of List
Partition List
Remove Duplicates from Sorted List II
Convert Sorted List to Balanced BST
Copy List Wirh Random Pointer
Merge k Sorted Lists
Reorder List
Sort List
Reverse Linked List II
Linked List Cycle II
Minor:
Middle of Linked List (ladder) Remove Linked List Elements
Remove Duplicates from Unsorted List (ladder) Swap Nodes in Pairs
Delete Node in the Middle of Singly Linked List
Insertion Sort List
Add Two Numbers
Nth to Last Node in List
Merge Two Sorted Lists
Remove Duplicates from Sorted List
Reverse Linked List
Swap Two Nodes in Linked List
Add Two Numbers II (Ladder) Palindrome Linked List
Convert Binary Search Tree to Doubly Linked List (Ladder) Rotate List
Linked List Cycle
Reverse Nodes in k-Group