Feb 5

Author: siddydutta

2025-02-February-LeetCoding-Challenge/Check if One String Swap Can Make Strings Equal.py

@@ -0,0 +1,29 @@
+class Solution:
+    def areAlmostEqual(self, s1: str, s2: str) -> bool:
+        count = 0
+        s1_freq, s2_freq = [0] * 26, [0] * 26
+        for ch1, ch2 in zip(s1, s2):
+            count += ch1 != ch2
+            if count > 2:
+                return False
+            s1_freq[ord(ch1)-ord('a')] += 1
+            s2_freq[ord(ch2)-ord('a')] += 1
+        return s1_freq == s2_freq
+
+
+def main():
+    s1 = 'bank'
+    s2 = 'kanb'
+    assert Solution().areAlmostEqual(s1, s2) is True
+
+    s1 = 'attack'
+    s2 = 'defend'
+    assert Solution().areAlmostEqual(s1, s2) is False
+
+    s1 = 'kelb'
+    s2 = 'kelb'
+    assert Solution().areAlmostEqual(s1, s2) is True
+
+
+if __name__ == '__main__':
+    main()

2025-02-February-LeetCoding-Challenge/README.md

@@ -8,7 +8,7 @@
 | February 02 | [1752. Check if Array Is Sorted and Rotated](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/) | Easy | Solved |
 | February 03 | [3105. Longest Strictly Increasing or Strictly Decreasing Subarray](https://leetcode.com/problems/longest-strictly-increasing-or-strictly-decreasing-subarray/) | Easy | Solved |
 | February 04 | [1800. Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum/) | Easy | Solved |
-| February 05 | []() |  |  |
+| February 05 | [1790. Check if One String Swap Can Make Strings Equal](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal/) | Easy | Solved |
 | February 06 | []() |  |  |
 | February 07 | []() |  |  |
 | February 08 | []() |  |  |
@@ -37,6 +37,6 @@
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
-| Easy   | 4 | 4 | 0 |
+| Easy   | 5 | 5 | 0 |
 | Medium | 0 | 0 | 0 |
 | Hard   | 0 | 0 | 0 |