Magnitude order: Positive-ink invoice
Stuck or curious how this works? Visualize Sorting ↗
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
byDistance. Sortreadingsby distance from 0, from nearest to farthest. This distance is called absolute value: both -4 and 4 have distance 4. When two numbers have the same distance, put the smaller number first. Keep all repeated numbers. For [3, -2, 2, -3],byDistanceis [-2, 2, -3, 3]. - Add only the numbers in
byDistancethat are greater than 0. Store the sum inpositiveTotal. - Complete
magnitudeOrderPositiveInkInvoiceso it returnspositiveTotal. Return it, do not print it.
Example
If readings is [-4, 4, 4, 3, 3], then byDistance is [3, 3, -4, 4, 4] and magnitudeOrderPositiveInkInvoice returns 14.
Rules
- Skip 0 and negative numbers.
- If no number is greater than 0, return 0.
Test data
TEST DATA 1: readings is [8, 0, 3, -9, 3].
TEST DATA 2: readings is [-4, 6, 6, 6].
Examples
Input: readings = [8,0,3,-9,3] Output: 14
byDistance is [0, 3, 3, 8, -9]. Keep [3, 3, 8] and add those numbers. Return 14.
Input: readings = [-4,6,6,6] Output: 18
byDistance is [-4, 6, 6, 6]. Keep [6, 6, 6] and add those numbers. Return 18.
Input: readings = [] Output: 0
byDistance is []. Keep [] and add those numbers. 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 byDistance 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.