How should I practice Execute a Min-Heap Operation Sequence?

Start by reading the full statement, solve the visible examples, then compare the pattern against related pony.ai phone screen problems in FastPrep.

Is Execute a Min-Heap Operation Sequence associated with pony.ai?

FastPrep tags this as a pony.ai phone screen coding practice problem when the problem catalog has that company and stage context.

Problem · Array

● Medium

pony.aiFULLTIMEPHONE SCREEN

Implement a min-heap from scratch and execute an ordered batch of operations.

The arrays operations and values have equal length. Each operation is one of:

insert: insert values[i] into the heap and append null to the result.
removeMin: remove and append the minimum value as a decimal string. If the heap is empty, append null. The corresponding values[i] is ignored.

Duplicate values are stored independently. Return one result string for every operation in the same order.

Do not use a built-in heap or priority-queue data structure.

runMinHeap(operations: String[], values: int[]) → String[]

operations = ["insert", "insert", "removeMin", "removeMin", "removeMin"]values = [5, 2, 0, 0, 0]return = ["null", "null", "2", "5", "null"]

The two inserted values are removed in increasing order. The last removal sees an empty heap.

operations = ["insert", "insert", "insert", "removeMin", "removeMin"]values = [-3, -3, 4, 0, 0]return = ["null", "null", "null", "-3", "-3"]

Both copies of -3 are retained and removed independently.

operations = ["removeMin", "insert", "removeMin"]values = [0, 7, 0]return = ["null", "null", "7"]

An empty removal does not prevent a later insertion and successful removal.