Showing:
Handle Score
@Ibrahim Nash 5725
@akhayrutdinov 5111
@mb1973 4989
@Quandray 4908
@saiujwal13083 4156
@sanjay05 3762
@marius_valentin_dragoi 3511
@sushant_a 3453
@KshamaGupta 3318
@the_coder95 3302
Shortest path from 1 to n
Basic Accuracy: 32.68% Submissions: 2314 Points: 1

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.

Example 1:

Input: N = 9
Output: 2
Explanation: 9 -> 3 -> 1, so
number of steps are 2. 

â€‹Example 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)

Constraints:
1 ≤ n ≤ 105