A linked list is a relatively simple data structure because problems based on it are very well known and give away the hint that you have to use a linked list.
In this lesson, we will understand the recursive nature of the linked list and how it is implemented in Java. The lesson is divided into three parts, in the first part, we work on problems which require traversal of the list but no modification. In the second part, we solve problems that require modification of the list. In the last part, we solve problems that involve working with more than one list.
- Find the length of linked
- Find the middle of the linked list
- Nth node from the end
- Loop in a linked list
- Is linked list palindrome?
- Reverse a linked list
- Reverse two nodes in a linked list
- Reverse K alternate nodes
- Add one to a linked list
- Merge two sorted linked lists
- Merge K sorted linked lists
- Add two numbers represented by linked lists