How to find the middle node in linked list.
Sigiloso
I told that i will take 2 pointers (slow and fast). Slow pointer will be incremented at one step and fast pointer will be incremented by 2 steps. When fast pointer reaches end, slow pointer will be pointing to middle of the linked list.