Bi-Weekly History
biweekly 128
2/4, 第三题graph, 我还没学。第四题感觉是个monotonic queue, 我很close了，但是没写出来。
| number | description | solution |
|---|---|---|
| 3110 Score of a String | adjacency pair的问题 | solution |
| 3111 Minimum Rectangles to Cover Points | simulation | solution |
| - | - | - |
| 3113 Find the Number of Subarrays Where Boundary Elements Are Maximum | monotonically decreasing queue | solution |
biweekly 127
2/4, 可惜的是第三题是标准sliding window题目，不过prefix-sum被替换成了bit OR的操作以及nullify nums[left]. 为了能 准确的nullify, 需要维护一个32的数组来记录每个bit的出现次数.
| number | description | solution |
|---|---|---|
| 3095 shortest subarray with OR at least K I | brute force | solution |
| 3096 Minimum Levels to Gain More Points | prefix sum的题目 | solution |
| 3097 Shortest Subarray with OR at Least K II | sliding window, bit manipulation | solution |
| 3098 Find the Sum of Subsequence Powers |