Maximum triplet value

given an array of size n

find max(a[i]+(a[j]*a[k]) over array

such that i<j<k and a[i]<a[j]<a[k]

This problem was asked in past dell interview

pls share approaches

[deleted]
:confused:

pls explain !!

@priyanshi_02 , this question is from current NCR exam . It is from an on going contest on hackerearth . I know it !!

1 Like

oops, sorry then, can’t discuss it here while the contest is live

1 Like

Even if you solve this by some kind of help , interview won’t be easy to crack. Rather focus on building logic. :slightly_smiling_face:

1 Like

Yeah … btw the solution to this problem is not so easy