From c4e858aa9a25110825901fddf8edeaf0a0593c92 Mon Sep 17 00:00:00 2001
From: Prashant Aditya <77530131+Darkcoder-paditya@users.noreply.github.com>
Date: Tue, 19 Oct 2021 04:59:23 +0530
Subject: [PATCH] Created code to print balanced paranthesis.

A small step in hactoberfest.
Pls consider my PR.
---
 ...rint_balanced_paranthesis_by_recursion.cpp | 36 +++++++++++++++++++
 1 file changed, 36 insertions(+)
 create mode 100644 Recursion/Print_balanced_paranthesis_by_recursion.cpp

diff --git a/Recursion/Print_balanced_paranthesis_by_recursion.cpp b/Recursion/Print_balanced_paranthesis_by_recursion.cpp
new file mode 100644
index 0000000..b805f52
--- /dev/null
+++ b/Recursion/Print_balanced_paranthesis_by_recursion.cpp
@@ -0,0 +1,36 @@
+//proposed by dark_coder
+#include <bits/stdc++.h>
+using namespace std;
+void generateParenthesis(int n, int open, int close, string s, vector<string> &ans)
+{
+
+    if (open == n && close == n)
+    {
+        ans.push_back(s);
+        return;
+    }
+
+    if (open < n)
+    {
+        generateParenthesis(n, open + 1, close, s + "{", ans);
+    }
+
+    if (close < open)
+    {
+        generateParenthesis(n, open, close + 1, s + "}", ans);
+    }
+}
+int main()
+{
+    int n;
+    cout<<"Enter number of paranthesis you want to print combination of (eg '1' if '()')"<<endl;
+    cin>>n;
+    vector<string> ans;
+    generateParenthesis(n, 0, 0, "", ans);
+    cout<<endl;
+    for (auto s : ans)
+    {
+        cout << s << endl;
+    }
+    return 0;
+}