How should I practice Maximum Sum of Balanced Subsequence 🐮?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Service Now online assessment problems in FastPrep.

Is Maximum Sum of Balanced Subsequence 🐮 associated with Service Now?

FastPrep tags this as a Service Now online assessment coding practice problem when the problem catalog has that company and stage context.

Problem · Dynamic Programming

Maximum Sum of Balanced Subsequence 🐮

Learn this problem

● MediumSNService NowOA

Problem statement

You are given a 0-indexed integer array nums.

A subsequence of nums having length k and consisting of indices i₀ < i₁ < ... < i_k-1 is balanced if the following holds:

nums[i] - nums[i-1] == i - (i-1),

A subsequence of nums having length 1 is considered balanced.

Return an integer denoting the maximum possible sum of elements in a balanced subsequence of nums.

A subsequence of an array is a new non-empty array that is formed from the original array by deleting some (possibly none) of the elements without disturbing the relative positions of the remaining elements.

Function

maxSumOfBalancedSubsequence(nums: int[]) → int

Examples

Example 1

nums = [1, 2, 3]return = 6

Explanation not found 👉👈

Example 2

nums = [3, 2, 1]return = 3