BEGINNER FRIENDLY JAVA SOLUTION
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```java []
class Solution {
    public int minimumSum(int[] nums) {
     int n=nums.length;
     int mins=Integer.MAX_VALUE;
     for(int i=0;i<n-2;i++)
     {
        for(int j=i+1;j<n-1;j++)
        {
            for(int k=j+1;k<n;k++)
            {
                if(nums[i]<nums[j] && nums[k]<nums[j])
                {
                    int sum=nums[i]+nums[j]+nums[k];
                    mins=Math.min(mins,sum);
                }
            }
        }
     }
     return mins==Integer.MAX_VALUE ? -1 : mins;
    }
}
```
['Java']