Number of divisors

Maximum size of a set

Remove Interval

Codeforces Round 720 (Div. 2) C. Nastia and a Hidden Permutation

Divide by Zero 2021 and Codeforces Round 714 (Div. 2) D. GCD and MST

Codeforces Round 716 (Div. 2) D. Cut and Stick

Educational Codeforces Round 109 (Rated for Div. 2) C. Robot Collisions

Codeforces Round 724 (Div. 2) D. Omkar and Medians

Problem C2: Back in Black (Chapter 2)

2863. Maximum Length of Semi-Decreasing Subarrays

You are given an integer array nums.

Return the length of the longest semi-decreasing subarray of nums, and 0 if there are no such subarrays.

• A subarray is a contiguous non-empty sequence of elements within an array.
• A non-empty array is semi-decreasing if its first element is strictly greater than its last element.