add 2506

Author: fishercoder1534

paginated_contents/algorithms/3rd_thousand/README.md

@@ -32,6 +32,7 @@
 | 2525 | [Categorize Box According to Criteria](https://leetcode.com/problems/categorize-box-according-to-criteria/)                                                                                   | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2525.java)                                       | [:tv:](https://youtu.be/dIciftyQXHo) | Easy                      ||
 | 2520 | [Count the Digits That Divide a Number](https://leetcode.com/problems/count-the-digits-that-divide-a-number/)                                                                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2520.java)                                       | [:tv:](https://youtu.be/7SHHsS5kPJ8) | Easy                      ||
 | 2515 | [Shortest Distance to Target String in a Circular Array](https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array/)                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2515.java)                                       || Easy                                ||
+| 2506 | [Count Pairs Of Similar Strings](https://leetcode.com/problems/count-pairs-of-similar-strings/)                                               | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2506.java)                                       || Easy                                ||
 | 2496 | [Maximum Value of a String in an Array](https://leetcode.com/problems/maximum-value-of-a-string-in-an-array/)                                                                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2496.java)                                       || Easy                                ||
 | 2492 | [Minimum Score of a Path Between Two Cities](https://leetcode.com/problems/minimum-score-of-a-path-between-two-cities/)                                                                                                             | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2492.java)                                       || Medium                              | Union Find                
 | 2485 | [Find the Pivot Integer](https://leetcode.com/problems/find-the-pivot-integer/)                                                                                 | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/thirdthousand/_2485.java)                                       || Easy                                ||

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

@@ -0,0 +1,35 @@
+package com.fishercoder.solutions.thirdthousand;
+
+public class _2506 {
+    public static class Solution1 {
+        public int similarPairs(String[] words) {
+            String[] symbols = new String[words.length];
+            for (int i = 0; i < words.length; i++) {
+                symbols[i] = compress(words[i]);
+            }
+            int pairs = 0;
+            for (int i = 0; i < symbols.length - 1; i++) {
+                for (int j = i + 1; j < symbols.length; j++) {
+                    if (symbols[i].equals(symbols[j])) {
+                        pairs++;
+                    }
+                }
+            }
+            return pairs;
+        }
+
+        private String compress(String word) {
+            int[] count = new int[26];
+            for (char c : word.toCharArray()) {
+                count[c - 'a']++;
+            }
+            StringBuilder sb = new StringBuilder();
+            for (int i = 0; i < 26; i++) {
+                if (count[i] > 0) {
+                    sb.append(i + 'a');
+                }
+            }
+            return sb.toString();
+        }
+    }
+}