1190. Reverse Substrings Between Each Pair of Parentheses Leetcode Editorial | Problem of the Day

[@vishwajeetsingh209]

The time complexity of yours can be further reduced. Right .?

[@03_utpallucky40]

Yes we can use indexing of string and will store in array in case of open parenthesis .

[@AbhinavAwasthi]

Yeah, I think I missed some point

[@03_utpallucky40]

@@AbhinavAwasthi already you are doing great job keep doing ..

[@vishwajeetsingh209]

I guess you are not thinking of the time complexity. Time complexity is O(3*N)

[@AbhinavAwasthi]

Yeah, I think I missed some point
It will be O(n^2)