onlyblues

摘要： B. Sum of Two Numbers The sum of digits of a non-negative integer $a$ is the result of summing up its digits together when written in the decimal syst 阅读全文

摘要： E. Sum Over Zero You are given an array $a_1, a_2, \ldots, a_n$ of $n$ integers. Consider $S$ as a set of segments satisfying the following conditions 阅读全文

摘要： D. Lucky Permutation You are given a permutation$^\dagger$ $p$ of length $n$. In one operation, you can choose two indices $1 \le i < j \le n$ and swa 阅读全文

摘要： E. Monsters (hard version) This is the hard version of the problem. In this version, you need to find the answer for every prefix of the monster array 阅读全文

摘要： Disconnect Path in a Binary Matrix by at Most One Flip You are given a 0-indexed $m \times n$ binary matrix grid . You can move from a cell (row, col) 阅读全文

摘要： Maximize Win From Two Segments There are some prizes on the X-axis. You are given an integer array prizePositions that is sorted in non-decreasing ord 阅读全文

摘要： G2. Teleporters (Hard Version) The only difference between the easy and hard versions are the locations you can teleport to. Consider the points $0,1, 阅读全文

摘要： E. Negatives and Positives Given an array $a$ consisting of $n$ elements, find the maximum possible sum the array can have after performing the follow 阅读全文

摘要： Minimum Cost to Make Array Equal You are given two 0-indexed arrays nums and cost consisting each of $n$ positive integers. You can do the following o 阅读全文

摘要： Count Increasing Quadruplets Given a 0-indexed integer array nums of size $n$ containing all numbers from $1$ to $n$, return the number of increasing 阅读全文