Completed Two-Pointers-1

containerwithmostwater.cpp

@@ -0,0 +1,22 @@
+class Solution {
+public:
+    int maxArea(vector<int>& height) {
+        int n = height.size();
+        int maximum = 0;
+        //declare a left pointer and a right pointer
+        int lpointer = 0;
+        int rpointer = n - 1;
+
+        while(lpointer < rpointer){//making sure left doesnt cross right
+            int currArea = min(height[lpointer], height[rpointer]) * (rpointer - lpointer);//min of height at left anf right multiplied by width gives us the area
+            maximum = max(maximum , currArea);//compare previous maximum and curr area and update
+            if(height[lpointer] < height[rpointer]){
+                lpointer ++;
+            }else{
+                rpointer--;
+            }
+        } 
+
+        return maximum;
+    }
+};

sortcolours.cpp

@@ -0,0 +1,28 @@
+class Solution {
+public:
+    void sortColors(vector<int>& nums) {
+        int n = nums.size();
+        int left = 0;
+        int mid = 0;
+        int right = n-1;
+        while(mid <= right){
+            if(nums[mid] == 2){
+                swap(nums,mid,right);
+                right--;
+            }else if(nums[mid] == 0){
+                swap(nums,mid,left);
+                left++;
+                mid++;
+            }else{
+                mid++;
+            }
+        }
+    }
+
+private:
+    void swap(vector<int>& nums, int mid, int idx) {
+    int temp = nums[idx];
+    nums[idx] = nums[mid];
+    nums[mid] = temp;
+}
+};