Company: Ciena_11nov
Difficulty: medium
Horizontal Pod Autoscaler Problem Description Developers are optimizing their horizontal pod autoscaler for their microservices. There are n microservices, and the number of pods for the i th microservice is pods[i] . According to traffic patterns, the number of pods for a service can increase or decrease. Additionally, at specific times when there is expected traffic, all services with fewer than x pods are assigned x pods. There is an event log of size m , described as a 2D array logs where logs[i] is an array of integers of size 3. The logs have the following interpretations: [1, p, x] : The number of pods of the p th microservice is changed to x ( 1 ). [2, -1, x] : All microservices whose number of pods is less than x are changed to x . Your task is to find the resulting number of pods for each microservice after processing all the logs. Function Description Complete the function findPodCount in the editor with the following parameters: int pods[n] : the number of pods for the micr