Amadeus Core Engineering OA 2026 | Maximum Task Scheduling & House Robber on Binary Tree

Problem 1 - Maximize Server Allocation (Greedy Scheduling with Priority Queues) Problem Statement You are given a list of tasks where: tasks[i] = [processingTime, deadline] Each task requires processingTime units of execution time and must finish on or before its deadline. Only one task can be executed at a time and tasks cannot be interrupted once started. Determine the maximum number of tasks that can be completed before their deadlines. Constraints Constraint 1 ≤ N ≤ 100000 1 ≤ processingTime, ...