MulticoreWare Interview Question
Linked list implementation and delete the middle the given nod within O(n) complexity
Interview Answer
Anonymous
Jan 17, 2021
Have a current pointer and previous pointer then if u find the nod then put next nod address in previous nod data