## 周赛专题 > **Tips:** > * 题目名称 → leetcode对应题目页面 > * 查看按钮 → 对应解题 ### [周赛 #193](https://leetcode-cn.com/contest/weekly-contest-193) |内容|标签|操作| |---|---|---| |`3 分`\-[一维数组的动态和](https://leetcode-cn.com/problems/running-sum-of-1d-array/)||待定| |`4 分`\-[不同整数的最少数目](https://leetcode-cn.com/problems/least-number-of-unique-integers-after-k-removals/) ||待定| |`5 分`\-[制作 m 束花所需的最少天数](https://leetcode-cn.com/problems/minimum-number-of-days-to-make-m-bouquets/) ||待定| |`6 分`\-[树节点的第 K 个祖先](https://leetcode-cn.com/problems/kth-ancestor-of-a-tree-node/)||待定| ### [双周赛 #28](https://leetcode-cn.com/contest/biweekly-contest-28) |内容|标签|操作| |---|---|---| |`3 分`\-[商品折扣后的最终价格](https://leetcode-cn.com/problems/final-prices-with-a-special-discount-in-a-shop/) ||[查看](./final-prices-with-a-special-discount-in-a-shop)| |`4 分`\-[子矩形查询](https://leetcode-cn.com/problems/subrectangle-queries/) ||待定| |`5 分`\-[找两个和为目标值且不重叠的子数组](https://leetcode-cn.com/problems/find-two-non-overlapping-sub-arrays-each-with-target-sum/) ||待定| |`7 分`\-[安排邮筒](https://leetcode-cn.com/problems/allocate-mailboxes/)||待定| ### [周赛 #192](https://leetcode-cn.com/contest/weekly-contest-192) |内容|标签|操作| |---|---|---| |`3 分`\-[重新排列数组](https://leetcode-cn.com/problems/shuffle-the-array/) ||[查看](./shuffle-the-array.md)| |`4 分`\-[数组中的 k 个最强值](https://leetcode-cn.com/problems/the-k-strongest-values-in-an-array/) |排序，双指针|[查看](./the-k-strongest-values-in-an-array.md)| |`5 分`\-[设计浏览器历史记录](https://leetcode-cn.com/problems/design-browser-history/) ||[查看](./design-browser-history.md)| |`6 分`\-[给房子涂色 III](https://leetcode-cn.com/problems/paint-house-iii/)|动态规划|[查看](./paint-house-iii.md)| ### [周赛 #191](https://leetcode-cn.com/contest/weekly-contest-191) |内容|标签|操作| |---|---|---| |`3 分`\-[数组中两元素的最大乘积](https://leetcode-cn.com/problems/maximum-product-of-two-elements-in-an-array/) ||[查看](./maximum-product-of-two-elements-in-an-array.md)| |`4 分`\-[切割后面积最大的蛋糕](https://leetcode-cn.com/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/) ||[查看](maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts.md)| |`5 分`\-[重新规划路线](https://leetcode-cn.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/) |BFS|[查看](./reorder-routes-to-make-all-paths-lead-to-the-city-zero.md)| |`7 分`\-[两个盒子中球的颜色数相同的概率](https://leetcode-cn.com/problems/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls/) |数学，递归，动态规划|[查看](./probability-of-a-two-boxes-having-the-same-number-of-distinct-balls.md)| ### [双周赛 #27](https://leetcode-cn.com/contest/biweekly-contest-27) |内容|标签|操作| |---|---|---| |`3 分`\-[通过翻转子数组使两个数组相等](https://leetcode-cn.com/problems/make-two-arrays-equal-by-reversing-sub-arrays/) ||[查看](./make-two-arrays-equal-by-reversing-sub-arrays.md)| |`4 分`\-[检查一个字符串是否包含所有长度为 K 的二进制子串](https://leetcode-cn.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/) ||[查看](./check-if-a-string-contains-all-binary-codes-of-size-k.md)| |`5 分`\-[课程安排 IV](https://leetcode-cn.com/problems/course-schedule-iv/)|图，Floyd算法|[查看](./course-schedule-iv.md)| |`6 分`\-[摘樱桃 II](https://leetcode-cn.com/problems/cherry-pickup-ii/)|动态规划|[查看](./cherry-pickup-ii.md)|