#PROBLEM LINK:

Practice

Contest

**Author:** Soham Chakrabarti

**Tester:** Soham Chakrabarti

**Editorialist:** Soham Chakrabarti

#DIFFICULTY:

CAKE-WALK

#PREREQUISITES:

Arrays

#PROBLEM:

Provided with two arrays of length **N**, containing single digit numbers only.

We have to combine the i-th index of the two arrays to get 2 two-digit numbers and then find the maximum.

#EXPLANATION:

Iterate and form the two digit numbers by multiplying

A[i]*10+B[i]

and

B[i]*10+A[i]

Find the max of the two and print the solution .

#AUTHOR'S AND EDITORIALIST'S SOLUTIONS:

Author's and editorialistâ€™s solution can be found

here.