Coding: Stack And Queue | Dataford Interview Questions

During processing of JPMorganChase payment operations, implement two independent data structures. The first is a stack supporting constant-time minimum lookup. The second is a FIFO queue implemented using two stacks.

Write one function that processes both operation lists and returns their observable results.

Formal Specification

Implement solve_stack_queue_tasks(stack_ops, queue_ops):

stack_ops is a list of operations in the form ["push", value], ["pop"], or ["get_min"]. Return the values produced by every pop and get_min, in order.
queue_ops is a list of operations in the form ["enqueue", value], ["dequeue"], or ["peek"]. Return the values produced by every dequeue and peek, in order.
Return a dictionary with keys "stack" and "queue".
Operations that remove or inspect an empty structure will not appear in valid input.

Constraints

1 <= len(stack_ops), len(queue_ops) <= 10^5
Values are integers in [-10^9, 10^9]
Each operation is valid for the current structure state
Operation names are exactly push, pop, get_min, enqueue, dequeue, or peek

Function Signature

def solve_stack_queue_tasks(stack_ops, queue_ops):

Your question is Coding: Stack And Queue. 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