Xor register: Proof strip
Stuck or curious how this works? Visualize Binary Search ↗
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
xorValues. Start a stored number at 0. Readreadingsfrom left to right. Combine the stored number and the next number with bitwise XOR. XOR compares their binary digits: matching digits give 0, and different digits give 1. Use leading zeros when needed. For example, 3 XOR 5 is 6 because 011 XOR 101 gives 110. Record the stored number after each update. - Complete
xorRegisterProofStripso it returnsxorValues. Return it, do not print it.
Example
If readings is [7, 9, 7, 3, 7], then xorValues is [7, 14, 9, 10, 13] and xorRegisterProofStrip returns [7, 14, 9, 10, 13].
Rules
- If
xorValuesis empty, return [].
Test data
TEST DATA 1: readings is [4, 18, 4, 0, 4].
TEST DATA 2: readings is [6, 6, 5, 6].
Examples
Input: readings = [4,18,4,0,4] Output: [4,22,18,18,22]
xorValues is [4, 22, 18, 18, 22]. xorRegisterProofStrip returns that whole list, so return [4, 22, 18, 18, 22].
Input: readings = [6,6,5,6] Output: [6,0,5,3]
xorValues is [6, 0, 5, 3]. xorRegisterProofStrip returns that whole list, so return [6, 0, 5, 3].
Input: readings = [] Output: []
xorValues is []. xorRegisterProofStrip 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 are whole numbers from 0 through 20.
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 xorValues 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.