Package g2801_2900.s2840_check_if_strings_can_be_made_equal_with_operations_ii

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2840 - Check if Strings Can be Made Equal With Operations II.

    Medium

    You are given two strings s1 and s2, both of length n, consisting of lowercase English letters.

    You can apply the following operation on any of the two strings any number of times:

    • Choose any two indices i and j such that i < j and the difference j - i is even , then swap the two characters at those indices in the string.

    Return true if you can make the strings s1 and s2 equal, andfalse otherwise.

    Example 1:

    Input: s1 = "abcdba", s2 = "cabdab"

    Output: true

    Explanation: We can apply the following operations on s1:

    • Choose the indices i = 0, j = 2. The resulting string is s1 = "cbadba".

    • Choose the indices i = 2, j = 4. The resulting string is s1 = "cbbdaa".

    • Choose the indices i = 1, j = 5. The resulting string is s1 = "cabdab" = s2.

    Example 2:

    Input: s1 = "abe", s2 = "bea"

    Output: false

    Explanation: It is not possible to make the two strings equal.

    Constraints:

    • n == s1.length == s2.length

    • <code>1 <= n <= 10<sup>5</sup></code>

    • s1 and s2 consist only of lowercase English letters.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description