Added 2 solutions

varunu28 · varunu28 · commit 5622751312f0 · 2020-08-30T09:33:24.000-05:00
diff --git a/Easy/Detect Pattern of Length M Repeated K or More Times.java b/Easy/Detect Pattern of Length M Repeated K or More Times.java
@@ -0,0 +1,27 @@
+class Solution {
+  public boolean containsPattern(int[] arr, int m, int k) {
+    Queue<Integer> queue = new LinkedList<>();
+    int count = 0;
+    int freq = 1;
+    for (int i = 0; i < arr.length; i++) {
+      if (i >= m) {
+        if (arr[i] == queue.poll()) {
+          count++;
+          if (count == m) {
+            freq++;
+            count = 0;
+          }
+          if (freq == k) {
+            return true;
+          }
+        }
+        else {
+          count = 0;
+          freq = 1;
+        }
+      }
+      queue.add(arr[i]);
+    }
+    return false;
+  }
+}
diff --git a/Medium/Maximum Length of Subarray With Positive Product.java b/Medium/Maximum Length of Subarray With Positive Product.java
@@ -0,0 +1,25 @@
+class Solution {
+  public int getMaxLen(int[] nums) {
+    int startIndex = -1;
+    int firstNegativeIndex = -1;
+    int negativeCount = 0;
+    int maxLen = 0;
+    for (int i = 0; i < nums.length; i++) {
+      if (nums[i] < 0) {
+        negativeCount++;
+        if (firstNegativeIndex == -1) {
+          firstNegativeIndex = i;
+        }
+      }
+      else if (nums[i] == 0) {
+        negativeCount = 0;
+        firstNegativeIndex = -1;
+        startIndex = i;
+      }
+      maxLen = Math.max(
+        maxLen, (negativeCount % 2 == 0 ? i - startIndex : i - firstNegativeIndex)
+      );
+    }
+    return maxLen;
+  }
+}
