Merge pull request neetcode-gh#1698 from a93a/300

Create 0300-longest-increasing-subsequence.kt

Author: Ahmad-A0

kotlin/0300-longest-increasing-subsequence.kt

@@ -0,0 +1,16 @@
+class Solution {
+    fun lengthOfLIS(nums: IntArray): Int {
+        val dp = IntArray(nums.size){1}
+        for(i in nums.size-1 downTo 0){
+            for(j in i+1 until nums.size){
+                if(nums[i] < nums[j]){
+                    dp[i] = maxOf(dp[i], 1 + dp[j])
+                }
+            }
+        }
+        var max = 0
+        for(n in dp)
+            max = maxOf(max, n)
+        return max
+    }
+}