From c4a880c5814cac3136ea2cddbd01fdeeb25d8c92 Mon Sep 17 00:00:00 2001
From: Saurabh Soni <53487124+SSoni301@users.noreply.github.com>
Date: Wed, 13 May 2020 15:42:06 +0530
Subject: [PATCH] Add files via upload

---
 SingleNumber.cpp | 10 ++++++++++
 Staircase.cpp    | 10 ++++++++++
 grid.cpp         | 34 ++++++++++++++++++++++++++++++++++
 minXORvalue.cpp  | 17 +++++++++++++++++
 4 files changed, 71 insertions(+)
 create mode 100644 SingleNumber.cpp
 create mode 100644 Staircase.cpp
 create mode 100644 grid.cpp
 create mode 100644 minXORvalue.cpp

diff --git a/SingleNumber.cpp b/SingleNumber.cpp
new file mode 100644
index 0000000..735a229
--- /dev/null
+++ b/SingleNumber.cpp
@@ -0,0 +1,10 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+{
+vector<int> ar={1,2,3,1,4,2,3};
+int i=0,p=0;
+for(i;i<ar.size();i++)
+	p = p^ar[i];
+cout<<"The answer is "<<p<<endl;
+}
diff --git a/Staircase.cpp b/Staircase.cpp
new file mode 100644
index 0000000..00dd1ad
--- /dev/null
+++ b/Staircase.cpp
@@ -0,0 +1,10 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+{
+int n,x;
+cout<<"enter n:";
+cin>>n;
+x = (-1 + sqrt(1+4*n*2))/2;
+cout<<"Answer: "<<x<<endl;
+}
diff --git a/grid.cpp b/grid.cpp
new file mode 100644
index 0000000..9c8e6f8
--- /dev/null
+++ b/grid.cpp
@@ -0,0 +1,34 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+{
+int a;
+cout<<"enter A: ";
+cin>>a;
+vector<vector<int>> arr(a,vector<int>(a,0));
+int i,j;
+for(i=0;i<arr.size();i++)
+{
+	arr[i][0] = 1;
+}
+
+for(i=1;i<arr.size();i++)
+{
+	for(j=1;j<arr.size();j++)
+	{	if(i>=j)
+		{
+			if(i==j)
+			{
+				arr[i][j] = arr[i][j-1];
+			}	
+			else
+			{
+				arr[i][j] = arr[i-1][j] + arr[i][j-1];
+			}
+		}
+	}
+	
+}
+cout<<"output is : "<<arr[a-1][a-1]<<endl;
+return 0;
+}
diff --git a/minXORvalue.cpp b/minXORvalue.cpp
new file mode 100644
index 0000000..52664a7
--- /dev/null
+++ b/minXORvalue.cpp
@@ -0,0 +1,17 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main()
+{
+int i,p,n=5;
+vector<int> arr={1,5,2,4,7};
+int min = INT_MAX;
+sort(arr.begin(),arr.end());
+for(i=1;i<arr.size();i++)
+{	p = arr[i]^arr[i-1];
+	if (min > p)
+		min = p;
+
+}
+cout<<"Minimum XOR Value:"<<min<<endl;
+return 0;
+}