Linked List

class ListNode:
    def __init__(self, val):
        self.val = val
        self.next = None

Problems

• 2. Add Two Numbers
• 19. Remove Nth Node From End of List
• 21. Merge Two Sorted Lists
• 23. Merge k Sorted Lists
• 82. Remove Duplicates from Sorted List II
• 83. Remove Duplicates from Sorted List
• 86. Partition List
• 92. Reverse Linked List II
• 108. Convert Sorted Array to Binary Search Tree
• 109. Convert Sorted List to Binary Search Tree
• 138. Copy List with Random Pointer
• 141. Linked List Cycle
• 142. Linked List Cycle II
• 143. Reorder List
• 148. Sort List
• 160. Intersection of Two Linked Lists
• 206. Reverse Linked List
• 234. Palindrome Linked List
• 445. Add Two Numbers II