Undo drawer: Even-key census
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
stack. Use a stack, which is a pile where you add and remove items only at the top. Readreadingsfrom left to right. A number of 0 or more adds that number to the top. A negative number tells you how many top items to remove: -3 means remove up to three items. Stop if the stack becomes empty.stackis the final stack, from bottom to top. - Count the even numbers in
stack. Store the count inevenCount. A number is even when it divides by 2 with no remainder. - Complete
undoDrawerEvenKeyCensusso it returnsevenCount. Return it, do not print it.
Example
If readings is [2, -3, 2, 6, 6], then stack is [2, 6, 6] and undoDrawerEvenKeyCensus returns 3.
Rules
- 0 counts as an even number.
- If
stackis empty, return 0.
Test data
TEST DATA 1: readings is [16, 16, 0, 20, -6].
TEST DATA 2: readings is [8, 8, 8, -4].
Examples
Input: readings = [16,16,0,20,-6] Output: 0
stack is []. The even numbers are []. There are 0, so return 0.
Input: readings = [8,8,8,-4] Output: 0
stack is []. The even numbers are []. There are 0, so return 0.
Input: readings = [] Output: 0
stack is []. The even numbers are []. There are 0, 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 stack 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.