Striver's Linked List Playlist: study plan and how long it takes
The take U forward playlist is 29 videos and 11.6 hours long. Here's how long it takes at different paces, a week-by-week schedule built from the real videos, and a planner that turns it into your own daily plan.
29 videos · 11.6 hours · take U forward
This take U forward playlist covers singly and doubly linked lists from insertion and deletion to the classic interview problems: reversing, detecting and measuring loops, the intersection of two lists, adding numbers, reversing in k-groups, flattening, sorting and cloning lists with random pointers.
The first video is a launch announcement; the lessons start at video 2.
Who it's for: Students preparing for coding interviews who want to get every standard linked list problem down.
How long does it take?
The full playlist is 11.6 hours across 29 videos. Here's roughly how many days that is at different daily watch times and speeds, counting video time only:
| Daily time | At 1x | At 1.5x | At 2x |
|---|---|---|---|
| 30 min a day | 24 days | 16 days | 12 days |
| 1 h a day | 12 days | 8 days | 6 days |
| 2 h a day | 6 days | 4 days | 3 days |
Make your own schedule
The playlist link is already filled in. Press Plan, set how much time you have each day and your speed, and you'll get a day-by-day schedule with a finish date and a calendar file. It reads the live playlist, so new videos are included.
Week-by-week schedule
A sample plan at 1 hour a day and normal speed, using whole videos so none is split across days. That's 2 weeks in total. For a different pace, start date or speed, use the planner above.
Week 1Videos 1–13 · 6h 23m
Day 1 · 55m
- 1Paid LinkedList Bootcamp - Launch Video10m
- 2L1. Introduction to LinkedList | Traversal | Length | Search an Element45m
Day 2 · 57m
- 3L2. Deletion and Insertion in LL | 8 Problems57m
Day 3 · 1h 4m
- 4L3. Introduction to Doubly LinkedList | Insertions and Deletions1h 4m
Day 4 · 57m
- 5L4. Reverse a DLL | Multiple Approaches19m
- 6L5. Add 2 numbers in LinkedList | Dummy Node Approach15m
- 7L6. Odd Even Linked List | Multiple Approaches24m
Day 5 · 40m
- 8L7. Sort a LinkedList of 0's, 1's and 2's | Multiple Approaches23m
- 9L8. Remove Nth Node from the end of the LinkedList | Multiple Approaches16m
Day 6 · 53m
- 10L9. Reverse a LinkedList | Iterative and Recursive33m
- 11L10. Check if a LinkedList is Palindrome or Not | Multiple Approaches20m
Day 7 · 58m
- 12L11. Add 1 to a number represented by LinkedList25m
- 13L12. Find the intersection point of Y LinkedList32m
Week 2Videos 14–29 · 5h 15m
Day 8 · 49m
- 14L13. Find the middle element of the LinkedList | Multiple Approaches15m
- 15L14. Detect a loop or cycle in LinkedList | With proof and Intuition20m
- 16L15. Find the length of the Loop in LinkedList14m
Day 9 · 51m
- 17L16. Delete the middle node of the LinkedList17m
- 18L17. Find the starting point of the Loop/Cycle in LinkedList | Multiple Approaches23m
- 19L18. Delete all occurrences of a Key in DLL11m
Day 10 · 52m
- 20L19. Find all Pairs with given Sum in DLL14m
- 21L20. Remove duplicates from sorted DLL13m
- 22L21. Reverse Nodes in K Group Size of LinkedList25m
Day 11 · 31m
- 23L22. Rotate a LinkedList12m
- 24L23. Merge two sorted Linked Lists19m
Day 12 · 33m
- 25L24. Flattening a LinkedList | Multiple Approaches with Dry Run33m
Day 13 · 52m
- 26L25. Merge K Sorted Lists | Multiple Approaches30m
- 27L26. Sort a Linked List | Merge Sort and Brute Force22m
Day 14 · 48m
- 28L27. Clone a LinkedList with Next and Random Pointers | Copy List with Random Pointers33m
- 29L28. Design a Browser History | LinkedList Implementation15m
Tips for finishing
- Skip video 1 (the announcement) by ticking it off in the playlist length calculator, and the planner will leave it out.
- Draw the pointers for every problem. Most linked list bugs are pointer updates done in the wrong order.