Learn AI Create the Future — with Pranay
Main site

LeetCode solutions

2177. Check Whether Two Strings are Almost Equivalent

My accepted Python solution to LeetCode problem 2177, Check Whether Two Strings are Almost Equivalent, running in 0ms.

  • Difficulty: Easy
  • Python
  • Runtime 0ms
  • Memory 17.4MB

Read the problem on LeetCode View on GitHub

The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.

Python

Accepted on LeetCode — runtime 0ms, memory 17.4MB, accepted 2025-12-29.

python
class Solution:
    def checkAlmostEquivalent(self, word1: str, word2: str) -> bool:
        # Count frequencies and check if all diffs <= 3
        # Time: O(n), Space: O(1) - 26 chars max
        from collections import Counter
        count1 = Counter(word1)
        count2 = Counter(word2)
        
        # Check all letters a-z
        for c in 'abcdefghijklmnopqrstuvwxyz':
            if abs(count1.get(c, 0) - count2.get(c, 0)) > 3:
                return False
        return True

Source