Fibonacci Sequence Generation | Dataford Interview Questions

Oura Ring features may use simple recurrence-based projections from two starting measurements. Given two non-negative integers that seed a Fibonacci-like sequence, generate the next 10 numbers.

Each new number is the sum of the two preceding numbers. Return only the 10 generated values, not the original seeds.

Formal Specification

Implement generate_sequence(first, second), where first and second are non-negative integers. Return a list containing exactly 10 integers. The first generated value is first + second; each later value is the sum of the two immediately preceding sequence values.

You may assume Python integer arithmetic is sufficient and that both inputs satisfy the stated constraints.

Constraints

0 <= first, second <= 10^9
The returned list must contain exactly 10 values
The seeds are non-negative integers
The returned list must exclude the two seed values

Function Signature

def generate_sequence(first, second):

Your question is Fibonacci Sequence Generation. 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