diff --git a/MaximumSubarray.cpp b/MaximumSubarray.cpp
new file mode 100644
index 00000000..af9f6301
--- /dev/null
+++ b/MaximumSubarray.cpp
@@ -0,0 +1,14 @@
+class Solution {
+public:
+    int maxSubArray(vector<int>& nums) {
+        int max_so_far=nums[0];
+        int curr_sum=nums[0];
+        for(int i=1;i<nums.size();i++){
+            curr_sum=max(nums[i],curr_sum+nums[i]);
+            if(curr_sum>max_so_far){
+                max_so_far=curr_sum;
+            }
+        }
+        return max_so_far;
+    }
+};
diff --git a/SortColors.cpp b/SortColors.cpp
new file mode 100644
index 00000000..51acc090
--- /dev/null
+++ b/SortColors.cpp
@@ -0,0 +1,24 @@
+class Solution {
+public:
+    void sortColors(vector<int>& nums) {
+        int low=0;
+        int high=nums.size()-1;
+        int mid=0;
+        
+        while(mid<=high){
+            switch(nums[mid]){
+                case 0:
+                    swap(nums[low++],nums[mid++]);
+                    break;
+                
+                case 1:
+                    mid++;
+                    break;
+                case 2:
+                    swap(nums[mid],nums[high--]);
+                    break;
+            }
+        }
+        
+    }
+};
diff --git a/sumofuniqueElements.cpp b/sumofuniqueElements.cpp
new file mode 100644
index 00000000..031f5cef
--- /dev/null
+++ b/sumofuniqueElements.cpp
@@ -0,0 +1,15 @@
+class Solution {
+public:
+    int sumOfUnique(vector<int>& nums) {
+        int n=nums.size();
+        int count[101]={0},sum=0;
+        for(int i=0;i<n;i++){
+            count[nums[i]]++;
+        }
+        for(int i=0;i<n;i++){
+            if(count[nums[i]]==1)
+                sum+=nums[i];
+        }
+        return sum;
+    }
+};