Certainly' Here's a coding question for you:

Question: Find the Longest Increasing Subsequence $($LIS$)$

Given an unsorted array of integers, find the length of the longest increasing subsequence $($LIS$).$

An increasing subsequence is a sequence of numbers where each clement is strictly greater than the previous element. For example, in the array $\{10,9,2,5,3,7,101,18\},$ the LIS is $\{2,5,7,101\},$ which has a length of $4$

Write a function that takes an array of integers as input and returns the length of the LIS.

Example:

Input: $10,9,2,5,3,7,101,18$

Output: $4($for the IIS $2,5,7,101)$