746.min_cost_climbing_stairs in-progress

Author: Deftly

README.md

@@ -23,4 +23,5 @@
 |347|[Top K Frequent Elements](./leetcode/0347.top_k_frequent_elements/)|[Go](./leetcode/0347.top_k_frequent_elements/347.top_k_frequent_elements.go)|Medium|Completed|
 |359|[Logger Rate Limiter🔒](./leetcode/0359.logger_rate_limiter/)|[Go](./leetcode/0359.logger_rate_limiter/359.logger_rate_limiter.go)|Easy|Completed|
 |379|[Design Phone Directory🔒](./leetcode/0379.design_phone_directory/)|[Go](./leetcode/0379.design_phone_directory/379.design_phone_directory.go)|Medium|In-progress|
+|746|[Min Cost Climbing Stairs](./leetcode/0746.min_cost_climbing_stairs/)|[Go](./leetcode/0746.min_cost_climbing_stairs/746.min_cost_climbing_stairs.go)|Easy|In-progress|
 |1929|[Concatenation of Array](./leetcode/1929.concatenation_of_array/)|[Go](./leetcode/1929.concatenation_of_array/1929.concatenation_of_array.go)|Easy|Completed|

leetcode/0746.min_cost_climbing_stairs/746.min_cost_climbing_stairs.go

@@ -0,0 +1 @@
+package data_structures_algorithms

leetcode/0746.min_cost_climbing_stairs/README.md

@@ -0,0 +1,33 @@
+# [746. Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/?envType=daily-question&envId=2023-10-13)
+You are given an integer array `cost` where `cost[i]` is the cost of the <code>i<sup>th</sup></code> step on a staircase. Once you pay the cost, you can either climb one or two steps.
+
+You can either start from the step with index `0`, or the step with index `1`.
+
+Return *the minimum cost to reach the top of the floor*.
+
+#### Example 1:
+```
+Input: cost = [10,15,20]
+Output: 15
+Explanation: You will start at index 1.
+- Pay 15 and climb two steps to reach the top.
+The total cost is 15.
+```
+#### Example 2:
+```
+Input: cost = [1,100,1,1,1,100,1,1,100,1]
+Output: 6
+Explanation: You will start at index 0.
+- Pay 1 and climb two steps to reach index 2.
+- Pay 1 and climb two steps to reach index 4.
+- Pay 1 and climb two steps to reach index 6.
+- Pay 1 and climb one step to reach index 7.
+- Pay 1 and climb two steps to reach index 9.
+- Pay 1 and climb one step to reach the top.
+The total cost is 6.
+```
+<br>
+
+#### Constraints:
+- `2 <= cost.length <= 1000`
+- `0 <= cost[i] <= 999`