diff --git a/1342-number-of-steps-to-reduce-a-number-to-zero/1342-number-of-steps-to-reduce-a-number-to-zero.java b/1342-number-of-steps-to-reduce-a-number-to-zero/1342-number-of-steps-to-reduce-a-number-to-zero.java
index d2943a2..be5d5f4 100644
--- a/1342-number-of-steps-to-reduce-a-number-to-zero/1342-number-of-steps-to-reduce-a-number-to-zero.java
+++ b/1342-number-of-steps-to-reduce-a-number-to-zero/1342-number-of-steps-to-reduce-a-number-to-zero.java
@@ -1,19 +1,31 @@
 class Solution {
     public int numberOfSteps(int num) {
-        //if num is even divide by 2
-        //else subtract by 1
-        int count = 0;
-        while(num > 0){
-            if(num % 2 == 0){
-                num = num/2;
-            }
-            else{
-                num--;
-            }
-            count++;
-        }
+//         //if num is even divide by 2
+//         //else subtract by 1
+//         int count = 0;
+//         while(num > 0){
+//             if(num % 2 == 0){
+//                 num = num/2;
+//             }
+//             else{
+//                 num--;
+//             }
+//             count++;
+//         }
         
-        return count;
+//         return count; 
+        //previous soln
+        // recursion soln
+        // at last 0 + 1 + 1 + 1 +... count
+        // base condition
+        if(num == 0){
+            return 0;
+        }
+        if (num % 2 == 0){
+            return 1 + numberOfSteps(num/2);
+
+        }
+        return 1 + numberOfSteps(num - 1);
         
     }
 }
\ No newline at end of file