Merge pull request #63 from gaurav-312/main

created solution of Q217

leetcode/217_contains_duplicate.cpp

@@ -0,0 +1,10 @@
+class Solution {
+public:
+    bool containsDuplicate(vector<int>& nums) {
+        sort(nums.begin(),nums.end());
+        for (int i=0;i<nums.size()-1;++i){
+            if (nums[i]==nums[i+1]) return true;
+        }
+        return false;
+    }
+};