Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 1790 with 24 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1790 # by problem number
lcpy gen -s check_if_one_string_swap_can_make_strings_equal # by problem name
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.
Return true if it is possible to make both strings equal by performing at most one string swap on exactly one of the strings. Otherwise, return false.
Input: s1 = "bank", s2 = "kanb"
Output: true
Explanation: For example, swap the first character with the last character of s2 to make "bank".
Input: s1 = "attack", s2 = "defend"
Output: false
Explanation: It is impossible to make them equal with one string swap.
Input: s1 = "kelb", s2 = "kelb"
Output: true
Explanation: The two strings are already equal, so no string swap operation is required.
class Solution:
# Time: O(n)
# Space: O(1)
def are_almost_equal(self, s1: str, s2: str) -> bool:
diffs = [i for i, (a, b) in enumerate(zip(s1, s2, strict=True)) if a != b]
if not diffs:
return True
if len(diffs) != 2:
return False
i, j = diffs
return s1[i] == s2[j] and s1[j] == s2[i]
| Time | Space |
|---|---|
| O(n) | O(1) |