feat: add LeetCode problem 2068

:D

Author: muhsinalikulbak

leetcode/src/2068.c

@@ -0,0 +1,18 @@
+bool checkAlmostEquivalent(char* word1, char* word2) 
+{
+    int map[26] = {0};
+    int len = strlen(word1);
+
+    for (int i = 0; i < len; i++)
+    {
+        map[word1[i] - 'a']++;
+        map[word2[i] - 'a']--;
+    }
+    for (int i = 0; i < 26; i++)
+    {
+        if (map[i] > 3 || map[i] < -3)
+            return (false);
+    }
+    return (true);
+}
+