You are given an array nums consisting of integers. You are also given a 2D array queries, where queries[i] = [posi, xi].For query i, we first set nums[posi] equal to xi, then we calculate the answer to query i which is the maximum sum of a subsequence of nums where no two adjacent elements are selected.Return the sum of the answers to all queries.Since the final answer may be very large, return it modulo 109 + 7.A subsequence is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements. Example 1:Input: nums = [3,5,9], queries = [[1,-2],[0,-3]]Output: 21Explanation:After the 1st query, nums = [3,-2,9] and the maximum sum of a subsequence with non-adjacent elements is 3 + 9 = 12.After the 2nd query, nums = [-3,-2,9] and the maximum sum of a subsequence with non-adjacent elements is 9.Example 2:Input: nums = [0,-1], queries = [[0,-5]]Output: 0Explanation:After the 1st query, nums = [-5,-1] and the maximum sum of a subsequence with non-adjacent elements is 0 (choosing an empty subsequence). Constraints:1 <= nums.length <= 5 * 104-105 <= nums[i] <= 1051 <= queries.length <= 5 * 104queries[i] == [posi, xi]0 <= posi <= nums.length - 1-105 <= xi <= 105

Given an array Arr of size N containing positive integers. Find the maximum sum of a any possible subsequence such that no two numbers in the subsequence should be adjacent in Arr.

You are given an integer array nums and a non-negative integer k. A sequence of integers seq is called good if there are at most k indices i in the range [0, seq.length - 2] such that seq[i] != seq[i + 1].Return the maximum possible length of a good subsequence of nums. Example 1:Input: nums = [1,2,1,1,3], k = 2Output: 4Explanation:The maximum length subsequence is [1,2,1,1,3].Example 2:Input: nums = [1,2,3,4,5,1], k = 0Output: 2Explanation:The maximum length subsequence is [1,2,3,4,5,1]. Constraints:1 <= nums.length <= 5001 <= nums[i] <= 1090 <= k <= min(nums.length, 25)Python3 1class Solution:2    def maximumLength(self, nums: List[int], k: int) -> int:

You are given an integer array nums, an integer array queries, and an integer x.For each queries[i], you need to find the index of the queries[i]th occurrence of x in the nums array. If there are fewer than queries[i] occurrences of x, the answer should be -1 for that query.Return an integer array answer containing the answers to all queries. Example 1:Input: nums = [1,3,1,7], queries = [1,3,2,4], x = 1Output: [0,-1,2,-1]Explanation:For the 1st query, the first occurrence of 1 is at index 0.For the 2nd query, there are only two occurrences of 1 in nums, so the answer is -1.For the 3rd query, the second occurrence of 1 is at index 2.For the 4th query, there are only two occurrences of 1 in nums, so the answer is -1.Example 2:Input: nums = [1,2,3], queries = [10], x = 5Output: [-1]Explanation:For the 1st query, 5 doesn't exist in nums, so the answer is -1. Constraints:1 <= nums.length, queries.length <= 1051 <= queries[i] <= 1051 <= nums[i], x <= 104

You are given an integer array nums.A subsequence sub of nums with length x is called valid if it satisfies:(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + sub[x - 1]) % 2.Return the length of the longest valid subsequence of nums.A subsequence is an array that can be derived from another array by deleting some or no elements without changing the order of the remaining elements. Example 1:Input: nums = [1,2,3,4]Output: 4Explanation:The longest valid subsequence is [1, 2, 3, 4].Example 2:Input: nums = [1,2,1,1,2,1,2]Output: 6Explanation:The longest valid subsequence is [1, 2, 1, 2, 1, 2].Example 3:Input: nums = [1,3]Output: 2Explanation:The longest valid subsequence is [1, 3]. Constraints:2 <= nums.length <= 2 * 1051 <= nums[i] <= 107

Given an integer array nums, find the subarray with the largest sum, and return its sum.