Simple Solution💯
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\nO(n^3)\n\n- Space complexity:\nO(1)\n\n# Code\n```\n/**\n * @param {number[]} nums\n * @return {number}\n */\nvar minimumSum = function(nums) {\n    let minsum=Infinity\n       for(let i=0;i<nums.length;i++){\n           for(let j=i+1;j<nums.length;j++){\n               for(let k=j+1;k<nums.length;k++){\n                   if(nums[i]<nums[j] && nums[k]<nums[j]){\n                       minsum=Math.min(minsum,nums[i]+nums[j]+nums[k])\n                   }\n               }\n           }\n       }\n       return minsum==Infinity?-1:minsum\n};\n```
['JavaScript']