🔥 Climbing Stairs

Author: maddhruv

README.md

@@ -18,3 +18,7 @@ Solutions of LeetCode Blind 75 Problems in JavaScript
 | [Container With Most Water](./container-with-most-water.js)                       | <img src="https://img.shields.io/badge/-Medium-orange" /> | `Array`, `Two Pointers`, `Greedy`                  | [:link:](https://leetcode.com/problems/container-with-most-water/)            |
 | [Sum of Two Integers](./sum-of-two-integers.js)                                   | <img src="https://img.shields.io/badge/-Medium-orange" /> | `Math`, `Bit Manipulation`                         | [:link:](https://leetcode.com/problems/sum-of-two-integers/)                  |
 | [Number of 1 Bits](./number-of-1-bits.js)                                         | <img src="https://img.shields.io/badge/-Easy-green" />    | `Bit Manipulation`                                 | [:link:](https://leetcode.com/problems/number-of-1-bits/)                     |
+| [Counting Bits]()                                                                 |                                                           |                                                    | [:link:](https://leetcode.com/problems/counting-bits/)                        |
+| [Missing Number]()                                                                |                                                           |                                                    | [:link:](https://leetcode.com/problems/missing-number/)                       |
+| [Reverse Bits]()                                                                  |                                                           |                                                    | [:link:](https://leetcode.com/problems/reverse-bits/)                         |
+| [Climbing Stairs](./climbing-stairs.js)                                           | <img src="https://img.shields.io/badge/-Easy-green" />    | `Math`, `Dynamic Programming`, `Memoization`       | [:link:](https://leetcode.com/problems/climbing-stairs/)                      |

climbing-stairs.js

@@ -0,0 +1,14 @@
+const climbStairs = (n) => {
+  let one = (two = 1),
+    i = 0,
+    temp = one;
+
+  while (i < n - 1) {
+    temp = one;
+    one += two;
+    two = temp;
+    i++;
+  }
+
+  return one;
+};