Do it for FUN | SUMFIのBlog

You are given a string s consisting of lowercase English letters, and an integer k.

First, convert s into an integer by replacing each letter with its position in the alphabet (i.e., replace 'a' with 1, 'b' with 2, …, 'z' with 26). Then, transform the integer by replacing it with the sum of its digits. Repeat the transform operation k times in total.

For example, if s = "zbax" and k = 2, then the resulting integer would be 8 by the following operations:

Convert: "zbax" ➝ "(26)(2)(1)(24)" ➝ "262124" ➝ 262124

Transform #1: 262124 ➝ 2 + 6 + 2 + 1 + 2 + 4 ➝ 17

Transform #2: 17 ➝ 1 + 7 ➝ 8

Return the resulting integer after performing the operations described above.

[Marisa OJ] Permutation problem 2024-09-02|PSMarisa OJ|Problem Solving-Combinatorics-Inclusion-Exclusion Principle

Permutation problem

[Marisa OJ] Good string pairs 2024-09-02|PSMarisa OJ|Problem Solving-Bit Manipulation-Inclusion-Exclusion Principle

Good string pairs

[LeetCode] Maximum XOR Score Subarray Queries 2024-09-01|PSLeetCode|Problem Solving-Dynamic Programming-Divide and Conquer

3277. Maximum XOR Score Subarray Queries

You are given an array nums of n integers, and a 2D integer array queries of size q, where queries[i] = [li, ri].

For each query, you must find the maximum XOR score of any subarray of nums[li..ri].

The XOR score of an array a is found by repeatedly applying the following operations on a so that only one element remains, that is the score:

Simultaneously replace a[i] with a[i] XOR a[i + 1] for all indices i except the last one.

Remove the last element of a.

Return an array answer of size q where answer[i] is the answer to query i.

[LeetCode] Select Cells in Grid With Maximum Score 2024-09-01|PSLeetCode|Problem Solving-Dynamic Programming-Bit Manipulation-Maximum Flow-Minimum Cut

3276. Select Cells in Grid With Maximum Score

You are given a 2D matrix grid consisting of positive integers.

You have to select one or more cells from the matrix such that the following conditions are satisfied:

No two selected cells are in the same row of the matrix.

The values in the set of selected cells are unique.

Your score will be the sum of the values of the selected cells.

Return the maximum score you can achieve.

[LeetCode] K-th Nearest Obstacle Queries 2024-09-01|PSLeetCode|Problem Solving-Heap

3275. K-th Nearest Obstacle Queries

There is an infinite 2D plane.

You are given a positive integer k. You are also given a 2D array queries, which contains the following queries:

queries[i] = [x, y]: Build an obstacle at coordinate (x, y) in the plane. It is guaranteed that there is no obstacle at this coordinate when this query is made.

After each query, you need to find the distance of the kth nearest obstacle from the origin.

Return an integer array results where results[i] denotes the kth nearest obstacle after query i, or results[i] == -1 if there are less than k obstacles.

Note that initially there are no obstacles anywhere.

The distance of an obstacle at coordinate (x, y) from the origin is given by |x| + |y|.

[LeetCode] Check if Two Chessboard Squares Have the Same Color 2024-09-01|PSLeetCode|Problem Solving

3274. Check if Two Chessboard Squares Have the Same Color

You are given two strings, coordinate1 and coordinate2, representing the coordinates of a square on an 8 x 8 chessboard.

Below is the chessboard for reference.

Return true if these two squares have the same color and false otherwise.

The coordinate will always represent a valid chessboard square. The coordinate will always have the letter first (indicating its column), and the number second (indicating its row).