leetcode june challenge

Author: surikunal

june_challenge/week_2/isSubsequence.cpp

@@ -5,7 +5,6 @@ class Solution
 public:
     bool isSubsequence(string s, string t)
     {
-
         int tpos = 0;
         for (int i = 0; s[i] != '\0'; ++i)
         {

june_challenge/week_2/segregate012.cpp

@@ -0,0 +1,34 @@
+#include <iostream>
+#include <vector>
+using namespace std;
+class Solution {
+public:
+    void sortColors(vector<int>& nums) {
+        int k1 = 0, k2 = nums.size() - 1;
+        int i = 0;
+        while(i != nums.size()) {
+            if(i > k2)
+                break;
+            if(nums[i] == 0) {
+                if(i == k1) {
+                    i++;
+                    k1++;
+                }
+                else {
+                    swap(nums[k1++], nums[i]);
+                }
+            }
+            else if(nums[i] == 2) {
+                if(i == k2) {
+                    i++;
+                    k2--;
+                }
+                else
+                    swap(nums[k2--], nums[i]);
+            }
+            else {
+                i++;
+            }
+        }
+    }
+};