Fibonacci Series Coding | Dataford Interview Questions

DXC Platform X services may need a predictable sequence of Fibonacci-based values for workload simulation and test data generation. Given a non-negative integer n and a positive modulus mod, return the first n Fibonacci numbers, with every value reduced modulo mod.

The sequence starts with F(0) = 0 and F(1) = 1. Each later value is calculated as F(i) = F(i - 1) + F(i - 2). The returned list must preserve this order.

Formal Specification

Implement fibonacci_series(n, mod).

Input: n, an integer representing the number of terms, and mod, a positive integer modulus.
Output: A list of n integers, where the element at index i is F(i) % mod.
For n = 0, return an empty list.
The implementation should run in linear time and avoid recursive recomputation.

Constraints

0 <= n <= 1,000,000
1 <= mod <= 10^9
Return exactly n values
Each returned value is between 0 and mod - 1

Function Signature

def fibonacci_series(n, mod):

Your question is Fibonacci Series Coding. 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