Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

i want to add one leetcode probelm #2345

Open
tusharmishra069 opened this issue Oct 9, 2024 · 2 comments
Open

i want to add one leetcode probelm #2345

tusharmishra069 opened this issue Oct 9, 2024 · 2 comments

Comments

@tusharmishra069
Copy link

i want to add one leetcode probelm that is i want to add one leetcode probelm

about the question:-

957. Minimum Add to Make Parentheses Valid
Medium
A parentheses string is valid if and only if:

It is the empty string,
It can be written as AB (A concatenated with B), where A and B are valid strings, or
It can be written as (A), where A is a valid string.
You are given a parentheses string s. In one move, you can insert a parenthesis at any position of the string.

For example, if s = "()))", you can insert an opening parenthesis to be "(()))" or a closing parenthesis to be "())))".
Return the minimum number of moves required to make s valid.

Example 1:

Input: s = "())"
Output: 1

Example 2:

Input: s = "((("
Output: 3

Constraints:

1 <= s.length <= 1000
s[i] is either '(' or ')'.

@tusharmishra069
Copy link
Author

.take

@tusharmishra069
Copy link
Author

kindly assign me this , i love to add one question to your repo

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant