Maximum length of balanced string after swapping and removal of characters
Given a string str consisting of characters ‘(‘, ‘)’, ‘[‘, ‘]’, ‘{‘ and ‘}’ only. The task is to find the maximum length of the balanced string after removing any character and swapping any two adjacent characters.
Examples:
Input: str = “))[]]((”
Output: 6
The string can be converted to ()[]()Input: str = “{{{{{{{}”
Output: 2
Approach: The idea is to remove extra unmatched parentheses from string because we cannot generate a balanced pair for it and swap the remaining characters to balance the string. Therefore the answer is equal summation of pairs of all balanced parenthesis. Note that we can move a character to any other place by adjacent swappings.
Below is the implementation of the above approach:
C++
// C++ implementation of the approach #include <bits/stdc++.h> using namespace std; // Function to return the length of // the longest balanced sub-string int maxBalancedStr(string s) { // To store the count of parentheses int open1 = 0, close1 = 0; int open2 = 0, close2 = 0; int open3 = 0, close3 = 0; // Traversing the string for (int i = 0; i < s.length(); i++) { // Check type of parentheses and // incrementing count for it switch (s[i]) { case '(': open1++; break; case ')': close1++; break; case '{': open2++; break; case '}': close2++; break; case '[': open3++; break; case ']': close3++; break; } } // Sum all pair of balanced parentheses int maxLen = 2 * min(open1, close1) + 2 * min(open2, close2) + 2 * min(open3, close3); return maxLen; } // Driven code int main() { string s = "))[]](("; cout << maxBalancedStr(s); return 0; } |
chevron_right
filter_none
Java
// Java implementation of the approach class GFG { // Function to return the length of // the longest balanced sub-string static int maxBalancedStr(String s) { // To store the count of parentheses int open1 = 0, close1 = 0; int open2 = 0, close2 = 0; int open3 = 0, close3 = 0; // Traversing the string for (int i = 0; i < s.length(); i++) { // Check type of parentheses and // incrementing count for it switch (s.charAt(i)) { case '(': open1++; break; case ')': close1++; break; case '{': open2++; break; case '}': close2++; break; case '[': open3++; break; case ']': close3++; break; } } // Sum all pair of balanced parentheses int maxLen = 2 * Math.min(open1, close1) + 2 * Math.min(open2, close2) + 2 * Math.min(open3, close3); return maxLen; } // Driven code public static void main(String[] args) { String s = "))[]](("; System.out.println(maxBalancedStr(s)); } } // This code is contributed by Code_Mech. |
chevron_right
filter_none
Python3
# Python 3 implementation of the approach # Function to return the length of # the longest balanced sub-string def maxBalancedStr(s): # To store the count of parentheses open1 = 0 close1 = 0 open2 = 0 close2 = 0 open3 = 0 close3 = 0 # Traversing the string for i in range(len(s)): # Check type of parentheses and # incrementing count for it if(s[i] == '('): open1 += 1 continue if s[i] == ')': close1 += 1 continue if s[i] == '{': open2 += 1 continue if s[i] == '}': close2 += 1 continue if s[i] == '[': open3 += 1 continue if s[i] == ']': close3 += 1 continue # Sum all pair of balanced parentheses maxLen = (2 * min(open1, close1) + 2 * min(open2, close2) + 2 * min(open3, close3)) return maxLen # Driven code if __name__ == '__main__': s = "))[]]((" print(maxBalancedStr(s)) # This code is contributed by # Surendra_Gangwar |
chevron_right
filter_none
C#
// C# implementation of the approach using System; class GFG { // Function to return the length of // the longest balanced sub-string static int maxBalancedStr(string s) { // To store the count of parentheses int open1 = 0, close1 = 0; int open2 = 0, close2 = 0; int open3 = 0, close3 = 0; // Traversing the string for (int i = 0; i < s.Length; i++) { // Check type of parentheses and // incrementing count for it switch (s[i]) { case '(': open1++; break; case ')': close1++; break; case '{': open2++; break; case '}': close2++; break; case '[': open3++; break; case ']': close3++; break; } } // Sum all pair of balanced parentheses int maxLen = 2 * Math.Min(open1, close1) + 2 * Math.Min(open2, close2) + 2 * Math.Min(open3, close3); return maxLen; } // Driver code public static void Main() { string s = "))[]](("; Console.WriteLine(maxBalancedStr(s)); } } // This code is contributed by Code_Mech. |
chevron_right
filter_none
PHP
<?php // PHP implementation of the approach // Function to return the length of // the longest balanced sub-string function maxBalancedStr($s) { // To store the count of parentheses $open1 = 0; $close1 = 0; $open2 = 0; $close2 = 0; $open3 = 0; $close3 = 0; // Traversing the string for ($i = 0; $i < strlen($s); $i++) { // Check type of parentheses and // incrementing count for it switch ($s[$i]) { case '(': $open1++; break; case ')': $close1++; break; case '{': $open2++; break; case '}': $close2++; break; case '[': $open3++; break; case ']': $close3++; break; } } // Sum all pair of balanced parentheses $maxLen = 2 * min($open1, $close1) + 2 * min($open2, $close2) + 2 * min($open3, $close3); return $maxLen; } // Driven code { $s = "))[]](("; echo(maxBalancedStr($s)); } // This code is contributed by Code_Mech. |
chevron_right
filter_none
Output:
6
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
Recommended Posts:
- Length of the smallest sub-string consisting of maximum distinct characters
- Minimum length of the sub-string whose characters can be used to form a palindrome of length K
- Permutation of a string with maximum number of characters greater than its adjacent characters
- Maximum length substring having all same characters after k changes
- Maximum length palindrome that can be created with characters in range L and R
- Maximum count of sub-strings of length K consisting of same characters
- Total length of string from given Array of strings composed using given characters
- Minimum length String with Sum of the alphabetical values of the characters equal to N
- Check if frequency of all characters can become same by one removal
- Maximum number of characters between any two same character in a string
- Maximum repeated frequency of characters in a given string
- String with maximum number of unique characters
- Minimum addition/removal of characters to be done to make frequency of each character prime
- Maximum length prefix such that frequency of each character is atmost number of characters with minimum frequency
- Reduce Hamming distance by swapping two characters
- Maximum even length sub-string that is permutation of a palindrome
- Find the first maximum length even word from a string
- Count maximum-length palindromes in a String
- Maximum length substring with highest frequency in a string
- Maximum length prefix of one string that occurs as subsequence in another
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
- Maximum number of set bits count in a K-size substring of a Binary String
- std::string::crbegin() and std::string::crend() in C++ with Examples
- Minimum bit flips such that every K consecutive bits contain at least one set bit
- Minimum flips required to form given binary string where every flip changes all bits to its right as well
- Lexicographically smallest K-length substring containing maximum number of vowels