maximum-bitwise-xor-after-rearrangement

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given two binary strings <code>s</code> and <code>t</code>​​​​​​​, each of length <code>n</code>.

You may rearrange the characters of <code>t</code> in any order, but <code>s</code> must remain unchanged.

Return a binary string of length <code>n</code> representing the maximum integer value obtainable by taking the bitwise XOR of <code>s</code> and rearranged <code>t</code>.

&nbsp;
Example 1:

<div class="example-block">
Input: s = &quot;101&quot;, t = &quot;011&quot;

Output: &quot;110&quot;

Explanation:

<ul>
	<li>One optimal rearrangement of <code>t</code> is <code>&quot;011&quot;</code>.</li>
	<li>The bitwise XOR of <code>s</code> and rearranged <code>t</code> is <code>&quot;101&quot; XOR &quot;011&quot; = &quot;110&quot;</code>, which is the maximum possible.</li>
</ul>
</div>

Example 2:

<div class="example-block">
Input: s = &quot;0110&quot;, t = &quot;1110&quot;

Output: &quot;1101&quot;

Explanation:

<ul>
	<li>One optimal rearrangement of <code>t</code> is <code>&quot;1011&quot;</code>.</li>
	<li>The bitwise XOR of <code>s</code> and rearranged <code>t</code> is <code>&quot;0110&quot; XOR &quot;1011&quot; = &quot;1101&quot;</code>, which is the maximum possible.</li>
</ul>
</div>

Example 3:

<div class="example-block">
Input: s = &quot;0101&quot;, t = &quot;1001&quot;

Output: &quot;1111&quot;

Explanation:

<ul>
	<li>One optimal rearrangement of <code>t</code> is <code>&quot;1010&quot;</code>.</li>
	<li>The bitwise XOR of <code>s</code> and rearranged <code>t</code> is <code>&quot;0101&quot; XOR &quot;1010&quot; = &quot;1111&quot;</code>, which is the maximum possible.</li>
</ul>
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n == s.length == t.length &lt;= 2 * 105</code></li>
	<li><code>s[i]</code> and <code>t[i]</code> are either <code>&#39;0&#39;</code> or <code>&#39;1&#39;</code>.</li>
</ul>

Weekly Contest 490

weekly-contest-490

maximumXor

Staff

Maximum Bitwise XOR After Rearrangement

String

Greedy

Bit Manipulation

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs

You are given two binary strings s and t , each of length n.

You may rearrange the characters of t in any order, but s must remain unchanged.

Return a binary string of length n representing the maximum integer value obtainable by taking the bitwise XOR of s and rearranged t.

 

Example 1:

Input: s = "101", t = "011"

Output: "110"

Explanation:

 * One optimal rearrangement of t is "011".
 * The bitwise XOR of s and rearranged t is "101" XOR "011" = "110", which is the maximum possible.

Example 2:

Input: s = "0110", t = "1110"

Output: "1101"

Explanation:

 * One optimal rearrangement of t is "1011".
 * The bitwise XOR of s and rearranged t is "0110" XOR "1011" = "1101", which is the maximum possible.

Example 3:

Input: s = "0101", t = "1001"

Output: "1111"

Explanation:

 * One optimal rearrangement of t is "1010".
 * The bitwise XOR of s and rearranged t is "0101" XOR "1010" = "1111", which is the maximum possible.

 

Constraints:

 * 1 <= n == s.length == t.length <= 2 * 105
 * s[i] and t[i] are either '0' or '1'.