Prime Factors sum in java medium good

There is only one character 'A' on the screen of a notepad. You can perform one of two operations on this notepad for each step:

Copy All: You can copy all the characters present on the screen (a partial copy is not allowed).
Paste: You can paste the characters which are copied last time.
Given an integer n, return the minimum number of operations to get the character 'A' exactly n times on the screen.

 

Example 1:

Input: n = 3
Output: 3
Explanation: Initially, we have one character 'A'.
In step 1, we use Copy All operation.
In step 2, we use Paste operation to get 'AA'.
In step 3, we use Paste operation to get 'AAA'.
Example 2:

Input: n = 1
Output: 0
 

Constraints:

1 <= n <= 1000

Seen this question in a real interview before?
1/5
Yes
No
Accepted
248.9K
Submissions
418.6K
Acceptance Rate
59.5%
Topics
Companies
Hint 1
How many characters may be there in the clipboard at the last step if n = 3? n = 7? n = 10? n = 24?

Author: Gauranshgoel123

2-keys-keyboard.java

@@ -0,0 +1,27 @@
+class Solution {
+    public int minSteps(int n) {
+        if(n == 1) return 0;
+        return sumOfPrimeFactors(n);
+    }
+    public static int sumOfPrimeFactors(int number) {
+        int sum = 0;
+        while (number % 2 == 0) {
+            sum += 2;
+            number /= 2;
+        }
+        for (int i = 3; i <= Math.sqrt(number); i += 2) {
+            while (number % i == 0) {
+                sum += i;
+                number /= i;
+            }
+        }
+        if (number > 2) {
+            sum += number;
+        }
+        return sum;
+    }
+}
+// Prime Factorization:
+// First, the program checks for the smallest prime factor, which is 2, and divides the number until it can't be divided further.
+// Then, it checks for other odd factors, starting from 3.
+// If the remaining number after division is greater than 2, it is a prime factor itself and is added to the sum.