[LeetCode] Powerful Integers

970. Powerful Integers

Given three integers x, y, and bound, return a list of all the powerful integers that have a value less than or equal to bound.

An integer is powerful if it can be represented as xi + yj for some integers i >= 0 and j >= 0.

You may return the answer in any order. In your answer, each value should occur at most once.

Read more
[LeetCode] Swap For Longest Repeated Character Substring

1156. Swap For Longest Repeated Character Substring

You are given a string text. You can swap two of the characters in the text.

Return the length of the longest substring with repeated characters.

Read more
[AtCoder] F - Operations on a MatrixRead more
[AtCoder] E - Distance SequenceRead more
[AtCoder] D - FizzBuzz Sum HardRead more
[AtCoder] C - Max - Min QueryRead more
[AtCoder] A - Periodic NumberRead more
[Codeforces] Round #714 (Div. 2) B. AND SequencesRead more
[Codeforces] Global Round 14 C. Phoenix and TowersRead more
[Hacker Rank] Construct the ArrayRead more