• Home
  • Subscribe
  • Contribute Us
    • Share Your Interview Experience
  • Contact Us
  • About
    • About CSEstack
    • Campus Ambassador
  • Forum & Discus
  • Tools for Geek
  • LeaderBoard
CSEstack

What do you want to Learn Today?

  • Programming
    • Tutorial- C/C++
    • Tutorial- Django
    • Tutorial- Git
    • Tutorial- HTML & CSS
    • Tutorial- Java
    • Tutorial- MySQL
    • Tutorial- Python
    • Competitive Coding Challenges
  • CSE Subject
    • (CD) Compiler Design
    • (CN) Computer Network
    • (COA) Computer Organization & Architecture
    • (DBMS) Database Management System
    • (DS) Data Structure
    • (OS) Operating System
    • (ToA) Theory of Automata
    • (WT) Web Technology
  • Interview Questions
    • Interview Questions- Company Wise
    • Interview Questions- Coding Round
    • Interview Questions- Python
    • Interview Questions- REST API
    • Interview Questions- Web Scraping
    • Interview Questions- HR Round
    • Aptitude Preparation Guide
  • GATE 2022
  • Linux
  • Trend
    • Full Stack Development
    • Artificial Intelligence (AI)
    • BigData
    • Cloud Computing
    • Machine Learning (ML)
  • Write for Us
    • Submit Article
    • Submit Source Code or Program
    • Share Your Interview Experience
  • Tools
    • IDE
    • CV Builder
    • Other Tools …
  • Jobs

Longest Balanced Substring | Maximum Length of Balanced Parentheses

Aniruddha Chaudhari/4263/0
CodePython

You have given a string that contains the curly braces (brackets), both opening and closing braces. You have to find the length of the longest balanced subarray.

Example:

Input : {}{}{
Output: 4

Explanation:

In the above example, the length of the longest subarray/substring is four ({}{}) .

There can be multiple balanced subarrays. In that case, you have to return the length of the longest balanced (valid) subarray.

This coding question was asked in the Bright Money coding test.

Note: Sometimes, there can be parenthesis or square brackets instead of curly braces.

Algorithm

  • Step 1:
    – Initialize the stack (says tack_braces) to check the balanced braces. (Push the character when it is { and pop it when the character is }).
  • Step 2:
    – Maintain the list (says list_count) for counting the length of all the balance substrings.
  • Step 3:
    – Loop over all the characters (says ch) in the string of opening and closing braces.
  • Step 3.2:
    – If the character ch is opening a brace {, add into the stack.
    – If the character ch is } and the stack is not empty, increment the counter by one.
    – If the character ch is } and the stack is empty (That means, it is no longer balanced.), append the count to list_count.
  • Step 3.3:
    – Return the maximum length among all the balanced subarray lengths, multiply by two.

If you understand the logic described in the above algorithm, you can solve this problem in any programming language of your choice.

Python Program for Longest Balanced Substring

We can use the list as a stack in Python. Python list method pop(), remove the last element from the list.

Code:

def max_length_balanced_braces(str_braces):
    stack_braces = []
    list_count = []
    count = 0
    for ch in str_braces:
        if ch == "{":
            stack_braces.append(ch)
        elif stack_braces:
            count += 1
            stack_braces.pop()
        else:
            list_count.append(count)
            count = 0
    return max(list_count)*2

braces = "{}{}}"
count = max_length_balanced_braces(braces)
print(f"Maximum length of balanced substring {braces} is {count}")
 
braces = "{}{{}}}}}"
count = max_length_balanced_braces(braces)
print(f"Maximum length of balanced substring {braces} is {count}"

Output:

Maximum length of balanced substring {}{}} is 4
Maximum length of balanced substring {}{{}}}}} is 6

Complexity

As we are visiting each character in the given string only once, the complexity of the algorithm is O(n). Where, n is the length of the string.

I have solved this in Python programming language. Can anyone solve this in C/C++ or Java programming language? Let’s share your solution to find the longest balanced substring/parenthesis in the comment section below.

Python Interview Questions eBook

coding challengePython
Aniruddha Chaudhari
I am complete Python Nut, love Linux and vim as an editor. I hold a Master of Computer Science from NIT Trichy. I dabble in C/C++, Java too. I keep sharing my coding knowledge and my own experience on CSEstack.org portal.

Your name can also be listed here. Got a tip? Submit it here to become an CSEstack author.

Leave a Reply Cancel reply

Why?

Why Competitive Programming Important?

Coding Challenges for Practice

  1. Count Common Factor
  2. Does it Divide
  3. Sum of Sub Arrays
  4. Pair of Desired Sum
  5. Remove Duplicate Char from String
  6. Sort String by Char Freq (Python)
  7. Sort String by Char Freq (Java)
  8. Split Array into Equal Sum Subarray
  9. Validate IP Address
  10. Validate PAN Card Number
  11. Validate Sudoku
  12. Sort Circular Rotated Array
  13. String Permutations
  14. Min Arrow to Burst Bubbles
  15. Min Cost to Paint All Houses [Amazon]
  16. HourGlass with Max Sum
  17. Max Profit by Buying/Selling Stocks
  18. Hailstone Sequence
  19. Reverse String without affecting Special Characters
  20. Secure Conversation by Encry/Decry
  21. Special Elements in Matrix
  22. Next Greater No with Same set of Digits
  23. Smallest Subarray with Sum Greater than Given Number
  24. Group Anagrams
  25. Find Duplicates in Array in O(n)
  26. Find Two Unique Numbers from Array in O(n)
  27. Number Patterns & Finding Smallest Number
  28. First Unique Element in a Stream
  29. Flip Equivalent Binary Trees [TeachMint]
  30. Minimum Cost of Merging Files [Amazon]
  31. Minimum Distance for Truck to Deliver Order [Amazon]
  32. Longest Sequence of URLs
  33. Order Task for Given Dependencies
  34. Design Music Player
  35. Multilevel Parking System Design
  36. Minimum Coins Required
  37. Max Sum Subarray
  38. Max Avg Sum of Two Subsequences
  39. Merge Overlapping Intervals
  40. Longest Balanced Substring
  41. Longest Path in a Weighted Tree
  42. Generate Balanced Parentheses
  43. PostOrder Traversal Without Recursion

© 2022 – CSEstack.org. All Rights Reserved.

  • Home
  • Subscribe
  • Contribute Us
    • Share Your Interview Experience
  • Contact Us
  • About
    • About CSEstack
    • Campus Ambassador
  • Forum & Discus
  • Tools for Geek
  • LeaderBoard