143. Remove the Nth Node From the End
Challenge1000 ms256 MBSolved by 0%
Build the list, read k, and remove the kth node counting from the END,
where k = 1 is the last node.
Print the resulting list, Empty if nothing remains, or Invalid if k is larger than
the list.
Constraints - `0 ≤ n ≤ 100000` - `1 ≤ k ≤ 200000` - `-1000000 ≤ value ≤ 1000000`
Input
The first line contains an integer n, the number of nodes.
The second line contains n space-separated integers, the node values from head to tail.
The starter code builds the list for you; work on the nodes, not the array.
The third line contains an integer k.
Output
Print the resulting list from head to tail, separated by single spaces, Empty if nothing remains, or Invalid if k exceeds the length.
Input5
1 2 3 4 5
2
Output1 2 3 5
Noteremoves the second node from the end
Input5
1 2 3 4 5
1
Output1 2 3 4
Noteremoves the last node, the smallest valid k
Hints
Four rungs, in order. The last two open once you have submitted an attempt. A wrong one counts.
Hint 1Where to start
Hint 2The approachOpen hint 1 first. This one carries on from it.
Hint 3PseudocodeOpen hint 2 first. This one carries on from it.
Hint 4Full solutionOpen hint 3 first. This one carries on from it.