How should I practice Substring Removal?

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

Is Substring Removal associated with JPMorgan Chase?

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

Problem · String

Substring Removal

Learn this problem

● MediumJCJPMorgan ChaseINTERNOA

Problem statement

Given a string, seq, that consists of the characters 'A' and 'B' only, in one move, delete either an "AB" or a "BB" substring and concatenate the remaining substrings.

Find the minimum possible length of the remaining string after performing any number of moves.

Note: A substring is a contiguous subsequence of a string.

Function

getMinLength(seq: String) → int

Complete the function getMinLength in the editor below.

getMinLength has the following parameter(s):

string seq: the string

Returns

int: the minimum possible length of the remaining string

Examples

Example 1

seq = "BABBA"return = 1

Using 0-based indexing, the following moves are optimal.

Delete the substring "AB" starting at index 1. "BABBA" → "BBA"
Delete the substring "BB" starting at index 0. "BBA" → "A"

There are no more moves, so the minimum possible length of the remaining string is 1.

Constraints

1 ≤ |seq| ≤ 2 * 10^5
The string only contains characters 'A' and 'B'.

Problem statement

Function

Examples

Example 1

Constraints

More JPMorgan Chase problems