Priority Queue From Scratch | Dataford Interview Questions

Implement a priority queue from scratch.

Use a binary min-heap where lower numeric priorities are removed first, and preserve insertion order when priorities are equal. Implement process_operations(operations), where each operation is ['push', value, priority], ['peek'], ['pop'], or ['is_empty']; return results for query operations only. peek and pop return [value, priority], while is_empty returns a Boolean.

Constraints

1 <= operations.length <= 1000
Each operation is valid and is one of push, peek, pop, or is_empty
A peek or pop operation is executed only when the queue is non-empty
Values are strings
-10^9 <= priority <= 10^9

Function Signature

def process_operations(operations):

Your question is Priority Queue From Scratch. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Implement a priority queue from scratch.

Constraints

1 <= operations.length <= 1000
Each operation is valid and is one of push, peek, pop, or is_empty
A peek or pop operation is executed only when the queue is non-empty
Values are strings
-10^9 <= priority <= 10^9

Function Signature

def process_operations(operations):

Your question is Priority Queue From Scratch. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.