How hard is LeetCode 2821. Delay the Resolution of Each Promise?

LeetCode 2821. Delay the Resolution of Each Promise is rated Medium on LeetCode.

What topics does LeetCode 2821. Delay the Resolution of Each Promise cover?

LeetCode 2821. Delay the Resolution of Each Promise is tagged JavaScript on LeetCode.

Is LeetCode 2821. Delay the Resolution of Each Promise a premium problem?

Yes. LeetCode 2821. Delay the Resolution of Each Promise is a LeetCode Premium problem, so the full statement and test cases require a paid LeetCode subscription.

MediumNo. 2821LeetCode Premium

Delay the Resolution of Each Promise — LeetCode 2821 Python Solution

Topics: JavaScript
Reading time: 2 min
Source: leetcode.com

The problem

Given an array functions and a number ms, return a new array of functions. functions is an array of functions that return promises.

Example

Input: functions = [
Output: [80]
Explanation: The promise from the array would have resolved after 30 ms, but it was delayed by 50 ms, thus 30 ms + 50 ms = 80 ms.

Complexity

Time: O(n)
Space · auxiliary: O(1) to O(n)

Related problems
No.	Problem	Difficulty
0057	Insert Interval	Medium
0192	Word Frequency	Medium
0193	Valid Phone Numbers	Easy
0194	Transpose File	Medium
0195	Tenth Line	Easy
0228	Summary Ranges	Easy

Frequently asked questions

How hard is LeetCode 2821. Delay the Resolution of Each Promise?: LeetCode 2821. Delay the Resolution of Each Promise is rated Medium on LeetCode.
What topics does LeetCode 2821. Delay the Resolution of Each Promise cover?: LeetCode 2821. Delay the Resolution of Each Promise is tagged JavaScript on LeetCode.
Is LeetCode 2821. Delay the Resolution of Each Promise a premium problem?: Yes. LeetCode 2821. Delay the Resolution of Each Promise is a LeetCode Premium problem, so the full statement and test cases require a paid LeetCode subscription.

Stuck on problems like this in a live interview?

Stealth Interview is a desktop app for macOS and Windows. It reads the problem off your screen and returns a working solution with a step-by-step explanation and its time and space complexity, invisible to screen sharing.

Download for Mac Download for Windows

Free to download. Check it runs on your machine, then pick a plan.

90%Subscription

python

Please analyze this context and help me answer the question or solve the problem.

Transcript

"Okay, next one. Given a string, return the length of the longest substring that has no repeating characters. Walk me through your approach before you code it."

Technical interview · 45 minsolution.pyShared editor · Python 3Longest substring without repeatsMediumGiven a string s, return the length of the longest contiguous substring in which every character is unique.s = "abcabcbb"
→ 31def length_of_longest_substring(s: str) -> int:2 last_seen = {}3 left = best = 04 for right, ch in enumerate(s):5 if ch in last_seen and last_seen[ch] >= left:

python

def length_of_longest_substring(s: str) -> int:    last_seen = {}                    # char -> index    left = best = 0    for right, ch in enumerate(s):        if ch in last_seen and last_seen[ch] >= left:            left = last_seen[ch] + 1  # jump past it        last_seen[ch] = right        best = max(best, right - left + 1)    return best    last_seen = {}                    # char -> index

Approach

At each index r, the window's left edge is:

left r = max (left r -1, last[s r] + 1)

Time O(n): each character enters and leaves the window once.
Space O(min(n, k)): k is the size of the character set.

Type your message...

GPT-6.1 Terra

Transcribing...

90%Subscription

python

Please analyze this context and help me answer the question or solve the problem.

Transcript

"Okay, next one. Given a string, return the length of the longest substring that has no repeating characters. Walk me through your approach before you code it."

python

def length_of_longest_substring(s: str) -> int:    last_seen = {}                    # char -> index    left = best = 0    for right, ch in enumerate(s):        if ch in last_seen and last_seen[ch] >= left:            left = last_seen[ch] + 1  # jump past it        last_seen[ch] = right        best = max(best, right - left + 1)    return best    last_seen = {}                    # char -> index

Approach

At each index r, the window's left edge is:

left r = max (left r -1, last[s r] + 1)

Time O(n): each character enters and leaves the window once.
Space O(min(n, k)): k is the size of the character set.

Type your message...

GPT-6.1 TerraClear chat

Transcribing...

QuitEscHide+QCapture+PCrop+OSubmit+EnterPress to get answerLeft/Right+Up/Down+

90%Subscription

python

Please analyze this context and help me answer the question or solve the problem.

Transcript

"Okay, next one. Given a string, return the length of the longest substring that has no repeating characters. Walk me through your approach before you code it."

python

def length_of_longest_substring(s: str) -> int:    last_seen = {}                    # char -> index    left = best = 0    for right, ch in enumerate(s):        if ch in last_seen and last_seen[ch] >= left:            left = last_seen[ch] + 1  # jump past it        last_seen[ch] = right        best = max(best, right - left + 1)    return best    last_seen = {}                    # char -> index

Approach

At each index r, the window's left edge is:

left r = max (left r -1, last[s r] + 1)

Time O(n): each character enters and leaves the window once.
Space O(min(n, k)): k is the size of the character set.

Type your message...

GPT-6.1 TerraClear chat

Transcribing...

Primary display

QuitEscHide+QCapture+PCrop+OSubmit+EnterPress to get answerLeft/Right+Up/Down+

The problem

Example

Complexity

Related problems

Frequently asked questions

Stuck on problems like this in a live interview?

Approach

Approach

Approach