Skip to content

Practice Constrained Subsequence Sum

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#1425
LeetCode Problem

Constrained Subsequence Sum

ArrayDynamic ProgrammingQueueSliding WindowHeap (Priority Queue)Monotonic Queue

Problem Statement

Given an integer array nums and an integer k, return the maximum sum of a non-empty subsequence of that array such that for every two consecutive integers in the subsequence, nums[i] and nums[j], where i < j, the condition j - i <= k is satisfied. A subsequence of an array is obtained by deleting some number of elements (can be zero) from the array, leaving the remaining elements in their original order.

Source: Constrained Subsequence Sum on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [10,2,-10,5,20], k = 2
Output
37

# Example 2

Input
nums = [-1,-2,-3], k = 1
Output
-1

# Example 3

Input
nums = [10,-2,-10,-5,20], k = 2
Output
23

Constraints

1 <= k <= nums.length <= 10^5
-10^4 <= nums[i] <= 10^4

Related LeetCode Problems

Practice more problems similar to Constrained Subsequence Sum.

1 Two Sum Easy3 Longest Substring Without Repeating Characters Medium4 Median of Two Sorted Arrays Hard5 Longest Palindromic Substring Medium10 Regular Expression Matching Hard
← Previous Diagonal Traverse IINext → Kids With the Greatest Number of Candies

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free