Maximum Sum Triplet #InterviewBit Intuition+ Code + Example

Problem Description

Given an array A containing N integers.

You need to find the maximum sum of triplet ( Ai + Aj + Ak ) such that i LESS THAN j LESS THAN k and Ai LESS THAN Aj LESS THAN Ak.

If no such triplet exist return 0.

[bhaveshkumar]

You are easily one of the best teachers I have ever come across online/offline. This was IMMENSELY helpful! Please cover all programming questions on InterviewBit because your in-depth explanations are of great help. Just a suggestion (i know it doesn't matter much though): if(i==n-1) will be checked for all n iterations of the first for loop. So, instead of that if condition inside the loop, you could have written right[n-1]=A[n-1] before the first for loop. Again, please cover all questions. It's immensely useful for me. Thank you for helping me out

[adeshchhajed]

Whenever I am stucking on problem coming on youtube & searching for your solution video
Amazing solutions.

[divy]

got the intuition by my own, just couldnt implement it, Once again beautiful explanation

[yashasvprajapati]

great video and to the point, great explanation, thank you for the video

[mohanavamsipidugu]

mam i love to watch your explaination ...great teaching.Thank you

[kapilpatel]

I was not able to understand 100% but got the idea thanks

[KD-xiwu]

But this code doesn't work for -ve numbers array isn't

[techworld]

why cant we sort the whole array and calculate sum -of last 3 index?

[krupaharan]

Can't this be solved better with prefix and suffix array in O(n) time ?

[sakshamsrivastava]

great video, but i have a question here, if we are taking just smaller on the left of the current element while traversing the main array, then we are making the suffix array, if for left we are taking the lower bond, shouldn't for the right largest we should be taking the upper bound.
or we are taking the right most greatest element in the form of suffix array, why are not doing the prefix array as well for the left side also.
any reasons would be appreaciated.
thanks.

[adityaverma]

really helpful, thank you very much di🙏🙏🙏

[rajathkumar]

Apka laptop ka ram kithna hoga.
Ye tabs enthe kule he😂.
Ryzen ka he kya or Intel i5 11gen.

[anurag__pathak]

The girl behind her is like sone do yrr 🤣🤣

[bharathKumar-orgd]

great explanation mam good, hoping to expect more videos on leetcode questions haven't seen with good visual with step-by-step approach

[chandraprakashsahu]

there are various explanation of every problem in youtube but i like you and your video 😁
btw
Nice explanation 👌👌

[devanshdixitmusicallyyours]

kindly provide code as well which u explain in video, it will be helpful for us.

[basicGyaan]

someone is there in your background :)

[anuruddhtiwari]

Ma'am why you not solving potd daily, we daily waiting your video

[priyadarshiroy]

How to handle duplicates in this question 😢😢😢

[jigarjoshi]

we can do it in O(n ) by sorting array and fetching last three elements sum as answer?