Horizontal Pod Autoscaler

Problem Statement

Horizontal Pod Autoscaler Problem Description A platform team runs n microservices. Service i currently runs pods[i] pods. Traffic changes are recorded in an event log of m entries. Each entry logs[i] is a list of three integers and is applied in order, on top of the result of every earlier entry: [1, p, x] : the pod count of the p -th microservice (1-based) becomes exactly x . [2, -1, x] : every microservice whose pod count is strictly less than x is raised to x . A service already at x or above is left alone. Report the pod count of every microservice once the whole log has been applied. Function Description Complete the function findPodCount : int n : the number of microservices. int pods[n] : the starting pod count of each microservice. int m : the number of log entries. int logs[m][3] : the event log. Returns int[n] : the i -th element is the final pod count of the i -th microservice. Input Format The first line contains the integer n . The second line contains n space-separated i