LeetCode #2723 — EASY

Add Two Promises

Build confidence with an intuition-first walkthrough focused on core interview patterns fundamentals.

The Problem

Problem Statement

Given two promises promise1 and promise2, return a new promise. promise1 and promise2 will both resolve with a number. The returned promise should resolve with the sum of the two numbers.

Example 1:

Input: 
promise1 = new Promise(resolve => setTimeout(() => resolve(2), 20)), 
promise2 = new Promise(resolve => setTimeout(() => resolve(5), 60))
Output: 7
Explanation: The two input promises resolve with the values of 2 and 5 respectively. The returned promise should resolve with a value of 2 + 5 = 7. The time the returned promise resolves is not judged for this problem.

Example 2:

Input: 
promise1 = new Promise(resolve => setTimeout(() => resolve(10), 50)), 
promise2 = new Promise(resolve => setTimeout(() => resolve(-12), 30))
Output: -2
Explanation: The two input promises resolve with the values of 10 and -12 respectively. The returned promise should resolve with a value of 10 + -12 = -2.

Constraints:

promise1 and promise2 are promises that resolve with a number

Step 01

Brute Force Baseline

Problem summary: Given two promises promise1 and promise2, return a new promise. promise1 and promise2 will both resolve with a number. The returned promise should resolve with the sum of the two numbers.

Baseline thinking

Start with the most direct exhaustive search. That gives a correctness anchor before optimizing.

Pattern signal: General problem-solving

Example 1

new Promise(resolve => setTimeout(() => resolve(2), 20))
new Promise(resolve => setTimeout(() => resolve(5), 60))

Example 2

new Promise(resolve => setTimeout(() => resolve(10), 50))
new Promise(resolve => setTimeout(() => resolve(-12), 30))

Step 02

Core Insight

What unlocks the optimal approach

No official hints in dataset. Start from constraints and look for a monotonic or reusable state.

Interview move: turn each hint into an invariant you can check after every iteration/recursion step.

Step 03

Algorithm Walkthrough

Iteration Checklist

Define state (indices, window, stack, map, DP cell, or recursion frame).
Apply one transition step and update the invariant.
Record answer candidate when condition is met.
Continue until all input is consumed.

Use the first example testcase as your mental trace to verify each transition.

Step 04

Edge Cases

Minimum Input

Single element / shortest valid input

Validate boundary behavior before entering the main loop or recursion.

Duplicates & Repeats

Repeated values / repeated states

Decide whether duplicates should be merged, skipped, or counted explicitly.

Extreme Constraints

Upper-end input sizes

Re-check complexity target against constraints to avoid time-limit issues.

Invalid / Corner Shape

Empty collections, zeros, or disconnected structures

Handle special-case structure before the core algorithm path.

Step 05

Full Annotated Code

Source-backed implementations are provided below for direct study and interview prep.

// Accepted solution for LeetCode #2723: Add Two Promises
// Auto-generated Java example from ts.
class Solution {
    public void exampleSolution() {
    }
}
// Reference (ts):
// // Accepted solution for LeetCode #2723: Add Two Promises
// async function addTwoPromises(
//     promise1: Promise<number>,
//     promise2: Promise<number>,
// ): Promise<number> {
//     return (await promise1) + (await promise2);
// }
// 
// /**
//  * addTwoPromises(Promise.resolve(2), Promise.resolve(2))
//  *   .then(console.log); // 4
//  */

// Accepted solution for LeetCode #2723: Add Two Promises
// Auto-generated Go example from ts.
func exampleSolution() {
}
// Reference (ts):
// // Accepted solution for LeetCode #2723: Add Two Promises
// async function addTwoPromises(
//     promise1: Promise<number>,
//     promise2: Promise<number>,
// ): Promise<number> {
//     return (await promise1) + (await promise2);
// }
// 
// /**
//  * addTwoPromises(Promise.resolve(2), Promise.resolve(2))
//  *   .then(console.log); // 4
//  */

# Accepted solution for LeetCode #2723: Add Two Promises
# Auto-generated Python example from ts.
def example_solution() -> None:
    return
# Reference (ts):
# // Accepted solution for LeetCode #2723: Add Two Promises
# async function addTwoPromises(
#     promise1: Promise<number>,
#     promise2: Promise<number>,
# ): Promise<number> {
#     return (await promise1) + (await promise2);
# }
# 
# /**
#  * addTwoPromises(Promise.resolve(2), Promise.resolve(2))
#  *   .then(console.log); // 4
#  */

// Accepted solution for LeetCode #2723: Add Two Promises
// Rust example auto-generated from ts reference.
// Replace the signature and local types with the exact LeetCode harness for this problem.
impl Solution {
    pub fn rust_example() {
        // Port the logic from the reference block below.
    }
}

// Reference (ts):
// // Accepted solution for LeetCode #2723: Add Two Promises
// async function addTwoPromises(
//     promise1: Promise<number>,
//     promise2: Promise<number>,
// ): Promise<number> {
//     return (await promise1) + (await promise2);
// }
// 
// /**
//  * addTwoPromises(Promise.resolve(2), Promise.resolve(2))
//  *   .then(console.log); // 4
//  */

// Accepted solution for LeetCode #2723: Add Two Promises
async function addTwoPromises(
    promise1: Promise<number>,
    promise2: Promise<number>,
): Promise<number> {
    return (await promise1) + (await promise2);
}

/**
 * addTwoPromises(Promise.resolve(2), Promise.resolve(2))
 *   .then(console.log); // 4
 */

Step 06

Interactive Study Demo

Use this to step through a reusable interview workflow for this problem.

Custom checkpoints (one per line)

Press Step or Run All to begin.

Step 07

Complexity Analysis

Time

O(n)

Space

O(1)

Approach Breakdown

BRUTE FORCE

O(n²) time

O(1) space

Two nested loops check every pair or subarray. The outer loop fixes a starting point, the inner loop extends or searches. For n elements this gives up to n²/2 operations. No extra space, but the quadratic time is prohibitive for large inputs.

OPTIMIZED

O(n) time

O(1) space

Most array problems have an O(n²) brute force (nested loops) and an O(n) optimal (single pass with clever state tracking). The key is identifying what information to maintain as you scan: a running max, a prefix sum, a hash map of seen values, or two pointers.

Shortcut: If you are using nested loops on an array, there is almost always an O(n) solution. Look for the right auxiliary state.

Coach Notes

Common Mistakes

Review these before coding to avoid predictable interview regressions.

Off-by-one on range boundaries

Wrong move: Loop endpoints miss first/last candidate.

Usually fails on: Fails on minimal arrays and exact-boundary answers.

Fix: Re-derive loops from inclusive/exclusive ranges before coding.