LeetCode - 502. IPO - TypeScript and JavaScript

LeetCode: leetcode.com/problems/ipo/sol...
GitHub: github.com/RuslanTsykaliak/Le...
Intuition
The problem is asking to maximize the profit by doing at most k projects with an initial capital w. The intuition here is to always choose the project with the maximum profit among the projects we can afford to start.
Approach
First, we create a list of projects, each represented as a pair of profit and required capital. We sort this list by required capital.
We create a priority queue (max heap) of projects, prioritized by profit.
We initialize the index of the current project being considered.
We iterate over the projects. For each project, we add any projects that can be started to the priority queue.
If there are no more projects that can be started, we break the loop.
We start the project with the highest profit from those in the queue, and add its profit to the capital.
We repeat this process until we have started k projects or there are no more projects that can be started.
Finally, we return the final capital.