Simple Beginner Friendly 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:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\n/**\n * @param {number[]} nums\n * @return {number}\n */\nvar minimumSum = function(nums) {\n    const arr = []\n\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                    arr.push(nums[i] + nums[j] + nums[k])\n                }\n            }\n        }\n    }\n\n    return arr.length > 0 ? Math.min(...arr) : -1\n};\n\n```
['JavaScript']