Get Minimum Time ⏰

Thoughtspot interview question: A coding interview problem with n services and m requests. cache[i] specifies the service where each request is cached. Serving from cache takes 1 unit, otherwise 2. Different services can run in parallel, but each can handle only one request at a time. The problem asks for the minimum total time required to process all requests.