Taller keycaps: Positive-ink invoice
Stuck or curious how this works? Visualize Stack Operations ↗
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
stepsToTaller. For each number inreadings, look to its right. Find the first number that is larger, not equal. Record how many places to the right it is. Record 0 if no larger number is found. Keep the answers in input order. - Add only the numbers in
stepsToTallerthat are greater than 0. Store the sum inpositiveTotal. - Complete
tallerKeycapsPositiveInkInvoiceso it returnspositiveTotal. Return it, do not print it.
Example
If readings is [5, -8, 5, 2, 9], then stepsToTaller is [4, 1, 2, 1, 0] and tallerKeycapsPositiveInkInvoice returns 8.
Rules
- Skip zeros.
- If no number is greater than 0, return 0.
Test data
TEST DATA 1: readings is [4, 4, -11, 9, 0].
TEST DATA 2: readings is [4, 4, 4, -1].
Examples
Input: readings = [4,4,-11,9,0] Output: 6
stepsToTaller is [3, 2, 1, 0, 0]. Keep [3, 2, 1] and add those numbers. Return 6.
Input: readings = [4,4,4,-1] Output: 0
stepsToTaller is [0, 0, 0, 0]. Keep [] and add those numbers. Return 0.
Input: readings = [] Output: 0
stepsToTaller 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); 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 stepsToTaller 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.