Watch 10 video solutions for Check If String Is Transformable With Substring Sort Operations, a hard level problem involving String, Greedy, Sorting. This walkthrough by NeetCode has 427,709 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
Given two strings s and t, transform string s into string t using the following operation any number of times:
s and sort it in place so the characters are in ascending order.
"14234" results in "12344".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.
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.length1 <= s.length <= 105s and t consist of only digits.