Linked List Algorithm Implementations (Intermediate)

[Abhijit2505]

Here is a list of algorithmic implementations using a linked list,

• Design Linked List -
• Rotate List -
• Insert Into a Sorted Circular Linked List -
• Add Two Numbers -
• Remove Nth Node From End of List -
• Copy List with Random Pointer -
• Remove Duplicates From The Sorted List (Second Version) -
• Reorder List -
• Linked List Cycle (Second Version) -
• Reverse Linked List (Second Version) -
• Linked List In Binary Tree -
• Insertion Sort List -
• Remove Zero-Sum Consecutive Nodes from Linked List -
• Partition List -
• Sort List -
• Design Phone Directory -
• Convert Sorted List to Binary Search Tree -
• Swap Nodes in Pairs -
• Split Linked List in Parts -
• Add Two Numbers(Second Version) -
• Flatten a Multilevel Doubly Linked List -
• Odd-Even Linked List -
• Linked List Components -
• Next Greater Node in Linked List -
• Plus One Linked List -
• Convert Binary Search Tree to Sorted Doubly Linked List -

Work upon these algorithms are going on.

[Devansu-Yadav]

Hi there! I found this Project on FOSS United Foundation's FOSS HACK 2020 event website. I have the read the Documentation and I wanted to contribute to the Sorting Algorithms and its Visualization as mentioned on the Documentation under the section saying "Algorithms Yet to Publish".