11.Container with most water.cpp Leetcode solution file added (fishercoder1534#114)

* 11.Container with most water.cpp solution file added

* _322.cpp added (Coin change DP solution)

Co-authored-by: anushkaGurjar1999 <anushkauj@gmail.com>

Author: anushkaGurjar99

cpp/_11.cpp

@@ -0,0 +1,26 @@
+// container-with-most-water
+// Problem Statement: https://leetcode.com/problems/container-with-most-water
+
+#include<bits/stdc++.h>
+using namespace std;
+
+class Solution {
+public:
+    int maxArea(vector<int>& height) {
+        if(height.size() < 1)
+            return 0;
+        
+        int left = 0;
+        int right = height.size() - 1;
+        int result = 0;
+        
+        while(left < right){
+            int area = (height[left] < height[right]) ? (height[left] * (right - left)) : (height[right] * (right -left));          
+            result = (area > result) ? area : result;
+            (height[left] < height[right]) ? left++ : right--;
+        }
+        
+        return result;
+    }
+};
+

cpp/_322.cpp

@@ -0,0 +1,20 @@
+// coin-change
+// Problem Statement: https://leetcode.com/problems/coin-change/
+
+class Solution{
+public:
+    int coinChange(vector<int>& coins, int amount){
+        
+        int MAX = amount + 1;
+        vector<int> cache(amount + 1, MAX);
+        
+        cache[0] = 0;
+        for(auto coin : coins){
+            for(int i = coin; i <= amount; i++)
+                cache[i] = std::min(cache[i], cache[i - coin] + 1);
+        }
+        
+        return cache[amount] == MAX ? -1 : cache[amount];
+    }
+};
+