Middle Of Linked List: Java Simple Solution With 2 Pointer Approach
\nclass Solution {\n    public ListNode middleNode(ListNode head) {\n        ListNode fast = head, slow = head;\n        while(fast != null && fast.next != null
```\nclass Solution {\n    public ListNode middleNode(ListNode head) {\n        ListNode fast = head, slow = head;\n        while(fast != null && fast.next != null){\n            slow = slow.next;\n            fast = fast.next.next;\n        }\n        return slow;\n    }\n}\n```\n\nIf it helped, please UPVOTE. Happy Coding and keep up the good work.\nFeel free to give your suggestions or correct me in the comments.\nThanks for reading.\uD83D\uDE43
['Two Pointers', 'Java']