Leetcode 1420. Build Array Where You Can Find The Maximum Exactly K Comparisons

Count the number of length-n arrays with values in [1, m] such that, when scanning left-to-right, a new maximum is found exactly k times (i.e., there are k record-breaking elements), returning the result modulo 10^9+7. This is a combinatorics / dynamic-programming counting problem over record highs.

Question Timeline

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

Company

Level

Region

Comments

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

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1420. Build Array Where You Can Find The Maximum Exactly K Comparisons

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact