🔥✅✅ Beat 100.00% | ✅ Full explanation with pictures ✅✅🔥
\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\npython []\nclass Solution(object):\n    def middleNode(self, head):\n        slow_pointer = head\n        fast_pointer = h
![Screen Shot 2024-03-14 at 11.30.19.png](https://assets.leetcode.com/users/images/99fe0b15-b318-4601-af0f-574bc98640ee_1710652249.4421208.png)\n\n[![Screen Shot 2024-03-07 at 05.05.14.png](https://assets.leetcode.com/users/images/bb00b1c7-c0f9-4ad2-b1f8-dd7643ed4278_1709769935.9568412.png)](https://leetcode.com/problems/middle-of-the-linked-list/submissions/1196191131?envType=daily-question&envId=2024-03-07)\n\n![Glenn Radars_4 3.png](https://assets.leetcode.com/users/images/61cac30a-24af-4592-8f15-e03d98768f32_1709600028.6615255.png)\n\n![Glenn Radars_9 2 4.png](https://assets.leetcode.com/users/images/0866f462-3500-43da-950a-5c1e0c48d97b_1709600960.6204474.png)\n\n![Glenn Radars_9 2 4 2 2.png](https://assets.leetcode.com/users/images/37737302-af19-465a-b50c-bbb2387366e1_1709771580.9347818.png)\n\n![Glenn Radars_9 2 4 2 2 2.png](https://assets.leetcode.com/users/images/b0c1cee3-e90d-4fc0-9c65-ddb21654b407_1709771960.3616905.png)\n\n![Glenn Radars_9 2 4 2 2 3.png](https://assets.leetcode.com/users/images/282d9258-570d-4943-bd64-2fbcea2e1d46_1709772122.9259796.png)\n\n![Glenn Radars_9 2 4 2 2 3 2.png](https://assets.leetcode.com/users/images/9b1c3bf5-8dfa-4d22-9418-506b26b63b0f_1709772771.1892922.png)\n\n![Glenn Radars_9 2 4 2 2 2.png](https://assets.leetcode.com/users/images/0d553654-43de-4762-97f7-2d2a9387018f_1709773744.056001.png)\n\n\n```python []\nclass Solution(object):\n    def middleNode(self, head):\n        slow_pointer = head\n        fast_pointer = head\n\n        while fast_pointer is not None and fast_pointer.next is not None:\n            slow_pointer = slow_pointer.next\n            fast_pointer = fast_pointer.next.next\n\n        return slow_pointer\n```\n```python3 []\nclass Solution:\n    def middleNode(self, head: Optional[ListNode]) -> Optional[ListNode]:\n        slow_pointer = head\n        fast_pointer = head\n\n        while fast_pointer is not None and fast_pointer.next is not None:\n            slow_pointer = slow_pointer.next\n            fast_pointer = fast_pointer.next.next\n\n        return slow_pointer\n```\n```C++ []\nclass Solution {\npublic:\n    ListNode* middleNode(ListNode* head) {\n        ListNode* slowPointer = head;\n        ListNode* fastPointer = head;\n\n        while (fastPointer != nullptr && fastPointer->next != nullptr) {\n            slowPointer = slowPointer->next;\n            fastPointer = fastPointer->next->next;\n        }\n\n        return slowPointer;\n    }\n};\n```\n\n```javascript []\nvar middleNode = function(head) {\n    let slowPointer = head;\n    let fastPointer = head;\n\n    while (fastPointer !== null && fastPointer.next !== null) {\n        slowPointer = slowPointer.next;\n        fastPointer = fastPointer.next.next;\n    }\n\n    return slowPointer;\n};\n```\n![Screen Shot 2024-03-14 at 11.30.19.png](https://assets.leetcode.com/users/images/99fe0b15-b318-4601-af0f-574bc98640ee_1710652249.4421208.png)\n\n\n## **My solutions**\n\n\uD83D\uDFE2 - $$easy$$  \n\uD83D\uDFE1 - $$medium$$ \n\uD83D\uDD34 - $$hard$$\n\n\uD83D\uDFE1 [17. Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/solutions/4845532/there-is-an-80-chance-of-being-in-the-interview-full-problem-explanation)\n\uD83D\uDFE1 [22. Generate Parentheses](https://leetcode.com/problems/generate-parentheses/solutions/4845742/simple-explanation-with-pictures)\n\uD83D\uDFE1 [39. Combination Sum](https://leetcode.com/problems/combination-sum/solutions/4847482/beat-8292-full-explanation-with-pictures)\n\uD83D\uDFE2 [2540. Minimum Common Value](https://leetcode.com/problems/minimum-common-value/solutions/4845076/beat-9759-full-explanation-with-pictures)\n\uD83D\uDFE2 [3005. Count Elements With Maximum Frequency](https://leetcode.com/problems/count-elements-with-maximum-frequency/solutions/4839796/beat-8369-full-explanation-with-pictures)\n\uD83D\uDFE2 [3028. Ant on the Boundary](https://leetcode.com/problems/ant-on-the-boundary/solutions/4837433/full-explanation-with-pictures)\n\uD83D\uDFE2 [876. Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/solutions/4834682/beat-10000-full-explanation-with-pictures)\n\uD83D\uDFE1 [1750. Minimum Length of String After Deleting Similar Ends](https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends/solutions/4824224/beat-10000-full-explanation-with-pictures)\n\uD83D\uDFE1 [948. Bag of Tokens](https://leetcode.com/problems/bag-of-tokens/solutions/4818912/beat-10000-full-explanation-with-pictures)\n\uD83D\uDFE1 [19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/solutions/4813340/beat-10000-full-explanation-with-pictures)\n\uD83D\uDFE2 [977. Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/solutions/4807704/square-sorter-python-python3-javascript-c)\n\uD83D\uDFE2 [2864. Maximum Odd Binary Number](https://leetcode.com/problems/maximum-odd-binary-number/solutions/4802402/visual-max-odd-binary-solver-python-python3-javascript-c)\n\uD83D\uDFE1 [1609. Even Odd Tree](https://leetcode.com/problems/even-odd-tree/solutions/4797529/even-odd-tree-validator-python-python3-javascript-c)\n\uD83D\uDFE2 [9. Palindrome Number](https://leetcode.com/problems/palindrome-number/solutions/4795373/why-not-1-line-of-code-python-python3-c-everyone-can-understand)\n\uD83D\uDFE1 [513. Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/solutions/4792022/binary-tree-explorer-mastered-javascript-python-python3-c-10000-efficiency-seeker)\n\uD83D\uDFE2 [1. Two Sum](https://leetcode.com/problems/two-sum/solutions/4791305/5-methods-python-c-python3-from-easy-to-difficult)\n\uD83D\uDFE2 [543. Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/solutions/4787634/surpassing-9793-memory-magician-excelling-at-9723)\n[More...](https://leetcode.com/DevOgabek/)\n
['Linked List', 'Two Pointers', 'Python', 'C++', 'Python3', 'JavaScript']