diff --git a/jayamleetcodeproblem.cpp b/jayamleetcodeproblem.cpp
new file mode 100644
index 0000000..d8d0a46
--- /dev/null
+++ b/jayamleetcodeproblem.cpp
@@ -0,0 +1,41 @@
+// Given a non-empty array of integers nums, every element appears twice except for one. Find that single one.
+
+// You must implement a solution with a linear runtime complexity and use only constant extra space.
+
+ 
+
+// Example 1:
+
+// Input: nums = [2,2,1]
+// Output: 1
+// Example 2:
+
+// Input: nums = [4,1,2,1,2]
+// Output: 4
+// Example 3:
+
+// Input: nums = [1]
+// Output: 1
+ 
+
+// Constraints:
+
+// 1 <= nums.length <= 3 * 104
+// -3 * 104 <= nums[i] <= 3 * 104
+// Each element in the array appears twice except for one element which appears only once.
+class Solution {
+public:
+    int singleNumber(vector<int>& nums) {
+        sort(nums.begin(), nums.end());
+        for(int i=0; i<nums.size()-1; i++)
+        {
+           if(nums[i]!=nums[i+1])
+           {
+               return nums[i];
+           }
+              i++;
+        }
+     return nums.back();   
+    }
+
+};                                        
\ No newline at end of file