Linked List Questions - Reverse in K Group and Check if Circular
Offered By: CodeHelp - by Babbar via YouTube
Course Description
Overview
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.
Syllabus
- 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
Taught by
CodeHelp - by Babbar
Related Courses
Introduction to Computing 计算概论APeking University via Coursera Data Structures and Performance
University of California, San Diego via Coursera Foundations of Data Structures
Indian Institute of Technology Bombay via edX Algorithms and Data Structures
Microsoft via edX Data Structures and Design Patterns for Game Developers
University of Colorado System via Coursera