New Problem Solution - "1837. Sum of Digits in Base K"

Author: haoel

README.md

@@ -12,6 +12,7 @@ LeetCode
 |1840|[Maximum Building Height](https://leetcode.com/problems/maximum-building-height/) | [C++](./algorithms/cpp/maximumBuildingHeight/MaximumBuildingHeight.cpp)|Hard|
 |1839|[Longest Substring Of All Vowels in Order](https://leetcode.com/problems/longest-substring-of-all-vowels-in-order/) | [C++](./algorithms/cpp/longestSubstringOfAllVowelsInOrder/LongestSubstringOfAllVowelsInOrder.cpp)|Medium|
 |1838|[Frequency of the Most Frequent Element](https://leetcode.com/problems/frequency-of-the-most-frequent-element/) | [C++](./algorithms/cpp/frequencyOfTheMostFrequentElement/FrequencyOfTheMostFrequentElement.cpp)|Medium|
+|1837|[Sum of Digits in Base K](https://leetcode.com/problems/sum-of-digits-in-base-k/) | [C++](./algorithms/cpp/sumOfDigitsInBaseK/SumOfDigitsInBaseK.cpp)|Easy|
 |1835|[Find XOR Sum of All Pairs Bitwise AND](https://leetcode.com/problems/find-xor-sum-of-all-pairs-bitwise-and/) | [C++](./algorithms/cpp/findXorSumOfAllPairsBitwiseAnd/FindXorSumOfAllPairsBitwiseAnd.cpp)|Hard|
 |1834|[Single-Threaded CPU](https://leetcode.com/problems/single-threaded-cpu/) | [C++](./algorithms/cpp/singleThreadedCpu/SingleThreadedCpu.cpp)|Medium|
 |1833|[Maximum Ice Cream Bars](https://leetcode.com/problems/maximum-ice-cream-bars/) | [C++](./algorithms/cpp/maximumIceCreamBars/MaximumIceCreamBars.cpp)|Medium|

algorithms/cpp/sumOfDigitsInBaseK/SumOfDigitsInBaseK.cpp

@@ -0,0 +1,41 @@
+// Source : https://leetcode.com/problems/sum-of-digits-in-base-k/
+// Author : Hao Chen
+// Date   : 2021-04-25
+
+/***************************************************************************************************** 
+ *
+ * Given an integer n (in base 10) and a base k, return the sum of the digits of n after converting n 
+ * from base 10 to base k.
+ * 
+ * After converting, each digit should be interpreted as a base 10 number, and the sum should be 
+ * returned in base 10.
+ * 
+ * Example 1:
+ * 
+ * Input: n = 34, k = 6
+ * Output: 9
+ * Explanation: 34 (base 10) expressed in base 6 is 54. 5 + 4 = 9.
+ * 
+ * Example 2:
+ * 
+ * Input: n = 10, k = 10
+ * Output: 1
+ * Explanation: n is already in base 10. 1 + 0 = 1.
+ * 
+ * Constraints:
+ * 
+ * 	1 <= n <= 100
+ * 	2 <= k <= 10
+ ******************************************************************************************************/
+
+class Solution {
+public:
+    int sumBase(int n, int k) {
+        int sum = 0;
+        while(n > 0) {
+            sum += (n % k);
+            n /= k;
+        }
+        return sum;
+    }
+};