Is Convertible Data

Problem Overview

• Determine if each parentheses string can become a balanced bracket sequence with at most one bracket moved.
• Input: array of strings with only '(' and ')'; Output: int array where 1 means convertible and 0 otherwise; total length across strings ≤ 2e5.
• Relevant to data validation and parsing scenarios that allow minimal edits to fix structure.
• An Ibm interviews coding interview problem and a common interview question on string validity.