Because work requested, I have to study English now. So I will write the problem solutions with English.

Same with 2935

# 2933. High-Access Employees | 2933. 高访问员工

Firstly, we can create a map<{employee}, {access times array}> to distinguish access times of each employee.

For each employee, we sort their access times array from little to big. And then iterate over this array, when there is $access_times_{i} - access_times_{i-1} < 60$, this employee is a High-Access Employee.

# 2934. Minimum Operations to Maximize Last Elements in Arrays | 2934. 最大化数组末位元素的最少操作次数

Follow the mean of this problem, care detail is ok.

# 2935. Maximum Strong Pair XOR II | 2935. 找出强数对的最大异或值 II

01 trie + two points

Firstly, we need to find all Strong Pairs.

For a Strong Pairs: (x, y). if $x < y$, we can transfer $|x-y| <= min(x, y)$ to $x \times 2 >= y$.

When we fix the little number is $nums_{i}$, the other number must in $[ nums_{i}, nums_{i} \times 2]$, When we sort nums from little to big, the other numbers must consequent and start $nums_{i}$.

Consider $nums,length() <= 5 \times 10^4$, two layer for must TLE.

We can use two points , fix a number to find the period of the other number.

But answer is maximum XOR of all Strong Pairs. We can use 01-trie. When we fix a number, add all other numbers to 01-trie, so that we can find maximum XOR about the fix number quickly. We loop nums array, fix each $nums_{i}$. We can get the final answer.

Note: When we visit $nums_{i}$, we need to delete $nums_{0}, nums_{1}, … , nums{i-1}$ from 01-trie.