Facing cards: Total receipt
Stuck or curious how this works? Visualize Two Pointers ↗
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
pairSums.readingsis already sorted from smallest to largest. Pair its first and last numbers, then its second and second-last numbers. Keep moving toward the middle. Add the two numbers in each pair and record that sum. If one middle number is left, record it by itself. Keep this pair order inpairSums. - Add up every number in
pairSums. Store the sum intotal. - Complete
facingCardsTotalReceiptso it returnstotal. Return it, do not print it.
Example
If readings is [-5, 5, 7, 7, 8], then pairSums is [3, 12, 7] and facingCardsTotalReceipt returns 22.
Rules
- If
pairSumsis empty,totalis 0.
Test data
TEST DATA 1: readings is [-10, 0, 4, 4, 19].
TEST DATA 2: readings is [-7, 5, 5, 5].
Examples
Input: readings = [-10,0,4,4,19] Output: 17
pairSums is [9, 4, 4]. Add its numbers to get 17. Return 17.
Input: readings = [-7,5,5,5] Output: 8
pairSums is [-2, 10]. Add its numbers to get 8. Return 8.
Input: readings = [] Output: 0
pairSums is []. Add its numbers to get 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 pairSums 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.