Getting everything ready for you…

Loading courses, problems and your progress. This takes just a moment.

0s

Courses › DSA

Linked List Series

By take U forward · English · Beginner

Singly, doubly and circular linked lists with interview problems.

A free YouTube playlist, organised on Codify: your progress is saved, you can take timestamped notes and practise in the code editor under every video. All videos belong to their creator.

What this course covers (29 videos)

  1. Paid LinkedList Bootcamp - Launch Video (9:41)
  2. L1. Introduction to LinkedList | Traversal | Length | Search an Element (45:17)
  3. L2. Deletion and Insertion in LL | 8 Problems (56:30)
  4. L3. Introduction to Doubly LinkedList | Insertions and Deletions (1:04:07)
  5. L4. Reverse a DLL | Multiple Approaches (18:30)
  6. L5. Add 2 numbers in LinkedList | Dummy Node Approach (14:48)
  7. L6. Odd Even Linked List | Multiple Approaches (24:05)
  8. L7. Sort a LinkedList of 0's, 1's and 2's | Multiple Approaches (23:23)
  9. L8. Remove Nth Node from the end of the LinkedList | Multiple Approaches (16:23)
  10. L9. Reverse a LinkedList | Iterative and Recursive (32:42)
  11. L10. Check if a LinkedList is Palindrome or Not | Multiple Approaches (20:02)
  12. L11. Add 1 to a number represented by LinkedList (25:28)
  13. L12. Find the intersection point of Y LinkedList (32:05)
  14. L13. Find the middle element of the LinkedList | Multiple Approaches (14:37)
  15. L14. Detect a loop or cycle in LinkedList | With proof and Intuition (20:26)
  16. L15. Find the length of the Loop in LinkedList (14:01)
  17. L16. Delete the middle node of the LinkedList (16:36)
  18. L17. Find the starting point of the Loop/Cycle in LinkedList | Multiple Approaches (22:42)
  19. L18. Delete all occurrences of a Key in DLL (11:13)
  20. L19. Find all Pairs with given Sum in DLL (14:14)
  21. L20. Remove duplicates from sorted DLL (12:53)
  22. L21. Reverse Nodes in K Group Size of LinkedList (24:31)
  23. L22. Rotate a LinkedList (12:10)
  24. L23. Merge two sorted Linked Lists (18:55)
  25. L24. Flattening a LinkedList | Multiple Approaches with Dry Run (32:58)
  26. L25. Merge K Sorted Lists | Multiple Approaches (30:02)
  27. L26. Sort a Linked List | Merge Sort and Brute Force (22:11)
  28. L27. Clone a LinkedList with Next and Random Pointers | Copy List with Random Pointers (33:00)
  29. L28. Design a Browser History | LinkedList Implementation (14:38)

More DSA courses