Rising labels: Threshold file
Stuck or curious how this works? Visualize Binary Search ↗
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
risingLengths. A subsequence keeps numbers in their original order but may skip some numbers. For each position inreadings, find the longest strictly increasing subsequence that ends at that position. Strictly increasing means each next number must be larger; equal numbers do not count as an increase. Record the length, not the chosen numbers. Put one length per position inrisingLengths. - Count the numbers in
risingLengthsthat are at leastk(greater than or equal tok). Store the count inatLeastK. - Complete
risingLabelsThresholdFileso it returnsatLeastK. Return it, do not print it.
Example
If readings is [7, 9, -7, 7, 1] and k is 3, then risingLengths is [1, 2, 1, 2, 2] and risingLabelsThresholdFile returns 0.
Rules
- If
risingLengthsis 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 [0, -10, 13, 14, 14] and k is 1.
TEST DATA 2: readings is [3, 3, 3, -7] and k is 2.
Examples
Input: readings = [0,-10,13,14,14] k = 1 Output: 5
risingLengths is [1, 1, 2, 3, 3]. Here k is 1. The numbers at least 1 are [1, 1, 2, 3, 3]. There are 5, so return 5.
Input: readings = [3,3,3,-7] k = 2 Output: 0
risingLengths is [1, 1, 1, 1]. Here k is 2. The numbers at least 2 are []. There are 0, so return 0.
Input: readings = [] k = 3 Output: 0
risingLengths 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 risingLengths 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.