lackerRank Question $-$ QuE

hackerrank.com$/$test$/58$htplkrt$72/$questions$/63$tsdplisc$6$

rview $150$

New folder

Question $1$

Given a string, seq, that consists of the characters $\text{'}$A$\text{'}$ and $\text{'}B\text{'}$ 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.

Example

seq $=$ BABBA

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

$$ Jelete 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.$

Function Description

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

Type here to search