You are given two $0$ indexed binary strings s and target, both of length n. You can perform the following operation on s any number of times:

Choose two distinct indices i and j such that $0 \leq$ i, j $< n$ and i $\neq$ j. Simultaneously replace s[i] with (s[i] OR s[j]) and s[j] with (s[i] XOR s[j]).

Return true if it is possible to make the string s equal to target, or false otherwise.

Constraints:

• n $==$ s.length $==$ target.length

• $2 \leq$ n $\leq 10^5$

• s and target consist of only the digits $0$ and $1$.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.