Swap and Flip

Given a binary string $S$ of length $N$, check if you can transform it to another binary string $T$ (also of length $N$) by using **either** of the following operations as many times as needed : - Pick $(i, j)$ such that $1 \le i < j \le N$ and swap $S_i$ and $S_j$ - Pick $(i, j)$ such that $1 \le i < j \le N$ and flip both $S_i$ and $S_j$. Here, to flip $x$ it means to convert it to $1 - x$. ##