Canceling stamps: Floor ticket
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
remaining. Treatreadingsas a row of stamps. Keep a stack, which is a pile where you can add or remove only the top stamp. Read the stamps from left to right. If the next stamp matches the top stamp, remove the top stamp and do not add the new one. Otherwise, put the new stamp on top.remainingis the final stack, from bottom to top. - Find the smallest number in
remaining. Store it insmallest. - Complete
cancelingStampsFloorTicketso it returnssmallest. Return it, do not print it.
Example
If readings is [1, 7, 7, -9, 11], then remaining is [1, -9, 11] and cancelingStampsFloorTicket returns -9.
Rules
- If
remainingis empty, return 0.
Test data
TEST DATA 1: readings is [-8, 4, 4, 20, 0].
TEST DATA 2: readings is [9, -9, 9, 9].
Examples
Input: readings = [-8,4,4,20,0] Output: -8
remaining is [-8, 20, 0]. The smallest number is -8. Return -8.
Input: readings = [9,-9,9,9] Output: -9
remaining is [9, -9]. The smallest number is -9. Return -9.
Input: readings = [] Output: 0
remaining is []. The list is empty, so 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 remaining 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.