Time: 216 ms (34.17%), Space: 16.4 MB (88.15%) - LeetHub

Author: Deepak5113

0650-2-keys-keyboard/0650-2-keys-keyboard.py

@@ -0,0 +1,14 @@
+class Solution:
+    def minSteps(self, n: int) -> int:
+        if n == 1:
+            return 0
+        
+        dp = [0] * (n + 1)
+        
+        for i in range(2, n + 1):
+            dp[i] = i  # maximum operations needed (all pastes)
+            for j in range(1, i // 2 + 1):
+                if i % j == 0:
+                    dp[i] = min(dp[i], dp[j] + (i // j))
+        
+        return dp[n]