Delete the middle node of a linked list | Leetcode | Medium | Java
This question can be done using multiple approaches. Two of them are:
1) Iterating and finding the length and then finding the index of the middle node by dividing it by 2
2) Using slow and fast pointers.
Second approach is better as it causes pointers to iterate over the list only once.
Link to the problem: https://leetcode.com/problems/delete-...