Merge pull request neetcode-gh#3205 from badhon495/patch-1

Create 0746-min-cost-climbing-stairs.dart

Author: sujal-goswami

dart/0746-min-cost-climbing-stairs.dart

@@ -0,0 +1,9 @@
+class Solution {
+  int minCostClimbingStairs(List<int> cost) {
+    for (int i = cost.length - 3; i >= 0; i--) {
+      cost[i] += min(cost[i + 1], cost[i + 2]);
+    }
+
+    return min(cost[0], cost[1]);
+  }
+}