Google | Find a subset of size "K" in an array with maximum sum such that any 2 selected numbers in the subset are not at adjacent positions in the original array

Question

Related questions

Find the length of the longest contiguous segment in an array, in which if a given element K is inserted, K becomes the second largest element of that subarray.(Hard)

How to find the maximum value of (a[i] + a[j] + i + j ) over all the pairs (i,j) in an array in O(N) time ?

Given a string , remove at most two substrings from the string such that the remaining part of string contains only vowels. The resulting string should have maximum length possible.

How to calculate the total number of pairs (i,j) in an array such that abs(a[i]-a[j]) = 2 in O(N) ?

Maximize the number of disjoint subarrays with even sum in an array in at most k swaps .

Google | Find a subset of size "K" in an array with maximum sum such that any 2 selected numbers in the subset are not at adjacent positions in the original array

0 like 0 dislike

1,765 views

Example :

K = 4

Array : 3 -6 8 88 9 100 2 200

Answer : 391 (3+88+100+200) , None the selected "K" numbers are adjacent and have maximum possible sum!

coding-interview

product-based

dynamic-programming

google

asked Apr 2, 2021 in Algorithms and Problems by karan_kumar Expert (144,420 points)

Click to join telegram group for high quality job updates
Share
Facebook Twitter LinkedIn

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers

Privacy Policy

Terms and Conditions

Disclosure(Legal Information)

Categories

Related questions

Google | Find a subset of size "K" in an array with maximum sum such that any 2 selected numbers in the subset are not at adjacent positions in the original array

Please log in or register to add a comment.

Please log in or register to answer this question.

0 Answers