import collections
import math

def getNumberOfProcess(processTime, totalTime):
    Q = collections.deque(processTime)
    c = 0
    while Q and totalTime > 0:
        if len(Q) == 1:
            t = Q[0]
            if totalTime >= t:
                totalTime -= t
                c += 1
                Q.popleft()
            else:
                break
        else:
            f = Q[0]
            l = Q[-1]
            tf = 2 * f - 1
            tl = 2 * l
            ts = min(tf, tl)
            if totalTime >= ts:
                totalTime -= ts
                c += 1
                hf = math.ceil(ts / 2)
                hl = math.floor(ts / 2)
                if tf <= tl:
                    Q.popleft()
                    if Q:
                        Q[-1] -= hl
                else:
                    Q.pop()
                    if Q:
                        Q[0] -= hf
            else:
                if Q[0] <= math.ceil(totalTime / 2):
                    c += 1
                if len(Q) > 1 and Q[-1] <= math.floor(totalTime / 2):
                    c += 1
                totalTime = 0
                break
    return c

def reassignedPriorities(priorities):
    uniq = sorted(set(priorities))
    rank = {v: i + 1 for i, v in enumerate(uniq)}
    return [rank[v] for v in priorities]

def getLimitBreaches(timestamps, userIds, actions, m):
    active = {}
    breach = set()

    for uid, act in zip(userIds, actions):
        c = active.get(uid, 0)
        if act == "login":
            c += 1
            if c > m:
                breach.add(uid)
        elif act == "logout" and c > 0:
            c -= 1
        active[uid] = c

    return sorted(breach)

Today All placement exams Help available

Cognizant OFFCAMPUS - communication Help done ✅