Implement `queueFromStacks(values)` that simulates a FIFO queue using two stacks (arrays with push/pop only), returning the dequeue order.
+ 1 hidden test run on Submit.
Transferring between two LIFO stacks yields FIFO order; each item moves at most twice, so it is O(1) amortized per operation.
Run your code to see results.