LinkedLists and related Algorithmic Problems in Python
- Linked List - Description and Basic Implementation
- Linked List Insertion
- Print Formatted List
- Delete Node - First occurence of a key
- Delete Node - At a given index assuming list to be 0-indexed
- Delete All Nodes
- Size of Linked List
- Print reverse of a list
- Search in Linked List
- Get Nth Node in a Linked List
- Get Nth Node from End
- Find Middle Node
- Number of times a key occurs in Linked List
- Detect Loop in Linked List
- Find length of loop
- Check if Linked List is palindrome - Stack Based solution
- Remove duplicate nodes from a sorted list
- Remove duplicate nodes from an unsorted list
- Pairwise swap elements in a linked list
- Swap nodes by changing links
- Move last node to front in a linked list and vice versa
- Check is two linked list intersects at some common node
- Find intersection point of two linked list - Difference in length based solution
- Intersection of two sorted lists
- Segregate even and odd nodes in a linked list
- Reverse a linked list
- Check if Linked List is palindrome - List reversal based solution
- Find intersection point of two linked list - List reversal based solution
- Merge two sorted lists
- Reverse list in group of size k - I
- Reverse list in group of size k - II
- Reverse alternate k nodes in a list
- Alternate Odd and Even Nodes
- Delete alternate nodes from a linked list
- Alternate splitting of linked list
- Check if lists are identical
- Delete node if there is a greater element on right side
Gitpod