diff --git a/25/10/3349.cpp b/25/10/3349.cpp
new file mode 100644
index 0000000..bc1e7c8
--- /dev/null
+++ b/25/10/3349.cpp
@@ -0,0 +1,33 @@
+#include <vector>
+using namespace std;
+
+bool hasIncreasingSubarrays(vector<int>& nums, int k) {
+    if(k == 1 && nums.size() > 1){
+        return true;
+    }
+    vector<int> s;
+    int temp = 1;
+    for(int i = 1;i<nums.size();++i){
+        if(nums[i] > nums[i-1]){
+            temp++;
+            if(temp >= 2 * k){
+                return true;
+            }
+            continue;
+        }
+        if(temp >= k){
+            s.push_back(temp);
+            if(s.size() > 1){
+                return true;
+            }
+            temp = 1;
+            continue;
+        }
+        while (s.size() > 0)
+        {
+            s.pop_back();
+        }
+        temp = 1;
+    }
+    return false;
+}
\ No newline at end of file
diff --git a/25/11/1578.cpp b/25/11/1578.cpp
new file mode 100644
index 0000000..867db21
--- /dev/null
+++ b/25/11/1578.cpp
@@ -0,0 +1,30 @@
+#include <string>
+#include <vector>
+#include <iostream>
+
+int minCost(std::string colors, std::vector<int> &neededTime)
+{
+    int n = colors.size();
+    colors += '#';
+    int m = 0, count = 0, ans = 0;
+    for (int i = 0; i < n; ++i)
+    {
+        m = std::max(neededTime[i], m);
+        count += neededTime[i];
+        if (colors[i] == colors[i + 1])
+        {
+            continue;
+        };
+        ans += count - m;
+        m = 0;
+        count = 0;
+    }
+    return ans;
+}
+
+int main()
+{
+    std::string c = "abaac";
+    std::vector<int> need = {1, 2, 3, 4, 5};
+    std::cout<<minCost(c, need);
+}
\ No newline at end of file
diff --git a/25/11/go/1578.go b/25/11/go/1578.go
new file mode 100644
index 0000000..6848bcb
--- /dev/null
+++ b/25/11/go/1578.go
@@ -0,0 +1,18 @@
+package A
+
+func minCost(colors string, neededTime []int) int {
+	count := 0
+	ans := 0
+	m := 0
+	for i := 0; i < len(colors); i++ {
+		count += neededTime[i]
+		m = max(m, neededTime[i])
+		if i != len(colors)-1 && colors[i] == colors[i+1] {
+			continue
+		}
+		ans += count - m
+		m = 0
+		count = 0
+	}
+	return ans
+}