Window pegs: Boss receipt
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
windowMaxes. Take every group of exactlyknumbers next to each other inreadings. Move the group one place right each time. Record the largest number in each group, from left to right. Ifkis larger than the input length,windowMaxesis empty. - Multiply each number in
windowMaxesby 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
windowPegsBossReceiptso it returnsweightedTotal. Return it, do not print it.
Example
If readings is [-1, 2, 4, 4, 2] and k is 8, then windowMaxes is [] and windowPegsBossReceipt returns 0.
Rules
- If
windowMaxesis 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 [14, -11, 0, 5, 5] and k is 4.
TEST DATA 2: readings is [-2, 4, 4, 4] and k is 7.
Examples
Input: readings = [14,-11,0,5,5] k = 4 Output: 24
windowMaxes is [14, 5]. Multiply by positions that start at 1: 1 * (14) + 2 * (5) = 24. Return 24.
Input: readings = [-2,4,4,4] k = 7 Output: 0
windowMaxes is []. There are no numbers to multiply or add, so return 0.
Input: readings = [] k = 4 Output: 0
windowMaxes 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 windowMaxes 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.