Expanding panels: Boss receipt
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. - Multiply each number in
shortestLengthsby its position, counting from 1: the first number by 1, the second by 2, and so on. - Add those products. Store the sum in
weightedTotal. - Complete
expandingPanelsBossReceiptso it returnsweightedTotal. Return it, do not print it.
Example
If readings is [5, 7, 3, 8, 7] and k is 2, then shortestLengths is [1, 1, 1, 1, 1] and expandingPanelsBossReceipt returns 15.
Rules
- If
shortestLengthsis empty, 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 [20, 0, 3, 10, 20] and k is 6.
TEST DATA 2: readings is [2, 2, 1, 2] and k is 3.
Examples
Input: readings = [20,0,3,10,20] k = 6 Output: 23
shortestLengths is [1, 2, 3, 1, 1]. Multiply by positions that start at 1: 1 * (1) + 2 * (2) + 3 * (3) + 4 * (1) + 5 * (1) = 23. Return 23.
Input: readings = [2,2,1,2] k = 3 Output: 18
shortestLengths is [0, 2, 2, 2]. Multiply by positions that start at 1: 1 * (0) + 2 * (2) + 3 * (2) + 4 * (2) = 18. Return 18.
Input: readings = [] k = 8 Output: 0
shortestLengths is []. There are no numbers to multiply or add, 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 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.