This problem deals with printing the median of a stream of integers. At each time step, the median of the integers received so far is printed out.
The candidate's solution is complete and solves the problem. The approach is to use two priority queues, one for the max heap and one for the min heap. The max heap is used to store the smaller half of the numbers and the min heap is used to store the larger half of the numbers. This approach ensures that the median can be calculated in O(1) time.
Evaluated at: 2022-12-01 02:15:42