Longest Increasing Subsequence Solution (LIS) – LeetCode Solution [Medium]
Given an integer array arr, return the length of the longest strictly increasing subsequence. Strictly increasing sequence is a sequence such that all elements of the sequence are sorted in increasing order.