| sr. no | Problem Statement | Solution | Difficulty | Time Complexity | Space Complexity |
|---|---|---|---|---|---|
| 1 | Intersection of two Linked List | Intersection of two Linked List | Easy | O(n) | O(1) |
| 2 | Remove Linked List elements | Remove Linked List elements | Easy | O(n) | O(1) |
| 3 | Convert Binary Number in a Linked List to Integer | Convert Binary Number in a Linked List to Integer | Easy | O(n) | O(1) |
| 4 | Delete Node in a Linked List | Delete Node in a Linked List | Easy | O(1) | O(1) |
| 5 | Linked List Cycle II | Linked List Cycle II | medium | O(n) | O(1) |
| 6 | Linked List Cycle | Linked List Cycle | Easy | O(n) | O(1) |
| 7 | Merge Two Sorted Lists | Remove Linked List elements | Easy | O(n) | O(1) |