**Problem Statement:**
Given the required input arguments, write an efficient algorithm to solve the **Reorder List** problem. Implement the required logic as specified by standard definitions for this classic algorithmic challenge.
**Hint / Expected Approach:**
Find mid + reverse second half + interleave
**Edge Cases to Consider:**
- (1) Single node
- (2) Two nodes
- (3) Odd vs even length list
Examples
Example 1
Input:[1,2,3,4]
Output:[1,4,2,3]
Explanation: Basic even
Example 2
Input:[1,2,3,4,5]
Output:[1,5,2,4,3]
Explanation: Basic odd
Example 3
Input:[1]
Output:[1]
Explanation: Single node
Constraints
▪The number of nodes in the list is in the range [0, 500]