Implement a Min-Priority Queue Without a Library Heap

Company: Amazon

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Overview: Implement a min-priority queue without a library heap. Support duplicate integers, push, peek, pop, and size operations efficiently while returning deterministic results for empty-queue queries.