10th public Most Expected important questions

 

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

Comments

Post a Comment

Popular posts from this blog

Cognizant Html css js CC

Image
 1. ATLAS PACKERS AND MOVERS:---- <!DOCTYPE html> <html> <head> <title>ATLAS PACKERS AND MOVERS</title> <style> .left{ left:0; } .right{ right:0; background-color:#548AE3; width:60%; padding:10px; } .b{ color:#FFFFFF; } .c{ color:#C21807; font-size:15px; font-family:"Georgia"; } #image{ width:80%; height:90%; } h3{ margin-right:auto; margin-left:auto; text-align:center; width:50%; font-family:"Georgia"; border-radius:6px; } table,th,td{ border-spacing:2px; font-size:15px; font-family:"Georgia"; border-radius:6px; padding:3px; border: 1px solid white; } td{ color:#FFFFFF; background-color:#548EA3; border-spacing:5px; } #submit{ color:#c21807; font-weight:bold; background-color:#ffffff; font-size:15px; font-family:"Georgia"; border-radius:6px; padding:3px; } #submit:hover{ background-color:#FF0000; color:#ffffff; } h3{ color:#c21807; font-weight:bold; background-color:#ffffff; font-size:15px; font-family:"G...
Read more

Length of subsequence

# 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;           ...
Read more