Reorder list ends
Given a singly linked list encoded as a plain list of its values L0, L1, ..., Ln-1, reorder it to L0, Ln-1, L1, Ln-2, L2, Ln-3, ... and return the reordered values as a plain list. Do not just reverse it; interleave from both ends. The list may be empty.
Implement
reorder_list(vals: list[int]) → list[int]Examples
in
[[1,2,3,4]]out[1,4,2,3]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 20 min
solution.py
InputExpectedGot
[[1,2,3,4]][1,4,2,3]not run yetsample