Determine if Two Strings Are Close
Two strings are considered close if you can attain one from the other using the following operations:
- Operation 1: Swap any two existing characters.
- Operation 2: Transform every occurrence of one existing character into another existing character, and do the same with the other character.
You can use the operations on either string as many times as necessary.
Given two strings, word1 and word2, return true if word1 and word2 are close, and false otherwise.
Example 1
Input
word1 = "abc", word2 = "bca"Output
trueYou can attain word2 from word1 by swapping characters:
abc -> acb -> bca.Example 2
Input
word1 = "a", word2 = "aa"Output
falseIt is impossible to attain word2 from word1, or vice versa, in any number of operations.
Constraints
- 1 <= word1.length, word2.length <= 10^5
- word1 and word2 contain only lowercase English letters.