Here are a list of problems that are commonly asked in tech interviews:
- Basic operations:
- Create a linked list
- Add a node at beginning
- Add a node at end
- Add a node at given index
- Get length of linked list
- Delete linked list
- Delete a node at a given index
- Find the index of a the given value
- Print linked list
- Find the Middle of the Linked List
- Reverse the linked list (iterative approach)
- Find the nth node of the linked list
- Check if the linked list has a cycle
- Return the element at which the cycle starts