You are required to find and return the second largest element present in the array/list. If N <= 1 or all the elements are same in the array/list then return -2147483648 or -2 ^ 31 (It is the ...

You need to find the sum of both the input arrays/list treating them as two integers and put the result in another array/list i.e. output array/list will also contain only single digit at every index.