BL
U

54. Node At a Specified Zero-based Position

Easy

Problem Description

Insert a node at a specified zero-based position. Handle insertion at the head and at the end.

Input Format

  • •Line 1: An integer NN (1≤N≤1051 \le N \le 10^5).
  • •Line 2: NN space-separated integers.

Output Format

Print the resulting values space-separated on standard output.

Example 1:
Input:
4
10 20 30 40
Output:
10 20 30 40
Explanation: Applying Node At a Specified Zero-based Position across elements 10, 20, 30, 40.
Example 2:
Input:
1
100
Output:
100
Explanation: Singleton list verification.
Example 3:
Input:
3
3 2 1
Output:
1 2 3
Explanation: Verification on ordered inputs.
Constraints:
  • Standard integer bounds: 32-bit signed integer or input range [1, 10^5].
  • Time complexity target: O(N) or O(N log N) where applicable.
  • Auxiliary space target: O(1) or minimal auxiliary memory.
Follow up:Can this algorithm be adapted to an online streaming setting where the entire input cannot be held in memory simultaneously?
1,180 Online