☑️ Finding Minimum Sum of Mountain Triplets I.☑️
Code
# Code
```dart []
class Solution {
  int minimumSum(List<int> nums) {
    List<int> list = [];
    for(int i = 1; i < nums.length-1; i++){
        for(int j = 0; j < i; j++){
            if(nums[j] < nums[i]){
                for(int l = i+1; l < nums.length; l++){
                    if(nums[l] < nums[i]){
                        list.add(nums[i] + nums[j] + nums[l]);
                    }
                }
            }
        }
    }

    list.sort((a, b) => a.compareTo(b));
    return list.isEmpty ? -1 : list.first;
  }
}
```
['Array', 'Dart']