Linked List Questions - Reverse in K Group and Check if Circular

Dive into an in-depth tutorial on solving two important Linked List problems: reversing a Linked List in K groups and checking if a Linked List is circular. Learn step-by-step approaches, algorithms, and code implementations for both questions. Follow along with dry runs, time and space complexity analyses, and explore multiple solution strategies. Gain valuable insights into tackling these common data structure challenges, with additional resources and homework provided to reinforce your understanding.

- Introduction
- Question 1 - Reverse LL in k order
- Promotion
- Approach
- Algorithm
- Dry Run
- Code
- Dry Run again
- Time and Space Complexity of Approach
- Question 2 - Circular List or Not
- Approach #1
- Code
- Time and Space Complexity of Approach #1
- Approach #2
- Time and Space Complexity of Approach #2
- Homework