Check if Strings Can be Made Equal With Operations I
Easy
You receive two strings s1 and s2, both of length 4, consisting of lowercase English letters.
You can apply the following operation on any of the two strings any count of times:
- Choose any two indices
iandjsuch thatj - i = 2, then swap the two characters at those indices in the string.
Find and provide true if you can make the strings s1 and s2 equal, and false otherwise.
Example 1
Input: s1 = "abcd", s2 = "cdab"
Output: true
Explanation: We can do the following operations on s1:
-
Choose the indices i = 0, j = 2. The resulting string is s1 = "cbad".
-
Choose the indices i = 1, j = 3. The resulting string is s1 = "cdab" = s2.
Example 2
Input: s1 = "abcd", s2 = "dacb"
Output: false
Explanation: It is not valid to make the two strings equal.
Constraints
s1.length == s2.length == 4s1ands2consist only of lowercase English letters.
Did this problem appear in one of your interviews?
Responses stay private.