✅  [Java]  Easy Java Solution using Two Pointers
Runtime: 0 ms, faster than 100.00% of Java online submissions for Middle of the Linked List.\nIt is very easy to find the middle node of the linked list.\nSteps
**Runtime: 0 ms, faster than 100.00% of Java online submissions for Middle of the Linked List.**\nIt is very easy to find the middle node of the linked list.\nSteps:-\n\n1.Make Two pointers i.e slow and fast which points to the  head of the linked list.\n2.Run a while loop until next node of fast is not equal to null AND next to next node of fast is not equal to null.\n3.Slow will move one node to the right.\n4.Fast will move two nodes to the right.\n5.When while loop will end, the slow node will point to the middle node.\n\n![image](https://assets.leetcode.com/users/images/e6c337de-f807-4b0d-8706-3f009ca08d97_1670213907.97839.png)\n\n\n```\n\nclass Solution {\n    public ListNode middleNode(ListNode head) {\n        ListNode slow = head;\n        ListNode fast = head;\n        \n        while(fast != null && fast.next != null){\n            slow = slow.next;\n            fast = fast.next.next;\n        }\n        return slow;\n    }\n}\n\n```\n\n## ***Please Upvote if It helped*** \uD83D\uDE4F\n## Thanks
['Linked List', 'Two Pointers', 'Java']