MasterMaterial

# 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

  10th Maths Most Important Question click below to get 10th Science Most Important Question click below to get 10th social Most Important Question click below to get 10th Tamil Most Important Question click below to get

import java.io.*; import java.lang.*; import java.util.*;   class sm{   static int smallestSubstring(String a) {           // Stores all occurrences     ArrayList a1 = new ArrayList<>();       // Generate all the substrings     for(int i = 0; i < a.length(); i++)     {         for(int j = i + 1; j <= a.length(); j++)         {                           // Avoid multiple occurences             if (i != j)                               // Append all substrings                 a1.add(a.substring(i, j));         }     }       // Take into account     // all the substrings     TreeMap a2 = new TreeMap<>();     for(String s : a1)         a2.put(s, a2.getOrDefault(s, 0) + 1);       ArrayList freshlist = new ArrayList<>();       // Iterate over all     // unique substrings     for(String s : a2.keySet())     {                   // If frequency is 1         if (a2.get(s) == 1)               // Append into fresh list             freshlist.add(s);     }       // Initia

Embedding an online compiler into a website

  SET 2 ANSWERS 1. Storage, networking, servers 2. Tomcat 3. Hierarchical 4. Ddl 5. Event Loop 6. Event handler 7. Bandwidth, packet loss 8. Branch, checkout 9. Host 10. Disk space, memory, CPU 11. Passive, active 12. Microservice architecture 13. SOA 14. Software defined network 15. Progressive web application 16. API 17. Resource 18. Project risks 19. Risk 20. UDP 21. IP 22. Zombie 23. Cryptography 24. Public key 25. A and C 26. Define intuitive short cuts 27. UI design process 28. True 29. True 30. True I got 96.67% Set 2 Quiz 3 answers Software engineering fundamentals/concept 75/100 9 @mediatag 17 TCP 12 Automatic Identification and Data Collection 11 .info 8 CSS3 4 none pf the above  3 - 80 5 C#, java, cotlin 7 authentication 6 -12 16 responsive web design 2 - 443 14 - @ media rules 13 Rxswift and X code 15 meta viewport tag 1 <input type="text" pattern="Tw](6,8}" /> 1.00 <input type="text" pattern="[A-Ba-b0-9_](6,8}" /> 17 TC