Sum of Three Numbers Trequel SOLUTIONS Weekly Contest 25

Given elite of positive numbers nums, think about three files I < j < k with the end goal that nums[i] ≤ nums[j] ≤ nums[k]. Return the greatest conceivable nums[i] + nums[j] + nums[k]. You can expect that an answer exists. 

 

Imperatives 

 

3 ≤ n ≤ 100,000 where n is the length of nums 

 

Model 1 

 

Info 

 

nums = [9, 1, 5, 3, 4] 

 

Yield 

 

8 

 

Clarification 

 

We pick [1, 3, 4] for an all out whole of 8