| # | Title | Difficulty | Solution | Remark |
|---|---|---|---|---|
| 1 | Make Two Arrays Equal by Reversing Sub-arrays | Easy | Python3 | 重在分析 |
| 2 | Check If a String Contains All Binary Codes of Size K | Medium | Python3 | 模拟 思路转化 |
| 3 | Course Schedule IV | Medium | Python3 | 弗洛伊德算法 |
| 4 | Cherry Pickup II | Hard | Good One | DP建模 |
| # | Title | Difficulty | Solution | Remark |
|---|---|---|---|---|
| 1 | Final Prices With a Special Discount in a Shop | Easy | Python3 | |
| 2 | Subrectangle Queries | Medium | Python3 | |
| 3 | Find Two Non-overlapping Sub-arrays Each With Target Sum | Medium | TODO | |
| 4 | Allocate Mailboxes | Hard | TODO |
| # | Title | Difficulty | Solution | Remark |
|---|---|---|---|---|
| 1 | Running Sum of 1d Array | Easy | Python3 | |
| 2 | Least Number of Unique Integers after K Removals | Medium | Python3 | |
| 3 | Minimum Number of Days to Make m Bouquets | Medium | TLE TODO | |
| 4 | Kth Ancestor of a Tree Node | Hard | TODO |
| # | Title | Difficulty | Solution | Remark |
|---|---|---|---|---|
| 1 | XOR Operation in an Array | Easy | Python3 | |
| 2 | Making File Names Unique | Medium | Python3 | |
| 3 | Minimum Number of Days to Make m Bouquets | Medium | WA Other's Solution | To Check |
| 4 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Hard | TODO |
| # | Title | Difficulty | Solution | Remark |
|---|---|---|---|---|
| 1 | Average Salary Excluding the Minimum and Maximum Salary | Easy | Python3 | |
| 2 | The kth Factor of n | Medium | Python3 | |
| 3 | Longest Subarray of 1's After Deleting One Element | Medium | TLE | TODO |
| 4 | Parallel Courses II | Hard | Past Competition | DO AGAIN |
Weekly Contest 195: 2010 / 11468 🙈 LeetCode Crash.
| # | Title | Difficulty | Solution | Remark |
|---|---|---|---|---|
| 1 | Path Crossing | Easy | Python3 | |
| 2 | Check If Array Pairs Are Divisible by k | Medium | Python3 | |
| 3 | Number of Subsequences That Satisfy the Given Sum Condition | Medium | Naive MLE | |
| 4 | Max Value of Equation | Hard | TODO |
| # | Title | Difficulty | Solution | Remark |
|---|---|---|---|---|
| 1 | Can Make Arithmetic Progression From Sequence | Easy | Python3 | |
| 2 | Last Moment Before All Ants Fall Out of a Plank | Medium | Fuck thinking | |
| 3 | Count Submatrices With All Ones | Medium | Python3 | Do Again |
| 4 | Minimum Possible Integer After at Most K Adjacent Swaps On Digits | Hard | Not Even Open It | Hard! |