CJCoding With Joseph
15free / daySign inCreate account

Length Without Len

Complete length(values: list[int]) -> int so it returns how many items the list holds, by recursion and without calling len(). The base case is written: an empty list has 0 items. Add the recursive case, which returns 1 plus the length of 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:

4

= newline. The output ends with a newline — print one after the last line.

Hints2 available
Topics:
RecursionSlicing
📥 Auto-Input:
3 8 2 9\n
This input is automatically fed to your program's stdin
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.