Sum of Big Integers Problem Statement

Given two integers represented as strings, 'NUM1' and 'NUM2', compute and return their sum.

Input:

T NUM1 NUM2 ...

Output:

Sum of NUM1 and NUM2 for each test case

Example:

Input:

2 123456789123456789123456789 987654321987654321987654321 1 999999999999999999999999999

Output:

1111111111111111111111111110 1000000000000000000000000000

Constraints:

1

Question

Sum of Big Integers Problem Statement

Given two integers represented as strings, 'NUM1' and 'NUM2', compute and return their sum.

Input:

T
NUM1 NUM2
...

Output:

Sum of NUM1 and NUM2 for each test case

Example:

Input:

2
123456789123456789123456789 987654321987654321987654321
1 999999999999999999999999999

Output:

1111111111111111111111111110
1000000000000000000000000000

Constraints:

1 <= T <= 10000
1 <= |NUM1| <= 10⁵⁰
1 <= |NUM2| <= 10⁵⁰
Where: T is the number of test cases, and NUM1 and NUM2 are the numbers given as strings.
Time Limit: 1 sec

Accepted Answer

Program to compute sum of big integers represented as strings.

Convert strings to integers and add them digit by digit from right to left, considering carry over.
Handle cases where one number is longer than the other by padding with zeros.
Return the final sum as a string.

Accepted Answer

Using Strings. Let us store ‘NUM1’ and ‘NUM2’ as strings rather than storing them as integers. We will calculate the sum as follows: We will add zeroes before the smaller string among ‘NUM1’ and ...

Asked in Amazon

Sum of Big Integers Problem Statement

Input:

Output:

Example:

Input:

Output:

Constraints:

Top Program Analyst Interview Questions Asked at Amazon

Interview Questions Asked to Program Analyst at Other Companies