The Best Subsequence || Find the minimum of special value of a subsequence

Q: How should I practice The Best Subsequence || Find the minimum of special value of a subsequence?

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

Q: Is The Best Subsequence || Find the minimum of special value of a subsequence associated with GE Vernova?

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

GE Vernova● HardOA

Problem statement

You are given an array arr of size n and an integer k. A subsequence is defined as a sequence that can be derived from the array by deleting some or no elements without changing the order of the remaining elements. You need to find a subsequence of size k and calculate its special value.

The special value of a subsequence of size k is defined as: Summation of absolute difference of consecutive numbers. For i = 2 to k, abs(pi - p(i-1)).

Your task is to find the minimum possible special value among all subsequences of size k in the array.

Function

findMinimumSpecialValue(arr: int[], k: int) → int

Examples

Example 1

arr = [9, 5, 1, 4, 9]k = 2return = 0

Subsequence : {9, 9}

Example 2

arr = [9, 5, 1, 4, 9, 100]k = 3return = 5

Subsequence : {9, 5, 4}

Constraints

🌷

See GE Vernova hiring insights