2908. Minimum Sum of Mountain Triplets I

You are given a 0-indexed array nums of integers.

A triplet of indices (i, j, k) is a mountain if:

• i < j < k
• nums[i] < nums[j] and nums[k] < nums[j]

Return the minimum possible sum of a mountain triplet of nums. If no such triplet exists, return -1.

Problem C: Wiki Race

Problem B: Meta Game

Problem A2: Ready, Go (Part 2)

Problem A1: Ready, Go (Part 1)

Bubble Cup 12 - Finals Online Mirror, unrated, Div. 2 G. Harvester

Technocup 2020 - Elimination Round 1 D. Sequence Sorting

Codeforces Round 590 (Div. 3) E. Special Permutations

Codeforces Global Round 5 D. Balanced Playlist

Codeforces Round 592 (Div. 2) C. The Football Season