Linked List and its Types - Singly, Doubly, Circular with Implementation and Problems

Learn comprehensive linked list concepts and problem-solving techniques through this 8-hour programming course designed for technical interview preparation. Master fundamental linked list types including singly, doubly, and circular linked lists, then advance to complex operations like reversing linked lists, finding middle elements, and detecting cycles. Practice essential algorithms including reversing linked lists in K groups, loop detection and removal, duplicate removal from sorted and unsorted lists, and merging sorted linked lists. Develop skills in advanced problems such as palindrome checking, adding numbers represented as linked lists, cloning linked lists with random pointers, and implementing merge sort on linked lists, with detailed approach discussions and optimized implementations for each topic.

Syllabus

Lecture 44: Linked List & its types - Singly, Doubly, Circular etc.
Lecture 45: Linked List Questions: Reverse LL and find Middle of LL
Lecture 46: Linked List Questions: Reverse LL in "K group" && Check LL is Circular or not
Lecture47: Detect & Remove Loop in Linked List [Approach Discussion + Optimised Implementation]
Lecture 48: Remove Duplicates from a Sorted/UnSorted Linked List
Lecture 49: Merge 2 Sorted Linked Lists || Sort 0s, 1s and 2s in Linked List
Lecture 50: Check Palindrome in Linked List || C++ Placement Course
Lecture 51: Add 2 Numbers represented by Linked Lists || C++ Placement Course
Lecture 52: Clone a Linked List with Random Pointers || C++ Placement Course
Lecture 53: Merge Sort in Linked List [ Theory + Implementation ]