📘 The Ultimate DSA Mastery Series by Mosh Hamedani

🌟 4.9 - 200,000+ ratings
💰 Original Price: $99

💬 Master Data Structures and Algorithms with 250 lessons and 20+ hours of in-depth content. From arrays and linked lists to advanced algorithms like dynamic programming and graph traversal, this course covers everything you need to ace technical interviews and improve your problem-solving skills. Learn with real-world coding challenges and hands-on exercises.

Taught by: Mosh Hamedani

📦 GET FULL FREE ACCESS 👉 DSA Mastery Series

👽 JOIN FOR MORE: @AceCoding

#Code_with_Mosh_DSA_Mastery_Series #The_Ultimate_DSA_Mastery_Series #code_with_mosh

📘 The Ultimate HTML & CSS Mastery Series by Mosh Hamedani

🌟 4.8 - 170,000+ ratings
💰 Original Price: $80

💬 Master HTML & CSS with 200 lessons and 15+ hours of video content. This course covers everything from the basics of web design to advanced CSS techniques. Learn to build responsive, modern websites with hands-on projects and real-world examples using HTML5, CSS3, Flexbox, Grid, and more.

Taught by: Mosh Hamedani

📦 GET FULL FREE ACCESS 👉 HTML & CSS Mastery Series

👽 JOIN FOR MORE: @AceCoding

#Code_with_Mosh_HTML_CSS_Mastery_Series #The_Ultimate_HTML_CSS_Mastery_Series #code_with_mosh

📘 The Complete Full Stack Developer 2024 by Angela Yu

🌟 4.9 - 300,000+ ratings
💰 Original Price: $99

💬 Become a Full Stack Developer with 400+ lessons and 50+ hours of detailed content. This course covers everything from front-end to back-end development, including HTML, CSS, JavaScript, Node.js, Express, MongoDB, React, and more. Gain hands-on experience by building real-world projects and prepare yourself for a successful career in web development.

Taught by: Dr. Angela Yu

📦 GET FULL FREE ACCESS 👉 Full Stack Developer 2024

👽 JOIN FOR MORE: @AceCoding

#Angela_Yu_Full_Stack_2024 #Complete_Full_Stack_Developer #code_with_angela

✅🏁🌟 C++ Assignment from Kombolcha Institute of Technology

👨‍💻 You can find the detailed solutions on GitHub: 👉 Check it out here!

These solutions were created in response to a request from a student at the university. If you're a second-year software engineering student (related field), or a pre-engineering student and you're looking for some assistance with your studies, or if you have any questions, please feel free to reach out to us! We are more than happy to help out 😊

💻 Share and Join for more at @AceCoding

🚀🌟 Welcome to the Ultimate DSA Boot Camp!

Get ready for an immersive journey into the world of Data Structures and Algorithms! Whether you're gearing up for coding interviews 🧑‍💻, tackling a DSA course 📚, or preparing to ACE your next big exam 🎯, this is the place to be.

📦 What’s coming your way?

🔥 Super helpful notes
❓ Brain-teasing questions
💡 Pro tips to conquer DSA with confidence!


Stay tuned, stay curious, and let’s turn DSA from daunting to doable. 💯 Let's ace it together!

🌟🚀 @AceCoding Presents! 🚀🌟

🏁 You wouldn't want to miss this adventure; let's make it happen together! 🏁

🚨 Grokking Algorithms is in the building! 🚨

✅ Both the latest 2023 (MEAP) Edition and the Legacy Editions are here!

I haven't finished it yet, but this book is outstanding. Highly recommend diving in; it’s worth every page.

Get ready to learn algorithms the easy way! 🎉 With fun visuals and simple explanations, this book makes DSA a breeze. Perfect for beginners or anyone looking to sharpen their skills.

Let’s get grokking! 🚀✨

🌟🤝 Stay Tuned! 🤝🌟

We’re cooking up a storm with exciting news, questions, and super useful resources just for you! 🔥📚

🔴Don’t keep it to yourself share the love💻!
🟢Spread the word 😄 to your friends and anyone who could use a boost in their coding journey. Let’s grow together! 🚀

✅ First try the question by yourself and then try to compare your solution with mine:

#!/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)

✅💻 Here is a C++ implementation for the above question.

#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;
}