Alice’s Journey

Plus and Minus

Codeforces Round 332 (Div. 2) D. Spongebob and Squares

Codeforces Round 336 (Div. 1) B. Zuma

Codeforces Round 339 (Div. 1) A. Peter and Snow Blower

Codeforces Round 339 (Div. 1) B. Skills

Educational Codeforces Round 7 D. Optimal Number Permutation

Experimental Educational Round: VolBIT Formulas Blitz E. A rectangle

Manthan, Codefest 16 C. Spy Syndrome 2

2831. Find the Longest Equal Subarray

You are given a 0-indexed integer array nums and an integer k.

A subarray is called equal if all of its elements are equal. Note that the empty subarray is an equal subarray.

Return the length of the longest possible equal subarray after deleting at most k elements from nums.

A subarray is a contiguous, possibly empty sequence of elements within an array.