Reverse Substrings Between Each Pair of Parentheses - Leetcode 1190 - Python 

1:30 NeetCode loves us all, confirmed.

Dude, i would have never come up with that second solution in my wildest dreams

I actually thought the optimal sol but wasnt confident if i will code that properly. Nice Explanation NEET

Thanks for the second solution Similar to you I also got first one crt !

I was having a hard time understanding the O(n) time approach. You explained it so well. Thank you !

Thanks for the awesome explanation I was very close to coming up with the linear time solution on my first try, But I got stuck on the two indexes approach until I ran out of time for solving the question. I then found your video online and realized how close I was if only I thought of creating a pair using a stack rather than stick to the two pointers approach. Thanks for the informative and amazing video NeetCode!

The linear solution literally blew my mind....I think the harder part is to turn observation into an algorithm because I noticed the alternating pattern but I could not deduce how one pointer could just write the solution if you give it the right pivot points and jumps

Nah im happy with my n2 solution, never could have come up with that linear solution

Thanks for sharing!🎉

the man who came wtih approach two he is a genius Wooow.Kudos

Really cool solution, the second one!

BEAUTIFUL!

We need Dice roll simulation problem (Hard).

Great video! Are there other leetcode problems that we can apply the second wormhole solution?

I can't imagine , I actually though of the same 2nd method just as he said after banging my head for 40 mins

I had solved the problem in the same way as the 1st approach but it didn't beat that many people 😅

thanks for that great video, I have one question which is should I solve leetcode problems after finishing each topic (I mean solving problems on each specific topic) or should I wait until I finish the full DSA roadmap of whatever course I'm taking then start solving problems on the full DSA?

SIMPLE CODE: With same intuition , since the characters in even numbered paranthesis will not get reversed and the characters in odd numbered will get reversed. We can simply use 2 pointers (start=0 and end=N-1) for the result array which will have same size as original array. Then do the following - 1. Iterate the original array using "current" pointer starting from index 0. 2. Also maintain an integer variable "count" which will keep track of the count of paranthesis in which our "current" pointer lies. If we encounter '(' then do ++count, and if we encounter ')' then do --count. 2. If current character lies in even numbered paranthesis (i.e. when "count" is even) then write that character at "start" position in result array and move "start" to next position. 3. If current character lies in odd numbered paranthesis (i.e. when "count" is odd) then write that character at "end" position in result array and move "end" one position backward.

Although I came up with O(n) solution initially and failed to really code it up. I am settling for O(n^2) solution for being intuitive and that what I can actually code up during interview.

This was fun

kinda had the intution for second algo but could not code

GODLIKE

i love u 2

I was so close. 😂

I have sent you a LinkedIn request too.

This exact one in C++... class Solution { public: string reverseParentheses(string s) { int n = s.length(); unordered_map mp; stack st; for (int i = 0; i < n; i++) { if (s[i] == '(') st.push(i); else if (s[i] == ')') { int j = st.top(); st.pop(); mp[i] = j; mp[j] = i; } } int i = 0; int dir = 1; string ans = ""; while (i < n) { if (s[i] == '(' || s[i] == ')') { i = mp[i]; dir = -1 * dir; } else { ans += s[i]; } i += dir; } return ans; } }; ☺

I got the intuition on O(n) but I couldn't able to code it up... I don't know where I'm lacking in...

waiting for the course on python

i'm second 😅 can i have a connect from you on linkedin

Parentehsis problems means stack:

i love you

I solved it in same way as in 394.decode string

"a(bcdefghijkl(mno)p)q" can any one explain this example

I'm first

my solution Runtime 28ms Beats 93.43% Memory 16.50MB Beats 81.94%

lol I am early

who tf actually came up with the second approach?