02_IPO.py

# Question link - https://leetcode.com/problems/ipo/description/?envType=study-plan-v2&envId=top-interview-150

class Solution:
    def findMaximizedCapital(self, k: int, w: int, profits: List[int], capital: List[int]) -> int:
        maxProfit = [] #This is for maxProfit in heap 
        minCapital = [(c,p) for c,p in zip(capital , profits)]
        heapq.heapify(minCapital)

        for i in range(k):

            while  minCapital and minCapital[0][0] <= w:
                c,p = heapq.heappop(minCapital)
                heapq.heappush(maxProfit , -1 * p)

            if not maxProfit:
                break

            w += -1 * heapq.heappop(maxProfit)
        return w