Remove nth node from end
Given a singly linked list encoded as a plain list of values and an integer n, remove the n-th node from the end (n=1 is the last node) and return the resulting values as a plain list. If n is out of range (n <= 0 or n > length), return the list unchanged.
Implement
remove_nth_from_end(vals: list[int], n: int) → list[int]Examples
in
[[1,2,3,4,5],2]out[1,2,3,5]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 15 min
solution.py
InputExpectedGot
[[1,2,3,4,5],2][1,2,3,5]not run yetsample