Method 1(Recursion) int minOperation(int n) { if(n==1) return 1; if(n%2==0) return 1+ minOperation(n/2); return 1 + minOperation(n-1); } Method 2 int minOperation(int n) { int ans=0; int nx=1; while(n>0) { if(n%2 ==0) n=n/2; else n--; ans++; } return ans; }