Given a dataset of strings containing only parentheses, characters $\text{'}(\text{'}$ and $\text{'})\text{'},$ the data represented by the string is valid if it is a balanced bracket sequence. One adjustment to the string can be made: at most one bracket can be moved from its original place to any other position in the string. The task is to determine whether, for each string, it is possible to balanced the bracket sequence in $1$ move or less. Return an array of the size of the dataset, where the $r^{th}$ integer is $1$ if the string can be converted into a balanced string, and $0$ otherwise.

Note: A string $s$ is a balanced bracket sequence if:

s is empty.

$s$ is equal to $"(t)",$ where $t$ is a balanced bracket sequence.

$s$ is equal to $t_1{t}_2$ i$.$e$.$ concatenation of $t_1$ and $t_2$ where $t_1$ and $t_2$ are balanced bracket sequences.