Longest Valid Parenthesis [Dynamic programming] | Python Code

preview_player
Показать описание
Question:- Given a string A containing just the characters ’(‘ and ’)’

Find the length of the longest valid (well-formed) parentheses substring.
Returns the length of the longest valid (well-formed) parentheses substring.

Input :-
A = "(()"
Output :-
2

Please help our channel by SUBSCRIBING it.

#longest #valid #parenthesis #netsetos
  1. nETSETOS
  2. data structures and algorithms
  3. data structures and algorithms tutorial
  4. data structures tutorial
  5. algorithms tutorial
  6. arrays
Рекомендации по теме
Longest Valid Parenthesis 0:18:23

Longest Valid Parenthesis [Dynamic programming] | Python Code

Leetcode 32 Longest 0:07:06

Leetcode 32 Longest Valid Parentheses

LeetCode 32. Longest 0:30:00

LeetCode 32. Longest Valid Parentheses

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

L32. Longest Valid 0:18:41

L32. Longest Valid Parentheses | Dynamic Programming Approach

LeetCode 32. Longest 0:15:02

LeetCode 32. Longest Valid Parentheses (Hard) | Dynamic Programming | C++

LeetCode 32 - 0:18:26

LeetCode 32 - Longest Valid Parenthesis

L -70 Longest 0:24:00

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

32. Longest Valid 0:16:29

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

leetcode 32 Longest 0:17:03

leetcode 32 Longest Valid Parentheses

Leetcode 32 | 0:21:15

Leetcode 32 | Longest Valid Parentheses (Google Interview Question | Goldman Sachs Interview Ques)

32. Longest Valid 0:19:38

32. Longest Valid Parentheses

LeetCode 32. Longest 0:07:09

LeetCode 32. Longest Valid Parentheses

Valid Parenthesis String 0:13:43

Valid Parenthesis String - Leetcode 678 - Python

32. Longest Valid 0:02:38

32. Longest Valid Parentheses

32. Longest Valid 0:09:41

32. Longest Valid Parentheses

L11. Valid Parenthesis 0:26:09

L11. Valid Parenthesis String | Multiple Approaches

Longest Valid Parentheses 0:09:36

Longest Valid Parentheses | LeetCode 32 | Coders Camp

leetcode 32 longest 0:10:58

leetcode 32 longest valid parentheses

Google Interview Question 0:08:15

Google Interview Question | Longest Valid Parentheses | Solution With Code | Interview Bit Problem

Leetcode 32. Longest 0:11:19

Leetcode 32. Longest Valid Parenthesis Substring - Ep4

32. Longest Valid 0:07:20

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

Longest Valid Parentheses 0:00:25

Longest Valid Parentheses with Python

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

Literally very clear explanation mam. 👏

CSKAASIPRASANTHA
Автор

the explanation is buggy ... at 12:01 A[0-1] -> A[-1] instead of rejecting it will take last value.
according to this, example test case ")(" , value should be 0 but will come 4.

this was corrected in the code

Ayush-mbse
Автор

U can use this as well

val=')()())'
val1=val.count('(')
val2=val.count(')')

if val1 == val2:
print val1*2
else:
print min([val1, val2])*2

saikatdasgupta
Автор

The problem with the explanation is that you didn't say how you came up with the solution.

observr
Автор

please tell the intuition first and then algo. we are here to learn not to memorize.

swatilohiya