my first commit in hack

C++/All_tree_(In-Pre-Post order traversal) operation.cpp

@@ -0,0 +1,61 @@
+#include<bits/stdc++.h>
+using namespace std;
+struct node{
+	struct node *lc;
+	int data;
+	struct node *rc;
+};
+int a[]={ 3,5,9,6,8,20,10,0,0,9,0,0,0,0,0,0,0,0,0,0,0};
+struct node *buildtree(int n)
+{
+	struct node *temp = 0;
+	if(a[n] != 0){
+		temp = (struct node *)malloc(sizeof(struct node));
+		temp->lc = buildtree(2*n+1);
+		temp->data = a[n];
+		temp->rc = buildtree(2*n+2);
+	}
+	return temp;
+}
+
+void inorder(struct node *root){
+	if(root != NULL){
+		if(root != NULL){
+			inorder(root->lc);
+			cout << root->data << " ";
+			inorder(root->rc);
+		}
+	}
+}
+void postorder(struct node *root){
+	if(root != NULL){
+		if(root != NULL){
+			postorder(root->lc);
+			postorder(root->rc);
+			cout << root->data << " ";
+		}
+	}
+}
+void preorder(struct node *root){
+	if(root != NULL){
+		if(root != NULL){
+			cout << root->data << " ";
+			preorder(root->lc);
+			preorder(root->rc);
+		}
+	}
+}
+int main(){
+	struct node *root;
+	root = buildtree(0);
+	cout << "Inorder Traversal:\n";
+	inorder(root);
+	cout << "\n";
+	cout << "Postorder Traversal:\n";
+	postorder(root);
+	cout << "\n";
+	cout << "Preorder Traversal:\n";
+	preorder(root);
+	cout << "\n";
+	return 0;
+}

C++/Anagram_checker.cpp

@@ -0,0 +1,46 @@
+ #include <iostream>
+using namespace std;
+int main()
+{
+    //Initializing variables.
+    char str1[100],str2[100];
+    int first[26]={0}, second[26]={0}, c=0, flag=0;
+
+    //Accepting inputs.
+    cout<<"Enter First String: ";
+    gets(str1);
+    cout<<"Enter Second String: ";
+    gets(str2);
+
+    //Calculating frequencies of characters in first string.
+    while(str1[c] != '\0')
+    {
+        first[str1[c]-'a']++;
+        c++;
+    }
+
+    c=0;
+    //Calculating frequencies of characters in second string. 
+    while(str2[c] != '\0')
+    {
+        second[str2[c]-'a']++;
+        c++;
+    }
+    //Checking if frequencies of both the strings are same or not.
+    for(c=0;c<26;c++)
+    {
+        if(first[c] != second[c])
+            flag=1;
+    }
+    //Priting result.
+    if(flag == 0)
+    {
+        cout<<"Strings are anagram.";
+    }
+    else
+    {
+        cout<<"Strings are not anagram.";
+    }
+    return 0;
+
+}

C++/Array subset of anathor array.cpp

@@ -0,0 +1,45 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int findSubset (int arr1[] ,int arr2[] , int n , int  m) {
+    for (int i=0;i<m;i++) {
+	           int y = arr2[i];
+	           int x = count(arr1 , arr1 + n , y);
+	           if (x == 0) {
+	               return 0;
+	           }
+    }
+    return 1;
+}
+
+
+
+int main()
+ {
+
+	int t;
+	cin >> t;
+	while (t--) {
+	    int n , m;
+	    cin >> n >> m;
+	    int arr1[n] , arr2[m];
+
+
+	    for (int i=0;i<n;i++) { 
+	        cin >> arr1[i];
+	    }
+	    for (int i=0;i<m;i++) { 
+	        cin >> arr2[i];
+	    }
+
+
+	    int returnValue = findSubset (arr1 ,arr2 ,n ,m);
+	    if (returnValue == 1) {
+	        cout << "Yes";
+	    }else {
+	        cout << "No";
+	    }
+	    cout << "\n";
+	}
+	return 0;
+}

C++/Array(DS)- Hackerrank

@@ -0,0 +1,82 @@
+#include <bits/stdc++.h>
+#include<algorithm>
+using namespace std;
+
+vector<string> split_string(string);
+
+// Complete the reverseArray function below.
+vector<int> reverseArray(vector<int> a) {
+
+reverse(a.begin(),a.end());
+vector<int>::iterator it;
+    for (it = a.begin(); it != a.end(); it++) 
+        cout << (*it) << " ";
+        return a;
+}
+
+int main()
+{
+    ofstream fout(getenv("OUTPUT_PATH"));
+
+    int arr_count;
+    cin >> arr_count;
+    cin.ignore(numeric_limits<streamsize>::max(), '\n');
+
+    string arr_temp_temp;
+    getline(cin, arr_temp_temp);
+
+    vector<string> arr_temp = split_string(arr_temp_temp);
+
+    vector<int> arr(arr_count);
+
+    for (int i = 0; i < arr_count; i++) {
+        int arr_item = stoi(arr_temp[i]);
+
+        arr[i] = arr_item;
+    }
+
+    vector<int> res = reverseArray(arr);
+
+    for (int i = 0; i < res.size(); i++) {
+        fout << res[i];
+
+        if (i != res.size() - 1) {
+            fout << " ";
+        }
+    }
+
+    fout << "\n";
+
+    fout.close();
+
+    return 0;
+}
+
+vector<string> split_string(string input_string) {
+    string::iterator new_end = unique(input_string.begin(), input_string.end(), [] (const char &x, const char &y) {
+        return x == y and x == ' ';
+    });
+
+    input_string.erase(new_end, input_string.end());
+
+    while (input_string[input_string.length() - 1] == ' ') {
+        input_string.pop_back();
+    }
+
+    vector<string> splits;
+    char delimiter = ' ';
+
+    size_t i = 0;
+    size_t pos = input_string.find(delimiter);
+
+    while (pos != string::npos) {
+        splits.push_back(input_string.substr(i, pos - i));
+
+        i = pos + 1;
+        pos = input_string.find(delimiter, i);
+    }
+
+    splits.push_back(input_string.substr(i, min(pos, input_string.length()) - i + 1));
+
+    return splits;
+}