InterviewDigestCoding Assessment2026-08-12
Solve two coding problems involving Greedy Algorithms and Max Heap within a 1-hour timeframe.
AI-Expanded — inferred from the question title, not from the original candidate report
Given an array of tasks with varying durations and deadlines, use a greedy approach to schedule the maximum number of tasks that can be completed by their respective deadlines. Then, implement a solution to find the k-th largest element in a dynamic stream of incoming integers by efficiently maintaining a min-heap of size k to ensure optimal time complexity.
Context & Summary
First round of the IBM On-Campus Drive 2025, conducted online and proctored. Candidates solved 2 coding questions within 1 hour, focusing on Greedy Algorithms and Max Heap.
💻 Coding practice works best on desktop.
Code editors are too cramped on mobile screens.
Loading editor...
AI can automatically infer and generate example test cases for this question based on standard algorithmic constraints.