Given an array of asynchronous functions functions, return a new promise promise. Each function in the array accepts no arguments and returns a promise. All the promises should be executed in parallel.
promise resolves:
functions were resolved successfully in parallel. The resolved value of promise should be an array of all the resolved values of promises in the same order as they were in the functions. The promise should resolve when all the asynchronous functions in the array have completed execution in parallel.promise rejects:
functions were rejected. promise should also reject with the reason of the first rejection.Please solve it without using the built-in Promise.all function.
Example 1:
Input: functions = [
() => new Promise(resolve => setTimeout(() => resolve(5), 200))
]
Output: {"t": 200, "resolved": [5]}
Explanation:
promiseAll(functions).then(console.log); // [5]
The single function was resolved at 200ms with a value of 5.
Example 2:
Input: functions = [
() => new Promise(resolve => setTimeout(() => resolve(1), 200)),
() => new Promise((resolve, reject) => setTimeout(() => reject("Error"), 100))
]
Output: {"t": 100, "rejected": "Error"}
Explanation: Since one of the promises rejected, the returned promise also rejected with the same error at the same time.
Example 3:
Input: functions = [
() => new Promise(resolve => setTimeout(() => resolve(4), 50)),
() => new Promise(resolve => setTimeout(() => resolve(10), 150)),
() => new Promise(resolve => setTimeout(() => resolve(16), 100))
]
Output: {"t": 150, "resolved": [4, 10, 16]}
Explanation: All the promises resolved with a value. The returned promise resolved when the last promise resolved.
Constraints:
functions is an array of functions that returns promises1 <= functions.length <= 10Problem Overview: You receive an array of asynchronous functions. Each function returns a promise. Execute all functions in parallel and return a single promise that resolves with their results in the same order. If any promise rejects, the returned promise must reject immediately.
Approach 1: Using Promise Chaining for Resolution (O(n) time, O(n) space)
Create a promise for each async function by calling it immediately so all tasks start in parallel. Use .then() chaining to capture each result and place it at the correct index in a result array. Maintain ordering by storing results based on the original function index rather than completion order. Once all promises resolve, resolve the outer promise with the results array. This mirrors how Promise.all aggregates results internally.
Approach 2: Using Individual Promise Resolution (O(n) time, O(n) space)
Iterate through the array and execute every function immediately so all promises start concurrently. Attach a .then() handler to each promise and store the resolved value in a results array. Track how many promises have completed. When the completion count reaches the number of functions, resolve the main promise with the results array. This approach keeps execution parallel while ensuring ordered output.
Approach 3: Manual Implementation of Promise Handling (O(n) time, O(n) space)
Construct a new promise that internally manages all async calls. For each function, call it and attach both resolve and reject handlers. If any promise rejects, immediately reject the outer promise. Otherwise store the resolved value and continue tracking completions. This approach demonstrates how utilities like Promise.all can be implemented manually using core asynchronous programming and JavaScript promises behavior.
Approach 4: Using a Counter for Resolved Promises (O(n) time, O(n) space)
Initialize a results array and a counter representing how many promises have resolved. Execute each function immediately to ensure parallel execution. When a promise resolves, store the value at its index and increment the counter. Once the counter equals the number of functions, resolve the main promise with the results. This pattern is common in concurrency control when coordinating multiple asynchronous tasks.
Recommended for interviews: The counter-based approach or manual promise handling is usually expected. It proves you understand how parallel asynchronous execution works without relying on built-in helpers like Promise.all. Showing the manual aggregation logic demonstrates strong understanding of promises, ordering guarantees, and failure handling.
This approach involves managing a counter to track resolved promises and ensuring we handle rejection immediately. We loop through each of the asynchronous functions, initiate their execution, and attach then and catch handlers. Using shared variables, we manage the resolved values and first rejection detection.
This code creates a promise that resolves when all asynchronous functions have resolved, or rejects immediately if any promise is rejected. We maintain a results array to store resolved values and a completed counter to know when all functions have resolved. Each function is called, and on success, we store its result and increment the completed counter. Upon completion of all functions, we resolve the promise with the results.
JavaScript
This approach focuses on using individual promise resolution for each function and using a shared state to track the first rejection or when all have completed.
This solution initiates each asynchronous function, attaches promise handlers to manage results, and uses a counter to track the number of resolved promises. On the resolution of any promise, we store its result and increase the counter. If all are resolved, we resolve our overall promise with the results. Any rejection leads to an immediate promise rejection.
JavaScript
This approach manually handles the resolution and rejection of each promise returned by the functions. We'll iterate over the functions list, execute each one in parallel, and use counters or markers to determine when all promises have settled. Upon completion, their results will be consolidated into a single array, keeping track of the order.
JavaScript
Time Complexity: O(n) for n functions and promises.
Space Complexity: O(n) storing the resolved values.
Here, a counter is used to ensure all promises have resolved before resolving the overall promise. This approach maintains state using closure variables to track the number of resolved promises and collects results into predefined storage (array).
JavaScript
Time Complexity: O(n) because each promise executes independently.
Space Complexity: O(n) due to the results array storing each resolved value.
TypeScript
| Approach | Complexity |
|---|---|
| Using Promise Chaining for Resolution |
|
| Using Individual Promise Resolution |
|
| Manual Implementation of Promise Handling | Time Complexity: O(n) for n functions and promises. |
| Using a Counter for Resolved Promises | Time Complexity: O(n) because each promise executes independently. |
| Default Approach | — |
| Approach | Time | Space | When to Use |
|---|---|---|---|
| Promise Chaining for Resolution | O(n) | O(n) | When you want a clean promise-based aggregation pattern similar to Promise.all |
| Individual Promise Resolution | O(n) | O(n) | When managing each promise independently while preserving order |
| Manual Promise Handling | O(n) | O(n) | When implementing custom behavior similar to Promise.all for interviews |
| Counter for Resolved Promises | O(n) | O(n) | Most common interview pattern for coordinating parallel async tasks |
Execute Asynchronous Functions in Parallel | Leetcode 2721 | 30 Days of JavaScript #javascript • Learn With Chirag • 2,306 views views
Watch 9 more video solutions →Practice Execute Asynchronous Functions in Parallel with our built-in code editor and test cases.
Practice on FleetCode