FastPrepFastPrep
Problem Brief

Substring Removal

INTERNOA

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 Description

Complete the function getMinLength in the editor below.

getMinLength has the following parameter(s):

  1. string seq: the string

Returns

int: the minimum possible length of the remaining string

1Example 1

Input
seq = "BABBA"
Output
1
Explanation

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

Limits and guarantees your solution can rely on.

  • 1 ≤ |seq| ≤ 2 * 10^5
  • The string only contains characters 'A' and 'B'.
public int getMinLength(String seq) {
    // write your code here
}
Input

seq

"BABBA"

Output

1

Sign in to submit your solution.