How would you approach a HackerRank-style data structures coding question?
For this exercise, implement a queue using two stacks. The input is a list of enqueue and dequeue operations, and the function returns the values produced by each dequeue, using None when the queue is empty.
Input operations use dictionaries such as {"op": "enqueue", "value": 7} and {"op": "dequeue"}.
def process_operations(operations):