Add Two Integers

Add Two Integers - Problem

Math Easy

Given two integers num1 and num2, return the sum of the two integers.

Constraints:

-100 ≤ num1, num2 ≤ 100

Input & Output

Example 1 — Basic Addition

$ Input: num1 = 12, num2 = 5

› Output: 17

💡 Note: Simply add the two integers: 12 + 5 = 17

Example 2 — Negative Numbers

$ Input: num1 = -10, num2 = 4

› Output: -6

💡 Note: Adding a positive to a negative: -10 + 4 = -6

Example 3 — Both Negative

$ Input: num1 = -1, num2 = -1

› Output: -2

💡 Note: Adding two negatives: -1 + (-1) = -2

Constraints

-100 ≤ num1, num2 ≤ 100

Visualization

Tap to expand

Asked in

G Google 15 a Amazon 12 M Microsoft 10

The optimal approach is direct addition using the + operator. This leverages the fundamental arithmetic operation that is already optimized at the hardware level. Time: O(1), Space: O(1)

Common Approaches

✓ Direct Addition

⏱️ Time: O(1) Space: O(1)

This is the most straightforward approach - simply add the two integers together using the built-in addition operator. Since this is a fundamental arithmetic operation, there's no more efficient way to solve this problem.

Mathematical Addition

⏱️ Time: O(1) Space: O(1)

This approach recognizes that integer addition is a fundamental mathematical operation that can be performed directly. We leverage the commutative property (a + b = b + a) and the fact that addition is already optimized in hardware.

Direct Addition — Algorithm Steps

Step 1: Take the two input integers
Step 2: Add them using the + operator
Step 3: Return the sum

Visualization

Tap to expand

Step-by-Step Walkthrough

Input

Read two integers num1 and num2

Addition

Compute num1 + num2

Result

Return the sum

Code -

solution.c — C

#include <stdio.h>

int solution(int num1, int num2) {
    return num1 + num2;
}

int main() {
    int num1, num2;
    scanf("%d", &num1);
    scanf("%d", &num2);
    int result = solution(num1, num2);
    printf("%d\n", result);
    return 0;
}

Time & Space Complexity

Time Complexity

⏱️

O(1)

Single addition operation takes constant time

✓ Linear Growth

Space Complexity

O(1)

No extra space needed, only storing the result

✓ Linear Space

125.0K Views

Very High Frequency

~2 min Avg. Time

4.5K Likes

Ln 1, Col 1

Smart Actions

💡 Explanation

AI Ready

💡 Suggestion Tab to accept Esc to dismiss

// Output will appear here after running code

Code Editor Closed

Click the red button to reopen

Input & Output

Constraints

Visualization

Related Problems

Common Approaches

Direct Addition — Algorithm Steps

Visualization

Code -

Time & Space Complexity

Select Compiler