Please Login To Continue
Use of Two Pointers in Linked List
Lesson 5 of 9 • 6 upvotes • 9:49mins
Abhishek Kumar
This lesson is very important for interview preparation. This lesson aimed at explaining the use of two points to efficiently find the middle node and Nth node from last of a linked list.
In-depth Understanding of Linked List
9 lessons • 1h 22m
1
Understanding Linked List
8:41mins
2
Floyd Cycle Finding Algorithm 1
9:59mins
3
Floyd Cycle Finding Algorithm 2
10:00mins
4
Merge Two Sorted Linked List
9:10mins
5
Use of Two Pointers in Linked List
9:49mins
6
Josephus Circle Using Linked List
9:00mins
7
Memory Efficient Doubly Linked List (XOR List)
8:28mins
8
Reversing a Linked List (Iterative Method)
7:21mins
9
Quizzes Based On What We Have Learnt So Far
9:52mins
Crack CBSE Class 12 with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
