Duplicate carriage: Threshold file
Stuck or curious how this works? Visualize Two Pointers ↗
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
distinctSorted.readingsis already sorted from smallest to largest. Keep only one copy of each number. Put these numbers indistinctSortedin sorted order. - Count the numbers in
distinctSortedthat are at leastk(greater than or equal tok). Store the count inatLeastK. - Complete
duplicateCarriageThresholdFileso it returnsatLeastK. Return it, do not print it.
Example
If readings is [-1, 0, 4, 4, 12] and k is 5, then distinctSorted is [-1, 0, 4, 12] and duplicateCarriageThresholdFile returns 1.
Rules
- If
distinctSortedis 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 [-6, 0, 9, 11, 11] and k is 5.
TEST DATA 2: readings is [-6, 5, 5, 5] and k is 3.
Examples
Input: readings = [-6,0,9,11,11] k = 5 Output: 2
distinctSorted is [-6, 0, 9, 11]. Here k is 5. The numbers at least 5 are [9, 11]. There are 2, so return 2.
Input: readings = [-6,5,5,5] k = 3 Output: 1
distinctSorted is [-6, 5]. Here k is 3. The numbers at least 3 are [5]. There are 1, so return 1.
Input: readings = [] k = 7 Output: 0
distinctSorted is []. Here k is 7. The numbers at least 7 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); 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 distinctSorted 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.