Expanding panels: Positive-ink invoice
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
shortestLengths. All numbers inreadingsare 0 or greater. For each position, find the shortest group that ends at that position and has a sum of at leastk. The group must contain at least one number, and its numbers must be next to each other. Record the length of that group. Record 0 if no such group exists. Put one answer per position inshortestLengths. - Add only the numbers in
shortestLengthsthat are greater than 0. Store the sum inpositiveTotal. - Complete
expandingPanelsPositiveInkInvoiceso it returnspositiveTotal. Return it, do not print it.
Example
If readings is [7, 8, 2, 2, 2] and k is 1, then shortestLengths is [1, 1, 1, 1, 1] and expandingPanelsPositiveInkInvoice returns 5.
Rules
- Skip zeros.
- If no number is greater than 0, return 0.
k(a whole number from 1 to 8) is the sum each group in task 1 must reach.
Test data
TEST DATA 1: readings is [9, 0, 2, 1, 9] and k is 4.
TEST DATA 2: readings is [5, 1, 5, 5] and k is 2.
Examples
Input: readings = [9,0,2,1,9] k = 4 Output: 11
shortestLengths is [1, 2, 3, 4, 1]. Keep [1, 2, 3, 4, 1] and add those numbers. Return 11.
Input: readings = [5,1,5,5] k = 2 Output: 5
shortestLengths is [1, 2, 1, 1]. Keep [1, 2, 1, 1] and add those numbers. Return 5.
Input: readings = [] k = 5 Output: 0
shortestLengths is []. Keep [] and add those numbers. 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 are whole numbers from 0 through 20.
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 shortestLengths 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.