Given a string, find all ways to break the given string in bracket form. Enclose each substring within a parenthesis.
Input : abc Output: (a)(b)(c) (a)(bc) (ab)(c) (abc) Input : abcd Output : (a)(b)(c)(d) (a)(b)(cd) (a)(bc)(d) (a)(bcd) (ab)(c)(d) (ab)(cd) (abc)(d) (abcd)
We strongly recommend you to minimize your browser and try this yourself first.
The idea is to use recursion. We maintain two parameters – index of the next character to be processed and the output string so far. We start from index of next character to be processed, append substring formed by unprocessed string to the output string and recurse on remaining string until we process the whole string. We use std::substr to form the output string. substr(pos, n) returns a substring of length n that starts at position pos of current string.
Below diagram shows recursion tree for input string “abc”. Each node on the diagram shows processed string (marked by green) and unprocessed string (marked by red).
Below is its implementation-
(a)(b)(c)(d) (a)(b)(cd) (a)(bc)(d) (a)(bcd) (ab)(c)(d) (ab)(cd) (abc)(d) (abcd)
This article is contributed by Aditya Goel. If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Find index of closing bracket for a given opening bracket in an expression
- Check if the bracket sequence can be balanced with at most one change in the position of a bracket
- Print Bracket Number
- Construct Binary Tree from String with bracket representation
- Check if permutaion of one string can break permutation of another
- Minimum number of bracket reversals needed to make an expression balanced
- Minimum Swaps for Bracket Balancing
- Number of closing brackets needed to complete a regular bracket sequence
- Expression contains redundant bracket or not
- Range Queries for Longest Correct Bracket Subsequence
- Number of balanced bracket subsequence of length 2 and 4
- Minimum number of bracket reversals needed to make an expression balanced | Set - 2
- Convert an unbalanced bracket sequence to a balanced sequence
- Check if expression contains redundant bracket or not | Set 2
- Minimum Cost required to generate a balanced Bracket Sequence
- Count distinct regular bracket sequences which are not N periodic
- Generate a string whose all K-size substrings can be concatenated to form the given string
- Word Break Problem | (Trie solution)
- Minimum Word Break
- Word Break Problem using Backtracking