solves sum of digits in base k

Author: anishLearnsToCode

README.md

@@ -446,7 +446,7 @@
 | 1826 | 🔒 [Faulty Sensor](https://leetcode.com/problems/faulty-sensor)                                                                                           |                                                                                                                                                                                      |                                                                                                                                   |
 | 1827 | [Minimum Operations to Make the Array Increasing](https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing)                          |                                                    [![Java](assets/java.png)](src/MinimumOperationsToMakeTheArrayIncreasing.java)                                                    |                                                                                                                                   |
 | 1832 | [Check if the Sentence Is Pangram](https://leetcode.com/problems/check-if-the-sentence-is-pangram)                                                        |                                                            [![Java](assets/java.png)](src/CheckIfSentenceIsPangram.java)                                                             |                                                                                                                                   |
-| 1837 | [Sum of Digits in Base K](https://leetcode.com/problems/sum-of-digits-in-base-k)                                                                          |                                                                                                                                                                                      |                                                                                                                                   |
+| 1837 | [Sum of Digits in Base K](https://leetcode.com/problems/sum-of-digits-in-base-k)                                                                          |                                                               [![Java](assets/java.png)](src/SumOfDigitsInBaseK.java)                                                                |                                                                                                                                   |
 | 1844 | [Replace All Digits with Characters](https://leetcode.com/problems/replace-all-digits-with-characters)                                                    |                                                                                                                                                                                      |                                                                                                                                   |
 | 1848 | [Minimum Distance to the Target Element](https://leetcode.com/problems/minimum-distance-to-the-target-element)                                            |                                                                                                                                                                                      |                                                                                                                                   |
 | 1854 | [Maximum Population Year](https://leetcode.com/problems/maximum-population-year)                                                                          |                                                                                                                                                                                      |                                                                                                                                   |

src/SumOfDigitsInBaseK.java

@@ -0,0 +1,23 @@
+public class SumOfDigitsInBaseK {
+    public int sumBase(int n, int k) {
+        return sumOfDigits(toBaseK(n, k));
+    }
+
+    private int sumOfDigits(StringBuilder number) {
+        int sum = 0;
+        for (int index = 0 ; index < number.length() ; index++) {
+            sum += number.charAt(index) - '0';
+        }
+        return sum;
+    }
+
+    private StringBuilder toBaseK(int n, int k) {
+        if (n == 0) return new StringBuilder("0");
+        final StringBuilder result = new StringBuilder();
+        while (n > 0) {
+            result.append(n % k);
+            n /= k;
+        }
+        return result.reverse();
+    }
+}