Given two array of size **n** and m. The task is to find the number of ways we can merge the given arrays into one array such that order of elements of each array doesn’t change.

Examples:

Input : n = 2, m = 2 Output : 6 Let first array of size n = 2 be [1, 2] and second array of size m = 2 be [3, 4]. So, possible merged array of n + m elements can be: [1, 2, 3, 4] [1, 3, 2, 4] [3, 4, 1, 2] [3, 1, 4, 2] [1, 3, 4, 2] [3, 1, 2, 4] Input : n = 4, m = 6 Output : 210

The idea is to use the concept of combinatorics. Suppose we have two array A{a1, a2, …., am} and B{b1, b2, …., bn} having m and n elements respectively and now we have to merge them without loosing their order.

After merging we know that the total number of element will be (m + n) element after merging. So, now we just need the ways to choose m places out of (m + n) where you will place element of array A in its actual order, which is ^{m + n}C_{n}.

After placing m element of array A, n spaces will be left, which can be filled by the n elements of B array in its actual order.

So, total number of ways to merge two array such that their order in merged array is same is ^{m + n}C_{n}

Below is the implementation of this appraoch:

## C++

## Java

## C#

**Output:**

6

We can solve above problem in linear time using linear time implementation of binomial coefficient.