Magnitude order: Threshold file
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]. - Count the numbers in
byDistancethat are at leastk(greater than or equal tok). Store the count inatLeastK. - Complete
magnitudeOrderThresholdFileso it returnsatLeastK. Return it, do not print it.
Example
If readings is [-9, 2, 4, 4, 3] and k is 3, then byDistance is [2, 3, 4, 4, -9] and magnitudeOrderThresholdFile returns 3.
Rules
- If
byDistanceis empty, the count is 0. k(a whole number from 1 to 8) is the threshold in task 2: compare each number with it.
Test data
TEST DATA 1: readings is [20, 19, 20, -10, 0] and k is 7.
TEST DATA 2: readings is [-7, 4, 4, 4] and k is 1.
Examples
Input: readings = [20,19,20,-10,0] k = 7 Output: 3
byDistance is [0, -10, 19, 20, 20]. Here k is 7. The numbers at least 7 are [19, 20, 20]. There are 3, so return 3.
Input: readings = [-7,4,4,4] k = 1 Output: 3
byDistance is [4, 4, 4, -7]. Here k is 1. The numbers at least 1 are [4, 4, 4]. There are 3, so return 3.
Input: readings = [] k = 3 Output: 0
byDistance is []. Here k is 3. The numbers at least 3 are []. There are 0, so return 0.
Input limits
- 0 <= input size <= 64.
- k is a whole number from 1 to 8. 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.