Fixed 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
windowSums. A window is a group of numbers next to each other. Take each window of exactlyknumbers inreadings, moving one place right each time. Record each window sum from left to right. If the whole input has fewer thanknumbers,windowSumsis empty. - Multiply each number in
windowSumsby 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
fixedPanelsBossReceiptso it returnsweightedTotal. Return it, do not print it.
Example
If readings is [9, -6, 5, 5, 12] and k is 2, then windowSums is [3, -1, 10, 17] and fixedPanelsBossReceipt returns 99.
Rules
- If
windowSumsis empty, return 0. k(a whole number from 1 to 8) is the window size in task 1.
Test data
TEST DATA 1: readings is [0, 13, 4, -10, 13] and k is 7.
TEST DATA 2: readings is [2, 2, -2, 2] and k is 2.
Examples
Input: readings = [0,13,4,-10,13] k = 7 Output: 0
windowSums is []. There are no numbers to multiply or add, so return 0.
Input: readings = [2,2,-2,2] k = 2 Output: 4
windowSums is [4, 0, 0]. Multiply by positions that start at 1: 1 * (4) + 2 * (0) + 3 * (0) = 4. Return 4.
Input: readings = [] k = 1 Output: 0
windowSums 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 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 windowSums 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.