You are given two 0-indexed binary strings s and target of the same length n. You can do the following operation on s any number of times:
i and j where 0 <= i, j < n.s[i] with (s[i] OR s[j]) and s[j] with (s[i] XOR s[j]).For example, if s = "0110", you can choose i = 0 and j = 2, then simultaneously replace s[0] with (s[0] OR s[2] = 0 OR 1 = 1), and s[2] with (s[0] XOR s[2] = 0 XOR 1 = 1). So we will have s = "1110".
Return true if you can make the string s equal to target, or false otherwise.
n == s.length == target.length2 <= n <= 10^5s and target consist of only the digits 0 and 1.s = "1010", target = "0110"trues = "11", target = "00"false