Prefix stencils: Floor ticket
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
rangeSums. For each position inreadings, add the current number and up tok- 1 numbers just before it. Stop at the start of the input if needed. Record each sum, from left to right. Forreadings= [2, 3, 4] andk= 2,rangeSumsis [2, 5, 7]. - Find the smallest number in
rangeSums. Store it insmallest. - Complete
prefixStencilsFloorTicketso it returnssmallest. Return it, do not print it.
Example
If readings is [-8, 5, 8, 9, 9] and k is 6, then rangeSums is [-8, -3, 5, 14, 23] and prefixStencilsFloorTicket returns -8.
Rules
- If
rangeSumsis empty, return 0. k(a whole number from 1 to 8) is the most numbers each sum in task 1 may include.
Test data
TEST DATA 1: readings is [-8, 4, 8, 0, 4] and k is 8.
TEST DATA 2: readings is [3, 3, -7, 3] and k is 5.
Examples
Input: readings = [-8,4,8,0,4] k = 8 Output: -8
rangeSums is [-8, -4, 4, 4, 8]. The smallest number is -8. Return -8.
Input: readings = [3,3,-7,3] k = 5 Output: -1
rangeSums is [3, 6, -1, 2]. The smallest number is -1. Return -1.
Input: readings = [] k = 6 Output: 0
rangeSums is []. The list is empty, 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 rangeSums 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.