Company: IBM

Difficulty: medium

Problem Statement

Balanced Bracket Sequence body { font-family: Arial, sans-serif; line-height: 1.6; margin: 20px; } .problem-container { max-width: 800px; margin: 0 auto; padding: 20px; border: 1px solid #ccc; border-radius: 8px; background-color: #f9f9f9; } h1, h2, h3 { color: #333; } .problem-description, .input-format, .output-format, .constraints, .examples { margin-bottom: 20px; } .example { background-color: #fff; padding: 15px; border: 1px solid #ddd; border-radius: 5px; margin-bottom: 15px; } pre { background-color: #f4f4f4; padding: 10px; border: 1px solid #ddd; border-radius: 5px; overflow-x: auto; } .explanation { margin-top: 10px; color: #555; } Balanced Bracket Sequence Given a dataset of strings containing only parentheses () , the data represented by the string is valid if it is a balanced bracket sequence. An 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 strin

More IBM OA questionsInterview experiences