😀
OJ Practices
Ctrlk
  • Introduction
  • Leetcode
    • Tree
    • Dynamic Programming
    • Depth-First-Search
    • Breadth-First Search
    • Two Pointers
    • Linked List
      • 2 Add Two Numbers
      • 19 Remove Nth Node From End of List
      • 21 Merge Two Sorted Lists
      • 23 Merge k Sorted Lists
      • 24 Swap Nodes in Pairs
      • 25 Reverse Nodes in k-Group
      • 61 Rotate List
      • 82 Remove Duplicates from Sorted List II
      • 83 Remove Duplicates from Sorted List
      • 86 Partition List
      • 92 Reverse Linked List II
      • 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
      • 147 Insertion Sort List
      • 148 Sort List
      • 160 Intersection of Two Linked Lists
      • 203 Remove Linked List Elements
      • 206 Reverse Linked List
      • 234 Palindrome Linked List
      • 237 Delete Node in a Linked List
      • 328 Odd Even Linked List
      • 369 Plus One Linked List
      • 379 Design Phone Directory
      • 426 Convert Binary Search Tree to Sorted Doubly Linked List
      • 430 Flatten a Multilevel Doubly Linked List
      • 445 Add Two Numbers II
      • 707 Design Linked List
      • 708 Insert into a Cyclic Sorted List
      • 725 Split Linked List in Parts
      • 817 Linked List Components
      • 876 Middle of the Linked List
    • Backtracking
    • Binary Search
    • Union Find
    • Trie
    • Sort
    • Heap
    • Randomness
    • Topological Sort
    • Stack
    • Hash Table
Powered by GitBook
On this page

Was this helpful?

  1. Leetcode

Linked List

2 Add Two Numbers19 Remove Nth Node From End of List21 Merge Two Sorted Lists23 Merge k Sorted Lists24 Swap Nodes in Pairs25 Reverse Nodes in k-Group61 Rotate List82 Remove Duplicates from Sorted List II83 Remove Duplicates from Sorted List86 Partition List92 Reverse Linked List II109 Convert Sorted List to Binary Search Tree138 Copy List with Random Pointer141 Linked List Cycle142 Linked List Cycle II143 Reorder List147 Insertion Sort List148 Sort List160 Intersection of Two Linked Lists203 Remove Linked List Elements206 Reverse Linked List234 Palindrome Linked List237 Delete Node in a Linked List328 Odd Even Linked List369 Plus One Linked List379 Design Phone Directory426 Convert Binary Search Tree to Sorted Doubly Linked List430 Flatten a Multilevel Doubly Linked List445 Add Two Numbers II707 Design Linked List708 Insert into a Cyclic Sorted List725 Split Linked List in Parts817 Linked List Components876 Middle of the Linked List
Previous457 Circular Array LoopNext2 Add Two Numbers

Last updated 5 years ago

Was this helpful?