Neighbor notes: Proof strip
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
differences. Start at the second number inreadings. Subtract the number just before it from the current number. Repeat for each later number. Put the answers in order. For [5, 8, 2],differencesis [3, -6]. A list with fewer than two numbers gives an emptydifferences. - Complete
neighborNotesProofStripso it returnsdifferences. Return it, do not print it.
Example
If readings is [5, 0, -2, 3, 5], then differences is [-5, -2, 5, 2] and neighborNotesProofStrip returns [-5, -2, 5, 2].
Rules
- If
differencesis empty, return [].
Test data
TEST DATA 1: readings is [19, 4, 4, 0, -7].
TEST DATA 2: readings is [5, 5, 5, -4].
Examples
Input: readings = [19,4,4,0,-7] Output: [-15,0,-4,-7]
differences is [-15, 0, -4, -7]. neighborNotesProofStrip returns that whole list, so return [-15, 0, -4, -7].
Input: readings = [5,5,5,-4] Output: [0,0,-9]
differences is [0, 0, -9]. neighborNotesProofStrip returns that whole list, so return [0, 0, -9].
Input: readings = [] Output: []
differences is []. neighborNotesProofStrip returns that whole list, so return [].
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 differences 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.