Longest Valid Parentheses | Live Coding with Explanation | Leetcode - 32

preview_player
Показать описание
Detailed Explanation for Longest Valid Parentheses Leetcode problem.

To support us you can donate

Check out our other popular playlists:

If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful.

#coding #leetcode #programminglife #programmingisfun #programmer #tech #software #codinglife #leetcode
  1. Algorithms Made Easy
  2. Longest Valid Parentheses
  3. leetcode 32
  4. longest valid parentheses
  5. coding questions
  6. stack interview
Рекомендации по теме
Longest Valid Parentheses 0:12:51

Longest Valid Parentheses | Live Coding with Explanation | Leetcode - 32

LONGEST VALID PARENTHESIS 0:12:51

LONGEST VALID PARENTHESIS | LEETCODE # 32 | PYTHON OPTIMAL SOLUTION

Leetcode 32 Longest 0:07:06

Leetcode 32 Longest Valid Parentheses

Longest Valid Parentheses 0:05:21

Longest Valid Parentheses | Leetcode 32 | Stacks🔥🔥🔥 | Easy Peasy | Live coding session

Leetcode - Longest 0:10:10

Leetcode - Longest Valid Parentheses (Python)

32. Longest Valid 0:16:29

32. Longest Valid Parentheses - Day 24/31 Leetcode May Challenge

Longest Valid Parentheses 0:15:03

Longest Valid Parentheses | Leetcode 32 | LC Hard | Live coding session | April 3 | LEETCODE EXPLORE

32. Longest Valid 0:12:28

32. Longest Valid Parentheses - Day 3/30 Leetcode April Challenge

Instafluff vs LeetCode 0:48:10

Instafluff vs LeetCode - (Hard) Longest Valid Parentheses

Longest Valid Parentheses 0:09:36

Longest Valid Parentheses | LeetCode 32 | Coders Camp

Longest Valid Parentheses 0:20:55

Longest Valid Parentheses | String questions | Coding Interview Questions Series

Longest valid Parentheses 0:23:23

Longest valid Parentheses | Problem of the Day-11/08/21 | Riya Singhal | GeeksforGeeks Practice

Longest Valid Parentheses 0:19:58

Longest Valid Parentheses | LeetCode 32 | Theory + Python + Java

Longest Valid Parentheses 0:13:30

Longest Valid Parentheses - LeetCode #32 with Python, JavaScript, Java and C++

Longest Valid Parentheses 0:10:18

Longest Valid Parentheses - LeetCode (Solution & Explanation | JavaScript)

32 Longest Valid 0:18:37

32 Longest Valid Parentheses | Leetcode 32 | Solution | Java | String | Stack

LeetCode 32. Longest 0:30:00

LeetCode 32. Longest Valid Parentheses

Leetcode 32. Longest 0:00:35

Leetcode 32. Longest Valid Parentheses | Easy Explanation Hindi

32. Longest Valid 0:07:20

32. Longest Valid Parentheses in Python Explained | Amazon Interview Question

Leetcode 32. Longest 0:16:34

Leetcode 32. Longest Valid Parentheses (Python)

Longest Valid Parenthesis 0:18:23

Longest Valid Parenthesis [Dynamic programming] | Python Code

L -70 Longest 0:24:00

L -70 Longest Valid Parentheses Leetcode Hard 32 Best Explanation | Java DSA Placement | FAANG

Leetcode 32. Longest 0:11:19

Leetcode 32. Longest Valid Parenthesis Substring - Ep4

32. Longest Valid 0:08:40

32. Longest Valid Parentheses (LeetCode)

Комментарии
Автор

We hope you all are enjoying our videos!!! Don't forget to leave a comment!!! Please like the video to support us!!!

Questions you might like:

Struggling in a question??

Leave in a comment and we will make a video!!!🙂🙂🙂

AlgorithmsMadeEasy
Автор

you should at least dry run through full array...

MadForCs
Автор

Actually, I'm trying to solve this problem last 2 days but I cannot solve this problem, but today got it. Thank you, Brother.

ArifulIslam-vsiv
Автор

There is a "why we are doing this " missing in your video

vaibhavvishal
Автор

why is it necessary to go from left to right AND right to left? why isnt just one traversal enough for the O(1) space and O(n) time solution?

anonymoussloth
Автор

Thank you!! This is very efficient video. I did my own dry run and finally fully get it!

emmatime
Автор

Wow, you explained a hard question in an relatively easy way, bravo !

b
Автор

i didnt get why we push -1 initially ? i know if we dont push -1 then if the first char is ')' then else cond will run and it will do s.pop() which will give error if -1 not present in stack.... but if that isnt the case wont this cause any problem

ayushthakur
Автор

The awesome solution, again intuitive and easy to understand. However, how did you come up with the trick of using -1 at the bottom of the stack? Because I could not even after few attempts at it. You coming up w/ the solutions so intuitively brings a genuine concern about whether do I have enough intelligence.

sumitrawat
Автор

Thanks for that solution. This approach is the easiest I have seen.

surendisodia
Автор

Amazing video ! Loved the without Extra space approach !

poorpanda
Автор

thank you so much for the solution! i have a question regarding the O(1) extra space non-dp solution : when we iterate from left to right, how do i come up with the condition that when open bracket count is less than close bracket count, i will need to reset open = close = 0 ? I missed this condition at first and submited a wrong answer

yuezhang
Автор

In 3rd approach
Why we do 2 itertions one from left to right and then right to left ?

pankajbhatt
Автор

Leetcode Solution me se hi answer chapne hai tho video kyu bana raha hai.

prathamkesarkar
Автор

i think for your O(1) space complexity approach this condition may fail when input is ")(".

pavanguntuboina
Автор

During 6:08 minutes, in line 15 and 16, we have kept a condition of if stack is empty, we need to push the current index, please provide me an intuition as of why this condition is important?

gazaljain
Автор

You offered the approaches without any logical explanations, thus coming across as having found the solution in your dreams. Although in reality, these are reproduced from the LeetCode editorial.

abhijit-sarkar
Автор

Please solve 1818. Minimum absolute sum difference leetcode problem 🙏🏼

Jyotikumari-zudg
Автор

This is going to fail for "()". the actual answer will be 4, while the expected answer is 2. To FIx this also reinitialise current =0, before iteretating in reverse order

abhishekanand
Автор

for ()(()()( your code is giving output as 3 but ans is 2

visheshjain