C - Chokutter

C - 積み上げパズル

E - 天下一最短路コンテスト

Codeforces Round 715 (Div. 1) B. Almost Sorted

Codeforces Round 715 (Div. 2) C. The Sports Festival

Contest 2050 and Codeforces Round 718 (Div. 1 + Div. 2) D. Explorer Space

Educational Codeforces Round 109 (Rated for Div. 2) D. Armchairs

Codeforces LATOKEN Round 1 (Div. 1 + Div. 2) D. Lost Tree

1431. Kids With the Greatest Number of Candies

There are n kids with candies. You are given an integer array candies, where each candies[i] represents the number of candies the ith kid has, and an integer extraCandies, denoting the number of extra candies that you have.

Return a boolean array result of length n, where result[i] is true if, after giving the ith kid all the extraCandies, they will have the greatest number of candies among all the kids**, or false otherwise.

Note that multiple kids can have the greatest number of candies.

Two of my accounts recently achieved the #1 and #2 leetcode ratings in South Korea. lol 😂

Leetcode contest speed-run global rank 10th