Add solution #746

Author: JoshCrozier

README.md

@@ -160,6 +160,7 @@
 722|[Remove Comments](./0722-remove-comments.js)|Medium|
 733|[Flood Fill](./0733-flood-fill.js)|Easy|
 739|[Daily Temperatures](./0739-daily-temperatures.js)|Medium|
+746|[Min Cost Climbing Stairs](./0746-min-cost-climbing-stairs.js)|Easy|
 762|[Prime Number of Set Bits in Binary Representation](./0762-prime-number-of-set-bits-in-binary-representation.js)|Easy|
 784|[Letter Case Permutation](./0784-letter-case-permutation.js)|Medium|
 791|[Custom Sort String](./0791-custom-sort-string.js)|Medium|

solutions/0746-min-cost-climbing-stairs.js

@@ -0,0 +1,28 @@
+/**
+ * 746. Min Cost Climbing Stairs
+ * https://leetcode.com/problems/min-cost-climbing-stairs/
+ * Difficulty: Easy
+ *
+ * You are given an integer array cost where cost[i] is the cost of ith 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.
+ */
+
+/**
+ * @param {number[]} cost
+ * @return {number}
+ */
+var minCostClimbingStairs = function(cost) {
+  let [first, second] = cost;
+
+  for (let index = 2; index < cost.length; index++) {
+    const cursor = cost[index] + Math.min(first, second);
+    first = second;
+    second = cursor;
+  }
+
+  return Math.min(first, second);
+};