FastPrepFastPrep
Problem Brief

Closest Land Mark πŸ‘

OA
See Meta online assessment and hiring insights

Imagine you're on a journey along the path of numbers, starting from your current location marked by an integer N. Your goal is to find the nearest landmark, which happens to be a Fibonacci number. But before you can reach it, you must determine the distance you need to travel to get there. Your task is to calculate this distance and return it as another integer.

Function Description

Complete the function closestLandMark in the editor πŸ‘‰.

closestLandMark has the following parameter:

  1. int aNum: an integer number

Returns

int: the distance to the closest "land mark".

Memo: For original prompt, pls refer to source image πŸ’–

1Example 1

Input
aNum = 25
Output
4
Explanation
No explanation provided for now. Will add once find it :)

2Example 2

Input
aNum = 5
Output
0
Explanation
No explanation provided for now. Will add once find it :)

Constraints

Limits and guarantees your solution can rely on.

0 ≀ N ≀ 1,000,000
public int closestLandMark(int aNum) {
    // write your code here
}
Input

aNum

25

Output

4

Sign in to submit your solution.