#!/bin/python3

import math
import os
import random
import re
import sys

#
# Complete the 'insertionSort1' function below.
#
# The function accepts following parameters:
#  1. INTEGER n
#  2. INTEGER_ARRAY arr
#

def insertionSort1(n, arr):
    # Write your code here
    for i in range(n):
        j = i
        curr = arr[i]
        if curr < arr[j-1]:
            while j > 0 and curr < arr[j-1]:
                arr[j]= arr[j-1]
                j-=1
                print(*arr)
            
            if j != i:
                arr[j] = curr
                print(*arr)
        
            

if __name__ == '__main__':
    n = int(input().strip())

    arr = list(map(int, input().rstrip().split()))

    insertionSort1(n, arr)

#include <bits/stdc++.h>

using namespace std;

string ltrim(const string &);
string rtrim(const string &);
vector<string> split(const string &);

/*
 * Complete the 'insertionSort1' function below.
 *
 * The function accepts following parameters:
 *  1. INTEGER n
 *  2. INTEGER_ARRAY arr
 */

void insertionSort1(int n, vector<int> arr) {
    for (int i = 1; i < n; i++) { 
        int curr = arr[i]; 
        int j = i;

        if (curr < arr[j - 1]) {
            while (j > 0 && curr < arr[j - 1]) {
                arr[j] = arr[j - 1]; 
                j--;

                for (int k = 0; k < n; k++) {
                    cout << arr[k] << " ";
                }
                cout << endl; 
            }

            if (j != i) {
                arr[j] = curr;
                for (int k = 0; k < n; k++) {
                    cout << arr[k] << " ";
                }
                cout << endl; 
            }
        }
    }
}

int main()
{
    string n_temp;
    getline(cin, n_temp);

    int n = stoi(ltrim(rtrim(n_temp)));

    string arr_temp_temp;
    getline(cin, arr_temp_temp);

    vector<string> arr_temp = split(rtrim(arr_temp_temp));

    vector<int> arr(n);

    for (int i = 0; i < n; i++) {
        int arr_item = stoi(arr_temp[i]);

        arr[i] = arr_item;
    }

    insertionSort1(n, arr);

    return 0;
}

string ltrim(const string &str) {
    string s(str);

    s.erase(
        s.begin(),
        find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
    );

    return s;
}

string rtrim(const string &str) {
    string s(str);

    s.erase(
        find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
        s.end()
    );

    return s;
}

vector<string> split(const string &str) {
    vector<string> tokens;

    string::size_type start = 0;
    string::size_type end = 0;

    while ((end = str.find(" ", start)) != string::npos) {
        tokens.push_back(str.substr(start, end - start));

        start = end + 1;
    }

    tokens.push_back(str.substr(start));

    return tokens;
}

def countingSort(arr):
    # Write your code here
    count = [0]*100
    for n in arr: 
        count[n] += 1
    
    return count

vector<int> countingSort(vector<int> arr) {
    vector<int> count(100); // arrays connot be returned so make sure to use vectors
    for (int i = 0; i < arr.size(); i++){ 
    // for vectors use size() method the length() method works for strings only
        count[arr[i]]++;        
    }
    return count;
}

vector<int> countingSort(vector<int> arr) {
    vector<int> count(100);  
    for (int i = 0; i < arr.size(); i++){ 
        count[arr[i]]++;        
    }
    return count;
}

💬 If you're new to leetcode don't bother trying to solve it I will share more feasible questions for beginners.

class Solution:
    def sortEvenOdd(self, nums: List[int]) -> List[int]:
        n = len(nums)
        
        even_indexes = [nums[i] for i in range(0, n, 2)]
        # range(start, end, step)
        odd_indexes = [nums[i] for i in range(1, n, 2)]

        even_indexes.sort()
        odd_indexes.sort(reverse=True)

        even_ptr = odd_ptr = 0
        res = []
        for i in range(n):
            if i % 2 == 0:
                res.append(even_indexes[even_ptr])
                even_ptr += 1
            else:
                res.append(odd_indexes[odd_ptr])
                odd_ptr += 1
        
        return res

class Solution:
    def sortEvenOdd(self, nums: List[int]) -> List[int]:
        nums[::2] = sorted(nums[::2])
        nums[1::2] = sorted(nums[1::2], reverse=True)
        return nums

// #include <bits/std++.h> 
// using namespace std;
// If you are running it locally make sure to include the above in your code

class Solution {
public:
    vector<int> sortEvenOdd(vector<int>& nums) {
        int n = nums.size();
        
        vector<int> even_indexes;
        vector<int> odd_indexes;
        
        for (int i = 0; i < n; i += 2) {
            even_indexes.push_back(nums[i]);
        }
        
        for (int i = 1; i < n; i += 2) {
            odd_indexes.push_back(nums[i]);
        }

        sort(even_indexes.begin(), even_indexes.end());
        sort(odd_indexes.rbegin(), odd_indexes.rend());

        int even_ptr = 0, odd_ptr = 0;
        vector<int> res(n);
        
        for (int i = 0; i < n; ++i) {
            if (i % 2 == 0) {
                res[i] = even_indexes[even_ptr++];
            } else {
                res[i] = odd_indexes[odd_ptr++];
            }
        }
        
        return res;
    }
};