Leetcode Problem 1585. Check If String Is Transformable With Substring Sort Operations

1585. Check If String Is Transformable With Substring Sort Operations

Leetcode Solutions

Create an array of 10 stacks, one for each digit from 0 to 9, to store the indices of the digits in s.
Iterate over s and push the index of each digit onto its corresponding stack.
Iterate over t and for each digit: a. Check if the corresponding stack is empty. If it is, return false because the digit is not present in s. b. Check if there are any smaller digits to the left of the current index that have not been moved. If there are, return false. c. Pop the index from the stack to simulate moving the digit.
If all digits in t can be moved without any issues, return true.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen