From eba32b5cd3266f4e321f52d06f7533d46f827cb8 Mon Sep 17 00:00:00 2001
From: Shubham S Jagtap <63872951+ShubhamJagtap2000@users.noreply.github.com>
Date: Sun, 2 Oct 2022 01:17:50 +0530
Subject: [PATCH] Check whether brackets are balanced or not using stack
 implementation

---
 String/BalanceBrackets.cpp | 40 ++++++++++++++++++++++++++++++++++++++
 1 file changed, 40 insertions(+)
 create mode 100644 String/BalanceBrackets.cpp

diff --git a/String/BalanceBrackets.cpp b/String/BalanceBrackets.cpp
new file mode 100644
index 00000000..8d70b102
--- /dev/null
+++ b/String/BalanceBrackets.cpp
@@ -0,0 +1,40 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+// Function to check whether two characters are opening 
+// and closing of same type. 
+bool ArePair(char opening,char closing)
+{
+	if(opening == '(' && closing == ')') return true;
+	else if(opening == '{' && closing == '}') return true;
+	else if(opening == '[' && closing == ']') return true;
+	return false;
+}
+bool AreParanthesesBalanced(string exp)
+{
+	stack<char>  S;
+	for(int i =0;i<exp.length();i++)
+	{
+		if(exp[i] == '(' || exp[i] == '{' || exp[i] == '[')
+			S.push(exp[i]);
+		else if(exp[i] == ')' || exp[i] == '}' || exp[i] == ']')
+		{
+			if(S.empty() || !ArePair(S.top(),exp[i]))
+				return false;
+			else
+				S.pop();
+		}
+	}
+	return S.empty() ? true:false;
+}
+
+int main()
+{
+  string expression;
+	cout << "Enter an expression:  "; // input expression from STDIN/Console
+	cin >> expression;
+	if(AreParanthesesBalanced(expression))
+		cout << "Balanced\n";
+	else
+		cout << "Not Balanced\n";
+}