← Back to Recursion
Question 581
Sum A List By Slicing
Sum A List By Slicing
Complete sum_list(values: list[int]) -> int so it returns the sum of the list by recursion, without sum(). The base case is written: an empty list adds up to 0. Add the recursive case, which returns the first value plus the sum of the rest of the list, where the rest is the slice values[1:]. Do NOT write a main block or any top-level test code; the tests construct the calls. Input: one line of integers separated by spaces (it may be empty), which the tests read into a list and pass to your function before printing the value it returns.
Expected Output:
12= newline. The output ends with a newline — print one after the last line.
Hints2 available
Sign in to use hintsTopics:
RecursionSlicing
1
Tab to indent (Esc then Tab to move on) · Ctrl+Enter to run · Ctrl+Space to expand shortcuts (pr, inp, def)
Your Output
Run your code to see the output here...
Test Cases
Run your code to see test case results.