A linked list is given as an array of values. Implement `middleNode(arr)` returning the middle value using the slow and fast pointer technique. For even length, return the second of the two middle values.
+ 1 hidden test run on Submit.
Moving fast by two and slow by one lands slow at the middle in a single pass.
Run your code to see results.