OJ
Ctrlk
  • Introduction
  • Some Tips
  • strStr and Coding Style
  • Binary Search
  • Binary Tree & Divide Conquer
  • Dynamic Programming I
  • Dynamic Programming II
  • Linked List
    • 203. Remove Linked List Elements
    • Delete Node in a Linked List
    • Partition List
    • Copy List with Random Pointer
    • Merge k Sorted Lists
    • 148. Sort List
    • Delete Node in a Linked List
    • Merge Two Sorted Lists
    • Add Two Numbers II
    • Swap Nodes in Pairs
    • 2 Pointers with One First Moved N Steps
    • Selection Sort List
    • Insertion Sort List
    • 708. Insert into a Cyclic Sorted List
    • 430. Flatten a Multilevel Doubly Linked List
    • Reverse List
      • 25. Reverse Nodes in k-Group
      • Reverse Linked List
      • Reverse Linked List II
      • Palindrome Linked List
      • Reorder List
    • Remove Nodes
    • 876. Middle of the Linked List
    • Linked List Cycle
    • Split Linked List in Parts
  • Array & Numbers
  • Heap
  • Hash
  • Multiple Pointers
  • Stack
  • Breadth-first Search
  • Bit Manipulation
  • Math
  • Trie
  • Graph
  • Union Find
  • Exhaustive Search
  • String
  • Greedy
  • Design
  • Queue
Powered by GitBook
On this page

Was this helpful?

  1. Linked List

Reverse List

25. Reverse Nodes in k-GroupReverse Linked ListReverse Linked List IIPalindrome Linked ListReorder List
Previous430. Flatten a Multilevel Doubly Linked ListNext25. Reverse Nodes in k-Group

Last updated 6 years ago

Was this helpful?