add 3099

Author: fishercoder1534

Diff for: paginated_contents/algorithms/4th_thousand/README.md

@@ -48,6 +48,7 @@
 | 3114 | [Latest Time You Can Obtain After Replacing Characters](https://leetcode.com/problems/latest-time-you-can-obtain-after-replacing-characters/)                                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3114.java) |                                                                               | Easy       | 
 | 3112 | [Minimum Time to Visit Disappearing Nodes](https://leetcode.com/problems/minimum-time-to-visit-disappearing-nodes/)                                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3112.java) |                                                                               | Medium     | Graph, Shortest Path
 | 3110 | [Score of a String](https://leetcode.com/problems/score-of-a-string/)                                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3110.java) |                                                                               | Easy       |
+| 3099 | [Harshad Number](https://leetcode.com/problems/harshad-number/)                                                                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3099.java) |                                                                               | Easy       |
 | 3095 | [Shortest Subarray With OR at Least K I](https://leetcode.com/problems/shortest-subarray-with-or-at-least-k-i/)                                                     | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3095.java) |                                                                               | Easy       |
 | 3090 | [Maximum Length Substring With Two Occurrences](https://leetcode.com/problems/maximum-length-substring-with-two-occurrences/)                                       | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3090.java) |                                                                               | Easy       |
 | 3083 | [Existence of a Substring in a String and Its Reverse](https://leetcode.com/problems/existence-of-a-substring-in-a-string-and-its-reverse/)                                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3083.java) |                                                                               | Easy       |

Diff for: src/main/java/com/fishercoder/solutions/fourththousand/_3099.java

@@ -0,0 +1,15 @@
+package com.fishercoder.solutions.fourththousand;
+
+public class _3099 {
+    public static class Solution1 {
+        public int sumOfTheDigitsOfHarshadNumber(int x) {
+            int sum = 0;
+            int tmp = x;
+            while (tmp != 0) {
+                sum += tmp % 10;
+                tmp /= 10;
+            }
+            return x % sum == 0 ? sum : -1;
+        }
+    }
+}