1. Data Structure and Algorithm Mastery

    • Buy now
    • Learn more
    • Discussions
  2. Arrays

    • Arrays Basics
  3. Binary Search

    • Binary Search Introduction
    • Binary Search Application
  4. LinkedList

    • Linked List Implementation and Operations
    • Linked List Reverse in groups
  5. Hashing

    • Hashing
  6. Heaps

    • Heap tree implementation
    • Median in a stream
  7. Stacks And Queues

    • Stacks Introduction
    • Sum Subarray Ranges
    • Queues
  8. Sliding Window

    • Sliding window Intro
    • Sliding window Advanced
  9. Graphs and trees

    • Basics for Graph and Tree
    • Binary Tree
    • BFS on Graph
    • Topological sorting
    • BFS On Grid
    • Union Find and MST
    • Dijkstra On Graph
    • Minimum Cost to Reach Destination in Time
    • Topological Sorting with DFS
  10. Backtracking

    • Backtracking Inclusion Exclusion
    • Rat in a Maze
  11. Dynamic programming

    • Dynamic Programming Inclusion exclusion
    • Matrix chain multiplication
    • Arithmetic Slices
  12. Trie

    • Trie Operations and Applications
  13. Intervals

    • Merge and Insert Intervals
  14. Greedy

    • Greedy approch
  15. Special Topics

    • Segment Tree
    • KMP
  1. Products
  2. Course
  3. Section
  4. Lesson

Linked List Reverse in groups

  1. Data Structure and Algorithm Mastery

    • Buy now
    • Learn more
    • Discussions
  2. Arrays

    • Arrays Basics
  3. Binary Search

    • Binary Search Introduction
    • Binary Search Application
  4. LinkedList

    • Linked List Implementation and Operations
    • Linked List Reverse in groups
  5. Hashing

    • Hashing
  6. Heaps

    • Heap tree implementation
    • Median in a stream
  7. Stacks And Queues

    • Stacks Introduction
    • Sum Subarray Ranges
    • Queues
  8. Sliding Window

    • Sliding window Intro
    • Sliding window Advanced
  9. Graphs and trees

    • Basics for Graph and Tree
    • Binary Tree
    • BFS on Graph
    • Topological sorting
    • BFS On Grid
    • Union Find and MST
    • Dijkstra On Graph
    • Minimum Cost to Reach Destination in Time
    • Topological Sorting with DFS
  10. Backtracking

    • Backtracking Inclusion Exclusion
    • Rat in a Maze
  11. Dynamic programming

    • Dynamic Programming Inclusion exclusion
    • Matrix chain multiplication
    • Arithmetic Slices
  12. Trie

    • Trie Operations and Applications
  13. Intervals

    • Merge and Insert Intervals
  14. Greedy

    • Greedy approch
  15. Special Topics

    • Segment Tree
    • KMP

Reverse Nodes in k-Group - https://leetcode.com/problems/reverse-nodes-in-k-group/description/

Solution - https://leetcode.com/problems/reverse-nodes-in-k-group/solutions/6302949/readable-and-divided-into-methods-by-aks-7znu

Merge Sort for Linked List - https://www.geeksforgeeks.org/problems/sort-a-linked-list/1

Solution - https://discuss.geeksforgeeks.org/comment/856afe94-9ebd-4137-ac32-f5fc77d2e800/practice

Sort an Array - https://leetcode.com/problems/sort-an-array/description/

Solution - https://leetcode.com/problems/sort-an-array/solutions/5130465/readable-and-moduler-heap-implmentation/