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
数据结构与算法第二部分 | Data Structures and Algorithms Part 2Peking University via edX 算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera Introduction to Automata, Languages and Computation
Indian Institute of Technology, Kharagpur via Swayam Data Structures & Algorithms I: ArrayLists, LinkedLists, Stacks and Queues
Georgia Institute of Technology via edX Learning Algorithms in JavaScript from Scratch
Udemy