Linked List - DSA

By take U forward

Master linked list data structures from scratch to tackle rigorous technical interviews at top-tier product companies. This comprehensive guide covers fundamental operations, doubly linked lists, and advanced algorithmic patterns like cycle detection and pointer manipulation using language-independent pseudocode.

Table of Contents

Linked List - DSA

Table of Contents

Paid LinkedList Bootcamp - Launch Video

L1. Introduction to LinkedList | Traversal | Length | Search an Element

L2. Deletion and Insertion in LL | 8 Problems

L3. Introduction to Doubly LinkedList | Insertions and Deletions

L4. Reverse a DLL | Multiple Approaches

L5. Add 2 numbers in LinkedList | Dummy Node Approach

L6. Odd Even Linked List | Multiple Approaches

L7. Sort a LinkedList of 0's, 1's and 2's | Multiple Approaches

L8. Remove Nth Node from the end of the LinkedList | Multiple Approaches

L9. Reverse a LinkedList | Iterative and Recursive

L10. Check if a LinkedList is Palindrome or Not | Multiple Approaches

L11. Add 1 to a number represented by LinkedList

L12. Find the intersection point of Y LinkedList

L13. Find the middle element of the LinkedList | Multiple Approaches

L14. Detect a loop or cycle in LinkedList | With proof and Intuition

L15. Find the length of the Loop in LinkedList

L16. Delete the middle node of the LinkedList

L17. Find the starting point of the Loop/Cycle in LinkedList | Multiple Approaches

L18. Delete all occurrences of a Key in DLL

L19. Find all Pairs with given Sum in DLL

L20. Remove duplicates from sorted DLL

L21. Reverse Nodes in K Group Size of LinkedList

L22. Rotate a LinkedList

L23. Merge two sorted Linked Lists

L24. Flattening a LinkedList | Multiple Approaches with Dry Run

L25. Merge K Sorted Lists | Multiple Approaches

L26. Sort a Linked List | Merge Sort and Brute Force

L27. Clone a LinkedList with Next and Random Pointers | Copy List with Random Pointers

L28. Design a Browser History | LinkedList Implementation