IBM cic both Codes are available

def findStarvation(priorities):
    p = priorities
    n = len(p)
    starve = [0] * n
    
    for i in range(n):
        mi = -1
        cp = p[i]
        
        for j in range(i + 1, n):
            if p[j] < cp:
                mi = max(mi, j)
        
        if mi != -1:
            starve[i] = mi - i
            
    return starve

import os
import sys

def getNumberOfOperations(arr):
    n = len(arr)
    if n == 0:
        return 0
    t = arr[n - 1]
    for i in range(n - 2, -1, -1):
        x = arr[i]
        if x > t:
            t = x
        else:
            t += 1
    return t

Cognizant ONCAMPUS - communication Help done ✅