Check If String Is Transformable With Substring Sort Operations - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
1585. Check If String Is Transformable With Substring Sort Operations
Hard
50 Points
String
Greedy
Sorting
Given two strings s and t, transform string s into string t using the following operation any number of times:
Return true if it is possible to transform s into t. Otherwise, return false.
A substring is a contiguous sequence of characters within a string.
Examples
Example 1
Input: s = "84532", t = "34852"
Output: true
Explanation: You can transform s into t using the following sort operations:
"84532" (from index 2 to 3) -> "84352"
"84352" (from index 0 to 2) -> "34852"
Example 2
Input: s = "34521", t = "23415"
Output: true
Explanation: You can transform s into t using the following sort operations:
"34521" -> "23451"
"23451" -> "23415"
Example 3
Input: s = "12345", t = "12435"
Output: false
Constraints
s.length == t.length
1 <= s.length <= 105
s and t consist of only digits.
1585. Check If String Is Transformable With Substring Sort Operations
Hard
50 Points
String
Greedy
Sorting
Given two strings s and t, transform string s into string t using the following operation any number of times:
Return true if it is possible to transform s into t. Otherwise, return false.
A substring is a contiguous sequence of characters within a string.
Examples
Example 1
Input: s = "84532", t = "34852"
Output: true
Explanation: You can transform s into t using the following sort operations:
"84532" (from index 2 to 3) -> "84352"
"84352" (from index 0 to 2) -> "34852"
Example 2
Input: s = "34521", t = "23415"
Output: true
Explanation: You can transform s into t using the following sort operations:
"34521" -> "23451"
"23451" -> "23415"