Fibonacci and Linked List Coding | Dataford Interview Questions

Solve a Fibonacci series and a linked list coding problem.

Implement solve(n, values), returning the first n Fibonacci numbers and the values of a singly linked list in reverse order. The linked list is provided as a list of node values for testability; preserve duplicate and negative values.

Input: non-negative integer n and a list of integers values. Output: [fibonacci_values, reversed_values].

Constraints

0 <= n <= 30
0 <= len(values) <= 10^4
-10^9 <= values[i] <= 10^9
Fibonacci indexing starts with F0 = 0 and F1 = 1

Function Signature

def solve(n, values):

Your question is Fibonacci and Linked List 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

Solve a Fibonacci series and a linked list coding problem.

Input: non-negative integer n and a list of integers values. Output: [fibonacci_values, reversed_values].

Constraints

0 <= n <= 30
0 <= len(values) <= 10^4
-10^9 <= values[i] <= 10^9
Fibonacci indexing starts with F0 = 0 and F1 = 1

Function Signature

def solve(n, values):

Your question is Fibonacci and Linked List 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.