What is the time and space complexity of Auto-retry Promise?

Time complexity: O(r) where r is the number of retries. Space complexity: O(1).

Auto-retry Promise

Med

Code

Loading editor...

Tap Analyze to see visualization

Click Analyze to visualize

See step-by-step execution, variables, and output

Variables

Run code to see variables

Output

Console output will appear here

Press Space to start•← → to step•? all shortcuts

Solution Guide: Auto-retry Promise

Approach

Accept a promise-returning function, a max retry count, and a delay between retries. On rejection, increment the attempt counter and schedule a recursive retry after the delay. Resolve on first success or reject when max retries are exhausted.

Complexity Analysis

Time: O(r) where r is the number of retries
Space: O(1)

Pattern

Promise Retry

Why It Works

Recursive scheduling via setTimeout creates a chain of attempts with a cooldown period, giving transient failures a chance to recover before exhausting the retry budget.

Updated Mar 2026