- Longest Increasing Subsequence - LeetCode
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
- Number of Longest Increasing Subsequence - LeetCode
Number of Longest Increasing Subsequence - Given an integer array nums, return the number of longest increasing subsequences Notice that the sequence has to be strictly increasing
- Longest Continuous Increasing Subsequence - LeetCode
Given an unsorted array of integers nums, return the length of the longest continuous increasing subsequence (i e subarray) The subsequence must be strictly increasing
- Longest Increasing Subsequence II - LeetCode
Longest Increasing Subsequence II - You are given an integer array nums and an integer k Find the longest subsequence of nums that meets the following requirements: * The subsequence is strictly increasing and * The difference between adjacent elements in the subsequence is at most k
- 3409. Longest Subsequence With Decreasing Adjacent Difference - LeetCode
Your task is to find the length of the longest subsequence seq of nums, such that the absolute differences between consecutive elements form a non-increasing sequence of integers
- Decode Ways - LeetCode
You have intercepted a secret message encoded as a string of numbers The message is decoded via the following mapping: "1" -> 'A' "2" -> 'B' "25" -> 'Y' "26" -> 'Z' However, while decoding the message, you realize that there are many different ways you can decode the message because some codes are contained in other codes ("2" and "5" vs "25") For example, "11106" can be decoded into
|