MasterMaterial

Click here to see  IT Learning collection Click here to see all programing course   Abdul Bari : Courses collection Size: 157GB Tutorials + Books + Courses + Trainings + Workshops + Educational Resources  🔹Data science 🔹Python 🔹Artificial Intelligence  🔹AWS Certified  🔹Cloud 🔹BIG DATA 🔹Data Analytics 🔹BI 🔹Google Cloud Platform 🔹IT Training 🔹MBA 🔹Machine Learning 🔹Deep Learning 🔹Ethical Hacking 🔹SPSS 🔹Statistics 🔹Data Base 🔹Learning language resources ( English🏴󐁧󐁢󐁥󐁮󐁧󐁿 , French🇨🇵 , German🇩🇪 ) Click here to visit  Resume Collections : A@shok IT AWS : A@shok IT devops : Azure Devops : 500 TB Tutorials + Books + Courses + Trainings + Workshops 🔥 Link - 

# LEETCODE-SERIES-Longest-Increasing-Subsequence Given an integer array nums, return the length of the longest strictly increasing  subsequence .   Example 1: Input: nums = [10,9,2,5,3,7,101,18] Output: 4 Explanation: The longest increasing subsequence is [2,3,7,101], therefore the length is 4. Example 2: Input: nums = [0,1,0,3,2,3] Output: 4 Example 3: Input: nums = [7,7,7,7,7,7,7] Output: 1   Constraints: 1 <= nums.length <= 2500 -104 <= nums[i] <= 104    /* time: O(nlogn) space: O(n) */ public class Solution {     public int LengthOfLIS(int[] nums)      {         if(nums.Length == 0) return 0;         List<int> dp = new List<int>();         foreach(var num in nums)         {             int left = 0;             int right = dp.Count;             while(left < right)             {                 int mid = left + (right - left)/2;                 if(dp[mid] < num)                 {                     left = mid + 1;                 }                 else