[s0ooo0k] WEEK6 Solutions

container-with-most-water/s0ooo0k.java

@@ -0,0 +1,21 @@
+class Solution {
+    public int maxArea(int[] height) {
+        int left=0;
+        int right=height.length-1;
+        int max=0;
+
+        while(left<right) {
+            int water = (right-left) * Math.min(height[left], height[right]);
+            max = Math.max(max, water);
+
+            if(height[left]<height[right]) {
+                left++;
+            } else {
+                right--;
+            }
+        }
+        return max;
+    }
+}
+
+

valid-parentheses/s0ooo0k.java

@@ -0,0 +1,26 @@
+class Solution {
+    public boolean isValid(String s) {
+        Deque<Character> stack = new ArrayDeque<>();
+
+        for(char c : s.toCharArray()) {
+            if(c == '(' || c=='{' || c=='[') {
+                stack.push(c);
+            }
+            if(c == ')') {
+                if(stack.isEmpty() || stack.peek() != '(') return false;
+                 stack.pop();
+            }
+            if(c == '}') {
+                if(stack.isEmpty() || stack.peek() != '{') return false;
+                stack.pop();
+            }
+            if(c == ']') {
+                if(stack.isEmpty() || stack.peek() != '[') return false;
+                stack.pop();    
+            }
+        }
+        return stack.isEmpty();
+    }
+}
+
+