diff --git a/Dynamic Programming/Minimum Time to Make Rope Colorful.cpp b/Dynamic Programming/Minimum Time to Make Rope Colorful.cpp
new file mode 100644
index 00000000..542135d9
--- /dev/null
+++ b/Dynamic Programming/Minimum Time to Make Rope Colorful.cpp	
@@ -0,0 +1,16 @@
+//problem statement https://leetcode.com/problems/minimum-time-to-make-rope-colorful/
+class Solution {
+public:
+    int minCost(string c, vector<int>& nT) {
+        int n=c.size();
+        int sum=0;
+        int mx=nT[0];
+        for(int i=1;i<=n;i++){
+            if(c[i]==c[i-1]){
+                sum+=min(nT[i-1],nT[i]);
+                nT[i]=max(nT[i],nT[i-1]);
+            }
+        }
+        return sum;
+    }
+};