Maximum Nesting Depth of the Parentheses - Leetcode 1614 - Python

[@jans3067]

wish every daily was this easy

[@theteacher010]

Then we wouldn't learn anything!

[@CrabGuyy]

if you only do what you can do then you will never be more than you are now (-shifu btw)

[@AlgorithmArena]

Man this is a really straightforward problem. They should have made it so that the parenthesis might not have been valid to make it more fun

[@ombhamare623]

1111. Maximum Nesting Depth of Two Valid Parentheses Strings Enjoy

[@chrischika7026]

then it wouldnt be an easy.

[@AlgorithmArena]

Ty man will check it out@@ombhamare623

[@AlgorithmArena]

true
@@chrischika7026

[@leeroymlg4692]

this is one of those problems where trying to read the description is harder than solving the problem itself.

[@srikarthickk9708]

Your explanation skills are insane. Thank you so much. As you started explaining the problem, it leads me to the solution automatically

[@amongus-rq2hb]

i was about to search this problem and youtube recommended it on homepage.

[@stoppls1709]

they're in your walls

[@erminiottone]

Anything about daily LC 2444. Count Subarrays With Fixed Bounds ?

[@neks2081]

Ye, I wanted to see that too

[@CS_n00b]

great job navdeep congratulations on the coin for a one day streak!

[@tomiwaadedokun6638]

I've always implemented this problem with the stack DS which made the space complexity O(n)
Nicely explained 💯

[@Doomer1234]

same :D

[@aptus716]

Probably the easiest leetcode problem ive seen so far.

[@Matthias53787]

The singular of "parentheses" is "parenthesis" not "parenthesee"

[@akialter]

Imagine big tech asking this question

[@satyamjha68]

Solved it!!

[@gryffindor6409]

why didnt u uploaded solution videos for the past few days?

[@NeetCodeIO]

I uploaded videos for them in the past. You can usually find them by searching TH-cam

[@akashreddyjammula]

I think the code will fail for (() this will give the output as 2 but it is not a valid parenthesis it should give 0 right?

[@suvankar54]

It is given that the i/p is a vps.

[@torvasdh]

This was easy, but that description is just asinine like wtf was bro yapping about

[@pastori2672]

i didnt even bother reading allat

[@BurhanAijaz]

nice to see that our code is almost same:
class Solution:
def maxDepth(self, s: str) -> int:
ans = 0
left, right = 0, 0
for i in s:
if i == "(":
left += 1
elif i == ")":
right += 1
ans = max(ans, left - right)
return ans

[@neks2081]

Interesting approach, although you run max more often than in other solutions

[@BurhanAijaz]

@@neks2081 yeah that might take extra time

[@shitluna50kgonedogegogogo87]

func max_depth(str string) int {
stack := []string{}
mapping := make(map[string]string)
mapping["("] = ")"
mapping["["] = "]"
mapping["{"] = "}"
rev_mapping := make(map[string]string)
cur_count := 1
max_count := 1
for key := range mapping {
rev_mapping[mapping[key]] = key
}
for i := 0; i < len(str); i++ {
char := string(str[i])
if mapping[char] != "" {
stack = append(stack, char)
cur_count++
} else if rev_mapping[char] != "" {
ulta := rev_mapping[char]
max_count = max(max_count, cur_count)
cur_count = 0
if stack[len(stack)-1] != ulta {
return -1
} else {
stack = stack[:len(stack)-1]
}
} else {
continue
}
}
if len(stack) == 0 {
return max_count
}
return -1
}

[@BurhanAijaz]

@@shitluna50kgonedogegogogo87 wow you have complicated it so much and are using a stack as well , so I guess SC is O(n) as well and you are solving for all kinds of brackets but if you had seen the question carefully, then you would have known that it contained only () this kind of brackets and there is no need of using any extra space as well, so unnecessarily complicating things is not a good way to solve any question bro, hope you take it positively

[@shitluna50kgonedogegogogo87]

@@BurhanAijaz while solving, i am also checking wheather the brackets are valid

[@jmbrjmbr000]

Hello my crush