Company: uber_14oct
Difficulty: medium
Security Breaching Problem Description Calculate attacker points in a multi-level cyber attack simulation. An attack progresses through n security levels (1 to n ). The attacker can start at any level i with initial energy k . At each level i : The attacker must spend layers[i] energy to breach that level. If energy is insufficient, the attack fails and ends. If after breaching, remaining energy is greater than or equal to energy[i] , the attacker scores 1 point. Compute an array where the i th element represents the maximum number of points an attacker can score when starting at level i with initial energy k . Return the array of maximum possible scores from each starting level. Complete the function getNumPoints in the editor with the following arguments: int layers[n] : the energy required to breach each layer. int energy[n] : the minimum remaining energy required to score a point after breaching a layer. long int k : the initial energy. Returns: int[n] : the number of points that c