**Problem Statement:**
Given the required input arguments, write an efficient algorithm to solve the **Middle of Linked List** problem. Implement the required logic as specified by standard definitions for this classic algorithmic challenge.
**Hint / Expected Approach:**
Slow/fast pointer (fast moves 2x)
**Edge Cases to Consider:**
- (1) Single node
- (2) Two nodes
- (3) Even vs odd length list
Examples
Example 1
Input:[1,2,3,4,5]
Output:Node 3 → [3,4,5]
Explanation: Odd, exact middle
Example 2
Input:[1,2,3,4,5,6]
Output:Node 4 → [4,5,6]
Explanation: Even, second of two middles
Example 3
Input:[1]
Output:Node 1 → [1]
Explanation: Single node
Constraints
▪The number of nodes in the list is in the range [0, 500]