add 2068

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2068|[Check Whether Two Strings are Almost Equivalent](https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2068.java) ||Easy||
 |2063|[Vowels of All Substrings](https://leetcode.com/problems/vowels-of-all-substrings/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2063.java) ||Medium||
 |2062|[Count Vowel Substrings of a String](https://leetcode.com/problems/count-vowel-substrings-of-a-string/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2062.java) ||Easy||
 |2058|[Find the Minimum and Maximum Number of Nodes Between Critical Points](https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2058.java) ||Medium||

src/main/java/com/fishercoder/solutions/_2068.java

@@ -0,0 +1,21 @@
+package com.fishercoder.solutions;
+
+public class _2068 {
+    public static class Solution1 {
+        public boolean checkAlmostEquivalent(String word1, String word2) {
+            int[] count = new int[26];
+            for (char c : word1.toCharArray()) {
+                count[c - 'a']++;
+            }
+            for (char c : word2.toCharArray()) {
+                count[c - 'a']--;
+            }
+            for (int i : count) {
+                if (Math.abs(i) > 3) {
+                    return false;
+                }
+            }
+            return true;
+        }
+    }
+}