Remainder boxes: Floor ticket
Stuck or curious how this works? Visualize Sorting ↗
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
boxCounts. There are five boxes, numbered 0 to 4. For each number x inreadings, find its box with ((x % 5) + 5) % 5. The % symbol means remainder. This formula also gives a box for negative numbers: -1 goes in box 4. Count the numbers in each box.boxCountsmust contain five counts, in box order 0, 1, 2, 3, 4. - Find the smallest number in
boxCounts. Store it insmallest. - Complete
remainderBoxesFloorTicketso it returnssmallest. Return it, do not print it.
Example
If readings is [-6, 7, 9, 2, 2], then boxCounts is [0, 0, 3, 0, 2] and remainderBoxesFloorTicket returns 0.
Test data
TEST DATA 1: readings is [-9, 15, 0, 10, 15].
TEST DATA 2: readings is [9, -1, 9, 9].
Examples
Input: readings = [-9,15,0,10,15] Output: 0
boxCounts is [4, 1, 0, 0, 0]. The smallest number is 0. Return 0.
Input: readings = [9,-1,9,9] Output: 0
boxCounts is [0, 0, 0, 0, 4]. The smallest number is 0. Return 0.
Input: readings = [] Output: 0
boxCounts is [0, 0, 0, 0, 0]. The smallest number is 0. Return 0.
Input limits
- 0 <= input size <= 64.
- 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 boxCounts 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.