Search
⌘K

Leetcode 1395. Count Number of Teams

Count the number of index triplets i<j<k in an array of unique ratings such that the ratings form a strictly increasing or strictly decreasing sequence. With n up to 1000, this is essentially counting length-3 monotonic subsequences (feasible with O(n^2) approaches).


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Your account is free and you can post anonymously if you choose.