3998. Transform Binary String Using Subsequence Sort

You are given a binary string s.

You are also given an array of strings strs, where each strs[i] has the same length as s and consists of characters '0', '1', and '?'. Each '?' can be replaced by either '0' or '1'.

You may perform the following operation any number of times (including zero):

• Choose any subsequence sub of s.
• Sort sub in non-decreasing order.
• Replace the chosen subsequence in s with the sorted sub, keeping all other characters unchanged.

Return a boolean array ans, where ans[i] is true if it's possible to replace all '?' in strs[i] with '0' or '1' and transform s into the resulting string using the allowed operation above, otherwise return false.

Example 1:

Example 2:

Example 3:

Constraints:

• 1 <= n == s.length <= 2000
• s[i] is either '0' or '1'.
• 1 <= strs.length <= 2000
• strs[i].length == n
• strs[i] is either '0', '1', or '?'​​​​​​​.