Priority basket: Floor ticket
Stuck or curious how this works? Visualize Binary Heap Operations ↗
Inputs
readings is a list of integers (numbers with no decimal part). It may be empty, and numbers may repeat unless task 1 says otherwise.
Your tasks
- Create a list
removalOrder. Put all numbers fromreadingsinto a min-heap. A min-heap is a tree-shaped collection that keeps its smallest number at the top. Remove the smallest number, record it, and repeat until the heap is empty. Keep repeated numbers.removalOrderis the removal order. - Find the smallest number in
removalOrder. Store it insmallest. - Complete
priorityBasketFloorTicketso it returnssmallest. Return it, do not print it.
Example
If readings is [5, 3, 5, 2, -5], then removalOrder is [-5, 2, 3, 5, 5] and priorityBasketFloorTicket returns -5.
Rules
- If
removalOrderis empty, return 0.
Test data
TEST DATA 1: readings is [0, 5, -4, 13, 5].
TEST DATA 2: readings is [-2, 7, 7, 7].
Examples
Input: readings = [0,5,-4,13,5] Output: -4
removalOrder is [-4, 0, 5, 5, 13]. The smallest number is -4. Return -4.
Input: readings = [-2,7,7,7] Output: -2
removalOrder is [-2, 7, 7, 7]. The smallest number is -2. Return -2.
Input: readings = [] Output: 0
removalOrder is []. The list is empty, so return 0.
Input limits
- 0 <= input size <= 64.
- Answers fit in a signed 32-bit integer: -2,147,483,648 through 2,147,483,647.
- Input numbers have no decimal part. They range from -1,000,000 to 1,000,000. Follow any extra input rules in task 1.
Efficiency goal
Big-O describes how the work or memory needed grows as the input gets larger.
Efficiency goal: time O(n log n); extra memory, including the helper list, O(n). n is the input length. These labels describe how work and memory grow with the input.
Practice focus
Build removalOrder first, then return exactly what the tasks ask for. Follow the order, keep repeated values when the rule says so, and check the empty case.