Leetcode 2636. Promise Pool

Given an array of functions that return Promises and a concurrency limit k, implement a scheduler that runs at most k promises simultaneously and starts a new task as soon as one finishes. The solution should return a Promise that resolves when all tasks complete (typically collecting results in the original order).