From ee9e359044c2d00e2b24027c57d9ee2140f92a87 Mon Sep 17 00:00:00 2001
From: thimira nirmal <timnirmal@gmail.com>
Date: Wed, 20 Oct 2021 22:24:54 +0530
Subject: [PATCH 1/2] Anagram CPP

---
 String Algorithms/Anagram/Anagram.cpp | 29 +++++++++++++++++++++++++++
 1 file changed, 29 insertions(+)
 create mode 100644 String Algorithms/Anagram/Anagram.cpp

diff --git a/String Algorithms/Anagram/Anagram.cpp b/String Algorithms/Anagram/Anagram.cpp
new file mode 100644
index 0000000..94f500f
--- /dev/null
+++ b/String Algorithms/Anagram/Anagram.cpp	
@@ -0,0 +1,29 @@
+#include<iostream>
+#include <bits/stdc++.h>
+
+using namespace std;
+
+bool Anagram (string str1, string str2){
+    int n1 = str1.length();
+    int n2 = str2.length();
+
+    if (n1 != n2) return false;
+
+    sort(str1.begin(), str1.end());
+    sort(str2.begin(), str2.end());
+
+    for (int i = 0; i < n1; i++)
+        if (str1[i] != str2[i])
+            return false;
+    return true;
+}
+
+int main() {
+    string str1 = "listen";
+    string str2 = "silent";
+
+    // Note that each letter need to be in same case. Otherwise, use toUpper Function before adding to function.
+
+    cout << (Anagram(str1, str2) ? "Anagram" : "Not Anagram");
+
+}
\ No newline at end of file

From 6b2864fc4e817e28b20a6ecb5f306eb82ad64e9a Mon Sep 17 00:00:00 2001
From: thimira nirmal <timnirmal@gmail.com>
Date: Wed, 20 Oct 2021 23:37:50 +0530
Subject: [PATCH 2/2] Palindrome CPP & PY

---
 .../BalancedParanthesis.cpp                   | 55 +++++++++++++++++++
 1 file changed, 55 insertions(+)
 create mode 100644 String Algorithms/Balanced_Paranthesis/BalancedParanthesis.cpp

diff --git a/String Algorithms/Balanced_Paranthesis/BalancedParanthesis.cpp b/String Algorithms/Balanced_Paranthesis/BalancedParanthesis.cpp
new file mode 100644
index 0000000..9db65a6
--- /dev/null
+++ b/String Algorithms/Balanced_Paranthesis/BalancedParanthesis.cpp	
@@ -0,0 +1,55 @@
+#include <iostream>
+#include <bits/stdc++.h>
+using namespace std;
+
+bool BracketsBalanced(string expression)
+{
+    stack<char> stk;    // Stack for hold brackets
+    char x;
+
+    // Traversing Expression
+    for (char & i : expression) {
+        if (i == '(' || i == '[' || i == '{') {
+            stk.push(i);
+            continue;
+        }
+
+        // If current bracket isn't a opening bracket then stack cannot be zero.
+        if (stk.empty())
+            return false;
+
+        // Check
+        if (i == ')'){
+            x = stk.top();
+            stk.pop();
+            if (x == '{' || x == '[')
+                return false;
+        }
+        else if (i == '}') {
+            x = stk.top();
+            stk.pop();
+            if (x == '(' || x == '[')
+                return false;
+        } else if (i == ']'){
+            x = stk.top();
+            stk.pop();
+            if (x == '(' || x == '{')
+                return false;
+        }
+        else {
+            continue;
+        }
+    }
+
+    return (stk.empty());
+}
+
+// Driver code
+int main()
+{
+    string expression = "{()}[]";
+
+    cout << (BracketsBalanced(expression) ? "Balanced" : "Not Balanced");
+
+    return 0;
+}