Agoda, Recently Asked Online Assessments in 2026 | Parallel Task Scheduling | Greedy Algorithms & Two Pointers | Campus Assessment

Question `: Parallel Task Scheduling Problem Statement: Given an array taskMemory of n positive integers representing memory required for each task, an array taskType of n positive integers representing task types, and an integer maxMemory, find the minimum time required to process all tasks. Each task takes 1 unit of time. The server can process at most two tasks in parallel only if they are the same type and together require no more than maxMemory units. Example: Suppose n = ...