#tortoise-hare

LL 12 - Delete the middle node of Linked List

Problem You are given the head of a linked list. Delete the middle node, and return theheadof the modified linked list. (link) The middle node of a linked list of size n is the ⌊n / 2⌋^th node from the start using 0-based indexing, where ⌊x...