Back Clear
# Your Problem: # Given an array of ints, compute recursively if the array contains a 6. # 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. # # # array6({1, 6, 4}, 0) → true # array6({1, 4}, 0) → false # array6({6}, 0) → true # # 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 getArray6(nums:List[int], index:int) -> bool: # CODE END # Press Ctrl+E (Command+E on mac) to test your code