Fibonacci Under 100 | Dataford Interview Questions

Vizient analytics utilities may need to generate a small Fibonacci sequence for algorithm demonstrations or validation. Write a function that returns every Fibonacci number strictly less than 100, starting with 0 and 1.

The sequence is defined as follows: each number after the first two equals the sum of the two preceding numbers. The result must preserve ascending sequence order and must not include 100 or any larger value.

Formal Specification

Implement generate_fibonacci_under_100() with no arguments. Return a Python list of integers containing all Fibonacci numbers less than 100. The function must return [0, 1] if the upper bound permits only the initial values, and it must not print the values.

Use an iterative approach that maintains the two most recent Fibonacci values. Do not hard-code the expected output.

Constraints

The function takes no arguments.
The fixed upper bound is 100.
Include values strictly less than 100.
Return a list of integers in ascending sequence order, allowing duplicate values.

Function Signature

def generate_fibonacci_under_100():

Your question is Fibonacci Under 100. 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