1011121314

class Solution:
    # Function to insert at a given position (0-based index)
    def insertAtPosition(self, arr, pos, x):
        arr.insert(pos, x)
        return arr

# Driver code
arr = [1, 2, 4, 5]
pos, x = 2, 3

obj = Solution()
arr = obj.insertAtPosition(arr, pos, x)
print(arr)

1234567891011121314151617

// Class to handle insertion
class Solution {
    // Function to insert at a given position (0-based index)
    insertAtPosition(arr, pos, x) {
        arr.splice(pos, 0, x);
        return arr;
    }
}

// Driver code
let arr = [1, 2, 4, 5];
let pos = 2, x = 3;

let obj = new Solution();
arr = obj.insertAtPosition(arr, pos, x);
console.log(arr);

Complexity Analysis

Time Complexity: O(n) since we need to shift the elements to right according to the position.

Space Complexity: O(1). No extra space used