Add solution #300

Author: JoshCrozier

README.md

@@ -238,6 +238,7 @@
 292|[Nim Game](./0292-nim-game.js)|Easy|
 295|[Find Median from Data Stream](./0295-find-median-from-data-stream.js)|Hard|
 297|[Serialize and Deserialize Binary Tree](./0297-serialize-and-deserialize-binary-tree.js)|Hard|
+300|[Longest Increasing Subsequence](./0300-longest-increasing-subsequence.js)|Medium|
 303|[Range Sum Query - Immutable](./0303-range-sum-query-immutable.js)|Easy|
 306|[Additive Number](./0306-additive-number.js)|Medium|
 309|[Best Time to Buy and Sell Stock with Cooldown](./0309-best-time-to-buy-and-sell-stock-with-cooldown.js)|Medium|

solutions/0300-longest-increasing-subsequence.js

@@ -0,0 +1,26 @@
+/**
+ * 300. Longest Increasing Subsequence
+ * https://leetcode.com/problems/longest-increasing-subsequence/
+ * Difficulty: Medium
+ *
+ * Given an integer array nums, return the length of the longest strictly increasing subsequence.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var lengthOfLIS = function(nums) {
+  if (!nums.length) return 0;
+
+  const dp = new Array(nums.length).fill(1);
+  for (let i = 1; i < nums.length; i++) {
+    for (let j = 0; j < i; j++) {
+      if (nums[i] > nums[j]) {
+        dp[i] = Math.max(dp[i], dp[j] + 1);
+      }
+    }
+  }
+
+  return Math.max(...dp);
+};