**Problem Statement:**
Given the required input arguments, write an efficient algorithm to solve the **Reverse Nodes in k-Group** problem. Implement the required logic as specified by standard definitions for this classic algorithmic challenge.
**Hint / Expected Approach:**
Reverse k nodes + recurse on remainder
**Edge Cases to Consider:**
- (1) k = 1 (no change)
- (2) k equals list length
- (3) Remaining nodes < k (keep as-is)
Examples
Example 1
Input:[1,2,3,4,5], 2
Output:[2,1,4,3,5]
Explanation: Groups of 2, tail left
Example 2
Input:[1,2,3,4,5], 3
Output:[3,2,1,4,5]
Explanation: Groups of 3, tail left
Example 3
Input:[1,2,3,4,5], 1
Output:[1,2,3,4,5]
Explanation: k=1, no change
Constraints
▪The number of nodes in the list is in the range [0, 500]