Remember this pattern for problems that require middle finding in a Linked List.
For those who read it, I wish you good luck and all the best for your interviews.\n\nclass Solution {\npublic:\n    ListNode* middleNode(ListNode* head) {\n\n  
For those who read it, I wish you good luck and all the best for your interviews.\n```\nclass Solution {\npublic:\n    ListNode* middleNode(ListNode* head) {\n\n        ListNode* fast = head;\n        ListNode* slow = fast;\n\n        while (fast && fast->next) {\n            slow = slow->next;\n            fast = fast->next->next;\n        }\n\n        return slow;        \n    }\n};\n\n\n```
[]