Linked List Data Structure

Learn more about Linked List in DSA Self Paced Course
Practice Problems on Linked List
Recent Articles on Linked List

What is Linked List

A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers as shown in the below image:

In simple words, a linked list consists of nodes where each node contains a data field and a reference(link) to the next node in the list.

Topics :

Introduction:

1. What is Linked List
2. Introduction to Linked List – Data Structure and Algorithm Tutorials
3. Applications, Advantages and Disadvantages of Linked List
4. Linked List vs Array

Types of Linked List:

1. Introduction and Insertion in a Doubly Linked List
2. Introduction to Circular Linked List
3. Circular Singly Linked List
4. Insertion in Doubly Circular Linked List
5. Types of Linked List

Basic Operations:

1. Linked List Insertion
2. Search an element in a Linked List (Iterative and Recursive)
3. Find Length of a Linked List (Iterative and Recursive)
4. Reverse a linked list
5. Linked List Deletion (Deleting a given key)
6. Linked List Deletion (Deleting a key at given position)
7. Write a function to delete a Linked List
8. Write a function to get Nth node in a Linked List
9. Nth node from the end of a Linked List

Standard problem on Linked List:

• Easy:
  1. Print the middle of a given linked list
  2. Write a function that counts the number of times a given int occurs in a Linked List
  3. Check if a linked list is Circular Linked List
  4. Count nodes in Circular linked list
  5. Convert singly linked list into circular linked list
  6. Exchange first and last nodes in Circular Linked List
  7. Reverse a Doubly Linked List
  8. Program to find size of Doubly Linked List
  9. An interesting method to print reverse of a linked list
  10. Can we reverse a linked list in less than O(n)?
  11. Circular Linked List Traversal
  12. Delete a node in a Doubly Linked List
  13. Reverse a Doubly Linked List
• Medium:
  1. Detect loop in a linked list
  2. Find length of loop in linked list
  3. Remove duplicates from a sorted linked list
  4. Intersection of two Sorted Linked Lists
  5. QuickSort on Singly Linked List
  6. Split a Circular Linked List into two halves
  7. Deletion from a Circular Linked List
  8. Convert singly linked list into circular linked list
  9. The Great Tree-List Recursion Problem.
  10. Merge Sort for Doubly Linked List
  11. Find pairs with given sum in doubly linked list
  12. Insert value in sorted way in a sorted doubly linked list
  13. Remove duplicates from an unsorted doubly linked list
  14. Rotate Doubly linked list by N nodes
  15. Given only a pointer to a node to be deleted in a singly linked list, how do you delete it?
  16. Modify contents of Linked List
• Hard:
  1. Detect loop in a linked list
  2. Intersection point of two Linked Lists.
  3. Circular Queue | Set 2 (Circular Linked List Implementation)
  4. Josephus Circle using circular linked list
  5. The Great Tree-List Recursion Problem.
  6. Copy a linked list with next and arbit pointer
  7. Convert a given Binary Tree to Doubly Linked List | Set
  8. Priority Queue using doubly linked list
  9. Reverse a doubly linked list in groups of given size
  10. Reverse a stack without using extra space in O(n)
  11. Linked List representation of Disjoint Set Data Structures
  12. Sublist Search (Search a linked list in another list)
  13. Construct a linked list from 2D matrix
  14. Partitioning a linked list around a given value and If we don’t care about making the elements of the list “stable”

Quick Links :

• ‘Practice Problems’ on Linked List
• ‘Videos’ on Linked List
• ‘Quizzes’ on Linked List

If you still need more assistance with your placement preparation, have a look at our Complete Interview Preparation Course. The course has been designed by our expert mentors to help students crack the coding interview of top product or service-based organizations . You get access to premium lectures, 200+ coding questions bank, resume building tips, and lifetime access to the course content. So to make sure that your next programming interview doesn’t feel like an interrogation, enroll in Complete Interview Preparation and give a boost to your placement preparation.

Recomended:

• Learn Data Structure and Algorithms | DSA Tutorial

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.