859. Buddy Strings

Description

Given two strings A and B of lowercase letters, return true if you can swap two letters in A so the result is equal to B, otherwise, return false.

Swapping letters is defined as taking two indices i and j (0-indexed) such that i != j and swapping the characters at A[i] and A[j]. For example, swapping at indices 0 and 2 in "abcd" results in "cbad".

Constraints

• 0 <= A.length <= 20000

• 0 <= B.length <= 20000

• A and B consist of lowercase letters.

Approach

Links

• GeeksforGeeks

• Leetcode

• ProgramCreek

• YouTube

Examples

Example 1

Input: A = "ab", B = "ba"

Output: true

Explanation: You can swap A[0] = 'a' and A[1] = 'b' to get "ba", which is equal to B.

Example 2

Example 3

Example 4

Example 5

Solutions

Solution 1

/**
 * Time complexity : O(N), where NN is the length of A and B.
 * Space complexity : O(1)
 */

class Solution {
    public boolean buddyStrings(String A, String B) {
        if(A == null || B == null) return false;
        
        int aLen = A.length(),
            bLen = B.length();
        
        if(aLen < 2 || bLen < 2 || aLen != bLen) return false;
        
        if(A.equals(B)) {
            int[] counts = new int[26];
            for(char c: A.toCharArray()) {
                counts[c-'a']++;
                if(counts[c-'a'] > 1) {
                    return true;
                }
            }
            return false;
        }
        
        int first = -1, second = -1;
        
        for(int i = 0; i < aLen; i++) {
            if(A.charAt(i) != B.charAt(i)) {
                if(first == -1) {
                    first = i;
                } else if(second == -1) {
                    second = i;
                } else {
                    return false;
                }
            }
        }
        
        return second != -1 && A.charAt(first) == B.charAt(second) && 
                A.charAt(second) == B.charAt(first);
    }
}

Follow up