Check if expression contains extra brackets or not

Here given code implementation process.

import java.util.Stack;
/*
    Java program for
    Check if expression contains extra brackets or not
*/
public class Expression
{
	public void isExtraBracket(String exp)
	{
		// Get the length of given expression 
		int n = exp.length();
		// Create an empty record 
		Stack < Character > record = new Stack < Character > ();
		// Result indicator
		boolean result = false;
		boolean check = true;
		// Iterate through the given expression  
		for (int i = 0; i < n; ++i)
		{
			if (exp.charAt(i) == ')')
			{
				if (record.isEmpty())
				{
					// Invalid expression
					return;
				}
				char top = record.peek();
				record.pop();
				check = true;
				while (top != '(')
				{
					if (top == '+' || top == '-' || top == '*' || top == '/')
					{
						check = false;
					}
					top = record.peek();
					record.pop();
				}
				if (check == true)
				{
					// When operator not exist inside brackets
					result = true;
				}
			}
			else
			{
				record.push(exp.charAt(i));
			}
		}
		// Display given expression
		System.out.print("\n Expression : " + exp);
		if (result == true)
		{
			System.out.print("\n Extra brackets exists");
		}
		else
		{
			System.out.print("\n Extra brackets not exists");
		}
	}
	public static void main(String[] args)
	{
		Expression task = new Expression();
		String exp = "";
		// Test
		task.isExtraBracket("(a+b-(c + ((a+b))))");
		task.isExtraBracket("((a+b) -(b-(c*d)))");
		task.isExtraBracket("((a+b) + (c+a))");
		task.isExtraBracket("(a+b) + ((c))");
	}
}

Output

 Expression : (a+b-(c + ((a+b))))
 Extra brackets exists
 Expression : ((a+b) -(b-(c*d)))
 Extra brackets not exists
 Expression : ((a+b) + (c+a))
 Extra brackets not exists
 Expression : (a+b) + ((c))
 Extra brackets exists

// Include header file
#include <iostream>
#include <stack>
#include <string>

using namespace std;
/*
    C++ program for
    Check if expression contains extra brackets or not
*/
class Expression
{
	public: void isExtraBracket(string exp)
	{
		// Get the length of given expression 
		int n = exp.length();
		// Create an empty record 
		stack < char > record;
		// Result indicator
		bool result = false;
		bool check = true;
		// Iterate through the given expression  
		for (int i = 0; i < n; ++i)
		{
			if (exp[i] == ')')
			{
				if (record.empty())
				{
					// Invalid expression
					return;
				}
				char top = record.top();
				record.pop();
				check = true;
				while (top != '(')
				{
					if (top == '+' || top == '-' || 
                        top == '*' || top == '/')
					{
						check = false;
					}
					top = record.top();
					record.pop();
				}
				if (check == true)
				{
					// When operator not exist inside brackets
					result = true;
				}
			}
			else
			{
				record.push(exp[i]);
			}
		}
		// Display given expression
		cout << "\n Expression : " << exp;
		if (result == true)
		{
			cout << "\n Extra brackets exists";
		}
		else
		{
			cout << "\n Extra brackets not exists";
		}
	}
};
int main()
{
	Expression *task = new Expression();
	string exp = "";
	// Test
	task->isExtraBracket("(a+b-(c + ((a+b))))");
	task->isExtraBracket("((a+b) -(b-(c*d)))");
	task->isExtraBracket("((a+b) + (c+a))");
	task->isExtraBracket("(a+b) + ((c))");
	return 0;
}

Output

 Expression : (a+b-(c + ((a+b))))
 Extra brackets exists
 Expression : ((a+b) -(b-(c*d)))
 Extra brackets not exists
 Expression : ((a+b) + (c+a))
 Extra brackets not exists
 Expression : (a+b) + ((c))
 Extra brackets exists

// Include namespace system
using System;
using System.Collections.Generic;
/*
    Csharp program for
    Check if expression contains extra brackets or not
*/
public class Expression
{
	public void isExtraBracket(String exp)
	{
		// Get the length of given expression 
		int n = exp.Length;
		// Create an empty record 
		Stack < char > record = new Stack < char > ();
		// Result indicator
		Boolean result = false;
		Boolean check = true;
		// Iterate through the given expression  
		for (int i = 0; i < n; ++i)
		{
			if (exp[i] == ')')
			{
				if ((record.Count == 0))
				{
					// Invalid expression
					return;
				}
				char top = record.Peek();
				record.Pop();
				check = true;
				while (top != '(')
				{
					if (top == '+' || top == '-' || top == '*' || top == '/')
					{
						check = false;
					}
					top = record.Peek();
					record.Pop();
				}
				if (check == true)
				{
					// When operator not exist inside brackets
					result = true;
				}
			}
			else
			{
				record.Push(exp[i]);
			}
		}
		// Display given expression
		Console.Write("\n Expression : " + exp);
		if (result == true)
		{
			Console.Write("\n Extra brackets exists");
		}
		else
		{
			Console.Write("\n Extra brackets not exists");
		}
	}
	public static void Main(String[] args)
	{
		Expression task = new Expression();
		// Test
		task.isExtraBracket("(a+b-(c + ((a+b))))");
		task.isExtraBracket("((a+b) -(b-(c*d)))");
		task.isExtraBracket("((a+b) + (c+a))");
		task.isExtraBracket("(a+b) + ((c))");
	}
}

Output

 Expression : (a+b-(c + ((a+b))))
 Extra brackets exists
 Expression : ((a+b) -(b-(c*d)))
 Extra brackets not exists
 Expression : ((a+b) + (c+a))
 Extra brackets not exists
 Expression : (a+b) + ((c))
 Extra brackets exists

package main
import "fmt"
/*
    Go program for
    Check if expression contains extra brackets or not
*/

func isExtraBracket(exp string) {
	// Get the length of given expression 
	var n int = len(exp)
	// Create an empty record 
	var record = make([] byte, 0)
	// Result indicator
	var result bool = false
	var check bool = true
	// Iterate through the given expression  
	for i := 0 ; i < n ; i++ {
		if exp[i] == ')' {
			if len(record) == 0 {
				// Invalid expression
				return
			}
			var top byte = record[len(record) - 1]
			record = record[: len(record) - 1]
			check = true
			for (top != '(') {
				if top == '+' || top == '-' || 
				   top == '*' || top == '/' {
					check = false
				}
				top = record[len(record) - 1]
				record = record[: len(record) - 1]
			}
			if check == true {
				// When operator not exist inside brackets
				result = true
			}
		} else {
			record = append(record, exp[i])
		}
	}
	// Display given expression
	fmt.Print("\n Expression : ", exp)
	if result == true {
		fmt.Print("\n Extra brackets exists")
	} else {
		fmt.Print("\n Extra brackets not exists")
	}
}
func main() {

	// Test
	isExtraBracket("(a+b-(c + ((a+b))))")
	isExtraBracket("((a+b) -(b-(c*d)))")
	isExtraBracket("((a+b) + (c+a))")
	isExtraBracket("(a+b) + ((c))")
}

Output

 Expression : (a+b-(c + ((a+b))))
 Extra brackets exists
 Expression : ((a+b) -(b-(c*d)))
 Extra brackets not exists
 Expression : ((a+b) + (c+a))
 Extra brackets not exists
 Expression : (a+b) + ((c))
 Extra brackets exists

<?php
/*
    Php program for
    Check if expression contains extra brackets or not
*/
class Expression
{
	public	function isExtraBracket($exp)
	{
		// Get the length of given expression 
		$n = strlen($exp);
		// Create an empty record 
		$record = array();
		// Result indicator
		$result = false;
		$check = true;
		// Iterate through the given expression  
		for ($i = 0; $i < $n; ++$i)
		{
			if ($exp[$i] == ')')
			{
				if (empty($record))
				{
					// Invalid expression
					return;
				}
				$top = end($record);
				array_pop($record);
				$check = true;
				while ($top != '(')
				{
					if ($top == '+' || $top == '-' || 
                        $top == '*' || $top == '/')
					{
						$check = false;
					}
					$top = end($record);
					array_pop($record);
				}
				if ($check == true)
				{
					// When operator not exist inside brackets
					$result = true;
				}
			}
			else
			{
				array_push($record, $exp[$i]);
			}
		}
		// Display given expression
		echo("\n Expression : ".$exp);
		if ($result == true)
		{
			echo("\n Extra brackets exists");
		}
		else
		{
			echo("\n Extra brackets not exists");
		}
	}
}

function main()
{
	$task = new Expression();
	// Test
	$task->isExtraBracket("(a+b-(c + ((a+b))))");
	$task->isExtraBracket("((a+b) -(b-(c*d)))");
	$task->isExtraBracket("((a+b) + (c+a))");
	$task->isExtraBracket("(a+b) + ((c))");
}
main();

Output

 Expression : (a+b-(c + ((a+b))))
 Extra brackets exists
 Expression : ((a+b) -(b-(c*d)))
 Extra brackets not exists
 Expression : ((a+b) + (c+a))
 Extra brackets not exists
 Expression : (a+b) + ((c))
 Extra brackets exists

/*
    Node JS program for
    Check if expression contains extra brackets or not
*/
class Expression
{
	isExtraBracket(exp)
	{
		// Get the length of given expression 
		var n = exp.length;
		// Create an empty record 
		var record = [];
		// Result indicator
		var result = false;
		var check = true;
		// Iterate through the given expression  
		for (var i = 0; i < n; ++i)
		{
			if (exp.charAt(i) == ')')
			{
				if ((record.length == 0))
				{
					// Invalid expression
					return;
				}
				var top = record[record.length - 1];
				record.pop();
				check = true;
				while (top != '(')
				{
					if (top == '+' || top == '-' || 
                        top == '*' || top == '/')
					{
						check = false;
					}
					top = record[record.length - 1];
					record.pop();
				}
				if (check == true)
				{
					// When operator not exist inside brackets
					result = true;
				}
			}
			else
			{
				record.push(exp.charAt(i));
			}
		}
		// Display given expression
		process.stdout.write("\n Expression : " + exp);
		if (result == true)
		{
			process.stdout.write("\n Extra brackets exists");
		}
		else
		{
			process.stdout.write("\n Extra brackets not exists");
		}
	}
}

function main()
{
	var task = new Expression();
	// Test
	task.isExtraBracket("(a+b-(c + ((a+b))))");
	task.isExtraBracket("((a+b) -(b-(c*d)))");
	task.isExtraBracket("((a+b) + (c+a))");
	task.isExtraBracket("(a+b) + ((c))");
}
main();

Output

 Expression : (a+b-(c + ((a+b))))
 Extra brackets exists
 Expression : ((a+b) -(b-(c*d)))
 Extra brackets not exists
 Expression : ((a+b) + (c+a))
 Extra brackets not exists
 Expression : (a+b) + ((c))
 Extra brackets exists

#    Python 3 program for
#    Check if expression contains extra brackets or not
class Expression :
	def isExtraBracket(self, exp) :
		#  Get the length of given expression 
		n = len(exp)
		#  Create an empty record 
		record = []
		#  Result indicator
		result = False
		check = True
		i = 0
		#  Iterate through the given expression  
		while (i < n) :
			if (exp[i] == ')') :
				if ((len(record) == 0)) :
					#  Invalid expression
					return
				
				top = record[-1]
				record.pop()
				check = True
				while (top != '(') :
					if (top == '+'
						or top == '-'
						or top == '*'
						or top == '/') :
						check = False
					
					top = record[-1]
					record.pop()
				
				if (check == True) :
					#  When operator not exist inside brackets
					result = True
				
			else :
				record.append(exp[i])
			
			i += 1
		
		#  Display given expression
		print("\n Expression : ", exp, end = "")
		if (result == True) :
			print("\n Extra brackets exists", end = "")
		else :
			print("\n Extra brackets not exists", end = "")
		
	

def main() :
	task = Expression()
	#  Test
	task.isExtraBracket("(a+b-(c + ((a+b))))")
	task.isExtraBracket("((a+b) -(b-(c*d)))")
	task.isExtraBracket("((a+b) + (c+a))")
	task.isExtraBracket("(a+b) + ((c))")

if __name__ == "__main__": main()

Output

 Expression :  (a+b-(c + ((a+b))))
 Extra brackets exists
 Expression :  ((a+b) -(b-(c*d)))
 Extra brackets not exists
 Expression :  ((a+b) + (c+a))
 Extra brackets not exists
 Expression :  (a+b) + ((c))
 Extra brackets exists

#    Ruby program for
#    Check if expression contains extra brackets or not
class Expression 
	def isExtraBracket(exp) 
		#  Get the length of given expression 
		n = exp.length
		#  Create an empty record 
		record = []
		#  Result indicator
		result = false
		check = true
		i = 0
		#  Iterate through the given expression  
		while (i < n) 
			if (exp[i] == ')') 
				if ((record.length == 0)) 
					#  Invalid expression
					return
				end

				top = record.last
				record.pop()
				check = true
				while (top != '(') 
					if (top == '+' || top == '-' || 
                        top == '*' || top == '/') 
						check = false
					end

					top = record.last
					record.pop()
				end

				if (check == true) 
					#  When operator not exist inside brackets
					result = true
				end

			else
 
				record.push(exp[i])
			end

			i += 1
		end

		#  Display given expression
		print("\n Expression : ", exp)
		if (result == true) 
			print("\n Extra brackets exists")
		else
 
			print("\n Extra brackets not exists")
		end

	end

end

def main() 
	task = Expression.new()
	#  Test
	task.isExtraBracket("(a+b-(c + ((a+b))))")
	task.isExtraBracket("((a+b) -(b-(c*d)))")
	task.isExtraBracket("((a+b) + (c+a))")
	task.isExtraBracket("(a+b) + ((c))")
end

main()

Output

 Expression : (a+b-(c + ((a+b))))
 Extra brackets exists
 Expression : ((a+b) -(b-(c*d)))
 Extra brackets not exists
 Expression : ((a+b) + (c+a))
 Extra brackets not exists
 Expression : (a+b) + ((c))
 Extra brackets exists

import scala.collection.mutable._;
/*
    Scala program for
    Check if expression contains extra brackets or not
*/
class Expression()
{
	def isExtraBracket(exp: String): Unit = {
		// Get the length of given expression 
		var n: Int = exp.length();
		// Create an empty record 
		var record: Stack[Character] = new Stack[Character]();
		// Result indicator
		var result: Boolean = false;
		var check: Boolean = true;
		var i: Int = 0;
		// Iterate through the given expression  
		while (i < n)
		{
			if (exp.charAt(i) == ')')
			{
				if (record.isEmpty)
				{
					// Invalid expression
					return;
				}
				var top: Char = record.top;
				record.pop;
				check = true;
				while (top != '(')
				{
					if (top == '+' || top == '-' || 
                        top == '*' || top == '/')
					{
						check = false;
					}
					top = record.top;
					record.pop;
				}
				if (check == true)
				{
					// When operator not exist inside brackets
					result = true;
				}
			}
			else
			{
				record.push(exp.charAt(i));
			}
			i += 1;
		}
		// Display given expression
		print("\n Expression : " + exp);
		if (result == true)
		{
			print("\n Extra brackets exists");
		}
		else
		{
			print("\n Extra brackets not exists");
		}
	}
}
object Main
{
	def main(args: Array[String]): Unit = {
		var task: Expression = new Expression();
		// Test
		task.isExtraBracket("(a+b-(c + ((a+b))))");
		task.isExtraBracket("((a+b) -(b-(c*d)))");
		task.isExtraBracket("((a+b) + (c+a))");
		task.isExtraBracket("(a+b) + ((c))");
	}
}

Output

 Expression : (a+b-(c + ((a+b))))
 Extra brackets exists
 Expression : ((a+b) -(b-(c*d)))
 Extra brackets not exists
 Expression : ((a+b) + (c+a))
 Extra brackets not exists
 Expression : (a+b) + ((c))
 Extra brackets exists

import Foundation;
/*
    Swift 4 program for
    Check if expression contains extra brackets or not
*/
struct Stack
{
	private
	var items: [Character] = []
	func peek()->Character
	{
		if (self.isEmpty()==false)
		{
			return items.first!
		}
		else
		{
			fatalError("This stack is empty.")
		}
	}
	func isEmpty()->Bool
	{
		return items.count == 0
	}
	mutating func pop()
	{
		items.removeFirst()
	}
	mutating func push(_ data: Character)
	{
		items.insert(data, at: 0)
	}
}
class Expression
{
	func isExtraBracket(_ e: String)
	{
      	let exp = Array(e);
		// Get the length of given expression 
		let n: Int = exp.count;
		// Create an empty record 
		var record = Stack();
		// Result indicator
		var result: Bool = false;
		var check: Bool = true;
		var i: Int = 0;
		// Iterate through the given expression  
		while (i < n)
		{
			if (exp[i] == ")")
			{
				if (record.isEmpty())
				{
					// Invalid expression
					return;
				}
				var top: Character = record.peek();
				record.pop();
				check = true;
				while (top  != "(")
				{
					if (top == "+" || top == "-" || 
                        top == "*" || top == "/")
					{
						check = false;
					}
					top = record.peek();
					record.pop();
				}
				if (check == true)
				{
					// When operator not exist inside brackets
					result = true;
				}
			}
			else
			{
				record.push(exp[i]);
			}
			i += 1;
		}
		// Display given expression
		print("\n Expression : ", e, terminator: "");
		if (result == true)
		{
			print("\n Extra brackets exists", terminator: "");
		}
		else
		{
			print("\n Extra brackets not exists", terminator: "");
		}
	}
}
func main()
{
	let task: Expression = Expression();
	// Test
	task.isExtraBracket("(a+b-(c + ((a+b))))");
	task.isExtraBracket("((a+b) -(b-(c*d)))");
	task.isExtraBracket("((a+b) + (c+a))");
	task.isExtraBracket("(a+b) + ((c))");
}
main();

Output

 Expression :  (a+b-(c + ((a+b))))
 Extra brackets exists
 Expression :  ((a+b) -(b-(c*d)))
 Extra brackets not exists
 Expression :  ((a+b) + (c+a))
 Extra brackets not exists
 Expression :  (a+b) + ((c))
 Extra brackets exists

import java.util.Stack;
/*
    Kotlin program for
    Check if expression contains extra brackets or not
*/
class Expression
{
	fun isExtraBracket(exp: String): Unit
	{
		// Get the length of given expression 
		val n: Int = exp.length;
		// Create an empty record 
		val record: Stack < Char > = Stack < Char > ();
		// Result indicator
		var result: Boolean = false;
		var check: Boolean ;
		var i: Int = 0;
		// Iterate through the given expression  
		while (i < n)
		{
			if (exp.get(i) == ')')
			{
				if (record.empty())
				{
					// Invalid expression
					return;
				}
				var top: Char = record.peek();
				record.pop();
				check = true;
				while (top != '(')
				{
					if (top == '+' || top == '-' || 
                        top == '*' || top == '/')
					{
						check = false;
					}
					top = record.peek();
					record.pop();
				}
				if (check == true)
				{
					// When operator not exist inside brackets
					result = true;
				}
			}
			else
			{
				record.push(exp.get(i));
			}
			i += 1;
		}
		// Display given expression
		print("\n Expression : " + exp);
		if (result == true)
		{
			print("\n Extra brackets exists");
		}
		else
		{
			print("\n Extra brackets not exists");
		}
	}
}
fun main(args: Array < String > ): Unit
{
	val task: Expression = Expression();
	// Test
	task.isExtraBracket("(a+b-(c + ((a+b))))");
	task.isExtraBracket("((a+b) -(b-(c*d)))");
	task.isExtraBracket("((a+b) + (c+a))");
	task.isExtraBracket("(a+b) + ((c))");
}

Output

 Expression : (a+b-(c + ((a+b))))
 Extra brackets exists
 Expression : ((a+b) -(b-(c*d)))
 Extra brackets not exists
 Expression : ((a+b) + (c+a))
 Extra brackets not exists
 Expression : (a+b) + ((c))
 Extra brackets exists

« Previous Next »

Stack

Implementation stack using linked list

Infix to prefix conversion

Infix to postfix conversion

Prefix to infix conversion

Prefix to Postfix Conversion

Postfix to prefix conversion

Postfix To Infix Conversion

Evaluate postfix expression

Iterative postorder traversal

Reverse a linked list using stack

Reverse a string using stack

Print stack elements from Bottom to Top

Implement tower of hanoi using stack

Sort array using stack

Sort a stack using temporary two stack

Implement stack using array

Insert the element at the bottom side of stack

Delete middle element of a stack

Reverse each word in a string

Bubble sort using two stack

Reverse a number using stack

Reverse a queue using stack

Check balanced parentheses using Stack

Check if stack elements are pairwise consecutive

Print all internal nodes of a binary tree using stack

Print all paths from root node to leaf

Print all paths from leaf node to root

Print all Leaf nodes of a binary tree from left to right

Find the next greater element on right side

Generating all possible subsequences

Find longest length subsequence of given sum

Convert Ternary Expression to a Binary Tree Using Stack

Check if leaf traversal of two Binary Trees is same or not

Find all subsequences with given sum

Tracking present maximum element in a stack

Tracking present minimum element in a stack

Sort stack using another stack

Reverse stack using another stack

Delete all even elements from a stack

Remove all particular element from a stack

Stock Span Problem

Construct BST from given preorder traversal using stack

Check if two stacks are equal

Add two numbers represented by stack

Check if stack contains given array element present or not

Remove all duplicate adjacent characters from a string using stack

Check valid parentheses using stack

Length of the longest balanced parentheses in a string

Quicksort using stack

Remove the redundant parentheses from valid expression

Check redundant parentheses in an expression

Find minimum number from a ID sequence

Remove all adjacent duplicates in string using stack

Find leftmost smaller number in an array

Score of parentheses using stack

Check if expression contains extra brackets or not

Count of binary strings that does not contain Arc intersection

Find all distinct subsets of given sum

Find the nearest smaller numbers on left side in an array using stack

Comment

Please share your knowledge to improve code and content standard. Also submit your doubts, and test case. We improve by your feedback. We will try to resolve your query as soon as possible.

New Comment

Name