1585. Check If String Is Transformable With Substring Sort Operations

Updated: 2024-03-12
1 min read

On This Page

LeetCode problem 1585

class Solution:
    def isTransformable(self, s: str, t: str) -> bool:
        pos = defaultdict(deque)
        for i, c in enumerate(s):
        for c in t:
            x = int(c)
            if not pos[x] or any(pos[i] and pos[i][0] < pos[x][0] for i in range(x)):
                return False
        return True