Leetcode #1790: Check if One String Swap Can Make Strings Equal
In this guide, we solve Leetcode #1790 Check if One String Swap Can Make Strings Equal in Python and focus on the core idea that makes the solution efficient.
You will see the intuition, the step-by-step method, and a clean Python implementation you can use in interviews.
Problem Statement
You are given two strings s1 and s2 of equal length. A string swap is an operation where you choose two indices in a string (not necessarily different) and swap the characters at these indices.
Quick Facts
- Difficulty: Easy
- Premium: No
- Tags: Hash Table, String, Counting
Intuition
Fast membership checks and value lookups are the heart of this problem, which makes a hash map the natural choice.
By storing what we have already seen (or counts/indexes), we can answer the question in one pass without backtracking.
Approach
Scan the input once, using the map to detect when the condition is satisfied and to update state as you go.
This keeps the solution linear while remaining easy to explain in an interview setting.
Steps:
- Initialize a hash map for seen items or counts.
- Iterate through the input, querying/updating the map.
- Return the first valid result or the final computed value.
Example
Input: s1 = "bank", s2 = "kanb"
Output: true
Explanation: For example, swap the first character with the last character of s2 to make "bank".
Python Solution
class Solution:
def areAlmostEqual(self, s1: str, s2: str) -> bool:
cnt = 0
c1 = c2 = None
for a, b in zip(s1, s2):
if a != b:
cnt += 1
if cnt > 2 or (cnt == 2 and (a != c2 or b != c1)):
return False
c1, c2 = a, b
return cnt != 1
Complexity
The time complexity is , where is the length of the string. The space complexity is .
Edge Cases and Pitfalls
Watch for boundary values, empty inputs, and duplicate values where applicable. If the problem involves ordering or constraints, confirm the invariant is preserved at every step.
Summary
This Python solution focuses on the essential structure of the problem and keeps the implementation interview-friendly while meeting the constraints.