# Category - Singly Linked List

## Cpp Algorithm – Remove duplicates from an unsorted linked list

Cpp Algorithm - Remove duplicates from an unsorted linked list - Linked List - Write a removeDuplicates() function which takes a list and deletes

## Java Algorithm – Remove duplicates from an unsorted linked list

Java Algorithm - Remove duplicates from an unsorted linked list - Linked List - Write a removeDuplicates() function which takes a list and deletes

## Cpp Programming-Merge two sorted linked lists such that merged list is in reverse order

Cpp Programming-Merge two sorted linked lists such that merged list is in reverse order-Linked list Given two linked lists sorted

## C Programming-Merge two sorted linked lists such that merged list is in reverse order

C Programming-Merge two sorted linked lists such that merged list is in reverse order-Linked list

## C Algorithm – Write a recursive function to print reverse of a Linked List

C Algorithm - Write a recursive function to print reverse of a Linked List - Linked List - Given a linked list, print reverse of it using

## Python Algorithm- Delete a Linked List node at a given position

Python Algorithm- Delete a Linked List node at a given position - Linked List If node to be deleted is root, simply delete it. To delete a middle node

## Generic Linked List in C

Generic Linked List in C - Linked List - Unlike C++ and Java, C doesn’t support generics. How to create a linked list in C that can be used.

## C++ Algorithm – Delete a Linked List node at a given position

C++ Algorithm - Delete a Linked List node at a given position - Linked List - If node to be deleted is root, simply delete it. To delete a middle node

## C Algorithm – Merge two sorted linked lists

C Algorithm - Merge two sorted linked lists - Linked List - Write a SortedMerge() function that takes two lists, each of which is sorted in increasing order

## Cpp Algorithm – Merge two sorted linked lists

C++ Algorithm - Merge two sorted linked lists - Linked List - Write a Sorted Merge() function that takes two lists, each of which is sorted in increasing

X