🔥 Day 25

Author: AkashRajpurohit

README.md

@@ -39,6 +39,7 @@
 1. [Random Point in Non-overlapping Rectangles](https://leetcode.com/explore/challenge/card/august-leetcoding-challenge/552/week-4-august-22nd-august-28th/3433/) ➡️ [CPP Solution](Week4/randomPoint.cpp)
 2. [Stream of Characters](https://leetcode.com/explore/challenge/card/august-leetcoding-challenge/552/week-4-august-22nd-august-28th/3434/) ➡️ [CPP Solution](Week4/streamChecker.cpp)
 3. [Sum of Left Leaves](https://leetcode.com/explore/challenge/card/august-leetcoding-challenge/552/week-4-august-22nd-august-28th/3435/) ➡️ [CPP Solution](Week4/sumOfLeftLeaves.cpp)
+4. [Minimum Cost For Tickets](https://leetcode.com/explore/challenge/card/august-leetcoding-challenge/552/week-4-august-22nd-august-28th/3435/) ➡️ [CPP Solution](Week4/mincostTickets.cpp)
 
 ## Week 5 🚧
 

Week4/mincostTickets.cpp

@@ -0,0 +1,30 @@
+class Solution {
+public:
+    int mincostTickets(vector<int>& days, vector<int>& costs) {
+        int n = days[days.size() - 1];
+        bool travelDays[n + 1];
+        int dp[n + 1];
+        
+        fill(travelDays, travelDays + n + 1, false);
+        fill(dp, dp + n + 1, 0);
+        
+        for(int day: days) {
+            travelDays[day] = true;
+        }
+        
+        for(int i = 1; i < n + 1; ++i) {
+            if(!travelDays[i]) {
+                dp[i] = dp[i - 1];
+                continue;
+            }
+            
+            int one = dp[i - 1] + costs[0];
+            int seven = dp[max(i - 7, 0)] + costs[1];
+            int thirty = dp[max(i - 30, 0)] + costs[2];
+            
+            dp[i] = min(one, min(seven, thirty));
+        }
+        
+        return dp[n];
+    }
+};