Longest 1s After One Flip

June 23, 2022 less than 1 minute read

You are given a string s containing 1s and 0s. Given that you can flip at most one "0", return the length of the longest contiguous substring of 1s.

Constraints

n ≤ 100,000 where n is the length of s.

https://binarysearch.com/problems/Longest-1s-After-One-Flip

Examples

Example 1

Input

s = 10110

Output

answer = 4

Explanation

If we flip the first zero then we get "11110".

Solution

Share on

Twitter Facebook LinkedIn

Minimum Window Substring

August 31, 2022 less than 1 minute read

Given two lowercase alphabet strings a and b, return the length of a minimum substring in a that contains all the characters of b.

Partition String

March 22, 2022 less than 1 minute read

Given a lowercase alphabet string s, partition s into as many pieces as possible such that each letter appears in at most one piece and return the sizes of t...

Stuck Keyboard

January 14, 2022 1 minute read

You are given two strings typed and target. You want to write target, but the keyboard is stuck so some characters may be written 1 or more times. Return whe...

Check Palindrome

January 14, 2022 less than 1 minute read

Given a string s, return whether it is a palindrome.

Xuanken Tay