DSA + Algo
A kind of Question bank for my interview prep
- Insertion in Linked list (beginning,middle,end)
- Delete (Beg, mid, end)
- Swap nodes in linked list
- Rotate Linked list
- Find loop in linked list
- Detect and remove loop in linked list
- flattening-a-linked-list
- Merge two sorted linked lists
- Intersection of linked list
- Implement a stack using single linked list
- find the middle of the linked list
- Add two numbers represented by linked lists
- Reverse a linked list
- Reverse a Linked List in groups of given size
- Delete alternate nodes of a Linked List
- Delete without head pointer
- Reverse Nodes in k-Group
- Remove Duplicates from Sorted List
- Design Linked List