How should I practice Count Equal Binary Substrings?

Start by reading the full statement, solve the visible examples, then compare the pattern against related JP Morgan Chase online assessment problems in FastPrep.

Is Count Equal Binary Substrings associated with JP Morgan Chase?

FastPrep tags this as a JP Morgan Chase online assessment coding practice problem when the problem catalog has that company and stage context.

Count Equal Binary Substrings

JP Morgan Chase● EasyOA

Learn

Problem statement

Count the number of substrings in a binary string that contain an equal number of 0s and 1s, where all 0s and 1s are grouped together. Duplicate substrings are counted in the total.

A binary string consists only of 0s and 1s, and a substring is a contiguous group of characters within the string.

Function

oneSubstringCount(s: String) → int

Complete the function oneSubstringCount in the editor within the following parameter(s):

s: a binary string

Returns int: the number of substrings that meet the criteria

Endless gratitude to a dear old friend whose generosity in sharing the source made all the difference. 🌸

Examples

Example 1

s = "011001"return = 4

The qualifying substrings are "01", "10", "1100", and "01", giving a total of 4. Note that "0110" has equal 0s and 1s but is not counted because the 0s and 1s are not grouped together.

Problem statement

Function

Examples

Example 1

More JP Morgan Chase problems