Min × Max Product After Push / Pop

Requirements

You are given two aligned arrays, each containing n entries: operations, whose entries are either "push" or "pop", and values, which supplies the number for the corresponding action. Following every action, find the smallest and largest values currently present in the multiset, multiply them, and add that product to the output.

min_max_product(operations, values)

Notes

• The specification does not define what should happen when pop names a value absent from the multiset. Confirm the desired interview behavior before implementation, such as ignoring that request or raising an error.
• If an action leaves the multiset empty, its minimum-times-maximum result has no defined value. Ask whether the expected output should use 0 or null.