Company: iragecapital

Difficulty: easy

Problem Statement

Successive Extract-Min Operations Performing n successive extract-min operations on a binary min-heap that initially contains n elements takes: O(n) O(n log n) O(n²) O(log n)

More iragecapital OA questionsInterview experiences