Balanced Bracket String Array - VISA OA

Problem Preview

"You are given an array of strings dataset, where each string consists only of '(' and ')'. For each string, determine whether it can be converted into a balanced bracket sequence using at most one move. A string is considered balanced if: * It is empty, or * It can be written as (t), where t is balanced, or * It can be written as t1t2, where both t1 and t2 are balanced. Return an array where: * 1 indicates the string can be made balanced using zero or one move. * 0 indicates it cannot be made balanced using zero or one move."