Back Clear
# Your Problem: # Given an array of ints, compute recursively the number of times that the # value 11 appears in the array. We'll use the convention of considering only # the part of the array that begins at the given index. In this way, a # recursive call can pass index+1 to move down the array. The initial call # will pass in index as 0. # # # array11({1, 2, 11}, 0) → 1 # array11({11, 11}, 0) → 2 # array11({1, 2, 3, 4}, 0) → 0 # # Credit for this problem goes to Nick Parlante from CodingBat.com # Do not modify anything outside of the function or the function itself. # CODE START def getArray11(nums:List[int], index:int) -> int: # CODE END # Press Ctrl+E (Command+E on mac) to test your code