From b13b11542527a151b4e3bcdcc626828d8def2784 Mon Sep 17 00:00:00 2001 From: yanglbme Date: Mon, 30 May 2022 17:33:37 +0800 Subject: [PATCH] feat: add past contests --- .gitignore | 1 + README.md | 1 + README_EN.md | 1 + solution/CONTEST_README.md | 2345 +++++++++++++++++++++++++++++++++ solution/CONTEST_README_EN.md | 2345 +++++++++++++++++++++++++++++++++ solution/contest.py | 69 +- 6 files changed, 4759 insertions(+), 3 deletions(-) create mode 100644 solution/CONTEST_README.md create mode 100644 solution/CONTEST_README_EN.md diff --git a/.gitignore b/.gitignore index 8f4c66bf08..a52e040744 100644 --- a/.gitignore +++ b/.gitignore @@ -4,6 +4,7 @@ /node_modules /solution/result.json /solution/contest.json +/solution/contest_list.json /solution/raw.json /lcof/lcof.json /lcof/lcof_list.json diff --git a/README.md b/README.md index d6689b64a6..48c6d483bb 100644 --- a/README.md +++ b/README.md @@ -26,6 +26,7 @@ ## 算法全解 - [LeetCode](/solution/README.md) +- [往期竞赛合集](/solution/CONTEST_README.md) - [剑指 Offer（第 2 版）](/lcof/README.md) - [剑指 Offer（专项突击版）](/lcof2/README.md) - [程序员面试金典（第 6 版）](/lcci/README.md) diff --git a/README_EN.md b/README_EN.md index 181f1fae16..6d90a28d0b 100644 --- a/README_EN.md +++ b/README_EN.md @@ -26,6 +26,7 @@ Complete solutions to [LeetCode](https://leetcode.com/problemset/all/), [LCOF](h ## Solutions - [LeetCode](/solution/README_EN.md) +- [Past Contests](/solution/CONTEST_README_EN.md) - [LCOF: Coding Interviews, 2nd Edition](/lcof/README_EN.md) - [LCCI: Cracking the Coding Interview, 6th Edition](/lcci/README_EN.md) diff --git a/solution/CONTEST_README.md b/solution/CONTEST_README.md new file mode 100644 index 0000000000..7bd1a00568 --- /dev/null +++ b/solution/CONTEST_README.md @@ -0,0 +1,2345 @@ +# 力扣竞赛 + +[English Version](/solution/CONTEST_README_EN.md) + + +## 赛后估分网站 + +https://lcpredictor.herokuapp.com/ + +## 往期竞赛 + +#### 第 295 场周赛(2022-05-29 10:30, 90 分钟) + +- [2287. 重排字符形成目标字符串](/solution/2200-2299/2287.Rearrange%20Characters%20to%20Make%20Target%20String/README.md) +- [2288. 价格减免](/solution/2200-2299/2288.Apply%20Discount%20to%20Prices/README.md) +- [2289. 使数组按非递减顺序排列](/solution/2200-2299/2289.Steps%20to%20Make%20Array%20Non-decreasing/README.md) +- [2290. 到达角落需要移除障碍物的最小数目](/solution/2200-2299/2290.Minimum%20Obstacle%20Removal%20to%20Reach%20Corner/README.md) + + +#### 第 294 场周赛(2022-05-22 10:30, 90 分钟) + +- [2278. 字母在字符串中的百分比](/solution/2200-2299/2278.Percentage%20of%20Letter%20in%20String/README.md) +- [2279. 装满石头的背包的最大数量](/solution/2200-2299/2279.Maximum%20Bags%20With%20Full%20Capacity%20of%20Rocks/README.md) +- [2280. 表示一个折线图的最少线段数](/solution/2200-2299/2280.Minimum%20Lines%20to%20Represent%20a%20Line%20Chart/README.md) +- [2281. 巫师的总力量和](/solution/2200-2299/2281.Sum%20of%20Total%20Strength%20of%20Wizards/README.md) + + +#### 第 79 场双周赛(2022-05-28 22:30, 90 分钟) + +- [2283. 判断一个数的数字计数是否等于数位的值](/solution/2200-2299/2283.Check%20if%20Number%20Has%20Equal%20Digit%20Count%20and%20Digit%20Value/README.md) +- [2284. 最多单词数的发件人](/solution/2200-2299/2284.Sender%20With%20Largest%20Word%20Count/README.md) +- [2285. 道路的最大总重要性](/solution/2200-2299/2285.Maximum%20Total%20Importance%20of%20Roads/README.md) +- [2286. 以组为单位订音乐会的门票](/solution/2200-2299/2286.Booking%20Concert%20Tickets%20in%20Groups/README.md) + + +#### 第 293 场周赛(2022-05-15 10:30, 90 分钟) + +- [2273. 移除字母异位词后的结果数组](/solution/2200-2299/2273.Find%20Resultant%20Array%20After%20Removing%20Anagrams/README.md) +- [2274. 不含特殊楼层的最大连续楼层数](/solution/2200-2299/2274.Maximum%20Consecutive%20Floors%20Without%20Special%20Floors/README.md) +- [2275. 按位与结果大于零的最长组合](/solution/2200-2299/2275.Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/README.md) +- [2276. 统计区间中的整数数目](/solution/2200-2299/2276.Count%20Integers%20in%20Intervals/README.md) + + +#### 第 292 场周赛(2022-05-08 10:30, 90 分钟) + +- [2264. 字符串中最大的 3 位相同数字](/solution/2200-2299/2264.Largest%203-Same-Digit%20Number%20in%20String/README.md) +- [2265. 统计值等于子树平均值的节点数](/solution/2200-2299/2265.Count%20Nodes%20Equal%20to%20Average%20of%20Subtree/README.md) +- [2266. 统计打字方案数](/solution/2200-2299/2266.Count%20Number%20of%20Texts/README.md) +- [2267. 检查是否有合法括号字符串路径](/solution/2200-2299/2267.Check%20if%20There%20Is%20a%20Valid%20Parentheses%20String%20Path/README.md) + + +#### 第 78 场双周赛(2022-05-14 22:30, 90 分钟) + +- [2269. 找到一个数字的 K 美丽值](/solution/2200-2299/2269.Find%20the%20K-Beauty%20of%20a%20Number/README.md) +- [2270. 分割数组的方案数](/solution/2200-2299/2270.Number%20of%20Ways%20to%20Split%20Array/README.md) +- [2271. 毯子覆盖的最多白色砖块数](/solution/2200-2299/2271.Maximum%20White%20Tiles%20Covered%20by%20a%20Carpet/README.md) +- [2272. 最大波动的子字符串](/solution/2200-2299/2272.Substring%20With%20Largest%20Variance/README.md) + + +#### 第 291 场周赛(2022-05-01 10:30, 90 分钟) + +- [2259. 移除指定数字得到的最大结果](/solution/2200-2299/2259.Remove%20Digit%20From%20Number%20to%20Maximize%20Result/README.md) +- [2260. 必须拿起的最小连续卡牌数](/solution/2200-2299/2260.Minimum%20Consecutive%20Cards%20to%20Pick%20Up/README.md) +- [2261. 含最多 K 个可整除元素的子数组](/solution/2200-2299/2261.K%20Divisible%20Elements%20Subarrays/README.md) +- [2262. 字符串的总引力](/solution/2200-2299/2262.Total%20Appeal%20of%20A%20String/README.md) + + +#### 第 290 场周赛(2022-04-24 10:30, 90 分钟) + +- [2248. 多个数组求交集](/solution/2200-2299/2248.Intersection%20of%20Multiple%20Arrays/README.md) +- [2249. 统计圆内格点数目](/solution/2200-2299/2249.Count%20Lattice%20Points%20Inside%20a%20Circle/README.md) +- [2250. 统计包含每个点的矩形数目](/solution/2200-2299/2250.Count%20Number%20of%20Rectangles%20Containing%20Each%20Point/README.md) +- [2251. 花期内花的数目](/solution/2200-2299/2251.Number%20of%20Flowers%20in%20Full%20Bloom/README.md) + + +#### 第 77 场双周赛(2022-04-30 22:30, 90 分钟) + +- [2255. 统计是给定字符串前缀的字符串数目](/solution/2200-2299/2255.Count%20Prefixes%20of%20a%20Given%20String/README.md) +- [2256. 最小平均差](/solution/2200-2299/2256.Minimum%20Average%20Difference/README.md) +- [2257. 统计网格图中没有被保卫的格子数](/solution/2200-2299/2257.Count%20Unguarded%20Cells%20in%20the%20Grid/README.md) +- [2258. 逃离火灾](/solution/2200-2299/2258.Escape%20the%20Spreading%20Fire/README.md) + + +#### 第 289 场周赛(2022-04-17 10:30, 90 分钟) + +- [2243. 计算字符串的数字和](/solution/2200-2299/2243.Calculate%20Digit%20Sum%20of%20a%20String/README.md) +- [2244. 完成所有任务需要的最少轮数](/solution/2200-2299/2244.Minimum%20Rounds%20to%20Complete%20All%20Tasks/README.md) +- [2245. 转角路径的乘积中最多能有几个尾随零](/solution/2200-2299/2245.Maximum%20Trailing%20Zeros%20in%20a%20Cornered%20Path/README.md) +- [2246. 相邻字符不同的最长路径](/solution/2200-2299/2246.Longest%20Path%20With%20Different%20Adjacent%20Characters/README.md) + + +#### 第 288 场周赛(2022-04-10 10:30, 90 分钟) + +- [2231. 按奇偶性交换后的最大数字](/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README.md) +- [2232. 向表达式添加括号后的最小结果](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README.md) +- [2233. K 次增加后的最大乘积](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README.md) +- [2234. 花园的最大总美丽值](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README.md) + + +#### 第 76 场双周赛(2022-04-16 22:30, 90 分钟) + +- [2239. 找到最接近 0 的数字](/solution/2200-2299/2239.Find%20Closest%20Number%20to%20Zero/README.md) +- [2240. 买钢笔和铅笔的方案数](/solution/2200-2299/2240.Number%20of%20Ways%20to%20Buy%20Pens%20and%20Pencils/README.md) +- [2241. 设计一个 ATM 机器](/solution/2200-2299/2241.Design%20an%20ATM%20Machine/README.md) +- [2242. 节点序列的最大得分](/solution/2200-2299/2242.Maximum%20Score%20of%20a%20Node%20Sequence/README.md) + + +#### 第 287 场周赛(2022-04-03 10:30, 90 分钟) + +- [2224. 转化时间需要的最少操作数](/solution/2200-2299/2224.Minimum%20Number%20of%20Operations%20to%20Convert%20Time/README.md) +- [2225. 找出输掉零场或一场比赛的玩家](/solution/2200-2299/2225.Find%20Players%20With%20Zero%20or%20One%20Losses/README.md) +- [2226. 每个小孩最多能分到多少糖果](/solution/2200-2299/2226.Maximum%20Candies%20Allocated%20to%20K%20Children/README.md) +- [2227. 加密解密字符串](/solution/2200-2299/2227.Encrypt%20and%20Decrypt%20Strings/README.md) + + +#### 第 286 场周赛(2022-03-27 10:30, 90 分钟) + +- [2215. 找出两数组的不同](/solution/2200-2299/2215.Find%20the%20Difference%20of%20Two%20Arrays/README.md) +- [2216. 美化数组的最少删除数](/solution/2200-2299/2216.Minimum%20Deletions%20to%20Make%20Array%20Beautiful/README.md) +- [2217. 找到指定长度的回文数](/solution/2200-2299/2217.Find%20Palindrome%20With%20Fixed%20Length/README.md) +- [2218. 从栈中取出 K 个硬币的最大面值和](/solution/2200-2299/2218.Maximum%20Value%20of%20K%20Coins%20From%20Piles/README.md) + + +#### 第 75 场双周赛(2022-04-02 22:30, 90 分钟) + +- [2220. 转换数字的最少位翻转次数](/solution/2200-2299/2220.Minimum%20Bit%20Flips%20to%20Convert%20Number/README.md) +- [2221. 数组的三角和](/solution/2200-2299/2221.Find%20Triangular%20Sum%20of%20an%20Array/README.md) +- [2222. 选择建筑的方案数](/solution/2200-2299/2222.Number%20of%20Ways%20to%20Select%20Buildings/README.md) +- [2223. 构造字符串的总得分和](/solution/2200-2299/2223.Sum%20of%20Scores%20of%20Built%20Strings/README.md) + + +#### 第 285 场周赛(2022-03-20 10:30, 90 分钟) + +- [2210. 统计数组中峰和谷的数量](/solution/2200-2299/2210.Count%20Hills%20and%20Valleys%20in%20an%20Array/README.md) +- [2211. 统计道路上的碰撞次数](/solution/2200-2299/2211.Count%20Collisions%20on%20a%20Road/README.md) +- [2212. 射箭比赛中的最大得分](/solution/2200-2299/2212.Maximum%20Points%20in%20an%20Archery%20Competition/README.md) +- [2213. 由单个字符重复的最长子字符串](/solution/2200-2299/2213.Longest%20Substring%20of%20One%20Repeating%20Character/README.md) + + +#### 第 284 场周赛(2022-03-13 10:30, 90 分钟) + +- [2200. 找出数组中的所有 K 近邻下标](/solution/2200-2299/2200.Find%20All%20K-Distant%20Indices%20in%20an%20Array/README.md) +- [2201. 统计可以提取的工件](/solution/2200-2299/2201.Count%20Artifacts%20That%20Can%20Be%20Extracted/README.md) +- [2202. K 次操作后最大化顶端元素](/solution/2200-2299/2202.Maximize%20the%20Topmost%20Element%20After%20K%20Moves/README.md) +- [2203. 得到要求路径的最小带权子图](/solution/2200-2299/2203.Minimum%20Weighted%20Subgraph%20With%20the%20Required%20Paths/README.md) + + +#### 第 74 场双周赛(2022-03-19 22:30, 90 分钟) + +- [2206. 将数组划分成相等数对](/solution/2200-2299/2206.Divide%20Array%20Into%20Equal%20Pairs/README.md) +- [2207. 字符串中最多数目的子字符串](/solution/2200-2299/2207.Maximize%20Number%20of%20Subsequences%20in%20a%20String/README.md) +- [2208. 将数组和减半的最少操作次数](/solution/2200-2299/2208.Minimum%20Operations%20to%20Halve%20Array%20Sum/README.md) +- [2209. 用地毯覆盖后的最少白色砖块](/solution/2200-2299/2209.Minimum%20White%20Tiles%20After%20Covering%20With%20Carpets/README.md) + + +#### 第 283 场周赛(2022-03-06 10:30, 90 分钟) + +- [2194. Excel 表中某个范围内的单元格](/solution/2100-2199/2194.Cells%20in%20a%20Range%20on%20an%20Excel%20Sheet/README.md) +- [2195. 向数组中追加 K 个整数](/solution/2100-2199/2195.Append%20K%20Integers%20With%20Minimal%20Sum/README.md) +- [2196. 根据描述创建二叉树](/solution/2100-2199/2196.Create%20Binary%20Tree%20From%20Descriptions/README.md) +- [2197. 替换数组中的非互质数](/solution/2100-2199/2197.Replace%20Non-Coprime%20Numbers%20in%20Array/README.md) + + +#### 第 282 场周赛(2022-02-27 10:30, 90 分钟) + +- [2185. 统计包含给定前缀的字符串](/solution/2100-2199/2185.Counting%20Words%20With%20a%20Given%20Prefix/README.md) +- [2186. 使两字符串互为字母异位词的最少步骤数](/solution/2100-2199/2186.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram%20II/README.md) +- [2187. 完成旅途的最少时间](/solution/2100-2199/2187.Minimum%20Time%20to%20Complete%20Trips/README.md) +- [2188. 完成比赛的最少时间](/solution/2100-2199/2188.Minimum%20Time%20to%20Finish%20the%20Race/README.md) + + +#### 第 73 场双周赛(2022-03-05 22:30, 90 分钟) + +- [2190. 数组中紧跟 key 之后出现最频繁的数字](/solution/2100-2199/2190.Most%20Frequent%20Number%20Following%20Key%20In%20an%20Array/README.md) +- [2191. 将杂乱无章的数字排序](/solution/2100-2199/2191.Sort%20the%20Jumbled%20Numbers/README.md) +- [2192. 有向无环图中一个节点的所有祖先](/solution/2100-2199/2192.All%20Ancestors%20of%20a%20Node%20in%20a%20Directed%20Acyclic%20Graph/README.md) +- [2193. 得到回文串的最少操作次数](/solution/2100-2199/2193.Minimum%20Number%20of%20Moves%20to%20Make%20Palindrome/README.md) + + +#### 第 281 场周赛(2022-02-20 10:30, 100 分钟) + +- [2180. 统计各位数字之和为偶数的整数个数](/solution/2100-2199/2180.Count%20Integers%20With%20Even%20Digit%20Sum/README.md) +- [2181. 合并零之间的节点](/solution/2100-2199/2181.Merge%20Nodes%20in%20Between%20Zeros/README.md) +- [2182. 构造限制重复的字符串](/solution/2100-2199/2182.Construct%20String%20With%20Repeat%20Limit/README.md) +- [2183. 统计可以被 K 整除的下标对数目](/solution/2100-2199/2183.Count%20Array%20Pairs%20Divisible%20by%20K/README.md) + + +#### 第 280 场周赛(2022-02-13 10:30, 90 分钟) + +- [2169. 得到 0 的操作数](/solution/2100-2199/2169.Count%20Operations%20to%20Obtain%20Zero/README.md) +- [2170. 使数组变成交替数组的最少操作数](/solution/2100-2199/2170.Minimum%20Operations%20to%20Make%20the%20Array%20Alternating/README.md) +- [2171. 拿出最少数目的魔法豆](/solution/2100-2199/2171.Removing%20Minimum%20Number%20of%20Magic%20Beans/README.md) +- [2172. 数组的最大与和](/solution/2100-2199/2172.Maximum%20AND%20Sum%20of%20Array/README.md) + + +#### 第 72 场双周赛(2022-02-19 22:30, 90 分钟) + +- [2176. 统计数组中相等且可以被整除的数对](/solution/2100-2199/2176.Count%20Equal%20and%20Divisible%20Pairs%20in%20an%20Array/README.md) +- [2177. 找到和为给定整数的三个连续整数](/solution/2100-2199/2177.Find%20Three%20Consecutive%20Integers%20That%20Sum%20to%20a%20Given%20Number/README.md) +- [2178. 拆分成最多数目的正偶数之和](/solution/2100-2199/2178.Maximum%20Split%20of%20Positive%20Even%20Integers/README.md) +- [2179. 统计数组中好三元组数目](/solution/2100-2199/2179.Count%20Good%20Triplets%20in%20an%20Array/README.md) + + +#### 第 279 场周赛(2022-02-06 10:30, 90 分钟) + +- [2164. 对奇偶下标分别排序](/solution/2100-2199/2164.Sort%20Even%20and%20Odd%20Indices%20Independently/README.md) +- [2165. 重排数字的最小值](/solution/2100-2199/2165.Smallest%20Value%20of%20the%20Rearranged%20Number/README.md) +- [2166. 设计位集](/solution/2100-2199/2166.Design%20Bitset/README.md) +- [2167. 移除所有载有违禁货物车厢所需的最少时间](/solution/2100-2199/2167.Minimum%20Time%20to%20Remove%20All%20Cars%20Containing%20Illegal%20Goods/README.md) + + +#### 第 278 场周赛(2022-01-30 10:30, 90 分钟) + +- [2154. 将找到的值乘以 2](/solution/2100-2199/2154.Keep%20Multiplying%20Found%20Values%20by%20Two/README.md) +- [2155. 分组得分最高的所有下标](/solution/2100-2199/2155.All%20Divisions%20With%20the%20Highest%20Score%20of%20a%20Binary%20Array/README.md) +- [2156. 查找给定哈希值的子串](/solution/2100-2199/2156.Find%20Substring%20With%20Given%20Hash%20Value/README.md) +- [2157. 字符串分组](/solution/2100-2199/2157.Groups%20of%20Strings/README.md) + + +#### 第 71 场双周赛(2022-02-05 22:30, 90 分钟) + +- [2160. 拆分数位后四位数字的最小和](/solution/2100-2199/2160.Minimum%20Sum%20of%20Four%20Digit%20Number%20After%20Splitting%20Digits/README.md) +- [2161. 根据给定数字划分数组](/solution/2100-2199/2161.Partition%20Array%20According%20to%20Given%20Pivot/README.md) +- [2162. 设置时间的最少代价](/solution/2100-2199/2162.Minimum%20Cost%20to%20Set%20Cooking%20Time/README.md) +- [2163. 删除元素后和的最小差值](/solution/2100-2199/2163.Minimum%20Difference%20in%20Sums%20After%20Removal%20of%20Elements/README.md) + + +#### 第 277 场周赛(2022-01-23 10:30, 90 分钟) + +- [2148. 元素计数](/solution/2100-2199/2148.Count%20Elements%20With%20Strictly%20Smaller%20and%20Greater%20Elements/README.md) +- [2149. 按符号重排数组](/solution/2100-2199/2149.Rearrange%20Array%20Elements%20by%20Sign/README.md) +- [2150. 找出数组中的所有孤独数字](/solution/2100-2199/2150.Find%20All%20Lonely%20Numbers%20in%20the%20Array/README.md) +- [2151. 基于陈述统计最多好人数](/solution/2100-2199/2151.Maximum%20Good%20People%20Based%20on%20Statements/README.md) + + +#### 第 276 场周赛(2022-01-16 10:30, 90 分钟) + +- [2138. 将字符串拆分为若干长度为 k 的组](/solution/2100-2199/2138.Divide%20a%20String%20Into%20Groups%20of%20Size%20k/README.md) +- [2139. 得到目标值的最少行动次数](/solution/2100-2199/2139.Minimum%20Moves%20to%20Reach%20Target%20Score/README.md) +- [2140. 解决智力问题](/solution/2100-2199/2140.Solving%20Questions%20With%20Brainpower/README.md) +- [2141. 同时运行 N 台电脑的最长时间](/solution/2100-2199/2141.Maximum%20Running%20Time%20of%20N%20Computers/README.md) + + +#### 第 70 场双周赛(2022-01-22 22:30, 90 分钟) + +- [2144. 打折购买糖果的最小开销](/solution/2100-2199/2144.Minimum%20Cost%20of%20Buying%20Candies%20With%20Discount/README.md) +- [2145. 统计隐藏数组数目](/solution/2100-2199/2145.Count%20the%20Hidden%20Sequences/README.md) +- [2146. 价格范围内最高排名的 K 样物品](/solution/2100-2199/2146.K%20Highest%20Ranked%20Items%20Within%20a%20Price%20Range/README.md) +- [2147. 分隔长廊的方案数](/solution/2100-2199/2147.Number%20of%20Ways%20to%20Divide%20a%20Long%20Corridor/README.md) + + +#### 第 275 场周赛(2022-01-09 10:30, 90 分钟) + +- [2133. 检查是否每一行每一列都包含全部整数](/solution/2100-2199/2133.Check%20if%20Every%20Row%20and%20Column%20Contains%20All%20Numbers/README.md) +- [2134. 最少交换次数来组合所有的 1 II](/solution/2100-2199/2134.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together%20II/README.md) +- [2135. 统计追加字母可以获得的单词数](/solution/2100-2199/2135.Count%20Words%20Obtained%20After%20Adding%20a%20Letter/README.md) +- [2136. 全部开花的最早一天](/solution/2100-2199/2136.Earliest%20Possible%20Day%20of%20Full%20Bloom/README.md) + + +#### 第 274 场周赛(2022-01-02 10:30, 90 分钟) + +- [2124. 检查是否所有 A 都在 B 之前](/solution/2100-2199/2124.Check%20if%20All%20A%27s%20Appears%20Before%20All%20B%27s/README.md) +- [2125. 银行中的激光束数量](/solution/2100-2199/2125.Number%20of%20Laser%20Beams%20in%20a%20Bank/README.md) +- [2126. 摧毁小行星](/solution/2100-2199/2126.Destroying%20Asteroids/README.md) +- [2127. 参加会议的最多员工数](/solution/2100-2199/2127.Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/README.md) + + +#### 第 69 场双周赛(2022-01-08 22:30, 90 分钟) + +- [2129. 将标题首字母大写](/solution/2100-2199/2129.Capitalize%20the%20Title/README.md) +- [2130. 链表最大孪生和](/solution/2100-2199/2130.Maximum%20Twin%20Sum%20of%20a%20Linked%20List/README.md) +- [2131. 连接两字母单词得到的最长回文串](/solution/2100-2199/2131.Longest%20Palindrome%20by%20Concatenating%20Two%20Letter%20Words/README.md) +- [2132. 用邮票贴满网格图](/solution/2100-2199/2132.Stamping%20the%20Grid/README.md) + + +#### 第 273 场周赛(2021-12-26 10:30, 90 分钟) + +- [2119. 反转两次的数字](/solution/2100-2199/2119.A%20Number%20After%20a%20Double%20Reversal/README.md) +- [2120. 执行所有后缀指令](/solution/2100-2199/2120.Execution%20of%20All%20Suffix%20Instructions%20Staying%20in%20a%20Grid/README.md) +- [2121. 相同元素的间隔之和](/solution/2100-2199/2121.Intervals%20Between%20Identical%20Elements/README.md) +- [2122. 还原原数组](/solution/2100-2199/2122.Recover%20the%20Original%20Array/README.md) + + +#### 第 272 场周赛(2021-12-19 10:30, 90 分钟) + +- [2108. 找出数组中的第一个回文字符串](/solution/2100-2199/2108.Find%20First%20Palindromic%20String%20in%20the%20Array/README.md) +- [2109. 向字符串添加空格](/solution/2100-2199/2109.Adding%20Spaces%20to%20a%20String/README.md) +- [2110. 股票平滑下跌阶段的数目](/solution/2100-2199/2110.Number%20of%20Smooth%20Descent%20Periods%20of%20a%20Stock/README.md) +- [2111. 使数组 K 递增的最少操作次数](/solution/2100-2199/2111.Minimum%20Operations%20to%20Make%20the%20Array%20K-Increasing/README.md) + + +#### 第 68 场双周赛(2021-12-25 22:30, 90 分钟) + +- [2114. 句子中的最多单词数](/solution/2100-2199/2114.Maximum%20Number%20of%20Words%20Found%20in%20Sentences/README.md) +- [2115. 从给定原材料中找到所有可以做出的菜](/solution/2100-2199/2115.Find%20All%20Possible%20Recipes%20from%20Given%20Supplies/README.md) +- [2116. 判断一个括号字符串是否有效](/solution/2100-2199/2116.Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/README.md) +- [2117. 一个区间内所有数乘积的缩写](/solution/2100-2199/2117.Abbreviating%20the%20Product%20of%20a%20Range/README.md) + + +#### 第 271 场周赛(2021-12-12 10:30, 90 分钟) + +- [2103. 环和杆](/solution/2100-2199/2103.Rings%20and%20Rods/README.md) +- [2104. 子数组范围和](/solution/2100-2199/2104.Sum%20of%20Subarray%20Ranges/README.md) +- [2105. 给植物浇水 II](/solution/2100-2199/2105.Watering%20Plants%20II/README.md) +- [2106. 摘水果](/solution/2100-2199/2106.Maximum%20Fruits%20Harvested%20After%20at%20Most%20K%20Steps/README.md) + + +#### 第 270 场周赛(2021-12-05 10:30, 90 分钟) + +- [2094. 找出 3 位偶数](/solution/2000-2099/2094.Finding%203-Digit%20Even%20Numbers/README.md) +- [2095. 删除链表的中间节点](/solution/2000-2099/2095.Delete%20the%20Middle%20Node%20of%20a%20Linked%20List/README.md) +- [2096. 从二叉树一个节点到另一个节点每一步的方向](/solution/2000-2099/2096.Step-By-Step%20Directions%20From%20a%20Binary%20Tree%20Node%20to%20Another/README.md) +- [2097. 合法重新排列数对](/solution/2000-2099/2097.Valid%20Arrangement%20of%20Pairs/README.md) + + +#### 第 67 场双周赛(2021-12-11 22:30, 90 分钟) + +- [2099. 找到和最大的长度为 K 的子序列](/solution/2000-2099/2099.Find%20Subsequence%20of%20Length%20K%20With%20the%20Largest%20Sum/README.md) +- [2100. 适合打劫银行的日子](/solution/2100-2199/2100.Find%20Good%20Days%20to%20Rob%20the%20Bank/README.md) +- [2101. 引爆最多的炸弹](/solution/2100-2199/2101.Detonate%20the%20Maximum%20Bombs/README.md) +- [2102. 序列顺序查询](/solution/2100-2199/2102.Sequentially%20Ordinal%20Rank%20Tracker/README.md) + + +#### 第 269 场周赛(2021-11-28 10:30, 90 分钟) + +- [2089. 找出数组排序后的目标下标](/solution/2000-2099/2089.Find%20Target%20Indices%20After%20Sorting%20Array/README.md) +- [2090. 半径为 k 的子数组平均值](/solution/2000-2099/2090.K%20Radius%20Subarray%20Averages/README.md) +- [2091. 从数组中移除最大值和最小值](/solution/2000-2099/2091.Removing%20Minimum%20and%20Maximum%20From%20Array/README.md) +- [2092. 找出知晓秘密的所有专家](/solution/2000-2099/2092.Find%20All%20People%20With%20Secret/README.md) + + +#### 第 268 场周赛(2021-11-21 10:30, 90 分钟) + +- [2078. 两栋颜色不同且距离最远的房子](/solution/2000-2099/2078.Two%20Furthest%20Houses%20With%20Different%20Colors/README.md) +- [2079. 给植物浇水](/solution/2000-2099/2079.Watering%20Plants/README.md) +- [2080. 区间内查询数字的频率](/solution/2000-2099/2080.Range%20Frequency%20Queries/README.md) +- [2081. k 镜像数字的和](/solution/2000-2099/2081.Sum%20of%20k-Mirror%20Numbers/README.md) + + +#### 第 66 场双周赛(2021-11-27 22:30, 90 分钟) + +- [2085. 统计出现过一次的公共字符串](/solution/2000-2099/2085.Count%20Common%20Words%20With%20One%20Occurrence/README.md) +- [2086. 从房屋收集雨水需要的最少水桶数](/solution/2000-2099/2086.Minimum%20Number%20of%20Buckets%20Required%20to%20Collect%20Rainwater%20from%20Houses/README.md) +- [2087. 网格图中机器人回家的最小代价](/solution/2000-2099/2087.Minimum%20Cost%20Homecoming%20of%20a%20Robot%20in%20a%20Grid/README.md) +- [2088. 统计农场中肥沃金字塔的数目](/solution/2000-2099/2088.Count%20Fertile%20Pyramids%20in%20a%20Land/README.md) + + +#### 第 267 场周赛(2021-11-14 10:30, 90 分钟) + +- [2073. 买票需要的时间](/solution/2000-2099/2073.Time%20Needed%20to%20Buy%20Tickets/README.md) +- [2074. 反转偶数长度组的节点](/solution/2000-2099/2074.Reverse%20Nodes%20in%20Even%20Length%20Groups/README.md) +- [2075. 解码斜向换位密码](/solution/2000-2099/2075.Decode%20the%20Slanted%20Ciphertext/README.md) +- [2076. 处理含限制条件的好友请求](/solution/2000-2099/2076.Process%20Restricted%20Friend%20Requests/README.md) + + +#### 第 266 场周赛(2021-11-07 10:30, 90 分钟) + +- [2062. 统计字符串中的元音子字符串](/solution/2000-2099/2062.Count%20Vowel%20Substrings%20of%20a%20String/README.md) +- [2063. 所有子字符串中的元音](/solution/2000-2099/2063.Vowels%20of%20All%20Substrings/README.md) +- [2064. 分配给商店的最多商品的最小值](/solution/2000-2099/2064.Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/README.md) +- [2065. 最大化一张图中的路径价值](/solution/2000-2099/2065.Maximum%20Path%20Quality%20of%20a%20Graph/README.md) + + +#### 第 65 场双周赛(2021-11-13 22:30, 90 分钟) + +- [2068. 检查两个字符串是否几乎相等](/solution/2000-2099/2068.Check%20Whether%20Two%20Strings%20are%20Almost%20Equivalent/README.md) +- [2069. 模拟行走机器人 II](/solution/2000-2099/2069.Walking%20Robot%20Simulation%20II/README.md) +- [2070. 每一个查询的最大美丽值](/solution/2000-2099/2070.Most%20Beautiful%20Item%20for%20Each%20Query/README.md) +- [2071. 你可以安排的最多任务数目](/solution/2000-2099/2071.Maximum%20Number%20of%20Tasks%20You%20Can%20Assign/README.md) + + +#### 第 265 场周赛(2021-10-31 10:30, 90 分钟) + +- [2057. 值相等的最小索引](/solution/2000-2099/2057.Smallest%20Index%20With%20Equal%20Value/README.md) +- [2058. 找出临界点之间的最小和最大距离](/solution/2000-2099/2058.Find%20the%20Minimum%20and%20Maximum%20Number%20of%20Nodes%20Between%20Critical%20Points/README.md) +- [2059. 转化数字的最小运算数](/solution/2000-2099/2059.Minimum%20Operations%20to%20Convert%20Number/README.md) +- [2060. 同源字符串检测](/solution/2000-2099/2060.Check%20if%20an%20Original%20String%20Exists%20Given%20Two%20Encoded%20Strings/README.md) + + +#### 第 264 场周赛(2021-10-24 10:30, 90 分钟) + +- [2047. 句子中的有效单词数](/solution/2000-2099/2047.Number%20of%20Valid%20Words%20in%20a%20Sentence/README.md) +- [2048. 下一个更大的数值平衡数](/solution/2000-2099/2048.Next%20Greater%20Numerically%20Balanced%20Number/README.md) +- [2049. 统计最高分的节点数目](/solution/2000-2099/2049.Count%20Nodes%20With%20the%20Highest%20Score/README.md) +- [2050. 并行课程 III](/solution/2000-2099/2050.Parallel%20Courses%20III/README.md) + + +#### 第 64 场双周赛(2021-10-30 22:30, 90 分钟) + +- [2053. 数组中第 K 个独一无二的字符串](/solution/2000-2099/2053.Kth%20Distinct%20String%20in%20an%20Array/README.md) +- [2054. 两个最好的不重叠活动](/solution/2000-2099/2054.Two%20Best%20Non-Overlapping%20Events/README.md) +- [2055. 蜡烛之间的盘子](/solution/2000-2099/2055.Plates%20Between%20Candles/README.md) +- [2056. 棋盘上有效移动组合的数目](/solution/2000-2099/2056.Number%20of%20Valid%20Move%20Combinations%20On%20Chessboard/README.md) + + +#### 第 263 场周赛(2021-10-17 10:30, 90 分钟) + +- [2042. 检查句子中的数字是否递增](/solution/2000-2099/2042.Check%20if%20Numbers%20Are%20Ascending%20in%20a%20Sentence/README.md) +- [2043. 简易银行系统](/solution/2000-2099/2043.Simple%20Bank%20System/README.md) +- [2044. 统计按位或能得到最大值的子集数目](/solution/2000-2099/2044.Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets/README.md) +- [2045. 到达目的地的第二短时间](/solution/2000-2099/2045.Second%20Minimum%20Time%20to%20Reach%20Destination/README.md) + + +#### 第 262 场周赛(2021-10-10 10:30, 90 分钟) + +- [2032. 至少在两个数组中出现的值](/solution/2000-2099/2032.Two%20Out%20of%20Three/README.md) +- [2033. 获取单值网格的最小操作数](/solution/2000-2099/2033.Minimum%20Operations%20to%20Make%20a%20Uni-Value%20Grid/README.md) +- [2034. 股票价格波动](/solution/2000-2099/2034.Stock%20Price%20Fluctuation/README.md) +- [2035. 将数组分成两个数组并最小化数组和的差](/solution/2000-2099/2035.Partition%20Array%20Into%20Two%20Arrays%20to%20Minimize%20Sum%20Difference/README.md) + + +#### 第 63 场双周赛(2021-10-16 22:30, 90 分钟) + +- [2037. 使每位学生都有座位的最少移动次数](/solution/2000-2099/2037.Minimum%20Number%20of%20Moves%20to%20Seat%20Everyone/README.md) +- [2038. 如果相邻两个颜色均相同则删除当前颜色](/solution/2000-2099/2038.Remove%20Colored%20Pieces%20if%20Both%20Neighbors%20are%20the%20Same%20Color/README.md) +- [2039. 网络空闲的时刻](/solution/2000-2099/2039.The%20Time%20When%20the%20Network%20Becomes%20Idle/README.md) +- [2040. 两个有序数组的第 K 小乘积](/solution/2000-2099/2040.Kth%20Smallest%20Product%20of%20Two%20Sorted%20Arrays/README.md) + + +#### 第 261 场周赛(2021-10-03 10:30, 90 分钟) + +- [2027. 转换字符串的最少操作次数](/solution/2000-2099/2027.Minimum%20Moves%20to%20Convert%20String/README.md) +- [2028. 找出缺失的观测数据](/solution/2000-2099/2028.Find%20Missing%20Observations/README.md) +- [2029. 石子游戏 IX](/solution/2000-2099/2029.Stone%20Game%20IX/README.md) +- [2030. 含特定字母的最小子序列](/solution/2000-2099/2030.Smallest%20K-Length%20Subsequence%20With%20Occurrences%20of%20a%20Letter/README.md) + + +#### 第 260 场周赛(2021-09-26 10:30, 90 分钟) + +- [2016. 增量元素之间的最大差值](/solution/2000-2099/2016.Maximum%20Difference%20Between%20Increasing%20Elements/README.md) +- [2017. 网格游戏](/solution/2000-2099/2017.Grid%20Game/README.md) +- [2018. 判断单词是否能放入填字游戏内](/solution/2000-2099/2018.Check%20if%20Word%20Can%20Be%20Placed%20In%20Crossword/README.md) +- [2019. 解出数学表达式的学生分数](/solution/2000-2099/2019.The%20Score%20of%20Students%20Solving%20Math%20Expression/README.md) + + +#### 第 62 场双周赛(2021-10-02 22:30, 90 分钟) + +- [2022. 将一维数组转变成二维数组](/solution/2000-2099/2022.Convert%201D%20Array%20Into%202D%20Array/README.md) +- [2023. 连接后等于目标字符串的字符串对](/solution/2000-2099/2023.Number%20of%20Pairs%20of%20Strings%20With%20Concatenation%20Equal%20to%20Target/README.md) +- [2024. 考试的最大困扰度](/solution/2000-2099/2024.Maximize%20the%20Confusion%20of%20an%20Exam/README.md) +- [2025. 分割数组的最多方案数](/solution/2000-2099/2025.Maximum%20Number%20of%20Ways%20to%20Partition%20an%20Array/README.md) + + +#### 第 259 场周赛(2021-09-19 10:30, 90 分钟) + +- [2011. 执行操作后的变量值](/solution/2000-2099/2011.Final%20Value%20of%20Variable%20After%20Performing%20Operations/README.md) +- [2012. 数组美丽值求和](/solution/2000-2099/2012.Sum%20of%20Beauty%20in%20the%20Array/README.md) +- [2013. 检测正方形](/solution/2000-2099/2013.Detect%20Squares/README.md) +- [2014. 重复 K 次的最长子序列](/solution/2000-2099/2014.Longest%20Subsequence%20Repeated%20k%20Times/README.md) + + +#### 第 258 场周赛(2021-09-12 10:30, 90 分钟) + +- [2000. 反转单词前缀](/solution/2000-2099/2000.Reverse%20Prefix%20of%20Word/README.md) +- [2001. 可互换矩形的组数](/solution/2000-2099/2001.Number%20of%20Pairs%20of%20Interchangeable%20Rectangles/README.md) +- [2002. 两个回文子序列长度的最大乘积](/solution/2000-2099/2002.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Subsequences/README.md) +- [2003. 每棵子树内缺失的最小基因值](/solution/2000-2099/2003.Smallest%20Missing%20Genetic%20Value%20in%20Each%20Subtree/README.md) + + +#### 第 61 场双周赛(2021-09-18 22:30, 90 分钟) + +- [2006. 差的绝对值为 K 的数对数目](/solution/2000-2099/2006.Count%20Number%20of%20Pairs%20With%20Absolute%20Difference%20K/README.md) +- [2007. 从双倍数组中还原原数组](/solution/2000-2099/2007.Find%20Original%20Array%20From%20Doubled%20Array/README.md) +- [2008. 出租车的最大盈利](/solution/2000-2099/2008.Maximum%20Earnings%20From%20Taxi/README.md) +- [2009. 使数组连续的最少操作数](/solution/2000-2099/2009.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Continuous/README.md) + + +#### 第 257 场周赛(2021-09-05 10:30, 90 分钟) + +- [1995. 统计特殊四元组](/solution/1900-1999/1995.Count%20Special%20Quadruplets/README.md) +- [1996. 游戏中弱角色的数量](/solution/1900-1999/1996.The%20Number%20of%20Weak%20Characters%20in%20the%20Game/README.md) +- [1997. 访问完所有房间的第一天](/solution/1900-1999/1997.First%20Day%20Where%20You%20Have%20Been%20in%20All%20the%20Rooms/README.md) +- [1998. 数组的最大公因数排序](/solution/1900-1999/1998.GCD%20Sort%20of%20an%20Array/README.md) + + +#### 第 256 场周赛(2021-08-29 10:30, 90 分钟) + +- [1984. 学生分数的最小差值](/solution/1900-1999/1984.Minimum%20Difference%20Between%20Highest%20and%20Lowest%20of%20K%20Scores/README.md) +- [1985. 找出数组中的第 K 大整数](/solution/1900-1999/1985.Find%20the%20Kth%20Largest%20Integer%20in%20the%20Array/README.md) +- [1986. 完成任务的最少工作时间段](/solution/1900-1999/1986.Minimum%20Number%20of%20Work%20Sessions%20to%20Finish%20the%20Tasks/README.md) +- [1987. 不同的好子序列数目](/solution/1900-1999/1987.Number%20of%20Unique%20Good%20Subsequences/README.md) + + +#### 第 60 场双周赛(2021-09-04 22:30, 90 分钟) + +- [1991. 找到数组的中间位置](/solution/1900-1999/1991.Find%20the%20Middle%20Index%20in%20Array/README.md) +- [1992. 找到所有的农场组](/solution/1900-1999/1992.Find%20All%20Groups%20of%20Farmland/README.md) +- [1993. 树上的操作](/solution/1900-1999/1993.Operations%20on%20Tree/README.md) +- [1994. 好子集的数目](/solution/1900-1999/1994.The%20Number%20of%20Good%20Subsets/README.md) + + +#### 第 255 场周赛(2021-08-22 10:30, 90 分钟) + +- [1979. 找出数组的最大公约数](/solution/1900-1999/1979.Find%20Greatest%20Common%20Divisor%20of%20Array/README.md) +- [1980. 找出不同的二进制字符串](/solution/1900-1999/1980.Find%20Unique%20Binary%20String/README.md) +- [1981. 最小化目标值与所选元素的差](/solution/1900-1999/1981.Minimize%20the%20Difference%20Between%20Target%20and%20Chosen%20Elements/README.md) +- [1982. 从子集的和还原数组](/solution/1900-1999/1982.Find%20Array%20Given%20Subset%20Sums/README.md) + + +#### 第 254 场周赛(2021-08-15 10:30, 90 分钟) + +- [1967. 作为子字符串出现在单词中的字符串数目](/solution/1900-1999/1967.Number%20of%20Strings%20That%20Appear%20as%20Substrings%20in%20Word/README.md) +- [1968. 构造元素不等于两相邻元素平均值的数组](/solution/1900-1999/1968.Array%20With%20Elements%20Not%20Equal%20to%20Average%20of%20Neighbors/README.md) +- [1969. 数组元素的最小非零乘积](/solution/1900-1999/1969.Minimum%20Non-Zero%20Product%20of%20the%20Array%20Elements/README.md) +- [1970. 你能穿过矩阵的最后一天](/solution/1900-1999/1970.Last%20Day%20Where%20You%20Can%20Still%20Cross/README.md) + + +#### 第 59 场双周赛(2021-08-21 22:30, 90 分钟) + +- [1974. 使用特殊打字机键入单词的最少时间](/solution/1900-1999/1974.Minimum%20Time%20to%20Type%20Word%20Using%20Special%20Typewriter/README.md) +- [1975. 最大方阵和](/solution/1900-1999/1975.Maximum%20Matrix%20Sum/README.md) +- [1976. 到达目的地的方案数](/solution/1900-1999/1976.Number%20of%20Ways%20to%20Arrive%20at%20Destination/README.md) +- [1977. 划分数字的方案数](/solution/1900-1999/1977.Number%20of%20Ways%20to%20Separate%20Numbers/README.md) + + +#### 第 253 场周赛(2021-08-08 10:30, 90 分钟) + +- [1961. 检查字符串是否为数组前缀](/solution/1900-1999/1961.Check%20If%20String%20Is%20a%20Prefix%20of%20Array/README.md) +- [1962. 移除石子使总数最小](/solution/1900-1999/1962.Remove%20Stones%20to%20Minimize%20the%20Total/README.md) +- [1963. 使字符串平衡的最小交换次数](/solution/1900-1999/1963.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20String%20Balanced/README.md) +- [1964. 找出到每个位置为止最长的有效障碍赛跑路线](/solution/1900-1999/1964.Find%20the%20Longest%20Valid%20Obstacle%20Course%20at%20Each%20Position/README.md) + + +#### 第 252 场周赛(2021-08-01 10:30, 90 分钟) + +- [1952. 三除数](/solution/1900-1999/1952.Three%20Divisors/README.md) +- [1953. 你可以工作的最大周数](/solution/1900-1999/1953.Maximum%20Number%20of%20Weeks%20for%20Which%20You%20Can%20Work/README.md) +- [1954. 收集足够苹果的最小花园周长](/solution/1900-1999/1954.Minimum%20Garden%20Perimeter%20to%20Collect%20Enough%20Apples/README.md) +- [1955. 统计特殊子序列的数目](/solution/1900-1999/1955.Count%20Number%20of%20Special%20Subsequences/README.md) + + +#### 第 58 场双周赛(2021-08-07 22:30, 90 分钟) + +- [1957. 删除字符使字符串变好](/solution/1900-1999/1957.Delete%20Characters%20to%20Make%20Fancy%20String/README.md) +- [1958. 检查操作是否合法](/solution/1900-1999/1958.Check%20if%20Move%20is%20Legal/README.md) +- [1959. K 次调整数组大小浪费的最小总空间](/solution/1900-1999/1959.Minimum%20Total%20Space%20Wasted%20With%20K%20Resizing%20Operations/README.md) +- [1960. 两个回文子字符串长度的最大乘积](/solution/1900-1999/1960.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Substrings/README.md) + + +#### 第 251 场周赛(2021-07-25 10:30, 90 分钟) + +- [1945. 字符串转化后的各位数字之和](/solution/1900-1999/1945.Sum%20of%20Digits%20of%20String%20After%20Convert/README.md) +- [1946. 子字符串突变后可能得到的最大整数](/solution/1900-1999/1946.Largest%20Number%20After%20Mutating%20Substring/README.md) +- [1947. 最大兼容性评分和](/solution/1900-1999/1947.Maximum%20Compatibility%20Score%20Sum/README.md) +- [1948. 删除系统中的重复文件夹](/solution/1900-1999/1948.Delete%20Duplicate%20Folders%20in%20System/README.md) + + +#### 第 250 场周赛(2021-07-18 10:30, 90 分钟) + +- [1935. 可以输入的最大单词数](/solution/1900-1999/1935.Maximum%20Number%20of%20Words%20You%20Can%20Type/README.md) +- [1936. 新增的最少台阶数](/solution/1900-1999/1936.Add%20Minimum%20Number%20of%20Rungs/README.md) +- [1937. 扣分后的最大得分](/solution/1900-1999/1937.Maximum%20Number%20of%20Points%20with%20Cost/README.md) +- [1938. 查询最大基因差](/solution/1900-1999/1938.Maximum%20Genetic%20Difference%20Query/README.md) + + +#### 第 57 场双周赛(2021-07-24 22:30, 90 分钟) + +- [1941. 检查是否所有字符出现次数相同](/solution/1900-1999/1941.Check%20if%20All%20Characters%20Have%20Equal%20Number%20of%20Occurrences/README.md) +- [1942. 最小未被占据椅子的编号](/solution/1900-1999/1942.The%20Number%20of%20the%20Smallest%20Unoccupied%20Chair/README.md) +- [1943. 描述绘画结果](/solution/1900-1999/1943.Describe%20the%20Painting/README.md) +- [1944. 队列中可以看到的人数](/solution/1900-1999/1944.Number%20of%20Visible%20People%20in%20a%20Queue/README.md) + + +#### 第 249 场周赛(2021-07-11 10:30, 90 分钟) + +- [1929. 数组串联](/solution/1900-1999/1929.Concatenation%20of%20Array/README.md) +- [1930. 长度为 3 的不同回文子序列](/solution/1900-1999/1930.Unique%20Length-3%20Palindromic%20Subsequences/README.md) +- [1931. 用三种不同颜色为网格涂色](/solution/1900-1999/1931.Painting%20a%20Grid%20With%20Three%20Different%20Colors/README.md) +- [1932. 合并多棵二叉搜索树](/solution/1900-1999/1932.Merge%20BSTs%20to%20Create%20Single%20BST/README.md) + + +#### 第 248 场周赛(2021-07-04 10:30, 90 分钟) + +- [1920. 基于排列构建数组](/solution/1900-1999/1920.Build%20Array%20from%20Permutation/README.md) +- [1921. 消灭怪物的最大数量](/solution/1900-1999/1921.Eliminate%20Maximum%20Number%20of%20Monsters/README.md) +- [1922. 统计好数字的数目](/solution/1900-1999/1922.Count%20Good%20Numbers/README.md) +- [1923. 最长公共子路径](/solution/1900-1999/1923.Longest%20Common%20Subpath/README.md) + + +#### 第 56 场双周赛(2021-07-10 22:30, 90 分钟) + +- [1925. 统计平方和三元组的数目](/solution/1900-1999/1925.Count%20Square%20Sum%20Triples/README.md) +- [1926. 迷宫中离入口最近的出口](/solution/1900-1999/1926.Nearest%20Exit%20from%20Entrance%20in%20Maze/README.md) +- [1927. 求和游戏](/solution/1900-1999/1927.Sum%20Game/README.md) +- [1928. 规定时间内到达终点的最小花费](/solution/1900-1999/1928.Minimum%20Cost%20to%20Reach%20Destination%20in%20Time/README.md) + + +#### 第 247 场周赛(2021-06-27 10:30, 90 分钟) + +- [1913. 两个数对之间的最大乘积差](/solution/1900-1999/1913.Maximum%20Product%20Difference%20Between%20Two%20Pairs/README.md) +- [1914. 循环轮转矩阵](/solution/1900-1999/1914.Cyclically%20Rotating%20a%20Grid/README.md) +- [1915. 最美子字符串的数目](/solution/1900-1999/1915.Number%20of%20Wonderful%20Substrings/README.md) +- [1916. 统计为蚁群构筑房间的不同顺序](/solution/1900-1999/1916.Count%20Ways%20to%20Build%20Rooms%20in%20an%20Ant%20Colony/README.md) + + +#### 第 246 场周赛(2021-06-20 10:30, 90 分钟) + +- [1903. 字符串中的最大奇数](/solution/1900-1999/1903.Largest%20Odd%20Number%20in%20String/README.md) +- [1904. 你完成的完整对局数](/solution/1900-1999/1904.The%20Number%20of%20Full%20Rounds%20You%20Have%20Played/README.md) +- [1905. 统计子岛屿](/solution/1900-1999/1905.Count%20Sub%20Islands/README.md) +- [1906. 查询差绝对值的最小值](/solution/1900-1999/1906.Minimum%20Absolute%20Difference%20Queries/README.md) + + +#### 第 55 场双周赛(2021-06-26 22:30, 90 分钟) + +- [1909. 删除一个元素使数组严格递增](/solution/1900-1999/1909.Remove%20One%20Element%20to%20Make%20the%20Array%20Strictly%20Increasing/README.md) +- [1910. 删除一个字符串中所有出现的给定子字符串](/solution/1900-1999/1910.Remove%20All%20Occurrences%20of%20a%20Substring/README.md) +- [1911. 最大子序列交替和](/solution/1900-1999/1911.Maximum%20Alternating%20Subsequence%20Sum/README.md) +- [1912. 设计电影租借系统](/solution/1900-1999/1912.Design%20Movie%20Rental%20System/README.md) + + +#### 第 245 场周赛(2021-06-13 10:30, 90 分钟) + +- [1897. 重新分配字符使所有字符串都相等](/solution/1800-1899/1897.Redistribute%20Characters%20to%20Make%20All%20Strings%20Equal/README.md) +- [1898. 可移除字符的最大数目](/solution/1800-1899/1898.Maximum%20Number%20of%20Removable%20Characters/README.md) +- [1899. 合并若干三元组以形成目标三元组](/solution/1800-1899/1899.Merge%20Triplets%20to%20Form%20Target%20Triplet/README.md) +- [1900. 最佳运动员的比拼回合](/solution/1900-1999/1900.The%20Earliest%20and%20Latest%20Rounds%20Where%20Players%20Compete/README.md) + + +#### 第 244 场周赛(2021-06-06 10:30, 90 分钟) + +- [1886. 判断矩阵经轮转后是否一致](/solution/1800-1899/1886.Determine%20Whether%20Matrix%20Can%20Be%20Obtained%20By%20Rotation/README.md) +- [1887. 使数组元素相等的减少操作次数](/solution/1800-1899/1887.Reduction%20Operations%20to%20Make%20the%20Array%20Elements%20Equal/README.md) +- [1888. 使二进制字符串字符交替的最少反转次数](/solution/1800-1899/1888.Minimum%20Number%20of%20Flips%20to%20Make%20the%20Binary%20String%20Alternating/README.md) +- [1889. 装包裹的最小浪费空间](/solution/1800-1899/1889.Minimum%20Space%20Wasted%20From%20Packaging/README.md) + + +#### 第 54 场双周赛(2021-06-12 22:30, 90 分钟) + +- [1893. 检查是否区域内所有整数都被覆盖](/solution/1800-1899/1893.Check%20if%20All%20the%20Integers%20in%20a%20Range%20Are%20Covered/README.md) +- [1894. 找到需要补充粉笔的学生编号](/solution/1800-1899/1894.Find%20the%20Student%20that%20Will%20Replace%20the%20Chalk/README.md) +- [1895. 最大的幻方](/solution/1800-1899/1895.Largest%20Magic%20Square/README.md) +- [1896. 反转表达式值的最少操作次数](/solution/1800-1899/1896.Minimum%20Cost%20to%20Change%20the%20Final%20Value%20of%20Expression/README.md) + + +#### 第 243 场周赛(2021-05-30 10:30, 90 分钟) + +- [1880. 检查某单词是否等于两单词之和](/solution/1800-1899/1880.Check%20if%20Word%20Equals%20Summation%20of%20Two%20Words/README.md) +- [1881. 插入后的最大值](/solution/1800-1899/1881.Maximum%20Value%20after%20Insertion/README.md) +- [1882. 使用服务器处理任务](/solution/1800-1899/1882.Process%20Tasks%20Using%20Servers/README.md) +- [1883. 准时抵达会议现场的最小跳过休息次数](/solution/1800-1899/1883.Minimum%20Skips%20to%20Arrive%20at%20Meeting%20On%20Time/README.md) + + +#### 第 242 场周赛(2021-05-23 10:30, 90 分钟) + +- [1869. 哪种连续子字符串更长](/solution/1800-1899/1869.Longer%20Contiguous%20Segments%20of%20Ones%20than%20Zeros/README.md) +- [1870. 准时到达的列车最小时速](/solution/1800-1899/1870.Minimum%20Speed%20to%20Arrive%20on%20Time/README.md) +- [1871. 跳跃游戏 VII](/solution/1800-1899/1871.Jump%20Game%20VII/README.md) +- [1872. 石子游戏 VIII](/solution/1800-1899/1872.Stone%20Game%20VIII/README.md) + + +#### 第 53 场双周赛(2021-05-29 22:30, 90 分钟) + +- [1876. 长度为三且各字符不同的子字符串](/solution/1800-1899/1876.Substrings%20of%20Size%20Three%20with%20Distinct%20Characters/README.md) +- [1877. 数组中最大数对和的最小值](/solution/1800-1899/1877.Minimize%20Maximum%20Pair%20Sum%20in%20Array/README.md) +- [1878. 矩阵中最大的三个菱形和](/solution/1800-1899/1878.Get%20Biggest%20Three%20Rhombus%20Sums%20in%20a%20Grid/README.md) +- [1879. 两个数组最小的异或值之和](/solution/1800-1899/1879.Minimum%20XOR%20Sum%20of%20Two%20Arrays/README.md) + + +#### 第 241 场周赛(2021-05-16 10:30, 90 分钟) + +- [1863. 找出所有子集的异或总和再求和](/solution/1800-1899/1863.Sum%20of%20All%20Subset%20XOR%20Totals/README.md) +- [1864. 构成交替字符串需要的最小交换次数](/solution/1800-1899/1864.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20Binary%20String%20Alternating/README.md) +- [1865. 找出和为指定值的下标对](/solution/1800-1899/1865.Finding%20Pairs%20With%20a%20Certain%20Sum/README.md) +- [1866. 恰有 K 根木棍可以看到的排列数目](/solution/1800-1899/1866.Number%20of%20Ways%20to%20Rearrange%20Sticks%20With%20K%20Sticks%20Visible/README.md) + + +#### 第 240 场周赛(2021-05-09 10:30, 90 分钟) + +- [1854. 人口最多的年份](/solution/1800-1899/1854.Maximum%20Population%20Year/README.md) +- [1855. 下标对中的最大距离](/solution/1800-1899/1855.Maximum%20Distance%20Between%20a%20Pair%20of%20Values/README.md) +- [1856. 子数组最小乘积的最大值](/solution/1800-1899/1856.Maximum%20Subarray%20Min-Product/README.md) +- [1857. 有向图中最大颜色值](/solution/1800-1899/1857.Largest%20Color%20Value%20in%20a%20Directed%20Graph/README.md) + + +#### 第 52 场双周赛(2021-05-15 22:30, 90 分钟) + +- [1859. 将句子排序](/solution/1800-1899/1859.Sorting%20the%20Sentence/README.md) +- [1860. 增长的内存泄露](/solution/1800-1899/1860.Incremental%20Memory%20Leak/README.md) +- [1861. 旋转盒子](/solution/1800-1899/1861.Rotating%20the%20Box/README.md) +- [1862. 向下取整数对和](/solution/1800-1899/1862.Sum%20of%20Floored%20Pairs/README.md) + + +#### 第 239 场周赛(2021-05-02 10:30, 90 分钟) + +- [1848. 到目标元素的最小距离](/solution/1800-1899/1848.Minimum%20Distance%20to%20the%20Target%20Element/README.md) +- [1849. 将字符串拆分为递减的连续值](/solution/1800-1899/1849.Splitting%20a%20String%20Into%20Descending%20Consecutive%20Values/README.md) +- [1850. 邻位交换的最小次数](/solution/1800-1899/1850.Minimum%20Adjacent%20Swaps%20to%20Reach%20the%20Kth%20Smallest%20Number/README.md) +- [1851. 包含每个查询的最小区间](/solution/1800-1899/1851.Minimum%20Interval%20to%20Include%20Each%20Query/README.md) + + +#### 第 238 场周赛(2021-04-25 10:30, 90 分钟) + +- [1837. K 进制表示下的各位数字总和](/solution/1800-1899/1837.Sum%20of%20Digits%20in%20Base%20K/README.md) +- [1838. 最高频元素的频数](/solution/1800-1899/1838.Frequency%20of%20the%20Most%20Frequent%20Element/README.md) +- [1839. 所有元音按顺序排布的最长子字符串](/solution/1800-1899/1839.Longest%20Substring%20Of%20All%20Vowels%20in%20Order/README.md) +- [1840. 最高建筑高度](/solution/1800-1899/1840.Maximum%20Building%20Height/README.md) + + +#### 第 51 场双周赛(2021-05-01 22:30, 90 分钟) + +- [1844. 将所有数字用字符替换](/solution/1800-1899/1844.Replace%20All%20Digits%20with%20Characters/README.md) +- [1845. 座位预约管理系统](/solution/1800-1899/1845.Seat%20Reservation%20Manager/README.md) +- [1846. 减小和重新排列数组后的最大元素](/solution/1800-1899/1846.Maximum%20Element%20After%20Decreasing%20and%20Rearranging/README.md) +- [1847. 最近的房间](/solution/1800-1899/1847.Closest%20Room/README.md) + + +#### 第 237 场周赛(2021-04-18 10:30, 90 分钟) + +- [1832. 判断句子是否为全字母句](/solution/1800-1899/1832.Check%20if%20the%20Sentence%20Is%20Pangram/README.md) +- [1833. 雪糕的最大数量](/solution/1800-1899/1833.Maximum%20Ice%20Cream%20Bars/README.md) +- [1834. 单线程 CPU](/solution/1800-1899/1834.Single-Threaded%20CPU/README.md) +- [1835. 所有数对按位与结果的异或和](/solution/1800-1899/1835.Find%20XOR%20Sum%20of%20All%20Pairs%20Bitwise%20AND/README.md) + + +#### 第 236 场周赛(2021-04-11 10:30, 90 分钟) + +- [1822. 数组元素积的符号](/solution/1800-1899/1822.Sign%20of%20the%20Product%20of%20an%20Array/README.md) +- [1823. 找出游戏的获胜者](/solution/1800-1899/1823.Find%20the%20Winner%20of%20the%20Circular%20Game/README.md) +- [1824. 最少侧跳次数](/solution/1800-1899/1824.Minimum%20Sideway%20Jumps/README.md) +- [1825. 求出 MK 平均值](/solution/1800-1899/1825.Finding%20MK%20Average/README.md) + + +#### 第 50 场双周赛(2021-04-17 22:30, 90 分钟) + +- [1827. 最少操作使数组递增](/solution/1800-1899/1827.Minimum%20Operations%20to%20Make%20the%20Array%20Increasing/README.md) +- [1828. 统计一个圆中点的数目](/solution/1800-1899/1828.Queries%20on%20Number%20of%20Points%20Inside%20a%20Circle/README.md) +- [1829. 每个查询的最大异或值](/solution/1800-1899/1829.Maximum%20XOR%20for%20Each%20Query/README.md) +- [1830. 使字符串有序的最少操作次数](/solution/1800-1899/1830.Minimum%20Number%20of%20Operations%20to%20Make%20String%20Sorted/README.md) + + +#### 第 235 场周赛(2021-04-04 10:30, 90 分钟) + +- [1816. 截断句子](/solution/1800-1899/1816.Truncate%20Sentence/README.md) +- [1817. 查找用户活跃分钟数](/solution/1800-1899/1817.Finding%20the%20Users%20Active%20Minutes/README.md) +- [1818. 绝对差值和](/solution/1800-1899/1818.Minimum%20Absolute%20Sum%20Difference/README.md) +- [1819. 序列中不同最大公约数的数目](/solution/1800-1899/1819.Number%20of%20Different%20Subsequences%20GCDs/README.md) + + +#### 第 234 场周赛(2021-03-28 10:30, 90 分钟) + +- [1805. 字符串中不同整数的数目](/solution/1800-1899/1805.Number%20of%20Different%20Integers%20in%20a%20String/README.md) +- [1806. 还原排列的最少操作步数](/solution/1800-1899/1806.Minimum%20Number%20of%20Operations%20to%20Reinitialize%20a%20Permutation/README.md) +- [1807. 替换字符串中的括号内容](/solution/1800-1899/1807.Evaluate%20the%20Bracket%20Pairs%20of%20a%20String/README.md) +- [1808. 好因子的最大数目](/solution/1800-1899/1808.Maximize%20Number%20of%20Nice%20Divisors/README.md) + + +#### 第 49 场双周赛(2021-04-03 22:30, 90 分钟) + +- [1812. 判断国际象棋棋盘中一个格子的颜色](/solution/1800-1899/1812.Determine%20Color%20of%20a%20Chessboard%20Square/README.md) +- [1813. 句子相似性 III](/solution/1800-1899/1813.Sentence%20Similarity%20III/README.md) +- [1814. 统计一个数组中好对子的数目](/solution/1800-1899/1814.Count%20Nice%20Pairs%20in%20an%20Array/README.md) +- [1815. 得到新鲜甜甜圈的最多组数](/solution/1800-1899/1815.Maximum%20Number%20of%20Groups%20Getting%20Fresh%20Donuts/README.md) + + +#### 第 233 场周赛(2021-03-21 10:30, 90 分钟) + +- [1800. 最大升序子数组和](/solution/1800-1899/1800.Maximum%20Ascending%20Subarray%20Sum/README.md) +- [1801. 积压订单中的订单总数](/solution/1800-1899/1801.Number%20of%20Orders%20in%20the%20Backlog/README.md) +- [1802. 有界数组中指定下标处的最大值](/solution/1800-1899/1802.Maximum%20Value%20at%20a%20Given%20Index%20in%20a%20Bounded%20Array/README.md) +- [1803. 统计异或值在范围内的数对有多少](/solution/1800-1899/1803.Count%20Pairs%20With%20XOR%20in%20a%20Range/README.md) + + +#### 第 232 场周赛(2021-03-14 10:30, 90 分钟) + +- [1790. 仅执行一次字符串交换能否使两个字符串相等](/solution/1700-1799/1790.Check%20if%20One%20String%20Swap%20Can%20Make%20Strings%20Equal/README.md) +- [1791. 找出星型图的中心节点](/solution/1700-1799/1791.Find%20Center%20of%20Star%20Graph/README.md) +- [1792. 最大平均通过率](/solution/1700-1799/1792.Maximum%20Average%20Pass%20Ratio/README.md) +- [1793. 好子数组的最大分数](/solution/1700-1799/1793.Maximum%20Score%20of%20a%20Good%20Subarray/README.md) + + +#### 第 48 场双周赛(2021-03-20 22:30, 90 分钟) + +- [1796. 字符串中第二大的数字](/solution/1700-1799/1796.Second%20Largest%20Digit%20in%20a%20String/README.md) +- [1797. 设计一个验证系统](/solution/1700-1799/1797.Design%20Authentication%20Manager/README.md) +- [1798. 你能构造出连续值的最大数目](/solution/1700-1799/1798.Maximum%20Number%20of%20Consecutive%20Values%20You%20Can%20Make/README.md) +- [1799. N 次操作后的最大分数和](/solution/1700-1799/1799.Maximize%20Score%20After%20N%20Operations/README.md) + + +#### 第 231 场周赛(2021-03-07 10:30, 90 分钟) + +- [1784. 检查二进制字符串字段](/solution/1700-1799/1784.Check%20if%20Binary%20String%20Has%20at%20Most%20One%20Segment%20of%20Ones/README.md) +- [1785. 构成特定和需要添加的最少元素](/solution/1700-1799/1785.Minimum%20Elements%20to%20Add%20to%20Form%20a%20Given%20Sum/README.md) +- [1786. 从第一个节点出发到最后一个节点的受限路径数](/solution/1700-1799/1786.Number%20of%20Restricted%20Paths%20From%20First%20to%20Last%20Node/README.md) +- [1787. 使所有区间的异或结果为零](/solution/1700-1799/1787.Make%20the%20XOR%20of%20All%20Segments%20Equal%20to%20Zero/README.md) + + +#### 第 230 场周赛(2021-02-28 10:30, 90 分钟) + +- [1773. 统计匹配检索规则的物品数量](/solution/1700-1799/1773.Count%20Items%20Matching%20a%20Rule/README.md) +- [1774. 最接近目标价格的甜点成本](/solution/1700-1799/1774.Closest%20Dessert%20Cost/README.md) +- [1775. 通过最少操作次数使数组的和相等](/solution/1700-1799/1775.Equal%20Sum%20Arrays%20With%20Minimum%20Number%20of%20Operations/README.md) +- [1776. 车队 II](/solution/1700-1799/1776.Car%20Fleet%20II/README.md) + + +#### 第 47 场双周赛(2021-03-06 22:30, 90 分钟) + +- [1779. 找到最近的有相同 X 或 Y 坐标的点](/solution/1700-1799/1779.Find%20Nearest%20Point%20That%20Has%20the%20Same%20X%20or%20Y%20Coordinate/README.md) +- [1780. 判断一个数字是否可以表示成三的幂的和](/solution/1700-1799/1780.Check%20if%20Number%20is%20a%20Sum%20of%20Powers%20of%20Three/README.md) +- [1781. 所有子字符串美丽值之和](/solution/1700-1799/1781.Sum%20of%20Beauty%20of%20All%20Substrings/README.md) +- [1782. 统计点对的数目](/solution/1700-1799/1782.Count%20Pairs%20Of%20Nodes/README.md) + + +#### 第 229 场周赛(2021-02-21 10:30, 90 分钟) + +- [1768. 交替合并字符串](/solution/1700-1799/1768.Merge%20Strings%20Alternately/README.md) +- [1769. 移动所有球到每个盒子所需的最小操作数](/solution/1700-1799/1769.Minimum%20Number%20of%20Operations%20to%20Move%20All%20Balls%20to%20Each%20Box/README.md) +- [1770. 执行乘法运算的最大分数](/solution/1700-1799/1770.Maximum%20Score%20from%20Performing%20Multiplication%20Operations/README.md) +- [1771. 由子序列构造的最长回文串的长度](/solution/1700-1799/1771.Maximize%20Palindrome%20Length%20From%20Subsequences/README.md) + + +#### 第 228 场周赛(2021-02-14 10:30, 90 分钟) + +- [1758. 生成交替二进制字符串的最少操作数](/solution/1700-1799/1758.Minimum%20Changes%20To%20Make%20Alternating%20Binary%20String/README.md) +- [1759. 统计同构子字符串的数目](/solution/1700-1799/1759.Count%20Number%20of%20Homogenous%20Substrings/README.md) +- [1760. 袋子里最少数目的球](/solution/1700-1799/1760.Minimum%20Limit%20of%20Balls%20in%20a%20Bag/README.md) +- [1761. 一个图中连通三元组的最小度数](/solution/1700-1799/1761.Minimum%20Degree%20of%20a%20Connected%20Trio%20in%20a%20Graph/README.md) + + +#### 第 46 场双周赛(2021-02-20 22:30, 90 分钟) + +- [1763. 最长的美好子字符串](/solution/1700-1799/1763.Longest%20Nice%20Substring/README.md) +- [1764. 通过连接另一个数组的子数组得到一个数组](/solution/1700-1799/1764.Form%20Array%20by%20Concatenating%20Subarrays%20of%20Another%20Array/README.md) +- [1765. 地图中的最高点](/solution/1700-1799/1765.Map%20of%20Highest%20Peak/README.md) +- [1766. 互质树](/solution/1700-1799/1766.Tree%20of%20Coprimes/README.md) + + +#### 第 227 场周赛(2021-02-07 10:30, 90 分钟) + +- [1752. 检查数组是否经排序和轮转得到](/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README.md) +- [1753. 移除石子的最大得分](/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README.md) +- [1754. 构造字典序最大的合并字符串](/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README.md) +- [1755. 最接近目标值的子序列和](/solution/1700-1799/1755.Closest%20Subsequence%20Sum/README.md) + + +#### 第 226 场周赛(2021-01-31 10:30, 90 分钟) + +- [1742. 盒子中小球的最大数量](/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README.md) +- [1743. 从相邻元素对还原数组](/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README.md) +- [1744. 你能在你最喜欢的那天吃到你最喜欢的糖果吗？](/solution/1700-1799/1744.Can%20You%20Eat%20Your%20Favorite%20Candy%20on%20Your%20Favorite%20Day/README.md) +- [1745. 回文串分割 IV](/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README.md) + + +#### 第 45 场双周赛(2021-02-06 22:30, 90 分钟) + +- [1748. 唯一元素的和](/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README.md) +- [1749. 任意子数组和的绝对值的最大值](/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README.md) +- [1750. 删除字符串两端相同字符后的最短长度](/solution/1700-1799/1750.Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends/README.md) +- [1751. 最多可以参加的会议数目 II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README.md) + + +#### 第 225 场周赛(2021-01-24 10:30, 90 分钟) + +- [1736. 替换隐藏数字得到的最晚时间](/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README.md) +- [1737. 满足三条件之一需改变的最少字符数](/solution/1700-1799/1737.Change%20Minimum%20Characters%20to%20Satisfy%20One%20of%20Three%20Conditions/README.md) +- [1738. 找出第 K 大的异或坐标值](/solution/1700-1799/1738.Find%20Kth%20Largest%20XOR%20Coordinate%20Value/README.md) +- [1739. 放置盒子](/solution/1700-1799/1739.Building%20Boxes/README.md) + + +#### 第 224 场周赛(2021-01-17 10:30, 90 分钟) + +- [1725. 可以形成最大正方形的矩形数目](/solution/1700-1799/1725.Number%20Of%20Rectangles%20That%20Can%20Form%20The%20Largest%20Square/README.md) +- [1726. 同积元组](/solution/1700-1799/1726.Tuple%20with%20Same%20Product/README.md) +- [1727. 重新排列后的最大子矩阵](/solution/1700-1799/1727.Largest%20Submatrix%20With%20Rearrangements/README.md) +- [1728. 猫和老鼠 II](/solution/1700-1799/1728.Cat%20and%20Mouse%20II/README.md) + + +#### 第 44 场双周赛(2021-01-23 22:30, 90 分钟) + +- [1732. 找到最高海拔](/solution/1700-1799/1732.Find%20the%20Highest%20Altitude/README.md) +- [1733. 需要教语言的最少人数](/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README.md) +- [1734. 解码异或后的排列](/solution/1700-1799/1734.Decode%20XORed%20Permutation/README.md) +- [1735. 生成乘积数组的方案数](/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README.md) + + +#### 第 223 场周赛(2021-01-10 10:30, 90 分钟) + +- [1720. 解码异或后的数组](/solution/1700-1799/1720.Decode%20XORed%20Array/README.md) +- [1721. 交换链表中的节点](/solution/1700-1799/1721.Swapping%20Nodes%20in%20a%20Linked%20List/README.md) +- [1722. 执行交换操作后的最小汉明距离](/solution/1700-1799/1722.Minimize%20Hamming%20Distance%20After%20Swap%20Operations/README.md) +- [1723. 完成所有工作的最短时间](/solution/1700-1799/1723.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs/README.md) + + +#### 第 222 场周赛(2021-01-03 10:30, 90 分钟) + +- [1710. 卡车上的最大单元数](/solution/1700-1799/1710.Maximum%20Units%20on%20a%20Truck/README.md) +- [1711. 大餐计数](/solution/1700-1799/1711.Count%20Good%20Meals/README.md) +- [1712. 将数组分成三个子数组的方案数](/solution/1700-1799/1712.Ways%20to%20Split%20Array%20Into%20Three%20Subarrays/README.md) +- [1713. 得到子序列的最少操作次数](/solution/1700-1799/1713.Minimum%20Operations%20to%20Make%20a%20Subsequence/README.md) + + +#### 第 43 场双周赛(2021-01-09 22:30, 90 分钟) + +- [1716. 计算力扣银行的钱](/solution/1700-1799/1716.Calculate%20Money%20in%20Leetcode%20Bank/README.md) +- [1717. 删除子字符串的最大得分](/solution/1700-1799/1717.Maximum%20Score%20From%20Removing%20Substrings/README.md) +- [1718. 构建字典序最大的可行序列](/solution/1700-1799/1718.Construct%20the%20Lexicographically%20Largest%20Valid%20Sequence/README.md) +- [1719. 重构一棵树的方案数](/solution/1700-1799/1719.Number%20Of%20Ways%20To%20Reconstruct%20A%20Tree/README.md) + + +#### 第 221 场周赛(2020-12-27 10:30, 90 分钟) + +- [1704. 判断字符串的两半是否相似](/solution/1700-1799/1704.Determine%20if%20String%20Halves%20Are%20Alike/README.md) +- [1705. 吃苹果的最大数目](/solution/1700-1799/1705.Maximum%20Number%20of%20Eaten%20Apples/README.md) +- [1706. 球会落何处](/solution/1700-1799/1706.Where%20Will%20the%20Ball%20Fall/README.md) +- [1707. 与数组中元素的最大异或值](/solution/1700-1799/1707.Maximum%20XOR%20With%20an%20Element%20From%20Array/README.md) + + +#### 第 220 场周赛(2020-12-20 10:30, 90 分钟) + +- [1694. 重新格式化电话号码](/solution/1600-1699/1694.Reformat%20Phone%20Number/README.md) +- [1695. 删除子数组的最大得分](/solution/1600-1699/1695.Maximum%20Erasure%20Value/README.md) +- [1696. 跳跃游戏 VI](/solution/1600-1699/1696.Jump%20Game%20VI/README.md) +- [1697. 检查边长度限制的路径是否存在](/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README.md) + + +#### 第 42 场双周赛(2020-12-26 22:30, 90 分钟) + +- [1700. 无法吃午餐的学生数量](/solution/1700-1799/1700.Number%20of%20Students%20Unable%20to%20Eat%20Lunch/README.md) +- [1701. 平均等待时间](/solution/1700-1799/1701.Average%20Waiting%20Time/README.md) +- [1702. 修改后的最大二进制字符串](/solution/1700-1799/1702.Maximum%20Binary%20String%20After%20Change/README.md) +- [1703. 得到连续 K 个 1 的最少相邻交换次数](/solution/1700-1799/1703.Minimum%20Adjacent%20Swaps%20for%20K%20Consecutive%20Ones/README.md) + + +#### 第 219 场周赛(2020-12-13 10:30, 90 分钟) + +- [1688. 比赛中的配对次数](/solution/1600-1699/1688.Count%20of%20Matches%20in%20Tournament/README.md) +- [1689. 十-二进制数的最少数目](/solution/1600-1699/1689.Partitioning%20Into%20Minimum%20Number%20Of%20Deci-Binary%20Numbers/README.md) +- [1690. 石子游戏 VII](/solution/1600-1699/1690.Stone%20Game%20VII/README.md) +- [1691. 堆叠长方体的最大高度](/solution/1600-1699/1691.Maximum%20Height%20by%20Stacking%20Cuboids/README.md) + + +#### 第 218 场周赛(2020-12-06 10:30, 90 分钟) + +- [1678. 设计 Goal 解析器](/solution/1600-1699/1678.Goal%20Parser%20Interpretation/README.md) +- [1679. K 和数对的最大数目](/solution/1600-1699/1679.Max%20Number%20of%20K-Sum%20Pairs/README.md) +- [1680. 连接连续二进制数字](/solution/1600-1699/1680.Concatenation%20of%20Consecutive%20Binary%20Numbers/README.md) +- [1681. 最小不兼容性](/solution/1600-1699/1681.Minimum%20Incompatibility/README.md) + + +#### 第 41 场双周赛(2020-12-12 22:30, 90 分钟) + +- [1684. 统计一致字符串的数目](/solution/1600-1699/1684.Count%20the%20Number%20of%20Consistent%20Strings/README.md) +- [1685. 有序数组中差绝对值之和](/solution/1600-1699/1685.Sum%20of%20Absolute%20Differences%20in%20a%20Sorted%20Array/README.md) +- [1686. 石子游戏 VI](/solution/1600-1699/1686.Stone%20Game%20VI/README.md) +- [1687. 从仓库到码头运输箱子](/solution/1600-1699/1687.Delivering%20Boxes%20from%20Storage%20to%20Ports/README.md) + + +#### 第 217 场周赛(2020-11-29 10:30, 90 分钟) + +- [1672. 最富有客户的资产总量](/solution/1600-1699/1672.Richest%20Customer%20Wealth/README.md) +- [1673. 找出最具竞争力的子序列](/solution/1600-1699/1673.Find%20the%20Most%20Competitive%20Subsequence/README.md) +- [1674. 使数组互补的最少操作次数](/solution/1600-1699/1674.Minimum%20Moves%20to%20Make%20Array%20Complementary/README.md) +- [1675. 数组的最小偏移量](/solution/1600-1699/1675.Minimize%20Deviation%20in%20Array/README.md) + + +#### 第 216 场周赛(2020-11-22 10:30, 90 分钟) + +- [1662. 检查两个字符串数组是否相等](/solution/1600-1699/1662.Check%20If%20Two%20String%20Arrays%20are%20Equivalent/README.md) +- [1663. 具有给定数值的最小字符串](/solution/1600-1699/1663.Smallest%20String%20With%20A%20Given%20Numeric%20Value/README.md) +- [1664. 生成平衡数组的方案数](/solution/1600-1699/1664.Ways%20to%20Make%20a%20Fair%20Array/README.md) +- [1665. 完成所有任务的最少初始能量](/solution/1600-1699/1665.Minimum%20Initial%20Energy%20to%20Finish%20Tasks/README.md) + + +#### 第 40 场双周赛(2020-11-28 22:30, 90 分钟) + +- [1668. 最大重复子字符串](/solution/1600-1699/1668.Maximum%20Repeating%20Substring/README.md) +- [1669. 合并两个链表](/solution/1600-1699/1669.Merge%20In%20Between%20Linked%20Lists/README.md) +- [1670. 设计前中后队列](/solution/1600-1699/1670.Design%20Front%20Middle%20Back%20Queue/README.md) +- [1671. 得到山形数组的最少删除次数](/solution/1600-1699/1671.Minimum%20Number%20of%20Removals%20to%20Make%20Mountain%20Array/README.md) + + +#### 第 215 场周赛(2020-11-15 10:30, 90 分钟) + +- [1656. 设计有序流](/solution/1600-1699/1656.Design%20an%20Ordered%20Stream/README.md) +- [1657. 确定两个字符串是否接近](/solution/1600-1699/1657.Determine%20if%20Two%20Strings%20Are%20Close/README.md) +- [1658. 将 x 减到 0 的最小操作数](/solution/1600-1699/1658.Minimum%20Operations%20to%20Reduce%20X%20to%20Zero/README.md) +- [1659. 最大化网格幸福感](/solution/1600-1699/1659.Maximize%20Grid%20Happiness/README.md) + + +#### 第 214 场周赛(2020-11-08 10:30, 90 分钟) + +- [1646. 获取生成数组中的最大值](/solution/1600-1699/1646.Get%20Maximum%20in%20Generated%20Array/README.md) +- [1647. 字符频次唯一的最小删除次数](/solution/1600-1699/1647.Minimum%20Deletions%20to%20Make%20Character%20Frequencies%20Unique/README.md) +- [1648. 销售价值减少的颜色球](/solution/1600-1699/1648.Sell%20Diminishing-Valued%20Colored%20Balls/README.md) +- [1649. 通过指令创建有序数组](/solution/1600-1699/1649.Create%20Sorted%20Array%20through%20Instructions/README.md) + + +#### 第 39 场双周赛(2020-11-14 22:30, 90 分钟) + +- [1652. 拆炸弹](/solution/1600-1699/1652.Defuse%20the%20Bomb/README.md) +- [1653. 使字符串平衡的最少删除次数](/solution/1600-1699/1653.Minimum%20Deletions%20to%20Make%20String%20Balanced/README.md) +- [1654. 到家的最少跳跃次数](/solution/1600-1699/1654.Minimum%20Jumps%20to%20Reach%20Home/README.md) +- [1655. 分配重复整数](/solution/1600-1699/1655.Distribute%20Repeating%20Integers/README.md) + + +#### 第 213 场周赛(2020-11-01 10:30, 90 分钟) + +- [1640. 能否连接形成数组](/solution/1600-1699/1640.Check%20Array%20Formation%20Through%20Concatenation/README.md) +- [1641. 统计字典序元音字符串的数目](/solution/1600-1699/1641.Count%20Sorted%20Vowel%20Strings/README.md) +- [1642. 可以到达的最远建筑](/solution/1600-1699/1642.Furthest%20Building%20You%20Can%20Reach/README.md) +- [1643. 第 K 条最小指令](/solution/1600-1699/1643.Kth%20Smallest%20Instructions/README.md) + + +#### 第 212 场周赛(2020-10-25 10:30, 90 分钟) + +- [1629. 按键持续时间最长的键](/solution/1600-1699/1629.Slowest%20Key/README.md) +- [1630. 等差子数组](/solution/1600-1699/1630.Arithmetic%20Subarrays/README.md) +- [1631. 最小体力消耗路径](/solution/1600-1699/1631.Path%20With%20Minimum%20Effort/README.md) +- [1632. 矩阵转换后的秩](/solution/1600-1699/1632.Rank%20Transform%20of%20a%20Matrix/README.md) + + +#### 第 38 场双周赛(2020-10-31 22:30, 90 分钟) + +- [1636. 按照频率将数组升序排序](/solution/1600-1699/1636.Sort%20Array%20by%20Increasing%20Frequency/README.md) +- [1637. 两点之间不包含任何点的最宽垂直面积](/solution/1600-1699/1637.Widest%20Vertical%20Area%20Between%20Two%20Points%20Containing%20No%20Points/README.md) +- [1638. 统计只差一个字符的子串数目](/solution/1600-1699/1638.Count%20Substrings%20That%20Differ%20by%20One%20Character/README.md) +- [1639. 通过给定词典构造目标字符串的方案数](/solution/1600-1699/1639.Number%20of%20Ways%20to%20Form%20a%20Target%20String%20Given%20a%20Dictionary/README.md) + + +#### 第 211 场周赛(2020-10-18 10:30, 90 分钟) + +- [1624. 两个相同字符之间的最长子字符串](/solution/1600-1699/1624.Largest%20Substring%20Between%20Two%20Equal%20Characters/README.md) +- [1625. 执行操作后字典序最小的字符串](/solution/1600-1699/1625.Lexicographically%20Smallest%20String%20After%20Applying%20Operations/README.md) +- [1626. 无矛盾的最佳球队](/solution/1600-1699/1626.Best%20Team%20With%20No%20Conflicts/README.md) +- [1627. 带阈值的图连通性](/solution/1600-1699/1627.Graph%20Connectivity%20With%20Threshold/README.md) + + +#### 第 210 场周赛(2020-10-11 10:30, 90 分钟) + +- [1614. 括号的最大嵌套深度](/solution/1600-1699/1614.Maximum%20Nesting%20Depth%20of%20the%20Parentheses/README.md) +- [1615. 最大网络秩](/solution/1600-1699/1615.Maximal%20Network%20Rank/README.md) +- [1616. 分割两个字符串得到回文串](/solution/1600-1699/1616.Split%20Two%20Strings%20to%20Make%20Palindrome/README.md) +- [1617. 统计子树中城市之间最大距离](/solution/1600-1699/1617.Count%20Subtrees%20With%20Max%20Distance%20Between%20Cities/README.md) + + +#### 第 37 场双周赛(2020-10-17 22:30, 90 分钟) + +- [1619. 删除某些元素后的数组均值](/solution/1600-1699/1619.Mean%20of%20Array%20After%20Removing%20Some%20Elements/README.md) +- [1620. 网络信号最好的坐标](/solution/1600-1699/1620.Coordinate%20With%20Maximum%20Network%20Quality/README.md) +- [1621. 大小为 K 的不重叠线段的数目](/solution/1600-1699/1621.Number%20of%20Sets%20of%20K%20Non-Overlapping%20Line%20Segments/README.md) +- [1622. 奇妙序列](/solution/1600-1699/1622.Fancy%20Sequence/README.md) + + +#### 第 209 场周赛(2020-10-04 10:30, 90 分钟) + +- [1608. 特殊数组的特征值](/solution/1600-1699/1608.Special%20Array%20With%20X%20Elements%20Greater%20Than%20or%20Equal%20X/README.md) +- [1609. 奇偶树](/solution/1600-1699/1609.Even%20Odd%20Tree/README.md) +- [1610. 可见点的最大数目](/solution/1600-1699/1610.Maximum%20Number%20of%20Visible%20Points/README.md) +- [1611. 使整数变为 0 的最少操作次数](/solution/1600-1699/1611.Minimum%20One%20Bit%20Operations%20to%20Make%20Integers%20Zero/README.md) + + +#### 第 208 场周赛(2020-09-27 10:30, 90 分钟) + +- [1598. 文件夹操作日志搜集器](/solution/1500-1599/1598.Crawler%20Log%20Folder/README.md) +- [1599. 经营摩天轮的最大利润](/solution/1500-1599/1599.Maximum%20Profit%20of%20Operating%20a%20Centennial%20Wheel/README.md) +- [1600. 王位继承顺序](/solution/1600-1699/1600.Throne%20Inheritance/README.md) +- [1601. 最多可达成的换楼请求数目](/solution/1600-1699/1601.Maximum%20Number%20of%20Achievable%20Transfer%20Requests/README.md) + + +#### 第 36 场双周赛(2020-10-03 22:30, 90 分钟) + +- [1603. 设计停车系统](/solution/1600-1699/1603.Design%20Parking%20System/README.md) +- [1604. 警告一小时内使用相同员工卡大于等于三次的人](/solution/1600-1699/1604.Alert%20Using%20Same%20Key-Card%20Three%20or%20More%20Times%20in%20a%20One%20Hour%20Period/README.md) +- [1605. 给定行和列的和求可行矩阵](/solution/1600-1699/1605.Find%20Valid%20Matrix%20Given%20Row%20and%20Column%20Sums/README.md) +- [1606. 找到处理最多请求的服务器](/solution/1600-1699/1606.Find%20Servers%20That%20Handled%20Most%20Number%20of%20Requests/README.md) + + +#### 第 207 场周赛(2020-09-20 10:30, 90 分钟) + +- [1592. 重新排列单词间的空格](/solution/1500-1599/1592.Rearrange%20Spaces%20Between%20Words/README.md) +- [1593. 拆分字符串使唯一子字符串的数目最大](/solution/1500-1599/1593.Split%20a%20String%20Into%20the%20Max%20Number%20of%20Unique%20Substrings/README.md) +- [1594. 矩阵的最大非负积](/solution/1500-1599/1594.Maximum%20Non%20Negative%20Product%20in%20a%20Matrix/README.md) +- [1595. 连通两组点的最小成本](/solution/1500-1599/1595.Minimum%20Cost%20to%20Connect%20Two%20Groups%20of%20Points/README.md) + + +#### 第 206 场周赛(2020-09-13 10:30, 90 分钟) + +- [1582. 二进制矩阵中的特殊位置](/solution/1500-1599/1582.Special%20Positions%20in%20a%20Binary%20Matrix/README.md) +- [1583. 统计不开心的朋友](/solution/1500-1599/1583.Count%20Unhappy%20Friends/README.md) +- [1584. 连接所有点的最小费用](/solution/1500-1599/1584.Min%20Cost%20to%20Connect%20All%20Points/README.md) +- [1585. 检查字符串是否可以通过排序子字符串得到另一个字符串](/solution/1500-1599/1585.Check%20If%20String%20Is%20Transformable%20With%20Substring%20Sort%20Operations/README.md) + + +#### 第 35 场双周赛(2020-09-19 22:30, 90 分钟) + +- [1588. 所有奇数长度子数组的和](/solution/1500-1599/1588.Sum%20of%20All%20Odd%20Length%20Subarrays/README.md) +- [1589. 所有排列中的最大和](/solution/1500-1599/1589.Maximum%20Sum%20Obtained%20of%20Any%20Permutation/README.md) +- [1590. 使数组和能被 P 整除](/solution/1500-1599/1590.Make%20Sum%20Divisible%20by%20P/README.md) +- [1591. 奇怪的打印机 II](/solution/1500-1599/1591.Strange%20Printer%20II/README.md) + + +#### 第 205 场周赛(2020-09-06 10:30, 90 分钟) + +- [1576. 替换所有的问号](/solution/1500-1599/1576.Replace%20All%20%27s%20to%20Avoid%20Consecutive%20Repeating%20Characters/README.md) +- [1577. 数的平方等于两数乘积的方法数](/solution/1500-1599/1577.Number%20of%20Ways%20Where%20Square%20of%20Number%20Is%20Equal%20to%20Product%20of%20Two%20Numbers/README.md) +- [1578. 使绳子变成彩色的最短时间](/solution/1500-1599/1578.Minimum%20Time%20to%20Make%20Rope%20Colorful/README.md) +- [1579. 保证图可完全遍历](/solution/1500-1599/1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable/README.md) + + +#### 第 204 场周赛(2020-08-30 10:30, 90 分钟) + +- [1566. 重复至少 K 次且长度为 M 的模式](/solution/1500-1599/1566.Detect%20Pattern%20of%20Length%20M%20Repeated%20K%20or%20More%20Times/README.md) +- [1567. 乘积为正数的最长子数组长度](/solution/1500-1599/1567.Maximum%20Length%20of%20Subarray%20With%20Positive%20Product/README.md) +- [1568. 使陆地分离的最少天数](/solution/1500-1599/1568.Minimum%20Number%20of%20Days%20to%20Disconnect%20Island/README.md) +- [1569. 将子数组重新排序得到同一个二叉查找树的方案数](/solution/1500-1599/1569.Number%20of%20Ways%20to%20Reorder%20Array%20to%20Get%20Same%20BST/README.md) + + +#### 第 34 场双周赛(2020-09-05 22:30, 90 分钟) + +- [1572. 矩阵对角线元素的和](/solution/1500-1599/1572.Matrix%20Diagonal%20Sum/README.md) +- [1573. 分割字符串的方案数](/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README.md) +- [1574. 删除最短的子数组使剩余数组有序](/solution/1500-1599/1574.Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README.md) +- [1575. 统计所有可行路径](/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README.md) + + +#### 第 203 场周赛(2020-08-23 10:30, 90 分钟) + +- [1560. 圆形赛道上经过次数最多的扇区](/solution/1500-1599/1560.Most%20Visited%20Sector%20in%20%20a%20Circular%20Track/README.md) +- [1561. 你可以获得的最大硬币数目](/solution/1500-1599/1561.Maximum%20Number%20of%20Coins%20You%20Can%20Get/README.md) +- [1562. 查找大小为 M 的最新分组](/solution/1500-1599/1562.Find%20Latest%20Group%20of%20Size%20M/README.md) +- [1563. 石子游戏 V](/solution/1500-1599/1563.Stone%20Game%20V/README.md) + + +#### 第 202 场周赛(2020-08-16 10:30, 90 分钟) + +- [1550. 存在连续三个奇数的数组](/solution/1500-1599/1550.Three%20Consecutive%20Odds/README.md) +- [1551. 使数组中所有元素相等的最小操作数](/solution/1500-1599/1551.Minimum%20Operations%20to%20Make%20Array%20Equal/README.md) +- [1552. 两球之间的磁力](/solution/1500-1599/1552.Magnetic%20Force%20Between%20Two%20Balls/README.md) +- [1553. 吃掉 N 个橘子的最少天数](/solution/1500-1599/1553.Minimum%20Number%20of%20Days%20to%20Eat%20N%20Oranges/README.md) + + +#### 第 33 场双周赛(2020-08-22 22:30, 90 分钟) + +- [1556. 千位分隔数](/solution/1500-1599/1556.Thousand%20Separator/README.md) +- [1557. 可以到达所有点的最少点数目](/solution/1500-1599/1557.Minimum%20Number%20of%20Vertices%20to%20Reach%20All%20Nodes/README.md) +- [1558. 得到目标数组的最少函数调用次数](/solution/1500-1599/1558.Minimum%20Numbers%20of%20Function%20Calls%20to%20Make%20Target%20Array/README.md) +- [1559. 二维网格图中探测环](/solution/1500-1599/1559.Detect%20Cycles%20in%202D%20Grid/README.md) + + +#### 第 201 场周赛(2020-08-09 10:30, 90 分钟) + +- [1544. 整理字符串](/solution/1500-1599/1544.Make%20The%20String%20Great/README.md) +- [1545. 找出第 N 个二进制字符串中的第 K 位](/solution/1500-1599/1545.Find%20Kth%20Bit%20in%20Nth%20Binary%20String/README.md) +- [1546. 和为目标值且不重叠的非空子数组的最大数目](/solution/1500-1599/1546.Maximum%20Number%20of%20Non-Overlapping%20Subarrays%20With%20Sum%20Equals%20Target/README.md) +- [1547. 切棍子的最小成本](/solution/1500-1599/1547.Minimum%20Cost%20to%20Cut%20a%20Stick/README.md) + + +#### 第 32 场双周赛(2020-08-08 22:30, 90 分钟) + +- [1539. 第 k 个缺失的正整数](/solution/1500-1599/1539.Kth%20Missing%20Positive%20Number/README.md) +- [1540. K 次操作转变字符串](/solution/1500-1599/1540.Can%20Convert%20String%20in%20K%20Moves/README.md) +- [1541. 平衡括号字符串的最少插入次数](/solution/1500-1599/1541.Minimum%20Insertions%20to%20Balance%20a%20Parentheses%20String/README.md) +- [1542. 找出最长的超赞子字符串](/solution/1500-1599/1542.Find%20Longest%20Awesome%20Substring/README.md) + + +#### 第 200 场周赛(2020-08-02 10:30, 90 分钟) + +- [1534. 统计好三元组](/solution/1500-1599/1534.Count%20Good%20Triplets/README.md) +- [1535. 找出数组游戏的赢家](/solution/1500-1599/1535.Find%20the%20Winner%20of%20an%20Array%20Game/README.md) +- [1536. 排布二进制网格的最少交换次数](/solution/1500-1599/1536.Minimum%20Swaps%20to%20Arrange%20a%20Binary%20Grid/README.md) +- [1537. 最大得分](/solution/1500-1599/1537.Get%20the%20Maximum%20Score/README.md) + + +#### 第 31 场双周赛(2020-07-25 22:30, 90 分钟) + +- [1523. 在区间范围内统计奇数数目](/solution/1500-1599/1523.Count%20Odd%20Numbers%20in%20an%20Interval%20Range/README.md) +- [1524. 和为奇数的子数组数目](/solution/1500-1599/1524.Number%20of%20Sub-arrays%20With%20Odd%20Sum/README.md) +- [1525. 字符串的好分割数目](/solution/1500-1599/1525.Number%20of%20Good%20Ways%20to%20Split%20a%20String/README.md) +- [1526. 形成目标数组的子数组最少增加次数](/solution/1500-1599/1526.Minimum%20Number%20of%20Increments%20on%20Subarrays%20to%20Form%20a%20Target%20Array/README.md) + + +#### 第 199 场周赛(2020-07-26 10:30, 90 分钟) + +- [1528. 重新排列字符串](/solution/1500-1599/1528.Shuffle%20String/README.md) +- [1529. 最少的后缀翻转次数](/solution/1500-1599/1529.Minimum%20Suffix%20Flips/README.md) +- [1530. 好叶子节点对的数量](/solution/1500-1599/1530.Number%20of%20Good%20Leaf%20Nodes%20Pairs/README.md) +- [1531. 压缩字符串 II](/solution/1500-1599/1531.String%20Compression%20II/README.md) + + +#### 第 198 场周赛(2020-07-19 10:30, 90 分钟) + +- [1518. 换酒问题](/solution/1500-1599/1518.Water%20Bottles/README.md) +- [1519. 子树中标签相同的节点数](/solution/1500-1599/1519.Number%20of%20Nodes%20in%20the%20Sub-Tree%20With%20the%20Same%20Label/README.md) +- [1520. 最多的不重叠子字符串](/solution/1500-1599/1520.Maximum%20Number%20of%20Non-Overlapping%20Substrings/README.md) +- [1521. 找到最接近目标值的函数值](/solution/1500-1599/1521.Find%20a%20Value%20of%20a%20Mysterious%20Function%20Closest%20to%20Target/README.md) + + +#### 第 30 场双周赛(2020-07-11 22:30, 90 分钟) + +- [1507. 转变日期格式](/solution/1500-1599/1507.Reformat%20Date/README.md) +- [1508. 子数组和排序后的区间和](/solution/1500-1599/1508.Range%20Sum%20of%20Sorted%20Subarray%20Sums/README.md) +- [1509. 三次操作后最大值与最小值的最小差](/solution/1500-1599/1509.Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/README.md) +- [1510. 石子游戏 IV](/solution/1500-1599/1510.Stone%20Game%20IV/README.md) + + +#### 第 197 场周赛(2020-07-12 10:30, 90 分钟) + +- [1512. 好数对的数目](/solution/1500-1599/1512.Number%20of%20Good%20Pairs/README.md) +- [1513. 仅含 1 的子串数](/solution/1500-1599/1513.Number%20of%20Substrings%20With%20Only%201s/README.md) +- [1514. 概率最大的路径](/solution/1500-1599/1514.Path%20with%20Maximum%20Probability/README.md) +- [1515. 服务中心的最佳位置](/solution/1500-1599/1515.Best%20Position%20for%20a%20Service%20Centre/README.md) + + +#### 第 196 场周赛(2020-07-05 10:30, 90 分钟) + +- [1502. 判断能否形成等差数列](/solution/1500-1599/1502.Can%20Make%20Arithmetic%20Progression%20From%20Sequence/README.md) +- [1503. 所有蚂蚁掉下来前的最后一刻](/solution/1500-1599/1503.Last%20Moment%20Before%20All%20Ants%20Fall%20Out%20of%20a%20Plank/README.md) +- [1504. 统计全 1 子矩形](/solution/1500-1599/1504.Count%20Submatrices%20With%20All%20Ones/README.md) +- [1505. 最多 K 次交换相邻数位后得到的最小整数](/solution/1500-1599/1505.Minimum%20Possible%20Integer%20After%20at%20Most%20K%20Adjacent%20Swaps%20On%20Digits/README.md) + + +#### 第 29 场双周赛(2020-06-27 22:30, 90 分钟) + +- [1491. 去掉最低工资和最高工资后的工资平均值](/solution/1400-1499/1491.Average%20Salary%20Excluding%20the%20Minimum%20and%20Maximum%20Salary/README.md) +- [1492. n 的第 k 个因子](/solution/1400-1499/1492.The%20kth%20Factor%20of%20n/README.md) +- [1493. 删掉一个元素以后全为 1 的最长子数组](/solution/1400-1499/1493.Longest%20Subarray%20of%201%27s%20After%20Deleting%20One%20Element/README.md) +- [1494. 并行课程 II](/solution/1400-1499/1494.Parallel%20Courses%20II/README.md) + + +#### 第 195 场周赛(2020-06-28 10:30, 90 分钟) + +- [1496. 判断路径是否相交](/solution/1400-1499/1496.Path%20Crossing/README.md) +- [1497. 检查数组对是否可以被 k 整除](/solution/1400-1499/1497.Check%20If%20Array%20Pairs%20Are%20Divisible%20by%20k/README.md) +- [1498. 满足条件的子序列数目](/solution/1400-1499/1498.Number%20of%20Subsequences%20That%20Satisfy%20the%20Given%20Sum%20Condition/README.md) +- [1499. 满足不等式的最大值](/solution/1400-1499/1499.Max%20Value%20of%20Equation/README.md) + + +#### 第 194 场周赛(2020-06-21 10:30, 90 分钟) + +- [1486. 数组异或操作](/solution/1400-1499/1486.XOR%20Operation%20in%20an%20Array/README.md) +- [1487. 保证文件名唯一](/solution/1400-1499/1487.Making%20File%20Names%20Unique/README.md) +- [1488. 避免洪水泛滥](/solution/1400-1499/1488.Avoid%20Flood%20in%20The%20City/README.md) +- [1489. 找到最小生成树里的关键边和伪关键边](/solution/1400-1499/1489.Find%20Critical%20and%20Pseudo-Critical%20Edges%20in%20Minimum%20Spanning%20Tree/README.md) + + +#### 第 28 场双周赛(2020-06-13 22:30, 90 分钟) + +- [1475. 商品折扣后的最终价格](/solution/1400-1499/1475.Final%20Prices%20With%20a%20Special%20Discount%20in%20a%20Shop/README.md) +- [1476. 子矩形查询](/solution/1400-1499/1476.Subrectangle%20Queries/README.md) +- [1477. 找两个和为目标值且不重叠的子数组](/solution/1400-1499/1477.Find%20Two%20Non-overlapping%20Sub-arrays%20Each%20With%20Target%20Sum/README.md) +- [1478. 安排邮筒](/solution/1400-1499/1478.Allocate%20Mailboxes/README.md) + + +#### 第 193 场周赛(2020-06-14 10:30, 90 分钟) + +- [1480. 一维数组的动态和](/solution/1400-1499/1480.Running%20Sum%20of%201d%20Array/README.md) +- [1481. 不同整数的最少数目](/solution/1400-1499/1481.Least%20Number%20of%20Unique%20Integers%20after%20K%20Removals/README.md) +- [1482. 制作 m 束花所需的最少天数](/solution/1400-1499/1482.Minimum%20Number%20of%20Days%20to%20Make%20m%20Bouquets/README.md) +- [1483. 树节点的第 K 个祖先](/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README.md) + + +#### 第 192 场周赛(2020-06-07 10:30, 90 分钟) + +- [1470. 重新排列数组](/solution/1400-1499/1470.Shuffle%20the%20Array/README.md) +- [1471. 数组中的 k 个最强值](/solution/1400-1499/1471.The%20k%20Strongest%20Values%20in%20an%20Array/README.md) +- [1472. 设计浏览器历史记录](/solution/1400-1499/1472.Design%20Browser%20History/README.md) +- [1473. 粉刷房子 III](/solution/1400-1499/1473.Paint%20House%20III/README.md) + + +#### 第 27 场双周赛(2020-05-30 22:30, 90 分钟) + +- [1460. 通过翻转子数组使两个数组相等](/solution/1400-1499/1460.Make%20Two%20Arrays%20Equal%20by%20Reversing%20Sub-arrays/README.md) +- [1461. 检查一个字符串是否包含所有长度为 K 的二进制子串](/solution/1400-1499/1461.Check%20If%20a%20String%20Contains%20All%20Binary%20Codes%20of%20Size%20K/README.md) +- [1462. 课程表 IV](/solution/1400-1499/1462.Course%20Schedule%20IV/README.md) +- [1463. 摘樱桃 II](/solution/1400-1499/1463.Cherry%20Pickup%20II/README.md) + + +#### 第 191 场周赛(2020-05-31 10:30, 90 分钟) + +- [1464. 数组中两元素的最大乘积](/solution/1400-1499/1464.Maximum%20Product%20of%20Two%20Elements%20in%20an%20Array/README.md) +- [1465. 切割后面积最大的蛋糕](/solution/1400-1499/1465.Maximum%20Area%20of%20a%20Piece%20of%20Cake%20After%20Horizontal%20and%20Vertical%20Cuts/README.md) +- [1466. 重新规划路线](/solution/1400-1499/1466.Reorder%20Routes%20to%20Make%20All%20Paths%20Lead%20to%20the%20City%20Zero/README.md) +- [1467. 两个盒子中球的颜色数相同的概率](/solution/1400-1499/1467.Probability%20of%20a%20Two%20Boxes%20Having%20The%20Same%20Number%20of%20Distinct%20Balls/README.md) + + +#### 第 190 场周赛(2020-05-24 10:30, 90 分钟) + +- [1455. 检查单词是否为句中其他单词的前缀](/solution/1400-1499/1455.Check%20If%20a%20Word%20Occurs%20As%20a%20Prefix%20of%20Any%20Word%20in%20a%20Sentence/README.md) +- [1456. 定长子串中元音的最大数目](/solution/1400-1499/1456.Maximum%20Number%20of%20Vowels%20in%20a%20Substring%20of%20Given%20Length/README.md) +- [1457. 二叉树中的伪回文路径](/solution/1400-1499/1457.Pseudo-Palindromic%20Paths%20in%20a%20Binary%20Tree/README.md) +- [1458. 两个子序列的最大点积](/solution/1400-1499/1458.Max%20Dot%20Product%20of%20Two%20Subsequences/README.md) + + +#### 第 26 场双周赛(2020-05-16 22:30, 90 分钟) + +- [1446. 连续字符](/solution/1400-1499/1446.Consecutive%20Characters/README.md) +- [1447. 最简分数](/solution/1400-1499/1447.Simplified%20Fractions/README.md) +- [1448. 统计二叉树中好节点的数目](/solution/1400-1499/1448.Count%20Good%20Nodes%20in%20Binary%20Tree/README.md) +- [1449. 数位成本和为目标值的最大数字](/solution/1400-1499/1449.Form%20Largest%20Integer%20With%20Digits%20That%20Add%20up%20to%20Target/README.md) + + +#### 第 189 场周赛(2020-05-17 10:30, 90 分钟) + +- [1450. 在既定时间做作业的学生人数](/solution/1400-1499/1450.Number%20of%20Students%20Doing%20Homework%20at%20a%20Given%20Time/README.md) +- [1451. 重新排列句子中的单词](/solution/1400-1499/1451.Rearrange%20Words%20in%20a%20Sentence/README.md) +- [1452. 收藏清单](/solution/1400-1499/1452.People%20Whose%20List%20of%20Favorite%20Companies%20Is%20Not%20a%20Subset%20of%20Another%20List/README.md) +- [1453. 圆形靶内的最大飞镖数量](/solution/1400-1499/1453.Maximum%20Number%20of%20Darts%20Inside%20of%20a%20Circular%20Dartboard/README.md) + + +#### 第 188 场周赛(2020-05-10 10:30, 90 分钟) + +- [1441. 用栈操作构建数组](/solution/1400-1499/1441.Build%20an%20Array%20With%20Stack%20Operations/README.md) +- [1442. 形成两个异或相等数组的三元组数目](/solution/1400-1499/1442.Count%20Triplets%20That%20Can%20Form%20Two%20Arrays%20of%20Equal%20XOR/README.md) +- [1443. 收集树上所有苹果的最少时间](/solution/1400-1499/1443.Minimum%20Time%20to%20Collect%20All%20Apples%20in%20a%20Tree/README.md) +- [1444. 切披萨的方案数](/solution/1400-1499/1444.Number%20of%20Ways%20of%20Cutting%20a%20Pizza/README.md) + + +#### 第 25 场双周赛(2020-05-02 22:30, 90 分钟) + +- [1431. 拥有最多糖果的孩子](/solution/1400-1499/1431.Kids%20With%20the%20Greatest%20Number%20of%20Candies/README.md) +- [1432. 改变一个整数能得到的最大差值](/solution/1400-1499/1432.Max%20Difference%20You%20Can%20Get%20From%20Changing%20an%20Integer/README.md) +- [1433. 检查一个字符串是否可以打破另一个字符串](/solution/1400-1499/1433.Check%20If%20a%20String%20Can%20Break%20Another%20String/README.md) +- [1434. 每个人戴不同帽子的方案数](/solution/1400-1499/1434.Number%20of%20Ways%20to%20Wear%20Different%20Hats%20to%20Each%20Other/README.md) + + +#### 第 187 场周赛(2020-05-03 10:30, 90 分钟) + +- [1436. 旅行终点站](/solution/1400-1499/1436.Destination%20City/README.md) +- [1437. 是否所有 1 都至少相隔 k 个元素](/solution/1400-1499/1437.Check%20If%20All%201%27s%20Are%20at%20Least%20Length%20K%20Places%20Away/README.md) +- [1438. 绝对差不超过限制的最长连续子数组](/solution/1400-1499/1438.Longest%20Continuous%20Subarray%20With%20Absolute%20Diff%20Less%20Than%20or%20Equal%20to%20Limit/README.md) +- [1439. 有序矩阵中的第 k 个最小数组和](/solution/1400-1499/1439.Find%20the%20Kth%20Smallest%20Sum%20of%20a%20Matrix%20With%20Sorted%20Rows/README.md) + + +#### 第 186 场周赛(2020-04-26 10:30, 90 分钟) + +- [1422. 分割字符串的最大得分](/solution/1400-1499/1422.Maximum%20Score%20After%20Splitting%20a%20String/README.md) +- [1423. 可获得的最大点数](/solution/1400-1499/1423.Maximum%20Points%20You%20Can%20Obtain%20from%20Cards/README.md) +- [1424. 对角线遍历 II](/solution/1400-1499/1424.Diagonal%20Traverse%20II/README.md) +- [1425. 带限制的子序列和](/solution/1400-1499/1425.Constrained%20Subsequence%20Sum/README.md) + + +#### 第 24 场双周赛(2020-04-18 22:30, 90 分钟) + +- [1413. 逐步求和得到正数的最小值](/solution/1400-1499/1413.Minimum%20Value%20to%20Get%20Positive%20Step%20by%20Step%20Sum/README.md) +- [1414. 和为 K 的最少斐波那契数字数目](/solution/1400-1499/1414.Find%20the%20Minimum%20Number%20of%20Fibonacci%20Numbers%20Whose%20Sum%20Is%20K/README.md) +- [1415. 长度为 n 的开心字符串中字典序第 k 小的字符串](/solution/1400-1499/1415.The%20k-th%20Lexicographical%20String%20of%20All%20Happy%20Strings%20of%20Length%20n/README.md) +- [1416. 恢复数组](/solution/1400-1499/1416.Restore%20The%20Array/README.md) + + +#### 第 185 场周赛(2020-04-19 10:30, 90 分钟) + +- [1417. 重新格式化字符串](/solution/1400-1499/1417.Reformat%20The%20String/README.md) +- [1418. 点菜展示表](/solution/1400-1499/1418.Display%20Table%20of%20Food%20Orders%20in%20a%20Restaurant/README.md) +- [1419. 数青蛙](/solution/1400-1499/1419.Minimum%20Number%20of%20Frogs%20Croaking/README.md) +- [1420. 生成数组](/solution/1400-1499/1420.Build%20Array%20Where%20You%20Can%20Find%20The%20Maximum%20Exactly%20K%20Comparisons/README.md) + + +#### 第 184 场周赛(2020-04-12 10:30, 90 分钟) + +- [1408. 数组中的字符串匹配](/solution/1400-1499/1408.String%20Matching%20in%20an%20Array/README.md) +- [1409. 查询带键的排列](/solution/1400-1499/1409.Queries%20on%20a%20Permutation%20With%20Key/README.md) +- [1410. HTML 实体解析器](/solution/1400-1499/1410.HTML%20Entity%20Parser/README.md) +- [1411. 给 N x 3 网格图涂色的方案数](/solution/1400-1499/1411.Number%20of%20Ways%20to%20Paint%20N%20%C3%97%203%20Grid/README.md) + + +#### 第 23 场双周赛(2020-04-04 22:30, 90 分钟) + +- [1399. 统计最大组的数目](/solution/1300-1399/1399.Count%20Largest%20Group/README.md) +- [1400. 构造 K 个回文字符串](/solution/1400-1499/1400.Construct%20K%20Palindrome%20Strings/README.md) +- [1401. 圆和矩形是否有重叠](/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README.md) +- [1402. 做菜顺序](/solution/1400-1499/1402.Reducing%20Dishes/README.md) + + +#### 第 183 场周赛(2020-04-05 10:30, 90 分钟) + +- [1403. 非递增顺序的最小子序列](/solution/1400-1499/1403.Minimum%20Subsequence%20in%20Non-Increasing%20Order/README.md) +- [1404. 将二进制表示减到 1 的步骤数](/solution/1400-1499/1404.Number%20of%20Steps%20to%20Reduce%20a%20Number%20in%20Binary%20Representation%20to%20One/README.md) +- [1405. 最长快乐字符串](/solution/1400-1499/1405.Longest%20Happy%20String/README.md) +- [1406. 石子游戏 III](/solution/1400-1499/1406.Stone%20Game%20III/README.md) + + +#### 第 182 场周赛(2020-03-29 10:30, 90 分钟) + +- [1394. 找出数组中的幸运数](/solution/1300-1399/1394.Find%20Lucky%20Integer%20in%20an%20Array/README.md) +- [1395. 统计作战单位数](/solution/1300-1399/1395.Count%20Number%20of%20Teams/README.md) +- [1396. 设计地铁系统](/solution/1300-1399/1396.Design%20Underground%20System/README.md) +- [1397. 找到所有好字符串](/solution/1300-1399/1397.Find%20All%20Good%20Strings/README.md) + + +#### 第 22 场双周赛(2020-03-21 22:30, 90 分钟) + +- [1385. 两个数组间的距离值](/solution/1300-1399/1385.Find%20the%20Distance%20Value%20Between%20Two%20Arrays/README.md) +- [1386. 安排电影院座位](/solution/1300-1399/1386.Cinema%20Seat%20Allocation/README.md) +- [1387. 将整数按权重排序](/solution/1300-1399/1387.Sort%20Integers%20by%20The%20Power%20Value/README.md) +- [1388. 3n 块披萨](/solution/1300-1399/1388.Pizza%20With%203n%20Slices/README.md) + + +#### 第 181 场周赛(2020-03-22 10:30, 90 分钟) + +- [1389. 按既定顺序创建目标数组](/solution/1300-1399/1389.Create%20Target%20Array%20in%20the%20Given%20Order/README.md) +- [1390. 四因数](/solution/1300-1399/1390.Four%20Divisors/README.md) +- [1391. 检查网格中是否存在有效路径](/solution/1300-1399/1391.Check%20if%20There%20is%20a%20Valid%20Path%20in%20a%20Grid/README.md) +- [1392. 最长快乐前缀](/solution/1300-1399/1392.Longest%20Happy%20Prefix/README.md) + + +#### 第 180 场周赛(2020-03-15 10:30, 90 分钟) + +- [1380. 矩阵中的幸运数](/solution/1300-1399/1380.Lucky%20Numbers%20in%20a%20Matrix/README.md) +- [1381. 设计一个支持增量操作的栈](/solution/1300-1399/1381.Design%20a%20Stack%20With%20Increment%20Operation/README.md) +- [1382. 将二叉搜索树变平衡](/solution/1300-1399/1382.Balance%20a%20Binary%20Search%20Tree/README.md) +- [1383. 最大的团队表现值](/solution/1300-1399/1383.Maximum%20Performance%20of%20a%20Team/README.md) + + +#### 第 21 场双周赛(2020-03-07 22:30, 90 分钟) + +- [1370. 上升下降字符串](/solution/1300-1399/1370.Increasing%20Decreasing%20String/README.md) +- [1371. 每个元音包含偶数次的最长子字符串](/solution/1300-1399/1371.Find%20the%20Longest%20Substring%20Containing%20Vowels%20in%20Even%20Counts/README.md) +- [1372. 二叉树中的最长交错路径](/solution/1300-1399/1372.Longest%20ZigZag%20Path%20in%20a%20Binary%20Tree/README.md) +- [1373. 二叉搜索子树的最大键值和](/solution/1300-1399/1373.Maximum%20Sum%20BST%20in%20Binary%20Tree/README.md) + + +#### 第 179 场周赛(2020-03-08 10:30, 90 分钟) + +- [1374. 生成每种字符都是奇数个的字符串](/solution/1300-1399/1374.Generate%20a%20String%20With%20Characters%20That%20Have%20Odd%20Counts/README.md) +- [1375. 二进制字符串前缀一致的次数](/solution/1300-1399/1375.Number%20of%20Times%20Binary%20String%20Is%20Prefix-Aligned/README.md) +- [1376. 通知所有员工所需的时间](/solution/1300-1399/1376.Time%20Needed%20to%20Inform%20All%20Employees/README.md) +- [1377. T 秒后青蛙的位置](/solution/1300-1399/1377.Frog%20Position%20After%20T%20Seconds/README.md) + + +#### 第 178 场周赛(2020-03-01 10:30, 90 分钟) + +- [1365. 有多少小于当前数字的数字](/solution/1300-1399/1365.How%20Many%20Numbers%20Are%20Smaller%20Than%20the%20Current%20Number/README.md) +- [1366. 通过投票对团队排名](/solution/1300-1399/1366.Rank%20Teams%20by%20Votes/README.md) +- [1367. 二叉树中的列表](/solution/1300-1399/1367.Linked%20List%20in%20Binary%20Tree/README.md) +- [1368. 使网格图至少有一条有效路径的最小代价](/solution/1300-1399/1368.Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/README.md) + + +#### 第 20 场双周赛(2020-02-22 22:30, 90 分钟) + +- [1356. 根据数字二进制下 1 的数目排序](/solution/1300-1399/1356.Sort%20Integers%20by%20The%20Number%20of%201%20Bits/README.md) +- [1357. 每隔 n 个顾客打折](/solution/1300-1399/1357.Apply%20Discount%20Every%20n%20Orders/README.md) +- [1358. 包含所有三种字符的子字符串数目](/solution/1300-1399/1358.Number%20of%20Substrings%20Containing%20All%20Three%20Characters/README.md) +- [1359. 有效的快递序列数目](/solution/1300-1399/1359.Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/README.md) + + +#### 第 177 场周赛(2020-02-23 10:30, 90 分钟) + +- [1360. 日期之间隔几天](/solution/1300-1399/1360.Number%20of%20Days%20Between%20Two%20Dates/README.md) +- [1361. 验证二叉树](/solution/1300-1399/1361.Validate%20Binary%20Tree%20Nodes/README.md) +- [1362. 最接近的因数](/solution/1300-1399/1362.Closest%20Divisors/README.md) +- [1363. 形成三的最大倍数](/solution/1300-1399/1363.Largest%20Multiple%20of%20Three/README.md) + + +#### 第 176 场周赛(2020-02-16 10:30, 90 分钟) + +- [1351. 统计有序矩阵中的负数](/solution/1300-1399/1351.Count%20Negative%20Numbers%20in%20a%20Sorted%20Matrix/README.md) +- [1352. 最后 K 个数的乘积](/solution/1300-1399/1352.Product%20of%20the%20Last%20K%20Numbers/README.md) +- [1353. 最多可以参加的会议数目](/solution/1300-1399/1353.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended/README.md) +- [1354. 多次求和构造目标数组](/solution/1300-1399/1354.Construct%20Target%20Array%20With%20Multiple%20Sums/README.md) + + +#### 第 19 场双周赛(2020-02-08 22:30, 90 分钟) + +- [1342. 将数字变成 0 的操作次数](/solution/1300-1399/1342.Number%20of%20Steps%20to%20Reduce%20a%20Number%20to%20Zero/README.md) +- [1343. 大小为 K 且平均值大于等于阈值的子数组数目](/solution/1300-1399/1343.Number%20of%20Sub-arrays%20of%20Size%20K%20and%20Average%20Greater%20than%20or%20Equal%20to%20Threshold/README.md) +- [1344. 时钟指针的夹角](/solution/1300-1399/1344.Angle%20Between%20Hands%20of%20a%20Clock/README.md) +- [1345. 跳跃游戏 IV](/solution/1300-1399/1345.Jump%20Game%20IV/README.md) + + +#### 第 175 场周赛(2020-02-09 10:30, 90 分钟) + +- [1346. 检查整数及其两倍数是否存在](/solution/1300-1399/1346.Check%20If%20N%20and%20Its%20Double%20Exist/README.md) +- [1347. 制造字母异位词的最小步骤数](/solution/1300-1399/1347.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram/README.md) +- [1348. 推文计数](/solution/1300-1399/1348.Tweet%20Counts%20Per%20Frequency/README.md) +- [1349. 参加考试的最大学生数](/solution/1300-1399/1349.Maximum%20Students%20Taking%20Exam/README.md) + + +#### 第 174 场周赛(2020-02-02 10:30, 90 分钟) + +- [1337. 矩阵中战斗力最弱的 K 行](/solution/1300-1399/1337.The%20K%20Weakest%20Rows%20in%20a%20Matrix/README.md) +- [1338. 数组大小减半](/solution/1300-1399/1338.Reduce%20Array%20Size%20to%20The%20Half/README.md) +- [1339. 分裂二叉树的最大乘积](/solution/1300-1399/1339.Maximum%20Product%20of%20Splitted%20Binary%20Tree/README.md) +- [1340. 跳跃游戏 V](/solution/1300-1399/1340.Jump%20Game%20V/README.md) + + +#### 第 18 场双周赛(2020-01-25 22:30, 90 分钟) + +- [1331. 数组序号转换](/solution/1300-1399/1331.Rank%20Transform%20of%20an%20Array/README.md) +- [1328. 破坏回文串](/solution/1300-1399/1328.Break%20a%20Palindrome/README.md) +- [1329. 将矩阵按对角线排序](/solution/1300-1399/1329.Sort%20the%20Matrix%20Diagonally/README.md) +- [1330. 翻转子数组得到最大的数组值](/solution/1300-1399/1330.Reverse%20Subarray%20To%20Maximize%20Array%20Value/README.md) + + +#### 第 173 场周赛(2020-01-26 10:30, 90 分钟) + +- [1332. 删除回文子序列](/solution/1300-1399/1332.Remove%20Palindromic%20Subsequences/README.md) +- [1333. 餐厅过滤器](/solution/1300-1399/1333.Filter%20Restaurants%20by%20Vegan-Friendly%2C%20Price%20and%20Distance/README.md) +- [1334. 阈值距离内邻居最少的城市](/solution/1300-1399/1334.Find%20the%20City%20With%20the%20Smallest%20Number%20of%20Neighbors%20at%20a%20Threshold%20Distance/README.md) +- [1335. 工作计划的最低难度](/solution/1300-1399/1335.Minimum%20Difficulty%20of%20a%20Job%20Schedule/README.md) + + +#### 第 172 场周赛(2020-01-19 10:30, 90 分钟) + +- [1323. 6 和 9 组成的最大数字](/solution/1300-1399/1323.Maximum%2069%20Number/README.md) +- [1324. 竖直打印单词](/solution/1300-1399/1324.Print%20Words%20Vertically/README.md) +- [1325. 删除给定值的叶子节点](/solution/1300-1399/1325.Delete%20Leaves%20With%20a%20Given%20Value/README.md) +- [1326. 灌溉花园的最少水龙头数目](/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README.md) + + +#### 第 17 场双周赛(2020-01-11 22:30, 90 分钟) + +- [1313. 解压缩编码列表](/solution/1300-1399/1313.Decompress%20Run-Length%20Encoded%20List/README.md) +- [1314. 矩阵区域和](/solution/1300-1399/1314.Matrix%20Block%20Sum/README.md) +- [1315. 祖父节点值为偶数的节点和](/solution/1300-1399/1315.Sum%20of%20Nodes%20with%20Even-Valued%20Grandparent/README.md) +- [1316. 不同的循环子字符串](/solution/1300-1399/1316.Distinct%20Echo%20Substrings/README.md) + + +#### 第 171 场周赛(2020-01-12 10:30, 90 分钟) + +- [1317. 将整数转换为两个无零整数的和](/solution/1300-1399/1317.Convert%20Integer%20to%20the%20Sum%20of%20Two%20No-Zero%20Integers/README.md) +- [1318. 或运算的最小翻转次数](/solution/1300-1399/1318.Minimum%20Flips%20to%20Make%20a%20OR%20b%20Equal%20to%20c/README.md) +- [1319. 连通网络的操作次数](/solution/1300-1399/1319.Number%20of%20Operations%20to%20Make%20Network%20Connected/README.md) +- [1320. 二指输入的的最小距离](/solution/1300-1399/1320.Minimum%20Distance%20to%20Type%20a%20Word%20Using%20Two%20Fingers/README.md) + + +#### 第 170 场周赛(2020-01-05 10:30, 90 分钟) + +- [1309. 解码字母到整数映射](/solution/1300-1399/1309.Decrypt%20String%20from%20Alphabet%20to%20Integer%20Mapping/README.md) +- [1310. 子数组异或查询](/solution/1300-1399/1310.XOR%20Queries%20of%20a%20Subarray/README.md) +- [1311. 获取你好友已观看的视频](/solution/1300-1399/1311.Get%20Watched%20Videos%20by%20Your%20Friends/README.md) +- [1312. 让字符串成为回文串的最少插入次数](/solution/1300-1399/1312.Minimum%20Insertion%20Steps%20to%20Make%20a%20String%20Palindrome/README.md) + + +#### 第 16 场双周赛(2019-12-28 22:30, 90 分钟) + +- [1299. 将每个元素替换为右侧最大元素](/solution/1200-1299/1299.Replace%20Elements%20with%20Greatest%20Element%20on%20Right%20Side/README.md) +- [1300. 转变数组后最接近目标值的数组和](/solution/1300-1399/1300.Sum%20of%20Mutated%20Array%20Closest%20to%20Target/README.md) +- [1302. 层数最深叶子节点的和](/solution/1300-1399/1302.Deepest%20Leaves%20Sum/README.md) +- [1301. 最大得分的路径数目](/solution/1300-1399/1301.Number%20of%20Paths%20with%20Max%20Score/README.md) + + +#### 第 169 场周赛(2019-12-29 10:30, 90 分钟) + +- [1304. 和为零的N个唯一整数](/solution/1300-1399/1304.Find%20N%20Unique%20Integers%20Sum%20up%20to%20Zero/README.md) +- [1305. 两棵二叉搜索树中的所有元素](/solution/1300-1399/1305.All%20Elements%20in%20Two%20Binary%20Search%20Trees/README.md) +- [1306. 跳跃游戏 III](/solution/1300-1399/1306.Jump%20Game%20III/README.md) +- [1307. 口算难题](/solution/1300-1399/1307.Verbal%20Arithmetic%20Puzzle/README.md) + + +#### 第 168 场周赛(2019-12-22 10:30, 90 分钟) + +- [1295. 统计位数为偶数的数字](/solution/1200-1299/1295.Find%20Numbers%20with%20Even%20Number%20of%20Digits/README.md) +- [1296. 划分数组为连续数字的集合](/solution/1200-1299/1296.Divide%20Array%20in%20Sets%20of%20K%20Consecutive%20Numbers/README.md) +- [1297. 子串的最大出现次数](/solution/1200-1299/1297.Maximum%20Number%20of%20Occurrences%20of%20a%20Substring/README.md) +- [1298. 你能从盒子里获得的最大糖果数](/solution/1200-1299/1298.Maximum%20Candies%20You%20Can%20Get%20from%20Boxes/README.md) + + +#### 第 15 场双周赛(2019-12-14 22:30, 90 分钟) + +- [1287. 有序数组中出现次数超过25%的元素](/solution/1200-1299/1287.Element%20Appearing%20More%20Than%2025%25%20In%20Sorted%20Array/README.md) +- [1288. 删除被覆盖区间](/solution/1200-1299/1288.Remove%20Covered%20Intervals/README.md) +- [1286. 字母组合迭代器](/solution/1200-1299/1286.Iterator%20for%20Combination/README.md) +- [1289. 下降路径最小和 II](/solution/1200-1299/1289.Minimum%20Falling%20Path%20Sum%20II/README.md) + + +#### 第 167 场周赛(2019-12-15 10:30, 90 分钟) + +- [1290. 二进制链表转整数](/solution/1200-1299/1290.Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/README.md) +- [1291. 顺次数](/solution/1200-1299/1291.Sequential%20Digits/README.md) +- [1292. 元素和小于等于阈值的正方形的最大边长](/solution/1200-1299/1292.Maximum%20Side%20Length%20of%20a%20Square%20with%20Sum%20Less%20than%20or%20Equal%20to%20Threshold/README.md) +- [1293. 网格中的最短路径](/solution/1200-1299/1293.Shortest%20Path%20in%20a%20Grid%20with%20Obstacles%20Elimination/README.md) + + +#### 第 166 场周赛(2019-12-08 10:30, 90 分钟) + +- [1281. 整数的各位积和之差](/solution/1200-1299/1281.Subtract%20the%20Product%20and%20Sum%20of%20Digits%20of%20an%20Integer/README.md) +- [1282. 用户分组](/solution/1200-1299/1282.Group%20the%20People%20Given%20the%20Group%20Size%20They%20Belong%20To/README.md) +- [1283. 使结果不超过阈值的最小除数](/solution/1200-1299/1283.Find%20the%20Smallest%20Divisor%20Given%20a%20Threshold/README.md) +- [1284. 转化为全零矩阵的最少反转次数](/solution/1200-1299/1284.Minimum%20Number%20of%20Flips%20to%20Convert%20Binary%20Matrix%20to%20Zero%20Matrix/README.md) + + +#### 第 14 场双周赛(2019-11-30 22:30, 90 分钟) + +- [1271. 十六进制魔术数字](/solution/1200-1299/1271.Hexspeak/README.md) +- [1272. 删除区间](/solution/1200-1299/1272.Remove%20Interval/README.md) +- [1273. 删除树节点](/solution/1200-1299/1273.Delete%20Tree%20Nodes/README.md) +- [1274. 矩形内船只的数目](/solution/1200-1299/1274.Number%20of%20Ships%20in%20a%20Rectangle/README.md) + + +#### 第 165 场周赛(2019-12-01 10:30, 90 分钟) + +- [1275. 找出井字棋的获胜者](/solution/1200-1299/1275.Find%20Winner%20on%20a%20Tic%20Tac%20Toe%20Game/README.md) +- [1276. 不浪费原料的汉堡制作方案](/solution/1200-1299/1276.Number%20of%20Burgers%20with%20No%20Waste%20of%20Ingredients/README.md) +- [1277. 统计全为 1 的正方形子矩阵](/solution/1200-1299/1277.Count%20Square%20Submatrices%20with%20All%20Ones/README.md) +- [1278. 分割回文串 III](/solution/1200-1299/1278.Palindrome%20Partitioning%20III/README.md) + + +#### 第 164 场周赛(2019-11-24 10:30, 90 分钟) + +- [1266. 访问所有点的最小时间](/solution/1200-1299/1266.Minimum%20Time%20Visiting%20All%20Points/README.md) +- [1267. 统计参与通信的服务器](/solution/1200-1299/1267.Count%20Servers%20that%20Communicate/README.md) +- [1268. 搜索推荐系统](/solution/1200-1299/1268.Search%20Suggestions%20System/README.md) +- [1269. 停在原地的方案数](/solution/1200-1299/1269.Number%20of%20Ways%20to%20Stay%20in%20the%20Same%20Place%20After%20Some%20Steps/README.md) + + +#### 第 13 场双周赛(2019-11-16 22:30, 90 分钟) + +- [1256. 加密数字](/solution/1200-1299/1256.Encode%20Number/README.md) +- [1257. 最小公共区域](/solution/1200-1299/1257.Smallest%20Common%20Region/README.md) +- [1258. 近义词句子](/solution/1200-1299/1258.Synonymous%20Sentences/README.md) +- [1259. 不相交的握手](/solution/1200-1299/1259.Handshakes%20That%20Don%27t%20Cross/README.md) + + +#### 第 163 场周赛(2019-11-17 10:30, 90 分钟) + +- [1260. 二维网格迁移](/solution/1200-1299/1260.Shift%202D%20Grid/README.md) +- [1261. 在受污染的二叉树中查找元素](/solution/1200-1299/1261.Find%20Elements%20in%20a%20Contaminated%20Binary%20Tree/README.md) +- [1262. 可被三整除的最大和](/solution/1200-1299/1262.Greatest%20Sum%20Divisible%20by%20Three/README.md) +- [1263. 推箱子](/solution/1200-1299/1263.Minimum%20Moves%20to%20Move%20a%20Box%20to%20Their%20Target%20Location/README.md) + + +#### 第 162 场周赛(2019-11-10 10:30, 90 分钟) + +- [1252. 奇数值单元格的数目](/solution/1200-1299/1252.Cells%20with%20Odd%20Values%20in%20a%20Matrix/README.md) +- [1253. 重构 2 行二进制矩阵](/solution/1200-1299/1253.Reconstruct%20a%202-Row%20Binary%20Matrix/README.md) +- [1254. 统计封闭岛屿的数目](/solution/1200-1299/1254.Number%20of%20Closed%20Islands/README.md) +- [1255. 得分最高的单词集合](/solution/1200-1299/1255.Maximum%20Score%20Words%20Formed%20by%20Letters/README.md) + + +#### 第 12 场双周赛(2019-11-02 22:30, 90 分钟) + +- [1244. 力扣排行榜](/solution/1200-1299/1244.Design%20A%20Leaderboard/README.md) +- [1243. 数组变换](/solution/1200-1299/1243.Array%20Transformation/README.md) +- [1245. 树的直径](/solution/1200-1299/1245.Tree%20Diameter/README.md) +- [1246. 删除回文子数组](/solution/1200-1299/1246.Palindrome%20Removal/README.md) + + +#### 第 161 场周赛(2019-11-03 10:30, 90 分钟) + +- [1247. 交换字符使得字符串相同](/solution/1200-1299/1247.Minimum%20Swaps%20to%20Make%20Strings%20Equal/README.md) +- [1248. 统计「优美子数组」](/solution/1200-1299/1248.Count%20Number%20of%20Nice%20Subarrays/README.md) +- [1249. 移除无效的括号](/solution/1200-1299/1249.Minimum%20Remove%20to%20Make%20Valid%20Parentheses/README.md) +- [1250. 检查「好数组」](/solution/1200-1299/1250.Check%20If%20It%20Is%20a%20Good%20Array/README.md) + + +#### 第 160 场周赛(2019-10-27 10:30, 90 分钟) + +- [1237. 找出给定方程的正整数解](/solution/1200-1299/1237.Find%20Positive%20Integer%20Solution%20for%20a%20Given%20Equation/README.md) +- [1238. 循环码排列](/solution/1200-1299/1238.Circular%20Permutation%20in%20Binary%20Representation/README.md) +- [1239. 串联字符串的最大长度](/solution/1200-1299/1239.Maximum%20Length%20of%20a%20Concatenated%20String%20with%20Unique%20Characters/README.md) +- [1240. 铺瓷砖](/solution/1200-1299/1240.Tiling%20a%20Rectangle%20with%20the%20Fewest%20Squares/README.md) + + +#### 第 11 场双周赛(2019-10-19 22:30, 90 分钟) + +- [1228. 等差数列中缺失的数字](/solution/1200-1299/1228.Missing%20Number%20In%20Arithmetic%20Progression/README.md) +- [1229. 安排会议日程](/solution/1200-1299/1229.Meeting%20Scheduler/README.md) +- [1230. 抛掷硬币](/solution/1200-1299/1230.Toss%20Strange%20Coins/README.md) +- [1231. 分享巧克力](/solution/1200-1299/1231.Divide%20Chocolate/README.md) + + +#### 第 159 场周赛(2019-10-20 10:30, 90 分钟) + +- [1232. 缀点成线](/solution/1200-1299/1232.Check%20If%20It%20Is%20a%20Straight%20Line/README.md) +- [1233. 删除子文件夹](/solution/1200-1299/1233.Remove%20Sub-Folders%20from%20the%20Filesystem/README.md) +- [1234. 替换子串得到平衡字符串](/solution/1200-1299/1234.Replace%20the%20Substring%20for%20Balanced%20String/README.md) +- [1235. 规划兼职工作](/solution/1200-1299/1235.Maximum%20Profit%20in%20Job%20Scheduling/README.md) + + +#### 第 158 场周赛(2019-10-13 10:30, 90 分钟) + +- [1221. 分割平衡字符串](/solution/1200-1299/1221.Split%20a%20String%20in%20Balanced%20Strings/README.md) +- [1222. 可以攻击国王的皇后](/solution/1200-1299/1222.Queens%20That%20Can%20Attack%20the%20King/README.md) +- [1223. 掷骰子模拟](/solution/1200-1299/1223.Dice%20Roll%20Simulation/README.md) +- [1224. 最大相等频率](/solution/1200-1299/1224.Maximum%20Equal%20Frequency/README.md) + + +#### 第 10 场双周赛(2019-10-05 22:30, 90 分钟) + +- [1213. 三个有序数组的交集](/solution/1200-1299/1213.Intersection%20of%20Three%20Sorted%20Arrays/README.md) +- [1214. 查找两棵二叉搜索树之和](/solution/1200-1299/1214.Two%20Sum%20BSTs/README.md) +- [1215. 步进数](/solution/1200-1299/1215.Stepping%20Numbers/README.md) +- [1216. 验证回文字符串 III](/solution/1200-1299/1216.Valid%20Palindrome%20III/README.md) + + +#### 第 157 场周赛(2019-10-06 10:30, 90 分钟) + +- [1217. 玩筹码](/solution/1200-1299/1217.Minimum%20Cost%20to%20Move%20Chips%20to%20The%20Same%20Position/README.md) +- [1218. 最长定差子序列](/solution/1200-1299/1218.Longest%20Arithmetic%20Subsequence%20of%20Given%20Difference/README.md) +- [1219. 黄金矿工](/solution/1200-1299/1219.Path%20with%20Maximum%20Gold/README.md) +- [1220. 统计元音字母序列的数目](/solution/1200-1299/1220.Count%20Vowels%20Permutation/README.md) + + +#### 第 156 场周赛(2019-09-29 10:30, 90 分钟) + +- [1207. 独一无二的出现次数](/solution/1200-1299/1207.Unique%20Number%20of%20Occurrences/README.md) +- [1208. 尽可能使字符串相等](/solution/1200-1299/1208.Get%20Equal%20Substrings%20Within%20Budget/README.md) +- [1209. 删除字符串中的所有相邻重复项 II](/solution/1200-1299/1209.Remove%20All%20Adjacent%20Duplicates%20in%20String%20II/README.md) +- [1210. 穿过迷宫的最少移动次数](/solution/1200-1299/1210.Minimum%20Moves%20to%20Reach%20Target%20with%20Rotations/README.md) + + +#### 第 9 场双周赛(2019-09-21 22:30, 95 分钟) + +- [1196. 最多可以买到的苹果数量](/solution/1100-1199/1196.How%20Many%20Apples%20Can%20You%20Put%20into%20the%20Basket/README.md) +- [1197. 进击的骑士](/solution/1100-1199/1197.Minimum%20Knight%20Moves/README.md) +- [1198. 找出所有行中最小公共元素](/solution/1100-1199/1198.Find%20Smallest%20Common%20Element%20in%20All%20Rows/README.md) +- [1199. 建造街区的最短时间](/solution/1100-1199/1199.Minimum%20Time%20to%20Build%20Blocks/README.md) + + +#### 第 155 场周赛(2019-09-22 10:30, 90 分钟) + +- [1200. 最小绝对差](/solution/1200-1299/1200.Minimum%20Absolute%20Difference/README.md) +- [1201. 丑数 III](/solution/1200-1299/1201.Ugly%20Number%20III/README.md) +- [1202. 交换字符串中的元素](/solution/1200-1299/1202.Smallest%20String%20With%20Swaps/README.md) +- [1203. 项目管理](/solution/1200-1299/1203.Sort%20Items%20by%20Groups%20Respecting%20Dependencies/README.md) + + +#### 第 154 场周赛(2019-09-15 10:30, 90 分钟) + +- [1189. “气球” 的最大数量](/solution/1100-1199/1189.Maximum%20Number%20of%20Balloons/README.md) +- [1190. 反转每对括号间的子串](/solution/1100-1199/1190.Reverse%20Substrings%20Between%20Each%20Pair%20of%20Parentheses/README.md) +- [1191. K 次串联后最大子数组之和](/solution/1100-1199/1191.K-Concatenation%20Maximum%20Sum/README.md) +- [1192. 查找集群内的「关键连接」](/solution/1100-1199/1192.Critical%20Connections%20in%20a%20Network/README.md) + + +#### 第 8 场双周赛(2019-09-07 22:30, 90 分钟) + +- [1180. 统计只含单一字母的子串](/solution/1100-1199/1180.Count%20Substrings%20with%20Only%20One%20Distinct%20Letter/README.md) +- [1181. 前后拼接](/solution/1100-1199/1181.Before%20and%20After%20Puzzle/README.md) +- [1182. 与目标颜色间的最短距离](/solution/1100-1199/1182.Shortest%20Distance%20to%20Target%20Color/README.md) +- [1183. 矩阵中 1 的最大数量](/solution/1100-1199/1183.Maximum%20Number%20of%20Ones/README.md) + + +#### 第 153 场周赛(2019-09-08 10:30, 90 分钟) + +- [1184. 公交站间的距离](/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/README.md) +- [1185. 一周中的第几天](/solution/1100-1199/1185.Day%20of%20the%20Week/README.md) +- [1186. 删除一次得到子数组最大和](/solution/1100-1199/1186.Maximum%20Subarray%20Sum%20with%20One%20Deletion/README.md) +- [1187. 使数组严格递增](/solution/1100-1199/1187.Make%20Array%20Strictly%20Increasing/README.md) + + +#### 第 152 场周赛(2019-09-01 10:30, 90 分钟) + +- [1175. 质数排列](/solution/1100-1199/1175.Prime%20Arrangements/README.md) +- [1176. 健身计划评估](/solution/1100-1199/1176.Diet%20Plan%20Performance/README.md) +- [1177. 构建回文串检测](/solution/1100-1199/1177.Can%20Make%20Palindrome%20from%20Substring/README.md) +- [1178. 猜字谜](/solution/1100-1199/1178.Number%20of%20Valid%20Words%20for%20Each%20Puzzle/README.md) + + +#### 第 7 场双周赛(2019-08-24 22:30, 90 分钟) + +- [1165. 单行键盘](/solution/1100-1199/1165.Single-Row%20Keyboard/README.md) +- [1166. 设计文件系统](/solution/1100-1199/1166.Design%20File%20System/README.md) +- [1167. 连接棒材的最低费用](/solution/1100-1199/1167.Minimum%20Cost%20to%20Connect%20Sticks/README.md) +- [1168. 水资源分配优化](/solution/1100-1199/1168.Optimize%20Water%20Distribution%20in%20a%20Village/README.md) + + +#### 第 151 场周赛(2019-08-25 10:30, 90 分钟) + +- [1169. 查询无效交易](/solution/1100-1199/1169.Invalid%20Transactions/README.md) +- [1170. 比较字符串最小字母出现频次](/solution/1100-1199/1170.Compare%20Strings%20by%20Frequency%20of%20the%20Smallest%20Character/README.md) +- [1171. 从链表中删去总和值为零的连续节点](/solution/1100-1199/1171.Remove%20Zero%20Sum%20Consecutive%20Nodes%20from%20Linked%20List/README.md) +- [1172. 餐盘栈](/solution/1100-1199/1172.Dinner%20Plate%20Stacks/README.md) + + +#### 第 150 场周赛(2019-08-18 10:30, 90 分钟) + +- [1160. 拼写单词](/solution/1100-1199/1160.Find%20Words%20That%20Can%20Be%20Formed%20by%20Characters/README.md) +- [1161. 最大层内元素和](/solution/1100-1199/1161.Maximum%20Level%20Sum%20of%20a%20Binary%20Tree/README.md) +- [1162. 地图分析](/solution/1100-1199/1162.As%20Far%20from%20Land%20as%20Possible/README.md) +- [1163. 按字典序排在最后的子串](/solution/1100-1199/1163.Last%20Substring%20in%20Lexicographical%20Order/README.md) + + +#### 第 6 场双周赛(2019-08-10 22:30, 90 分钟) + +- [1150. 检查一个数是否在数组中占绝大多数](/solution/1100-1199/1150.Check%20If%20a%20Number%20Is%20Majority%20Element%20in%20a%20Sorted%20Array/README.md) +- [1151. 最少交换次数来组合所有的 1](/solution/1100-1199/1151.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together/README.md) +- [1152. 用户网站访问行为分析](/solution/1100-1199/1152.Analyze%20User%20Website%20Visit%20Pattern/README.md) +- [1153. 字符串转化](/solution/1100-1199/1153.String%20Transforms%20Into%20Another%20String/README.md) + + +#### 第 149 场周赛(2019-08-11 10:30, 90 分钟) + +- [1154. 一年中的第几天](/solution/1100-1199/1154.Day%20of%20the%20Year/README.md) +- [1155. 掷骰子的N种方法](/solution/1100-1199/1155.Number%20of%20Dice%20Rolls%20With%20Target%20Sum/README.md) +- [1156. 单字符重复子串的最大长度](/solution/1100-1199/1156.Swap%20For%20Longest%20Repeated%20Character%20Substring/README.md) +- [1157. 子数组中占绝大多数的元素](/solution/1100-1199/1157.Online%20Majority%20Element%20In%20Subarray/README.md) + + +#### 第 148 场周赛(2019-08-04 10:30, 90 分钟) + +- [1144. 递减元素使数组呈锯齿状](/solution/1100-1199/1144.Decrease%20Elements%20To%20Make%20Array%20Zigzag/README.md) +- [1145. 二叉树着色游戏](/solution/1100-1199/1145.Binary%20Tree%20Coloring%20Game/README.md) +- [1146. 快照数组](/solution/1100-1199/1146.Snapshot%20Array/README.md) +- [1147. 段式回文](/solution/1100-1199/1147.Longest%20Chunked%20Palindrome%20Decomposition/README.md) + + +#### 第 5 场双周赛(2019-07-27 22:30, 90 分钟) + +- [1133. 最大唯一数](/solution/1100-1199/1133.Largest%20Unique%20Number/README.md) +- [1134. 阿姆斯特朗数](/solution/1100-1199/1134.Armstrong%20Number/README.md) +- [1135. 最低成本联通所有城市](/solution/1100-1199/1135.Connecting%20Cities%20With%20Minimum%20Cost/README.md) +- [1136. 平行课程](/solution/1100-1199/1136.Parallel%20Courses/README.md) + + +#### 第 147 场周赛(2019-07-28 10:30, 90 分钟) + +- [1137. 第 N 个泰波那契数](/solution/1100-1199/1137.N-th%20Tribonacci%20Number/README.md) +- [1138. 字母板上的路径](/solution/1100-1199/1138.Alphabet%20Board%20Path/README.md) +- [1139. 最大的以 1 为边界的正方形](/solution/1100-1199/1139.Largest%201-Bordered%20Square/README.md) +- [1140. 石子游戏 II](/solution/1100-1199/1140.Stone%20Game%20II/README.md) + + +#### 第 146 场周赛(2019-07-21 10:30, 90 分钟) + +- [1128. 等价多米诺骨牌对的数量](/solution/1100-1199/1128.Number%20of%20Equivalent%20Domino%20Pairs/README.md) +- [1129. 颜色交替的最短路径](/solution/1100-1199/1129.Shortest%20Path%20with%20Alternating%20Colors/README.md) +- [1130. 叶值的最小代价生成树](/solution/1100-1199/1130.Minimum%20Cost%20Tree%20From%20Leaf%20Values/README.md) +- [1131. 绝对值表达式的最大值](/solution/1100-1199/1131.Maximum%20of%20Absolute%20Value%20Expression/README.md) + + +#### 第 4 场双周赛(2019-07-13 22:30, 90 分钟) + +- [1118. 一月有多少天](/solution/1100-1199/1118.Number%20of%20Days%20in%20a%20Month/README.md) +- [1119. 删去字符串中的元音](/solution/1100-1199/1119.Remove%20Vowels%20from%20a%20String/README.md) +- [1120. 子树的最大平均值](/solution/1100-1199/1120.Maximum%20Average%20Subtree/README.md) +- [1121. 将数组分成几个递增序列](/solution/1100-1199/1121.Divide%20Array%20Into%20Increasing%20Sequences/README.md) + + +#### 第 145 场周赛(2019-07-14 10:30, 90 分钟) + +- [1122. 数组的相对排序](/solution/1100-1199/1122.Relative%20Sort%20Array/README.md) +- [1123. 最深叶节点的最近公共祖先](/solution/1100-1199/1123.Lowest%20Common%20Ancestor%20of%20Deepest%20Leaves/README.md) +- [1124. 表现良好的最长时间段](/solution/1100-1199/1124.Longest%20Well-Performing%20Interval/README.md) +- [1125. 最小的必要团队](/solution/1100-1199/1125.Smallest%20Sufficient%20Team/README.md) + + +#### 第 144 场周赛(2019-07-07 10:30, 90 分钟) + +- [1108. IP 地址无效化](/solution/1100-1199/1108.Defanging%20an%20IP%20Address/README.md) +- [1109. 航班预订统计](/solution/1100-1199/1109.Corporate%20Flight%20Bookings/README.md) +- [1110. 删点成林](/solution/1100-1199/1110.Delete%20Nodes%20And%20Return%20Forest/README.md) +- [1111. 有效括号的嵌套深度](/solution/1100-1199/1111.Maximum%20Nesting%20Depth%20of%20Two%20Valid%20Parentheses%20Strings/README.md) + + +#### 第 3 场双周赛(2019-06-29 22:30, 90 分钟) + +- [1099. 小于 K 的两数之和](/solution/1000-1099/1099.Two%20Sum%20Less%20Than%20K/README.md) +- [1100. 长度为 K 的无重复字符子串](/solution/1100-1199/1100.Find%20K-Length%20Substrings%20With%20No%20Repeated%20Characters/README.md) +- [1101. 彼此熟识的最早时间](/solution/1100-1199/1101.The%20Earliest%20Moment%20When%20Everyone%20Become%20Friends/README.md) +- [1102. 得分最高的路径](/solution/1100-1199/1102.Path%20With%20Maximum%20Minimum%20Value/README.md) + + +#### 第 143 场周赛(2019-06-30 10:30, 90 分钟) + +- [1103. 分糖果 II](/solution/1100-1199/1103.Distribute%20Candies%20to%20People/README.md) +- [1104. 二叉树寻路](/solution/1100-1199/1104.Path%20In%20Zigzag%20Labelled%20Binary%20Tree/README.md) +- [1105. 填充书架](/solution/1100-1199/1105.Filling%20Bookcase%20Shelves/README.md) +- [1106. 解析布尔表达式](/solution/1100-1199/1106.Parsing%20A%20Boolean%20Expression/README.md) + + +#### 第 142 场周赛(2019-06-23 10:30, 90 分钟) + +- [1093. 大样本统计](/solution/1000-1099/1093.Statistics%20from%20a%20Large%20Sample/README.md) +- [1094. 拼车](/solution/1000-1099/1094.Car%20Pooling/README.md) +- [1095. 山脉数组中查找目标值](/solution/1000-1099/1095.Find%20in%20Mountain%20Array/README.md) +- [1096. 花括号展开 II](/solution/1000-1099/1096.Brace%20Expansion%20II/README.md) + + +#### 第 2 场双周赛(2019-06-15 22:30, 90 分钟) + +- [1085. 最小元素各数位之和](/solution/1000-1099/1085.Sum%20of%20Digits%20in%20the%20Minimum%20Number/README.md) +- [1086. 前五科的均分](/solution/1000-1099/1086.High%20Five/README.md) +- [1087. 花括号展开](/solution/1000-1099/1087.Brace%20Expansion/README.md) +- [1088. 易混淆数 II](/solution/1000-1099/1088.Confusing%20Number%20II/README.md) + + +#### 第 141 场周赛(2019-06-16 10:30, 90 分钟) + +- [1089. 复写零](/solution/1000-1099/1089.Duplicate%20Zeros/README.md) +- [1090. 受标签影响的最大值](/solution/1000-1099/1090.Largest%20Values%20From%20Labels/README.md) +- [1091. 二进制矩阵中的最短路径](/solution/1000-1099/1091.Shortest%20Path%20in%20Binary%20Matrix/README.md) +- [1092. 最短公共超序列](/solution/1000-1099/1092.Shortest%20Common%20Supersequence/README.md) + + +#### 第 140 场周赛(2019-06-09 10:30, 90 分钟) + +- [1078. Bigram 分词](/solution/1000-1099/1078.Occurrences%20After%20Bigram/README.md) +- [1079. 活字印刷](/solution/1000-1099/1079.Letter%20Tile%20Possibilities/README.md) +- [1080. 根到叶路径上的不足节点](/solution/1000-1099/1080.Insufficient%20Nodes%20in%20Root%20to%20Leaf%20Paths/README.md) +- [1081. 不同字符的最小子序列](/solution/1000-1099/1081.Smallest%20Subsequence%20of%20Distinct%20Characters/README.md) + + +#### 第 1 场双周赛(2019-06-01 22:30, 120 分钟) + +- [1064. 不动点](/solution/1000-1099/1064.Fixed%20Point/README.md) +- [1065. 字符串的索引对](/solution/1000-1099/1065.Index%20Pairs%20of%20a%20String/README.md) +- [1066. 校园自行车分配 II](/solution/1000-1099/1066.Campus%20Bikes%20II/README.md) +- [1067. 范围内的数字计数](/solution/1000-1099/1067.Digit%20Count%20in%20Range/README.md) + + +#### 第 139 场周赛(2019-06-02 10:30, 90 分钟) + +- [1071. 字符串的最大公因子](/solution/1000-1099/1071.Greatest%20Common%20Divisor%20of%20Strings/README.md) +- [1072. 按列翻转得到最大值等行数](/solution/1000-1099/1072.Flip%20Columns%20For%20Maximum%20Number%20of%20Equal%20Rows/README.md) +- [1073. 负二进制数相加](/solution/1000-1099/1073.Adding%20Two%20Negabinary%20Numbers/README.md) +- [1074. 元素和为目标值的子矩阵数量](/solution/1000-1099/1074.Number%20of%20Submatrices%20That%20Sum%20to%20Target/README.md) + + +#### 第 138 场周赛(2019-05-26 10:30, 90 分钟) + +- [1051. 高度检查器](/solution/1000-1099/1051.Height%20Checker/README.md) +- [1052. 爱生气的书店老板](/solution/1000-1099/1052.Grumpy%20Bookstore%20Owner/README.md) +- [1053. 交换一次的先前排列](/solution/1000-1099/1053.Previous%20Permutation%20With%20One%20Swap/README.md) +- [1054. 距离相等的条形码](/solution/1000-1099/1054.Distant%20Barcodes/README.md) + + +#### 第 137 场周赛(2019-05-19 10:30, 90 分钟) + +- [1046. 最后一块石头的重量](/solution/1000-1099/1046.Last%20Stone%20Weight/README.md) +- [1047. 删除字符串中的所有相邻重复项](/solution/1000-1099/1047.Remove%20All%20Adjacent%20Duplicates%20In%20String/README.md) +- [1048. 最长字符串链](/solution/1000-1099/1048.Longest%20String%20Chain/README.md) +- [1049. 最后一块石头的重量 II](/solution/1000-1099/1049.Last%20Stone%20Weight%20II/README.md) + + +#### 第 136 场周赛(2019-05-12 10:30, 90 分钟) + +- [1041. 困于环中的机器人](/solution/1000-1099/1041.Robot%20Bounded%20In%20Circle/README.md) +- [1042. 不邻接植花](/solution/1000-1099/1042.Flower%20Planting%20With%20No%20Adjacent/README.md) +- [1043. 分隔数组以得到最大和](/solution/1000-1099/1043.Partition%20Array%20for%20Maximum%20Sum/README.md) +- [1044. 最长重复子串](/solution/1000-1099/1044.Longest%20Duplicate%20Substring/README.md) + + +#### 第 135 场周赛(2019-05-05 10:30, 90 分钟) + +- [1037. 有效的回旋镖](/solution/1000-1099/1037.Valid%20Boomerang/README.md) +- [1038. 从二叉搜索树到更大和树](/solution/1000-1099/1038.Binary%20Search%20Tree%20to%20Greater%20Sum%20Tree/README.md) +- [1039. 多边形三角剖分的最低得分](/solution/1000-1099/1039.Minimum%20Score%20Triangulation%20of%20Polygon/README.md) +- [1040. 移动石子直到连续 II](/solution/1000-1099/1040.Moving%20Stones%20Until%20Consecutive%20II/README.md) + + +#### 第 134 场周赛(2019-04-28 10:30, 90 分钟) + +- [1033. 移动石子直到连续](/solution/1000-1099/1033.Moving%20Stones%20Until%20Consecutive/README.md) +- [1034. 边界着色](/solution/1000-1099/1034.Coloring%20A%20Border/README.md) +- [1035. 不相交的线](/solution/1000-1099/1035.Uncrossed%20Lines/README.md) +- [1036. 逃离大迷宫](/solution/1000-1099/1036.Escape%20a%20Large%20Maze/README.md) + + +#### 第 133 场周赛(2019-04-21 10:30, 90 分钟) + +- [1029. 两地调度](/solution/1000-1099/1029.Two%20City%20Scheduling/README.md) +- [1030. 距离顺序排列矩阵单元格](/solution/1000-1099/1030.Matrix%20Cells%20in%20Distance%20Order/README.md) +- [1031. 两个非重叠子数组的最大和](/solution/1000-1099/1031.Maximum%20Sum%20of%20Two%20Non-Overlapping%20Subarrays/README.md) +- [1032. 字符流](/solution/1000-1099/1032.Stream%20of%20Characters/README.md) + + +#### 第 132 场周赛(2019-04-14 10:30, 90 分钟) + +- [1025. 除数博弈](/solution/1000-1099/1025.Divisor%20Game/README.md) +- [1026. 节点与其祖先之间的最大差值](/solution/1000-1099/1026.Maximum%20Difference%20Between%20Node%20and%20Ancestor/README.md) +- [1027. 最长等差数列](/solution/1000-1099/1027.Longest%20Arithmetic%20Subsequence/README.md) +- [1028. 从先序遍历还原二叉树](/solution/1000-1099/1028.Recover%20a%20Tree%20From%20Preorder%20Traversal/README.md) + + +#### 第 131 场周赛(2019-04-07 10:30, 90 分钟) + +- [1021. 删除最外层的括号](/solution/1000-1099/1021.Remove%20Outermost%20Parentheses/README.md) +- [1022. 从根到叶的二进制数之和](/solution/1000-1099/1022.Sum%20of%20Root%20To%20Leaf%20Binary%20Numbers/README.md) +- [1023. 驼峰式匹配](/solution/1000-1099/1023.Camelcase%20Matching/README.md) +- [1024. 视频拼接](/solution/1000-1099/1024.Video%20Stitching/README.md) + + +#### 第 130 场周赛(2019-03-31 10:30, 90 分钟) + +- [1018. 可被 5 整除的二进制前缀](/solution/1000-1099/1018.Binary%20Prefix%20Divisible%20By%205/README.md) +- [1017. 负二进制转换](/solution/1000-1099/1017.Convert%20to%20Base%20-2/README.md) +- [1019. 链表中的下一个更大节点](/solution/1000-1099/1019.Next%20Greater%20Node%20In%20Linked%20List/README.md) +- [1020. 飞地的数量](/solution/1000-1099/1020.Number%20of%20Enclaves/README.md) + + +#### 第 129 场周赛(2019-03-24 09:30, 90 分钟) + +- [1013. 将数组分成和相等的三个部分](/solution/1000-1099/1013.Partition%20Array%20Into%20Three%20Parts%20With%20Equal%20Sum/README.md) +- [1015. 可被 K 整除的最小整数](/solution/1000-1099/1015.Smallest%20Integer%20Divisible%20by%20K/README.md) +- [1014. 最佳观光组合](/solution/1000-1099/1014.Best%20Sightseeing%20Pair/README.md) +- [1016. 子串能表示从 1 到 N 数字的二进制串](/solution/1000-1099/1016.Binary%20String%20With%20Substrings%20Representing%201%20To%20N/README.md) + + +#### 第 128 场周赛(2019-03-17 10:30, 90 分钟) + +- [1009. 十进制整数的反码](/solution/1000-1099/1009.Complement%20of%20Base%2010%20Integer/README.md) +- [1010. 总持续时间可被 60 整除的歌曲](/solution/1000-1099/1010.Pairs%20of%20Songs%20With%20Total%20Durations%20Divisible%20by%2060/README.md) +- [1011. 在 D 天内送达包裹的能力](/solution/1000-1099/1011.Capacity%20To%20Ship%20Packages%20Within%20D%20Days/README.md) +- [1012. 至少有 1 位重复的数字](/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README.md) + + +#### 第 127 场周赛(2019-03-10 10:30, 90 分钟) + +- [1005. K 次取反后最大化的数组和](/solution/1000-1099/1005.Maximize%20Sum%20Of%20Array%20After%20K%20Negations/README.md) +- [1006. 笨阶乘](/solution/1000-1099/1006.Clumsy%20Factorial/README.md) +- [1007. 行相等的最少多米诺旋转](/solution/1000-1099/1007.Minimum%20Domino%20Rotations%20For%20Equal%20Row/README.md) +- [1008. 前序遍历构造二叉搜索树](/solution/1000-1099/1008.Construct%20Binary%20Search%20Tree%20from%20Preorder%20Traversal/README.md) + + +#### 第 126 场周赛(2019-03-03 10:30, 90 分钟) + +- [1002. 查找共用字符](/solution/1000-1099/1002.Find%20Common%20Characters/README.md) +- [1003. 检查替换后的词是否有效](/solution/1000-1099/1003.Check%20If%20Word%20Is%20Valid%20After%20Substitutions/README.md) +- [1004. 最大连续1的个数 III](/solution/1000-1099/1004.Max%20Consecutive%20Ones%20III/README.md) +- [1000. 合并石头的最低成本](/solution/1000-1099/1000.Minimum%20Cost%20to%20Merge%20Stones/README.md) + + +#### 第 125 场周赛(2019-02-24 10:30, 90 分钟) + +- [997. 找到小镇的法官](/solution/0900-0999/0997.Find%20the%20Town%20Judge/README.md) +- [999. 可以被一步捕获的棋子数](/solution/0900-0999/0999.Available%20Captures%20for%20Rook/README.md) +- [998. 最大二叉树 II](/solution/0900-0999/0998.Maximum%20Binary%20Tree%20II/README.md) +- [1001. 网格照明](/solution/1000-1099/1001.Grid%20Illumination/README.md) + + +#### 第 124 场周赛(2019-02-17 10:30, 90 分钟) + +- [993. 二叉树的堂兄弟节点](/solution/0900-0999/0993.Cousins%20in%20Binary%20Tree/README.md) +- [994. 腐烂的橘子](/solution/0900-0999/0994.Rotting%20Oranges/README.md) +- [995. K 连续位的最小翻转次数](/solution/0900-0999/0995.Minimum%20Number%20of%20K%20Consecutive%20Bit%20Flips/README.md) +- [996. 正方形数组的数目](/solution/0900-0999/0996.Number%20of%20Squareful%20Arrays/README.md) + + +#### 第 123 场周赛(2019-02-10 10:30, 90 分钟) + +- [989. 数组形式的整数加法](/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README.md) +- [990. 等式方程的可满足性](/solution/0900-0999/0990.Satisfiability%20of%20Equality%20Equations/README.md) +- [991. 坏了的计算器](/solution/0900-0999/0991.Broken%20Calculator/README.md) +- [992. K 个不同整数的子数组](/solution/0900-0999/0992.Subarrays%20with%20K%20Different%20Integers/README.md) + + +#### 第 122 场周赛(2019-02-03 10:30, 90 分钟) + +- [985. 查询后的偶数和](/solution/0900-0999/0985.Sum%20of%20Even%20Numbers%20After%20Queries/README.md) +- [988. 从叶结点开始的最小字符串](/solution/0900-0999/0988.Smallest%20String%20Starting%20From%20Leaf/README.md) +- [986. 区间列表的交集](/solution/0900-0999/0986.Interval%20List%20Intersections/README.md) +- [987. 二叉树的垂序遍历](/solution/0900-0999/0987.Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree/README.md) + + +#### 第 121 场周赛(2019-01-27 10:30, 90 分钟) + +- [984. 不含 AAA 或 BBB 的字符串](/solution/0900-0999/0984.String%20Without%20AAA%20or%20BBB/README.md) +- [981. 基于时间的键值存储](/solution/0900-0999/0981.Time%20Based%20Key-Value%20Store/README.md) +- [983. 最低票价](/solution/0900-0999/0983.Minimum%20Cost%20For%20Tickets/README.md) +- [982. 按位与为零的三元组](/solution/0900-0999/0982.Triples%20with%20Bitwise%20AND%20Equal%20To%20Zero/README.md) + + +#### 第 120 场周赛(2019-01-20 10:30, 90 分钟) + +- [977. 有序数组的平方](/solution/0900-0999/0977.Squares%20of%20a%20Sorted%20Array/README.md) +- [978. 最长湍流子数组](/solution/0900-0999/0978.Longest%20Turbulent%20Subarray/README.md) +- [979. 在二叉树中分配硬币](/solution/0900-0999/0979.Distribute%20Coins%20in%20Binary%20Tree/README.md) +- [980. 不同路径 III](/solution/0900-0999/0980.Unique%20Paths%20III/README.md) + + +#### 第 119 场周赛(2019-01-13 10:30, 90 分钟) + +- [973. 最接近原点的 K 个点](/solution/0900-0999/0973.K%20Closest%20Points%20to%20Origin/README.md) +- [976. 三角形的最大周长](/solution/0900-0999/0976.Largest%20Perimeter%20Triangle/README.md) +- [974. 和可被 K 整除的子数组](/solution/0900-0999/0974.Subarray%20Sums%20Divisible%20by%20K/README.md) +- [975. 奇偶跳](/solution/0900-0999/0975.Odd%20Even%20Jump/README.md) + + +#### 第 118 场周赛(2019-01-06 10:30, 90 分钟) + +- [970. 强整数](/solution/0900-0999/0970.Powerful%20Integers/README.md) +- [969. 煎饼排序](/solution/0900-0999/0969.Pancake%20Sorting/README.md) +- [971. 翻转二叉树以匹配先序遍历](/solution/0900-0999/0971.Flip%20Binary%20Tree%20To%20Match%20Preorder%20Traversal/README.md) +- [972. 相等的有理数](/solution/0900-0999/0972.Equal%20Rational%20Numbers/README.md) + + +#### 第 117 场周赛(2018-12-30 10:30, 90 分钟) + +- [965. 单值二叉树](/solution/0900-0999/0965.Univalued%20Binary%20Tree/README.md) +- [967. 连续差相同的数字](/solution/0900-0999/0967.Numbers%20With%20Same%20Consecutive%20Differences/README.md) +- [966. 元音拼写检查器](/solution/0900-0999/0966.Vowel%20Spellchecker/README.md) +- [968. 监控二叉树](/solution/0900-0999/0968.Binary%20Tree%20Cameras/README.md) + + +#### 第 116 场周赛(2018-12-23 10:30, 90 分钟) + +- [961. 在长度 2N 的数组中找出重复 N 次的元素](/solution/0900-0999/0961.N-Repeated%20Element%20in%20Size%202N%20Array/README.md) +- [962. 最大宽度坡](/solution/0900-0999/0962.Maximum%20Width%20Ramp/README.md) +- [963. 最小面积矩形 II](/solution/0900-0999/0963.Minimum%20Area%20Rectangle%20II/README.md) +- [964. 表示数字的最少运算符](/solution/0900-0999/0964.Least%20Operators%20to%20Express%20Number/README.md) + + +#### 第 115 场周赛(2018-12-16 10:30, 90 分钟) + +- [957. N 天后的牢房](/solution/0900-0999/0957.Prison%20Cells%20After%20N%20Days/README.md) +- [958. 二叉树的完全性检验](/solution/0900-0999/0958.Check%20Completeness%20of%20a%20Binary%20Tree/README.md) +- [959. 由斜杠划分区域](/solution/0900-0999/0959.Regions%20Cut%20By%20Slashes/README.md) +- [960. 删列造序 III](/solution/0900-0999/0960.Delete%20Columns%20to%20Make%20Sorted%20III/README.md) + + +#### 第 114 场周赛(2018-12-09 10:30, 90 分钟) + +- [953. 验证外星语词典](/solution/0900-0999/0953.Verifying%20an%20Alien%20Dictionary/README.md) +- [954. 二倍数对数组](/solution/0900-0999/0954.Array%20of%20Doubled%20Pairs/README.md) +- [955. 删列造序 II](/solution/0900-0999/0955.Delete%20Columns%20to%20Make%20Sorted%20II/README.md) +- [956. 最高的广告牌](/solution/0900-0999/0956.Tallest%20Billboard/README.md) + + +#### 第 113 场周赛(2018-12-02 10:30, 90 分钟) + +- [949. 给定数字能组成的最大时间](/solution/0900-0999/0949.Largest%20Time%20for%20Given%20Digits/README.md) +- [951. 翻转等价二叉树](/solution/0900-0999/0951.Flip%20Equivalent%20Binary%20Trees/README.md) +- [950. 按递增顺序显示卡牌](/solution/0900-0999/0950.Reveal%20Cards%20In%20Increasing%20Order/README.md) +- [952. 按公因数计算最大组件大小](/solution/0900-0999/0952.Largest%20Component%20Size%20by%20Common%20Factor/README.md) + + +#### 第 112 场周赛(2018-11-25 10:30, 90 分钟) + +- [945. 使数组唯一的最小增量](/solution/0900-0999/0945.Minimum%20Increment%20to%20Make%20Array%20Unique/README.md) +- [946. 验证栈序列](/solution/0900-0999/0946.Validate%20Stack%20Sequences/README.md) +- [947. 移除最多的同行或同列石头](/solution/0900-0999/0947.Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column/README.md) +- [948. 令牌放置](/solution/0900-0999/0948.Bag%20of%20Tokens/README.md) + + +#### 第 111 场周赛(2018-11-18 10:30, 90 分钟) + +- [941. 有效的山脉数组](/solution/0900-0999/0941.Valid%20Mountain%20Array/README.md) +- [944. 删列造序](/solution/0900-0999/0944.Delete%20Columns%20to%20Make%20Sorted/README.md) +- [942. 增减字符串匹配](/solution/0900-0999/0942.DI%20String%20Match/README.md) +- [943. 最短超级串](/solution/0900-0999/0943.Find%20the%20Shortest%20Superstring/README.md) + + +#### 第 110 场周赛(2018-11-11 10:30, 90 分钟) + +- [937. 重新排列日志文件](/solution/0900-0999/0937.Reorder%20Data%20in%20Log%20Files/README.md) +- [938. 二叉搜索树的范围和](/solution/0900-0999/0938.Range%20Sum%20of%20BST/README.md) +- [939. 最小面积矩形](/solution/0900-0999/0939.Minimum%20Area%20Rectangle/README.md) +- [940. 不同的子序列 II](/solution/0900-0999/0940.Distinct%20Subsequences%20II/README.md) + + +#### 第 109 场周赛(2018-11-04 09:30, 90 分钟) + +- [933. 最近的请求次数](/solution/0900-0999/0933.Number%20of%20Recent%20Calls/README.md) +- [935. 骑士拨号器](/solution/0900-0999/0935.Knight%20Dialer/README.md) +- [934. 最短的桥](/solution/0900-0999/0934.Shortest%20Bridge/README.md) +- [936. 戳印序列](/solution/0900-0999/0936.Stamping%20The%20Sequence/README.md) + + +#### 第 108 场周赛(2018-10-28 09:30, 90 分钟) + +- [929. 独特的电子邮件地址](/solution/0900-0999/0929.Unique%20Email%20Addresses/README.md) +- [930. 和相同的二元子数组](/solution/0900-0999/0930.Binary%20Subarrays%20With%20Sum/README.md) +- [931. 下降路径最小和](/solution/0900-0999/0931.Minimum%20Falling%20Path%20Sum/README.md) +- [932. 漂亮数组](/solution/0900-0999/0932.Beautiful%20Array/README.md) + + +#### 第 107 场周赛(2018-10-21 09:30, 90 分钟) + +- [925. 长按键入](/solution/0900-0999/0925.Long%20Pressed%20Name/README.md) +- [926. 将字符串翻转到单调递增](/solution/0900-0999/0926.Flip%20String%20to%20Monotone%20Increasing/README.md) +- [927. 三等分](/solution/0900-0999/0927.Three%20Equal%20Parts/README.md) +- [928. 尽量减少恶意软件的传播 II](/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README.md) + + +#### 第 106 场周赛(2018-10-14 09:30, 90 分钟) + +- [922. 按奇偶排序数组 II](/solution/0900-0999/0922.Sort%20Array%20By%20Parity%20II/README.md) +- [921. 使括号有效的最少添加](/solution/0900-0999/0921.Minimum%20Add%20to%20Make%20Parentheses%20Valid/README.md) +- [923. 三数之和的多种可能](/solution/0900-0999/0923.3Sum%20With%20Multiplicity/README.md) +- [924. 尽量减少恶意软件的传播](/solution/0900-0999/0924.Minimize%20Malware%20Spread/README.md) + + +#### 第 105 场周赛(2018-10-07 09:30, 90 分钟) + +- [917. 仅仅反转字母](/solution/0900-0999/0917.Reverse%20Only%20Letters/README.md) +- [918. 环形子数组的最大和](/solution/0900-0999/0918.Maximum%20Sum%20Circular%20Subarray/README.md) +- [919. 完全二叉树插入器](/solution/0900-0999/0919.Complete%20Binary%20Tree%20Inserter/README.md) +- [920. 播放列表的数量](/solution/0900-0999/0920.Number%20of%20Music%20Playlists/README.md) + + +#### 第 104 场周赛(2018-09-30 09:30, 90 分钟) + +- [914. 卡牌分组](/solution/0900-0999/0914.X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/README.md) +- [915. 分割数组](/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README.md) +- [916. 单词子集](/solution/0900-0999/0916.Word%20Subsets/README.md) +- [913. 猫和老鼠](/solution/0900-0999/0913.Cat%20and%20Mouse/README.md) + + +#### 第 103 场周赛(2018-09-23 09:30, 90 分钟) + +- [908. 最小差值 I](/solution/0900-0999/0908.Smallest%20Range%20I/README.md) +- [909. 蛇梯棋](/solution/0900-0999/0909.Snakes%20and%20Ladders/README.md) +- [910. 最小差值 II](/solution/0900-0999/0910.Smallest%20Range%20II/README.md) +- [911. 在线选举](/solution/0900-0999/0911.Online%20Election/README.md) + + +#### 第 102 场周赛(2018-09-16 09:30, 90 分钟) + +- [905. 按奇偶排序数组](/solution/0900-0999/0905.Sort%20Array%20By%20Parity/README.md) +- [904. 水果成篮](/solution/0900-0999/0904.Fruit%20Into%20Baskets/README.md) +- [907. 子数组的最小值之和](/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README.md) +- [906. 超级回文数](/solution/0900-0999/0906.Super%20Palindromes/README.md) + + +#### 第 101 场周赛(2018-09-09 09:30, 105 分钟) + +- [900. RLE 迭代器](/solution/0900-0999/0900.RLE%20Iterator/README.md) +- [901. 股票价格跨度](/solution/0900-0999/0901.Online%20Stock%20Span/README.md) +- [902. 最大为 N 的数字组合](/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README.md) +- [903. DI 序列的有效排列](/solution/0900-0999/0903.Valid%20Permutations%20for%20DI%20Sequence/README.md) + + +#### 第 100 场周赛(2018-09-02 09:30, 90 分钟) + +- [896. 单调数列](/solution/0800-0899/0896.Monotonic%20Array/README.md) +- [897. 递增顺序搜索树](/solution/0800-0899/0897.Increasing%20Order%20Search%20Tree/README.md) +- [898. 子数组按位或操作](/solution/0800-0899/0898.Bitwise%20ORs%20of%20Subarrays/README.md) +- [899. 有序队列](/solution/0800-0899/0899.Orderly%20Queue/README.md) + + +#### 第 99 场周赛(2018-08-26 09:30, 90 分钟) + +- [892. 三维形体的表面积](/solution/0800-0899/0892.Surface%20Area%20of%203D%20Shapes/README.md) +- [893. 特殊等价字符串组](/solution/0800-0899/0893.Groups%20of%20Special-Equivalent%20Strings/README.md) +- [894. 所有可能的满二叉树](/solution/0800-0899/0894.All%20Possible%20Full%20Binary%20Trees/README.md) +- [895. 最大频率栈](/solution/0800-0899/0895.Maximum%20Frequency%20Stack/README.md) + + +#### 第 98 场周赛(2018-08-19 09:30, 90 分钟) + +- [888. 公平的糖果交换](/solution/0800-0899/0888.Fair%20Candy%20Swap/README.md) +- [890. 查找和替换模式](/solution/0800-0899/0890.Find%20and%20Replace%20Pattern/README.md) +- [889. 根据前序和后序遍历构造二叉树](/solution/0800-0899/0889.Construct%20Binary%20Tree%20from%20Preorder%20and%20Postorder%20Traversal/README.md) +- [891. 子序列宽度之和](/solution/0800-0899/0891.Sum%20of%20Subsequence%20Widths/README.md) + + +#### 第 97 场周赛(2018-08-12 09:30, 90 分钟) + +- [884. 两句话中的不常见单词](/solution/0800-0899/0884.Uncommon%20Words%20from%20Two%20Sentences/README.md) +- [885. 螺旋矩阵 III](/solution/0800-0899/0885.Spiral%20Matrix%20III/README.md) +- [886. 可能的二分法](/solution/0800-0899/0886.Possible%20Bipartition/README.md) +- [887. 鸡蛋掉落](/solution/0800-0899/0887.Super%20Egg%20Drop/README.md) + + +#### 第 96 场周赛(2018-08-05 09:30, 90 分钟) + +- [883. 三维形体投影面积](/solution/0800-0899/0883.Projection%20Area%20of%203D%20Shapes/README.md) +- [881. 救生艇](/solution/0800-0899/0881.Boats%20to%20Save%20People/README.md) +- [880. 索引处的解码字符串](/solution/0800-0899/0880.Decoded%20String%20at%20Index/README.md) +- [882. 细分图中的可到达结点](/solution/0800-0899/0882.Reachable%20Nodes%20In%20Subdivided%20Graph/README.md) + + +#### 第 95 场周赛(2018-07-29 09:30, 90 分钟) + +- [876. 链表的中间结点](/solution/0800-0899/0876.Middle%20of%20the%20Linked%20List/README.md) +- [877. 石子游戏](/solution/0800-0899/0877.Stone%20Game/README.md) +- [878. 第 N 个神奇数字](/solution/0800-0899/0878.Nth%20Magical%20Number/README.md) +- [879. 盈利计划](/solution/0800-0899/0879.Profitable%20Schemes/README.md) + + +#### 第 94 场周赛(2018-07-22 09:30, 90 分钟) + +- [872. 叶子相似的树](/solution/0800-0899/0872.Leaf-Similar%20Trees/README.md) +- [874. 模拟行走机器人](/solution/0800-0899/0874.Walking%20Robot%20Simulation/README.md) +- [875. 爱吃香蕉的珂珂](/solution/0800-0899/0875.Koko%20Eating%20Bananas/README.md) +- [873. 最长的斐波那契子序列的长度](/solution/0800-0899/0873.Length%20of%20Longest%20Fibonacci%20Subsequence/README.md) + + +#### 第 93 场周赛(2018-07-15 09:30, 90 分钟) + +- [868. 二进制间距](/solution/0800-0899/0868.Binary%20Gap/README.md) +- [869. 重新排序得到 2 的幂](/solution/0800-0899/0869.Reordered%20Power%20of%202/README.md) +- [870. 优势洗牌](/solution/0800-0899/0870.Advantage%20Shuffle/README.md) +- [871. 最低加油次数](/solution/0800-0899/0871.Minimum%20Number%20of%20Refueling%20Stops/README.md) + + +#### 第 92 场周赛(2018-07-08 09:30, 90 分钟) + +- [867. 转置矩阵](/solution/0800-0899/0867.Transpose%20Matrix/README.md) +- [865. 具有所有最深节点的最小子树](/solution/0800-0899/0865.Smallest%20Subtree%20with%20all%20the%20Deepest%20Nodes/README.md) +- [866. 回文素数](/solution/0800-0899/0866.Prime%20Palindrome/README.md) +- [864. 获取所有钥匙的最短路径](/solution/0800-0899/0864.Shortest%20Path%20to%20Get%20All%20Keys/README.md) + + +#### 第 91 场周赛(2018-07-01 09:30, 90 分钟) + +- [860. 柠檬水找零](/solution/0800-0899/0860.Lemonade%20Change/README.md) +- [863. 二叉树中所有距离为 K 的结点](/solution/0800-0899/0863.All%20Nodes%20Distance%20K%20in%20Binary%20Tree/README.md) +- [861. 翻转矩阵后的得分](/solution/0800-0899/0861.Score%20After%20Flipping%20Matrix/README.md) +- [862. 和至少为 K 的最短子数组](/solution/0800-0899/0862.Shortest%20Subarray%20with%20Sum%20at%20Least%20K/README.md) + + +#### 第 90 场周赛(2018-06-24 09:30, 90 分钟) + +- [859. 亲密字符串](/solution/0800-0899/0859.Buddy%20Strings/README.md) +- [856. 括号的分数](/solution/0800-0899/0856.Score%20of%20Parentheses/README.md) +- [858. 镜面反射](/solution/0800-0899/0858.Mirror%20Reflection/README.md) +- [857. 雇佣 K 名工人的最低成本](/solution/0800-0899/0857.Minimum%20Cost%20to%20Hire%20K%20Workers/README.md) + + +#### 第 89 场周赛(2018-06-17 09:30, 90 分钟) + +- [852. 山脉数组的峰顶索引](/solution/0800-0899/0852.Peak%20Index%20in%20a%20Mountain%20Array/README.md) +- [853. 车队](/solution/0800-0899/0853.Car%20Fleet/README.md) +- [855. 考场就座](/solution/0800-0899/0855.Exam%20Room/README.md) +- [854. 相似度为 K 的字符串](/solution/0800-0899/0854.K-Similar%20Strings/README.md) + + +#### 第 88 场周赛(2018-06-10 09:30, 90 分钟) + +- [848. 字母移位](/solution/0800-0899/0848.Shifting%20Letters/README.md) +- [849. 到最近的人的最大距离](/solution/0800-0899/0849.Maximize%20Distance%20to%20Closest%20Person/README.md) +- [851. 喧闹和富有](/solution/0800-0899/0851.Loud%20and%20Rich/README.md) +- [850. 矩形面积 II](/solution/0800-0899/0850.Rectangle%20Area%20II/README.md) + + +#### 第 87 场周赛(2018-06-03 09:30, 90 分钟) + +- [844. 比较含退格的字符串](/solution/0800-0899/0844.Backspace%20String%20Compare/README.md) +- [845. 数组中的最长山脉](/solution/0800-0899/0845.Longest%20Mountain%20in%20Array/README.md) +- [846. 一手顺子](/solution/0800-0899/0846.Hand%20of%20Straights/README.md) +- [847. 访问所有节点的最短路径](/solution/0800-0899/0847.Shortest%20Path%20Visiting%20All%20Nodes/README.md) + + +#### 第 86 场周赛(2018-05-27 09:30, 90 分钟) + +- [840. 矩阵中的幻方](/solution/0800-0899/0840.Magic%20Squares%20In%20Grid/README.md) +- [841. 钥匙和房间](/solution/0800-0899/0841.Keys%20and%20Rooms/README.md) +- [842. 将数组拆分成斐波那契序列](/solution/0800-0899/0842.Split%20Array%20into%20Fibonacci%20Sequence/README.md) +- [843. 猜猜这个单词](/solution/0800-0899/0843.Guess%20the%20Word/README.md) + + +#### 第 85 场周赛(2018-05-20 09:30, 90 分钟) + +- [836. 矩形重叠](/solution/0800-0899/0836.Rectangle%20Overlap/README.md) +- [838. 推多米诺](/solution/0800-0899/0838.Push%20Dominoes/README.md) +- [837. 新 21 点](/solution/0800-0899/0837.New%2021%20Game/README.md) +- [839. 相似字符串组](/solution/0800-0899/0839.Similar%20String%20Groups/README.md) + + +#### 第 84 场周赛(2018-05-13 09:30, 90 分钟) + +- [832. 翻转图像](/solution/0800-0899/0832.Flipping%20an%20Image/README.md) +- [833. 字符串中的查找与替换](/solution/0800-0899/0833.Find%20And%20Replace%20in%20String/README.md) +- [835. 图像重叠](/solution/0800-0899/0835.Image%20Overlap/README.md) +- [834. 树中距离之和](/solution/0800-0899/0834.Sum%20of%20Distances%20in%20Tree/README.md) + + +#### 第 83 场周赛(2018-05-06 09:30, 90 分钟) + +- [830. 较大分组的位置](/solution/0800-0899/0830.Positions%20of%20Large%20Groups/README.md) +- [831. 隐藏个人信息](/solution/0800-0899/0831.Masking%20Personal%20Information/README.md) +- [829. 连续整数求和](/solution/0800-0899/0829.Consecutive%20Numbers%20Sum/README.md) +- [828. 统计子串中的唯一字符](/solution/0800-0899/0828.Count%20Unique%20Characters%20of%20All%20Substrings%20of%20a%20Given%20String/README.md) diff --git a/solution/CONTEST_README_EN.md b/solution/CONTEST_README_EN.md new file mode 100644 index 0000000000..a55400a97b --- /dev/null +++ b/solution/CONTEST_README_EN.md @@ -0,0 +1,2345 @@ +# LeetCode Contest + +[中文文档](/solution/CONTEST_README.md) + + +## Rating Predictor + +Get your rating changes right after the completion of LeetCode contests, https://lcpredictor.herokuapp.com/ + +## Past Contests + +#### Weekly Contest 295 + +- [2287. Rearrange Characters to Make Target String](/solution/2200-2299/2287.Rearrange%20Characters%20to%20Make%20Target%20String/README_EN.md) +- [2288. Apply Discount to Prices](/solution/2200-2299/2288.Apply%20Discount%20to%20Prices/README_EN.md) +- [2289. Steps to Make Array Non-decreasing](/solution/2200-2299/2289.Steps%20to%20Make%20Array%20Non-decreasing/README_EN.md) +- [2290. Minimum Obstacle Removal to Reach Corner](/solution/2200-2299/2290.Minimum%20Obstacle%20Removal%20to%20Reach%20Corner/README_EN.md) + + +#### Weekly Contest 294 + +- [2278. Percentage of Letter in String](/solution/2200-2299/2278.Percentage%20of%20Letter%20in%20String/README_EN.md) +- [2279. Maximum Bags With Full Capacity of Rocks](/solution/2200-2299/2279.Maximum%20Bags%20With%20Full%20Capacity%20of%20Rocks/README_EN.md) +- [2280. Minimum Lines to Represent a Line Chart](/solution/2200-2299/2280.Minimum%20Lines%20to%20Represent%20a%20Line%20Chart/README_EN.md) +- [2281. Sum of Total Strength of Wizards](/solution/2200-2299/2281.Sum%20of%20Total%20Strength%20of%20Wizards/README_EN.md) + + +#### Biweekly Contest 79 + +- [2283. Check if Number Has Equal Digit Count and Digit Value](/solution/2200-2299/2283.Check%20if%20Number%20Has%20Equal%20Digit%20Count%20and%20Digit%20Value/README_EN.md) +- [2284. Sender With Largest Word Count](/solution/2200-2299/2284.Sender%20With%20Largest%20Word%20Count/README_EN.md) +- [2285. Maximum Total Importance of Roads](/solution/2200-2299/2285.Maximum%20Total%20Importance%20of%20Roads/README_EN.md) +- [2286. Booking Concert Tickets in Groups](/solution/2200-2299/2286.Booking%20Concert%20Tickets%20in%20Groups/README_EN.md) + + +#### Weekly Contest 293 + +- [2273. Find Resultant Array After Removing Anagrams](/solution/2200-2299/2273.Find%20Resultant%20Array%20After%20Removing%20Anagrams/README_EN.md) +- [2274. Maximum Consecutive Floors Without Special Floors](/solution/2200-2299/2274.Maximum%20Consecutive%20Floors%20Without%20Special%20Floors/README_EN.md) +- [2275. Largest Combination With Bitwise AND Greater Than Zero](/solution/2200-2299/2275.Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/README_EN.md) +- [2276. Count Integers in Intervals](/solution/2200-2299/2276.Count%20Integers%20in%20Intervals/README_EN.md) + + +#### Weekly Contest 292 + +- [2264. Largest 3-Same-Digit Number in String](/solution/2200-2299/2264.Largest%203-Same-Digit%20Number%20in%20String/README_EN.md) +- [2265. Count Nodes Equal to Average of Subtree](/solution/2200-2299/2265.Count%20Nodes%20Equal%20to%20Average%20of%20Subtree/README_EN.md) +- [2266. Count Number of Texts](/solution/2200-2299/2266.Count%20Number%20of%20Texts/README_EN.md) +- [2267. Check if There Is a Valid Parentheses String Path](/solution/2200-2299/2267.Check%20if%20There%20Is%20a%20Valid%20Parentheses%20String%20Path/README_EN.md) + + +#### Biweekly Contest 78 + +- [2269. Find the K-Beauty of a Number](/solution/2200-2299/2269.Find%20the%20K-Beauty%20of%20a%20Number/README_EN.md) +- [2270. Number of Ways to Split Array](/solution/2200-2299/2270.Number%20of%20Ways%20to%20Split%20Array/README_EN.md) +- [2271. Maximum White Tiles Covered by a Carpet](/solution/2200-2299/2271.Maximum%20White%20Tiles%20Covered%20by%20a%20Carpet/README_EN.md) +- [2272. Substring With Largest Variance](/solution/2200-2299/2272.Substring%20With%20Largest%20Variance/README_EN.md) + + +#### Weekly Contest 291 + +- [2259. Remove Digit From Number to Maximize Result](/solution/2200-2299/2259.Remove%20Digit%20From%20Number%20to%20Maximize%20Result/README_EN.md) +- [2260. Minimum Consecutive Cards to Pick Up](/solution/2200-2299/2260.Minimum%20Consecutive%20Cards%20to%20Pick%20Up/README_EN.md) +- [2261. K Divisible Elements Subarrays](/solution/2200-2299/2261.K%20Divisible%20Elements%20Subarrays/README_EN.md) +- [2262. Total Appeal of A String](/solution/2200-2299/2262.Total%20Appeal%20of%20A%20String/README_EN.md) + + +#### Weekly Contest 290 + +- [2248. Intersection of Multiple Arrays](/solution/2200-2299/2248.Intersection%20of%20Multiple%20Arrays/README_EN.md) +- [2249. Count Lattice Points Inside a Circle](/solution/2200-2299/2249.Count%20Lattice%20Points%20Inside%20a%20Circle/README_EN.md) +- [2250. Count Number of Rectangles Containing Each Point](/solution/2200-2299/2250.Count%20Number%20of%20Rectangles%20Containing%20Each%20Point/README_EN.md) +- [2251. Number of Flowers in Full Bloom](/solution/2200-2299/2251.Number%20of%20Flowers%20in%20Full%20Bloom/README_EN.md) + + +#### Biweekly Contest 77 + +- [2255. Count Prefixes of a Given String](/solution/2200-2299/2255.Count%20Prefixes%20of%20a%20Given%20String/README_EN.md) +- [2256. Minimum Average Difference](/solution/2200-2299/2256.Minimum%20Average%20Difference/README_EN.md) +- [2257. Count Unguarded Cells in the Grid](/solution/2200-2299/2257.Count%20Unguarded%20Cells%20in%20the%20Grid/README_EN.md) +- [2258. Escape the Spreading Fire](/solution/2200-2299/2258.Escape%20the%20Spreading%20Fire/README_EN.md) + + +#### Weekly Contest 289 + +- [2243. Calculate Digit Sum of a String](/solution/2200-2299/2243.Calculate%20Digit%20Sum%20of%20a%20String/README_EN.md) +- [2244. Minimum Rounds to Complete All Tasks](/solution/2200-2299/2244.Minimum%20Rounds%20to%20Complete%20All%20Tasks/README_EN.md) +- [2245. Maximum Trailing Zeros in a Cornered Path](/solution/2200-2299/2245.Maximum%20Trailing%20Zeros%20in%20a%20Cornered%20Path/README_EN.md) +- [2246. Longest Path With Different Adjacent Characters](/solution/2200-2299/2246.Longest%20Path%20With%20Different%20Adjacent%20Characters/README_EN.md) + + +#### Weekly Contest 288 + +- [2231. Largest Number After Digit Swaps by Parity](/solution/2200-2299/2231.Largest%20Number%20After%20Digit%20Swaps%20by%20Parity/README_EN.md) +- [2232. Minimize Result by Adding Parentheses to Expression](/solution/2200-2299/2232.Minimize%20Result%20by%20Adding%20Parentheses%20to%20Expression/README_EN.md) +- [2233. Maximum Product After K Increments](/solution/2200-2299/2233.Maximum%20Product%20After%20K%20Increments/README_EN.md) +- [2234. Maximum Total Beauty of the Gardens](/solution/2200-2299/2234.Maximum%20Total%20Beauty%20of%20the%20Gardens/README_EN.md) + + +#### Biweekly Contest 76 + +- [2239. Find Closest Number to Zero](/solution/2200-2299/2239.Find%20Closest%20Number%20to%20Zero/README_EN.md) +- [2240. Number of Ways to Buy Pens and Pencils](/solution/2200-2299/2240.Number%20of%20Ways%20to%20Buy%20Pens%20and%20Pencils/README_EN.md) +- [2241. Design an ATM Machine](/solution/2200-2299/2241.Design%20an%20ATM%20Machine/README_EN.md) +- [2242. Maximum Score of a Node Sequence](/solution/2200-2299/2242.Maximum%20Score%20of%20a%20Node%20Sequence/README_EN.md) + + +#### Weekly Contest 287 + +- [2224. Minimum Number of Operations to Convert Time](/solution/2200-2299/2224.Minimum%20Number%20of%20Operations%20to%20Convert%20Time/README_EN.md) +- [2225. Find Players With Zero or One Losses](/solution/2200-2299/2225.Find%20Players%20With%20Zero%20or%20One%20Losses/README_EN.md) +- [2226. Maximum Candies Allocated to K Children](/solution/2200-2299/2226.Maximum%20Candies%20Allocated%20to%20K%20Children/README_EN.md) +- [2227. Encrypt and Decrypt Strings](/solution/2200-2299/2227.Encrypt%20and%20Decrypt%20Strings/README_EN.md) + + +#### Weekly Contest 286 + +- [2215. Find the Difference of Two Arrays](/solution/2200-2299/2215.Find%20the%20Difference%20of%20Two%20Arrays/README_EN.md) +- [2216. Minimum Deletions to Make Array Beautiful](/solution/2200-2299/2216.Minimum%20Deletions%20to%20Make%20Array%20Beautiful/README_EN.md) +- [2217. Find Palindrome With Fixed Length](/solution/2200-2299/2217.Find%20Palindrome%20With%20Fixed%20Length/README_EN.md) +- [2218. Maximum Value of K Coins From Piles](/solution/2200-2299/2218.Maximum%20Value%20of%20K%20Coins%20From%20Piles/README_EN.md) + + +#### Biweekly Contest 75 + +- [2220. Minimum Bit Flips to Convert Number](/solution/2200-2299/2220.Minimum%20Bit%20Flips%20to%20Convert%20Number/README_EN.md) +- [2221. Find Triangular Sum of an Array](/solution/2200-2299/2221.Find%20Triangular%20Sum%20of%20an%20Array/README_EN.md) +- [2222. Number of Ways to Select Buildings](/solution/2200-2299/2222.Number%20of%20Ways%20to%20Select%20Buildings/README_EN.md) +- [2223. Sum of Scores of Built Strings](/solution/2200-2299/2223.Sum%20of%20Scores%20of%20Built%20Strings/README_EN.md) + + +#### Weekly Contest 285 + +- [2210. Count Hills and Valleys in an Array](/solution/2200-2299/2210.Count%20Hills%20and%20Valleys%20in%20an%20Array/README_EN.md) +- [2211. Count Collisions on a Road](/solution/2200-2299/2211.Count%20Collisions%20on%20a%20Road/README_EN.md) +- [2212. Maximum Points in an Archery Competition](/solution/2200-2299/2212.Maximum%20Points%20in%20an%20Archery%20Competition/README_EN.md) +- [2213. Longest Substring of One Repeating Character](/solution/2200-2299/2213.Longest%20Substring%20of%20One%20Repeating%20Character/README_EN.md) + + +#### Weekly Contest 284 + +- [2200. Find All K-Distant Indices in an Array](/solution/2200-2299/2200.Find%20All%20K-Distant%20Indices%20in%20an%20Array/README_EN.md) +- [2201. Count Artifacts That Can Be Extracted](/solution/2200-2299/2201.Count%20Artifacts%20That%20Can%20Be%20Extracted/README_EN.md) +- [2202. Maximize the Topmost Element After K Moves](/solution/2200-2299/2202.Maximize%20the%20Topmost%20Element%20After%20K%20Moves/README_EN.md) +- [2203. Minimum Weighted Subgraph With the Required Paths](/solution/2200-2299/2203.Minimum%20Weighted%20Subgraph%20With%20the%20Required%20Paths/README_EN.md) + + +#### Biweekly Contest 74 + +- [2206. Divide Array Into Equal Pairs](/solution/2200-2299/2206.Divide%20Array%20Into%20Equal%20Pairs/README_EN.md) +- [2207. Maximize Number of Subsequences in a String](/solution/2200-2299/2207.Maximize%20Number%20of%20Subsequences%20in%20a%20String/README_EN.md) +- [2208. Minimum Operations to Halve Array Sum](/solution/2200-2299/2208.Minimum%20Operations%20to%20Halve%20Array%20Sum/README_EN.md) +- [2209. Minimum White Tiles After Covering With Carpets](/solution/2200-2299/2209.Minimum%20White%20Tiles%20After%20Covering%20With%20Carpets/README_EN.md) + + +#### Weekly Contest 283 + +- [2194. Cells in a Range on an Excel Sheet](/solution/2100-2199/2194.Cells%20in%20a%20Range%20on%20an%20Excel%20Sheet/README_EN.md) +- [2195. Append K Integers With Minimal Sum](/solution/2100-2199/2195.Append%20K%20Integers%20With%20Minimal%20Sum/README_EN.md) +- [2196. Create Binary Tree From Descriptions](/solution/2100-2199/2196.Create%20Binary%20Tree%20From%20Descriptions/README_EN.md) +- [2197. Replace Non-Coprime Numbers in Array](/solution/2100-2199/2197.Replace%20Non-Coprime%20Numbers%20in%20Array/README_EN.md) + + +#### Weekly Contest 282 + +- [2185. Counting Words With a Given Prefix](/solution/2100-2199/2185.Counting%20Words%20With%20a%20Given%20Prefix/README_EN.md) +- [2186. Minimum Number of Steps to Make Two Strings Anagram II](/solution/2100-2199/2186.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram%20II/README_EN.md) +- [2187. Minimum Time to Complete Trips](/solution/2100-2199/2187.Minimum%20Time%20to%20Complete%20Trips/README_EN.md) +- [2188. Minimum Time to Finish the Race](/solution/2100-2199/2188.Minimum%20Time%20to%20Finish%20the%20Race/README_EN.md) + + +#### Biweekly Contest 73 + +- [2190. Most Frequent Number Following Key In an Array](/solution/2100-2199/2190.Most%20Frequent%20Number%20Following%20Key%20In%20an%20Array/README_EN.md) +- [2191. Sort the Jumbled Numbers](/solution/2100-2199/2191.Sort%20the%20Jumbled%20Numbers/README_EN.md) +- [2192. All Ancestors of a Node in a Directed Acyclic Graph](/solution/2100-2199/2192.All%20Ancestors%20of%20a%20Node%20in%20a%20Directed%20Acyclic%20Graph/README_EN.md) +- [2193. Minimum Number of Moves to Make Palindrome](/solution/2100-2199/2193.Minimum%20Number%20of%20Moves%20to%20Make%20Palindrome/README_EN.md) + + +#### Weekly Contest 281 + +- [2180. Count Integers With Even Digit Sum](/solution/2100-2199/2180.Count%20Integers%20With%20Even%20Digit%20Sum/README_EN.md) +- [2181. Merge Nodes in Between Zeros](/solution/2100-2199/2181.Merge%20Nodes%20in%20Between%20Zeros/README_EN.md) +- [2182. Construct String With Repeat Limit](/solution/2100-2199/2182.Construct%20String%20With%20Repeat%20Limit/README_EN.md) +- [2183. Count Array Pairs Divisible by K](/solution/2100-2199/2183.Count%20Array%20Pairs%20Divisible%20by%20K/README_EN.md) + + +#### Weekly Contest 280 + +- [2169. Count Operations to Obtain Zero](/solution/2100-2199/2169.Count%20Operations%20to%20Obtain%20Zero/README_EN.md) +- [2170. Minimum Operations to Make the Array Alternating](/solution/2100-2199/2170.Minimum%20Operations%20to%20Make%20the%20Array%20Alternating/README_EN.md) +- [2171. Removing Minimum Number of Magic Beans](/solution/2100-2199/2171.Removing%20Minimum%20Number%20of%20Magic%20Beans/README_EN.md) +- [2172. Maximum AND Sum of Array](/solution/2100-2199/2172.Maximum%20AND%20Sum%20of%20Array/README_EN.md) + + +#### Biweekly Contest 72 + +- [2176. Count Equal and Divisible Pairs in an Array](/solution/2100-2199/2176.Count%20Equal%20and%20Divisible%20Pairs%20in%20an%20Array/README_EN.md) +- [2177. Find Three Consecutive Integers That Sum to a Given Number](/solution/2100-2199/2177.Find%20Three%20Consecutive%20Integers%20That%20Sum%20to%20a%20Given%20Number/README_EN.md) +- [2178. Maximum Split of Positive Even Integers](/solution/2100-2199/2178.Maximum%20Split%20of%20Positive%20Even%20Integers/README_EN.md) +- [2179. Count Good Triplets in an Array](/solution/2100-2199/2179.Count%20Good%20Triplets%20in%20an%20Array/README_EN.md) + + +#### Weekly Contest 279 + +- [2164. Sort Even and Odd Indices Independently](/solution/2100-2199/2164.Sort%20Even%20and%20Odd%20Indices%20Independently/README_EN.md) +- [2165. Smallest Value of the Rearranged Number](/solution/2100-2199/2165.Smallest%20Value%20of%20the%20Rearranged%20Number/README_EN.md) +- [2166. Design Bitset](/solution/2100-2199/2166.Design%20Bitset/README_EN.md) +- [2167. Minimum Time to Remove All Cars Containing Illegal Goods](/solution/2100-2199/2167.Minimum%20Time%20to%20Remove%20All%20Cars%20Containing%20Illegal%20Goods/README_EN.md) + + +#### Weekly Contest 278 + +- [2154. Keep Multiplying Found Values by Two](/solution/2100-2199/2154.Keep%20Multiplying%20Found%20Values%20by%20Two/README_EN.md) +- [2155. All Divisions With the Highest Score of a Binary Array](/solution/2100-2199/2155.All%20Divisions%20With%20the%20Highest%20Score%20of%20a%20Binary%20Array/README_EN.md) +- [2156. Find Substring With Given Hash Value](/solution/2100-2199/2156.Find%20Substring%20With%20Given%20Hash%20Value/README_EN.md) +- [2157. Groups of Strings](/solution/2100-2199/2157.Groups%20of%20Strings/README_EN.md) + + +#### Biweekly Contest 71 + +- [2160. Minimum Sum of Four Digit Number After Splitting Digits](/solution/2100-2199/2160.Minimum%20Sum%20of%20Four%20Digit%20Number%20After%20Splitting%20Digits/README_EN.md) +- [2161. Partition Array According to Given Pivot](/solution/2100-2199/2161.Partition%20Array%20According%20to%20Given%20Pivot/README_EN.md) +- [2162. Minimum Cost to Set Cooking Time](/solution/2100-2199/2162.Minimum%20Cost%20to%20Set%20Cooking%20Time/README_EN.md) +- [2163. Minimum Difference in Sums After Removal of Elements](/solution/2100-2199/2163.Minimum%20Difference%20in%20Sums%20After%20Removal%20of%20Elements/README_EN.md) + + +#### Weekly Contest 277 + +- [2148. Count Elements With Strictly Smaller and Greater Elements](/solution/2100-2199/2148.Count%20Elements%20With%20Strictly%20Smaller%20and%20Greater%20Elements/README_EN.md) +- [2149. Rearrange Array Elements by Sign](/solution/2100-2199/2149.Rearrange%20Array%20Elements%20by%20Sign/README_EN.md) +- [2150. Find All Lonely Numbers in the Array](/solution/2100-2199/2150.Find%20All%20Lonely%20Numbers%20in%20the%20Array/README_EN.md) +- [2151. Maximum Good People Based on Statements](/solution/2100-2199/2151.Maximum%20Good%20People%20Based%20on%20Statements/README_EN.md) + + +#### Weekly Contest 276 + +- [2138. Divide a String Into Groups of Size k](/solution/2100-2199/2138.Divide%20a%20String%20Into%20Groups%20of%20Size%20k/README_EN.md) +- [2139. Minimum Moves to Reach Target Score](/solution/2100-2199/2139.Minimum%20Moves%20to%20Reach%20Target%20Score/README_EN.md) +- [2140. Solving Questions With Brainpower](/solution/2100-2199/2140.Solving%20Questions%20With%20Brainpower/README_EN.md) +- [2141. Maximum Running Time of N Computers](/solution/2100-2199/2141.Maximum%20Running%20Time%20of%20N%20Computers/README_EN.md) + + +#### Biweekly Contest 70 + +- [2144. Minimum Cost of Buying Candies With Discount](/solution/2100-2199/2144.Minimum%20Cost%20of%20Buying%20Candies%20With%20Discount/README_EN.md) +- [2145. Count the Hidden Sequences](/solution/2100-2199/2145.Count%20the%20Hidden%20Sequences/README_EN.md) +- [2146. K Highest Ranked Items Within a Price Range](/solution/2100-2199/2146.K%20Highest%20Ranked%20Items%20Within%20a%20Price%20Range/README_EN.md) +- [2147. Number of Ways to Divide a Long Corridor](/solution/2100-2199/2147.Number%20of%20Ways%20to%20Divide%20a%20Long%20Corridor/README_EN.md) + + +#### Weekly Contest 275 + +- [2133. Check if Every Row and Column Contains All Numbers](/solution/2100-2199/2133.Check%20if%20Every%20Row%20and%20Column%20Contains%20All%20Numbers/README_EN.md) +- [2134. Minimum Swaps to Group All 1's Together II](/solution/2100-2199/2134.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together%20II/README_EN.md) +- [2135. Count Words Obtained After Adding a Letter](/solution/2100-2199/2135.Count%20Words%20Obtained%20After%20Adding%20a%20Letter/README_EN.md) +- [2136. Earliest Possible Day of Full Bloom](/solution/2100-2199/2136.Earliest%20Possible%20Day%20of%20Full%20Bloom/README_EN.md) + + +#### Weekly Contest 274 + +- [2124. Check if All A's Appears Before All B's](/solution/2100-2199/2124.Check%20if%20All%20A%27s%20Appears%20Before%20All%20B%27s/README_EN.md) +- [2125. Number of Laser Beams in a Bank](/solution/2100-2199/2125.Number%20of%20Laser%20Beams%20in%20a%20Bank/README_EN.md) +- [2126. Destroying Asteroids](/solution/2100-2199/2126.Destroying%20Asteroids/README_EN.md) +- [2127. Maximum Employees to Be Invited to a Meeting](/solution/2100-2199/2127.Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/README_EN.md) + + +#### Biweekly Contest 69 + +- [2129. Capitalize the Title](/solution/2100-2199/2129.Capitalize%20the%20Title/README_EN.md) +- [2130. Maximum Twin Sum of a Linked List](/solution/2100-2199/2130.Maximum%20Twin%20Sum%20of%20a%20Linked%20List/README_EN.md) +- [2131. Longest Palindrome by Concatenating Two Letter Words](/solution/2100-2199/2131.Longest%20Palindrome%20by%20Concatenating%20Two%20Letter%20Words/README_EN.md) +- [2132. Stamping the Grid](/solution/2100-2199/2132.Stamping%20the%20Grid/README_EN.md) + + +#### Weekly Contest 273 + +- [2119. A Number After a Double Reversal](/solution/2100-2199/2119.A%20Number%20After%20a%20Double%20Reversal/README_EN.md) +- [2120. Execution of All Suffix Instructions Staying in a Grid](/solution/2100-2199/2120.Execution%20of%20All%20Suffix%20Instructions%20Staying%20in%20a%20Grid/README_EN.md) +- [2121. Intervals Between Identical Elements](/solution/2100-2199/2121.Intervals%20Between%20Identical%20Elements/README_EN.md) +- [2122. Recover the Original Array](/solution/2100-2199/2122.Recover%20the%20Original%20Array/README_EN.md) + + +#### Weekly Contest 272 + +- [2108. Find First Palindromic String in the Array](/solution/2100-2199/2108.Find%20First%20Palindromic%20String%20in%20the%20Array/README_EN.md) +- [2109. Adding Spaces to a String](/solution/2100-2199/2109.Adding%20Spaces%20to%20a%20String/README_EN.md) +- [2110. Number of Smooth Descent Periods of a Stock](/solution/2100-2199/2110.Number%20of%20Smooth%20Descent%20Periods%20of%20a%20Stock/README_EN.md) +- [2111. Minimum Operations to Make the Array K-Increasing](/solution/2100-2199/2111.Minimum%20Operations%20to%20Make%20the%20Array%20K-Increasing/README_EN.md) + + +#### Biweekly Contest 68 + +- [2114. Maximum Number of Words Found in Sentences](/solution/2100-2199/2114.Maximum%20Number%20of%20Words%20Found%20in%20Sentences/README_EN.md) +- [2115. Find All Possible Recipes from Given Supplies](/solution/2100-2199/2115.Find%20All%20Possible%20Recipes%20from%20Given%20Supplies/README_EN.md) +- [2116. Check if a Parentheses String Can Be Valid](/solution/2100-2199/2116.Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/README_EN.md) +- [2117. Abbreviating the Product of a Range](/solution/2100-2199/2117.Abbreviating%20the%20Product%20of%20a%20Range/README_EN.md) + + +#### Weekly Contest 271 + +- [2103. Rings and Rods](/solution/2100-2199/2103.Rings%20and%20Rods/README_EN.md) +- [2104. Sum of Subarray Ranges](/solution/2100-2199/2104.Sum%20of%20Subarray%20Ranges/README_EN.md) +- [2105. Watering Plants II](/solution/2100-2199/2105.Watering%20Plants%20II/README_EN.md) +- [2106. Maximum Fruits Harvested After at Most K Steps](/solution/2100-2199/2106.Maximum%20Fruits%20Harvested%20After%20at%20Most%20K%20Steps/README_EN.md) + + +#### Weekly Contest 270 + +- [2094. Finding 3-Digit Even Numbers](/solution/2000-2099/2094.Finding%203-Digit%20Even%20Numbers/README_EN.md) +- [2095. Delete the Middle Node of a Linked List](/solution/2000-2099/2095.Delete%20the%20Middle%20Node%20of%20a%20Linked%20List/README_EN.md) +- [2096. Step-By-Step Directions From a Binary Tree Node to Another](/solution/2000-2099/2096.Step-By-Step%20Directions%20From%20a%20Binary%20Tree%20Node%20to%20Another/README_EN.md) +- [2097. Valid Arrangement of Pairs](/solution/2000-2099/2097.Valid%20Arrangement%20of%20Pairs/README_EN.md) + + +#### Biweekly Contest 67 + +- [2099. Find Subsequence of Length K With the Largest Sum](/solution/2000-2099/2099.Find%20Subsequence%20of%20Length%20K%20With%20the%20Largest%20Sum/README_EN.md) +- [2100. Find Good Days to Rob the Bank](/solution/2100-2199/2100.Find%20Good%20Days%20to%20Rob%20the%20Bank/README_EN.md) +- [2101. Detonate the Maximum Bombs](/solution/2100-2199/2101.Detonate%20the%20Maximum%20Bombs/README_EN.md) +- [2102. Sequentially Ordinal Rank Tracker](/solution/2100-2199/2102.Sequentially%20Ordinal%20Rank%20Tracker/README_EN.md) + + +#### Weekly Contest 269 + +- [2089. Find Target Indices After Sorting Array](/solution/2000-2099/2089.Find%20Target%20Indices%20After%20Sorting%20Array/README_EN.md) +- [2090. K Radius Subarray Averages](/solution/2000-2099/2090.K%20Radius%20Subarray%20Averages/README_EN.md) +- [2091. Removing Minimum and Maximum From Array](/solution/2000-2099/2091.Removing%20Minimum%20and%20Maximum%20From%20Array/README_EN.md) +- [2092. Find All People With Secret](/solution/2000-2099/2092.Find%20All%20People%20With%20Secret/README_EN.md) + + +#### Weekly Contest 268 + +- [2078. Two Furthest Houses With Different Colors](/solution/2000-2099/2078.Two%20Furthest%20Houses%20With%20Different%20Colors/README_EN.md) +- [2079. Watering Plants](/solution/2000-2099/2079.Watering%20Plants/README_EN.md) +- [2080. Range Frequency Queries](/solution/2000-2099/2080.Range%20Frequency%20Queries/README_EN.md) +- [2081. Sum of k-Mirror Numbers](/solution/2000-2099/2081.Sum%20of%20k-Mirror%20Numbers/README_EN.md) + + +#### Biweekly Contest 66 + +- [2085. Count Common Words With One Occurrence](/solution/2000-2099/2085.Count%20Common%20Words%20With%20One%20Occurrence/README_EN.md) +- [2086. Minimum Number of Buckets Required to Collect Rainwater from Houses](/solution/2000-2099/2086.Minimum%20Number%20of%20Buckets%20Required%20to%20Collect%20Rainwater%20from%20Houses/README_EN.md) +- [2087. Minimum Cost Homecoming of a Robot in a Grid](/solution/2000-2099/2087.Minimum%20Cost%20Homecoming%20of%20a%20Robot%20in%20a%20Grid/README_EN.md) +- [2088. Count Fertile Pyramids in a Land](/solution/2000-2099/2088.Count%20Fertile%20Pyramids%20in%20a%20Land/README_EN.md) + + +#### Weekly Contest 267 + +- [2073. Time Needed to Buy Tickets](/solution/2000-2099/2073.Time%20Needed%20to%20Buy%20Tickets/README_EN.md) +- [2074. Reverse Nodes in Even Length Groups](/solution/2000-2099/2074.Reverse%20Nodes%20in%20Even%20Length%20Groups/README_EN.md) +- [2075. Decode the Slanted Ciphertext](/solution/2000-2099/2075.Decode%20the%20Slanted%20Ciphertext/README_EN.md) +- [2076. Process Restricted Friend Requests](/solution/2000-2099/2076.Process%20Restricted%20Friend%20Requests/README_EN.md) + + +#### Weekly Contest 266 + +- [2062. Count Vowel Substrings of a String](/solution/2000-2099/2062.Count%20Vowel%20Substrings%20of%20a%20String/README_EN.md) +- [2063. Vowels of All Substrings](/solution/2000-2099/2063.Vowels%20of%20All%20Substrings/README_EN.md) +- [2064. Minimized Maximum of Products Distributed to Any Store](/solution/2000-2099/2064.Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/README_EN.md) +- [2065. Maximum Path Quality of a Graph](/solution/2000-2099/2065.Maximum%20Path%20Quality%20of%20a%20Graph/README_EN.md) + + +#### Biweekly Contest 65 + +- [2068. Check Whether Two Strings are Almost Equivalent](/solution/2000-2099/2068.Check%20Whether%20Two%20Strings%20are%20Almost%20Equivalent/README_EN.md) +- [2069. Walking Robot Simulation II](/solution/2000-2099/2069.Walking%20Robot%20Simulation%20II/README_EN.md) +- [2070. Most Beautiful Item for Each Query](/solution/2000-2099/2070.Most%20Beautiful%20Item%20for%20Each%20Query/README_EN.md) +- [2071. Maximum Number of Tasks You Can Assign](/solution/2000-2099/2071.Maximum%20Number%20of%20Tasks%20You%20Can%20Assign/README_EN.md) + + +#### Weekly Contest 265 + +- [2057. Smallest Index With Equal Value](/solution/2000-2099/2057.Smallest%20Index%20With%20Equal%20Value/README_EN.md) +- [2058. Find the Minimum and Maximum Number of Nodes Between Critical Points](/solution/2000-2099/2058.Find%20the%20Minimum%20and%20Maximum%20Number%20of%20Nodes%20Between%20Critical%20Points/README_EN.md) +- [2059. Minimum Operations to Convert Number](/solution/2000-2099/2059.Minimum%20Operations%20to%20Convert%20Number/README_EN.md) +- [2060. Check if an Original String Exists Given Two Encoded Strings](/solution/2000-2099/2060.Check%20if%20an%20Original%20String%20Exists%20Given%20Two%20Encoded%20Strings/README_EN.md) + + +#### Weekly Contest 264 + +- [2047. Number of Valid Words in a Sentence](/solution/2000-2099/2047.Number%20of%20Valid%20Words%20in%20a%20Sentence/README_EN.md) +- [2048. Next Greater Numerically Balanced Number](/solution/2000-2099/2048.Next%20Greater%20Numerically%20Balanced%20Number/README_EN.md) +- [2049. Count Nodes With the Highest Score](/solution/2000-2099/2049.Count%20Nodes%20With%20the%20Highest%20Score/README_EN.md) +- [2050. Parallel Courses III](/solution/2000-2099/2050.Parallel%20Courses%20III/README_EN.md) + + +#### Biweekly Contest 64 + +- [2053. Kth Distinct String in an Array](/solution/2000-2099/2053.Kth%20Distinct%20String%20in%20an%20Array/README_EN.md) +- [2054. Two Best Non-Overlapping Events](/solution/2000-2099/2054.Two%20Best%20Non-Overlapping%20Events/README_EN.md) +- [2055. Plates Between Candles](/solution/2000-2099/2055.Plates%20Between%20Candles/README_EN.md) +- [2056. Number of Valid Move Combinations On Chessboard](/solution/2000-2099/2056.Number%20of%20Valid%20Move%20Combinations%20On%20Chessboard/README_EN.md) + + +#### Weekly Contest 263 + +- [2042. Check if Numbers Are Ascending in a Sentence](/solution/2000-2099/2042.Check%20if%20Numbers%20Are%20Ascending%20in%20a%20Sentence/README_EN.md) +- [2043. Simple Bank System](/solution/2000-2099/2043.Simple%20Bank%20System/README_EN.md) +- [2044. Count Number of Maximum Bitwise-OR Subsets](/solution/2000-2099/2044.Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets/README_EN.md) +- [2045. Second Minimum Time to Reach Destination](/solution/2000-2099/2045.Second%20Minimum%20Time%20to%20Reach%20Destination/README_EN.md) + + +#### Weekly Contest 262 + +- [2032. Two Out of Three](/solution/2000-2099/2032.Two%20Out%20of%20Three/README_EN.md) +- [2033. Minimum Operations to Make a Uni-Value Grid](/solution/2000-2099/2033.Minimum%20Operations%20to%20Make%20a%20Uni-Value%20Grid/README_EN.md) +- [2034. Stock Price Fluctuation](/solution/2000-2099/2034.Stock%20Price%20Fluctuation/README_EN.md) +- [2035. Partition Array Into Two Arrays to Minimize Sum Difference](/solution/2000-2099/2035.Partition%20Array%20Into%20Two%20Arrays%20to%20Minimize%20Sum%20Difference/README_EN.md) + + +#### Biweekly Contest 63 + +- [2037. Minimum Number of Moves to Seat Everyone](/solution/2000-2099/2037.Minimum%20Number%20of%20Moves%20to%20Seat%20Everyone/README_EN.md) +- [2038. Remove Colored Pieces if Both Neighbors are the Same Color](/solution/2000-2099/2038.Remove%20Colored%20Pieces%20if%20Both%20Neighbors%20are%20the%20Same%20Color/README_EN.md) +- [2039. The Time When the Network Becomes Idle](/solution/2000-2099/2039.The%20Time%20When%20the%20Network%20Becomes%20Idle/README_EN.md) +- [2040. Kth Smallest Product of Two Sorted Arrays](/solution/2000-2099/2040.Kth%20Smallest%20Product%20of%20Two%20Sorted%20Arrays/README_EN.md) + + +#### Weekly Contest 261 + +- [2027. Minimum Moves to Convert String](/solution/2000-2099/2027.Minimum%20Moves%20to%20Convert%20String/README_EN.md) +- [2028. Find Missing Observations](/solution/2000-2099/2028.Find%20Missing%20Observations/README_EN.md) +- [2029. Stone Game IX](/solution/2000-2099/2029.Stone%20Game%20IX/README_EN.md) +- [2030. Smallest K-Length Subsequence With Occurrences of a Letter](/solution/2000-2099/2030.Smallest%20K-Length%20Subsequence%20With%20Occurrences%20of%20a%20Letter/README_EN.md) + + +#### Weekly Contest 260 + +- [2016. Maximum Difference Between Increasing Elements](/solution/2000-2099/2016.Maximum%20Difference%20Between%20Increasing%20Elements/README_EN.md) +- [2017. Grid Game](/solution/2000-2099/2017.Grid%20Game/README_EN.md) +- [2018. Check if Word Can Be Placed In Crossword](/solution/2000-2099/2018.Check%20if%20Word%20Can%20Be%20Placed%20In%20Crossword/README_EN.md) +- [2019. The Score of Students Solving Math Expression](/solution/2000-2099/2019.The%20Score%20of%20Students%20Solving%20Math%20Expression/README_EN.md) + + +#### Biweekly Contest 62 + +- [2022. Convert 1D Array Into 2D Array](/solution/2000-2099/2022.Convert%201D%20Array%20Into%202D%20Array/README_EN.md) +- [2023. Number of Pairs of Strings With Concatenation Equal to Target](/solution/2000-2099/2023.Number%20of%20Pairs%20of%20Strings%20With%20Concatenation%20Equal%20to%20Target/README_EN.md) +- [2024. Maximize the Confusion of an Exam](/solution/2000-2099/2024.Maximize%20the%20Confusion%20of%20an%20Exam/README_EN.md) +- [2025. Maximum Number of Ways to Partition an Array](/solution/2000-2099/2025.Maximum%20Number%20of%20Ways%20to%20Partition%20an%20Array/README_EN.md) + + +#### Weekly Contest 259 + +- [2011. Final Value of Variable After Performing Operations](/solution/2000-2099/2011.Final%20Value%20of%20Variable%20After%20Performing%20Operations/README_EN.md) +- [2012. Sum of Beauty in the Array](/solution/2000-2099/2012.Sum%20of%20Beauty%20in%20the%20Array/README_EN.md) +- [2013. Detect Squares](/solution/2000-2099/2013.Detect%20Squares/README_EN.md) +- [2014. Longest Subsequence Repeated k Times](/solution/2000-2099/2014.Longest%20Subsequence%20Repeated%20k%20Times/README_EN.md) + + +#### Weekly Contest 258 + +- [2000. Reverse Prefix of Word](/solution/2000-2099/2000.Reverse%20Prefix%20of%20Word/README_EN.md) +- [2001. Number of Pairs of Interchangeable Rectangles](/solution/2000-2099/2001.Number%20of%20Pairs%20of%20Interchangeable%20Rectangles/README_EN.md) +- [2002. Maximum Product of the Length of Two Palindromic Subsequences](/solution/2000-2099/2002.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Subsequences/README_EN.md) +- [2003. Smallest Missing Genetic Value in Each Subtree](/solution/2000-2099/2003.Smallest%20Missing%20Genetic%20Value%20in%20Each%20Subtree/README_EN.md) + + +#### Biweekly Contest 61 + +- [2006. Count Number of Pairs With Absolute Difference K](/solution/2000-2099/2006.Count%20Number%20of%20Pairs%20With%20Absolute%20Difference%20K/README_EN.md) +- [2007. Find Original Array From Doubled Array](/solution/2000-2099/2007.Find%20Original%20Array%20From%20Doubled%20Array/README_EN.md) +- [2008. Maximum Earnings From Taxi](/solution/2000-2099/2008.Maximum%20Earnings%20From%20Taxi/README_EN.md) +- [2009. Minimum Number of Operations to Make Array Continuous](/solution/2000-2099/2009.Minimum%20Number%20of%20Operations%20to%20Make%20Array%20Continuous/README_EN.md) + + +#### Weekly Contest 257 + +- [1995. Count Special Quadruplets](/solution/1900-1999/1995.Count%20Special%20Quadruplets/README_EN.md) +- [1996. The Number of Weak Characters in the Game](/solution/1900-1999/1996.The%20Number%20of%20Weak%20Characters%20in%20the%20Game/README_EN.md) +- [1997. First Day Where You Have Been in All the Rooms](/solution/1900-1999/1997.First%20Day%20Where%20You%20Have%20Been%20in%20All%20the%20Rooms/README_EN.md) +- [1998. GCD Sort of an Array](/solution/1900-1999/1998.GCD%20Sort%20of%20an%20Array/README_EN.md) + + +#### Weekly Contest 256 + +- [1984. Minimum Difference Between Highest and Lowest of K Scores](/solution/1900-1999/1984.Minimum%20Difference%20Between%20Highest%20and%20Lowest%20of%20K%20Scores/README_EN.md) +- [1985. Find the Kth Largest Integer in the Array](/solution/1900-1999/1985.Find%20the%20Kth%20Largest%20Integer%20in%20the%20Array/README_EN.md) +- [1986. Minimum Number of Work Sessions to Finish the Tasks](/solution/1900-1999/1986.Minimum%20Number%20of%20Work%20Sessions%20to%20Finish%20the%20Tasks/README_EN.md) +- [1987. Number of Unique Good Subsequences](/solution/1900-1999/1987.Number%20of%20Unique%20Good%20Subsequences/README_EN.md) + + +#### Biweekly Contest 60 + +- [1991. Find the Middle Index in Array](/solution/1900-1999/1991.Find%20the%20Middle%20Index%20in%20Array/README_EN.md) +- [1992. Find All Groups of Farmland](/solution/1900-1999/1992.Find%20All%20Groups%20of%20Farmland/README_EN.md) +- [1993. Operations on Tree](/solution/1900-1999/1993.Operations%20on%20Tree/README_EN.md) +- [1994. The Number of Good Subsets](/solution/1900-1999/1994.The%20Number%20of%20Good%20Subsets/README_EN.md) + + +#### Weekly Contest 255 + +- [1979. Find Greatest Common Divisor of Array](/solution/1900-1999/1979.Find%20Greatest%20Common%20Divisor%20of%20Array/README_EN.md) +- [1980. Find Unique Binary String](/solution/1900-1999/1980.Find%20Unique%20Binary%20String/README_EN.md) +- [1981. Minimize the Difference Between Target and Chosen Elements](/solution/1900-1999/1981.Minimize%20the%20Difference%20Between%20Target%20and%20Chosen%20Elements/README_EN.md) +- [1982. Find Array Given Subset Sums](/solution/1900-1999/1982.Find%20Array%20Given%20Subset%20Sums/README_EN.md) + + +#### Weekly Contest 254 + +- [1967. Number of Strings That Appear as Substrings in Word](/solution/1900-1999/1967.Number%20of%20Strings%20That%20Appear%20as%20Substrings%20in%20Word/README_EN.md) +- [1968. Array With Elements Not Equal to Average of Neighbors](/solution/1900-1999/1968.Array%20With%20Elements%20Not%20Equal%20to%20Average%20of%20Neighbors/README_EN.md) +- [1969. Minimum Non-Zero Product of the Array Elements](/solution/1900-1999/1969.Minimum%20Non-Zero%20Product%20of%20the%20Array%20Elements/README_EN.md) +- [1970. Last Day Where You Can Still Cross](/solution/1900-1999/1970.Last%20Day%20Where%20You%20Can%20Still%20Cross/README_EN.md) + + +#### Biweekly Contest 59 + +- [1974. Minimum Time to Type Word Using Special Typewriter](/solution/1900-1999/1974.Minimum%20Time%20to%20Type%20Word%20Using%20Special%20Typewriter/README_EN.md) +- [1975. Maximum Matrix Sum](/solution/1900-1999/1975.Maximum%20Matrix%20Sum/README_EN.md) +- [1976. Number of Ways to Arrive at Destination](/solution/1900-1999/1976.Number%20of%20Ways%20to%20Arrive%20at%20Destination/README_EN.md) +- [1977. Number of Ways to Separate Numbers](/solution/1900-1999/1977.Number%20of%20Ways%20to%20Separate%20Numbers/README_EN.md) + + +#### Weekly Contest 253 + +- [1961. Check If String Is a Prefix of Array](/solution/1900-1999/1961.Check%20If%20String%20Is%20a%20Prefix%20of%20Array/README_EN.md) +- [1962. Remove Stones to Minimize the Total](/solution/1900-1999/1962.Remove%20Stones%20to%20Minimize%20the%20Total/README_EN.md) +- [1963. Minimum Number of Swaps to Make the String Balanced](/solution/1900-1999/1963.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20String%20Balanced/README_EN.md) +- [1964. Find the Longest Valid Obstacle Course at Each Position](/solution/1900-1999/1964.Find%20the%20Longest%20Valid%20Obstacle%20Course%20at%20Each%20Position/README_EN.md) + + +#### Weekly Contest 252 + +- [1952. Three Divisors](/solution/1900-1999/1952.Three%20Divisors/README_EN.md) +- [1953. Maximum Number of Weeks for Which You Can Work](/solution/1900-1999/1953.Maximum%20Number%20of%20Weeks%20for%20Which%20You%20Can%20Work/README_EN.md) +- [1954. Minimum Garden Perimeter to Collect Enough Apples](/solution/1900-1999/1954.Minimum%20Garden%20Perimeter%20to%20Collect%20Enough%20Apples/README_EN.md) +- [1955. Count Number of Special Subsequences](/solution/1900-1999/1955.Count%20Number%20of%20Special%20Subsequences/README_EN.md) + + +#### Biweekly Contest 58 + +- [1957. Delete Characters to Make Fancy String](/solution/1900-1999/1957.Delete%20Characters%20to%20Make%20Fancy%20String/README_EN.md) +- [1958. Check if Move is Legal](/solution/1900-1999/1958.Check%20if%20Move%20is%20Legal/README_EN.md) +- [1959. Minimum Total Space Wasted With K Resizing Operations](/solution/1900-1999/1959.Minimum%20Total%20Space%20Wasted%20With%20K%20Resizing%20Operations/README_EN.md) +- [1960. Maximum Product of the Length of Two Palindromic Substrings](/solution/1900-1999/1960.Maximum%20Product%20of%20the%20Length%20of%20Two%20Palindromic%20Substrings/README_EN.md) + + +#### Weekly Contest 251 + +- [1945. Sum of Digits of String After Convert](/solution/1900-1999/1945.Sum%20of%20Digits%20of%20String%20After%20Convert/README_EN.md) +- [1946. Largest Number After Mutating Substring](/solution/1900-1999/1946.Largest%20Number%20After%20Mutating%20Substring/README_EN.md) +- [1947. Maximum Compatibility Score Sum](/solution/1900-1999/1947.Maximum%20Compatibility%20Score%20Sum/README_EN.md) +- [1948. Delete Duplicate Folders in System](/solution/1900-1999/1948.Delete%20Duplicate%20Folders%20in%20System/README_EN.md) + + +#### Weekly Contest 250 + +- [1935. Maximum Number of Words You Can Type](/solution/1900-1999/1935.Maximum%20Number%20of%20Words%20You%20Can%20Type/README_EN.md) +- [1936. Add Minimum Number of Rungs](/solution/1900-1999/1936.Add%20Minimum%20Number%20of%20Rungs/README_EN.md) +- [1937. Maximum Number of Points with Cost](/solution/1900-1999/1937.Maximum%20Number%20of%20Points%20with%20Cost/README_EN.md) +- [1938. Maximum Genetic Difference Query](/solution/1900-1999/1938.Maximum%20Genetic%20Difference%20Query/README_EN.md) + + +#### Biweekly Contest 57 + +- [1941. Check if All Characters Have Equal Number of Occurrences](/solution/1900-1999/1941.Check%20if%20All%20Characters%20Have%20Equal%20Number%20of%20Occurrences/README_EN.md) +- [1942. The Number of the Smallest Unoccupied Chair](/solution/1900-1999/1942.The%20Number%20of%20the%20Smallest%20Unoccupied%20Chair/README_EN.md) +- [1943. Describe the Painting](/solution/1900-1999/1943.Describe%20the%20Painting/README_EN.md) +- [1944. Number of Visible People in a Queue](/solution/1900-1999/1944.Number%20of%20Visible%20People%20in%20a%20Queue/README_EN.md) + + +#### Weekly Contest 249 + +- [1929. Concatenation of Array](/solution/1900-1999/1929.Concatenation%20of%20Array/README_EN.md) +- [1930. Unique Length-3 Palindromic Subsequences](/solution/1900-1999/1930.Unique%20Length-3%20Palindromic%20Subsequences/README_EN.md) +- [1931. Painting a Grid With Three Different Colors](/solution/1900-1999/1931.Painting%20a%20Grid%20With%20Three%20Different%20Colors/README_EN.md) +- [1932. Merge BSTs to Create Single BST](/solution/1900-1999/1932.Merge%20BSTs%20to%20Create%20Single%20BST/README_EN.md) + + +#### Weekly Contest 248 + +- [1920. Build Array from Permutation](/solution/1900-1999/1920.Build%20Array%20from%20Permutation/README_EN.md) +- [1921. Eliminate Maximum Number of Monsters](/solution/1900-1999/1921.Eliminate%20Maximum%20Number%20of%20Monsters/README_EN.md) +- [1922. Count Good Numbers](/solution/1900-1999/1922.Count%20Good%20Numbers/README_EN.md) +- [1923. Longest Common Subpath](/solution/1900-1999/1923.Longest%20Common%20Subpath/README_EN.md) + + +#### Biweekly Contest 56 + +- [1925. Count Square Sum Triples](/solution/1900-1999/1925.Count%20Square%20Sum%20Triples/README_EN.md) +- [1926. Nearest Exit from Entrance in Maze](/solution/1900-1999/1926.Nearest%20Exit%20from%20Entrance%20in%20Maze/README_EN.md) +- [1927. Sum Game](/solution/1900-1999/1927.Sum%20Game/README_EN.md) +- [1928. Minimum Cost to Reach Destination in Time](/solution/1900-1999/1928.Minimum%20Cost%20to%20Reach%20Destination%20in%20Time/README_EN.md) + + +#### Weekly Contest 247 + +- [1913. Maximum Product Difference Between Two Pairs](/solution/1900-1999/1913.Maximum%20Product%20Difference%20Between%20Two%20Pairs/README_EN.md) +- [1914. Cyclically Rotating a Grid](/solution/1900-1999/1914.Cyclically%20Rotating%20a%20Grid/README_EN.md) +- [1915. Number of Wonderful Substrings](/solution/1900-1999/1915.Number%20of%20Wonderful%20Substrings/README_EN.md) +- [1916. Count Ways to Build Rooms in an Ant Colony](/solution/1900-1999/1916.Count%20Ways%20to%20Build%20Rooms%20in%20an%20Ant%20Colony/README_EN.md) + + +#### Weekly Contest 246 + +- [1903. Largest Odd Number in String](/solution/1900-1999/1903.Largest%20Odd%20Number%20in%20String/README_EN.md) +- [1904. The Number of Full Rounds You Have Played](/solution/1900-1999/1904.The%20Number%20of%20Full%20Rounds%20You%20Have%20Played/README_EN.md) +- [1905. Count Sub Islands](/solution/1900-1999/1905.Count%20Sub%20Islands/README_EN.md) +- [1906. Minimum Absolute Difference Queries](/solution/1900-1999/1906.Minimum%20Absolute%20Difference%20Queries/README_EN.md) + + +#### Biweekly Contest 55 + +- [1909. Remove One Element to Make the Array Strictly Increasing](/solution/1900-1999/1909.Remove%20One%20Element%20to%20Make%20the%20Array%20Strictly%20Increasing/README_EN.md) +- [1910. Remove All Occurrences of a Substring](/solution/1900-1999/1910.Remove%20All%20Occurrences%20of%20a%20Substring/README_EN.md) +- [1911. Maximum Alternating Subsequence Sum](/solution/1900-1999/1911.Maximum%20Alternating%20Subsequence%20Sum/README_EN.md) +- [1912. Design Movie Rental System](/solution/1900-1999/1912.Design%20Movie%20Rental%20System/README_EN.md) + + +#### Weekly Contest 245 + +- [1897. Redistribute Characters to Make All Strings Equal](/solution/1800-1899/1897.Redistribute%20Characters%20to%20Make%20All%20Strings%20Equal/README_EN.md) +- [1898. Maximum Number of Removable Characters](/solution/1800-1899/1898.Maximum%20Number%20of%20Removable%20Characters/README_EN.md) +- [1899. Merge Triplets to Form Target Triplet](/solution/1800-1899/1899.Merge%20Triplets%20to%20Form%20Target%20Triplet/README_EN.md) +- [1900. The Earliest and Latest Rounds Where Players Compete](/solution/1900-1999/1900.The%20Earliest%20and%20Latest%20Rounds%20Where%20Players%20Compete/README_EN.md) + + +#### Weekly Contest 244 + +- [1886. Determine Whether Matrix Can Be Obtained By Rotation](/solution/1800-1899/1886.Determine%20Whether%20Matrix%20Can%20Be%20Obtained%20By%20Rotation/README_EN.md) +- [1887. Reduction Operations to Make the Array Elements Equal](/solution/1800-1899/1887.Reduction%20Operations%20to%20Make%20the%20Array%20Elements%20Equal/README_EN.md) +- [1888. Minimum Number of Flips to Make the Binary String Alternating](/solution/1800-1899/1888.Minimum%20Number%20of%20Flips%20to%20Make%20the%20Binary%20String%20Alternating/README_EN.md) +- [1889. Minimum Space Wasted From Packaging](/solution/1800-1899/1889.Minimum%20Space%20Wasted%20From%20Packaging/README_EN.md) + + +#### Biweekly Contest 54 + +- [1893. Check if All the Integers in a Range Are Covered](/solution/1800-1899/1893.Check%20if%20All%20the%20Integers%20in%20a%20Range%20Are%20Covered/README_EN.md) +- [1894. Find the Student that Will Replace the Chalk](/solution/1800-1899/1894.Find%20the%20Student%20that%20Will%20Replace%20the%20Chalk/README_EN.md) +- [1895. Largest Magic Square](/solution/1800-1899/1895.Largest%20Magic%20Square/README_EN.md) +- [1896. Minimum Cost to Change the Final Value of Expression](/solution/1800-1899/1896.Minimum%20Cost%20to%20Change%20the%20Final%20Value%20of%20Expression/README_EN.md) + + +#### Weekly Contest 243 + +- [1880. Check if Word Equals Summation of Two Words](/solution/1800-1899/1880.Check%20if%20Word%20Equals%20Summation%20of%20Two%20Words/README_EN.md) +- [1881. Maximum Value after Insertion](/solution/1800-1899/1881.Maximum%20Value%20after%20Insertion/README_EN.md) +- [1882. Process Tasks Using Servers](/solution/1800-1899/1882.Process%20Tasks%20Using%20Servers/README_EN.md) +- [1883. Minimum Skips to Arrive at Meeting On Time](/solution/1800-1899/1883.Minimum%20Skips%20to%20Arrive%20at%20Meeting%20On%20Time/README_EN.md) + + +#### Weekly Contest 242 + +- [1869. Longer Contiguous Segments of Ones than Zeros](/solution/1800-1899/1869.Longer%20Contiguous%20Segments%20of%20Ones%20than%20Zeros/README_EN.md) +- [1870. Minimum Speed to Arrive on Time](/solution/1800-1899/1870.Minimum%20Speed%20to%20Arrive%20on%20Time/README_EN.md) +- [1871. Jump Game VII](/solution/1800-1899/1871.Jump%20Game%20VII/README_EN.md) +- [1872. Stone Game VIII](/solution/1800-1899/1872.Stone%20Game%20VIII/README_EN.md) + + +#### Biweekly Contest 53 + +- [1876. Substrings of Size Three with Distinct Characters](/solution/1800-1899/1876.Substrings%20of%20Size%20Three%20with%20Distinct%20Characters/README_EN.md) +- [1877. Minimize Maximum Pair Sum in Array](/solution/1800-1899/1877.Minimize%20Maximum%20Pair%20Sum%20in%20Array/README_EN.md) +- [1878. Get Biggest Three Rhombus Sums in a Grid](/solution/1800-1899/1878.Get%20Biggest%20Three%20Rhombus%20Sums%20in%20a%20Grid/README_EN.md) +- [1879. Minimum XOR Sum of Two Arrays](/solution/1800-1899/1879.Minimum%20XOR%20Sum%20of%20Two%20Arrays/README_EN.md) + + +#### Weekly Contest 241 + +- [1863. Sum of All Subset XOR Totals](/solution/1800-1899/1863.Sum%20of%20All%20Subset%20XOR%20Totals/README_EN.md) +- [1864. Minimum Number of Swaps to Make the Binary String Alternating](/solution/1800-1899/1864.Minimum%20Number%20of%20Swaps%20to%20Make%20the%20Binary%20String%20Alternating/README_EN.md) +- [1865. Finding Pairs With a Certain Sum](/solution/1800-1899/1865.Finding%20Pairs%20With%20a%20Certain%20Sum/README_EN.md) +- [1866. Number of Ways to Rearrange Sticks With K Sticks Visible](/solution/1800-1899/1866.Number%20of%20Ways%20to%20Rearrange%20Sticks%20With%20K%20Sticks%20Visible/README_EN.md) + + +#### Weekly Contest 240 + +- [1854. Maximum Population Year](/solution/1800-1899/1854.Maximum%20Population%20Year/README_EN.md) +- [1855. Maximum Distance Between a Pair of Values](/solution/1800-1899/1855.Maximum%20Distance%20Between%20a%20Pair%20of%20Values/README_EN.md) +- [1856. Maximum Subarray Min-Product](/solution/1800-1899/1856.Maximum%20Subarray%20Min-Product/README_EN.md) +- [1857. Largest Color Value in a Directed Graph](/solution/1800-1899/1857.Largest%20Color%20Value%20in%20a%20Directed%20Graph/README_EN.md) + + +#### Biweekly Contest 52 + +- [1859. Sorting the Sentence](/solution/1800-1899/1859.Sorting%20the%20Sentence/README_EN.md) +- [1860. Incremental Memory Leak](/solution/1800-1899/1860.Incremental%20Memory%20Leak/README_EN.md) +- [1861. Rotating the Box](/solution/1800-1899/1861.Rotating%20the%20Box/README_EN.md) +- [1862. Sum of Floored Pairs](/solution/1800-1899/1862.Sum%20of%20Floored%20Pairs/README_EN.md) + + +#### Weekly Contest 239 + +- [1848. Minimum Distance to the Target Element](/solution/1800-1899/1848.Minimum%20Distance%20to%20the%20Target%20Element/README_EN.md) +- [1849. Splitting a String Into Descending Consecutive Values](/solution/1800-1899/1849.Splitting%20a%20String%20Into%20Descending%20Consecutive%20Values/README_EN.md) +- [1850. Minimum Adjacent Swaps to Reach the Kth Smallest Number](/solution/1800-1899/1850.Minimum%20Adjacent%20Swaps%20to%20Reach%20the%20Kth%20Smallest%20Number/README_EN.md) +- [1851. Minimum Interval to Include Each Query](/solution/1800-1899/1851.Minimum%20Interval%20to%20Include%20Each%20Query/README_EN.md) + + +#### Weekly Contest 238 + +- [1837. Sum of Digits in Base K](/solution/1800-1899/1837.Sum%20of%20Digits%20in%20Base%20K/README_EN.md) +- [1838. Frequency of the Most Frequent Element](/solution/1800-1899/1838.Frequency%20of%20the%20Most%20Frequent%20Element/README_EN.md) +- [1839. Longest Substring Of All Vowels in Order](/solution/1800-1899/1839.Longest%20Substring%20Of%20All%20Vowels%20in%20Order/README_EN.md) +- [1840. Maximum Building Height](/solution/1800-1899/1840.Maximum%20Building%20Height/README_EN.md) + + +#### Biweekly Contest 51 + +- [1844. Replace All Digits with Characters](/solution/1800-1899/1844.Replace%20All%20Digits%20with%20Characters/README_EN.md) +- [1845. Seat Reservation Manager](/solution/1800-1899/1845.Seat%20Reservation%20Manager/README_EN.md) +- [1846. Maximum Element After Decreasing and Rearranging](/solution/1800-1899/1846.Maximum%20Element%20After%20Decreasing%20and%20Rearranging/README_EN.md) +- [1847. Closest Room](/solution/1800-1899/1847.Closest%20Room/README_EN.md) + + +#### Weekly Contest 237 + +- [1832. Check if the Sentence Is Pangram](/solution/1800-1899/1832.Check%20if%20the%20Sentence%20Is%20Pangram/README_EN.md) +- [1833. Maximum Ice Cream Bars](/solution/1800-1899/1833.Maximum%20Ice%20Cream%20Bars/README_EN.md) +- [1834. Single-Threaded CPU](/solution/1800-1899/1834.Single-Threaded%20CPU/README_EN.md) +- [1835. Find XOR Sum of All Pairs Bitwise AND](/solution/1800-1899/1835.Find%20XOR%20Sum%20of%20All%20Pairs%20Bitwise%20AND/README_EN.md) + + +#### Weekly Contest 236 + +- [1822. Sign of the Product of an Array](/solution/1800-1899/1822.Sign%20of%20the%20Product%20of%20an%20Array/README_EN.md) +- [1823. Find the Winner of the Circular Game](/solution/1800-1899/1823.Find%20the%20Winner%20of%20the%20Circular%20Game/README_EN.md) +- [1824. Minimum Sideway Jumps](/solution/1800-1899/1824.Minimum%20Sideway%20Jumps/README_EN.md) +- [1825. Finding MK Average](/solution/1800-1899/1825.Finding%20MK%20Average/README_EN.md) + + +#### Biweekly Contest 50 + +- [1827. Minimum Operations to Make the Array Increasing](/solution/1800-1899/1827.Minimum%20Operations%20to%20Make%20the%20Array%20Increasing/README_EN.md) +- [1828. Queries on Number of Points Inside a Circle](/solution/1800-1899/1828.Queries%20on%20Number%20of%20Points%20Inside%20a%20Circle/README_EN.md) +- [1829. Maximum XOR for Each Query](/solution/1800-1899/1829.Maximum%20XOR%20for%20Each%20Query/README_EN.md) +- [1830. Minimum Number of Operations to Make String Sorted](/solution/1800-1899/1830.Minimum%20Number%20of%20Operations%20to%20Make%20String%20Sorted/README_EN.md) + + +#### Weekly Contest 235 + +- [1816. Truncate Sentence](/solution/1800-1899/1816.Truncate%20Sentence/README_EN.md) +- [1817. Finding the Users Active Minutes](/solution/1800-1899/1817.Finding%20the%20Users%20Active%20Minutes/README_EN.md) +- [1818. Minimum Absolute Sum Difference](/solution/1800-1899/1818.Minimum%20Absolute%20Sum%20Difference/README_EN.md) +- [1819. Number of Different Subsequences GCDs](/solution/1800-1899/1819.Number%20of%20Different%20Subsequences%20GCDs/README_EN.md) + + +#### Weekly Contest 234 + +- [1805. Number of Different Integers in a String](/solution/1800-1899/1805.Number%20of%20Different%20Integers%20in%20a%20String/README_EN.md) +- [1806. Minimum Number of Operations to Reinitialize a Permutation](/solution/1800-1899/1806.Minimum%20Number%20of%20Operations%20to%20Reinitialize%20a%20Permutation/README_EN.md) +- [1807. Evaluate the Bracket Pairs of a String](/solution/1800-1899/1807.Evaluate%20the%20Bracket%20Pairs%20of%20a%20String/README_EN.md) +- [1808. Maximize Number of Nice Divisors](/solution/1800-1899/1808.Maximize%20Number%20of%20Nice%20Divisors/README_EN.md) + + +#### Biweekly Contest 49 + +- [1812. Determine Color of a Chessboard Square](/solution/1800-1899/1812.Determine%20Color%20of%20a%20Chessboard%20Square/README_EN.md) +- [1813. Sentence Similarity III](/solution/1800-1899/1813.Sentence%20Similarity%20III/README_EN.md) +- [1814. Count Nice Pairs in an Array](/solution/1800-1899/1814.Count%20Nice%20Pairs%20in%20an%20Array/README_EN.md) +- [1815. Maximum Number of Groups Getting Fresh Donuts](/solution/1800-1899/1815.Maximum%20Number%20of%20Groups%20Getting%20Fresh%20Donuts/README_EN.md) + + +#### Weekly Contest 233 + +- [1800. Maximum Ascending Subarray Sum](/solution/1800-1899/1800.Maximum%20Ascending%20Subarray%20Sum/README_EN.md) +- [1801. Number of Orders in the Backlog](/solution/1800-1899/1801.Number%20of%20Orders%20in%20the%20Backlog/README_EN.md) +- [1802. Maximum Value at a Given Index in a Bounded Array](/solution/1800-1899/1802.Maximum%20Value%20at%20a%20Given%20Index%20in%20a%20Bounded%20Array/README_EN.md) +- [1803. Count Pairs With XOR in a Range](/solution/1800-1899/1803.Count%20Pairs%20With%20XOR%20in%20a%20Range/README_EN.md) + + +#### Weekly Contest 232 + +- [1790. Check if One String Swap Can Make Strings Equal](/solution/1700-1799/1790.Check%20if%20One%20String%20Swap%20Can%20Make%20Strings%20Equal/README_EN.md) +- [1791. Find Center of Star Graph](/solution/1700-1799/1791.Find%20Center%20of%20Star%20Graph/README_EN.md) +- [1792. Maximum Average Pass Ratio](/solution/1700-1799/1792.Maximum%20Average%20Pass%20Ratio/README_EN.md) +- [1793. Maximum Score of a Good Subarray](/solution/1700-1799/1793.Maximum%20Score%20of%20a%20Good%20Subarray/README_EN.md) + + +#### Biweekly Contest 48 + +- [1796. Second Largest Digit in a String](/solution/1700-1799/1796.Second%20Largest%20Digit%20in%20a%20String/README_EN.md) +- [1797. Design Authentication Manager](/solution/1700-1799/1797.Design%20Authentication%20Manager/README_EN.md) +- [1798. Maximum Number of Consecutive Values You Can Make](/solution/1700-1799/1798.Maximum%20Number%20of%20Consecutive%20Values%20You%20Can%20Make/README_EN.md) +- [1799. Maximize Score After N Operations](/solution/1700-1799/1799.Maximize%20Score%20After%20N%20Operations/README_EN.md) + + +#### Weekly Contest 231 + +- [1784. Check if Binary String Has at Most One Segment of Ones](/solution/1700-1799/1784.Check%20if%20Binary%20String%20Has%20at%20Most%20One%20Segment%20of%20Ones/README_EN.md) +- [1785. Minimum Elements to Add to Form a Given Sum](/solution/1700-1799/1785.Minimum%20Elements%20to%20Add%20to%20Form%20a%20Given%20Sum/README_EN.md) +- [1786. Number of Restricted Paths From First to Last Node](/solution/1700-1799/1786.Number%20of%20Restricted%20Paths%20From%20First%20to%20Last%20Node/README_EN.md) +- [1787. Make the XOR of All Segments Equal to Zero](/solution/1700-1799/1787.Make%20the%20XOR%20of%20All%20Segments%20Equal%20to%20Zero/README_EN.md) + + +#### Weekly Contest 230 + +- [1773. Count Items Matching a Rule](/solution/1700-1799/1773.Count%20Items%20Matching%20a%20Rule/README_EN.md) +- [1774. Closest Dessert Cost](/solution/1700-1799/1774.Closest%20Dessert%20Cost/README_EN.md) +- [1775. Equal Sum Arrays With Minimum Number of Operations](/solution/1700-1799/1775.Equal%20Sum%20Arrays%20With%20Minimum%20Number%20of%20Operations/README_EN.md) +- [1776. Car Fleet II](/solution/1700-1799/1776.Car%20Fleet%20II/README_EN.md) + + +#### Biweekly Contest 47 + +- [1779. Find Nearest Point That Has the Same X or Y Coordinate](/solution/1700-1799/1779.Find%20Nearest%20Point%20That%20Has%20the%20Same%20X%20or%20Y%20Coordinate/README_EN.md) +- [1780. Check if Number is a Sum of Powers of Three](/solution/1700-1799/1780.Check%20if%20Number%20is%20a%20Sum%20of%20Powers%20of%20Three/README_EN.md) +- [1781. Sum of Beauty of All Substrings](/solution/1700-1799/1781.Sum%20of%20Beauty%20of%20All%20Substrings/README_EN.md) +- [1782. Count Pairs Of Nodes](/solution/1700-1799/1782.Count%20Pairs%20Of%20Nodes/README_EN.md) + + +#### Weekly Contest 229 + +- [1768. Merge Strings Alternately](/solution/1700-1799/1768.Merge%20Strings%20Alternately/README_EN.md) +- [1769. Minimum Number of Operations to Move All Balls to Each Box](/solution/1700-1799/1769.Minimum%20Number%20of%20Operations%20to%20Move%20All%20Balls%20to%20Each%20Box/README_EN.md) +- [1770. Maximum Score from Performing Multiplication Operations](/solution/1700-1799/1770.Maximum%20Score%20from%20Performing%20Multiplication%20Operations/README_EN.md) +- [1771. Maximize Palindrome Length From Subsequences](/solution/1700-1799/1771.Maximize%20Palindrome%20Length%20From%20Subsequences/README_EN.md) + + +#### Weekly Contest 228 + +- [1758. Minimum Changes To Make Alternating Binary String](/solution/1700-1799/1758.Minimum%20Changes%20To%20Make%20Alternating%20Binary%20String/README_EN.md) +- [1759. Count Number of Homogenous Substrings](/solution/1700-1799/1759.Count%20Number%20of%20Homogenous%20Substrings/README_EN.md) +- [1760. Minimum Limit of Balls in a Bag](/solution/1700-1799/1760.Minimum%20Limit%20of%20Balls%20in%20a%20Bag/README_EN.md) +- [1761. Minimum Degree of a Connected Trio in a Graph](/solution/1700-1799/1761.Minimum%20Degree%20of%20a%20Connected%20Trio%20in%20a%20Graph/README_EN.md) + + +#### Biweekly Contest 46 + +- [1763. Longest Nice Substring](/solution/1700-1799/1763.Longest%20Nice%20Substring/README_EN.md) +- [1764. Form Array by Concatenating Subarrays of Another Array](/solution/1700-1799/1764.Form%20Array%20by%20Concatenating%20Subarrays%20of%20Another%20Array/README_EN.md) +- [1765. Map of Highest Peak](/solution/1700-1799/1765.Map%20of%20Highest%20Peak/README_EN.md) +- [1766. Tree of Coprimes](/solution/1700-1799/1766.Tree%20of%20Coprimes/README_EN.md) + + +#### Weekly Contest 227 + +- [1752. Check if Array Is Sorted and Rotated](/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README_EN.md) +- [1753. Maximum Score From Removing Stones](/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README_EN.md) +- [1754. Largest Merge Of Two Strings](/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README_EN.md) +- [1755. Closest Subsequence Sum](/solution/1700-1799/1755.Closest%20Subsequence%20Sum/README_EN.md) + + +#### Weekly Contest 226 + +- [1742. Maximum Number of Balls in a Box](/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README_EN.md) +- [1743. Restore the Array From Adjacent Pairs](/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README_EN.md) +- [1744. Can You Eat Your Favorite Candy on Your Favorite Day](/solution/1700-1799/1744.Can%20You%20Eat%20Your%20Favorite%20Candy%20on%20Your%20Favorite%20Day/README_EN.md) +- [1745. Palindrome Partitioning IV](/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README_EN.md) + + +#### Biweekly Contest 45 + +- [1748. Sum of Unique Elements](/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README_EN.md) +- [1749. Maximum Absolute Sum of Any Subarray](/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README_EN.md) +- [1750. Minimum Length of String After Deleting Similar Ends](/solution/1700-1799/1750.Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends/README_EN.md) +- [1751. Maximum Number of Events That Can Be Attended II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README_EN.md) + + +#### Weekly Contest 225 + +- [1736. Latest Time by Replacing Hidden Digits](/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README_EN.md) +- [1737. Change Minimum Characters to Satisfy One of Three Conditions](/solution/1700-1799/1737.Change%20Minimum%20Characters%20to%20Satisfy%20One%20of%20Three%20Conditions/README_EN.md) +- [1738. Find Kth Largest XOR Coordinate Value](/solution/1700-1799/1738.Find%20Kth%20Largest%20XOR%20Coordinate%20Value/README_EN.md) +- [1739. Building Boxes](/solution/1700-1799/1739.Building%20Boxes/README_EN.md) + + +#### Weekly Contest 224 + +- [1725. Number Of Rectangles That Can Form The Largest Square](/solution/1700-1799/1725.Number%20Of%20Rectangles%20That%20Can%20Form%20The%20Largest%20Square/README_EN.md) +- [1726. Tuple with Same Product](/solution/1700-1799/1726.Tuple%20with%20Same%20Product/README_EN.md) +- [1727. Largest Submatrix With Rearrangements](/solution/1700-1799/1727.Largest%20Submatrix%20With%20Rearrangements/README_EN.md) +- [1728. Cat and Mouse II](/solution/1700-1799/1728.Cat%20and%20Mouse%20II/README_EN.md) + + +#### Biweekly Contest 44 + +- [1732. Find the Highest Altitude](/solution/1700-1799/1732.Find%20the%20Highest%20Altitude/README_EN.md) +- [1733. Minimum Number of People to Teach](/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README_EN.md) +- [1734. Decode XORed Permutation](/solution/1700-1799/1734.Decode%20XORed%20Permutation/README_EN.md) +- [1735. Count Ways to Make Array With Product](/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README_EN.md) + + +#### Weekly Contest 223 + +- [1720. Decode XORed Array](/solution/1700-1799/1720.Decode%20XORed%20Array/README_EN.md) +- [1721. Swapping Nodes in a Linked List](/solution/1700-1799/1721.Swapping%20Nodes%20in%20a%20Linked%20List/README_EN.md) +- [1722. Minimize Hamming Distance After Swap Operations](/solution/1700-1799/1722.Minimize%20Hamming%20Distance%20After%20Swap%20Operations/README_EN.md) +- [1723. Find Minimum Time to Finish All Jobs](/solution/1700-1799/1723.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs/README_EN.md) + + +#### Weekly Contest 222 + +- [1710. Maximum Units on a Truck](/solution/1700-1799/1710.Maximum%20Units%20on%20a%20Truck/README_EN.md) +- [1711. Count Good Meals](/solution/1700-1799/1711.Count%20Good%20Meals/README_EN.md) +- [1712. Ways to Split Array Into Three Subarrays](/solution/1700-1799/1712.Ways%20to%20Split%20Array%20Into%20Three%20Subarrays/README_EN.md) +- [1713. Minimum Operations to Make a Subsequence](/solution/1700-1799/1713.Minimum%20Operations%20to%20Make%20a%20Subsequence/README_EN.md) + + +#### Biweekly Contest 43 + +- [1716. Calculate Money in Leetcode Bank](/solution/1700-1799/1716.Calculate%20Money%20in%20Leetcode%20Bank/README_EN.md) +- [1717. Maximum Score From Removing Substrings](/solution/1700-1799/1717.Maximum%20Score%20From%20Removing%20Substrings/README_EN.md) +- [1718. Construct the Lexicographically Largest Valid Sequence](/solution/1700-1799/1718.Construct%20the%20Lexicographically%20Largest%20Valid%20Sequence/README_EN.md) +- [1719. Number Of Ways To Reconstruct A Tree](/solution/1700-1799/1719.Number%20Of%20Ways%20To%20Reconstruct%20A%20Tree/README_EN.md) + + +#### Weekly Contest 221 + +- [1704. Determine if String Halves Are Alike](/solution/1700-1799/1704.Determine%20if%20String%20Halves%20Are%20Alike/README_EN.md) +- [1705. Maximum Number of Eaten Apples](/solution/1700-1799/1705.Maximum%20Number%20of%20Eaten%20Apples/README_EN.md) +- [1706. Where Will the Ball Fall](/solution/1700-1799/1706.Where%20Will%20the%20Ball%20Fall/README_EN.md) +- [1707. Maximum XOR With an Element From Array](/solution/1700-1799/1707.Maximum%20XOR%20With%20an%20Element%20From%20Array/README_EN.md) + + +#### Weekly Contest 220 + +- [1694. Reformat Phone Number](/solution/1600-1699/1694.Reformat%20Phone%20Number/README_EN.md) +- [1695. Maximum Erasure Value](/solution/1600-1699/1695.Maximum%20Erasure%20Value/README_EN.md) +- [1696. Jump Game VI](/solution/1600-1699/1696.Jump%20Game%20VI/README_EN.md) +- [1697. Checking Existence of Edge Length Limited Paths](/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README_EN.md) + + +#### Biweekly Contest 42 + +- [1700. Number of Students Unable to Eat Lunch](/solution/1700-1799/1700.Number%20of%20Students%20Unable%20to%20Eat%20Lunch/README_EN.md) +- [1701. Average Waiting Time](/solution/1700-1799/1701.Average%20Waiting%20Time/README_EN.md) +- [1702. Maximum Binary String After Change](/solution/1700-1799/1702.Maximum%20Binary%20String%20After%20Change/README_EN.md) +- [1703. Minimum Adjacent Swaps for K Consecutive Ones](/solution/1700-1799/1703.Minimum%20Adjacent%20Swaps%20for%20K%20Consecutive%20Ones/README_EN.md) + + +#### Weekly Contest 219 + +- [1688. Count of Matches in Tournament](/solution/1600-1699/1688.Count%20of%20Matches%20in%20Tournament/README_EN.md) +- [1689. Partitioning Into Minimum Number Of Deci-Binary Numbers](/solution/1600-1699/1689.Partitioning%20Into%20Minimum%20Number%20Of%20Deci-Binary%20Numbers/README_EN.md) +- [1690. Stone Game VII](/solution/1600-1699/1690.Stone%20Game%20VII/README_EN.md) +- [1691. Maximum Height by Stacking Cuboids](/solution/1600-1699/1691.Maximum%20Height%20by%20Stacking%20Cuboids/README_EN.md) + + +#### Weekly Contest 218 + +- [1678. Goal Parser Interpretation](/solution/1600-1699/1678.Goal%20Parser%20Interpretation/README_EN.md) +- [1679. Max Number of K-Sum Pairs](/solution/1600-1699/1679.Max%20Number%20of%20K-Sum%20Pairs/README_EN.md) +- [1680. Concatenation of Consecutive Binary Numbers](/solution/1600-1699/1680.Concatenation%20of%20Consecutive%20Binary%20Numbers/README_EN.md) +- [1681. Minimum Incompatibility](/solution/1600-1699/1681.Minimum%20Incompatibility/README_EN.md) + + +#### Biweekly Contest 41 + +- [1684. Count the Number of Consistent Strings](/solution/1600-1699/1684.Count%20the%20Number%20of%20Consistent%20Strings/README_EN.md) +- [1685. Sum of Absolute Differences in a Sorted Array](/solution/1600-1699/1685.Sum%20of%20Absolute%20Differences%20in%20a%20Sorted%20Array/README_EN.md) +- [1686. Stone Game VI](/solution/1600-1699/1686.Stone%20Game%20VI/README_EN.md) +- [1687. Delivering Boxes from Storage to Ports](/solution/1600-1699/1687.Delivering%20Boxes%20from%20Storage%20to%20Ports/README_EN.md) + + +#### Weekly Contest 217 + +- [1672. Richest Customer Wealth](/solution/1600-1699/1672.Richest%20Customer%20Wealth/README_EN.md) +- [1673. Find the Most Competitive Subsequence](/solution/1600-1699/1673.Find%20the%20Most%20Competitive%20Subsequence/README_EN.md) +- [1674. Minimum Moves to Make Array Complementary](/solution/1600-1699/1674.Minimum%20Moves%20to%20Make%20Array%20Complementary/README_EN.md) +- [1675. Minimize Deviation in Array](/solution/1600-1699/1675.Minimize%20Deviation%20in%20Array/README_EN.md) + + +#### Weekly Contest 216 + +- [1662. Check If Two String Arrays are Equivalent](/solution/1600-1699/1662.Check%20If%20Two%20String%20Arrays%20are%20Equivalent/README_EN.md) +- [1663. Smallest String With A Given Numeric Value](/solution/1600-1699/1663.Smallest%20String%20With%20A%20Given%20Numeric%20Value/README_EN.md) +- [1664. Ways to Make a Fair Array](/solution/1600-1699/1664.Ways%20to%20Make%20a%20Fair%20Array/README_EN.md) +- [1665. Minimum Initial Energy to Finish Tasks](/solution/1600-1699/1665.Minimum%20Initial%20Energy%20to%20Finish%20Tasks/README_EN.md) + + +#### Biweekly Contest 40 + +- [1668. Maximum Repeating Substring](/solution/1600-1699/1668.Maximum%20Repeating%20Substring/README_EN.md) +- [1669. Merge In Between Linked Lists](/solution/1600-1699/1669.Merge%20In%20Between%20Linked%20Lists/README_EN.md) +- [1670. Design Front Middle Back Queue](/solution/1600-1699/1670.Design%20Front%20Middle%20Back%20Queue/README_EN.md) +- [1671. Minimum Number of Removals to Make Mountain Array](/solution/1600-1699/1671.Minimum%20Number%20of%20Removals%20to%20Make%20Mountain%20Array/README_EN.md) + + +#### Weekly Contest 215 + +- [1656. Design an Ordered Stream](/solution/1600-1699/1656.Design%20an%20Ordered%20Stream/README_EN.md) +- [1657. Determine if Two Strings Are Close](/solution/1600-1699/1657.Determine%20if%20Two%20Strings%20Are%20Close/README_EN.md) +- [1658. Minimum Operations to Reduce X to Zero](/solution/1600-1699/1658.Minimum%20Operations%20to%20Reduce%20X%20to%20Zero/README_EN.md) +- [1659. Maximize Grid Happiness](/solution/1600-1699/1659.Maximize%20Grid%20Happiness/README_EN.md) + + +#### Weekly Contest 214 + +- [1646. Get Maximum in Generated Array](/solution/1600-1699/1646.Get%20Maximum%20in%20Generated%20Array/README_EN.md) +- [1647. Minimum Deletions to Make Character Frequencies Unique](/solution/1600-1699/1647.Minimum%20Deletions%20to%20Make%20Character%20Frequencies%20Unique/README_EN.md) +- [1648. Sell Diminishing-Valued Colored Balls](/solution/1600-1699/1648.Sell%20Diminishing-Valued%20Colored%20Balls/README_EN.md) +- [1649. Create Sorted Array through Instructions](/solution/1600-1699/1649.Create%20Sorted%20Array%20through%20Instructions/README_EN.md) + + +#### Biweekly Contest 39 + +- [1652. Defuse the Bomb](/solution/1600-1699/1652.Defuse%20the%20Bomb/README_EN.md) +- [1653. Minimum Deletions to Make String Balanced](/solution/1600-1699/1653.Minimum%20Deletions%20to%20Make%20String%20Balanced/README_EN.md) +- [1654. Minimum Jumps to Reach Home](/solution/1600-1699/1654.Minimum%20Jumps%20to%20Reach%20Home/README_EN.md) +- [1655. Distribute Repeating Integers](/solution/1600-1699/1655.Distribute%20Repeating%20Integers/README_EN.md) + + +#### Weekly Contest 213 + +- [1640. Check Array Formation Through Concatenation](/solution/1600-1699/1640.Check%20Array%20Formation%20Through%20Concatenation/README_EN.md) +- [1641. Count Sorted Vowel Strings](/solution/1600-1699/1641.Count%20Sorted%20Vowel%20Strings/README_EN.md) +- [1642. Furthest Building You Can Reach](/solution/1600-1699/1642.Furthest%20Building%20You%20Can%20Reach/README_EN.md) +- [1643. Kth Smallest Instructions](/solution/1600-1699/1643.Kth%20Smallest%20Instructions/README_EN.md) + + +#### Weekly Contest 212 + +- [1629. Slowest Key](/solution/1600-1699/1629.Slowest%20Key/README_EN.md) +- [1630. Arithmetic Subarrays](/solution/1600-1699/1630.Arithmetic%20Subarrays/README_EN.md) +- [1631. Path With Minimum Effort](/solution/1600-1699/1631.Path%20With%20Minimum%20Effort/README_EN.md) +- [1632. Rank Transform of a Matrix](/solution/1600-1699/1632.Rank%20Transform%20of%20a%20Matrix/README_EN.md) + + +#### Biweekly Contest 38 + +- [1636. Sort Array by Increasing Frequency](/solution/1600-1699/1636.Sort%20Array%20by%20Increasing%20Frequency/README_EN.md) +- [1637. Widest Vertical Area Between Two Points Containing No Points](/solution/1600-1699/1637.Widest%20Vertical%20Area%20Between%20Two%20Points%20Containing%20No%20Points/README_EN.md) +- [1638. Count Substrings That Differ by One Character](/solution/1600-1699/1638.Count%20Substrings%20That%20Differ%20by%20One%20Character/README_EN.md) +- [1639. Number of Ways to Form a Target String Given a Dictionary](/solution/1600-1699/1639.Number%20of%20Ways%20to%20Form%20a%20Target%20String%20Given%20a%20Dictionary/README_EN.md) + + +#### Weekly Contest 211 + +- [1624. Largest Substring Between Two Equal Characters](/solution/1600-1699/1624.Largest%20Substring%20Between%20Two%20Equal%20Characters/README_EN.md) +- [1625. Lexicographically Smallest String After Applying Operations](/solution/1600-1699/1625.Lexicographically%20Smallest%20String%20After%20Applying%20Operations/README_EN.md) +- [1626. Best Team With No Conflicts](/solution/1600-1699/1626.Best%20Team%20With%20No%20Conflicts/README_EN.md) +- [1627. Graph Connectivity With Threshold](/solution/1600-1699/1627.Graph%20Connectivity%20With%20Threshold/README_EN.md) + + +#### Weekly Contest 210 + +- [1614. Maximum Nesting Depth of the Parentheses](/solution/1600-1699/1614.Maximum%20Nesting%20Depth%20of%20the%20Parentheses/README_EN.md) +- [1615. Maximal Network Rank](/solution/1600-1699/1615.Maximal%20Network%20Rank/README_EN.md) +- [1616. Split Two Strings to Make Palindrome](/solution/1600-1699/1616.Split%20Two%20Strings%20to%20Make%20Palindrome/README_EN.md) +- [1617. Count Subtrees With Max Distance Between Cities](/solution/1600-1699/1617.Count%20Subtrees%20With%20Max%20Distance%20Between%20Cities/README_EN.md) + + +#### Biweekly Contest 37 + +- [1619. Mean of Array After Removing Some Elements](/solution/1600-1699/1619.Mean%20of%20Array%20After%20Removing%20Some%20Elements/README_EN.md) +- [1620. Coordinate With Maximum Network Quality](/solution/1600-1699/1620.Coordinate%20With%20Maximum%20Network%20Quality/README_EN.md) +- [1621. Number of Sets of K Non-Overlapping Line Segments](/solution/1600-1699/1621.Number%20of%20Sets%20of%20K%20Non-Overlapping%20Line%20Segments/README_EN.md) +- [1622. Fancy Sequence](/solution/1600-1699/1622.Fancy%20Sequence/README_EN.md) + + +#### Weekly Contest 209 + +- [1608. Special Array With X Elements Greater Than or Equal X](/solution/1600-1699/1608.Special%20Array%20With%20X%20Elements%20Greater%20Than%20or%20Equal%20X/README_EN.md) +- [1609. Even Odd Tree](/solution/1600-1699/1609.Even%20Odd%20Tree/README_EN.md) +- [1610. Maximum Number of Visible Points](/solution/1600-1699/1610.Maximum%20Number%20of%20Visible%20Points/README_EN.md) +- [1611. Minimum One Bit Operations to Make Integers Zero](/solution/1600-1699/1611.Minimum%20One%20Bit%20Operations%20to%20Make%20Integers%20Zero/README_EN.md) + + +#### Weekly Contest 208 + +- [1598. Crawler Log Folder](/solution/1500-1599/1598.Crawler%20Log%20Folder/README_EN.md) +- [1599. Maximum Profit of Operating a Centennial Wheel](/solution/1500-1599/1599.Maximum%20Profit%20of%20Operating%20a%20Centennial%20Wheel/README_EN.md) +- [1600. Throne Inheritance](/solution/1600-1699/1600.Throne%20Inheritance/README_EN.md) +- [1601. Maximum Number of Achievable Transfer Requests](/solution/1600-1699/1601.Maximum%20Number%20of%20Achievable%20Transfer%20Requests/README_EN.md) + + +#### Biweekly Contest 36 + +- [1603. Design Parking System](/solution/1600-1699/1603.Design%20Parking%20System/README_EN.md) +- [1604. Alert Using Same Key-Card Three or More Times in a One Hour Period](/solution/1600-1699/1604.Alert%20Using%20Same%20Key-Card%20Three%20or%20More%20Times%20in%20a%20One%20Hour%20Period/README_EN.md) +- [1605. Find Valid Matrix Given Row and Column Sums](/solution/1600-1699/1605.Find%20Valid%20Matrix%20Given%20Row%20and%20Column%20Sums/README_EN.md) +- [1606. Find Servers That Handled Most Number of Requests](/solution/1600-1699/1606.Find%20Servers%20That%20Handled%20Most%20Number%20of%20Requests/README_EN.md) + + +#### Weekly Contest 207 + +- [1592. Rearrange Spaces Between Words](/solution/1500-1599/1592.Rearrange%20Spaces%20Between%20Words/README_EN.md) +- [1593. Split a String Into the Max Number of Unique Substrings](/solution/1500-1599/1593.Split%20a%20String%20Into%20the%20Max%20Number%20of%20Unique%20Substrings/README_EN.md) +- [1594. Maximum Non Negative Product in a Matrix](/solution/1500-1599/1594.Maximum%20Non%20Negative%20Product%20in%20a%20Matrix/README_EN.md) +- [1595. Minimum Cost to Connect Two Groups of Points](/solution/1500-1599/1595.Minimum%20Cost%20to%20Connect%20Two%20Groups%20of%20Points/README_EN.md) + + +#### Weekly Contest 206 + +- [1582. Special Positions in a Binary Matrix](/solution/1500-1599/1582.Special%20Positions%20in%20a%20Binary%20Matrix/README_EN.md) +- [1583. Count Unhappy Friends](/solution/1500-1599/1583.Count%20Unhappy%20Friends/README_EN.md) +- [1584. Min Cost to Connect All Points](/solution/1500-1599/1584.Min%20Cost%20to%20Connect%20All%20Points/README_EN.md) +- [1585. Check If String Is Transformable With Substring Sort Operations](/solution/1500-1599/1585.Check%20If%20String%20Is%20Transformable%20With%20Substring%20Sort%20Operations/README_EN.md) + + +#### Biweekly Contest 35 + +- [1588. Sum of All Odd Length Subarrays](/solution/1500-1599/1588.Sum%20of%20All%20Odd%20Length%20Subarrays/README_EN.md) +- [1589. Maximum Sum Obtained of Any Permutation](/solution/1500-1599/1589.Maximum%20Sum%20Obtained%20of%20Any%20Permutation/README_EN.md) +- [1590. Make Sum Divisible by P](/solution/1500-1599/1590.Make%20Sum%20Divisible%20by%20P/README_EN.md) +- [1591. Strange Printer II](/solution/1500-1599/1591.Strange%20Printer%20II/README_EN.md) + + +#### Weekly Contest 205 + +- [1576. Replace All 's to Avoid Consecutive Repeating Characters](/solution/1500-1599/1576.Replace%20All%20%27s%20to%20Avoid%20Consecutive%20Repeating%20Characters/README_EN.md) +- [1577. Number of Ways Where Square of Number Is Equal to Product of Two Numbers](/solution/1500-1599/1577.Number%20of%20Ways%20Where%20Square%20of%20Number%20Is%20Equal%20to%20Product%20of%20Two%20Numbers/README_EN.md) +- [1578. Minimum Time to Make Rope Colorful](/solution/1500-1599/1578.Minimum%20Time%20to%20Make%20Rope%20Colorful/README_EN.md) +- [1579. Remove Max Number of Edges to Keep Graph Fully Traversable](/solution/1500-1599/1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable/README_EN.md) + + +#### Weekly Contest 204 + +- [1566. Detect Pattern of Length M Repeated K or More Times](/solution/1500-1599/1566.Detect%20Pattern%20of%20Length%20M%20Repeated%20K%20or%20More%20Times/README_EN.md) +- [1567. Maximum Length of Subarray With Positive Product](/solution/1500-1599/1567.Maximum%20Length%20of%20Subarray%20With%20Positive%20Product/README_EN.md) +- [1568. Minimum Number of Days to Disconnect Island](/solution/1500-1599/1568.Minimum%20Number%20of%20Days%20to%20Disconnect%20Island/README_EN.md) +- [1569. Number of Ways to Reorder Array to Get Same BST](/solution/1500-1599/1569.Number%20of%20Ways%20to%20Reorder%20Array%20to%20Get%20Same%20BST/README_EN.md) + + +#### Biweekly Contest 34 + +- [1572. Matrix Diagonal Sum](/solution/1500-1599/1572.Matrix%20Diagonal%20Sum/README_EN.md) +- [1573. Number of Ways to Split a String](/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README_EN.md) +- [1574. Shortest Subarray to be Removed to Make Array Sorted](/solution/1500-1599/1574.Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README_EN.md) +- [1575. Count All Possible Routes](/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README_EN.md) + + +#### Weekly Contest 203 + +- [1560. Most Visited Sector in a Circular Track](/solution/1500-1599/1560.Most%20Visited%20Sector%20in%20%20a%20Circular%20Track/README_EN.md) +- [1561. Maximum Number of Coins You Can Get](/solution/1500-1599/1561.Maximum%20Number%20of%20Coins%20You%20Can%20Get/README_EN.md) +- [1562. Find Latest Group of Size M](/solution/1500-1599/1562.Find%20Latest%20Group%20of%20Size%20M/README_EN.md) +- [1563. Stone Game V](/solution/1500-1599/1563.Stone%20Game%20V/README_EN.md) + + +#### Weekly Contest 202 + +- [1550. Three Consecutive Odds](/solution/1500-1599/1550.Three%20Consecutive%20Odds/README_EN.md) +- [1551. Minimum Operations to Make Array Equal](/solution/1500-1599/1551.Minimum%20Operations%20to%20Make%20Array%20Equal/README_EN.md) +- [1552. Magnetic Force Between Two Balls](/solution/1500-1599/1552.Magnetic%20Force%20Between%20Two%20Balls/README_EN.md) +- [1553. Minimum Number of Days to Eat N Oranges](/solution/1500-1599/1553.Minimum%20Number%20of%20Days%20to%20Eat%20N%20Oranges/README_EN.md) + + +#### Biweekly Contest 33 + +- [1556. Thousand Separator](/solution/1500-1599/1556.Thousand%20Separator/README_EN.md) +- [1557. Minimum Number of Vertices to Reach All Nodes](/solution/1500-1599/1557.Minimum%20Number%20of%20Vertices%20to%20Reach%20All%20Nodes/README_EN.md) +- [1558. Minimum Numbers of Function Calls to Make Target Array](/solution/1500-1599/1558.Minimum%20Numbers%20of%20Function%20Calls%20to%20Make%20Target%20Array/README_EN.md) +- [1559. Detect Cycles in 2D Grid](/solution/1500-1599/1559.Detect%20Cycles%20in%202D%20Grid/README_EN.md) + + +#### Weekly Contest 201 + +- [1544. Make The String Great](/solution/1500-1599/1544.Make%20The%20String%20Great/README_EN.md) +- [1545. Find Kth Bit in Nth Binary String](/solution/1500-1599/1545.Find%20Kth%20Bit%20in%20Nth%20Binary%20String/README_EN.md) +- [1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target](/solution/1500-1599/1546.Maximum%20Number%20of%20Non-Overlapping%20Subarrays%20With%20Sum%20Equals%20Target/README_EN.md) +- [1547. Minimum Cost to Cut a Stick](/solution/1500-1599/1547.Minimum%20Cost%20to%20Cut%20a%20Stick/README_EN.md) + + +#### Biweekly Contest 32 + +- [1539. Kth Missing Positive Number](/solution/1500-1599/1539.Kth%20Missing%20Positive%20Number/README_EN.md) +- [1540. Can Convert String in K Moves](/solution/1500-1599/1540.Can%20Convert%20String%20in%20K%20Moves/README_EN.md) +- [1541. Minimum Insertions to Balance a Parentheses String](/solution/1500-1599/1541.Minimum%20Insertions%20to%20Balance%20a%20Parentheses%20String/README_EN.md) +- [1542. Find Longest Awesome Substring](/solution/1500-1599/1542.Find%20Longest%20Awesome%20Substring/README_EN.md) + + +#### Weekly Contest 200 + +- [1534. Count Good Triplets](/solution/1500-1599/1534.Count%20Good%20Triplets/README_EN.md) +- [1535. Find the Winner of an Array Game](/solution/1500-1599/1535.Find%20the%20Winner%20of%20an%20Array%20Game/README_EN.md) +- [1536. Minimum Swaps to Arrange a Binary Grid](/solution/1500-1599/1536.Minimum%20Swaps%20to%20Arrange%20a%20Binary%20Grid/README_EN.md) +- [1537. Get the Maximum Score](/solution/1500-1599/1537.Get%20the%20Maximum%20Score/README_EN.md) + + +#### Biweekly Contest 31 + +- [1523. Count Odd Numbers in an Interval Range](/solution/1500-1599/1523.Count%20Odd%20Numbers%20in%20an%20Interval%20Range/README_EN.md) +- [1524. Number of Sub-arrays With Odd Sum](/solution/1500-1599/1524.Number%20of%20Sub-arrays%20With%20Odd%20Sum/README_EN.md) +- [1525. Number of Good Ways to Split a String](/solution/1500-1599/1525.Number%20of%20Good%20Ways%20to%20Split%20a%20String/README_EN.md) +- [1526. Minimum Number of Increments on Subarrays to Form a Target Array](/solution/1500-1599/1526.Minimum%20Number%20of%20Increments%20on%20Subarrays%20to%20Form%20a%20Target%20Array/README_EN.md) + + +#### Weekly Contest 199 + +- [1528. Shuffle String](/solution/1500-1599/1528.Shuffle%20String/README_EN.md) +- [1529. Minimum Suffix Flips](/solution/1500-1599/1529.Minimum%20Suffix%20Flips/README_EN.md) +- [1530. Number of Good Leaf Nodes Pairs](/solution/1500-1599/1530.Number%20of%20Good%20Leaf%20Nodes%20Pairs/README_EN.md) +- [1531. String Compression II](/solution/1500-1599/1531.String%20Compression%20II/README_EN.md) + + +#### Weekly Contest 198 + +- [1518. Water Bottles](/solution/1500-1599/1518.Water%20Bottles/README_EN.md) +- [1519. Number of Nodes in the Sub-Tree With the Same Label](/solution/1500-1599/1519.Number%20of%20Nodes%20in%20the%20Sub-Tree%20With%20the%20Same%20Label/README_EN.md) +- [1520. Maximum Number of Non-Overlapping Substrings](/solution/1500-1599/1520.Maximum%20Number%20of%20Non-Overlapping%20Substrings/README_EN.md) +- [1521. Find a Value of a Mysterious Function Closest to Target](/solution/1500-1599/1521.Find%20a%20Value%20of%20a%20Mysterious%20Function%20Closest%20to%20Target/README_EN.md) + + +#### Biweekly Contest 30 + +- [1507. Reformat Date](/solution/1500-1599/1507.Reformat%20Date/README_EN.md) +- [1508. Range Sum of Sorted Subarray Sums](/solution/1500-1599/1508.Range%20Sum%20of%20Sorted%20Subarray%20Sums/README_EN.md) +- [1509. Minimum Difference Between Largest and Smallest Value in Three Moves](/solution/1500-1599/1509.Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/README_EN.md) +- [1510. Stone Game IV](/solution/1500-1599/1510.Stone%20Game%20IV/README_EN.md) + + +#### Weekly Contest 197 + +- [1512. Number of Good Pairs](/solution/1500-1599/1512.Number%20of%20Good%20Pairs/README_EN.md) +- [1513. Number of Substrings With Only 1s](/solution/1500-1599/1513.Number%20of%20Substrings%20With%20Only%201s/README_EN.md) +- [1514. Path with Maximum Probability](/solution/1500-1599/1514.Path%20with%20Maximum%20Probability/README_EN.md) +- [1515. Best Position for a Service Centre](/solution/1500-1599/1515.Best%20Position%20for%20a%20Service%20Centre/README_EN.md) + + +#### Weekly Contest 196 + +- [1502. Can Make Arithmetic Progression From Sequence](/solution/1500-1599/1502.Can%20Make%20Arithmetic%20Progression%20From%20Sequence/README_EN.md) +- [1503. Last Moment Before All Ants Fall Out of a Plank](/solution/1500-1599/1503.Last%20Moment%20Before%20All%20Ants%20Fall%20Out%20of%20a%20Plank/README_EN.md) +- [1504. Count Submatrices With All Ones](/solution/1500-1599/1504.Count%20Submatrices%20With%20All%20Ones/README_EN.md) +- [1505. Minimum Possible Integer After at Most K Adjacent Swaps On Digits](/solution/1500-1599/1505.Minimum%20Possible%20Integer%20After%20at%20Most%20K%20Adjacent%20Swaps%20On%20Digits/README_EN.md) + + +#### Biweekly Contest 29 + +- [1491. Average Salary Excluding the Minimum and Maximum Salary](/solution/1400-1499/1491.Average%20Salary%20Excluding%20the%20Minimum%20and%20Maximum%20Salary/README_EN.md) +- [1492. The kth Factor of n](/solution/1400-1499/1492.The%20kth%20Factor%20of%20n/README_EN.md) +- [1493. Longest Subarray of 1's After Deleting One Element](/solution/1400-1499/1493.Longest%20Subarray%20of%201%27s%20After%20Deleting%20One%20Element/README_EN.md) +- [1494. Parallel Courses II](/solution/1400-1499/1494.Parallel%20Courses%20II/README_EN.md) + + +#### Weekly Contest 195 + +- [1496. Path Crossing](/solution/1400-1499/1496.Path%20Crossing/README_EN.md) +- [1497. Check If Array Pairs Are Divisible by k](/solution/1400-1499/1497.Check%20If%20Array%20Pairs%20Are%20Divisible%20by%20k/README_EN.md) +- [1498. Number of Subsequences That Satisfy the Given Sum Condition](/solution/1400-1499/1498.Number%20of%20Subsequences%20That%20Satisfy%20the%20Given%20Sum%20Condition/README_EN.md) +- [1499. Max Value of Equation](/solution/1400-1499/1499.Max%20Value%20of%20Equation/README_EN.md) + + +#### Weekly Contest 194 + +- [1486. XOR Operation in an Array](/solution/1400-1499/1486.XOR%20Operation%20in%20an%20Array/README_EN.md) +- [1487. Making File Names Unique](/solution/1400-1499/1487.Making%20File%20Names%20Unique/README_EN.md) +- [1488. Avoid Flood in The City](/solution/1400-1499/1488.Avoid%20Flood%20in%20The%20City/README_EN.md) +- [1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree](/solution/1400-1499/1489.Find%20Critical%20and%20Pseudo-Critical%20Edges%20in%20Minimum%20Spanning%20Tree/README_EN.md) + + +#### Biweekly Contest 28 + +- [1475. Final Prices With a Special Discount in a Shop](/solution/1400-1499/1475.Final%20Prices%20With%20a%20Special%20Discount%20in%20a%20Shop/README_EN.md) +- [1476. Subrectangle Queries](/solution/1400-1499/1476.Subrectangle%20Queries/README_EN.md) +- [1477. Find Two Non-overlapping Sub-arrays Each With Target Sum](/solution/1400-1499/1477.Find%20Two%20Non-overlapping%20Sub-arrays%20Each%20With%20Target%20Sum/README_EN.md) +- [1478. Allocate Mailboxes](/solution/1400-1499/1478.Allocate%20Mailboxes/README_EN.md) + + +#### Weekly Contest 193 + +- [1480. Running Sum of 1d Array](/solution/1400-1499/1480.Running%20Sum%20of%201d%20Array/README_EN.md) +- [1481. Least Number of Unique Integers after K Removals](/solution/1400-1499/1481.Least%20Number%20of%20Unique%20Integers%20after%20K%20Removals/README_EN.md) +- [1482. Minimum Number of Days to Make m Bouquets](/solution/1400-1499/1482.Minimum%20Number%20of%20Days%20to%20Make%20m%20Bouquets/README_EN.md) +- [1483. Kth Ancestor of a Tree Node](/solution/1400-1499/1483.Kth%20Ancestor%20of%20a%20Tree%20Node/README_EN.md) + + +#### Weekly Contest 192 + +- [1470. Shuffle the Array](/solution/1400-1499/1470.Shuffle%20the%20Array/README_EN.md) +- [1471. The k Strongest Values in an Array](/solution/1400-1499/1471.The%20k%20Strongest%20Values%20in%20an%20Array/README_EN.md) +- [1472. Design Browser History](/solution/1400-1499/1472.Design%20Browser%20History/README_EN.md) +- [1473. Paint House III](/solution/1400-1499/1473.Paint%20House%20III/README_EN.md) + + +#### Biweekly Contest 27 + +- [1460. Make Two Arrays Equal by Reversing Sub-arrays](/solution/1400-1499/1460.Make%20Two%20Arrays%20Equal%20by%20Reversing%20Sub-arrays/README_EN.md) +- [1461. Check If a String Contains All Binary Codes of Size K](/solution/1400-1499/1461.Check%20If%20a%20String%20Contains%20All%20Binary%20Codes%20of%20Size%20K/README_EN.md) +- [1462. Course Schedule IV](/solution/1400-1499/1462.Course%20Schedule%20IV/README_EN.md) +- [1463. Cherry Pickup II](/solution/1400-1499/1463.Cherry%20Pickup%20II/README_EN.md) + + +#### Weekly Contest 191 + +- [1464. Maximum Product of Two Elements in an Array](/solution/1400-1499/1464.Maximum%20Product%20of%20Two%20Elements%20in%20an%20Array/README_EN.md) +- [1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts](/solution/1400-1499/1465.Maximum%20Area%20of%20a%20Piece%20of%20Cake%20After%20Horizontal%20and%20Vertical%20Cuts/README_EN.md) +- [1466. Reorder Routes to Make All Paths Lead to the City Zero](/solution/1400-1499/1466.Reorder%20Routes%20to%20Make%20All%20Paths%20Lead%20to%20the%20City%20Zero/README_EN.md) +- [1467. Probability of a Two Boxes Having The Same Number of Distinct Balls](/solution/1400-1499/1467.Probability%20of%20a%20Two%20Boxes%20Having%20The%20Same%20Number%20of%20Distinct%20Balls/README_EN.md) + + +#### Weekly Contest 190 + +- [1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence](/solution/1400-1499/1455.Check%20If%20a%20Word%20Occurs%20As%20a%20Prefix%20of%20Any%20Word%20in%20a%20Sentence/README_EN.md) +- [1456. Maximum Number of Vowels in a Substring of Given Length](/solution/1400-1499/1456.Maximum%20Number%20of%20Vowels%20in%20a%20Substring%20of%20Given%20Length/README_EN.md) +- [1457. Pseudo-Palindromic Paths in a Binary Tree](/solution/1400-1499/1457.Pseudo-Palindromic%20Paths%20in%20a%20Binary%20Tree/README_EN.md) +- [1458. Max Dot Product of Two Subsequences](/solution/1400-1499/1458.Max%20Dot%20Product%20of%20Two%20Subsequences/README_EN.md) + + +#### Biweekly Contest 26 + +- [1446. Consecutive Characters](/solution/1400-1499/1446.Consecutive%20Characters/README_EN.md) +- [1447. Simplified Fractions](/solution/1400-1499/1447.Simplified%20Fractions/README_EN.md) +- [1448. Count Good Nodes in Binary Tree](/solution/1400-1499/1448.Count%20Good%20Nodes%20in%20Binary%20Tree/README_EN.md) +- [1449. Form Largest Integer With Digits That Add up to Target](/solution/1400-1499/1449.Form%20Largest%20Integer%20With%20Digits%20That%20Add%20up%20to%20Target/README_EN.md) + + +#### Weekly Contest 189 + +- [1450. Number of Students Doing Homework at a Given Time](/solution/1400-1499/1450.Number%20of%20Students%20Doing%20Homework%20at%20a%20Given%20Time/README_EN.md) +- [1451. Rearrange Words in a Sentence](/solution/1400-1499/1451.Rearrange%20Words%20in%20a%20Sentence/README_EN.md) +- [1452. People Whose List of Favorite Companies Is Not a Subset of Another List](/solution/1400-1499/1452.People%20Whose%20List%20of%20Favorite%20Companies%20Is%20Not%20a%20Subset%20of%20Another%20List/README_EN.md) +- [1453. Maximum Number of Darts Inside of a Circular Dartboard](/solution/1400-1499/1453.Maximum%20Number%20of%20Darts%20Inside%20of%20a%20Circular%20Dartboard/README_EN.md) + + +#### Weekly Contest 188 + +- [1441. Build an Array With Stack Operations](/solution/1400-1499/1441.Build%20an%20Array%20With%20Stack%20Operations/README_EN.md) +- [1442. Count Triplets That Can Form Two Arrays of Equal XOR](/solution/1400-1499/1442.Count%20Triplets%20That%20Can%20Form%20Two%20Arrays%20of%20Equal%20XOR/README_EN.md) +- [1443. Minimum Time to Collect All Apples in a Tree](/solution/1400-1499/1443.Minimum%20Time%20to%20Collect%20All%20Apples%20in%20a%20Tree/README_EN.md) +- [1444. Number of Ways of Cutting a Pizza](/solution/1400-1499/1444.Number%20of%20Ways%20of%20Cutting%20a%20Pizza/README_EN.md) + + +#### Biweekly Contest 25 + +- [1431. Kids With the Greatest Number of Candies](/solution/1400-1499/1431.Kids%20With%20the%20Greatest%20Number%20of%20Candies/README_EN.md) +- [1432. Max Difference You Can Get From Changing an Integer](/solution/1400-1499/1432.Max%20Difference%20You%20Can%20Get%20From%20Changing%20an%20Integer/README_EN.md) +- [1433. Check If a String Can Break Another String](/solution/1400-1499/1433.Check%20If%20a%20String%20Can%20Break%20Another%20String/README_EN.md) +- [1434. Number of Ways to Wear Different Hats to Each Other](/solution/1400-1499/1434.Number%20of%20Ways%20to%20Wear%20Different%20Hats%20to%20Each%20Other/README_EN.md) + + +#### Weekly Contest 187 + +- [1436. Destination City](/solution/1400-1499/1436.Destination%20City/README_EN.md) +- [1437. Check If All 1's Are at Least Length K Places Away](/solution/1400-1499/1437.Check%20If%20All%201%27s%20Are%20at%20Least%20Length%20K%20Places%20Away/README_EN.md) +- [1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](/solution/1400-1499/1438.Longest%20Continuous%20Subarray%20With%20Absolute%20Diff%20Less%20Than%20or%20Equal%20to%20Limit/README_EN.md) +- [1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows](/solution/1400-1499/1439.Find%20the%20Kth%20Smallest%20Sum%20of%20a%20Matrix%20With%20Sorted%20Rows/README_EN.md) + + +#### Weekly Contest 186 + +- [1422. Maximum Score After Splitting a String](/solution/1400-1499/1422.Maximum%20Score%20After%20Splitting%20a%20String/README_EN.md) +- [1423. Maximum Points You Can Obtain from Cards](/solution/1400-1499/1423.Maximum%20Points%20You%20Can%20Obtain%20from%20Cards/README_EN.md) +- [1424. Diagonal Traverse II](/solution/1400-1499/1424.Diagonal%20Traverse%20II/README_EN.md) +- [1425. Constrained Subsequence Sum](/solution/1400-1499/1425.Constrained%20Subsequence%20Sum/README_EN.md) + + +#### Biweekly Contest 24 + +- [1413. Minimum Value to Get Positive Step by Step Sum](/solution/1400-1499/1413.Minimum%20Value%20to%20Get%20Positive%20Step%20by%20Step%20Sum/README_EN.md) +- [1414. Find the Minimum Number of Fibonacci Numbers Whose Sum Is K](/solution/1400-1499/1414.Find%20the%20Minimum%20Number%20of%20Fibonacci%20Numbers%20Whose%20Sum%20Is%20K/README_EN.md) +- [1415. The k-th Lexicographical String of All Happy Strings of Length n](/solution/1400-1499/1415.The%20k-th%20Lexicographical%20String%20of%20All%20Happy%20Strings%20of%20Length%20n/README_EN.md) +- [1416. Restore The Array](/solution/1400-1499/1416.Restore%20The%20Array/README_EN.md) + + +#### Weekly Contest 185 + +- [1417. Reformat The String](/solution/1400-1499/1417.Reformat%20The%20String/README_EN.md) +- [1418. Display Table of Food Orders in a Restaurant](/solution/1400-1499/1418.Display%20Table%20of%20Food%20Orders%20in%20a%20Restaurant/README_EN.md) +- [1419. Minimum Number of Frogs Croaking](/solution/1400-1499/1419.Minimum%20Number%20of%20Frogs%20Croaking/README_EN.md) +- [1420. Build Array Where You Can Find The Maximum Exactly K Comparisons](/solution/1400-1499/1420.Build%20Array%20Where%20You%20Can%20Find%20The%20Maximum%20Exactly%20K%20Comparisons/README_EN.md) + + +#### Weekly Contest 184 + +- [1408. String Matching in an Array](/solution/1400-1499/1408.String%20Matching%20in%20an%20Array/README_EN.md) +- [1409. Queries on a Permutation With Key](/solution/1400-1499/1409.Queries%20on%20a%20Permutation%20With%20Key/README_EN.md) +- [1410. HTML Entity Parser](/solution/1400-1499/1410.HTML%20Entity%20Parser/README_EN.md) +- [1411. Number of Ways to Paint N × 3 Grid](/solution/1400-1499/1411.Number%20of%20Ways%20to%20Paint%20N%20%C3%97%203%20Grid/README_EN.md) + + +#### Biweekly Contest 23 + +- [1399. Count Largest Group](/solution/1300-1399/1399.Count%20Largest%20Group/README_EN.md) +- [1400. Construct K Palindrome Strings](/solution/1400-1499/1400.Construct%20K%20Palindrome%20Strings/README_EN.md) +- [1401. Circle and Rectangle Overlapping](/solution/1400-1499/1401.Circle%20and%20Rectangle%20Overlapping/README_EN.md) +- [1402. Reducing Dishes](/solution/1400-1499/1402.Reducing%20Dishes/README_EN.md) + + +#### Weekly Contest 183 + +- [1403. Minimum Subsequence in Non-Increasing Order](/solution/1400-1499/1403.Minimum%20Subsequence%20in%20Non-Increasing%20Order/README_EN.md) +- [1404. Number of Steps to Reduce a Number in Binary Representation to One](/solution/1400-1499/1404.Number%20of%20Steps%20to%20Reduce%20a%20Number%20in%20Binary%20Representation%20to%20One/README_EN.md) +- [1405. Longest Happy String](/solution/1400-1499/1405.Longest%20Happy%20String/README_EN.md) +- [1406. Stone Game III](/solution/1400-1499/1406.Stone%20Game%20III/README_EN.md) + + +#### Weekly Contest 182 + +- [1394. Find Lucky Integer in an Array](/solution/1300-1399/1394.Find%20Lucky%20Integer%20in%20an%20Array/README_EN.md) +- [1395. Count Number of Teams](/solution/1300-1399/1395.Count%20Number%20of%20Teams/README_EN.md) +- [1396. Design Underground System](/solution/1300-1399/1396.Design%20Underground%20System/README_EN.md) +- [1397. Find All Good Strings](/solution/1300-1399/1397.Find%20All%20Good%20Strings/README_EN.md) + + +#### Biweekly Contest 22 + +- [1385. Find the Distance Value Between Two Arrays](/solution/1300-1399/1385.Find%20the%20Distance%20Value%20Between%20Two%20Arrays/README_EN.md) +- [1386. Cinema Seat Allocation](/solution/1300-1399/1386.Cinema%20Seat%20Allocation/README_EN.md) +- [1387. Sort Integers by The Power Value](/solution/1300-1399/1387.Sort%20Integers%20by%20The%20Power%20Value/README_EN.md) +- [1388. Pizza With 3n Slices](/solution/1300-1399/1388.Pizza%20With%203n%20Slices/README_EN.md) + + +#### Weekly Contest 181 + +- [1389. Create Target Array in the Given Order](/solution/1300-1399/1389.Create%20Target%20Array%20in%20the%20Given%20Order/README_EN.md) +- [1390. Four Divisors](/solution/1300-1399/1390.Four%20Divisors/README_EN.md) +- [1391. Check if There is a Valid Path in a Grid](/solution/1300-1399/1391.Check%20if%20There%20is%20a%20Valid%20Path%20in%20a%20Grid/README_EN.md) +- [1392. Longest Happy Prefix](/solution/1300-1399/1392.Longest%20Happy%20Prefix/README_EN.md) + + +#### Weekly Contest 180 + +- [1380. Lucky Numbers in a Matrix](/solution/1300-1399/1380.Lucky%20Numbers%20in%20a%20Matrix/README_EN.md) +- [1381. Design a Stack With Increment Operation](/solution/1300-1399/1381.Design%20a%20Stack%20With%20Increment%20Operation/README_EN.md) +- [1382. Balance a Binary Search Tree](/solution/1300-1399/1382.Balance%20a%20Binary%20Search%20Tree/README_EN.md) +- [1383. Maximum Performance of a Team](/solution/1300-1399/1383.Maximum%20Performance%20of%20a%20Team/README_EN.md) + + +#### Biweekly Contest 21 + +- [1370. Increasing Decreasing String](/solution/1300-1399/1370.Increasing%20Decreasing%20String/README_EN.md) +- [1371. Find the Longest Substring Containing Vowels in Even Counts](/solution/1300-1399/1371.Find%20the%20Longest%20Substring%20Containing%20Vowels%20in%20Even%20Counts/README_EN.md) +- [1372. Longest ZigZag Path in a Binary Tree](/solution/1300-1399/1372.Longest%20ZigZag%20Path%20in%20a%20Binary%20Tree/README_EN.md) +- [1373. Maximum Sum BST in Binary Tree](/solution/1300-1399/1373.Maximum%20Sum%20BST%20in%20Binary%20Tree/README_EN.md) + + +#### Weekly Contest 179 + +- [1374. Generate a String With Characters That Have Odd Counts](/solution/1300-1399/1374.Generate%20a%20String%20With%20Characters%20That%20Have%20Odd%20Counts/README_EN.md) +- [1375. Number of Times Binary String Is Prefix-Aligned](/solution/1300-1399/1375.Number%20of%20Times%20Binary%20String%20Is%20Prefix-Aligned/README_EN.md) +- [1376. Time Needed to Inform All Employees](/solution/1300-1399/1376.Time%20Needed%20to%20Inform%20All%20Employees/README_EN.md) +- [1377. Frog Position After T Seconds](/solution/1300-1399/1377.Frog%20Position%20After%20T%20Seconds/README_EN.md) + + +#### Weekly Contest 178 + +- [1365. How Many Numbers Are Smaller Than the Current Number](/solution/1300-1399/1365.How%20Many%20Numbers%20Are%20Smaller%20Than%20the%20Current%20Number/README_EN.md) +- [1366. Rank Teams by Votes](/solution/1300-1399/1366.Rank%20Teams%20by%20Votes/README_EN.md) +- [1367. Linked List in Binary Tree](/solution/1300-1399/1367.Linked%20List%20in%20Binary%20Tree/README_EN.md) +- [1368. Minimum Cost to Make at Least One Valid Path in a Grid](/solution/1300-1399/1368.Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/README_EN.md) + + +#### Biweekly Contest 20 + +- [1356. Sort Integers by The Number of 1 Bits](/solution/1300-1399/1356.Sort%20Integers%20by%20The%20Number%20of%201%20Bits/README_EN.md) +- [1357. Apply Discount Every n Orders](/solution/1300-1399/1357.Apply%20Discount%20Every%20n%20Orders/README_EN.md) +- [1358. Number of Substrings Containing All Three Characters](/solution/1300-1399/1358.Number%20of%20Substrings%20Containing%20All%20Three%20Characters/README_EN.md) +- [1359. Count All Valid Pickup and Delivery Options](/solution/1300-1399/1359.Count%20All%20Valid%20Pickup%20and%20Delivery%20Options/README_EN.md) + + +#### Weekly Contest 177 + +- [1360. Number of Days Between Two Dates](/solution/1300-1399/1360.Number%20of%20Days%20Between%20Two%20Dates/README_EN.md) +- [1361. Validate Binary Tree Nodes](/solution/1300-1399/1361.Validate%20Binary%20Tree%20Nodes/README_EN.md) +- [1362. Closest Divisors](/solution/1300-1399/1362.Closest%20Divisors/README_EN.md) +- [1363. Largest Multiple of Three](/solution/1300-1399/1363.Largest%20Multiple%20of%20Three/README_EN.md) + + +#### Weekly Contest 176 + +- [1351. Count Negative Numbers in a Sorted Matrix](/solution/1300-1399/1351.Count%20Negative%20Numbers%20in%20a%20Sorted%20Matrix/README_EN.md) +- [1352. Product of the Last K Numbers](/solution/1300-1399/1352.Product%20of%20the%20Last%20K%20Numbers/README_EN.md) +- [1353. Maximum Number of Events That Can Be Attended](/solution/1300-1399/1353.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended/README_EN.md) +- [1354. Construct Target Array With Multiple Sums](/solution/1300-1399/1354.Construct%20Target%20Array%20With%20Multiple%20Sums/README_EN.md) + + +#### Biweekly Contest 19 + +- [1342. Number of Steps to Reduce a Number to Zero](/solution/1300-1399/1342.Number%20of%20Steps%20to%20Reduce%20a%20Number%20to%20Zero/README_EN.md) +- [1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold](/solution/1300-1399/1343.Number%20of%20Sub-arrays%20of%20Size%20K%20and%20Average%20Greater%20than%20or%20Equal%20to%20Threshold/README_EN.md) +- [1344. Angle Between Hands of a Clock](/solution/1300-1399/1344.Angle%20Between%20Hands%20of%20a%20Clock/README_EN.md) +- [1345. Jump Game IV](/solution/1300-1399/1345.Jump%20Game%20IV/README_EN.md) + + +#### Weekly Contest 175 + +- [1346. Check If N and Its Double Exist](/solution/1300-1399/1346.Check%20If%20N%20and%20Its%20Double%20Exist/README_EN.md) +- [1347. Minimum Number of Steps to Make Two Strings Anagram](/solution/1300-1399/1347.Minimum%20Number%20of%20Steps%20to%20Make%20Two%20Strings%20Anagram/README_EN.md) +- [1348. Tweet Counts Per Frequency](/solution/1300-1399/1348.Tweet%20Counts%20Per%20Frequency/README_EN.md) +- [1349. Maximum Students Taking Exam](/solution/1300-1399/1349.Maximum%20Students%20Taking%20Exam/README_EN.md) + + +#### Weekly Contest 174 + +- [1337. The K Weakest Rows in a Matrix](/solution/1300-1399/1337.The%20K%20Weakest%20Rows%20in%20a%20Matrix/README_EN.md) +- [1338. Reduce Array Size to The Half](/solution/1300-1399/1338.Reduce%20Array%20Size%20to%20The%20Half/README_EN.md) +- [1339. Maximum Product of Splitted Binary Tree](/solution/1300-1399/1339.Maximum%20Product%20of%20Splitted%20Binary%20Tree/README_EN.md) +- [1340. Jump Game V](/solution/1300-1399/1340.Jump%20Game%20V/README_EN.md) + + +#### Biweekly Contest 18 + +- [1331. Rank Transform of an Array](/solution/1300-1399/1331.Rank%20Transform%20of%20an%20Array/README_EN.md) +- [1328. Break a Palindrome](/solution/1300-1399/1328.Break%20a%20Palindrome/README_EN.md) +- [1329. Sort the Matrix Diagonally](/solution/1300-1399/1329.Sort%20the%20Matrix%20Diagonally/README_EN.md) +- [1330. Reverse Subarray To Maximize Array Value](/solution/1300-1399/1330.Reverse%20Subarray%20To%20Maximize%20Array%20Value/README_EN.md) + + +#### Weekly Contest 173 + +- [1332. Remove Palindromic Subsequences](/solution/1300-1399/1332.Remove%20Palindromic%20Subsequences/README_EN.md) +- [1333. Filter Restaurants by Vegan-Friendly, Price and Distance](/solution/1300-1399/1333.Filter%20Restaurants%20by%20Vegan-Friendly%2C%20Price%20and%20Distance/README_EN.md) +- [1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance](/solution/1300-1399/1334.Find%20the%20City%20With%20the%20Smallest%20Number%20of%20Neighbors%20at%20a%20Threshold%20Distance/README_EN.md) +- [1335. Minimum Difficulty of a Job Schedule](/solution/1300-1399/1335.Minimum%20Difficulty%20of%20a%20Job%20Schedule/README_EN.md) + + +#### Weekly Contest 172 + +- [1323. Maximum 69 Number](/solution/1300-1399/1323.Maximum%2069%20Number/README_EN.md) +- [1324. Print Words Vertically](/solution/1300-1399/1324.Print%20Words%20Vertically/README_EN.md) +- [1325. Delete Leaves With a Given Value](/solution/1300-1399/1325.Delete%20Leaves%20With%20a%20Given%20Value/README_EN.md) +- [1326. Minimum Number of Taps to Open to Water a Garden](/solution/1300-1399/1326.Minimum%20Number%20of%20Taps%20to%20Open%20to%20Water%20a%20Garden/README_EN.md) + + +#### Biweekly Contest 17 + +- [1313. Decompress Run-Length Encoded List](/solution/1300-1399/1313.Decompress%20Run-Length%20Encoded%20List/README_EN.md) +- [1314. Matrix Block Sum](/solution/1300-1399/1314.Matrix%20Block%20Sum/README_EN.md) +- [1315. Sum of Nodes with Even-Valued Grandparent](/solution/1300-1399/1315.Sum%20of%20Nodes%20with%20Even-Valued%20Grandparent/README_EN.md) +- [1316. Distinct Echo Substrings](/solution/1300-1399/1316.Distinct%20Echo%20Substrings/README_EN.md) + + +#### Weekly Contest 171 + +- [1317. Convert Integer to the Sum of Two No-Zero Integers](/solution/1300-1399/1317.Convert%20Integer%20to%20the%20Sum%20of%20Two%20No-Zero%20Integers/README_EN.md) +- [1318. Minimum Flips to Make a OR b Equal to c](/solution/1300-1399/1318.Minimum%20Flips%20to%20Make%20a%20OR%20b%20Equal%20to%20c/README_EN.md) +- [1319. Number of Operations to Make Network Connected](/solution/1300-1399/1319.Number%20of%20Operations%20to%20Make%20Network%20Connected/README_EN.md) +- [1320. Minimum Distance to Type a Word Using Two Fingers](/solution/1300-1399/1320.Minimum%20Distance%20to%20Type%20a%20Word%20Using%20Two%20Fingers/README_EN.md) + + +#### Weekly Contest 170 + +- [1309. Decrypt String from Alphabet to Integer Mapping](/solution/1300-1399/1309.Decrypt%20String%20from%20Alphabet%20to%20Integer%20Mapping/README_EN.md) +- [1310. XOR Queries of a Subarray](/solution/1300-1399/1310.XOR%20Queries%20of%20a%20Subarray/README_EN.md) +- [1311. Get Watched Videos by Your Friends](/solution/1300-1399/1311.Get%20Watched%20Videos%20by%20Your%20Friends/README_EN.md) +- [1312. Minimum Insertion Steps to Make a String Palindrome](/solution/1300-1399/1312.Minimum%20Insertion%20Steps%20to%20Make%20a%20String%20Palindrome/README_EN.md) + + +#### Biweekly Contest 16 + +- [1299. Replace Elements with Greatest Element on Right Side](/solution/1200-1299/1299.Replace%20Elements%20with%20Greatest%20Element%20on%20Right%20Side/README_EN.md) +- [1300. Sum of Mutated Array Closest to Target](/solution/1300-1399/1300.Sum%20of%20Mutated%20Array%20Closest%20to%20Target/README_EN.md) +- [1302. Deepest Leaves Sum](/solution/1300-1399/1302.Deepest%20Leaves%20Sum/README_EN.md) +- [1301. Number of Paths with Max Score](/solution/1300-1399/1301.Number%20of%20Paths%20with%20Max%20Score/README_EN.md) + + +#### Weekly Contest 169 + +- [1304. Find N Unique Integers Sum up to Zero](/solution/1300-1399/1304.Find%20N%20Unique%20Integers%20Sum%20up%20to%20Zero/README_EN.md) +- [1305. All Elements in Two Binary Search Trees](/solution/1300-1399/1305.All%20Elements%20in%20Two%20Binary%20Search%20Trees/README_EN.md) +- [1306. Jump Game III](/solution/1300-1399/1306.Jump%20Game%20III/README_EN.md) +- [1307. Verbal Arithmetic Puzzle](/solution/1300-1399/1307.Verbal%20Arithmetic%20Puzzle/README_EN.md) + + +#### Weekly Contest 168 + +- [1295. Find Numbers with Even Number of Digits](/solution/1200-1299/1295.Find%20Numbers%20with%20Even%20Number%20of%20Digits/README_EN.md) +- [1296. Divide Array in Sets of K Consecutive Numbers](/solution/1200-1299/1296.Divide%20Array%20in%20Sets%20of%20K%20Consecutive%20Numbers/README_EN.md) +- [1297. Maximum Number of Occurrences of a Substring](/solution/1200-1299/1297.Maximum%20Number%20of%20Occurrences%20of%20a%20Substring/README_EN.md) +- [1298. Maximum Candies You Can Get from Boxes](/solution/1200-1299/1298.Maximum%20Candies%20You%20Can%20Get%20from%20Boxes/README_EN.md) + + +#### Biweekly Contest 15 + +- [1287. Element Appearing More Than 25% In Sorted Array](/solution/1200-1299/1287.Element%20Appearing%20More%20Than%2025%25%20In%20Sorted%20Array/README_EN.md) +- [1288. Remove Covered Intervals](/solution/1200-1299/1288.Remove%20Covered%20Intervals/README_EN.md) +- [1286. Iterator for Combination](/solution/1200-1299/1286.Iterator%20for%20Combination/README_EN.md) +- [1289. Minimum Falling Path Sum II](/solution/1200-1299/1289.Minimum%20Falling%20Path%20Sum%20II/README_EN.md) + + +#### Weekly Contest 167 + +- [1290. Convert Binary Number in a Linked List to Integer](/solution/1200-1299/1290.Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer/README_EN.md) +- [1291. Sequential Digits](/solution/1200-1299/1291.Sequential%20Digits/README_EN.md) +- [1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold](/solution/1200-1299/1292.Maximum%20Side%20Length%20of%20a%20Square%20with%20Sum%20Less%20than%20or%20Equal%20to%20Threshold/README_EN.md) +- [1293. Shortest Path in a Grid with Obstacles Elimination](/solution/1200-1299/1293.Shortest%20Path%20in%20a%20Grid%20with%20Obstacles%20Elimination/README_EN.md) + + +#### Weekly Contest 166 + +- [1281. Subtract the Product and Sum of Digits of an Integer](/solution/1200-1299/1281.Subtract%20the%20Product%20and%20Sum%20of%20Digits%20of%20an%20Integer/README_EN.md) +- [1282. Group the People Given the Group Size They Belong To](/solution/1200-1299/1282.Group%20the%20People%20Given%20the%20Group%20Size%20They%20Belong%20To/README_EN.md) +- [1283. Find the Smallest Divisor Given a Threshold](/solution/1200-1299/1283.Find%20the%20Smallest%20Divisor%20Given%20a%20Threshold/README_EN.md) +- [1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix](/solution/1200-1299/1284.Minimum%20Number%20of%20Flips%20to%20Convert%20Binary%20Matrix%20to%20Zero%20Matrix/README_EN.md) + + +#### Biweekly Contest 14 + +- [1271. Hexspeak](/solution/1200-1299/1271.Hexspeak/README_EN.md) +- [1272. Remove Interval](/solution/1200-1299/1272.Remove%20Interval/README_EN.md) +- [1273. Delete Tree Nodes](/solution/1200-1299/1273.Delete%20Tree%20Nodes/README_EN.md) +- [1274. Number of Ships in a Rectangle](/solution/1200-1299/1274.Number%20of%20Ships%20in%20a%20Rectangle/README_EN.md) + + +#### Weekly Contest 165 + +- [1275. Find Winner on a Tic Tac Toe Game](/solution/1200-1299/1275.Find%20Winner%20on%20a%20Tic%20Tac%20Toe%20Game/README_EN.md) +- [1276. Number of Burgers with No Waste of Ingredients](/solution/1200-1299/1276.Number%20of%20Burgers%20with%20No%20Waste%20of%20Ingredients/README_EN.md) +- [1277. Count Square Submatrices with All Ones](/solution/1200-1299/1277.Count%20Square%20Submatrices%20with%20All%20Ones/README_EN.md) +- [1278. Palindrome Partitioning III](/solution/1200-1299/1278.Palindrome%20Partitioning%20III/README_EN.md) + + +#### Weekly Contest 164 + +- [1266. Minimum Time Visiting All Points](/solution/1200-1299/1266.Minimum%20Time%20Visiting%20All%20Points/README_EN.md) +- [1267. Count Servers that Communicate](/solution/1200-1299/1267.Count%20Servers%20that%20Communicate/README_EN.md) +- [1268. Search Suggestions System](/solution/1200-1299/1268.Search%20Suggestions%20System/README_EN.md) +- [1269. Number of Ways to Stay in the Same Place After Some Steps](/solution/1200-1299/1269.Number%20of%20Ways%20to%20Stay%20in%20the%20Same%20Place%20After%20Some%20Steps/README_EN.md) + + +#### Biweekly Contest 13 + +- [1256. Encode Number](/solution/1200-1299/1256.Encode%20Number/README_EN.md) +- [1257. Smallest Common Region](/solution/1200-1299/1257.Smallest%20Common%20Region/README_EN.md) +- [1258. Synonymous Sentences](/solution/1200-1299/1258.Synonymous%20Sentences/README_EN.md) +- [1259. Handshakes That Don't Cross](/solution/1200-1299/1259.Handshakes%20That%20Don%27t%20Cross/README_EN.md) + + +#### Weekly Contest 163 + +- [1260. Shift 2D Grid](/solution/1200-1299/1260.Shift%202D%20Grid/README_EN.md) +- [1261. Find Elements in a Contaminated Binary Tree](/solution/1200-1299/1261.Find%20Elements%20in%20a%20Contaminated%20Binary%20Tree/README_EN.md) +- [1262. Greatest Sum Divisible by Three](/solution/1200-1299/1262.Greatest%20Sum%20Divisible%20by%20Three/README_EN.md) +- [1263. Minimum Moves to Move a Box to Their Target Location](/solution/1200-1299/1263.Minimum%20Moves%20to%20Move%20a%20Box%20to%20Their%20Target%20Location/README_EN.md) + + +#### Weekly Contest 162 + +- [1252. Cells with Odd Values in a Matrix](/solution/1200-1299/1252.Cells%20with%20Odd%20Values%20in%20a%20Matrix/README_EN.md) +- [1253. Reconstruct a 2-Row Binary Matrix](/solution/1200-1299/1253.Reconstruct%20a%202-Row%20Binary%20Matrix/README_EN.md) +- [1254. Number of Closed Islands](/solution/1200-1299/1254.Number%20of%20Closed%20Islands/README_EN.md) +- [1255. Maximum Score Words Formed by Letters](/solution/1200-1299/1255.Maximum%20Score%20Words%20Formed%20by%20Letters/README_EN.md) + + +#### Biweekly Contest 12 + +- [1244. Design A Leaderboard](/solution/1200-1299/1244.Design%20A%20Leaderboard/README_EN.md) +- [1243. Array Transformation](/solution/1200-1299/1243.Array%20Transformation/README_EN.md) +- [1245. Tree Diameter](/solution/1200-1299/1245.Tree%20Diameter/README_EN.md) +- [1246. Palindrome Removal](/solution/1200-1299/1246.Palindrome%20Removal/README_EN.md) + + +#### Weekly Contest 161 + +- [1247. Minimum Swaps to Make Strings Equal](/solution/1200-1299/1247.Minimum%20Swaps%20to%20Make%20Strings%20Equal/README_EN.md) +- [1248. Count Number of Nice Subarrays](/solution/1200-1299/1248.Count%20Number%20of%20Nice%20Subarrays/README_EN.md) +- [1249. Minimum Remove to Make Valid Parentheses](/solution/1200-1299/1249.Minimum%20Remove%20to%20Make%20Valid%20Parentheses/README_EN.md) +- [1250. Check If It Is a Good Array](/solution/1200-1299/1250.Check%20If%20It%20Is%20a%20Good%20Array/README_EN.md) + + +#### Weekly Contest 160 + +- [1237. Find Positive Integer Solution for a Given Equation](/solution/1200-1299/1237.Find%20Positive%20Integer%20Solution%20for%20a%20Given%20Equation/README_EN.md) +- [1238. Circular Permutation in Binary Representation](/solution/1200-1299/1238.Circular%20Permutation%20in%20Binary%20Representation/README_EN.md) +- [1239. Maximum Length of a Concatenated String with Unique Characters](/solution/1200-1299/1239.Maximum%20Length%20of%20a%20Concatenated%20String%20with%20Unique%20Characters/README_EN.md) +- [1240. Tiling a Rectangle with the Fewest Squares](/solution/1200-1299/1240.Tiling%20a%20Rectangle%20with%20the%20Fewest%20Squares/README_EN.md) + + +#### Biweekly Contest 11 + +- [1228. Missing Number In Arithmetic Progression](/solution/1200-1299/1228.Missing%20Number%20In%20Arithmetic%20Progression/README_EN.md) +- [1229. Meeting Scheduler](/solution/1200-1299/1229.Meeting%20Scheduler/README_EN.md) +- [1230. Toss Strange Coins](/solution/1200-1299/1230.Toss%20Strange%20Coins/README_EN.md) +- [1231. Divide Chocolate](/solution/1200-1299/1231.Divide%20Chocolate/README_EN.md) + + +#### Weekly Contest 159 + +- [1232. Check If It Is a Straight Line](/solution/1200-1299/1232.Check%20If%20It%20Is%20a%20Straight%20Line/README_EN.md) +- [1233. Remove Sub-Folders from the Filesystem](/solution/1200-1299/1233.Remove%20Sub-Folders%20from%20the%20Filesystem/README_EN.md) +- [1234. Replace the Substring for Balanced String](/solution/1200-1299/1234.Replace%20the%20Substring%20for%20Balanced%20String/README_EN.md) +- [1235. Maximum Profit in Job Scheduling](/solution/1200-1299/1235.Maximum%20Profit%20in%20Job%20Scheduling/README_EN.md) + + +#### Weekly Contest 158 + +- [1221. Split a String in Balanced Strings](/solution/1200-1299/1221.Split%20a%20String%20in%20Balanced%20Strings/README_EN.md) +- [1222. Queens That Can Attack the King](/solution/1200-1299/1222.Queens%20That%20Can%20Attack%20the%20King/README_EN.md) +- [1223. Dice Roll Simulation](/solution/1200-1299/1223.Dice%20Roll%20Simulation/README_EN.md) +- [1224. Maximum Equal Frequency](/solution/1200-1299/1224.Maximum%20Equal%20Frequency/README_EN.md) + + +#### Biweekly Contest 10 + +- [1213. Intersection of Three Sorted Arrays](/solution/1200-1299/1213.Intersection%20of%20Three%20Sorted%20Arrays/README_EN.md) +- [1214. Two Sum BSTs](/solution/1200-1299/1214.Two%20Sum%20BSTs/README_EN.md) +- [1215. Stepping Numbers](/solution/1200-1299/1215.Stepping%20Numbers/README_EN.md) +- [1216. Valid Palindrome III](/solution/1200-1299/1216.Valid%20Palindrome%20III/README_EN.md) + + +#### Weekly Contest 157 + +- [1217. Minimum Cost to Move Chips to The Same Position](/solution/1200-1299/1217.Minimum%20Cost%20to%20Move%20Chips%20to%20The%20Same%20Position/README_EN.md) +- [1218. Longest Arithmetic Subsequence of Given Difference](/solution/1200-1299/1218.Longest%20Arithmetic%20Subsequence%20of%20Given%20Difference/README_EN.md) +- [1219. Path with Maximum Gold](/solution/1200-1299/1219.Path%20with%20Maximum%20Gold/README_EN.md) +- [1220. Count Vowels Permutation](/solution/1200-1299/1220.Count%20Vowels%20Permutation/README_EN.md) + + +#### Weekly Contest 156 + +- [1207. Unique Number of Occurrences](/solution/1200-1299/1207.Unique%20Number%20of%20Occurrences/README_EN.md) +- [1208. Get Equal Substrings Within Budget](/solution/1200-1299/1208.Get%20Equal%20Substrings%20Within%20Budget/README_EN.md) +- [1209. Remove All Adjacent Duplicates in String II](/solution/1200-1299/1209.Remove%20All%20Adjacent%20Duplicates%20in%20String%20II/README_EN.md) +- [1210. Minimum Moves to Reach Target with Rotations](/solution/1200-1299/1210.Minimum%20Moves%20to%20Reach%20Target%20with%20Rotations/README_EN.md) + + +#### Biweekly Contest 9 + +- [1196. How Many Apples Can You Put into the Basket](/solution/1100-1199/1196.How%20Many%20Apples%20Can%20You%20Put%20into%20the%20Basket/README_EN.md) +- [1197. Minimum Knight Moves](/solution/1100-1199/1197.Minimum%20Knight%20Moves/README_EN.md) +- [1198. Find Smallest Common Element in All Rows](/solution/1100-1199/1198.Find%20Smallest%20Common%20Element%20in%20All%20Rows/README_EN.md) +- [1199. Minimum Time to Build Blocks](/solution/1100-1199/1199.Minimum%20Time%20to%20Build%20Blocks/README_EN.md) + + +#### Weekly Contest 155 + +- [1200. Minimum Absolute Difference](/solution/1200-1299/1200.Minimum%20Absolute%20Difference/README_EN.md) +- [1201. Ugly Number III](/solution/1200-1299/1201.Ugly%20Number%20III/README_EN.md) +- [1202. Smallest String With Swaps](/solution/1200-1299/1202.Smallest%20String%20With%20Swaps/README_EN.md) +- [1203. Sort Items by Groups Respecting Dependencies](/solution/1200-1299/1203.Sort%20Items%20by%20Groups%20Respecting%20Dependencies/README_EN.md) + + +#### Weekly Contest 154 + +- [1189. Maximum Number of Balloons](/solution/1100-1199/1189.Maximum%20Number%20of%20Balloons/README_EN.md) +- [1190. Reverse Substrings Between Each Pair of Parentheses](/solution/1100-1199/1190.Reverse%20Substrings%20Between%20Each%20Pair%20of%20Parentheses/README_EN.md) +- [1191. K-Concatenation Maximum Sum](/solution/1100-1199/1191.K-Concatenation%20Maximum%20Sum/README_EN.md) +- [1192. Critical Connections in a Network](/solution/1100-1199/1192.Critical%20Connections%20in%20a%20Network/README_EN.md) + + +#### Biweekly Contest 8 + +- [1180. Count Substrings with Only One Distinct Letter](/solution/1100-1199/1180.Count%20Substrings%20with%20Only%20One%20Distinct%20Letter/README_EN.md) +- [1181. Before and After Puzzle](/solution/1100-1199/1181.Before%20and%20After%20Puzzle/README_EN.md) +- [1182. Shortest Distance to Target Color](/solution/1100-1199/1182.Shortest%20Distance%20to%20Target%20Color/README_EN.md) +- [1183. Maximum Number of Ones](/solution/1100-1199/1183.Maximum%20Number%20of%20Ones/README_EN.md) + + +#### Weekly Contest 153 + +- [1184. Distance Between Bus Stops](/solution/1100-1199/1184.Distance%20Between%20Bus%20Stops/README_EN.md) +- [1185. Day of the Week](/solution/1100-1199/1185.Day%20of%20the%20Week/README_EN.md) +- [1186. Maximum Subarray Sum with One Deletion](/solution/1100-1199/1186.Maximum%20Subarray%20Sum%20with%20One%20Deletion/README_EN.md) +- [1187. Make Array Strictly Increasing](/solution/1100-1199/1187.Make%20Array%20Strictly%20Increasing/README_EN.md) + + +#### Weekly Contest 152 + +- [1175. Prime Arrangements](/solution/1100-1199/1175.Prime%20Arrangements/README_EN.md) +- [1176. Diet Plan Performance](/solution/1100-1199/1176.Diet%20Plan%20Performance/README_EN.md) +- [1177. Can Make Palindrome from Substring](/solution/1100-1199/1177.Can%20Make%20Palindrome%20from%20Substring/README_EN.md) +- [1178. Number of Valid Words for Each Puzzle](/solution/1100-1199/1178.Number%20of%20Valid%20Words%20for%20Each%20Puzzle/README_EN.md) + + +#### Biweekly Contest 7 + +- [1165. Single-Row Keyboard](/solution/1100-1199/1165.Single-Row%20Keyboard/README_EN.md) +- [1166. Design File System](/solution/1100-1199/1166.Design%20File%20System/README_EN.md) +- [1167. Minimum Cost to Connect Sticks](/solution/1100-1199/1167.Minimum%20Cost%20to%20Connect%20Sticks/README_EN.md) +- [1168. Optimize Water Distribution in a Village](/solution/1100-1199/1168.Optimize%20Water%20Distribution%20in%20a%20Village/README_EN.md) + + +#### Weekly Contest 151 + +- [1169. Invalid Transactions](/solution/1100-1199/1169.Invalid%20Transactions/README_EN.md) +- [1170. Compare Strings by Frequency of the Smallest Character](/solution/1100-1199/1170.Compare%20Strings%20by%20Frequency%20of%20the%20Smallest%20Character/README_EN.md) +- [1171. Remove Zero Sum Consecutive Nodes from Linked List](/solution/1100-1199/1171.Remove%20Zero%20Sum%20Consecutive%20Nodes%20from%20Linked%20List/README_EN.md) +- [1172. Dinner Plate Stacks](/solution/1100-1199/1172.Dinner%20Plate%20Stacks/README_EN.md) + + +#### Weekly Contest 150 + +- [1160. Find Words That Can Be Formed by Characters](/solution/1100-1199/1160.Find%20Words%20That%20Can%20Be%20Formed%20by%20Characters/README_EN.md) +- [1161. Maximum Level Sum of a Binary Tree](/solution/1100-1199/1161.Maximum%20Level%20Sum%20of%20a%20Binary%20Tree/README_EN.md) +- [1162. As Far from Land as Possible](/solution/1100-1199/1162.As%20Far%20from%20Land%20as%20Possible/README_EN.md) +- [1163. Last Substring in Lexicographical Order](/solution/1100-1199/1163.Last%20Substring%20in%20Lexicographical%20Order/README_EN.md) + + +#### Biweekly Contest 6 + +- [1150. Check If a Number Is Majority Element in a Sorted Array](/solution/1100-1199/1150.Check%20If%20a%20Number%20Is%20Majority%20Element%20in%20a%20Sorted%20Array/README_EN.md) +- [1151. Minimum Swaps to Group All 1's Together](/solution/1100-1199/1151.Minimum%20Swaps%20to%20Group%20All%201%27s%20Together/README_EN.md) +- [1152. Analyze User Website Visit Pattern](/solution/1100-1199/1152.Analyze%20User%20Website%20Visit%20Pattern/README_EN.md) +- [1153. String Transforms Into Another String](/solution/1100-1199/1153.String%20Transforms%20Into%20Another%20String/README_EN.md) + + +#### Weekly Contest 149 + +- [1154. Day of the Year](/solution/1100-1199/1154.Day%20of%20the%20Year/README_EN.md) +- [1155. Number of Dice Rolls With Target Sum](/solution/1100-1199/1155.Number%20of%20Dice%20Rolls%20With%20Target%20Sum/README_EN.md) +- [1156. Swap For Longest Repeated Character Substring](/solution/1100-1199/1156.Swap%20For%20Longest%20Repeated%20Character%20Substring/README_EN.md) +- [1157. Online Majority Element In Subarray](/solution/1100-1199/1157.Online%20Majority%20Element%20In%20Subarray/README_EN.md) + + +#### Weekly Contest 148 + +- [1144. Decrease Elements To Make Array Zigzag](/solution/1100-1199/1144.Decrease%20Elements%20To%20Make%20Array%20Zigzag/README_EN.md) +- [1145. Binary Tree Coloring Game](/solution/1100-1199/1145.Binary%20Tree%20Coloring%20Game/README_EN.md) +- [1146. Snapshot Array](/solution/1100-1199/1146.Snapshot%20Array/README_EN.md) +- [1147. Longest Chunked Palindrome Decomposition](/solution/1100-1199/1147.Longest%20Chunked%20Palindrome%20Decomposition/README_EN.md) + + +#### Biweekly Contest 5 + +- [1133. Largest Unique Number](/solution/1100-1199/1133.Largest%20Unique%20Number/README_EN.md) +- [1134. Armstrong Number](/solution/1100-1199/1134.Armstrong%20Number/README_EN.md) +- [1135. Connecting Cities With Minimum Cost](/solution/1100-1199/1135.Connecting%20Cities%20With%20Minimum%20Cost/README_EN.md) +- [1136. Parallel Courses](/solution/1100-1199/1136.Parallel%20Courses/README_EN.md) + + +#### Weekly Contest 147 + +- [1137. N-th Tribonacci Number](/solution/1100-1199/1137.N-th%20Tribonacci%20Number/README_EN.md) +- [1138. Alphabet Board Path](/solution/1100-1199/1138.Alphabet%20Board%20Path/README_EN.md) +- [1139. Largest 1-Bordered Square](/solution/1100-1199/1139.Largest%201-Bordered%20Square/README_EN.md) +- [1140. Stone Game II](/solution/1100-1199/1140.Stone%20Game%20II/README_EN.md) + + +#### Weekly Contest 146 + +- [1128. Number of Equivalent Domino Pairs](/solution/1100-1199/1128.Number%20of%20Equivalent%20Domino%20Pairs/README_EN.md) +- [1129. Shortest Path with Alternating Colors](/solution/1100-1199/1129.Shortest%20Path%20with%20Alternating%20Colors/README_EN.md) +- [1130. Minimum Cost Tree From Leaf Values](/solution/1100-1199/1130.Minimum%20Cost%20Tree%20From%20Leaf%20Values/README_EN.md) +- [1131. Maximum of Absolute Value Expression](/solution/1100-1199/1131.Maximum%20of%20Absolute%20Value%20Expression/README_EN.md) + + +#### Biweekly Contest 4 + +- [1118. Number of Days in a Month](/solution/1100-1199/1118.Number%20of%20Days%20in%20a%20Month/README_EN.md) +- [1119. Remove Vowels from a String](/solution/1100-1199/1119.Remove%20Vowels%20from%20a%20String/README_EN.md) +- [1120. Maximum Average Subtree](/solution/1100-1199/1120.Maximum%20Average%20Subtree/README_EN.md) +- [1121. Divide Array Into Increasing Sequences](/solution/1100-1199/1121.Divide%20Array%20Into%20Increasing%20Sequences/README_EN.md) + + +#### Weekly Contest 145 + +- [1122. Relative Sort Array](/solution/1100-1199/1122.Relative%20Sort%20Array/README_EN.md) +- [1123. Lowest Common Ancestor of Deepest Leaves](/solution/1100-1199/1123.Lowest%20Common%20Ancestor%20of%20Deepest%20Leaves/README_EN.md) +- [1124. Longest Well-Performing Interval](/solution/1100-1199/1124.Longest%20Well-Performing%20Interval/README_EN.md) +- [1125. Smallest Sufficient Team](/solution/1100-1199/1125.Smallest%20Sufficient%20Team/README_EN.md) + + +#### Weekly Contest 144 + +- [1108. Defanging an IP Address](/solution/1100-1199/1108.Defanging%20an%20IP%20Address/README_EN.md) +- [1109. Corporate Flight Bookings](/solution/1100-1199/1109.Corporate%20Flight%20Bookings/README_EN.md) +- [1110. Delete Nodes And Return Forest](/solution/1100-1199/1110.Delete%20Nodes%20And%20Return%20Forest/README_EN.md) +- [1111. Maximum Nesting Depth of Two Valid Parentheses Strings](/solution/1100-1199/1111.Maximum%20Nesting%20Depth%20of%20Two%20Valid%20Parentheses%20Strings/README_EN.md) + + +#### Biweekly Contest 3 + +- [1099. Two Sum Less Than K](/solution/1000-1099/1099.Two%20Sum%20Less%20Than%20K/README_EN.md) +- [1100. Find K-Length Substrings With No Repeated Characters](/solution/1100-1199/1100.Find%20K-Length%20Substrings%20With%20No%20Repeated%20Characters/README_EN.md) +- [1101. The Earliest Moment When Everyone Become Friends](/solution/1100-1199/1101.The%20Earliest%20Moment%20When%20Everyone%20Become%20Friends/README_EN.md) +- [1102. Path With Maximum Minimum Value](/solution/1100-1199/1102.Path%20With%20Maximum%20Minimum%20Value/README_EN.md) + + +#### Weekly Contest 143 + +- [1103. Distribute Candies to People](/solution/1100-1199/1103.Distribute%20Candies%20to%20People/README_EN.md) +- [1104. Path In Zigzag Labelled Binary Tree](/solution/1100-1199/1104.Path%20In%20Zigzag%20Labelled%20Binary%20Tree/README_EN.md) +- [1105. Filling Bookcase Shelves](/solution/1100-1199/1105.Filling%20Bookcase%20Shelves/README_EN.md) +- [1106. Parsing A Boolean Expression](/solution/1100-1199/1106.Parsing%20A%20Boolean%20Expression/README_EN.md) + + +#### Weekly Contest 142 + +- [1093. Statistics from a Large Sample](/solution/1000-1099/1093.Statistics%20from%20a%20Large%20Sample/README_EN.md) +- [1094. Car Pooling](/solution/1000-1099/1094.Car%20Pooling/README_EN.md) +- [1095. Find in Mountain Array](/solution/1000-1099/1095.Find%20in%20Mountain%20Array/README_EN.md) +- [1096. Brace Expansion II](/solution/1000-1099/1096.Brace%20Expansion%20II/README_EN.md) + + +#### Biweekly Contest 2 + +- [1085. Sum of Digits in the Minimum Number](/solution/1000-1099/1085.Sum%20of%20Digits%20in%20the%20Minimum%20Number/README_EN.md) +- [1086. High Five](/solution/1000-1099/1086.High%20Five/README_EN.md) +- [1087. Brace Expansion](/solution/1000-1099/1087.Brace%20Expansion/README_EN.md) +- [1088. Confusing Number II](/solution/1000-1099/1088.Confusing%20Number%20II/README_EN.md) + + +#### Weekly Contest 141 + +- [1089. Duplicate Zeros](/solution/1000-1099/1089.Duplicate%20Zeros/README_EN.md) +- [1090. Largest Values From Labels](/solution/1000-1099/1090.Largest%20Values%20From%20Labels/README_EN.md) +- [1091. Shortest Path in Binary Matrix](/solution/1000-1099/1091.Shortest%20Path%20in%20Binary%20Matrix/README_EN.md) +- [1092. Shortest Common Supersequence](/solution/1000-1099/1092.Shortest%20Common%20Supersequence/README_EN.md) + + +#### Weekly Contest 140 + +- [1078. Occurrences After Bigram](/solution/1000-1099/1078.Occurrences%20After%20Bigram/README_EN.md) +- [1079. Letter Tile Possibilities](/solution/1000-1099/1079.Letter%20Tile%20Possibilities/README_EN.md) +- [1080. Insufficient Nodes in Root to Leaf Paths](/solution/1000-1099/1080.Insufficient%20Nodes%20in%20Root%20to%20Leaf%20Paths/README_EN.md) +- [1081. Smallest Subsequence of Distinct Characters](/solution/1000-1099/1081.Smallest%20Subsequence%20of%20Distinct%20Characters/README_EN.md) + + +#### Biweekly Contest 1 + +- [1064. Fixed Point](/solution/1000-1099/1064.Fixed%20Point/README_EN.md) +- [1065. Index Pairs of a String](/solution/1000-1099/1065.Index%20Pairs%20of%20a%20String/README_EN.md) +- [1066. Campus Bikes II](/solution/1000-1099/1066.Campus%20Bikes%20II/README_EN.md) +- [1067. Digit Count in Range](/solution/1000-1099/1067.Digit%20Count%20in%20Range/README_EN.md) + + +#### Weekly Contest 139 + +- [1071. Greatest Common Divisor of Strings](/solution/1000-1099/1071.Greatest%20Common%20Divisor%20of%20Strings/README_EN.md) +- [1072. Flip Columns For Maximum Number of Equal Rows](/solution/1000-1099/1072.Flip%20Columns%20For%20Maximum%20Number%20of%20Equal%20Rows/README_EN.md) +- [1073. Adding Two Negabinary Numbers](/solution/1000-1099/1073.Adding%20Two%20Negabinary%20Numbers/README_EN.md) +- [1074. Number of Submatrices That Sum to Target](/solution/1000-1099/1074.Number%20of%20Submatrices%20That%20Sum%20to%20Target/README_EN.md) + + +#### Weekly Contest 138 + +- [1051. Height Checker](/solution/1000-1099/1051.Height%20Checker/README_EN.md) +- [1052. Grumpy Bookstore Owner](/solution/1000-1099/1052.Grumpy%20Bookstore%20Owner/README_EN.md) +- [1053. Previous Permutation With One Swap](/solution/1000-1099/1053.Previous%20Permutation%20With%20One%20Swap/README_EN.md) +- [1054. Distant Barcodes](/solution/1000-1099/1054.Distant%20Barcodes/README_EN.md) + + +#### Weekly Contest 137 + +- [1046. Last Stone Weight](/solution/1000-1099/1046.Last%20Stone%20Weight/README_EN.md) +- [1047. Remove All Adjacent Duplicates In String](/solution/1000-1099/1047.Remove%20All%20Adjacent%20Duplicates%20In%20String/README_EN.md) +- [1048. Longest String Chain](/solution/1000-1099/1048.Longest%20String%20Chain/README_EN.md) +- [1049. Last Stone Weight II](/solution/1000-1099/1049.Last%20Stone%20Weight%20II/README_EN.md) + + +#### Weekly Contest 136 + +- [1041. Robot Bounded In Circle](/solution/1000-1099/1041.Robot%20Bounded%20In%20Circle/README_EN.md) +- [1042. Flower Planting With No Adjacent](/solution/1000-1099/1042.Flower%20Planting%20With%20No%20Adjacent/README_EN.md) +- [1043. Partition Array for Maximum Sum](/solution/1000-1099/1043.Partition%20Array%20for%20Maximum%20Sum/README_EN.md) +- [1044. Longest Duplicate Substring](/solution/1000-1099/1044.Longest%20Duplicate%20Substring/README_EN.md) + + +#### Weekly Contest 135 + +- [1037. Valid Boomerang](/solution/1000-1099/1037.Valid%20Boomerang/README_EN.md) +- [1038. Binary Search Tree to Greater Sum Tree](/solution/1000-1099/1038.Binary%20Search%20Tree%20to%20Greater%20Sum%20Tree/README_EN.md) +- [1039. Minimum Score Triangulation of Polygon](/solution/1000-1099/1039.Minimum%20Score%20Triangulation%20of%20Polygon/README_EN.md) +- [1040. Moving Stones Until Consecutive II](/solution/1000-1099/1040.Moving%20Stones%20Until%20Consecutive%20II/README_EN.md) + + +#### Weekly Contest 134 + +- [1033. Moving Stones Until Consecutive](/solution/1000-1099/1033.Moving%20Stones%20Until%20Consecutive/README_EN.md) +- [1034. Coloring A Border](/solution/1000-1099/1034.Coloring%20A%20Border/README_EN.md) +- [1035. Uncrossed Lines](/solution/1000-1099/1035.Uncrossed%20Lines/README_EN.md) +- [1036. Escape a Large Maze](/solution/1000-1099/1036.Escape%20a%20Large%20Maze/README_EN.md) + + +#### Weekly Contest 133 + +- [1029. Two City Scheduling](/solution/1000-1099/1029.Two%20City%20Scheduling/README_EN.md) +- [1030. Matrix Cells in Distance Order](/solution/1000-1099/1030.Matrix%20Cells%20in%20Distance%20Order/README_EN.md) +- [1031. Maximum Sum of Two Non-Overlapping Subarrays](/solution/1000-1099/1031.Maximum%20Sum%20of%20Two%20Non-Overlapping%20Subarrays/README_EN.md) +- [1032. Stream of Characters](/solution/1000-1099/1032.Stream%20of%20Characters/README_EN.md) + + +#### Weekly Contest 132 + +- [1025. Divisor Game](/solution/1000-1099/1025.Divisor%20Game/README_EN.md) +- [1026. Maximum Difference Between Node and Ancestor](/solution/1000-1099/1026.Maximum%20Difference%20Between%20Node%20and%20Ancestor/README_EN.md) +- [1027. Longest Arithmetic Subsequence](/solution/1000-1099/1027.Longest%20Arithmetic%20Subsequence/README_EN.md) +- [1028. Recover a Tree From Preorder Traversal](/solution/1000-1099/1028.Recover%20a%20Tree%20From%20Preorder%20Traversal/README_EN.md) + + +#### Weekly Contest 131 + +- [1021. Remove Outermost Parentheses](/solution/1000-1099/1021.Remove%20Outermost%20Parentheses/README_EN.md) +- [1022. Sum of Root To Leaf Binary Numbers](/solution/1000-1099/1022.Sum%20of%20Root%20To%20Leaf%20Binary%20Numbers/README_EN.md) +- [1023. Camelcase Matching](/solution/1000-1099/1023.Camelcase%20Matching/README_EN.md) +- [1024. Video Stitching](/solution/1000-1099/1024.Video%20Stitching/README_EN.md) + + +#### Weekly Contest 130 + +- [1018. Binary Prefix Divisible By 5](/solution/1000-1099/1018.Binary%20Prefix%20Divisible%20By%205/README_EN.md) +- [1017. Convert to Base -2](/solution/1000-1099/1017.Convert%20to%20Base%20-2/README_EN.md) +- [1019. Next Greater Node In Linked List](/solution/1000-1099/1019.Next%20Greater%20Node%20In%20Linked%20List/README_EN.md) +- [1020. Number of Enclaves](/solution/1000-1099/1020.Number%20of%20Enclaves/README_EN.md) + + +#### Weekly Contest 129 + +- [1013. Partition Array Into Three Parts With Equal Sum](/solution/1000-1099/1013.Partition%20Array%20Into%20Three%20Parts%20With%20Equal%20Sum/README_EN.md) +- [1015. Smallest Integer Divisible by K](/solution/1000-1099/1015.Smallest%20Integer%20Divisible%20by%20K/README_EN.md) +- [1014. Best Sightseeing Pair](/solution/1000-1099/1014.Best%20Sightseeing%20Pair/README_EN.md) +- [1016. Binary String With Substrings Representing 1 To N](/solution/1000-1099/1016.Binary%20String%20With%20Substrings%20Representing%201%20To%20N/README_EN.md) + + +#### Weekly Contest 128 + +- [1009. Complement of Base 10 Integer](/solution/1000-1099/1009.Complement%20of%20Base%2010%20Integer/README_EN.md) +- [1010. Pairs of Songs With Total Durations Divisible by 60](/solution/1000-1099/1010.Pairs%20of%20Songs%20With%20Total%20Durations%20Divisible%20by%2060/README_EN.md) +- [1011. Capacity To Ship Packages Within D Days](/solution/1000-1099/1011.Capacity%20To%20Ship%20Packages%20Within%20D%20Days/README_EN.md) +- [1012. Numbers With Repeated Digits](/solution/1000-1099/1012.Numbers%20With%20Repeated%20Digits/README_EN.md) + + +#### Weekly Contest 127 + +- [1005. Maximize Sum Of Array After K Negations](/solution/1000-1099/1005.Maximize%20Sum%20Of%20Array%20After%20K%20Negations/README_EN.md) +- [1006. Clumsy Factorial](/solution/1000-1099/1006.Clumsy%20Factorial/README_EN.md) +- [1007. Minimum Domino Rotations For Equal Row](/solution/1000-1099/1007.Minimum%20Domino%20Rotations%20For%20Equal%20Row/README_EN.md) +- [1008. Construct Binary Search Tree from Preorder Traversal](/solution/1000-1099/1008.Construct%20Binary%20Search%20Tree%20from%20Preorder%20Traversal/README_EN.md) + + +#### Weekly Contest 126 + +- [1002. Find Common Characters](/solution/1000-1099/1002.Find%20Common%20Characters/README_EN.md) +- [1003. Check If Word Is Valid After Substitutions](/solution/1000-1099/1003.Check%20If%20Word%20Is%20Valid%20After%20Substitutions/README_EN.md) +- [1004. Max Consecutive Ones III](/solution/1000-1099/1004.Max%20Consecutive%20Ones%20III/README_EN.md) +- [1000. Minimum Cost to Merge Stones](/solution/1000-1099/1000.Minimum%20Cost%20to%20Merge%20Stones/README_EN.md) + + +#### Weekly Contest 125 + +- [997. Find the Town Judge](/solution/0900-0999/0997.Find%20the%20Town%20Judge/README_EN.md) +- [999. Available Captures for Rook](/solution/0900-0999/0999.Available%20Captures%20for%20Rook/README_EN.md) +- [998. Maximum Binary Tree II](/solution/0900-0999/0998.Maximum%20Binary%20Tree%20II/README_EN.md) +- [1001. Grid Illumination](/solution/1000-1099/1001.Grid%20Illumination/README_EN.md) + + +#### Weekly Contest 124 + +- [993. Cousins in Binary Tree](/solution/0900-0999/0993.Cousins%20in%20Binary%20Tree/README_EN.md) +- [994. Rotting Oranges](/solution/0900-0999/0994.Rotting%20Oranges/README_EN.md) +- [995. Minimum Number of K Consecutive Bit Flips](/solution/0900-0999/0995.Minimum%20Number%20of%20K%20Consecutive%20Bit%20Flips/README_EN.md) +- [996. Number of Squareful Arrays](/solution/0900-0999/0996.Number%20of%20Squareful%20Arrays/README_EN.md) + + +#### Weekly Contest 123 + +- [989. Add to Array-Form of Integer](/solution/0900-0999/0989.Add%20to%20Array-Form%20of%20Integer/README_EN.md) +- [990. Satisfiability of Equality Equations](/solution/0900-0999/0990.Satisfiability%20of%20Equality%20Equations/README_EN.md) +- [991. Broken Calculator](/solution/0900-0999/0991.Broken%20Calculator/README_EN.md) +- [992. Subarrays with K Different Integers](/solution/0900-0999/0992.Subarrays%20with%20K%20Different%20Integers/README_EN.md) + + +#### Weekly Contest 122 + +- [985. Sum of Even Numbers After Queries](/solution/0900-0999/0985.Sum%20of%20Even%20Numbers%20After%20Queries/README_EN.md) +- [988. Smallest String Starting From Leaf](/solution/0900-0999/0988.Smallest%20String%20Starting%20From%20Leaf/README_EN.md) +- [986. Interval List Intersections](/solution/0900-0999/0986.Interval%20List%20Intersections/README_EN.md) +- [987. Vertical Order Traversal of a Binary Tree](/solution/0900-0999/0987.Vertical%20Order%20Traversal%20of%20a%20Binary%20Tree/README_EN.md) + + +#### Weekly Contest 121 + +- [984. String Without AAA or BBB](/solution/0900-0999/0984.String%20Without%20AAA%20or%20BBB/README_EN.md) +- [981. Time Based Key-Value Store](/solution/0900-0999/0981.Time%20Based%20Key-Value%20Store/README_EN.md) +- [983. Minimum Cost For Tickets](/solution/0900-0999/0983.Minimum%20Cost%20For%20Tickets/README_EN.md) +- [982. Triples with Bitwise AND Equal To Zero](/solution/0900-0999/0982.Triples%20with%20Bitwise%20AND%20Equal%20To%20Zero/README_EN.md) + + +#### Weekly Contest 120 + +- [977. Squares of a Sorted Array](/solution/0900-0999/0977.Squares%20of%20a%20Sorted%20Array/README_EN.md) +- [978. Longest Turbulent Subarray](/solution/0900-0999/0978.Longest%20Turbulent%20Subarray/README_EN.md) +- [979. Distribute Coins in Binary Tree](/solution/0900-0999/0979.Distribute%20Coins%20in%20Binary%20Tree/README_EN.md) +- [980. Unique Paths III](/solution/0900-0999/0980.Unique%20Paths%20III/README_EN.md) + + +#### Weekly Contest 119 + +- [973. K Closest Points to Origin](/solution/0900-0999/0973.K%20Closest%20Points%20to%20Origin/README_EN.md) +- [976. Largest Perimeter Triangle](/solution/0900-0999/0976.Largest%20Perimeter%20Triangle/README_EN.md) +- [974. Subarray Sums Divisible by K](/solution/0900-0999/0974.Subarray%20Sums%20Divisible%20by%20K/README_EN.md) +- [975. Odd Even Jump](/solution/0900-0999/0975.Odd%20Even%20Jump/README_EN.md) + + +#### Weekly Contest 118 + +- [970. Powerful Integers](/solution/0900-0999/0970.Powerful%20Integers/README_EN.md) +- [969. Pancake Sorting](/solution/0900-0999/0969.Pancake%20Sorting/README_EN.md) +- [971. Flip Binary Tree To Match Preorder Traversal](/solution/0900-0999/0971.Flip%20Binary%20Tree%20To%20Match%20Preorder%20Traversal/README_EN.md) +- [972. Equal Rational Numbers](/solution/0900-0999/0972.Equal%20Rational%20Numbers/README_EN.md) + + +#### Weekly Contest 117 + +- [965. Univalued Binary Tree](/solution/0900-0999/0965.Univalued%20Binary%20Tree/README_EN.md) +- [967. Numbers With Same Consecutive Differences](/solution/0900-0999/0967.Numbers%20With%20Same%20Consecutive%20Differences/README_EN.md) +- [966. Vowel Spellchecker](/solution/0900-0999/0966.Vowel%20Spellchecker/README_EN.md) +- [968. Binary Tree Cameras](/solution/0900-0999/0968.Binary%20Tree%20Cameras/README_EN.md) + + +#### Weekly Contest 116 + +- [961. N-Repeated Element in Size 2N Array](/solution/0900-0999/0961.N-Repeated%20Element%20in%20Size%202N%20Array/README_EN.md) +- [962. Maximum Width Ramp](/solution/0900-0999/0962.Maximum%20Width%20Ramp/README_EN.md) +- [963. Minimum Area Rectangle II](/solution/0900-0999/0963.Minimum%20Area%20Rectangle%20II/README_EN.md) +- [964. Least Operators to Express Number](/solution/0900-0999/0964.Least%20Operators%20to%20Express%20Number/README_EN.md) + + +#### Weekly Contest 115 + +- [957. Prison Cells After N Days](/solution/0900-0999/0957.Prison%20Cells%20After%20N%20Days/README_EN.md) +- [958. Check Completeness of a Binary Tree](/solution/0900-0999/0958.Check%20Completeness%20of%20a%20Binary%20Tree/README_EN.md) +- [959. Regions Cut By Slashes](/solution/0900-0999/0959.Regions%20Cut%20By%20Slashes/README_EN.md) +- [960. Delete Columns to Make Sorted III](/solution/0900-0999/0960.Delete%20Columns%20to%20Make%20Sorted%20III/README_EN.md) + + +#### Weekly Contest 114 + +- [953. Verifying an Alien Dictionary](/solution/0900-0999/0953.Verifying%20an%20Alien%20Dictionary/README_EN.md) +- [954. Array of Doubled Pairs](/solution/0900-0999/0954.Array%20of%20Doubled%20Pairs/README_EN.md) +- [955. Delete Columns to Make Sorted II](/solution/0900-0999/0955.Delete%20Columns%20to%20Make%20Sorted%20II/README_EN.md) +- [956. Tallest Billboard](/solution/0900-0999/0956.Tallest%20Billboard/README_EN.md) + + +#### Weekly Contest 113 + +- [949. Largest Time for Given Digits](/solution/0900-0999/0949.Largest%20Time%20for%20Given%20Digits/README_EN.md) +- [951. Flip Equivalent Binary Trees](/solution/0900-0999/0951.Flip%20Equivalent%20Binary%20Trees/README_EN.md) +- [950. Reveal Cards In Increasing Order](/solution/0900-0999/0950.Reveal%20Cards%20In%20Increasing%20Order/README_EN.md) +- [952. Largest Component Size by Common Factor](/solution/0900-0999/0952.Largest%20Component%20Size%20by%20Common%20Factor/README_EN.md) + + +#### Weekly Contest 112 + +- [945. Minimum Increment to Make Array Unique](/solution/0900-0999/0945.Minimum%20Increment%20to%20Make%20Array%20Unique/README_EN.md) +- [946. Validate Stack Sequences](/solution/0900-0999/0946.Validate%20Stack%20Sequences/README_EN.md) +- [947. Most Stones Removed with Same Row or Column](/solution/0900-0999/0947.Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column/README_EN.md) +- [948. Bag of Tokens](/solution/0900-0999/0948.Bag%20of%20Tokens/README_EN.md) + + +#### Weekly Contest 111 + +- [941. Valid Mountain Array](/solution/0900-0999/0941.Valid%20Mountain%20Array/README_EN.md) +- [944. Delete Columns to Make Sorted](/solution/0900-0999/0944.Delete%20Columns%20to%20Make%20Sorted/README_EN.md) +- [942. DI String Match](/solution/0900-0999/0942.DI%20String%20Match/README_EN.md) +- [943. Find the Shortest Superstring](/solution/0900-0999/0943.Find%20the%20Shortest%20Superstring/README_EN.md) + + +#### Weekly Contest 110 + +- [937. Reorder Data in Log Files](/solution/0900-0999/0937.Reorder%20Data%20in%20Log%20Files/README_EN.md) +- [938. Range Sum of BST](/solution/0900-0999/0938.Range%20Sum%20of%20BST/README_EN.md) +- [939. Minimum Area Rectangle](/solution/0900-0999/0939.Minimum%20Area%20Rectangle/README_EN.md) +- [940. Distinct Subsequences II](/solution/0900-0999/0940.Distinct%20Subsequences%20II/README_EN.md) + + +#### Weekly Contest 109 + +- [933. Number of Recent Calls](/solution/0900-0999/0933.Number%20of%20Recent%20Calls/README_EN.md) +- [935. Knight Dialer](/solution/0900-0999/0935.Knight%20Dialer/README_EN.md) +- [934. Shortest Bridge](/solution/0900-0999/0934.Shortest%20Bridge/README_EN.md) +- [936. Stamping The Sequence](/solution/0900-0999/0936.Stamping%20The%20Sequence/README_EN.md) + + +#### Weekly Contest 108 + +- [929. Unique Email Addresses](/solution/0900-0999/0929.Unique%20Email%20Addresses/README_EN.md) +- [930. Binary Subarrays With Sum](/solution/0900-0999/0930.Binary%20Subarrays%20With%20Sum/README_EN.md) +- [931. Minimum Falling Path Sum](/solution/0900-0999/0931.Minimum%20Falling%20Path%20Sum/README_EN.md) +- [932. Beautiful Array](/solution/0900-0999/0932.Beautiful%20Array/README_EN.md) + + +#### Weekly Contest 107 + +- [925. Long Pressed Name](/solution/0900-0999/0925.Long%20Pressed%20Name/README_EN.md) +- [926. Flip String to Monotone Increasing](/solution/0900-0999/0926.Flip%20String%20to%20Monotone%20Increasing/README_EN.md) +- [927. Three Equal Parts](/solution/0900-0999/0927.Three%20Equal%20Parts/README_EN.md) +- [928. Minimize Malware Spread II](/solution/0900-0999/0928.Minimize%20Malware%20Spread%20II/README_EN.md) + + +#### Weekly Contest 106 + +- [922. Sort Array By Parity II](/solution/0900-0999/0922.Sort%20Array%20By%20Parity%20II/README_EN.md) +- [921. Minimum Add to Make Parentheses Valid](/solution/0900-0999/0921.Minimum%20Add%20to%20Make%20Parentheses%20Valid/README_EN.md) +- [923. 3Sum With Multiplicity](/solution/0900-0999/0923.3Sum%20With%20Multiplicity/README_EN.md) +- [924. Minimize Malware Spread](/solution/0900-0999/0924.Minimize%20Malware%20Spread/README_EN.md) + + +#### Weekly Contest 105 + +- [917. Reverse Only Letters](/solution/0900-0999/0917.Reverse%20Only%20Letters/README_EN.md) +- [918. Maximum Sum Circular Subarray](/solution/0900-0999/0918.Maximum%20Sum%20Circular%20Subarray/README_EN.md) +- [919. Complete Binary Tree Inserter](/solution/0900-0999/0919.Complete%20Binary%20Tree%20Inserter/README_EN.md) +- [920. Number of Music Playlists](/solution/0900-0999/0920.Number%20of%20Music%20Playlists/README_EN.md) + + +#### Weekly Contest 104 + +- [914. X of a Kind in a Deck of Cards](/solution/0900-0999/0914.X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/README_EN.md) +- [915. Partition Array into Disjoint Intervals](/solution/0900-0999/0915.Partition%20Array%20into%20Disjoint%20Intervals/README_EN.md) +- [916. Word Subsets](/solution/0900-0999/0916.Word%20Subsets/README_EN.md) +- [913. Cat and Mouse](/solution/0900-0999/0913.Cat%20and%20Mouse/README_EN.md) + + +#### Weekly Contest 103 + +- [908. Smallest Range I](/solution/0900-0999/0908.Smallest%20Range%20I/README_EN.md) +- [909. Snakes and Ladders](/solution/0900-0999/0909.Snakes%20and%20Ladders/README_EN.md) +- [910. Smallest Range II](/solution/0900-0999/0910.Smallest%20Range%20II/README_EN.md) +- [911. Online Election](/solution/0900-0999/0911.Online%20Election/README_EN.md) + + +#### Weekly Contest 102 + +- [905. Sort Array By Parity](/solution/0900-0999/0905.Sort%20Array%20By%20Parity/README_EN.md) +- [904. Fruit Into Baskets](/solution/0900-0999/0904.Fruit%20Into%20Baskets/README_EN.md) +- [907. Sum of Subarray Minimums](/solution/0900-0999/0907.Sum%20of%20Subarray%20Minimums/README_EN.md) +- [906. Super Palindromes](/solution/0900-0999/0906.Super%20Palindromes/README_EN.md) + + +#### Weekly Contest 101 + +- [900. RLE Iterator](/solution/0900-0999/0900.RLE%20Iterator/README_EN.md) +- [901. Online Stock Span](/solution/0900-0999/0901.Online%20Stock%20Span/README_EN.md) +- [902. Numbers At Most N Given Digit Set](/solution/0900-0999/0902.Numbers%20At%20Most%20N%20Given%20Digit%20Set/README_EN.md) +- [903. Valid Permutations for DI Sequence](/solution/0900-0999/0903.Valid%20Permutations%20for%20DI%20Sequence/README_EN.md) + + +#### Weekly Contest 100 + +- [896. Monotonic Array](/solution/0800-0899/0896.Monotonic%20Array/README_EN.md) +- [897. Increasing Order Search Tree](/solution/0800-0899/0897.Increasing%20Order%20Search%20Tree/README_EN.md) +- [898. Bitwise ORs of Subarrays](/solution/0800-0899/0898.Bitwise%20ORs%20of%20Subarrays/README_EN.md) +- [899. Orderly Queue](/solution/0800-0899/0899.Orderly%20Queue/README_EN.md) + + +#### Weekly Contest 99 + +- [892. Surface Area of 3D Shapes](/solution/0800-0899/0892.Surface%20Area%20of%203D%20Shapes/README_EN.md) +- [893. Groups of Special-Equivalent Strings](/solution/0800-0899/0893.Groups%20of%20Special-Equivalent%20Strings/README_EN.md) +- [894. All Possible Full Binary Trees](/solution/0800-0899/0894.All%20Possible%20Full%20Binary%20Trees/README_EN.md) +- [895. Maximum Frequency Stack](/solution/0800-0899/0895.Maximum%20Frequency%20Stack/README_EN.md) + + +#### Weekly Contest 98 + +- [888. Fair Candy Swap](/solution/0800-0899/0888.Fair%20Candy%20Swap/README_EN.md) +- [890. Find and Replace Pattern](/solution/0800-0899/0890.Find%20and%20Replace%20Pattern/README_EN.md) +- [889. Construct Binary Tree from Preorder and Postorder Traversal](/solution/0800-0899/0889.Construct%20Binary%20Tree%20from%20Preorder%20and%20Postorder%20Traversal/README_EN.md) +- [891. Sum of Subsequence Widths](/solution/0800-0899/0891.Sum%20of%20Subsequence%20Widths/README_EN.md) + + +#### Weekly Contest 97 + +- [884. Uncommon Words from Two Sentences](/solution/0800-0899/0884.Uncommon%20Words%20from%20Two%20Sentences/README_EN.md) +- [885. Spiral Matrix III](/solution/0800-0899/0885.Spiral%20Matrix%20III/README_EN.md) +- [886. Possible Bipartition](/solution/0800-0899/0886.Possible%20Bipartition/README_EN.md) +- [887. Super Egg Drop](/solution/0800-0899/0887.Super%20Egg%20Drop/README_EN.md) + + +#### Weekly Contest 96 + +- [883. Projection Area of 3D Shapes](/solution/0800-0899/0883.Projection%20Area%20of%203D%20Shapes/README_EN.md) +- [881. Boats to Save People](/solution/0800-0899/0881.Boats%20to%20Save%20People/README_EN.md) +- [880. Decoded String at Index](/solution/0800-0899/0880.Decoded%20String%20at%20Index/README_EN.md) +- [882. Reachable Nodes In Subdivided Graph](/solution/0800-0899/0882.Reachable%20Nodes%20In%20Subdivided%20Graph/README_EN.md) + + +#### Weekly Contest 95 + +- [876. Middle of the Linked List](/solution/0800-0899/0876.Middle%20of%20the%20Linked%20List/README_EN.md) +- [877. Stone Game](/solution/0800-0899/0877.Stone%20Game/README_EN.md) +- [878. Nth Magical Number](/solution/0800-0899/0878.Nth%20Magical%20Number/README_EN.md) +- [879. Profitable Schemes](/solution/0800-0899/0879.Profitable%20Schemes/README_EN.md) + + +#### Weekly Contest 94 + +- [872. Leaf-Similar Trees](/solution/0800-0899/0872.Leaf-Similar%20Trees/README_EN.md) +- [874. Walking Robot Simulation](/solution/0800-0899/0874.Walking%20Robot%20Simulation/README_EN.md) +- [875. Koko Eating Bananas](/solution/0800-0899/0875.Koko%20Eating%20Bananas/README_EN.md) +- [873. Length of Longest Fibonacci Subsequence](/solution/0800-0899/0873.Length%20of%20Longest%20Fibonacci%20Subsequence/README_EN.md) + + +#### Weekly Contest 93 + +- [868. Binary Gap](/solution/0800-0899/0868.Binary%20Gap/README_EN.md) +- [869. Reordered Power of 2](/solution/0800-0899/0869.Reordered%20Power%20of%202/README_EN.md) +- [870. Advantage Shuffle](/solution/0800-0899/0870.Advantage%20Shuffle/README_EN.md) +- [871. Minimum Number of Refueling Stops](/solution/0800-0899/0871.Minimum%20Number%20of%20Refueling%20Stops/README_EN.md) + + +#### Weekly Contest 92 + +- [867. Transpose Matrix](/solution/0800-0899/0867.Transpose%20Matrix/README_EN.md) +- [865. Smallest Subtree with all the Deepest Nodes](/solution/0800-0899/0865.Smallest%20Subtree%20with%20all%20the%20Deepest%20Nodes/README_EN.md) +- [866. Prime Palindrome](/solution/0800-0899/0866.Prime%20Palindrome/README_EN.md) +- [864. Shortest Path to Get All Keys](/solution/0800-0899/0864.Shortest%20Path%20to%20Get%20All%20Keys/README_EN.md) + + +#### Weekly Contest 91 + +- [860. Lemonade Change](/solution/0800-0899/0860.Lemonade%20Change/README_EN.md) +- [863. All Nodes Distance K in Binary Tree](/solution/0800-0899/0863.All%20Nodes%20Distance%20K%20in%20Binary%20Tree/README_EN.md) +- [861. Score After Flipping Matrix](/solution/0800-0899/0861.Score%20After%20Flipping%20Matrix/README_EN.md) +- [862. Shortest Subarray with Sum at Least K](/solution/0800-0899/0862.Shortest%20Subarray%20with%20Sum%20at%20Least%20K/README_EN.md) + + +#### Weekly Contest 90 + +- [859. Buddy Strings](/solution/0800-0899/0859.Buddy%20Strings/README_EN.md) +- [856. Score of Parentheses](/solution/0800-0899/0856.Score%20of%20Parentheses/README_EN.md) +- [858. Mirror Reflection](/solution/0800-0899/0858.Mirror%20Reflection/README_EN.md) +- [857. Minimum Cost to Hire K Workers](/solution/0800-0899/0857.Minimum%20Cost%20to%20Hire%20K%20Workers/README_EN.md) + + +#### Weekly Contest 89 + +- [852. Peak Index in a Mountain Array](/solution/0800-0899/0852.Peak%20Index%20in%20a%20Mountain%20Array/README_EN.md) +- [853. Car Fleet](/solution/0800-0899/0853.Car%20Fleet/README_EN.md) +- [855. Exam Room](/solution/0800-0899/0855.Exam%20Room/README_EN.md) +- [854. K-Similar Strings](/solution/0800-0899/0854.K-Similar%20Strings/README_EN.md) + + +#### Weekly Contest 88 + +- [848. Shifting Letters](/solution/0800-0899/0848.Shifting%20Letters/README_EN.md) +- [849. Maximize Distance to Closest Person](/solution/0800-0899/0849.Maximize%20Distance%20to%20Closest%20Person/README_EN.md) +- [851. Loud and Rich](/solution/0800-0899/0851.Loud%20and%20Rich/README_EN.md) +- [850. Rectangle Area II](/solution/0800-0899/0850.Rectangle%20Area%20II/README_EN.md) + + +#### Weekly Contest 87 + +- [844. Backspace String Compare](/solution/0800-0899/0844.Backspace%20String%20Compare/README_EN.md) +- [845. Longest Mountain in Array](/solution/0800-0899/0845.Longest%20Mountain%20in%20Array/README_EN.md) +- [846. Hand of Straights](/solution/0800-0899/0846.Hand%20of%20Straights/README_EN.md) +- [847. Shortest Path Visiting All Nodes](/solution/0800-0899/0847.Shortest%20Path%20Visiting%20All%20Nodes/README_EN.md) + + +#### Weekly Contest 86 + +- [840. Magic Squares In Grid](/solution/0800-0899/0840.Magic%20Squares%20In%20Grid/README_EN.md) +- [841. Keys and Rooms](/solution/0800-0899/0841.Keys%20and%20Rooms/README_EN.md) +- [842. Split Array into Fibonacci Sequence](/solution/0800-0899/0842.Split%20Array%20into%20Fibonacci%20Sequence/README_EN.md) +- [843. Guess the Word](/solution/0800-0899/0843.Guess%20the%20Word/README_EN.md) + + +#### Weekly Contest 85 + +- [836. Rectangle Overlap](/solution/0800-0899/0836.Rectangle%20Overlap/README_EN.md) +- [838. Push Dominoes](/solution/0800-0899/0838.Push%20Dominoes/README_EN.md) +- [837. New 21 Game](/solution/0800-0899/0837.New%2021%20Game/README_EN.md) +- [839. Similar String Groups](/solution/0800-0899/0839.Similar%20String%20Groups/README_EN.md) + + +#### Weekly Contest 84 + +- [832. Flipping an Image](/solution/0800-0899/0832.Flipping%20an%20Image/README_EN.md) +- [833. Find And Replace in String](/solution/0800-0899/0833.Find%20And%20Replace%20in%20String/README_EN.md) +- [835. Image Overlap](/solution/0800-0899/0835.Image%20Overlap/README_EN.md) +- [834. Sum of Distances in Tree](/solution/0800-0899/0834.Sum%20of%20Distances%20in%20Tree/README_EN.md) + + +#### Weekly Contest 83 + +- [830. Positions of Large Groups](/solution/0800-0899/0830.Positions%20of%20Large%20Groups/README_EN.md) +- [831. Masking Personal Information](/solution/0800-0899/0831.Masking%20Personal%20Information/README_EN.md) +- [829. Consecutive Numbers Sum](/solution/0800-0899/0829.Consecutive%20Numbers%20Sum/README_EN.md) +- [828. Count Unique Characters of All Substrings of a Given String](/solution/0800-0899/0828.Count%20Unique%20Characters%20of%20All%20Substrings%20of%20a%20Given%20String/README_EN.md) diff --git a/solution/contest.py b/solution/contest.py index 8a619454e1..977e6a09bc 100644 --- a/solution/contest.py +++ b/solution/contest.py @@ -1,5 +1,6 @@ import json import time +from itertools import chain import requests @@ -11,6 +12,15 @@ biweekly_url = 'https://leetcode.cn/contest/api/info/biweekly-contest-{}/' questions = {} +def format_time(timestamp): + return time.strftime('%Y-%m-%d %H:%M', time.localtime(timestamp)) + + +def format_duration(seconds): + m = seconds // 60 + return f'{m} 分钟' + + def weekly(contest): url = weekly_url.format(contest) time.sleep(1) @@ -47,13 +57,17 @@ def handle(result: dict): questions[q['title_slug']] = { 'contest_title': result['title'], 'contest_title_en': result['title_en'], - 'contest_title_slug': result['contest']['title_slug'] + 'contest_title_slug': result['contest']['title_slug'], + 'contest_id': result['contest']['id'], + 'contest_start_time': result['contest']['origin_start_time'], + 'contest_duration': result['contest']['duration'] } def run(): weekly_res = [] biweekly_res = [] + contest_list = [] for i in weekly_range: res = weekly(i) if res and 'error' in res: @@ -64,10 +78,59 @@ def run(): if res and 'error' in res: break biweekly_res.append(res) - for v in weekly_res + biweekly_res: + for v in chain(weekly_res, biweekly_res): handle(v) + contest_list.append([ + v['contest']['id'], v['title'], v['title_en'], v['questions'], v['contest']['start_time'], + v['contest']['duration'] + ]) + + contest_list.sort(reverse=True) with open("contest.json", 'w', encoding='utf-8') as f: f.write(json.dumps(questions)) + with open('contest_list.json', 'w', encoding='utf-8') as f: + f.write(json.dumps(contest_list)) -run() +# ["id", "title", "title_en", "questions", "start_time", "duration"] + +def generate_contest_list(): + with open('./result.json', 'r', encoding='utf-8') as f: + result = json.loads(f.read()) + m = {item['question_title_slug']: item for item in result} + with open('contest_list.json', 'r', encoding='utf-8') as f: + contest_list = list(json.loads(f.read())) + + contest_readme_prefix = """# 力扣竞赛\n\n[English Version](/solution/CONTEST_README_EN.md)\n\n +## 赛后估分网站\n\nhttps://lcpredictor.herokuapp.com/\n\n## 往期竞赛\n\n""" + contest_readme_en_prefix = """# LeetCode Contest\n\n[中文文档](/solution/CONTEST_README.md)\n\n +## Rating Predictor\n +Get your rating changes right after the completion of LeetCode contests, https://lcpredictor.herokuapp.com/\n +## Past Contests\n\n""" + + items = [] + en_items = [] + + for cid, title, title_en, qs, start_time, duration in contest_list: + v = "#### " + title + f'({format_time(start_time) + ", " + format_duration(duration)})' + "\n\n" + v_en = "#### " + title_en + "\n\n" + for q in qs: + slug = q['title_slug'] + data = m.get(slug) + if data is None: + continue + v += f'- [{str(int(data["frontend_question_id"])) + ". " + data["title_cn"]}]({data["relative_path_cn"]})\n' + v_en += f'- [{str(int(data["frontend_question_id"])) + ". " + data["title_en"]}]({data["relative_path_en"]})\n' + if qs: + items.append(v) + en_items.append(v_en) + content_cn = contest_readme_prefix + "\n\n".join(items) + content_en = contest_readme_en_prefix + "\n\n".join(en_items) + with open("CONTEST_README.md", 'w', encoding='utf-8') as f: + f.write(content_cn) + with open("CONTEST_README_EN.md", 'w', encoding='utf-8') as f: + f.write(content_en) + + +# run() +generate_contest_list()