Introduction to Singly Linked List

Learn more about Singly Linked List in DSA Self Paced Course

What is Singly Linked List?

A singly linked list is a linear data structure in which the elements are not stored in contiguous memory locations and each element is connected only to its next element using a pointer.

Singly Linked List

Topics:

Introduction:

1. Introduction to Linked List
2. Singly Linked List Tutorial
3. Singly Linked List definition & meaning DSA
4. Linked List vs Array

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

Some Problems on Singly Linked List:

• Easy Problems:
  1. Identical Linked Lists
  2. Print the middle of a given linked list
  3. Write a function to get Nth node in a Linked List
  4. Nth node from the end of a Linked List
  5. Move last element to front of a given Linked List
  6. Make middle node head in a linked list
  7. Delete alternate nodes of a Linked List
  8. Add 1 to a number represented as linked list
  9. Add two numbers represented by linked lists
  10. Subtract Two Numbers represented as Linked Lists
  11. Find the sum of last n nodes of the given Linked List
  12. Pairwise swap elements of a given linked list
  13. Remove every k-th node of the linked list
  14. Remove duplicates from a sorted linked list
• Intermediate Problems:
  1. Detect loop in a linked list
  2. Find length of loop in linked list
  3. Function to check if a singly linked list is palindrome
  4. Remove duplicates from an unsorted linked list
  5. Remove all occurrences of duplicates from a sorted Linked List
  6. Swap nodes in a linked list without swapping data
  7. Intersection point of two Linked Lists.
  8. Iteratively Reverse a linked list using only 2 pointers (An Interesting Method)
  9. Segregate even and odd nodes in a Linked List
  10. Alternate Odd and Even Nodes in a Singly Linked List
  11. Rearrange a Linked List in Zig-Zag fashion
  12. Adding two polynomials using Linked List
  13. Union and Intersection of two Linked Lists
  14. Sort linked list which is already sorted on absolute values
• Hard Problems:
  1. Reverse a Linked List in groups of given size
  2. Flattening a Linked List
  3. Reverse alternate K nodes in a Singly Linked List
  4. Alternating split of a given Singly Linked List
  5. Delete nodes which have a greater value on right side
  6. Given a linked list of line segments, remove middle points
  7. Clone a linked list with next and random pointer
  8. Rearrange a given linked list in-place.
  9. Select a Random Node from a Singly Linked List
  10. In-place Merge two linked lists without changing links of first list
  11. Length of longest palindrome list in a linked list using O(1) extra space
  12. Rotate Linked List block wise
  13. Count rotations in sorted and rotated linked list

Quick Links :

• ‘Practice Problems’ on Linked List
• ‘Videos’ on Linked List
• ‘Quizzes’ on Linked List
• Ask a Question on ‘Linked List’