I would like to receive feedback on my coding interview for the following problem:
A string of brackets is considered correctly matched if every opening bracket in the string can be paired up with a later closing bracket, and vice versa. For instance, “(())()” is correctly matched, whereas “)(“ and “((” aren’t. For instance, “((” could become correctly matched by adding two closing brackets at the end, so you’d return 2.
Given a string that consists of brackets, write a function bracketMatch that takes a bracket string as an input and returns the minimum number of brackets you’d need to add to the input in order to make it correctly matched.
Explain the correctness of your code, and analyze its time and space complexities.
input: text = “(()” output: 1
input: text = “(())” output: 0
input: text = “())(” output: 2 Constraints:
[time limit] 5000ms
[input] string text
1 ≤ text.length ≤ 5000 [output] integer
def bracket_match(text): diffCounter = 0 answer = 0 length = len(text) for i in range(length): if text[i] == '(': diffCounter += 1 elif text[i] == ')': diffCounter -= 1 if diffCounter < 0: diffCounter += 1 answer +=1 return answer + diffCounter text1=")))(" print(bracket_match(text1))