Quick Overview

Implement a minimum binary heap from scratch in a zero-indexed array, supporting insertion and removal of the smallest value. Handle duplicate and negative integers, empty removals, and up to 500,000 operations without a built-in priority queue.

Implement a Min-Heap with Insert and Remove-Min

Company: Pony.Ai

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Technical Screen

Overview: Implement a minimum binary heap from scratch in a zero-indexed array, supporting insertion and removal of the smallest value. Handle duplicate and negative integers, empty removals, and up to 500,000 operations without a built-in priority queue.

Loading…