36. Single Linked List Middle

Write a function solve that returns the middle node of a singly linked list. If two middles, return the second one.

Example:
Input: [1,2,3,4,5]
Output: 3

Run this challenge interactively in Python or JavaScript when the app loads.