Frequency files: Proof strip
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
counts. Count how many times each different number appears inreadings. Sort the different numbers from smallest to largest. Put their counts in that order incounts. For [5, 2, 5], the numbers are 2 and 5, socountsis [1, 2]. - Complete
frequencyFilesProofStripso it returnscounts. Return it, do not print it.
Example
If readings is [5, 4, -1, 0, 5], then counts is [1, 1, 1, 2] and frequencyFilesProofStrip returns [1, 1, 1, 2].
Rules
- If
countsis empty, return [].
Test data
TEST DATA 1: readings is [0, 17, -12, 17, 19].
TEST DATA 2: readings is [2, 2, 2, -5].
Examples
Input: readings = [0,17,-12,17,19] Output: [1,1,2,1]
counts is [1, 1, 2, 1]. frequencyFilesProofStrip returns that whole list, so return [1, 1, 2, 1].
Input: readings = [2,2,2,-5] Output: [1,3]
counts is [1, 3]. frequencyFilesProofStrip returns that whole list, so return [1, 3].
Input: readings = [] Output: []
counts is []. frequencyFilesProofStrip returns that whole list, so return [].
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 + d log d); extra memory, including the helper list, O(n). n is the input length; d is the number of different values. These labels describe how work and memory grow with the input.
Practice focus
Build counts 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.