Quicken | Coding OA Questions and Solutions | Meeting Arrangements | Minimum Cost Room Allocation | Sep 2022

Problem Statement: Meeting Arrangements The Scenario: You are given N meetings that need to be arranged. There are M available rooms, each with a specific acquisition price denoted by the array A (where A[i] is the price of the ith room). The Rules: Room Acquisition: To use a room for the first time, you must pay its full price A[i]. Once acquired, that room becomes free for all subsequent meetings you host in it. Concurrency: A single room can host ...