Array sum | Interview Bit | C++ solution with easy explanation
Problem Description
You are given two numbers represented as integer arrays A and B, where each digit is an element.
You have to return an array which representing the sum of the two given numbers.
The last element denotes the least significant bit, and the first element denotes the most significant bit.
Note : Array A and Array B can be of different size. ( i.e. length of Array A may not be equal to length of Array B ).
Array sum | Interview Bit | C++ solution with easy explanation