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>

Weekly Contest 497

weekly-contest-497

longestBalanced

Staff

Longest Balanced Substring After One Swap

Hash Table

String

Prefix Sum

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 a binary string s consisting only of characters '0' and '1'.

A string is balanced if it contains an equal number of '0's and '1's.

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

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

 

Example 1:

Input: s = "100001"

Output: 4

Explanation:

 * Swap "100001". The string becomes "101000".
 * Select the substring "101000", which is balanced because it has two '0's and two '1's.

Example 2:

Input: s = "111"

Output: 0

Explanation:

 * Choose not to perform any swaps.
 * Select the empty substring, which is balanced because it has zero '0's and zero '1's.

 

Constraints:

 * 1 <= s.length <= 105
 * s consists only of the characters '0' and '1'.