Priority basket: Total receipt
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. - Add up every number in
removalOrder. Store the sum intotal. - Complete
priorityBasketTotalReceiptso it returnstotal. Return it, do not print it.
Example
If readings is [-2, 3, 3, 6, 6], then removalOrder is [-2, 3, 3, 6, 6] and priorityBasketTotalReceipt returns 16.
Rules
- If
removalOrderis empty,totalis 0.
Test data
TEST DATA 1: readings is [15, 19, 0, 15, -6].
TEST DATA 2: readings is [5, 5, -9, 5].
Examples
Input: readings = [15,19,0,15,-6] Output: 43
removalOrder is [-6, 0, 15, 15, 19]. Add its numbers to get 43. Return 43.
Input: readings = [5,5,-9,5] Output: 6
removalOrder is [-9, 5, 5, 5]. Add its numbers to get 6. Return 6.
Input: readings = [] Output: 0
removalOrder is []. Add its numbers to get 0. 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.