Closest Land Mark

Asked at Meta · Coding & Leetcode-style Questions · Difficulty: Easy

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.

Loading the problem…