longest-balanced-substring-after-one-swap

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 a binary string <code>s</code> consisting only of characters <code>&#39;0&#39;</code> and <code>&#39;1&#39;</code>.

A string is balanced if it contains an equal number of <code>&#39;0&#39;</code>s and <code>&#39;1&#39;</code>s.

You can perform at most one swap between any two characters in <code>s</code>. Then, you select a balanced substring from <code>s</code>.

Return an integer representing the maximum length of the balanced substring you can select.

&nbsp;
Example 1:

<div class="example-block">
Input: s = &quot;100001&quot;

Output: 4

Explanation:

<ul>
	<li>Swap <code>&quot;100001&quot;</code>. The string becomes <code>&quot;101000&quot;</code>.</li>
	<li>Select the substring <code>&quot;101000&quot;</code>, which is balanced because it has two <code>&#39;0&#39;</code>s and two <code>&#39;1&#39;</code>s.</li>
</ul>
</div>

Example 2:

<div class="example-block">
Input: s = &quot;111&quot;

Output: 0

Explanation:

<ul>
	<li>Choose not to perform any swaps.</li>
	<li>Select the empty substring, which is balanced because it has zero <code>&#39;0&#39;</code>s and zero <code>&#39;1&#39;</code>s.</li>
</ul>
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 105</code></li>
	<li><code>s</code> consists only of the characters <code>&#39;0&#39;</code> and <code>&#39;1&#39;</code>.</li>
</ul>