Closed silicolicious closed 2 years ago
@silicolicious, Kindly add your solution to "leetcode" folder. Deadline - 21/10/2021
This Issue will only be counted towards ranking criteria of this repository.
Gentle advice- A bit more tough questions would be appreciated for Hacktoberfest tag.
Enter your question -
A valid parentheses string is either empty "", "(" + A + ")", or A + B, where A and B are valid parentheses strings, and + represents string concatenation.
For example, "", "()", "(())()", and "(()(()))" are all valid parentheses strings. A valid parentheses string s is primitive if it is nonempty, and there does not exist a way to split it into s = A + B, with A and B nonempty valid parentheses strings.
Given a valid parentheses string s, consider its primitive decomposition: s = P1 + P2 + ... + Pk, where Pi are primitive valid parentheses strings.
Return s after removing the outermost parentheses of every primitive string in the primitive decomposition of s.
Enter link to the question(if question belongs to any online platform) -
https://leetcode.com/problems/remove-outermost-parentheses/
Tags for the question(eg - Array, Basic, Stack, etc.) -
String
@SarthakKeshari Please assign this to me.