Odd Numbers With Recursion | Dataford Interview Questions

In an Incedo analytics utility, generate a sequence of odd numbers for an inclusive integer range. Write a recursive function that returns all odd integers from start through end in ascending order. The caller may print the returned values.

Your solution must use recursion and must not use for or while loops. Handle ranges where start is even or odd. If start is greater than end, return an empty list.

Formal Specification

Implement odd_numbers(start, end):

Input: Two integers, start and end.
Output: A list containing every odd integer x such that start <= x <= end, ordered from smallest to largest.
The function must make progress toward the base case on every recursive call.

Constraints

-10^4 <= start <= 10^4
-10^4 <= end <= 10^4
The range contains at most 2 * 10^4 + 1 integers
Use recursion and no for or while loops

Function Signature

def odd_numbers(start, end):

Your question is Odd Numbers With Recursion. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem