Installation and Configuration
Programming Methodology
Video Tutorials

Checking Balanced Parentheses in a Sequence in C#

In this exercise, you need to implement a function that checks whether a sequence of parentheses is balanced. A sequence of parentheses is considered balanced if every opening parenthesis '(' has a matching closing parenthesis ')', and if they are properly nested in the correct order.

For example:

- The sequence "(()()(()))" is valid because all parentheses are correctly balanced and nested.
- The sequence "(((()" is incorrect because it lacks the closing parenthesis.

You will be given a string containing parentheses, and the function should determine whether the sequence is valid or not. This exercise is great for practicing the use of stacks or counters, which are essential data structures for validating and balancing symbols in strings.



Group

Dynamic Memory Management in C#

Objective

1. Implement a function that takes a string of parentheses as input.
2. Use a stack or a counter to check if the parentheses are balanced.
3. Return true if the parentheses are balanced and false if they are not.
4. Ensure that each opening parenthesis has a corresponding closing parenthesis and that they are properly nested.
5. Test your function with different sequences of parentheses to verify its correctness.

In this exercise, you need to implement a function to check if a sequence of open and closed parentheses is balanced.

Example C# Exercise

 Copy C# Code 
using System;
using System.Collections.Generic;

class BalancedParentheses
{
    // Function to check if the sequence of parentheses is balanced
    static bool IsBalanced(string sequence)
    {
        Stack stack = new Stack(); // Create a stack to hold opening parentheses

        // Loop through each character in the sequence
        foreach (char ch in sequence)
        {
            // If the character is an opening parenthesis, push it onto the stack
            if (ch == '(')
            {
                stack.Push(ch);
            }
            // If the character is a closing parenthesis
            else if (ch == ')')
            {
                // If the stack is empty, it means there's no matching opening parenthesis
                if (stack.Count == 0)
                {
                    return false; // Return false if the parentheses are not balanced
                }
                // Pop the top element from the stack as it matches the closing parenthesis
                stack.Pop();
            }
        }

        // If the stack is empty, all opening parentheses had matching closing parentheses
        return stack.Count == 0;
    }

    static void Main()
    {
        string sequence = "(()()(()))"; // Example valid sequence
        bool result = IsBalanced(sequence); // Check if the sequence is balanced

        // Display the result
        Console.WriteLine($"Sequence: {sequence}");
        Console.WriteLine($"Is the sequence balanced? {result}");

        sequence = "(((()"; // Example invalid sequence
        result = IsBalanced(sequence); // Check if the sequence is balanced

        // Display the result
        Console.WriteLine($"Sequence: {sequence}");
        Console.WriteLine($"Is the sequence balanced? {result}");
    }
}

 Output

Sequence: (()()(())))
Is the sequence balanced? True
Sequence: ((((
Is the sequence balanced? False

Share this C# Exercise

More C# Practice Exercises of Dynamic Memory Management in C#

Explore our set of C# Practice Exercises! Specifically designed for beginners, these exercises will help you develop a solid understanding of the basics of C#. From variables and data types to control structures and simple functions, each exercise is crafted to challenge you incrementally as you build confidence in coding in C#.

  • Merging and Sorting File Contents Alphabetically in C#

    In this exercise, you will create a program that reads the contents of two different text files, merges them into a single collection, and then sorts the collection alphabetically....

  • 3D Point Data Structure with ArrayList in C#

    In this exercise, you will create a structure called "Point3D" that represents a point in 3D space with three coordinates: X, Y, and Z. You will then create a program with a menu t...

  • Search for Sentences in a Text File in C#

    In this exercise, you will create a program that reads the content of a text file and saves it into an ArrayList. The program will then ask the user to enter a word or sentence and...

  • Implementing a Custom Queue in C#

    In this exercise, you need to implement a queue in C#. A queue is a data structure that follows the FIFO (First In, First Out) principle, meaning the first element to enter is the ...

  • Implementing a Custom Stack in C#

    In this exercise, you need to implement a stack in C#. A stack is a data structure that follows the LIFO (Last In, First Out) principle, meaning the last element to enter is the fi...

  • Using the Queue Class in C# to Manage a String Queue

    In this exercise, you need to create a string queue using the Queue class that already exists in the DotNet platform. The Queue class is an implementation of the queue data structu...