## 周賽專題 > **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)|