Tap here to switch tabs
Problem
Submissions
Home
Courses
Grokking the Coding Interview Patterns

Problem: Check if Strings Can be Made Equal With Operations I

med
30 min
Try to solve the Check if Strings Can be Made Equal With Operations I problem.

Statement

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

You can perform the following operation on s1 any number of times:
Choose two indices i and j such that j - i =2= 2, and swap the characters at s1[i] and s1[j].

Return true if you can make s1 equal to s2, or false otherwise.

Constraints:

  • s1.length ==== s2.length ==4== 4

  • s1 and s2 consist only of lowercase English letters.

Similar Problems
Destroy Sequential Targets
Form Smallest Number From Two Digit Arrays
Find the Longest Balanced Substring of a Binary String
Relocate Marbles
Check if Strings Can be Made Equal With Operations II
Count K-Subsequences of a String With Maximum Beauty
Minimum Number of Operations to Make Array Empty
Minimum Number of Groups to Create a Valid Assignment
Subarrays Distinct Element Sum of Squares I
Rearrange Characters to Make Target String
⋮
Tap here to switch tabs
Problem
Submissions
Home
Courses
Grokking the Coding Interview Patterns

Problem: Check if Strings Can be Made Equal With Operations I

med
30 min
Try to solve the Check if Strings Can be Made Equal With Operations I problem.

Statement

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

You can perform the following operation on s1 any number of times:
Choose two indices i and j such that j - i =2= 2, and swap the characters at s1[i] and s1[j].

Return true if you can make s1 equal to s2, or false otherwise.

Constraints:

  • s1.length ==== s2.length ==4== 4

  • s1 and s2 consist only of lowercase English letters.

Similar Problems
Destroy Sequential Targets
Form Smallest Number From Two Digit Arrays
Find the Longest Balanced Substring of a Binary String
Relocate Marbles
Check if Strings Can be Made Equal With Operations II
Count K-Subsequences of a String With Maximum Beauty
Minimum Number of Operations to Make Array Empty
Minimum Number of Groups to Create a Valid Assignment
Subarrays Distinct Element Sum of Squares I
Rearrange Characters to Make Target String