Digit workshop: Boss receipt
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
digitSums. Find the digit sum of each number inreadings. Ignore a minus sign, then add the digits. For example, -305 gives 3 + 0 + 5 = 8. The digit sum of 0 is 0. Keep the answers in input order. - Multiply each number in
digitSumsby its position, counting from 1: the first number by 1, the second by 2, and so on. - Add those products. Store the sum in
weightedTotal. - Complete
digitWorkshopBossReceiptso it returnsweightedTotal. Return it, do not print it.
Example
If readings is [7, 8, -3, 2, 7], then digitSums is [7, 8, 3, 2, 7] and digitWorkshopBossReceipt returns 75.
Rules
- If
digitSumsis empty, return 0.
Test data
TEST DATA 1: readings is [13, 13, -5, 14, 0].
TEST DATA 2: readings is [4, -8, 4, 4].
Examples
Input: readings = [13,13,-5,14,0] Output: 47
digitSums is [4, 4, 5, 5, 0]. Multiply by positions that start at 1: 1 * (4) + 2 * (4) + 3 * (5) + 4 * (5) + 5 * (0) = 47. Return 47.
Input: readings = [4,-8,4,4] Output: 48
digitSums is [4, 8, 4, 4]. Multiply by positions that start at 1: 1 * (4) + 2 * (8) + 3 * (4) + 4 * (4) = 48. Return 48.
Input: readings = [] Output: 0
digitSums is []. There are no numbers to multiply or add, 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 digitSums 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.