add new codes

msdeep14 · msdeep14 · commit 96ea01facf60 · 2018-01-02T01:30:43.000+05:30
diff --git a/a.out b/a.out
diff --git a/check-for-balanced-parentheses-in-an-expression.cpp b/check-for-balanced-parentheses-in-an-expression.cpp
@@ -0,0 +1,36 @@
+// https://www.geeksforgeeks.org/check-for-balanced-parentheses-in-an-expression/
+#include <bits/stdc++.h>
+using namespace std;
+
+int check(string inp){
+	stack<char> st;
+	for(int i=0;i<inp.length();i++){
+		if(inp[i] == '(' || inp[i] == '[' || inp[i] == '{'){
+			st.push(inp[i]);
+		}else{
+			if(inp[i] == ')' && st.top() == '('){
+				st.pop();
+			}else if(inp[i] == ']' && st.top() == '['){
+				st.pop();
+			}else if(inp[i] == '}' && st.top() == '{'){
+				st.pop();
+			}else{
+				return 0;
+			}
+		}
+	}
+	if(st.empty()){
+		return 1;
+	}
+	return 0;
+}
+
+int main(){
+	string s;
+	cin>>s;
+	if(check(s))
+		cout << "balanced\n";
+	else
+		cout << "not balanced\n";
+	return 0;
+}
diff --git a/find-sub-array-sum-closest-0.cpp b/find-sub-array-sum-closest-0.cpp
@@ -0,0 +1,20 @@
+// https://www.geeksforgeeks.org/find-sub-array-sum-closest-0/
+#include <bits/stdc++.h>
+using  namespace std;
+
+pair<int, int> sumClosest(int arr[], int n){
+	vector<pair<int, int> > v;
+	v.push_back(make_pair(0,-1));
+	for(int i=1;i<=n;i++){
+		v.push_back(make_pair((v[i-1].first+arr[i-1]), i-1));
+	}
+	
+}
+
+int main(){
+	int arr[] = {-1,3,2,-5,4};
+	int n = sizeof(arr)/sizeof(arr[0]);
+	pair<int , int> p = sumClosest(arr,n);
+	cout << p.first << " " << p.second << endl;
+	return 0;
+}
diff --git a/insertion-sort.cpp b/insertion-sort.cpp
@@ -0,0 +1,27 @@
+// insertion sort
+#include <bits/stdc++.h>
+using namespace std;
+
+void insertionSort(int arr[], int n){
+	int i, j,current;
+	for(i=1;i<n;i++){
+		current = arr[i];
+		for(j=i-1;j>=0;j--){
+			if(arr[j]>current){
+				arr[j+1] = arr[j];
+			}else
+				break;
+		}
+		arr[j+1] = current;
+	}
+}
+
+int main(){
+	int arr[] = {5,1,3,7,10,9};
+	int n = sizeof(arr)/sizeof(arr[0]);
+	insertionSort(arr,n);
+	for(int i=0;i<n;i++)
+		cout << arr[i] << " ";
+	cout << endl;
+	return 0;
+}
