Stealth Interview
  • Features
  • Pricing
  • Blog
  • Login
  • Sign up

Leetcode #2723: Add Two Promises

In this guide, we solve Leetcode #2723 Add Two Promises in Python and focus on the core idea that makes the solution efficient.

You will see the intuition, the step-by-step method, and a clean Python implementation you can use in interviews.

Leetcode

Problem Statement

Given two promises promise1 and promise2, return a new promise. promise1 and promise2 will both resolve with a number.

Quick Facts

  • Difficulty: Easy
  • Premium: No
  • Tags: JavaScript

Intuition

The constraints allow a direct scan that keeps only the essential state.

By translating the requirements into a clean loop, the logic stays easy to reason about.

Approach

Iterate through the data once, updating the state needed to compute the answer.

Return the final state after the traversal is complete.

Steps:

  • Parse the input.
  • Iterate and update state.
  • Return the computed answer.

Example

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.

Python Solution

# TODO: add Python solution

Complexity

The time complexity is O(n). The space complexity is O(1) to O(n).

Edge Cases and Pitfalls

Watch for boundary values, empty inputs, and duplicate values where applicable. If the problem involves ordering or constraints, confirm the invariant is preserved at every step.

Summary

This Python solution focuses on the essential structure of the problem and keeps the implementation interview-friendly while meeting the constraints.


Ace your next coding interview

We're here to help you ace your next coding interview.

Subscribe
Stealth Interview
© 2026 Stealth Interview®Stealth Interview is a registered trademark. All rights reserved.
Product
  • Blog
  • Pricing
Company
  • Terms of Service
  • Privacy Policy