Promise Pool — LeetCode 2636 Python Solution
MediumLeetCode PremiumJavaScript
- Problem
- #2636
- Reading time
- 2 min
- Source
- leetcode.com
The problem
Given an array of asynchronous functions functions and a pool limit n, return an asynchronous function promisePool. It should return a promise that resolves when all the input functions resolve.
Example
- Input
- functions = [
- Output
- [[300,400,500],500]
- Explanation
- Three functions are passed in. They sleep for 300ms, 400ms, and 200ms respectively.
Complexity
| Measure | Complexity |
|---|---|
| Time | O(n) |
| Space | O(1) to O(n) auxiliary |
Related problems
Frequently asked questions
- How hard is LeetCode 2636. Promise Pool?
- LeetCode 2636. Promise Pool is rated Medium on LeetCode.
- What topics does LeetCode 2636. Promise Pool cover?
- LeetCode 2636. Promise Pool is tagged JavaScript on LeetCode.
- Is LeetCode 2636. Promise Pool a premium problem?
- Yes. LeetCode 2636. Promise Pool is a LeetCode Premium problem, so the full statement and test cases require a paid LeetCode subscription.