Given a positive integer K, the task is to find the minimum number of operations of the following two types, required to change 0 to K:
- Add one to the operand
- Multiply the operand by 2.
Input: K = 1
Step 1: 0 + 1 = 1 = K
Input: K = 4
Step 1: 0 + 1 = 1,
Step 2: 1 * 2 = 2,
Step 3: 2 * 2 = 4 = K
- If K is an odd number, the last step must be adding 1 to it.
- If K is an even number, the last step is to multiply by 2 to minimise the number of steps.
- Create a dp table that stores in every dp[i], the minimum steps required to reach i.
Below is the implementation of the above approach:
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Minimum steps to reach N from 1 by multiplying each step by 2, 3, 4 or 5
- Count ways to reach Nth Stairs by taking 1 and 2 steps with exactly one 3 step
- Count ways to reach the Nth stair using multiple 1 or 2 steps and a single step 3
- Minimize the number of steps required to reach the end of the array
- Minimize the number of steps required to reach the end of the array | Set 2
- Minimum step to reach one
- Reach A and B by multiplying them with K and K^2 at every step
- Count ways to reach the nth stair using step 1, 2 or 3
- Steps to reduce N to zero by subtracting its most significant digit at every step
- Count ways to reach the Nth stair using any step from the given array
- Count ways to reach end from start stone with at most K jumps at each step
- Find the number of ways to reach Kth step in stair case
- Number of steps to sort the array by changing order of three elements in each step
- Minimum steps to minimize n as per given condition
- Convert 1 into X in min steps by multiplying with 2 or 3 or by adding 1
- Minimize steps required to move all 1's in a matrix to a given index
- Minimum steps to reach a destination
- Minimize Steps required to obtain Sorted Order of an Array
- Find the minimum number of steps to reach M from N
- Check if it is possible to reach (x, y) from origin in exactly Z steps using only plus movements
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.