Dynamic Programming
Greedy
Bit Manipulation
Memoization
Given a positive integer n, you can apply one of the following operations:
Return the minimum number of operations needed for n to become 1.
Examples
Example 1
Input: n = 8
Output: 3
Explanation: 8 -> 4 -> 2 -> 1
Example 2
Input: n = 7
Output: 4
Explanation: 7 -> 8 -> 4 -> 2 -> 1
or 7 -> 6 -> 3 -> 2 -> 1
Example 3
Input: n = 4
Output: 2