add 2843

Author: fishercoder1534

paginated_contents/algorithms/3rd_thousand/README.md

@@ -12,6 +12,7 @@
 | 2859 | [Sum of Values at Indices With K Set Bits](https://leetcode.com/problems/sum-of-values-at-indices-with-k-set-bits/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2859.java)                                       |                                      | Easy                                     |
 | 2855 | [Minimum Right Shifts to Sort the Array](https://leetcode.com/problems/minimum-right-shifts-to-sort-the-array/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2855.java)                                       |                                      | Easy                                     |
 | 2848 | [Points That Intersect With Cars](https://leetcode.com/problems/points-that-intersect-with-cars/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2848.java)                                       |                                      | Easy                                     |
+| 2843 | [Count Symmetric Integers](https://leetcode.com/problems/count-symmetric-integers/)                                                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2843.java)                                       |                                      | Easy                                     |
 | 2839 | [Check if Strings Can be Made Equal With Operations I](https://leetcode.com/problems/check-if-strings-can-be-made-equal-with-operations-i/)                                                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2839.java)                                       |                                      | Easy                                     |
 | 2833 | [Furthest Point From Origin](https://leetcode.com/problems/furthest-point-from-origin/)                                                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2833.java)                                       |                                      | Easy                                     |
 | 2828 | [Check if a String Is an Acronym of Words](https://leetcode.com/problems/check-if-a-string-is-an-acronym-of-words/)                                                                                                          | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2828.java)                                       |                                      | Easy                                     |

src/main/java/com/fishercoder/solutions/thirdthousand/_2843.java

@@ -0,0 +1,30 @@
+package com.fishercoder.solutions.thirdthousand;
+
+public class _2843 {
+    public static class Solution1 {
+        public int countSymmetricIntegers(int low, int high) {
+            int ans = 0;
+            for (int num = low; num <= high; num++) {
+                ans += isSymmetric(num);
+            }
+            return ans;
+        }
+
+        private int isSymmetric(int num) {
+            String numStr = String.valueOf(num);
+            if (numStr.length() % 2 != 0) {
+                return 0;
+            }
+            int sum1 = 0;
+            int sum2 = 0;
+            for (int i = 0; i < numStr.length() / 2; i++) {
+                sum1 += Integer.parseInt(numStr.charAt(i) + "");
+                sum2 += Integer.parseInt(numStr.charAt(numStr.length() - i - 1) + "");
+            }
+            if (sum1 == sum2) {
+                return 1;
+            }
+            return 0;
+        }
+    }
+}

src/test/java/com/fishercoder/thirdthousand/_2843Test.java

@@ -0,0 +1,27 @@
+package com.fishercoder.thirdthousand;
+
+import com.fishercoder.solutions.thirdthousand._2843;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class _2843Test {
+    private static _2843.Solution1 solution1;
+
+    @BeforeEach
+    public void setup() {
+        solution1 = new _2843.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(9, solution1.countSymmetricIntegers(1, 100));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(9, solution1.countSymmetricIntegers(10, 100));
+    }
+
+}