Minimum Steps to a Fibonacci Number

Given an integer x, return the minimum number of steps required to change x into a Fibonacci number.
In each step, you may either increment or decrement the current number by 1.
The Fibonacci sequence is defined as follows:
F[0] = 0
F[1] = 1
For every i >= 2, F[i] = F[i - 1] + F[i - 2].
The elements of this sequence are called Fibonacci numbers.

Function
minimumFibonacciSteps(x: int) → int

Examples
Example 1
x = 15
return = 2
The closest Fibonacci number is 13. Decrementing 15 twice reaches 13, so the minimum number of steps is 2.
Example 2
x = 1
return = 0
1 is already a Fibonacci number, so no steps are needed.
Example 3
x = 13
return = 0
13 is already a Fibonacci number, so no steps are needed.

Constraints
0 <= x <= 1,000,000

The trick: each step changes x by 1, so the answer is just the absolute distance to the nearest Fibonacci number. No search needed. Generate Fibonacci numbers until one passes x, which gives you about 30 values for a 1,000,000 limit. Then take the minimum of abs(x - f) across the list. The common pitfall is stopping the generation at the last value less than or equal to x. For x = 15 that gives 13, which works, but for x = 20 you'd miss 21 and return 7 instead of 1. Generate one value past x and check both sides. Also handle x = 0, which is F[0] and returns 0, and remember F[1] and F[2] are both 1, so duplicates are harmless. Linear scan over the list is fine. If the edge cases slip your mind under pressure, StealthCoder can hand you the loop while the proctor sees nothing.

The honest play: practice the pattern, and have StealthCoder ready for the one you didn't see coming.