Gain insights into competitive programming, explore C++ skills with theory, code samples, practice problems, and master faster implementation for contests like ACM ICPC, Google CodeJam, and HackerCup.

Competitive programming can be a great way to build out your programming skills, get on any major company’s radar, and earn a little extra cash along the way.

In this course, you will learn to prepare for competitive programming contests like ACM ICPC, Google CodeJam, Facebook HackerCup, and many more.

Each topic is broken down with a healthy mix of theory, code samples, step-by-step solved sample problems, illustrations, useful practice problems, and tips and tricks for faster implementation.

You will need some solid C++ foundations coming into this course, but by the end it, you will be confident enough in your C++ skills to take home the win.

Competitive Programming in C++: The Keys to Success

# Problem statement
Given two sorted arrays, $A[]$ and $B[]$, of sizes $N$ and $M$ respectively, merge them into a single array of size $N+M$ and print the array.

**Input format**

The first line consists of two space-separated integers $N, M$ $(1 \leq N,M \leq10^5)$.

The second line consists of $N$ space-separated integers representing the array $A[]$ $(1 \leq A[i] \leq 10^5)$.

The third line consists of $M$ space-separated integers representing the array $B[]$ $(1 \leq B[i] \leq 10^5)$.

**Output format**

Print a single line of output containing the $N+M$ integers representing the merged and sorted array $C[]$.

---


# Sample

**Input**:  
```
4 4
2 3 4 6
1 5 7 8
```

**Output** 
```
1 2 3 4 5 6 7 8
```

---

# Solution
We use 2 pointers $i$ and $j$ for $A[]$ and $B[]$ respectively. 

At each step, we copy the smaller of $A[i], B[j]$ to the current end of $C[]$. Keep doing this until we reach the end of A or B. After that only one array remains (either $A$ or $B$), copy all the remaining elements to C.

See the illustration for better understanding.

In this lesson, we'll discuss how to merge two sorted arrays.

Introduction

Complexity Analysis

Number Theory

Arrays and Vectors

Sieve of Eratosthenes

Strings

Sorting

Linked List

Stack

Queue

Binary Tree

2 Pointers

Heap

Binary Search Tree

Balanced Binary Search Tree

Course Conclusion

Solved Problem - Merge Sorted Arrays

Problem statement