Practice Problems
1. Basic Operations on Linked List
- Reverse a Linked List
- Middle of the Linked List
- Length of Linked List
- Delete Node in a Linked List
- Swap Nodes in Pairs
- Rotate List
2. Two Pointer Technique
- Linked List Cycle
- Intersection of Two Linked Lists
- Remove N-th Node from End
- Linked List Cycle II
- Split Linked List in Parts
3. Linked List Merging
4. Circular Linked List
- Linked List Cycle
- Split Circular List
- Find the Winner of the Circular Game
- Sorted insert for circular linked list
5. Doubly Linked List
6. Advanced Linked List Problems
- Convert Binary in Linked List to Integer
- Copy List with Random Pointer
- Flatten a Linked List
- LRU Cache
- Reverse Nodes in k-Group
7. Palindrome Linked List
Track Your Progress
Done with this topic? Mark it as complete to track your progress.
💬 Discuss this page
Have a question or spot something confusing in "Practice Problems"? Ask below — it's backed by GitHub Discussions, so maintainers get notified like any other GitHub activity.