BRUTE FORCE | PYTHON
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
```python3 []
class Solution:
    def minimumSum(self, nums: List[int]) -> int:
        a = 10**9
        count = 0

        for i in range(len(nums)-2):
            for j in range(i+1,len(nums)-1):
                for k in range(j+1,len(nums)):
                    if nums[i] < nums[j] and nums[k] < nums[j]:
                        count = count+1
                        sum = nums[i]+nums[j]+ nums[k]
                        if(sum < a):
                            a = sum
        if count == 0:
            return -1
        else:
            return a
```
['Python3']