Consider a directed graph whose vertices are numbered from 1 to n. There is an edge from a vertex i to a vertex j iff either j = i + 1 or j = 3 * i. The task is to find the minimum number of edges in a path in G from vertex 1 to vertex n.
Input: N = 9 Output: 2 Explanation: 9 -> 3 -> 1, so number of steps are 2.
Input: N = 4 Output: 2 Explanation: 4 -> 3 -> 1, so number of steps are 2.
You don't need to read input or print anything. Your task is to complete the function minimumStep() which takes the n as inputs and returns the answer.
Expected Time Complexity: O(log n)
Expected Auxiliary Space: O(1)
1 ≤ n ≤ 105
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?Yes