From bec5b85aee676a19786ff435406dd298469ad4e7 Mon Sep 17 00:00:00 2001 From: Huxulm Date: Mon, 26 Feb 2024 09:21:28 +0800 Subject: [PATCH] update --- public/contest.json | 2 +- public/qtags.json | 2 +- public/ratings.json | 2 +- public/solutions.json | 2 +- public/tags.json | 2 +- public/zenk.json | 2 +- 6 files changed, 6 insertions(+), 6 deletions(-) diff --git a/public/contest.json b/public/contest.json index 2a2a053..3c24a52 100755 --- a/public/contest.json +++ b/public/contest.json @@ -1 +1 @@ -[{"contest":{"id":994,"title":"第 385 场周赛","title_slug":"weekly-contest-385","start_time":1708223400,"is_ee_exam_contest":null},"questions":[{"question_id":3042,"title":"统计前后缀下标对 I","title_slug":"count-prefix-and-suffix-pairs-i","rating":0,"_hash":2560538129,"paid_only":false},{"question_id":3043,"title":"最长公共前缀的长度","title_slug":"find-the-length-of-the-longest-common-prefix","rating":0,"_hash":3836897087,"paid_only":false},{"question_id":3044,"title":"出现频率最高的质数","title_slug":"most-frequent-prime","rating":0,"_hash":1829348697,"paid_only":false},{"question_id":3045,"title":"统计前后缀下标对 II","title_slug":"count-prefix-and-suffix-pairs-ii","rating":0,"_hash":3118022376,"paid_only":false}],"company":{}},{"contest":{"id":991,"title":"第 124 场双周赛","title_slug":"biweekly-contest-124","start_time":1708180200,"is_ee_exam_contest":null},"questions":[{"question_id":3038,"title":"相同分数的最大操作数目 I","title_slug":"maximum-number-of-operations-with-the-same-score-i","rating":0,"_hash":787831673,"paid_only":false},{"question_id":3039,"title":"进行操作使字符串为空","title_slug":"apply-operations-to-make-string-empty","rating":0,"_hash":1356097871,"paid_only":false},{"question_id":3040,"title":"相同分数的最大操作数目 II","title_slug":"maximum-number-of-operations-with-the-same-score-ii","rating":0,"_hash":4231944752,"paid_only":false},{"question_id":3041,"title":"修改数组后最大化数组中的连续元素数目","title_slug":"maximize-consecutive-elements-in-an-array-after-modification","rating":0,"_hash":267105112,"paid_only":false}],"company":{}},{"contest":{"id":992,"title":"第 384 场周赛","title_slug":"weekly-contest-384","start_time":1707618600,"is_ee_exam_contest":null},"questions":[{"question_id":3033,"title":"修改矩阵","title_slug":"modify-the-matrix","rating":1180.5927490268,"_hash":545408597,"paid_only":false},{"question_id":3034,"title":"匹配模式数组的子数组数目 I","title_slug":"number-of-subarrays-that-match-a-pattern-i","rating":1383.775103528,"_hash":3386206172,"paid_only":false},{"question_id":3035,"title":"回文字符串的最大数量","title_slug":"maximum-palindromes-after-operations","rating":1856.6336926997,"_hash":2800289700,"paid_only":false},{"question_id":3036,"title":"匹配模式数组的子数组数目 II","title_slug":"number-of-subarrays-that-match-a-pattern-ii","rating":1894.5496928891,"_hash":1878147567,"paid_only":false}],"company":{}},{"contest":{"id":988,"title":"第 383 场周赛","title_slug":"weekly-contest-383","start_time":1707013800,"is_ee_exam_contest":null},"questions":[{"question_id":3028,"title":"边界上的蚂蚁","title_slug":"ant-on-the-boundary","rating":1115.8258444602,"_hash":3048586035,"paid_only":false},{"question_id":3029,"title":"将单词恢复初始状态所需的最短时间 I","title_slug":"minimum-time-to-revert-word-to-initial-state-i","rating":1659.6231386056,"_hash":2654590324,"paid_only":false},{"question_id":3030,"title":"找出网格的区域平均强度","title_slug":"find-the-grid-of-region-average","rating":1896.4053993495,"_hash":2583029056,"paid_only":false},{"question_id":3031,"title":"将单词恢复初始状态所需的最短时间 II","title_slug":"minimum-time-to-revert-word-to-initial-state-ii","rating":2277.9557248587,"_hash":839548071,"paid_only":false}],"company":{}},{"contest":{"id":985,"title":"第 123 场双周赛","title_slug":"biweekly-contest-123","start_time":1706970600,"is_ee_exam_contest":null},"questions":[{"question_id":3024,"title":"三角形类型","title_slug":"type-of-triangle","rating":1134.7862697576,"_hash":3778120928,"paid_only":false},{"question_id":3025,"title":"人员站位的方案数 I","title_slug":"find-the-number-of-ways-to-place-people-i","rating":1707.4309979043,"_hash":442815761,"paid_only":false},{"question_id":3026,"title":"最大好子数组和","title_slug":"maximum-good-subarray-sum","rating":1816.556997127,"_hash":1621119601,"paid_only":false},{"question_id":3027,"title":"人员站位的方案数 II","title_slug":"find-the-number-of-ways-to-place-people-ii","rating":2020.1846215023,"_hash":79432680,"paid_only":false}],"company":{}},{"contest":{"id":986,"title":"第 382 场周赛","title_slug":"weekly-contest-382","start_time":1706409000,"is_ee_exam_contest":null},"questions":[{"question_id":3019,"title":"按键变更的次数","title_slug":"number-of-changing-keys","rating":1175.5552151972,"_hash":3290623649,"paid_only":false},{"question_id":3020,"title":"子集中元素的最大数量","title_slug":"find-the-maximum-number-of-elements-in-subset","rating":1741.3694833067,"_hash":3880011182,"paid_only":false},{"question_id":3021,"title":"Alice 和 Bob 玩鲜花游戏","title_slug":"alice-and-bob-playing-flower-game","rating":1581.4162718925,"_hash":1094471227,"paid_only":false},{"question_id":3022,"title":"给定操作次数内使剩余元素的或值最小","title_slug":"minimize-or-of-remaining-elements-using-operations","rating":2917.8273567322,"_hash":3532176892,"paid_only":false}],"company":{}},{"contest":{"id":982,"title":"第 381 场周赛","title_slug":"weekly-contest-381","start_time":1705804200,"is_ee_exam_contest":null},"questions":[{"question_id":3014,"title":"输入单词需要的最少按键次数 I","title_slug":"minimum-number-of-pushes-to-type-word-i","rating":1324.2140587436,"_hash":3012401904,"paid_only":false},{"question_id":3015,"title":"按距离统计房屋对数目 I","title_slug":"count-the-number-of-houses-at-a-certain-distance-i","rating":1657.5344546445,"_hash":1097720535,"paid_only":false},{"question_id":3016,"title":"输入单词需要的最少按键次数 II","title_slug":"minimum-number-of-pushes-to-type-word-ii","rating":1533.5722750742,"_hash":1089101531,"paid_only":false},{"question_id":3017,"title":"按距离统计房屋对数目 II","title_slug":"count-the-number-of-houses-at-a-certain-distance-ii","rating":2709.4067070911,"_hash":3187405082,"paid_only":false}],"company":{}},{"contest":{"id":979,"title":"第 122 场双周赛","title_slug":"biweekly-contest-122","start_time":1705761000,"is_ee_exam_contest":null},"questions":[{"question_id":3010,"title":"将数组分成最小总代价的子数组 I","title_slug":"divide-an-array-into-subarrays-with-minimum-cost-i","rating":1291.744935731,"_hash":1471696394,"paid_only":false},{"question_id":3011,"title":"判断一个数组是否可以变为有序","title_slug":"find-if-array-can-be-sorted","rating":1496.6441112156,"_hash":1890921841,"paid_only":false},{"question_id":3012,"title":"通过操作使数组长度最小","title_slug":"minimize-length-of-array-using-operations","rating":1832.7167755024,"_hash":1466738944,"paid_only":false},{"question_id":3013,"title":"将数组分成最小总代价的子数组 II","title_slug":"divide-an-array-into-subarrays-with-minimum-cost-ii","rating":2540.438150736,"_hash":2049140185,"paid_only":false}],"company":{}},{"contest":{"id":980,"title":"第 380 场周赛","title_slug":"weekly-contest-380","start_time":1705199400,"is_ee_exam_contest":null},"questions":[{"question_id":3005,"title":"最大频率元素计数","title_slug":"count-elements-with-maximum-frequency","rating":1216.9550221615,"_hash":2937149161,"paid_only":false},{"question_id":3006,"title":"找出数组中的美丽下标 I","title_slug":"find-beautiful-indices-in-the-given-array-i","rating":1480.1120711991,"_hash":3437839264,"paid_only":false},{"question_id":3007,"title":"价值和小于等于 K 的最大数字","title_slug":"maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k","rating":2258.0069047781,"_hash":1708402068,"paid_only":false},{"question_id":3008,"title":"找出数组中的美丽下标 II","title_slug":"find-beautiful-indices-in-the-given-array-ii","rating":2016.2085876254,"_hash":1547023723,"paid_only":false}],"company":{}},{"contest":{"id":976,"title":"第 379 场周赛","title_slug":"weekly-contest-379","start_time":1704594600,"is_ee_exam_contest":null},"questions":[{"question_id":3000,"title":"对角线最长的矩形的面积","title_slug":"maximum-area-of-longest-diagonal-rectangle","rating":1249.7770522505,"_hash":1069078430,"paid_only":false},{"question_id":3001,"title":"捕获黑皇后需要的最少移动次数","title_slug":"minimum-moves-to-capture-the-queen","rating":1796.5392133092,"_hash":4169935304,"paid_only":false},{"question_id":3002,"title":"移除后集合的最多元素数","title_slug":"maximum-size-of-a-set-after-removals","rating":1917.4314822412,"_hash":3228686257,"paid_only":false},{"question_id":3003,"title":"执行操作后的最大分割数量","title_slug":"maximize-the-number-of-partitions-after-operations","rating":3039.3003256659,"_hash":834197249,"paid_only":false}],"company":{}},{"contest":{"id":973,"title":"第 121 场双周赛","title_slug":"biweekly-contest-121","start_time":1704551400,"is_ee_exam_contest":null},"questions":[{"question_id":2996,"title":"大于等于顺序前缀和的最小缺失整数","title_slug":"smallest-missing-integer-greater-than-sequential-prefix-sum","rating":1405.7482709086,"_hash":2694109670,"paid_only":false},{"question_id":2997,"title":"使数组异或和等于 K 的最少操作次数","title_slug":"minimum-number-of-operations-to-make-array-xor-equal-to-k","rating":1524.5856276651,"_hash":1320293684,"paid_only":false},{"question_id":2998,"title":"使 X 和 Y 相等的最少操作次数","title_slug":"minimum-number-of-operations-to-make-x-and-y-equal","rating":1794.6129370985,"_hash":3024031273,"paid_only":false},{"question_id":2999,"title":"统计强大整数的数目","title_slug":"count-the-number-of-powerful-integers","rating":2351.2293628792,"_hash":677909483,"paid_only":false}],"company":{}},{"contest":{"id":974,"title":"第 378 场周赛","title_slug":"weekly-contest-378","start_time":1703989800,"is_ee_exam_contest":null},"questions":[{"question_id":2980,"title":"检查按位或是否存在尾随零","title_slug":"check-if-bitwise-or-has-trailing-zeros","rating":1233.5034839998,"_hash":2184297331,"paid_only":false},{"question_id":2981,"title":"找出出现至少三次的最长特殊子字符串 I","title_slug":"find-longest-special-substring-that-occurs-thrice-i","rating":1505.3120825678,"_hash":1645223251,"paid_only":false},{"question_id":2982,"title":"找出出现至少三次的最长特殊子字符串 II","title_slug":"find-longest-special-substring-that-occurs-thrice-ii","rating":1772.9528456848,"_hash":2573075022,"paid_only":false},{"question_id":2983,"title":"回文串重新排列查询","title_slug":"palindrome-rearrangement-queries","rating":2779.7855167601,"_hash":4244339093,"paid_only":false}],"company":{}},{"contest":{"id":970,"title":"第 377 场周赛","title_slug":"weekly-contest-377","start_time":1703385000,"is_ee_exam_contest":null},"questions":[{"question_id":2974,"title":"最小数字游戏","title_slug":"minimum-number-game","rating":1184.8359383057,"_hash":760662992,"paid_only":false},{"question_id":2975,"title":"移除栅栏得到的正方形田地的最大面积","title_slug":"maximum-square-area-by-removing-fences-from-a-field","rating":1873.0424923433,"_hash":3065742618,"paid_only":false},{"question_id":2976,"title":"转换字符串的最小成本 I","title_slug":"minimum-cost-to-convert-string-i","rating":1882.0842446557,"_hash":2860849459,"paid_only":false},{"question_id":2977,"title":"转换字符串的最小成本 II","title_slug":"minimum-cost-to-convert-string-ii","rating":2695.809667046,"_hash":3381061806,"paid_only":false}],"company":{}},{"contest":{"id":967,"title":"第 120 场双周赛","title_slug":"biweekly-contest-120","start_time":1703341800,"is_ee_exam_contest":null},"questions":[{"question_id":2970,"title":"统计移除递增子数组的数目 I","title_slug":"count-the-number-of-incremovable-subarrays-i","rating":1563.2283814548,"_hash":1816814719,"paid_only":false},{"question_id":2971,"title":"找到最大周长的多边形","title_slug":"find-polygon-with-the-largest-perimeter","rating":1521.1616133347,"_hash":2510517613,"paid_only":false},{"question_id":2972,"title":"统计移除递增子数组的数目 II","title_slug":"count-the-number-of-incremovable-subarrays-ii","rating":2152.8032001597,"_hash":2400947874,"paid_only":false},{"question_id":2973,"title":"树中每个节点放置的金币数目","title_slug":"find-number-of-coins-to-place-in-tree-nodes","rating":2276.9256951751,"_hash":3730047096,"paid_only":false}],"company":{}},{"contest":{"id":968,"title":"第 376 场周赛","title_slug":"weekly-contest-376","start_time":1702780200,"is_ee_exam_contest":null},"questions":[{"question_id":2965,"title":"找出缺失和重复的数字","title_slug":"find-missing-and-repeated-values","rating":1244.8064626533,"_hash":2875235685,"paid_only":false},{"question_id":2966,"title":"划分数组并满足最大差限制","title_slug":"divide-array-into-arrays-with-max-difference","rating":1395.9639246414,"_hash":2398941022,"paid_only":false},{"question_id":2967,"title":"使数组成为等数数组的最小代价","title_slug":"minimum-cost-to-make-array-equalindromic","rating":2116.3244842355,"_hash":3256507952,"paid_only":false},{"question_id":2968,"title":"执行操作使频率分数最大","title_slug":"apply-operations-to-maximize-frequency-score","rating":2444.2791027022,"_hash":1059279895,"paid_only":false}],"company":{}},{"contest":{"id":964,"title":"第 375 场周赛","title_slug":"weekly-contest-375","start_time":1702175400,"is_ee_exam_contest":null},"questions":[{"question_id":2960,"title":"统计已测试设备","title_slug":"count-tested-devices-after-test-operations","rating":1169.4209117977,"_hash":2595697191,"paid_only":false},{"question_id":2961,"title":"双模幂运算","title_slug":"double-modular-exponentiation","rating":1450.6986543984,"_hash":1122946813,"paid_only":false},{"question_id":2962,"title":"统计最大元素出现至少 K 次的子数组","title_slug":"count-subarrays-where-max-element-appears-at-least-k-times","rating":1700.8505554268,"_hash":1658221095,"paid_only":false},{"question_id":2963,"title":"统计好分割方案的数目","title_slug":"count-the-number-of-good-partitions","rating":1984.9685663849,"_hash":3740959852,"paid_only":false}],"company":{}},{"contest":{"id":961,"title":"第 119 场双周赛","title_slug":"biweekly-contest-119","start_time":1702132200,"is_ee_exam_contest":null},"questions":[{"question_id":2956,"title":"找到两个数组中的公共元素","title_slug":"find-common-elements-between-two-arrays","rating":1214.542864891,"_hash":1894806233,"paid_only":false},{"question_id":2957,"title":"消除相邻近似相等字符","title_slug":"remove-adjacent-almost-equal-characters","rating":1429.9599761889,"_hash":2774491833,"paid_only":false},{"question_id":2958,"title":"最多 K 个重复元素的最长子数组","title_slug":"length-of-longest-subarray-with-at-most-k-frequency","rating":1535.3680469616,"_hash":614687136,"paid_only":false},{"question_id":2959,"title":"关闭分部的可行集合数目","title_slug":"number-of-possible-sets-of-closing-branches","rating":2077.4738459704,"_hash":796165027,"paid_only":false}],"company":{}},{"contest":{"id":962,"title":"第 374 场周赛","title_slug":"weekly-contest-374","start_time":1701570600,"is_ee_exam_contest":null},"questions":[{"question_id":2951,"title":"找出峰值","title_slug":"find-the-peaks","rating":1189.4358388136,"_hash":518714509,"paid_only":false},{"question_id":2952,"title":"需要添加的硬币的最小数量","title_slug":"minimum-number-of-coins-to-be-added","rating":1784.3506628869,"_hash":1965849899,"paid_only":false},{"question_id":2953,"title":"统计完全子字符串","title_slug":"count-complete-substrings","rating":2449.3352959316,"_hash":3462463455,"paid_only":false},{"question_id":2954,"title":"统计感冒序列的数目","title_slug":"count-the-number-of-infection-sequences","rating":2644.8498152558,"_hash":3519471521,"paid_only":false}],"company":{}},{"contest":{"id":958,"title":"第 373 场周赛","title_slug":"weekly-contest-373","start_time":1700965800,"is_ee_exam_contest":null},"questions":[{"question_id":2946,"title":"循环移位后的矩阵相似检查","title_slug":"matrix-similarity-after-cyclic-shifts","rating":1405.8442434352,"_hash":2937224937,"paid_only":false},{"question_id":2947,"title":"统计美丽子字符串 I","title_slug":"count-beautiful-substrings-i","rating":1450.8514438667,"_hash":1299365979,"paid_only":false},{"question_id":2948,"title":"交换得到字典序最小的数组","title_slug":"make-lexicographically-smallest-array-by-swapping-elements","rating":2047.3919190727,"_hash":4034022024,"paid_only":false},{"question_id":2949,"title":"统计美丽子字符串 II","title_slug":"count-beautiful-substrings-ii","rating":2444.7192647604,"_hash":497323702,"paid_only":false}],"company":{}},{"contest":{"id":955,"title":"第 118 场双周赛","title_slug":"biweekly-contest-118","start_time":1700922600,"is_ee_exam_contest":null},"questions":[{"question_id":2942,"title":"查找包含给定字符的单词","title_slug":"find-words-containing-character","rating":1182.2102562446,"_hash":3830794143,"paid_only":false},{"question_id":2943,"title":"最大化网格图中正方形空洞的面积","title_slug":"maximize-area-of-square-hole-in-grid","rating":1677.4559378473,"_hash":967980473,"paid_only":false},{"question_id":2944,"title":"购买水果需要的最少金币数","title_slug":"minimum-number-of-coins-for-fruits","rating":1708.9663754668,"_hash":1140950686,"paid_only":false},{"question_id":2945,"title":"找到最大非递减数组的长度","title_slug":"find-maximum-non-decreasing-array-length","rating":2943.2173551759,"_hash":1539515792,"paid_only":false}],"company":{}},{"contest":{"id":956,"title":"第 372 场周赛","title_slug":"weekly-contest-372","start_time":1700361000,"is_ee_exam_contest":null},"questions":[{"question_id":2937,"title":"使三个字符串相等","title_slug":"make-three-strings-equal","rating":1347.5885281778,"_hash":2629528696,"paid_only":false},{"question_id":2938,"title":"区分黑球与白球","title_slug":"separate-black-and-white-balls","rating":1422.7125559974,"_hash":1063658457,"paid_only":false},{"question_id":2939,"title":"最大异或乘积","title_slug":"maximum-xor-product","rating":2127.5100545681,"_hash":173367747,"paid_only":false},{"question_id":2940,"title":"找到 Alice 和 Bob 可以相遇的建筑","title_slug":"find-building-where-alice-and-bob-can-meet","rating":2327.4743300299,"_hash":2297518953,"paid_only":false}],"company":{}},{"contest":{"id":952,"title":"第 371 场周赛","title_slug":"weekly-contest-371","start_time":1699756200,"is_ee_exam_contest":null},"questions":[{"question_id":2932,"title":"找出强数对的最大异或值 I","title_slug":"maximum-strong-pair-xor-i","rating":1246.3593898992,"_hash":3074518984,"paid_only":false},{"question_id":2933,"title":"高访问员工","title_slug":"high-access-employees","rating":1536.5893223179,"_hash":3211790430,"paid_only":false},{"question_id":2934,"title":"最大化数组末位元素的最少操作次数","title_slug":"minimum-operations-to-maximize-last-elements-in-arrays","rating":1802.7875657754,"_hash":3398027261,"paid_only":false},{"question_id":2935,"title":"找出强数对的最大异或值 II","title_slug":"maximum-strong-pair-xor-ii","rating":2348.7273357105,"_hash":486718067,"paid_only":false}],"company":{}},{"contest":{"id":949,"title":"第 117 场双周赛","title_slug":"biweekly-contest-117","start_time":1699713000,"is_ee_exam_contest":null},"questions":[{"question_id":2928,"title":"给小朋友们分糖果 I","title_slug":"distribute-candies-among-children-i","rating":1393.3604603199,"_hash":4137220667,"paid_only":false},{"question_id":2929,"title":"给小朋友们分糖果 II","title_slug":"distribute-candies-among-children-ii","rating":1701.4341867571,"_hash":2228358934,"paid_only":false},{"question_id":2930,"title":"重新排列后包含指定子字符串的字符串数目","title_slug":"number-of-strings-which-can-be-rearranged-to-contain-substring","rating":2227.3896051956,"_hash":3536253643,"paid_only":false},{"question_id":2931,"title":"购买物品的最大开销","title_slug":"maximum-spending-after-buying-items","rating":1822.3170524016,"_hash":268471907,"paid_only":false}],"company":{}},{"contest":{"id":950,"title":"第 370 场周赛","title_slug":"weekly-contest-370","start_time":1699151400,"is_ee_exam_contest":null},"questions":[{"question_id":2923,"title":"找到冠军 I","title_slug":"find-champion-i","rating":1235.6484230513,"_hash":3876397144,"paid_only":false},{"question_id":2924,"title":"找到冠军 II","title_slug":"find-champion-ii","rating":1430.3094955812,"_hash":3936988451,"paid_only":false},{"question_id":2925,"title":"在树上执行操作以后得到的最大分数","title_slug":"maximum-score-after-applying-operations-on-a-tree","rating":1939.560165526,"_hash":750309798,"paid_only":false},{"question_id":2926,"title":"平衡子序列的最大和","title_slug":"maximum-balanced-subsequence-sum","rating":2448.4455464535,"_hash":2375501212,"paid_only":false}],"company":{}},{"contest":{"id":945,"title":"第 369 场周赛","title_slug":"weekly-contest-369","start_time":1698546600,"is_ee_exam_contest":null},"questions":[{"question_id":2917,"title":"找出数组中的 K-or 值","title_slug":"find-the-k-or-of-an-array","rating":1388.5363323598,"_hash":894912724,"paid_only":false},{"question_id":2918,"title":"数组的最小相等和","title_slug":"minimum-equal-sum-of-two-arrays-after-replacing-zeros","rating":1526.2429110307,"_hash":2619603225,"paid_only":false},{"question_id":2919,"title":"使数组变美的最小增量运算数","title_slug":"minimum-increment-operations-to-make-array-beautiful","rating":2030.922770301,"_hash":1420249701,"paid_only":false},{"question_id":2920,"title":"收集所有金币可获得的最大积分","title_slug":"maximum-points-after-collecting-coins-from-all-nodes","rating":2350.7421492104,"_hash":1381994519,"paid_only":false}],"company":{}},{"contest":{"id":941,"title":"第 116 场双周赛","title_slug":"biweekly-contest-116","start_time":1698503400,"is_ee_exam_contest":null},"questions":[{"question_id":2913,"title":"子数组不同元素数目的平方和 I","title_slug":"subarrays-distinct-element-sum-of-squares-i","rating":1297.4179875409,"_hash":87115414,"paid_only":false},{"question_id":2914,"title":"使二进制字符串变美丽的最少修改次数","title_slug":"minimum-number-of-changes-to-make-binary-string-beautiful","rating":1479.6908339113,"_hash":1033555490,"paid_only":false},{"question_id":2915,"title":"和为目标值的最长子序列的长度","title_slug":"length-of-the-longest-subsequence-that-sums-to-target","rating":1658.8190087768,"_hash":1032257843,"paid_only":false},{"question_id":2916,"title":"子数组不同元素数目的平方和 II","title_slug":"subarrays-distinct-element-sum-of-squares-ii","rating":2816.0706257586,"_hash":731038573,"paid_only":false}],"company":{}},{"contest":{"id":942,"title":"第 368 场周赛","title_slug":"weekly-contest-368","start_time":1697941800,"is_ee_exam_contest":null},"questions":[{"question_id":2908,"title":"元素和最小的山形三元组 I","title_slug":"minimum-sum-of-mountain-triplets-i","rating":1253.5161450678,"_hash":1377831845,"paid_only":false},{"question_id":2909,"title":"元素和最小的山形三元组 II","title_slug":"minimum-sum-of-mountain-triplets-ii","rating":1478.8676835951,"_hash":343052836,"paid_only":false},{"question_id":2910,"title":"合法分组的最少组数","title_slug":"minimum-number-of-groups-to-create-a-valid-assignment","rating":2132.1944636902,"_hash":1620549524,"paid_only":false},{"question_id":2911,"title":"得到 K 个半回文串的最少修改次数","title_slug":"minimum-changes-to-make-k-semi-palindromes","rating":2607.9418744903,"_hash":2481240580,"paid_only":false}],"company":{}},{"contest":{"id":938,"title":"第 367 场周赛","title_slug":"weekly-contest-367","start_time":1697337000,"is_ee_exam_contest":null},"questions":[{"question_id":2903,"title":"找出满足差值条件的下标 I","title_slug":"find-indices-with-index-and-value-difference-i","rating":1157.6407631819,"_hash":1982730574,"paid_only":false},{"question_id":2904,"title":"最短且字典序最小的美丽子字符串","title_slug":"shortest-and-lexicographically-smallest-beautiful-string","rating":1483.3041242255,"_hash":2613979956,"paid_only":false},{"question_id":2905,"title":"找出满足差值条件的下标 II","title_slug":"find-indices-with-index-and-value-difference-ii","rating":1763.787679959,"_hash":830799973,"paid_only":false},{"question_id":2906,"title":"构造乘积矩阵","title_slug":"construct-product-matrix","rating":2074.8331146269,"_hash":4290150798,"paid_only":false}],"company":{}},{"contest":{"id":935,"title":"第 115 场双周赛","title_slug":"biweekly-contest-115","start_time":1697293800,"is_ee_exam_contest":null},"questions":[{"question_id":2899,"title":"上一个遍历的整数","title_slug":"last-visited-integers","rating":1372.4759842416,"_hash":3735818622,"paid_only":false},{"question_id":2900,"title":"最长相邻不相等子序列 I","title_slug":"longest-unequal-adjacent-groups-subsequence-i","rating":1468.8739273624,"_hash":3312226061,"paid_only":false},{"question_id":2901,"title":"最长相邻不相等子序列 II","title_slug":"longest-unequal-adjacent-groups-subsequence-ii","rating":1898.8339532179,"_hash":770030188,"paid_only":false},{"question_id":2902,"title":"和带限制的子多重集合的数目","title_slug":"count-of-sub-multisets-with-bounded-sum","rating":2758.9704056427,"_hash":2720318685,"paid_only":false}],"company":{}},{"contest":{"id":936,"title":"第 366 场周赛","title_slug":"weekly-contest-366","start_time":1696732200,"is_ee_exam_contest":null},"questions":[{"question_id":2894,"title":"分类求和并作差","title_slug":"divisible-and-non-divisible-sums-difference","rating":1140.0534541481,"_hash":1782593021,"paid_only":false},{"question_id":2895,"title":"最小处理时间","title_slug":"minimum-processing-time","rating":1351.6909336495,"_hash":2835500769,"paid_only":false},{"question_id":2896,"title":"执行操作使两个字符串相等","title_slug":"apply-operations-to-make-two-strings-equal","rating":2172.3890687963,"_hash":1915472102,"paid_only":false},{"question_id":2897,"title":"对数组执行操作使平方和最大","title_slug":"apply-operations-on-array-to-maximize-sum-of-squares","rating":2301.4069974024,"_hash":1644032538,"paid_only":false}],"company":{}},{"contest":{"id":932,"title":"第 365 场周赛","title_slug":"weekly-contest-365","start_time":1696127400,"is_ee_exam_contest":null},"questions":[{"question_id":2873,"title":"有序三元组中的最大值 I","title_slug":"maximum-value-of-an-ordered-triplet-i","rating":1270.0775640451,"_hash":2386809488,"paid_only":false},{"question_id":2874,"title":"有序三元组中的最大值 II","title_slug":"maximum-value-of-an-ordered-triplet-ii","rating":1583.212966224,"_hash":3989118459,"paid_only":false},{"question_id":2875,"title":"无限数组的最短子数组","title_slug":"minimum-size-subarray-in-infinite-array","rating":1913.930869473,"_hash":3124896474,"paid_only":false},{"question_id":2876,"title":"有向图访问计数","title_slug":"count-visited-nodes-in-a-directed-graph","rating":2209.8785430371,"_hash":385203255,"paid_only":false}],"company":{}},{"contest":{"id":929,"title":"第 114 场双周赛","title_slug":"biweekly-contest-114","start_time":1696084200,"is_ee_exam_contest":null},"questions":[{"question_id":2869,"title":"收集元素的最少操作次数","title_slug":"minimum-operations-to-collect-elements","rating":1272.3340330895,"_hash":615729621,"paid_only":false},{"question_id":2870,"title":"使数组为空的最少操作次数","title_slug":"minimum-number-of-operations-to-make-array-empty","rating":1392.3629194433,"_hash":2657502607,"paid_only":false},{"question_id":2871,"title":"将数组分割成最多数目的子数组","title_slug":"split-array-into-maximum-number-of-subarrays","rating":1749.5115037045,"_hash":1204439806,"paid_only":false},{"question_id":2872,"title":"可以被 K 整除连通块的最大数目","title_slug":"maximum-number-of-k-divisible-components","rating":1967.5589835406,"_hash":1584359446,"paid_only":false}],"company":{}},{"contest":{"id":930,"title":"第 364 场周赛","title_slug":"weekly-contest-364","start_time":1695522600,"is_ee_exam_contest":null},"questions":[{"question_id":2864,"title":"最大二进制奇数","title_slug":"maximum-odd-binary-number","rating":1237.693464609,"_hash":3521652117,"paid_only":false},{"question_id":2865,"title":"美丽塔 I","title_slug":"beautiful-towers-i","rating":1519.2070276362,"_hash":19753391,"paid_only":false},{"question_id":2866,"title":"美丽塔 II","title_slug":"beautiful-towers-ii","rating":2071.6322841217,"_hash":2692580018,"paid_only":false},{"question_id":2867,"title":"统计树中的合法路径数目","title_slug":"count-valid-paths-in-a-tree","rating":2428.3242593838,"_hash":3532863467,"paid_only":false}],"company":{}},{"contest":{"id":926,"title":"第 363 场周赛","title_slug":"weekly-contest-363","start_time":1694917800,"is_ee_exam_contest":null},"questions":[{"question_id":2859,"title":"计算 K 置位下标对应元素的和","title_slug":"sum-of-values-at-indices-with-k-set-bits","rating":1218.1083231462,"_hash":787489678,"paid_only":false},{"question_id":2860,"title":"让所有学生保持开心的分组方法数","title_slug":"happy-students","rating":1625.7172632295,"_hash":3713605524,"paid_only":false},{"question_id":2861,"title":"最大合金数","title_slug":"maximum-number-of-alloys","rating":1981.3072959787,"_hash":1197966112,"paid_only":false},{"question_id":2862,"title":"完全子集的最大元素和","title_slug":"maximum-element-sum-of-a-complete-subset-of-indices","rating":2291.6794536377,"_hash":1459395051,"paid_only":false}],"company":{}},{"contest":{"id":923,"title":"第 113 场双周赛","title_slug":"biweekly-contest-113","start_time":1694874600,"is_ee_exam_contest":null},"questions":[{"question_id":2855,"title":"使数组成为递增数组的最少右移次数","title_slug":"minimum-right-shifts-to-sort-the-array","rating":1379.3426970242,"_hash":3501115477,"paid_only":false},{"question_id":2856,"title":"删除数对后的最小数组长度","title_slug":"minimum-array-length-after-pair-removals","rating":1749.9743684275,"_hash":1304985926,"paid_only":false},{"question_id":2857,"title":"统计距离为 k 的点对","title_slug":"count-pairs-of-points-with-distance-k","rating":2081.698529877,"_hash":1047256075,"paid_only":false},{"question_id":2858,"title":"可以到达每一个节点的最少边反转次数","title_slug":"minimum-edge-reversals-so-every-node-is-reachable","rating":2294.8289305714,"_hash":2851269000,"paid_only":false}],"company":{}},{"contest":{"id":924,"title":"第 362 场周赛","title_slug":"weekly-contest-362","start_time":1694313000,"is_ee_exam_contest":null},"questions":[{"question_id":2848,"title":"与车相交的点","title_slug":"points-that-intersect-with-cars","rating":1229.7575626899,"_hash":1241705093,"paid_only":false},{"question_id":2849,"title":"判断能否在给定时间到达单元格","title_slug":"determine-if-a-cell-is-reachable-at-a-given-time","rating":1515.1162664342,"_hash":3371445858,"paid_only":false},{"question_id":2850,"title":"将石头分散到网格图的最少移动次数","title_slug":"minimum-moves-to-spread-stones-over-grid","rating":2001.4515854273,"_hash":3939185799,"paid_only":false},{"question_id":2851,"title":"字符串转换","title_slug":"string-transformation","rating":2857.6543956169,"_hash":2130827066,"paid_only":false}],"company":{}},{"contest":{"id":920,"title":"第 361 场周赛","title_slug":"weekly-contest-361","start_time":1693708200,"is_ee_exam_contest":null},"questions":[{"question_id":2843,"title":"统计对称整数的数目","title_slug":"count-symmetric-integers","rating":1269.8118442786,"_hash":2681170798,"paid_only":false},{"question_id":2844,"title":"生成特殊数字的最少操作","title_slug":"minimum-operations-to-make-a-special-number","rating":1588.4826339516,"_hash":492673087,"paid_only":false},{"question_id":2845,"title":"统计趣味子数组的数目","title_slug":"count-of-interesting-subarrays","rating":2073.048019317,"_hash":3334241084,"paid_only":false},{"question_id":2846,"title":"边权重均等查询","title_slug":"minimum-edge-weight-equilibrium-queries-in-a-tree","rating":2507.9960044659,"_hash":2672352527,"paid_only":false}],"company":{}},{"contest":{"id":917,"title":"第 112 场双周赛","title_slug":"biweekly-contest-112","start_time":1693665000,"is_ee_exam_contest":null},"questions":[{"question_id":2839,"title":"判断通过操作能否让字符串相等 I","title_slug":"check-if-strings-can-be-made-equal-with-operations-i","rating":1285.1547123119,"_hash":1303459038,"paid_only":false},{"question_id":2840,"title":"判断通过操作能否让字符串相等 II","title_slug":"check-if-strings-can-be-made-equal-with-operations-ii","rating":1486.2147876747,"_hash":83229717,"paid_only":false},{"question_id":2841,"title":"几乎唯一子数组的最大和","title_slug":"maximum-sum-of-almost-unique-subarray","rating":1545.9654593951,"_hash":1879020884,"paid_only":false},{"question_id":2842,"title":"统计一个字符串的 k 子序列美丽值最大的数目","title_slug":"count-k-subsequences-of-a-string-with-maximum-beauty","rating":2091.6580433632,"_hash":1559330514,"paid_only":false}],"company":{}},{"contest":{"id":918,"title":"第 360 场周赛","title_slug":"weekly-contest-360","start_time":1693103400,"is_ee_exam_contest":null},"questions":[{"question_id":2833,"title":"距离原点最远的点","title_slug":"furthest-point-from-origin","rating":1294.2819324126,"_hash":1908656857,"paid_only":false},{"question_id":2834,"title":"找出美丽数组的最小和","title_slug":"find-the-minimum-possible-sum-of-a-beautiful-array","rating":1409.2288385791,"_hash":4261327361,"paid_only":false},{"question_id":2835,"title":"使子序列的和等于目标的最少操作次数","title_slug":"minimum-operations-to-form-subsequence-with-target-sum","rating":2207.4917475411,"_hash":94359620,"paid_only":false},{"question_id":2836,"title":"在传球游戏中最大化函数值","title_slug":"maximize-value-of-function-in-a-ball-passing-game","rating":2768.8154223451,"_hash":1915862517,"paid_only":false}],"company":{}},{"contest":{"id":913,"title":"第 359 场周赛","title_slug":"weekly-contest-359","start_time":1692498600,"is_ee_exam_contest":null},"questions":[{"question_id":2828,"title":"判别首字母缩略词","title_slug":"check-if-a-string-is-an-acronym-of-words","rating":1151.9713084499,"_hash":658738156,"paid_only":false},{"question_id":2829,"title":"k-avoiding 数组的最小总和","title_slug":"determine-the-minimum-sum-of-a-k-avoiding-array","rating":1347.2146542772,"_hash":1173419903,"paid_only":false},{"question_id":2830,"title":"销售利润最大化","title_slug":"maximize-the-profit-as-the-salesman","rating":1851.2677996923,"_hash":3503134762,"paid_only":false},{"question_id":2831,"title":"找出最长等值子数组","title_slug":"find-the-longest-equal-subarray","rating":1975.9693382075,"_hash":869865446,"paid_only":false}],"company":{}},{"contest":{"id":909,"title":"第 111 场双周赛","title_slug":"biweekly-contest-111","start_time":1692455400,"is_ee_exam_contest":null},"questions":[{"question_id":2824,"title":"统计和小于目标的下标对数目","title_slug":"count-pairs-whose-sum-is-less-than-target","rating":1165.8838207286,"_hash":77582966,"paid_only":false},{"question_id":2825,"title":"循环增长使字符串子序列等于另一个字符串","title_slug":"make-string-a-subsequence-using-cyclic-increments","rating":1414.6100987673,"_hash":1449546891,"paid_only":false},{"question_id":2826,"title":"将三个组排序","title_slug":"sorting-three-groups","rating":1721.1964988483,"_hash":268097121,"paid_only":false},{"question_id":2827,"title":"范围中美丽整数的数目","title_slug":"number-of-beautiful-integers-in-the-range","rating":2324.1192580053,"_hash":219694070,"paid_only":false}],"company":{}},{"contest":{"id":910,"title":"第 358 场周赛","title_slug":"weekly-contest-358","start_time":1691893800,"is_ee_exam_contest":null},"questions":[{"question_id":2815,"title":"数组中的最大数对和","title_slug":"max-pair-sum-in-an-array","rating":1295.0947625986,"_hash":3182582646,"paid_only":false},{"question_id":2816,"title":"翻倍以链表形式表示的数字","title_slug":"double-a-number-represented-as-a-linked-list","rating":1393.7857353048,"_hash":1168558024,"paid_only":false},{"question_id":2817,"title":"限制条件下元素之间的最小绝对差","title_slug":"minimum-absolute-difference-between-elements-with-constraint","rating":1889.4554322242,"_hash":2701115423,"paid_only":false},{"question_id":2818,"title":"操作使得分最大","title_slug":"apply-operations-to-maximize-score","rating":2396.6770372863,"_hash":2573211912,"paid_only":false}],"company":{}},{"contest":{"id":906,"title":"第 357 场周赛","title_slug":"weekly-contest-357","start_time":1691289000,"is_ee_exam_contest":null},"questions":[{"question_id":2810,"title":"故障键盘","title_slug":"faulty-keyboard","rating":1192.9770230345,"_hash":3177194252,"paid_only":false},{"question_id":2811,"title":"判断是否能拆分数组","title_slug":"check-if-it-is-possible-to-split-array","rating":1543.1204810684,"_hash":335140403,"paid_only":false},{"question_id":2812,"title":"找出最安全路径","title_slug":"find-the-safest-path-in-a-grid","rating":2153.5854429139,"_hash":999091554,"paid_only":false},{"question_id":2813,"title":"子序列最大优雅度","title_slug":"maximum-elegance-of-a-k-length-subsequence","rating":2582.0814855506,"_hash":462875391,"paid_only":false}],"company":{}},{"contest":{"id":903,"title":"第 110 场双周赛","title_slug":"biweekly-contest-110","start_time":1691245800,"is_ee_exam_contest":null},"questions":[{"question_id":2806,"title":"取整购买后的账户余额","title_slug":"account-balance-after-rounded-purchase","rating":1214.703724776,"_hash":2948030094,"paid_only":false},{"question_id":2807,"title":"在链表中插入最大公约数","title_slug":"insert-greatest-common-divisors-in-linked-list","rating":1279.0301521682,"_hash":4225876243,"paid_only":false},{"question_id":2808,"title":"使循环数组所有元素相等的最少秒数","title_slug":"minimum-seconds-to-equalize-a-circular-array","rating":1875.4217845362,"_hash":236837608,"paid_only":false},{"question_id":2809,"title":"使数组和小于等于 x 的最少时间","title_slug":"minimum-time-to-make-array-sum-at-most-x","rating":2978.7961959355,"_hash":224100421,"paid_only":false}],"company":{}},{"contest":{"id":904,"title":"第 356 场周赛","title_slug":"weekly-contest-356","start_time":1690684200,"is_ee_exam_contest":null},"questions":[{"question_id":2798,"title":"满足目标工作时长的员工数目","title_slug":"number-of-employees-who-met-the-target","rating":1142.0341823205,"_hash":3735817636,"paid_only":false},{"question_id":2799,"title":"统计完全子数组的数目","title_slug":"count-complete-subarrays-in-an-array","rating":1397.9519549403,"_hash":1784527717,"paid_only":false},{"question_id":2800,"title":"包含三个字符串的最短字符串","title_slug":"shortest-string-that-contains-three-strings","rating":1855.561153694,"_hash":2827089777,"paid_only":false},{"question_id":2801,"title":"统计范围内的步进数字数目","title_slug":"count-stepping-numbers-in-range","rating":2367.4705934718,"_hash":3369476122,"paid_only":false}],"company":{}},{"contest":{"id":900,"title":"第 355 场周赛","title_slug":"weekly-contest-355","start_time":1690079400,"is_ee_exam_contest":null},"questions":[{"question_id":2788,"title":"按分隔符拆分字符串","title_slug":"split-strings-by-separator","rating":1239.1621762681,"_hash":436025572,"paid_only":false},{"question_id":2789,"title":"合并后数组中的最大元素","title_slug":"largest-element-in-an-array-after-merge-operations","rating":1484.8385256564,"_hash":4141047313,"paid_only":false},{"question_id":2790,"title":"长度递增组的最大数目","title_slug":"maximum-number-of-groups-with-increasing-length","rating":2619.7016189999,"_hash":2676463244,"paid_only":false},{"question_id":2791,"title":"树中可以形成回文的路径数","title_slug":"count-paths-that-can-form-a-palindrome-in-a-tree","rating":2677.1682592316,"_hash":3909203570,"paid_only":false}],"company":{}},{"contest":{"id":897,"title":"第 109 场双周赛","title_slug":"biweekly-contest-109","start_time":1690036200,"is_ee_exam_contest":null},"questions":[{"question_id":2784,"title":"检查数组是否是好的","title_slug":"check-if-array-is-good","rating":1376.2376633804,"_hash":4062228386,"paid_only":false},{"question_id":2785,"title":"将字符串中的元音字母排序","title_slug":"sort-vowels-in-a-string","rating":1266.5014127879,"_hash":1174559962,"paid_only":false},{"question_id":2786,"title":"访问数组中的位置使分数最大","title_slug":"visit-array-positions-to-maximize-score","rating":1732.5146472785,"_hash":3694289041,"paid_only":false},{"question_id":2787,"title":"将一个数字表示成幂的和的方案数","title_slug":"ways-to-express-an-integer-as-sum-of-powers","rating":1817.5282352022,"_hash":2671757819,"paid_only":false}],"company":{}},{"contest":{"id":898,"title":"第 354 场周赛","title_slug":"weekly-contest-354","start_time":1689474600,"is_ee_exam_contest":null},"questions":[{"question_id":2778,"title":"特殊元素平方和","title_slug":"sum-of-squares-of-special-elements","rating":1151.9363042898,"_hash":14750873,"paid_only":false},{"question_id":2779,"title":"数组的最大美丽值","title_slug":"maximum-beauty-of-an-array-after-applying-operation","rating":1638.4147703093,"_hash":1463471392,"paid_only":false},{"question_id":2780,"title":"合法分割的最小下标","title_slug":"minimum-index-of-a-valid-split","rating":1549.9747683007,"_hash":228115268,"paid_only":false},{"question_id":2781,"title":"最长合法子字符串的长度","title_slug":"length-of-the-longest-valid-substring","rating":2203.5694828019,"_hash":2265344721,"paid_only":false}],"company":{}},{"contest":{"id":894,"title":"第 353 场周赛","title_slug":"weekly-contest-353","start_time":1688869800,"is_ee_exam_contest":null},"questions":[{"question_id":2769,"title":"找出最大的可达成数字","title_slug":"find-the-maximum-achievable-number","rating":1191.3681720998,"_hash":2491402608,"paid_only":false},{"question_id":2770,"title":"达到末尾下标所需的最大跳跃次数","title_slug":"maximum-number-of-jumps-to-reach-the-last-index","rating":1533.47383662,"_hash":4000844273,"paid_only":false},{"question_id":2771,"title":"构造最长非递减子数组","title_slug":"longest-non-decreasing-subarray-from-two-arrays","rating":1791.5102962397,"_hash":3729777530,"paid_only":false},{"question_id":2772,"title":"使数组中的所有元素都等于零","title_slug":"apply-operations-to-make-all-array-elements-equal-to-zero","rating":2029.4024513478,"_hash":1866851323,"paid_only":false}],"company":{}},{"contest":{"id":891,"title":"第 108 场双周赛","title_slug":"biweekly-contest-108","start_time":1688826600,"is_ee_exam_contest":null},"questions":[{"question_id":2765,"title":"最长交替子数组","title_slug":"longest-alternating-subarray","rating":1580.9748095835,"_hash":4130986647,"paid_only":false},{"question_id":2766,"title":"重新放置石块","title_slug":"relocate-marbles","rating":1613.2485081262,"_hash":2818493377,"paid_only":false},{"question_id":2767,"title":"将字符串分割为最少的美丽子字符串","title_slug":"partition-string-into-minimum-beautiful-substrings","rating":1864.5644306171,"_hash":4066429992,"paid_only":false},{"question_id":2768,"title":"黑格子的数目","title_slug":"number-of-black-blocks","rating":2175.7874705227,"_hash":3375593429,"paid_only":false}],"company":{}},{"contest":{"id":892,"title":"第 352 场周赛","title_slug":"weekly-contest-352","start_time":1688265000,"is_ee_exam_contest":null},"questions":[{"question_id":2760,"title":"最长奇偶子数组","title_slug":"longest-even-odd-subarray-with-threshold","rating":1420.3698647434,"_hash":2817202669,"paid_only":false},{"question_id":2761,"title":"和等于目标值的质数对","title_slug":"prime-pairs-with-target-sum","rating":1504.9263037499,"_hash":2664015237,"paid_only":false},{"question_id":2762,"title":"不间断子数组","title_slug":"continuous-subarrays","rating":1940.2116985812,"_hash":224630615,"paid_only":false},{"question_id":2763,"title":"所有子数组中不平衡数字之和","title_slug":"sum-of-imbalance-numbers-of-all-subarrays","rating":2277.7923804151,"_hash":228551495,"paid_only":false}],"company":{}},{"contest":{"id":888,"title":"第 351 场周赛","title_slug":"weekly-contest-351","start_time":1687660200,"is_ee_exam_contest":null},"questions":[{"question_id":2748,"title":"美丽下标对的数目","title_slug":"number-of-beautiful-pairs","rating":1301.1576743638,"_hash":1182547848,"paid_only":false},{"question_id":2749,"title":"得到整数零需要执行的最少操作数","title_slug":"minimum-operations-to-make-the-integer-zero","rating":2132.06233459,"_hash":2077283915,"paid_only":false},{"question_id":2750,"title":"将数组划分成若干好子数组的方式","title_slug":"ways-to-split-array-into-good-subarrays","rating":1597.5718383661,"_hash":3518502488,"paid_only":false},{"question_id":2751,"title":"机器人碰撞","title_slug":"robot-collisions","rating":2091.6474629767,"_hash":435938591,"paid_only":false}],"company":{}},{"contest":{"id":885,"title":"第 107 场双周赛","title_slug":"biweekly-contest-107","start_time":1687617000,"is_ee_exam_contest":null},"questions":[{"question_id":2744,"title":"最大字符串配对数目","title_slug":"find-maximum-number-of-string-pairs","rating":1405.8938478338,"_hash":3156996757,"paid_only":false},{"question_id":2745,"title":"构造最长的新字符串","title_slug":"construct-the-longest-new-string","rating":1607.4192947808,"_hash":4083216410,"paid_only":false},{"question_id":2746,"title":"字符串连接删减字母","title_slug":"decremental-string-concatenation","rating":2126.1931814161,"_hash":298215454,"paid_only":false},{"question_id":2747,"title":"统计没有收到请求的服务器数目","title_slug":"count-zero-request-servers","rating":2405.3375364501,"_hash":2240198172,"paid_only":false}],"company":{}},{"contest":{"id":886,"title":"第 350 场周赛","title_slug":"weekly-contest-350","start_time":1687055400,"is_ee_exam_contest":null},"questions":[{"question_id":2739,"title":"总行驶距离","title_slug":"total-distance-traveled","rating":1262.100652797,"_hash":2051273831,"paid_only":false},{"question_id":2740,"title":"找出分区值","title_slug":"find-the-value-of-the-partition","rating":1301.9276849391,"_hash":1010937559,"paid_only":false},{"question_id":2741,"title":"特别的排列","title_slug":"special-permutations","rating":2020.7095306378,"_hash":492772626,"paid_only":false},{"question_id":2742,"title":"给墙壁刷油漆","title_slug":"painting-the-walls","rating":2424.6761561972,"_hash":3563762803,"paid_only":false}],"company":{}},{"contest":{"id":882,"title":"第 349 场周赛","title_slug":"weekly-contest-349","start_time":1686450600,"is_ee_exam_contest":null},"questions":[{"question_id":2733,"title":"既不是最小值也不是最大值","title_slug":"neither-minimum-nor-maximum","rating":1147.8274860083,"_hash":981386412,"paid_only":false},{"question_id":2734,"title":"执行子串操作后的字典序最小字符串","title_slug":"lexicographically-smallest-string-after-substring-operation","rating":1405.123188264,"_hash":3092398094,"paid_only":false},{"question_id":2735,"title":"收集巧克力","title_slug":"collecting-chocolates","rating":2043.1015779104,"_hash":3216210693,"paid_only":false},{"question_id":2736,"title":"最大和查询","title_slug":"maximum-sum-queries","rating":2533.2830157959,"_hash":3697179042,"paid_only":false}],"company":{}},{"contest":{"id":879,"title":"第 106 场双周赛","title_slug":"biweekly-contest-106","start_time":1686407400,"is_ee_exam_contest":null},"questions":[{"question_id":2729,"title":"判断一个数是否迷人","title_slug":"check-if-the-number-is-fascinating","rating":1227.91037348,"_hash":3509092584,"paid_only":false},{"question_id":2730,"title":"找到最长的半重复子字符串","title_slug":"find-the-longest-semi-repetitive-substring","rating":1501.9080845668,"_hash":4064007490,"paid_only":false},{"question_id":2731,"title":"移动机器人","title_slug":"movement-of-robots","rating":1922.9521758079,"_hash":1590024460,"paid_only":false},{"question_id":2732,"title":"找到矩阵中的好子集","title_slug":"find-a-good-subset-of-the-matrix","rating":2239.7101856677,"_hash":96440277,"paid_only":false}],"company":{}},{"contest":{"id":880,"title":"第 348 场周赛","title_slug":"weekly-contest-348","start_time":1685845800,"is_ee_exam_contest":null},"questions":[{"question_id":2716,"title":"最小化字符串长度","title_slug":"minimize-string-length","rating":1242.9383307344,"_hash":2836390896,"paid_only":false},{"question_id":2717,"title":"半有序排列","title_slug":"semi-ordered-permutation","rating":1295.75504698,"_hash":1009976390,"paid_only":false},{"question_id":2718,"title":"查询后矩阵的和","title_slug":"sum-of-matrix-after-queries","rating":1768.9138093037,"_hash":3363685518,"paid_only":false},{"question_id":2719,"title":"统计整数数目","title_slug":"count-of-integers","rating":2354.5411153127,"_hash":942180030,"paid_only":false}],"company":{}},{"contest":{"id":876,"title":"第 347 场周赛","title_slug":"weekly-contest-347","start_time":1685241000,"is_ee_exam_contest":null},"questions":[{"question_id":2710,"title":"移除字符串中的尾随零","title_slug":"remove-trailing-zeros-from-a-string","rating":1164.5575871589,"_hash":2975776867,"paid_only":false},{"question_id":2711,"title":"对角线上不同值的数量差","title_slug":"difference-of-number-of-distinct-values-on-diagonals","rating":1428.7246677159,"_hash":3754993583,"paid_only":false},{"question_id":2712,"title":"使所有字符相等的最小成本","title_slug":"minimum-cost-to-make-all-characters-equal","rating":1791.0336923305,"_hash":1186731908,"paid_only":false},{"question_id":2713,"title":"矩阵中严格递增的单元格数","title_slug":"maximum-strictly-increasing-cells-in-a-matrix","rating":2387.3525635254,"_hash":521886798,"paid_only":false}],"company":{}},{"contest":{"id":873,"title":"第 105 场双周赛","title_slug":"biweekly-contest-105","start_time":1685197800,"is_ee_exam_contest":null},"questions":[{"question_id":2706,"title":"购买两块巧克力","title_slug":"buy-two-chocolates","rating":1207.7491943483,"_hash":2844316244,"paid_only":false},{"question_id":2707,"title":"字符串中的额外字符","title_slug":"extra-characters-in-a-string","rating":1735.8505509901,"_hash":1779771436,"paid_only":false},{"question_id":2708,"title":"一个小组的最大实力值","title_slug":"maximum-strength-of-a-group","rating":1502.2633100489,"_hash":3413400617,"paid_only":false},{"question_id":2709,"title":"最大公约数遍历","title_slug":"greatest-common-divisor-traversal","rating":2171.9645269732,"_hash":1482300808,"paid_only":false}],"company":{}},{"contest":{"id":874,"title":"第 346 场周赛","title_slug":"weekly-contest-346","start_time":1684636200,"is_ee_exam_contest":null},"questions":[{"question_id":2696,"title":"删除子串后的字符串最小长度","title_slug":"minimum-string-length-after-removing-substrings","rating":1282.3870247003,"_hash":4006408746,"paid_only":false},{"question_id":2697,"title":"字典序最小回文串","title_slug":"lexicographically-smallest-palindrome","rating":1303.7347742929,"_hash":3386255965,"paid_only":false},{"question_id":2698,"title":"求一个整数的惩罚数","title_slug":"find-the-punishment-number-of-an-integer","rating":1678.6245760413,"_hash":2745040429,"paid_only":false},{"question_id":2699,"title":"修改图中的边权","title_slug":"modify-graph-edge-weights","rating":2873.9745576413,"_hash":4247310156,"paid_only":false}],"company":{}},{"contest":{"id":870,"title":"第 345 场周赛","title_slug":"weekly-contest-345","start_time":1684031400,"is_ee_exam_contest":null},"questions":[{"question_id":2682,"title":"找出转圈游戏输家","title_slug":"find-the-losers-of-the-circular-game","rating":1382.6941570342,"_hash":183030256,"paid_only":false},{"question_id":2683,"title":"相邻值的按位异或","title_slug":"neighboring-bitwise-xor","rating":1517.8263048447,"_hash":78641139,"paid_only":false},{"question_id":2684,"title":"矩阵中移动的最大次数","title_slug":"maximum-number-of-moves-in-a-grid","rating":1625.9636825798,"_hash":1603806327,"paid_only":false},{"question_id":2685,"title":"统计完全连通分量的数量","title_slug":"count-the-number-of-complete-components","rating":1769.4344566771,"_hash":1502620621,"paid_only":false}],"company":{}},{"contest":{"id":866,"title":"第 104 场双周赛","title_slug":"biweekly-contest-104","start_time":1683988200,"is_ee_exam_contest":null},"questions":[{"question_id":2678,"title":"老人的数目","title_slug":"number-of-senior-citizens","rating":1198.8420836551,"_hash":881741713,"paid_only":false},{"question_id":2679,"title":"矩阵中的和","title_slug":"sum-in-a-matrix","rating":1333.0179956774,"_hash":846898736,"paid_only":false},{"question_id":2680,"title":"最大或值","title_slug":"maximum-or","rating":1912.1926699881,"_hash":1962061945,"paid_only":false},{"question_id":2681,"title":"英雄的力量","title_slug":"power-of-heroes","rating":2060.0818824378,"_hash":3969212159,"paid_only":false}],"company":{}},{"contest":{"id":867,"title":"第 344 场周赛","title_slug":"weekly-contest-344","start_time":1683426600,"is_ee_exam_contest":null},"questions":[{"question_id":2670,"title":"找出不同元素数目差数组","title_slug":"find-the-distinct-difference-array","rating":1266.5231114343,"_hash":752241853,"paid_only":false},{"question_id":2671,"title":"频率跟踪器","title_slug":"frequency-tracker","rating":1509.6237874441,"_hash":3589033912,"paid_only":false},{"question_id":2672,"title":"有相同颜色的相邻元素数目","title_slug":"number-of-adjacent-elements-with-the-same-color","rating":1705.2545641354,"_hash":1725183127,"paid_only":false},{"question_id":2673,"title":"使二叉树所有路径值相等的最小代价","title_slug":"make-costs-of-paths-equal-in-a-binary-tree","rating":1917.1049672432,"_hash":1853031865,"paid_only":false}],"company":{}},{"contest":{"id":863,"title":"第 343 场周赛","title_slug":"weekly-contest-343","start_time":1682821800,"is_ee_exam_contest":null},"questions":[{"question_id":2660,"title":"保龄球游戏的获胜者","title_slug":"determine-the-winner-of-a-bowling-game","rating":1324.1714505166,"_hash":2355716390,"paid_only":false},{"question_id":2661,"title":"找出叠涂元素","title_slug":"first-completely-painted-row-or-column","rating":1502.6623568929,"_hash":637661898,"paid_only":false},{"question_id":2662,"title":"前往目标的最小代价","title_slug":"minimum-cost-of-a-path-with-special-roads","rating":2153.8943791656,"_hash":1243440018,"paid_only":false},{"question_id":2663,"title":"字典序最小的美丽字符串","title_slug":"lexicographically-smallest-beautiful-string","rating":2415.7434855724,"_hash":178720857,"paid_only":false}],"company":{}},{"contest":{"id":859,"title":"第 103 场双周赛","title_slug":"biweekly-contest-103","start_time":1682778600,"is_ee_exam_contest":null},"questions":[{"question_id":2656,"title":"K 个元素的最大和","title_slug":"maximum-sum-with-exactly-k-elements","rating":1213.4070467355,"_hash":2193040547,"paid_only":false},{"question_id":2657,"title":"找到两个数组的前缀公共数组","title_slug":"find-the-prefix-common-array-of-two-arrays","rating":1304.1180812515,"_hash":917808097,"paid_only":false},{"question_id":2658,"title":"网格图中鱼的最大数目","title_slug":"maximum-number-of-fish-in-a-grid","rating":1489.7210915287,"_hash":2383092679,"paid_only":false},{"question_id":2659,"title":"将数组清空","title_slug":"make-array-empty","rating":2281.8816902545,"_hash":2062472427,"paid_only":false}],"company":{}},{"contest":{"id":860,"title":"第 342 场周赛","title_slug":"weekly-contest-342","start_time":1682217000,"is_ee_exam_contest":null},"questions":[{"question_id":2651,"title":"计算列车到站时间","title_slug":"calculate-delayed-arrival-time","rating":1168.6157473032,"_hash":1602330770,"paid_only":false},{"question_id":2652,"title":"倍数求和","title_slug":"sum-multiples","rating":1182.3093772964,"_hash":1017096056,"paid_only":false},{"question_id":2653,"title":"滑动子数组的美丽值","title_slug":"sliding-subarray-beauty","rating":1785.6006955353,"_hash":3971252642,"paid_only":false},{"question_id":2654,"title":"使数组所有元素变成 1 的最少操作次数","title_slug":"minimum-number-of-operations-to-make-all-array-elements-equal-to-1","rating":1928.7961204946,"_hash":2113446044,"paid_only":false}],"company":{}},{"contest":{"id":856,"title":"第 341 场周赛","title_slug":"weekly-contest-341","start_time":1681612200,"is_ee_exam_contest":null},"questions":[{"question_id":2643,"title":"一最多的行","title_slug":"row-with-maximum-ones","rating":1174.3019990918,"_hash":950521557,"paid_only":false},{"question_id":2644,"title":"找出可整除性得分最大的整数","title_slug":"find-the-maximum-divisibility-score","rating":1257.8344655358,"_hash":1766481102,"paid_only":false},{"question_id":2645,"title":"构造有效字符串的最少插入数","title_slug":"minimum-additions-to-make-valid-string","rating":1477.7669322402,"_hash":690173651,"paid_only":false},{"question_id":2646,"title":"最小化旅行的价格总和","title_slug":"minimize-the-total-price-of-the-trips","rating":2238.2830745228,"_hash":1058966145,"paid_only":false}],"company":{}},{"contest":{"id":853,"title":"第 102 场双周赛","title_slug":"biweekly-contest-102","start_time":1681569000,"is_ee_exam_contest":null},"questions":[{"question_id":2639,"title":"查询网格图中每一列的宽度","title_slug":"find-the-width-of-columns-of-a-grid","rating":1282.5186784876,"_hash":2007370712,"paid_only":false},{"question_id":2640,"title":"一个数组所有前缀的分数","title_slug":"find-the-score-of-all-prefixes-of-an-array","rating":1314.3600610974,"_hash":1931269506,"paid_only":false},{"question_id":2641,"title":"二叉树的堂兄弟节点 II","title_slug":"cousins-in-binary-tree-ii","rating":1676.5007365375,"_hash":2279730191,"paid_only":false},{"question_id":2642,"title":"设计可以求最短路径的图类","title_slug":"design-graph-with-shortest-path-calculator","rating":1810.6470004623,"_hash":737896329,"paid_only":false}],"company":{}},{"contest":{"id":854,"title":"第 340 场周赛","title_slug":"weekly-contest-340","start_time":1681007400,"is_ee_exam_contest":null},"questions":[{"question_id":2614,"title":"对角线上的质数","title_slug":"prime-in-diagonal","rating":1375.4261931199,"_hash":3158353268,"paid_only":false},{"question_id":2615,"title":"等值距离和","title_slug":"sum-of-distances","rating":1793.3033536992,"_hash":158335627,"paid_only":false},{"question_id":2616,"title":"最小化数对的最大差值","title_slug":"minimize-the-maximum-difference-of-pairs","rating":2155.3424932408,"_hash":3806017410,"paid_only":false},{"question_id":2617,"title":"网格图中最少访问的格子数","title_slug":"minimum-number-of-visited-cells-in-a-grid","rating":2581.9961985753,"_hash":267246445,"paid_only":false}],"company":{}},{"contest":{"id":850,"title":"第 339 场周赛","title_slug":"weekly-contest-339","start_time":1680402600,"is_ee_exam_contest":null},"questions":[{"question_id":2609,"title":"最长平衡子字符串","title_slug":"find-the-longest-balanced-substring-of-a-binary-string","rating":1348.577010609,"_hash":1922249884,"paid_only":false},{"question_id":2610,"title":"转换二维数组","title_slug":"convert-an-array-into-a-2d-array-with-conditions","rating":1373.8916796083,"_hash":974534416,"paid_only":false},{"question_id":2611,"title":"老鼠和奶酪","title_slug":"mice-and-cheese","rating":1663.456591933,"_hash":3624743731,"paid_only":false},{"question_id":2612,"title":"最少翻转操作数","title_slug":"minimum-reverse-operations","rating":2824.4551372454,"_hash":855962181,"paid_only":false}],"company":{}},{"contest":{"id":842,"title":"第 101 场双周赛","title_slug":"biweekly-contest-101","start_time":1680359400,"is_ee_exam_contest":null},"questions":[{"question_id":2605,"title":"从两个数字数组里生成最小数字","title_slug":"form-smallest-number-from-two-digit-arrays","rating":1241.5775825621,"_hash":1927271954,"paid_only":false},{"question_id":2606,"title":"找到最大开销的子字符串","title_slug":"find-the-substring-with-maximum-cost","rating":1422.3308967485,"_hash":1474617560,"paid_only":false},{"question_id":2607,"title":"使子数组元素和相等","title_slug":"make-k-subarray-sums-equal","rating":2071.3208991938,"_hash":1691357385,"paid_only":false},{"question_id":2608,"title":"图中的最短环","title_slug":"shortest-cycle-in-a-graph","rating":1904.2279434479,"_hash":1825399219,"paid_only":false}],"company":{}},{"contest":{"id":843,"title":"第 338 场周赛","title_slug":"weekly-contest-338","start_time":1679797800,"is_ee_exam_contest":null},"questions":[{"question_id":2600,"title":"K 件物品的最大和","title_slug":"k-items-with-the-maximum-sum","rating":1434.2392062372,"_hash":829222445,"paid_only":false},{"question_id":2601,"title":"质数减法运算","title_slug":"prime-subtraction-operation","rating":1779.0712927572,"_hash":1323143155,"paid_only":false},{"question_id":2602,"title":"使数组元素全部相等的最少操作次数","title_slug":"minimum-operations-to-make-all-array-elements-equal","rating":1903.1973989877,"_hash":761999420,"paid_only":false},{"question_id":2603,"title":"收集树中金币","title_slug":"collect-coins-in-a-tree","rating":2711.8717381409,"_hash":2315979719,"paid_only":false}],"company":{}},{"contest":{"id":839,"title":"第 337 场周赛","title_slug":"weekly-contest-337","start_time":1679193000,"is_ee_exam_contest":null},"questions":[{"question_id":2595,"title":"奇偶位数","title_slug":"number-of-even-and-odd-bits","rating":1206.5675296817,"_hash":223285376,"paid_only":false},{"question_id":2596,"title":"检查骑士巡视方案","title_slug":"check-knight-tour-configuration","rating":1448.1865030721,"_hash":4101129191,"paid_only":false},{"question_id":2597,"title":"美丽子集的数目","title_slug":"the-number-of-beautiful-subsets","rating":2023.4303440211,"_hash":1913772288,"paid_only":false},{"question_id":2598,"title":"执行操作后的最大 MEX","title_slug":"smallest-missing-non-negative-integer-after-operations","rating":1845.6611654401,"_hash":2357679638,"paid_only":false}],"company":{}},{"contest":{"id":832,"title":"第 100 场双周赛","title_slug":"biweekly-contest-100","start_time":1679149800,"is_ee_exam_contest":null},"questions":[{"question_id":2591,"title":"将钱分给最多的儿童","title_slug":"distribute-money-to-maximum-children","rating":1530.6451141787,"_hash":2074713320,"paid_only":false},{"question_id":2592,"title":"最大化数组的伟大值","title_slug":"maximize-greatness-of-an-array","rating":1569.1579260438,"_hash":3063296642,"paid_only":false},{"question_id":2593,"title":"标记所有元素后数组的分数","title_slug":"find-score-of-an-array-after-marking-all-elements","rating":1665.1885910815,"_hash":3148467486,"paid_only":false},{"question_id":2594,"title":"修车的最少时间","title_slug":"minimum-time-to-repair-cars","rating":1915.2628132733,"_hash":2422059385,"paid_only":false}],"company":{}},{"contest":{"id":833,"title":"第 336 场周赛","title_slug":"weekly-contest-336","start_time":1678588200,"is_ee_exam_contest":null},"questions":[{"question_id":2586,"title":"统计范围内的元音字符串数","title_slug":"count-the-number-of-vowel-strings-in-range","rating":1178.6580069402,"_hash":1405789151,"paid_only":false},{"question_id":2587,"title":"重排数组以得到最大前缀分数","title_slug":"rearrange-array-to-maximize-prefix-score","rating":1336.7830451625,"_hash":922160489,"paid_only":false},{"question_id":2588,"title":"统计美丽子数组数目","title_slug":"count-the-number-of-beautiful-subarrays","rating":1696.8895579594,"_hash":3474039417,"paid_only":false},{"question_id":2589,"title":"完成所有任务的最少时间","title_slug":"minimum-time-to-complete-all-tasks","rating":2380.5983169295,"_hash":1119710280,"paid_only":false}],"company":{}},{"contest":{"id":825,"title":"第 335 场周赛","title_slug":"weekly-contest-335","start_time":1677983400,"is_ee_exam_contest":null},"questions":[{"question_id":2582,"title":"递枕头","title_slug":"pass-the-pillow","rating":1278.0092842613,"_hash":233297408,"paid_only":false},{"question_id":2583,"title":"二叉树中的第 K 大层和","title_slug":"kth-largest-sum-in-a-binary-tree","rating":1374.3527967199,"_hash":3851205548,"paid_only":false},{"question_id":2584,"title":"分割数组使乘积互质","title_slug":"split-the-array-to-make-coprime-products","rating":2159.4844281244,"_hash":1405611181,"paid_only":false},{"question_id":2585,"title":"获得分数的方法数","title_slug":"number-of-ways-to-earn-points","rating":1909.5535861652,"_hash":1697537146,"paid_only":false}],"company":{}},{"contest":{"id":822,"title":"第 99 场双周赛","title_slug":"biweekly-contest-99","start_time":1677940200,"is_ee_exam_contest":null},"questions":[{"question_id":2578,"title":"最小和分割","title_slug":"split-with-minimum-sum","rating":1350.5883729249,"_hash":1850921957,"paid_only":false},{"question_id":2579,"title":"统计染色格子数","title_slug":"count-total-number-of-colored-cells","rating":1356.4450869217,"_hash":1180349312,"paid_only":false},{"question_id":2580,"title":"统计将重叠区间合并成组的方案数","title_slug":"count-ways-to-group-overlapping-ranges","rating":1631.5850830561,"_hash":4043601244,"paid_only":false},{"question_id":2581,"title":"统计可能的树根数目","title_slug":"count-number-of-possible-root-nodes","rating":2228.3454693625,"_hash":3735555259,"paid_only":false}],"company":{}},{"contest":{"id":823,"title":"第 334 场周赛","title_slug":"weekly-contest-334","start_time":1677378600,"is_ee_exam_contest":null},"questions":[{"question_id":2574,"title":"左右元素和的差值","title_slug":"left-and-right-sum-differences","rating":1206.0712568518,"_hash":95938088,"paid_only":false},{"question_id":2575,"title":"找出字符串的可整除数组","title_slug":"find-the-divisibility-array-of-a-string","rating":1541.3741526845,"_hash":2410692850,"paid_only":false},{"question_id":2576,"title":"求出最多标记下标","title_slug":"find-the-maximum-number-of-marked-indices","rating":1843.2383664194,"_hash":260479518,"paid_only":false},{"question_id":2577,"title":"在网格图中访问一个格子的最少时间","title_slug":"minimum-time-to-visit-a-cell-in-a-grid","rating":2381.625583289,"_hash":2170025879,"paid_only":false}],"company":{}},{"contest":{"id":819,"title":"第 333 场周赛","title_slug":"weekly-contest-333","start_time":1676773800,"is_ee_exam_contest":null},"questions":[{"question_id":2570,"title":"合并两个二维数组 - 求和法","title_slug":"merge-two-2d-arrays-by-summing-values","rating":1281.0889272532,"_hash":1168254316,"paid_only":false},{"question_id":2571,"title":"将整数减少到零需要的最少操作数","title_slug":"minimum-operations-to-reduce-an-integer-to-0","rating":1649.2000410344,"_hash":676949389,"paid_only":false},{"question_id":2572,"title":"无平方子集计数","title_slug":"count-the-number-of-square-free-subsets","rating":2419.5791089724,"_hash":3483377785,"paid_only":false},{"question_id":2573,"title":"找出对应 LCP 矩阵的字符串","title_slug":"find-the-string-with-lcp","rating":2681.7054310332,"_hash":3461834167,"paid_only":false}],"company":{}},{"contest":{"id":816,"title":"第 98 场双周赛","title_slug":"biweekly-contest-98","start_time":1676730600,"is_ee_exam_contest":null},"questions":[{"question_id":2566,"title":"替换一个数字后的最大差值","title_slug":"maximum-difference-by-remapping-a-digit","rating":1396.1044458638,"_hash":2204380301,"paid_only":false},{"question_id":2567,"title":"修改两个元素的最小分数","title_slug":"minimum-score-by-changing-two-elements","rating":1608.577875807,"_hash":1785562293,"paid_only":false},{"question_id":2568,"title":"最小无法得到的或值","title_slug":"minimum-impossible-or","rating":1754.1710323358,"_hash":1363446915,"paid_only":false},{"question_id":2569,"title":"更新数组后处理求和查询","title_slug":"handling-sum-queries-after-update","rating":2397.8728428256,"_hash":1507332922,"paid_only":false}],"company":{}},{"contest":{"id":817,"title":"第 332 场周赛","title_slug":"weekly-contest-332","start_time":1676169000,"is_ee_exam_contest":null},"questions":[{"question_id":2562,"title":"找出数组的串联值","title_slug":"find-the-array-concatenation-value","rating":1259.949137745,"_hash":2036642817,"paid_only":false},{"question_id":2563,"title":"统计公平数对的数目","title_slug":"count-the-number-of-fair-pairs","rating":1720.7470612766,"_hash":2019191135,"paid_only":false},{"question_id":2564,"title":"子字符串异或查询","title_slug":"substring-xor-queries","rating":1959.2696201953,"_hash":1709868853,"paid_only":false},{"question_id":2565,"title":"最少得分子序列","title_slug":"subsequence-with-the-minimum-score","rating":2432.4146343542,"_hash":782263815,"paid_only":false}],"company":{}},{"contest":{"id":813,"title":"第 331 场周赛","title_slug":"weekly-contest-331","start_time":1675564200,"is_ee_exam_contest":null},"questions":[{"question_id":2558,"title":"从数量最多的堆取走礼物","title_slug":"take-gifts-from-the-richest-pile","rating":1276.7817742915,"_hash":1520385101,"paid_only":false},{"question_id":2559,"title":"统计范围内的元音字符串数","title_slug":"count-vowel-strings-in-ranges","rating":1435.0179887342,"_hash":945629510,"paid_only":false},{"question_id":2560,"title":"打家劫舍 IV","title_slug":"house-robber-iv","rating":2081.1880297942,"_hash":1088208610,"paid_only":false},{"question_id":2561,"title":"重排水果","title_slug":"rearranging-fruits","rating":2221.793185714,"_hash":3549688121,"paid_only":false}],"company":{}},{"contest":{"id":810,"title":"第 97 场双周赛","title_slug":"biweekly-contest-97","start_time":1675521000,"is_ee_exam_contest":null},"questions":[{"question_id":2553,"title":"分割数组中数字的数位","title_slug":"separate-the-digits-in-an-array","rating":1216.612918849,"_hash":1493116499,"paid_only":false},{"question_id":2554,"title":"从一个范围内选择最多整数 I","title_slug":"maximum-number-of-integers-to-choose-from-a-range-i","rating":1333.2008827592,"_hash":220667062,"paid_only":false},{"question_id":2555,"title":"两个线段获得的最多奖品","title_slug":"maximize-win-from-two-segments","rating":2080.7845644831,"_hash":149268417,"paid_only":false},{"question_id":2556,"title":"二进制矩阵中翻转最多一次使路径不连通","title_slug":"disconnect-path-in-a-binary-matrix-by-at-most-one-flip","rating":2368.6674771307,"_hash":3118895370,"paid_only":false}],"company":{}},{"contest":{"id":811,"title":"第 330 场周赛","title_slug":"weekly-contest-330","start_time":1674959400,"is_ee_exam_contest":null},"questions":[{"question_id":2549,"title":"统计桌面上的不同数字","title_slug":"count-distinct-numbers-on-board","rating":1265.8320564115,"_hash":3023056451,"paid_only":false},{"question_id":2550,"title":"猴子碰撞的方法数","title_slug":"count-collisions-of-monkeys-on-a-polygon","rating":1662.7075394144,"_hash":374282350,"paid_only":false},{"question_id":2551,"title":"将珠子放入背包中","title_slug":"put-marbles-in-bags","rating":2042.4005521254,"_hash":1210688937,"paid_only":false},{"question_id":2552,"title":"统计上升四元组","title_slug":"count-increasing-quadruplets","rating":2432.713399111,"_hash":2579679937,"paid_only":false}],"company":{}},{"contest":{"id":807,"title":"第 329 场周赛","title_slug":"weekly-contest-329","start_time":1674354600,"is_ee_exam_contest":null},"questions":[{"question_id":2544,"title":"交替数字和","title_slug":"alternating-digit-sum","rating":1184.3385083575,"_hash":833954016,"paid_only":false},{"question_id":2545,"title":"根据第 K 场考试的分数排序","title_slug":"sort-the-students-by-their-kth-score","rating":1294.0257382852,"_hash":2697040026,"paid_only":false},{"question_id":2546,"title":"执行逐位运算使字符串相等","title_slug":"apply-bitwise-operations-to-make-strings-equal","rating":1604.6299874552,"_hash":1537635707,"paid_only":false},{"question_id":2547,"title":"拆分数组的最小代价","title_slug":"minimum-cost-to-split-an-array","rating":2019.9859462755,"_hash":3573894690,"paid_only":false}],"company":{}},{"contest":{"id":804,"title":"第 96 场双周赛","title_slug":"biweekly-contest-96","start_time":1674311400,"is_ee_exam_contest":null},"questions":[{"question_id":2540,"title":"最小公共值","title_slug":"minimum-common-value","rating":1249.7515196656,"_hash":2913358439,"paid_only":false},{"question_id":2541,"title":"使数组中所有元素相等的最小操作数 II","title_slug":"minimum-operations-to-make-array-equal-ii","rating":1619.505461912,"_hash":2719928959,"paid_only":false},{"question_id":2542,"title":"最大子序列的分数","title_slug":"maximum-subsequence-score","rating":2056.2598215101,"_hash":301567212,"paid_only":false},{"question_id":2543,"title":"判断一个点是否可以到达","title_slug":"check-if-point-is-reachable","rating":2220.8257124139,"_hash":3766200583,"paid_only":false}],"company":{}},{"contest":{"id":805,"title":"第 328 场周赛","title_slug":"weekly-contest-328","start_time":1673749800,"is_ee_exam_contest":null},"questions":[{"question_id":2535,"title":"数组元素和与数字和的绝对差","title_slug":"difference-between-element-sum-and-digit-sum-of-an-array","rating":1222.2354919459,"_hash":1732202044,"paid_only":false},{"question_id":2536,"title":"子矩阵元素加 1","title_slug":"increment-submatrices-by-one","rating":1583.3117784523,"_hash":3521973284,"paid_only":false},{"question_id":2537,"title":"统计好子数组的数目","title_slug":"count-the-number-of-good-subarrays","rating":1891.8455273506,"_hash":2668311333,"paid_only":false},{"question_id":2538,"title":"最大价值和与最小价值和的差值","title_slug":"difference-between-maximum-and-minimum-price-sum","rating":2397.9722495587,"_hash":2887872471,"paid_only":false}],"company":{}},{"contest":{"id":801,"title":"第 327 场周赛","title_slug":"weekly-contest-327","start_time":1673145000,"is_ee_exam_contest":null},"questions":[{"question_id":2529,"title":"正整数和负整数的最大计数","title_slug":"maximum-count-of-positive-integer-and-negative-integer","rating":1195.9731842298,"_hash":770550829,"paid_only":false},{"question_id":2530,"title":"执行 K 次操作后的最大分数","title_slug":"maximal-score-after-applying-k-operations","rating":1386.1200017827,"_hash":2626303746,"paid_only":false},{"question_id":2531,"title":"使字符串中不同字符的数目相等","title_slug":"make-number-of-distinct-characters-equal","rating":1775.854606648,"_hash":485006616,"paid_only":false},{"question_id":2532,"title":"过桥的时间","title_slug":"time-to-cross-a-bridge","rating":2588.8752130913,"_hash":1029578709,"paid_only":false}],"company":{}},{"contest":{"id":798,"title":"第 95 场双周赛","title_slug":"biweekly-contest-95","start_time":1673101800,"is_ee_exam_contest":null},"questions":[{"question_id":2525,"title":"根据规则将箱子分类","title_slug":"categorize-box-according-to-criteria","rating":1301.4167433184,"_hash":1751494517,"paid_only":false},{"question_id":2526,"title":"找到数据流中的连续整数","title_slug":"find-consecutive-integers-from-a-data-stream","rating":1444.3218903725,"_hash":778347498,"paid_only":false},{"question_id":2527,"title":"查询数组异或美丽值","title_slug":"find-xor-beauty-of-array","rating":1549.945040184,"_hash":1501707049,"paid_only":false},{"question_id":2528,"title":"最大化城市的最小电量","title_slug":"maximize-the-minimum-powered-city","rating":2235.5784618885,"_hash":530846359,"paid_only":false}],"company":{}},{"contest":{"id":799,"title":"第 326 场周赛","title_slug":"weekly-contest-326","start_time":1672540200,"is_ee_exam_contest":null},"questions":[{"question_id":2520,"title":"统计能整除数字的位数","title_slug":"count-the-digits-that-divide-a-number","rating":1260.8697515006,"_hash":2323533689,"paid_only":false},{"question_id":2521,"title":"数组乘积中的不同质因数数目","title_slug":"distinct-prime-factors-of-product-of-array","rating":1413.0376809608,"_hash":3036702868,"paid_only":false},{"question_id":2522,"title":"将字符串分割成值不超过 K 的子字符串","title_slug":"partition-string-into-substrings-with-values-at-most-k","rating":1604.5128423093,"_hash":3561342867,"paid_only":false},{"question_id":2523,"title":"范围内最接近的两个质数","title_slug":"closest-prime-numbers-in-range","rating":1649.7120733311,"_hash":3492742379,"paid_only":false}],"company":{}},{"contest":{"id":795,"title":"第 325 场周赛","title_slug":"weekly-contest-325","start_time":1671935400,"is_ee_exam_contest":null},"questions":[{"question_id":2515,"title":"到目标字符串的最短距离","title_slug":"shortest-distance-to-target-string-in-a-circular-array","rating":1367.0197235097,"_hash":1200771569,"paid_only":false},{"question_id":2516,"title":"每种字符至少取 K 个","title_slug":"take-k-of-each-character-from-left-and-right","rating":1947.8832856412,"_hash":2088911620,"paid_only":false},{"question_id":2517,"title":"礼盒的最大甜蜜度","title_slug":"maximum-tastiness-of-candy-basket","rating":2020.6775180586,"_hash":337441895,"paid_only":false},{"question_id":2518,"title":"好分区的数目","title_slug":"number-of-great-partitions","rating":2414.6227484407,"_hash":636790914,"paid_only":false}],"company":{}},{"contest":{"id":789,"title":"第 94 场双周赛","title_slug":"biweekly-contest-94","start_time":1671892200,"is_ee_exam_contest":null},"questions":[{"question_id":2511,"title":"最多可以摧毁的敌人城堡数目","title_slug":"maximum-enemy-forts-that-can-be-captured","rating":1450.0534545623,"_hash":3250902571,"paid_only":false},{"question_id":2512,"title":"奖励最顶尖的 K 名学生","title_slug":"reward-top-k-students","rating":1636.7472106213,"_hash":1295785983,"paid_only":false},{"question_id":2513,"title":"最小化两个数组中的最大值","title_slug":"minimize-the-maximum-of-two-arrays","rating":2302.4005640818,"_hash":1712826586,"paid_only":false},{"question_id":2514,"title":"统计同位异构字符串数目","title_slug":"count-anagrams","rating":2069.7848729824,"_hash":2697534725,"paid_only":false}],"company":{}},{"contest":{"id":790,"title":"第 324 场周赛","title_slug":"weekly-contest-324","start_time":1671330600,"is_ee_exam_contest":null},"questions":[{"question_id":2506,"title":"统计相似字符串对的数目","title_slug":"count-pairs-of-similar-strings","rating":1335.4613368501,"_hash":3891355877,"paid_only":false},{"question_id":2507,"title":"使用质因数之和替换后可以取到的最小值","title_slug":"smallest-value-after-replacing-with-sum-of-prime-factors","rating":1499.5903720292,"_hash":1529011687,"paid_only":false},{"question_id":2508,"title":"添加边使所有节点度数都为偶数","title_slug":"add-edges-to-make-degrees-of-all-nodes-even","rating":2060.0720834082,"_hash":2337606731,"paid_only":false},{"question_id":2509,"title":"查询树中环的长度","title_slug":"cycle-length-queries-in-a-tree","rating":1948.489500779,"_hash":922086852,"paid_only":false}],"company":{}},{"contest":{"id":785,"title":"第 323 场周赛","title_slug":"weekly-contest-323","start_time":1670725800,"is_ee_exam_contest":null},"questions":[{"question_id":2500,"title":"删除每行中的最大值","title_slug":"delete-greatest-value-in-each-row","rating":1309.7266159448,"_hash":1037331293,"paid_only":false},{"question_id":2501,"title":"数组中最长的方波","title_slug":"longest-square-streak-in-an-array","rating":1479.9828219111,"_hash":4224854568,"paid_only":false},{"question_id":2502,"title":"设计内存分配器","title_slug":"design-memory-allocator","rating":1745.5352025872,"_hash":1579629689,"paid_only":false},{"question_id":2503,"title":"矩阵查询可获得的最大分数","title_slug":"maximum-number-of-points-from-grid-queries","rating":2195.6540241654,"_hash":4062961912,"paid_only":false}],"company":{}},{"contest":{"id":782,"title":"第 93 场双周赛","title_slug":"biweekly-contest-93","start_time":1670682600,"is_ee_exam_contest":null},"questions":[{"question_id":2496,"title":"数组中字符串的最大值","title_slug":"maximum-value-of-a-string-in-an-array","rating":1292.8993325204,"_hash":3800630907,"paid_only":false},{"question_id":2497,"title":"图中最大星和","title_slug":"maximum-star-sum-of-a-graph","rating":1682.16892078,"_hash":1275579259,"paid_only":false},{"question_id":2498,"title":"青蛙过河 II","title_slug":"frog-jump-ii","rating":1759.0470795449,"_hash":2772831251,"paid_only":false},{"question_id":2499,"title":"让数组不相等的最小总代价","title_slug":"minimum-total-cost-to-make-arrays-unequal","rating":2633.0144045478,"_hash":3756156206,"paid_only":false}],"company":{}},{"contest":{"id":783,"title":"第 322 场周赛","title_slug":"weekly-contest-322","start_time":1670121000,"is_ee_exam_contest":null},"questions":[{"question_id":2490,"title":"回环句","title_slug":"circular-sentence","rating":1262.938740364,"_hash":3558781406,"paid_only":false},{"question_id":2491,"title":"划分技能点相等的团队","title_slug":"divide-players-into-teams-of-equal-skill","rating":1323.1893756783,"_hash":3978864326,"paid_only":false},{"question_id":2492,"title":"两个城市间路径的最小分数","title_slug":"minimum-score-of-a-path-between-two-cities","rating":1679.5737760149,"_hash":3337273246,"paid_only":false},{"question_id":2493,"title":"将节点分成尽可能多的组","title_slug":"divide-nodes-into-the-maximum-number-of-groups","rating":2415.2802039252,"_hash":1627181507,"paid_only":false}],"company":{}},{"contest":{"id":779,"title":"第 321 场周赛","title_slug":"weekly-contest-321","start_time":1669516200,"is_ee_exam_contest":null},"questions":[{"question_id":2485,"title":"找出中枢整数","title_slug":"find-the-pivot-integer","rating":1207.3151378208,"_hash":2384194086,"paid_only":false},{"question_id":2486,"title":"追加字符以获得子序列","title_slug":"append-characters-to-string-to-make-subsequence","rating":1362.7144100401,"_hash":282802217,"paid_only":false},{"question_id":2487,"title":"从链表中移除节点","title_slug":"remove-nodes-from-linked-list","rating":1454.5942017003,"_hash":3911303073,"paid_only":false},{"question_id":2488,"title":"统计中位数为 K 的子数组","title_slug":"count-subarrays-with-median-k","rating":1998.889914712,"_hash":2631420913,"paid_only":false}],"company":{}},{"contest":{"id":776,"title":"第 92 场双周赛","title_slug":"biweekly-contest-92","start_time":1669473000,"is_ee_exam_contest":null},"questions":[{"question_id":2481,"title":"分割圆的最少切割次数","title_slug":"minimum-cuts-to-divide-a-circle","rating":1246.0341186297,"_hash":2329981708,"paid_only":false},{"question_id":2482,"title":"行和列中一和零的差值","title_slug":"difference-between-ones-and-zeros-in-row-and-column","rating":1372.5139179378,"_hash":61296851,"paid_only":false},{"question_id":2483,"title":"商店的最少代价","title_slug":"minimum-penalty-for-a-shop","rating":1494.500749598,"_hash":480223586,"paid_only":false},{"question_id":2484,"title":"统计回文子序列数目","title_slug":"count-palindromic-subsequences","rating":2223.1762282199,"_hash":924129852,"paid_only":false}],"company":{}},{"contest":{"id":777,"title":"第 320 场周赛","title_slug":"weekly-contest-320","start_time":1668911400,"is_ee_exam_contest":null},"questions":[{"question_id":2475,"title":"数组中不等三元组的数目","title_slug":"number-of-unequal-triplets-in-array","rating":1255.5461825223,"_hash":1497402060,"paid_only":false},{"question_id":2476,"title":"二叉搜索树最近节点查询","title_slug":"closest-nodes-queries-in-a-binary-search-tree","rating":1596.9852244916,"_hash":2732657659,"paid_only":false},{"question_id":2477,"title":"到达首都的最少油耗","title_slug":"minimum-fuel-cost-to-report-to-the-capital","rating":2011.9703133514,"_hash":340860484,"paid_only":false},{"question_id":2478,"title":"完美分割的方案数","title_slug":"number-of-beautiful-partitions","rating":2344.3664724791,"_hash":1069956724,"paid_only":false}],"company":{}},{"contest":{"id":773,"title":"第 319 场周赛","title_slug":"weekly-contest-319","start_time":1668306600,"is_ee_exam_contest":null},"questions":[{"question_id":2469,"title":"温度转换","title_slug":"convert-the-temperature","rating":1153.427255962,"_hash":1614249365,"paid_only":false},{"question_id":2470,"title":"最小公倍数为 K 的子数组数目","title_slug":"number-of-subarrays-with-lcm-equal-to-k","rating":1559.9709348417,"_hash":2715109000,"paid_only":false},{"question_id":2471,"title":"逐层排序二叉树所需的最少操作数目","title_slug":"minimum-number-of-operations-to-sort-a-binary-tree-by-level","rating":1635.1520858279,"_hash":629883391,"paid_only":false},{"question_id":2472,"title":"不重叠回文子字符串的最大数目","title_slug":"maximum-number-of-non-overlapping-palindrome-substrings","rating":2013.4354344791,"_hash":3513036702,"paid_only":false}],"company":{}},{"contest":{"id":770,"title":"第 91 场双周赛","title_slug":"biweekly-contest-91","start_time":1668263400,"is_ee_exam_contest":null},"questions":[{"question_id":2465,"title":"不同的平均值数目","title_slug":"number-of-distinct-averages","rating":1250.0975318308,"_hash":2621480860,"paid_only":false},{"question_id":2466,"title":"统计构造好字符串的方案数","title_slug":"count-ways-to-build-good-strings","rating":1694.4308657594,"_hash":4245137983,"paid_only":false},{"question_id":2467,"title":"树上最大得分和路径","title_slug":"most-profitable-path-in-a-tree","rating":2053.354609292,"_hash":2422423692,"paid_only":false},{"question_id":2468,"title":"根据限制分割消息","title_slug":"split-message-based-on-limit","rating":2381.6019709166,"_hash":4257560677,"paid_only":false}],"company":{}},{"contest":{"id":771,"title":"第 318 场周赛","title_slug":"weekly-contest-318","start_time":1667701800,"is_ee_exam_contest":null},"questions":[{"question_id":2460,"title":"对数组执行操作","title_slug":"apply-operations-to-an-array","rating":1223.9335618833,"_hash":389978318,"paid_only":false},{"question_id":2461,"title":"长度为 K 子数组中的最大和","title_slug":"maximum-sum-of-distinct-subarrays-with-length-k","rating":1552.8935571247,"_hash":3738097801,"paid_only":false},{"question_id":2462,"title":"雇佣 K 位工人的总代价","title_slug":"total-cost-to-hire-k-workers","rating":1763.6404758359,"_hash":2730930360,"paid_only":false},{"question_id":2463,"title":"最小移动总距离","title_slug":"minimum-total-distance-traveled","rating":2453.9054896968,"_hash":169260234,"paid_only":false}],"company":{}},{"contest":{"id":767,"title":"第 317 场周赛","title_slug":"weekly-contest-317","start_time":1667097000,"is_ee_exam_contest":null},"questions":[{"question_id":2455,"title":"可被三整除的偶数的平均值","title_slug":"average-value-of-even-numbers-that-are-divisible-by-three","rating":1151.2537511408,"_hash":1001722740,"paid_only":false},{"question_id":2456,"title":"最流行的视频创作者","title_slug":"most-popular-video-creator","rating":1548.1751146981,"_hash":3143101757,"paid_only":false},{"question_id":2457,"title":"美丽整数的最小增量","title_slug":"minimum-addition-to-make-integer-beautiful","rating":1680.0815931601,"_hash":2889905668,"paid_only":false},{"question_id":2458,"title":"移除子树后的二叉树高度","title_slug":"height-of-binary-tree-after-subtree-removal-queries","rating":2298.6242048519,"_hash":4116532905,"paid_only":false}],"company":{}},{"contest":{"id":763,"title":"第 90 场双周赛","title_slug":"biweekly-contest-90","start_time":1667053800,"is_ee_exam_contest":null},"questions":[{"question_id":2451,"title":"差值数组不同的字符串","title_slug":"odd-string-difference","rating":1406.1279714442,"_hash":1571048900,"paid_only":false},{"question_id":2452,"title":"距离字典两次编辑以内的单词","title_slug":"words-within-two-edits-of-dictionary","rating":1459.7513584849,"_hash":1616359180,"paid_only":false},{"question_id":2453,"title":"摧毁一系列目标","title_slug":"destroy-sequential-targets","rating":1761.9162628125,"_hash":3946751496,"paid_only":false},{"question_id":2454,"title":"下一个更大元素 IV","title_slug":"next-greater-element-iv","rating":2175.1190473433,"_hash":2368071046,"paid_only":false}],"company":{}},{"contest":{"id":764,"title":"第 316 场周赛","title_slug":"weekly-contest-316","start_time":1666492200,"is_ee_exam_contest":null},"questions":[{"question_id":2446,"title":"判断两个事件是否存在冲突","title_slug":"determine-if-two-events-have-conflict","rating":1322.3886921778,"_hash":735587531,"paid_only":false},{"question_id":2447,"title":"最大公因数等于 K 的子数组数目","title_slug":"number-of-subarrays-with-gcd-equal-to-k","rating":1602.7742849665,"_hash":4162714270,"paid_only":false},{"question_id":2448,"title":"使数组相等的最小开销","title_slug":"minimum-cost-to-make-array-equal","rating":2005.3737929084,"_hash":1689171801,"paid_only":false},{"question_id":2449,"title":"使数组相似的最少操作次数","title_slug":"minimum-number-of-operations-to-make-arrays-similar","rating":2076.0155978787,"_hash":3679518604,"paid_only":false}],"company":{}},{"contest":{"id":759,"title":"第 315 场周赛","title_slug":"weekly-contest-315","start_time":1665887400,"is_ee_exam_contest":null},"questions":[{"question_id":2441,"title":"与对应负数同时存在的最大正整数","title_slug":"largest-positive-integer-that-exists-with-its-negative","rating":1167.647122501,"_hash":3779169819,"paid_only":false},{"question_id":2442,"title":"反转之后不同整数的数目","title_slug":"count-number-of-distinct-integers-after-reverse-operations","rating":1218.9011436003,"_hash":2907477166,"paid_only":false},{"question_id":2443,"title":"反转之后的数字和","title_slug":"sum-of-number-and-its-reverse","rating":1376.0047008182,"_hash":3835566276,"paid_only":false},{"question_id":2444,"title":"统计定界子数组的数目","title_slug":"count-subarrays-with-fixed-bounds","rating":2092.5366031561,"_hash":3820908739,"paid_only":false}],"company":{}},{"contest":{"id":755,"title":"第 89 场双周赛","title_slug":"biweekly-contest-89","start_time":1665844200,"is_ee_exam_contest":null},"questions":[{"question_id":2437,"title":"有效时间的数目","title_slug":"number-of-valid-clock-times","rating":1426.9800910361,"_hash":4095621901,"paid_only":false},{"question_id":2438,"title":"二的幂数组中查询范围内的乘积","title_slug":"range-product-queries-of-powers","rating":1609.7858209851,"_hash":2397274802,"paid_only":false},{"question_id":2439,"title":"最小化数组中的最大值","title_slug":"minimize-maximum-of-array","rating":1965.1266122355,"_hash":938263064,"paid_only":false},{"question_id":2440,"title":"创建价值相同的连通块","title_slug":"create-components-with-same-value","rating":2460.3152437576,"_hash":2080495144,"paid_only":false}],"company":{}},{"contest":{"id":756,"title":"第 314 场周赛","title_slug":"weekly-contest-314","start_time":1665282600,"is_ee_exam_contest":null},"questions":[{"question_id":2432,"title":"处理用时最长的那个任务的员工","title_slug":"the-employee-that-worked-on-the-longest-task","rating":1266.7001363197,"_hash":4113058721,"paid_only":false},{"question_id":2433,"title":"找出前缀异或的原始数组","title_slug":"find-the-original-array-of-prefix-xor","rating":1366.6789652398,"_hash":883396381,"paid_only":false},{"question_id":2434,"title":"使用机器人打印字典序最小的字符串","title_slug":"using-a-robot-to-print-the-lexicographically-smallest-string","rating":1953.137726744,"_hash":3067908479,"paid_only":false},{"question_id":2435,"title":"矩阵中和能被 K 整除的路径","title_slug":"paths-in-matrix-whose-sum-is-divisible-by-k","rating":1951.5918682146,"_hash":3930025215,"paid_only":false}],"company":{}},{"contest":{"id":750,"title":"第 313 场周赛","title_slug":"weekly-contest-313","start_time":1664677800,"is_ee_exam_contest":null},"questions":[{"question_id":2427,"title":"公因子的数目","title_slug":"number-of-common-factors","rating":1172.0548998046,"_hash":1853208613,"paid_only":false},{"question_id":2428,"title":"沙漏的最大总和","title_slug":"maximum-sum-of-an-hourglass","rating":1289.945159062,"_hash":3528330030,"paid_only":false},{"question_id":2429,"title":"最小异或","title_slug":"minimize-xor","rating":1532.3349133769,"_hash":2645404069,"paid_only":false},{"question_id":2430,"title":"对字母串可执行的最大删除数","title_slug":"maximum-deletions-on-a-string","rating":2101.867342004,"_hash":670519393,"paid_only":false}],"company":{}},{"contest":{"id":745,"title":"第 88 场双周赛","title_slug":"biweekly-contest-88","start_time":1664634600,"is_ee_exam_contest":null},"questions":[{"question_id":2423,"title":"删除字符使频率相同","title_slug":"remove-letter-to-equalize-frequency","rating":1648.3540381514,"_hash":2197356984,"paid_only":false},{"question_id":2424,"title":"最长上传前缀","title_slug":"longest-uploaded-prefix","rating":1604.1602280047,"_hash":718987035,"paid_only":false},{"question_id":2425,"title":"所有数对的异或和","title_slug":"bitwise-xor-of-all-pairings","rating":1622.3970914116,"_hash":3786781582,"paid_only":false},{"question_id":2426,"title":"满足不等式的数对数目","title_slug":"number-of-pairs-satisfying-inequality","rating":2030.1021023033,"_hash":1785363546,"paid_only":false}],"company":{}},{"contest":{"id":746,"title":"第 312 场周赛","title_slug":"weekly-contest-312","start_time":1664073000,"is_ee_exam_contest":null},"questions":[{"question_id":2418,"title":"按身高排序","title_slug":"sort-the-people","rating":1193.0585534828,"_hash":4022402413,"paid_only":false},{"question_id":2419,"title":"按位与最大的最长子数组","title_slug":"longest-subarray-with-maximum-bitwise-and","rating":1495.5180147817,"_hash":119361315,"paid_only":false},{"question_id":2420,"title":"找到所有好下标","title_slug":"find-all-good-indices","rating":1695.0815222626,"_hash":3422315602,"paid_only":false},{"question_id":2421,"title":"好路径的数目","title_slug":"number-of-good-paths","rating":2444.6660756903,"_hash":2335420481,"paid_only":false}],"company":{}},{"contest":{"id":741,"title":"第 311 场周赛","title_slug":"weekly-contest-311","start_time":1663468200,"is_ee_exam_contest":null},"questions":[{"question_id":2413,"title":"最小偶倍数","title_slug":"smallest-even-multiple","rating":1144.9508874557,"_hash":3078609754,"paid_only":false},{"question_id":2414,"title":"最长的字母序连续子字符串的长度","title_slug":"length-of-the-longest-alphabetical-continuous-substring","rating":1221.8477681772,"_hash":3354310865,"paid_only":false},{"question_id":2415,"title":"反转二叉树的奇数层","title_slug":"reverse-odd-levels-of-binary-tree","rating":1431.0523656241,"_hash":1420390570,"paid_only":false},{"question_id":2416,"title":"字符串的前缀分数和","title_slug":"sum-of-prefix-scores-of-strings","rating":1725.1995150882,"_hash":2425741756,"paid_only":false}],"company":{}},{"contest":{"id":703,"title":"第 87 场双周赛","title_slug":"biweekly-contest-87","start_time":1663425000,"is_ee_exam_contest":null},"questions":[{"question_id":2409,"title":"统计共同度过的日子数","title_slug":"count-days-spent-together","rating":1562.0956544608,"_hash":3761575610,"paid_only":false},{"question_id":2410,"title":"运动员和训练师的最大匹配数","title_slug":"maximum-matching-of-players-with-trainers","rating":1381.0888968455,"_hash":3736843920,"paid_only":false},{"question_id":2411,"title":"按位或最大的最小子数组长度","title_slug":"smallest-subarrays-with-maximum-bitwise-or","rating":1938.0586460002,"_hash":1975607113,"paid_only":false},{"question_id":2412,"title":"完成所有交易的初始最少钱数","title_slug":"minimum-money-required-before-transactions","rating":2092.0222850837,"_hash":2719065978,"paid_only":false}],"company":{}},{"contest":{"id":704,"title":"第 310 场周赛","title_slug":"weekly-contest-310","start_time":1662863400,"is_ee_exam_contest":null},"questions":[{"question_id":2404,"title":"出现最频繁的偶数元素","title_slug":"most-frequent-even-element","rating":1259.3406231708,"_hash":484484283,"paid_only":false},{"question_id":2405,"title":"子字符串的最优划分","title_slug":"optimal-partition-of-string","rating":1355.3956434989,"_hash":569962978,"paid_only":false},{"question_id":2406,"title":"将区间分为最少组数","title_slug":"divide-intervals-into-minimum-number-of-groups","rating":1713.3954468582,"_hash":1620554900,"paid_only":false},{"question_id":2407,"title":"最长递增子序列 II","title_slug":"longest-increasing-subsequence-ii","rating":2280.3143643878,"_hash":1567110694,"paid_only":false}],"company":{}},{"contest":{"id":693,"title":"第 309 场周赛","title_slug":"weekly-contest-309","start_time":1662258600,"is_ee_exam_contest":null},"questions":[{"question_id":2399,"title":"检查相同字母间的距离","title_slug":"check-distances-between-same-letters","rating":1243.6250741657,"_hash":1515775640,"paid_only":false},{"question_id":2400,"title":"恰好移动 k 步到达某一位置的方法数目","title_slug":"number-of-ways-to-reach-a-position-after-exactly-k-steps","rating":1751.115625465,"_hash":3867293007,"paid_only":false},{"question_id":2401,"title":"最长优雅子数组","title_slug":"longest-nice-subarray","rating":1749.5432375672,"_hash":3355469687,"paid_only":false},{"question_id":2402,"title":"会议室 III","title_slug":"meeting-rooms-iii","rating":2092.8943149547,"_hash":910590803,"paid_only":false}],"company":{}},{"contest":{"id":688,"title":"第 86 场双周赛","title_slug":"biweekly-contest-86","start_time":1662215400,"is_ee_exam_contest":null},"questions":[{"question_id":2395,"title":"和相等的子数组","title_slug":"find-subarrays-with-equal-sum","rating":1249.8425270142,"_hash":2578600625,"paid_only":false},{"question_id":2396,"title":"严格回文的数字","title_slug":"strictly-palindromic-number","rating":1328.5499677186,"_hash":111167904,"paid_only":false},{"question_id":2397,"title":"被列覆盖的最多行数","title_slug":"maximum-rows-covered-by-columns","rating":1718.8256321624,"_hash":1913049602,"paid_only":false},{"question_id":2398,"title":"预算内的最多机器人数目","title_slug":"maximum-number-of-robots-within-budget","rating":1917.2145829853,"_hash":1856172895,"paid_only":false}],"company":{}},{"contest":{"id":689,"title":"第 308 场周赛","title_slug":"weekly-contest-308","start_time":1661653800,"is_ee_exam_contest":null},"questions":[{"question_id":2389,"title":"和有限的最长子序列","title_slug":"longest-subsequence-with-limited-sum","rating":1387.7347071166,"_hash":2775344327,"paid_only":false},{"question_id":2390,"title":"从字符串中移除星号","title_slug":"removing-stars-from-a-string","rating":1347.8521638635,"_hash":917372483,"paid_only":false},{"question_id":2391,"title":"收集垃圾的最少总时间","title_slug":"minimum-amount-of-time-to-collect-garbage","rating":1455.8516200241,"_hash":2833491097,"paid_only":false},{"question_id":2392,"title":"给定条件下构造矩阵","title_slug":"build-a-matrix-with-conditions","rating":1960.5517123728,"_hash":700466705,"paid_only":false}],"company":{}},{"contest":{"id":671,"title":"第 307 场周赛","title_slug":"weekly-contest-307","start_time":1661049000,"is_ee_exam_contest":null},"questions":[{"question_id":2383,"title":"赢得比赛需要的最少训练时长","title_slug":"minimum-hours-of-training-to-win-a-competition","rating":1413.4238697034,"_hash":1542173395,"paid_only":false},{"question_id":2384,"title":"最大回文数字","title_slug":"largest-palindromic-number","rating":1636.47322627,"_hash":70049056,"paid_only":false},{"question_id":2385,"title":"感染二叉树需要的总时间","title_slug":"amount-of-time-for-binary-tree-to-be-infected","rating":1711.4873176824,"_hash":2321913205,"paid_only":false},{"question_id":2386,"title":"找出数组的第 K 大和","title_slug":"find-the-k-sum-of-an-array","rating":2647.8258771458,"_hash":2945726008,"paid_only":false}],"company":{}},{"contest":{"id":668,"title":"第 85 场双周赛","title_slug":"biweekly-contest-85","start_time":1661005800,"is_ee_exam_contest":null},"questions":[{"question_id":2379,"title":"得到 K 个黑块的最少涂色次数","title_slug":"minimum-recolors-to-get-k-consecutive-black-blocks","rating":1360.0511262593,"_hash":2333659184,"paid_only":false},{"question_id":2380,"title":"二进制字符串重新安排顺序需要的时间","title_slug":"time-needed-to-rearrange-a-binary-string","rating":1481.1046340847,"_hash":147891676,"paid_only":false},{"question_id":2381,"title":"字母移位 II","title_slug":"shifting-letters-ii","rating":1793.3037316825,"_hash":2012982950,"paid_only":false},{"question_id":2382,"title":"删除操作后的最大子段和","title_slug":"maximum-segment-sum-after-removals","rating":2136.3013259524,"_hash":746573214,"paid_only":false}],"company":{}},{"contest":{"id":669,"title":"第 306 场周赛","title_slug":"weekly-contest-306","start_time":1660444200,"is_ee_exam_contest":null},"questions":[{"question_id":2373,"title":"矩阵中的局部最大值","title_slug":"largest-local-values-in-a-matrix","rating":1331.3935128035,"_hash":3553057842,"paid_only":false},{"question_id":2374,"title":"边积分最高的节点","title_slug":"node-with-highest-edge-score","rating":1418.9758090724,"_hash":1078280786,"paid_only":false},{"question_id":2375,"title":"根据模式串构造最小数字","title_slug":"construct-smallest-number-from-di-string","rating":1641.9424376927,"_hash":2914198967,"paid_only":false},{"question_id":2376,"title":"统计特殊整数","title_slug":"count-special-integers","rating":2120.4466386371,"_hash":4197747162,"paid_only":false}],"company":{}},{"contest":{"id":663,"title":"第 305 场周赛","title_slug":"weekly-contest-305","start_time":1659839400,"is_ee_exam_contest":null},"questions":[{"question_id":2367,"title":"算术三元组的数目","title_slug":"number-of-arithmetic-triplets","rating":1203.0737869081,"_hash":2088822497,"paid_only":false},{"question_id":2368,"title":"受限条件下可到达节点的数目","title_slug":"reachable-nodes-with-restrictions","rating":1476.9118898539,"_hash":4092227797,"paid_only":false},{"question_id":2369,"title":"检查数组是否存在有效划分","title_slug":"check-if-there-is-a-valid-partition-for-the-array","rating":1779.7001728541,"_hash":3555784215,"paid_only":false},{"question_id":2370,"title":"最长理想子序列","title_slug":"longest-ideal-subsequence","rating":1834.868034709,"_hash":3336959867,"paid_only":false}],"company":{}},{"contest":{"id":658,"title":"第 84 场双周赛","title_slug":"biweekly-contest-84","start_time":1659796200,"is_ee_exam_contest":null},"questions":[{"question_id":2363,"title":"合并相似的物品","title_slug":"merge-similar-items","rating":1270.6712381632,"_hash":556825118,"paid_only":false},{"question_id":2364,"title":"统计坏数对的数目","title_slug":"count-number-of-bad-pairs","rating":1622.2389577197,"_hash":809508462,"paid_only":false},{"question_id":2365,"title":"任务调度器 II","title_slug":"task-scheduler-ii","rating":1622.7743864401,"_hash":3978152897,"paid_only":false},{"question_id":2366,"title":"将数组排序的最少替换次数","title_slug":"minimum-replacements-to-sort-the-array","rating":2060.379991517,"_hash":3435556540,"paid_only":false}],"company":{}},{"contest":{"id":659,"title":"第 304 场周赛","title_slug":"weekly-contest-304","start_time":1659234600,"is_ee_exam_contest":null},"questions":[{"question_id":2357,"title":"使数组中所有元素都等于零","title_slug":"make-array-zero-by-subtracting-equal-amounts","rating":1225.3923012413,"_hash":1650421130,"paid_only":false},{"question_id":2358,"title":"分组的最大数量","title_slug":"maximum-number-of-groups-entering-a-competition","rating":1502.5363677723,"_hash":419099305,"paid_only":false},{"question_id":2359,"title":"找到离给定两个节点最近的节点","title_slug":"find-closest-node-to-given-two-nodes","rating":1714.992763701,"_hash":1024461884,"paid_only":false},{"question_id":2360,"title":"图中的最长环","title_slug":"longest-cycle-in-a-graph","rating":1897.1863301576,"_hash":218781353,"paid_only":false}],"company":{}},{"contest":{"id":655,"title":"第 303 场周赛","title_slug":"weekly-contest-303","start_time":1658629800,"is_ee_exam_contest":null},"questions":[{"question_id":2351,"title":"第一个出现两次的字母","title_slug":"first-letter-to-appear-twice","rating":1155.4545579447,"_hash":2515340929,"paid_only":false},{"question_id":2352,"title":"相等行列对","title_slug":"equal-row-and-column-pairs","rating":1286.3841359213,"_hash":80255331,"paid_only":false},{"question_id":2353,"title":"设计食物评分系统","title_slug":"design-a-food-rating-system","rating":1781.8156963676,"_hash":3907541820,"paid_only":false},{"question_id":2354,"title":"优质数对的数目","title_slug":"number-of-excellent-pairs","rating":2075.9046975409,"_hash":3803787289,"paid_only":false}],"company":{}},{"contest":{"id":652,"title":"第 83 场双周赛","title_slug":"biweekly-contest-83","start_time":1658586600,"is_ee_exam_contest":null},"questions":[{"question_id":2347,"title":"最好的扑克手牌","title_slug":"best-poker-hand","rating":1241.5645130241,"_hash":3960620247,"paid_only":false},{"question_id":2348,"title":"全 0 子数组的数目","title_slug":"number-of-zero-filled-subarrays","rating":1315.8569286597,"_hash":1385231803,"paid_only":false},{"question_id":2349,"title":"设计数字容器系统","title_slug":"design-a-number-container-system","rating":1540.2351411176,"_hash":2500271603,"paid_only":false},{"question_id":2350,"title":"不可能得到的最短骰子序列","title_slug":"shortest-impossible-sequence-of-rolls","rating":1960.5763266754,"_hash":3898582486,"paid_only":false}],"company":{}},{"contest":{"id":653,"title":"第 302 场周赛","title_slug":"weekly-contest-302","start_time":1658025000,"is_ee_exam_contest":null},"questions":[{"question_id":2341,"title":"数组能形成多少数对","title_slug":"maximum-number-of-pairs-in-array","rating":1184.795721284,"_hash":2572867035,"paid_only":false},{"question_id":2342,"title":"数位和相等数对的最大和","title_slug":"max-sum-of-a-pair-with-equal-sum-of-digits","rating":1308.9617729374,"_hash":2147986859,"paid_only":false},{"question_id":2343,"title":"裁剪数字后查询第 K 小的数字","title_slug":"query-kth-smallest-trimmed-number","rating":1651.569267834,"_hash":3981013694,"paid_only":false},{"question_id":2344,"title":"使数组可以被整除的最少删除次数","title_slug":"minimum-deletions-to-make-array-divisible","rating":1640.8976042503,"_hash":1620091732,"paid_only":false}],"company":{}},{"contest":{"id":649,"title":"第 301 场周赛","title_slug":"weekly-contest-301","start_time":1657420200,"is_ee_exam_contest":null},"questions":[{"question_id":2335,"title":"装满杯子需要的最短总时长","title_slug":"minimum-amount-of-time-to-fill-cups","rating":1360.421258727,"_hash":2855675520,"paid_only":false},{"question_id":2336,"title":"无限集中的最小数字","title_slug":"smallest-number-in-infinite-set","rating":1375.0376362104,"_hash":1742391300,"paid_only":false},{"question_id":2337,"title":"移动片段得到字符串","title_slug":"move-pieces-to-obtain-a-string","rating":1693.4495728383,"_hash":255657392,"paid_only":false},{"question_id":2338,"title":"统计理想数组的数目","title_slug":"count-the-number-of-ideal-arrays","rating":2615.1468269481,"_hash":2648057035,"paid_only":false}],"company":{}},{"contest":{"id":646,"title":"第 82 场双周赛","title_slug":"biweekly-contest-82","start_time":1657377000,"is_ee_exam_contest":null},"questions":[{"question_id":2331,"title":"计算布尔二叉树的值","title_slug":"evaluate-boolean-binary-tree","rating":1303.5594588137,"_hash":586474794,"paid_only":false},{"question_id":2332,"title":"坐上公交的最晚时间","title_slug":"the-latest-time-to-catch-a-bus","rating":1840.9122452886,"_hash":572276699,"paid_only":false},{"question_id":2333,"title":"最小差值平方和","title_slug":"minimum-sum-of-squared-difference","rating":2011.0496162515,"_hash":374180471,"paid_only":false},{"question_id":2334,"title":"元素值大于变化阈值的子数组","title_slug":"subarray-with-elements-greater-than-varying-threshold","rating":2381.2160234811,"_hash":265213405,"paid_only":false}],"company":{}},{"contest":{"id":647,"title":"第 300 场周赛","title_slug":"weekly-contest-300","start_time":1656815400,"is_ee_exam_contest":null},"questions":[{"question_id":2325,"title":"解密消息","title_slug":"decode-the-message","rating":1268.0287696194,"_hash":280396343,"paid_only":false},{"question_id":2326,"title":"螺旋矩阵 IV","title_slug":"spiral-matrix-iv","rating":1421.7251191403,"_hash":1599758478,"paid_only":false},{"question_id":2327,"title":"知道秘密的人数","title_slug":"number-of-people-aware-of-a-secret","rating":1893.5143805402,"_hash":1370775302,"paid_only":false},{"question_id":2328,"title":"网格图中递增路径的数目","title_slug":"number-of-increasing-paths-in-a-grid","rating":2001.2074132383,"_hash":2560027362,"paid_only":false}],"company":{}},{"contest":{"id":618,"title":"第 299 场周赛","title_slug":"weekly-contest-299","start_time":1656210600,"is_ee_exam_contest":null},"questions":[{"question_id":2319,"title":"判断矩阵是否是一个 X 矩阵","title_slug":"check-if-matrix-is-x-matrix","rating":1200.9464053417,"_hash":3722557865,"paid_only":false},{"question_id":2320,"title":"统计放置房子的方式数","title_slug":"count-number-of-ways-to-place-houses","rating":1607.7036437819,"_hash":2375816517,"paid_only":false},{"question_id":2321,"title":"拼接数组的最大分数","title_slug":"maximum-score-of-spliced-array","rating":1790.5747006625,"_hash":3565117549,"paid_only":false},{"question_id":2322,"title":"从树中删除边的最小分数","title_slug":"minimum-score-after-removals-on-a-tree","rating":2391.657270733,"_hash":2618637580,"paid_only":false}],"company":{}},{"contest":{"id":614,"title":"第 81 场双周赛","title_slug":"biweekly-contest-81","start_time":1656167400,"is_ee_exam_contest":null},"questions":[{"question_id":2315,"title":"统计星号","title_slug":"count-asterisks","rating":1250.8974254752,"_hash":963523596,"paid_only":false},{"question_id":2316,"title":"统计无向图中无法互相到达点对数","title_slug":"count-unreachable-pairs-of-nodes-in-an-undirected-graph","rating":1604.0695445163,"_hash":3627963576,"paid_only":false},{"question_id":2317,"title":"操作后的最大异或和","title_slug":"maximum-xor-after-operations","rating":1678.6241816708,"_hash":1137942707,"paid_only":false},{"question_id":2318,"title":"不同骰子序列的数目","title_slug":"number-of-distinct-roll-sequences","rating":2090.4183788498,"_hash":3973609032,"paid_only":false}],"company":{}},{"contest":{"id":615,"title":"第 298 场周赛","title_slug":"weekly-contest-298","start_time":1655605800,"is_ee_exam_contest":null},"questions":[{"question_id":2309,"title":"兼具大小写的最好英文字母","title_slug":"greatest-english-letter-in-upper-and-lower-case","rating":1242.8939284628,"_hash":1610031866,"paid_only":false},{"question_id":2310,"title":"个位数字为 K 的整数之和","title_slug":"sum-of-numbers-with-units-digit-k","rating":1558.9522968448,"_hash":3729897578,"paid_only":false},{"question_id":2311,"title":"小于等于 K 的最长二进制子序列","title_slug":"longest-binary-subsequence-less-than-or-equal-to-k","rating":1839.9203623221,"_hash":1903617238,"paid_only":false},{"question_id":2312,"title":"卖木头块","title_slug":"selling-pieces-of-wood","rating":2363.0240184484,"_hash":915449177,"paid_only":false}],"company":{}},{"contest":{"id":611,"title":"第 297 场周赛","title_slug":"weekly-contest-297","start_time":1655001000,"is_ee_exam_contest":null},"questions":[{"question_id":2303,"title":"计算应缴税款总额","title_slug":"calculate-amount-paid-in-taxes","rating":1283.6412252736,"_hash":4065089853,"paid_only":false},{"question_id":2304,"title":"网格中的最小路径代价","title_slug":"minimum-path-cost-in-a-grid","rating":1658.3530344788,"_hash":730943544,"paid_only":false},{"question_id":2305,"title":"公平分发饼干","title_slug":"fair-distribution-of-cookies","rating":1886.7040111218,"_hash":3444975876,"paid_only":false},{"question_id":2306,"title":"公司命名","title_slug":"naming-a-company","rating":2305.4498281454,"_hash":3802076349,"paid_only":false}],"company":{}},{"contest":{"id":608,"title":"第 80 场双周赛","title_slug":"biweekly-contest-80","start_time":1654957800,"is_ee_exam_contest":null},"questions":[{"question_id":2299,"title":"强密码检验器 II","title_slug":"strong-password-checker-ii","rating":1241.5396695569,"_hash":2569057399,"paid_only":false},{"question_id":2300,"title":"咒语和药水的成功对数","title_slug":"successful-pairs-of-spells-and-potions","rating":1476.9062320302,"_hash":4067072856,"paid_only":false},{"question_id":2301,"title":"替换字符后匹配","title_slug":"match-substring-after-replacement","rating":1860.5166780235,"_hash":2777743854,"paid_only":false},{"question_id":2302,"title":"统计得分小于 K 的子数组数目","title_slug":"count-subarrays-with-score-less-than-k","rating":1808.3407696613,"_hash":1464742605,"paid_only":false}],"company":{}},{"contest":{"id":609,"title":"第 296 场周赛","title_slug":"weekly-contest-296","start_time":1654396200,"is_ee_exam_contest":null},"questions":[{"question_id":2293,"title":"极大极小游戏","title_slug":"min-max-game","rating":1241.0825147417,"_hash":399050701,"paid_only":false},{"question_id":2294,"title":"划分数组使最大差为 K","title_slug":"partition-array-such-that-maximum-difference-is-k","rating":1416.4124723866,"_hash":3430688223,"paid_only":false},{"question_id":2295,"title":"替换数组中的元素","title_slug":"replace-elements-in-an-array","rating":1445.1422945604,"_hash":4058134239,"paid_only":false},{"question_id":2296,"title":"设计一个文本编辑器","title_slug":"design-a-text-editor","rating":1911.8282317986,"_hash":536229655,"paid_only":false}],"company":{}},{"contest":{"id":605,"title":"第 295 场周赛","title_slug":"weekly-contest-295","start_time":1653791400,"is_ee_exam_contest":null},"questions":[{"question_id":2287,"title":"重排字符形成目标字符串","title_slug":"rearrange-characters-to-make-target-string","rating":1299.8393735643,"_hash":4027356240,"paid_only":false},{"question_id":2288,"title":"价格减免","title_slug":"apply-discount-to-prices","rating":1577.1141767118,"_hash":1512857430,"paid_only":false},{"question_id":2289,"title":"使数组按非递减顺序排列","title_slug":"steps-to-make-array-non-decreasing","rating":2481.8722909195,"_hash":188352287,"paid_only":false},{"question_id":2290,"title":"到达角落需要移除障碍物的最小数目","title_slug":"minimum-obstacle-removal-to-reach-corner","rating":2137.5633267453,"_hash":4050014828,"paid_only":false}],"company":{}},{"contest":{"id":598,"title":"第 79 场双周赛","title_slug":"biweekly-contest-79","start_time":1653748200,"is_ee_exam_contest":null},"questions":[{"question_id":2283,"title":"判断一个数的数字计数是否等于数位的值","title_slug":"check-if-number-has-equal-digit-count-and-digit-value","rating":1253.4847783954,"_hash":84450131,"paid_only":false},{"question_id":2284,"title":"最多单词数的发件人","title_slug":"sender-with-largest-word-count","rating":1346.9594471871,"_hash":2321482871,"paid_only":false},{"question_id":2285,"title":"道路的最大总重要性","title_slug":"maximum-total-importance-of-roads","rating":1496.2502937005,"_hash":3248412457,"paid_only":false},{"question_id":2286,"title":"以组为单位订音乐会的门票","title_slug":"booking-concert-tickets-in-groups","rating":2470.2118194809,"_hash":3907062892,"paid_only":false}],"company":{}},{"contest":{"id":599,"title":"第 294 场周赛","title_slug":"weekly-contest-294","start_time":1653186600,"is_ee_exam_contest":null},"questions":[{"question_id":2278,"title":"字母在字符串中的百分比","title_slug":"percentage-of-letter-in-string","rating":1161.8236318927,"_hash":2452001178,"paid_only":false},{"question_id":2279,"title":"装满石头的背包的最大数量","title_slug":"maximum-bags-with-full-capacity-of-rocks","rating":1249.2572200035,"_hash":2055099648,"paid_only":false},{"question_id":2280,"title":"表示一个折线图的最少线段数","title_slug":"minimum-lines-to-represent-a-line-chart","rating":1680.866917849,"_hash":1538966566,"paid_only":false},{"question_id":2281,"title":"巫师的总力量和","title_slug":"sum-of-total-strength-of-wizards","rating":2621.1208072273,"_hash":3147772108,"paid_only":false}],"company":{}},{"contest":{"id":593,"title":"第 293 场周赛","title_slug":"weekly-contest-293","start_time":1652581800,"is_ee_exam_contest":null},"questions":[{"question_id":2273,"title":"移除字母异位词后的结果数组","title_slug":"find-resultant-array-after-removing-anagrams","rating":1294.5800368625,"_hash":3731391427,"paid_only":false},{"question_id":2274,"title":"不含特殊楼层的最大连续楼层数","title_slug":"maximum-consecutive-floors-without-special-floors","rating":1332.6187879411,"_hash":3382549811,"paid_only":false},{"question_id":2275,"title":"按位与结果大于零的最长组合","title_slug":"largest-combination-with-bitwise-and-greater-than-zero","rating":1642.1446933109,"_hash":1729291424,"paid_only":false},{"question_id":2276,"title":"统计区间中的整数数目","title_slug":"count-integers-in-intervals","rating":2222.4805422748,"_hash":113811987,"paid_only":false}],"company":{}},{"contest":{"id":590,"title":"第 78 场双周赛","title_slug":"biweekly-contest-78","start_time":1652538600,"is_ee_exam_contest":null},"questions":[{"question_id":2269,"title":"找到一个数字的 K 美丽值","title_slug":"find-the-k-beauty-of-a-number","rating":1279.7894769956,"_hash":2811209697,"paid_only":false},{"question_id":2270,"title":"分割数组的方案数","title_slug":"number-of-ways-to-split-array","rating":1334.0516779626,"_hash":3778209816,"paid_only":false},{"question_id":2271,"title":"毯子覆盖的最多白色砖块数","title_slug":"maximum-white-tiles-covered-by-a-carpet","rating":2021.7790710467,"_hash":1450266090,"paid_only":false},{"question_id":2272,"title":"最大波动的子字符串","title_slug":"substring-with-largest-variance","rating":2515.7520586008,"_hash":928331770,"paid_only":false}],"company":{}},{"contest":{"id":591,"title":"第 292 场周赛","title_slug":"weekly-contest-292","start_time":1651977000,"is_ee_exam_contest":null},"questions":[{"question_id":2264,"title":"字符串中最大的 3 位相同数字","title_slug":"largest-3-same-digit-number-in-string","rating":1308.948547975,"_hash":1507774284,"paid_only":false},{"question_id":2265,"title":"统计值等于子树平均值的节点数","title_slug":"count-nodes-equal-to-average-of-subtree","rating":1472.7864965062,"_hash":2311001320,"paid_only":false},{"question_id":2266,"title":"统计打字方案数","title_slug":"count-number-of-texts","rating":1856.8610192187,"_hash":590592305,"paid_only":false},{"question_id":2267,"title":"检查是否有合法括号字符串路径","title_slug":"check-if-there-is-a-valid-parentheses-string-path","rating":2084.5752686737,"_hash":1017177635,"paid_only":false}],"company":{}},{"contest":{"id":587,"title":"第 291 场周赛","title_slug":"weekly-contest-291","start_time":1651372200,"is_ee_exam_contest":null},"questions":[{"question_id":2259,"title":"移除指定数字得到的最大结果","title_slug":"remove-digit-from-number-to-maximize-result","rating":1331.5287857686,"_hash":670957801,"paid_only":false},{"question_id":2260,"title":"必须拿起的最小连续卡牌数","title_slug":"minimum-consecutive-cards-to-pick-up","rating":1364.6787168645,"_hash":2520941920,"paid_only":false},{"question_id":2261,"title":"含最多 K 个可整除元素的子数组","title_slug":"k-divisible-elements-subarrays","rating":1724.394164934,"_hash":2169721379,"paid_only":false},{"question_id":2262,"title":"字符串的总引力","title_slug":"total-appeal-of-a-string","rating":2033.1699277531,"_hash":3802833057,"paid_only":false}],"company":{}},{"contest":{"id":581,"title":"第 77 场双周赛","title_slug":"biweekly-contest-77","start_time":1651329000,"is_ee_exam_contest":null},"questions":[{"question_id":2255,"title":"统计是给定字符串前缀的字符串数目","title_slug":"count-prefixes-of-a-given-string","rating":1260.870208308,"_hash":255204169,"paid_only":false},{"question_id":2256,"title":"最小平均差","title_slug":"minimum-average-difference","rating":1394.9149882274,"_hash":4108118731,"paid_only":false},{"question_id":2257,"title":"统计网格图中没有被保卫的格子数","title_slug":"count-unguarded-cells-in-the-grid","rating":1708.7056764058,"_hash":2771270445,"paid_only":false},{"question_id":2258,"title":"逃离火灾","title_slug":"escape-the-spreading-fire","rating":2346.5717839654,"_hash":315307043,"paid_only":false}],"company":{}},{"contest":{"id":582,"title":"第 290 场周赛","title_slug":"weekly-contest-290","start_time":1650767400,"is_ee_exam_contest":null},"questions":[{"question_id":2248,"title":"多个数组求交集","title_slug":"intersection-of-multiple-arrays","rating":1264.4778916192,"_hash":305518406,"paid_only":false},{"question_id":2249,"title":"统计圆内格点数目","title_slug":"count-lattice-points-inside-a-circle","rating":1602.7242171967,"_hash":2887915717,"paid_only":false},{"question_id":2250,"title":"统计包含每个点的矩形数目","title_slug":"count-number-of-rectangles-containing-each-point","rating":1997.7013718153,"_hash":1075971933,"paid_only":false},{"question_id":2251,"title":"花期内花的数目","title_slug":"number-of-flowers-in-full-bloom","rating":2022.3137128296,"_hash":251006919,"paid_only":false}],"company":{}},{"contest":{"id":576,"title":"第 289 场周赛","title_slug":"weekly-contest-289","start_time":1650162600,"is_ee_exam_contest":null},"questions":[{"question_id":2243,"title":"计算字符串的数字和","title_slug":"calculate-digit-sum-of-a-string","rating":1301.9432665133,"_hash":1615798591,"paid_only":false},{"question_id":2244,"title":"完成所有任务需要的最少轮数","title_slug":"minimum-rounds-to-complete-all-tasks","rating":1371.8092952004,"_hash":2786999216,"paid_only":false},{"question_id":2245,"title":"转角路径的乘积中最多能有几个尾随零","title_slug":"maximum-trailing-zeros-in-a-cornered-path","rating":2036.7410194704,"_hash":2369761961,"paid_only":false},{"question_id":2246,"title":"相邻字符不同的最长路径","title_slug":"longest-path-with-different-adjacent-characters","rating":2126.3922279277,"_hash":1523645158,"paid_only":false}],"company":{}},{"contest":{"id":572,"title":"第 76 场双周赛","title_slug":"biweekly-contest-76","start_time":1650119400,"is_ee_exam_contest":null},"questions":[{"question_id":2239,"title":"找到最接近 0 的数字","title_slug":"find-closest-number-to-zero","rating":1256.0514740971,"_hash":334656901,"paid_only":false},{"question_id":2240,"title":"买钢笔和铅笔的方案数","title_slug":"number-of-ways-to-buy-pens-and-pencils","rating":1399.8468905274,"_hash":534082096,"paid_only":false},{"question_id":2241,"title":"设计一个 ATM 机器","title_slug":"design-an-atm-machine","rating":1616.2067360638,"_hash":4007529944,"paid_only":false},{"question_id":2242,"title":"节点序列的最大得分","title_slug":"maximum-score-of-a-node-sequence","rating":2304.3094138939,"_hash":949381873,"paid_only":false}],"company":{}},{"contest":{"id":573,"title":"第 288 场周赛","title_slug":"weekly-contest-288","start_time":1649557800,"is_ee_exam_contest":null},"questions":[{"question_id":2231,"title":"按奇偶性交换后的最大数字","title_slug":"largest-number-after-digit-swaps-by-parity","rating":1365.2269076492,"_hash":2192706389,"paid_only":false},{"question_id":2232,"title":"向表达式添加括号后的最小结果","title_slug":"minimize-result-by-adding-parentheses-to-expression","rating":1611.8434720083,"_hash":989456575,"paid_only":false},{"question_id":2233,"title":"K 次增加后的最大乘积","title_slug":"maximum-product-after-k-increments","rating":1685.5389350949,"_hash":1255527945,"paid_only":false},{"question_id":2234,"title":"花园的最大总美丽值","title_slug":"maximum-total-beauty-of-the-gardens","rating":2561.508149216,"_hash":2719330296,"paid_only":false}],"company":{}},{"contest":{"id":569,"title":"第 287 场周赛","title_slug":"weekly-contest-287","start_time":1648953000,"is_ee_exam_contest":null},"questions":[{"question_id":2224,"title":"转化时间需要的最少操作数","title_slug":"minimum-number-of-operations-to-convert-time","rating":1295.8868965907,"_hash":1749795074,"paid_only":false},{"question_id":2225,"title":"找出输掉零场或一场比赛的玩家","title_slug":"find-players-with-zero-or-one-losses","rating":1316.2046992429,"_hash":1737726232,"paid_only":false},{"question_id":2226,"title":"每个小孩最多能分到多少糖果","title_slug":"maximum-candies-allocated-to-k-children","rating":1646.1765343383,"_hash":2412340751,"paid_only":false},{"question_id":2227,"title":"加密解密字符串","title_slug":"encrypt-and-decrypt-strings","rating":1944.5673996888,"_hash":4089321877,"paid_only":false}],"company":{}},{"contest":{"id":563,"title":"第 75 场双周赛","title_slug":"biweekly-contest-75","start_time":1648909800,"is_ee_exam_contest":null},"questions":[{"question_id":2220,"title":"转换数字的最少位翻转次数","title_slug":"minimum-bit-flips-to-convert-number","rating":1282.1502428906,"_hash":3126153106,"paid_only":false},{"question_id":2221,"title":"数组的三角和","title_slug":"find-triangular-sum-of-an-array","rating":1317.2976846981,"_hash":1783870964,"paid_only":false},{"question_id":2222,"title":"选择建筑的方案数","title_slug":"number-of-ways-to-select-buildings","rating":1656.5588918365,"_hash":469490796,"paid_only":false},{"question_id":2223,"title":"构造字符串的总得分和","title_slug":"sum-of-scores-of-built-strings","rating":2220.0903365738,"_hash":2248507270,"paid_only":false}],"company":{}},{"contest":{"id":564,"title":"第 286 场周赛","title_slug":"weekly-contest-286","start_time":1648348200,"is_ee_exam_contest":null},"questions":[{"question_id":2215,"title":"找出两数组的不同","title_slug":"find-the-difference-of-two-arrays","rating":1207.748239075,"_hash":1409344146,"paid_only":false},{"question_id":2216,"title":"美化数组的最少删除数","title_slug":"minimum-deletions-to-make-array-beautiful","rating":1509.5562928491,"_hash":705189000,"paid_only":false},{"question_id":2217,"title":"找到指定长度的回文数","title_slug":"find-palindrome-with-fixed-length","rating":1822.1301265412,"_hash":2265657217,"paid_only":false},{"question_id":2218,"title":"从栈中取出 K 个硬币的最大面值和","title_slug":"maximum-value-of-k-coins-from-piles","rating":2157.5814371481,"_hash":28373825,"paid_only":false}],"company":{}},{"contest":{"id":558,"title":"第 285 场周赛","title_slug":"weekly-contest-285","start_time":1647743400,"is_ee_exam_contest":null},"questions":[{"question_id":2210,"title":"统计数组中峰和谷的数量","title_slug":"count-hills-and-valleys-in-an-array","rating":1354.5231125217,"_hash":2390584088,"paid_only":false},{"question_id":2211,"title":"统计道路上的碰撞次数","title_slug":"count-collisions-on-a-road","rating":1581.4963716166,"_hash":1582953363,"paid_only":false},{"question_id":2212,"title":"射箭比赛中的最大得分","title_slug":"maximum-points-in-an-archery-competition","rating":1868.9864493463,"_hash":2155229246,"paid_only":false},{"question_id":2213,"title":"由单个字符重复的最长子字符串","title_slug":"longest-substring-of-one-repeating-character","rating":2628.7957821141,"_hash":96141044,"paid_only":false}],"company":{}},{"contest":{"id":554,"title":"第 74 场双周赛","title_slug":"biweekly-contest-74","start_time":1647700200,"is_ee_exam_contest":null},"questions":[{"question_id":2206,"title":"将数组划分成相等数对","title_slug":"divide-array-into-equal-pairs","rating":1223.406570396,"_hash":523951328,"paid_only":false},{"question_id":2207,"title":"字符串中最多数目的子序列","title_slug":"maximize-number-of-subsequences-in-a-string","rating":1550.4297615307,"_hash":2887492330,"paid_only":false},{"question_id":2208,"title":"将数组和减半的最少操作次数","title_slug":"minimum-operations-to-halve-array-sum","rating":1550.0978082682,"_hash":3403473925,"paid_only":false},{"question_id":2209,"title":"用地毯覆盖后的最少白色砖块","title_slug":"minimum-white-tiles-after-covering-with-carpets","rating":2105.8582288624,"_hash":3822669184,"paid_only":false}],"company":{}},{"contest":{"id":555,"title":"第 284 场周赛","title_slug":"weekly-contest-284","start_time":1647138600,"is_ee_exam_contest":null},"questions":[{"question_id":2200,"title":"找出数组中的所有 K 近邻下标","title_slug":"find-all-k-distant-indices-in-an-array","rating":1266.341468955,"_hash":2550811240,"paid_only":false},{"question_id":2201,"title":"统计可以提取的工件","title_slug":"count-artifacts-that-can-be-extracted","rating":1525.2146106195,"_hash":1716625654,"paid_only":false},{"question_id":2202,"title":"K 次操作后最大化顶端元素","title_slug":"maximize-the-topmost-element-after-k-moves","rating":1716.9721777,"_hash":927068521,"paid_only":false},{"question_id":2203,"title":"得到要求路径的最小带权子图","title_slug":"minimum-weighted-subgraph-with-the-required-paths","rating":2364.3455634374,"_hash":237326824,"paid_only":false}],"company":{}},{"contest":{"id":551,"title":"第 283 场周赛","title_slug":"weekly-contest-283","start_time":1646533800,"is_ee_exam_contest":null},"questions":[{"question_id":2194,"title":"Excel 表中某个范围内的单元格","title_slug":"cells-in-a-range-on-an-excel-sheet","rating":1253.1463945043,"_hash":1475483634,"paid_only":false},{"question_id":2195,"title":"向数组中追加 K 个整数","title_slug":"append-k-integers-with-minimal-sum","rating":1658.921022733,"_hash":430788454,"paid_only":false},{"question_id":2196,"title":"根据描述创建二叉树","title_slug":"create-binary-tree-from-descriptions","rating":1643.5283095007,"_hash":4088708677,"paid_only":false},{"question_id":2197,"title":"替换数组中的非互质数","title_slug":"replace-non-coprime-numbers-in-array","rating":2057.4788263111,"_hash":2370755498,"paid_only":false}],"company":{}},{"contest":{"id":545,"title":"第 73 场双周赛","title_slug":"biweekly-contest-73","start_time":1646490600,"is_ee_exam_contest":null},"questions":[{"question_id":2190,"title":"数组中紧跟 key 之后出现最频繁的数字","title_slug":"most-frequent-number-following-key-in-an-array","rating":1289.1912178611,"_hash":3999582587,"paid_only":false},{"question_id":2191,"title":"将杂乱无章的数字排序","title_slug":"sort-the-jumbled-numbers","rating":1496.1462748679,"_hash":2695613806,"paid_only":false},{"question_id":2192,"title":"有向无环图中一个节点的所有祖先","title_slug":"all-ancestors-of-a-node-in-a-directed-acyclic-graph","rating":1787.8550568757,"_hash":1095929141,"paid_only":false},{"question_id":2193,"title":"得到回文串的最少操作次数","title_slug":"minimum-number-of-moves-to-make-palindrome","rating":2090.6800569319,"_hash":4275612953,"paid_only":false}],"company":{}},{"contest":{"id":546,"title":"第 282 场周赛","title_slug":"weekly-contest-282","start_time":1645929000,"is_ee_exam_contest":null},"questions":[{"question_id":2185,"title":"统计包含给定前缀的字符串","title_slug":"counting-words-with-a-given-prefix","rating":1167.1241589729,"_hash":537971944,"paid_only":false},{"question_id":2186,"title":"制造字母异位词的最小步骤数 II","title_slug":"minimum-number-of-steps-to-make-two-strings-anagram-ii","rating":1253.1107481745,"_hash":1067400091,"paid_only":false},{"question_id":2187,"title":"完成旅途的最少时间","title_slug":"minimum-time-to-complete-trips","rating":1640.9591585343,"_hash":306595116,"paid_only":false},{"question_id":2188,"title":"完成比赛的最少时间","title_slug":"minimum-time-to-finish-the-race","rating":2315.0547336936,"_hash":1723985703,"paid_only":false}],"company":{}},{"contest":{"id":542,"title":"第 281 场周赛","title_slug":"weekly-contest-281","start_time":1645324200,"is_ee_exam_contest":null},"questions":[{"question_id":2180,"title":"统计各位数字之和为偶数的整数个数","title_slug":"count-integers-with-even-digit-sum","rating":1257.1166915286,"_hash":267587420,"paid_only":false},{"question_id":2181,"title":"合并零之间的节点","title_slug":"merge-nodes-in-between-zeros","rating":1333.192050397,"_hash":1770113758,"paid_only":false},{"question_id":2182,"title":"构造限制重复的字符串","title_slug":"construct-string-with-repeat-limit","rating":1680.1353258588,"_hash":1950501535,"paid_only":false},{"question_id":2183,"title":"统计可以被 K 整除的下标对数目","title_slug":"count-array-pairs-divisible-by-k","rating":2246.0452639352,"_hash":1351132676,"paid_only":false}],"company":{}},{"contest":{"id":539,"title":"第 72 场双周赛","title_slug":"biweekly-contest-72","start_time":1645281000,"is_ee_exam_contest":null},"questions":[{"question_id":2176,"title":"统计数组中相等且可以被整除的数对","title_slug":"count-equal-and-divisible-pairs-in-an-array","rating":1215.7827321325,"_hash":3400286463,"paid_only":false},{"question_id":2177,"title":"找到和为给定整数的三个连续整数","title_slug":"find-three-consecutive-integers-that-sum-to-a-given-number","rating":1257.1556875655,"_hash":177009894,"paid_only":false},{"question_id":2178,"title":"拆分成最多数目的正偶数之和","title_slug":"maximum-split-of-positive-even-integers","rating":1538.233149704,"_hash":3655265099,"paid_only":false},{"question_id":2179,"title":"统计数组中好三元组数目","title_slug":"count-good-triplets-in-an-array","rating":2272.4412003208,"_hash":286585708,"paid_only":false}],"company":{}},{"contest":{"id":540,"title":"第 280 场周赛","title_slug":"weekly-contest-280","start_time":1644719400,"is_ee_exam_contest":null},"questions":[{"question_id":2169,"title":"得到 0 的操作数","title_slug":"count-operations-to-obtain-zero","rating":1199.8592887103,"_hash":3445184694,"paid_only":false},{"question_id":2170,"title":"使数组变成交替数组的最少操作数","title_slug":"minimum-operations-to-make-the-array-alternating","rating":1662.6673692545,"_hash":884144873,"paid_only":false},{"question_id":2171,"title":"拿出最少数目的魔法豆","title_slug":"removing-minimum-number-of-magic-beans","rating":1748.1339100823,"_hash":2260151323,"paid_only":false},{"question_id":2172,"title":"数组的最大与和","title_slug":"maximum-and-sum-of-array","rating":2392.0799451298,"_hash":284708083,"paid_only":false}],"company":{}},{"contest":{"id":536,"title":"第 279 场周赛","title_slug":"weekly-contest-279","start_time":1644114600,"is_ee_exam_contest":null},"questions":[{"question_id":2164,"title":"对奇偶下标分别排序","title_slug":"sort-even-and-odd-indices-independently","rating":1252.8406166148,"_hash":618419204,"paid_only":false},{"question_id":2165,"title":"重排数字的最小值","title_slug":"smallest-value-of-the-rearranged-number","rating":1361.5824742947,"_hash":2369389100,"paid_only":false},{"question_id":2166,"title":"设计位集","title_slug":"design-bitset","rating":1751.5101577001,"_hash":2504097527,"paid_only":false},{"question_id":2167,"title":"移除所有载有违禁货物车厢所需的最少时间","title_slug":"minimum-time-to-remove-all-cars-containing-illegal-goods","rating":2219.3465296423,"_hash":2598780139,"paid_only":false}],"company":{}},{"contest":{"id":533,"title":"第 71 场双周赛","title_slug":"biweekly-contest-71","start_time":1644071400,"is_ee_exam_contest":null},"questions":[{"question_id":2160,"title":"拆分数位后四位数字的最小和","title_slug":"minimum-sum-of-four-digit-number-after-splitting-digits","rating":1314.2912238536,"_hash":3696757985,"paid_only":false},{"question_id":2161,"title":"根据给定数字划分数组","title_slug":"partition-array-according-to-given-pivot","rating":1337.6115578703,"_hash":290394387,"paid_only":false},{"question_id":2162,"title":"设置时间的最少代价","title_slug":"minimum-cost-to-set-cooking-time","rating":1851.7255023016,"_hash":248789391,"paid_only":false},{"question_id":2163,"title":"删除元素后和的最小差值","title_slug":"minimum-difference-in-sums-after-removal-of-elements","rating":2225.3877535768,"_hash":2967621636,"paid_only":false}],"company":{}},{"contest":{"id":534,"title":"第 278 场周赛","title_slug":"weekly-contest-278","start_time":1643509800,"is_ee_exam_contest":null},"questions":[{"question_id":2154,"title":"将找到的值乘以 2","title_slug":"keep-multiplying-found-values-by-two","rating":1235.8413685224,"_hash":103871786,"paid_only":false},{"question_id":2155,"title":"分组得分最高的所有下标","title_slug":"all-divisions-with-the-highest-score-of-a-binary-array","rating":1390.5023027273,"_hash":1507011086,"paid_only":false},{"question_id":2156,"title":"查找给定哈希值的子串","title_slug":"find-substring-with-given-hash-value","rating":2062.9876807625,"_hash":3801430886,"paid_only":false},{"question_id":2157,"title":"字符串分组","title_slug":"groups-of-strings","rating":2499.3282271507,"_hash":713625410,"paid_only":false}],"company":{}},{"contest":{"id":530,"title":"第 277 场周赛","title_slug":"weekly-contest-277","start_time":1642905000,"is_ee_exam_contest":null},"questions":[{"question_id":2148,"title":"元素计数","title_slug":"count-elements-with-strictly-smaller-and-greater-elements","rating":1201.8730954169,"_hash":1449021558,"paid_only":false},{"question_id":2149,"title":"按符号重排数组","title_slug":"rearrange-array-elements-by-sign","rating":1235.9216009709,"_hash":3029042062,"paid_only":false},{"question_id":2150,"title":"找出数组中的所有孤独数字","title_slug":"find-all-lonely-numbers-in-the-array","rating":1275.6108152653,"_hash":3672640831,"paid_only":false},{"question_id":2151,"title":"基于陈述统计最多好人数","title_slug":"maximum-good-people-based-on-statements","rating":1979.9454101467,"_hash":2347660974,"paid_only":false}],"company":{}},{"contest":{"id":527,"title":"第 70 场双周赛","title_slug":"biweekly-contest-70","start_time":1642861800,"is_ee_exam_contest":null},"questions":[{"question_id":2144,"title":"打折购买糖果的最小开销","title_slug":"minimum-cost-of-buying-candies-with-discount","rating":1260.9112824221,"_hash":1962595835,"paid_only":false},{"question_id":2145,"title":"统计隐藏数组数目","title_slug":"count-the-hidden-sequences","rating":1614.4877804672,"_hash":2108728330,"paid_only":false},{"question_id":2146,"title":"价格范围内最高排名的 K 样物品","title_slug":"k-highest-ranked-items-within-a-price-range","rating":1836.5345744332,"_hash":3957965518,"paid_only":false},{"question_id":2147,"title":"分隔长廊的方案数","title_slug":"number-of-ways-to-divide-a-long-corridor","rating":1914.6717285348,"_hash":4014976365,"paid_only":false}],"company":{}},{"contest":{"id":528,"title":"第 276 场周赛","title_slug":"weekly-contest-276","start_time":1642300200,"is_ee_exam_contest":null},"questions":[{"question_id":2138,"title":"将字符串拆分为若干长度为 k 的组","title_slug":"divide-a-string-into-groups-of-size-k","rating":1273.046473797,"_hash":3830405744,"paid_only":false},{"question_id":2139,"title":"得到目标值的最少行动次数","title_slug":"minimum-moves-to-reach-target-score","rating":1417.3934930077,"_hash":2135327933,"paid_only":false},{"question_id":2140,"title":"解决智力问题","title_slug":"solving-questions-with-brainpower","rating":1709.1054732427,"_hash":3742724136,"paid_only":false},{"question_id":2141,"title":"同时运行 N 台电脑的最长时间","title_slug":"maximum-running-time-of-n-computers","rating":2265.2118886972,"_hash":364057867,"paid_only":false}],"company":{}},{"contest":{"id":524,"title":"第 275 场周赛","title_slug":"weekly-contest-275","start_time":1641695400,"is_ee_exam_contest":null},"questions":[{"question_id":2133,"title":"检查是否每一行每一列都包含全部整数","title_slug":"check-if-every-row-and-column-contains-all-numbers","rating":1264.2868345638,"_hash":3243872254,"paid_only":false},{"question_id":2134,"title":"最少交换次数来组合所有的 1 II","title_slug":"minimum-swaps-to-group-all-1s-together-ii","rating":1748.4522689101,"_hash":107547857,"paid_only":false},{"question_id":2135,"title":"统计追加字母可以获得的单词数","title_slug":"count-words-obtained-after-adding-a-letter","rating":1828.2700238306,"_hash":1363331011,"paid_only":false},{"question_id":2136,"title":"全部开花的最早一天","title_slug":"earliest-possible-day-of-full-bloom","rating":2033.4597721985,"_hash":1189152973,"paid_only":false}],"company":{}},{"contest":{"id":521,"title":"第 69 场双周赛","title_slug":"biweekly-contest-69","start_time":1641652200,"is_ee_exam_contest":null},"questions":[{"question_id":2129,"title":"将标题首字母大写","title_slug":"capitalize-the-title","rating":1274.881752217,"_hash":4156461194,"paid_only":false},{"question_id":2130,"title":"链表最大孪生和","title_slug":"maximum-twin-sum-of-a-linked-list","rating":1317.9207508583,"_hash":2161204569,"paid_only":false},{"question_id":2131,"title":"连接两字母单词得到的最长回文串","title_slug":"longest-palindrome-by-concatenating-two-letter-words","rating":1556.8824239708,"_hash":2977235574,"paid_only":false},{"question_id":2132,"title":"用邮票贴满网格图","title_slug":"stamping-the-grid","rating":2364.3930657709,"_hash":296151509,"paid_only":false}],"company":{}},{"contest":{"id":522,"title":"第 274 场周赛","title_slug":"weekly-contest-274","start_time":1641090600,"is_ee_exam_contest":null},"questions":[{"question_id":2124,"title":"检查是否所有 A 都在 B 之前","title_slug":"check-if-all-as-appears-before-all-bs","rating":1201.7686271329,"_hash":2946534771,"paid_only":false},{"question_id":2125,"title":"银行中的激光束数量","title_slug":"number-of-laser-beams-in-a-bank","rating":1280.2203734882,"_hash":1290173910,"paid_only":false},{"question_id":2126,"title":"摧毁小行星","title_slug":"destroying-asteroids","rating":1334.5708444649,"_hash":2247018180,"paid_only":false},{"question_id":2127,"title":"参加会议的最多员工数","title_slug":"maximum-employees-to-be-invited-to-a-meeting","rating":2449.1323757838,"_hash":2605448197,"paid_only":false}],"company":{}},{"contest":{"id":518,"title":"第 273 场周赛","title_slug":"weekly-contest-273","start_time":1640485800,"is_ee_exam_contest":null},"questions":[{"question_id":2119,"title":"反转两次的数字","title_slug":"a-number-after-a-double-reversal","rating":1187.1344261572,"_hash":1952470548,"paid_only":false},{"question_id":2120,"title":"执行所有后缀指令","title_slug":"execution-of-all-suffix-instructions-staying-in-a-grid","rating":1379.8787648129,"_hash":1526976016,"paid_only":false},{"question_id":2121,"title":"相同元素的间隔之和","title_slug":"intervals-between-identical-elements","rating":1760.9131492436,"_hash":3607071844,"paid_only":false},{"question_id":2122,"title":"还原原数组","title_slug":"recover-the-original-array","rating":2158.8988728254,"_hash":3102719435,"paid_only":false}],"company":{}},{"contest":{"id":515,"title":"第 68 场双周赛","title_slug":"biweekly-contest-68","start_time":1640442600,"is_ee_exam_contest":null},"questions":[{"question_id":2114,"title":"句子中的最多单词数","title_slug":"maximum-number-of-words-found-in-sentences","rating":1257.323514611,"_hash":3609197847,"paid_only":false},{"question_id":2115,"title":"从给定原材料中找到所有可以做出的菜","title_slug":"find-all-possible-recipes-from-given-supplies","rating":1678.5871762113,"_hash":2182831583,"paid_only":false},{"question_id":2116,"title":"判断一个括号字符串是否有效","title_slug":"check-if-a-parentheses-string-can-be-valid","rating":2037.6527962599,"_hash":495901528,"paid_only":false},{"question_id":2117,"title":"一个区间内所有数乘积的缩写","title_slug":"abbreviating-the-product-of-a-range","rating":2476.7727985927,"_hash":2799632565,"paid_only":false}],"company":{}},{"contest":{"id":516,"title":"第 272 场周赛","title_slug":"weekly-contest-272","start_time":1639881000,"is_ee_exam_contest":null},"questions":[{"question_id":2108,"title":"找出数组中的第一个回文字符串","title_slug":"find-first-palindromic-string-in-the-array","rating":1215.7443346869,"_hash":770308924,"paid_only":false},{"question_id":2109,"title":"向字符串添加空格","title_slug":"adding-spaces-to-a-string","rating":1315.1890809249,"_hash":807897834,"paid_only":false},{"question_id":2110,"title":"股票平滑下跌阶段的数目","title_slug":"number-of-smooth-descent-periods-of-a-stock","rating":1408.427592417,"_hash":4159210402,"paid_only":false},{"question_id":2111,"title":"使数组 K 递增的最少操作次数","title_slug":"minimum-operations-to-make-the-array-k-increasing","rating":1940.6002290953,"_hash":1403965423,"paid_only":false}],"company":{}},{"contest":{"id":512,"title":"第 271 场周赛","title_slug":"weekly-contest-271","start_time":1639276200,"is_ee_exam_contest":null},"questions":[{"question_id":2103,"title":"环和杆","title_slug":"rings-and-rods","rating":1257.7670945029,"_hash":2821965653,"paid_only":false},{"question_id":2104,"title":"子数组范围和","title_slug":"sum-of-subarray-ranges","rating":1504.2133321504,"_hash":91788639,"paid_only":false},{"question_id":2105,"title":"给植物浇水 II","title_slug":"watering-plants-ii","rating":1507.1617507911,"_hash":1947285534,"paid_only":false},{"question_id":2106,"title":"摘水果","title_slug":"maximum-fruits-harvested-after-at-most-k-steps","rating":2062.3601158741,"_hash":3434976181,"paid_only":false}],"company":{}},{"contest":{"id":509,"title":"第 67 场双周赛","title_slug":"biweekly-contest-67","start_time":1639233000,"is_ee_exam_contest":null},"questions":[{"question_id":2099,"title":"找到和最大的长度为 K 的子序列","title_slug":"find-subsequence-of-length-k-with-the-largest-sum","rating":1447.0268321102,"_hash":3254374161,"paid_only":false},{"question_id":2100,"title":"适合野炊的日子","title_slug":"find-good-days-to-rob-the-bank","rating":1702.4962514406,"_hash":2252317011,"paid_only":false},{"question_id":2101,"title":"引爆最多的炸弹","title_slug":"detonate-the-maximum-bombs","rating":1880.0511044074,"_hash":1604381884,"paid_only":false},{"question_id":2102,"title":"序列顺序查询","title_slug":"sequentially-ordinal-rank-tracker","rating":2158.7683843245,"_hash":2117244239,"paid_only":false}],"company":{}},{"contest":{"id":510,"title":"第 270 场周赛","title_slug":"weekly-contest-270","start_time":1638671400,"is_ee_exam_contest":null},"questions":[{"question_id":2094,"title":"找出 3 位偶数","title_slug":"finding-3-digit-even-numbers","rating":1454.7459647138,"_hash":3789355498,"paid_only":false},{"question_id":2095,"title":"删除链表的中间节点","title_slug":"delete-the-middle-node-of-a-linked-list","rating":1324.3520304377,"_hash":2982198446,"paid_only":false},{"question_id":2096,"title":"从二叉树一个节点到另一个节点每一步的方向","title_slug":"step-by-step-directions-from-a-binary-tree-node-to-another","rating":1804.5283324227,"_hash":3304159418,"paid_only":false},{"question_id":2097,"title":"合法重新排列数对","title_slug":"valid-arrangement-of-pairs","rating":2650.8996457642,"_hash":459732998,"paid_only":false}],"company":{}},{"contest":{"id":506,"title":"第 269 场周赛","title_slug":"weekly-contest-269","start_time":1638066600,"is_ee_exam_contest":null},"questions":[{"question_id":2089,"title":"找出数组排序后的目标下标","title_slug":"find-target-indices-after-sorting-array","rating":1152.1494742874,"_hash":1915453170,"paid_only":false},{"question_id":2090,"title":"半径为 k 的子数组平均值","title_slug":"k-radius-subarray-averages","rating":1358.152613403,"_hash":210217684,"paid_only":false},{"question_id":2091,"title":"从数组中移除最大值和最小值","title_slug":"removing-minimum-and-maximum-from-array","rating":1384.0226911434,"_hash":4155641815,"paid_only":false},{"question_id":2092,"title":"找出知晓秘密的所有专家","title_slug":"find-all-people-with-secret","rating":2003.5794613668,"_hash":340770494,"paid_only":false}],"company":{}},{"contest":{"id":503,"title":"第 66 场双周赛","title_slug":"biweekly-contest-66","start_time":1638023400,"is_ee_exam_contest":null},"questions":[{"question_id":2085,"title":"统计出现过一次的公共字符串","title_slug":"count-common-words-with-one-occurrence","rating":1307.4608905199,"_hash":709012070,"paid_only":false},{"question_id":2086,"title":"从房屋收集雨水需要的最少水桶数","title_slug":"minimum-number-of-food-buckets-to-feed-the-hamsters","rating":1622.8414025136,"_hash":463765609,"paid_only":false},{"question_id":2087,"title":"网格图中机器人回家的最小代价","title_slug":"minimum-cost-homecoming-of-a-robot-in-a-grid","rating":1743.731976554,"_hash":592826714,"paid_only":false},{"question_id":2088,"title":"统计农场中肥沃金字塔的数目","title_slug":"count-fertile-pyramids-in-a-land","rating":2104.7441214305,"_hash":2070962878,"paid_only":false}],"company":{}},{"contest":{"id":504,"title":"第 268 场周赛","title_slug":"weekly-contest-268","start_time":1637461800,"is_ee_exam_contest":null},"questions":[{"question_id":2078,"title":"两栋颜色不同且距离最远的房子","title_slug":"two-furthest-houses-with-different-colors","rating":1240.829758176,"_hash":3119137809,"paid_only":false},{"question_id":2079,"title":"给植物浇水","title_slug":"watering-plants","rating":1320.6485731562,"_hash":93344773,"paid_only":false},{"question_id":2080,"title":"区间内查询数字的频率","title_slug":"range-frequency-queries","rating":1702.4387527636,"_hash":2460331500,"paid_only":false},{"question_id":2081,"title":"k 镜像数字的和","title_slug":"sum-of-k-mirror-numbers","rating":2209.8815936961,"_hash":3707233513,"paid_only":false}],"company":{}},{"contest":{"id":500,"title":"第 267 场周赛","title_slug":"weekly-contest-267","start_time":1636857000,"is_ee_exam_contest":null},"questions":[{"question_id":2073,"title":"买票需要的时间","title_slug":"time-needed-to-buy-tickets","rating":1325.3607218257,"_hash":1430651253,"paid_only":false},{"question_id":2074,"title":"反转偶数长度组的节点","title_slug":"reverse-nodes-in-even-length-groups","rating":1685.3599641299,"_hash":1103286328,"paid_only":false},{"question_id":2075,"title":"解码斜向换位密码","title_slug":"decode-the-slanted-ciphertext","rating":1759.2287478055,"_hash":1997404036,"paid_only":false},{"question_id":2076,"title":"处理含限制条件的好友请求","title_slug":"process-restricted-friend-requests","rating":2130.9348604091,"_hash":10205408,"paid_only":false}],"company":{}},{"contest":{"id":497,"title":"第 65 场双周赛","title_slug":"biweekly-contest-65","start_time":1636813800,"is_ee_exam_contest":null},"questions":[{"question_id":2068,"title":"检查两个字符串是否几乎相等","title_slug":"check-whether-two-strings-are-almost-equivalent","rating":1273.0588534723,"_hash":2469022748,"paid_only":false},{"question_id":2069,"title":"模拟行走机器人 II","title_slug":"walking-robot-simulation-ii","rating":1918.9960035055,"_hash":3967032436,"paid_only":false},{"question_id":2070,"title":"每一个查询的最大美丽值","title_slug":"most-beautiful-item-for-each-query","rating":1724.1545485476,"_hash":1066025257,"paid_only":false},{"question_id":2071,"title":"你可以安排的最多任务数目","title_slug":"maximum-number-of-tasks-you-can-assign","rating":2648.1748409542,"_hash":1194042995,"paid_only":false}],"company":{}},{"contest":{"id":498,"title":"第 266 场周赛","title_slug":"weekly-contest-266","start_time":1636252200,"is_ee_exam_contest":null},"questions":[{"question_id":2062,"title":"统计字符串中的元音子字符串","title_slug":"count-vowel-substrings-of-a-string","rating":1458.356493039,"_hash":3871311053,"paid_only":false},{"question_id":2063,"title":"所有子字符串中的元音","title_slug":"vowels-of-all-substrings","rating":1663.3912882908,"_hash":1180161064,"paid_only":false},{"question_id":2064,"title":"分配给商店的最多商品的最小值","title_slug":"minimized-maximum-of-products-distributed-to-any-store","rating":1885.9015646531,"_hash":2819110526,"paid_only":false},{"question_id":2065,"title":"最大化一张图中的路径价值","title_slug":"maximum-path-quality-of-a-graph","rating":2178.4249114144,"_hash":2027773900,"paid_only":false}],"company":{}},{"contest":{"id":493,"title":"第 265 场周赛","title_slug":"weekly-contest-265","start_time":1635647400,"is_ee_exam_contest":null},"questions":[{"question_id":2057,"title":"值相等的最小索引","title_slug":"smallest-index-with-equal-value","rating":1167.8737144048,"_hash":3849697077,"paid_only":false},{"question_id":2058,"title":"找出临界点之间的最小和最大距离","title_slug":"find-the-minimum-and-maximum-number-of-nodes-between-critical-points","rating":1310.9129840277,"_hash":4024970253,"paid_only":false},{"question_id":2059,"title":"转化数字的最小运算数","title_slug":"minimum-operations-to-convert-number","rating":1849.8122180044,"_hash":3590542886,"paid_only":false},{"question_id":2060,"title":"同源字符串检测","title_slug":"check-if-an-original-string-exists-given-two-encoded-strings","rating":2803.7652028979,"_hash":905487995,"paid_only":false}],"company":{}},{"contest":{"id":490,"title":"第 64 场双周赛","title_slug":"biweekly-contest-64","start_time":1635604200,"is_ee_exam_contest":null},"questions":[{"question_id":2053,"title":"数组中第 K 个独一无二的字符串","title_slug":"kth-distinct-string-in-an-array","rating":1350.6048768377,"_hash":1322023785,"paid_only":false},{"question_id":2054,"title":"两个最好的不重叠活动","title_slug":"two-best-non-overlapping-events","rating":1883.3541964032,"_hash":2546467088,"paid_only":false},{"question_id":2055,"title":"蜡烛之间的盘子","title_slug":"plates-between-candles","rating":1819.3068421506,"_hash":1199383198,"paid_only":false},{"question_id":2056,"title":"棋盘上有效移动组合的数目","title_slug":"number-of-valid-move-combinations-on-chessboard","rating":2610.9906730644,"_hash":288912613,"paid_only":false}],"company":{}},{"contest":{"id":491,"title":"第 264 场周赛","title_slug":"weekly-contest-264","start_time":1635042600,"is_ee_exam_contest":null},"questions":[{"question_id":2047,"title":"句子中的有效单词数","title_slug":"number-of-valid-words-in-a-sentence","rating":1471.8964024887,"_hash":3911640069,"paid_only":false},{"question_id":2048,"title":"下一个更大的数值平衡数","title_slug":"next-greater-numerically-balanced-number","rating":1734.0550202798,"_hash":1204660336,"paid_only":false},{"question_id":2049,"title":"统计最高分的节点数目","title_slug":"count-nodes-with-the-highest-score","rating":1911.7063530593,"_hash":3202447407,"paid_only":false},{"question_id":2050,"title":"并行课程 III","title_slug":"parallel-courses-iii","rating":2084.1404698713,"_hash":3929135553,"paid_only":false}],"company":{}},{"contest":{"id":487,"title":"第 263 场周赛","title_slug":"weekly-contest-263","start_time":1634437800,"is_ee_exam_contest":null},"questions":[{"question_id":2042,"title":"检查句子中的数字是否递增","title_slug":"check-if-numbers-are-ascending-in-a-sentence","rating":1257.264923599,"_hash":335486990,"paid_only":false},{"question_id":2043,"title":"简易银行系统","title_slug":"simple-bank-system","rating":1356.1920189231,"_hash":693474678,"paid_only":false},{"question_id":2044,"title":"统计按位或能得到最大值的子集数目","title_slug":"count-number-of-maximum-bitwise-or-subsets","rating":1567.6884942977,"_hash":3480413551,"paid_only":false},{"question_id":2045,"title":"到达目的地的第二短时间","title_slug":"second-minimum-time-to-reach-destination","rating":2201.6219336792,"_hash":1896286191,"paid_only":false}],"company":{}},{"contest":{"id":484,"title":"第 63 场双周赛","title_slug":"biweekly-contest-63","start_time":1634394600,"is_ee_exam_contest":null},"questions":[{"question_id":2037,"title":"使每位学生都有座位的最少移动次数","title_slug":"minimum-number-of-moves-to-seat-everyone","rating":1356.6925765299,"_hash":468110,"paid_only":false},{"question_id":2038,"title":"如果相邻两个颜色均相同则删除当前颜色","title_slug":"remove-colored-pieces-if-both-neighbors-are-the-same-color","rating":1467.7383709213,"_hash":2795952868,"paid_only":false},{"question_id":2039,"title":"网络空闲的时刻","title_slug":"the-time-when-the-network-becomes-idle","rating":1865.3441063734,"_hash":275986604,"paid_only":false},{"question_id":2040,"title":"两个有序数组的第 K 小乘积","title_slug":"kth-smallest-product-of-two-sorted-arrays","rating":2517.6829964848,"_hash":4175159080,"paid_only":false}],"company":{}},{"contest":{"id":485,"title":"第 262 场周赛","title_slug":"weekly-contest-262","start_time":1633833000,"is_ee_exam_contest":null},"questions":[{"question_id":2032,"title":"至少在两个数组中出现的值","title_slug":"two-out-of-three","rating":1269.7567553523,"_hash":983129619,"paid_only":false},{"question_id":2033,"title":"获取单值网格的最小操作数","title_slug":"minimum-operations-to-make-a-uni-value-grid","rating":1671.9261598,"_hash":684110909,"paid_only":false},{"question_id":2034,"title":"股票价格波动","title_slug":"stock-price-fluctuation","rating":1831.9395911303,"_hash":1147860078,"paid_only":false},{"question_id":2035,"title":"将数组分成两个数组并最小化数组和的差","title_slug":"partition-array-into-two-arrays-to-minimize-sum-difference","rating":2489.6652421066,"_hash":550627195,"paid_only":false}],"company":{}},{"contest":{"id":481,"title":"第 261 场周赛","title_slug":"weekly-contest-261","start_time":1633228200,"is_ee_exam_contest":null},"questions":[{"question_id":2027,"title":"转换字符串的最少操作次数","title_slug":"minimum-moves-to-convert-string","rating":1346.3556309143,"_hash":1180837306,"paid_only":false},{"question_id":2028,"title":"找出缺失的观测数据","title_slug":"find-missing-observations","rating":1444.6795731919,"_hash":1541316145,"paid_only":false},{"question_id":2029,"title":"石子游戏 IX","title_slug":"stone-game-ix","rating":2277.3595662538,"_hash":2371431943,"paid_only":false},{"question_id":2030,"title":"含特定字母的最小子序列","title_slug":"smallest-k-length-subsequence-with-occurrences-of-a-letter","rating":2561.7794931859,"_hash":266469116,"paid_only":false}],"company":{}},{"contest":{"id":477,"title":"第 62 场双周赛","title_slug":"biweekly-contest-62","start_time":1633185000,"is_ee_exam_contest":null},"questions":[{"question_id":2022,"title":"将一维数组转变成二维数组","title_slug":"convert-1d-array-into-2d-array","rating":1307.3265298181,"_hash":289054660,"paid_only":false},{"question_id":2023,"title":"连接后等于目标字符串的字符串对","title_slug":"number-of-pairs-of-strings-with-concatenation-equal-to-target","rating":1341.3713970313,"_hash":4234423090,"paid_only":false},{"question_id":2024,"title":"考试的最大困扰度","title_slug":"maximize-the-confusion-of-an-exam","rating":1643.1325351423,"_hash":2651875294,"paid_only":false},{"question_id":2025,"title":"分割数组的最多方案数","title_slug":"maximum-number-of-ways-to-partition-an-array","rating":2217.8090802563,"_hash":2513347763,"paid_only":false}],"company":{}},{"contest":{"id":478,"title":"第 260 场周赛","title_slug":"weekly-contest-260","start_time":1632623400,"is_ee_exam_contest":null},"questions":[{"question_id":2016,"title":"增量元素之间的最大差值","title_slug":"maximum-difference-between-increasing-elements","rating":1246.0141927368,"_hash":3044209556,"paid_only":false},{"question_id":2017,"title":"网格游戏","title_slug":"grid-game","rating":1718.9772466681,"_hash":3098562302,"paid_only":false},{"question_id":2018,"title":"判断单词是否能放入填字游戏内","title_slug":"check-if-word-can-be-placed-in-crossword","rating":1929.897343316,"_hash":1485423720,"paid_only":false},{"question_id":2019,"title":"解出数学表达式的学生分数","title_slug":"the-score-of-students-solving-math-expression","rating":2583.9006314254,"_hash":1787510201,"paid_only":false}],"company":{}},{"contest":{"id":474,"title":"第 259 场周赛","title_slug":"weekly-contest-259","start_time":1632018600,"is_ee_exam_contest":null},"questions":[{"question_id":2011,"title":"执行操作后的变量值","title_slug":"final-value-of-variable-after-performing-operations","rating":1165.2135167215,"_hash":170017720,"paid_only":false},{"question_id":2012,"title":"数组美丽值求和","title_slug":"sum-of-beauty-in-the-array","rating":1467.9366439696,"_hash":136239889,"paid_only":false},{"question_id":2013,"title":"检测正方形","title_slug":"detect-squares","rating":1841.4067816266,"_hash":2204914887,"paid_only":false},{"question_id":2014,"title":"重复 K 次的最长子序列","title_slug":"longest-subsequence-repeated-k-times","rating":2558.3297484354,"_hash":3061824471,"paid_only":false}],"company":{}},{"contest":{"id":467,"title":"第 61 场双周赛","title_slug":"biweekly-contest-61","start_time":1631975400,"is_ee_exam_contest":null},"questions":[{"question_id":2006,"title":"差的绝对值为 K 的数对数目","title_slug":"count-number-of-pairs-with-absolute-difference-k","rating":1271.7726574892,"_hash":911506733,"paid_only":false},{"question_id":2007,"title":"从双倍数组中还原原数组","title_slug":"find-original-array-from-doubled-array","rating":1557.017055582,"_hash":1395581223,"paid_only":false},{"question_id":2008,"title":"出租车的最大盈利","title_slug":"maximum-earnings-from-taxi","rating":1871.8245218615,"_hash":2921363389,"paid_only":false},{"question_id":2009,"title":"使数组连续的最少操作数","title_slug":"minimum-number-of-operations-to-make-array-continuous","rating":2084.4980206639,"_hash":419814877,"paid_only":false}],"company":{}},{"contest":{"id":468,"title":"第 258 场周赛","title_slug":"weekly-contest-258","start_time":1631413800,"is_ee_exam_contest":null},"questions":[{"question_id":2000,"title":"反转单词前缀","title_slug":"reverse-prefix-of-word","rating":1199.4477805501,"_hash":3147357769,"paid_only":false},{"question_id":2001,"title":"可互换矩形的组数","title_slug":"number-of-pairs-of-interchangeable-rectangles","rating":1435.9559888935,"_hash":2330317080,"paid_only":false},{"question_id":2002,"title":"两个回文子序列长度的最大乘积","title_slug":"maximum-product-of-the-length-of-two-palindromic-subsequences","rating":1869.402439128,"_hash":3968538235,"paid_only":false},{"question_id":2003,"title":"每棵子树内缺失的最小基因值","title_slug":"smallest-missing-genetic-value-in-each-subtree","rating":2415.0089731911,"_hash":4272085250,"paid_only":false}],"company":{}},{"contest":{"id":464,"title":"第 257 场周赛","title_slug":"weekly-contest-257","start_time":1630809000,"is_ee_exam_contest":null},"questions":[{"question_id":1995,"title":"统计特殊四元组","title_slug":"count-special-quadruplets","rating":1352.1791099256,"_hash":3750650671,"paid_only":false},{"question_id":1996,"title":"游戏中弱角色的数量","title_slug":"the-number-of-weak-characters-in-the-game","rating":1860.742934291,"_hash":1819395589,"paid_only":false},{"question_id":1997,"title":"访问完所有房间的第一天","title_slug":"first-day-where-you-have-been-in-all-the-rooms","rating":2260.2799775623,"_hash":3953077425,"paid_only":false},{"question_id":1998,"title":"数组的最大公因数排序","title_slug":"gcd-sort-of-an-array","rating":2429.0940568399,"_hash":1642092986,"paid_only":false}],"company":{}},{"contest":{"id":461,"title":"第 60 场双周赛","title_slug":"biweekly-contest-60","start_time":1630765800,"is_ee_exam_contest":null},"questions":[{"question_id":1991,"title":"找到数组的中间位置","title_slug":"find-the-middle-index-in-array","rating":1302.6469071738,"_hash":919200929,"paid_only":false},{"question_id":1992,"title":"找到所有的农场组","title_slug":"find-all-groups-of-farmland","rating":1539.2250193318,"_hash":3674750599,"paid_only":false},{"question_id":1993,"title":"树上的操作","title_slug":"operations-on-tree","rating":1861.4906863586,"_hash":2143044442,"paid_only":false},{"question_id":1994,"title":"好子集的数目","title_slug":"the-number-of-good-subsets","rating":2464.5077611012,"_hash":1844354140,"paid_only":false}],"company":{}},{"contest":{"id":462,"title":"第 256 场周赛","title_slug":"weekly-contest-256","start_time":1630204200,"is_ee_exam_contest":null},"questions":[{"question_id":1984,"title":"学生分数的最小差值","title_slug":"minimum-difference-between-highest-and-lowest-of-k-scores","rating":1306.2821637677,"_hash":3183288856,"paid_only":false},{"question_id":1985,"title":"找出数组中的第 K 大整数","title_slug":"find-the-kth-largest-integer-in-the-array","rating":1414.4351202231,"_hash":3550553048,"paid_only":false},{"question_id":1986,"title":"完成任务的最少工作时间段","title_slug":"minimum-number-of-work-sessions-to-finish-the-tasks","rating":1995.2937073376,"_hash":1113985320,"paid_only":false},{"question_id":1987,"title":"不同的好子序列数目","title_slug":"number-of-unique-good-subsequences","rating":2422.3128048015,"_hash":3567330607,"paid_only":false}],"company":{}},{"contest":{"id":457,"title":"第 255 场周赛","title_slug":"weekly-contest-255","start_time":1629599400,"is_ee_exam_contest":null},"questions":[{"question_id":1979,"title":"找出数组的最大公约数","title_slug":"find-greatest-common-divisor-of-array","rating":1184.4264833435,"_hash":2688612867,"paid_only":false},{"question_id":1980,"title":"找出不同的二进制字符串","title_slug":"find-unique-binary-string","rating":1361.6459603518,"_hash":333667858,"paid_only":false},{"question_id":1981,"title":"最小化目标值与所选元素的差","title_slug":"minimize-the-difference-between-target-and-chosen-elements","rating":2009.7322365973,"_hash":3922635563,"paid_only":false},{"question_id":1982,"title":"从子集的和还原数组","title_slug":"find-array-given-subset-sums","rating":2872.0290327119,"_hash":1576603106,"paid_only":false}],"company":{}},{"contest":{"id":448,"title":"第 59 场双周赛","title_slug":"biweekly-contest-59","start_time":1629556200,"is_ee_exam_contest":null},"questions":[{"question_id":1974,"title":"使用特殊打字机键入单词的最少时间","title_slug":"minimum-time-to-type-word-using-special-typewriter","rating":1364.154859918,"_hash":3014957498,"paid_only":false},{"question_id":1975,"title":"最大方阵和","title_slug":"maximum-matrix-sum","rating":1648.0880791614,"_hash":330899243,"paid_only":false},{"question_id":1976,"title":"到达目的地的方案数","title_slug":"number-of-ways-to-arrive-at-destination","rating":2094.592426537,"_hash":3020603346,"paid_only":false},{"question_id":1977,"title":"划分数字的方案数","title_slug":"number-of-ways-to-separate-numbers","rating":2817.267212602,"_hash":1178924986,"paid_only":false}],"company":{}},{"contest":{"id":449,"title":"第 254 场周赛","title_slug":"weekly-contest-254","start_time":1628994600,"is_ee_exam_contest":null},"questions":[{"question_id":1967,"title":"作为子字符串出现在单词中的字符串数目","title_slug":"number-of-strings-that-appear-as-substrings-in-word","rating":1231.8671440198,"_hash":3091785544,"paid_only":false},{"question_id":1968,"title":"构造元素不等于两相邻元素平均值的数组","title_slug":"array-with-elements-not-equal-to-average-of-neighbors","rating":1499.3290269267,"_hash":3221222128,"paid_only":false},{"question_id":1969,"title":"数组元素的最小非零乘积","title_slug":"minimum-non-zero-product-of-the-array-elements","rating":1966.7067914206,"_hash":4252220750,"paid_only":false},{"question_id":1970,"title":"你能穿过矩阵的最后一天","title_slug":"last-day-where-you-can-still-cross","rating":2123.5708982185,"_hash":821525251,"paid_only":false}],"company":{}},{"contest":{"id":444,"title":"第 253 场周赛","title_slug":"weekly-contest-253","start_time":1628389800,"is_ee_exam_contest":null},"questions":[{"question_id":1961,"title":"检查字符串是否为数组前缀","title_slug":"check-if-string-is-a-prefix-of-array","rating":1234.058537565,"_hash":32848909,"paid_only":false},{"question_id":1962,"title":"移除石子使总数最小","title_slug":"remove-stones-to-minimize-the-total","rating":1418.6847740057,"_hash":1331620430,"paid_only":false},{"question_id":1963,"title":"使字符串平衡的最小交换次数","title_slug":"minimum-number-of-swaps-to-make-the-string-balanced","rating":1688.9209684568,"_hash":1518041298,"paid_only":false},{"question_id":1964,"title":"找出到每个位置为止最长的有效障碍赛跑路线","title_slug":"find-the-longest-valid-obstacle-course-at-each-position","rating":1933.2169470617,"_hash":2251945224,"paid_only":false}],"company":{}},{"contest":{"id":441,"title":"第 58 场双周赛","title_slug":"biweekly-contest-58","start_time":1628346600,"is_ee_exam_contest":null},"questions":[{"question_id":1957,"title":"删除字符使字符串变好","title_slug":"delete-characters-to-make-fancy-string","rating":1357.6553050616,"_hash":3153125580,"paid_only":false},{"question_id":1958,"title":"检查操作是否合法","title_slug":"check-if-move-is-legal","rating":1658.5967147757,"_hash":4231095696,"paid_only":false},{"question_id":1959,"title":"K 次调整数组大小浪费的最小总空间","title_slug":"minimum-total-space-wasted-with-k-resizing-operations","rating":2310.3824631335,"_hash":1714015866,"paid_only":false},{"question_id":1960,"title":"两个回文子字符串长度的最大乘积","title_slug":"maximum-product-of-the-length-of-two-palindromic-substrings","rating":2690.5859406179,"_hash":1434911335,"paid_only":false}],"company":{}},{"contest":{"id":442,"title":"第 252 场周赛","title_slug":"weekly-contest-252","start_time":1627785000,"is_ee_exam_contest":null},"questions":[{"question_id":1952,"title":"三除数","title_slug":"three-divisors","rating":1203.7504950404,"_hash":324872429,"paid_only":false},{"question_id":1953,"title":"你可以工作的最大周数","title_slug":"maximum-number-of-weeks-for-which-you-can-work","rating":1803.7518552874,"_hash":787047636,"paid_only":false},{"question_id":1954,"title":"收集足够苹果的最小花园周长","title_slug":"minimum-garden-perimeter-to-collect-enough-apples","rating":1758.5135073787,"_hash":601450429,"paid_only":false},{"question_id":1955,"title":"统计特殊子序列的数目","title_slug":"count-number-of-special-subsequences","rating":2125.3125624762,"_hash":655929637,"paid_only":false}],"company":{}},{"contest":{"id":438,"title":"第 251 场周赛","title_slug":"weekly-contest-251","start_time":1627180200,"is_ee_exam_contest":null},"questions":[{"question_id":1945,"title":"字符串转化后的各位数字之和","title_slug":"sum-of-digits-of-string-after-convert","rating":1254.8626139269,"_hash":199553622,"paid_only":false},{"question_id":1946,"title":"子字符串突变后可能得到的最大整数","title_slug":"largest-number-after-mutating-substring","rating":1445.3734269673,"_hash":1102749976,"paid_only":false},{"question_id":1947,"title":"最大兼容性评分和","title_slug":"maximum-compatibility-score-sum","rating":1704.360891641,"_hash":889856657,"paid_only":false},{"question_id":1948,"title":"删除系统中的重复文件夹","title_slug":"delete-duplicate-folders-in-system","rating":2533.7796160302,"_hash":2921275572,"paid_only":false}],"company":{}},{"contest":{"id":435,"title":"第 57 场双周赛","title_slug":"biweekly-contest-57","start_time":1627137000,"is_ee_exam_contest":null},"questions":[{"question_id":1941,"title":"检查是否所有字符出现次数相同","title_slug":"check-if-all-characters-have-equal-number-of-occurrences","rating":1242.6172898768,"_hash":2694237057,"paid_only":false},{"question_id":1942,"title":"最小未被占据椅子的编号","title_slug":"the-number-of-the-smallest-unoccupied-chair","rating":1695.2832486322,"_hash":2532708840,"paid_only":false},{"question_id":1943,"title":"描述绘画结果","title_slug":"describe-the-painting","rating":1969.2019235672,"_hash":3387998069,"paid_only":false},{"question_id":1944,"title":"队列中可以看到的人数","title_slug":"number-of-visible-people-in-a-queue","rating":2104.9526046945,"_hash":3935523633,"paid_only":false}],"company":{}},{"contest":{"id":436,"title":"第 250 场周赛","title_slug":"weekly-contest-250","start_time":1626575400,"is_ee_exam_contest":null},"questions":[{"question_id":1935,"title":"可以输入的最大单词数","title_slug":"maximum-number-of-words-you-can-type","rating":1226.8332278145,"_hash":3926884655,"paid_only":false},{"question_id":1936,"title":"新增的最少台阶数","title_slug":"add-minimum-number-of-rungs","rating":1322.5926536743,"_hash":1249919767,"paid_only":false},{"question_id":1937,"title":"扣分后的最大得分","title_slug":"maximum-number-of-points-with-cost","rating":2105.7761215397,"_hash":1687003236,"paid_only":false},{"question_id":1938,"title":"查询最大基因差","title_slug":"maximum-genetic-difference-query","rating":2502.5176603922,"_hash":2939895760,"paid_only":false}],"company":{}},{"contest":{"id":432,"title":"第 249 场周赛","title_slug":"weekly-contest-249","start_time":1625970600,"is_ee_exam_contest":null},"questions":[{"question_id":1929,"title":"数组串联","title_slug":"concatenation-of-array","rating":1132.6812943289,"_hash":4238290979,"paid_only":false},{"question_id":1930,"title":"长度为 3 的不同回文子序列","title_slug":"unique-length-3-palindromic-subsequences","rating":1533.3376144199,"_hash":2661403855,"paid_only":false},{"question_id":1931,"title":"用三种不同颜色为网格涂色","title_slug":"painting-a-grid-with-three-different-colors","rating":2170.0439693714,"_hash":4290496515,"paid_only":false},{"question_id":1932,"title":"合并多棵二叉搜索树","title_slug":"merge-bsts-to-create-single-bst","rating":2483.9435767299,"_hash":1876544260,"paid_only":false}],"company":{}},{"contest":{"id":429,"title":"第 56 场双周赛","title_slug":"biweekly-contest-56","start_time":1625927400,"is_ee_exam_contest":null},"questions":[{"question_id":1925,"title":"统计平方和三元组的数目","title_slug":"count-square-sum-triples","rating":1323.8236471852,"_hash":1728101846,"paid_only":false},{"question_id":1926,"title":"迷宫中离入口最近的出口","title_slug":"nearest-exit-from-entrance-in-maze","rating":1638.3134093066,"_hash":1229621552,"paid_only":false},{"question_id":1927,"title":"求和游戏","title_slug":"sum-game","rating":2004.5346526204,"_hash":1519983797,"paid_only":false},{"question_id":1928,"title":"规定时间内到达终点的最小花费","title_slug":"minimum-cost-to-reach-destination-in-time","rating":2413.3969129689,"_hash":3899529382,"paid_only":false}],"company":{}},{"contest":{"id":430,"title":"第 248 场周赛","title_slug":"weekly-contest-248","start_time":1625365800,"is_ee_exam_contest":null},"questions":[{"question_id":1920,"title":"基于排列构建数组","title_slug":"build-array-from-permutation","rating":1160.4439395369,"_hash":1028149095,"paid_only":false},{"question_id":1921,"title":"消灭怪物的最大数量","title_slug":"eliminate-maximum-number-of-monsters","rating":1527.6868660176,"_hash":119954396,"paid_only":false},{"question_id":1922,"title":"统计好数字的数目","title_slug":"count-good-numbers","rating":1674.7986939472,"_hash":1253336265,"paid_only":false},{"question_id":1923,"title":"最长公共子路径","title_slug":"longest-common-subpath","rating":2661.0670044656,"_hash":3430988573,"paid_only":false}],"company":{}},{"contest":{"id":426,"title":"第 247 场周赛","title_slug":"weekly-contest-247","start_time":1624761000,"is_ee_exam_contest":null},"questions":[{"question_id":1913,"title":"两个数对之间的最大乘积差","title_slug":"maximum-product-difference-between-two-pairs","rating":1144.6237559885,"_hash":639622603,"paid_only":false},{"question_id":1914,"title":"循环轮转矩阵","title_slug":"cyclically-rotating-a-grid","rating":1766.2506177612,"_hash":1526363744,"paid_only":false},{"question_id":1915,"title":"最美子字符串的数目","title_slug":"number-of-wonderful-substrings","rating":2234.9191877602,"_hash":3315472808,"paid_only":false},{"question_id":1916,"title":"统计为蚁群构筑房间的不同顺序","title_slug":"count-ways-to-build-rooms-in-an-ant-colony","rating":2486.2339675701,"_hash":2321691552,"paid_only":false}],"company":{}},{"contest":{"id":421,"title":"第 55 场双周赛","title_slug":"biweekly-contest-55","start_time":1624717800,"is_ee_exam_contest":null},"questions":[{"question_id":1909,"title":"删除一个元素使数组严格递增","title_slug":"remove-one-element-to-make-the-array-strictly-increasing","rating":1461.2892510067,"_hash":3077002187,"paid_only":false},{"question_id":1910,"title":"删除一个字符串中所有出现的给定子字符串","title_slug":"remove-all-occurrences-of-a-substring","rating":1460.9105672071,"_hash":2348993490,"paid_only":false},{"question_id":1911,"title":"最大子序列交替和","title_slug":"maximum-alternating-subsequence-sum","rating":1785.6872758693,"_hash":1304520805,"paid_only":false},{"question_id":1912,"title":"设计电影租借系统","title_slug":"design-movie-rental-system","rating":2181.7821188042,"_hash":1272023779,"paid_only":false}],"company":{}},{"contest":{"id":422,"title":"第 246 场周赛","title_slug":"weekly-contest-246","start_time":1624156200,"is_ee_exam_contest":null},"questions":[{"question_id":1903,"title":"字符串中的最大奇数","title_slug":"largest-odd-number-in-string","rating":1248.8547072235,"_hash":946660529,"paid_only":false},{"question_id":1904,"title":"你完成的完整对局数","title_slug":"the-number-of-full-rounds-you-have-played","rating":1498.1542511841,"_hash":1871665913,"paid_only":false},{"question_id":1905,"title":"统计子岛屿","title_slug":"count-sub-islands","rating":1678.7231378948,"_hash":986520800,"paid_only":false},{"question_id":1906,"title":"查询差绝对值的最小值","title_slug":"minimum-absolute-difference-queries","rating":2146.639581998,"_hash":1980479000,"paid_only":false}],"company":{}},{"contest":{"id":417,"title":"第 245 场周赛","title_slug":"weekly-contest-245","start_time":1623551400,"is_ee_exam_contest":null},"questions":[{"question_id":1897,"title":"重新分配字符使所有字符串都相等","title_slug":"redistribute-characters-to-make-all-strings-equal","rating":1309.1422268153,"_hash":1093275153,"paid_only":false},{"question_id":1898,"title":"可移除字符的最大数目","title_slug":"maximum-number-of-removable-characters","rating":1912.8440554296,"_hash":1548254728,"paid_only":false},{"question_id":1899,"title":"合并若干三元组以形成目标三元组","title_slug":"merge-triplets-to-form-target-triplet","rating":1635.6879273926,"_hash":3990558875,"paid_only":false},{"question_id":1900,"title":"最佳运动员的比拼回合","title_slug":"the-earliest-and-latest-rounds-where-players-compete","rating":2454.7653333657,"_hash":5115105,"paid_only":false}],"company":{}},{"contest":{"id":414,"title":"第 54 场双周赛","title_slug":"biweekly-contest-54","start_time":1623508200,"is_ee_exam_contest":null},"questions":[{"question_id":1893,"title":"检查是否区域内所有整数都被覆盖","title_slug":"check-if-all-the-integers-in-a-range-are-covered","rating":1307.3797385769,"_hash":457953007,"paid_only":false},{"question_id":1894,"title":"找到需要补充粉笔的学生编号","title_slug":"find-the-student-that-will-replace-the-chalk","rating":1355.5386161215,"_hash":3347724858,"paid_only":false},{"question_id":1895,"title":"最大的幻方","title_slug":"largest-magic-square","rating":1781.3664141686,"_hash":826909651,"paid_only":false},{"question_id":1896,"title":"反转表达式值的最少操作次数","title_slug":"minimum-cost-to-change-the-final-value-of-expression","rating":2531.6452775023,"_hash":4239622058,"paid_only":false}],"company":{}},{"contest":{"id":415,"title":"第 244 场周赛","title_slug":"weekly-contest-244","start_time":1622946600,"is_ee_exam_contest":null},"questions":[{"question_id":1886,"title":"判断矩阵经轮转后是否一致","title_slug":"determine-whether-matrix-can-be-obtained-by-rotation","rating":1407.0629410799,"_hash":3698071341,"paid_only":false},{"question_id":1887,"title":"使数组元素相等的减少操作次数","title_slug":"reduction-operations-to-make-the-array-elements-equal","rating":1427.7906804882,"_hash":869195845,"paid_only":false},{"question_id":1888,"title":"使二进制字符串字符交替的最少反转次数","title_slug":"minimum-number-of-flips-to-make-the-binary-string-alternating","rating":2005.5862669078,"_hash":3565951903,"paid_only":false},{"question_id":1889,"title":"装包裹的最小浪费空间","title_slug":"minimum-space-wasted-from-packaging","rating":2214.4798747386,"_hash":988335694,"paid_only":false}],"company":{}},{"contest":{"id":411,"title":"第 243 场周赛","title_slug":"weekly-contest-243","start_time":1622341800,"is_ee_exam_contest":null},"questions":[{"question_id":1880,"title":"检查某单词是否等于两单词之和","title_slug":"check-if-word-equals-summation-of-two-words","rating":1187.1641565458,"_hash":2621107821,"paid_only":false},{"question_id":1881,"title":"插入后的最大值","title_slug":"maximum-value-after-insertion","rating":1381.2168789318,"_hash":288305998,"paid_only":false},{"question_id":1882,"title":"使用服务器处理任务","title_slug":"process-tasks-using-servers","rating":1979.1112273597,"_hash":3237851921,"paid_only":false},{"question_id":1883,"title":"准时抵达会议现场的最小跳过休息次数","title_slug":"minimum-skips-to-arrive-at-meeting-on-time","rating":2587.8725248485,"_hash":557097878,"paid_only":false}],"company":{}},{"contest":{"id":408,"title":"第 53 场双周赛","title_slug":"biweekly-contest-53","start_time":1622298600,"is_ee_exam_contest":null},"questions":[{"question_id":1876,"title":"长度为三且各字符不同的子字符串","title_slug":"substrings-of-size-three-with-distinct-characters","rating":1248.7224675206,"_hash":2754546565,"paid_only":false},{"question_id":1877,"title":"数组中最大数对和的最小值","title_slug":"minimize-maximum-pair-sum-in-array","rating":1301.381757401,"_hash":1670099365,"paid_only":false},{"question_id":1878,"title":"矩阵中最大的三个菱形和","title_slug":"get-biggest-three-rhombus-sums-in-a-grid","rating":1897.5516652727,"_hash":3647529643,"paid_only":false},{"question_id":1879,"title":"两个数组最小的异或值之和","title_slug":"minimum-xor-sum-of-two-arrays","rating":2145.183995267,"_hash":3201195359,"paid_only":false}],"company":{}},{"contest":{"id":409,"title":"第 242 场周赛","title_slug":"weekly-contest-242","start_time":1621737000,"is_ee_exam_contest":null},"questions":[{"question_id":1869,"title":"哪种连续子字符串更长","title_slug":"longer-contiguous-segments-of-ones-than-zeros","rating":1204.9864820183,"_hash":4125612782,"paid_only":false},{"question_id":1870,"title":"准时到达的列车最小时速","title_slug":"minimum-speed-to-arrive-on-time","rating":1675.761234741,"_hash":2612530279,"paid_only":false},{"question_id":1871,"title":"跳跃游戏 VII","title_slug":"jump-game-vii","rating":1896.1411567598,"_hash":2335538835,"paid_only":false},{"question_id":1872,"title":"石子游戏 VIII","title_slug":"stone-game-viii","rating":2439.7337408636,"_hash":3947635653,"paid_only":false}],"company":{}},{"contest":{"id":405,"title":"第 241 场周赛","title_slug":"weekly-contest-241","start_time":1621132200,"is_ee_exam_contest":null},"questions":[{"question_id":1863,"title":"找出所有子集的异或总和再求和","title_slug":"sum-of-all-subset-xor-totals","rating":1372.1152262488,"_hash":3681131795,"paid_only":false},{"question_id":1864,"title":"构成交替字符串需要的最小交换次数","title_slug":"minimum-number-of-swaps-to-make-the-binary-string-alternating","rating":1600.5573262373,"_hash":1402633459,"paid_only":false},{"question_id":1865,"title":"找出和为指定值的下标对","title_slug":"finding-pairs-with-a-certain-sum","rating":1680.82425993,"_hash":1859819274,"paid_only":false},{"question_id":1866,"title":"恰有 K 根木棍可以看到的排列数目","title_slug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible","rating":2333.0621537307,"_hash":3900992255,"paid_only":false}],"company":{}},{"contest":{"id":402,"title":"第 52 场双周赛","title_slug":"biweekly-contest-52","start_time":1621089000,"is_ee_exam_contest":null},"questions":[{"question_id":1859,"title":"将句子排序","title_slug":"sorting-the-sentence","rating":1290.0361853035,"_hash":1139062797,"paid_only":false},{"question_id":1860,"title":"增长的内存泄露","title_slug":"incremental-memory-leak","rating":1387.2941868867,"_hash":4283669919,"paid_only":false},{"question_id":1861,"title":"旋转盒子","title_slug":"rotating-the-box","rating":1536.7018543075,"_hash":3272610079,"paid_only":false},{"question_id":1862,"title":"向下取整数对和","title_slug":"sum-of-floored-pairs","rating":2170.1079846744,"_hash":2862855056,"paid_only":false}],"company":{}},{"contest":{"id":403,"title":"第 240 场周赛","title_slug":"weekly-contest-240","start_time":1620527400,"is_ee_exam_contest":null},"questions":[{"question_id":1854,"title":"人口最多的年份","title_slug":"maximum-population-year","rating":1370.4186698287,"_hash":214508087,"paid_only":false},{"question_id":1855,"title":"下标对中的最大距离","title_slug":"maximum-distance-between-a-pair-of-values","rating":1514.8181710611,"_hash":4071175900,"paid_only":false},{"question_id":1856,"title":"子数组最小乘积的最大值","title_slug":"maximum-subarray-min-product","rating":2051.0879431258,"_hash":209121812,"paid_only":false},{"question_id":1857,"title":"有向图中最大颜色值","title_slug":"largest-color-value-in-a-directed-graph","rating":2312.9919953644,"_hash":1775341601,"paid_only":false}],"company":{}},{"contest":{"id":399,"title":"第 239 场周赛","title_slug":"weekly-contest-239","start_time":1619922600,"is_ee_exam_contest":null},"questions":[{"question_id":1848,"title":"到目标元素的最小距离","title_slug":"minimum-distance-to-the-target-element","rating":1216.6376846517,"_hash":933877486,"paid_only":false},{"question_id":1849,"title":"将字符串拆分为递减的连续值","title_slug":"splitting-a-string-into-descending-consecutive-values","rating":1746.8757919578,"_hash":576619521,"paid_only":false},{"question_id":1850,"title":"邻位交换的最小次数","title_slug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number","rating":2073.0124645606,"_hash":1640158797,"paid_only":false},{"question_id":1851,"title":"包含每个查询的最小区间","title_slug":"minimum-interval-to-include-each-query","rating":2286.1378742318,"_hash":3250523305,"paid_only":false}],"company":{}},{"contest":{"id":396,"title":"第 51 场双周赛","title_slug":"biweekly-contest-51","start_time":1619879400,"is_ee_exam_contest":null},"questions":[{"question_id":1844,"title":"将所有数字用字符替换","title_slug":"replace-all-digits-with-characters","rating":1300.9041426403,"_hash":315817700,"paid_only":false},{"question_id":1845,"title":"座位预约管理系统","title_slug":"seat-reservation-manager","rating":1428.6729861424,"_hash":3281498525,"paid_only":false},{"question_id":1846,"title":"减小和重新排列数组后的最大元素","title_slug":"maximum-element-after-decreasing-and-rearranging","rating":1454.3901912166,"_hash":2606916888,"paid_only":false},{"question_id":1847,"title":"最近的房间","title_slug":"closest-room","rating":2081.7518764643,"_hash":1181589124,"paid_only":false}],"company":{}},{"contest":{"id":397,"title":"第 238 场周赛","title_slug":"weekly-contest-238","start_time":1619317800,"is_ee_exam_contest":null},"questions":[{"question_id":1837,"title":"K 进制表示下的各位数字总和","title_slug":"sum-of-digits-in-base-k","rating":1282.4111853142,"_hash":2970227389,"paid_only":false},{"question_id":1838,"title":"最高频元素的频数","title_slug":"frequency-of-the-most-frequent-element","rating":1876.3611046625,"_hash":2806558939,"paid_only":false},{"question_id":1839,"title":"所有元音按顺序排布的最长子字符串","title_slug":"longest-substring-of-all-vowels-in-order","rating":1580.3620959714,"_hash":3250155411,"paid_only":false},{"question_id":1840,"title":"最高建筑高度","title_slug":"maximum-building-height","rating":2374.1850487395,"_hash":3469541764,"paid_only":false}],"company":{}},{"contest":{"id":393,"title":"第 237 场周赛","title_slug":"weekly-contest-237","start_time":1618713000,"is_ee_exam_contest":null},"questions":[{"question_id":1832,"title":"判断句子是否为全字母句","title_slug":"check-if-the-sentence-is-pangram","rating":1166.78818332,"_hash":2544348147,"paid_only":false},{"question_id":1833,"title":"雪糕的最大数量","title_slug":"maximum-ice-cream-bars","rating":1252.7479413966,"_hash":3346548045,"paid_only":false},{"question_id":1834,"title":"单线程 CPU","title_slug":"single-threaded-cpu","rating":1797.7466000366,"_hash":3429532354,"paid_only":false},{"question_id":1835,"title":"所有数对按位与结果的异或和","title_slug":"find-xor-sum-of-all-pairs-bitwise-and","rating":1825.0056908946,"_hash":635111986,"paid_only":false}],"company":{}},{"contest":{"id":390,"title":"第 50 场双周赛","title_slug":"biweekly-contest-50","start_time":1618669800,"is_ee_exam_contest":null},"questions":[{"question_id":1827,"title":"最少操作使数组递增","title_slug":"minimum-operations-to-make-the-array-increasing","rating":1314.8600143277,"_hash":191620507,"paid_only":false},{"question_id":1828,"title":"统计一个圆中点的数目","title_slug":"queries-on-number-of-points-inside-a-circle","rating":1380.0192844155,"_hash":3128004049,"paid_only":false},{"question_id":1829,"title":"每个查询的最大异或值","title_slug":"maximum-xor-for-each-query","rating":1523.4113866454,"_hash":246275746,"paid_only":false},{"question_id":1830,"title":"使字符串有序的最少操作次数","title_slug":"minimum-number-of-operations-to-make-string-sorted","rating":2620.4181842249,"_hash":3807487459,"paid_only":false}],"company":{}},{"contest":{"id":391,"title":"第 236 场周赛","title_slug":"weekly-contest-236","start_time":1618108200,"is_ee_exam_contest":null},"questions":[{"question_id":1822,"title":"数组元素积的符号","title_slug":"sign-of-the-product-of-an-array","rating":1209.6571020247,"_hash":428851356,"paid_only":false},{"question_id":1823,"title":"找出游戏的获胜者","title_slug":"find-the-winner-of-the-circular-game","rating":1412.3053230205,"_hash":2586044711,"paid_only":false},{"question_id":1824,"title":"最少侧跳次数","title_slug":"minimum-sideway-jumps","rating":1778.4880620629,"_hash":3943793700,"paid_only":false},{"question_id":1825,"title":"求出 MK 平均值","title_slug":"finding-mk-average","rating":2395.8765531206,"_hash":2747291591,"paid_only":false}],"company":{}},{"contest":{"id":377,"title":"第 235 场周赛","title_slug":"weekly-contest-235","start_time":1617503400,"is_ee_exam_contest":null},"questions":[{"question_id":1816,"title":"截断句子","title_slug":"truncate-sentence","rating":1235.6114196155,"_hash":1592995979,"paid_only":false},{"question_id":1817,"title":"查找用户活跃分钟数","title_slug":"finding-the-users-active-minutes","rating":1360.3005775112,"_hash":3137406326,"paid_only":false},{"question_id":1818,"title":"绝对差值和","title_slug":"minimum-absolute-sum-difference","rating":1934.3556201811,"_hash":445102839,"paid_only":false},{"question_id":1819,"title":"序列中不同最大公约数的数目","title_slug":"number-of-different-subsequences-gcds","rating":2539.863726397,"_hash":2981004463,"paid_only":false}],"company":{}},{"contest":{"id":374,"title":"第 49 场双周赛","title_slug":"biweekly-contest-49","start_time":1617460200,"is_ee_exam_contest":null},"questions":[{"question_id":1812,"title":"判断国际象棋棋盘中一个格子的颜色","title_slug":"determine-color-of-a-chessboard-square","rating":1328.513147726,"_hash":3006434957,"paid_only":false},{"question_id":1813,"title":"句子相似性 III","title_slug":"sentence-similarity-iii","rating":1588.9690763997,"_hash":1688453804,"paid_only":false},{"question_id":1814,"title":"统计一个数组中好对子的数目","title_slug":"count-nice-pairs-in-an-array","rating":1737.8431142688,"_hash":1480696010,"paid_only":false},{"question_id":1815,"title":"得到新鲜甜甜圈的最多组数","title_slug":"maximum-number-of-groups-getting-fresh-donuts","rating":2559.4351004238,"_hash":2135431142,"paid_only":false}],"company":{}},{"contest":{"id":375,"title":"第 234 场周赛","title_slug":"weekly-contest-234","start_time":1616898600,"is_ee_exam_contest":null},"questions":[{"question_id":1805,"title":"字符串中不同整数的数目","title_slug":"number-of-different-integers-in-a-string","rating":1333.3138174157,"_hash":1970717834,"paid_only":false},{"question_id":1806,"title":"还原排列的最少操作步数","title_slug":"minimum-number-of-operations-to-reinitialize-a-permutation","rating":1491.4638194905,"_hash":3052741649,"paid_only":false},{"question_id":1807,"title":"替换字符串中的括号内容","title_slug":"evaluate-the-bracket-pairs-of-a-string","rating":1481.960807786,"_hash":59428399,"paid_only":false},{"question_id":1808,"title":"好因子的最大数目","title_slug":"maximize-number-of-nice-divisors","rating":2070.2102619334,"_hash":3237331717,"paid_only":false}],"company":{}},{"contest":{"id":371,"title":"第 233 场周赛","title_slug":"weekly-contest-233","start_time":1616293800,"is_ee_exam_contest":null},"questions":[{"question_id":1800,"title":"最大升序子数组和","title_slug":"maximum-ascending-subarray-sum","rating":1229.1709574783,"_hash":165157096,"paid_only":false},{"question_id":1801,"title":"积压订单中的订单总数","title_slug":"number-of-orders-in-the-backlog","rating":1711.1205064321,"_hash":3504355376,"paid_only":false},{"question_id":1802,"title":"有界数组中指定下标处的最大值","title_slug":"maximum-value-at-a-given-index-in-a-bounded-array","rating":1929.3184180196,"_hash":1767826160,"paid_only":false},{"question_id":1803,"title":"统计异或值在范围内的数对有多少","title_slug":"count-pairs-with-xor-in-a-range","rating":2479.3282985529,"_hash":2711761019,"paid_only":false}],"company":{}},{"contest":{"id":362,"title":"第 48 场双周赛","title_slug":"biweekly-contest-48","start_time":1616250600,"is_ee_exam_contest":null},"questions":[{"question_id":1796,"title":"字符串中第二大的数字","title_slug":"second-largest-digit-in-a-string","rating":1341.8397242604,"_hash":750727980,"paid_only":false},{"question_id":1797,"title":"设计一个验证系统","title_slug":"design-authentication-manager","rating":1534.0648719302,"_hash":3736820092,"paid_only":false},{"question_id":1798,"title":"你能构造出连续值的最大数目","title_slug":"maximum-number-of-consecutive-values-you-can-make","rating":1931.0849921121,"_hash":2407589215,"paid_only":false},{"question_id":1799,"title":"N 次操作后的最大分数和","title_slug":"maximize-score-after-n-operations","rating":2072.7264178313,"_hash":1580991625,"paid_only":false}],"company":{}},{"contest":{"id":363,"title":"第 232 场周赛","title_slug":"weekly-contest-232","start_time":1615689000,"is_ee_exam_contest":null},"questions":[{"question_id":1790,"title":"仅执行一次字符串交换能否使两个字符串相等","title_slug":"check-if-one-string-swap-can-make-strings-equal","rating":1300.8009461582,"_hash":3412927472,"paid_only":false},{"question_id":1791,"title":"找出星型图的中心节点","title_slug":"find-center-of-star-graph","rating":1286.7934718934,"_hash":2043678372,"paid_only":false},{"question_id":1792,"title":"最大平均通过率","title_slug":"maximum-average-pass-ratio","rating":1817.9978644712,"_hash":536430705,"paid_only":false},{"question_id":1793,"title":"好子数组的最大分数","title_slug":"maximum-score-of-a-good-subarray","rating":1945.7515607928,"_hash":3184596428,"paid_only":false}],"company":{}},{"contest":{"id":358,"title":"第 231 场周赛","title_slug":"weekly-contest-231","start_time":1615084200,"is_ee_exam_contest":null},"questions":[{"question_id":1784,"title":"检查二进制字符串字段","title_slug":"check-if-binary-string-has-at-most-one-segment-of-ones","rating":1206.1240971343,"_hash":3988446663,"paid_only":false},{"question_id":1785,"title":"构成特定和需要添加的最少元素","title_slug":"minimum-elements-to-add-to-form-a-given-sum","rating":1432.0967926378,"_hash":3102780834,"paid_only":false},{"question_id":1786,"title":"从第一个节点出发到最后一个节点的受限路径数","title_slug":"number-of-restricted-paths-from-first-to-last-node","rating":2078.5417326415,"_hash":1823999301,"paid_only":false},{"question_id":1787,"title":"使所有区间的异或结果为零","title_slug":"make-the-xor-of-all-segments-equal-to-zero","rating":2640.3824813624,"_hash":2908242202,"paid_only":false}],"company":{}},{"contest":{"id":355,"title":"第 47 场双周赛","title_slug":"biweekly-contest-47","start_time":1615041000,"is_ee_exam_contest":null},"questions":[{"question_id":1779,"title":"找到最近的有相同 X 或 Y 坐标的点","title_slug":"find-nearest-point-that-has-the-same-x-or-y-coordinate","rating":1259.5707438932,"_hash":2844126076,"paid_only":false},{"question_id":1780,"title":"判断一个数字是否可以表示成三的幂的和","title_slug":"check-if-number-is-a-sum-of-powers-of-three","rating":1505.82499953,"_hash":2201981126,"paid_only":false},{"question_id":1781,"title":"所有子字符串美丽值之和","title_slug":"sum-of-beauty-of-all-substrings","rating":1714.6960124182,"_hash":2430259702,"paid_only":false},{"question_id":1782,"title":"统计点对的数目","title_slug":"count-pairs-of-nodes","rating":2457.115574186,"_hash":3015354306,"paid_only":false}],"company":{}},{"contest":{"id":356,"title":"第 230 场周赛","title_slug":"weekly-contest-230","start_time":1614479400,"is_ee_exam_contest":null},"questions":[{"question_id":1773,"title":"统计匹配检索规则的物品数量","title_slug":"count-items-matching-a-rule","rating":1174.8589329736,"_hash":3589125798,"paid_only":false},{"question_id":1774,"title":"最接近目标价格的甜点成本","title_slug":"closest-dessert-cost","rating":1701.7584658834,"_hash":4279348799,"paid_only":false},{"question_id":1775,"title":"通过最少操作次数使数组的和相等","title_slug":"equal-sum-arrays-with-minimum-number-of-operations","rating":1850.4091449367,"_hash":2258141933,"paid_only":false},{"question_id":1776,"title":"车队 II","title_slug":"car-fleet-ii","rating":2530.6905139914,"_hash":1961138257,"paid_only":false}],"company":{}},{"contest":{"id":352,"title":"第 229 场周赛","title_slug":"weekly-contest-229","start_time":1613874600,"is_ee_exam_contest":null},"questions":[{"question_id":1768,"title":"交替合并字符串","title_slug":"merge-strings-alternately","rating":1166.5264284193,"_hash":1210757712,"paid_only":false},{"question_id":1769,"title":"移动所有球到每个盒子所需的最小操作数","title_slug":"minimum-number-of-operations-to-move-all-balls-to-each-box","rating":1294.7724244077,"_hash":1900062857,"paid_only":false},{"question_id":1770,"title":"执行乘法运算的最大分数","title_slug":"maximum-score-from-performing-multiplication-operations","rating":2068.0043466118,"_hash":3231265233,"paid_only":false},{"question_id":1771,"title":"由子序列构造的最长回文串的长度","title_slug":"maximize-palindrome-length-from-subsequences","rating":2182.054452981,"_hash":653475446,"paid_only":false}],"company":{}},{"contest":{"id":349,"title":"第 46 场双周赛","title_slug":"biweekly-contest-46","start_time":1613831400,"is_ee_exam_contest":null},"questions":[{"question_id":1763,"title":"最长的美好子字符串","title_slug":"longest-nice-substring","rating":1521.7133617698,"_hash":2102124703,"paid_only":false},{"question_id":1764,"title":"通过连接另一个数组的子数组得到一个数组","title_slug":"form-array-by-concatenating-subarrays-of-another-array","rating":1588.3835994255,"_hash":2182388811,"paid_only":false},{"question_id":1765,"title":"地图中的最高点","title_slug":"map-of-highest-peak","rating":1782.9801784101,"_hash":2722367436,"paid_only":false},{"question_id":1766,"title":"互质树","title_slug":"tree-of-coprimes","rating":2231.8099102949,"_hash":2806136994,"paid_only":false}],"company":{}},{"contest":{"id":350,"title":"第 228 场周赛","title_slug":"weekly-contest-228","start_time":1613269800,"is_ee_exam_contest":null},"questions":[{"question_id":1758,"title":"生成交替二进制字符串的最少操作数","title_slug":"minimum-changes-to-make-alternating-binary-string","rating":1353.629677812,"_hash":877809104,"paid_only":false},{"question_id":1759,"title":"统计同质子字符串的数目","title_slug":"count-number-of-homogenous-substrings","rating":1490.8990184504,"_hash":2434134348,"paid_only":false},{"question_id":1760,"title":"袋子里最少数目的球","title_slug":"minimum-limit-of-balls-in-a-bag","rating":1939.9323330472,"_hash":3825739123,"paid_only":false},{"question_id":1761,"title":"一个图中连通三元组的最小度数","title_slug":"minimum-degree-of-a-connected-trio-in-a-graph","rating":2005.2755755378,"_hash":1808561792,"paid_only":false}],"company":{}},{"contest":{"id":346,"title":"第 227 场周赛","title_slug":"weekly-contest-227","start_time":1612665000,"is_ee_exam_contest":null},"questions":[{"question_id":1752,"title":"检查数组是否经排序和轮转得到","title_slug":"check-if-array-is-sorted-and-rotated","rating":1324.5320836804,"_hash":2521310070,"paid_only":false},{"question_id":1753,"title":"移除石子的最大得分","title_slug":"maximum-score-from-removing-stones","rating":1487.5826663483,"_hash":185620528,"paid_only":false},{"question_id":1754,"title":"构造字典序最大的合并字符串","title_slug":"largest-merge-of-two-strings","rating":1828.6438563573,"_hash":1951198460,"paid_only":false},{"question_id":1755,"title":"最接近目标值的子序列和","title_slug":"closest-subsequence-sum","rating":2363.5096568214,"_hash":2473812468,"paid_only":false}],"company":{}},{"contest":{"id":343,"title":"第 45 场双周赛","title_slug":"biweekly-contest-45","start_time":1612621800,"is_ee_exam_contest":null},"questions":[{"question_id":1748,"title":"唯一元素的和","title_slug":"sum-of-unique-elements","rating":1228.4824438011,"_hash":1179475752,"paid_only":false},{"question_id":1749,"title":"任意子数组和的绝对值的最大值","title_slug":"maximum-absolute-sum-of-any-subarray","rating":1541.6176288991,"_hash":3267047320,"paid_only":false},{"question_id":1750,"title":"删除字符串两端相同字符后的最短长度","title_slug":"minimum-length-of-string-after-deleting-similar-ends","rating":1501.6846714598,"_hash":3164365433,"paid_only":false},{"question_id":1751,"title":"最多可以参加的会议数目 II","title_slug":"maximum-number-of-events-that-can-be-attended-ii","rating":2040.5621123027,"_hash":1944526967,"paid_only":false}],"company":{}},{"contest":{"id":344,"title":"第 226 场周赛","title_slug":"weekly-contest-226","start_time":1612060200,"is_ee_exam_contest":null},"questions":[{"question_id":1742,"title":"盒子中小球的最大数量","title_slug":"maximum-number-of-balls-in-a-box","rating":1277.9987709491,"_hash":9262188,"paid_only":false},{"question_id":1743,"title":"从相邻元素对还原数组","title_slug":"restore-the-array-from-adjacent-pairs","rating":1579.2309881035,"_hash":1018399535,"paid_only":false},{"question_id":1744,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","title_slug":"can-you-eat-your-favorite-candy-on-your-favorite-day","rating":1858.9581916885,"_hash":3529472171,"paid_only":false},{"question_id":1745,"title":"分割回文串 IV","title_slug":"palindrome-partitioning-iv","rating":1924.964639491,"_hash":1796587921,"paid_only":false}],"company":{}},{"contest":{"id":340,"title":"第 225 场周赛","title_slug":"weekly-contest-225","start_time":1611455400,"is_ee_exam_contest":null},"questions":[{"question_id":1736,"title":"替换隐藏数字得到的最晚时间","title_slug":"latest-time-by-replacing-hidden-digits","rating":1264.4836883082,"_hash":4210364548,"paid_only":false},{"question_id":1737,"title":"满足三条件之一需改变的最少字符数","title_slug":"change-minimum-characters-to-satisfy-one-of-three-conditions","rating":1952.7073399331,"_hash":3302467434,"paid_only":false},{"question_id":1738,"title":"找出第 K 大的异或坐标值","title_slug":"find-kth-largest-xor-coordinate-value","rating":1671.4657554194,"_hash":3021563284,"paid_only":false},{"question_id":1739,"title":"放置盒子","title_slug":"building-boxes","rating":2198.4642973466,"_hash":3570284045,"paid_only":false}],"company":{}},{"contest":{"id":337,"title":"第 44 场双周赛","title_slug":"biweekly-contest-44","start_time":1611412200,"is_ee_exam_contest":null},"questions":[{"question_id":1732,"title":"找到最高海拔","title_slug":"find-the-highest-altitude","rating":1256.6807087287,"_hash":445458274,"paid_only":false},{"question_id":1733,"title":"需要教语言的最少人数","title_slug":"minimum-number-of-people-to-teach","rating":1983.70440706,"_hash":2904534885,"paid_only":false},{"question_id":1734,"title":"解码异或后的排列","title_slug":"decode-xored-permutation","rating":2024.3797833173,"_hash":2691544887,"paid_only":false},{"question_id":1735,"title":"生成乘积数组的方案数","title_slug":"count-ways-to-make-array-with-product","rating":2499.5640490579,"_hash":3183792133,"paid_only":false}],"company":{}},{"contest":{"id":338,"title":"第 224 场周赛","title_slug":"weekly-contest-224","start_time":1610850600,"is_ee_exam_contest":null},"questions":[{"question_id":1725,"title":"可以形成最大正方形的矩形数目","title_slug":"number-of-rectangles-that-can-form-the-largest-square","rating":1229.4850365142,"_hash":2365828386,"paid_only":false},{"question_id":1726,"title":"同积元组","title_slug":"tuple-with-same-product","rating":1530.0343519239,"_hash":3977989551,"paid_only":false},{"question_id":1727,"title":"重新排列后的最大子矩阵","title_slug":"largest-submatrix-with-rearrangements","rating":1926.7059583253,"_hash":1815395495,"paid_only":false},{"question_id":1728,"title":"猫和老鼠 II","title_slug":"cat-and-mouse-ii","rating":2849.4841858619,"_hash":59158142,"paid_only":false}],"company":{}},{"contest":{"id":334,"title":"第 223 场周赛","title_slug":"weekly-contest-223","start_time":1610245800,"is_ee_exam_contest":null},"questions":[{"question_id":1720,"title":"解码异或后的数组","title_slug":"decode-xored-array","rating":1284.4514662456,"_hash":1123666202,"paid_only":false},{"question_id":1721,"title":"交换链表中的节点","title_slug":"swapping-nodes-in-a-linked-list","rating":1386.9203620297,"_hash":4028967949,"paid_only":false},{"question_id":1722,"title":"执行交换操作后的最小汉明距离","title_slug":"minimize-hamming-distance-after-swap-operations","rating":1892.1600619469,"_hash":3235710031,"paid_only":false},{"question_id":1723,"title":"完成所有工作的最短时间","title_slug":"find-minimum-time-to-finish-all-jobs","rating":2284.4463940346,"_hash":3104122930,"paid_only":false}],"company":{}},{"contest":{"id":331,"title":"第 43 场双周赛","title_slug":"biweekly-contest-43","start_time":1610202600,"is_ee_exam_contest":null},"questions":[{"question_id":1716,"title":"计算力扣银行的钱","title_slug":"calculate-money-in-leetcode-bank","rating":1294.5297034757,"_hash":1482821287,"paid_only":false},{"question_id":1717,"title":"删除子字符串的最大得分","title_slug":"maximum-score-from-removing-substrings","rating":1867.9916069568,"_hash":2035720970,"paid_only":false},{"question_id":1718,"title":"构建字典序最大的可行序列","title_slug":"construct-the-lexicographically-largest-valid-sequence","rating":2080.0425875741,"_hash":3869351459,"paid_only":false},{"question_id":1719,"title":"重构一棵树的方案数","title_slug":"number-of-ways-to-reconstruct-a-tree","rating":3018.4940165727,"_hash":254983687,"paid_only":false}],"company":{}},{"contest":{"id":332,"title":"第 222 场周赛","title_slug":"weekly-contest-222","start_time":1609641000,"is_ee_exam_contest":null},"questions":[{"question_id":1710,"title":"卡车上的最大单元数","title_slug":"maximum-units-on-a-truck","rating":1309.8100518373,"_hash":1405988519,"paid_only":false},{"question_id":1711,"title":"大餐计数","title_slug":"count-good-meals","rating":1797.8728515982,"_hash":519326923,"paid_only":false},{"question_id":1712,"title":"将数组分成三个子数组的方案数","title_slug":"ways-to-split-array-into-three-subarrays","rating":2078.6986769435,"_hash":1074334353,"paid_only":false},{"question_id":1713,"title":"得到子序列的最少操作次数","title_slug":"minimum-operations-to-make-a-subsequence","rating":2350.9694374861,"_hash":102575803,"paid_only":false}],"company":{}},{"contest":{"id":328,"title":"第 221 场周赛","title_slug":"weekly-contest-221","start_time":1609036200,"is_ee_exam_contest":null},"questions":[{"question_id":1704,"title":"判断字符串的两半是否相似","title_slug":"determine-if-string-halves-are-alike","rating":1207.7224406285,"_hash":611100168,"paid_only":false},{"question_id":1705,"title":"吃苹果的最大数目","title_slug":"maximum-number-of-eaten-apples","rating":1929.9086934334,"_hash":1687639369,"paid_only":false},{"question_id":1706,"title":"球会落何处","title_slug":"where-will-the-ball-fall","rating":1764.9170564773,"_hash":4006941957,"paid_only":false},{"question_id":1707,"title":"与数组中元素的最大异或值","title_slug":"maximum-xor-with-an-element-from-array","rating":2358.9669560824,"_hash":2768437968,"paid_only":false}],"company":{}},{"contest":{"id":325,"title":"第 42 场双周赛","title_slug":"biweekly-contest-42","start_time":1608993000,"is_ee_exam_contest":null},"questions":[{"question_id":1700,"title":"无法吃午餐的学生数量","title_slug":"number-of-students-unable-to-eat-lunch","rating":1404.1839222,"_hash":2553352145,"paid_only":false},{"question_id":1701,"title":"平均等待时间","title_slug":"average-waiting-time","rating":1436.3892315914,"_hash":2259000228,"paid_only":false},{"question_id":1702,"title":"修改后的最大二进制字符串","title_slug":"maximum-binary-string-after-change","rating":1825.4207082682,"_hash":1632383781,"paid_only":false},{"question_id":1703,"title":"得到连续 K 个 1 的最少相邻交换次数","title_slug":"minimum-adjacent-swaps-for-k-consecutive-ones","rating":2466.8891773908,"_hash":3562926842,"paid_only":false}],"company":{}},{"contest":{"id":326,"title":"第 220 场周赛","title_slug":"weekly-contest-220","start_time":1608431400,"is_ee_exam_contest":null},"questions":[{"question_id":1694,"title":"重新格式化电话号码","title_slug":"reformat-phone-number","rating":1321.9346201204,"_hash":117165936,"paid_only":false},{"question_id":1695,"title":"删除子数组的最大得分","title_slug":"maximum-erasure-value","rating":1528.7183829005,"_hash":3972794115,"paid_only":false},{"question_id":1696,"title":"跳跃游戏 VI","title_slug":"jump-game-vi","rating":1954.2533254344,"_hash":261533544,"paid_only":false},{"question_id":1697,"title":"检查边长度限制的路径是否存在","title_slug":"checking-existence-of-edge-length-limited-paths","rating":2300.1557840589,"_hash":3837200173,"paid_only":false}],"company":{}},{"contest":{"id":322,"title":"第 219 场周赛","title_slug":"weekly-contest-219","start_time":1607826600,"is_ee_exam_contest":null},"questions":[{"question_id":1688,"title":"比赛中的配对次数","title_slug":"count-of-matches-in-tournament","rating":1203.1408035909,"_hash":4026864126,"paid_only":false},{"question_id":1689,"title":"十-二进制数的最少数目","title_slug":"partitioning-into-minimum-number-of-deci-binary-numbers","rating":1355.3825442341,"_hash":2829216648,"paid_only":false},{"question_id":1690,"title":"石子游戏 VII","title_slug":"stone-game-vii","rating":1951.2096212775,"_hash":1168505902,"paid_only":false},{"question_id":1691,"title":"堆叠长方体的最大高度","title_slug":"maximum-height-by-stacking-cuboids","rating":2171.716066664,"_hash":1210455736,"paid_only":false}],"company":{}},{"contest":{"id":318,"title":"第 41 场双周赛","title_slug":"biweekly-contest-41","start_time":1607783400,"is_ee_exam_contest":null},"questions":[{"question_id":1684,"title":"统计一致字符串的数目","title_slug":"count-the-number-of-consistent-strings","rating":1288.5621697906,"_hash":859530118,"paid_only":false},{"question_id":1685,"title":"有序数组中差绝对值之和","title_slug":"sum-of-absolute-differences-in-a-sorted-array","rating":1495.715740828,"_hash":3892578893,"paid_only":false},{"question_id":1686,"title":"石子游戏 VI","title_slug":"stone-game-vi","rating":2000.8441804448,"_hash":1954801587,"paid_only":false},{"question_id":1687,"title":"从仓库到码头运输箱子","title_slug":"delivering-boxes-from-storage-to-ports","rating":2610.0826855063,"_hash":2436117632,"paid_only":false}],"company":{}},{"contest":{"id":319,"title":"第 218 场周赛","title_slug":"weekly-contest-218","start_time":1607221800,"is_ee_exam_contest":null},"questions":[{"question_id":1678,"title":"设计 Goal 解析器","title_slug":"goal-parser-interpretation","rating":1221.9872943569,"_hash":4227366527,"paid_only":false},{"question_id":1679,"title":"K 和数对的最大数目","title_slug":"max-number-of-k-sum-pairs","rating":1345.737168609,"_hash":31900963,"paid_only":false},{"question_id":1680,"title":"连接连续二进制数字","title_slug":"concatenation-of-consecutive-binary-numbers","rating":1629.5416832545,"_hash":1734419421,"paid_only":false},{"question_id":1681,"title":"最小不兼容性","title_slug":"minimum-incompatibility","rating":2389.9634276167,"_hash":2997800679,"paid_only":false}],"company":{}},{"contest":{"id":315,"title":"第 217 场周赛","title_slug":"weekly-contest-217","start_time":1606617000,"is_ee_exam_contest":null},"questions":[{"question_id":1672,"title":"最富有客户的资产总量","title_slug":"richest-customer-wealth","rating":1182.6489068544,"_hash":1487915794,"paid_only":false},{"question_id":1673,"title":"找出最具竞争力的子序列","title_slug":"find-the-most-competitive-subsequence","rating":1802.2256875356,"_hash":3057587548,"paid_only":false},{"question_id":1674,"title":"使数组互补的最少操作次数","title_slug":"minimum-moves-to-make-array-complementary","rating":2333.2401505813,"_hash":3510890976,"paid_only":false},{"question_id":1675,"title":"数组的最小偏移量","title_slug":"minimize-deviation-in-array","rating":2533.3027905062,"_hash":549109709,"paid_only":false}],"company":{}},{"contest":{"id":312,"title":"第 40 场双周赛","title_slug":"biweekly-contest-40","start_time":1606573800,"is_ee_exam_contest":null},"questions":[{"question_id":1668,"title":"最大重复子字符串","title_slug":"maximum-repeating-substring","rating":1395.5132479177,"_hash":1257680587,"paid_only":false},{"question_id":1669,"title":"合并两个链表","title_slug":"merge-in-between-linked-lists","rating":1428.1443796872,"_hash":235206650,"paid_only":false},{"question_id":1670,"title":"设计前中后队列","title_slug":"design-front-middle-back-queue","rating":1610.1866391145,"_hash":1316461889,"paid_only":false},{"question_id":1671,"title":"得到山形数组的最少删除次数","title_slug":"minimum-number-of-removals-to-make-mountain-array","rating":1912.8455659711,"_hash":509699848,"paid_only":false}],"company":{}},{"contest":{"id":313,"title":"第 216 场周赛","title_slug":"weekly-contest-216","start_time":1606012200,"is_ee_exam_contest":null},"questions":[{"question_id":1662,"title":"检查两个字符串数组是否相等","title_slug":"check-if-two-string-arrays-are-equivalent","rating":1217.1184374247,"_hash":340499017,"paid_only":false},{"question_id":1663,"title":"具有给定数值的最小字符串","title_slug":"smallest-string-with-a-given-numeric-value","rating":1460.5903088359,"_hash":438417277,"paid_only":false},{"question_id":1664,"title":"生成平衡数组的方案数","title_slug":"ways-to-make-a-fair-array","rating":1590.269030833,"_hash":435507573,"paid_only":false},{"question_id":1665,"title":"完成所有任务的最少初始能量","title_slug":"minimum-initial-energy-to-finish-tasks","rating":1900.8434122725,"_hash":4008128316,"paid_only":false}],"company":{}},{"contest":{"id":309,"title":"第 215 场周赛","title_slug":"weekly-contest-215","start_time":1605407400,"is_ee_exam_contest":null},"questions":[{"question_id":1656,"title":"设计有序流","title_slug":"design-an-ordered-stream","rating":1418.8205349928,"_hash":2422080240,"paid_only":false},{"question_id":1657,"title":"确定两个字符串是否接近","title_slug":"determine-if-two-strings-are-close","rating":1530.4652027753,"_hash":132633492,"paid_only":false},{"question_id":1658,"title":"将 x 减到 0 的最小操作数","title_slug":"minimum-operations-to-reduce-x-to-zero","rating":1817.224026292,"_hash":307769453,"paid_only":false},{"question_id":1659,"title":"最大化网格幸福感","title_slug":"maximize-grid-happiness","rating":2655.2178711909,"_hash":372608626,"paid_only":false}],"company":{}},{"contest":{"id":306,"title":"第 39 场双周赛","title_slug":"biweekly-contest-39","start_time":1605364200,"is_ee_exam_contest":null},"questions":[{"question_id":1652,"title":"拆炸弹","title_slug":"defuse-the-bomb","rating":1416.8961009909,"_hash":3839572104,"paid_only":false},{"question_id":1653,"title":"使字符串平衡的最少删除次数","title_slug":"minimum-deletions-to-make-string-balanced","rating":1793.8027487553,"_hash":2249718139,"paid_only":false},{"question_id":1654,"title":"到家的最少跳跃次数","title_slug":"minimum-jumps-to-reach-home","rating":2124.0317207867,"_hash":2681795867,"paid_only":false},{"question_id":1655,"title":"分配重复整数","title_slug":"distribute-repeating-integers","rating":2307.0161713185,"_hash":145069778,"paid_only":false}],"company":{}},{"contest":{"id":307,"title":"第 214 场周赛","title_slug":"weekly-contest-214","start_time":1604802600,"is_ee_exam_contest":null},"questions":[{"question_id":1646,"title":"获取生成数组中的最大值","title_slug":"get-maximum-in-generated-array","rating":1301.4027057843,"_hash":3899459924,"paid_only":false},{"question_id":1647,"title":"字符频次唯一的最小删除次数","title_slug":"minimum-deletions-to-make-character-frequencies-unique","rating":1509.5432131875,"_hash":2693685785,"paid_only":false},{"question_id":1648,"title":"销售价值减少的颜色球","title_slug":"sell-diminishing-valued-colored-balls","rating":2050.2553211463,"_hash":4033162779,"paid_only":false},{"question_id":1649,"title":"通过指令创建有序数组","title_slug":"create-sorted-array-through-instructions","rating":2207.8565809952,"_hash":552299541,"paid_only":false}],"company":{}},{"contest":{"id":303,"title":"第 213 场周赛","title_slug":"weekly-contest-213","start_time":1604197800,"is_ee_exam_contest":null},"questions":[{"question_id":1640,"title":"能否连接形成数组","title_slug":"check-array-formation-through-concatenation","rating":1524.3227469,"_hash":1530442140,"paid_only":false},{"question_id":1641,"title":"统计字典序元音字符串的数目","title_slug":"count-sorted-vowel-strings","rating":1519.1715594347,"_hash":2576790821,"paid_only":false},{"question_id":1642,"title":"可以到达的最远建筑","title_slug":"furthest-building-you-can-reach","rating":1962.2005269503,"_hash":1972718658,"paid_only":false},{"question_id":1643,"title":"第 K 条最小指令","title_slug":"kth-smallest-instructions","rating":2079.9846866239,"_hash":2988782714,"paid_only":false}],"company":{}},{"contest":{"id":300,"title":"第 38 场双周赛","title_slug":"biweekly-contest-38","start_time":1604154600,"is_ee_exam_contest":null},"questions":[{"question_id":1636,"title":"按照频率将数组升序排序","title_slug":"sort-array-by-increasing-frequency","rating":1430.3429533629,"_hash":2735293288,"paid_only":false},{"question_id":1637,"title":"两点之间不包含任何点的最宽垂直区域","title_slug":"widest-vertical-area-between-two-points-containing-no-points","rating":1486.764933431,"_hash":3608687869,"paid_only":false},{"question_id":1638,"title":"统计只差一个字符的子串数目","title_slug":"count-substrings-that-differ-by-one-character","rating":1744.7611048301,"_hash":3230369611,"paid_only":false},{"question_id":1639,"title":"通过给定词典构造目标字符串的方案数","title_slug":"number-of-ways-to-form-a-target-string-given-a-dictionary","rating":2081.6909344021,"_hash":4276174201,"paid_only":false}],"company":{}},{"contest":{"id":301,"title":"第 212 场周赛","title_slug":"weekly-contest-212","start_time":1603593000,"is_ee_exam_contest":null},"questions":[{"question_id":1629,"title":"按键持续时间最长的键","title_slug":"slowest-key","rating":1315.3715333947,"_hash":1481976566,"paid_only":false},{"question_id":1630,"title":"等差子数组","title_slug":"arithmetic-subarrays","rating":1421.9944676861,"_hash":3454110996,"paid_only":false},{"question_id":1631,"title":"最小体力消耗路径","title_slug":"path-with-minimum-effort","rating":1947.5013967785,"_hash":3894947933,"paid_only":false},{"question_id":1632,"title":"矩阵转换后的秩","title_slug":"rank-transform-of-a-matrix","rating":2529.5251086936,"_hash":2488135056,"paid_only":false}],"company":{}},{"contest":{"id":297,"title":"第 211 场周赛","title_slug":"weekly-contest-211","start_time":1602988200,"is_ee_exam_contest":null},"questions":[{"question_id":1624,"title":"两个相同字符之间的最长子字符串","title_slug":"largest-substring-between-two-equal-characters","rating":1281.9771427903,"_hash":2249355269,"paid_only":false},{"question_id":1625,"title":"执行操作后字典序最小的字符串","title_slug":"lexicographically-smallest-string-after-applying-operations","rating":1992.0032292739,"_hash":3307683900,"paid_only":false},{"question_id":1626,"title":"无矛盾的最佳球队","title_slug":"best-team-with-no-conflicts","rating":2027.3839266711,"_hash":205364228,"paid_only":false},{"question_id":1627,"title":"带阈值的图连通性","title_slug":"graph-connectivity-with-threshold","rating":2221.3538766773,"_hash":3632361978,"paid_only":false}],"company":{}},{"contest":{"id":294,"title":"第 37 场双周赛","title_slug":"biweekly-contest-37","start_time":1602945000,"is_ee_exam_contest":null},"questions":[{"question_id":1619,"title":"删除某些元素后的数组均值","title_slug":"mean-of-array-after-removing-some-elements","rating":1374.3549007913,"_hash":882246184,"paid_only":false},{"question_id":1620,"title":"网络信号最好的坐标","title_slug":"coordinate-with-maximum-network-quality","rating":1665.24907247,"_hash":1092713458,"paid_only":false},{"question_id":1621,"title":"大小为 K 的不重叠线段的数目","title_slug":"number-of-sets-of-k-non-overlapping-line-segments","rating":2198.3290662783,"_hash":3081794904,"paid_only":false},{"question_id":1622,"title":"奇妙序列","title_slug":"fancy-sequence","rating":2476.451764287,"_hash":976252372,"paid_only":false}],"company":{}},{"contest":{"id":295,"title":"第 210 场周赛","title_slug":"weekly-contest-210","start_time":1602383400,"is_ee_exam_contest":null},"questions":[{"question_id":1614,"title":"括号的最大嵌套深度","title_slug":"maximum-nesting-depth-of-the-parentheses","rating":1322.8302750313,"_hash":2312427727,"paid_only":false},{"question_id":1615,"title":"最大网络秩","title_slug":"maximal-network-rank","rating":1521.9977490324,"_hash":3529094278,"paid_only":false},{"question_id":1616,"title":"分割两个字符串得到回文串","title_slug":"split-two-strings-to-make-palindrome","rating":1868.1914861381,"_hash":1651110316,"paid_only":false},{"question_id":1617,"title":"统计子树中城市之间最大距离","title_slug":"count-subtrees-with-max-distance-between-cities","rating":2308.6545905335,"_hash":540821611,"paid_only":false}],"company":{}},{"contest":{"id":291,"title":"第 209 场周赛","title_slug":"weekly-contest-209","start_time":1601778600,"is_ee_exam_contest":null},"questions":[{"question_id":1608,"title":"特殊数组的特征值","title_slug":"special-array-with-x-elements-greater-than-or-equal-x","rating":1369.614440152,"_hash":2737402297,"paid_only":false},{"question_id":1609,"title":"奇偶树","title_slug":"even-odd-tree","rating":1438.223135905,"_hash":3144113364,"paid_only":false},{"question_id":1610,"title":"可见点的最大数目","title_slug":"maximum-number-of-visible-points","rating":2147.1828941776,"_hash":2493499746,"paid_only":false},{"question_id":1611,"title":"使整数变为 0 的最少操作次数","title_slug":"minimum-one-bit-operations-to-make-integers-zero","rating":2345.3418191684,"_hash":3744485747,"paid_only":false}],"company":{}},{"contest":{"id":288,"title":"第 36 场双周赛","title_slug":"biweekly-contest-36","start_time":1601735400,"is_ee_exam_contest":null},"questions":[{"question_id":1603,"title":"设计停车系统","title_slug":"design-parking-system","rating":1324.1757200103,"_hash":2754272500,"paid_only":false},{"question_id":1604,"title":"警告一小时内使用相同员工卡大于等于三次的人","title_slug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period","rating":1606.2185826486,"_hash":1756727384,"paid_only":false},{"question_id":1605,"title":"给定行和列的和求可行矩阵","title_slug":"find-valid-matrix-given-row-and-column-sums","rating":1867.8619694847,"_hash":2355594556,"paid_only":false},{"question_id":1606,"title":"找到处理最多请求的服务器","title_slug":"find-servers-that-handled-most-number-of-requests","rating":2275.7337818748,"_hash":3246928465,"paid_only":false}],"company":{}},{"contest":{"id":289,"title":"第 208 场周赛","title_slug":"weekly-contest-208","start_time":1601173800,"is_ee_exam_contest":null},"questions":[{"question_id":1598,"title":"文件夹操作日志搜集器","title_slug":"crawler-log-folder","rating":1297.3006230632,"_hash":3772660335,"paid_only":false},{"question_id":1599,"title":"经营摩天轮的最大利润","title_slug":"maximum-profit-of-operating-a-centennial-wheel","rating":1548.0854419238,"_hash":2972412900,"paid_only":false},{"question_id":1600,"title":"王位继承顺序","title_slug":"throne-inheritance","rating":1768.623896829,"_hash":3383805178,"paid_only":false},{"question_id":1601,"title":"最多可达成的换楼请求数目","title_slug":"maximum-number-of-achievable-transfer-requests","rating":2118.7923652824,"_hash":2896936333,"paid_only":false}],"company":{}},{"contest":{"id":278,"title":"第 207 场周赛","title_slug":"weekly-contest-207","start_time":1600569000,"is_ee_exam_contest":null},"questions":[{"question_id":1592,"title":"重新排列单词间的空格","title_slug":"rearrange-spaces-between-words","rating":1362.6613797387,"_hash":3611656717,"paid_only":false},{"question_id":1593,"title":"拆分字符串使唯一子字符串的数目最大","title_slug":"split-a-string-into-the-max-number-of-unique-substrings","rating":1739.5831401172,"_hash":1236982780,"paid_only":false},{"question_id":1594,"title":"矩阵的最大非负积","title_slug":"maximum-non-negative-product-in-a-matrix","rating":1807.4618172386,"_hash":1191385639,"paid_only":false},{"question_id":1595,"title":"连通两组点的最小成本","title_slug":"minimum-cost-to-connect-two-groups-of-points","rating":2537.7965575726,"_hash":883833496,"paid_only":false}],"company":{}},{"contest":{"id":266,"title":"第 35 场双周赛","title_slug":"biweekly-contest-35","start_time":1600525800,"is_ee_exam_contest":null},"questions":[{"question_id":1588,"title":"所有奇数长度子数组的和","title_slug":"sum-of-all-odd-length-subarrays","rating":1408.7923640745,"_hash":1846293530,"paid_only":false},{"question_id":1589,"title":"所有排列中的最大和","title_slug":"maximum-sum-obtained-of-any-permutation","rating":1871.3112059413,"_hash":1702334810,"paid_only":false},{"question_id":1590,"title":"使数组和能被 P 整除","title_slug":"make-sum-divisible-by-p","rating":2038.8592725467,"_hash":2279246890,"paid_only":false},{"question_id":1591,"title":"奇怪的打印机 II","title_slug":"strange-printer-ii","rating":2290.9040038639,"_hash":1646187623,"paid_only":false}],"company":{}},{"contest":{"id":267,"title":"第 206 场周赛","title_slug":"weekly-contest-206","start_time":1599964200,"is_ee_exam_contest":null},"questions":[{"question_id":1582,"title":"二进制矩阵中的特殊位置","title_slug":"special-positions-in-a-binary-matrix","rating":1321.2748903388,"_hash":3877437521,"paid_only":false},{"question_id":1583,"title":"统计不开心的朋友","title_slug":"count-unhappy-friends","rating":1658.3305547865,"_hash":743759650,"paid_only":false},{"question_id":1584,"title":"连接所有点的最小费用","title_slug":"min-cost-to-connect-all-points","rating":1857.6431822094,"_hash":3880639230,"paid_only":false},{"question_id":1585,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","title_slug":"check-if-string-is-transformable-with-substring-sort-operations","rating":2333.0078041754,"_hash":3631493170,"paid_only":false}],"company":{}},{"contest":{"id":260,"title":"第 205 场周赛","title_slug":"weekly-contest-205","start_time":1599359400,"is_ee_exam_contest":null},"questions":[{"question_id":1576,"title":"替换所有的问号","title_slug":"replace-all-s-to-avoid-consecutive-repeating-characters","rating":1368.0043517215,"_hash":4233152869,"paid_only":false},{"question_id":1577,"title":"数的平方等于两数乘积的方法数","title_slug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers","rating":1593.8926580448,"_hash":1260215787,"paid_only":false},{"question_id":1578,"title":"使绳子变成彩色的最短时间","title_slug":"minimum-time-to-make-rope-colorful","rating":1574.0392121288,"_hash":3548853356,"paid_only":false},{"question_id":1579,"title":"保证图可完全遍历","title_slug":"remove-max-number-of-edges-to-keep-graph-fully-traversable","rating":2131.7917160422,"_hash":3698564207,"paid_only":false}],"company":{}},{"contest":{"id":256,"title":"第 34 场双周赛","title_slug":"biweekly-contest-34","start_time":1599316200,"is_ee_exam_contest":null},"questions":[{"question_id":1572,"title":"矩阵对角线元素的和","title_slug":"matrix-diagonal-sum","rating":1280.2941647587,"_hash":197546078,"paid_only":false},{"question_id":1573,"title":"分割字符串的方案数","title_slug":"number-of-ways-to-split-a-string","rating":1590.547713663,"_hash":3464418220,"paid_only":false},{"question_id":1574,"title":"删除最短的子数组使剩余数组有序","title_slug":"shortest-subarray-to-be-removed-to-make-array-sorted","rating":1931.7335479582,"_hash":236080983,"paid_only":false},{"question_id":1575,"title":"统计所有可行路径","title_slug":"count-all-possible-routes","rating":2055.0970201875,"_hash":1387834419,"paid_only":false}],"company":{}},{"contest":{"id":257,"title":"第 204 场周赛","title_slug":"weekly-contest-204","start_time":1598754600,"is_ee_exam_contest":null},"questions":[{"question_id":1566,"title":"重复至少 K 次且长度为 M 的模式","title_slug":"detect-pattern-of-length-m-repeated-k-or-more-times","rating":1486.4687014051,"_hash":843769556,"paid_only":false},{"question_id":1567,"title":"乘积为正数的最长子数组长度","title_slug":"maximum-length-of-subarray-with-positive-product","rating":1710.3243520032,"_hash":2678350009,"paid_only":false},{"question_id":1568,"title":"使陆地分离的最少天数","title_slug":"minimum-number-of-days-to-disconnect-island","rating":2208.5532172086,"_hash":187940940,"paid_only":false},{"question_id":1569,"title":"将子数组重新排序得到同一个二叉搜索树的方案数","title_slug":"number-of-ways-to-reorder-array-to-get-same-bst","rating":2288.2117442123,"_hash":1392708979,"paid_only":false}],"company":{}},{"contest":{"id":244,"title":"第 203 场周赛","title_slug":"weekly-contest-203","start_time":1598149800,"is_ee_exam_contest":null},"questions":[{"question_id":1560,"title":"圆形赛道上经过次数最多的扇区","title_slug":"most-visited-sector-in-a-circular-track","rating":1443.2353621969,"_hash":2434964692,"paid_only":false},{"question_id":1561,"title":"你可以获得的最大硬币数目","title_slug":"maximum-number-of-coins-you-can-get","rating":1405.5786892723,"_hash":2336939814,"paid_only":false},{"question_id":1562,"title":"查找大小为 M 的最新分组","title_slug":"find-latest-group-of-size-m","rating":1928.2304187946,"_hash":239079794,"paid_only":false},{"question_id":1563,"title":"石子游戏 V","title_slug":"stone-game-v","rating":2087.2049275667,"_hash":3581728008,"paid_only":false}],"company":{}},{"contest":{"id":241,"title":"第 33 场双周赛","title_slug":"biweekly-contest-33","start_time":1598106600,"is_ee_exam_contest":null},"questions":[{"question_id":1556,"title":"千位分隔数","title_slug":"thousand-separator","rating":1271.3776510163,"_hash":1619143061,"paid_only":false},{"question_id":1557,"title":"可以到达所有点的最少点数目","title_slug":"minimum-number-of-vertices-to-reach-all-nodes","rating":1512.3323577063,"_hash":4183393481,"paid_only":false},{"question_id":1558,"title":"得到目标数组的最少函数调用次数","title_slug":"minimum-numbers-of-function-calls-to-make-target-array","rating":1637.0082208814,"_hash":2725160392,"paid_only":false},{"question_id":1559,"title":"二维网格图中探测环","title_slug":"detect-cycles-in-2d-grid","rating":1837.8252904904,"_hash":2216360450,"paid_only":false}],"company":{}},{"contest":{"id":242,"title":"第 202 场周赛","title_slug":"weekly-contest-202","start_time":1597545000,"is_ee_exam_contest":null},"questions":[{"question_id":1550,"title":"存在连续三个奇数的数组","title_slug":"three-consecutive-odds","rating":1221.6801628274,"_hash":3686317773,"paid_only":false},{"question_id":1551,"title":"使数组中所有元素相等的最小操作数","title_slug":"minimum-operations-to-make-array-equal","rating":1293.4904281819,"_hash":3168618130,"paid_only":false},{"question_id":1552,"title":"两球之间的磁力","title_slug":"magnetic-force-between-two-balls","rating":1919.7433862082,"_hash":1049961856,"paid_only":false},{"question_id":1553,"title":"吃掉 N 个橘子的最少天数","title_slug":"minimum-number-of-days-to-eat-n-oranges","rating":2048.0976546787,"_hash":3077217367,"paid_only":false}],"company":{}},{"contest":{"id":238,"title":"第 201 场周赛","title_slug":"weekly-contest-201","start_time":1596940200,"is_ee_exam_contest":null},"questions":[{"question_id":1544,"title":"整理字符串","title_slug":"make-the-string-great","rating":1344.226133202,"_hash":3183111073,"paid_only":false},{"question_id":1545,"title":"找出第 N 个二进制字符串中的第 K 位","title_slug":"find-kth-bit-in-nth-binary-string","rating":1479.4837595809,"_hash":886158615,"paid_only":false},{"question_id":1546,"title":"和为目标值且不重叠的非空子数组的最大数目","title_slug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target","rating":1855.377046154,"_hash":2479293617,"paid_only":false},{"question_id":1547,"title":"切棍子的最小成本","title_slug":"minimum-cost-to-cut-a-stick","rating":2116.493528295,"_hash":688063365,"paid_only":false}],"company":{}},{"contest":{"id":237,"title":"第 32 场双周赛","title_slug":"biweekly-contest-32","start_time":1596897000,"is_ee_exam_contest":null},"questions":[{"question_id":1539,"title":"第 k 个缺失的正整数","title_slug":"kth-missing-positive-number","rating":1295.4970938463,"_hash":3184774485,"paid_only":false},{"question_id":1540,"title":"K 次操作转变字符串","title_slug":"can-convert-string-in-k-moves","rating":1631.338145683,"_hash":3391560370,"paid_only":false},{"question_id":1541,"title":"平衡括号字符串的最少插入次数","title_slug":"minimum-insertions-to-balance-a-parentheses-string","rating":1759.0197295594,"_hash":268274286,"paid_only":false},{"question_id":1542,"title":"找出最长的超赞子字符串","title_slug":"find-longest-awesome-substring","rating":2221.7336557442,"_hash":2877331205,"paid_only":false}],"company":{}},{"contest":{"id":235,"title":"第 200 场周赛","title_slug":"weekly-contest-200","start_time":1596335400,"is_ee_exam_contest":null},"questions":[{"question_id":1534,"title":"统计好三元组","title_slug":"count-good-triplets","rating":1279.3383966145,"_hash":1278665216,"paid_only":false},{"question_id":1535,"title":"找出数组游戏的赢家","title_slug":"find-the-winner-of-an-array-game","rating":1433.0795554833,"_hash":3951026299,"paid_only":false},{"question_id":1536,"title":"排布二进制网格的最少交换次数","title_slug":"minimum-swaps-to-arrange-a-binary-grid","rating":1880.5909929633,"_hash":2214262554,"paid_only":false},{"question_id":1537,"title":"最大得分","title_slug":"get-the-maximum-score","rating":1961.4987013156,"_hash":3315363657,"paid_only":false}],"company":{}},{"contest":{"id":228,"title":"第 199 场周赛","title_slug":"weekly-contest-199","start_time":1595730600,"is_ee_exam_contest":null},"questions":[{"question_id":1528,"title":"重新排列字符串","title_slug":"shuffle-string","rating":1193.1328299324,"_hash":3940769236,"paid_only":false},{"question_id":1529,"title":"最少的后缀翻转次数","title_slug":"minimum-suffix-flips","rating":1392.6601629182,"_hash":2324786150,"paid_only":false},{"question_id":1530,"title":"好叶子节点对的数量","title_slug":"number-of-good-leaf-nodes-pairs","rating":1745.6580748712,"_hash":909563687,"paid_only":false},{"question_id":1531,"title":"压缩字符串 II","title_slug":"string-compression-ii","rating":2575.9570281316,"_hash":2845488076,"paid_only":false}],"company":{}},{"contest":{"id":232,"title":"第 31 场双周赛","title_slug":"biweekly-contest-31","start_time":1595687400,"is_ee_exam_contest":null},"questions":[{"question_id":1523,"title":"在区间范围内统计奇数数目","title_slug":"count-odd-numbers-in-an-interval-range","rating":1209.3722198224,"_hash":1294188975,"paid_only":false},{"question_id":1524,"title":"和为奇数的子数组数目","title_slug":"number-of-sub-arrays-with-odd-sum","rating":1610.569398159,"_hash":1757955047,"paid_only":false},{"question_id":1525,"title":"字符串的好分割数目","title_slug":"number-of-good-ways-to-split-a-string","rating":1499.7136257352,"_hash":1226888142,"paid_only":false},{"question_id":1526,"title":"形成目标数组的子数组最少增加次数","title_slug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array","rating":1872.0350138774,"_hash":374038880,"paid_only":false}],"company":{}},{"contest":{"id":226,"title":"第 198 场周赛","title_slug":"weekly-contest-198","start_time":1595125800,"is_ee_exam_contest":null},"questions":[{"question_id":1518,"title":"换水问题","title_slug":"water-bottles","rating":1245.2999833877,"_hash":2655862888,"paid_only":false},{"question_id":1519,"title":"子树中标签相同的节点数","title_slug":"number-of-nodes-in-the-sub-tree-with-the-same-label","rating":1808.787108831,"_hash":2964689219,"paid_only":false},{"question_id":1520,"title":"最多的不重叠子字符串","title_slug":"maximum-number-of-non-overlapping-substrings","rating":2362.6480880348,"_hash":2687486440,"paid_only":false},{"question_id":1521,"title":"找到最接近目标值的函数值","title_slug":"find-a-value-of-a-mysterious-function-closest-to-target","rating":2383.7724811656,"_hash":3856718514,"paid_only":false}],"company":{}},{"contest":{"id":221,"title":"第 197 场周赛","title_slug":"weekly-contest-197","start_time":1594521000,"is_ee_exam_contest":null},"questions":[{"question_id":1512,"title":"好数对的数目","title_slug":"number-of-good-pairs","rating":1160.8899403409,"_hash":1299928804,"paid_only":false},{"question_id":1513,"title":"仅含 1 的子串数","title_slug":"number-of-substrings-with-only-1s","rating":1351.4184681108,"_hash":2562103296,"paid_only":false},{"question_id":1514,"title":"概率最大的路径","title_slug":"path-with-maximum-probability","rating":1846.4077077642,"_hash":1014740120,"paid_only":false},{"question_id":1515,"title":"服务中心的最佳位置","title_slug":"best-position-for-a-service-centre","rating":2156.9515428364,"_hash":4201921653,"paid_only":false}],"company":{}},{"contest":{"id":222,"title":"第 30 场双周赛","title_slug":"biweekly-contest-30","start_time":1594477800,"is_ee_exam_contest":null},"questions":[{"question_id":1507,"title":"转变日期格式","title_slug":"reformat-date","rating":1283.51021448,"_hash":143031678,"paid_only":false},{"question_id":1508,"title":"子数组和排序后的区间和","title_slug":"range-sum-of-sorted-subarray-sums","rating":1402.0863615706,"_hash":1762249323,"paid_only":false},{"question_id":1509,"title":"三次操作后最大值与最小值的最小差","title_slug":"minimum-difference-between-largest-and-smallest-value-in-three-moves","rating":1653.0356626499,"_hash":929645229,"paid_only":false},{"question_id":1510,"title":"石子游戏 IV","title_slug":"stone-game-iv","rating":1786.9268132617,"_hash":2203655753,"paid_only":false}],"company":{}},{"contest":{"id":219,"title":"第 196 场周赛","title_slug":"weekly-contest-196","start_time":1593916200,"is_ee_exam_contest":null},"questions":[{"question_id":1502,"title":"判断能否形成等差数列","title_slug":"can-make-arithmetic-progression-from-sequence","rating":1154.828067979,"_hash":2581904260,"paid_only":false},{"question_id":1503,"title":"所有蚂蚁掉下来前的最后一刻","title_slug":"last-moment-before-all-ants-fall-out-of-a-plank","rating":1618.6016480451,"_hash":1365148367,"paid_only":false},{"question_id":1504,"title":"统计全 1 子矩形","title_slug":"count-submatrices-with-all-ones","rating":1845.0428731248,"_hash":3023068102,"paid_only":false},{"question_id":1505,"title":"最多 K 次交换相邻数位后得到的最小整数","title_slug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits","rating":2336.5210003185,"_hash":1218347826,"paid_only":false}],"company":{}},{"contest":{"id":215,"title":"第 195 场周赛","title_slug":"weekly-contest-195","start_time":1593311400,"is_ee_exam_contest":null},"questions":[{"question_id":1496,"title":"判断路径是否相交","title_slug":"path-crossing","rating":1508.099765827,"_hash":3461348977,"paid_only":false},{"question_id":1497,"title":"检查数组对是否可以被 k 整除","title_slug":"check-if-array-pairs-are-divisible-by-k","rating":1787.2310751136,"_hash":1924690238,"paid_only":false},{"question_id":1498,"title":"满足条件的子序列数目","title_slug":"number-of-subsequences-that-satisfy-the-given-sum-condition","rating":2276.4233585631,"_hash":2057048497,"paid_only":false},{"question_id":1499,"title":"满足不等式的最大值","title_slug":"max-value-of-equation","rating":2456.3900212097,"_hash":446968474,"paid_only":false}],"company":{}},{"contest":{"id":216,"title":"第 29 场双周赛","title_slug":"biweekly-contest-29","start_time":1593268200,"is_ee_exam_contest":null},"questions":[{"question_id":1491,"title":"去掉最低工资和最高工资后的工资平均值","title_slug":"average-salary-excluding-the-minimum-and-maximum-salary","rating":1201.3497763919,"_hash":4253187558,"paid_only":false},{"question_id":1492,"title":"n 的第 k 个因子","title_slug":"the-kth-factor-of-n","rating":1231.999241335,"_hash":2168825861,"paid_only":false},{"question_id":1493,"title":"删掉一个元素以后全为 1 的最长子数组","title_slug":"longest-subarray-of-1s-after-deleting-one-element","rating":1423.0355763093,"_hash":3989735780,"paid_only":false},{"question_id":1494,"title":"并行课程 II","title_slug":"parallel-courses-ii","rating":2081.8087755451,"_hash":2963413938,"paid_only":false}],"company":{}},{"contest":{"id":213,"title":"第 194 场周赛","title_slug":"weekly-contest-194","start_time":1592706600,"is_ee_exam_contest":null},"questions":[{"question_id":1486,"title":"数组异或操作","title_slug":"xor-operation-in-an-array","rating":1180.923623906,"_hash":1038100878,"paid_only":false},{"question_id":1487,"title":"保证文件名唯一","title_slug":"making-file-names-unique","rating":1696.9920075471,"_hash":3554577128,"paid_only":false},{"question_id":1488,"title":"避免洪水泛滥","title_slug":"avoid-flood-in-the-city","rating":1973.7407637067,"_hash":178132881,"paid_only":false},{"question_id":1489,"title":"找到最小生成树里的关键边和伪关键边","title_slug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree","rating":2571.552028121,"_hash":2415029607,"paid_only":false}],"company":{}},{"contest":{"id":209,"title":"第 193 场周赛","title_slug":"weekly-contest-193","start_time":1592101800,"is_ee_exam_contest":null},"questions":[{"question_id":1480,"title":"一维数组的动态和","title_slug":"running-sum-of-1d-array","rating":1104.7359028407,"_hash":1062871842,"paid_only":false},{"question_id":1481,"title":"不同整数的最少数目","title_slug":"least-number-of-unique-integers-after-k-removals","rating":1284.3625733813,"_hash":970766553,"paid_only":false},{"question_id":1482,"title":"制作 m 束花所需的最少天数","title_slug":"minimum-number-of-days-to-make-m-bouquets","rating":1945.5095833982,"_hash":1858278973,"paid_only":false},{"question_id":1483,"title":"树节点的第 K 个祖先","title_slug":"kth-ancestor-of-a-tree-node","rating":2115.0911494487,"_hash":2000679742,"paid_only":false}],"company":{}},{"contest":{"id":210,"title":"第 28 场双周赛","title_slug":"biweekly-contest-28","start_time":1592058600,"is_ee_exam_contest":null},"questions":[{"question_id":1475,"title":"商品折扣后的最终价格","title_slug":"final-prices-with-a-special-discount-in-a-shop","rating":1212.2606422181,"_hash":3670047480,"paid_only":false},{"question_id":1476,"title":"子矩形查询","title_slug":"subrectangle-queries","rating":1326.4047670018,"_hash":3615903863,"paid_only":false},{"question_id":1477,"title":"找两个和为目标值且不重叠的子数组","title_slug":"find-two-non-overlapping-sub-arrays-each-with-target-sum","rating":1850.5506342426,"_hash":1480774126,"paid_only":false},{"question_id":1478,"title":"安排邮筒","title_slug":"allocate-mailboxes","rating":2190.1757477854,"_hash":2258623827,"paid_only":false}],"company":{}},{"contest":{"id":207,"title":"第 192 场周赛","title_slug":"weekly-contest-192","start_time":1591497000,"is_ee_exam_contest":null},"questions":[{"question_id":1470,"title":"重新排列数组","title_slug":"shuffle-the-array","rating":1120.698183624,"_hash":739255468,"paid_only":false},{"question_id":1471,"title":"数组中的 k 个最强值","title_slug":"the-k-strongest-values-in-an-array","rating":1332.4653491345,"_hash":1337689329,"paid_only":false},{"question_id":1472,"title":"设计浏览器历史记录","title_slug":"design-browser-history","rating":1453.7818053022,"_hash":791863919,"paid_only":false},{"question_id":1473,"title":"粉刷房子 III","title_slug":"paint-house-iii","rating":2056.335494216,"_hash":741778858,"paid_only":false}],"company":{}},{"contest":{"id":203,"title":"第 191 场周赛","title_slug":"weekly-contest-191","start_time":1590892200,"is_ee_exam_contest":null},"questions":[{"question_id":1464,"title":"数组中两元素的最大乘积","title_slug":"maximum-product-of-two-elements-in-an-array","rating":1121.0677596555,"_hash":1656858690,"paid_only":false},{"question_id":1465,"title":"切割后面积最大的蛋糕","title_slug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts","rating":1444.6098846511,"_hash":4281929868,"paid_only":false},{"question_id":1466,"title":"重新规划路线","title_slug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero","rating":1633.6202302555,"_hash":249521607,"paid_only":false},{"question_id":1467,"title":"两个盒子中球的颜色数相同的概率","title_slug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls","rating":2356.5811122453,"_hash":338661942,"paid_only":false}],"company":{}},{"contest":{"id":204,"title":"第 27 场双周赛","title_slug":"biweekly-contest-27","start_time":1590849000,"is_ee_exam_contest":null},"questions":[{"question_id":1460,"title":"通过翻转子数组使两个数组相等","title_slug":"make-two-arrays-equal-by-reversing-subarrays","rating":1151.5250329621,"_hash":2597701503,"paid_only":false},{"question_id":1461,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","title_slug":"check-if-a-string-contains-all-binary-codes-of-size-k","rating":1504.0178888667,"_hash":1013970586,"paid_only":false},{"question_id":1462,"title":"课程表 IV","title_slug":"course-schedule-iv","rating":1692.5884631801,"_hash":2046402802,"paid_only":false},{"question_id":1463,"title":"摘樱桃 II","title_slug":"cherry-pickup-ii","rating":1956.7059585934,"_hash":3773526508,"paid_only":false}],"company":{}},{"contest":{"id":201,"title":"第 190 场周赛","title_slug":"weekly-contest-190","start_time":1590287400,"is_ee_exam_contest":null},"questions":[{"question_id":1455,"title":"检查单词是否为句中其他单词的前缀","title_slug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence","rating":1125.575238274,"_hash":1403314808,"paid_only":false},{"question_id":1456,"title":"定长子串中元音的最大数目","title_slug":"maximum-number-of-vowels-in-a-substring-of-given-length","rating":1263.2728668041,"_hash":3013367275,"paid_only":false},{"question_id":1457,"title":"二叉树中的伪回文路径","title_slug":"pseudo-palindromic-paths-in-a-binary-tree","rating":1405.0021415178,"_hash":3010901510,"paid_only":false},{"question_id":1458,"title":"两个子序列的最大点积","title_slug":"max-dot-product-of-two-subsequences","rating":1823.5831437787,"_hash":4061458273,"paid_only":false}],"company":{}},{"contest":{"id":197,"title":"第 189 场周赛","title_slug":"weekly-contest-189","start_time":1589682600,"is_ee_exam_contest":null},"questions":[{"question_id":1450,"title":"在既定时间做作业的学生人数","title_slug":"number-of-students-doing-homework-at-a-given-time","rating":1129.3432988996,"_hash":3894678842,"paid_only":false},{"question_id":1451,"title":"重新排列句子中的单词","title_slug":"rearrange-words-in-a-sentence","rating":1309.3113721825,"_hash":440206256,"paid_only":false},{"question_id":1452,"title":"收藏清单","title_slug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list","rating":1562.9186033202,"_hash":2809882420,"paid_only":false},{"question_id":1453,"title":"圆形靶内的最大飞镖数量","title_slug":"maximum-number-of-darts-inside-of-a-circular-dartboard","rating":2201.8209584221,"_hash":1442274557,"paid_only":false}],"company":{}},{"contest":{"id":198,"title":"第 26 场双周赛","title_slug":"biweekly-contest-26","start_time":1589639400,"is_ee_exam_contest":null},"questions":[{"question_id":1446,"title":"连续字符","title_slug":"consecutive-characters","rating":1165.4768151611,"_hash":1368317464,"paid_only":false},{"question_id":1447,"title":"最简分数","title_slug":"simplified-fractions","rating":1268.5768566953,"_hash":2797831681,"paid_only":false},{"question_id":1448,"title":"统计二叉树中好节点的数目","title_slug":"count-good-nodes-in-binary-tree","rating":1360.2184128413,"_hash":169616499,"paid_only":false},{"question_id":1449,"title":"数位成本和为目标值的最大数字","title_slug":"form-largest-integer-with-digits-that-add-up-to-target","rating":1927.4000816649,"_hash":1490454383,"paid_only":false}],"company":{}},{"contest":{"id":195,"title":"第 188 场周赛","title_slug":"weekly-contest-188","start_time":1589077800,"is_ee_exam_contest":null},"questions":[{"question_id":1441,"title":"用栈操作构建数组","title_slug":"build-an-array-with-stack-operations","rating":1180.3543157775,"_hash":1137656154,"paid_only":false},{"question_id":1442,"title":"形成两个异或相等数组的三元组数目","title_slug":"count-triplets-that-can-form-two-arrays-of-equal-xor","rating":1524.5693481538,"_hash":594551983,"paid_only":false},{"question_id":1443,"title":"收集树上所有苹果的最少时间","title_slug":"minimum-time-to-collect-all-apples-in-a-tree","rating":1682.8882177724,"_hash":943252793,"paid_only":false},{"question_id":1444,"title":"切披萨的方案数","title_slug":"number-of-ways-of-cutting-a-pizza","rating":2126.6864346508,"_hash":1744896373,"paid_only":false}],"company":{}},{"contest":{"id":191,"title":"第 187 场周赛","title_slug":"weekly-contest-187","start_time":1588473000,"is_ee_exam_contest":null},"questions":[{"question_id":1436,"title":"旅行终点站","title_slug":"destination-city","rating":1192.3167969426,"_hash":3794347985,"paid_only":false},{"question_id":1437,"title":"是否所有 1 都至少相隔 k 个元素","title_slug":"check-if-all-1s-are-at-least-length-k-places-away","rating":1193.2687290573,"_hash":439231056,"paid_only":false},{"question_id":1438,"title":"绝对差不超过限制的最长连续子数组","title_slug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit","rating":1672.1678031263,"_hash":3188904029,"paid_only":false},{"question_id":1439,"title":"有序矩阵中的第 k 个最小数组和","title_slug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows","rating":2133.9592509012,"_hash":2634383093,"paid_only":false}],"company":{}},{"contest":{"id":192,"title":"第 25 场双周赛","title_slug":"biweekly-contest-25","start_time":1588429800,"is_ee_exam_contest":null},"questions":[{"question_id":1431,"title":"拥有最多糖果的孩子","title_slug":"kids-with-the-greatest-number-of-candies","rating":1176.4547272896,"_hash":3057194499,"paid_only":false},{"question_id":1432,"title":"改变一个整数能得到的最大差值","title_slug":"max-difference-you-can-get-from-changing-an-integer","rating":1426.7384112327,"_hash":4162693857,"paid_only":false},{"question_id":1433,"title":"检查一个字符串是否可以打破另一个字符串","title_slug":"check-if-a-string-can-break-another-string","rating":1436.1125054038,"_hash":2646645546,"paid_only":false},{"question_id":1434,"title":"每个人戴不同帽子的方案数","title_slug":"number-of-ways-to-wear-different-hats-to-each-other","rating":2273.2215764545,"_hash":860689371,"paid_only":false}],"company":{}},{"contest":{"id":185,"title":"第 186 场周赛","title_slug":"weekly-contest-186","start_time":1587868200,"is_ee_exam_contest":null},"questions":[{"question_id":1422,"title":"分割字符串的最大得分","title_slug":"maximum-score-after-splitting-a-string","rating":1237.7565585875,"_hash":3778856012,"paid_only":false},{"question_id":1423,"title":"可获得的最大点数","title_slug":"maximum-points-you-can-obtain-from-cards","rating":1573.824807946,"_hash":3552570937,"paid_only":false},{"question_id":1424,"title":"对角线遍历 II","title_slug":"diagonal-traverse-ii","rating":1779.8364613072,"_hash":2316551160,"paid_only":false},{"question_id":1425,"title":"带限制的子序列和","title_slug":"constrained-subsequence-sum","rating":2032.4773038683,"_hash":1691609067,"paid_only":false}],"company":{}},{"contest":{"id":177,"title":"第 185 场周赛","title_slug":"weekly-contest-185","start_time":1587263400,"is_ee_exam_contest":null},"questions":[{"question_id":1417,"title":"重新格式化字符串","title_slug":"reformat-the-string","rating":1241.9262857175,"_hash":3440205245,"paid_only":false},{"question_id":1418,"title":"点菜展示表","title_slug":"display-table-of-food-orders-in-a-restaurant","rating":1485.135401269,"_hash":3975371411,"paid_only":false},{"question_id":1419,"title":"数青蛙","title_slug":"minimum-number-of-frogs-croaking","rating":1689.7569144085,"_hash":1565798166,"paid_only":false},{"question_id":1420,"title":"生成数组","title_slug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons","rating":2175.6850426027,"_hash":4023565195,"paid_only":false}],"company":{}},{"contest":{"id":178,"title":"第 24 场双周赛","title_slug":"biweekly-contest-24","start_time":1587220200,"is_ee_exam_contest":null},"questions":[{"question_id":1413,"title":"逐步求和得到正数的最小值","title_slug":"minimum-value-to-get-positive-step-by-step-sum","rating":1212.2309421538,"_hash":3593932314,"paid_only":false},{"question_id":1414,"title":"和为 K 的最少斐波那契数字数目","title_slug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k","rating":1465.7023558248,"_hash":1463291583,"paid_only":false},{"question_id":1415,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","title_slug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n","rating":1575.6324598387,"_hash":1620228801,"paid_only":false},{"question_id":1416,"title":"恢复数组","title_slug":"restore-the-array","rating":1919.6391896894,"_hash":3484470279,"paid_only":false}],"company":{}},{"contest":{"id":175,"title":"第 184 场周赛","title_slug":"weekly-contest-184","start_time":1586658600,"is_ee_exam_contest":null},"questions":[{"question_id":1408,"title":"数组中的字符串匹配","title_slug":"string-matching-in-an-array","rating":1223.3861903833,"_hash":2154696316,"paid_only":false},{"question_id":1409,"title":"查询带键的排列","title_slug":"queries-on-a-permutation-with-key","rating":1334.5718985411,"_hash":1238400837,"paid_only":false},{"question_id":1410,"title":"HTML 实体解析器","title_slug":"html-entity-parser","rating":1405.4005354401,"_hash":1452093256,"paid_only":false},{"question_id":1411,"title":"给 N x 3 网格图涂色的方案数","title_slug":"number-of-ways-to-paint-n-3-grid","rating":1844.6289439644,"_hash":3628711002,"paid_only":false}],"company":{}},{"contest":{"id":168,"title":"第 183 场周赛","title_slug":"weekly-contest-183","start_time":1586053800,"is_ee_exam_contest":null},"questions":[{"question_id":1403,"title":"非递增顺序的最小子序列","title_slug":"minimum-subsequence-in-non-increasing-order","rating":1288.1970048184,"_hash":3066842082,"paid_only":false},{"question_id":1404,"title":"将二进制表示减到 1 的步骤数","title_slug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one","rating":1396.5990609759,"_hash":1438800814,"paid_only":false},{"question_id":1405,"title":"最长快乐字符串","title_slug":"longest-happy-string","rating":1820.58557644,"_hash":1311726140,"paid_only":false},{"question_id":1406,"title":"石子游戏 III","title_slug":"stone-game-iii","rating":2026.8957817007,"_hash":3979947991,"paid_only":false}],"company":{}},{"contest":{"id":169,"title":"第 23 场双周赛","title_slug":"biweekly-contest-23","start_time":1586010600,"is_ee_exam_contest":null},"questions":[{"question_id":1399,"title":"统计最大组的数目","title_slug":"count-largest-group","rating":1341.0476642293,"_hash":1417435719,"paid_only":false},{"question_id":1400,"title":"构造 K 个回文字符串","title_slug":"construct-k-palindrome-strings","rating":1530.495439788,"_hash":2205913729,"paid_only":false},{"question_id":1401,"title":"圆和矩形是否有重叠","title_slug":"circle-and-rectangle-overlapping","rating":1708.9983361411,"_hash":1192302071,"paid_only":false},{"question_id":1402,"title":"做菜顺序","title_slug":"reducing-dishes","rating":1679.2607152001,"_hash":3261672467,"paid_only":false}],"company":{}},{"contest":{"id":166,"title":"第 182 场周赛","title_slug":"weekly-contest-182","start_time":1585449000,"is_ee_exam_contest":null},"questions":[{"question_id":1394,"title":"找出数组中的幸运数","title_slug":"find-lucky-integer-in-an-array","rating":1118.1080334618,"_hash":3411465392,"paid_only":false},{"question_id":1395,"title":"统计作战单位数","title_slug":"count-number-of-teams","rating":1343.628913055,"_hash":824074855,"paid_only":false},{"question_id":1396,"title":"设计地铁系统","title_slug":"design-underground-system","rating":1464.5254961488,"_hash":1788773531,"paid_only":false},{"question_id":1397,"title":"找到所有好字符串","title_slug":"find-all-good-strings","rating":2666.668150845,"_hash":3549637617,"paid_only":false}],"company":{}},{"contest":{"id":162,"title":"第 181 场周赛","title_slug":"weekly-contest-181","start_time":1584844200,"is_ee_exam_contest":null},"questions":[{"question_id":1389,"title":"按既定顺序创建目标数组","title_slug":"create-target-array-in-the-given-order","rating":1208.0417047337,"_hash":1969742700,"paid_only":false},{"question_id":1390,"title":"四因数","title_slug":"four-divisors","rating":1478.3848028264,"_hash":3989268391,"paid_only":false},{"question_id":1391,"title":"检查网格中是否存在有效路径","title_slug":"check-if-there-is-a-valid-path-in-a-grid","rating":1745.6490739887,"_hash":650356357,"paid_only":false},{"question_id":1392,"title":"最长快乐前缀","title_slug":"longest-happy-prefix","rating":1876.146019008,"_hash":3616385781,"paid_only":false}],"company":{}},{"contest":{"id":163,"title":"第 22 场双周赛","title_slug":"biweekly-contest-22","start_time":1584801000,"is_ee_exam_contest":null},"questions":[{"question_id":1385,"title":"两个数组间的距离值","title_slug":"find-the-distance-value-between-two-arrays","rating":1234.8049089605,"_hash":3833659931,"paid_only":false},{"question_id":1386,"title":"安排电影院座位","title_slug":"cinema-seat-allocation","rating":1636.6877598712,"_hash":3214600049,"paid_only":false},{"question_id":1387,"title":"将整数按权重排序","title_slug":"sort-integers-by-the-power-value","rating":1506.8958220609,"_hash":3793928653,"paid_only":false},{"question_id":1388,"title":"3n 块披萨","title_slug":"pizza-with-3n-slices","rating":2409.7580728676,"_hash":4187483922,"paid_only":false}],"company":{}},{"contest":{"id":160,"title":"第 180 场周赛","title_slug":"weekly-contest-180","start_time":1584239400,"is_ee_exam_contest":null},"questions":[{"question_id":1380,"title":"矩阵中的幸运数","title_slug":"lucky-numbers-in-a-matrix","rating":1207.7810914125,"_hash":2306188300,"paid_only":false},{"question_id":1381,"title":"设计一个支持增量操作的栈","title_slug":"design-a-stack-with-increment-operation","rating":1285.9726675488,"_hash":3915832963,"paid_only":false},{"question_id":1382,"title":"将二叉搜索树变平衡","title_slug":"balance-a-binary-search-tree","rating":1540.5750839091,"_hash":1937730923,"paid_only":false},{"question_id":1383,"title":"最大的团队表现值","title_slug":"maximum-performance-of-a-team","rating":2091.3820373571,"_hash":1997987860,"paid_only":false}],"company":{}},{"contest":{"id":156,"title":"第 179 场周赛","title_slug":"weekly-contest-179","start_time":1583634600,"is_ee_exam_contest":null},"questions":[{"question_id":1374,"title":"生成每种字符都是奇数个的字符串","title_slug":"generate-a-string-with-characters-that-have-odd-counts","rating":1164.0227691933,"_hash":4034922554,"paid_only":false},{"question_id":1375,"title":"二进制字符串前缀一致的次数","title_slug":"number-of-times-binary-string-is-prefix-aligned","rating":1438.8988489545,"_hash":1637468390,"paid_only":false},{"question_id":1376,"title":"通知所有员工所需的时间","title_slug":"time-needed-to-inform-all-employees","rating":1561.0553908973,"_hash":2222019296,"paid_only":false},{"question_id":1377,"title":"T 秒后青蛙的位置","title_slug":"frog-position-after-t-seconds","rating":1823.8779711373,"_hash":1364762739,"paid_only":false}],"company":{}},{"contest":{"id":157,"title":"第 21 场双周赛","title_slug":"biweekly-contest-21","start_time":1583591400,"is_ee_exam_contest":null},"questions":[{"question_id":1370,"title":"上升下降字符串","title_slug":"increasing-decreasing-string","rating":1369.0053354603,"_hash":2860419980,"paid_only":false},{"question_id":1371,"title":"每个元音包含偶数次的最长子字符串","title_slug":"find-the-longest-substring-containing-vowels-in-even-counts","rating":2040.539289037,"_hash":2810226521,"paid_only":false},{"question_id":1372,"title":"二叉树中的最长交错路径","title_slug":"longest-zigzag-path-in-a-binary-tree","rating":1713.2768268466,"_hash":3877013643,"paid_only":false},{"question_id":1373,"title":"二叉搜索子树的最大键值和","title_slug":"maximum-sum-bst-in-binary-tree","rating":1913.6704728453,"_hash":2919642920,"paid_only":false}],"company":{}},{"contest":{"id":154,"title":"第 178 场周赛","title_slug":"weekly-contest-178","start_time":1583029800,"is_ee_exam_contest":null},"questions":[{"question_id":1365,"title":"有多少小于当前数字的数字","title_slug":"how-many-numbers-are-smaller-than-the-current-number","rating":1152.1377893605,"_hash":2310137574,"paid_only":false},{"question_id":1366,"title":"通过投票对团队排名","title_slug":"rank-teams-by-votes","rating":1626.3266982141,"_hash":2939618078,"paid_only":false},{"question_id":1367,"title":"二叉树中的链表","title_slug":"linked-list-in-binary-tree","rating":1649.9728054796,"_hash":3956966956,"paid_only":false},{"question_id":1368,"title":"使网格图至少有一条有效路径的最小代价","title_slug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid","rating":2068.806637566,"_hash":2875388393,"paid_only":false}],"company":{}},{"contest":{"id":148,"title":"第 177 场周赛","title_slug":"weekly-contest-177","start_time":1582425000,"is_ee_exam_contest":null},"questions":[{"question_id":1360,"title":"日期之间隔几天","title_slug":"number-of-days-between-two-dates","rating":1421.6541140049,"_hash":686429748,"paid_only":false},{"question_id":1361,"title":"验证二叉树","title_slug":"validate-binary-tree-nodes","rating":1464.6895034875,"_hash":124339070,"paid_only":false},{"question_id":1362,"title":"最接近的因数","title_slug":"closest-divisors","rating":1533.9285875234,"_hash":2721035468,"paid_only":false},{"question_id":1363,"title":"形成三的最大倍数","title_slug":"largest-multiple-of-three","rating":1822.9768689716,"_hash":3298734473,"paid_only":false}],"company":{}},{"contest":{"id":149,"title":"第 20 场双周赛","title_slug":"biweekly-contest-20","start_time":1582381800,"is_ee_exam_contest":null},"questions":[{"question_id":1356,"title":"根据数字二进制下 1 的数目排序","title_slug":"sort-integers-by-the-number-of-1-bits","rating":1257.7082143289,"_hash":3189584402,"paid_only":false},{"question_id":1357,"title":"每隔 n 个顾客打折","title_slug":"apply-discount-every-n-orders","rating":1429.6349292399,"_hash":920111034,"paid_only":false},{"question_id":1358,"title":"包含所有三种字符的子字符串数目","title_slug":"number-of-substrings-containing-all-three-characters","rating":1646.1943237127,"_hash":3495355750,"paid_only":false},{"question_id":1359,"title":"有效的快递序列数目","title_slug":"count-all-valid-pickup-and-delivery-options","rating":1722.8129701098,"_hash":3432459628,"paid_only":false}],"company":{}},{"contest":{"id":147,"title":"第 176 场周赛","title_slug":"weekly-contest-176","start_time":1581820200,"is_ee_exam_contest":null},"questions":[{"question_id":1351,"title":"统计有序矩阵中的负数","title_slug":"count-negative-numbers-in-a-sorted-matrix","rating":1139.4248492279,"_hash":474089455,"paid_only":false},{"question_id":1352,"title":"最后 K 个数的乘积","title_slug":"product-of-the-last-k-numbers","rating":1473.7057465272,"_hash":2948668320,"paid_only":false},{"question_id":1353,"title":"最多可以参加的会议数目","title_slug":"maximum-number-of-events-that-can-be-attended","rating":2015.7291888336,"_hash":2529461898,"paid_only":false},{"question_id":1354,"title":"多次求和构造目标数组","title_slug":"construct-target-array-with-multiple-sums","rating":2014.7655493665,"_hash":681133837,"paid_only":false}],"company":{}},{"contest":{"id":145,"title":"第 175 场周赛","title_slug":"weekly-contest-175","start_time":1581215400,"is_ee_exam_contest":null},"questions":[{"question_id":1346,"title":"检查整数及其两倍数是否存在","title_slug":"check-if-n-and-its-double-exist","rating":1225.3601348675,"_hash":174306863,"paid_only":false},{"question_id":1347,"title":"制造字母异位词的最小步骤数","title_slug":"minimum-number-of-steps-to-make-two-strings-anagram","rating":1330.918577828,"_hash":4265155310,"paid_only":false},{"question_id":1348,"title":"推文计数","title_slug":"tweet-counts-per-frequency","rating":2036.7206020719,"_hash":2176047848,"paid_only":false},{"question_id":1349,"title":"参加考试的最大学生数","title_slug":"maximum-students-taking-exam","rating":2385.8072128533,"_hash":1698302709,"paid_only":false}],"company":{}},{"contest":{"id":146,"title":"第 19 场双周赛","title_slug":"biweekly-contest-19","start_time":1581172200,"is_ee_exam_contest":null},"questions":[{"question_id":1342,"title":"将数字变成 0 的操作次数","title_slug":"number-of-steps-to-reduce-a-number-to-zero","rating":1163.6047095526,"_hash":3773666854,"paid_only":false},{"question_id":1343,"title":"大小为 K 且平均值大于等于阈值的子数组数目","title_slug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold","rating":1317.1729927899,"_hash":1376431756,"paid_only":false},{"question_id":1344,"title":"时钟指针的夹角","title_slug":"angle-between-hands-of-a-clock","rating":1324.5696223867,"_hash":41269413,"paid_only":false},{"question_id":1345,"title":"跳跃游戏 IV","title_slug":"jump-game-iv","rating":1809.8192888474,"_hash":212627710,"paid_only":false}],"company":{}},{"contest":{"id":144,"title":"第 174 场周赛","title_slug":"weekly-contest-174","start_time":1580610600,"is_ee_exam_contest":null},"questions":[{"question_id":1337,"title":"矩阵中战斗力最弱的 K 行","title_slug":"the-k-weakest-rows-in-a-matrix","rating":1224.7606792444,"_hash":1486913577,"paid_only":false},{"question_id":1338,"title":"数组大小减半","title_slug":"reduce-array-size-to-the-half","rating":1303.022570497,"_hash":1706598413,"paid_only":false},{"question_id":1339,"title":"分裂二叉树的最大乘积","title_slug":"maximum-product-of-splitted-binary-tree","rating":1674.9985842835,"_hash":1257762070,"paid_only":false},{"question_id":1340,"title":"跳跃游戏 V","title_slug":"jump-game-v","rating":1866.3014601125,"_hash":3795047313,"paid_only":false}],"company":{}},{"contest":{"id":142,"title":"第 173 场周赛","title_slug":"weekly-contest-173","start_time":1580005800,"is_ee_exam_contest":null},"questions":[{"question_id":1332,"title":"删除回文子序列","title_slug":"remove-palindromic-subsequences","rating":1628.5072578803,"_hash":2153157695,"paid_only":false},{"question_id":1333,"title":"餐厅过滤器","title_slug":"filter-restaurants-by-vegan-friendly-price-and-distance","rating":1423.1058649921,"_hash":3693635252,"paid_only":false},{"question_id":1334,"title":"阈值距离内邻居最少的城市","title_slug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance","rating":1854.9547783559,"_hash":487663609,"paid_only":false},{"question_id":1335,"title":"工作计划的最低难度","title_slug":"minimum-difficulty-of-a-job-schedule","rating":2034.9420578559,"_hash":271335539,"paid_only":false}],"company":{}},{"contest":{"id":143,"title":"第 18 场双周赛","title_slug":"biweekly-contest-18","start_time":1579962600,"is_ee_exam_contest":null},"questions":[{"question_id":1331,"title":"数组序号转换","title_slug":"rank-transform-of-an-array","rating":1355.9817184778,"_hash":1713279396,"paid_only":false},{"question_id":1328,"title":"破坏回文串","title_slug":"break-a-palindrome","rating":1473.864993045,"_hash":1467367970,"paid_only":false},{"question_id":1329,"title":"将矩阵按对角线排序","title_slug":"sort-the-matrix-diagonally","rating":1548.4678056182,"_hash":1786656286,"paid_only":false},{"question_id":1330,"title":"翻转子数组得到最大的数组值","title_slug":"reverse-subarray-to-maximize-array-value","rating":2481.7175364169,"_hash":3851133364,"paid_only":false}],"company":{}},{"contest":{"id":139,"title":"第 172 场周赛","title_slug":"weekly-contest-172","start_time":1579401000,"is_ee_exam_contest":null},"questions":[{"question_id":1323,"title":"6 和 9 组成的最大数字","title_slug":"maximum-69-number","rating":1193.9819783429,"_hash":2988189921,"paid_only":false},{"question_id":1324,"title":"竖直打印单词","title_slug":"print-words-vertically","rating":1328.7281033317,"_hash":2666352866,"paid_only":false},{"question_id":1325,"title":"删除给定值的叶子节点","title_slug":"delete-leaves-with-a-given-value","rating":1407.1322366299,"_hash":1098465458,"paid_only":false},{"question_id":1326,"title":"灌溉花园的最少水龙头数目","title_slug":"minimum-number-of-taps-to-open-to-water-a-garden","rating":1885.0178370385,"_hash":701261553,"paid_only":false}],"company":{}},{"contest":{"id":137,"title":"第 171 场周赛","title_slug":"weekly-contest-171","start_time":1578796200,"is_ee_exam_contest":null},"questions":[{"question_id":1317,"title":"将整数转换为两个无零整数的和","title_slug":"convert-integer-to-the-sum-of-two-no-zero-integers","rating":1277.8260125315,"_hash":1863065807,"paid_only":false},{"question_id":1318,"title":"或运算的最小翻转次数","title_slug":"minimum-flips-to-make-a-or-b-equal-to-c","rating":1382.760607823,"_hash":623247221,"paid_only":false},{"question_id":1319,"title":"连通网络的操作次数","title_slug":"number-of-operations-to-make-network-connected","rating":1633.1372577433,"_hash":3681976285,"paid_only":false},{"question_id":1320,"title":"二指输入的的最小距离","title_slug":"minimum-distance-to-type-a-word-using-two-fingers","rating":2027.7304121046,"_hash":3992139324,"paid_only":false}],"company":{}},{"contest":{"id":138,"title":"第 17 场双周赛","title_slug":"biweekly-contest-17","start_time":1578753000,"is_ee_exam_contest":null},"questions":[{"question_id":1313,"title":"解压缩编码列表","title_slug":"decompress-run-length-encoded-list","rating":1317.4638832497,"_hash":2109320577,"paid_only":false},{"question_id":1314,"title":"矩阵区域和","title_slug":"matrix-block-sum","rating":1483.8137189709,"_hash":2353125510,"paid_only":false},{"question_id":1315,"title":"祖父节点值为偶数的节点和","title_slug":"sum-of-nodes-with-even-valued-grandparent","rating":1426.948379305,"_hash":1075948935,"paid_only":false},{"question_id":1316,"title":"不同的循环子字符串","title_slug":"distinct-echo-substrings","rating":1836.536348078,"_hash":2436413676,"paid_only":false}],"company":{}},{"contest":{"id":136,"title":"第 170 场周赛","title_slug":"weekly-contest-170","start_time":1578191400,"is_ee_exam_contest":null},"questions":[{"question_id":1309,"title":"解码字母到整数映射","title_slug":"decrypt-string-from-alphabet-to-integer-mapping","rating":1257.679633165,"_hash":504472069,"paid_only":false},{"question_id":1310,"title":"子数组异或查询","title_slug":"xor-queries-of-a-subarray","rating":1459.8208951847,"_hash":3663334475,"paid_only":false},{"question_id":1311,"title":"获取你好友已观看的视频","title_slug":"get-watched-videos-by-your-friends","rating":1652.5809810428,"_hash":2521216381,"paid_only":false},{"question_id":1312,"title":"让字符串成为回文串的最少插入次数","title_slug":"minimum-insertion-steps-to-make-a-string-palindrome","rating":1786.688543054,"_hash":2220648902,"paid_only":false}],"company":{}},{"contest":{"id":134,"title":"第 169 场周赛","title_slug":"weekly-contest-169","start_time":1577586600,"is_ee_exam_contest":null},"questions":[{"question_id":1304,"title":"和为零的 N 个不同整数","title_slug":"find-n-unique-integers-sum-up-to-zero","rating":1167.1331831913,"_hash":1460547008,"paid_only":false},{"question_id":1305,"title":"两棵二叉搜索树中的所有元素","title_slug":"all-elements-in-two-binary-search-trees","rating":1260.1755576607,"_hash":3750933244,"paid_only":false},{"question_id":1306,"title":"跳跃游戏 III","title_slug":"jump-game-iii","rating":1396.5448074496,"_hash":1787879890,"paid_only":false},{"question_id":1307,"title":"口算难题","title_slug":"verbal-arithmetic-puzzle","rating":2250.0454791316,"_hash":9793507,"paid_only":false}],"company":{}},{"contest":{"id":135,"title":"第 16 场双周赛","title_slug":"biweekly-contest-16","start_time":1577543400,"is_ee_exam_contest":null},"questions":[{"question_id":1299,"title":"将每个元素替换为右侧最大元素","title_slug":"replace-elements-with-greatest-element-on-right-side","rating":1219.4252907184,"_hash":4131453232,"paid_only":false},{"question_id":1300,"title":"转变数组后最接近目标值的数组和","title_slug":"sum-of-mutated-array-closest-to-target","rating":1606.9895296459,"_hash":122134919,"paid_only":false},{"question_id":1302,"title":"层数最深叶子节点的和","title_slug":"deepest-leaves-sum","rating":1387.9431104106,"_hash":2146548018,"paid_only":false},{"question_id":1301,"title":"最大得分的路径数目","title_slug":"number-of-paths-with-max-score","rating":1853.0880092558,"_hash":4193156158,"paid_only":false}],"company":{}},{"contest":{"id":133,"title":"第 168 场周赛","title_slug":"weekly-contest-168","start_time":1576981800,"is_ee_exam_contest":null},"questions":[{"question_id":1295,"title":"统计位数为偶数的数字","title_slug":"find-numbers-with-even-number-of-digits","rating":1139.6630206282,"_hash":1078494316,"paid_only":false},{"question_id":1296,"title":"划分数组为连续数字的集合","title_slug":"divide-array-in-sets-of-k-consecutive-numbers","rating":1490.2370387981,"_hash":2249312740,"paid_only":false},{"question_id":1297,"title":"子串的最大出现次数","title_slug":"maximum-number-of-occurrences-of-a-substring","rating":1748.1523771585,"_hash":625709572,"paid_only":false},{"question_id":1298,"title":"你能从盒子里获得的最大糖果数","title_slug":"maximum-candies-you-can-get-from-boxes","rating":1824.829446341,"_hash":4040819108,"paid_only":false}],"company":{}},{"contest":{"id":131,"title":"第 167 场周赛","title_slug":"weekly-contest-167","start_time":1576377000,"is_ee_exam_contest":null},"questions":[{"question_id":1290,"title":"二进制链表转整数","title_slug":"convert-binary-number-in-a-linked-list-to-integer","rating":1151.3534799042,"_hash":3681668560,"paid_only":false},{"question_id":1291,"title":"顺次数","title_slug":"sequential-digits","rating":1373.8113453501,"_hash":1231737979,"paid_only":false},{"question_id":1292,"title":"元素和小于等于阈值的正方形的最大边长","title_slug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold","rating":1734.8208369949,"_hash":2041342956,"paid_only":false},{"question_id":1293,"title":"网格中的最短路径","title_slug":"shortest-path-in-a-grid-with-obstacles-elimination","rating":1967.3284576938,"_hash":3580394792,"paid_only":false}],"company":{}},{"contest":{"id":132,"title":"第 15 场双周赛","title_slug":"biweekly-contest-15","start_time":1576333800,"is_ee_exam_contest":null},"questions":[{"question_id":1287,"title":"有序数组中出现次数超过25%的元素","title_slug":"element-appearing-more-than-25-in-sorted-array","rating":1179.1495967491,"_hash":3348466517,"paid_only":false},{"question_id":1288,"title":"删除被覆盖区间","title_slug":"remove-covered-intervals","rating":1375.0234414965,"_hash":4078794209,"paid_only":false},{"question_id":1286,"title":"字母组合迭代器","title_slug":"iterator-for-combination","rating":1591.4725328821,"_hash":2534714311,"paid_only":false},{"question_id":1289,"title":"下降路径最小和 II","title_slug":"minimum-falling-path-sum-ii","rating":1697.2356875149,"_hash":2588489114,"paid_only":false}],"company":{}},{"contest":{"id":130,"title":"第 166 场周赛","title_slug":"weekly-contest-166","start_time":1575772200,"is_ee_exam_contest":null},"questions":[{"question_id":1281,"title":"整数的各位积和之差","title_slug":"subtract-the-product-and-sum-of-digits-of-an-integer","rating":1141.2363999461,"_hash":1959906977,"paid_only":false},{"question_id":1282,"title":"用户分组","title_slug":"group-the-people-given-the-group-size-they-belong-to","rating":1267.223591366,"_hash":1393055239,"paid_only":false},{"question_id":1283,"title":"使结果不超过阈值的最小除数","title_slug":"find-the-smallest-divisor-given-a-threshold","rating":1541.7840320661,"_hash":278493845,"paid_only":false},{"question_id":1284,"title":"转化为全零矩阵的最少反转次数","title_slug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix","rating":1810.7690062079,"_hash":1118571941,"paid_only":false}],"company":{}},{"contest":{"id":128,"title":"第 165 场周赛","title_slug":"weekly-contest-165","start_time":1575167400,"is_ee_exam_contest":null},"questions":[{"question_id":1275,"title":"找出井字棋的获胜者","title_slug":"find-winner-on-a-tic-tac-toe-game","rating":1336.9494482313,"_hash":2404871340,"paid_only":false},{"question_id":1276,"title":"不浪费原料的汉堡制作方案","title_slug":"number-of-burgers-with-no-waste-of-ingredients","rating":1386.3256313989,"_hash":178669910,"paid_only":false},{"question_id":1277,"title":"统计全为 1 的正方形子矩阵","title_slug":"count-square-submatrices-with-all-ones","rating":1613.0429766636,"_hash":1057920854,"paid_only":false},{"question_id":1278,"title":"分割回文串 III","title_slug":"palindrome-partitioning-iii","rating":1979.1323403633,"_hash":2471898191,"paid_only":false}],"company":{}},{"contest":{"id":129,"title":"第 14 场双周赛","title_slug":"biweekly-contest-14","start_time":1575124200,"is_ee_exam_contest":null},"questions":[{"question_id":1271,"title":"十六进制魔术数字","title_slug":"hexspeak","rating":1384.4078082338,"_hash":3813216196,"paid_only":false},{"question_id":1272,"title":"删除区间","title_slug":"remove-interval","rating":1524.8218282113,"_hash":760128905,"paid_only":false},{"question_id":1273,"title":"删除树节点","title_slug":"delete-tree-nodes","rating":1732.7813534239,"_hash":333630853,"paid_only":false},{"question_id":1274,"title":"矩形内船只的数目","title_slug":"number-of-ships-in-a-rectangle","rating":1997.1824403719,"_hash":474791918,"paid_only":false}],"company":{}},{"contest":{"id":125,"title":"第 164 场周赛","title_slug":"weekly-contest-164","start_time":1574562600,"is_ee_exam_contest":null},"questions":[{"question_id":1266,"title":"访问所有点的最小时间","title_slug":"minimum-time-visiting-all-points","rating":1302.7005460171,"_hash":2480987547,"paid_only":false},{"question_id":1267,"title":"统计参与通信的服务器","title_slug":"count-servers-that-communicate","rating":1374.574900311,"_hash":4169811109,"paid_only":false},{"question_id":1268,"title":"搜索推荐系统","title_slug":"search-suggestions-system","rating":1573.4042963622,"_hash":133627469,"paid_only":false},{"question_id":1269,"title":"停在原地的方案数","title_slug":"number-of-ways-to-stay-in-the-same-place-after-some-steps","rating":1854.0126399812,"_hash":1810947088,"paid_only":false}],"company":{}},{"contest":{"id":123,"title":"第 163 场周赛","title_slug":"weekly-contest-163","start_time":1573957800,"is_ee_exam_contest":null},"questions":[{"question_id":1260,"title":"二维网格迁移","title_slug":"shift-2d-grid","rating":1337.3722299775,"_hash":2949409019,"paid_only":false},{"question_id":1261,"title":"在受污染的二叉树中查找元素","title_slug":"find-elements-in-a-contaminated-binary-tree","rating":1439.5656079032,"_hash":1643291393,"paid_only":false},{"question_id":1262,"title":"可被三整除的最大和","title_slug":"greatest-sum-divisible-by-three","rating":1762.0307532652,"_hash":2001540741,"paid_only":false},{"question_id":1263,"title":"推箱子","title_slug":"minimum-moves-to-move-a-box-to-their-target-location","rating":2297.105362516,"_hash":3949953471,"paid_only":false}],"company":{}},{"contest":{"id":124,"title":"第 13 场双周赛","title_slug":"biweekly-contest-13","start_time":1573914600,"is_ee_exam_contest":null},"questions":[{"question_id":1256,"title":"加密数字","title_slug":"encode-number","rating":1561.2655635205,"_hash":2428818859,"paid_only":false},{"question_id":1257,"title":"最小公共区域","title_slug":"smallest-common-region","rating":1654.0793660142,"_hash":2731154173,"paid_only":false},{"question_id":1258,"title":"近义词句子","title_slug":"synonymous-sentences","rating":1847.2077654978,"_hash":3669324904,"paid_only":false},{"question_id":1259,"title":"不相交的握手","title_slug":"handshakes-that-dont-cross","rating":1951.3509259668,"_hash":108728140,"paid_only":false}],"company":{}},{"contest":{"id":122,"title":"第 162 场周赛","title_slug":"weekly-contest-162","start_time":1573353000,"is_ee_exam_contest":null},"questions":[{"question_id":1252,"title":"奇数值单元格的数目","title_slug":"cells-with-odd-values-in-a-matrix","rating":1283.4980318021,"_hash":4235563666,"paid_only":false},{"question_id":1253,"title":"重构 2 行二进制矩阵","title_slug":"reconstruct-a-2-row-binary-matrix","rating":1505.8669082864,"_hash":1498707721,"paid_only":false},{"question_id":1254,"title":"统计封闭岛屿的数目","title_slug":"number-of-closed-islands","rating":1658.7495899767,"_hash":1535345394,"paid_only":false},{"question_id":1255,"title":"得分最高的单词集合","title_slug":"maximum-score-words-formed-by-letters","rating":1881.6810367589,"_hash":2776150092,"paid_only":false}],"company":{}},{"contest":{"id":120,"title":"第 161 场周赛","title_slug":"weekly-contest-161","start_time":1572748200,"is_ee_exam_contest":null},"questions":[{"question_id":1247,"title":"交换字符使得字符串相同","title_slug":"minimum-swaps-to-make-strings-equal","rating":1597.0215918551,"_hash":3735372403,"paid_only":false},{"question_id":1248,"title":"统计「优美子数组」","title_slug":"count-number-of-nice-subarrays","rating":1623.9443250479,"_hash":2868656571,"paid_only":false},{"question_id":1249,"title":"移除无效的括号","title_slug":"minimum-remove-to-make-valid-parentheses","rating":1657.1231739081,"_hash":4242473859,"paid_only":false},{"question_id":1250,"title":"检查「好数组」","title_slug":"check-if-it-is-a-good-array","rating":1983.2319731313,"_hash":4185904896,"paid_only":false}],"company":{}},{"contest":{"id":121,"title":"第 12 场双周赛","title_slug":"biweekly-contest-12","start_time":1572705000,"is_ee_exam_contest":null},"questions":[{"question_id":1244,"title":"力扣排行榜","title_slug":"design-a-leaderboard","rating":1354.1247827015,"_hash":2386103127,"paid_only":false},{"question_id":1243,"title":"数组变换","title_slug":"array-transformation","rating":1558.1421869292,"_hash":2980355580,"paid_only":false},{"question_id":1245,"title":"树的直径","title_slug":"tree-diameter","rating":1792.076794537,"_hash":3817996291,"paid_only":false},{"question_id":1246,"title":"删除回文子数组","title_slug":"palindrome-removal","rating":2203.1738850937,"_hash":960405407,"paid_only":false}],"company":{}},{"contest":{"id":119,"title":"第 160 场周赛","title_slug":"weekly-contest-160","start_time":1572143400,"is_ee_exam_contest":null},"questions":[{"question_id":1237,"title":"找出给定方程的正整数解","title_slug":"find-positive-integer-solution-for-a-given-equation","rating":1404.7016862187,"_hash":3484001100,"paid_only":false},{"question_id":1238,"title":"循环码排列","title_slug":"circular-permutation-in-binary-representation","rating":1774.8764591297,"_hash":1210001971,"paid_only":false},{"question_id":1239,"title":"串联字符串的最大长度","title_slug":"maximum-length-of-a-concatenated-string-with-unique-characters","rating":1719.945199874,"_hash":4259911866,"paid_only":false},{"question_id":1240,"title":"铺瓷砖","title_slug":"tiling-a-rectangle-with-the-fewest-squares","rating":2241.5199974312,"_hash":2526467539,"paid_only":false}],"company":{}},{"contest":{"id":117,"title":"第 159 场周赛","title_slug":"weekly-contest-159","start_time":1571538600,"is_ee_exam_contest":null},"questions":[{"question_id":1232,"title":"缀点成线","title_slug":"check-if-it-is-a-straight-line","rating":1247.3198836387,"_hash":4130908576,"paid_only":false},{"question_id":1233,"title":"删除子文件夹","title_slug":"remove-sub-folders-from-the-filesystem","rating":1544.8261365027,"_hash":4057878205,"paid_only":false},{"question_id":1234,"title":"替换子串得到平衡字符串","title_slug":"replace-the-substring-for-balanced-string","rating":1877.8983358307,"_hash":2144998386,"paid_only":false},{"question_id":1235,"title":"规划兼职工作","title_slug":"maximum-profit-in-job-scheduling","rating":2022.8520613737,"_hash":4225343365,"paid_only":false}],"company":{}},{"contest":{"id":118,"title":"第 11 场双周赛","title_slug":"biweekly-contest-11","start_time":1571495400,"is_ee_exam_contest":null},"questions":[{"question_id":1228,"title":"等差数列中缺失的数字","title_slug":"missing-number-in-arithmetic-progression","rating":1244.317367883,"_hash":1225270682,"paid_only":false},{"question_id":1229,"title":"安排会议日程","title_slug":"meeting-scheduler","rating":1541.2260256298,"_hash":3772256778,"paid_only":false},{"question_id":1230,"title":"抛掷硬币","title_slug":"toss-strange-coins","rating":1808.5754920785,"_hash":2912571228,"paid_only":false},{"question_id":1231,"title":"分享巧克力","title_slug":"divide-chocolate","rating":2029.1301557536,"_hash":1053077839,"paid_only":false}],"company":{}},{"contest":{"id":116,"title":"第 158 场周赛","title_slug":"weekly-contest-158","start_time":1570933800,"is_ee_exam_contest":null},"questions":[{"question_id":1221,"title":"分割平衡字符串","title_slug":"split-a-string-in-balanced-strings","rating":1219.5284561367,"_hash":74188793,"paid_only":false},{"question_id":1222,"title":"可以攻击国王的皇后","title_slug":"queens-that-can-attack-the-king","rating":1391.7243180131,"_hash":665333196,"paid_only":false},{"question_id":1223,"title":"掷骰子模拟","title_slug":"dice-roll-simulation","rating":2008.40650791,"_hash":1023816398,"paid_only":false},{"question_id":1224,"title":"最大相等频率","title_slug":"maximum-equal-frequency","rating":2050.715977457,"_hash":3117661899,"paid_only":false}],"company":{}},{"contest":{"id":114,"title":"第 157 场周赛","title_slug":"weekly-contest-157","start_time":1570329000,"is_ee_exam_contest":null},"questions":[{"question_id":1217,"title":"玩筹码","title_slug":"minimum-cost-to-move-chips-to-the-same-position","rating":1407.5442381391,"_hash":2503951076,"paid_only":false},{"question_id":1218,"title":"最长定差子序列","title_slug":"longest-arithmetic-subsequence-of-given-difference","rating":1597.1931473887,"_hash":1235853332,"paid_only":false},{"question_id":1219,"title":"黄金矿工","title_slug":"path-with-maximum-gold","rating":1663.2612318917,"_hash":2579010831,"paid_only":false},{"question_id":1220,"title":"统计元音字母序列的数目","title_slug":"count-vowels-permutation","rating":1729.6074000215,"_hash":4278798036,"paid_only":false}],"company":{}},{"contest":{"id":115,"title":"第 10 场双周赛","title_slug":"biweekly-contest-10","start_time":1570285800,"is_ee_exam_contest":null},"questions":[{"question_id":1213,"title":"三个有序数组的交集","title_slug":"intersection-of-three-sorted-arrays","rating":1259.1979660519,"_hash":1167766424,"paid_only":false},{"question_id":1214,"title":"查找两棵二叉搜索树之和","title_slug":"two-sum-bsts","rating":1389.0328392117,"_hash":1043390792,"paid_only":false},{"question_id":1215,"title":"步进数","title_slug":"stepping-numbers","rating":1674.5365205597,"_hash":2304874524,"paid_only":false},{"question_id":1216,"title":"验证回文串 III","title_slug":"valid-palindrome-iii","rating":1753.9062487685,"_hash":4136678159,"paid_only":false}],"company":{}},{"contest":{"id":113,"title":"第 156 场周赛","title_slug":"weekly-contest-156","start_time":1569724200,"is_ee_exam_contest":null},"questions":[{"question_id":1207,"title":"独一无二的出现次数","title_slug":"unique-number-of-occurrences","rating":1195.7512695571,"_hash":3437227213,"paid_only":false},{"question_id":1208,"title":"尽可能使字符串相等","title_slug":"get-equal-substrings-within-budget","rating":1496.9128643588,"_hash":3812471555,"paid_only":false},{"question_id":1209,"title":"删除字符串中的所有相邻重复项 II","title_slug":"remove-all-adjacent-duplicates-in-string-ii","rating":1541.5405749918,"_hash":1577638784,"paid_only":false},{"question_id":1210,"title":"穿过迷宫的最少移动次数","title_slug":"minimum-moves-to-reach-target-with-rotations","rating":2022.4752963768,"_hash":2716747123,"paid_only":false}],"company":{}},{"contest":{"id":107,"title":"第 155 场周赛","title_slug":"weekly-contest-155","start_time":1569119400,"is_ee_exam_contest":null},"questions":[{"question_id":1200,"title":"最小绝对差","title_slug":"minimum-absolute-difference","rating":1198.5705825982,"_hash":2380816309,"paid_only":false},{"question_id":1201,"title":"丑数 III","title_slug":"ugly-number-iii","rating":2039.110874689,"_hash":4021161204,"paid_only":false},{"question_id":1202,"title":"交换字符串中的元素","title_slug":"smallest-string-with-swaps","rating":1855.4479039876,"_hash":13544352,"paid_only":false},{"question_id":1203,"title":"项目管理","title_slug":"sort-items-by-groups-respecting-dependencies","rating":2418.5742747632,"_hash":505097820,"paid_only":false}],"company":{}},{"contest":{"id":108,"title":"第 9 场双周赛","title_slug":"biweekly-contest-9","start_time":1569076200,"is_ee_exam_contest":null},"questions":[{"question_id":1196,"title":"最多可以买到的苹果数量","title_slug":"how-many-apples-can-you-put-into-the-basket","rating":1248.8026990632,"_hash":3037047822,"paid_only":false},{"question_id":1197,"title":"进击的骑士","title_slug":"minimum-knight-moves","rating":1722.3088173214,"_hash":3077259720,"paid_only":false},{"question_id":1198,"title":"找出所有行中最小公共元素","title_slug":"find-smallest-common-element-in-all-rows","rating":1401.2246983038,"_hash":2199036891,"paid_only":false},{"question_id":1199,"title":"建造街区的最短时间","title_slug":"minimum-time-to-build-blocks","rating":2250.2578740769,"_hash":212930587,"paid_only":false}],"company":{}},{"contest":{"id":106,"title":"第 154 场周赛","title_slug":"weekly-contest-154","start_time":1568514600,"is_ee_exam_contest":null},"questions":[{"question_id":1189,"title":"“气球” 的最大数量","title_slug":"maximum-number-of-balloons","rating":1181.9716216714,"_hash":475209872,"paid_only":false},{"question_id":1190,"title":"反转每对括号间的子串","title_slug":"reverse-substrings-between-each-pair-of-parentheses","rating":1485.6550472186,"_hash":1038307939,"paid_only":false},{"question_id":1191,"title":"K 次串联后最大子数组之和","title_slug":"k-concatenation-maximum-sum","rating":1747.6755111029,"_hash":65111910,"paid_only":false},{"question_id":1192,"title":"查找集群内的关键连接","title_slug":"critical-connections-in-a-network","rating":2084.6866916045,"_hash":3870941501,"paid_only":false}],"company":{}},{"contest":{"id":102,"title":"第 153 场周赛","title_slug":"weekly-contest-153","start_time":1567909800,"is_ee_exam_contest":null},"questions":[{"question_id":1184,"title":"公交站间的距离","title_slug":"distance-between-bus-stops","rating":1234.4144116814,"_hash":1149087220,"paid_only":false},{"question_id":1185,"title":"一周中的第几天","title_slug":"day-of-the-week","rating":1382.4809893713,"_hash":3920920642,"paid_only":false},{"question_id":1186,"title":"删除一次得到子数组最大和","title_slug":"maximum-subarray-sum-with-one-deletion","rating":1799.4635458535,"_hash":1742923454,"paid_only":false},{"question_id":1187,"title":"使数组严格递增","title_slug":"make-array-strictly-increasing","rating":2315.6037017989,"_hash":979526552,"paid_only":false}],"company":{}},{"contest":{"id":103,"title":"第 8 场双周赛","title_slug":"biweekly-contest-8","start_time":1567866600,"is_ee_exam_contest":null},"questions":[{"question_id":1180,"title":"统计只含单一字母的子串","title_slug":"count-substrings-with-only-one-distinct-letter","rating":1315.4085759361,"_hash":2844666696,"paid_only":false},{"question_id":1181,"title":"前后拼接","title_slug":"before-and-after-puzzle","rating":1558.6880035344,"_hash":4191223408,"paid_only":false},{"question_id":1182,"title":"与目标颜色间的最短距离","title_slug":"shortest-distance-to-target-color","rating":1626.6740430119,"_hash":3960804215,"paid_only":false},{"question_id":1183,"title":"矩阵中 1 的最大数量","title_slug":"maximum-number-of-ones","rating":2366.7099607655,"_hash":3675075625,"paid_only":false}],"company":{}},{"contest":{"id":100,"title":"第 152 场周赛","title_slug":"weekly-contest-152","start_time":1567305000,"is_ee_exam_contest":null},"questions":[{"question_id":1175,"title":"质数排列","title_slug":"prime-arrangements","rating":1489.0102202162,"_hash":3007102778,"paid_only":false},{"question_id":1176,"title":"健身计划评估","title_slug":"diet-plan-performance","rating":1397.7743198793,"_hash":97873302,"paid_only":false},{"question_id":1177,"title":"构建回文串检测","title_slug":"can-make-palindrome-from-substring","rating":1848.0912848518,"_hash":1583349779,"paid_only":false},{"question_id":1178,"title":"猜字谜","title_slug":"number-of-valid-words-for-each-puzzle","rating":2233.963903408,"_hash":2530621646,"paid_only":false}],"company":{}},{"contest":{"id":98,"title":"第 151 场周赛","title_slug":"weekly-contest-151","start_time":1566700200,"is_ee_exam_contest":null},"questions":[{"question_id":1169,"title":"查询无效交易","title_slug":"invalid-transactions","rating":1658.6836278802,"_hash":3292810974,"paid_only":false},{"question_id":1170,"title":"比较字符串最小字母出现频次","title_slug":"compare-strings-by-frequency-of-the-smallest-character","rating":1431.6864980883,"_hash":168963992,"paid_only":false},{"question_id":1171,"title":"从链表中删去总和值为零的连续节点","title_slug":"remove-zero-sum-consecutive-nodes-from-linked-list","rating":1782.3312212058,"_hash":1493274091,"paid_only":false},{"question_id":1172,"title":"餐盘栈","title_slug":"dinner-plate-stacks","rating":2109.9830154953,"_hash":3376945874,"paid_only":false}],"company":{}},{"contest":{"id":99,"title":"第 7 场双周赛","title_slug":"biweekly-contest-7","start_time":1566657000,"is_ee_exam_contest":null},"questions":[{"question_id":1165,"title":"单行键盘","title_slug":"single-row-keyboard","rating":1199.2392672964,"_hash":3054721758,"paid_only":false},{"question_id":1166,"title":"设计文件系统","title_slug":"design-file-system","rating":1479.0110934646,"_hash":3000728502,"paid_only":false},{"question_id":1167,"title":"连接木棍的最低费用","title_slug":"minimum-cost-to-connect-sticks","rating":1481.5701319876,"_hash":4211026934,"paid_only":false},{"question_id":1168,"title":"水资源分配优化","title_slug":"optimize-water-distribution-in-a-village","rating":2069.4030284676,"_hash":271664224,"paid_only":false}],"company":{}},{"contest":{"id":96,"title":"第 150 场周赛","title_slug":"weekly-contest-150","start_time":1566095400,"is_ee_exam_contest":null},"questions":[{"question_id":1160,"title":"拼写单词","title_slug":"find-words-that-can-be-formed-by-characters","rating":1205.6698455508,"_hash":3021409572,"paid_only":false},{"question_id":1161,"title":"最大层内元素和","title_slug":"maximum-level-sum-of-a-binary-tree","rating":1249.9086403595,"_hash":1692861209,"paid_only":false},{"question_id":1162,"title":"地图分析","title_slug":"as-far-from-land-as-possible","rating":1666.346990979,"_hash":744773019,"paid_only":false},{"question_id":1163,"title":"按字典序排在最后的子串","title_slug":"last-substring-in-lexicographical-order","rating":1864.0948676111,"_hash":1053626998,"paid_only":false}],"company":{}},{"contest":{"id":94,"title":"第 149 场周赛","title_slug":"weekly-contest-149","start_time":1565490600,"is_ee_exam_contest":null},"questions":[{"question_id":1154,"title":"一年中的第几天","title_slug":"day-of-the-year","rating":1199.4427635582,"_hash":694594451,"paid_only":false},{"question_id":1155,"title":"掷骰子等于目标和的方法数","title_slug":"number-of-dice-rolls-with-target-sum","rating":1653.7337081336,"_hash":1676080206,"paid_only":false},{"question_id":1156,"title":"单字符重复子串的最大长度","title_slug":"swap-for-longest-repeated-character-substring","rating":1787.4514432151,"_hash":2038782260,"paid_only":false},{"question_id":1157,"title":"子数组中占绝大多数的元素","title_slug":"online-majority-element-in-subarray","rating":2205.4304373587,"_hash":4053796951,"paid_only":false}],"company":{}},{"contest":{"id":95,"title":"第 6 场双周赛","title_slug":"biweekly-contest-6","start_time":1565447400,"is_ee_exam_contest":null},"questions":[{"question_id":1150,"title":"检查一个数是否在数组中占绝大多数","title_slug":"check-if-a-number-is-majority-element-in-a-sorted-array","rating":1249.9947800752,"_hash":1627868267,"paid_only":false},{"question_id":1151,"title":"最少交换次数来组合所有的 1","title_slug":"minimum-swaps-to-group-all-1s-together","rating":1508.1169489285,"_hash":324121992,"paid_only":false},{"question_id":1152,"title":"用户网站访问行为分析","title_slug":"analyze-user-website-visit-pattern","rating":1850.8490524791,"_hash":2782517328,"paid_only":false},{"question_id":1153,"title":"字符串转化","title_slug":"string-transforms-into-another-string","rating":1949.0920823355,"_hash":120648461,"paid_only":false}],"company":{}},{"contest":{"id":93,"title":"第 148 场周赛","title_slug":"weekly-contest-148","start_time":1564885800,"is_ee_exam_contest":null},"questions":[{"question_id":1144,"title":"递减元素使数组呈锯齿状","title_slug":"decrease-elements-to-make-array-zigzag","rating":1558.7188539503,"_hash":109606469,"paid_only":false},{"question_id":1145,"title":"二叉树着色游戏","title_slug":"binary-tree-coloring-game","rating":1741.4527995252,"_hash":110135796,"paid_only":false},{"question_id":1146,"title":"快照数组","title_slug":"snapshot-array","rating":1770.8924569497,"_hash":4187877981,"paid_only":false},{"question_id":1147,"title":"段式回文","title_slug":"longest-chunked-palindrome-decomposition","rating":1912.0829958001,"_hash":1184414922,"paid_only":false}],"company":{}},{"contest":{"id":90,"title":"第 147 场周赛","title_slug":"weekly-contest-147","start_time":1564281000,"is_ee_exam_contest":null},"questions":[{"question_id":1137,"title":"第 N 个泰波那契数","title_slug":"n-th-tribonacci-number","rating":1142.8650731632,"_hash":651101767,"paid_only":false},{"question_id":1138,"title":"字母板上的路径","title_slug":"alphabet-board-path","rating":1410.5239927267,"_hash":638264577,"paid_only":false},{"question_id":1139,"title":"最大的以 1 为边界的正方形","title_slug":"largest-1-bordered-square","rating":1744.0388789755,"_hash":1167299665,"paid_only":false},{"question_id":1140,"title":"石子游戏 II","title_slug":"stone-game-ii","rating":2034.9740902393,"_hash":2086212420,"paid_only":false}],"company":{}},{"contest":{"id":91,"title":"第 5 场双周赛","title_slug":"biweekly-contest-5","start_time":1564237800,"is_ee_exam_contest":null},"questions":[{"question_id":1133,"title":"最大唯一数","title_slug":"largest-unique-number","rating":1226.2960135431,"_hash":3008054233,"paid_only":false},{"question_id":1134,"title":"阿姆斯特朗数","title_slug":"armstrong-number","rating":1231.4004525633,"_hash":391342400,"paid_only":false},{"question_id":1135,"title":"最低成本连通所有城市","title_slug":"connecting-cities-with-minimum-cost","rating":1752.9555725796,"_hash":282466705,"paid_only":false},{"question_id":1136,"title":"并行课程","title_slug":"parallel-courses","rating":1710.0787625377,"_hash":1009688921,"paid_only":false}],"company":{}},{"contest":{"id":89,"title":"第 146 场周赛","title_slug":"weekly-contest-146","start_time":1563676200,"is_ee_exam_contest":null},"questions":[{"question_id":1128,"title":"等价多米诺骨牌对的数量","title_slug":"number-of-equivalent-domino-pairs","rating":1332.622596763,"_hash":2262588000,"paid_only":false},{"question_id":1129,"title":"颜色交替的最短路径","title_slug":"shortest-path-with-alternating-colors","rating":1779.7534349429,"_hash":3681526411,"paid_only":false},{"question_id":1130,"title":"叶值的最小代价生成树","title_slug":"minimum-cost-tree-from-leaf-values","rating":1919.1749818083,"_hash":2542321733,"paid_only":false},{"question_id":1131,"title":"绝对值表达式的最大值","title_slug":"maximum-of-absolute-value-expression","rating":2059.4040623264,"_hash":1649292854,"paid_only":false}],"company":{}},{"contest":{"id":87,"title":"第 145 场周赛","title_slug":"weekly-contest-145","start_time":1563071400,"is_ee_exam_contest":null},"questions":[{"question_id":1122,"title":"数组的相对排序","title_slug":"relative-sort-array","rating":1188.6311093158,"_hash":509756552,"paid_only":false},{"question_id":1123,"title":"最深叶节点的最近公共祖先","title_slug":"lowest-common-ancestor-of-deepest-leaves","rating":1607.0005715974,"_hash":1997275023,"paid_only":false},{"question_id":1124,"title":"表现良好的最长时间段","title_slug":"longest-well-performing-interval","rating":1908.3866125757,"_hash":2409750542,"paid_only":false},{"question_id":1125,"title":"最小的必要团队","title_slug":"smallest-sufficient-team","rating":2250.9318291559,"_hash":537590451,"paid_only":false}],"company":{}},{"contest":{"id":88,"title":"第 4 场双周赛","title_slug":"biweekly-contest-4","start_time":1563028200,"is_ee_exam_contest":null},"questions":[{"question_id":1118,"title":"一月有多少天","title_slug":"number-of-days-in-a-month","rating":1227.3485530532,"_hash":3564822043,"paid_only":false},{"question_id":1119,"title":"删去字符串中的元音","title_slug":"remove-vowels-from-a-string","rating":1232.8314427996,"_hash":1547394567,"paid_only":false},{"question_id":1120,"title":"子树的最大平均值","title_slug":"maximum-average-subtree","rating":1361.8801013336,"_hash":1060291152,"paid_only":false},{"question_id":1121,"title":"将数组分成几个递增序列","title_slug":"divide-array-into-increasing-sequences","rating":1664.7703749741,"_hash":2894413444,"paid_only":false}],"company":{}},{"contest":{"id":86,"title":"第 144 场周赛","title_slug":"weekly-contest-144","start_time":1562466600,"is_ee_exam_contest":null},"questions":[{"question_id":1108,"title":"IP 地址无效化","title_slug":"defanging-an-ip-address","rating":1084.1319467318,"_hash":1418471367,"paid_only":false},{"question_id":1109,"title":"航班预订统计","title_slug":"corporate-flight-bookings","rating":1569.7528744586,"_hash":545869308,"paid_only":false},{"question_id":1110,"title":"删点成林","title_slug":"delete-nodes-and-return-forest","rating":1511.3725353467,"_hash":771122731,"paid_only":false},{"question_id":1111,"title":"有效括号的嵌套深度","title_slug":"maximum-nesting-depth-of-two-valid-parentheses-strings","rating":1749.4981778209,"_hash":3619796334,"paid_only":false}],"company":{}},{"contest":{"id":84,"title":"第 143 场周赛","title_slug":"weekly-contest-143","start_time":1561861800,"is_ee_exam_contest":null},"questions":[{"question_id":1103,"title":"分糖果 II","title_slug":"distribute-candies-to-people","rating":1287.1053917452,"_hash":4294197536,"paid_only":false},{"question_id":1104,"title":"二叉树寻路","title_slug":"path-in-zigzag-labelled-binary-tree","rating":1544.8391626032,"_hash":1959869314,"paid_only":false},{"question_id":1105,"title":"填充书架","title_slug":"filling-bookcase-shelves","rating":2014.2979320644,"_hash":2099267983,"paid_only":false},{"question_id":1106,"title":"解析布尔表达式","title_slug":"parsing-a-boolean-expression","rating":1880.4226853663,"_hash":253585197,"paid_only":false}],"company":{}},{"contest":{"id":85,"title":"第 3 场双周赛","title_slug":"biweekly-contest-3","start_time":1561818600,"is_ee_exam_contest":null},"questions":[{"question_id":1099,"title":"小于 K 的两数之和","title_slug":"two-sum-less-than-k","rating":1245.2741257148,"_hash":1002673857,"paid_only":false},{"question_id":1100,"title":"长度为 K 的无重复字符子串","title_slug":"find-k-length-substrings-with-no-repeated-characters","rating":1348.670191438,"_hash":3246372293,"paid_only":false},{"question_id":1101,"title":"彼此熟识的最早时间","title_slug":"the-earliest-moment-when-everyone-become-friends","rating":1558.4971807039,"_hash":234159120,"paid_only":false},{"question_id":1102,"title":"得分最高的路径","title_slug":"path-with-maximum-minimum-value","rating":2011.3542735398,"_hash":319427731,"paid_only":false}],"company":{}},{"contest":{"id":74,"title":"第 142 场周赛","title_slug":"weekly-contest-142","start_time":1561257000,"is_ee_exam_contest":null},"questions":[{"question_id":1093,"title":"大样本统计","title_slug":"statistics-from-a-large-sample","rating":1471.6221713607,"_hash":781431378,"paid_only":false},{"question_id":1094,"title":"拼车","title_slug":"car-pooling","rating":1441.4290319373,"_hash":1187211206,"paid_only":false},{"question_id":1095,"title":"山脉数组中查找目标值","title_slug":"find-in-mountain-array","rating":1827.090740222,"_hash":40615146,"paid_only":false},{"question_id":1096,"title":"花括号展开 II","title_slug":"brace-expansion-ii","rating":2348.5159376523,"_hash":1730213489,"paid_only":false}],"company":{}},{"contest":{"id":72,"title":"第 141 场周赛","title_slug":"weekly-contest-141","start_time":1560652200,"is_ee_exam_contest":null},"questions":[{"question_id":1089,"title":"复写零","title_slug":"duplicate-zeros","rating":1262.5890311992,"_hash":1350925428,"paid_only":false},{"question_id":1090,"title":"受标签影响的最大值","title_slug":"largest-values-from-labels","rating":1501.1152614679,"_hash":2513980161,"paid_only":false},{"question_id":1091,"title":"二进制矩阵中的最短路径","title_slug":"shortest-path-in-binary-matrix","rating":1658.3474650806,"_hash":1423912379,"paid_only":false},{"question_id":1092,"title":"最短公共超序列","title_slug":"shortest-common-supersequence","rating":1976.7214151234,"_hash":3433602336,"paid_only":false}],"company":{}},{"contest":{"id":73,"title":"第 2 场双周赛","title_slug":"biweekly-contest-2","start_time":1560609000,"is_ee_exam_contest":null},"questions":[{"question_id":1085,"title":"最小元素各数位之和","title_slug":"sum-of-digits-in-the-minimum-number","rating":1256.4891142083,"_hash":800569224,"paid_only":false},{"question_id":1086,"title":"前五科的均分","title_slug":"high-five","rating":1327.0282989915,"_hash":2018971200,"paid_only":false},{"question_id":1087,"title":"花括号展开","title_slug":"brace-expansion","rating":1480.1116248664,"_hash":3506344616,"paid_only":false},{"question_id":1088,"title":"易混淆数 II","title_slug":"confusing-number-ii","rating":2076.8975497986,"_hash":2950336182,"paid_only":false}],"company":{}},{"contest":{"id":71,"title":"第 140 场周赛","title_slug":"weekly-contest-140","start_time":1560047400,"is_ee_exam_contest":null},"questions":[{"question_id":1078,"title":"Bigram 分词","title_slug":"occurrences-after-bigram","rating":1274.7596170193,"_hash":2962478235,"paid_only":false},{"question_id":1079,"title":"活字印刷","title_slug":"letter-tile-possibilities","rating":1740.5014205942,"_hash":3654833214,"paid_only":false},{"question_id":1080,"title":"根到叶路径上的不足节点","title_slug":"insufficient-nodes-in-root-to-leaf-paths","rating":1804.5783242151,"_hash":547605841,"paid_only":false},{"question_id":1081,"title":"不同字符的最小子序列","title_slug":"smallest-subsequence-of-distinct-characters","rating":2184.5241011615,"_hash":2695383302,"paid_only":false}],"company":{}},{"contest":{"id":69,"title":"第 139 场周赛","title_slug":"weekly-contest-139","start_time":1559442600,"is_ee_exam_contest":null},"questions":[{"question_id":1071,"title":"字符串的最大公因子","title_slug":"greatest-common-divisor-of-strings","rating":1397.8875115008,"_hash":3816685448,"paid_only":false},{"question_id":1072,"title":"按列翻转得到最大值等行数","title_slug":"flip-columns-for-maximum-number-of-equal-rows","rating":1797.5851607225,"_hash":1857526630,"paid_only":false},{"question_id":1073,"title":"负二进制数相加","title_slug":"adding-two-negabinary-numbers","rating":1806.5891699944,"_hash":3275619185,"paid_only":false},{"question_id":1074,"title":"元素和为目标值的子矩阵数量","title_slug":"number-of-submatrices-that-sum-to-target","rating":2189.3802630548,"_hash":1802692575,"paid_only":false}],"company":{}},{"contest":{"id":70,"title":"第 1 场双周赛","title_slug":"biweekly-contest-1","start_time":1559399400,"is_ee_exam_contest":null},"questions":[{"question_id":1064,"title":"不动点","title_slug":"fixed-point","rating":1307.9800903088,"_hash":3920925170,"paid_only":false},{"question_id":1065,"title":"字符串的索引对","title_slug":"index-pairs-of-a-string","rating":1389.331169471,"_hash":2464323261,"paid_only":false},{"question_id":1066,"title":"校园自行车分配 II","title_slug":"campus-bikes-ii","rating":1885.1051527272,"_hash":729170392,"paid_only":false},{"question_id":1067,"title":"范围内的数字计数","title_slug":"digit-count-in-range","rating":2025.1529365814,"_hash":1347652080,"paid_only":false}],"company":{}},{"contest":{"id":68,"title":"第 138 场周赛","title_slug":"weekly-contest-138","start_time":1558837800,"is_ee_exam_contest":null},"questions":[{"question_id":1051,"title":"高度检查器","title_slug":"height-checker","rating":1303.0179795942,"_hash":479546084,"paid_only":false},{"question_id":1052,"title":"爱生气的书店老板","title_slug":"grumpy-bookstore-owner","rating":1418.1401949854,"_hash":3953245616,"paid_only":false},{"question_id":1053,"title":"交换一次的先前排列","title_slug":"previous-permutation-with-one-swap","rating":1633.1789521619,"_hash":3119606051,"paid_only":false},{"question_id":1054,"title":"距离相等的条形码","title_slug":"distant-barcodes","rating":1701.5735371897,"_hash":2024934932,"paid_only":false}],"company":{}},{"contest":{"id":67,"title":"第 137 场周赛","title_slug":"weekly-contest-137","start_time":1558233000,"is_ee_exam_contest":null},"questions":[{"question_id":1046,"title":"最后一块石头的重量","title_slug":"last-stone-weight","rating":1172.6819789183,"_hash":1420036364,"paid_only":false},{"question_id":1047,"title":"删除字符串中的所有相邻重复项","title_slug":"remove-all-adjacent-duplicates-in-string","rating":1286.3167937403,"_hash":2941915891,"paid_only":false},{"question_id":1048,"title":"最长字符串链","title_slug":"longest-string-chain","rating":1599.2720584736,"_hash":2048723677,"paid_only":false},{"question_id":1049,"title":"最后一块石头的重量 II","title_slug":"last-stone-weight-ii","rating":2092.4861692502,"_hash":305762053,"paid_only":false}],"company":{}},{"contest":{"id":66,"title":"第 136 场周赛","title_slug":"weekly-contest-136","start_time":1557628200,"is_ee_exam_contest":null},"questions":[{"question_id":1041,"title":"困于环中的机器人","title_slug":"robot-bounded-in-circle","rating":1521.1768537583,"_hash":2777625264,"paid_only":false},{"question_id":1042,"title":"不邻接植花","title_slug":"flower-planting-with-no-adjacent","rating":1712.4010133221,"_hash":2386982504,"paid_only":false},{"question_id":1043,"title":"分隔数组以得到最大和","title_slug":"partition-array-for-maximum-sum","rating":1916.0689858272,"_hash":1916400350,"paid_only":false},{"question_id":1044,"title":"最长重复子串","title_slug":"longest-duplicate-substring","rating":2428.7985254341,"_hash":625310591,"paid_only":false}],"company":{}},{"contest":{"id":65,"title":"第 135 场周赛","title_slug":"weekly-contest-135","start_time":1557023400,"is_ee_exam_contest":null},"questions":[{"question_id":1037,"title":"有效的回旋镖","title_slug":"valid-boomerang","rating":1255.9002796024,"_hash":2272805308,"paid_only":false},{"question_id":1038,"title":"从二叉搜索树到更大和树","title_slug":"binary-search-tree-to-greater-sum-tree","rating":1374.6755455786,"_hash":3738671880,"paid_only":false},{"question_id":1039,"title":"多边形三角剖分的最低得分","title_slug":"minimum-score-triangulation-of-polygon","rating":2130.1135718486,"_hash":491083091,"paid_only":false},{"question_id":1040,"title":"移动石子直到连续 II","title_slug":"moving-stones-until-consecutive-ii","rating":2455.8244137907,"_hash":2184686055,"paid_only":false}],"company":{}},{"contest":{"id":64,"title":"第 134 场周赛","title_slug":"weekly-contest-134","start_time":1556418600,"is_ee_exam_contest":null},"questions":[{"question_id":1033,"title":"移动石子直到连续","title_slug":"moving-stones-until-consecutive","rating":1421.2624065513,"_hash":1049390106,"paid_only":false},{"question_id":1034,"title":"边界着色","title_slug":"coloring-a-border","rating":1578.8503818621,"_hash":345204207,"paid_only":false},{"question_id":1035,"title":"不相交的线","title_slug":"uncrossed-lines","rating":1805.5947071171,"_hash":1788564041,"paid_only":false},{"question_id":1036,"title":"逃离大迷宫","title_slug":"escape-a-large-maze","rating":2164.8287157213,"_hash":2632738906,"paid_only":false}],"company":{}},{"contest":{"id":59,"title":"第 133 场周赛","title_slug":"weekly-contest-133","start_time":1555813800,"is_ee_exam_contest":null},"questions":[{"question_id":1029,"title":"两地调度","title_slug":"two-city-scheduling","rating":1348.0079390256,"_hash":3535624008,"paid_only":false},{"question_id":1030,"title":"距离顺序排列矩阵单元格","title_slug":"matrix-cells-in-distance-order","rating":1585.5793143983,"_hash":3321963457,"paid_only":false},{"question_id":1031,"title":"两个非重叠子数组的最大和","title_slug":"maximum-sum-of-two-non-overlapping-subarrays","rating":1680.4852623991,"_hash":3974822873,"paid_only":false},{"question_id":1032,"title":"字符流","title_slug":"stream-of-characters","rating":1970.4608098164,"_hash":1504907424,"paid_only":false}],"company":{}},{"contest":{"id":57,"title":"第 132 场周赛","title_slug":"weekly-contest-132","start_time":1555209000,"is_ee_exam_contest":null},"questions":[{"question_id":1025,"title":"除数博弈","title_slug":"divisor-game","rating":1435.3564963722,"_hash":2669738738,"paid_only":false},{"question_id":1026,"title":"节点与其祖先之间的最大差值","title_slug":"maximum-difference-between-node-and-ancestor","rating":1446.4280778775,"_hash":2850260537,"paid_only":false},{"question_id":1027,"title":"最长等差数列","title_slug":"longest-arithmetic-subsequence","rating":1758.75255141,"_hash":4193739814,"paid_only":false},{"question_id":1028,"title":"从先序遍历还原二叉树","title_slug":"recover-a-tree-from-preorder-traversal","rating":1797.4917663632,"_hash":4138934238,"paid_only":false}],"company":{}},{"contest":{"id":56,"title":"第 131 场周赛","title_slug":"weekly-contest-131","start_time":1554604200,"is_ee_exam_contest":null},"questions":[{"question_id":1021,"title":"删除最外层的括号","title_slug":"remove-outermost-parentheses","rating":1311.3495317884,"_hash":908082157,"paid_only":false},{"question_id":1022,"title":"从根到叶的二进制数之和","title_slug":"sum-of-root-to-leaf-binary-numbers","rating":1462.4423844498,"_hash":3615890317,"paid_only":false},{"question_id":1023,"title":"驼峰式匹配","title_slug":"camelcase-matching","rating":1537.1387686755,"_hash":875418963,"paid_only":false},{"question_id":1024,"title":"视频拼接","title_slug":"video-stitching","rating":1746.135917977,"_hash":2812871030,"paid_only":false}],"company":{}},{"contest":{"id":55,"title":"第 130 场周赛","title_slug":"weekly-contest-130","start_time":1553999400,"is_ee_exam_contest":null},"questions":[{"question_id":1018,"title":"可被 5 整除的二进制前缀","title_slug":"binary-prefix-divisible-by-5","rating":1376.4549624575,"_hash":303821987,"paid_only":false},{"question_id":1017,"title":"负二进制转换","title_slug":"convert-to-base-2","rating":1697.8500495479,"_hash":704152903,"paid_only":false},{"question_id":1019,"title":"链表中的下一个更大节点","title_slug":"next-greater-node-in-linked-list","rating":1570.8347522104,"_hash":1872980159,"paid_only":false},{"question_id":1020,"title":"飞地的数量","title_slug":"number-of-enclaves","rating":1615.4767730477,"_hash":1185092838,"paid_only":false}],"company":{}},{"contest":{"id":54,"title":"第 129 场周赛","title_slug":"weekly-contest-129","start_time":1553391000,"is_ee_exam_contest":null},"questions":[{"question_id":1013,"title":"将数组分成和相等的三个部分","title_slug":"partition-array-into-three-parts-with-equal-sum","rating":1378.7570411077,"_hash":733560660,"paid_only":false},{"question_id":1015,"title":"可被 K 整除的最小整数","title_slug":"smallest-integer-divisible-by-k","rating":1874.6468976233,"_hash":1796150705,"paid_only":false},{"question_id":1014,"title":"最佳观光组合","title_slug":"best-sightseeing-pair","rating":1730.3052054913,"_hash":212376193,"paid_only":false},{"question_id":1016,"title":"子串能表示从 1 到 N 数字的二进制串","title_slug":"binary-string-with-substrings-representing-1-to-n","rating":1779.3931248179,"_hash":3814673758,"paid_only":false}],"company":{}},{"contest":{"id":53,"title":"第 128 场周赛","title_slug":"weekly-contest-128","start_time":1552789800,"is_ee_exam_contest":null},"questions":[{"question_id":1009,"title":"十进制整数的反码","title_slug":"complement-of-base-10-integer","rating":1234.7084656358,"_hash":2765939834,"paid_only":false},{"question_id":1010,"title":"总持续时间可被 60 整除的歌曲","title_slug":"pairs-of-songs-with-total-durations-divisible-by-60","rating":1377.1913915125,"_hash":2310396,"paid_only":false},{"question_id":1011,"title":"在 D 天内送达包裹的能力","title_slug":"capacity-to-ship-packages-within-d-days","rating":1725.4481937307,"_hash":3609066875,"paid_only":false},{"question_id":1012,"title":"至少有 1 位重复的数字","title_slug":"numbers-with-repeated-digits","rating":2230.1673059455,"_hash":3469926498,"paid_only":false}],"company":{}},{"contest":{"id":52,"title":"第 127 场周赛","title_slug":"weekly-contest-127","start_time":1552185000,"is_ee_exam_contest":null},"questions":[{"question_id":1005,"title":"K 次取反后最大化的数组和","title_slug":"maximize-sum-of-array-after-k-negations","rating":1274.6742564805,"_hash":3607948747,"paid_only":false},{"question_id":1006,"title":"笨阶乘","title_slug":"clumsy-factorial","rating":1407.9870845299,"_hash":3282812734,"paid_only":false},{"question_id":1007,"title":"行相等的最少多米诺旋转","title_slug":"minimum-domino-rotations-for-equal-row","rating":1541.348438509,"_hash":2150121610,"paid_only":false},{"question_id":1008,"title":"前序遍历构造二叉搜索树","title_slug":"construct-binary-search-tree-from-preorder-traversal","rating":1562.9802666517,"_hash":4123515556,"paid_only":false}],"company":{}},{"contest":{"id":50,"title":"第 126 场周赛","title_slug":"weekly-contest-126","start_time":1551580200,"is_ee_exam_contest":null},"questions":[{"question_id":1002,"title":"查找共用字符","title_slug":"find-common-characters","rating":1279.7669712099,"_hash":1907819963,"paid_only":false},{"question_id":1003,"title":"检查替换后的词是否有效","title_slug":"check-if-word-is-valid-after-substitutions","rating":1426.7144554733,"_hash":2965139328,"paid_only":false},{"question_id":1004,"title":"最大连续1的个数 III","title_slug":"max-consecutive-ones-iii","rating":1655.6433885989,"_hash":296740468,"paid_only":false},{"question_id":1000,"title":"合并石头的最低成本","title_slug":"minimum-cost-to-merge-stones","rating":2422.5309771173,"_hash":730656427,"paid_only":false}],"company":{}},{"contest":{"id":49,"title":"第 125 场周赛","title_slug":"weekly-contest-125","start_time":1550975400,"is_ee_exam_contest":null},"questions":[{"question_id":997,"title":"找到小镇的法官","title_slug":"find-the-town-judge","rating":1201.6117337798,"_hash":588772553,"paid_only":false},{"question_id":999,"title":"可以被一步捕获的棋子数","title_slug":"available-captures-for-rook","rating":1317.9521104466,"_hash":2274658324,"paid_only":false},{"question_id":998,"title":"最大二叉树 II","title_slug":"maximum-binary-tree-ii","rating":1497.8880991093,"_hash":3866325213,"paid_only":false},{"question_id":1001,"title":"网格照明","title_slug":"grid-illumination","rating":1873.0367582475,"_hash":2294942579,"paid_only":false}],"company":{}},{"contest":{"id":48,"title":"第 124 场周赛","title_slug":"weekly-contest-124","start_time":1550370600,"is_ee_exam_contest":null},"questions":[{"question_id":993,"title":"二叉树的堂兄弟节点","title_slug":"cousins-in-binary-tree","rating":1287.9002757199,"_hash":1715714434,"paid_only":false},{"question_id":994,"title":"腐烂的橘子","title_slug":"rotting-oranges","rating":1432.9051050881,"_hash":782747152,"paid_only":false},{"question_id":995,"title":"K 连续位的最小翻转次数","title_slug":"minimum-number-of-k-consecutive-bit-flips","rating":1835.4868365659,"_hash":2191726075,"paid_only":false},{"question_id":996,"title":"正方形数组的数目","title_slug":"number-of-squareful-arrays","rating":1932.3730795204,"_hash":448999750,"paid_only":false}],"company":{}},{"contest":{"id":47,"title":"第 123 场周赛","title_slug":"weekly-contest-123","start_time":1549765800,"is_ee_exam_contest":null},"questions":[{"question_id":989,"title":"数组形式的整数加法","title_slug":"add-to-array-form-of-integer","rating":1234.7692637513,"_hash":2582233376,"paid_only":false},{"question_id":990,"title":"等式方程的可满足性","title_slug":"satisfiability-of-equality-equations","rating":1638.0148920643,"_hash":369209811,"paid_only":false},{"question_id":991,"title":"坏了的计算器","title_slug":"broken-calculator","rating":1909.4189035523,"_hash":376871815,"paid_only":false},{"question_id":992,"title":"K 个不同整数的子数组","title_slug":"subarrays-with-k-different-integers","rating":2210.3503183571,"_hash":3123575090,"paid_only":false}],"company":{}},{"contest":{"id":46,"title":"第 122 场周赛","title_slug":"weekly-contest-122","start_time":1549161000,"is_ee_exam_contest":null},"questions":[{"question_id":985,"title":"查询后的偶数和","title_slug":"sum-of-even-numbers-after-queries","rating":1198.4180401014,"_hash":2841881996,"paid_only":false},{"question_id":988,"title":"从叶结点开始的最小字符串","title_slug":"smallest-string-starting-from-leaf","rating":1429.1878389249,"_hash":1210196211,"paid_only":false},{"question_id":986,"title":"区间列表的交集","title_slug":"interval-list-intersections","rating":1541.6944600975,"_hash":3869891296,"paid_only":false},{"question_id":987,"title":"二叉树的垂序遍历","title_slug":"vertical-order-traversal-of-a-binary-tree","rating":1675.9610355975,"_hash":3791950406,"paid_only":false}],"company":{}},{"contest":{"id":45,"title":"第 121 场周赛","title_slug":"weekly-contest-121","start_time":1548556200,"is_ee_exam_contest":null},"questions":[{"question_id":984,"title":"不含 AAA 或 BBB 的字符串","title_slug":"string-without-aaa-or-bbb","rating":1474.0150725665,"_hash":3491443766,"paid_only":false},{"question_id":981,"title":"基于时间的键值存储","title_slug":"time-based-key-value-store","rating":1574.7542247682,"_hash":2074201652,"paid_only":false},{"question_id":983,"title":"最低票价","title_slug":"minimum-cost-for-tickets","rating":1786.3121598293,"_hash":1414741845,"paid_only":false},{"question_id":982,"title":"按位与为零的三元组","title_slug":"triples-with-bitwise-and-equal-to-zero","rating":2084.9697035674,"_hash":1019777981,"paid_only":false}],"company":{}},{"contest":{"id":44,"title":"第 120 场周赛","title_slug":"weekly-contest-120","start_time":1547951400,"is_ee_exam_contest":null},"questions":[{"question_id":977,"title":"有序数组的平方","title_slug":"squares-of-a-sorted-array","rating":1129.949090232,"_hash":969893325,"paid_only":false},{"question_id":978,"title":"最长湍流子数组","title_slug":"longest-turbulent-subarray","rating":1393.4123491817,"_hash":3588035361,"paid_only":false},{"question_id":979,"title":"在二叉树中分配硬币","title_slug":"distribute-coins-in-binary-tree","rating":1709.1461451873,"_hash":2734248382,"paid_only":false},{"question_id":980,"title":"不同路径 III","title_slug":"unique-paths-iii","rating":1830.3165569278,"_hash":1134359923,"paid_only":false}],"company":{}},{"contest":{"id":43,"title":"第 119 场周赛","title_slug":"weekly-contest-119","start_time":1547346600,"is_ee_exam_contest":null},"questions":[{"question_id":973,"title":"最接近原点的 K 个点","title_slug":"k-closest-points-to-origin","rating":1213.8073621345,"_hash":4289106415,"paid_only":false},{"question_id":976,"title":"三角形的最大周长","title_slug":"largest-perimeter-triangle","rating":1340.5559417151,"_hash":1665689312,"paid_only":false},{"question_id":974,"title":"和可被 K 整除的子数组","title_slug":"subarray-sums-divisible-by-k","rating":1675.989407584,"_hash":1023487571,"paid_only":false},{"question_id":975,"title":"奇偶跳","title_slug":"odd-even-jump","rating":2079.1911227043,"_hash":1733046404,"paid_only":false}],"company":{}},{"contest":{"id":42,"title":"第 118 场周赛","title_slug":"weekly-contest-118","start_time":1546741800,"is_ee_exam_contest":null},"questions":[{"question_id":970,"title":"强整数","title_slug":"powerful-integers","rating":1338.8322315568,"_hash":3883411103,"paid_only":false},{"question_id":969,"title":"煎饼排序","title_slug":"pancake-sorting","rating":1590.5791055102,"_hash":1247027569,"paid_only":false},{"question_id":971,"title":"翻转二叉树以匹配先序遍历","title_slug":"flip-binary-tree-to-match-preorder-traversal","rating":1786.5491561897,"_hash":16117382,"paid_only":false},{"question_id":972,"title":"相等的有理数","title_slug":"equal-rational-numbers","rating":2121.3147151648,"_hash":3639230179,"paid_only":false}],"company":{}},{"contest":{"id":41,"title":"第 117 场周赛","title_slug":"weekly-contest-117","start_time":1546137000,"is_ee_exam_contest":null},"questions":[{"question_id":965,"title":"单值二叉树","title_slug":"univalued-binary-tree","rating":1177.5660617941,"_hash":472415307,"paid_only":false},{"question_id":967,"title":"连续差相同的数字","title_slug":"numbers-with-same-consecutive-differences","rating":1432.9593207076,"_hash":2436753495,"paid_only":false},{"question_id":966,"title":"元音拼写检查器","title_slug":"vowel-spellchecker","rating":1795.0422250815,"_hash":3548460508,"paid_only":false},{"question_id":968,"title":"监控二叉树","title_slug":"binary-tree-cameras","rating":2124.1329592058,"_hash":1589710386,"paid_only":false}],"company":{}},{"contest":{"id":39,"title":"第 116 场周赛","title_slug":"weekly-contest-116","start_time":1545532200,"is_ee_exam_contest":null},"questions":[{"question_id":961,"title":"在长度 2N 的数组中找出重复 N 次的元素","title_slug":"n-repeated-element-in-size-2n-array","rating":1161.6227767245,"_hash":1677761084,"paid_only":false},{"question_id":962,"title":"最大宽度坡","title_slug":"maximum-width-ramp","rating":1607.80608595,"_hash":4064149855,"paid_only":false},{"question_id":963,"title":"最小面积矩形 II","title_slug":"minimum-area-rectangle-ii","rating":1990.7738526153,"_hash":2631196608,"paid_only":false},{"question_id":964,"title":"表示数字的最少运算符","title_slug":"least-operators-to-express-number","rating":2594.135673452,"_hash":571415893,"paid_only":false}],"company":{}},{"contest":{"id":38,"title":"第 115 场周赛","title_slug":"weekly-contest-115","start_time":1544927400,"is_ee_exam_contest":null},"questions":[{"question_id":957,"title":"N 天后的牢房","title_slug":"prison-cells-after-n-days","rating":1392.0853311911,"_hash":572178714,"paid_only":false},{"question_id":958,"title":"二叉树的完全性检验","title_slug":"check-completeness-of-a-binary-tree","rating":1702.8035923458,"_hash":4172058127,"paid_only":false},{"question_id":959,"title":"由斜杠划分区域","title_slug":"regions-cut-by-slashes","rating":2135.5738659086,"_hash":244758471,"paid_only":false},{"question_id":960,"title":"删列造序 III","title_slug":"delete-columns-to-make-sorted-iii","rating":2246.8671174565,"_hash":3194493363,"paid_only":false}],"company":{}},{"contest":{"id":37,"title":"第 114 场周赛","title_slug":"weekly-contest-114","start_time":1544322600,"is_ee_exam_contest":null},"questions":[{"question_id":953,"title":"验证外星语词典","title_slug":"verifying-an-alien-dictionary","rating":1299.6035132992,"_hash":3996759401,"paid_only":false},{"question_id":954,"title":"二倍数对数组","title_slug":"array-of-doubled-pairs","rating":1547.5714796512,"_hash":3671857466,"paid_only":false},{"question_id":955,"title":"删列造序 II","title_slug":"delete-columns-to-make-sorted-ii","rating":1876.3854625677,"_hash":2817465096,"paid_only":false},{"question_id":956,"title":"最高的广告牌","title_slug":"tallest-billboard","rating":2381.479024858,"_hash":2251334448,"paid_only":false}],"company":{}},{"contest":{"id":36,"title":"第 113 场周赛","title_slug":"weekly-contest-113","start_time":1543717800,"is_ee_exam_contest":null},"questions":[{"question_id":949,"title":"给定数字能组成的最大时间","title_slug":"largest-time-for-given-digits","rating":1495.3186477678,"_hash":1800599582,"paid_only":false},{"question_id":951,"title":"翻转等价二叉树","title_slug":"flip-equivalent-binary-trees","rating":1477.4844514104,"_hash":444680013,"paid_only":false},{"question_id":950,"title":"按递增顺序显示卡牌","title_slug":"reveal-cards-in-increasing-order","rating":1686.4493679523,"_hash":1319672571,"paid_only":false},{"question_id":952,"title":"按公因数计算最大组件大小","title_slug":"largest-component-size-by-common-factor","rating":2272.1122260637,"_hash":1950962783,"paid_only":false}],"company":{}},{"contest":{"id":35,"title":"第 112 场周赛","title_slug":"weekly-contest-112","start_time":1543113000,"is_ee_exam_contest":null},"questions":[{"question_id":945,"title":"使数组唯一的最小增量","title_slug":"minimum-increment-to-make-array-unique","rating":1448.1207963663,"_hash":2617837584,"paid_only":false},{"question_id":946,"title":"验证栈序列","title_slug":"validate-stack-sequences","rating":1461.9157715206,"_hash":403672441,"paid_only":false},{"question_id":947,"title":"移除最多的同行或同列石头","title_slug":"most-stones-removed-with-same-row-or-column","rating":2034.6759416871,"_hash":728229560,"paid_only":false},{"question_id":948,"title":"令牌放置","title_slug":"bag-of-tokens","rating":1762.3115124143,"_hash":2688493082,"paid_only":false}],"company":{}},{"contest":{"id":34,"title":"第 111 场周赛","title_slug":"weekly-contest-111","start_time":1542508200,"is_ee_exam_contest":null},"questions":[{"question_id":941,"title":"有效的山脉数组","title_slug":"valid-mountain-array","rating":1208.0130656905,"_hash":4212893423,"paid_only":false},{"question_id":944,"title":"删列造序","title_slug":"delete-columns-to-make-sorted","rating":1396.4853538164,"_hash":3612858843,"paid_only":false},{"question_id":942,"title":"增减字符串匹配","title_slug":"di-string-match","rating":1444.2068009303,"_hash":2792312732,"paid_only":false},{"question_id":943,"title":"最短超级串","title_slug":"find-the-shortest-superstring","rating":2185.5444704515,"_hash":1762990534,"paid_only":false}],"company":{}},{"contest":{"id":33,"title":"第 110 场周赛","title_slug":"weekly-contest-110","start_time":1541903400,"is_ee_exam_contest":null},"questions":[{"question_id":937,"title":"重新排列日志文件","title_slug":"reorder-data-in-log-files","rating":1387.3672639293,"_hash":3738917436,"paid_only":false},{"question_id":938,"title":"二叉搜索树的范围和","title_slug":"range-sum-of-bst","rating":1335.0295688697,"_hash":2572143666,"paid_only":false},{"question_id":939,"title":"最小面积矩形","title_slug":"minimum-area-rectangle","rating":1752.2621077596,"_hash":1965686195,"paid_only":false},{"question_id":940,"title":"不同的子序列 II","title_slug":"distinct-subsequences-ii","rating":1985.2417520906,"_hash":2213463441,"paid_only":false}],"company":{}},{"contest":{"id":32,"title":"第 109 场周赛","title_slug":"weekly-contest-109","start_time":1541295000,"is_ee_exam_contest":null},"questions":[{"question_id":933,"title":"最近的请求次数","title_slug":"number-of-recent-calls","rating":1337.8472367494,"_hash":181840890,"paid_only":false},{"question_id":935,"title":"骑士拨号器","title_slug":"knight-dialer","rating":1690.1655236843,"_hash":2786534786,"paid_only":false},{"question_id":934,"title":"最短的桥","title_slug":"shortest-bridge","rating":1825.770486008,"_hash":4107503015,"paid_only":false},{"question_id":936,"title":"戳印序列","title_slug":"stamping-the-sequence","rating":2583.406911951,"_hash":3709920516,"paid_only":false}],"company":{}},{"contest":{"id":31,"title":"第 108 场周赛","title_slug":"weekly-contest-108","start_time":1540690200,"is_ee_exam_contest":null},"questions":[{"question_id":929,"title":"独特的电子邮件地址","title_slug":"unique-email-addresses","rating":1199.2892732505,"_hash":3531395010,"paid_only":false},{"question_id":930,"title":"和相同的二元子数组","title_slug":"binary-subarrays-with-sum","rating":1591.5492530876,"_hash":1629689602,"paid_only":false},{"question_id":931,"title":"下降路径最小和","title_slug":"minimum-falling-path-sum","rating":1573.2701790739,"_hash":3874484865,"paid_only":false},{"question_id":932,"title":"漂亮数组","title_slug":"beautiful-array","rating":2294.0981174197,"_hash":3554305488,"paid_only":false}],"company":{}},{"contest":{"id":30,"title":"第 107 场周赛","title_slug":"weekly-contest-107","start_time":1540085400,"is_ee_exam_contest":null},"questions":[{"question_id":925,"title":"长按键入","title_slug":"long-pressed-name","rating":1271.3313760514,"_hash":101859828,"paid_only":false},{"question_id":926,"title":"将字符串翻转到单调递增","title_slug":"flip-string-to-monotone-increasing","rating":1601.511760532,"_hash":3457051682,"paid_only":false},{"question_id":927,"title":"三等分","title_slug":"three-equal-parts","rating":1994.3618892548,"_hash":2182253577,"paid_only":false},{"question_id":928,"title":"尽量减少恶意软件的传播 II","title_slug":"minimize-malware-spread-ii","rating":1985.2504512337,"_hash":1457368038,"paid_only":false}],"company":{}},{"contest":{"id":29,"title":"第 106 场周赛","title_slug":"weekly-contest-106","start_time":1539480600,"is_ee_exam_contest":null},"questions":[{"question_id":922,"title":"按奇偶排序数组 II","title_slug":"sort-array-by-parity-ii","rating":1173.505926482,"_hash":3658913842,"paid_only":false},{"question_id":921,"title":"使括号有效的最少添加","title_slug":"minimum-add-to-make-parentheses-valid","rating":1242.4710735813,"_hash":3288770916,"paid_only":false},{"question_id":923,"title":"三数之和的多种可能","title_slug":"3sum-with-multiplicity","rating":1710.9105378431,"_hash":352505600,"paid_only":false},{"question_id":924,"title":"尽量减少恶意软件的传播","title_slug":"minimize-malware-spread","rating":1868.9146755896,"_hash":28387341,"paid_only":false}],"company":{}},{"contest":{"id":28,"title":"第 105 场周赛","title_slug":"weekly-contest-105","start_time":1538875800,"is_ee_exam_contest":null},"questions":[{"question_id":917,"title":"仅仅反转字母","title_slug":"reverse-only-letters","rating":1228.630993648,"_hash":2941821802,"paid_only":false},{"question_id":918,"title":"环形子数组的最大和","title_slug":"maximum-sum-circular-subarray","rating":1777.3786570233,"_hash":3263594037,"paid_only":false},{"question_id":919,"title":"完全二叉树插入器","title_slug":"complete-binary-tree-inserter","rating":1690.9043557462,"_hash":3341470372,"paid_only":false},{"question_id":920,"title":"播放列表的数量","title_slug":"number-of-music-playlists","rating":2399.5729141925,"_hash":1165166058,"paid_only":false}],"company":{}},{"contest":{"id":27,"title":"第 104 场周赛","title_slug":"weekly-contest-104","start_time":1538271000,"is_ee_exam_contest":null},"questions":[{"question_id":914,"title":"卡牌分组","title_slug":"x-of-a-kind-in-a-deck-of-cards","rating":1370.6144908238,"_hash":3334808342,"paid_only":false},{"question_id":915,"title":"分割数组","title_slug":"partition-array-into-disjoint-intervals","rating":1500.8381829812,"_hash":217546662,"paid_only":false},{"question_id":916,"title":"单词子集","title_slug":"word-subsets","rating":1624.4737611923,"_hash":857697187,"paid_only":false},{"question_id":913,"title":"猫和老鼠","title_slug":"cat-and-mouse","rating":2566.5910742837,"_hash":1811529317,"paid_only":false}],"company":{}},{"contest":{"id":26,"title":"第 103 场周赛","title_slug":"weekly-contest-103","start_time":1537666200,"is_ee_exam_contest":null},"questions":[{"question_id":908,"title":"最小差值 I","title_slug":"smallest-range-i","rating":1298.5921473119,"_hash":690261450,"paid_only":false},{"question_id":909,"title":"蛇梯棋","title_slug":"snakes-and-ladders","rating":2019.5399647546,"_hash":478874060,"paid_only":false},{"question_id":910,"title":"最小差值 II","title_slug":"smallest-range-ii","rating":2134.5448970405,"_hash":1737160601,"paid_only":false},{"question_id":911,"title":"在线选举","title_slug":"online-election","rating":2000.8021428612,"_hash":2045578042,"paid_only":false}],"company":{}},{"contest":{"id":25,"title":"第 102 场周赛","title_slug":"weekly-contest-102","start_time":1537061400,"is_ee_exam_contest":null},"questions":[{"question_id":905,"title":"按奇偶排序数组","title_slug":"sort-array-by-parity","rating":1178.4942541235,"_hash":119654105,"paid_only":false},{"question_id":904,"title":"水果成篮","title_slug":"fruit-into-baskets","rating":1516.4104902196,"_hash":123050212,"paid_only":false},{"question_id":907,"title":"子数组的最小值之和","title_slug":"sum-of-subarray-minimums","rating":1975.5726300727,"_hash":2762853048,"paid_only":false},{"question_id":906,"title":"超级回文数","title_slug":"super-palindromes","rating":2140.0220703954,"_hash":159231277,"paid_only":false}],"company":{}},{"contest":{"id":24,"title":"第 101 场周赛","title_slug":"weekly-contest-101","start_time":1536456600,"is_ee_exam_contest":null},"questions":[{"question_id":900,"title":"RLE 迭代器","title_slug":"rle-iterator","rating":1532.2539947529,"_hash":2874032831,"paid_only":false},{"question_id":901,"title":"股票价格跨度","title_slug":"online-stock-span","rating":1708.8735585776,"_hash":613691832,"paid_only":false},{"question_id":902,"title":"最大为 N 的数字组合","title_slug":"numbers-at-most-n-given-digit-set","rating":1989.5369509422,"_hash":3023386017,"paid_only":false},{"question_id":903,"title":"DI 序列的有效排列","title_slug":"valid-permutations-for-di-sequence","rating":2433.3767704629,"_hash":2519726489,"paid_only":false}],"company":{}},{"contest":{"id":23,"title":"第 100 场周赛","title_slug":"weekly-contest-100","start_time":1535851800,"is_ee_exam_contest":null},"questions":[{"question_id":896,"title":"单调数列","title_slug":"monotonic-array","rating":1258.6719675401,"_hash":161597751,"paid_only":false},{"question_id":897,"title":"递增顺序搜索树","title_slug":"increasing-order-search-tree","rating":1473.2523136772,"_hash":1569116237,"paid_only":false},{"question_id":898,"title":"子数组按位或操作","title_slug":"bitwise-ors-of-subarrays","rating":2133.1003195919,"_hash":1959774558,"paid_only":false},{"question_id":899,"title":"有序队列","title_slug":"orderly-queue","rating":2096.6098086765,"_hash":1912276022,"paid_only":false}],"company":{}},{"contest":{"id":22,"title":"第 99 场周赛","title_slug":"weekly-contest-99","start_time":1535247000,"is_ee_exam_contest":null},"questions":[{"question_id":892,"title":"三维形体的表面积","title_slug":"surface-area-of-3d-shapes","rating":1507.8701119064,"_hash":1063164797,"paid_only":false},{"question_id":893,"title":"特殊等价字符串组","title_slug":"groups-of-special-equivalent-strings","rating":1590.0883962313,"_hash":1402867741,"paid_only":false},{"question_id":894,"title":"所有可能的真二叉树","title_slug":"all-possible-full-binary-trees","rating":1784.2539813582,"_hash":4144023748,"paid_only":false},{"question_id":895,"title":"最大频率栈","title_slug":"maximum-frequency-stack","rating":2027.8772739639,"_hash":4136320759,"paid_only":false}],"company":{}},{"contest":{"id":21,"title":"第 98 场周赛","title_slug":"weekly-contest-98","start_time":1534642200,"is_ee_exam_contest":null},"questions":[{"question_id":888,"title":"公平的糖果交换","title_slug":"fair-candy-swap","rating":1334.0564009231,"_hash":1232284801,"paid_only":false},{"question_id":890,"title":"查找和替换模式","title_slug":"find-and-replace-pattern","rating":1414.4918812526,"_hash":3073583780,"paid_only":false},{"question_id":889,"title":"根据前序和后序遍历构造二叉树","title_slug":"construct-binary-tree-from-preorder-and-postorder-traversal","rating":1731.5555445321,"_hash":3152421262,"paid_only":false},{"question_id":891,"title":"子序列宽度之和","title_slug":"sum-of-subsequence-widths","rating":2182.6180030785,"_hash":1150623470,"paid_only":false}],"company":{}},{"contest":{"id":20,"title":"第 97 场周赛","title_slug":"weekly-contest-97","start_time":1534037400,"is_ee_exam_contest":null},"questions":[{"question_id":884,"title":"两句话中的不常见单词","title_slug":"uncommon-words-from-two-sentences","rating":1259.409726189,"_hash":4093059486,"paid_only":false},{"question_id":885,"title":"螺旋矩阵 III","title_slug":"spiral-matrix-iii","rating":1678.3947690537,"_hash":571559842,"paid_only":false},{"question_id":886,"title":"可能的二分法","title_slug":"possible-bipartition","rating":1794.5827898448,"_hash":860518194,"paid_only":false},{"question_id":887,"title":"鸡蛋掉落","title_slug":"super-egg-drop","rating":2376.8658923518,"_hash":2610426510,"paid_only":false}],"company":{}},{"contest":{"id":19,"title":"第 96 场周赛","title_slug":"weekly-contest-96","start_time":1533432600,"is_ee_exam_contest":null},"questions":[{"question_id":883,"title":"三维形体投影面积","title_slug":"projection-area-of-3d-shapes","rating":1425.3981616639,"_hash":4256716489,"paid_only":false},{"question_id":881,"title":"救生艇","title_slug":"boats-to-save-people","rating":1529.7617243868,"_hash":559582932,"paid_only":false},{"question_id":880,"title":"索引处的解码字符串","title_slug":"decoded-string-at-index","rating":2010.5524756946,"_hash":3383627644,"paid_only":false},{"question_id":882,"title":"细分图中的可到达节点","title_slug":"reachable-nodes-in-subdivided-graph","rating":2328.4294689238,"_hash":2956439807,"paid_only":false}],"company":{}},{"contest":{"id":18,"title":"第 95 场周赛","title_slug":"weekly-contest-95","start_time":1532827800,"is_ee_exam_contest":null},"questions":[{"question_id":876,"title":"链表的中间结点","title_slug":"middle-of-the-linked-list","rating":1231.6157956848,"_hash":2188606245,"paid_only":false},{"question_id":877,"title":"石子游戏","title_slug":"stone-game","rating":1590.0463215721,"_hash":3927702135,"paid_only":false},{"question_id":878,"title":"第 N 个神奇数字","title_slug":"nth-magical-number","rating":1896.7975214446,"_hash":2613974860,"paid_only":false},{"question_id":879,"title":"盈利计划","title_slug":"profitable-schemes","rating":2204.3524370174,"_hash":3884874766,"paid_only":false}],"company":{}},{"contest":{"id":17,"title":"第 94 场周赛","title_slug":"weekly-contest-94","start_time":1532223000,"is_ee_exam_contest":null},"questions":[{"question_id":872,"title":"叶子相似的树","title_slug":"leaf-similar-trees","rating":1287.8970301681,"_hash":1479673533,"paid_only":false},{"question_id":874,"title":"模拟行走机器人","title_slug":"walking-robot-simulation","rating":1846.3568350016,"_hash":809566471,"paid_only":false},{"question_id":875,"title":"爱吃香蕉的珂珂","title_slug":"koko-eating-bananas","rating":1765.5654059263,"_hash":2370285073,"paid_only":false},{"question_id":873,"title":"最长的斐波那契子序列的长度","title_slug":"length-of-longest-fibonacci-subsequence","rating":1911.1959516695,"_hash":3865734981,"paid_only":false}],"company":{}},{"contest":{"id":16,"title":"第 93 场周赛","title_slug":"weekly-contest-93","start_time":1531618200,"is_ee_exam_contest":null},"questions":[{"question_id":868,"title":"二进制间距","title_slug":"binary-gap","rating":1307.2991245272,"_hash":3658316549,"paid_only":false},{"question_id":869,"title":"重新排序得到 2 的幂","title_slug":"reordered-power-of-2","rating":1504.8237159326,"_hash":2235555306,"paid_only":false},{"question_id":870,"title":"优势洗牌","title_slug":"advantage-shuffle","rating":1648.341757882,"_hash":301734990,"paid_only":false},{"question_id":871,"title":"最低加油次数","title_slug":"minimum-number-of-refueling-stops","rating":2074.4120526679,"_hash":4182324049,"paid_only":false}],"company":{}},{"contest":{"id":15,"title":"第 92 场周赛","title_slug":"weekly-contest-92","start_time":1531013400,"is_ee_exam_contest":null},"questions":[{"question_id":867,"title":"转置矩阵","title_slug":"transpose-matrix","rating":1258.8401788462,"_hash":638561610,"paid_only":false},{"question_id":865,"title":"具有所有最深节点的最小子树","title_slug":"smallest-subtree-with-all-the-deepest-nodes","rating":1534.325005151,"_hash":3353015937,"paid_only":false},{"question_id":866,"title":"回文质数","title_slug":"prime-palindrome","rating":1938.2224916289,"_hash":3105635512,"paid_only":false},{"question_id":864,"title":"获取所有钥匙的最短路径","title_slug":"shortest-path-to-get-all-keys","rating":2258.6371797452,"_hash":3615735813,"paid_only":false}],"company":{}},{"contest":{"id":14,"title":"第 91 场周赛","title_slug":"weekly-contest-91","start_time":1530408600,"is_ee_exam_contest":null},"questions":[{"question_id":860,"title":"柠檬水找零","title_slug":"lemonade-change","rating":1285.7282180721,"_hash":487789523,"paid_only":false},{"question_id":863,"title":"二叉树中所有距离为 K 的结点","title_slug":"all-nodes-distance-k-in-binary-tree","rating":1663.1853149056,"_hash":2021376917,"paid_only":false},{"question_id":861,"title":"翻转矩阵后的得分","title_slug":"score-after-flipping-matrix","rating":1818.0024504436,"_hash":1135090504,"paid_only":false},{"question_id":862,"title":"和至少为 K 的最短子数组","title_slug":"shortest-subarray-with-sum-at-least-k","rating":2306.8472649456,"_hash":3460806368,"paid_only":false}],"company":{}},{"contest":{"id":13,"title":"第 90 场周赛","title_slug":"weekly-contest-90","start_time":1529803800,"is_ee_exam_contest":null},"questions":[{"question_id":859,"title":"亲密字符串","title_slug":"buddy-strings","rating":1341.2659819842,"_hash":2442045936,"paid_only":false},{"question_id":856,"title":"括号的分数","title_slug":"score-of-parentheses","rating":1562.7212466716,"_hash":2871847316,"paid_only":false},{"question_id":858,"title":"镜面反射","title_slug":"mirror-reflection","rating":1880.7433591583,"_hash":1432071996,"paid_only":false},{"question_id":857,"title":"雇佣 K 名工人的最低成本","title_slug":"minimum-cost-to-hire-k-workers","rating":2259.6572191969,"_hash":718375766,"paid_only":false}],"company":{}},{"contest":{"id":12,"title":"第 89 场周赛","title_slug":"weekly-contest-89","start_time":1529199000,"is_ee_exam_contest":null},"questions":[{"question_id":852,"title":"山脉数组的峰顶索引","title_slug":"peak-index-in-a-mountain-array","rating":1181.5839867359,"_hash":2285522737,"paid_only":false},{"question_id":853,"title":"车队","title_slug":"car-fleet","rating":1678.1133886034,"_hash":1478600712,"paid_only":false},{"question_id":855,"title":"考场就座","title_slug":"exam-room","rating":2067.0643721733,"_hash":362145938,"paid_only":false},{"question_id":854,"title":"相似度为 K 的字符串","title_slug":"k-similar-strings","rating":2377.3895801187,"_hash":4154336589,"paid_only":false}],"company":{}},{"contest":{"id":11,"title":"第 88 场周赛","title_slug":"weekly-contest-88","start_time":1528594200,"is_ee_exam_contest":null},"questions":[{"question_id":848,"title":"字母移位","title_slug":"shifting-letters","rating":1352.7250049956,"_hash":3410974541,"paid_only":false},{"question_id":849,"title":"到最近的人的最大距离","title_slug":"maximize-distance-to-closest-person","rating":1382.7178688716,"_hash":3370131507,"paid_only":false},{"question_id":851,"title":"喧闹和富有","title_slug":"loud-and-rich","rating":1783.2337340478,"_hash":3836236370,"paid_only":false},{"question_id":850,"title":"矩形面积 II","title_slug":"rectangle-area-ii","rating":2235.9672341699,"_hash":512758649,"paid_only":false}],"company":{}},{"contest":{"id":9,"title":"第 87 场周赛","title_slug":"weekly-contest-87","start_time":1527989400,"is_ee_exam_contest":null},"questions":[{"question_id":844,"title":"比较含退格的字符串","title_slug":"backspace-string-compare","rating":1227.7906887239,"_hash":941716720,"paid_only":false},{"question_id":845,"title":"数组中的最长山脉","title_slug":"longest-mountain-in-array","rating":1436.5343999134,"_hash":401508981,"paid_only":false},{"question_id":846,"title":"一手顺子","title_slug":"hand-of-straights","rating":1565.2483424929,"_hash":2014057820,"paid_only":false},{"question_id":847,"title":"访问所有节点的最短路径","title_slug":"shortest-path-visiting-all-nodes","rating":2200.6623666057,"_hash":3527222391,"paid_only":false}],"company":{}},{"contest":{"id":8,"title":"第 86 场周赛","title_slug":"weekly-contest-86","start_time":1527384600,"is_ee_exam_contest":null},"questions":[{"question_id":840,"title":"矩阵中的幻方","title_slug":"magic-squares-in-grid","rating":1425.9672522649,"_hash":3456273150,"paid_only":false},{"question_id":841,"title":"钥匙和房间","title_slug":"keys-and-rooms","rating":1412.2790156634,"_hash":1361459100,"paid_only":false},{"question_id":842,"title":"将数组拆分成斐波那契序列","title_slug":"split-array-into-fibonacci-sequence","rating":1779.9495819318,"_hash":466340061,"paid_only":false},{"question_id":843,"title":"猜猜这个单词","title_slug":"guess-the-word","rating":2077.5054883516,"_hash":2857979415,"paid_only":false}],"company":{}},{"contest":{"id":7,"title":"第 85 场周赛","title_slug":"weekly-contest-85","start_time":1526779800,"is_ee_exam_contest":null},"questions":[{"question_id":836,"title":"矩形重叠","title_slug":"rectangle-overlap","rating":1442.9468304752,"_hash":4086617748,"paid_only":false},{"question_id":838,"title":"推多米诺","title_slug":"push-dominoes","rating":1638.1281256708,"_hash":942356384,"paid_only":false},{"question_id":837,"title":"新 21 点","title_slug":"new-21-game","rating":2350.0380300939,"_hash":3259259158,"paid_only":false},{"question_id":839,"title":"相似字符串组","title_slug":"similar-string-groups","rating":2053.7468090497,"_hash":2704310299,"paid_only":false}],"company":{}},{"contest":{"id":6,"title":"第 84 场周赛","title_slug":"weekly-contest-84","start_time":1526175000,"is_ee_exam_contest":null},"questions":[{"question_id":832,"title":"翻转图像","title_slug":"flipping-an-image","rating":1243.1009943284,"_hash":715235362,"paid_only":false},{"question_id":833,"title":"字符串中的查找与替换","title_slug":"find-and-replace-in-string","rating":1460.9610936441,"_hash":286069565,"paid_only":false},{"question_id":835,"title":"图像重叠","title_slug":"image-overlap","rating":1969.9845549158,"_hash":2595882232,"paid_only":false},{"question_id":834,"title":"树中距离之和","title_slug":"sum-of-distances-in-tree","rating":2197.0951445919,"_hash":3424505272,"paid_only":false}],"company":{}},{"contest":{"id":5,"title":"第 83 场周赛","title_slug":"weekly-contest-83","start_time":1525570200,"is_ee_exam_contest":null},"questions":[{"question_id":830,"title":"较大分组的位置","title_slug":"positions-of-large-groups","rating":1251.822378691,"_hash":836765096,"paid_only":false},{"question_id":831,"title":"隐藏个人信息","title_slug":"masking-personal-information","rating":1450.5787293419,"_hash":3572615577,"paid_only":false},{"question_id":829,"title":"连续整数求和","title_slug":"consecutive-numbers-sum","rating":1694.433951503,"_hash":2377767456,"paid_only":false},{"question_id":828,"title":"统计子串中的唯一字符","title_slug":"count-unique-characters-of-all-substrings-of-a-given-string","rating":2034.4067304341,"_hash":747763790,"paid_only":false}],"company":{}}] +[{"contest":{"id":998,"title":"第 386 场周赛","title_slug":"weekly-contest-386","start_time":1708828200,"is_ee_exam_contest":null},"questions":[{"question_id":3324,"title":"分割数组","title_slug":"split-the-array","rating":0,"_hash":570608577,"paid_only":false},{"question_id":3325,"title":"求交集区域内的最大正方形面积","title_slug":"find-the-largest-area-of-square-inside-two-rectangles","rating":0,"_hash":1264664962,"paid_only":false},{"question_id":3292,"title":"标记所有下标的最早秒数 I","title_slug":"earliest-second-to-mark-indices-i","rating":0,"_hash":2474207721,"paid_only":false},{"question_id":3289,"title":"标记所有下标的最早秒数 II","title_slug":"earliest-second-to-mark-indices-ii","rating":0,"_hash":2820740224,"paid_only":false}],"company":{}},{"contest":{"id":994,"title":"第 385 场周赛","title_slug":"weekly-contest-385","start_time":1708223400,"is_ee_exam_contest":null},"questions":[{"question_id":3042,"title":"统计前后缀下标对 I","title_slug":"count-prefix-and-suffix-pairs-i","rating":0,"_hash":2560538129,"paid_only":false},{"question_id":3043,"title":"最长公共前缀的长度","title_slug":"find-the-length-of-the-longest-common-prefix","rating":0,"_hash":3836897087,"paid_only":false},{"question_id":3044,"title":"出现频率最高的质数","title_slug":"most-frequent-prime","rating":0,"_hash":1829348697,"paid_only":false},{"question_id":3045,"title":"统计前后缀下标对 II","title_slug":"count-prefix-and-suffix-pairs-ii","rating":0,"_hash":3118022376,"paid_only":false}],"company":{}},{"contest":{"id":991,"title":"第 124 场双周赛","title_slug":"biweekly-contest-124","start_time":1708180200,"is_ee_exam_contest":null},"questions":[{"question_id":3038,"title":"相同分数的最大操作数目 I","title_slug":"maximum-number-of-operations-with-the-same-score-i","rating":0,"_hash":787831673,"paid_only":false},{"question_id":3039,"title":"进行操作使字符串为空","title_slug":"apply-operations-to-make-string-empty","rating":0,"_hash":1356097871,"paid_only":false},{"question_id":3040,"title":"相同分数的最大操作数目 II","title_slug":"maximum-number-of-operations-with-the-same-score-ii","rating":0,"_hash":4231944752,"paid_only":false},{"question_id":3041,"title":"修改数组后最大化数组中的连续元素数目","title_slug":"maximize-consecutive-elements-in-an-array-after-modification","rating":0,"_hash":267105112,"paid_only":false}],"company":{}},{"contest":{"id":992,"title":"第 384 场周赛","title_slug":"weekly-contest-384","start_time":1707618600,"is_ee_exam_contest":null},"questions":[{"question_id":3033,"title":"修改矩阵","title_slug":"modify-the-matrix","rating":1180.5927490268,"_hash":545408597,"paid_only":false},{"question_id":3034,"title":"匹配模式数组的子数组数目 I","title_slug":"number-of-subarrays-that-match-a-pattern-i","rating":1383.775103528,"_hash":3386206172,"paid_only":false},{"question_id":3035,"title":"回文字符串的最大数量","title_slug":"maximum-palindromes-after-operations","rating":1856.6336926997,"_hash":2800289700,"paid_only":false},{"question_id":3036,"title":"匹配模式数组的子数组数目 II","title_slug":"number-of-subarrays-that-match-a-pattern-ii","rating":1894.5496928891,"_hash":1878147567,"paid_only":false}],"company":{}},{"contest":{"id":988,"title":"第 383 场周赛","title_slug":"weekly-contest-383","start_time":1707013800,"is_ee_exam_contest":null},"questions":[{"question_id":3028,"title":"边界上的蚂蚁","title_slug":"ant-on-the-boundary","rating":1115.8258444602,"_hash":3048586035,"paid_only":false},{"question_id":3029,"title":"将单词恢复初始状态所需的最短时间 I","title_slug":"minimum-time-to-revert-word-to-initial-state-i","rating":1659.6231386056,"_hash":2654590324,"paid_only":false},{"question_id":3030,"title":"找出网格的区域平均强度","title_slug":"find-the-grid-of-region-average","rating":1896.4053993495,"_hash":2583029056,"paid_only":false},{"question_id":3031,"title":"将单词恢复初始状态所需的最短时间 II","title_slug":"minimum-time-to-revert-word-to-initial-state-ii","rating":2277.9557248587,"_hash":839548071,"paid_only":false}],"company":{}},{"contest":{"id":985,"title":"第 123 场双周赛","title_slug":"biweekly-contest-123","start_time":1706970600,"is_ee_exam_contest":null},"questions":[{"question_id":3024,"title":"三角形类型","title_slug":"type-of-triangle","rating":1134.7862697576,"_hash":3778120928,"paid_only":false},{"question_id":3025,"title":"人员站位的方案数 I","title_slug":"find-the-number-of-ways-to-place-people-i","rating":1707.4309979043,"_hash":442815761,"paid_only":false},{"question_id":3026,"title":"最大好子数组和","title_slug":"maximum-good-subarray-sum","rating":1816.556997127,"_hash":1621119601,"paid_only":false},{"question_id":3027,"title":"人员站位的方案数 II","title_slug":"find-the-number-of-ways-to-place-people-ii","rating":2020.1846215023,"_hash":79432680,"paid_only":false}],"company":{}},{"contest":{"id":986,"title":"第 382 场周赛","title_slug":"weekly-contest-382","start_time":1706409000,"is_ee_exam_contest":null},"questions":[{"question_id":3019,"title":"按键变更的次数","title_slug":"number-of-changing-keys","rating":1175.5552151972,"_hash":3290623649,"paid_only":false},{"question_id":3020,"title":"子集中元素的最大数量","title_slug":"find-the-maximum-number-of-elements-in-subset","rating":1741.3694833067,"_hash":3880011182,"paid_only":false},{"question_id":3021,"title":"Alice 和 Bob 玩鲜花游戏","title_slug":"alice-and-bob-playing-flower-game","rating":1581.4162718925,"_hash":1094471227,"paid_only":false},{"question_id":3022,"title":"给定操作次数内使剩余元素的或值最小","title_slug":"minimize-or-of-remaining-elements-using-operations","rating":2917.8273567322,"_hash":3532176892,"paid_only":false}],"company":{}},{"contest":{"id":982,"title":"第 381 场周赛","title_slug":"weekly-contest-381","start_time":1705804200,"is_ee_exam_contest":null},"questions":[{"question_id":3014,"title":"输入单词需要的最少按键次数 I","title_slug":"minimum-number-of-pushes-to-type-word-i","rating":1324.2140587436,"_hash":3012401904,"paid_only":false},{"question_id":3015,"title":"按距离统计房屋对数目 I","title_slug":"count-the-number-of-houses-at-a-certain-distance-i","rating":1657.5344546445,"_hash":1097720535,"paid_only":false},{"question_id":3016,"title":"输入单词需要的最少按键次数 II","title_slug":"minimum-number-of-pushes-to-type-word-ii","rating":1533.5722750742,"_hash":1089101531,"paid_only":false},{"question_id":3017,"title":"按距离统计房屋对数目 II","title_slug":"count-the-number-of-houses-at-a-certain-distance-ii","rating":2709.4067070911,"_hash":3187405082,"paid_only":false}],"company":{}},{"contest":{"id":979,"title":"第 122 场双周赛","title_slug":"biweekly-contest-122","start_time":1705761000,"is_ee_exam_contest":null},"questions":[{"question_id":3010,"title":"将数组分成最小总代价的子数组 I","title_slug":"divide-an-array-into-subarrays-with-minimum-cost-i","rating":1291.744935731,"_hash":1471696394,"paid_only":false},{"question_id":3011,"title":"判断一个数组是否可以变为有序","title_slug":"find-if-array-can-be-sorted","rating":1496.6441112156,"_hash":1890921841,"paid_only":false},{"question_id":3012,"title":"通过操作使数组长度最小","title_slug":"minimize-length-of-array-using-operations","rating":1832.7167755024,"_hash":1466738944,"paid_only":false},{"question_id":3013,"title":"将数组分成最小总代价的子数组 II","title_slug":"divide-an-array-into-subarrays-with-minimum-cost-ii","rating":2540.438150736,"_hash":2049140185,"paid_only":false}],"company":{}},{"contest":{"id":980,"title":"第 380 场周赛","title_slug":"weekly-contest-380","start_time":1705199400,"is_ee_exam_contest":null},"questions":[{"question_id":3005,"title":"最大频率元素计数","title_slug":"count-elements-with-maximum-frequency","rating":1216.9550221615,"_hash":2937149161,"paid_only":false},{"question_id":3006,"title":"找出数组中的美丽下标 I","title_slug":"find-beautiful-indices-in-the-given-array-i","rating":1480.1120711991,"_hash":3437839264,"paid_only":false},{"question_id":3007,"title":"价值和小于等于 K 的最大数字","title_slug":"maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k","rating":2258.0069047781,"_hash":1708402068,"paid_only":false},{"question_id":3008,"title":"找出数组中的美丽下标 II","title_slug":"find-beautiful-indices-in-the-given-array-ii","rating":2016.2085876254,"_hash":1547023723,"paid_only":false}],"company":{}},{"contest":{"id":976,"title":"第 379 场周赛","title_slug":"weekly-contest-379","start_time":1704594600,"is_ee_exam_contest":null},"questions":[{"question_id":3000,"title":"对角线最长的矩形的面积","title_slug":"maximum-area-of-longest-diagonal-rectangle","rating":1249.7770522505,"_hash":1069078430,"paid_only":false},{"question_id":3001,"title":"捕获黑皇后需要的最少移动次数","title_slug":"minimum-moves-to-capture-the-queen","rating":1796.5392133092,"_hash":4169935304,"paid_only":false},{"question_id":3002,"title":"移除后集合的最多元素数","title_slug":"maximum-size-of-a-set-after-removals","rating":1917.4314822412,"_hash":3228686257,"paid_only":false},{"question_id":3003,"title":"执行操作后的最大分割数量","title_slug":"maximize-the-number-of-partitions-after-operations","rating":3039.3003256659,"_hash":834197249,"paid_only":false}],"company":{}},{"contest":{"id":973,"title":"第 121 场双周赛","title_slug":"biweekly-contest-121","start_time":1704551400,"is_ee_exam_contest":null},"questions":[{"question_id":2996,"title":"大于等于顺序前缀和的最小缺失整数","title_slug":"smallest-missing-integer-greater-than-sequential-prefix-sum","rating":1405.7482709086,"_hash":2694109670,"paid_only":false},{"question_id":2997,"title":"使数组异或和等于 K 的最少操作次数","title_slug":"minimum-number-of-operations-to-make-array-xor-equal-to-k","rating":1524.5856276651,"_hash":1320293684,"paid_only":false},{"question_id":2998,"title":"使 X 和 Y 相等的最少操作次数","title_slug":"minimum-number-of-operations-to-make-x-and-y-equal","rating":1794.6129370985,"_hash":3024031273,"paid_only":false},{"question_id":2999,"title":"统计强大整数的数目","title_slug":"count-the-number-of-powerful-integers","rating":2351.2293628792,"_hash":677909483,"paid_only":false}],"company":{}},{"contest":{"id":974,"title":"第 378 场周赛","title_slug":"weekly-contest-378","start_time":1703989800,"is_ee_exam_contest":null},"questions":[{"question_id":2980,"title":"检查按位或是否存在尾随零","title_slug":"check-if-bitwise-or-has-trailing-zeros","rating":1233.5034839998,"_hash":2184297331,"paid_only":false},{"question_id":2981,"title":"找出出现至少三次的最长特殊子字符串 I","title_slug":"find-longest-special-substring-that-occurs-thrice-i","rating":1505.3120825678,"_hash":1645223251,"paid_only":false},{"question_id":2982,"title":"找出出现至少三次的最长特殊子字符串 II","title_slug":"find-longest-special-substring-that-occurs-thrice-ii","rating":1772.9528456848,"_hash":2573075022,"paid_only":false},{"question_id":2983,"title":"回文串重新排列查询","title_slug":"palindrome-rearrangement-queries","rating":2779.7855167601,"_hash":4244339093,"paid_only":false}],"company":{}},{"contest":{"id":970,"title":"第 377 场周赛","title_slug":"weekly-contest-377","start_time":1703385000,"is_ee_exam_contest":null},"questions":[{"question_id":2974,"title":"最小数字游戏","title_slug":"minimum-number-game","rating":1184.8359383057,"_hash":760662992,"paid_only":false},{"question_id":2975,"title":"移除栅栏得到的正方形田地的最大面积","title_slug":"maximum-square-area-by-removing-fences-from-a-field","rating":1873.0424923433,"_hash":3065742618,"paid_only":false},{"question_id":2976,"title":"转换字符串的最小成本 I","title_slug":"minimum-cost-to-convert-string-i","rating":1882.0842446557,"_hash":2860849459,"paid_only":false},{"question_id":2977,"title":"转换字符串的最小成本 II","title_slug":"minimum-cost-to-convert-string-ii","rating":2695.809667046,"_hash":3381061806,"paid_only":false}],"company":{}},{"contest":{"id":967,"title":"第 120 场双周赛","title_slug":"biweekly-contest-120","start_time":1703341800,"is_ee_exam_contest":null},"questions":[{"question_id":2970,"title":"统计移除递增子数组的数目 I","title_slug":"count-the-number-of-incremovable-subarrays-i","rating":1563.2283814548,"_hash":1816814719,"paid_only":false},{"question_id":2971,"title":"找到最大周长的多边形","title_slug":"find-polygon-with-the-largest-perimeter","rating":1521.1616133347,"_hash":2510517613,"paid_only":false},{"question_id":2972,"title":"统计移除递增子数组的数目 II","title_slug":"count-the-number-of-incremovable-subarrays-ii","rating":2152.8032001597,"_hash":2400947874,"paid_only":false},{"question_id":2973,"title":"树中每个节点放置的金币数目","title_slug":"find-number-of-coins-to-place-in-tree-nodes","rating":2276.9256951751,"_hash":3730047096,"paid_only":false}],"company":{}},{"contest":{"id":968,"title":"第 376 场周赛","title_slug":"weekly-contest-376","start_time":1702780200,"is_ee_exam_contest":null},"questions":[{"question_id":2965,"title":"找出缺失和重复的数字","title_slug":"find-missing-and-repeated-values","rating":1244.8064626533,"_hash":2875235685,"paid_only":false},{"question_id":2966,"title":"划分数组并满足最大差限制","title_slug":"divide-array-into-arrays-with-max-difference","rating":1395.9639246414,"_hash":2398941022,"paid_only":false},{"question_id":2967,"title":"使数组成为等数数组的最小代价","title_slug":"minimum-cost-to-make-array-equalindromic","rating":2116.3244842355,"_hash":3256507952,"paid_only":false},{"question_id":2968,"title":"执行操作使频率分数最大","title_slug":"apply-operations-to-maximize-frequency-score","rating":2444.2791027022,"_hash":1059279895,"paid_only":false}],"company":{}},{"contest":{"id":964,"title":"第 375 场周赛","title_slug":"weekly-contest-375","start_time":1702175400,"is_ee_exam_contest":null},"questions":[{"question_id":2960,"title":"统计已测试设备","title_slug":"count-tested-devices-after-test-operations","rating":1169.4209117977,"_hash":2595697191,"paid_only":false},{"question_id":2961,"title":"双模幂运算","title_slug":"double-modular-exponentiation","rating":1450.6986543984,"_hash":1122946813,"paid_only":false},{"question_id":2962,"title":"统计最大元素出现至少 K 次的子数组","title_slug":"count-subarrays-where-max-element-appears-at-least-k-times","rating":1700.8505554268,"_hash":1658221095,"paid_only":false},{"question_id":2963,"title":"统计好分割方案的数目","title_slug":"count-the-number-of-good-partitions","rating":1984.9685663849,"_hash":3740959852,"paid_only":false}],"company":{}},{"contest":{"id":961,"title":"第 119 场双周赛","title_slug":"biweekly-contest-119","start_time":1702132200,"is_ee_exam_contest":null},"questions":[{"question_id":2956,"title":"找到两个数组中的公共元素","title_slug":"find-common-elements-between-two-arrays","rating":1214.542864891,"_hash":1894806233,"paid_only":false},{"question_id":2957,"title":"消除相邻近似相等字符","title_slug":"remove-adjacent-almost-equal-characters","rating":1429.9599761889,"_hash":2774491833,"paid_only":false},{"question_id":2958,"title":"最多 K 个重复元素的最长子数组","title_slug":"length-of-longest-subarray-with-at-most-k-frequency","rating":1535.3680469616,"_hash":614687136,"paid_only":false},{"question_id":2959,"title":"关闭分部的可行集合数目","title_slug":"number-of-possible-sets-of-closing-branches","rating":2077.4738459704,"_hash":796165027,"paid_only":false}],"company":{}},{"contest":{"id":962,"title":"第 374 场周赛","title_slug":"weekly-contest-374","start_time":1701570600,"is_ee_exam_contest":null},"questions":[{"question_id":2951,"title":"找出峰值","title_slug":"find-the-peaks","rating":1189.4358388136,"_hash":518714509,"paid_only":false},{"question_id":2952,"title":"需要添加的硬币的最小数量","title_slug":"minimum-number-of-coins-to-be-added","rating":1784.3506628869,"_hash":1965849899,"paid_only":false},{"question_id":2953,"title":"统计完全子字符串","title_slug":"count-complete-substrings","rating":2449.3352959316,"_hash":3462463455,"paid_only":false},{"question_id":2954,"title":"统计感冒序列的数目","title_slug":"count-the-number-of-infection-sequences","rating":2644.8498152558,"_hash":3519471521,"paid_only":false}],"company":{}},{"contest":{"id":958,"title":"第 373 场周赛","title_slug":"weekly-contest-373","start_time":1700965800,"is_ee_exam_contest":null},"questions":[{"question_id":2946,"title":"循环移位后的矩阵相似检查","title_slug":"matrix-similarity-after-cyclic-shifts","rating":1405.8442434352,"_hash":2937224937,"paid_only":false},{"question_id":2947,"title":"统计美丽子字符串 I","title_slug":"count-beautiful-substrings-i","rating":1450.8514438667,"_hash":1299365979,"paid_only":false},{"question_id":2948,"title":"交换得到字典序最小的数组","title_slug":"make-lexicographically-smallest-array-by-swapping-elements","rating":2047.3919190727,"_hash":4034022024,"paid_only":false},{"question_id":2949,"title":"统计美丽子字符串 II","title_slug":"count-beautiful-substrings-ii","rating":2444.7192647604,"_hash":497323702,"paid_only":false}],"company":{}},{"contest":{"id":955,"title":"第 118 场双周赛","title_slug":"biweekly-contest-118","start_time":1700922600,"is_ee_exam_contest":null},"questions":[{"question_id":2942,"title":"查找包含给定字符的单词","title_slug":"find-words-containing-character","rating":1182.2102562446,"_hash":3830794143,"paid_only":false},{"question_id":2943,"title":"最大化网格图中正方形空洞的面积","title_slug":"maximize-area-of-square-hole-in-grid","rating":1677.4559378473,"_hash":967980473,"paid_only":false},{"question_id":2944,"title":"购买水果需要的最少金币数","title_slug":"minimum-number-of-coins-for-fruits","rating":1708.9663754668,"_hash":1140950686,"paid_only":false},{"question_id":2945,"title":"找到最大非递减数组的长度","title_slug":"find-maximum-non-decreasing-array-length","rating":2943.2173551759,"_hash":1539515792,"paid_only":false}],"company":{}},{"contest":{"id":956,"title":"第 372 场周赛","title_slug":"weekly-contest-372","start_time":1700361000,"is_ee_exam_contest":null},"questions":[{"question_id":2937,"title":"使三个字符串相等","title_slug":"make-three-strings-equal","rating":1347.5885281778,"_hash":2629528696,"paid_only":false},{"question_id":2938,"title":"区分黑球与白球","title_slug":"separate-black-and-white-balls","rating":1422.7125559974,"_hash":1063658457,"paid_only":false},{"question_id":2939,"title":"最大异或乘积","title_slug":"maximum-xor-product","rating":2127.5100545681,"_hash":173367747,"paid_only":false},{"question_id":2940,"title":"找到 Alice 和 Bob 可以相遇的建筑","title_slug":"find-building-where-alice-and-bob-can-meet","rating":2327.4743300299,"_hash":2297518953,"paid_only":false}],"company":{}},{"contest":{"id":952,"title":"第 371 场周赛","title_slug":"weekly-contest-371","start_time":1699756200,"is_ee_exam_contest":null},"questions":[{"question_id":2932,"title":"找出强数对的最大异或值 I","title_slug":"maximum-strong-pair-xor-i","rating":1246.3593898992,"_hash":3074518984,"paid_only":false},{"question_id":2933,"title":"高访问员工","title_slug":"high-access-employees","rating":1536.5893223179,"_hash":3211790430,"paid_only":false},{"question_id":2934,"title":"最大化数组末位元素的最少操作次数","title_slug":"minimum-operations-to-maximize-last-elements-in-arrays","rating":1802.7875657754,"_hash":3398027261,"paid_only":false},{"question_id":2935,"title":"找出强数对的最大异或值 II","title_slug":"maximum-strong-pair-xor-ii","rating":2348.7273357105,"_hash":486718067,"paid_only":false}],"company":{}},{"contest":{"id":949,"title":"第 117 场双周赛","title_slug":"biweekly-contest-117","start_time":1699713000,"is_ee_exam_contest":null},"questions":[{"question_id":2928,"title":"给小朋友们分糖果 I","title_slug":"distribute-candies-among-children-i","rating":1393.3604603199,"_hash":4137220667,"paid_only":false},{"question_id":2929,"title":"给小朋友们分糖果 II","title_slug":"distribute-candies-among-children-ii","rating":1701.4341867571,"_hash":2228358934,"paid_only":false},{"question_id":2930,"title":"重新排列后包含指定子字符串的字符串数目","title_slug":"number-of-strings-which-can-be-rearranged-to-contain-substring","rating":2227.3896051956,"_hash":3536253643,"paid_only":false},{"question_id":2931,"title":"购买物品的最大开销","title_slug":"maximum-spending-after-buying-items","rating":1822.3170524016,"_hash":268471907,"paid_only":false}],"company":{}},{"contest":{"id":950,"title":"第 370 场周赛","title_slug":"weekly-contest-370","start_time":1699151400,"is_ee_exam_contest":null},"questions":[{"question_id":2923,"title":"找到冠军 I","title_slug":"find-champion-i","rating":1235.6484230513,"_hash":3876397144,"paid_only":false},{"question_id":2924,"title":"找到冠军 II","title_slug":"find-champion-ii","rating":1430.3094955812,"_hash":3936988451,"paid_only":false},{"question_id":2925,"title":"在树上执行操作以后得到的最大分数","title_slug":"maximum-score-after-applying-operations-on-a-tree","rating":1939.560165526,"_hash":750309798,"paid_only":false},{"question_id":2926,"title":"平衡子序列的最大和","title_slug":"maximum-balanced-subsequence-sum","rating":2448.4455464535,"_hash":2375501212,"paid_only":false}],"company":{}},{"contest":{"id":945,"title":"第 369 场周赛","title_slug":"weekly-contest-369","start_time":1698546600,"is_ee_exam_contest":null},"questions":[{"question_id":2917,"title":"找出数组中的 K-or 值","title_slug":"find-the-k-or-of-an-array","rating":1388.5363323598,"_hash":894912724,"paid_only":false},{"question_id":2918,"title":"数组的最小相等和","title_slug":"minimum-equal-sum-of-two-arrays-after-replacing-zeros","rating":1526.2429110307,"_hash":2619603225,"paid_only":false},{"question_id":2919,"title":"使数组变美的最小增量运算数","title_slug":"minimum-increment-operations-to-make-array-beautiful","rating":2030.922770301,"_hash":1420249701,"paid_only":false},{"question_id":2920,"title":"收集所有金币可获得的最大积分","title_slug":"maximum-points-after-collecting-coins-from-all-nodes","rating":2350.7421492104,"_hash":1381994519,"paid_only":false}],"company":{}},{"contest":{"id":941,"title":"第 116 场双周赛","title_slug":"biweekly-contest-116","start_time":1698503400,"is_ee_exam_contest":null},"questions":[{"question_id":2913,"title":"子数组不同元素数目的平方和 I","title_slug":"subarrays-distinct-element-sum-of-squares-i","rating":1297.4179875409,"_hash":87115414,"paid_only":false},{"question_id":2914,"title":"使二进制字符串变美丽的最少修改次数","title_slug":"minimum-number-of-changes-to-make-binary-string-beautiful","rating":1479.6908339113,"_hash":1033555490,"paid_only":false},{"question_id":2915,"title":"和为目标值的最长子序列的长度","title_slug":"length-of-the-longest-subsequence-that-sums-to-target","rating":1658.8190087768,"_hash":1032257843,"paid_only":false},{"question_id":2916,"title":"子数组不同元素数目的平方和 II","title_slug":"subarrays-distinct-element-sum-of-squares-ii","rating":2816.0706257586,"_hash":731038573,"paid_only":false}],"company":{}},{"contest":{"id":942,"title":"第 368 场周赛","title_slug":"weekly-contest-368","start_time":1697941800,"is_ee_exam_contest":null},"questions":[{"question_id":2908,"title":"元素和最小的山形三元组 I","title_slug":"minimum-sum-of-mountain-triplets-i","rating":1253.5161450678,"_hash":1377831845,"paid_only":false},{"question_id":2909,"title":"元素和最小的山形三元组 II","title_slug":"minimum-sum-of-mountain-triplets-ii","rating":1478.8676835951,"_hash":343052836,"paid_only":false},{"question_id":2910,"title":"合法分组的最少组数","title_slug":"minimum-number-of-groups-to-create-a-valid-assignment","rating":2132.1944636902,"_hash":1620549524,"paid_only":false},{"question_id":2911,"title":"得到 K 个半回文串的最少修改次数","title_slug":"minimum-changes-to-make-k-semi-palindromes","rating":2607.9418744903,"_hash":2481240580,"paid_only":false}],"company":{}},{"contest":{"id":938,"title":"第 367 场周赛","title_slug":"weekly-contest-367","start_time":1697337000,"is_ee_exam_contest":null},"questions":[{"question_id":2903,"title":"找出满足差值条件的下标 I","title_slug":"find-indices-with-index-and-value-difference-i","rating":1157.6407631819,"_hash":1982730574,"paid_only":false},{"question_id":2904,"title":"最短且字典序最小的美丽子字符串","title_slug":"shortest-and-lexicographically-smallest-beautiful-string","rating":1483.3041242255,"_hash":2613979956,"paid_only":false},{"question_id":2905,"title":"找出满足差值条件的下标 II","title_slug":"find-indices-with-index-and-value-difference-ii","rating":1763.787679959,"_hash":830799973,"paid_only":false},{"question_id":2906,"title":"构造乘积矩阵","title_slug":"construct-product-matrix","rating":2074.8331146269,"_hash":4290150798,"paid_only":false}],"company":{}},{"contest":{"id":935,"title":"第 115 场双周赛","title_slug":"biweekly-contest-115","start_time":1697293800,"is_ee_exam_contest":null},"questions":[{"question_id":2899,"title":"上一个遍历的整数","title_slug":"last-visited-integers","rating":1372.4759842416,"_hash":3735818622,"paid_only":false},{"question_id":2900,"title":"最长相邻不相等子序列 I","title_slug":"longest-unequal-adjacent-groups-subsequence-i","rating":1468.8739273624,"_hash":3312226061,"paid_only":false},{"question_id":2901,"title":"最长相邻不相等子序列 II","title_slug":"longest-unequal-adjacent-groups-subsequence-ii","rating":1898.8339532179,"_hash":770030188,"paid_only":false},{"question_id":2902,"title":"和带限制的子多重集合的数目","title_slug":"count-of-sub-multisets-with-bounded-sum","rating":2758.9704056427,"_hash":2720318685,"paid_only":false}],"company":{}},{"contest":{"id":936,"title":"第 366 场周赛","title_slug":"weekly-contest-366","start_time":1696732200,"is_ee_exam_contest":null},"questions":[{"question_id":2894,"title":"分类求和并作差","title_slug":"divisible-and-non-divisible-sums-difference","rating":1140.0534541481,"_hash":1782593021,"paid_only":false},{"question_id":2895,"title":"最小处理时间","title_slug":"minimum-processing-time","rating":1351.6909336495,"_hash":2835500769,"paid_only":false},{"question_id":2896,"title":"执行操作使两个字符串相等","title_slug":"apply-operations-to-make-two-strings-equal","rating":2172.3890687963,"_hash":1915472102,"paid_only":false},{"question_id":2897,"title":"对数组执行操作使平方和最大","title_slug":"apply-operations-on-array-to-maximize-sum-of-squares","rating":2301.4069974024,"_hash":1644032538,"paid_only":false}],"company":{}},{"contest":{"id":932,"title":"第 365 场周赛","title_slug":"weekly-contest-365","start_time":1696127400,"is_ee_exam_contest":null},"questions":[{"question_id":2873,"title":"有序三元组中的最大值 I","title_slug":"maximum-value-of-an-ordered-triplet-i","rating":1270.0775640451,"_hash":2386809488,"paid_only":false},{"question_id":2874,"title":"有序三元组中的最大值 II","title_slug":"maximum-value-of-an-ordered-triplet-ii","rating":1583.212966224,"_hash":3989118459,"paid_only":false},{"question_id":2875,"title":"无限数组的最短子数组","title_slug":"minimum-size-subarray-in-infinite-array","rating":1913.930869473,"_hash":3124896474,"paid_only":false},{"question_id":2876,"title":"有向图访问计数","title_slug":"count-visited-nodes-in-a-directed-graph","rating":2209.8785430371,"_hash":385203255,"paid_only":false}],"company":{}},{"contest":{"id":929,"title":"第 114 场双周赛","title_slug":"biweekly-contest-114","start_time":1696084200,"is_ee_exam_contest":null},"questions":[{"question_id":2869,"title":"收集元素的最少操作次数","title_slug":"minimum-operations-to-collect-elements","rating":1272.3340330895,"_hash":615729621,"paid_only":false},{"question_id":2870,"title":"使数组为空的最少操作次数","title_slug":"minimum-number-of-operations-to-make-array-empty","rating":1392.3629194433,"_hash":2657502607,"paid_only":false},{"question_id":2871,"title":"将数组分割成最多数目的子数组","title_slug":"split-array-into-maximum-number-of-subarrays","rating":1749.5115037045,"_hash":1204439806,"paid_only":false},{"question_id":2872,"title":"可以被 K 整除连通块的最大数目","title_slug":"maximum-number-of-k-divisible-components","rating":1967.5589835406,"_hash":1584359446,"paid_only":false}],"company":{}},{"contest":{"id":930,"title":"第 364 场周赛","title_slug":"weekly-contest-364","start_time":1695522600,"is_ee_exam_contest":null},"questions":[{"question_id":2864,"title":"最大二进制奇数","title_slug":"maximum-odd-binary-number","rating":1237.693464609,"_hash":3521652117,"paid_only":false},{"question_id":2865,"title":"美丽塔 I","title_slug":"beautiful-towers-i","rating":1519.2070276362,"_hash":19753391,"paid_only":false},{"question_id":2866,"title":"美丽塔 II","title_slug":"beautiful-towers-ii","rating":2071.6322841217,"_hash":2692580018,"paid_only":false},{"question_id":2867,"title":"统计树中的合法路径数目","title_slug":"count-valid-paths-in-a-tree","rating":2428.3242593838,"_hash":3532863467,"paid_only":false}],"company":{}},{"contest":{"id":926,"title":"第 363 场周赛","title_slug":"weekly-contest-363","start_time":1694917800,"is_ee_exam_contest":null},"questions":[{"question_id":2859,"title":"计算 K 置位下标对应元素的和","title_slug":"sum-of-values-at-indices-with-k-set-bits","rating":1218.1083231462,"_hash":787489678,"paid_only":false},{"question_id":2860,"title":"让所有学生保持开心的分组方法数","title_slug":"happy-students","rating":1625.7172632295,"_hash":3713605524,"paid_only":false},{"question_id":2861,"title":"最大合金数","title_slug":"maximum-number-of-alloys","rating":1981.3072959787,"_hash":1197966112,"paid_only":false},{"question_id":2862,"title":"完全子集的最大元素和","title_slug":"maximum-element-sum-of-a-complete-subset-of-indices","rating":2291.6794536377,"_hash":1459395051,"paid_only":false}],"company":{}},{"contest":{"id":923,"title":"第 113 场双周赛","title_slug":"biweekly-contest-113","start_time":1694874600,"is_ee_exam_contest":null},"questions":[{"question_id":2855,"title":"使数组成为递增数组的最少右移次数","title_slug":"minimum-right-shifts-to-sort-the-array","rating":1379.3426970242,"_hash":3501115477,"paid_only":false},{"question_id":2856,"title":"删除数对后的最小数组长度","title_slug":"minimum-array-length-after-pair-removals","rating":1749.9743684275,"_hash":1304985926,"paid_only":false},{"question_id":2857,"title":"统计距离为 k 的点对","title_slug":"count-pairs-of-points-with-distance-k","rating":2081.698529877,"_hash":1047256075,"paid_only":false},{"question_id":2858,"title":"可以到达每一个节点的最少边反转次数","title_slug":"minimum-edge-reversals-so-every-node-is-reachable","rating":2294.8289305714,"_hash":2851269000,"paid_only":false}],"company":{}},{"contest":{"id":924,"title":"第 362 场周赛","title_slug":"weekly-contest-362","start_time":1694313000,"is_ee_exam_contest":null},"questions":[{"question_id":2848,"title":"与车相交的点","title_slug":"points-that-intersect-with-cars","rating":1229.7575626899,"_hash":1241705093,"paid_only":false},{"question_id":2849,"title":"判断能否在给定时间到达单元格","title_slug":"determine-if-a-cell-is-reachable-at-a-given-time","rating":1515.1162664342,"_hash":3371445858,"paid_only":false},{"question_id":2850,"title":"将石头分散到网格图的最少移动次数","title_slug":"minimum-moves-to-spread-stones-over-grid","rating":2001.4515854273,"_hash":3939185799,"paid_only":false},{"question_id":2851,"title":"字符串转换","title_slug":"string-transformation","rating":2857.6543956169,"_hash":2130827066,"paid_only":false}],"company":{}},{"contest":{"id":920,"title":"第 361 场周赛","title_slug":"weekly-contest-361","start_time":1693708200,"is_ee_exam_contest":null},"questions":[{"question_id":2843,"title":"统计对称整数的数目","title_slug":"count-symmetric-integers","rating":1269.8118442786,"_hash":2681170798,"paid_only":false},{"question_id":2844,"title":"生成特殊数字的最少操作","title_slug":"minimum-operations-to-make-a-special-number","rating":1588.4826339516,"_hash":492673087,"paid_only":false},{"question_id":2845,"title":"统计趣味子数组的数目","title_slug":"count-of-interesting-subarrays","rating":2073.048019317,"_hash":3334241084,"paid_only":false},{"question_id":2846,"title":"边权重均等查询","title_slug":"minimum-edge-weight-equilibrium-queries-in-a-tree","rating":2507.9960044659,"_hash":2672352527,"paid_only":false}],"company":{}},{"contest":{"id":917,"title":"第 112 场双周赛","title_slug":"biweekly-contest-112","start_time":1693665000,"is_ee_exam_contest":null},"questions":[{"question_id":2839,"title":"判断通过操作能否让字符串相等 I","title_slug":"check-if-strings-can-be-made-equal-with-operations-i","rating":1285.1547123119,"_hash":1303459038,"paid_only":false},{"question_id":2840,"title":"判断通过操作能否让字符串相等 II","title_slug":"check-if-strings-can-be-made-equal-with-operations-ii","rating":1486.2147876747,"_hash":83229717,"paid_only":false},{"question_id":2841,"title":"几乎唯一子数组的最大和","title_slug":"maximum-sum-of-almost-unique-subarray","rating":1545.9654593951,"_hash":1879020884,"paid_only":false},{"question_id":2842,"title":"统计一个字符串的 k 子序列美丽值最大的数目","title_slug":"count-k-subsequences-of-a-string-with-maximum-beauty","rating":2091.6580433632,"_hash":1559330514,"paid_only":false}],"company":{}},{"contest":{"id":918,"title":"第 360 场周赛","title_slug":"weekly-contest-360","start_time":1693103400,"is_ee_exam_contest":null},"questions":[{"question_id":2833,"title":"距离原点最远的点","title_slug":"furthest-point-from-origin","rating":1294.2819324126,"_hash":1908656857,"paid_only":false},{"question_id":2834,"title":"找出美丽数组的最小和","title_slug":"find-the-minimum-possible-sum-of-a-beautiful-array","rating":1409.2288385791,"_hash":4261327361,"paid_only":false},{"question_id":2835,"title":"使子序列的和等于目标的最少操作次数","title_slug":"minimum-operations-to-form-subsequence-with-target-sum","rating":2207.4917475411,"_hash":94359620,"paid_only":false},{"question_id":2836,"title":"在传球游戏中最大化函数值","title_slug":"maximize-value-of-function-in-a-ball-passing-game","rating":2768.8154223451,"_hash":1915862517,"paid_only":false}],"company":{}},{"contest":{"id":913,"title":"第 359 场周赛","title_slug":"weekly-contest-359","start_time":1692498600,"is_ee_exam_contest":null},"questions":[{"question_id":2828,"title":"判别首字母缩略词","title_slug":"check-if-a-string-is-an-acronym-of-words","rating":1151.9713084499,"_hash":658738156,"paid_only":false},{"question_id":2829,"title":"k-avoiding 数组的最小总和","title_slug":"determine-the-minimum-sum-of-a-k-avoiding-array","rating":1347.2146542772,"_hash":1173419903,"paid_only":false},{"question_id":2830,"title":"销售利润最大化","title_slug":"maximize-the-profit-as-the-salesman","rating":1851.2677996923,"_hash":3503134762,"paid_only":false},{"question_id":2831,"title":"找出最长等值子数组","title_slug":"find-the-longest-equal-subarray","rating":1975.9693382075,"_hash":869865446,"paid_only":false}],"company":{}},{"contest":{"id":909,"title":"第 111 场双周赛","title_slug":"biweekly-contest-111","start_time":1692455400,"is_ee_exam_contest":null},"questions":[{"question_id":2824,"title":"统计和小于目标的下标对数目","title_slug":"count-pairs-whose-sum-is-less-than-target","rating":1165.8838207286,"_hash":77582966,"paid_only":false},{"question_id":2825,"title":"循环增长使字符串子序列等于另一个字符串","title_slug":"make-string-a-subsequence-using-cyclic-increments","rating":1414.6100987673,"_hash":1449546891,"paid_only":false},{"question_id":2826,"title":"将三个组排序","title_slug":"sorting-three-groups","rating":1721.1964988483,"_hash":268097121,"paid_only":false},{"question_id":2827,"title":"范围中美丽整数的数目","title_slug":"number-of-beautiful-integers-in-the-range","rating":2324.1192580053,"_hash":219694070,"paid_only":false}],"company":{}},{"contest":{"id":910,"title":"第 358 场周赛","title_slug":"weekly-contest-358","start_time":1691893800,"is_ee_exam_contest":null},"questions":[{"question_id":2815,"title":"数组中的最大数对和","title_slug":"max-pair-sum-in-an-array","rating":1295.0947625986,"_hash":3182582646,"paid_only":false},{"question_id":2816,"title":"翻倍以链表形式表示的数字","title_slug":"double-a-number-represented-as-a-linked-list","rating":1393.7857353048,"_hash":1168558024,"paid_only":false},{"question_id":2817,"title":"限制条件下元素之间的最小绝对差","title_slug":"minimum-absolute-difference-between-elements-with-constraint","rating":1889.4554322242,"_hash":2701115423,"paid_only":false},{"question_id":2818,"title":"操作使得分最大","title_slug":"apply-operations-to-maximize-score","rating":2396.6770372863,"_hash":2573211912,"paid_only":false}],"company":{}},{"contest":{"id":906,"title":"第 357 场周赛","title_slug":"weekly-contest-357","start_time":1691289000,"is_ee_exam_contest":null},"questions":[{"question_id":2810,"title":"故障键盘","title_slug":"faulty-keyboard","rating":1192.9770230345,"_hash":3177194252,"paid_only":false},{"question_id":2811,"title":"判断是否能拆分数组","title_slug":"check-if-it-is-possible-to-split-array","rating":1543.1204810684,"_hash":335140403,"paid_only":false},{"question_id":2812,"title":"找出最安全路径","title_slug":"find-the-safest-path-in-a-grid","rating":2153.5854429139,"_hash":999091554,"paid_only":false},{"question_id":2813,"title":"子序列最大优雅度","title_slug":"maximum-elegance-of-a-k-length-subsequence","rating":2582.0814855506,"_hash":462875391,"paid_only":false}],"company":{}},{"contest":{"id":903,"title":"第 110 场双周赛","title_slug":"biweekly-contest-110","start_time":1691245800,"is_ee_exam_contest":null},"questions":[{"question_id":2806,"title":"取整购买后的账户余额","title_slug":"account-balance-after-rounded-purchase","rating":1214.703724776,"_hash":2948030094,"paid_only":false},{"question_id":2807,"title":"在链表中插入最大公约数","title_slug":"insert-greatest-common-divisors-in-linked-list","rating":1279.0301521682,"_hash":4225876243,"paid_only":false},{"question_id":2808,"title":"使循环数组所有元素相等的最少秒数","title_slug":"minimum-seconds-to-equalize-a-circular-array","rating":1875.4217845362,"_hash":236837608,"paid_only":false},{"question_id":2809,"title":"使数组和小于等于 x 的最少时间","title_slug":"minimum-time-to-make-array-sum-at-most-x","rating":2978.7961959355,"_hash":224100421,"paid_only":false}],"company":{}},{"contest":{"id":904,"title":"第 356 场周赛","title_slug":"weekly-contest-356","start_time":1690684200,"is_ee_exam_contest":null},"questions":[{"question_id":2798,"title":"满足目标工作时长的员工数目","title_slug":"number-of-employees-who-met-the-target","rating":1142.0341823205,"_hash":3735817636,"paid_only":false},{"question_id":2799,"title":"统计完全子数组的数目","title_slug":"count-complete-subarrays-in-an-array","rating":1397.9519549403,"_hash":1784527717,"paid_only":false},{"question_id":2800,"title":"包含三个字符串的最短字符串","title_slug":"shortest-string-that-contains-three-strings","rating":1855.561153694,"_hash":2827089777,"paid_only":false},{"question_id":2801,"title":"统计范围内的步进数字数目","title_slug":"count-stepping-numbers-in-range","rating":2367.4705934718,"_hash":3369476122,"paid_only":false}],"company":{}},{"contest":{"id":900,"title":"第 355 场周赛","title_slug":"weekly-contest-355","start_time":1690079400,"is_ee_exam_contest":null},"questions":[{"question_id":2788,"title":"按分隔符拆分字符串","title_slug":"split-strings-by-separator","rating":1239.1621762681,"_hash":436025572,"paid_only":false},{"question_id":2789,"title":"合并后数组中的最大元素","title_slug":"largest-element-in-an-array-after-merge-operations","rating":1484.8385256564,"_hash":4141047313,"paid_only":false},{"question_id":2790,"title":"长度递增组的最大数目","title_slug":"maximum-number-of-groups-with-increasing-length","rating":2619.7016189999,"_hash":2676463244,"paid_only":false},{"question_id":2791,"title":"树中可以形成回文的路径数","title_slug":"count-paths-that-can-form-a-palindrome-in-a-tree","rating":2677.1682592316,"_hash":3909203570,"paid_only":false}],"company":{}},{"contest":{"id":897,"title":"第 109 场双周赛","title_slug":"biweekly-contest-109","start_time":1690036200,"is_ee_exam_contest":null},"questions":[{"question_id":2784,"title":"检查数组是否是好的","title_slug":"check-if-array-is-good","rating":1376.2376633804,"_hash":4062228386,"paid_only":false},{"question_id":2785,"title":"将字符串中的元音字母排序","title_slug":"sort-vowels-in-a-string","rating":1266.5014127879,"_hash":1174559962,"paid_only":false},{"question_id":2786,"title":"访问数组中的位置使分数最大","title_slug":"visit-array-positions-to-maximize-score","rating":1732.5146472785,"_hash":3694289041,"paid_only":false},{"question_id":2787,"title":"将一个数字表示成幂的和的方案数","title_slug":"ways-to-express-an-integer-as-sum-of-powers","rating":1817.5282352022,"_hash":2671757819,"paid_only":false}],"company":{}},{"contest":{"id":898,"title":"第 354 场周赛","title_slug":"weekly-contest-354","start_time":1689474600,"is_ee_exam_contest":null},"questions":[{"question_id":2778,"title":"特殊元素平方和","title_slug":"sum-of-squares-of-special-elements","rating":1151.9363042898,"_hash":14750873,"paid_only":false},{"question_id":2779,"title":"数组的最大美丽值","title_slug":"maximum-beauty-of-an-array-after-applying-operation","rating":1638.4147703093,"_hash":1463471392,"paid_only":false},{"question_id":2780,"title":"合法分割的最小下标","title_slug":"minimum-index-of-a-valid-split","rating":1549.9747683007,"_hash":228115268,"paid_only":false},{"question_id":2781,"title":"最长合法子字符串的长度","title_slug":"length-of-the-longest-valid-substring","rating":2203.5694828019,"_hash":2265344721,"paid_only":false}],"company":{}},{"contest":{"id":894,"title":"第 353 场周赛","title_slug":"weekly-contest-353","start_time":1688869800,"is_ee_exam_contest":null},"questions":[{"question_id":2769,"title":"找出最大的可达成数字","title_slug":"find-the-maximum-achievable-number","rating":1191.3681720998,"_hash":2491402608,"paid_only":false},{"question_id":2770,"title":"达到末尾下标所需的最大跳跃次数","title_slug":"maximum-number-of-jumps-to-reach-the-last-index","rating":1533.47383662,"_hash":4000844273,"paid_only":false},{"question_id":2771,"title":"构造最长非递减子数组","title_slug":"longest-non-decreasing-subarray-from-two-arrays","rating":1791.5102962397,"_hash":3729777530,"paid_only":false},{"question_id":2772,"title":"使数组中的所有元素都等于零","title_slug":"apply-operations-to-make-all-array-elements-equal-to-zero","rating":2029.4024513478,"_hash":1866851323,"paid_only":false}],"company":{}},{"contest":{"id":891,"title":"第 108 场双周赛","title_slug":"biweekly-contest-108","start_time":1688826600,"is_ee_exam_contest":null},"questions":[{"question_id":2765,"title":"最长交替子数组","title_slug":"longest-alternating-subarray","rating":1580.9748095835,"_hash":4130986647,"paid_only":false},{"question_id":2766,"title":"重新放置石块","title_slug":"relocate-marbles","rating":1613.2485081262,"_hash":2818493377,"paid_only":false},{"question_id":2767,"title":"将字符串分割为最少的美丽子字符串","title_slug":"partition-string-into-minimum-beautiful-substrings","rating":1864.5644306171,"_hash":4066429992,"paid_only":false},{"question_id":2768,"title":"黑格子的数目","title_slug":"number-of-black-blocks","rating":2175.7874705227,"_hash":3375593429,"paid_only":false}],"company":{}},{"contest":{"id":892,"title":"第 352 场周赛","title_slug":"weekly-contest-352","start_time":1688265000,"is_ee_exam_contest":null},"questions":[{"question_id":2760,"title":"最长奇偶子数组","title_slug":"longest-even-odd-subarray-with-threshold","rating":1420.3698647434,"_hash":2817202669,"paid_only":false},{"question_id":2761,"title":"和等于目标值的质数对","title_slug":"prime-pairs-with-target-sum","rating":1504.9263037499,"_hash":2664015237,"paid_only":false},{"question_id":2762,"title":"不间断子数组","title_slug":"continuous-subarrays","rating":1940.2116985812,"_hash":224630615,"paid_only":false},{"question_id":2763,"title":"所有子数组中不平衡数字之和","title_slug":"sum-of-imbalance-numbers-of-all-subarrays","rating":2277.7923804151,"_hash":228551495,"paid_only":false}],"company":{}},{"contest":{"id":888,"title":"第 351 场周赛","title_slug":"weekly-contest-351","start_time":1687660200,"is_ee_exam_contest":null},"questions":[{"question_id":2748,"title":"美丽下标对的数目","title_slug":"number-of-beautiful-pairs","rating":1301.1576743638,"_hash":1182547848,"paid_only":false},{"question_id":2749,"title":"得到整数零需要执行的最少操作数","title_slug":"minimum-operations-to-make-the-integer-zero","rating":2132.06233459,"_hash":2077283915,"paid_only":false},{"question_id":2750,"title":"将数组划分成若干好子数组的方式","title_slug":"ways-to-split-array-into-good-subarrays","rating":1597.5718383661,"_hash":3518502488,"paid_only":false},{"question_id":2751,"title":"机器人碰撞","title_slug":"robot-collisions","rating":2091.6474629767,"_hash":435938591,"paid_only":false}],"company":{}},{"contest":{"id":885,"title":"第 107 场双周赛","title_slug":"biweekly-contest-107","start_time":1687617000,"is_ee_exam_contest":null},"questions":[{"question_id":2744,"title":"最大字符串配对数目","title_slug":"find-maximum-number-of-string-pairs","rating":1405.8938478338,"_hash":3156996757,"paid_only":false},{"question_id":2745,"title":"构造最长的新字符串","title_slug":"construct-the-longest-new-string","rating":1607.4192947808,"_hash":4083216410,"paid_only":false},{"question_id":2746,"title":"字符串连接删减字母","title_slug":"decremental-string-concatenation","rating":2126.1931814161,"_hash":298215454,"paid_only":false},{"question_id":2747,"title":"统计没有收到请求的服务器数目","title_slug":"count-zero-request-servers","rating":2405.3375364501,"_hash":2240198172,"paid_only":false}],"company":{}},{"contest":{"id":886,"title":"第 350 场周赛","title_slug":"weekly-contest-350","start_time":1687055400,"is_ee_exam_contest":null},"questions":[{"question_id":2739,"title":"总行驶距离","title_slug":"total-distance-traveled","rating":1262.100652797,"_hash":2051273831,"paid_only":false},{"question_id":2740,"title":"找出分区值","title_slug":"find-the-value-of-the-partition","rating":1301.9276849391,"_hash":1010937559,"paid_only":false},{"question_id":2741,"title":"特别的排列","title_slug":"special-permutations","rating":2020.7095306378,"_hash":492772626,"paid_only":false},{"question_id":2742,"title":"给墙壁刷油漆","title_slug":"painting-the-walls","rating":2424.6761561972,"_hash":3563762803,"paid_only":false}],"company":{}},{"contest":{"id":882,"title":"第 349 场周赛","title_slug":"weekly-contest-349","start_time":1686450600,"is_ee_exam_contest":null},"questions":[{"question_id":2733,"title":"既不是最小值也不是最大值","title_slug":"neither-minimum-nor-maximum","rating":1147.8274860083,"_hash":981386412,"paid_only":false},{"question_id":2734,"title":"执行子串操作后的字典序最小字符串","title_slug":"lexicographically-smallest-string-after-substring-operation","rating":1405.123188264,"_hash":3092398094,"paid_only":false},{"question_id":2735,"title":"收集巧克力","title_slug":"collecting-chocolates","rating":2043.1015779104,"_hash":3216210693,"paid_only":false},{"question_id":2736,"title":"最大和查询","title_slug":"maximum-sum-queries","rating":2533.2830157959,"_hash":3697179042,"paid_only":false}],"company":{}},{"contest":{"id":879,"title":"第 106 场双周赛","title_slug":"biweekly-contest-106","start_time":1686407400,"is_ee_exam_contest":null},"questions":[{"question_id":2729,"title":"判断一个数是否迷人","title_slug":"check-if-the-number-is-fascinating","rating":1227.91037348,"_hash":3509092584,"paid_only":false},{"question_id":2730,"title":"找到最长的半重复子字符串","title_slug":"find-the-longest-semi-repetitive-substring","rating":1501.9080845668,"_hash":4064007490,"paid_only":false},{"question_id":2731,"title":"移动机器人","title_slug":"movement-of-robots","rating":1922.9521758079,"_hash":1590024460,"paid_only":false},{"question_id":2732,"title":"找到矩阵中的好子集","title_slug":"find-a-good-subset-of-the-matrix","rating":2239.7101856677,"_hash":96440277,"paid_only":false}],"company":{}},{"contest":{"id":880,"title":"第 348 场周赛","title_slug":"weekly-contest-348","start_time":1685845800,"is_ee_exam_contest":null},"questions":[{"question_id":2716,"title":"最小化字符串长度","title_slug":"minimize-string-length","rating":1242.9383307344,"_hash":2836390896,"paid_only":false},{"question_id":2717,"title":"半有序排列","title_slug":"semi-ordered-permutation","rating":1295.75504698,"_hash":1009976390,"paid_only":false},{"question_id":2718,"title":"查询后矩阵的和","title_slug":"sum-of-matrix-after-queries","rating":1768.9138093037,"_hash":3363685518,"paid_only":false},{"question_id":2719,"title":"统计整数数目","title_slug":"count-of-integers","rating":2354.5411153127,"_hash":942180030,"paid_only":false}],"company":{}},{"contest":{"id":876,"title":"第 347 场周赛","title_slug":"weekly-contest-347","start_time":1685241000,"is_ee_exam_contest":null},"questions":[{"question_id":2710,"title":"移除字符串中的尾随零","title_slug":"remove-trailing-zeros-from-a-string","rating":1164.5575871589,"_hash":2975776867,"paid_only":false},{"question_id":2711,"title":"对角线上不同值的数量差","title_slug":"difference-of-number-of-distinct-values-on-diagonals","rating":1428.7246677159,"_hash":3754993583,"paid_only":false},{"question_id":2712,"title":"使所有字符相等的最小成本","title_slug":"minimum-cost-to-make-all-characters-equal","rating":1791.0336923305,"_hash":1186731908,"paid_only":false},{"question_id":2713,"title":"矩阵中严格递增的单元格数","title_slug":"maximum-strictly-increasing-cells-in-a-matrix","rating":2387.3525635254,"_hash":521886798,"paid_only":false}],"company":{}},{"contest":{"id":873,"title":"第 105 场双周赛","title_slug":"biweekly-contest-105","start_time":1685197800,"is_ee_exam_contest":null},"questions":[{"question_id":2706,"title":"购买两块巧克力","title_slug":"buy-two-chocolates","rating":1207.7491943483,"_hash":2844316244,"paid_only":false},{"question_id":2707,"title":"字符串中的额外字符","title_slug":"extra-characters-in-a-string","rating":1735.8505509901,"_hash":1779771436,"paid_only":false},{"question_id":2708,"title":"一个小组的最大实力值","title_slug":"maximum-strength-of-a-group","rating":1502.2633100489,"_hash":3413400617,"paid_only":false},{"question_id":2709,"title":"最大公约数遍历","title_slug":"greatest-common-divisor-traversal","rating":2171.9645269732,"_hash":1482300808,"paid_only":false}],"company":{}},{"contest":{"id":874,"title":"第 346 场周赛","title_slug":"weekly-contest-346","start_time":1684636200,"is_ee_exam_contest":null},"questions":[{"question_id":2696,"title":"删除子串后的字符串最小长度","title_slug":"minimum-string-length-after-removing-substrings","rating":1282.3870247003,"_hash":4006408746,"paid_only":false},{"question_id":2697,"title":"字典序最小回文串","title_slug":"lexicographically-smallest-palindrome","rating":1303.7347742929,"_hash":3386255965,"paid_only":false},{"question_id":2698,"title":"求一个整数的惩罚数","title_slug":"find-the-punishment-number-of-an-integer","rating":1678.6245760413,"_hash":2745040429,"paid_only":false},{"question_id":2699,"title":"修改图中的边权","title_slug":"modify-graph-edge-weights","rating":2873.9745576413,"_hash":4247310156,"paid_only":false}],"company":{}},{"contest":{"id":870,"title":"第 345 场周赛","title_slug":"weekly-contest-345","start_time":1684031400,"is_ee_exam_contest":null},"questions":[{"question_id":2682,"title":"找出转圈游戏输家","title_slug":"find-the-losers-of-the-circular-game","rating":1382.6941570342,"_hash":183030256,"paid_only":false},{"question_id":2683,"title":"相邻值的按位异或","title_slug":"neighboring-bitwise-xor","rating":1517.8263048447,"_hash":78641139,"paid_only":false},{"question_id":2684,"title":"矩阵中移动的最大次数","title_slug":"maximum-number-of-moves-in-a-grid","rating":1625.9636825798,"_hash":1603806327,"paid_only":false},{"question_id":2685,"title":"统计完全连通分量的数量","title_slug":"count-the-number-of-complete-components","rating":1769.4344566771,"_hash":1502620621,"paid_only":false}],"company":{}},{"contest":{"id":866,"title":"第 104 场双周赛","title_slug":"biweekly-contest-104","start_time":1683988200,"is_ee_exam_contest":null},"questions":[{"question_id":2678,"title":"老人的数目","title_slug":"number-of-senior-citizens","rating":1198.8420836551,"_hash":881741713,"paid_only":false},{"question_id":2679,"title":"矩阵中的和","title_slug":"sum-in-a-matrix","rating":1333.0179956774,"_hash":846898736,"paid_only":false},{"question_id":2680,"title":"最大或值","title_slug":"maximum-or","rating":1912.1926699881,"_hash":1962061945,"paid_only":false},{"question_id":2681,"title":"英雄的力量","title_slug":"power-of-heroes","rating":2060.0818824378,"_hash":3969212159,"paid_only":false}],"company":{}},{"contest":{"id":867,"title":"第 344 场周赛","title_slug":"weekly-contest-344","start_time":1683426600,"is_ee_exam_contest":null},"questions":[{"question_id":2670,"title":"找出不同元素数目差数组","title_slug":"find-the-distinct-difference-array","rating":1266.5231114343,"_hash":752241853,"paid_only":false},{"question_id":2671,"title":"频率跟踪器","title_slug":"frequency-tracker","rating":1509.6237874441,"_hash":3589033912,"paid_only":false},{"question_id":2672,"title":"有相同颜色的相邻元素数目","title_slug":"number-of-adjacent-elements-with-the-same-color","rating":1705.2545641354,"_hash":1725183127,"paid_only":false},{"question_id":2673,"title":"使二叉树所有路径值相等的最小代价","title_slug":"make-costs-of-paths-equal-in-a-binary-tree","rating":1917.1049672432,"_hash":1853031865,"paid_only":false}],"company":{}},{"contest":{"id":863,"title":"第 343 场周赛","title_slug":"weekly-contest-343","start_time":1682821800,"is_ee_exam_contest":null},"questions":[{"question_id":2660,"title":"保龄球游戏的获胜者","title_slug":"determine-the-winner-of-a-bowling-game","rating":1324.1714505166,"_hash":2355716390,"paid_only":false},{"question_id":2661,"title":"找出叠涂元素","title_slug":"first-completely-painted-row-or-column","rating":1502.6623568929,"_hash":637661898,"paid_only":false},{"question_id":2662,"title":"前往目标的最小代价","title_slug":"minimum-cost-of-a-path-with-special-roads","rating":2153.8943791656,"_hash":1243440018,"paid_only":false},{"question_id":2663,"title":"字典序最小的美丽字符串","title_slug":"lexicographically-smallest-beautiful-string","rating":2415.7434855724,"_hash":178720857,"paid_only":false}],"company":{}},{"contest":{"id":859,"title":"第 103 场双周赛","title_slug":"biweekly-contest-103","start_time":1682778600,"is_ee_exam_contest":null},"questions":[{"question_id":2656,"title":"K 个元素的最大和","title_slug":"maximum-sum-with-exactly-k-elements","rating":1213.4070467355,"_hash":2193040547,"paid_only":false},{"question_id":2657,"title":"找到两个数组的前缀公共数组","title_slug":"find-the-prefix-common-array-of-two-arrays","rating":1304.1180812515,"_hash":917808097,"paid_only":false},{"question_id":2658,"title":"网格图中鱼的最大数目","title_slug":"maximum-number-of-fish-in-a-grid","rating":1489.7210915287,"_hash":2383092679,"paid_only":false},{"question_id":2659,"title":"将数组清空","title_slug":"make-array-empty","rating":2281.8816902545,"_hash":2062472427,"paid_only":false}],"company":{}},{"contest":{"id":860,"title":"第 342 场周赛","title_slug":"weekly-contest-342","start_time":1682217000,"is_ee_exam_contest":null},"questions":[{"question_id":2651,"title":"计算列车到站时间","title_slug":"calculate-delayed-arrival-time","rating":1168.6157473032,"_hash":1602330770,"paid_only":false},{"question_id":2652,"title":"倍数求和","title_slug":"sum-multiples","rating":1182.3093772964,"_hash":1017096056,"paid_only":false},{"question_id":2653,"title":"滑动子数组的美丽值","title_slug":"sliding-subarray-beauty","rating":1785.6006955353,"_hash":3971252642,"paid_only":false},{"question_id":2654,"title":"使数组所有元素变成 1 的最少操作次数","title_slug":"minimum-number-of-operations-to-make-all-array-elements-equal-to-1","rating":1928.7961204946,"_hash":2113446044,"paid_only":false}],"company":{}},{"contest":{"id":856,"title":"第 341 场周赛","title_slug":"weekly-contest-341","start_time":1681612200,"is_ee_exam_contest":null},"questions":[{"question_id":2643,"title":"一最多的行","title_slug":"row-with-maximum-ones","rating":1174.3019990918,"_hash":950521557,"paid_only":false},{"question_id":2644,"title":"找出可整除性得分最大的整数","title_slug":"find-the-maximum-divisibility-score","rating":1257.8344655358,"_hash":1766481102,"paid_only":false},{"question_id":2645,"title":"构造有效字符串的最少插入数","title_slug":"minimum-additions-to-make-valid-string","rating":1477.7669322402,"_hash":690173651,"paid_only":false},{"question_id":2646,"title":"最小化旅行的价格总和","title_slug":"minimize-the-total-price-of-the-trips","rating":2238.2830745228,"_hash":1058966145,"paid_only":false}],"company":{}},{"contest":{"id":853,"title":"第 102 场双周赛","title_slug":"biweekly-contest-102","start_time":1681569000,"is_ee_exam_contest":null},"questions":[{"question_id":2639,"title":"查询网格图中每一列的宽度","title_slug":"find-the-width-of-columns-of-a-grid","rating":1282.5186784876,"_hash":2007370712,"paid_only":false},{"question_id":2640,"title":"一个数组所有前缀的分数","title_slug":"find-the-score-of-all-prefixes-of-an-array","rating":1314.3600610974,"_hash":1931269506,"paid_only":false},{"question_id":2641,"title":"二叉树的堂兄弟节点 II","title_slug":"cousins-in-binary-tree-ii","rating":1676.5007365375,"_hash":2279730191,"paid_only":false},{"question_id":2642,"title":"设计可以求最短路径的图类","title_slug":"design-graph-with-shortest-path-calculator","rating":1810.6470004623,"_hash":737896329,"paid_only":false}],"company":{}},{"contest":{"id":854,"title":"第 340 场周赛","title_slug":"weekly-contest-340","start_time":1681007400,"is_ee_exam_contest":null},"questions":[{"question_id":2614,"title":"对角线上的质数","title_slug":"prime-in-diagonal","rating":1375.4261931199,"_hash":3158353268,"paid_only":false},{"question_id":2615,"title":"等值距离和","title_slug":"sum-of-distances","rating":1793.3033536992,"_hash":158335627,"paid_only":false},{"question_id":2616,"title":"最小化数对的最大差值","title_slug":"minimize-the-maximum-difference-of-pairs","rating":2155.3424932408,"_hash":3806017410,"paid_only":false},{"question_id":2617,"title":"网格图中最少访问的格子数","title_slug":"minimum-number-of-visited-cells-in-a-grid","rating":2581.9961985753,"_hash":267246445,"paid_only":false}],"company":{}},{"contest":{"id":850,"title":"第 339 场周赛","title_slug":"weekly-contest-339","start_time":1680402600,"is_ee_exam_contest":null},"questions":[{"question_id":2609,"title":"最长平衡子字符串","title_slug":"find-the-longest-balanced-substring-of-a-binary-string","rating":1348.577010609,"_hash":1922249884,"paid_only":false},{"question_id":2610,"title":"转换二维数组","title_slug":"convert-an-array-into-a-2d-array-with-conditions","rating":1373.8916796083,"_hash":974534416,"paid_only":false},{"question_id":2611,"title":"老鼠和奶酪","title_slug":"mice-and-cheese","rating":1663.456591933,"_hash":3624743731,"paid_only":false},{"question_id":2612,"title":"最少翻转操作数","title_slug":"minimum-reverse-operations","rating":2824.4551372454,"_hash":855962181,"paid_only":false}],"company":{}},{"contest":{"id":842,"title":"第 101 场双周赛","title_slug":"biweekly-contest-101","start_time":1680359400,"is_ee_exam_contest":null},"questions":[{"question_id":2605,"title":"从两个数字数组里生成最小数字","title_slug":"form-smallest-number-from-two-digit-arrays","rating":1241.5775825621,"_hash":1927271954,"paid_only":false},{"question_id":2606,"title":"找到最大开销的子字符串","title_slug":"find-the-substring-with-maximum-cost","rating":1422.3308967485,"_hash":1474617560,"paid_only":false},{"question_id":2607,"title":"使子数组元素和相等","title_slug":"make-k-subarray-sums-equal","rating":2071.3208991938,"_hash":1691357385,"paid_only":false},{"question_id":2608,"title":"图中的最短环","title_slug":"shortest-cycle-in-a-graph","rating":1904.2279434479,"_hash":1825399219,"paid_only":false}],"company":{}},{"contest":{"id":843,"title":"第 338 场周赛","title_slug":"weekly-contest-338","start_time":1679797800,"is_ee_exam_contest":null},"questions":[{"question_id":2600,"title":"K 件物品的最大和","title_slug":"k-items-with-the-maximum-sum","rating":1434.2392062372,"_hash":829222445,"paid_only":false},{"question_id":2601,"title":"质数减法运算","title_slug":"prime-subtraction-operation","rating":1779.0712927572,"_hash":1323143155,"paid_only":false},{"question_id":2602,"title":"使数组元素全部相等的最少操作次数","title_slug":"minimum-operations-to-make-all-array-elements-equal","rating":1903.1973989877,"_hash":761999420,"paid_only":false},{"question_id":2603,"title":"收集树中金币","title_slug":"collect-coins-in-a-tree","rating":2711.8717381409,"_hash":2315979719,"paid_only":false}],"company":{}},{"contest":{"id":839,"title":"第 337 场周赛","title_slug":"weekly-contest-337","start_time":1679193000,"is_ee_exam_contest":null},"questions":[{"question_id":2595,"title":"奇偶位数","title_slug":"number-of-even-and-odd-bits","rating":1206.5675296817,"_hash":223285376,"paid_only":false},{"question_id":2596,"title":"检查骑士巡视方案","title_slug":"check-knight-tour-configuration","rating":1448.1865030721,"_hash":4101129191,"paid_only":false},{"question_id":2597,"title":"美丽子集的数目","title_slug":"the-number-of-beautiful-subsets","rating":2023.4303440211,"_hash":1913772288,"paid_only":false},{"question_id":2598,"title":"执行操作后的最大 MEX","title_slug":"smallest-missing-non-negative-integer-after-operations","rating":1845.6611654401,"_hash":2357679638,"paid_only":false}],"company":{}},{"contest":{"id":832,"title":"第 100 场双周赛","title_slug":"biweekly-contest-100","start_time":1679149800,"is_ee_exam_contest":null},"questions":[{"question_id":2591,"title":"将钱分给最多的儿童","title_slug":"distribute-money-to-maximum-children","rating":1530.6451141787,"_hash":2074713320,"paid_only":false},{"question_id":2592,"title":"最大化数组的伟大值","title_slug":"maximize-greatness-of-an-array","rating":1569.1579260438,"_hash":3063296642,"paid_only":false},{"question_id":2593,"title":"标记所有元素后数组的分数","title_slug":"find-score-of-an-array-after-marking-all-elements","rating":1665.1885910815,"_hash":3148467486,"paid_only":false},{"question_id":2594,"title":"修车的最少时间","title_slug":"minimum-time-to-repair-cars","rating":1915.2628132733,"_hash":2422059385,"paid_only":false}],"company":{}},{"contest":{"id":833,"title":"第 336 场周赛","title_slug":"weekly-contest-336","start_time":1678588200,"is_ee_exam_contest":null},"questions":[{"question_id":2586,"title":"统计范围内的元音字符串数","title_slug":"count-the-number-of-vowel-strings-in-range","rating":1178.6580069402,"_hash":1405789151,"paid_only":false},{"question_id":2587,"title":"重排数组以得到最大前缀分数","title_slug":"rearrange-array-to-maximize-prefix-score","rating":1336.7830451625,"_hash":922160489,"paid_only":false},{"question_id":2588,"title":"统计美丽子数组数目","title_slug":"count-the-number-of-beautiful-subarrays","rating":1696.8895579594,"_hash":3474039417,"paid_only":false},{"question_id":2589,"title":"完成所有任务的最少时间","title_slug":"minimum-time-to-complete-all-tasks","rating":2380.5983169295,"_hash":1119710280,"paid_only":false}],"company":{}},{"contest":{"id":825,"title":"第 335 场周赛","title_slug":"weekly-contest-335","start_time":1677983400,"is_ee_exam_contest":null},"questions":[{"question_id":2582,"title":"递枕头","title_slug":"pass-the-pillow","rating":1278.0092842613,"_hash":233297408,"paid_only":false},{"question_id":2583,"title":"二叉树中的第 K 大层和","title_slug":"kth-largest-sum-in-a-binary-tree","rating":1374.3527967199,"_hash":3851205548,"paid_only":false},{"question_id":2584,"title":"分割数组使乘积互质","title_slug":"split-the-array-to-make-coprime-products","rating":2159.4844281244,"_hash":1405611181,"paid_only":false},{"question_id":2585,"title":"获得分数的方法数","title_slug":"number-of-ways-to-earn-points","rating":1909.5535861652,"_hash":1697537146,"paid_only":false}],"company":{}},{"contest":{"id":822,"title":"第 99 场双周赛","title_slug":"biweekly-contest-99","start_time":1677940200,"is_ee_exam_contest":null},"questions":[{"question_id":2578,"title":"最小和分割","title_slug":"split-with-minimum-sum","rating":1350.5883729249,"_hash":1850921957,"paid_only":false},{"question_id":2579,"title":"统计染色格子数","title_slug":"count-total-number-of-colored-cells","rating":1356.4450869217,"_hash":1180349312,"paid_only":false},{"question_id":2580,"title":"统计将重叠区间合并成组的方案数","title_slug":"count-ways-to-group-overlapping-ranges","rating":1631.5850830561,"_hash":4043601244,"paid_only":false},{"question_id":2581,"title":"统计可能的树根数目","title_slug":"count-number-of-possible-root-nodes","rating":2228.3454693625,"_hash":3735555259,"paid_only":false}],"company":{}},{"contest":{"id":823,"title":"第 334 场周赛","title_slug":"weekly-contest-334","start_time":1677378600,"is_ee_exam_contest":null},"questions":[{"question_id":2574,"title":"左右元素和的差值","title_slug":"left-and-right-sum-differences","rating":1206.0712568518,"_hash":95938088,"paid_only":false},{"question_id":2575,"title":"找出字符串的可整除数组","title_slug":"find-the-divisibility-array-of-a-string","rating":1541.3741526845,"_hash":2410692850,"paid_only":false},{"question_id":2576,"title":"求出最多标记下标","title_slug":"find-the-maximum-number-of-marked-indices","rating":1843.2383664194,"_hash":260479518,"paid_only":false},{"question_id":2577,"title":"在网格图中访问一个格子的最少时间","title_slug":"minimum-time-to-visit-a-cell-in-a-grid","rating":2381.625583289,"_hash":2170025879,"paid_only":false}],"company":{}},{"contest":{"id":819,"title":"第 333 场周赛","title_slug":"weekly-contest-333","start_time":1676773800,"is_ee_exam_contest":null},"questions":[{"question_id":2570,"title":"合并两个二维数组 - 求和法","title_slug":"merge-two-2d-arrays-by-summing-values","rating":1281.0889272532,"_hash":1168254316,"paid_only":false},{"question_id":2571,"title":"将整数减少到零需要的最少操作数","title_slug":"minimum-operations-to-reduce-an-integer-to-0","rating":1649.2000410344,"_hash":676949389,"paid_only":false},{"question_id":2572,"title":"无平方子集计数","title_slug":"count-the-number-of-square-free-subsets","rating":2419.5791089724,"_hash":3483377785,"paid_only":false},{"question_id":2573,"title":"找出对应 LCP 矩阵的字符串","title_slug":"find-the-string-with-lcp","rating":2681.7054310332,"_hash":3461834167,"paid_only":false}],"company":{}},{"contest":{"id":816,"title":"第 98 场双周赛","title_slug":"biweekly-contest-98","start_time":1676730600,"is_ee_exam_contest":null},"questions":[{"question_id":2566,"title":"替换一个数字后的最大差值","title_slug":"maximum-difference-by-remapping-a-digit","rating":1396.1044458638,"_hash":2204380301,"paid_only":false},{"question_id":2567,"title":"修改两个元素的最小分数","title_slug":"minimum-score-by-changing-two-elements","rating":1608.577875807,"_hash":1785562293,"paid_only":false},{"question_id":2568,"title":"最小无法得到的或值","title_slug":"minimum-impossible-or","rating":1754.1710323358,"_hash":1363446915,"paid_only":false},{"question_id":2569,"title":"更新数组后处理求和查询","title_slug":"handling-sum-queries-after-update","rating":2397.8728428256,"_hash":1507332922,"paid_only":false}],"company":{}},{"contest":{"id":817,"title":"第 332 场周赛","title_slug":"weekly-contest-332","start_time":1676169000,"is_ee_exam_contest":null},"questions":[{"question_id":2562,"title":"找出数组的串联值","title_slug":"find-the-array-concatenation-value","rating":1259.949137745,"_hash":2036642817,"paid_only":false},{"question_id":2563,"title":"统计公平数对的数目","title_slug":"count-the-number-of-fair-pairs","rating":1720.7470612766,"_hash":2019191135,"paid_only":false},{"question_id":2564,"title":"子字符串异或查询","title_slug":"substring-xor-queries","rating":1959.2696201953,"_hash":1709868853,"paid_only":false},{"question_id":2565,"title":"最少得分子序列","title_slug":"subsequence-with-the-minimum-score","rating":2432.4146343542,"_hash":782263815,"paid_only":false}],"company":{}},{"contest":{"id":813,"title":"第 331 场周赛","title_slug":"weekly-contest-331","start_time":1675564200,"is_ee_exam_contest":null},"questions":[{"question_id":2558,"title":"从数量最多的堆取走礼物","title_slug":"take-gifts-from-the-richest-pile","rating":1276.7817742915,"_hash":1520385101,"paid_only":false},{"question_id":2559,"title":"统计范围内的元音字符串数","title_slug":"count-vowel-strings-in-ranges","rating":1435.0179887342,"_hash":945629510,"paid_only":false},{"question_id":2560,"title":"打家劫舍 IV","title_slug":"house-robber-iv","rating":2081.1880297942,"_hash":1088208610,"paid_only":false},{"question_id":2561,"title":"重排水果","title_slug":"rearranging-fruits","rating":2221.793185714,"_hash":3549688121,"paid_only":false}],"company":{}},{"contest":{"id":810,"title":"第 97 场双周赛","title_slug":"biweekly-contest-97","start_time":1675521000,"is_ee_exam_contest":null},"questions":[{"question_id":2553,"title":"分割数组中数字的数位","title_slug":"separate-the-digits-in-an-array","rating":1216.612918849,"_hash":1493116499,"paid_only":false},{"question_id":2554,"title":"从一个范围内选择最多整数 I","title_slug":"maximum-number-of-integers-to-choose-from-a-range-i","rating":1333.2008827592,"_hash":220667062,"paid_only":false},{"question_id":2555,"title":"两个线段获得的最多奖品","title_slug":"maximize-win-from-two-segments","rating":2080.7845644831,"_hash":149268417,"paid_only":false},{"question_id":2556,"title":"二进制矩阵中翻转最多一次使路径不连通","title_slug":"disconnect-path-in-a-binary-matrix-by-at-most-one-flip","rating":2368.6674771307,"_hash":3118895370,"paid_only":false}],"company":{}},{"contest":{"id":811,"title":"第 330 场周赛","title_slug":"weekly-contest-330","start_time":1674959400,"is_ee_exam_contest":null},"questions":[{"question_id":2549,"title":"统计桌面上的不同数字","title_slug":"count-distinct-numbers-on-board","rating":1265.8320564115,"_hash":3023056451,"paid_only":false},{"question_id":2550,"title":"猴子碰撞的方法数","title_slug":"count-collisions-of-monkeys-on-a-polygon","rating":1662.7075394144,"_hash":374282350,"paid_only":false},{"question_id":2551,"title":"将珠子放入背包中","title_slug":"put-marbles-in-bags","rating":2042.4005521254,"_hash":1210688937,"paid_only":false},{"question_id":2552,"title":"统计上升四元组","title_slug":"count-increasing-quadruplets","rating":2432.713399111,"_hash":2579679937,"paid_only":false}],"company":{}},{"contest":{"id":807,"title":"第 329 场周赛","title_slug":"weekly-contest-329","start_time":1674354600,"is_ee_exam_contest":null},"questions":[{"question_id":2544,"title":"交替数字和","title_slug":"alternating-digit-sum","rating":1184.3385083575,"_hash":833954016,"paid_only":false},{"question_id":2545,"title":"根据第 K 场考试的分数排序","title_slug":"sort-the-students-by-their-kth-score","rating":1294.0257382852,"_hash":2697040026,"paid_only":false},{"question_id":2546,"title":"执行逐位运算使字符串相等","title_slug":"apply-bitwise-operations-to-make-strings-equal","rating":1604.6299874552,"_hash":1537635707,"paid_only":false},{"question_id":2547,"title":"拆分数组的最小代价","title_slug":"minimum-cost-to-split-an-array","rating":2019.9859462755,"_hash":3573894690,"paid_only":false}],"company":{}},{"contest":{"id":804,"title":"第 96 场双周赛","title_slug":"biweekly-contest-96","start_time":1674311400,"is_ee_exam_contest":null},"questions":[{"question_id":2540,"title":"最小公共值","title_slug":"minimum-common-value","rating":1249.7515196656,"_hash":2913358439,"paid_only":false},{"question_id":2541,"title":"使数组中所有元素相等的最小操作数 II","title_slug":"minimum-operations-to-make-array-equal-ii","rating":1619.505461912,"_hash":2719928959,"paid_only":false},{"question_id":2542,"title":"最大子序列的分数","title_slug":"maximum-subsequence-score","rating":2056.2598215101,"_hash":301567212,"paid_only":false},{"question_id":2543,"title":"判断一个点是否可以到达","title_slug":"check-if-point-is-reachable","rating":2220.8257124139,"_hash":3766200583,"paid_only":false}],"company":{}},{"contest":{"id":805,"title":"第 328 场周赛","title_slug":"weekly-contest-328","start_time":1673749800,"is_ee_exam_contest":null},"questions":[{"question_id":2535,"title":"数组元素和与数字和的绝对差","title_slug":"difference-between-element-sum-and-digit-sum-of-an-array","rating":1222.2354919459,"_hash":1732202044,"paid_only":false},{"question_id":2536,"title":"子矩阵元素加 1","title_slug":"increment-submatrices-by-one","rating":1583.3117784523,"_hash":3521973284,"paid_only":false},{"question_id":2537,"title":"统计好子数组的数目","title_slug":"count-the-number-of-good-subarrays","rating":1891.8455273506,"_hash":2668311333,"paid_only":false},{"question_id":2538,"title":"最大价值和与最小价值和的差值","title_slug":"difference-between-maximum-and-minimum-price-sum","rating":2397.9722495587,"_hash":2887872471,"paid_only":false}],"company":{}},{"contest":{"id":801,"title":"第 327 场周赛","title_slug":"weekly-contest-327","start_time":1673145000,"is_ee_exam_contest":null},"questions":[{"question_id":2529,"title":"正整数和负整数的最大计数","title_slug":"maximum-count-of-positive-integer-and-negative-integer","rating":1195.9731842298,"_hash":770550829,"paid_only":false},{"question_id":2530,"title":"执行 K 次操作后的最大分数","title_slug":"maximal-score-after-applying-k-operations","rating":1386.1200017827,"_hash":2626303746,"paid_only":false},{"question_id":2531,"title":"使字符串中不同字符的数目相等","title_slug":"make-number-of-distinct-characters-equal","rating":1775.854606648,"_hash":485006616,"paid_only":false},{"question_id":2532,"title":"过桥的时间","title_slug":"time-to-cross-a-bridge","rating":2588.8752130913,"_hash":1029578709,"paid_only":false}],"company":{}},{"contest":{"id":798,"title":"第 95 场双周赛","title_slug":"biweekly-contest-95","start_time":1673101800,"is_ee_exam_contest":null},"questions":[{"question_id":2525,"title":"根据规则将箱子分类","title_slug":"categorize-box-according-to-criteria","rating":1301.4167433184,"_hash":1751494517,"paid_only":false},{"question_id":2526,"title":"找到数据流中的连续整数","title_slug":"find-consecutive-integers-from-a-data-stream","rating":1444.3218903725,"_hash":778347498,"paid_only":false},{"question_id":2527,"title":"查询数组异或美丽值","title_slug":"find-xor-beauty-of-array","rating":1549.945040184,"_hash":1501707049,"paid_only":false},{"question_id":2528,"title":"最大化城市的最小电量","title_slug":"maximize-the-minimum-powered-city","rating":2235.5784618885,"_hash":530846359,"paid_only":false}],"company":{}},{"contest":{"id":799,"title":"第 326 场周赛","title_slug":"weekly-contest-326","start_time":1672540200,"is_ee_exam_contest":null},"questions":[{"question_id":2520,"title":"统计能整除数字的位数","title_slug":"count-the-digits-that-divide-a-number","rating":1260.8697515006,"_hash":2323533689,"paid_only":false},{"question_id":2521,"title":"数组乘积中的不同质因数数目","title_slug":"distinct-prime-factors-of-product-of-array","rating":1413.0376809608,"_hash":3036702868,"paid_only":false},{"question_id":2522,"title":"将字符串分割成值不超过 K 的子字符串","title_slug":"partition-string-into-substrings-with-values-at-most-k","rating":1604.5128423093,"_hash":3561342867,"paid_only":false},{"question_id":2523,"title":"范围内最接近的两个质数","title_slug":"closest-prime-numbers-in-range","rating":1649.7120733311,"_hash":3492742379,"paid_only":false}],"company":{}},{"contest":{"id":795,"title":"第 325 场周赛","title_slug":"weekly-contest-325","start_time":1671935400,"is_ee_exam_contest":null},"questions":[{"question_id":2515,"title":"到目标字符串的最短距离","title_slug":"shortest-distance-to-target-string-in-a-circular-array","rating":1367.0197235097,"_hash":1200771569,"paid_only":false},{"question_id":2516,"title":"每种字符至少取 K 个","title_slug":"take-k-of-each-character-from-left-and-right","rating":1947.8832856412,"_hash":2088911620,"paid_only":false},{"question_id":2517,"title":"礼盒的最大甜蜜度","title_slug":"maximum-tastiness-of-candy-basket","rating":2020.6775180586,"_hash":337441895,"paid_only":false},{"question_id":2518,"title":"好分区的数目","title_slug":"number-of-great-partitions","rating":2414.6227484407,"_hash":636790914,"paid_only":false}],"company":{}},{"contest":{"id":789,"title":"第 94 场双周赛","title_slug":"biweekly-contest-94","start_time":1671892200,"is_ee_exam_contest":null},"questions":[{"question_id":2511,"title":"最多可以摧毁的敌人城堡数目","title_slug":"maximum-enemy-forts-that-can-be-captured","rating":1450.0534545623,"_hash":3250902571,"paid_only":false},{"question_id":2512,"title":"奖励最顶尖的 K 名学生","title_slug":"reward-top-k-students","rating":1636.7472106213,"_hash":1295785983,"paid_only":false},{"question_id":2513,"title":"最小化两个数组中的最大值","title_slug":"minimize-the-maximum-of-two-arrays","rating":2302.4005640818,"_hash":1712826586,"paid_only":false},{"question_id":2514,"title":"统计同位异构字符串数目","title_slug":"count-anagrams","rating":2069.7848729824,"_hash":2697534725,"paid_only":false}],"company":{}},{"contest":{"id":790,"title":"第 324 场周赛","title_slug":"weekly-contest-324","start_time":1671330600,"is_ee_exam_contest":null},"questions":[{"question_id":2506,"title":"统计相似字符串对的数目","title_slug":"count-pairs-of-similar-strings","rating":1335.4613368501,"_hash":3891355877,"paid_only":false},{"question_id":2507,"title":"使用质因数之和替换后可以取到的最小值","title_slug":"smallest-value-after-replacing-with-sum-of-prime-factors","rating":1499.5903720292,"_hash":1529011687,"paid_only":false},{"question_id":2508,"title":"添加边使所有节点度数都为偶数","title_slug":"add-edges-to-make-degrees-of-all-nodes-even","rating":2060.0720834082,"_hash":2337606731,"paid_only":false},{"question_id":2509,"title":"查询树中环的长度","title_slug":"cycle-length-queries-in-a-tree","rating":1948.489500779,"_hash":922086852,"paid_only":false}],"company":{}},{"contest":{"id":785,"title":"第 323 场周赛","title_slug":"weekly-contest-323","start_time":1670725800,"is_ee_exam_contest":null},"questions":[{"question_id":2500,"title":"删除每行中的最大值","title_slug":"delete-greatest-value-in-each-row","rating":1309.7266159448,"_hash":1037331293,"paid_only":false},{"question_id":2501,"title":"数组中最长的方波","title_slug":"longest-square-streak-in-an-array","rating":1479.9828219111,"_hash":4224854568,"paid_only":false},{"question_id":2502,"title":"设计内存分配器","title_slug":"design-memory-allocator","rating":1745.5352025872,"_hash":1579629689,"paid_only":false},{"question_id":2503,"title":"矩阵查询可获得的最大分数","title_slug":"maximum-number-of-points-from-grid-queries","rating":2195.6540241654,"_hash":4062961912,"paid_only":false}],"company":{}},{"contest":{"id":782,"title":"第 93 场双周赛","title_slug":"biweekly-contest-93","start_time":1670682600,"is_ee_exam_contest":null},"questions":[{"question_id":2496,"title":"数组中字符串的最大值","title_slug":"maximum-value-of-a-string-in-an-array","rating":1292.8993325204,"_hash":3800630907,"paid_only":false},{"question_id":2497,"title":"图中最大星和","title_slug":"maximum-star-sum-of-a-graph","rating":1682.16892078,"_hash":1275579259,"paid_only":false},{"question_id":2498,"title":"青蛙过河 II","title_slug":"frog-jump-ii","rating":1759.0470795449,"_hash":2772831251,"paid_only":false},{"question_id":2499,"title":"让数组不相等的最小总代价","title_slug":"minimum-total-cost-to-make-arrays-unequal","rating":2633.0144045478,"_hash":3756156206,"paid_only":false}],"company":{}},{"contest":{"id":783,"title":"第 322 场周赛","title_slug":"weekly-contest-322","start_time":1670121000,"is_ee_exam_contest":null},"questions":[{"question_id":2490,"title":"回环句","title_slug":"circular-sentence","rating":1262.938740364,"_hash":3558781406,"paid_only":false},{"question_id":2491,"title":"划分技能点相等的团队","title_slug":"divide-players-into-teams-of-equal-skill","rating":1323.1893756783,"_hash":3978864326,"paid_only":false},{"question_id":2492,"title":"两个城市间路径的最小分数","title_slug":"minimum-score-of-a-path-between-two-cities","rating":1679.5737760149,"_hash":3337273246,"paid_only":false},{"question_id":2493,"title":"将节点分成尽可能多的组","title_slug":"divide-nodes-into-the-maximum-number-of-groups","rating":2415.2802039252,"_hash":1627181507,"paid_only":false}],"company":{}},{"contest":{"id":779,"title":"第 321 场周赛","title_slug":"weekly-contest-321","start_time":1669516200,"is_ee_exam_contest":null},"questions":[{"question_id":2485,"title":"找出中枢整数","title_slug":"find-the-pivot-integer","rating":1207.3151378208,"_hash":2384194086,"paid_only":false},{"question_id":2486,"title":"追加字符以获得子序列","title_slug":"append-characters-to-string-to-make-subsequence","rating":1362.7144100401,"_hash":282802217,"paid_only":false},{"question_id":2487,"title":"从链表中移除节点","title_slug":"remove-nodes-from-linked-list","rating":1454.5942017003,"_hash":3911303073,"paid_only":false},{"question_id":2488,"title":"统计中位数为 K 的子数组","title_slug":"count-subarrays-with-median-k","rating":1998.889914712,"_hash":2631420913,"paid_only":false}],"company":{}},{"contest":{"id":776,"title":"第 92 场双周赛","title_slug":"biweekly-contest-92","start_time":1669473000,"is_ee_exam_contest":null},"questions":[{"question_id":2481,"title":"分割圆的最少切割次数","title_slug":"minimum-cuts-to-divide-a-circle","rating":1246.0341186297,"_hash":2329981708,"paid_only":false},{"question_id":2482,"title":"行和列中一和零的差值","title_slug":"difference-between-ones-and-zeros-in-row-and-column","rating":1372.5139179378,"_hash":61296851,"paid_only":false},{"question_id":2483,"title":"商店的最少代价","title_slug":"minimum-penalty-for-a-shop","rating":1494.500749598,"_hash":480223586,"paid_only":false},{"question_id":2484,"title":"统计回文子序列数目","title_slug":"count-palindromic-subsequences","rating":2223.1762282199,"_hash":924129852,"paid_only":false}],"company":{}},{"contest":{"id":777,"title":"第 320 场周赛","title_slug":"weekly-contest-320","start_time":1668911400,"is_ee_exam_contest":null},"questions":[{"question_id":2475,"title":"数组中不等三元组的数目","title_slug":"number-of-unequal-triplets-in-array","rating":1255.5461825223,"_hash":1497402060,"paid_only":false},{"question_id":2476,"title":"二叉搜索树最近节点查询","title_slug":"closest-nodes-queries-in-a-binary-search-tree","rating":1596.9852244916,"_hash":2732657659,"paid_only":false},{"question_id":2477,"title":"到达首都的最少油耗","title_slug":"minimum-fuel-cost-to-report-to-the-capital","rating":2011.9703133514,"_hash":340860484,"paid_only":false},{"question_id":2478,"title":"完美分割的方案数","title_slug":"number-of-beautiful-partitions","rating":2344.3664724791,"_hash":1069956724,"paid_only":false}],"company":{}},{"contest":{"id":773,"title":"第 319 场周赛","title_slug":"weekly-contest-319","start_time":1668306600,"is_ee_exam_contest":null},"questions":[{"question_id":2469,"title":"温度转换","title_slug":"convert-the-temperature","rating":1153.427255962,"_hash":1614249365,"paid_only":false},{"question_id":2470,"title":"最小公倍数为 K 的子数组数目","title_slug":"number-of-subarrays-with-lcm-equal-to-k","rating":1559.9709348417,"_hash":2715109000,"paid_only":false},{"question_id":2471,"title":"逐层排序二叉树所需的最少操作数目","title_slug":"minimum-number-of-operations-to-sort-a-binary-tree-by-level","rating":1635.1520858279,"_hash":629883391,"paid_only":false},{"question_id":2472,"title":"不重叠回文子字符串的最大数目","title_slug":"maximum-number-of-non-overlapping-palindrome-substrings","rating":2013.4354344791,"_hash":3513036702,"paid_only":false}],"company":{}},{"contest":{"id":770,"title":"第 91 场双周赛","title_slug":"biweekly-contest-91","start_time":1668263400,"is_ee_exam_contest":null},"questions":[{"question_id":2465,"title":"不同的平均值数目","title_slug":"number-of-distinct-averages","rating":1250.0975318308,"_hash":2621480860,"paid_only":false},{"question_id":2466,"title":"统计构造好字符串的方案数","title_slug":"count-ways-to-build-good-strings","rating":1694.4308657594,"_hash":4245137983,"paid_only":false},{"question_id":2467,"title":"树上最大得分和路径","title_slug":"most-profitable-path-in-a-tree","rating":2053.354609292,"_hash":2422423692,"paid_only":false},{"question_id":2468,"title":"根据限制分割消息","title_slug":"split-message-based-on-limit","rating":2381.6019709166,"_hash":4257560677,"paid_only":false}],"company":{}},{"contest":{"id":771,"title":"第 318 场周赛","title_slug":"weekly-contest-318","start_time":1667701800,"is_ee_exam_contest":null},"questions":[{"question_id":2460,"title":"对数组执行操作","title_slug":"apply-operations-to-an-array","rating":1223.9335618833,"_hash":389978318,"paid_only":false},{"question_id":2461,"title":"长度为 K 子数组中的最大和","title_slug":"maximum-sum-of-distinct-subarrays-with-length-k","rating":1552.8935571247,"_hash":3738097801,"paid_only":false},{"question_id":2462,"title":"雇佣 K 位工人的总代价","title_slug":"total-cost-to-hire-k-workers","rating":1763.6404758359,"_hash":2730930360,"paid_only":false},{"question_id":2463,"title":"最小移动总距离","title_slug":"minimum-total-distance-traveled","rating":2453.9054896968,"_hash":169260234,"paid_only":false}],"company":{}},{"contest":{"id":767,"title":"第 317 场周赛","title_slug":"weekly-contest-317","start_time":1667097000,"is_ee_exam_contest":null},"questions":[{"question_id":2455,"title":"可被三整除的偶数的平均值","title_slug":"average-value-of-even-numbers-that-are-divisible-by-three","rating":1151.2537511408,"_hash":1001722740,"paid_only":false},{"question_id":2456,"title":"最流行的视频创作者","title_slug":"most-popular-video-creator","rating":1548.1751146981,"_hash":3143101757,"paid_only":false},{"question_id":2457,"title":"美丽整数的最小增量","title_slug":"minimum-addition-to-make-integer-beautiful","rating":1680.0815931601,"_hash":2889905668,"paid_only":false},{"question_id":2458,"title":"移除子树后的二叉树高度","title_slug":"height-of-binary-tree-after-subtree-removal-queries","rating":2298.6242048519,"_hash":4116532905,"paid_only":false}],"company":{}},{"contest":{"id":763,"title":"第 90 场双周赛","title_slug":"biweekly-contest-90","start_time":1667053800,"is_ee_exam_contest":null},"questions":[{"question_id":2451,"title":"差值数组不同的字符串","title_slug":"odd-string-difference","rating":1406.1279714442,"_hash":1571048900,"paid_only":false},{"question_id":2452,"title":"距离字典两次编辑以内的单词","title_slug":"words-within-two-edits-of-dictionary","rating":1459.7513584849,"_hash":1616359180,"paid_only":false},{"question_id":2453,"title":"摧毁一系列目标","title_slug":"destroy-sequential-targets","rating":1761.9162628125,"_hash":3946751496,"paid_only":false},{"question_id":2454,"title":"下一个更大元素 IV","title_slug":"next-greater-element-iv","rating":2175.1190473433,"_hash":2368071046,"paid_only":false}],"company":{}},{"contest":{"id":764,"title":"第 316 场周赛","title_slug":"weekly-contest-316","start_time":1666492200,"is_ee_exam_contest":null},"questions":[{"question_id":2446,"title":"判断两个事件是否存在冲突","title_slug":"determine-if-two-events-have-conflict","rating":1322.3886921778,"_hash":735587531,"paid_only":false},{"question_id":2447,"title":"最大公因数等于 K 的子数组数目","title_slug":"number-of-subarrays-with-gcd-equal-to-k","rating":1602.7742849665,"_hash":4162714270,"paid_only":false},{"question_id":2448,"title":"使数组相等的最小开销","title_slug":"minimum-cost-to-make-array-equal","rating":2005.3737929084,"_hash":1689171801,"paid_only":false},{"question_id":2449,"title":"使数组相似的最少操作次数","title_slug":"minimum-number-of-operations-to-make-arrays-similar","rating":2076.0155978787,"_hash":3679518604,"paid_only":false}],"company":{}},{"contest":{"id":759,"title":"第 315 场周赛","title_slug":"weekly-contest-315","start_time":1665887400,"is_ee_exam_contest":null},"questions":[{"question_id":2441,"title":"与对应负数同时存在的最大正整数","title_slug":"largest-positive-integer-that-exists-with-its-negative","rating":1167.647122501,"_hash":3779169819,"paid_only":false},{"question_id":2442,"title":"反转之后不同整数的数目","title_slug":"count-number-of-distinct-integers-after-reverse-operations","rating":1218.9011436003,"_hash":2907477166,"paid_only":false},{"question_id":2443,"title":"反转之后的数字和","title_slug":"sum-of-number-and-its-reverse","rating":1376.0047008182,"_hash":3835566276,"paid_only":false},{"question_id":2444,"title":"统计定界子数组的数目","title_slug":"count-subarrays-with-fixed-bounds","rating":2092.5366031561,"_hash":3820908739,"paid_only":false}],"company":{}},{"contest":{"id":755,"title":"第 89 场双周赛","title_slug":"biweekly-contest-89","start_time":1665844200,"is_ee_exam_contest":null},"questions":[{"question_id":2437,"title":"有效时间的数目","title_slug":"number-of-valid-clock-times","rating":1426.9800910361,"_hash":4095621901,"paid_only":false},{"question_id":2438,"title":"二的幂数组中查询范围内的乘积","title_slug":"range-product-queries-of-powers","rating":1609.7858209851,"_hash":2397274802,"paid_only":false},{"question_id":2439,"title":"最小化数组中的最大值","title_slug":"minimize-maximum-of-array","rating":1965.1266122355,"_hash":938263064,"paid_only":false},{"question_id":2440,"title":"创建价值相同的连通块","title_slug":"create-components-with-same-value","rating":2460.3152437576,"_hash":2080495144,"paid_only":false}],"company":{}},{"contest":{"id":756,"title":"第 314 场周赛","title_slug":"weekly-contest-314","start_time":1665282600,"is_ee_exam_contest":null},"questions":[{"question_id":2432,"title":"处理用时最长的那个任务的员工","title_slug":"the-employee-that-worked-on-the-longest-task","rating":1266.7001363197,"_hash":4113058721,"paid_only":false},{"question_id":2433,"title":"找出前缀异或的原始数组","title_slug":"find-the-original-array-of-prefix-xor","rating":1366.6789652398,"_hash":883396381,"paid_only":false},{"question_id":2434,"title":"使用机器人打印字典序最小的字符串","title_slug":"using-a-robot-to-print-the-lexicographically-smallest-string","rating":1953.137726744,"_hash":3067908479,"paid_only":false},{"question_id":2435,"title":"矩阵中和能被 K 整除的路径","title_slug":"paths-in-matrix-whose-sum-is-divisible-by-k","rating":1951.5918682146,"_hash":3930025215,"paid_only":false}],"company":{}},{"contest":{"id":750,"title":"第 313 场周赛","title_slug":"weekly-contest-313","start_time":1664677800,"is_ee_exam_contest":null},"questions":[{"question_id":2427,"title":"公因子的数目","title_slug":"number-of-common-factors","rating":1172.0548998046,"_hash":1853208613,"paid_only":false},{"question_id":2428,"title":"沙漏的最大总和","title_slug":"maximum-sum-of-an-hourglass","rating":1289.945159062,"_hash":3528330030,"paid_only":false},{"question_id":2429,"title":"最小异或","title_slug":"minimize-xor","rating":1532.3349133769,"_hash":2645404069,"paid_only":false},{"question_id":2430,"title":"对字母串可执行的最大删除数","title_slug":"maximum-deletions-on-a-string","rating":2101.867342004,"_hash":670519393,"paid_only":false}],"company":{}},{"contest":{"id":745,"title":"第 88 场双周赛","title_slug":"biweekly-contest-88","start_time":1664634600,"is_ee_exam_contest":null},"questions":[{"question_id":2423,"title":"删除字符使频率相同","title_slug":"remove-letter-to-equalize-frequency","rating":1648.3540381514,"_hash":2197356984,"paid_only":false},{"question_id":2424,"title":"最长上传前缀","title_slug":"longest-uploaded-prefix","rating":1604.1602280047,"_hash":718987035,"paid_only":false},{"question_id":2425,"title":"所有数对的异或和","title_slug":"bitwise-xor-of-all-pairings","rating":1622.3970914116,"_hash":3786781582,"paid_only":false},{"question_id":2426,"title":"满足不等式的数对数目","title_slug":"number-of-pairs-satisfying-inequality","rating":2030.1021023033,"_hash":1785363546,"paid_only":false}],"company":{}},{"contest":{"id":746,"title":"第 312 场周赛","title_slug":"weekly-contest-312","start_time":1664073000,"is_ee_exam_contest":null},"questions":[{"question_id":2418,"title":"按身高排序","title_slug":"sort-the-people","rating":1193.0585534828,"_hash":4022402413,"paid_only":false},{"question_id":2419,"title":"按位与最大的最长子数组","title_slug":"longest-subarray-with-maximum-bitwise-and","rating":1495.5180147817,"_hash":119361315,"paid_only":false},{"question_id":2420,"title":"找到所有好下标","title_slug":"find-all-good-indices","rating":1695.0815222626,"_hash":3422315602,"paid_only":false},{"question_id":2421,"title":"好路径的数目","title_slug":"number-of-good-paths","rating":2444.6660756903,"_hash":2335420481,"paid_only":false}],"company":{}},{"contest":{"id":741,"title":"第 311 场周赛","title_slug":"weekly-contest-311","start_time":1663468200,"is_ee_exam_contest":null},"questions":[{"question_id":2413,"title":"最小偶倍数","title_slug":"smallest-even-multiple","rating":1144.9508874557,"_hash":3078609754,"paid_only":false},{"question_id":2414,"title":"最长的字母序连续子字符串的长度","title_slug":"length-of-the-longest-alphabetical-continuous-substring","rating":1221.8477681772,"_hash":3354310865,"paid_only":false},{"question_id":2415,"title":"反转二叉树的奇数层","title_slug":"reverse-odd-levels-of-binary-tree","rating":1431.0523656241,"_hash":1420390570,"paid_only":false},{"question_id":2416,"title":"字符串的前缀分数和","title_slug":"sum-of-prefix-scores-of-strings","rating":1725.1995150882,"_hash":2425741756,"paid_only":false}],"company":{}},{"contest":{"id":703,"title":"第 87 场双周赛","title_slug":"biweekly-contest-87","start_time":1663425000,"is_ee_exam_contest":null},"questions":[{"question_id":2409,"title":"统计共同度过的日子数","title_slug":"count-days-spent-together","rating":1562.0956544608,"_hash":3761575610,"paid_only":false},{"question_id":2410,"title":"运动员和训练师的最大匹配数","title_slug":"maximum-matching-of-players-with-trainers","rating":1381.0888968455,"_hash":3736843920,"paid_only":false},{"question_id":2411,"title":"按位或最大的最小子数组长度","title_slug":"smallest-subarrays-with-maximum-bitwise-or","rating":1938.0586460002,"_hash":1975607113,"paid_only":false},{"question_id":2412,"title":"完成所有交易的初始最少钱数","title_slug":"minimum-money-required-before-transactions","rating":2092.0222850837,"_hash":2719065978,"paid_only":false}],"company":{}},{"contest":{"id":704,"title":"第 310 场周赛","title_slug":"weekly-contest-310","start_time":1662863400,"is_ee_exam_contest":null},"questions":[{"question_id":2404,"title":"出现最频繁的偶数元素","title_slug":"most-frequent-even-element","rating":1259.3406231708,"_hash":484484283,"paid_only":false},{"question_id":2405,"title":"子字符串的最优划分","title_slug":"optimal-partition-of-string","rating":1355.3956434989,"_hash":569962978,"paid_only":false},{"question_id":2406,"title":"将区间分为最少组数","title_slug":"divide-intervals-into-minimum-number-of-groups","rating":1713.3954468582,"_hash":1620554900,"paid_only":false},{"question_id":2407,"title":"最长递增子序列 II","title_slug":"longest-increasing-subsequence-ii","rating":2280.3143643878,"_hash":1567110694,"paid_only":false}],"company":{}},{"contest":{"id":693,"title":"第 309 场周赛","title_slug":"weekly-contest-309","start_time":1662258600,"is_ee_exam_contest":null},"questions":[{"question_id":2399,"title":"检查相同字母间的距离","title_slug":"check-distances-between-same-letters","rating":1243.6250741657,"_hash":1515775640,"paid_only":false},{"question_id":2400,"title":"恰好移动 k 步到达某一位置的方法数目","title_slug":"number-of-ways-to-reach-a-position-after-exactly-k-steps","rating":1751.115625465,"_hash":3867293007,"paid_only":false},{"question_id":2401,"title":"最长优雅子数组","title_slug":"longest-nice-subarray","rating":1749.5432375672,"_hash":3355469687,"paid_only":false},{"question_id":2402,"title":"会议室 III","title_slug":"meeting-rooms-iii","rating":2092.8943149547,"_hash":910590803,"paid_only":false}],"company":{}},{"contest":{"id":688,"title":"第 86 场双周赛","title_slug":"biweekly-contest-86","start_time":1662215400,"is_ee_exam_contest":null},"questions":[{"question_id":2395,"title":"和相等的子数组","title_slug":"find-subarrays-with-equal-sum","rating":1249.8425270142,"_hash":2578600625,"paid_only":false},{"question_id":2396,"title":"严格回文的数字","title_slug":"strictly-palindromic-number","rating":1328.5499677186,"_hash":111167904,"paid_only":false},{"question_id":2397,"title":"被列覆盖的最多行数","title_slug":"maximum-rows-covered-by-columns","rating":1718.8256321624,"_hash":1913049602,"paid_only":false},{"question_id":2398,"title":"预算内的最多机器人数目","title_slug":"maximum-number-of-robots-within-budget","rating":1917.2145829853,"_hash":1856172895,"paid_only":false}],"company":{}},{"contest":{"id":689,"title":"第 308 场周赛","title_slug":"weekly-contest-308","start_time":1661653800,"is_ee_exam_contest":null},"questions":[{"question_id":2389,"title":"和有限的最长子序列","title_slug":"longest-subsequence-with-limited-sum","rating":1387.7347071166,"_hash":2775344327,"paid_only":false},{"question_id":2390,"title":"从字符串中移除星号","title_slug":"removing-stars-from-a-string","rating":1347.8521638635,"_hash":917372483,"paid_only":false},{"question_id":2391,"title":"收集垃圾的最少总时间","title_slug":"minimum-amount-of-time-to-collect-garbage","rating":1455.8516200241,"_hash":2833491097,"paid_only":false},{"question_id":2392,"title":"给定条件下构造矩阵","title_slug":"build-a-matrix-with-conditions","rating":1960.5517123728,"_hash":700466705,"paid_only":false}],"company":{}},{"contest":{"id":671,"title":"第 307 场周赛","title_slug":"weekly-contest-307","start_time":1661049000,"is_ee_exam_contest":null},"questions":[{"question_id":2383,"title":"赢得比赛需要的最少训练时长","title_slug":"minimum-hours-of-training-to-win-a-competition","rating":1413.4238697034,"_hash":1542173395,"paid_only":false},{"question_id":2384,"title":"最大回文数字","title_slug":"largest-palindromic-number","rating":1636.47322627,"_hash":70049056,"paid_only":false},{"question_id":2385,"title":"感染二叉树需要的总时间","title_slug":"amount-of-time-for-binary-tree-to-be-infected","rating":1711.4873176824,"_hash":2321913205,"paid_only":false},{"question_id":2386,"title":"找出数组的第 K 大和","title_slug":"find-the-k-sum-of-an-array","rating":2647.8258771458,"_hash":2945726008,"paid_only":false}],"company":{}},{"contest":{"id":668,"title":"第 85 场双周赛","title_slug":"biweekly-contest-85","start_time":1661005800,"is_ee_exam_contest":null},"questions":[{"question_id":2379,"title":"得到 K 个黑块的最少涂色次数","title_slug":"minimum-recolors-to-get-k-consecutive-black-blocks","rating":1360.0511262593,"_hash":2333659184,"paid_only":false},{"question_id":2380,"title":"二进制字符串重新安排顺序需要的时间","title_slug":"time-needed-to-rearrange-a-binary-string","rating":1481.1046340847,"_hash":147891676,"paid_only":false},{"question_id":2381,"title":"字母移位 II","title_slug":"shifting-letters-ii","rating":1793.3037316825,"_hash":2012982950,"paid_only":false},{"question_id":2382,"title":"删除操作后的最大子段和","title_slug":"maximum-segment-sum-after-removals","rating":2136.3013259524,"_hash":746573214,"paid_only":false}],"company":{}},{"contest":{"id":669,"title":"第 306 场周赛","title_slug":"weekly-contest-306","start_time":1660444200,"is_ee_exam_contest":null},"questions":[{"question_id":2373,"title":"矩阵中的局部最大值","title_slug":"largest-local-values-in-a-matrix","rating":1331.3935128035,"_hash":3553057842,"paid_only":false},{"question_id":2374,"title":"边积分最高的节点","title_slug":"node-with-highest-edge-score","rating":1418.9758090724,"_hash":1078280786,"paid_only":false},{"question_id":2375,"title":"根据模式串构造最小数字","title_slug":"construct-smallest-number-from-di-string","rating":1641.9424376927,"_hash":2914198967,"paid_only":false},{"question_id":2376,"title":"统计特殊整数","title_slug":"count-special-integers","rating":2120.4466386371,"_hash":4197747162,"paid_only":false}],"company":{}},{"contest":{"id":663,"title":"第 305 场周赛","title_slug":"weekly-contest-305","start_time":1659839400,"is_ee_exam_contest":null},"questions":[{"question_id":2367,"title":"算术三元组的数目","title_slug":"number-of-arithmetic-triplets","rating":1203.0737869081,"_hash":2088822497,"paid_only":false},{"question_id":2368,"title":"受限条件下可到达节点的数目","title_slug":"reachable-nodes-with-restrictions","rating":1476.9118898539,"_hash":4092227797,"paid_only":false},{"question_id":2369,"title":"检查数组是否存在有效划分","title_slug":"check-if-there-is-a-valid-partition-for-the-array","rating":1779.7001728541,"_hash":3555784215,"paid_only":false},{"question_id":2370,"title":"最长理想子序列","title_slug":"longest-ideal-subsequence","rating":1834.868034709,"_hash":3336959867,"paid_only":false}],"company":{}},{"contest":{"id":658,"title":"第 84 场双周赛","title_slug":"biweekly-contest-84","start_time":1659796200,"is_ee_exam_contest":null},"questions":[{"question_id":2363,"title":"合并相似的物品","title_slug":"merge-similar-items","rating":1270.6712381632,"_hash":556825118,"paid_only":false},{"question_id":2364,"title":"统计坏数对的数目","title_slug":"count-number-of-bad-pairs","rating":1622.2389577197,"_hash":809508462,"paid_only":false},{"question_id":2365,"title":"任务调度器 II","title_slug":"task-scheduler-ii","rating":1622.7743864401,"_hash":3978152897,"paid_only":false},{"question_id":2366,"title":"将数组排序的最少替换次数","title_slug":"minimum-replacements-to-sort-the-array","rating":2060.379991517,"_hash":3435556540,"paid_only":false}],"company":{}},{"contest":{"id":659,"title":"第 304 场周赛","title_slug":"weekly-contest-304","start_time":1659234600,"is_ee_exam_contest":null},"questions":[{"question_id":2357,"title":"使数组中所有元素都等于零","title_slug":"make-array-zero-by-subtracting-equal-amounts","rating":1225.3923012413,"_hash":1650421130,"paid_only":false},{"question_id":2358,"title":"分组的最大数量","title_slug":"maximum-number-of-groups-entering-a-competition","rating":1502.5363677723,"_hash":419099305,"paid_only":false},{"question_id":2359,"title":"找到离给定两个节点最近的节点","title_slug":"find-closest-node-to-given-two-nodes","rating":1714.992763701,"_hash":1024461884,"paid_only":false},{"question_id":2360,"title":"图中的最长环","title_slug":"longest-cycle-in-a-graph","rating":1897.1863301576,"_hash":218781353,"paid_only":false}],"company":{}},{"contest":{"id":655,"title":"第 303 场周赛","title_slug":"weekly-contest-303","start_time":1658629800,"is_ee_exam_contest":null},"questions":[{"question_id":2351,"title":"第一个出现两次的字母","title_slug":"first-letter-to-appear-twice","rating":1155.4545579447,"_hash":2515340929,"paid_only":false},{"question_id":2352,"title":"相等行列对","title_slug":"equal-row-and-column-pairs","rating":1286.3841359213,"_hash":80255331,"paid_only":false},{"question_id":2353,"title":"设计食物评分系统","title_slug":"design-a-food-rating-system","rating":1781.8156963676,"_hash":3907541820,"paid_only":false},{"question_id":2354,"title":"优质数对的数目","title_slug":"number-of-excellent-pairs","rating":2075.9046975409,"_hash":3803787289,"paid_only":false}],"company":{}},{"contest":{"id":652,"title":"第 83 场双周赛","title_slug":"biweekly-contest-83","start_time":1658586600,"is_ee_exam_contest":null},"questions":[{"question_id":2347,"title":"最好的扑克手牌","title_slug":"best-poker-hand","rating":1241.5645130241,"_hash":3960620247,"paid_only":false},{"question_id":2348,"title":"全 0 子数组的数目","title_slug":"number-of-zero-filled-subarrays","rating":1315.8569286597,"_hash":1385231803,"paid_only":false},{"question_id":2349,"title":"设计数字容器系统","title_slug":"design-a-number-container-system","rating":1540.2351411176,"_hash":2500271603,"paid_only":false},{"question_id":2350,"title":"不可能得到的最短骰子序列","title_slug":"shortest-impossible-sequence-of-rolls","rating":1960.5763266754,"_hash":3898582486,"paid_only":false}],"company":{}},{"contest":{"id":653,"title":"第 302 场周赛","title_slug":"weekly-contest-302","start_time":1658025000,"is_ee_exam_contest":null},"questions":[{"question_id":2341,"title":"数组能形成多少数对","title_slug":"maximum-number-of-pairs-in-array","rating":1184.795721284,"_hash":2572867035,"paid_only":false},{"question_id":2342,"title":"数位和相等数对的最大和","title_slug":"max-sum-of-a-pair-with-equal-sum-of-digits","rating":1308.9617729374,"_hash":2147986859,"paid_only":false},{"question_id":2343,"title":"裁剪数字后查询第 K 小的数字","title_slug":"query-kth-smallest-trimmed-number","rating":1651.569267834,"_hash":3981013694,"paid_only":false},{"question_id":2344,"title":"使数组可以被整除的最少删除次数","title_slug":"minimum-deletions-to-make-array-divisible","rating":1640.8976042503,"_hash":1620091732,"paid_only":false}],"company":{}},{"contest":{"id":649,"title":"第 301 场周赛","title_slug":"weekly-contest-301","start_time":1657420200,"is_ee_exam_contest":null},"questions":[{"question_id":2335,"title":"装满杯子需要的最短总时长","title_slug":"minimum-amount-of-time-to-fill-cups","rating":1360.421258727,"_hash":2855675520,"paid_only":false},{"question_id":2336,"title":"无限集中的最小数字","title_slug":"smallest-number-in-infinite-set","rating":1375.0376362104,"_hash":1742391300,"paid_only":false},{"question_id":2337,"title":"移动片段得到字符串","title_slug":"move-pieces-to-obtain-a-string","rating":1693.4495728383,"_hash":255657392,"paid_only":false},{"question_id":2338,"title":"统计理想数组的数目","title_slug":"count-the-number-of-ideal-arrays","rating":2615.1468269481,"_hash":2648057035,"paid_only":false}],"company":{}},{"contest":{"id":646,"title":"第 82 场双周赛","title_slug":"biweekly-contest-82","start_time":1657377000,"is_ee_exam_contest":null},"questions":[{"question_id":2331,"title":"计算布尔二叉树的值","title_slug":"evaluate-boolean-binary-tree","rating":1303.5594588137,"_hash":586474794,"paid_only":false},{"question_id":2332,"title":"坐上公交的最晚时间","title_slug":"the-latest-time-to-catch-a-bus","rating":1840.9122452886,"_hash":572276699,"paid_only":false},{"question_id":2333,"title":"最小差值平方和","title_slug":"minimum-sum-of-squared-difference","rating":2011.0496162515,"_hash":374180471,"paid_only":false},{"question_id":2334,"title":"元素值大于变化阈值的子数组","title_slug":"subarray-with-elements-greater-than-varying-threshold","rating":2381.2160234811,"_hash":265213405,"paid_only":false}],"company":{}},{"contest":{"id":647,"title":"第 300 场周赛","title_slug":"weekly-contest-300","start_time":1656815400,"is_ee_exam_contest":null},"questions":[{"question_id":2325,"title":"解密消息","title_slug":"decode-the-message","rating":1268.0287696194,"_hash":280396343,"paid_only":false},{"question_id":2326,"title":"螺旋矩阵 IV","title_slug":"spiral-matrix-iv","rating":1421.7251191403,"_hash":1599758478,"paid_only":false},{"question_id":2327,"title":"知道秘密的人数","title_slug":"number-of-people-aware-of-a-secret","rating":1893.5143805402,"_hash":1370775302,"paid_only":false},{"question_id":2328,"title":"网格图中递增路径的数目","title_slug":"number-of-increasing-paths-in-a-grid","rating":2001.2074132383,"_hash":2560027362,"paid_only":false}],"company":{}},{"contest":{"id":618,"title":"第 299 场周赛","title_slug":"weekly-contest-299","start_time":1656210600,"is_ee_exam_contest":null},"questions":[{"question_id":2319,"title":"判断矩阵是否是一个 X 矩阵","title_slug":"check-if-matrix-is-x-matrix","rating":1200.9464053417,"_hash":3722557865,"paid_only":false},{"question_id":2320,"title":"统计放置房子的方式数","title_slug":"count-number-of-ways-to-place-houses","rating":1607.7036437819,"_hash":2375816517,"paid_only":false},{"question_id":2321,"title":"拼接数组的最大分数","title_slug":"maximum-score-of-spliced-array","rating":1790.5747006625,"_hash":3565117549,"paid_only":false},{"question_id":2322,"title":"从树中删除边的最小分数","title_slug":"minimum-score-after-removals-on-a-tree","rating":2391.657270733,"_hash":2618637580,"paid_only":false}],"company":{}},{"contest":{"id":614,"title":"第 81 场双周赛","title_slug":"biweekly-contest-81","start_time":1656167400,"is_ee_exam_contest":null},"questions":[{"question_id":2315,"title":"统计星号","title_slug":"count-asterisks","rating":1250.8974254752,"_hash":963523596,"paid_only":false},{"question_id":2316,"title":"统计无向图中无法互相到达点对数","title_slug":"count-unreachable-pairs-of-nodes-in-an-undirected-graph","rating":1604.0695445163,"_hash":3627963576,"paid_only":false},{"question_id":2317,"title":"操作后的最大异或和","title_slug":"maximum-xor-after-operations","rating":1678.6241816708,"_hash":1137942707,"paid_only":false},{"question_id":2318,"title":"不同骰子序列的数目","title_slug":"number-of-distinct-roll-sequences","rating":2090.4183788498,"_hash":3973609032,"paid_only":false}],"company":{}},{"contest":{"id":615,"title":"第 298 场周赛","title_slug":"weekly-contest-298","start_time":1655605800,"is_ee_exam_contest":null},"questions":[{"question_id":2309,"title":"兼具大小写的最好英文字母","title_slug":"greatest-english-letter-in-upper-and-lower-case","rating":1242.8939284628,"_hash":1610031866,"paid_only":false},{"question_id":2310,"title":"个位数字为 K 的整数之和","title_slug":"sum-of-numbers-with-units-digit-k","rating":1558.9522968448,"_hash":3729897578,"paid_only":false},{"question_id":2311,"title":"小于等于 K 的最长二进制子序列","title_slug":"longest-binary-subsequence-less-than-or-equal-to-k","rating":1839.9203623221,"_hash":1903617238,"paid_only":false},{"question_id":2312,"title":"卖木头块","title_slug":"selling-pieces-of-wood","rating":2363.0240184484,"_hash":915449177,"paid_only":false}],"company":{}},{"contest":{"id":611,"title":"第 297 场周赛","title_slug":"weekly-contest-297","start_time":1655001000,"is_ee_exam_contest":null},"questions":[{"question_id":2303,"title":"计算应缴税款总额","title_slug":"calculate-amount-paid-in-taxes","rating":1283.6412252736,"_hash":4065089853,"paid_only":false},{"question_id":2304,"title":"网格中的最小路径代价","title_slug":"minimum-path-cost-in-a-grid","rating":1658.3530344788,"_hash":730943544,"paid_only":false},{"question_id":2305,"title":"公平分发饼干","title_slug":"fair-distribution-of-cookies","rating":1886.7040111218,"_hash":3444975876,"paid_only":false},{"question_id":2306,"title":"公司命名","title_slug":"naming-a-company","rating":2305.4498281454,"_hash":3802076349,"paid_only":false}],"company":{}},{"contest":{"id":608,"title":"第 80 场双周赛","title_slug":"biweekly-contest-80","start_time":1654957800,"is_ee_exam_contest":null},"questions":[{"question_id":2299,"title":"强密码检验器 II","title_slug":"strong-password-checker-ii","rating":1241.5396695569,"_hash":2569057399,"paid_only":false},{"question_id":2300,"title":"咒语和药水的成功对数","title_slug":"successful-pairs-of-spells-and-potions","rating":1476.9062320302,"_hash":4067072856,"paid_only":false},{"question_id":2301,"title":"替换字符后匹配","title_slug":"match-substring-after-replacement","rating":1860.5166780235,"_hash":2777743854,"paid_only":false},{"question_id":2302,"title":"统计得分小于 K 的子数组数目","title_slug":"count-subarrays-with-score-less-than-k","rating":1808.3407696613,"_hash":1464742605,"paid_only":false}],"company":{}},{"contest":{"id":609,"title":"第 296 场周赛","title_slug":"weekly-contest-296","start_time":1654396200,"is_ee_exam_contest":null},"questions":[{"question_id":2293,"title":"极大极小游戏","title_slug":"min-max-game","rating":1241.0825147417,"_hash":399050701,"paid_only":false},{"question_id":2294,"title":"划分数组使最大差为 K","title_slug":"partition-array-such-that-maximum-difference-is-k","rating":1416.4124723866,"_hash":3430688223,"paid_only":false},{"question_id":2295,"title":"替换数组中的元素","title_slug":"replace-elements-in-an-array","rating":1445.1422945604,"_hash":4058134239,"paid_only":false},{"question_id":2296,"title":"设计一个文本编辑器","title_slug":"design-a-text-editor","rating":1911.8282317986,"_hash":536229655,"paid_only":false}],"company":{}},{"contest":{"id":605,"title":"第 295 场周赛","title_slug":"weekly-contest-295","start_time":1653791400,"is_ee_exam_contest":null},"questions":[{"question_id":2287,"title":"重排字符形成目标字符串","title_slug":"rearrange-characters-to-make-target-string","rating":1299.8393735643,"_hash":4027356240,"paid_only":false},{"question_id":2288,"title":"价格减免","title_slug":"apply-discount-to-prices","rating":1577.1141767118,"_hash":1512857430,"paid_only":false},{"question_id":2289,"title":"使数组按非递减顺序排列","title_slug":"steps-to-make-array-non-decreasing","rating":2481.8722909195,"_hash":188352287,"paid_only":false},{"question_id":2290,"title":"到达角落需要移除障碍物的最小数目","title_slug":"minimum-obstacle-removal-to-reach-corner","rating":2137.5633267453,"_hash":4050014828,"paid_only":false}],"company":{}},{"contest":{"id":598,"title":"第 79 场双周赛","title_slug":"biweekly-contest-79","start_time":1653748200,"is_ee_exam_contest":null},"questions":[{"question_id":2283,"title":"判断一个数的数字计数是否等于数位的值","title_slug":"check-if-number-has-equal-digit-count-and-digit-value","rating":1253.4847783954,"_hash":84450131,"paid_only":false},{"question_id":2284,"title":"最多单词数的发件人","title_slug":"sender-with-largest-word-count","rating":1346.9594471871,"_hash":2321482871,"paid_only":false},{"question_id":2285,"title":"道路的最大总重要性","title_slug":"maximum-total-importance-of-roads","rating":1496.2502937005,"_hash":3248412457,"paid_only":false},{"question_id":2286,"title":"以组为单位订音乐会的门票","title_slug":"booking-concert-tickets-in-groups","rating":2470.2118194809,"_hash":3907062892,"paid_only":false}],"company":{}},{"contest":{"id":599,"title":"第 294 场周赛","title_slug":"weekly-contest-294","start_time":1653186600,"is_ee_exam_contest":null},"questions":[{"question_id":2278,"title":"字母在字符串中的百分比","title_slug":"percentage-of-letter-in-string","rating":1161.8236318927,"_hash":2452001178,"paid_only":false},{"question_id":2279,"title":"装满石头的背包的最大数量","title_slug":"maximum-bags-with-full-capacity-of-rocks","rating":1249.2572200035,"_hash":2055099648,"paid_only":false},{"question_id":2280,"title":"表示一个折线图的最少线段数","title_slug":"minimum-lines-to-represent-a-line-chart","rating":1680.866917849,"_hash":1538966566,"paid_only":false},{"question_id":2281,"title":"巫师的总力量和","title_slug":"sum-of-total-strength-of-wizards","rating":2621.1208072273,"_hash":3147772108,"paid_only":false}],"company":{}},{"contest":{"id":593,"title":"第 293 场周赛","title_slug":"weekly-contest-293","start_time":1652581800,"is_ee_exam_contest":null},"questions":[{"question_id":2273,"title":"移除字母异位词后的结果数组","title_slug":"find-resultant-array-after-removing-anagrams","rating":1294.5800368625,"_hash":3731391427,"paid_only":false},{"question_id":2274,"title":"不含特殊楼层的最大连续楼层数","title_slug":"maximum-consecutive-floors-without-special-floors","rating":1332.6187879411,"_hash":3382549811,"paid_only":false},{"question_id":2275,"title":"按位与结果大于零的最长组合","title_slug":"largest-combination-with-bitwise-and-greater-than-zero","rating":1642.1446933109,"_hash":1729291424,"paid_only":false},{"question_id":2276,"title":"统计区间中的整数数目","title_slug":"count-integers-in-intervals","rating":2222.4805422748,"_hash":113811987,"paid_only":false}],"company":{}},{"contest":{"id":590,"title":"第 78 场双周赛","title_slug":"biweekly-contest-78","start_time":1652538600,"is_ee_exam_contest":null},"questions":[{"question_id":2269,"title":"找到一个数字的 K 美丽值","title_slug":"find-the-k-beauty-of-a-number","rating":1279.7894769956,"_hash":2811209697,"paid_only":false},{"question_id":2270,"title":"分割数组的方案数","title_slug":"number-of-ways-to-split-array","rating":1334.0516779626,"_hash":3778209816,"paid_only":false},{"question_id":2271,"title":"毯子覆盖的最多白色砖块数","title_slug":"maximum-white-tiles-covered-by-a-carpet","rating":2021.7790710467,"_hash":1450266090,"paid_only":false},{"question_id":2272,"title":"最大波动的子字符串","title_slug":"substring-with-largest-variance","rating":2515.7520586008,"_hash":928331770,"paid_only":false}],"company":{}},{"contest":{"id":591,"title":"第 292 场周赛","title_slug":"weekly-contest-292","start_time":1651977000,"is_ee_exam_contest":null},"questions":[{"question_id":2264,"title":"字符串中最大的 3 位相同数字","title_slug":"largest-3-same-digit-number-in-string","rating":1308.948547975,"_hash":1507774284,"paid_only":false},{"question_id":2265,"title":"统计值等于子树平均值的节点数","title_slug":"count-nodes-equal-to-average-of-subtree","rating":1472.7864965062,"_hash":2311001320,"paid_only":false},{"question_id":2266,"title":"统计打字方案数","title_slug":"count-number-of-texts","rating":1856.8610192187,"_hash":590592305,"paid_only":false},{"question_id":2267,"title":"检查是否有合法括号字符串路径","title_slug":"check-if-there-is-a-valid-parentheses-string-path","rating":2084.5752686737,"_hash":1017177635,"paid_only":false}],"company":{}},{"contest":{"id":587,"title":"第 291 场周赛","title_slug":"weekly-contest-291","start_time":1651372200,"is_ee_exam_contest":null},"questions":[{"question_id":2259,"title":"移除指定数字得到的最大结果","title_slug":"remove-digit-from-number-to-maximize-result","rating":1331.5287857686,"_hash":670957801,"paid_only":false},{"question_id":2260,"title":"必须拿起的最小连续卡牌数","title_slug":"minimum-consecutive-cards-to-pick-up","rating":1364.6787168645,"_hash":2520941920,"paid_only":false},{"question_id":2261,"title":"含最多 K 个可整除元素的子数组","title_slug":"k-divisible-elements-subarrays","rating":1724.394164934,"_hash":2169721379,"paid_only":false},{"question_id":2262,"title":"字符串的总引力","title_slug":"total-appeal-of-a-string","rating":2033.1699277531,"_hash":3802833057,"paid_only":false}],"company":{}},{"contest":{"id":581,"title":"第 77 场双周赛","title_slug":"biweekly-contest-77","start_time":1651329000,"is_ee_exam_contest":null},"questions":[{"question_id":2255,"title":"统计是给定字符串前缀的字符串数目","title_slug":"count-prefixes-of-a-given-string","rating":1260.870208308,"_hash":255204169,"paid_only":false},{"question_id":2256,"title":"最小平均差","title_slug":"minimum-average-difference","rating":1394.9149882274,"_hash":4108118731,"paid_only":false},{"question_id":2257,"title":"统计网格图中没有被保卫的格子数","title_slug":"count-unguarded-cells-in-the-grid","rating":1708.7056764058,"_hash":2771270445,"paid_only":false},{"question_id":2258,"title":"逃离火灾","title_slug":"escape-the-spreading-fire","rating":2346.5717839654,"_hash":315307043,"paid_only":false}],"company":{}},{"contest":{"id":582,"title":"第 290 场周赛","title_slug":"weekly-contest-290","start_time":1650767400,"is_ee_exam_contest":null},"questions":[{"question_id":2248,"title":"多个数组求交集","title_slug":"intersection-of-multiple-arrays","rating":1264.4778916192,"_hash":305518406,"paid_only":false},{"question_id":2249,"title":"统计圆内格点数目","title_slug":"count-lattice-points-inside-a-circle","rating":1602.7242171967,"_hash":2887915717,"paid_only":false},{"question_id":2250,"title":"统计包含每个点的矩形数目","title_slug":"count-number-of-rectangles-containing-each-point","rating":1997.7013718153,"_hash":1075971933,"paid_only":false},{"question_id":2251,"title":"花期内花的数目","title_slug":"number-of-flowers-in-full-bloom","rating":2022.3137128296,"_hash":251006919,"paid_only":false}],"company":{}},{"contest":{"id":576,"title":"第 289 场周赛","title_slug":"weekly-contest-289","start_time":1650162600,"is_ee_exam_contest":null},"questions":[{"question_id":2243,"title":"计算字符串的数字和","title_slug":"calculate-digit-sum-of-a-string","rating":1301.9432665133,"_hash":1615798591,"paid_only":false},{"question_id":2244,"title":"完成所有任务需要的最少轮数","title_slug":"minimum-rounds-to-complete-all-tasks","rating":1371.8092952004,"_hash":2786999216,"paid_only":false},{"question_id":2245,"title":"转角路径的乘积中最多能有几个尾随零","title_slug":"maximum-trailing-zeros-in-a-cornered-path","rating":2036.7410194704,"_hash":2369761961,"paid_only":false},{"question_id":2246,"title":"相邻字符不同的最长路径","title_slug":"longest-path-with-different-adjacent-characters","rating":2126.3922279277,"_hash":1523645158,"paid_only":false}],"company":{}},{"contest":{"id":572,"title":"第 76 场双周赛","title_slug":"biweekly-contest-76","start_time":1650119400,"is_ee_exam_contest":null},"questions":[{"question_id":2239,"title":"找到最接近 0 的数字","title_slug":"find-closest-number-to-zero","rating":1256.0514740971,"_hash":334656901,"paid_only":false},{"question_id":2240,"title":"买钢笔和铅笔的方案数","title_slug":"number-of-ways-to-buy-pens-and-pencils","rating":1399.8468905274,"_hash":534082096,"paid_only":false},{"question_id":2241,"title":"设计一个 ATM 机器","title_slug":"design-an-atm-machine","rating":1616.2067360638,"_hash":4007529944,"paid_only":false},{"question_id":2242,"title":"节点序列的最大得分","title_slug":"maximum-score-of-a-node-sequence","rating":2304.3094138939,"_hash":949381873,"paid_only":false}],"company":{}},{"contest":{"id":573,"title":"第 288 场周赛","title_slug":"weekly-contest-288","start_time":1649557800,"is_ee_exam_contest":null},"questions":[{"question_id":2231,"title":"按奇偶性交换后的最大数字","title_slug":"largest-number-after-digit-swaps-by-parity","rating":1365.2269076492,"_hash":2192706389,"paid_only":false},{"question_id":2232,"title":"向表达式添加括号后的最小结果","title_slug":"minimize-result-by-adding-parentheses-to-expression","rating":1611.8434720083,"_hash":989456575,"paid_only":false},{"question_id":2233,"title":"K 次增加后的最大乘积","title_slug":"maximum-product-after-k-increments","rating":1685.5389350949,"_hash":1255527945,"paid_only":false},{"question_id":2234,"title":"花园的最大总美丽值","title_slug":"maximum-total-beauty-of-the-gardens","rating":2561.508149216,"_hash":2719330296,"paid_only":false}],"company":{}},{"contest":{"id":569,"title":"第 287 场周赛","title_slug":"weekly-contest-287","start_time":1648953000,"is_ee_exam_contest":null},"questions":[{"question_id":2224,"title":"转化时间需要的最少操作数","title_slug":"minimum-number-of-operations-to-convert-time","rating":1295.8868965907,"_hash":1749795074,"paid_only":false},{"question_id":2225,"title":"找出输掉零场或一场比赛的玩家","title_slug":"find-players-with-zero-or-one-losses","rating":1316.2046992429,"_hash":1737726232,"paid_only":false},{"question_id":2226,"title":"每个小孩最多能分到多少糖果","title_slug":"maximum-candies-allocated-to-k-children","rating":1646.1765343383,"_hash":2412340751,"paid_only":false},{"question_id":2227,"title":"加密解密字符串","title_slug":"encrypt-and-decrypt-strings","rating":1944.5673996888,"_hash":4089321877,"paid_only":false}],"company":{}},{"contest":{"id":563,"title":"第 75 场双周赛","title_slug":"biweekly-contest-75","start_time":1648909800,"is_ee_exam_contest":null},"questions":[{"question_id":2220,"title":"转换数字的最少位翻转次数","title_slug":"minimum-bit-flips-to-convert-number","rating":1282.1502428906,"_hash":3126153106,"paid_only":false},{"question_id":2221,"title":"数组的三角和","title_slug":"find-triangular-sum-of-an-array","rating":1317.2976846981,"_hash":1783870964,"paid_only":false},{"question_id":2222,"title":"选择建筑的方案数","title_slug":"number-of-ways-to-select-buildings","rating":1656.5588918365,"_hash":469490796,"paid_only":false},{"question_id":2223,"title":"构造字符串的总得分和","title_slug":"sum-of-scores-of-built-strings","rating":2220.0903365738,"_hash":2248507270,"paid_only":false}],"company":{}},{"contest":{"id":564,"title":"第 286 场周赛","title_slug":"weekly-contest-286","start_time":1648348200,"is_ee_exam_contest":null},"questions":[{"question_id":2215,"title":"找出两数组的不同","title_slug":"find-the-difference-of-two-arrays","rating":1207.748239075,"_hash":1409344146,"paid_only":false},{"question_id":2216,"title":"美化数组的最少删除数","title_slug":"minimum-deletions-to-make-array-beautiful","rating":1509.5562928491,"_hash":705189000,"paid_only":false},{"question_id":2217,"title":"找到指定长度的回文数","title_slug":"find-palindrome-with-fixed-length","rating":1822.1301265412,"_hash":2265657217,"paid_only":false},{"question_id":2218,"title":"从栈中取出 K 个硬币的最大面值和","title_slug":"maximum-value-of-k-coins-from-piles","rating":2157.5814371481,"_hash":28373825,"paid_only":false}],"company":{}},{"contest":{"id":558,"title":"第 285 场周赛","title_slug":"weekly-contest-285","start_time":1647743400,"is_ee_exam_contest":null},"questions":[{"question_id":2210,"title":"统计数组中峰和谷的数量","title_slug":"count-hills-and-valleys-in-an-array","rating":1354.5231125217,"_hash":2390584088,"paid_only":false},{"question_id":2211,"title":"统计道路上的碰撞次数","title_slug":"count-collisions-on-a-road","rating":1581.4963716166,"_hash":1582953363,"paid_only":false},{"question_id":2212,"title":"射箭比赛中的最大得分","title_slug":"maximum-points-in-an-archery-competition","rating":1868.9864493463,"_hash":2155229246,"paid_only":false},{"question_id":2213,"title":"由单个字符重复的最长子字符串","title_slug":"longest-substring-of-one-repeating-character","rating":2628.7957821141,"_hash":96141044,"paid_only":false}],"company":{}},{"contest":{"id":554,"title":"第 74 场双周赛","title_slug":"biweekly-contest-74","start_time":1647700200,"is_ee_exam_contest":null},"questions":[{"question_id":2206,"title":"将数组划分成相等数对","title_slug":"divide-array-into-equal-pairs","rating":1223.406570396,"_hash":523951328,"paid_only":false},{"question_id":2207,"title":"字符串中最多数目的子序列","title_slug":"maximize-number-of-subsequences-in-a-string","rating":1550.4297615307,"_hash":2887492330,"paid_only":false},{"question_id":2208,"title":"将数组和减半的最少操作次数","title_slug":"minimum-operations-to-halve-array-sum","rating":1550.0978082682,"_hash":3403473925,"paid_only":false},{"question_id":2209,"title":"用地毯覆盖后的最少白色砖块","title_slug":"minimum-white-tiles-after-covering-with-carpets","rating":2105.8582288624,"_hash":3822669184,"paid_only":false}],"company":{}},{"contest":{"id":555,"title":"第 284 场周赛","title_slug":"weekly-contest-284","start_time":1647138600,"is_ee_exam_contest":null},"questions":[{"question_id":2200,"title":"找出数组中的所有 K 近邻下标","title_slug":"find-all-k-distant-indices-in-an-array","rating":1266.341468955,"_hash":2550811240,"paid_only":false},{"question_id":2201,"title":"统计可以提取的工件","title_slug":"count-artifacts-that-can-be-extracted","rating":1525.2146106195,"_hash":1716625654,"paid_only":false},{"question_id":2202,"title":"K 次操作后最大化顶端元素","title_slug":"maximize-the-topmost-element-after-k-moves","rating":1716.9721777,"_hash":927068521,"paid_only":false},{"question_id":2203,"title":"得到要求路径的最小带权子图","title_slug":"minimum-weighted-subgraph-with-the-required-paths","rating":2364.3455634374,"_hash":237326824,"paid_only":false}],"company":{}},{"contest":{"id":551,"title":"第 283 场周赛","title_slug":"weekly-contest-283","start_time":1646533800,"is_ee_exam_contest":null},"questions":[{"question_id":2194,"title":"Excel 表中某个范围内的单元格","title_slug":"cells-in-a-range-on-an-excel-sheet","rating":1253.1463945043,"_hash":1475483634,"paid_only":false},{"question_id":2195,"title":"向数组中追加 K 个整数","title_slug":"append-k-integers-with-minimal-sum","rating":1658.921022733,"_hash":430788454,"paid_only":false},{"question_id":2196,"title":"根据描述创建二叉树","title_slug":"create-binary-tree-from-descriptions","rating":1643.5283095007,"_hash":4088708677,"paid_only":false},{"question_id":2197,"title":"替换数组中的非互质数","title_slug":"replace-non-coprime-numbers-in-array","rating":2057.4788263111,"_hash":2370755498,"paid_only":false}],"company":{}},{"contest":{"id":545,"title":"第 73 场双周赛","title_slug":"biweekly-contest-73","start_time":1646490600,"is_ee_exam_contest":null},"questions":[{"question_id":2190,"title":"数组中紧跟 key 之后出现最频繁的数字","title_slug":"most-frequent-number-following-key-in-an-array","rating":1289.1912178611,"_hash":3999582587,"paid_only":false},{"question_id":2191,"title":"将杂乱无章的数字排序","title_slug":"sort-the-jumbled-numbers","rating":1496.1462748679,"_hash":2695613806,"paid_only":false},{"question_id":2192,"title":"有向无环图中一个节点的所有祖先","title_slug":"all-ancestors-of-a-node-in-a-directed-acyclic-graph","rating":1787.8550568757,"_hash":1095929141,"paid_only":false},{"question_id":2193,"title":"得到回文串的最少操作次数","title_slug":"minimum-number-of-moves-to-make-palindrome","rating":2090.6800569319,"_hash":4275612953,"paid_only":false}],"company":{}},{"contest":{"id":546,"title":"第 282 场周赛","title_slug":"weekly-contest-282","start_time":1645929000,"is_ee_exam_contest":null},"questions":[{"question_id":2185,"title":"统计包含给定前缀的字符串","title_slug":"counting-words-with-a-given-prefix","rating":1167.1241589729,"_hash":537971944,"paid_only":false},{"question_id":2186,"title":"制造字母异位词的最小步骤数 II","title_slug":"minimum-number-of-steps-to-make-two-strings-anagram-ii","rating":1253.1107481745,"_hash":1067400091,"paid_only":false},{"question_id":2187,"title":"完成旅途的最少时间","title_slug":"minimum-time-to-complete-trips","rating":1640.9591585343,"_hash":306595116,"paid_only":false},{"question_id":2188,"title":"完成比赛的最少时间","title_slug":"minimum-time-to-finish-the-race","rating":2315.0547336936,"_hash":1723985703,"paid_only":false}],"company":{}},{"contest":{"id":542,"title":"第 281 场周赛","title_slug":"weekly-contest-281","start_time":1645324200,"is_ee_exam_contest":null},"questions":[{"question_id":2180,"title":"统计各位数字之和为偶数的整数个数","title_slug":"count-integers-with-even-digit-sum","rating":1257.1166915286,"_hash":267587420,"paid_only":false},{"question_id":2181,"title":"合并零之间的节点","title_slug":"merge-nodes-in-between-zeros","rating":1333.192050397,"_hash":1770113758,"paid_only":false},{"question_id":2182,"title":"构造限制重复的字符串","title_slug":"construct-string-with-repeat-limit","rating":1680.1353258588,"_hash":1950501535,"paid_only":false},{"question_id":2183,"title":"统计可以被 K 整除的下标对数目","title_slug":"count-array-pairs-divisible-by-k","rating":2246.0452639352,"_hash":1351132676,"paid_only":false}],"company":{}},{"contest":{"id":539,"title":"第 72 场双周赛","title_slug":"biweekly-contest-72","start_time":1645281000,"is_ee_exam_contest":null},"questions":[{"question_id":2176,"title":"统计数组中相等且可以被整除的数对","title_slug":"count-equal-and-divisible-pairs-in-an-array","rating":1215.7827321325,"_hash":3400286463,"paid_only":false},{"question_id":2177,"title":"找到和为给定整数的三个连续整数","title_slug":"find-three-consecutive-integers-that-sum-to-a-given-number","rating":1257.1556875655,"_hash":177009894,"paid_only":false},{"question_id":2178,"title":"拆分成最多数目的正偶数之和","title_slug":"maximum-split-of-positive-even-integers","rating":1538.233149704,"_hash":3655265099,"paid_only":false},{"question_id":2179,"title":"统计数组中好三元组数目","title_slug":"count-good-triplets-in-an-array","rating":2272.4412003208,"_hash":286585708,"paid_only":false}],"company":{}},{"contest":{"id":540,"title":"第 280 场周赛","title_slug":"weekly-contest-280","start_time":1644719400,"is_ee_exam_contest":null},"questions":[{"question_id":2169,"title":"得到 0 的操作数","title_slug":"count-operations-to-obtain-zero","rating":1199.8592887103,"_hash":3445184694,"paid_only":false},{"question_id":2170,"title":"使数组变成交替数组的最少操作数","title_slug":"minimum-operations-to-make-the-array-alternating","rating":1662.6673692545,"_hash":884144873,"paid_only":false},{"question_id":2171,"title":"拿出最少数目的魔法豆","title_slug":"removing-minimum-number-of-magic-beans","rating":1748.1339100823,"_hash":2260151323,"paid_only":false},{"question_id":2172,"title":"数组的最大与和","title_slug":"maximum-and-sum-of-array","rating":2392.0799451298,"_hash":284708083,"paid_only":false}],"company":{}},{"contest":{"id":536,"title":"第 279 场周赛","title_slug":"weekly-contest-279","start_time":1644114600,"is_ee_exam_contest":null},"questions":[{"question_id":2164,"title":"对奇偶下标分别排序","title_slug":"sort-even-and-odd-indices-independently","rating":1252.8406166148,"_hash":618419204,"paid_only":false},{"question_id":2165,"title":"重排数字的最小值","title_slug":"smallest-value-of-the-rearranged-number","rating":1361.5824742947,"_hash":2369389100,"paid_only":false},{"question_id":2166,"title":"设计位集","title_slug":"design-bitset","rating":1751.5101577001,"_hash":2504097527,"paid_only":false},{"question_id":2167,"title":"移除所有载有违禁货物车厢所需的最少时间","title_slug":"minimum-time-to-remove-all-cars-containing-illegal-goods","rating":2219.3465296423,"_hash":2598780139,"paid_only":false}],"company":{}},{"contest":{"id":533,"title":"第 71 场双周赛","title_slug":"biweekly-contest-71","start_time":1644071400,"is_ee_exam_contest":null},"questions":[{"question_id":2160,"title":"拆分数位后四位数字的最小和","title_slug":"minimum-sum-of-four-digit-number-after-splitting-digits","rating":1314.2912238536,"_hash":3696757985,"paid_only":false},{"question_id":2161,"title":"根据给定数字划分数组","title_slug":"partition-array-according-to-given-pivot","rating":1337.6115578703,"_hash":290394387,"paid_only":false},{"question_id":2162,"title":"设置时间的最少代价","title_slug":"minimum-cost-to-set-cooking-time","rating":1851.7255023016,"_hash":248789391,"paid_only":false},{"question_id":2163,"title":"删除元素后和的最小差值","title_slug":"minimum-difference-in-sums-after-removal-of-elements","rating":2225.3877535768,"_hash":2967621636,"paid_only":false}],"company":{}},{"contest":{"id":534,"title":"第 278 场周赛","title_slug":"weekly-contest-278","start_time":1643509800,"is_ee_exam_contest":null},"questions":[{"question_id":2154,"title":"将找到的值乘以 2","title_slug":"keep-multiplying-found-values-by-two","rating":1235.8413685224,"_hash":103871786,"paid_only":false},{"question_id":2155,"title":"分组得分最高的所有下标","title_slug":"all-divisions-with-the-highest-score-of-a-binary-array","rating":1390.5023027273,"_hash":1507011086,"paid_only":false},{"question_id":2156,"title":"查找给定哈希值的子串","title_slug":"find-substring-with-given-hash-value","rating":2062.9876807625,"_hash":3801430886,"paid_only":false},{"question_id":2157,"title":"字符串分组","title_slug":"groups-of-strings","rating":2499.3282271507,"_hash":713625410,"paid_only":false}],"company":{}},{"contest":{"id":530,"title":"第 277 场周赛","title_slug":"weekly-contest-277","start_time":1642905000,"is_ee_exam_contest":null},"questions":[{"question_id":2148,"title":"元素计数","title_slug":"count-elements-with-strictly-smaller-and-greater-elements","rating":1201.8730954169,"_hash":1449021558,"paid_only":false},{"question_id":2149,"title":"按符号重排数组","title_slug":"rearrange-array-elements-by-sign","rating":1235.9216009709,"_hash":3029042062,"paid_only":false},{"question_id":2150,"title":"找出数组中的所有孤独数字","title_slug":"find-all-lonely-numbers-in-the-array","rating":1275.6108152653,"_hash":3672640831,"paid_only":false},{"question_id":2151,"title":"基于陈述统计最多好人数","title_slug":"maximum-good-people-based-on-statements","rating":1979.9454101467,"_hash":2347660974,"paid_only":false}],"company":{}},{"contest":{"id":527,"title":"第 70 场双周赛","title_slug":"biweekly-contest-70","start_time":1642861800,"is_ee_exam_contest":null},"questions":[{"question_id":2144,"title":"打折购买糖果的最小开销","title_slug":"minimum-cost-of-buying-candies-with-discount","rating":1260.9112824221,"_hash":1962595835,"paid_only":false},{"question_id":2145,"title":"统计隐藏数组数目","title_slug":"count-the-hidden-sequences","rating":1614.4877804672,"_hash":2108728330,"paid_only":false},{"question_id":2146,"title":"价格范围内最高排名的 K 样物品","title_slug":"k-highest-ranked-items-within-a-price-range","rating":1836.5345744332,"_hash":3957965518,"paid_only":false},{"question_id":2147,"title":"分隔长廊的方案数","title_slug":"number-of-ways-to-divide-a-long-corridor","rating":1914.6717285348,"_hash":4014976365,"paid_only":false}],"company":{}},{"contest":{"id":528,"title":"第 276 场周赛","title_slug":"weekly-contest-276","start_time":1642300200,"is_ee_exam_contest":null},"questions":[{"question_id":2138,"title":"将字符串拆分为若干长度为 k 的组","title_slug":"divide-a-string-into-groups-of-size-k","rating":1273.046473797,"_hash":3830405744,"paid_only":false},{"question_id":2139,"title":"得到目标值的最少行动次数","title_slug":"minimum-moves-to-reach-target-score","rating":1417.3934930077,"_hash":2135327933,"paid_only":false},{"question_id":2140,"title":"解决智力问题","title_slug":"solving-questions-with-brainpower","rating":1709.1054732427,"_hash":3742724136,"paid_only":false},{"question_id":2141,"title":"同时运行 N 台电脑的最长时间","title_slug":"maximum-running-time-of-n-computers","rating":2265.2118886972,"_hash":364057867,"paid_only":false}],"company":{}},{"contest":{"id":524,"title":"第 275 场周赛","title_slug":"weekly-contest-275","start_time":1641695400,"is_ee_exam_contest":null},"questions":[{"question_id":2133,"title":"检查是否每一行每一列都包含全部整数","title_slug":"check-if-every-row-and-column-contains-all-numbers","rating":1264.2868345638,"_hash":3243872254,"paid_only":false},{"question_id":2134,"title":"最少交换次数来组合所有的 1 II","title_slug":"minimum-swaps-to-group-all-1s-together-ii","rating":1748.4522689101,"_hash":107547857,"paid_only":false},{"question_id":2135,"title":"统计追加字母可以获得的单词数","title_slug":"count-words-obtained-after-adding-a-letter","rating":1828.2700238306,"_hash":1363331011,"paid_only":false},{"question_id":2136,"title":"全部开花的最早一天","title_slug":"earliest-possible-day-of-full-bloom","rating":2033.4597721985,"_hash":1189152973,"paid_only":false}],"company":{}},{"contest":{"id":521,"title":"第 69 场双周赛","title_slug":"biweekly-contest-69","start_time":1641652200,"is_ee_exam_contest":null},"questions":[{"question_id":2129,"title":"将标题首字母大写","title_slug":"capitalize-the-title","rating":1274.881752217,"_hash":4156461194,"paid_only":false},{"question_id":2130,"title":"链表最大孪生和","title_slug":"maximum-twin-sum-of-a-linked-list","rating":1317.9207508583,"_hash":2161204569,"paid_only":false},{"question_id":2131,"title":"连接两字母单词得到的最长回文串","title_slug":"longest-palindrome-by-concatenating-two-letter-words","rating":1556.8824239708,"_hash":2977235574,"paid_only":false},{"question_id":2132,"title":"用邮票贴满网格图","title_slug":"stamping-the-grid","rating":2364.3930657709,"_hash":296151509,"paid_only":false}],"company":{}},{"contest":{"id":522,"title":"第 274 场周赛","title_slug":"weekly-contest-274","start_time":1641090600,"is_ee_exam_contest":null},"questions":[{"question_id":2124,"title":"检查是否所有 A 都在 B 之前","title_slug":"check-if-all-as-appears-before-all-bs","rating":1201.7686271329,"_hash":2946534771,"paid_only":false},{"question_id":2125,"title":"银行中的激光束数量","title_slug":"number-of-laser-beams-in-a-bank","rating":1280.2203734882,"_hash":1290173910,"paid_only":false},{"question_id":2126,"title":"摧毁小行星","title_slug":"destroying-asteroids","rating":1334.5708444649,"_hash":2247018180,"paid_only":false},{"question_id":2127,"title":"参加会议的最多员工数","title_slug":"maximum-employees-to-be-invited-to-a-meeting","rating":2449.1323757838,"_hash":2605448197,"paid_only":false}],"company":{}},{"contest":{"id":518,"title":"第 273 场周赛","title_slug":"weekly-contest-273","start_time":1640485800,"is_ee_exam_contest":null},"questions":[{"question_id":2119,"title":"反转两次的数字","title_slug":"a-number-after-a-double-reversal","rating":1187.1344261572,"_hash":1952470548,"paid_only":false},{"question_id":2120,"title":"执行所有后缀指令","title_slug":"execution-of-all-suffix-instructions-staying-in-a-grid","rating":1379.8787648129,"_hash":1526976016,"paid_only":false},{"question_id":2121,"title":"相同元素的间隔之和","title_slug":"intervals-between-identical-elements","rating":1760.9131492436,"_hash":3607071844,"paid_only":false},{"question_id":2122,"title":"还原原数组","title_slug":"recover-the-original-array","rating":2158.8988728254,"_hash":3102719435,"paid_only":false}],"company":{}},{"contest":{"id":515,"title":"第 68 场双周赛","title_slug":"biweekly-contest-68","start_time":1640442600,"is_ee_exam_contest":null},"questions":[{"question_id":2114,"title":"句子中的最多单词数","title_slug":"maximum-number-of-words-found-in-sentences","rating":1257.323514611,"_hash":3609197847,"paid_only":false},{"question_id":2115,"title":"从给定原材料中找到所有可以做出的菜","title_slug":"find-all-possible-recipes-from-given-supplies","rating":1678.5871762113,"_hash":2182831583,"paid_only":false},{"question_id":2116,"title":"判断一个括号字符串是否有效","title_slug":"check-if-a-parentheses-string-can-be-valid","rating":2037.6527962599,"_hash":495901528,"paid_only":false},{"question_id":2117,"title":"一个区间内所有数乘积的缩写","title_slug":"abbreviating-the-product-of-a-range","rating":2476.7727985927,"_hash":2799632565,"paid_only":false}],"company":{}},{"contest":{"id":516,"title":"第 272 场周赛","title_slug":"weekly-contest-272","start_time":1639881000,"is_ee_exam_contest":null},"questions":[{"question_id":2108,"title":"找出数组中的第一个回文字符串","title_slug":"find-first-palindromic-string-in-the-array","rating":1215.7443346869,"_hash":770308924,"paid_only":false},{"question_id":2109,"title":"向字符串添加空格","title_slug":"adding-spaces-to-a-string","rating":1315.1890809249,"_hash":807897834,"paid_only":false},{"question_id":2110,"title":"股票平滑下跌阶段的数目","title_slug":"number-of-smooth-descent-periods-of-a-stock","rating":1408.427592417,"_hash":4159210402,"paid_only":false},{"question_id":2111,"title":"使数组 K 递增的最少操作次数","title_slug":"minimum-operations-to-make-the-array-k-increasing","rating":1940.6002290953,"_hash":1403965423,"paid_only":false}],"company":{}},{"contest":{"id":512,"title":"第 271 场周赛","title_slug":"weekly-contest-271","start_time":1639276200,"is_ee_exam_contest":null},"questions":[{"question_id":2103,"title":"环和杆","title_slug":"rings-and-rods","rating":1257.7670945029,"_hash":2821965653,"paid_only":false},{"question_id":2104,"title":"子数组范围和","title_slug":"sum-of-subarray-ranges","rating":1504.2133321504,"_hash":91788639,"paid_only":false},{"question_id":2105,"title":"给植物浇水 II","title_slug":"watering-plants-ii","rating":1507.1617507911,"_hash":1947285534,"paid_only":false},{"question_id":2106,"title":"摘水果","title_slug":"maximum-fruits-harvested-after-at-most-k-steps","rating":2062.3601158741,"_hash":3434976181,"paid_only":false}],"company":{}},{"contest":{"id":509,"title":"第 67 场双周赛","title_slug":"biweekly-contest-67","start_time":1639233000,"is_ee_exam_contest":null},"questions":[{"question_id":2099,"title":"找到和最大的长度为 K 的子序列","title_slug":"find-subsequence-of-length-k-with-the-largest-sum","rating":1447.0268321102,"_hash":3254374161,"paid_only":false},{"question_id":2100,"title":"适合野炊的日子","title_slug":"find-good-days-to-rob-the-bank","rating":1702.4962514406,"_hash":2252317011,"paid_only":false},{"question_id":2101,"title":"引爆最多的炸弹","title_slug":"detonate-the-maximum-bombs","rating":1880.0511044074,"_hash":1604381884,"paid_only":false},{"question_id":2102,"title":"序列顺序查询","title_slug":"sequentially-ordinal-rank-tracker","rating":2158.7683843245,"_hash":2117244239,"paid_only":false}],"company":{}},{"contest":{"id":510,"title":"第 270 场周赛","title_slug":"weekly-contest-270","start_time":1638671400,"is_ee_exam_contest":null},"questions":[{"question_id":2094,"title":"找出 3 位偶数","title_slug":"finding-3-digit-even-numbers","rating":1454.7459647138,"_hash":3789355498,"paid_only":false},{"question_id":2095,"title":"删除链表的中间节点","title_slug":"delete-the-middle-node-of-a-linked-list","rating":1324.3520304377,"_hash":2982198446,"paid_only":false},{"question_id":2096,"title":"从二叉树一个节点到另一个节点每一步的方向","title_slug":"step-by-step-directions-from-a-binary-tree-node-to-another","rating":1804.5283324227,"_hash":3304159418,"paid_only":false},{"question_id":2097,"title":"合法重新排列数对","title_slug":"valid-arrangement-of-pairs","rating":2650.8996457642,"_hash":459732998,"paid_only":false}],"company":{}},{"contest":{"id":506,"title":"第 269 场周赛","title_slug":"weekly-contest-269","start_time":1638066600,"is_ee_exam_contest":null},"questions":[{"question_id":2089,"title":"找出数组排序后的目标下标","title_slug":"find-target-indices-after-sorting-array","rating":1152.1494742874,"_hash":1915453170,"paid_only":false},{"question_id":2090,"title":"半径为 k 的子数组平均值","title_slug":"k-radius-subarray-averages","rating":1358.152613403,"_hash":210217684,"paid_only":false},{"question_id":2091,"title":"从数组中移除最大值和最小值","title_slug":"removing-minimum-and-maximum-from-array","rating":1384.0226911434,"_hash":4155641815,"paid_only":false},{"question_id":2092,"title":"找出知晓秘密的所有专家","title_slug":"find-all-people-with-secret","rating":2003.5794613668,"_hash":340770494,"paid_only":false}],"company":{}},{"contest":{"id":503,"title":"第 66 场双周赛","title_slug":"biweekly-contest-66","start_time":1638023400,"is_ee_exam_contest":null},"questions":[{"question_id":2085,"title":"统计出现过一次的公共字符串","title_slug":"count-common-words-with-one-occurrence","rating":1307.4608905199,"_hash":709012070,"paid_only":false},{"question_id":2086,"title":"从房屋收集雨水需要的最少水桶数","title_slug":"minimum-number-of-food-buckets-to-feed-the-hamsters","rating":1622.8414025136,"_hash":463765609,"paid_only":false},{"question_id":2087,"title":"网格图中机器人回家的最小代价","title_slug":"minimum-cost-homecoming-of-a-robot-in-a-grid","rating":1743.731976554,"_hash":592826714,"paid_only":false},{"question_id":2088,"title":"统计农场中肥沃金字塔的数目","title_slug":"count-fertile-pyramids-in-a-land","rating":2104.7441214305,"_hash":2070962878,"paid_only":false}],"company":{}},{"contest":{"id":504,"title":"第 268 场周赛","title_slug":"weekly-contest-268","start_time":1637461800,"is_ee_exam_contest":null},"questions":[{"question_id":2078,"title":"两栋颜色不同且距离最远的房子","title_slug":"two-furthest-houses-with-different-colors","rating":1240.829758176,"_hash":3119137809,"paid_only":false},{"question_id":2079,"title":"给植物浇水","title_slug":"watering-plants","rating":1320.6485731562,"_hash":93344773,"paid_only":false},{"question_id":2080,"title":"区间内查询数字的频率","title_slug":"range-frequency-queries","rating":1702.4387527636,"_hash":2460331500,"paid_only":false},{"question_id":2081,"title":"k 镜像数字的和","title_slug":"sum-of-k-mirror-numbers","rating":2209.8815936961,"_hash":3707233513,"paid_only":false}],"company":{}},{"contest":{"id":500,"title":"第 267 场周赛","title_slug":"weekly-contest-267","start_time":1636857000,"is_ee_exam_contest":null},"questions":[{"question_id":2073,"title":"买票需要的时间","title_slug":"time-needed-to-buy-tickets","rating":1325.3607218257,"_hash":1430651253,"paid_only":false},{"question_id":2074,"title":"反转偶数长度组的节点","title_slug":"reverse-nodes-in-even-length-groups","rating":1685.3599641299,"_hash":1103286328,"paid_only":false},{"question_id":2075,"title":"解码斜向换位密码","title_slug":"decode-the-slanted-ciphertext","rating":1759.2287478055,"_hash":1997404036,"paid_only":false},{"question_id":2076,"title":"处理含限制条件的好友请求","title_slug":"process-restricted-friend-requests","rating":2130.9348604091,"_hash":10205408,"paid_only":false}],"company":{}},{"contest":{"id":497,"title":"第 65 场双周赛","title_slug":"biweekly-contest-65","start_time":1636813800,"is_ee_exam_contest":null},"questions":[{"question_id":2068,"title":"检查两个字符串是否几乎相等","title_slug":"check-whether-two-strings-are-almost-equivalent","rating":1273.0588534723,"_hash":2469022748,"paid_only":false},{"question_id":2069,"title":"模拟行走机器人 II","title_slug":"walking-robot-simulation-ii","rating":1918.9960035055,"_hash":3967032436,"paid_only":false},{"question_id":2070,"title":"每一个查询的最大美丽值","title_slug":"most-beautiful-item-for-each-query","rating":1724.1545485476,"_hash":1066025257,"paid_only":false},{"question_id":2071,"title":"你可以安排的最多任务数目","title_slug":"maximum-number-of-tasks-you-can-assign","rating":2648.1748409542,"_hash":1194042995,"paid_only":false}],"company":{}},{"contest":{"id":498,"title":"第 266 场周赛","title_slug":"weekly-contest-266","start_time":1636252200,"is_ee_exam_contest":null},"questions":[{"question_id":2062,"title":"统计字符串中的元音子字符串","title_slug":"count-vowel-substrings-of-a-string","rating":1458.356493039,"_hash":3871311053,"paid_only":false},{"question_id":2063,"title":"所有子字符串中的元音","title_slug":"vowels-of-all-substrings","rating":1663.3912882908,"_hash":1180161064,"paid_only":false},{"question_id":2064,"title":"分配给商店的最多商品的最小值","title_slug":"minimized-maximum-of-products-distributed-to-any-store","rating":1885.9015646531,"_hash":2819110526,"paid_only":false},{"question_id":2065,"title":"最大化一张图中的路径价值","title_slug":"maximum-path-quality-of-a-graph","rating":2178.4249114144,"_hash":2027773900,"paid_only":false}],"company":{}},{"contest":{"id":493,"title":"第 265 场周赛","title_slug":"weekly-contest-265","start_time":1635647400,"is_ee_exam_contest":null},"questions":[{"question_id":2057,"title":"值相等的最小索引","title_slug":"smallest-index-with-equal-value","rating":1167.8737144048,"_hash":3849697077,"paid_only":false},{"question_id":2058,"title":"找出临界点之间的最小和最大距离","title_slug":"find-the-minimum-and-maximum-number-of-nodes-between-critical-points","rating":1310.9129840277,"_hash":4024970253,"paid_only":false},{"question_id":2059,"title":"转化数字的最小运算数","title_slug":"minimum-operations-to-convert-number","rating":1849.8122180044,"_hash":3590542886,"paid_only":false},{"question_id":2060,"title":"同源字符串检测","title_slug":"check-if-an-original-string-exists-given-two-encoded-strings","rating":2803.7652028979,"_hash":905487995,"paid_only":false}],"company":{}},{"contest":{"id":490,"title":"第 64 场双周赛","title_slug":"biweekly-contest-64","start_time":1635604200,"is_ee_exam_contest":null},"questions":[{"question_id":2053,"title":"数组中第 K 个独一无二的字符串","title_slug":"kth-distinct-string-in-an-array","rating":1350.6048768377,"_hash":1322023785,"paid_only":false},{"question_id":2054,"title":"两个最好的不重叠活动","title_slug":"two-best-non-overlapping-events","rating":1883.3541964032,"_hash":2546467088,"paid_only":false},{"question_id":2055,"title":"蜡烛之间的盘子","title_slug":"plates-between-candles","rating":1819.3068421506,"_hash":1199383198,"paid_only":false},{"question_id":2056,"title":"棋盘上有效移动组合的数目","title_slug":"number-of-valid-move-combinations-on-chessboard","rating":2610.9906730644,"_hash":288912613,"paid_only":false}],"company":{}},{"contest":{"id":491,"title":"第 264 场周赛","title_slug":"weekly-contest-264","start_time":1635042600,"is_ee_exam_contest":null},"questions":[{"question_id":2047,"title":"句子中的有效单词数","title_slug":"number-of-valid-words-in-a-sentence","rating":1471.8964024887,"_hash":3911640069,"paid_only":false},{"question_id":2048,"title":"下一个更大的数值平衡数","title_slug":"next-greater-numerically-balanced-number","rating":1734.0550202798,"_hash":1204660336,"paid_only":false},{"question_id":2049,"title":"统计最高分的节点数目","title_slug":"count-nodes-with-the-highest-score","rating":1911.7063530593,"_hash":3202447407,"paid_only":false},{"question_id":2050,"title":"并行课程 III","title_slug":"parallel-courses-iii","rating":2084.1404698713,"_hash":3929135553,"paid_only":false}],"company":{}},{"contest":{"id":487,"title":"第 263 场周赛","title_slug":"weekly-contest-263","start_time":1634437800,"is_ee_exam_contest":null},"questions":[{"question_id":2042,"title":"检查句子中的数字是否递增","title_slug":"check-if-numbers-are-ascending-in-a-sentence","rating":1257.264923599,"_hash":335486990,"paid_only":false},{"question_id":2043,"title":"简易银行系统","title_slug":"simple-bank-system","rating":1356.1920189231,"_hash":693474678,"paid_only":false},{"question_id":2044,"title":"统计按位或能得到最大值的子集数目","title_slug":"count-number-of-maximum-bitwise-or-subsets","rating":1567.6884942977,"_hash":3480413551,"paid_only":false},{"question_id":2045,"title":"到达目的地的第二短时间","title_slug":"second-minimum-time-to-reach-destination","rating":2201.6219336792,"_hash":1896286191,"paid_only":false}],"company":{}},{"contest":{"id":484,"title":"第 63 场双周赛","title_slug":"biweekly-contest-63","start_time":1634394600,"is_ee_exam_contest":null},"questions":[{"question_id":2037,"title":"使每位学生都有座位的最少移动次数","title_slug":"minimum-number-of-moves-to-seat-everyone","rating":1356.6925765299,"_hash":468110,"paid_only":false},{"question_id":2038,"title":"如果相邻两个颜色均相同则删除当前颜色","title_slug":"remove-colored-pieces-if-both-neighbors-are-the-same-color","rating":1467.7383709213,"_hash":2795952868,"paid_only":false},{"question_id":2039,"title":"网络空闲的时刻","title_slug":"the-time-when-the-network-becomes-idle","rating":1865.3441063734,"_hash":275986604,"paid_only":false},{"question_id":2040,"title":"两个有序数组的第 K 小乘积","title_slug":"kth-smallest-product-of-two-sorted-arrays","rating":2517.6829964848,"_hash":4175159080,"paid_only":false}],"company":{}},{"contest":{"id":485,"title":"第 262 场周赛","title_slug":"weekly-contest-262","start_time":1633833000,"is_ee_exam_contest":null},"questions":[{"question_id":2032,"title":"至少在两个数组中出现的值","title_slug":"two-out-of-three","rating":1269.7567553523,"_hash":983129619,"paid_only":false},{"question_id":2033,"title":"获取单值网格的最小操作数","title_slug":"minimum-operations-to-make-a-uni-value-grid","rating":1671.9261598,"_hash":684110909,"paid_only":false},{"question_id":2034,"title":"股票价格波动","title_slug":"stock-price-fluctuation","rating":1831.9395911303,"_hash":1147860078,"paid_only":false},{"question_id":2035,"title":"将数组分成两个数组并最小化数组和的差","title_slug":"partition-array-into-two-arrays-to-minimize-sum-difference","rating":2489.6652421066,"_hash":550627195,"paid_only":false}],"company":{}},{"contest":{"id":481,"title":"第 261 场周赛","title_slug":"weekly-contest-261","start_time":1633228200,"is_ee_exam_contest":null},"questions":[{"question_id":2027,"title":"转换字符串的最少操作次数","title_slug":"minimum-moves-to-convert-string","rating":1346.3556309143,"_hash":1180837306,"paid_only":false},{"question_id":2028,"title":"找出缺失的观测数据","title_slug":"find-missing-observations","rating":1444.6795731919,"_hash":1541316145,"paid_only":false},{"question_id":2029,"title":"石子游戏 IX","title_slug":"stone-game-ix","rating":2277.3595662538,"_hash":2371431943,"paid_only":false},{"question_id":2030,"title":"含特定字母的最小子序列","title_slug":"smallest-k-length-subsequence-with-occurrences-of-a-letter","rating":2561.7794931859,"_hash":266469116,"paid_only":false}],"company":{}},{"contest":{"id":477,"title":"第 62 场双周赛","title_slug":"biweekly-contest-62","start_time":1633185000,"is_ee_exam_contest":null},"questions":[{"question_id":2022,"title":"将一维数组转变成二维数组","title_slug":"convert-1d-array-into-2d-array","rating":1307.3265298181,"_hash":289054660,"paid_only":false},{"question_id":2023,"title":"连接后等于目标字符串的字符串对","title_slug":"number-of-pairs-of-strings-with-concatenation-equal-to-target","rating":1341.3713970313,"_hash":4234423090,"paid_only":false},{"question_id":2024,"title":"考试的最大困扰度","title_slug":"maximize-the-confusion-of-an-exam","rating":1643.1325351423,"_hash":2651875294,"paid_only":false},{"question_id":2025,"title":"分割数组的最多方案数","title_slug":"maximum-number-of-ways-to-partition-an-array","rating":2217.8090802563,"_hash":2513347763,"paid_only":false}],"company":{}},{"contest":{"id":478,"title":"第 260 场周赛","title_slug":"weekly-contest-260","start_time":1632623400,"is_ee_exam_contest":null},"questions":[{"question_id":2016,"title":"增量元素之间的最大差值","title_slug":"maximum-difference-between-increasing-elements","rating":1246.0141927368,"_hash":3044209556,"paid_only":false},{"question_id":2017,"title":"网格游戏","title_slug":"grid-game","rating":1718.9772466681,"_hash":3098562302,"paid_only":false},{"question_id":2018,"title":"判断单词是否能放入填字游戏内","title_slug":"check-if-word-can-be-placed-in-crossword","rating":1929.897343316,"_hash":1485423720,"paid_only":false},{"question_id":2019,"title":"解出数学表达式的学生分数","title_slug":"the-score-of-students-solving-math-expression","rating":2583.9006314254,"_hash":1787510201,"paid_only":false}],"company":{}},{"contest":{"id":474,"title":"第 259 场周赛","title_slug":"weekly-contest-259","start_time":1632018600,"is_ee_exam_contest":null},"questions":[{"question_id":2011,"title":"执行操作后的变量值","title_slug":"final-value-of-variable-after-performing-operations","rating":1165.2135167215,"_hash":170017720,"paid_only":false},{"question_id":2012,"title":"数组美丽值求和","title_slug":"sum-of-beauty-in-the-array","rating":1467.9366439696,"_hash":136239889,"paid_only":false},{"question_id":2013,"title":"检测正方形","title_slug":"detect-squares","rating":1841.4067816266,"_hash":2204914887,"paid_only":false},{"question_id":2014,"title":"重复 K 次的最长子序列","title_slug":"longest-subsequence-repeated-k-times","rating":2558.3297484354,"_hash":3061824471,"paid_only":false}],"company":{}},{"contest":{"id":467,"title":"第 61 场双周赛","title_slug":"biweekly-contest-61","start_time":1631975400,"is_ee_exam_contest":null},"questions":[{"question_id":2006,"title":"差的绝对值为 K 的数对数目","title_slug":"count-number-of-pairs-with-absolute-difference-k","rating":1271.7726574892,"_hash":911506733,"paid_only":false},{"question_id":2007,"title":"从双倍数组中还原原数组","title_slug":"find-original-array-from-doubled-array","rating":1557.017055582,"_hash":1395581223,"paid_only":false},{"question_id":2008,"title":"出租车的最大盈利","title_slug":"maximum-earnings-from-taxi","rating":1871.8245218615,"_hash":2921363389,"paid_only":false},{"question_id":2009,"title":"使数组连续的最少操作数","title_slug":"minimum-number-of-operations-to-make-array-continuous","rating":2084.4980206639,"_hash":419814877,"paid_only":false}],"company":{}},{"contest":{"id":468,"title":"第 258 场周赛","title_slug":"weekly-contest-258","start_time":1631413800,"is_ee_exam_contest":null},"questions":[{"question_id":2000,"title":"反转单词前缀","title_slug":"reverse-prefix-of-word","rating":1199.4477805501,"_hash":3147357769,"paid_only":false},{"question_id":2001,"title":"可互换矩形的组数","title_slug":"number-of-pairs-of-interchangeable-rectangles","rating":1435.9559888935,"_hash":2330317080,"paid_only":false},{"question_id":2002,"title":"两个回文子序列长度的最大乘积","title_slug":"maximum-product-of-the-length-of-two-palindromic-subsequences","rating":1869.402439128,"_hash":3968538235,"paid_only":false},{"question_id":2003,"title":"每棵子树内缺失的最小基因值","title_slug":"smallest-missing-genetic-value-in-each-subtree","rating":2415.0089731911,"_hash":4272085250,"paid_only":false}],"company":{}},{"contest":{"id":464,"title":"第 257 场周赛","title_slug":"weekly-contest-257","start_time":1630809000,"is_ee_exam_contest":null},"questions":[{"question_id":1995,"title":"统计特殊四元组","title_slug":"count-special-quadruplets","rating":1352.1791099256,"_hash":3750650671,"paid_only":false},{"question_id":1996,"title":"游戏中弱角色的数量","title_slug":"the-number-of-weak-characters-in-the-game","rating":1860.742934291,"_hash":1819395589,"paid_only":false},{"question_id":1997,"title":"访问完所有房间的第一天","title_slug":"first-day-where-you-have-been-in-all-the-rooms","rating":2260.2799775623,"_hash":3953077425,"paid_only":false},{"question_id":1998,"title":"数组的最大公因数排序","title_slug":"gcd-sort-of-an-array","rating":2429.0940568399,"_hash":1642092986,"paid_only":false}],"company":{}},{"contest":{"id":461,"title":"第 60 场双周赛","title_slug":"biweekly-contest-60","start_time":1630765800,"is_ee_exam_contest":null},"questions":[{"question_id":1991,"title":"找到数组的中间位置","title_slug":"find-the-middle-index-in-array","rating":1302.6469071738,"_hash":919200929,"paid_only":false},{"question_id":1992,"title":"找到所有的农场组","title_slug":"find-all-groups-of-farmland","rating":1539.2250193318,"_hash":3674750599,"paid_only":false},{"question_id":1993,"title":"树上的操作","title_slug":"operations-on-tree","rating":1861.4906863586,"_hash":2143044442,"paid_only":false},{"question_id":1994,"title":"好子集的数目","title_slug":"the-number-of-good-subsets","rating":2464.5077611012,"_hash":1844354140,"paid_only":false}],"company":{}},{"contest":{"id":462,"title":"第 256 场周赛","title_slug":"weekly-contest-256","start_time":1630204200,"is_ee_exam_contest":null},"questions":[{"question_id":1984,"title":"学生分数的最小差值","title_slug":"minimum-difference-between-highest-and-lowest-of-k-scores","rating":1306.2821637677,"_hash":3183288856,"paid_only":false},{"question_id":1985,"title":"找出数组中的第 K 大整数","title_slug":"find-the-kth-largest-integer-in-the-array","rating":1414.4351202231,"_hash":3550553048,"paid_only":false},{"question_id":1986,"title":"完成任务的最少工作时间段","title_slug":"minimum-number-of-work-sessions-to-finish-the-tasks","rating":1995.2937073376,"_hash":1113985320,"paid_only":false},{"question_id":1987,"title":"不同的好子序列数目","title_slug":"number-of-unique-good-subsequences","rating":2422.3128048015,"_hash":3567330607,"paid_only":false}],"company":{}},{"contest":{"id":457,"title":"第 255 场周赛","title_slug":"weekly-contest-255","start_time":1629599400,"is_ee_exam_contest":null},"questions":[{"question_id":1979,"title":"找出数组的最大公约数","title_slug":"find-greatest-common-divisor-of-array","rating":1184.4264833435,"_hash":2688612867,"paid_only":false},{"question_id":1980,"title":"找出不同的二进制字符串","title_slug":"find-unique-binary-string","rating":1361.6459603518,"_hash":333667858,"paid_only":false},{"question_id":1981,"title":"最小化目标值与所选元素的差","title_slug":"minimize-the-difference-between-target-and-chosen-elements","rating":2009.7322365973,"_hash":3922635563,"paid_only":false},{"question_id":1982,"title":"从子集的和还原数组","title_slug":"find-array-given-subset-sums","rating":2872.0290327119,"_hash":1576603106,"paid_only":false}],"company":{}},{"contest":{"id":448,"title":"第 59 场双周赛","title_slug":"biweekly-contest-59","start_time":1629556200,"is_ee_exam_contest":null},"questions":[{"question_id":1974,"title":"使用特殊打字机键入单词的最少时间","title_slug":"minimum-time-to-type-word-using-special-typewriter","rating":1364.154859918,"_hash":3014957498,"paid_only":false},{"question_id":1975,"title":"最大方阵和","title_slug":"maximum-matrix-sum","rating":1648.0880791614,"_hash":330899243,"paid_only":false},{"question_id":1976,"title":"到达目的地的方案数","title_slug":"number-of-ways-to-arrive-at-destination","rating":2094.592426537,"_hash":3020603346,"paid_only":false},{"question_id":1977,"title":"划分数字的方案数","title_slug":"number-of-ways-to-separate-numbers","rating":2817.267212602,"_hash":1178924986,"paid_only":false}],"company":{}},{"contest":{"id":449,"title":"第 254 场周赛","title_slug":"weekly-contest-254","start_time":1628994600,"is_ee_exam_contest":null},"questions":[{"question_id":1967,"title":"作为子字符串出现在单词中的字符串数目","title_slug":"number-of-strings-that-appear-as-substrings-in-word","rating":1231.8671440198,"_hash":3091785544,"paid_only":false},{"question_id":1968,"title":"构造元素不等于两相邻元素平均值的数组","title_slug":"array-with-elements-not-equal-to-average-of-neighbors","rating":1499.3290269267,"_hash":3221222128,"paid_only":false},{"question_id":1969,"title":"数组元素的最小非零乘积","title_slug":"minimum-non-zero-product-of-the-array-elements","rating":1966.7067914206,"_hash":4252220750,"paid_only":false},{"question_id":1970,"title":"你能穿过矩阵的最后一天","title_slug":"last-day-where-you-can-still-cross","rating":2123.5708982185,"_hash":821525251,"paid_only":false}],"company":{}},{"contest":{"id":444,"title":"第 253 场周赛","title_slug":"weekly-contest-253","start_time":1628389800,"is_ee_exam_contest":null},"questions":[{"question_id":1961,"title":"检查字符串是否为数组前缀","title_slug":"check-if-string-is-a-prefix-of-array","rating":1234.058537565,"_hash":32848909,"paid_only":false},{"question_id":1962,"title":"移除石子使总数最小","title_slug":"remove-stones-to-minimize-the-total","rating":1418.6847740057,"_hash":1331620430,"paid_only":false},{"question_id":1963,"title":"使字符串平衡的最小交换次数","title_slug":"minimum-number-of-swaps-to-make-the-string-balanced","rating":1688.9209684568,"_hash":1518041298,"paid_only":false},{"question_id":1964,"title":"找出到每个位置为止最长的有效障碍赛跑路线","title_slug":"find-the-longest-valid-obstacle-course-at-each-position","rating":1933.2169470617,"_hash":2251945224,"paid_only":false}],"company":{}},{"contest":{"id":441,"title":"第 58 场双周赛","title_slug":"biweekly-contest-58","start_time":1628346600,"is_ee_exam_contest":null},"questions":[{"question_id":1957,"title":"删除字符使字符串变好","title_slug":"delete-characters-to-make-fancy-string","rating":1357.6553050616,"_hash":3153125580,"paid_only":false},{"question_id":1958,"title":"检查操作是否合法","title_slug":"check-if-move-is-legal","rating":1658.5967147757,"_hash":4231095696,"paid_only":false},{"question_id":1959,"title":"K 次调整数组大小浪费的最小总空间","title_slug":"minimum-total-space-wasted-with-k-resizing-operations","rating":2310.3824631335,"_hash":1714015866,"paid_only":false},{"question_id":1960,"title":"两个回文子字符串长度的最大乘积","title_slug":"maximum-product-of-the-length-of-two-palindromic-substrings","rating":2690.5859406179,"_hash":1434911335,"paid_only":false}],"company":{}},{"contest":{"id":442,"title":"第 252 场周赛","title_slug":"weekly-contest-252","start_time":1627785000,"is_ee_exam_contest":null},"questions":[{"question_id":1952,"title":"三除数","title_slug":"three-divisors","rating":1203.7504950404,"_hash":324872429,"paid_only":false},{"question_id":1953,"title":"你可以工作的最大周数","title_slug":"maximum-number-of-weeks-for-which-you-can-work","rating":1803.7518552874,"_hash":787047636,"paid_only":false},{"question_id":1954,"title":"收集足够苹果的最小花园周长","title_slug":"minimum-garden-perimeter-to-collect-enough-apples","rating":1758.5135073787,"_hash":601450429,"paid_only":false},{"question_id":1955,"title":"统计特殊子序列的数目","title_slug":"count-number-of-special-subsequences","rating":2125.3125624762,"_hash":655929637,"paid_only":false}],"company":{}},{"contest":{"id":438,"title":"第 251 场周赛","title_slug":"weekly-contest-251","start_time":1627180200,"is_ee_exam_contest":null},"questions":[{"question_id":1945,"title":"字符串转化后的各位数字之和","title_slug":"sum-of-digits-of-string-after-convert","rating":1254.8626139269,"_hash":199553622,"paid_only":false},{"question_id":1946,"title":"子字符串突变后可能得到的最大整数","title_slug":"largest-number-after-mutating-substring","rating":1445.3734269673,"_hash":1102749976,"paid_only":false},{"question_id":1947,"title":"最大兼容性评分和","title_slug":"maximum-compatibility-score-sum","rating":1704.360891641,"_hash":889856657,"paid_only":false},{"question_id":1948,"title":"删除系统中的重复文件夹","title_slug":"delete-duplicate-folders-in-system","rating":2533.7796160302,"_hash":2921275572,"paid_only":false}],"company":{}},{"contest":{"id":435,"title":"第 57 场双周赛","title_slug":"biweekly-contest-57","start_time":1627137000,"is_ee_exam_contest":null},"questions":[{"question_id":1941,"title":"检查是否所有字符出现次数相同","title_slug":"check-if-all-characters-have-equal-number-of-occurrences","rating":1242.6172898768,"_hash":2694237057,"paid_only":false},{"question_id":1942,"title":"最小未被占据椅子的编号","title_slug":"the-number-of-the-smallest-unoccupied-chair","rating":1695.2832486322,"_hash":2532708840,"paid_only":false},{"question_id":1943,"title":"描述绘画结果","title_slug":"describe-the-painting","rating":1969.2019235672,"_hash":3387998069,"paid_only":false},{"question_id":1944,"title":"队列中可以看到的人数","title_slug":"number-of-visible-people-in-a-queue","rating":2104.9526046945,"_hash":3935523633,"paid_only":false}],"company":{}},{"contest":{"id":436,"title":"第 250 场周赛","title_slug":"weekly-contest-250","start_time":1626575400,"is_ee_exam_contest":null},"questions":[{"question_id":1935,"title":"可以输入的最大单词数","title_slug":"maximum-number-of-words-you-can-type","rating":1226.8332278145,"_hash":3926884655,"paid_only":false},{"question_id":1936,"title":"新增的最少台阶数","title_slug":"add-minimum-number-of-rungs","rating":1322.5926536743,"_hash":1249919767,"paid_only":false},{"question_id":1937,"title":"扣分后的最大得分","title_slug":"maximum-number-of-points-with-cost","rating":2105.7761215397,"_hash":1687003236,"paid_only":false},{"question_id":1938,"title":"查询最大基因差","title_slug":"maximum-genetic-difference-query","rating":2502.5176603922,"_hash":2939895760,"paid_only":false}],"company":{}},{"contest":{"id":432,"title":"第 249 场周赛","title_slug":"weekly-contest-249","start_time":1625970600,"is_ee_exam_contest":null},"questions":[{"question_id":1929,"title":"数组串联","title_slug":"concatenation-of-array","rating":1132.6812943289,"_hash":4238290979,"paid_only":false},{"question_id":1930,"title":"长度为 3 的不同回文子序列","title_slug":"unique-length-3-palindromic-subsequences","rating":1533.3376144199,"_hash":2661403855,"paid_only":false},{"question_id":1931,"title":"用三种不同颜色为网格涂色","title_slug":"painting-a-grid-with-three-different-colors","rating":2170.0439693714,"_hash":4290496515,"paid_only":false},{"question_id":1932,"title":"合并多棵二叉搜索树","title_slug":"merge-bsts-to-create-single-bst","rating":2483.9435767299,"_hash":1876544260,"paid_only":false}],"company":{}},{"contest":{"id":429,"title":"第 56 场双周赛","title_slug":"biweekly-contest-56","start_time":1625927400,"is_ee_exam_contest":null},"questions":[{"question_id":1925,"title":"统计平方和三元组的数目","title_slug":"count-square-sum-triples","rating":1323.8236471852,"_hash":1728101846,"paid_only":false},{"question_id":1926,"title":"迷宫中离入口最近的出口","title_slug":"nearest-exit-from-entrance-in-maze","rating":1638.3134093066,"_hash":1229621552,"paid_only":false},{"question_id":1927,"title":"求和游戏","title_slug":"sum-game","rating":2004.5346526204,"_hash":1519983797,"paid_only":false},{"question_id":1928,"title":"规定时间内到达终点的最小花费","title_slug":"minimum-cost-to-reach-destination-in-time","rating":2413.3969129689,"_hash":3899529382,"paid_only":false}],"company":{}},{"contest":{"id":430,"title":"第 248 场周赛","title_slug":"weekly-contest-248","start_time":1625365800,"is_ee_exam_contest":null},"questions":[{"question_id":1920,"title":"基于排列构建数组","title_slug":"build-array-from-permutation","rating":1160.4439395369,"_hash":1028149095,"paid_only":false},{"question_id":1921,"title":"消灭怪物的最大数量","title_slug":"eliminate-maximum-number-of-monsters","rating":1527.6868660176,"_hash":119954396,"paid_only":false},{"question_id":1922,"title":"统计好数字的数目","title_slug":"count-good-numbers","rating":1674.7986939472,"_hash":1253336265,"paid_only":false},{"question_id":1923,"title":"最长公共子路径","title_slug":"longest-common-subpath","rating":2661.0670044656,"_hash":3430988573,"paid_only":false}],"company":{}},{"contest":{"id":426,"title":"第 247 场周赛","title_slug":"weekly-contest-247","start_time":1624761000,"is_ee_exam_contest":null},"questions":[{"question_id":1913,"title":"两个数对之间的最大乘积差","title_slug":"maximum-product-difference-between-two-pairs","rating":1144.6237559885,"_hash":639622603,"paid_only":false},{"question_id":1914,"title":"循环轮转矩阵","title_slug":"cyclically-rotating-a-grid","rating":1766.2506177612,"_hash":1526363744,"paid_only":false},{"question_id":1915,"title":"最美子字符串的数目","title_slug":"number-of-wonderful-substrings","rating":2234.9191877602,"_hash":3315472808,"paid_only":false},{"question_id":1916,"title":"统计为蚁群构筑房间的不同顺序","title_slug":"count-ways-to-build-rooms-in-an-ant-colony","rating":2486.2339675701,"_hash":2321691552,"paid_only":false}],"company":{}},{"contest":{"id":421,"title":"第 55 场双周赛","title_slug":"biweekly-contest-55","start_time":1624717800,"is_ee_exam_contest":null},"questions":[{"question_id":1909,"title":"删除一个元素使数组严格递增","title_slug":"remove-one-element-to-make-the-array-strictly-increasing","rating":1461.2892510067,"_hash":3077002187,"paid_only":false},{"question_id":1910,"title":"删除一个字符串中所有出现的给定子字符串","title_slug":"remove-all-occurrences-of-a-substring","rating":1460.9105672071,"_hash":2348993490,"paid_only":false},{"question_id":1911,"title":"最大子序列交替和","title_slug":"maximum-alternating-subsequence-sum","rating":1785.6872758693,"_hash":1304520805,"paid_only":false},{"question_id":1912,"title":"设计电影租借系统","title_slug":"design-movie-rental-system","rating":2181.7821188042,"_hash":1272023779,"paid_only":false}],"company":{}},{"contest":{"id":422,"title":"第 246 场周赛","title_slug":"weekly-contest-246","start_time":1624156200,"is_ee_exam_contest":null},"questions":[{"question_id":1903,"title":"字符串中的最大奇数","title_slug":"largest-odd-number-in-string","rating":1248.8547072235,"_hash":946660529,"paid_only":false},{"question_id":1904,"title":"你完成的完整对局数","title_slug":"the-number-of-full-rounds-you-have-played","rating":1498.1542511841,"_hash":1871665913,"paid_only":false},{"question_id":1905,"title":"统计子岛屿","title_slug":"count-sub-islands","rating":1678.7231378948,"_hash":986520800,"paid_only":false},{"question_id":1906,"title":"查询差绝对值的最小值","title_slug":"minimum-absolute-difference-queries","rating":2146.639581998,"_hash":1980479000,"paid_only":false}],"company":{}},{"contest":{"id":417,"title":"第 245 场周赛","title_slug":"weekly-contest-245","start_time":1623551400,"is_ee_exam_contest":null},"questions":[{"question_id":1897,"title":"重新分配字符使所有字符串都相等","title_slug":"redistribute-characters-to-make-all-strings-equal","rating":1309.1422268153,"_hash":1093275153,"paid_only":false},{"question_id":1898,"title":"可移除字符的最大数目","title_slug":"maximum-number-of-removable-characters","rating":1912.8440554296,"_hash":1548254728,"paid_only":false},{"question_id":1899,"title":"合并若干三元组以形成目标三元组","title_slug":"merge-triplets-to-form-target-triplet","rating":1635.6879273926,"_hash":3990558875,"paid_only":false},{"question_id":1900,"title":"最佳运动员的比拼回合","title_slug":"the-earliest-and-latest-rounds-where-players-compete","rating":2454.7653333657,"_hash":5115105,"paid_only":false}],"company":{}},{"contest":{"id":414,"title":"第 54 场双周赛","title_slug":"biweekly-contest-54","start_time":1623508200,"is_ee_exam_contest":null},"questions":[{"question_id":1893,"title":"检查是否区域内所有整数都被覆盖","title_slug":"check-if-all-the-integers-in-a-range-are-covered","rating":1307.3797385769,"_hash":457953007,"paid_only":false},{"question_id":1894,"title":"找到需要补充粉笔的学生编号","title_slug":"find-the-student-that-will-replace-the-chalk","rating":1355.5386161215,"_hash":3347724858,"paid_only":false},{"question_id":1895,"title":"最大的幻方","title_slug":"largest-magic-square","rating":1781.3664141686,"_hash":826909651,"paid_only":false},{"question_id":1896,"title":"反转表达式值的最少操作次数","title_slug":"minimum-cost-to-change-the-final-value-of-expression","rating":2531.6452775023,"_hash":4239622058,"paid_only":false}],"company":{}},{"contest":{"id":415,"title":"第 244 场周赛","title_slug":"weekly-contest-244","start_time":1622946600,"is_ee_exam_contest":null},"questions":[{"question_id":1886,"title":"判断矩阵经轮转后是否一致","title_slug":"determine-whether-matrix-can-be-obtained-by-rotation","rating":1407.0629410799,"_hash":3698071341,"paid_only":false},{"question_id":1887,"title":"使数组元素相等的减少操作次数","title_slug":"reduction-operations-to-make-the-array-elements-equal","rating":1427.7906804882,"_hash":869195845,"paid_only":false},{"question_id":1888,"title":"使二进制字符串字符交替的最少反转次数","title_slug":"minimum-number-of-flips-to-make-the-binary-string-alternating","rating":2005.5862669078,"_hash":3565951903,"paid_only":false},{"question_id":1889,"title":"装包裹的最小浪费空间","title_slug":"minimum-space-wasted-from-packaging","rating":2214.4798747386,"_hash":988335694,"paid_only":false}],"company":{}},{"contest":{"id":411,"title":"第 243 场周赛","title_slug":"weekly-contest-243","start_time":1622341800,"is_ee_exam_contest":null},"questions":[{"question_id":1880,"title":"检查某单词是否等于两单词之和","title_slug":"check-if-word-equals-summation-of-two-words","rating":1187.1641565458,"_hash":2621107821,"paid_only":false},{"question_id":1881,"title":"插入后的最大值","title_slug":"maximum-value-after-insertion","rating":1381.2168789318,"_hash":288305998,"paid_only":false},{"question_id":1882,"title":"使用服务器处理任务","title_slug":"process-tasks-using-servers","rating":1979.1112273597,"_hash":3237851921,"paid_only":false},{"question_id":1883,"title":"准时抵达会议现场的最小跳过休息次数","title_slug":"minimum-skips-to-arrive-at-meeting-on-time","rating":2587.8725248485,"_hash":557097878,"paid_only":false}],"company":{}},{"contest":{"id":408,"title":"第 53 场双周赛","title_slug":"biweekly-contest-53","start_time":1622298600,"is_ee_exam_contest":null},"questions":[{"question_id":1876,"title":"长度为三且各字符不同的子字符串","title_slug":"substrings-of-size-three-with-distinct-characters","rating":1248.7224675206,"_hash":2754546565,"paid_only":false},{"question_id":1877,"title":"数组中最大数对和的最小值","title_slug":"minimize-maximum-pair-sum-in-array","rating":1301.381757401,"_hash":1670099365,"paid_only":false},{"question_id":1878,"title":"矩阵中最大的三个菱形和","title_slug":"get-biggest-three-rhombus-sums-in-a-grid","rating":1897.5516652727,"_hash":3647529643,"paid_only":false},{"question_id":1879,"title":"两个数组最小的异或值之和","title_slug":"minimum-xor-sum-of-two-arrays","rating":2145.183995267,"_hash":3201195359,"paid_only":false}],"company":{}},{"contest":{"id":409,"title":"第 242 场周赛","title_slug":"weekly-contest-242","start_time":1621737000,"is_ee_exam_contest":null},"questions":[{"question_id":1869,"title":"哪种连续子字符串更长","title_slug":"longer-contiguous-segments-of-ones-than-zeros","rating":1204.9864820183,"_hash":4125612782,"paid_only":false},{"question_id":1870,"title":"准时到达的列车最小时速","title_slug":"minimum-speed-to-arrive-on-time","rating":1675.761234741,"_hash":2612530279,"paid_only":false},{"question_id":1871,"title":"跳跃游戏 VII","title_slug":"jump-game-vii","rating":1896.1411567598,"_hash":2335538835,"paid_only":false},{"question_id":1872,"title":"石子游戏 VIII","title_slug":"stone-game-viii","rating":2439.7337408636,"_hash":3947635653,"paid_only":false}],"company":{}},{"contest":{"id":405,"title":"第 241 场周赛","title_slug":"weekly-contest-241","start_time":1621132200,"is_ee_exam_contest":null},"questions":[{"question_id":1863,"title":"找出所有子集的异或总和再求和","title_slug":"sum-of-all-subset-xor-totals","rating":1372.1152262488,"_hash":3681131795,"paid_only":false},{"question_id":1864,"title":"构成交替字符串需要的最小交换次数","title_slug":"minimum-number-of-swaps-to-make-the-binary-string-alternating","rating":1600.5573262373,"_hash":1402633459,"paid_only":false},{"question_id":1865,"title":"找出和为指定值的下标对","title_slug":"finding-pairs-with-a-certain-sum","rating":1680.82425993,"_hash":1859819274,"paid_only":false},{"question_id":1866,"title":"恰有 K 根木棍可以看到的排列数目","title_slug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible","rating":2333.0621537307,"_hash":3900992255,"paid_only":false}],"company":{}},{"contest":{"id":402,"title":"第 52 场双周赛","title_slug":"biweekly-contest-52","start_time":1621089000,"is_ee_exam_contest":null},"questions":[{"question_id":1859,"title":"将句子排序","title_slug":"sorting-the-sentence","rating":1290.0361853035,"_hash":1139062797,"paid_only":false},{"question_id":1860,"title":"增长的内存泄露","title_slug":"incremental-memory-leak","rating":1387.2941868867,"_hash":4283669919,"paid_only":false},{"question_id":1861,"title":"旋转盒子","title_slug":"rotating-the-box","rating":1536.7018543075,"_hash":3272610079,"paid_only":false},{"question_id":1862,"title":"向下取整数对和","title_slug":"sum-of-floored-pairs","rating":2170.1079846744,"_hash":2862855056,"paid_only":false}],"company":{}},{"contest":{"id":403,"title":"第 240 场周赛","title_slug":"weekly-contest-240","start_time":1620527400,"is_ee_exam_contest":null},"questions":[{"question_id":1854,"title":"人口最多的年份","title_slug":"maximum-population-year","rating":1370.4186698287,"_hash":214508087,"paid_only":false},{"question_id":1855,"title":"下标对中的最大距离","title_slug":"maximum-distance-between-a-pair-of-values","rating":1514.8181710611,"_hash":4071175900,"paid_only":false},{"question_id":1856,"title":"子数组最小乘积的最大值","title_slug":"maximum-subarray-min-product","rating":2051.0879431258,"_hash":209121812,"paid_only":false},{"question_id":1857,"title":"有向图中最大颜色值","title_slug":"largest-color-value-in-a-directed-graph","rating":2312.9919953644,"_hash":1775341601,"paid_only":false}],"company":{}},{"contest":{"id":399,"title":"第 239 场周赛","title_slug":"weekly-contest-239","start_time":1619922600,"is_ee_exam_contest":null},"questions":[{"question_id":1848,"title":"到目标元素的最小距离","title_slug":"minimum-distance-to-the-target-element","rating":1216.6376846517,"_hash":933877486,"paid_only":false},{"question_id":1849,"title":"将字符串拆分为递减的连续值","title_slug":"splitting-a-string-into-descending-consecutive-values","rating":1746.8757919578,"_hash":576619521,"paid_only":false},{"question_id":1850,"title":"邻位交换的最小次数","title_slug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number","rating":2073.0124645606,"_hash":1640158797,"paid_only":false},{"question_id":1851,"title":"包含每个查询的最小区间","title_slug":"minimum-interval-to-include-each-query","rating":2286.1378742318,"_hash":3250523305,"paid_only":false}],"company":{}},{"contest":{"id":396,"title":"第 51 场双周赛","title_slug":"biweekly-contest-51","start_time":1619879400,"is_ee_exam_contest":null},"questions":[{"question_id":1844,"title":"将所有数字用字符替换","title_slug":"replace-all-digits-with-characters","rating":1300.9041426403,"_hash":315817700,"paid_only":false},{"question_id":1845,"title":"座位预约管理系统","title_slug":"seat-reservation-manager","rating":1428.6729861424,"_hash":3281498525,"paid_only":false},{"question_id":1846,"title":"减小和重新排列数组后的最大元素","title_slug":"maximum-element-after-decreasing-and-rearranging","rating":1454.3901912166,"_hash":2606916888,"paid_only":false},{"question_id":1847,"title":"最近的房间","title_slug":"closest-room","rating":2081.7518764643,"_hash":1181589124,"paid_only":false}],"company":{}},{"contest":{"id":397,"title":"第 238 场周赛","title_slug":"weekly-contest-238","start_time":1619317800,"is_ee_exam_contest":null},"questions":[{"question_id":1837,"title":"K 进制表示下的各位数字总和","title_slug":"sum-of-digits-in-base-k","rating":1282.4111853142,"_hash":2970227389,"paid_only":false},{"question_id":1838,"title":"最高频元素的频数","title_slug":"frequency-of-the-most-frequent-element","rating":1876.3611046625,"_hash":2806558939,"paid_only":false},{"question_id":1839,"title":"所有元音按顺序排布的最长子字符串","title_slug":"longest-substring-of-all-vowels-in-order","rating":1580.3620959714,"_hash":3250155411,"paid_only":false},{"question_id":1840,"title":"最高建筑高度","title_slug":"maximum-building-height","rating":2374.1850487395,"_hash":3469541764,"paid_only":false}],"company":{}},{"contest":{"id":393,"title":"第 237 场周赛","title_slug":"weekly-contest-237","start_time":1618713000,"is_ee_exam_contest":null},"questions":[{"question_id":1832,"title":"判断句子是否为全字母句","title_slug":"check-if-the-sentence-is-pangram","rating":1166.78818332,"_hash":2544348147,"paid_only":false},{"question_id":1833,"title":"雪糕的最大数量","title_slug":"maximum-ice-cream-bars","rating":1252.7479413966,"_hash":3346548045,"paid_only":false},{"question_id":1834,"title":"单线程 CPU","title_slug":"single-threaded-cpu","rating":1797.7466000366,"_hash":3429532354,"paid_only":false},{"question_id":1835,"title":"所有数对按位与结果的异或和","title_slug":"find-xor-sum-of-all-pairs-bitwise-and","rating":1825.0056908946,"_hash":635111986,"paid_only":false}],"company":{}},{"contest":{"id":390,"title":"第 50 场双周赛","title_slug":"biweekly-contest-50","start_time":1618669800,"is_ee_exam_contest":null},"questions":[{"question_id":1827,"title":"最少操作使数组递增","title_slug":"minimum-operations-to-make-the-array-increasing","rating":1314.8600143277,"_hash":191620507,"paid_only":false},{"question_id":1828,"title":"统计一个圆中点的数目","title_slug":"queries-on-number-of-points-inside-a-circle","rating":1380.0192844155,"_hash":3128004049,"paid_only":false},{"question_id":1829,"title":"每个查询的最大异或值","title_slug":"maximum-xor-for-each-query","rating":1523.4113866454,"_hash":246275746,"paid_only":false},{"question_id":1830,"title":"使字符串有序的最少操作次数","title_slug":"minimum-number-of-operations-to-make-string-sorted","rating":2620.4181842249,"_hash":3807487459,"paid_only":false}],"company":{}},{"contest":{"id":391,"title":"第 236 场周赛","title_slug":"weekly-contest-236","start_time":1618108200,"is_ee_exam_contest":null},"questions":[{"question_id":1822,"title":"数组元素积的符号","title_slug":"sign-of-the-product-of-an-array","rating":1209.6571020247,"_hash":428851356,"paid_only":false},{"question_id":1823,"title":"找出游戏的获胜者","title_slug":"find-the-winner-of-the-circular-game","rating":1412.3053230205,"_hash":2586044711,"paid_only":false},{"question_id":1824,"title":"最少侧跳次数","title_slug":"minimum-sideway-jumps","rating":1778.4880620629,"_hash":3943793700,"paid_only":false},{"question_id":1825,"title":"求出 MK 平均值","title_slug":"finding-mk-average","rating":2395.8765531206,"_hash":2747291591,"paid_only":false}],"company":{}},{"contest":{"id":377,"title":"第 235 场周赛","title_slug":"weekly-contest-235","start_time":1617503400,"is_ee_exam_contest":null},"questions":[{"question_id":1816,"title":"截断句子","title_slug":"truncate-sentence","rating":1235.6114196155,"_hash":1592995979,"paid_only":false},{"question_id":1817,"title":"查找用户活跃分钟数","title_slug":"finding-the-users-active-minutes","rating":1360.3005775112,"_hash":3137406326,"paid_only":false},{"question_id":1818,"title":"绝对差值和","title_slug":"minimum-absolute-sum-difference","rating":1934.3556201811,"_hash":445102839,"paid_only":false},{"question_id":1819,"title":"序列中不同最大公约数的数目","title_slug":"number-of-different-subsequences-gcds","rating":2539.863726397,"_hash":2981004463,"paid_only":false}],"company":{}},{"contest":{"id":374,"title":"第 49 场双周赛","title_slug":"biweekly-contest-49","start_time":1617460200,"is_ee_exam_contest":null},"questions":[{"question_id":1812,"title":"判断国际象棋棋盘中一个格子的颜色","title_slug":"determine-color-of-a-chessboard-square","rating":1328.513147726,"_hash":3006434957,"paid_only":false},{"question_id":1813,"title":"句子相似性 III","title_slug":"sentence-similarity-iii","rating":1588.9690763997,"_hash":1688453804,"paid_only":false},{"question_id":1814,"title":"统计一个数组中好对子的数目","title_slug":"count-nice-pairs-in-an-array","rating":1737.8431142688,"_hash":1480696010,"paid_only":false},{"question_id":1815,"title":"得到新鲜甜甜圈的最多组数","title_slug":"maximum-number-of-groups-getting-fresh-donuts","rating":2559.4351004238,"_hash":2135431142,"paid_only":false}],"company":{}},{"contest":{"id":375,"title":"第 234 场周赛","title_slug":"weekly-contest-234","start_time":1616898600,"is_ee_exam_contest":null},"questions":[{"question_id":1805,"title":"字符串中不同整数的数目","title_slug":"number-of-different-integers-in-a-string","rating":1333.3138174157,"_hash":1970717834,"paid_only":false},{"question_id":1806,"title":"还原排列的最少操作步数","title_slug":"minimum-number-of-operations-to-reinitialize-a-permutation","rating":1491.4638194905,"_hash":3052741649,"paid_only":false},{"question_id":1807,"title":"替换字符串中的括号内容","title_slug":"evaluate-the-bracket-pairs-of-a-string","rating":1481.960807786,"_hash":59428399,"paid_only":false},{"question_id":1808,"title":"好因子的最大数目","title_slug":"maximize-number-of-nice-divisors","rating":2070.2102619334,"_hash":3237331717,"paid_only":false}],"company":{}},{"contest":{"id":371,"title":"第 233 场周赛","title_slug":"weekly-contest-233","start_time":1616293800,"is_ee_exam_contest":null},"questions":[{"question_id":1800,"title":"最大升序子数组和","title_slug":"maximum-ascending-subarray-sum","rating":1229.1709574783,"_hash":165157096,"paid_only":false},{"question_id":1801,"title":"积压订单中的订单总数","title_slug":"number-of-orders-in-the-backlog","rating":1711.1205064321,"_hash":3504355376,"paid_only":false},{"question_id":1802,"title":"有界数组中指定下标处的最大值","title_slug":"maximum-value-at-a-given-index-in-a-bounded-array","rating":1929.3184180196,"_hash":1767826160,"paid_only":false},{"question_id":1803,"title":"统计异或值在范围内的数对有多少","title_slug":"count-pairs-with-xor-in-a-range","rating":2479.3282985529,"_hash":2711761019,"paid_only":false}],"company":{}},{"contest":{"id":362,"title":"第 48 场双周赛","title_slug":"biweekly-contest-48","start_time":1616250600,"is_ee_exam_contest":null},"questions":[{"question_id":1796,"title":"字符串中第二大的数字","title_slug":"second-largest-digit-in-a-string","rating":1341.8397242604,"_hash":750727980,"paid_only":false},{"question_id":1797,"title":"设计一个验证系统","title_slug":"design-authentication-manager","rating":1534.0648719302,"_hash":3736820092,"paid_only":false},{"question_id":1798,"title":"你能构造出连续值的最大数目","title_slug":"maximum-number-of-consecutive-values-you-can-make","rating":1931.0849921121,"_hash":2407589215,"paid_only":false},{"question_id":1799,"title":"N 次操作后的最大分数和","title_slug":"maximize-score-after-n-operations","rating":2072.7264178313,"_hash":1580991625,"paid_only":false}],"company":{}},{"contest":{"id":363,"title":"第 232 场周赛","title_slug":"weekly-contest-232","start_time":1615689000,"is_ee_exam_contest":null},"questions":[{"question_id":1790,"title":"仅执行一次字符串交换能否使两个字符串相等","title_slug":"check-if-one-string-swap-can-make-strings-equal","rating":1300.8009461582,"_hash":3412927472,"paid_only":false},{"question_id":1791,"title":"找出星型图的中心节点","title_slug":"find-center-of-star-graph","rating":1286.7934718934,"_hash":2043678372,"paid_only":false},{"question_id":1792,"title":"最大平均通过率","title_slug":"maximum-average-pass-ratio","rating":1817.9978644712,"_hash":536430705,"paid_only":false},{"question_id":1793,"title":"好子数组的最大分数","title_slug":"maximum-score-of-a-good-subarray","rating":1945.7515607928,"_hash":3184596428,"paid_only":false}],"company":{}},{"contest":{"id":358,"title":"第 231 场周赛","title_slug":"weekly-contest-231","start_time":1615084200,"is_ee_exam_contest":null},"questions":[{"question_id":1784,"title":"检查二进制字符串字段","title_slug":"check-if-binary-string-has-at-most-one-segment-of-ones","rating":1206.1240971343,"_hash":3988446663,"paid_only":false},{"question_id":1785,"title":"构成特定和需要添加的最少元素","title_slug":"minimum-elements-to-add-to-form-a-given-sum","rating":1432.0967926378,"_hash":3102780834,"paid_only":false},{"question_id":1786,"title":"从第一个节点出发到最后一个节点的受限路径数","title_slug":"number-of-restricted-paths-from-first-to-last-node","rating":2078.5417326415,"_hash":1823999301,"paid_only":false},{"question_id":1787,"title":"使所有区间的异或结果为零","title_slug":"make-the-xor-of-all-segments-equal-to-zero","rating":2640.3824813624,"_hash":2908242202,"paid_only":false}],"company":{}},{"contest":{"id":355,"title":"第 47 场双周赛","title_slug":"biweekly-contest-47","start_time":1615041000,"is_ee_exam_contest":null},"questions":[{"question_id":1779,"title":"找到最近的有相同 X 或 Y 坐标的点","title_slug":"find-nearest-point-that-has-the-same-x-or-y-coordinate","rating":1259.5707438932,"_hash":2844126076,"paid_only":false},{"question_id":1780,"title":"判断一个数字是否可以表示成三的幂的和","title_slug":"check-if-number-is-a-sum-of-powers-of-three","rating":1505.82499953,"_hash":2201981126,"paid_only":false},{"question_id":1781,"title":"所有子字符串美丽值之和","title_slug":"sum-of-beauty-of-all-substrings","rating":1714.6960124182,"_hash":2430259702,"paid_only":false},{"question_id":1782,"title":"统计点对的数目","title_slug":"count-pairs-of-nodes","rating":2457.115574186,"_hash":3015354306,"paid_only":false}],"company":{}},{"contest":{"id":356,"title":"第 230 场周赛","title_slug":"weekly-contest-230","start_time":1614479400,"is_ee_exam_contest":null},"questions":[{"question_id":1773,"title":"统计匹配检索规则的物品数量","title_slug":"count-items-matching-a-rule","rating":1174.8589329736,"_hash":3589125798,"paid_only":false},{"question_id":1774,"title":"最接近目标价格的甜点成本","title_slug":"closest-dessert-cost","rating":1701.7584658834,"_hash":4279348799,"paid_only":false},{"question_id":1775,"title":"通过最少操作次数使数组的和相等","title_slug":"equal-sum-arrays-with-minimum-number-of-operations","rating":1850.4091449367,"_hash":2258141933,"paid_only":false},{"question_id":1776,"title":"车队 II","title_slug":"car-fleet-ii","rating":2530.6905139914,"_hash":1961138257,"paid_only":false}],"company":{}},{"contest":{"id":352,"title":"第 229 场周赛","title_slug":"weekly-contest-229","start_time":1613874600,"is_ee_exam_contest":null},"questions":[{"question_id":1768,"title":"交替合并字符串","title_slug":"merge-strings-alternately","rating":1166.5264284193,"_hash":1210757712,"paid_only":false},{"question_id":1769,"title":"移动所有球到每个盒子所需的最小操作数","title_slug":"minimum-number-of-operations-to-move-all-balls-to-each-box","rating":1294.7724244077,"_hash":1900062857,"paid_only":false},{"question_id":1770,"title":"执行乘法运算的最大分数","title_slug":"maximum-score-from-performing-multiplication-operations","rating":2068.0043466118,"_hash":3231265233,"paid_only":false},{"question_id":1771,"title":"由子序列构造的最长回文串的长度","title_slug":"maximize-palindrome-length-from-subsequences","rating":2182.054452981,"_hash":653475446,"paid_only":false}],"company":{}},{"contest":{"id":349,"title":"第 46 场双周赛","title_slug":"biweekly-contest-46","start_time":1613831400,"is_ee_exam_contest":null},"questions":[{"question_id":1763,"title":"最长的美好子字符串","title_slug":"longest-nice-substring","rating":1521.7133617698,"_hash":2102124703,"paid_only":false},{"question_id":1764,"title":"通过连接另一个数组的子数组得到一个数组","title_slug":"form-array-by-concatenating-subarrays-of-another-array","rating":1588.3835994255,"_hash":2182388811,"paid_only":false},{"question_id":1765,"title":"地图中的最高点","title_slug":"map-of-highest-peak","rating":1782.9801784101,"_hash":2722367436,"paid_only":false},{"question_id":1766,"title":"互质树","title_slug":"tree-of-coprimes","rating":2231.8099102949,"_hash":2806136994,"paid_only":false}],"company":{}},{"contest":{"id":350,"title":"第 228 场周赛","title_slug":"weekly-contest-228","start_time":1613269800,"is_ee_exam_contest":null},"questions":[{"question_id":1758,"title":"生成交替二进制字符串的最少操作数","title_slug":"minimum-changes-to-make-alternating-binary-string","rating":1353.629677812,"_hash":877809104,"paid_only":false},{"question_id":1759,"title":"统计同质子字符串的数目","title_slug":"count-number-of-homogenous-substrings","rating":1490.8990184504,"_hash":2434134348,"paid_only":false},{"question_id":1760,"title":"袋子里最少数目的球","title_slug":"minimum-limit-of-balls-in-a-bag","rating":1939.9323330472,"_hash":3825739123,"paid_only":false},{"question_id":1761,"title":"一个图中连通三元组的最小度数","title_slug":"minimum-degree-of-a-connected-trio-in-a-graph","rating":2005.2755755378,"_hash":1808561792,"paid_only":false}],"company":{}},{"contest":{"id":346,"title":"第 227 场周赛","title_slug":"weekly-contest-227","start_time":1612665000,"is_ee_exam_contest":null},"questions":[{"question_id":1752,"title":"检查数组是否经排序和轮转得到","title_slug":"check-if-array-is-sorted-and-rotated","rating":1324.5320836804,"_hash":2521310070,"paid_only":false},{"question_id":1753,"title":"移除石子的最大得分","title_slug":"maximum-score-from-removing-stones","rating":1487.5826663483,"_hash":185620528,"paid_only":false},{"question_id":1754,"title":"构造字典序最大的合并字符串","title_slug":"largest-merge-of-two-strings","rating":1828.6438563573,"_hash":1951198460,"paid_only":false},{"question_id":1755,"title":"最接近目标值的子序列和","title_slug":"closest-subsequence-sum","rating":2363.5096568214,"_hash":2473812468,"paid_only":false}],"company":{}},{"contest":{"id":343,"title":"第 45 场双周赛","title_slug":"biweekly-contest-45","start_time":1612621800,"is_ee_exam_contest":null},"questions":[{"question_id":1748,"title":"唯一元素的和","title_slug":"sum-of-unique-elements","rating":1228.4824438011,"_hash":1179475752,"paid_only":false},{"question_id":1749,"title":"任意子数组和的绝对值的最大值","title_slug":"maximum-absolute-sum-of-any-subarray","rating":1541.6176288991,"_hash":3267047320,"paid_only":false},{"question_id":1750,"title":"删除字符串两端相同字符后的最短长度","title_slug":"minimum-length-of-string-after-deleting-similar-ends","rating":1501.6846714598,"_hash":3164365433,"paid_only":false},{"question_id":1751,"title":"最多可以参加的会议数目 II","title_slug":"maximum-number-of-events-that-can-be-attended-ii","rating":2040.5621123027,"_hash":1944526967,"paid_only":false}],"company":{}},{"contest":{"id":344,"title":"第 226 场周赛","title_slug":"weekly-contest-226","start_time":1612060200,"is_ee_exam_contest":null},"questions":[{"question_id":1742,"title":"盒子中小球的最大数量","title_slug":"maximum-number-of-balls-in-a-box","rating":1277.9987709491,"_hash":9262188,"paid_only":false},{"question_id":1743,"title":"从相邻元素对还原数组","title_slug":"restore-the-array-from-adjacent-pairs","rating":1579.2309881035,"_hash":1018399535,"paid_only":false},{"question_id":1744,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","title_slug":"can-you-eat-your-favorite-candy-on-your-favorite-day","rating":1858.9581916885,"_hash":3529472171,"paid_only":false},{"question_id":1745,"title":"分割回文串 IV","title_slug":"palindrome-partitioning-iv","rating":1924.964639491,"_hash":1796587921,"paid_only":false}],"company":{}},{"contest":{"id":340,"title":"第 225 场周赛","title_slug":"weekly-contest-225","start_time":1611455400,"is_ee_exam_contest":null},"questions":[{"question_id":1736,"title":"替换隐藏数字得到的最晚时间","title_slug":"latest-time-by-replacing-hidden-digits","rating":1264.4836883082,"_hash":4210364548,"paid_only":false},{"question_id":1737,"title":"满足三条件之一需改变的最少字符数","title_slug":"change-minimum-characters-to-satisfy-one-of-three-conditions","rating":1952.7073399331,"_hash":3302467434,"paid_only":false},{"question_id":1738,"title":"找出第 K 大的异或坐标值","title_slug":"find-kth-largest-xor-coordinate-value","rating":1671.4657554194,"_hash":3021563284,"paid_only":false},{"question_id":1739,"title":"放置盒子","title_slug":"building-boxes","rating":2198.4642973466,"_hash":3570284045,"paid_only":false}],"company":{}},{"contest":{"id":337,"title":"第 44 场双周赛","title_slug":"biweekly-contest-44","start_time":1611412200,"is_ee_exam_contest":null},"questions":[{"question_id":1732,"title":"找到最高海拔","title_slug":"find-the-highest-altitude","rating":1256.6807087287,"_hash":445458274,"paid_only":false},{"question_id":1733,"title":"需要教语言的最少人数","title_slug":"minimum-number-of-people-to-teach","rating":1983.70440706,"_hash":2904534885,"paid_only":false},{"question_id":1734,"title":"解码异或后的排列","title_slug":"decode-xored-permutation","rating":2024.3797833173,"_hash":2691544887,"paid_only":false},{"question_id":1735,"title":"生成乘积数组的方案数","title_slug":"count-ways-to-make-array-with-product","rating":2499.5640490579,"_hash":3183792133,"paid_only":false}],"company":{}},{"contest":{"id":338,"title":"第 224 场周赛","title_slug":"weekly-contest-224","start_time":1610850600,"is_ee_exam_contest":null},"questions":[{"question_id":1725,"title":"可以形成最大正方形的矩形数目","title_slug":"number-of-rectangles-that-can-form-the-largest-square","rating":1229.4850365142,"_hash":2365828386,"paid_only":false},{"question_id":1726,"title":"同积元组","title_slug":"tuple-with-same-product","rating":1530.0343519239,"_hash":3977989551,"paid_only":false},{"question_id":1727,"title":"重新排列后的最大子矩阵","title_slug":"largest-submatrix-with-rearrangements","rating":1926.7059583253,"_hash":1815395495,"paid_only":false},{"question_id":1728,"title":"猫和老鼠 II","title_slug":"cat-and-mouse-ii","rating":2849.4841858619,"_hash":59158142,"paid_only":false}],"company":{}},{"contest":{"id":334,"title":"第 223 场周赛","title_slug":"weekly-contest-223","start_time":1610245800,"is_ee_exam_contest":null},"questions":[{"question_id":1720,"title":"解码异或后的数组","title_slug":"decode-xored-array","rating":1284.4514662456,"_hash":1123666202,"paid_only":false},{"question_id":1721,"title":"交换链表中的节点","title_slug":"swapping-nodes-in-a-linked-list","rating":1386.9203620297,"_hash":4028967949,"paid_only":false},{"question_id":1722,"title":"执行交换操作后的最小汉明距离","title_slug":"minimize-hamming-distance-after-swap-operations","rating":1892.1600619469,"_hash":3235710031,"paid_only":false},{"question_id":1723,"title":"完成所有工作的最短时间","title_slug":"find-minimum-time-to-finish-all-jobs","rating":2284.4463940346,"_hash":3104122930,"paid_only":false}],"company":{}},{"contest":{"id":331,"title":"第 43 场双周赛","title_slug":"biweekly-contest-43","start_time":1610202600,"is_ee_exam_contest":null},"questions":[{"question_id":1716,"title":"计算力扣银行的钱","title_slug":"calculate-money-in-leetcode-bank","rating":1294.5297034757,"_hash":1482821287,"paid_only":false},{"question_id":1717,"title":"删除子字符串的最大得分","title_slug":"maximum-score-from-removing-substrings","rating":1867.9916069568,"_hash":2035720970,"paid_only":false},{"question_id":1718,"title":"构建字典序最大的可行序列","title_slug":"construct-the-lexicographically-largest-valid-sequence","rating":2080.0425875741,"_hash":3869351459,"paid_only":false},{"question_id":1719,"title":"重构一棵树的方案数","title_slug":"number-of-ways-to-reconstruct-a-tree","rating":3018.4940165727,"_hash":254983687,"paid_only":false}],"company":{}},{"contest":{"id":332,"title":"第 222 场周赛","title_slug":"weekly-contest-222","start_time":1609641000,"is_ee_exam_contest":null},"questions":[{"question_id":1710,"title":"卡车上的最大单元数","title_slug":"maximum-units-on-a-truck","rating":1309.8100518373,"_hash":1405988519,"paid_only":false},{"question_id":1711,"title":"大餐计数","title_slug":"count-good-meals","rating":1797.8728515982,"_hash":519326923,"paid_only":false},{"question_id":1712,"title":"将数组分成三个子数组的方案数","title_slug":"ways-to-split-array-into-three-subarrays","rating":2078.6986769435,"_hash":1074334353,"paid_only":false},{"question_id":1713,"title":"得到子序列的最少操作次数","title_slug":"minimum-operations-to-make-a-subsequence","rating":2350.9694374861,"_hash":102575803,"paid_only":false}],"company":{}},{"contest":{"id":328,"title":"第 221 场周赛","title_slug":"weekly-contest-221","start_time":1609036200,"is_ee_exam_contest":null},"questions":[{"question_id":1704,"title":"判断字符串的两半是否相似","title_slug":"determine-if-string-halves-are-alike","rating":1207.7224406285,"_hash":611100168,"paid_only":false},{"question_id":1705,"title":"吃苹果的最大数目","title_slug":"maximum-number-of-eaten-apples","rating":1929.9086934334,"_hash":1687639369,"paid_only":false},{"question_id":1706,"title":"球会落何处","title_slug":"where-will-the-ball-fall","rating":1764.9170564773,"_hash":4006941957,"paid_only":false},{"question_id":1707,"title":"与数组中元素的最大异或值","title_slug":"maximum-xor-with-an-element-from-array","rating":2358.9669560824,"_hash":2768437968,"paid_only":false}],"company":{}},{"contest":{"id":325,"title":"第 42 场双周赛","title_slug":"biweekly-contest-42","start_time":1608993000,"is_ee_exam_contest":null},"questions":[{"question_id":1700,"title":"无法吃午餐的学生数量","title_slug":"number-of-students-unable-to-eat-lunch","rating":1404.1839222,"_hash":2553352145,"paid_only":false},{"question_id":1701,"title":"平均等待时间","title_slug":"average-waiting-time","rating":1436.3892315914,"_hash":2259000228,"paid_only":false},{"question_id":1702,"title":"修改后的最大二进制字符串","title_slug":"maximum-binary-string-after-change","rating":1825.4207082682,"_hash":1632383781,"paid_only":false},{"question_id":1703,"title":"得到连续 K 个 1 的最少相邻交换次数","title_slug":"minimum-adjacent-swaps-for-k-consecutive-ones","rating":2466.8891773908,"_hash":3562926842,"paid_only":false}],"company":{}},{"contest":{"id":326,"title":"第 220 场周赛","title_slug":"weekly-contest-220","start_time":1608431400,"is_ee_exam_contest":null},"questions":[{"question_id":1694,"title":"重新格式化电话号码","title_slug":"reformat-phone-number","rating":1321.9346201204,"_hash":117165936,"paid_only":false},{"question_id":1695,"title":"删除子数组的最大得分","title_slug":"maximum-erasure-value","rating":1528.7183829005,"_hash":3972794115,"paid_only":false},{"question_id":1696,"title":"跳跃游戏 VI","title_slug":"jump-game-vi","rating":1954.2533254344,"_hash":261533544,"paid_only":false},{"question_id":1697,"title":"检查边长度限制的路径是否存在","title_slug":"checking-existence-of-edge-length-limited-paths","rating":2300.1557840589,"_hash":3837200173,"paid_only":false}],"company":{}},{"contest":{"id":322,"title":"第 219 场周赛","title_slug":"weekly-contest-219","start_time":1607826600,"is_ee_exam_contest":null},"questions":[{"question_id":1688,"title":"比赛中的配对次数","title_slug":"count-of-matches-in-tournament","rating":1203.1408035909,"_hash":4026864126,"paid_only":false},{"question_id":1689,"title":"十-二进制数的最少数目","title_slug":"partitioning-into-minimum-number-of-deci-binary-numbers","rating":1355.3825442341,"_hash":2829216648,"paid_only":false},{"question_id":1690,"title":"石子游戏 VII","title_slug":"stone-game-vii","rating":1951.2096212775,"_hash":1168505902,"paid_only":false},{"question_id":1691,"title":"堆叠长方体的最大高度","title_slug":"maximum-height-by-stacking-cuboids","rating":2171.716066664,"_hash":1210455736,"paid_only":false}],"company":{}},{"contest":{"id":318,"title":"第 41 场双周赛","title_slug":"biweekly-contest-41","start_time":1607783400,"is_ee_exam_contest":null},"questions":[{"question_id":1684,"title":"统计一致字符串的数目","title_slug":"count-the-number-of-consistent-strings","rating":1288.5621697906,"_hash":859530118,"paid_only":false},{"question_id":1685,"title":"有序数组中差绝对值之和","title_slug":"sum-of-absolute-differences-in-a-sorted-array","rating":1495.715740828,"_hash":3892578893,"paid_only":false},{"question_id":1686,"title":"石子游戏 VI","title_slug":"stone-game-vi","rating":2000.8441804448,"_hash":1954801587,"paid_only":false},{"question_id":1687,"title":"从仓库到码头运输箱子","title_slug":"delivering-boxes-from-storage-to-ports","rating":2610.0826855063,"_hash":2436117632,"paid_only":false}],"company":{}},{"contest":{"id":319,"title":"第 218 场周赛","title_slug":"weekly-contest-218","start_time":1607221800,"is_ee_exam_contest":null},"questions":[{"question_id":1678,"title":"设计 Goal 解析器","title_slug":"goal-parser-interpretation","rating":1221.9872943569,"_hash":4227366527,"paid_only":false},{"question_id":1679,"title":"K 和数对的最大数目","title_slug":"max-number-of-k-sum-pairs","rating":1345.737168609,"_hash":31900963,"paid_only":false},{"question_id":1680,"title":"连接连续二进制数字","title_slug":"concatenation-of-consecutive-binary-numbers","rating":1629.5416832545,"_hash":1734419421,"paid_only":false},{"question_id":1681,"title":"最小不兼容性","title_slug":"minimum-incompatibility","rating":2389.9634276167,"_hash":2997800679,"paid_only":false}],"company":{}},{"contest":{"id":315,"title":"第 217 场周赛","title_slug":"weekly-contest-217","start_time":1606617000,"is_ee_exam_contest":null},"questions":[{"question_id":1672,"title":"最富有客户的资产总量","title_slug":"richest-customer-wealth","rating":1182.6489068544,"_hash":1487915794,"paid_only":false},{"question_id":1673,"title":"找出最具竞争力的子序列","title_slug":"find-the-most-competitive-subsequence","rating":1802.2256875356,"_hash":3057587548,"paid_only":false},{"question_id":1674,"title":"使数组互补的最少操作次数","title_slug":"minimum-moves-to-make-array-complementary","rating":2333.2401505813,"_hash":3510890976,"paid_only":false},{"question_id":1675,"title":"数组的最小偏移量","title_slug":"minimize-deviation-in-array","rating":2533.3027905062,"_hash":549109709,"paid_only":false}],"company":{}},{"contest":{"id":312,"title":"第 40 场双周赛","title_slug":"biweekly-contest-40","start_time":1606573800,"is_ee_exam_contest":null},"questions":[{"question_id":1668,"title":"最大重复子字符串","title_slug":"maximum-repeating-substring","rating":1395.5132479177,"_hash":1257680587,"paid_only":false},{"question_id":1669,"title":"合并两个链表","title_slug":"merge-in-between-linked-lists","rating":1428.1443796872,"_hash":235206650,"paid_only":false},{"question_id":1670,"title":"设计前中后队列","title_slug":"design-front-middle-back-queue","rating":1610.1866391145,"_hash":1316461889,"paid_only":false},{"question_id":1671,"title":"得到山形数组的最少删除次数","title_slug":"minimum-number-of-removals-to-make-mountain-array","rating":1912.8455659711,"_hash":509699848,"paid_only":false}],"company":{}},{"contest":{"id":313,"title":"第 216 场周赛","title_slug":"weekly-contest-216","start_time":1606012200,"is_ee_exam_contest":null},"questions":[{"question_id":1662,"title":"检查两个字符串数组是否相等","title_slug":"check-if-two-string-arrays-are-equivalent","rating":1217.1184374247,"_hash":340499017,"paid_only":false},{"question_id":1663,"title":"具有给定数值的最小字符串","title_slug":"smallest-string-with-a-given-numeric-value","rating":1460.5903088359,"_hash":438417277,"paid_only":false},{"question_id":1664,"title":"生成平衡数组的方案数","title_slug":"ways-to-make-a-fair-array","rating":1590.269030833,"_hash":435507573,"paid_only":false},{"question_id":1665,"title":"完成所有任务的最少初始能量","title_slug":"minimum-initial-energy-to-finish-tasks","rating":1900.8434122725,"_hash":4008128316,"paid_only":false}],"company":{}},{"contest":{"id":309,"title":"第 215 场周赛","title_slug":"weekly-contest-215","start_time":1605407400,"is_ee_exam_contest":null},"questions":[{"question_id":1656,"title":"设计有序流","title_slug":"design-an-ordered-stream","rating":1418.8205349928,"_hash":2422080240,"paid_only":false},{"question_id":1657,"title":"确定两个字符串是否接近","title_slug":"determine-if-two-strings-are-close","rating":1530.4652027753,"_hash":132633492,"paid_only":false},{"question_id":1658,"title":"将 x 减到 0 的最小操作数","title_slug":"minimum-operations-to-reduce-x-to-zero","rating":1817.224026292,"_hash":307769453,"paid_only":false},{"question_id":1659,"title":"最大化网格幸福感","title_slug":"maximize-grid-happiness","rating":2655.2178711909,"_hash":372608626,"paid_only":false}],"company":{}},{"contest":{"id":306,"title":"第 39 场双周赛","title_slug":"biweekly-contest-39","start_time":1605364200,"is_ee_exam_contest":null},"questions":[{"question_id":1652,"title":"拆炸弹","title_slug":"defuse-the-bomb","rating":1416.8961009909,"_hash":3839572104,"paid_only":false},{"question_id":1653,"title":"使字符串平衡的最少删除次数","title_slug":"minimum-deletions-to-make-string-balanced","rating":1793.8027487553,"_hash":2249718139,"paid_only":false},{"question_id":1654,"title":"到家的最少跳跃次数","title_slug":"minimum-jumps-to-reach-home","rating":2124.0317207867,"_hash":2681795867,"paid_only":false},{"question_id":1655,"title":"分配重复整数","title_slug":"distribute-repeating-integers","rating":2307.0161713185,"_hash":145069778,"paid_only":false}],"company":{}},{"contest":{"id":307,"title":"第 214 场周赛","title_slug":"weekly-contest-214","start_time":1604802600,"is_ee_exam_contest":null},"questions":[{"question_id":1646,"title":"获取生成数组中的最大值","title_slug":"get-maximum-in-generated-array","rating":1301.4027057843,"_hash":3899459924,"paid_only":false},{"question_id":1647,"title":"字符频次唯一的最小删除次数","title_slug":"minimum-deletions-to-make-character-frequencies-unique","rating":1509.5432131875,"_hash":2693685785,"paid_only":false},{"question_id":1648,"title":"销售价值减少的颜色球","title_slug":"sell-diminishing-valued-colored-balls","rating":2050.2553211463,"_hash":4033162779,"paid_only":false},{"question_id":1649,"title":"通过指令创建有序数组","title_slug":"create-sorted-array-through-instructions","rating":2207.8565809952,"_hash":552299541,"paid_only":false}],"company":{}},{"contest":{"id":303,"title":"第 213 场周赛","title_slug":"weekly-contest-213","start_time":1604197800,"is_ee_exam_contest":null},"questions":[{"question_id":1640,"title":"能否连接形成数组","title_slug":"check-array-formation-through-concatenation","rating":1524.3227469,"_hash":1530442140,"paid_only":false},{"question_id":1641,"title":"统计字典序元音字符串的数目","title_slug":"count-sorted-vowel-strings","rating":1519.1715594347,"_hash":2576790821,"paid_only":false},{"question_id":1642,"title":"可以到达的最远建筑","title_slug":"furthest-building-you-can-reach","rating":1962.2005269503,"_hash":1972718658,"paid_only":false},{"question_id":1643,"title":"第 K 条最小指令","title_slug":"kth-smallest-instructions","rating":2079.9846866239,"_hash":2988782714,"paid_only":false}],"company":{}},{"contest":{"id":300,"title":"第 38 场双周赛","title_slug":"biweekly-contest-38","start_time":1604154600,"is_ee_exam_contest":null},"questions":[{"question_id":1636,"title":"按照频率将数组升序排序","title_slug":"sort-array-by-increasing-frequency","rating":1430.3429533629,"_hash":2735293288,"paid_only":false},{"question_id":1637,"title":"两点之间不包含任何点的最宽垂直区域","title_slug":"widest-vertical-area-between-two-points-containing-no-points","rating":1486.764933431,"_hash":3608687869,"paid_only":false},{"question_id":1638,"title":"统计只差一个字符的子串数目","title_slug":"count-substrings-that-differ-by-one-character","rating":1744.7611048301,"_hash":3230369611,"paid_only":false},{"question_id":1639,"title":"通过给定词典构造目标字符串的方案数","title_slug":"number-of-ways-to-form-a-target-string-given-a-dictionary","rating":2081.6909344021,"_hash":4276174201,"paid_only":false}],"company":{}},{"contest":{"id":301,"title":"第 212 场周赛","title_slug":"weekly-contest-212","start_time":1603593000,"is_ee_exam_contest":null},"questions":[{"question_id":1629,"title":"按键持续时间最长的键","title_slug":"slowest-key","rating":1315.3715333947,"_hash":1481976566,"paid_only":false},{"question_id":1630,"title":"等差子数组","title_slug":"arithmetic-subarrays","rating":1421.9944676861,"_hash":3454110996,"paid_only":false},{"question_id":1631,"title":"最小体力消耗路径","title_slug":"path-with-minimum-effort","rating":1947.5013967785,"_hash":3894947933,"paid_only":false},{"question_id":1632,"title":"矩阵转换后的秩","title_slug":"rank-transform-of-a-matrix","rating":2529.5251086936,"_hash":2488135056,"paid_only":false}],"company":{}},{"contest":{"id":297,"title":"第 211 场周赛","title_slug":"weekly-contest-211","start_time":1602988200,"is_ee_exam_contest":null},"questions":[{"question_id":1624,"title":"两个相同字符之间的最长子字符串","title_slug":"largest-substring-between-two-equal-characters","rating":1281.9771427903,"_hash":2249355269,"paid_only":false},{"question_id":1625,"title":"执行操作后字典序最小的字符串","title_slug":"lexicographically-smallest-string-after-applying-operations","rating":1992.0032292739,"_hash":3307683900,"paid_only":false},{"question_id":1626,"title":"无矛盾的最佳球队","title_slug":"best-team-with-no-conflicts","rating":2027.3839266711,"_hash":205364228,"paid_only":false},{"question_id":1627,"title":"带阈值的图连通性","title_slug":"graph-connectivity-with-threshold","rating":2221.3538766773,"_hash":3632361978,"paid_only":false}],"company":{}},{"contest":{"id":294,"title":"第 37 场双周赛","title_slug":"biweekly-contest-37","start_time":1602945000,"is_ee_exam_contest":null},"questions":[{"question_id":1619,"title":"删除某些元素后的数组均值","title_slug":"mean-of-array-after-removing-some-elements","rating":1374.3549007913,"_hash":882246184,"paid_only":false},{"question_id":1620,"title":"网络信号最好的坐标","title_slug":"coordinate-with-maximum-network-quality","rating":1665.24907247,"_hash":1092713458,"paid_only":false},{"question_id":1621,"title":"大小为 K 的不重叠线段的数目","title_slug":"number-of-sets-of-k-non-overlapping-line-segments","rating":2198.3290662783,"_hash":3081794904,"paid_only":false},{"question_id":1622,"title":"奇妙序列","title_slug":"fancy-sequence","rating":2476.451764287,"_hash":976252372,"paid_only":false}],"company":{}},{"contest":{"id":295,"title":"第 210 场周赛","title_slug":"weekly-contest-210","start_time":1602383400,"is_ee_exam_contest":null},"questions":[{"question_id":1614,"title":"括号的最大嵌套深度","title_slug":"maximum-nesting-depth-of-the-parentheses","rating":1322.8302750313,"_hash":2312427727,"paid_only":false},{"question_id":1615,"title":"最大网络秩","title_slug":"maximal-network-rank","rating":1521.9977490324,"_hash":3529094278,"paid_only":false},{"question_id":1616,"title":"分割两个字符串得到回文串","title_slug":"split-two-strings-to-make-palindrome","rating":1868.1914861381,"_hash":1651110316,"paid_only":false},{"question_id":1617,"title":"统计子树中城市之间最大距离","title_slug":"count-subtrees-with-max-distance-between-cities","rating":2308.6545905335,"_hash":540821611,"paid_only":false}],"company":{}},{"contest":{"id":291,"title":"第 209 场周赛","title_slug":"weekly-contest-209","start_time":1601778600,"is_ee_exam_contest":null},"questions":[{"question_id":1608,"title":"特殊数组的特征值","title_slug":"special-array-with-x-elements-greater-than-or-equal-x","rating":1369.614440152,"_hash":2737402297,"paid_only":false},{"question_id":1609,"title":"奇偶树","title_slug":"even-odd-tree","rating":1438.223135905,"_hash":3144113364,"paid_only":false},{"question_id":1610,"title":"可见点的最大数目","title_slug":"maximum-number-of-visible-points","rating":2147.1828941776,"_hash":2493499746,"paid_only":false},{"question_id":1611,"title":"使整数变为 0 的最少操作次数","title_slug":"minimum-one-bit-operations-to-make-integers-zero","rating":2345.3418191684,"_hash":3744485747,"paid_only":false}],"company":{}},{"contest":{"id":288,"title":"第 36 场双周赛","title_slug":"biweekly-contest-36","start_time":1601735400,"is_ee_exam_contest":null},"questions":[{"question_id":1603,"title":"设计停车系统","title_slug":"design-parking-system","rating":1324.1757200103,"_hash":2754272500,"paid_only":false},{"question_id":1604,"title":"警告一小时内使用相同员工卡大于等于三次的人","title_slug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period","rating":1606.2185826486,"_hash":1756727384,"paid_only":false},{"question_id":1605,"title":"给定行和列的和求可行矩阵","title_slug":"find-valid-matrix-given-row-and-column-sums","rating":1867.8619694847,"_hash":2355594556,"paid_only":false},{"question_id":1606,"title":"找到处理最多请求的服务器","title_slug":"find-servers-that-handled-most-number-of-requests","rating":2275.7337818748,"_hash":3246928465,"paid_only":false}],"company":{}},{"contest":{"id":289,"title":"第 208 场周赛","title_slug":"weekly-contest-208","start_time":1601173800,"is_ee_exam_contest":null},"questions":[{"question_id":1598,"title":"文件夹操作日志搜集器","title_slug":"crawler-log-folder","rating":1297.3006230632,"_hash":3772660335,"paid_only":false},{"question_id":1599,"title":"经营摩天轮的最大利润","title_slug":"maximum-profit-of-operating-a-centennial-wheel","rating":1548.0854419238,"_hash":2972412900,"paid_only":false},{"question_id":1600,"title":"王位继承顺序","title_slug":"throne-inheritance","rating":1768.623896829,"_hash":3383805178,"paid_only":false},{"question_id":1601,"title":"最多可达成的换楼请求数目","title_slug":"maximum-number-of-achievable-transfer-requests","rating":2118.7923652824,"_hash":2896936333,"paid_only":false}],"company":{}},{"contest":{"id":278,"title":"第 207 场周赛","title_slug":"weekly-contest-207","start_time":1600569000,"is_ee_exam_contest":null},"questions":[{"question_id":1592,"title":"重新排列单词间的空格","title_slug":"rearrange-spaces-between-words","rating":1362.6613797387,"_hash":3611656717,"paid_only":false},{"question_id":1593,"title":"拆分字符串使唯一子字符串的数目最大","title_slug":"split-a-string-into-the-max-number-of-unique-substrings","rating":1739.5831401172,"_hash":1236982780,"paid_only":false},{"question_id":1594,"title":"矩阵的最大非负积","title_slug":"maximum-non-negative-product-in-a-matrix","rating":1807.4618172386,"_hash":1191385639,"paid_only":false},{"question_id":1595,"title":"连通两组点的最小成本","title_slug":"minimum-cost-to-connect-two-groups-of-points","rating":2537.7965575726,"_hash":883833496,"paid_only":false}],"company":{}},{"contest":{"id":266,"title":"第 35 场双周赛","title_slug":"biweekly-contest-35","start_time":1600525800,"is_ee_exam_contest":null},"questions":[{"question_id":1588,"title":"所有奇数长度子数组的和","title_slug":"sum-of-all-odd-length-subarrays","rating":1408.7923640745,"_hash":1846293530,"paid_only":false},{"question_id":1589,"title":"所有排列中的最大和","title_slug":"maximum-sum-obtained-of-any-permutation","rating":1871.3112059413,"_hash":1702334810,"paid_only":false},{"question_id":1590,"title":"使数组和能被 P 整除","title_slug":"make-sum-divisible-by-p","rating":2038.8592725467,"_hash":2279246890,"paid_only":false},{"question_id":1591,"title":"奇怪的打印机 II","title_slug":"strange-printer-ii","rating":2290.9040038639,"_hash":1646187623,"paid_only":false}],"company":{}},{"contest":{"id":267,"title":"第 206 场周赛","title_slug":"weekly-contest-206","start_time":1599964200,"is_ee_exam_contest":null},"questions":[{"question_id":1582,"title":"二进制矩阵中的特殊位置","title_slug":"special-positions-in-a-binary-matrix","rating":1321.2748903388,"_hash":3877437521,"paid_only":false},{"question_id":1583,"title":"统计不开心的朋友","title_slug":"count-unhappy-friends","rating":1658.3305547865,"_hash":743759650,"paid_only":false},{"question_id":1584,"title":"连接所有点的最小费用","title_slug":"min-cost-to-connect-all-points","rating":1857.6431822094,"_hash":3880639230,"paid_only":false},{"question_id":1585,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","title_slug":"check-if-string-is-transformable-with-substring-sort-operations","rating":2333.0078041754,"_hash":3631493170,"paid_only":false}],"company":{}},{"contest":{"id":260,"title":"第 205 场周赛","title_slug":"weekly-contest-205","start_time":1599359400,"is_ee_exam_contest":null},"questions":[{"question_id":1576,"title":"替换所有的问号","title_slug":"replace-all-s-to-avoid-consecutive-repeating-characters","rating":1368.0043517215,"_hash":4233152869,"paid_only":false},{"question_id":1577,"title":"数的平方等于两数乘积的方法数","title_slug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers","rating":1593.8926580448,"_hash":1260215787,"paid_only":false},{"question_id":1578,"title":"使绳子变成彩色的最短时间","title_slug":"minimum-time-to-make-rope-colorful","rating":1574.0392121288,"_hash":3548853356,"paid_only":false},{"question_id":1579,"title":"保证图可完全遍历","title_slug":"remove-max-number-of-edges-to-keep-graph-fully-traversable","rating":2131.7917160422,"_hash":3698564207,"paid_only":false}],"company":{}},{"contest":{"id":256,"title":"第 34 场双周赛","title_slug":"biweekly-contest-34","start_time":1599316200,"is_ee_exam_contest":null},"questions":[{"question_id":1572,"title":"矩阵对角线元素的和","title_slug":"matrix-diagonal-sum","rating":1280.2941647587,"_hash":197546078,"paid_only":false},{"question_id":1573,"title":"分割字符串的方案数","title_slug":"number-of-ways-to-split-a-string","rating":1590.547713663,"_hash":3464418220,"paid_only":false},{"question_id":1574,"title":"删除最短的子数组使剩余数组有序","title_slug":"shortest-subarray-to-be-removed-to-make-array-sorted","rating":1931.7335479582,"_hash":236080983,"paid_only":false},{"question_id":1575,"title":"统计所有可行路径","title_slug":"count-all-possible-routes","rating":2055.0970201875,"_hash":1387834419,"paid_only":false}],"company":{}},{"contest":{"id":257,"title":"第 204 场周赛","title_slug":"weekly-contest-204","start_time":1598754600,"is_ee_exam_contest":null},"questions":[{"question_id":1566,"title":"重复至少 K 次且长度为 M 的模式","title_slug":"detect-pattern-of-length-m-repeated-k-or-more-times","rating":1486.4687014051,"_hash":843769556,"paid_only":false},{"question_id":1567,"title":"乘积为正数的最长子数组长度","title_slug":"maximum-length-of-subarray-with-positive-product","rating":1710.3243520032,"_hash":2678350009,"paid_only":false},{"question_id":1568,"title":"使陆地分离的最少天数","title_slug":"minimum-number-of-days-to-disconnect-island","rating":2208.5532172086,"_hash":187940940,"paid_only":false},{"question_id":1569,"title":"将子数组重新排序得到同一个二叉搜索树的方案数","title_slug":"number-of-ways-to-reorder-array-to-get-same-bst","rating":2288.2117442123,"_hash":1392708979,"paid_only":false}],"company":{}},{"contest":{"id":244,"title":"第 203 场周赛","title_slug":"weekly-contest-203","start_time":1598149800,"is_ee_exam_contest":null},"questions":[{"question_id":1560,"title":"圆形赛道上经过次数最多的扇区","title_slug":"most-visited-sector-in-a-circular-track","rating":1443.2353621969,"_hash":2434964692,"paid_only":false},{"question_id":1561,"title":"你可以获得的最大硬币数目","title_slug":"maximum-number-of-coins-you-can-get","rating":1405.5786892723,"_hash":2336939814,"paid_only":false},{"question_id":1562,"title":"查找大小为 M 的最新分组","title_slug":"find-latest-group-of-size-m","rating":1928.2304187946,"_hash":239079794,"paid_only":false},{"question_id":1563,"title":"石子游戏 V","title_slug":"stone-game-v","rating":2087.2049275667,"_hash":3581728008,"paid_only":false}],"company":{}},{"contest":{"id":241,"title":"第 33 场双周赛","title_slug":"biweekly-contest-33","start_time":1598106600,"is_ee_exam_contest":null},"questions":[{"question_id":1556,"title":"千位分隔数","title_slug":"thousand-separator","rating":1271.3776510163,"_hash":1619143061,"paid_only":false},{"question_id":1557,"title":"可以到达所有点的最少点数目","title_slug":"minimum-number-of-vertices-to-reach-all-nodes","rating":1512.3323577063,"_hash":4183393481,"paid_only":false},{"question_id":1558,"title":"得到目标数组的最少函数调用次数","title_slug":"minimum-numbers-of-function-calls-to-make-target-array","rating":1637.0082208814,"_hash":2725160392,"paid_only":false},{"question_id":1559,"title":"二维网格图中探测环","title_slug":"detect-cycles-in-2d-grid","rating":1837.8252904904,"_hash":2216360450,"paid_only":false}],"company":{}},{"contest":{"id":242,"title":"第 202 场周赛","title_slug":"weekly-contest-202","start_time":1597545000,"is_ee_exam_contest":null},"questions":[{"question_id":1550,"title":"存在连续三个奇数的数组","title_slug":"three-consecutive-odds","rating":1221.6801628274,"_hash":3686317773,"paid_only":false},{"question_id":1551,"title":"使数组中所有元素相等的最小操作数","title_slug":"minimum-operations-to-make-array-equal","rating":1293.4904281819,"_hash":3168618130,"paid_only":false},{"question_id":1552,"title":"两球之间的磁力","title_slug":"magnetic-force-between-two-balls","rating":1919.7433862082,"_hash":1049961856,"paid_only":false},{"question_id":1553,"title":"吃掉 N 个橘子的最少天数","title_slug":"minimum-number-of-days-to-eat-n-oranges","rating":2048.0976546787,"_hash":3077217367,"paid_only":false}],"company":{}},{"contest":{"id":238,"title":"第 201 场周赛","title_slug":"weekly-contest-201","start_time":1596940200,"is_ee_exam_contest":null},"questions":[{"question_id":1544,"title":"整理字符串","title_slug":"make-the-string-great","rating":1344.226133202,"_hash":3183111073,"paid_only":false},{"question_id":1545,"title":"找出第 N 个二进制字符串中的第 K 位","title_slug":"find-kth-bit-in-nth-binary-string","rating":1479.4837595809,"_hash":886158615,"paid_only":false},{"question_id":1546,"title":"和为目标值且不重叠的非空子数组的最大数目","title_slug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target","rating":1855.377046154,"_hash":2479293617,"paid_only":false},{"question_id":1547,"title":"切棍子的最小成本","title_slug":"minimum-cost-to-cut-a-stick","rating":2116.493528295,"_hash":688063365,"paid_only":false}],"company":{}},{"contest":{"id":237,"title":"第 32 场双周赛","title_slug":"biweekly-contest-32","start_time":1596897000,"is_ee_exam_contest":null},"questions":[{"question_id":1539,"title":"第 k 个缺失的正整数","title_slug":"kth-missing-positive-number","rating":1295.4970938463,"_hash":3184774485,"paid_only":false},{"question_id":1540,"title":"K 次操作转变字符串","title_slug":"can-convert-string-in-k-moves","rating":1631.338145683,"_hash":3391560370,"paid_only":false},{"question_id":1541,"title":"平衡括号字符串的最少插入次数","title_slug":"minimum-insertions-to-balance-a-parentheses-string","rating":1759.0197295594,"_hash":268274286,"paid_only":false},{"question_id":1542,"title":"找出最长的超赞子字符串","title_slug":"find-longest-awesome-substring","rating":2221.7336557442,"_hash":2877331205,"paid_only":false}],"company":{}},{"contest":{"id":235,"title":"第 200 场周赛","title_slug":"weekly-contest-200","start_time":1596335400,"is_ee_exam_contest":null},"questions":[{"question_id":1534,"title":"统计好三元组","title_slug":"count-good-triplets","rating":1279.3383966145,"_hash":1278665216,"paid_only":false},{"question_id":1535,"title":"找出数组游戏的赢家","title_slug":"find-the-winner-of-an-array-game","rating":1433.0795554833,"_hash":3951026299,"paid_only":false},{"question_id":1536,"title":"排布二进制网格的最少交换次数","title_slug":"minimum-swaps-to-arrange-a-binary-grid","rating":1880.5909929633,"_hash":2214262554,"paid_only":false},{"question_id":1537,"title":"最大得分","title_slug":"get-the-maximum-score","rating":1961.4987013156,"_hash":3315363657,"paid_only":false}],"company":{}},{"contest":{"id":228,"title":"第 199 场周赛","title_slug":"weekly-contest-199","start_time":1595730600,"is_ee_exam_contest":null},"questions":[{"question_id":1528,"title":"重新排列字符串","title_slug":"shuffle-string","rating":1193.1328299324,"_hash":3940769236,"paid_only":false},{"question_id":1529,"title":"最少的后缀翻转次数","title_slug":"minimum-suffix-flips","rating":1392.6601629182,"_hash":2324786150,"paid_only":false},{"question_id":1530,"title":"好叶子节点对的数量","title_slug":"number-of-good-leaf-nodes-pairs","rating":1745.6580748712,"_hash":909563687,"paid_only":false},{"question_id":1531,"title":"压缩字符串 II","title_slug":"string-compression-ii","rating":2575.9570281316,"_hash":2845488076,"paid_only":false}],"company":{}},{"contest":{"id":232,"title":"第 31 场双周赛","title_slug":"biweekly-contest-31","start_time":1595687400,"is_ee_exam_contest":null},"questions":[{"question_id":1523,"title":"在区间范围内统计奇数数目","title_slug":"count-odd-numbers-in-an-interval-range","rating":1209.3722198224,"_hash":1294188975,"paid_only":false},{"question_id":1524,"title":"和为奇数的子数组数目","title_slug":"number-of-sub-arrays-with-odd-sum","rating":1610.569398159,"_hash":1757955047,"paid_only":false},{"question_id":1525,"title":"字符串的好分割数目","title_slug":"number-of-good-ways-to-split-a-string","rating":1499.7136257352,"_hash":1226888142,"paid_only":false},{"question_id":1526,"title":"形成目标数组的子数组最少增加次数","title_slug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array","rating":1872.0350138774,"_hash":374038880,"paid_only":false}],"company":{}},{"contest":{"id":226,"title":"第 198 场周赛","title_slug":"weekly-contest-198","start_time":1595125800,"is_ee_exam_contest":null},"questions":[{"question_id":1518,"title":"换水问题","title_slug":"water-bottles","rating":1245.2999833877,"_hash":2655862888,"paid_only":false},{"question_id":1519,"title":"子树中标签相同的节点数","title_slug":"number-of-nodes-in-the-sub-tree-with-the-same-label","rating":1808.787108831,"_hash":2964689219,"paid_only":false},{"question_id":1520,"title":"最多的不重叠子字符串","title_slug":"maximum-number-of-non-overlapping-substrings","rating":2362.6480880348,"_hash":2687486440,"paid_only":false},{"question_id":1521,"title":"找到最接近目标值的函数值","title_slug":"find-a-value-of-a-mysterious-function-closest-to-target","rating":2383.7724811656,"_hash":3856718514,"paid_only":false}],"company":{}},{"contest":{"id":221,"title":"第 197 场周赛","title_slug":"weekly-contest-197","start_time":1594521000,"is_ee_exam_contest":null},"questions":[{"question_id":1512,"title":"好数对的数目","title_slug":"number-of-good-pairs","rating":1160.8899403409,"_hash":1299928804,"paid_only":false},{"question_id":1513,"title":"仅含 1 的子串数","title_slug":"number-of-substrings-with-only-1s","rating":1351.4184681108,"_hash":2562103296,"paid_only":false},{"question_id":1514,"title":"概率最大的路径","title_slug":"path-with-maximum-probability","rating":1846.4077077642,"_hash":1014740120,"paid_only":false},{"question_id":1515,"title":"服务中心的最佳位置","title_slug":"best-position-for-a-service-centre","rating":2156.9515428364,"_hash":4201921653,"paid_only":false}],"company":{}},{"contest":{"id":222,"title":"第 30 场双周赛","title_slug":"biweekly-contest-30","start_time":1594477800,"is_ee_exam_contest":null},"questions":[{"question_id":1507,"title":"转变日期格式","title_slug":"reformat-date","rating":1283.51021448,"_hash":143031678,"paid_only":false},{"question_id":1508,"title":"子数组和排序后的区间和","title_slug":"range-sum-of-sorted-subarray-sums","rating":1402.0863615706,"_hash":1762249323,"paid_only":false},{"question_id":1509,"title":"三次操作后最大值与最小值的最小差","title_slug":"minimum-difference-between-largest-and-smallest-value-in-three-moves","rating":1653.0356626499,"_hash":929645229,"paid_only":false},{"question_id":1510,"title":"石子游戏 IV","title_slug":"stone-game-iv","rating":1786.9268132617,"_hash":2203655753,"paid_only":false}],"company":{}},{"contest":{"id":219,"title":"第 196 场周赛","title_slug":"weekly-contest-196","start_time":1593916200,"is_ee_exam_contest":null},"questions":[{"question_id":1502,"title":"判断能否形成等差数列","title_slug":"can-make-arithmetic-progression-from-sequence","rating":1154.828067979,"_hash":2581904260,"paid_only":false},{"question_id":1503,"title":"所有蚂蚁掉下来前的最后一刻","title_slug":"last-moment-before-all-ants-fall-out-of-a-plank","rating":1618.6016480451,"_hash":1365148367,"paid_only":false},{"question_id":1504,"title":"统计全 1 子矩形","title_slug":"count-submatrices-with-all-ones","rating":1845.0428731248,"_hash":3023068102,"paid_only":false},{"question_id":1505,"title":"最多 K 次交换相邻数位后得到的最小整数","title_slug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits","rating":2336.5210003185,"_hash":1218347826,"paid_only":false}],"company":{}},{"contest":{"id":215,"title":"第 195 场周赛","title_slug":"weekly-contest-195","start_time":1593311400,"is_ee_exam_contest":null},"questions":[{"question_id":1496,"title":"判断路径是否相交","title_slug":"path-crossing","rating":1508.099765827,"_hash":3461348977,"paid_only":false},{"question_id":1497,"title":"检查数组对是否可以被 k 整除","title_slug":"check-if-array-pairs-are-divisible-by-k","rating":1787.2310751136,"_hash":1924690238,"paid_only":false},{"question_id":1498,"title":"满足条件的子序列数目","title_slug":"number-of-subsequences-that-satisfy-the-given-sum-condition","rating":2276.4233585631,"_hash":2057048497,"paid_only":false},{"question_id":1499,"title":"满足不等式的最大值","title_slug":"max-value-of-equation","rating":2456.3900212097,"_hash":446968474,"paid_only":false}],"company":{}},{"contest":{"id":216,"title":"第 29 场双周赛","title_slug":"biweekly-contest-29","start_time":1593268200,"is_ee_exam_contest":null},"questions":[{"question_id":1491,"title":"去掉最低工资和最高工资后的工资平均值","title_slug":"average-salary-excluding-the-minimum-and-maximum-salary","rating":1201.3497763919,"_hash":4253187558,"paid_only":false},{"question_id":1492,"title":"n 的第 k 个因子","title_slug":"the-kth-factor-of-n","rating":1231.999241335,"_hash":2168825861,"paid_only":false},{"question_id":1493,"title":"删掉一个元素以后全为 1 的最长子数组","title_slug":"longest-subarray-of-1s-after-deleting-one-element","rating":1423.0355763093,"_hash":3989735780,"paid_only":false},{"question_id":1494,"title":"并行课程 II","title_slug":"parallel-courses-ii","rating":2081.8087755451,"_hash":2963413938,"paid_only":false}],"company":{}},{"contest":{"id":213,"title":"第 194 场周赛","title_slug":"weekly-contest-194","start_time":1592706600,"is_ee_exam_contest":null},"questions":[{"question_id":1486,"title":"数组异或操作","title_slug":"xor-operation-in-an-array","rating":1180.923623906,"_hash":1038100878,"paid_only":false},{"question_id":1487,"title":"保证文件名唯一","title_slug":"making-file-names-unique","rating":1696.9920075471,"_hash":3554577128,"paid_only":false},{"question_id":1488,"title":"避免洪水泛滥","title_slug":"avoid-flood-in-the-city","rating":1973.7407637067,"_hash":178132881,"paid_only":false},{"question_id":1489,"title":"找到最小生成树里的关键边和伪关键边","title_slug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree","rating":2571.552028121,"_hash":2415029607,"paid_only":false}],"company":{}},{"contest":{"id":209,"title":"第 193 场周赛","title_slug":"weekly-contest-193","start_time":1592101800,"is_ee_exam_contest":null},"questions":[{"question_id":1480,"title":"一维数组的动态和","title_slug":"running-sum-of-1d-array","rating":1104.7359028407,"_hash":1062871842,"paid_only":false},{"question_id":1481,"title":"不同整数的最少数目","title_slug":"least-number-of-unique-integers-after-k-removals","rating":1284.3625733813,"_hash":970766553,"paid_only":false},{"question_id":1482,"title":"制作 m 束花所需的最少天数","title_slug":"minimum-number-of-days-to-make-m-bouquets","rating":1945.5095833982,"_hash":1858278973,"paid_only":false},{"question_id":1483,"title":"树节点的第 K 个祖先","title_slug":"kth-ancestor-of-a-tree-node","rating":2115.0911494487,"_hash":2000679742,"paid_only":false}],"company":{}},{"contest":{"id":210,"title":"第 28 场双周赛","title_slug":"biweekly-contest-28","start_time":1592058600,"is_ee_exam_contest":null},"questions":[{"question_id":1475,"title":"商品折扣后的最终价格","title_slug":"final-prices-with-a-special-discount-in-a-shop","rating":1212.2606422181,"_hash":3670047480,"paid_only":false},{"question_id":1476,"title":"子矩形查询","title_slug":"subrectangle-queries","rating":1326.4047670018,"_hash":3615903863,"paid_only":false},{"question_id":1477,"title":"找两个和为目标值且不重叠的子数组","title_slug":"find-two-non-overlapping-sub-arrays-each-with-target-sum","rating":1850.5506342426,"_hash":1480774126,"paid_only":false},{"question_id":1478,"title":"安排邮筒","title_slug":"allocate-mailboxes","rating":2190.1757477854,"_hash":2258623827,"paid_only":false}],"company":{}},{"contest":{"id":207,"title":"第 192 场周赛","title_slug":"weekly-contest-192","start_time":1591497000,"is_ee_exam_contest":null},"questions":[{"question_id":1470,"title":"重新排列数组","title_slug":"shuffle-the-array","rating":1120.698183624,"_hash":739255468,"paid_only":false},{"question_id":1471,"title":"数组中的 k 个最强值","title_slug":"the-k-strongest-values-in-an-array","rating":1332.4653491345,"_hash":1337689329,"paid_only":false},{"question_id":1472,"title":"设计浏览器历史记录","title_slug":"design-browser-history","rating":1453.7818053022,"_hash":791863919,"paid_only":false},{"question_id":1473,"title":"粉刷房子 III","title_slug":"paint-house-iii","rating":2056.335494216,"_hash":741778858,"paid_only":false}],"company":{}},{"contest":{"id":203,"title":"第 191 场周赛","title_slug":"weekly-contest-191","start_time":1590892200,"is_ee_exam_contest":null},"questions":[{"question_id":1464,"title":"数组中两元素的最大乘积","title_slug":"maximum-product-of-two-elements-in-an-array","rating":1121.0677596555,"_hash":1656858690,"paid_only":false},{"question_id":1465,"title":"切割后面积最大的蛋糕","title_slug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts","rating":1444.6098846511,"_hash":4281929868,"paid_only":false},{"question_id":1466,"title":"重新规划路线","title_slug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero","rating":1633.6202302555,"_hash":249521607,"paid_only":false},{"question_id":1467,"title":"两个盒子中球的颜色数相同的概率","title_slug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls","rating":2356.5811122453,"_hash":338661942,"paid_only":false}],"company":{}},{"contest":{"id":204,"title":"第 27 场双周赛","title_slug":"biweekly-contest-27","start_time":1590849000,"is_ee_exam_contest":null},"questions":[{"question_id":1460,"title":"通过翻转子数组使两个数组相等","title_slug":"make-two-arrays-equal-by-reversing-subarrays","rating":1151.5250329621,"_hash":2597701503,"paid_only":false},{"question_id":1461,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","title_slug":"check-if-a-string-contains-all-binary-codes-of-size-k","rating":1504.0178888667,"_hash":1013970586,"paid_only":false},{"question_id":1462,"title":"课程表 IV","title_slug":"course-schedule-iv","rating":1692.5884631801,"_hash":2046402802,"paid_only":false},{"question_id":1463,"title":"摘樱桃 II","title_slug":"cherry-pickup-ii","rating":1956.7059585934,"_hash":3773526508,"paid_only":false}],"company":{}},{"contest":{"id":201,"title":"第 190 场周赛","title_slug":"weekly-contest-190","start_time":1590287400,"is_ee_exam_contest":null},"questions":[{"question_id":1455,"title":"检查单词是否为句中其他单词的前缀","title_slug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence","rating":1125.575238274,"_hash":1403314808,"paid_only":false},{"question_id":1456,"title":"定长子串中元音的最大数目","title_slug":"maximum-number-of-vowels-in-a-substring-of-given-length","rating":1263.2728668041,"_hash":3013367275,"paid_only":false},{"question_id":1457,"title":"二叉树中的伪回文路径","title_slug":"pseudo-palindromic-paths-in-a-binary-tree","rating":1405.0021415178,"_hash":3010901510,"paid_only":false},{"question_id":1458,"title":"两个子序列的最大点积","title_slug":"max-dot-product-of-two-subsequences","rating":1823.5831437787,"_hash":4061458273,"paid_only":false}],"company":{}},{"contest":{"id":197,"title":"第 189 场周赛","title_slug":"weekly-contest-189","start_time":1589682600,"is_ee_exam_contest":null},"questions":[{"question_id":1450,"title":"在既定时间做作业的学生人数","title_slug":"number-of-students-doing-homework-at-a-given-time","rating":1129.3432988996,"_hash":3894678842,"paid_only":false},{"question_id":1451,"title":"重新排列句子中的单词","title_slug":"rearrange-words-in-a-sentence","rating":1309.3113721825,"_hash":440206256,"paid_only":false},{"question_id":1452,"title":"收藏清单","title_slug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list","rating":1562.9186033202,"_hash":2809882420,"paid_only":false},{"question_id":1453,"title":"圆形靶内的最大飞镖数量","title_slug":"maximum-number-of-darts-inside-of-a-circular-dartboard","rating":2201.8209584221,"_hash":1442274557,"paid_only":false}],"company":{}},{"contest":{"id":198,"title":"第 26 场双周赛","title_slug":"biweekly-contest-26","start_time":1589639400,"is_ee_exam_contest":null},"questions":[{"question_id":1446,"title":"连续字符","title_slug":"consecutive-characters","rating":1165.4768151611,"_hash":1368317464,"paid_only":false},{"question_id":1447,"title":"最简分数","title_slug":"simplified-fractions","rating":1268.5768566953,"_hash":2797831681,"paid_only":false},{"question_id":1448,"title":"统计二叉树中好节点的数目","title_slug":"count-good-nodes-in-binary-tree","rating":1360.2184128413,"_hash":169616499,"paid_only":false},{"question_id":1449,"title":"数位成本和为目标值的最大数字","title_slug":"form-largest-integer-with-digits-that-add-up-to-target","rating":1927.4000816649,"_hash":1490454383,"paid_only":false}],"company":{}},{"contest":{"id":195,"title":"第 188 场周赛","title_slug":"weekly-contest-188","start_time":1589077800,"is_ee_exam_contest":null},"questions":[{"question_id":1441,"title":"用栈操作构建数组","title_slug":"build-an-array-with-stack-operations","rating":1180.3543157775,"_hash":1137656154,"paid_only":false},{"question_id":1442,"title":"形成两个异或相等数组的三元组数目","title_slug":"count-triplets-that-can-form-two-arrays-of-equal-xor","rating":1524.5693481538,"_hash":594551983,"paid_only":false},{"question_id":1443,"title":"收集树上所有苹果的最少时间","title_slug":"minimum-time-to-collect-all-apples-in-a-tree","rating":1682.8882177724,"_hash":943252793,"paid_only":false},{"question_id":1444,"title":"切披萨的方案数","title_slug":"number-of-ways-of-cutting-a-pizza","rating":2126.6864346508,"_hash":1744896373,"paid_only":false}],"company":{}},{"contest":{"id":191,"title":"第 187 场周赛","title_slug":"weekly-contest-187","start_time":1588473000,"is_ee_exam_contest":null},"questions":[{"question_id":1436,"title":"旅行终点站","title_slug":"destination-city","rating":1192.3167969426,"_hash":3794347985,"paid_only":false},{"question_id":1437,"title":"是否所有 1 都至少相隔 k 个元素","title_slug":"check-if-all-1s-are-at-least-length-k-places-away","rating":1193.2687290573,"_hash":439231056,"paid_only":false},{"question_id":1438,"title":"绝对差不超过限制的最长连续子数组","title_slug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit","rating":1672.1678031263,"_hash":3188904029,"paid_only":false},{"question_id":1439,"title":"有序矩阵中的第 k 个最小数组和","title_slug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows","rating":2133.9592509012,"_hash":2634383093,"paid_only":false}],"company":{}},{"contest":{"id":192,"title":"第 25 场双周赛","title_slug":"biweekly-contest-25","start_time":1588429800,"is_ee_exam_contest":null},"questions":[{"question_id":1431,"title":"拥有最多糖果的孩子","title_slug":"kids-with-the-greatest-number-of-candies","rating":1176.4547272896,"_hash":3057194499,"paid_only":false},{"question_id":1432,"title":"改变一个整数能得到的最大差值","title_slug":"max-difference-you-can-get-from-changing-an-integer","rating":1426.7384112327,"_hash":4162693857,"paid_only":false},{"question_id":1433,"title":"检查一个字符串是否可以打破另一个字符串","title_slug":"check-if-a-string-can-break-another-string","rating":1436.1125054038,"_hash":2646645546,"paid_only":false},{"question_id":1434,"title":"每个人戴不同帽子的方案数","title_slug":"number-of-ways-to-wear-different-hats-to-each-other","rating":2273.2215764545,"_hash":860689371,"paid_only":false}],"company":{}},{"contest":{"id":185,"title":"第 186 场周赛","title_slug":"weekly-contest-186","start_time":1587868200,"is_ee_exam_contest":null},"questions":[{"question_id":1422,"title":"分割字符串的最大得分","title_slug":"maximum-score-after-splitting-a-string","rating":1237.7565585875,"_hash":3778856012,"paid_only":false},{"question_id":1423,"title":"可获得的最大点数","title_slug":"maximum-points-you-can-obtain-from-cards","rating":1573.824807946,"_hash":3552570937,"paid_only":false},{"question_id":1424,"title":"对角线遍历 II","title_slug":"diagonal-traverse-ii","rating":1779.8364613072,"_hash":2316551160,"paid_only":false},{"question_id":1425,"title":"带限制的子序列和","title_slug":"constrained-subsequence-sum","rating":2032.4773038683,"_hash":1691609067,"paid_only":false}],"company":{}},{"contest":{"id":177,"title":"第 185 场周赛","title_slug":"weekly-contest-185","start_time":1587263400,"is_ee_exam_contest":null},"questions":[{"question_id":1417,"title":"重新格式化字符串","title_slug":"reformat-the-string","rating":1241.9262857175,"_hash":3440205245,"paid_only":false},{"question_id":1418,"title":"点菜展示表","title_slug":"display-table-of-food-orders-in-a-restaurant","rating":1485.135401269,"_hash":3975371411,"paid_only":false},{"question_id":1419,"title":"数青蛙","title_slug":"minimum-number-of-frogs-croaking","rating":1689.7569144085,"_hash":1565798166,"paid_only":false},{"question_id":1420,"title":"生成数组","title_slug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons","rating":2175.6850426027,"_hash":4023565195,"paid_only":false}],"company":{}},{"contest":{"id":178,"title":"第 24 场双周赛","title_slug":"biweekly-contest-24","start_time":1587220200,"is_ee_exam_contest":null},"questions":[{"question_id":1413,"title":"逐步求和得到正数的最小值","title_slug":"minimum-value-to-get-positive-step-by-step-sum","rating":1212.2309421538,"_hash":3593932314,"paid_only":false},{"question_id":1414,"title":"和为 K 的最少斐波那契数字数目","title_slug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k","rating":1465.7023558248,"_hash":1463291583,"paid_only":false},{"question_id":1415,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","title_slug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n","rating":1575.6324598387,"_hash":1620228801,"paid_only":false},{"question_id":1416,"title":"恢复数组","title_slug":"restore-the-array","rating":1919.6391896894,"_hash":3484470279,"paid_only":false}],"company":{}},{"contest":{"id":175,"title":"第 184 场周赛","title_slug":"weekly-contest-184","start_time":1586658600,"is_ee_exam_contest":null},"questions":[{"question_id":1408,"title":"数组中的字符串匹配","title_slug":"string-matching-in-an-array","rating":1223.3861903833,"_hash":2154696316,"paid_only":false},{"question_id":1409,"title":"查询带键的排列","title_slug":"queries-on-a-permutation-with-key","rating":1334.5718985411,"_hash":1238400837,"paid_only":false},{"question_id":1410,"title":"HTML 实体解析器","title_slug":"html-entity-parser","rating":1405.4005354401,"_hash":1452093256,"paid_only":false},{"question_id":1411,"title":"给 N x 3 网格图涂色的方案数","title_slug":"number-of-ways-to-paint-n-3-grid","rating":1844.6289439644,"_hash":3628711002,"paid_only":false}],"company":{}},{"contest":{"id":168,"title":"第 183 场周赛","title_slug":"weekly-contest-183","start_time":1586053800,"is_ee_exam_contest":null},"questions":[{"question_id":1403,"title":"非递增顺序的最小子序列","title_slug":"minimum-subsequence-in-non-increasing-order","rating":1288.1970048184,"_hash":3066842082,"paid_only":false},{"question_id":1404,"title":"将二进制表示减到 1 的步骤数","title_slug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one","rating":1396.5990609759,"_hash":1438800814,"paid_only":false},{"question_id":1405,"title":"最长快乐字符串","title_slug":"longest-happy-string","rating":1820.58557644,"_hash":1311726140,"paid_only":false},{"question_id":1406,"title":"石子游戏 III","title_slug":"stone-game-iii","rating":2026.8957817007,"_hash":3979947991,"paid_only":false}],"company":{}},{"contest":{"id":169,"title":"第 23 场双周赛","title_slug":"biweekly-contest-23","start_time":1586010600,"is_ee_exam_contest":null},"questions":[{"question_id":1399,"title":"统计最大组的数目","title_slug":"count-largest-group","rating":1341.0476642293,"_hash":1417435719,"paid_only":false},{"question_id":1400,"title":"构造 K 个回文字符串","title_slug":"construct-k-palindrome-strings","rating":1530.495439788,"_hash":2205913729,"paid_only":false},{"question_id":1401,"title":"圆和矩形是否有重叠","title_slug":"circle-and-rectangle-overlapping","rating":1708.9983361411,"_hash":1192302071,"paid_only":false},{"question_id":1402,"title":"做菜顺序","title_slug":"reducing-dishes","rating":1679.2607152001,"_hash":3261672467,"paid_only":false}],"company":{}},{"contest":{"id":166,"title":"第 182 场周赛","title_slug":"weekly-contest-182","start_time":1585449000,"is_ee_exam_contest":null},"questions":[{"question_id":1394,"title":"找出数组中的幸运数","title_slug":"find-lucky-integer-in-an-array","rating":1118.1080334618,"_hash":3411465392,"paid_only":false},{"question_id":1395,"title":"统计作战单位数","title_slug":"count-number-of-teams","rating":1343.628913055,"_hash":824074855,"paid_only":false},{"question_id":1396,"title":"设计地铁系统","title_slug":"design-underground-system","rating":1464.5254961488,"_hash":1788773531,"paid_only":false},{"question_id":1397,"title":"找到所有好字符串","title_slug":"find-all-good-strings","rating":2666.668150845,"_hash":3549637617,"paid_only":false}],"company":{}},{"contest":{"id":162,"title":"第 181 场周赛","title_slug":"weekly-contest-181","start_time":1584844200,"is_ee_exam_contest":null},"questions":[{"question_id":1389,"title":"按既定顺序创建目标数组","title_slug":"create-target-array-in-the-given-order","rating":1208.0417047337,"_hash":1969742700,"paid_only":false},{"question_id":1390,"title":"四因数","title_slug":"four-divisors","rating":1478.3848028264,"_hash":3989268391,"paid_only":false},{"question_id":1391,"title":"检查网格中是否存在有效路径","title_slug":"check-if-there-is-a-valid-path-in-a-grid","rating":1745.6490739887,"_hash":650356357,"paid_only":false},{"question_id":1392,"title":"最长快乐前缀","title_slug":"longest-happy-prefix","rating":1876.146019008,"_hash":3616385781,"paid_only":false}],"company":{}},{"contest":{"id":163,"title":"第 22 场双周赛","title_slug":"biweekly-contest-22","start_time":1584801000,"is_ee_exam_contest":null},"questions":[{"question_id":1385,"title":"两个数组间的距离值","title_slug":"find-the-distance-value-between-two-arrays","rating":1234.8049089605,"_hash":3833659931,"paid_only":false},{"question_id":1386,"title":"安排电影院座位","title_slug":"cinema-seat-allocation","rating":1636.6877598712,"_hash":3214600049,"paid_only":false},{"question_id":1387,"title":"将整数按权重排序","title_slug":"sort-integers-by-the-power-value","rating":1506.8958220609,"_hash":3793928653,"paid_only":false},{"question_id":1388,"title":"3n 块披萨","title_slug":"pizza-with-3n-slices","rating":2409.7580728676,"_hash":4187483922,"paid_only":false}],"company":{}},{"contest":{"id":160,"title":"第 180 场周赛","title_slug":"weekly-contest-180","start_time":1584239400,"is_ee_exam_contest":null},"questions":[{"question_id":1380,"title":"矩阵中的幸运数","title_slug":"lucky-numbers-in-a-matrix","rating":1207.7810914125,"_hash":2306188300,"paid_only":false},{"question_id":1381,"title":"设计一个支持增量操作的栈","title_slug":"design-a-stack-with-increment-operation","rating":1285.9726675488,"_hash":3915832963,"paid_only":false},{"question_id":1382,"title":"将二叉搜索树变平衡","title_slug":"balance-a-binary-search-tree","rating":1540.5750839091,"_hash":1937730923,"paid_only":false},{"question_id":1383,"title":"最大的团队表现值","title_slug":"maximum-performance-of-a-team","rating":2091.3820373571,"_hash":1997987860,"paid_only":false}],"company":{}},{"contest":{"id":156,"title":"第 179 场周赛","title_slug":"weekly-contest-179","start_time":1583634600,"is_ee_exam_contest":null},"questions":[{"question_id":1374,"title":"生成每种字符都是奇数个的字符串","title_slug":"generate-a-string-with-characters-that-have-odd-counts","rating":1164.0227691933,"_hash":4034922554,"paid_only":false},{"question_id":1375,"title":"二进制字符串前缀一致的次数","title_slug":"number-of-times-binary-string-is-prefix-aligned","rating":1438.8988489545,"_hash":1637468390,"paid_only":false},{"question_id":1376,"title":"通知所有员工所需的时间","title_slug":"time-needed-to-inform-all-employees","rating":1561.0553908973,"_hash":2222019296,"paid_only":false},{"question_id":1377,"title":"T 秒后青蛙的位置","title_slug":"frog-position-after-t-seconds","rating":1823.8779711373,"_hash":1364762739,"paid_only":false}],"company":{}},{"contest":{"id":157,"title":"第 21 场双周赛","title_slug":"biweekly-contest-21","start_time":1583591400,"is_ee_exam_contest":null},"questions":[{"question_id":1370,"title":"上升下降字符串","title_slug":"increasing-decreasing-string","rating":1369.0053354603,"_hash":2860419980,"paid_only":false},{"question_id":1371,"title":"每个元音包含偶数次的最长子字符串","title_slug":"find-the-longest-substring-containing-vowels-in-even-counts","rating":2040.539289037,"_hash":2810226521,"paid_only":false},{"question_id":1372,"title":"二叉树中的最长交错路径","title_slug":"longest-zigzag-path-in-a-binary-tree","rating":1713.2768268466,"_hash":3877013643,"paid_only":false},{"question_id":1373,"title":"二叉搜索子树的最大键值和","title_slug":"maximum-sum-bst-in-binary-tree","rating":1913.6704728453,"_hash":2919642920,"paid_only":false}],"company":{}},{"contest":{"id":154,"title":"第 178 场周赛","title_slug":"weekly-contest-178","start_time":1583029800,"is_ee_exam_contest":null},"questions":[{"question_id":1365,"title":"有多少小于当前数字的数字","title_slug":"how-many-numbers-are-smaller-than-the-current-number","rating":1152.1377893605,"_hash":2310137574,"paid_only":false},{"question_id":1366,"title":"通过投票对团队排名","title_slug":"rank-teams-by-votes","rating":1626.3266982141,"_hash":2939618078,"paid_only":false},{"question_id":1367,"title":"二叉树中的链表","title_slug":"linked-list-in-binary-tree","rating":1649.9728054796,"_hash":3956966956,"paid_only":false},{"question_id":1368,"title":"使网格图至少有一条有效路径的最小代价","title_slug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid","rating":2068.806637566,"_hash":2875388393,"paid_only":false}],"company":{}},{"contest":{"id":148,"title":"第 177 场周赛","title_slug":"weekly-contest-177","start_time":1582425000,"is_ee_exam_contest":null},"questions":[{"question_id":1360,"title":"日期之间隔几天","title_slug":"number-of-days-between-two-dates","rating":1421.6541140049,"_hash":686429748,"paid_only":false},{"question_id":1361,"title":"验证二叉树","title_slug":"validate-binary-tree-nodes","rating":1464.6895034875,"_hash":124339070,"paid_only":false},{"question_id":1362,"title":"最接近的因数","title_slug":"closest-divisors","rating":1533.9285875234,"_hash":2721035468,"paid_only":false},{"question_id":1363,"title":"形成三的最大倍数","title_slug":"largest-multiple-of-three","rating":1822.9768689716,"_hash":3298734473,"paid_only":false}],"company":{}},{"contest":{"id":149,"title":"第 20 场双周赛","title_slug":"biweekly-contest-20","start_time":1582381800,"is_ee_exam_contest":null},"questions":[{"question_id":1356,"title":"根据数字二进制下 1 的数目排序","title_slug":"sort-integers-by-the-number-of-1-bits","rating":1257.7082143289,"_hash":3189584402,"paid_only":false},{"question_id":1357,"title":"每隔 n 个顾客打折","title_slug":"apply-discount-every-n-orders","rating":1429.6349292399,"_hash":920111034,"paid_only":false},{"question_id":1358,"title":"包含所有三种字符的子字符串数目","title_slug":"number-of-substrings-containing-all-three-characters","rating":1646.1943237127,"_hash":3495355750,"paid_only":false},{"question_id":1359,"title":"有效的快递序列数目","title_slug":"count-all-valid-pickup-and-delivery-options","rating":1722.8129701098,"_hash":3432459628,"paid_only":false}],"company":{}},{"contest":{"id":147,"title":"第 176 场周赛","title_slug":"weekly-contest-176","start_time":1581820200,"is_ee_exam_contest":null},"questions":[{"question_id":1351,"title":"统计有序矩阵中的负数","title_slug":"count-negative-numbers-in-a-sorted-matrix","rating":1139.4248492279,"_hash":474089455,"paid_only":false},{"question_id":1352,"title":"最后 K 个数的乘积","title_slug":"product-of-the-last-k-numbers","rating":1473.7057465272,"_hash":2948668320,"paid_only":false},{"question_id":1353,"title":"最多可以参加的会议数目","title_slug":"maximum-number-of-events-that-can-be-attended","rating":2015.7291888336,"_hash":2529461898,"paid_only":false},{"question_id":1354,"title":"多次求和构造目标数组","title_slug":"construct-target-array-with-multiple-sums","rating":2014.7655493665,"_hash":681133837,"paid_only":false}],"company":{}},{"contest":{"id":145,"title":"第 175 场周赛","title_slug":"weekly-contest-175","start_time":1581215400,"is_ee_exam_contest":null},"questions":[{"question_id":1346,"title":"检查整数及其两倍数是否存在","title_slug":"check-if-n-and-its-double-exist","rating":1225.3601348675,"_hash":174306863,"paid_only":false},{"question_id":1347,"title":"制造字母异位词的最小步骤数","title_slug":"minimum-number-of-steps-to-make-two-strings-anagram","rating":1330.918577828,"_hash":4265155310,"paid_only":false},{"question_id":1348,"title":"推文计数","title_slug":"tweet-counts-per-frequency","rating":2036.7206020719,"_hash":2176047848,"paid_only":false},{"question_id":1349,"title":"参加考试的最大学生数","title_slug":"maximum-students-taking-exam","rating":2385.8072128533,"_hash":1698302709,"paid_only":false}],"company":{}},{"contest":{"id":146,"title":"第 19 场双周赛","title_slug":"biweekly-contest-19","start_time":1581172200,"is_ee_exam_contest":null},"questions":[{"question_id":1342,"title":"将数字变成 0 的操作次数","title_slug":"number-of-steps-to-reduce-a-number-to-zero","rating":1163.6047095526,"_hash":3773666854,"paid_only":false},{"question_id":1343,"title":"大小为 K 且平均值大于等于阈值的子数组数目","title_slug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold","rating":1317.1729927899,"_hash":1376431756,"paid_only":false},{"question_id":1344,"title":"时钟指针的夹角","title_slug":"angle-between-hands-of-a-clock","rating":1324.5696223867,"_hash":41269413,"paid_only":false},{"question_id":1345,"title":"跳跃游戏 IV","title_slug":"jump-game-iv","rating":1809.8192888474,"_hash":212627710,"paid_only":false}],"company":{}},{"contest":{"id":144,"title":"第 174 场周赛","title_slug":"weekly-contest-174","start_time":1580610600,"is_ee_exam_contest":null},"questions":[{"question_id":1337,"title":"矩阵中战斗力最弱的 K 行","title_slug":"the-k-weakest-rows-in-a-matrix","rating":1224.7606792444,"_hash":1486913577,"paid_only":false},{"question_id":1338,"title":"数组大小减半","title_slug":"reduce-array-size-to-the-half","rating":1303.022570497,"_hash":1706598413,"paid_only":false},{"question_id":1339,"title":"分裂二叉树的最大乘积","title_slug":"maximum-product-of-splitted-binary-tree","rating":1674.9985842835,"_hash":1257762070,"paid_only":false},{"question_id":1340,"title":"跳跃游戏 V","title_slug":"jump-game-v","rating":1866.3014601125,"_hash":3795047313,"paid_only":false}],"company":{}},{"contest":{"id":142,"title":"第 173 场周赛","title_slug":"weekly-contest-173","start_time":1580005800,"is_ee_exam_contest":null},"questions":[{"question_id":1332,"title":"删除回文子序列","title_slug":"remove-palindromic-subsequences","rating":1628.5072578803,"_hash":2153157695,"paid_only":false},{"question_id":1333,"title":"餐厅过滤器","title_slug":"filter-restaurants-by-vegan-friendly-price-and-distance","rating":1423.1058649921,"_hash":3693635252,"paid_only":false},{"question_id":1334,"title":"阈值距离内邻居最少的城市","title_slug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance","rating":1854.9547783559,"_hash":487663609,"paid_only":false},{"question_id":1335,"title":"工作计划的最低难度","title_slug":"minimum-difficulty-of-a-job-schedule","rating":2034.9420578559,"_hash":271335539,"paid_only":false}],"company":{}},{"contest":{"id":143,"title":"第 18 场双周赛","title_slug":"biweekly-contest-18","start_time":1579962600,"is_ee_exam_contest":null},"questions":[{"question_id":1331,"title":"数组序号转换","title_slug":"rank-transform-of-an-array","rating":1355.9817184778,"_hash":1713279396,"paid_only":false},{"question_id":1328,"title":"破坏回文串","title_slug":"break-a-palindrome","rating":1473.864993045,"_hash":1467367970,"paid_only":false},{"question_id":1329,"title":"将矩阵按对角线排序","title_slug":"sort-the-matrix-diagonally","rating":1548.4678056182,"_hash":1786656286,"paid_only":false},{"question_id":1330,"title":"翻转子数组得到最大的数组值","title_slug":"reverse-subarray-to-maximize-array-value","rating":2481.7175364169,"_hash":3851133364,"paid_only":false}],"company":{}},{"contest":{"id":139,"title":"第 172 场周赛","title_slug":"weekly-contest-172","start_time":1579401000,"is_ee_exam_contest":null},"questions":[{"question_id":1323,"title":"6 和 9 组成的最大数字","title_slug":"maximum-69-number","rating":1193.9819783429,"_hash":2988189921,"paid_only":false},{"question_id":1324,"title":"竖直打印单词","title_slug":"print-words-vertically","rating":1328.7281033317,"_hash":2666352866,"paid_only":false},{"question_id":1325,"title":"删除给定值的叶子节点","title_slug":"delete-leaves-with-a-given-value","rating":1407.1322366299,"_hash":1098465458,"paid_only":false},{"question_id":1326,"title":"灌溉花园的最少水龙头数目","title_slug":"minimum-number-of-taps-to-open-to-water-a-garden","rating":1885.0178370385,"_hash":701261553,"paid_only":false}],"company":{}},{"contest":{"id":137,"title":"第 171 场周赛","title_slug":"weekly-contest-171","start_time":1578796200,"is_ee_exam_contest":null},"questions":[{"question_id":1317,"title":"将整数转换为两个无零整数的和","title_slug":"convert-integer-to-the-sum-of-two-no-zero-integers","rating":1277.8260125315,"_hash":1863065807,"paid_only":false},{"question_id":1318,"title":"或运算的最小翻转次数","title_slug":"minimum-flips-to-make-a-or-b-equal-to-c","rating":1382.760607823,"_hash":623247221,"paid_only":false},{"question_id":1319,"title":"连通网络的操作次数","title_slug":"number-of-operations-to-make-network-connected","rating":1633.1372577433,"_hash":3681976285,"paid_only":false},{"question_id":1320,"title":"二指输入的的最小距离","title_slug":"minimum-distance-to-type-a-word-using-two-fingers","rating":2027.7304121046,"_hash":3992139324,"paid_only":false}],"company":{}},{"contest":{"id":138,"title":"第 17 场双周赛","title_slug":"biweekly-contest-17","start_time":1578753000,"is_ee_exam_contest":null},"questions":[{"question_id":1313,"title":"解压缩编码列表","title_slug":"decompress-run-length-encoded-list","rating":1317.4638832497,"_hash":2109320577,"paid_only":false},{"question_id":1314,"title":"矩阵区域和","title_slug":"matrix-block-sum","rating":1483.8137189709,"_hash":2353125510,"paid_only":false},{"question_id":1315,"title":"祖父节点值为偶数的节点和","title_slug":"sum-of-nodes-with-even-valued-grandparent","rating":1426.948379305,"_hash":1075948935,"paid_only":false},{"question_id":1316,"title":"不同的循环子字符串","title_slug":"distinct-echo-substrings","rating":1836.536348078,"_hash":2436413676,"paid_only":false}],"company":{}},{"contest":{"id":136,"title":"第 170 场周赛","title_slug":"weekly-contest-170","start_time":1578191400,"is_ee_exam_contest":null},"questions":[{"question_id":1309,"title":"解码字母到整数映射","title_slug":"decrypt-string-from-alphabet-to-integer-mapping","rating":1257.679633165,"_hash":504472069,"paid_only":false},{"question_id":1310,"title":"子数组异或查询","title_slug":"xor-queries-of-a-subarray","rating":1459.8208951847,"_hash":3663334475,"paid_only":false},{"question_id":1311,"title":"获取你好友已观看的视频","title_slug":"get-watched-videos-by-your-friends","rating":1652.5809810428,"_hash":2521216381,"paid_only":false},{"question_id":1312,"title":"让字符串成为回文串的最少插入次数","title_slug":"minimum-insertion-steps-to-make-a-string-palindrome","rating":1786.688543054,"_hash":2220648902,"paid_only":false}],"company":{}},{"contest":{"id":134,"title":"第 169 场周赛","title_slug":"weekly-contest-169","start_time":1577586600,"is_ee_exam_contest":null},"questions":[{"question_id":1304,"title":"和为零的 N 个不同整数","title_slug":"find-n-unique-integers-sum-up-to-zero","rating":1167.1331831913,"_hash":1460547008,"paid_only":false},{"question_id":1305,"title":"两棵二叉搜索树中的所有元素","title_slug":"all-elements-in-two-binary-search-trees","rating":1260.1755576607,"_hash":3750933244,"paid_only":false},{"question_id":1306,"title":"跳跃游戏 III","title_slug":"jump-game-iii","rating":1396.5448074496,"_hash":1787879890,"paid_only":false},{"question_id":1307,"title":"口算难题","title_slug":"verbal-arithmetic-puzzle","rating":2250.0454791316,"_hash":9793507,"paid_only":false}],"company":{}},{"contest":{"id":135,"title":"第 16 场双周赛","title_slug":"biweekly-contest-16","start_time":1577543400,"is_ee_exam_contest":null},"questions":[{"question_id":1299,"title":"将每个元素替换为右侧最大元素","title_slug":"replace-elements-with-greatest-element-on-right-side","rating":1219.4252907184,"_hash":4131453232,"paid_only":false},{"question_id":1300,"title":"转变数组后最接近目标值的数组和","title_slug":"sum-of-mutated-array-closest-to-target","rating":1606.9895296459,"_hash":122134919,"paid_only":false},{"question_id":1302,"title":"层数最深叶子节点的和","title_slug":"deepest-leaves-sum","rating":1387.9431104106,"_hash":2146548018,"paid_only":false},{"question_id":1301,"title":"最大得分的路径数目","title_slug":"number-of-paths-with-max-score","rating":1853.0880092558,"_hash":4193156158,"paid_only":false}],"company":{}},{"contest":{"id":133,"title":"第 168 场周赛","title_slug":"weekly-contest-168","start_time":1576981800,"is_ee_exam_contest":null},"questions":[{"question_id":1295,"title":"统计位数为偶数的数字","title_slug":"find-numbers-with-even-number-of-digits","rating":1139.6630206282,"_hash":1078494316,"paid_only":false},{"question_id":1296,"title":"划分数组为连续数字的集合","title_slug":"divide-array-in-sets-of-k-consecutive-numbers","rating":1490.2370387981,"_hash":2249312740,"paid_only":false},{"question_id":1297,"title":"子串的最大出现次数","title_slug":"maximum-number-of-occurrences-of-a-substring","rating":1748.1523771585,"_hash":625709572,"paid_only":false},{"question_id":1298,"title":"你能从盒子里获得的最大糖果数","title_slug":"maximum-candies-you-can-get-from-boxes","rating":1824.829446341,"_hash":4040819108,"paid_only":false}],"company":{}},{"contest":{"id":131,"title":"第 167 场周赛","title_slug":"weekly-contest-167","start_time":1576377000,"is_ee_exam_contest":null},"questions":[{"question_id":1290,"title":"二进制链表转整数","title_slug":"convert-binary-number-in-a-linked-list-to-integer","rating":1151.3534799042,"_hash":3681668560,"paid_only":false},{"question_id":1291,"title":"顺次数","title_slug":"sequential-digits","rating":1373.8113453501,"_hash":1231737979,"paid_only":false},{"question_id":1292,"title":"元素和小于等于阈值的正方形的最大边长","title_slug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold","rating":1734.8208369949,"_hash":2041342956,"paid_only":false},{"question_id":1293,"title":"网格中的最短路径","title_slug":"shortest-path-in-a-grid-with-obstacles-elimination","rating":1967.3284576938,"_hash":3580394792,"paid_only":false}],"company":{}},{"contest":{"id":132,"title":"第 15 场双周赛","title_slug":"biweekly-contest-15","start_time":1576333800,"is_ee_exam_contest":null},"questions":[{"question_id":1287,"title":"有序数组中出现次数超过25%的元素","title_slug":"element-appearing-more-than-25-in-sorted-array","rating":1179.1495967491,"_hash":3348466517,"paid_only":false},{"question_id":1288,"title":"删除被覆盖区间","title_slug":"remove-covered-intervals","rating":1375.0234414965,"_hash":4078794209,"paid_only":false},{"question_id":1286,"title":"字母组合迭代器","title_slug":"iterator-for-combination","rating":1591.4725328821,"_hash":2534714311,"paid_only":false},{"question_id":1289,"title":"下降路径最小和 II","title_slug":"minimum-falling-path-sum-ii","rating":1697.2356875149,"_hash":2588489114,"paid_only":false}],"company":{}},{"contest":{"id":130,"title":"第 166 场周赛","title_slug":"weekly-contest-166","start_time":1575772200,"is_ee_exam_contest":null},"questions":[{"question_id":1281,"title":"整数的各位积和之差","title_slug":"subtract-the-product-and-sum-of-digits-of-an-integer","rating":1141.2363999461,"_hash":1959906977,"paid_only":false},{"question_id":1282,"title":"用户分组","title_slug":"group-the-people-given-the-group-size-they-belong-to","rating":1267.223591366,"_hash":1393055239,"paid_only":false},{"question_id":1283,"title":"使结果不超过阈值的最小除数","title_slug":"find-the-smallest-divisor-given-a-threshold","rating":1541.7840320661,"_hash":278493845,"paid_only":false},{"question_id":1284,"title":"转化为全零矩阵的最少反转次数","title_slug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix","rating":1810.7690062079,"_hash":1118571941,"paid_only":false}],"company":{}},{"contest":{"id":128,"title":"第 165 场周赛","title_slug":"weekly-contest-165","start_time":1575167400,"is_ee_exam_contest":null},"questions":[{"question_id":1275,"title":"找出井字棋的获胜者","title_slug":"find-winner-on-a-tic-tac-toe-game","rating":1336.9494482313,"_hash":2404871340,"paid_only":false},{"question_id":1276,"title":"不浪费原料的汉堡制作方案","title_slug":"number-of-burgers-with-no-waste-of-ingredients","rating":1386.3256313989,"_hash":178669910,"paid_only":false},{"question_id":1277,"title":"统计全为 1 的正方形子矩阵","title_slug":"count-square-submatrices-with-all-ones","rating":1613.0429766636,"_hash":1057920854,"paid_only":false},{"question_id":1278,"title":"分割回文串 III","title_slug":"palindrome-partitioning-iii","rating":1979.1323403633,"_hash":2471898191,"paid_only":false}],"company":{}},{"contest":{"id":129,"title":"第 14 场双周赛","title_slug":"biweekly-contest-14","start_time":1575124200,"is_ee_exam_contest":null},"questions":[{"question_id":1271,"title":"十六进制魔术数字","title_slug":"hexspeak","rating":1384.4078082338,"_hash":3813216196,"paid_only":false},{"question_id":1272,"title":"删除区间","title_slug":"remove-interval","rating":1524.8218282113,"_hash":760128905,"paid_only":false},{"question_id":1273,"title":"删除树节点","title_slug":"delete-tree-nodes","rating":1732.7813534239,"_hash":333630853,"paid_only":false},{"question_id":1274,"title":"矩形内船只的数目","title_slug":"number-of-ships-in-a-rectangle","rating":1997.1824403719,"_hash":474791918,"paid_only":false}],"company":{}},{"contest":{"id":125,"title":"第 164 场周赛","title_slug":"weekly-contest-164","start_time":1574562600,"is_ee_exam_contest":null},"questions":[{"question_id":1266,"title":"访问所有点的最小时间","title_slug":"minimum-time-visiting-all-points","rating":1302.7005460171,"_hash":2480987547,"paid_only":false},{"question_id":1267,"title":"统计参与通信的服务器","title_slug":"count-servers-that-communicate","rating":1374.574900311,"_hash":4169811109,"paid_only":false},{"question_id":1268,"title":"搜索推荐系统","title_slug":"search-suggestions-system","rating":1573.4042963622,"_hash":133627469,"paid_only":false},{"question_id":1269,"title":"停在原地的方案数","title_slug":"number-of-ways-to-stay-in-the-same-place-after-some-steps","rating":1854.0126399812,"_hash":1810947088,"paid_only":false}],"company":{}},{"contest":{"id":123,"title":"第 163 场周赛","title_slug":"weekly-contest-163","start_time":1573957800,"is_ee_exam_contest":null},"questions":[{"question_id":1260,"title":"二维网格迁移","title_slug":"shift-2d-grid","rating":1337.3722299775,"_hash":2949409019,"paid_only":false},{"question_id":1261,"title":"在受污染的二叉树中查找元素","title_slug":"find-elements-in-a-contaminated-binary-tree","rating":1439.5656079032,"_hash":1643291393,"paid_only":false},{"question_id":1262,"title":"可被三整除的最大和","title_slug":"greatest-sum-divisible-by-three","rating":1762.0307532652,"_hash":2001540741,"paid_only":false},{"question_id":1263,"title":"推箱子","title_slug":"minimum-moves-to-move-a-box-to-their-target-location","rating":2297.105362516,"_hash":3949953471,"paid_only":false}],"company":{}},{"contest":{"id":124,"title":"第 13 场双周赛","title_slug":"biweekly-contest-13","start_time":1573914600,"is_ee_exam_contest":null},"questions":[{"question_id":1256,"title":"加密数字","title_slug":"encode-number","rating":1561.2655635205,"_hash":2428818859,"paid_only":false},{"question_id":1257,"title":"最小公共区域","title_slug":"smallest-common-region","rating":1654.0793660142,"_hash":2731154173,"paid_only":false},{"question_id":1258,"title":"近义词句子","title_slug":"synonymous-sentences","rating":1847.2077654978,"_hash":3669324904,"paid_only":false},{"question_id":1259,"title":"不相交的握手","title_slug":"handshakes-that-dont-cross","rating":1951.3509259668,"_hash":108728140,"paid_only":false}],"company":{}},{"contest":{"id":122,"title":"第 162 场周赛","title_slug":"weekly-contest-162","start_time":1573353000,"is_ee_exam_contest":null},"questions":[{"question_id":1252,"title":"奇数值单元格的数目","title_slug":"cells-with-odd-values-in-a-matrix","rating":1283.4980318021,"_hash":4235563666,"paid_only":false},{"question_id":1253,"title":"重构 2 行二进制矩阵","title_slug":"reconstruct-a-2-row-binary-matrix","rating":1505.8669082864,"_hash":1498707721,"paid_only":false},{"question_id":1254,"title":"统计封闭岛屿的数目","title_slug":"number-of-closed-islands","rating":1658.7495899767,"_hash":1535345394,"paid_only":false},{"question_id":1255,"title":"得分最高的单词集合","title_slug":"maximum-score-words-formed-by-letters","rating":1881.6810367589,"_hash":2776150092,"paid_only":false}],"company":{}},{"contest":{"id":120,"title":"第 161 场周赛","title_slug":"weekly-contest-161","start_time":1572748200,"is_ee_exam_contest":null},"questions":[{"question_id":1247,"title":"交换字符使得字符串相同","title_slug":"minimum-swaps-to-make-strings-equal","rating":1597.0215918551,"_hash":3735372403,"paid_only":false},{"question_id":1248,"title":"统计「优美子数组」","title_slug":"count-number-of-nice-subarrays","rating":1623.9443250479,"_hash":2868656571,"paid_only":false},{"question_id":1249,"title":"移除无效的括号","title_slug":"minimum-remove-to-make-valid-parentheses","rating":1657.1231739081,"_hash":4242473859,"paid_only":false},{"question_id":1250,"title":"检查「好数组」","title_slug":"check-if-it-is-a-good-array","rating":1983.2319731313,"_hash":4185904896,"paid_only":false}],"company":{}},{"contest":{"id":121,"title":"第 12 场双周赛","title_slug":"biweekly-contest-12","start_time":1572705000,"is_ee_exam_contest":null},"questions":[{"question_id":1244,"title":"力扣排行榜","title_slug":"design-a-leaderboard","rating":1354.1247827015,"_hash":2386103127,"paid_only":false},{"question_id":1243,"title":"数组变换","title_slug":"array-transformation","rating":1558.1421869292,"_hash":2980355580,"paid_only":false},{"question_id":1245,"title":"树的直径","title_slug":"tree-diameter","rating":1792.076794537,"_hash":3817996291,"paid_only":false},{"question_id":1246,"title":"删除回文子数组","title_slug":"palindrome-removal","rating":2203.1738850937,"_hash":960405407,"paid_only":false}],"company":{}},{"contest":{"id":119,"title":"第 160 场周赛","title_slug":"weekly-contest-160","start_time":1572143400,"is_ee_exam_contest":null},"questions":[{"question_id":1237,"title":"找出给定方程的正整数解","title_slug":"find-positive-integer-solution-for-a-given-equation","rating":1404.7016862187,"_hash":3484001100,"paid_only":false},{"question_id":1238,"title":"循环码排列","title_slug":"circular-permutation-in-binary-representation","rating":1774.8764591297,"_hash":1210001971,"paid_only":false},{"question_id":1239,"title":"串联字符串的最大长度","title_slug":"maximum-length-of-a-concatenated-string-with-unique-characters","rating":1719.945199874,"_hash":4259911866,"paid_only":false},{"question_id":1240,"title":"铺瓷砖","title_slug":"tiling-a-rectangle-with-the-fewest-squares","rating":2241.5199974312,"_hash":2526467539,"paid_only":false}],"company":{}},{"contest":{"id":117,"title":"第 159 场周赛","title_slug":"weekly-contest-159","start_time":1571538600,"is_ee_exam_contest":null},"questions":[{"question_id":1232,"title":"缀点成线","title_slug":"check-if-it-is-a-straight-line","rating":1247.3198836387,"_hash":4130908576,"paid_only":false},{"question_id":1233,"title":"删除子文件夹","title_slug":"remove-sub-folders-from-the-filesystem","rating":1544.8261365027,"_hash":4057878205,"paid_only":false},{"question_id":1234,"title":"替换子串得到平衡字符串","title_slug":"replace-the-substring-for-balanced-string","rating":1877.8983358307,"_hash":2144998386,"paid_only":false},{"question_id":1235,"title":"规划兼职工作","title_slug":"maximum-profit-in-job-scheduling","rating":2022.8520613737,"_hash":4225343365,"paid_only":false}],"company":{}},{"contest":{"id":118,"title":"第 11 场双周赛","title_slug":"biweekly-contest-11","start_time":1571495400,"is_ee_exam_contest":null},"questions":[{"question_id":1228,"title":"等差数列中缺失的数字","title_slug":"missing-number-in-arithmetic-progression","rating":1244.317367883,"_hash":1225270682,"paid_only":false},{"question_id":1229,"title":"安排会议日程","title_slug":"meeting-scheduler","rating":1541.2260256298,"_hash":3772256778,"paid_only":false},{"question_id":1230,"title":"抛掷硬币","title_slug":"toss-strange-coins","rating":1808.5754920785,"_hash":2912571228,"paid_only":false},{"question_id":1231,"title":"分享巧克力","title_slug":"divide-chocolate","rating":2029.1301557536,"_hash":1053077839,"paid_only":false}],"company":{}},{"contest":{"id":116,"title":"第 158 场周赛","title_slug":"weekly-contest-158","start_time":1570933800,"is_ee_exam_contest":null},"questions":[{"question_id":1221,"title":"分割平衡字符串","title_slug":"split-a-string-in-balanced-strings","rating":1219.5284561367,"_hash":74188793,"paid_only":false},{"question_id":1222,"title":"可以攻击国王的皇后","title_slug":"queens-that-can-attack-the-king","rating":1391.7243180131,"_hash":665333196,"paid_only":false},{"question_id":1223,"title":"掷骰子模拟","title_slug":"dice-roll-simulation","rating":2008.40650791,"_hash":1023816398,"paid_only":false},{"question_id":1224,"title":"最大相等频率","title_slug":"maximum-equal-frequency","rating":2050.715977457,"_hash":3117661899,"paid_only":false}],"company":{}},{"contest":{"id":114,"title":"第 157 场周赛","title_slug":"weekly-contest-157","start_time":1570329000,"is_ee_exam_contest":null},"questions":[{"question_id":1217,"title":"玩筹码","title_slug":"minimum-cost-to-move-chips-to-the-same-position","rating":1407.5442381391,"_hash":2503951076,"paid_only":false},{"question_id":1218,"title":"最长定差子序列","title_slug":"longest-arithmetic-subsequence-of-given-difference","rating":1597.1931473887,"_hash":1235853332,"paid_only":false},{"question_id":1219,"title":"黄金矿工","title_slug":"path-with-maximum-gold","rating":1663.2612318917,"_hash":2579010831,"paid_only":false},{"question_id":1220,"title":"统计元音字母序列的数目","title_slug":"count-vowels-permutation","rating":1729.6074000215,"_hash":4278798036,"paid_only":false}],"company":{}},{"contest":{"id":115,"title":"第 10 场双周赛","title_slug":"biweekly-contest-10","start_time":1570285800,"is_ee_exam_contest":null},"questions":[{"question_id":1213,"title":"三个有序数组的交集","title_slug":"intersection-of-three-sorted-arrays","rating":1259.1979660519,"_hash":1167766424,"paid_only":false},{"question_id":1214,"title":"查找两棵二叉搜索树之和","title_slug":"two-sum-bsts","rating":1389.0328392117,"_hash":1043390792,"paid_only":false},{"question_id":1215,"title":"步进数","title_slug":"stepping-numbers","rating":1674.5365205597,"_hash":2304874524,"paid_only":false},{"question_id":1216,"title":"验证回文串 III","title_slug":"valid-palindrome-iii","rating":1753.9062487685,"_hash":4136678159,"paid_only":false}],"company":{}},{"contest":{"id":113,"title":"第 156 场周赛","title_slug":"weekly-contest-156","start_time":1569724200,"is_ee_exam_contest":null},"questions":[{"question_id":1207,"title":"独一无二的出现次数","title_slug":"unique-number-of-occurrences","rating":1195.7512695571,"_hash":3437227213,"paid_only":false},{"question_id":1208,"title":"尽可能使字符串相等","title_slug":"get-equal-substrings-within-budget","rating":1496.9128643588,"_hash":3812471555,"paid_only":false},{"question_id":1209,"title":"删除字符串中的所有相邻重复项 II","title_slug":"remove-all-adjacent-duplicates-in-string-ii","rating":1541.5405749918,"_hash":1577638784,"paid_only":false},{"question_id":1210,"title":"穿过迷宫的最少移动次数","title_slug":"minimum-moves-to-reach-target-with-rotations","rating":2022.4752963768,"_hash":2716747123,"paid_only":false}],"company":{}},{"contest":{"id":107,"title":"第 155 场周赛","title_slug":"weekly-contest-155","start_time":1569119400,"is_ee_exam_contest":null},"questions":[{"question_id":1200,"title":"最小绝对差","title_slug":"minimum-absolute-difference","rating":1198.5705825982,"_hash":2380816309,"paid_only":false},{"question_id":1201,"title":"丑数 III","title_slug":"ugly-number-iii","rating":2039.110874689,"_hash":4021161204,"paid_only":false},{"question_id":1202,"title":"交换字符串中的元素","title_slug":"smallest-string-with-swaps","rating":1855.4479039876,"_hash":13544352,"paid_only":false},{"question_id":1203,"title":"项目管理","title_slug":"sort-items-by-groups-respecting-dependencies","rating":2418.5742747632,"_hash":505097820,"paid_only":false}],"company":{}},{"contest":{"id":108,"title":"第 9 场双周赛","title_slug":"biweekly-contest-9","start_time":1569076200,"is_ee_exam_contest":null},"questions":[{"question_id":1196,"title":"最多可以买到的苹果数量","title_slug":"how-many-apples-can-you-put-into-the-basket","rating":1248.8026990632,"_hash":3037047822,"paid_only":false},{"question_id":1197,"title":"进击的骑士","title_slug":"minimum-knight-moves","rating":1722.3088173214,"_hash":3077259720,"paid_only":false},{"question_id":1198,"title":"找出所有行中最小公共元素","title_slug":"find-smallest-common-element-in-all-rows","rating":1401.2246983038,"_hash":2199036891,"paid_only":false},{"question_id":1199,"title":"建造街区的最短时间","title_slug":"minimum-time-to-build-blocks","rating":2250.2578740769,"_hash":212930587,"paid_only":false}],"company":{}},{"contest":{"id":106,"title":"第 154 场周赛","title_slug":"weekly-contest-154","start_time":1568514600,"is_ee_exam_contest":null},"questions":[{"question_id":1189,"title":"“气球” 的最大数量","title_slug":"maximum-number-of-balloons","rating":1181.9716216714,"_hash":475209872,"paid_only":false},{"question_id":1190,"title":"反转每对括号间的子串","title_slug":"reverse-substrings-between-each-pair-of-parentheses","rating":1485.6550472186,"_hash":1038307939,"paid_only":false},{"question_id":1191,"title":"K 次串联后最大子数组之和","title_slug":"k-concatenation-maximum-sum","rating":1747.6755111029,"_hash":65111910,"paid_only":false},{"question_id":1192,"title":"查找集群内的关键连接","title_slug":"critical-connections-in-a-network","rating":2084.6866916045,"_hash":3870941501,"paid_only":false}],"company":{}},{"contest":{"id":102,"title":"第 153 场周赛","title_slug":"weekly-contest-153","start_time":1567909800,"is_ee_exam_contest":null},"questions":[{"question_id":1184,"title":"公交站间的距离","title_slug":"distance-between-bus-stops","rating":1234.4144116814,"_hash":1149087220,"paid_only":false},{"question_id":1185,"title":"一周中的第几天","title_slug":"day-of-the-week","rating":1382.4809893713,"_hash":3920920642,"paid_only":false},{"question_id":1186,"title":"删除一次得到子数组最大和","title_slug":"maximum-subarray-sum-with-one-deletion","rating":1799.4635458535,"_hash":1742923454,"paid_only":false},{"question_id":1187,"title":"使数组严格递增","title_slug":"make-array-strictly-increasing","rating":2315.6037017989,"_hash":979526552,"paid_only":false}],"company":{}},{"contest":{"id":103,"title":"第 8 场双周赛","title_slug":"biweekly-contest-8","start_time":1567866600,"is_ee_exam_contest":null},"questions":[{"question_id":1180,"title":"统计只含单一字母的子串","title_slug":"count-substrings-with-only-one-distinct-letter","rating":1315.4085759361,"_hash":2844666696,"paid_only":false},{"question_id":1181,"title":"前后拼接","title_slug":"before-and-after-puzzle","rating":1558.6880035344,"_hash":4191223408,"paid_only":false},{"question_id":1182,"title":"与目标颜色间的最短距离","title_slug":"shortest-distance-to-target-color","rating":1626.6740430119,"_hash":3960804215,"paid_only":false},{"question_id":1183,"title":"矩阵中 1 的最大数量","title_slug":"maximum-number-of-ones","rating":2366.7099607655,"_hash":3675075625,"paid_only":false}],"company":{}},{"contest":{"id":100,"title":"第 152 场周赛","title_slug":"weekly-contest-152","start_time":1567305000,"is_ee_exam_contest":null},"questions":[{"question_id":1175,"title":"质数排列","title_slug":"prime-arrangements","rating":1489.0102202162,"_hash":3007102778,"paid_only":false},{"question_id":1176,"title":"健身计划评估","title_slug":"diet-plan-performance","rating":1397.7743198793,"_hash":97873302,"paid_only":false},{"question_id":1177,"title":"构建回文串检测","title_slug":"can-make-palindrome-from-substring","rating":1848.0912848518,"_hash":1583349779,"paid_only":false},{"question_id":1178,"title":"猜字谜","title_slug":"number-of-valid-words-for-each-puzzle","rating":2233.963903408,"_hash":2530621646,"paid_only":false}],"company":{}},{"contest":{"id":98,"title":"第 151 场周赛","title_slug":"weekly-contest-151","start_time":1566700200,"is_ee_exam_contest":null},"questions":[{"question_id":1169,"title":"查询无效交易","title_slug":"invalid-transactions","rating":1658.6836278802,"_hash":3292810974,"paid_only":false},{"question_id":1170,"title":"比较字符串最小字母出现频次","title_slug":"compare-strings-by-frequency-of-the-smallest-character","rating":1431.6864980883,"_hash":168963992,"paid_only":false},{"question_id":1171,"title":"从链表中删去总和值为零的连续节点","title_slug":"remove-zero-sum-consecutive-nodes-from-linked-list","rating":1782.3312212058,"_hash":1493274091,"paid_only":false},{"question_id":1172,"title":"餐盘栈","title_slug":"dinner-plate-stacks","rating":2109.9830154953,"_hash":3376945874,"paid_only":false}],"company":{}},{"contest":{"id":99,"title":"第 7 场双周赛","title_slug":"biweekly-contest-7","start_time":1566657000,"is_ee_exam_contest":null},"questions":[{"question_id":1165,"title":"单行键盘","title_slug":"single-row-keyboard","rating":1199.2392672964,"_hash":3054721758,"paid_only":false},{"question_id":1166,"title":"设计文件系统","title_slug":"design-file-system","rating":1479.0110934646,"_hash":3000728502,"paid_only":false},{"question_id":1167,"title":"连接木棍的最低费用","title_slug":"minimum-cost-to-connect-sticks","rating":1481.5701319876,"_hash":4211026934,"paid_only":false},{"question_id":1168,"title":"水资源分配优化","title_slug":"optimize-water-distribution-in-a-village","rating":2069.4030284676,"_hash":271664224,"paid_only":false}],"company":{}},{"contest":{"id":96,"title":"第 150 场周赛","title_slug":"weekly-contest-150","start_time":1566095400,"is_ee_exam_contest":null},"questions":[{"question_id":1160,"title":"拼写单词","title_slug":"find-words-that-can-be-formed-by-characters","rating":1205.6698455508,"_hash":3021409572,"paid_only":false},{"question_id":1161,"title":"最大层内元素和","title_slug":"maximum-level-sum-of-a-binary-tree","rating":1249.9086403595,"_hash":1692861209,"paid_only":false},{"question_id":1162,"title":"地图分析","title_slug":"as-far-from-land-as-possible","rating":1666.346990979,"_hash":744773019,"paid_only":false},{"question_id":1163,"title":"按字典序排在最后的子串","title_slug":"last-substring-in-lexicographical-order","rating":1864.0948676111,"_hash":1053626998,"paid_only":false}],"company":{}},{"contest":{"id":94,"title":"第 149 场周赛","title_slug":"weekly-contest-149","start_time":1565490600,"is_ee_exam_contest":null},"questions":[{"question_id":1154,"title":"一年中的第几天","title_slug":"day-of-the-year","rating":1199.4427635582,"_hash":694594451,"paid_only":false},{"question_id":1155,"title":"掷骰子等于目标和的方法数","title_slug":"number-of-dice-rolls-with-target-sum","rating":1653.7337081336,"_hash":1676080206,"paid_only":false},{"question_id":1156,"title":"单字符重复子串的最大长度","title_slug":"swap-for-longest-repeated-character-substring","rating":1787.4514432151,"_hash":2038782260,"paid_only":false},{"question_id":1157,"title":"子数组中占绝大多数的元素","title_slug":"online-majority-element-in-subarray","rating":2205.4304373587,"_hash":4053796951,"paid_only":false}],"company":{}},{"contest":{"id":95,"title":"第 6 场双周赛","title_slug":"biweekly-contest-6","start_time":1565447400,"is_ee_exam_contest":null},"questions":[{"question_id":1150,"title":"检查一个数是否在数组中占绝大多数","title_slug":"check-if-a-number-is-majority-element-in-a-sorted-array","rating":1249.9947800752,"_hash":1627868267,"paid_only":false},{"question_id":1151,"title":"最少交换次数来组合所有的 1","title_slug":"minimum-swaps-to-group-all-1s-together","rating":1508.1169489285,"_hash":324121992,"paid_only":false},{"question_id":1152,"title":"用户网站访问行为分析","title_slug":"analyze-user-website-visit-pattern","rating":1850.8490524791,"_hash":2782517328,"paid_only":false},{"question_id":1153,"title":"字符串转化","title_slug":"string-transforms-into-another-string","rating":1949.0920823355,"_hash":120648461,"paid_only":false}],"company":{}},{"contest":{"id":93,"title":"第 148 场周赛","title_slug":"weekly-contest-148","start_time":1564885800,"is_ee_exam_contest":null},"questions":[{"question_id":1144,"title":"递减元素使数组呈锯齿状","title_slug":"decrease-elements-to-make-array-zigzag","rating":1558.7188539503,"_hash":109606469,"paid_only":false},{"question_id":1145,"title":"二叉树着色游戏","title_slug":"binary-tree-coloring-game","rating":1741.4527995252,"_hash":110135796,"paid_only":false},{"question_id":1146,"title":"快照数组","title_slug":"snapshot-array","rating":1770.8924569497,"_hash":4187877981,"paid_only":false},{"question_id":1147,"title":"段式回文","title_slug":"longest-chunked-palindrome-decomposition","rating":1912.0829958001,"_hash":1184414922,"paid_only":false}],"company":{}},{"contest":{"id":90,"title":"第 147 场周赛","title_slug":"weekly-contest-147","start_time":1564281000,"is_ee_exam_contest":null},"questions":[{"question_id":1137,"title":"第 N 个泰波那契数","title_slug":"n-th-tribonacci-number","rating":1142.8650731632,"_hash":651101767,"paid_only":false},{"question_id":1138,"title":"字母板上的路径","title_slug":"alphabet-board-path","rating":1410.5239927267,"_hash":638264577,"paid_only":false},{"question_id":1139,"title":"最大的以 1 为边界的正方形","title_slug":"largest-1-bordered-square","rating":1744.0388789755,"_hash":1167299665,"paid_only":false},{"question_id":1140,"title":"石子游戏 II","title_slug":"stone-game-ii","rating":2034.9740902393,"_hash":2086212420,"paid_only":false}],"company":{}},{"contest":{"id":91,"title":"第 5 场双周赛","title_slug":"biweekly-contest-5","start_time":1564237800,"is_ee_exam_contest":null},"questions":[{"question_id":1133,"title":"最大唯一数","title_slug":"largest-unique-number","rating":1226.2960135431,"_hash":3008054233,"paid_only":false},{"question_id":1134,"title":"阿姆斯特朗数","title_slug":"armstrong-number","rating":1231.4004525633,"_hash":391342400,"paid_only":false},{"question_id":1135,"title":"最低成本连通所有城市","title_slug":"connecting-cities-with-minimum-cost","rating":1752.9555725796,"_hash":282466705,"paid_only":false},{"question_id":1136,"title":"并行课程","title_slug":"parallel-courses","rating":1710.0787625377,"_hash":1009688921,"paid_only":false}],"company":{}},{"contest":{"id":89,"title":"第 146 场周赛","title_slug":"weekly-contest-146","start_time":1563676200,"is_ee_exam_contest":null},"questions":[{"question_id":1128,"title":"等价多米诺骨牌对的数量","title_slug":"number-of-equivalent-domino-pairs","rating":1332.622596763,"_hash":2262588000,"paid_only":false},{"question_id":1129,"title":"颜色交替的最短路径","title_slug":"shortest-path-with-alternating-colors","rating":1779.7534349429,"_hash":3681526411,"paid_only":false},{"question_id":1130,"title":"叶值的最小代价生成树","title_slug":"minimum-cost-tree-from-leaf-values","rating":1919.1749818083,"_hash":2542321733,"paid_only":false},{"question_id":1131,"title":"绝对值表达式的最大值","title_slug":"maximum-of-absolute-value-expression","rating":2059.4040623264,"_hash":1649292854,"paid_only":false}],"company":{}},{"contest":{"id":87,"title":"第 145 场周赛","title_slug":"weekly-contest-145","start_time":1563071400,"is_ee_exam_contest":null},"questions":[{"question_id":1122,"title":"数组的相对排序","title_slug":"relative-sort-array","rating":1188.6311093158,"_hash":509756552,"paid_only":false},{"question_id":1123,"title":"最深叶节点的最近公共祖先","title_slug":"lowest-common-ancestor-of-deepest-leaves","rating":1607.0005715974,"_hash":1997275023,"paid_only":false},{"question_id":1124,"title":"表现良好的最长时间段","title_slug":"longest-well-performing-interval","rating":1908.3866125757,"_hash":2409750542,"paid_only":false},{"question_id":1125,"title":"最小的必要团队","title_slug":"smallest-sufficient-team","rating":2250.9318291559,"_hash":537590451,"paid_only":false}],"company":{}},{"contest":{"id":88,"title":"第 4 场双周赛","title_slug":"biweekly-contest-4","start_time":1563028200,"is_ee_exam_contest":null},"questions":[{"question_id":1118,"title":"一月有多少天","title_slug":"number-of-days-in-a-month","rating":1227.3485530532,"_hash":3564822043,"paid_only":false},{"question_id":1119,"title":"删去字符串中的元音","title_slug":"remove-vowels-from-a-string","rating":1232.8314427996,"_hash":1547394567,"paid_only":false},{"question_id":1120,"title":"子树的最大平均值","title_slug":"maximum-average-subtree","rating":1361.8801013336,"_hash":1060291152,"paid_only":false},{"question_id":1121,"title":"将数组分成几个递增序列","title_slug":"divide-array-into-increasing-sequences","rating":1664.7703749741,"_hash":2894413444,"paid_only":false}],"company":{}},{"contest":{"id":86,"title":"第 144 场周赛","title_slug":"weekly-contest-144","start_time":1562466600,"is_ee_exam_contest":null},"questions":[{"question_id":1108,"title":"IP 地址无效化","title_slug":"defanging-an-ip-address","rating":1084.1319467318,"_hash":1418471367,"paid_only":false},{"question_id":1109,"title":"航班预订统计","title_slug":"corporate-flight-bookings","rating":1569.7528744586,"_hash":545869308,"paid_only":false},{"question_id":1110,"title":"删点成林","title_slug":"delete-nodes-and-return-forest","rating":1511.3725353467,"_hash":771122731,"paid_only":false},{"question_id":1111,"title":"有效括号的嵌套深度","title_slug":"maximum-nesting-depth-of-two-valid-parentheses-strings","rating":1749.4981778209,"_hash":3619796334,"paid_only":false}],"company":{}},{"contest":{"id":84,"title":"第 143 场周赛","title_slug":"weekly-contest-143","start_time":1561861800,"is_ee_exam_contest":null},"questions":[{"question_id":1103,"title":"分糖果 II","title_slug":"distribute-candies-to-people","rating":1287.1053917452,"_hash":4294197536,"paid_only":false},{"question_id":1104,"title":"二叉树寻路","title_slug":"path-in-zigzag-labelled-binary-tree","rating":1544.8391626032,"_hash":1959869314,"paid_only":false},{"question_id":1105,"title":"填充书架","title_slug":"filling-bookcase-shelves","rating":2014.2979320644,"_hash":2099267983,"paid_only":false},{"question_id":1106,"title":"解析布尔表达式","title_slug":"parsing-a-boolean-expression","rating":1880.4226853663,"_hash":253585197,"paid_only":false}],"company":{}},{"contest":{"id":85,"title":"第 3 场双周赛","title_slug":"biweekly-contest-3","start_time":1561818600,"is_ee_exam_contest":null},"questions":[{"question_id":1099,"title":"小于 K 的两数之和","title_slug":"two-sum-less-than-k","rating":1245.2741257148,"_hash":1002673857,"paid_only":false},{"question_id":1100,"title":"长度为 K 的无重复字符子串","title_slug":"find-k-length-substrings-with-no-repeated-characters","rating":1348.670191438,"_hash":3246372293,"paid_only":false},{"question_id":1101,"title":"彼此熟识的最早时间","title_slug":"the-earliest-moment-when-everyone-become-friends","rating":1558.4971807039,"_hash":234159120,"paid_only":false},{"question_id":1102,"title":"得分最高的路径","title_slug":"path-with-maximum-minimum-value","rating":2011.3542735398,"_hash":319427731,"paid_only":false}],"company":{}},{"contest":{"id":74,"title":"第 142 场周赛","title_slug":"weekly-contest-142","start_time":1561257000,"is_ee_exam_contest":null},"questions":[{"question_id":1093,"title":"大样本统计","title_slug":"statistics-from-a-large-sample","rating":1471.6221713607,"_hash":781431378,"paid_only":false},{"question_id":1094,"title":"拼车","title_slug":"car-pooling","rating":1441.4290319373,"_hash":1187211206,"paid_only":false},{"question_id":1095,"title":"山脉数组中查找目标值","title_slug":"find-in-mountain-array","rating":1827.090740222,"_hash":40615146,"paid_only":false},{"question_id":1096,"title":"花括号展开 II","title_slug":"brace-expansion-ii","rating":2348.5159376523,"_hash":1730213489,"paid_only":false}],"company":{}},{"contest":{"id":72,"title":"第 141 场周赛","title_slug":"weekly-contest-141","start_time":1560652200,"is_ee_exam_contest":null},"questions":[{"question_id":1089,"title":"复写零","title_slug":"duplicate-zeros","rating":1262.5890311992,"_hash":1350925428,"paid_only":false},{"question_id":1090,"title":"受标签影响的最大值","title_slug":"largest-values-from-labels","rating":1501.1152614679,"_hash":2513980161,"paid_only":false},{"question_id":1091,"title":"二进制矩阵中的最短路径","title_slug":"shortest-path-in-binary-matrix","rating":1658.3474650806,"_hash":1423912379,"paid_only":false},{"question_id":1092,"title":"最短公共超序列","title_slug":"shortest-common-supersequence","rating":1976.7214151234,"_hash":3433602336,"paid_only":false}],"company":{}},{"contest":{"id":73,"title":"第 2 场双周赛","title_slug":"biweekly-contest-2","start_time":1560609000,"is_ee_exam_contest":null},"questions":[{"question_id":1085,"title":"最小元素各数位之和","title_slug":"sum-of-digits-in-the-minimum-number","rating":1256.4891142083,"_hash":800569224,"paid_only":false},{"question_id":1086,"title":"前五科的均分","title_slug":"high-five","rating":1327.0282989915,"_hash":2018971200,"paid_only":false},{"question_id":1087,"title":"花括号展开","title_slug":"brace-expansion","rating":1480.1116248664,"_hash":3506344616,"paid_only":false},{"question_id":1088,"title":"易混淆数 II","title_slug":"confusing-number-ii","rating":2076.8975497986,"_hash":2950336182,"paid_only":false}],"company":{}},{"contest":{"id":71,"title":"第 140 场周赛","title_slug":"weekly-contest-140","start_time":1560047400,"is_ee_exam_contest":null},"questions":[{"question_id":1078,"title":"Bigram 分词","title_slug":"occurrences-after-bigram","rating":1274.7596170193,"_hash":2962478235,"paid_only":false},{"question_id":1079,"title":"活字印刷","title_slug":"letter-tile-possibilities","rating":1740.5014205942,"_hash":3654833214,"paid_only":false},{"question_id":1080,"title":"根到叶路径上的不足节点","title_slug":"insufficient-nodes-in-root-to-leaf-paths","rating":1804.5783242151,"_hash":547605841,"paid_only":false},{"question_id":1081,"title":"不同字符的最小子序列","title_slug":"smallest-subsequence-of-distinct-characters","rating":2184.5241011615,"_hash":2695383302,"paid_only":false}],"company":{}},{"contest":{"id":69,"title":"第 139 场周赛","title_slug":"weekly-contest-139","start_time":1559442600,"is_ee_exam_contest":null},"questions":[{"question_id":1071,"title":"字符串的最大公因子","title_slug":"greatest-common-divisor-of-strings","rating":1397.8875115008,"_hash":3816685448,"paid_only":false},{"question_id":1072,"title":"按列翻转得到最大值等行数","title_slug":"flip-columns-for-maximum-number-of-equal-rows","rating":1797.5851607225,"_hash":1857526630,"paid_only":false},{"question_id":1073,"title":"负二进制数相加","title_slug":"adding-two-negabinary-numbers","rating":1806.5891699944,"_hash":3275619185,"paid_only":false},{"question_id":1074,"title":"元素和为目标值的子矩阵数量","title_slug":"number-of-submatrices-that-sum-to-target","rating":2189.3802630548,"_hash":1802692575,"paid_only":false}],"company":{}},{"contest":{"id":70,"title":"第 1 场双周赛","title_slug":"biweekly-contest-1","start_time":1559399400,"is_ee_exam_contest":null},"questions":[{"question_id":1064,"title":"不动点","title_slug":"fixed-point","rating":1307.9800903088,"_hash":3920925170,"paid_only":false},{"question_id":1065,"title":"字符串的索引对","title_slug":"index-pairs-of-a-string","rating":1389.331169471,"_hash":2464323261,"paid_only":false},{"question_id":1066,"title":"校园自行车分配 II","title_slug":"campus-bikes-ii","rating":1885.1051527272,"_hash":729170392,"paid_only":false},{"question_id":1067,"title":"范围内的数字计数","title_slug":"digit-count-in-range","rating":2025.1529365814,"_hash":1347652080,"paid_only":false}],"company":{}},{"contest":{"id":68,"title":"第 138 场周赛","title_slug":"weekly-contest-138","start_time":1558837800,"is_ee_exam_contest":null},"questions":[{"question_id":1051,"title":"高度检查器","title_slug":"height-checker","rating":1303.0179795942,"_hash":479546084,"paid_only":false},{"question_id":1052,"title":"爱生气的书店老板","title_slug":"grumpy-bookstore-owner","rating":1418.1401949854,"_hash":3953245616,"paid_only":false},{"question_id":1053,"title":"交换一次的先前排列","title_slug":"previous-permutation-with-one-swap","rating":1633.1789521619,"_hash":3119606051,"paid_only":false},{"question_id":1054,"title":"距离相等的条形码","title_slug":"distant-barcodes","rating":1701.5735371897,"_hash":2024934932,"paid_only":false}],"company":{}},{"contest":{"id":67,"title":"第 137 场周赛","title_slug":"weekly-contest-137","start_time":1558233000,"is_ee_exam_contest":null},"questions":[{"question_id":1046,"title":"最后一块石头的重量","title_slug":"last-stone-weight","rating":1172.6819789183,"_hash":1420036364,"paid_only":false},{"question_id":1047,"title":"删除字符串中的所有相邻重复项","title_slug":"remove-all-adjacent-duplicates-in-string","rating":1286.3167937403,"_hash":2941915891,"paid_only":false},{"question_id":1048,"title":"最长字符串链","title_slug":"longest-string-chain","rating":1599.2720584736,"_hash":2048723677,"paid_only":false},{"question_id":1049,"title":"最后一块石头的重量 II","title_slug":"last-stone-weight-ii","rating":2092.4861692502,"_hash":305762053,"paid_only":false}],"company":{}},{"contest":{"id":66,"title":"第 136 场周赛","title_slug":"weekly-contest-136","start_time":1557628200,"is_ee_exam_contest":null},"questions":[{"question_id":1041,"title":"困于环中的机器人","title_slug":"robot-bounded-in-circle","rating":1521.1768537583,"_hash":2777625264,"paid_only":false},{"question_id":1042,"title":"不邻接植花","title_slug":"flower-planting-with-no-adjacent","rating":1712.4010133221,"_hash":2386982504,"paid_only":false},{"question_id":1043,"title":"分隔数组以得到最大和","title_slug":"partition-array-for-maximum-sum","rating":1916.0689858272,"_hash":1916400350,"paid_only":false},{"question_id":1044,"title":"最长重复子串","title_slug":"longest-duplicate-substring","rating":2428.7985254341,"_hash":625310591,"paid_only":false}],"company":{}},{"contest":{"id":65,"title":"第 135 场周赛","title_slug":"weekly-contest-135","start_time":1557023400,"is_ee_exam_contest":null},"questions":[{"question_id":1037,"title":"有效的回旋镖","title_slug":"valid-boomerang","rating":1255.9002796024,"_hash":2272805308,"paid_only":false},{"question_id":1038,"title":"从二叉搜索树到更大和树","title_slug":"binary-search-tree-to-greater-sum-tree","rating":1374.6755455786,"_hash":3738671880,"paid_only":false},{"question_id":1039,"title":"多边形三角剖分的最低得分","title_slug":"minimum-score-triangulation-of-polygon","rating":2130.1135718486,"_hash":491083091,"paid_only":false},{"question_id":1040,"title":"移动石子直到连续 II","title_slug":"moving-stones-until-consecutive-ii","rating":2455.8244137907,"_hash":2184686055,"paid_only":false}],"company":{}},{"contest":{"id":64,"title":"第 134 场周赛","title_slug":"weekly-contest-134","start_time":1556418600,"is_ee_exam_contest":null},"questions":[{"question_id":1033,"title":"移动石子直到连续","title_slug":"moving-stones-until-consecutive","rating":1421.2624065513,"_hash":1049390106,"paid_only":false},{"question_id":1034,"title":"边界着色","title_slug":"coloring-a-border","rating":1578.8503818621,"_hash":345204207,"paid_only":false},{"question_id":1035,"title":"不相交的线","title_slug":"uncrossed-lines","rating":1805.5947071171,"_hash":1788564041,"paid_only":false},{"question_id":1036,"title":"逃离大迷宫","title_slug":"escape-a-large-maze","rating":2164.8287157213,"_hash":2632738906,"paid_only":false}],"company":{}},{"contest":{"id":59,"title":"第 133 场周赛","title_slug":"weekly-contest-133","start_time":1555813800,"is_ee_exam_contest":null},"questions":[{"question_id":1029,"title":"两地调度","title_slug":"two-city-scheduling","rating":1348.0079390256,"_hash":3535624008,"paid_only":false},{"question_id":1030,"title":"距离顺序排列矩阵单元格","title_slug":"matrix-cells-in-distance-order","rating":1585.5793143983,"_hash":3321963457,"paid_only":false},{"question_id":1031,"title":"两个非重叠子数组的最大和","title_slug":"maximum-sum-of-two-non-overlapping-subarrays","rating":1680.4852623991,"_hash":3974822873,"paid_only":false},{"question_id":1032,"title":"字符流","title_slug":"stream-of-characters","rating":1970.4608098164,"_hash":1504907424,"paid_only":false}],"company":{}},{"contest":{"id":57,"title":"第 132 场周赛","title_slug":"weekly-contest-132","start_time":1555209000,"is_ee_exam_contest":null},"questions":[{"question_id":1025,"title":"除数博弈","title_slug":"divisor-game","rating":1435.3564963722,"_hash":2669738738,"paid_only":false},{"question_id":1026,"title":"节点与其祖先之间的最大差值","title_slug":"maximum-difference-between-node-and-ancestor","rating":1446.4280778775,"_hash":2850260537,"paid_only":false},{"question_id":1027,"title":"最长等差数列","title_slug":"longest-arithmetic-subsequence","rating":1758.75255141,"_hash":4193739814,"paid_only":false},{"question_id":1028,"title":"从先序遍历还原二叉树","title_slug":"recover-a-tree-from-preorder-traversal","rating":1797.4917663632,"_hash":4138934238,"paid_only":false}],"company":{}},{"contest":{"id":56,"title":"第 131 场周赛","title_slug":"weekly-contest-131","start_time":1554604200,"is_ee_exam_contest":null},"questions":[{"question_id":1021,"title":"删除最外层的括号","title_slug":"remove-outermost-parentheses","rating":1311.3495317884,"_hash":908082157,"paid_only":false},{"question_id":1022,"title":"从根到叶的二进制数之和","title_slug":"sum-of-root-to-leaf-binary-numbers","rating":1462.4423844498,"_hash":3615890317,"paid_only":false},{"question_id":1023,"title":"驼峰式匹配","title_slug":"camelcase-matching","rating":1537.1387686755,"_hash":875418963,"paid_only":false},{"question_id":1024,"title":"视频拼接","title_slug":"video-stitching","rating":1746.135917977,"_hash":2812871030,"paid_only":false}],"company":{}},{"contest":{"id":55,"title":"第 130 场周赛","title_slug":"weekly-contest-130","start_time":1553999400,"is_ee_exam_contest":null},"questions":[{"question_id":1018,"title":"可被 5 整除的二进制前缀","title_slug":"binary-prefix-divisible-by-5","rating":1376.4549624575,"_hash":303821987,"paid_only":false},{"question_id":1017,"title":"负二进制转换","title_slug":"convert-to-base-2","rating":1697.8500495479,"_hash":704152903,"paid_only":false},{"question_id":1019,"title":"链表中的下一个更大节点","title_slug":"next-greater-node-in-linked-list","rating":1570.8347522104,"_hash":1872980159,"paid_only":false},{"question_id":1020,"title":"飞地的数量","title_slug":"number-of-enclaves","rating":1615.4767730477,"_hash":1185092838,"paid_only":false}],"company":{}},{"contest":{"id":54,"title":"第 129 场周赛","title_slug":"weekly-contest-129","start_time":1553391000,"is_ee_exam_contest":null},"questions":[{"question_id":1013,"title":"将数组分成和相等的三个部分","title_slug":"partition-array-into-three-parts-with-equal-sum","rating":1378.7570411077,"_hash":733560660,"paid_only":false},{"question_id":1015,"title":"可被 K 整除的最小整数","title_slug":"smallest-integer-divisible-by-k","rating":1874.6468976233,"_hash":1796150705,"paid_only":false},{"question_id":1014,"title":"最佳观光组合","title_slug":"best-sightseeing-pair","rating":1730.3052054913,"_hash":212376193,"paid_only":false},{"question_id":1016,"title":"子串能表示从 1 到 N 数字的二进制串","title_slug":"binary-string-with-substrings-representing-1-to-n","rating":1779.3931248179,"_hash":3814673758,"paid_only":false}],"company":{}},{"contest":{"id":53,"title":"第 128 场周赛","title_slug":"weekly-contest-128","start_time":1552789800,"is_ee_exam_contest":null},"questions":[{"question_id":1009,"title":"十进制整数的反码","title_slug":"complement-of-base-10-integer","rating":1234.7084656358,"_hash":2765939834,"paid_only":false},{"question_id":1010,"title":"总持续时间可被 60 整除的歌曲","title_slug":"pairs-of-songs-with-total-durations-divisible-by-60","rating":1377.1913915125,"_hash":2310396,"paid_only":false},{"question_id":1011,"title":"在 D 天内送达包裹的能力","title_slug":"capacity-to-ship-packages-within-d-days","rating":1725.4481937307,"_hash":3609066875,"paid_only":false},{"question_id":1012,"title":"至少有 1 位重复的数字","title_slug":"numbers-with-repeated-digits","rating":2230.1673059455,"_hash":3469926498,"paid_only":false}],"company":{}},{"contest":{"id":52,"title":"第 127 场周赛","title_slug":"weekly-contest-127","start_time":1552185000,"is_ee_exam_contest":null},"questions":[{"question_id":1005,"title":"K 次取反后最大化的数组和","title_slug":"maximize-sum-of-array-after-k-negations","rating":1274.6742564805,"_hash":3607948747,"paid_only":false},{"question_id":1006,"title":"笨阶乘","title_slug":"clumsy-factorial","rating":1407.9870845299,"_hash":3282812734,"paid_only":false},{"question_id":1007,"title":"行相等的最少多米诺旋转","title_slug":"minimum-domino-rotations-for-equal-row","rating":1541.348438509,"_hash":2150121610,"paid_only":false},{"question_id":1008,"title":"前序遍历构造二叉搜索树","title_slug":"construct-binary-search-tree-from-preorder-traversal","rating":1562.9802666517,"_hash":4123515556,"paid_only":false}],"company":{}},{"contest":{"id":50,"title":"第 126 场周赛","title_slug":"weekly-contest-126","start_time":1551580200,"is_ee_exam_contest":null},"questions":[{"question_id":1002,"title":"查找共用字符","title_slug":"find-common-characters","rating":1279.7669712099,"_hash":1907819963,"paid_only":false},{"question_id":1003,"title":"检查替换后的词是否有效","title_slug":"check-if-word-is-valid-after-substitutions","rating":1426.7144554733,"_hash":2965139328,"paid_only":false},{"question_id":1004,"title":"最大连续1的个数 III","title_slug":"max-consecutive-ones-iii","rating":1655.6433885989,"_hash":296740468,"paid_only":false},{"question_id":1000,"title":"合并石头的最低成本","title_slug":"minimum-cost-to-merge-stones","rating":2422.5309771173,"_hash":730656427,"paid_only":false}],"company":{}},{"contest":{"id":49,"title":"第 125 场周赛","title_slug":"weekly-contest-125","start_time":1550975400,"is_ee_exam_contest":null},"questions":[{"question_id":997,"title":"找到小镇的法官","title_slug":"find-the-town-judge","rating":1201.6117337798,"_hash":588772553,"paid_only":false},{"question_id":999,"title":"可以被一步捕获的棋子数","title_slug":"available-captures-for-rook","rating":1317.9521104466,"_hash":2274658324,"paid_only":false},{"question_id":998,"title":"最大二叉树 II","title_slug":"maximum-binary-tree-ii","rating":1497.8880991093,"_hash":3866325213,"paid_only":false},{"question_id":1001,"title":"网格照明","title_slug":"grid-illumination","rating":1873.0367582475,"_hash":2294942579,"paid_only":false}],"company":{}},{"contest":{"id":48,"title":"第 124 场周赛","title_slug":"weekly-contest-124","start_time":1550370600,"is_ee_exam_contest":null},"questions":[{"question_id":993,"title":"二叉树的堂兄弟节点","title_slug":"cousins-in-binary-tree","rating":1287.9002757199,"_hash":1715714434,"paid_only":false},{"question_id":994,"title":"腐烂的橘子","title_slug":"rotting-oranges","rating":1432.9051050881,"_hash":782747152,"paid_only":false},{"question_id":995,"title":"K 连续位的最小翻转次数","title_slug":"minimum-number-of-k-consecutive-bit-flips","rating":1835.4868365659,"_hash":2191726075,"paid_only":false},{"question_id":996,"title":"正方形数组的数目","title_slug":"number-of-squareful-arrays","rating":1932.3730795204,"_hash":448999750,"paid_only":false}],"company":{}},{"contest":{"id":47,"title":"第 123 场周赛","title_slug":"weekly-contest-123","start_time":1549765800,"is_ee_exam_contest":null},"questions":[{"question_id":989,"title":"数组形式的整数加法","title_slug":"add-to-array-form-of-integer","rating":1234.7692637513,"_hash":2582233376,"paid_only":false},{"question_id":990,"title":"等式方程的可满足性","title_slug":"satisfiability-of-equality-equations","rating":1638.0148920643,"_hash":369209811,"paid_only":false},{"question_id":991,"title":"坏了的计算器","title_slug":"broken-calculator","rating":1909.4189035523,"_hash":376871815,"paid_only":false},{"question_id":992,"title":"K 个不同整数的子数组","title_slug":"subarrays-with-k-different-integers","rating":2210.3503183571,"_hash":3123575090,"paid_only":false}],"company":{}},{"contest":{"id":46,"title":"第 122 场周赛","title_slug":"weekly-contest-122","start_time":1549161000,"is_ee_exam_contest":null},"questions":[{"question_id":985,"title":"查询后的偶数和","title_slug":"sum-of-even-numbers-after-queries","rating":1198.4180401014,"_hash":2841881996,"paid_only":false},{"question_id":988,"title":"从叶结点开始的最小字符串","title_slug":"smallest-string-starting-from-leaf","rating":1429.1878389249,"_hash":1210196211,"paid_only":false},{"question_id":986,"title":"区间列表的交集","title_slug":"interval-list-intersections","rating":1541.6944600975,"_hash":3869891296,"paid_only":false},{"question_id":987,"title":"二叉树的垂序遍历","title_slug":"vertical-order-traversal-of-a-binary-tree","rating":1675.9610355975,"_hash":3791950406,"paid_only":false}],"company":{}},{"contest":{"id":45,"title":"第 121 场周赛","title_slug":"weekly-contest-121","start_time":1548556200,"is_ee_exam_contest":null},"questions":[{"question_id":984,"title":"不含 AAA 或 BBB 的字符串","title_slug":"string-without-aaa-or-bbb","rating":1474.0150725665,"_hash":3491443766,"paid_only":false},{"question_id":981,"title":"基于时间的键值存储","title_slug":"time-based-key-value-store","rating":1574.7542247682,"_hash":2074201652,"paid_only":false},{"question_id":983,"title":"最低票价","title_slug":"minimum-cost-for-tickets","rating":1786.3121598293,"_hash":1414741845,"paid_only":false},{"question_id":982,"title":"按位与为零的三元组","title_slug":"triples-with-bitwise-and-equal-to-zero","rating":2084.9697035674,"_hash":1019777981,"paid_only":false}],"company":{}},{"contest":{"id":44,"title":"第 120 场周赛","title_slug":"weekly-contest-120","start_time":1547951400,"is_ee_exam_contest":null},"questions":[{"question_id":977,"title":"有序数组的平方","title_slug":"squares-of-a-sorted-array","rating":1129.949090232,"_hash":969893325,"paid_only":false},{"question_id":978,"title":"最长湍流子数组","title_slug":"longest-turbulent-subarray","rating":1393.4123491817,"_hash":3588035361,"paid_only":false},{"question_id":979,"title":"在二叉树中分配硬币","title_slug":"distribute-coins-in-binary-tree","rating":1709.1461451873,"_hash":2734248382,"paid_only":false},{"question_id":980,"title":"不同路径 III","title_slug":"unique-paths-iii","rating":1830.3165569278,"_hash":1134359923,"paid_only":false}],"company":{}},{"contest":{"id":43,"title":"第 119 场周赛","title_slug":"weekly-contest-119","start_time":1547346600,"is_ee_exam_contest":null},"questions":[{"question_id":973,"title":"最接近原点的 K 个点","title_slug":"k-closest-points-to-origin","rating":1213.8073621345,"_hash":4289106415,"paid_only":false},{"question_id":976,"title":"三角形的最大周长","title_slug":"largest-perimeter-triangle","rating":1340.5559417151,"_hash":1665689312,"paid_only":false},{"question_id":974,"title":"和可被 K 整除的子数组","title_slug":"subarray-sums-divisible-by-k","rating":1675.989407584,"_hash":1023487571,"paid_only":false},{"question_id":975,"title":"奇偶跳","title_slug":"odd-even-jump","rating":2079.1911227043,"_hash":1733046404,"paid_only":false}],"company":{}},{"contest":{"id":42,"title":"第 118 场周赛","title_slug":"weekly-contest-118","start_time":1546741800,"is_ee_exam_contest":null},"questions":[{"question_id":970,"title":"强整数","title_slug":"powerful-integers","rating":1338.8322315568,"_hash":3883411103,"paid_only":false},{"question_id":969,"title":"煎饼排序","title_slug":"pancake-sorting","rating":1590.5791055102,"_hash":1247027569,"paid_only":false},{"question_id":971,"title":"翻转二叉树以匹配先序遍历","title_slug":"flip-binary-tree-to-match-preorder-traversal","rating":1786.5491561897,"_hash":16117382,"paid_only":false},{"question_id":972,"title":"相等的有理数","title_slug":"equal-rational-numbers","rating":2121.3147151648,"_hash":3639230179,"paid_only":false}],"company":{}},{"contest":{"id":41,"title":"第 117 场周赛","title_slug":"weekly-contest-117","start_time":1546137000,"is_ee_exam_contest":null},"questions":[{"question_id":965,"title":"单值二叉树","title_slug":"univalued-binary-tree","rating":1177.5660617941,"_hash":472415307,"paid_only":false},{"question_id":967,"title":"连续差相同的数字","title_slug":"numbers-with-same-consecutive-differences","rating":1432.9593207076,"_hash":2436753495,"paid_only":false},{"question_id":966,"title":"元音拼写检查器","title_slug":"vowel-spellchecker","rating":1795.0422250815,"_hash":3548460508,"paid_only":false},{"question_id":968,"title":"监控二叉树","title_slug":"binary-tree-cameras","rating":2124.1329592058,"_hash":1589710386,"paid_only":false}],"company":{}},{"contest":{"id":39,"title":"第 116 场周赛","title_slug":"weekly-contest-116","start_time":1545532200,"is_ee_exam_contest":null},"questions":[{"question_id":961,"title":"在长度 2N 的数组中找出重复 N 次的元素","title_slug":"n-repeated-element-in-size-2n-array","rating":1161.6227767245,"_hash":1677761084,"paid_only":false},{"question_id":962,"title":"最大宽度坡","title_slug":"maximum-width-ramp","rating":1607.80608595,"_hash":4064149855,"paid_only":false},{"question_id":963,"title":"最小面积矩形 II","title_slug":"minimum-area-rectangle-ii","rating":1990.7738526153,"_hash":2631196608,"paid_only":false},{"question_id":964,"title":"表示数字的最少运算符","title_slug":"least-operators-to-express-number","rating":2594.135673452,"_hash":571415893,"paid_only":false}],"company":{}},{"contest":{"id":38,"title":"第 115 场周赛","title_slug":"weekly-contest-115","start_time":1544927400,"is_ee_exam_contest":null},"questions":[{"question_id":957,"title":"N 天后的牢房","title_slug":"prison-cells-after-n-days","rating":1392.0853311911,"_hash":572178714,"paid_only":false},{"question_id":958,"title":"二叉树的完全性检验","title_slug":"check-completeness-of-a-binary-tree","rating":1702.8035923458,"_hash":4172058127,"paid_only":false},{"question_id":959,"title":"由斜杠划分区域","title_slug":"regions-cut-by-slashes","rating":2135.5738659086,"_hash":244758471,"paid_only":false},{"question_id":960,"title":"删列造序 III","title_slug":"delete-columns-to-make-sorted-iii","rating":2246.8671174565,"_hash":3194493363,"paid_only":false}],"company":{}},{"contest":{"id":37,"title":"第 114 场周赛","title_slug":"weekly-contest-114","start_time":1544322600,"is_ee_exam_contest":null},"questions":[{"question_id":953,"title":"验证外星语词典","title_slug":"verifying-an-alien-dictionary","rating":1299.6035132992,"_hash":3996759401,"paid_only":false},{"question_id":954,"title":"二倍数对数组","title_slug":"array-of-doubled-pairs","rating":1547.5714796512,"_hash":3671857466,"paid_only":false},{"question_id":955,"title":"删列造序 II","title_slug":"delete-columns-to-make-sorted-ii","rating":1876.3854625677,"_hash":2817465096,"paid_only":false},{"question_id":956,"title":"最高的广告牌","title_slug":"tallest-billboard","rating":2381.479024858,"_hash":2251334448,"paid_only":false}],"company":{}},{"contest":{"id":36,"title":"第 113 场周赛","title_slug":"weekly-contest-113","start_time":1543717800,"is_ee_exam_contest":null},"questions":[{"question_id":949,"title":"给定数字能组成的最大时间","title_slug":"largest-time-for-given-digits","rating":1495.3186477678,"_hash":1800599582,"paid_only":false},{"question_id":951,"title":"翻转等价二叉树","title_slug":"flip-equivalent-binary-trees","rating":1477.4844514104,"_hash":444680013,"paid_only":false},{"question_id":950,"title":"按递增顺序显示卡牌","title_slug":"reveal-cards-in-increasing-order","rating":1686.4493679523,"_hash":1319672571,"paid_only":false},{"question_id":952,"title":"按公因数计算最大组件大小","title_slug":"largest-component-size-by-common-factor","rating":2272.1122260637,"_hash":1950962783,"paid_only":false}],"company":{}},{"contest":{"id":35,"title":"第 112 场周赛","title_slug":"weekly-contest-112","start_time":1543113000,"is_ee_exam_contest":null},"questions":[{"question_id":945,"title":"使数组唯一的最小增量","title_slug":"minimum-increment-to-make-array-unique","rating":1448.1207963663,"_hash":2617837584,"paid_only":false},{"question_id":946,"title":"验证栈序列","title_slug":"validate-stack-sequences","rating":1461.9157715206,"_hash":403672441,"paid_only":false},{"question_id":947,"title":"移除最多的同行或同列石头","title_slug":"most-stones-removed-with-same-row-or-column","rating":2034.6759416871,"_hash":728229560,"paid_only":false},{"question_id":948,"title":"令牌放置","title_slug":"bag-of-tokens","rating":1762.3115124143,"_hash":2688493082,"paid_only":false}],"company":{}},{"contest":{"id":34,"title":"第 111 场周赛","title_slug":"weekly-contest-111","start_time":1542508200,"is_ee_exam_contest":null},"questions":[{"question_id":941,"title":"有效的山脉数组","title_slug":"valid-mountain-array","rating":1208.0130656905,"_hash":4212893423,"paid_only":false},{"question_id":944,"title":"删列造序","title_slug":"delete-columns-to-make-sorted","rating":1396.4853538164,"_hash":3612858843,"paid_only":false},{"question_id":942,"title":"增减字符串匹配","title_slug":"di-string-match","rating":1444.2068009303,"_hash":2792312732,"paid_only":false},{"question_id":943,"title":"最短超级串","title_slug":"find-the-shortest-superstring","rating":2185.5444704515,"_hash":1762990534,"paid_only":false}],"company":{}},{"contest":{"id":33,"title":"第 110 场周赛","title_slug":"weekly-contest-110","start_time":1541903400,"is_ee_exam_contest":null},"questions":[{"question_id":937,"title":"重新排列日志文件","title_slug":"reorder-data-in-log-files","rating":1387.3672639293,"_hash":3738917436,"paid_only":false},{"question_id":938,"title":"二叉搜索树的范围和","title_slug":"range-sum-of-bst","rating":1335.0295688697,"_hash":2572143666,"paid_only":false},{"question_id":939,"title":"最小面积矩形","title_slug":"minimum-area-rectangle","rating":1752.2621077596,"_hash":1965686195,"paid_only":false},{"question_id":940,"title":"不同的子序列 II","title_slug":"distinct-subsequences-ii","rating":1985.2417520906,"_hash":2213463441,"paid_only":false}],"company":{}},{"contest":{"id":32,"title":"第 109 场周赛","title_slug":"weekly-contest-109","start_time":1541295000,"is_ee_exam_contest":null},"questions":[{"question_id":933,"title":"最近的请求次数","title_slug":"number-of-recent-calls","rating":1337.8472367494,"_hash":181840890,"paid_only":false},{"question_id":935,"title":"骑士拨号器","title_slug":"knight-dialer","rating":1690.1655236843,"_hash":2786534786,"paid_only":false},{"question_id":934,"title":"最短的桥","title_slug":"shortest-bridge","rating":1825.770486008,"_hash":4107503015,"paid_only":false},{"question_id":936,"title":"戳印序列","title_slug":"stamping-the-sequence","rating":2583.406911951,"_hash":3709920516,"paid_only":false}],"company":{}},{"contest":{"id":31,"title":"第 108 场周赛","title_slug":"weekly-contest-108","start_time":1540690200,"is_ee_exam_contest":null},"questions":[{"question_id":929,"title":"独特的电子邮件地址","title_slug":"unique-email-addresses","rating":1199.2892732505,"_hash":3531395010,"paid_only":false},{"question_id":930,"title":"和相同的二元子数组","title_slug":"binary-subarrays-with-sum","rating":1591.5492530876,"_hash":1629689602,"paid_only":false},{"question_id":931,"title":"下降路径最小和","title_slug":"minimum-falling-path-sum","rating":1573.2701790739,"_hash":3874484865,"paid_only":false},{"question_id":932,"title":"漂亮数组","title_slug":"beautiful-array","rating":2294.0981174197,"_hash":3554305488,"paid_only":false}],"company":{}},{"contest":{"id":30,"title":"第 107 场周赛","title_slug":"weekly-contest-107","start_time":1540085400,"is_ee_exam_contest":null},"questions":[{"question_id":925,"title":"长按键入","title_slug":"long-pressed-name","rating":1271.3313760514,"_hash":101859828,"paid_only":false},{"question_id":926,"title":"将字符串翻转到单调递增","title_slug":"flip-string-to-monotone-increasing","rating":1601.511760532,"_hash":3457051682,"paid_only":false},{"question_id":927,"title":"三等分","title_slug":"three-equal-parts","rating":1994.3618892548,"_hash":2182253577,"paid_only":false},{"question_id":928,"title":"尽量减少恶意软件的传播 II","title_slug":"minimize-malware-spread-ii","rating":1985.2504512337,"_hash":1457368038,"paid_only":false}],"company":{}},{"contest":{"id":29,"title":"第 106 场周赛","title_slug":"weekly-contest-106","start_time":1539480600,"is_ee_exam_contest":null},"questions":[{"question_id":922,"title":"按奇偶排序数组 II","title_slug":"sort-array-by-parity-ii","rating":1173.505926482,"_hash":3658913842,"paid_only":false},{"question_id":921,"title":"使括号有效的最少添加","title_slug":"minimum-add-to-make-parentheses-valid","rating":1242.4710735813,"_hash":3288770916,"paid_only":false},{"question_id":923,"title":"三数之和的多种可能","title_slug":"3sum-with-multiplicity","rating":1710.9105378431,"_hash":352505600,"paid_only":false},{"question_id":924,"title":"尽量减少恶意软件的传播","title_slug":"minimize-malware-spread","rating":1868.9146755896,"_hash":28387341,"paid_only":false}],"company":{}},{"contest":{"id":28,"title":"第 105 场周赛","title_slug":"weekly-contest-105","start_time":1538875800,"is_ee_exam_contest":null},"questions":[{"question_id":917,"title":"仅仅反转字母","title_slug":"reverse-only-letters","rating":1228.630993648,"_hash":2941821802,"paid_only":false},{"question_id":918,"title":"环形子数组的最大和","title_slug":"maximum-sum-circular-subarray","rating":1777.3786570233,"_hash":3263594037,"paid_only":false},{"question_id":919,"title":"完全二叉树插入器","title_slug":"complete-binary-tree-inserter","rating":1690.9043557462,"_hash":3341470372,"paid_only":false},{"question_id":920,"title":"播放列表的数量","title_slug":"number-of-music-playlists","rating":2399.5729141925,"_hash":1165166058,"paid_only":false}],"company":{}},{"contest":{"id":27,"title":"第 104 场周赛","title_slug":"weekly-contest-104","start_time":1538271000,"is_ee_exam_contest":null},"questions":[{"question_id":914,"title":"卡牌分组","title_slug":"x-of-a-kind-in-a-deck-of-cards","rating":1370.6144908238,"_hash":3334808342,"paid_only":false},{"question_id":915,"title":"分割数组","title_slug":"partition-array-into-disjoint-intervals","rating":1500.8381829812,"_hash":217546662,"paid_only":false},{"question_id":916,"title":"单词子集","title_slug":"word-subsets","rating":1624.4737611923,"_hash":857697187,"paid_only":false},{"question_id":913,"title":"猫和老鼠","title_slug":"cat-and-mouse","rating":2566.5910742837,"_hash":1811529317,"paid_only":false}],"company":{}},{"contest":{"id":26,"title":"第 103 场周赛","title_slug":"weekly-contest-103","start_time":1537666200,"is_ee_exam_contest":null},"questions":[{"question_id":908,"title":"最小差值 I","title_slug":"smallest-range-i","rating":1298.5921473119,"_hash":690261450,"paid_only":false},{"question_id":909,"title":"蛇梯棋","title_slug":"snakes-and-ladders","rating":2019.5399647546,"_hash":478874060,"paid_only":false},{"question_id":910,"title":"最小差值 II","title_slug":"smallest-range-ii","rating":2134.5448970405,"_hash":1737160601,"paid_only":false},{"question_id":911,"title":"在线选举","title_slug":"online-election","rating":2000.8021428612,"_hash":2045578042,"paid_only":false}],"company":{}},{"contest":{"id":25,"title":"第 102 场周赛","title_slug":"weekly-contest-102","start_time":1537061400,"is_ee_exam_contest":null},"questions":[{"question_id":905,"title":"按奇偶排序数组","title_slug":"sort-array-by-parity","rating":1178.4942541235,"_hash":119654105,"paid_only":false},{"question_id":904,"title":"水果成篮","title_slug":"fruit-into-baskets","rating":1516.4104902196,"_hash":123050212,"paid_only":false},{"question_id":907,"title":"子数组的最小值之和","title_slug":"sum-of-subarray-minimums","rating":1975.5726300727,"_hash":2762853048,"paid_only":false},{"question_id":906,"title":"超级回文数","title_slug":"super-palindromes","rating":2140.0220703954,"_hash":159231277,"paid_only":false}],"company":{}},{"contest":{"id":24,"title":"第 101 场周赛","title_slug":"weekly-contest-101","start_time":1536456600,"is_ee_exam_contest":null},"questions":[{"question_id":900,"title":"RLE 迭代器","title_slug":"rle-iterator","rating":1532.2539947529,"_hash":2874032831,"paid_only":false},{"question_id":901,"title":"股票价格跨度","title_slug":"online-stock-span","rating":1708.8735585776,"_hash":613691832,"paid_only":false},{"question_id":902,"title":"最大为 N 的数字组合","title_slug":"numbers-at-most-n-given-digit-set","rating":1989.5369509422,"_hash":3023386017,"paid_only":false},{"question_id":903,"title":"DI 序列的有效排列","title_slug":"valid-permutations-for-di-sequence","rating":2433.3767704629,"_hash":2519726489,"paid_only":false}],"company":{}},{"contest":{"id":23,"title":"第 100 场周赛","title_slug":"weekly-contest-100","start_time":1535851800,"is_ee_exam_contest":null},"questions":[{"question_id":896,"title":"单调数列","title_slug":"monotonic-array","rating":1258.6719675401,"_hash":161597751,"paid_only":false},{"question_id":897,"title":"递增顺序搜索树","title_slug":"increasing-order-search-tree","rating":1473.2523136772,"_hash":1569116237,"paid_only":false},{"question_id":898,"title":"子数组按位或操作","title_slug":"bitwise-ors-of-subarrays","rating":2133.1003195919,"_hash":1959774558,"paid_only":false},{"question_id":899,"title":"有序队列","title_slug":"orderly-queue","rating":2096.6098086765,"_hash":1912276022,"paid_only":false}],"company":{}},{"contest":{"id":22,"title":"第 99 场周赛","title_slug":"weekly-contest-99","start_time":1535247000,"is_ee_exam_contest":null},"questions":[{"question_id":892,"title":"三维形体的表面积","title_slug":"surface-area-of-3d-shapes","rating":1507.8701119064,"_hash":1063164797,"paid_only":false},{"question_id":893,"title":"特殊等价字符串组","title_slug":"groups-of-special-equivalent-strings","rating":1590.0883962313,"_hash":1402867741,"paid_only":false},{"question_id":894,"title":"所有可能的真二叉树","title_slug":"all-possible-full-binary-trees","rating":1784.2539813582,"_hash":4144023748,"paid_only":false},{"question_id":895,"title":"最大频率栈","title_slug":"maximum-frequency-stack","rating":2027.8772739639,"_hash":4136320759,"paid_only":false}],"company":{}},{"contest":{"id":21,"title":"第 98 场周赛","title_slug":"weekly-contest-98","start_time":1534642200,"is_ee_exam_contest":null},"questions":[{"question_id":888,"title":"公平的糖果交换","title_slug":"fair-candy-swap","rating":1334.0564009231,"_hash":1232284801,"paid_only":false},{"question_id":890,"title":"查找和替换模式","title_slug":"find-and-replace-pattern","rating":1414.4918812526,"_hash":3073583780,"paid_only":false},{"question_id":889,"title":"根据前序和后序遍历构造二叉树","title_slug":"construct-binary-tree-from-preorder-and-postorder-traversal","rating":1731.5555445321,"_hash":3152421262,"paid_only":false},{"question_id":891,"title":"子序列宽度之和","title_slug":"sum-of-subsequence-widths","rating":2182.6180030785,"_hash":1150623470,"paid_only":false}],"company":{}},{"contest":{"id":20,"title":"第 97 场周赛","title_slug":"weekly-contest-97","start_time":1534037400,"is_ee_exam_contest":null},"questions":[{"question_id":884,"title":"两句话中的不常见单词","title_slug":"uncommon-words-from-two-sentences","rating":1259.409726189,"_hash":4093059486,"paid_only":false},{"question_id":885,"title":"螺旋矩阵 III","title_slug":"spiral-matrix-iii","rating":1678.3947690537,"_hash":571559842,"paid_only":false},{"question_id":886,"title":"可能的二分法","title_slug":"possible-bipartition","rating":1794.5827898448,"_hash":860518194,"paid_only":false},{"question_id":887,"title":"鸡蛋掉落","title_slug":"super-egg-drop","rating":2376.8658923518,"_hash":2610426510,"paid_only":false}],"company":{}},{"contest":{"id":19,"title":"第 96 场周赛","title_slug":"weekly-contest-96","start_time":1533432600,"is_ee_exam_contest":null},"questions":[{"question_id":883,"title":"三维形体投影面积","title_slug":"projection-area-of-3d-shapes","rating":1425.3981616639,"_hash":4256716489,"paid_only":false},{"question_id":881,"title":"救生艇","title_slug":"boats-to-save-people","rating":1529.7617243868,"_hash":559582932,"paid_only":false},{"question_id":880,"title":"索引处的解码字符串","title_slug":"decoded-string-at-index","rating":2010.5524756946,"_hash":3383627644,"paid_only":false},{"question_id":882,"title":"细分图中的可到达节点","title_slug":"reachable-nodes-in-subdivided-graph","rating":2328.4294689238,"_hash":2956439807,"paid_only":false}],"company":{}},{"contest":{"id":18,"title":"第 95 场周赛","title_slug":"weekly-contest-95","start_time":1532827800,"is_ee_exam_contest":null},"questions":[{"question_id":876,"title":"链表的中间结点","title_slug":"middle-of-the-linked-list","rating":1231.6157956848,"_hash":2188606245,"paid_only":false},{"question_id":877,"title":"石子游戏","title_slug":"stone-game","rating":1590.0463215721,"_hash":3927702135,"paid_only":false},{"question_id":878,"title":"第 N 个神奇数字","title_slug":"nth-magical-number","rating":1896.7975214446,"_hash":2613974860,"paid_only":false},{"question_id":879,"title":"盈利计划","title_slug":"profitable-schemes","rating":2204.3524370174,"_hash":3884874766,"paid_only":false}],"company":{}},{"contest":{"id":17,"title":"第 94 场周赛","title_slug":"weekly-contest-94","start_time":1532223000,"is_ee_exam_contest":null},"questions":[{"question_id":872,"title":"叶子相似的树","title_slug":"leaf-similar-trees","rating":1287.8970301681,"_hash":1479673533,"paid_only":false},{"question_id":874,"title":"模拟行走机器人","title_slug":"walking-robot-simulation","rating":1846.3568350016,"_hash":809566471,"paid_only":false},{"question_id":875,"title":"爱吃香蕉的珂珂","title_slug":"koko-eating-bananas","rating":1765.5654059263,"_hash":2370285073,"paid_only":false},{"question_id":873,"title":"最长的斐波那契子序列的长度","title_slug":"length-of-longest-fibonacci-subsequence","rating":1911.1959516695,"_hash":3865734981,"paid_only":false}],"company":{}},{"contest":{"id":16,"title":"第 93 场周赛","title_slug":"weekly-contest-93","start_time":1531618200,"is_ee_exam_contest":null},"questions":[{"question_id":868,"title":"二进制间距","title_slug":"binary-gap","rating":1307.2991245272,"_hash":3658316549,"paid_only":false},{"question_id":869,"title":"重新排序得到 2 的幂","title_slug":"reordered-power-of-2","rating":1504.8237159326,"_hash":2235555306,"paid_only":false},{"question_id":870,"title":"优势洗牌","title_slug":"advantage-shuffle","rating":1648.341757882,"_hash":301734990,"paid_only":false},{"question_id":871,"title":"最低加油次数","title_slug":"minimum-number-of-refueling-stops","rating":2074.4120526679,"_hash":4182324049,"paid_only":false}],"company":{}},{"contest":{"id":15,"title":"第 92 场周赛","title_slug":"weekly-contest-92","start_time":1531013400,"is_ee_exam_contest":null},"questions":[{"question_id":867,"title":"转置矩阵","title_slug":"transpose-matrix","rating":1258.8401788462,"_hash":638561610,"paid_only":false},{"question_id":865,"title":"具有所有最深节点的最小子树","title_slug":"smallest-subtree-with-all-the-deepest-nodes","rating":1534.325005151,"_hash":3353015937,"paid_only":false},{"question_id":866,"title":"回文质数","title_slug":"prime-palindrome","rating":1938.2224916289,"_hash":3105635512,"paid_only":false},{"question_id":864,"title":"获取所有钥匙的最短路径","title_slug":"shortest-path-to-get-all-keys","rating":2258.6371797452,"_hash":3615735813,"paid_only":false}],"company":{}},{"contest":{"id":14,"title":"第 91 场周赛","title_slug":"weekly-contest-91","start_time":1530408600,"is_ee_exam_contest":null},"questions":[{"question_id":860,"title":"柠檬水找零","title_slug":"lemonade-change","rating":1285.7282180721,"_hash":487789523,"paid_only":false},{"question_id":863,"title":"二叉树中所有距离为 K 的结点","title_slug":"all-nodes-distance-k-in-binary-tree","rating":1663.1853149056,"_hash":2021376917,"paid_only":false},{"question_id":861,"title":"翻转矩阵后的得分","title_slug":"score-after-flipping-matrix","rating":1818.0024504436,"_hash":1135090504,"paid_only":false},{"question_id":862,"title":"和至少为 K 的最短子数组","title_slug":"shortest-subarray-with-sum-at-least-k","rating":2306.8472649456,"_hash":3460806368,"paid_only":false}],"company":{}},{"contest":{"id":13,"title":"第 90 场周赛","title_slug":"weekly-contest-90","start_time":1529803800,"is_ee_exam_contest":null},"questions":[{"question_id":859,"title":"亲密字符串","title_slug":"buddy-strings","rating":1341.2659819842,"_hash":2442045936,"paid_only":false},{"question_id":856,"title":"括号的分数","title_slug":"score-of-parentheses","rating":1562.7212466716,"_hash":2871847316,"paid_only":false},{"question_id":858,"title":"镜面反射","title_slug":"mirror-reflection","rating":1880.7433591583,"_hash":1432071996,"paid_only":false},{"question_id":857,"title":"雇佣 K 名工人的最低成本","title_slug":"minimum-cost-to-hire-k-workers","rating":2259.6572191969,"_hash":718375766,"paid_only":false}],"company":{}},{"contest":{"id":12,"title":"第 89 场周赛","title_slug":"weekly-contest-89","start_time":1529199000,"is_ee_exam_contest":null},"questions":[{"question_id":852,"title":"山脉数组的峰顶索引","title_slug":"peak-index-in-a-mountain-array","rating":1181.5839867359,"_hash":2285522737,"paid_only":false},{"question_id":853,"title":"车队","title_slug":"car-fleet","rating":1678.1133886034,"_hash":1478600712,"paid_only":false},{"question_id":855,"title":"考场就座","title_slug":"exam-room","rating":2067.0643721733,"_hash":362145938,"paid_only":false},{"question_id":854,"title":"相似度为 K 的字符串","title_slug":"k-similar-strings","rating":2377.3895801187,"_hash":4154336589,"paid_only":false}],"company":{}},{"contest":{"id":11,"title":"第 88 场周赛","title_slug":"weekly-contest-88","start_time":1528594200,"is_ee_exam_contest":null},"questions":[{"question_id":848,"title":"字母移位","title_slug":"shifting-letters","rating":1352.7250049956,"_hash":3410974541,"paid_only":false},{"question_id":849,"title":"到最近的人的最大距离","title_slug":"maximize-distance-to-closest-person","rating":1382.7178688716,"_hash":3370131507,"paid_only":false},{"question_id":851,"title":"喧闹和富有","title_slug":"loud-and-rich","rating":1783.2337340478,"_hash":3836236370,"paid_only":false},{"question_id":850,"title":"矩形面积 II","title_slug":"rectangle-area-ii","rating":2235.9672341699,"_hash":512758649,"paid_only":false}],"company":{}},{"contest":{"id":9,"title":"第 87 场周赛","title_slug":"weekly-contest-87","start_time":1527989400,"is_ee_exam_contest":null},"questions":[{"question_id":844,"title":"比较含退格的字符串","title_slug":"backspace-string-compare","rating":1227.7906887239,"_hash":941716720,"paid_only":false},{"question_id":845,"title":"数组中的最长山脉","title_slug":"longest-mountain-in-array","rating":1436.5343999134,"_hash":401508981,"paid_only":false},{"question_id":846,"title":"一手顺子","title_slug":"hand-of-straights","rating":1565.2483424929,"_hash":2014057820,"paid_only":false},{"question_id":847,"title":"访问所有节点的最短路径","title_slug":"shortest-path-visiting-all-nodes","rating":2200.6623666057,"_hash":3527222391,"paid_only":false}],"company":{}},{"contest":{"id":8,"title":"第 86 场周赛","title_slug":"weekly-contest-86","start_time":1527384600,"is_ee_exam_contest":null},"questions":[{"question_id":840,"title":"矩阵中的幻方","title_slug":"magic-squares-in-grid","rating":1425.9672522649,"_hash":3456273150,"paid_only":false},{"question_id":841,"title":"钥匙和房间","title_slug":"keys-and-rooms","rating":1412.2790156634,"_hash":1361459100,"paid_only":false},{"question_id":842,"title":"将数组拆分成斐波那契序列","title_slug":"split-array-into-fibonacci-sequence","rating":1779.9495819318,"_hash":466340061,"paid_only":false},{"question_id":843,"title":"猜猜这个单词","title_slug":"guess-the-word","rating":2077.5054883516,"_hash":2857979415,"paid_only":false}],"company":{}},{"contest":{"id":7,"title":"第 85 场周赛","title_slug":"weekly-contest-85","start_time":1526779800,"is_ee_exam_contest":null},"questions":[{"question_id":836,"title":"矩形重叠","title_slug":"rectangle-overlap","rating":1442.9468304752,"_hash":4086617748,"paid_only":false},{"question_id":838,"title":"推多米诺","title_slug":"push-dominoes","rating":1638.1281256708,"_hash":942356384,"paid_only":false},{"question_id":837,"title":"新 21 点","title_slug":"new-21-game","rating":2350.0380300939,"_hash":3259259158,"paid_only":false},{"question_id":839,"title":"相似字符串组","title_slug":"similar-string-groups","rating":2053.7468090497,"_hash":2704310299,"paid_only":false}],"company":{}},{"contest":{"id":6,"title":"第 84 场周赛","title_slug":"weekly-contest-84","start_time":1526175000,"is_ee_exam_contest":null},"questions":[{"question_id":832,"title":"翻转图像","title_slug":"flipping-an-image","rating":1243.1009943284,"_hash":715235362,"paid_only":false},{"question_id":833,"title":"字符串中的查找与替换","title_slug":"find-and-replace-in-string","rating":1460.9610936441,"_hash":286069565,"paid_only":false},{"question_id":835,"title":"图像重叠","title_slug":"image-overlap","rating":1969.9845549158,"_hash":2595882232,"paid_only":false},{"question_id":834,"title":"树中距离之和","title_slug":"sum-of-distances-in-tree","rating":2197.0951445919,"_hash":3424505272,"paid_only":false}],"company":{}},{"contest":{"id":5,"title":"第 83 场周赛","title_slug":"weekly-contest-83","start_time":1525570200,"is_ee_exam_contest":null},"questions":[{"question_id":830,"title":"较大分组的位置","title_slug":"positions-of-large-groups","rating":1251.822378691,"_hash":836765096,"paid_only":false},{"question_id":831,"title":"隐藏个人信息","title_slug":"masking-personal-information","rating":1450.5787293419,"_hash":3572615577,"paid_only":false},{"question_id":829,"title":"连续整数求和","title_slug":"consecutive-numbers-sum","rating":1694.433951503,"_hash":2377767456,"paid_only":false},{"question_id":828,"title":"统计子串中的唯一字符","title_slug":"count-unique-characters-of-all-substrings-of-a-given-string","rating":2034.4067304341,"_hash":747763790,"paid_only":false}],"company":{}}] diff --git a/public/qtags.json b/public/qtags.json index 3741c8b..b7e39c5 100644 --- a/public/qtags.json +++ b/public/qtags.json @@ -1 +1 @@ -{"1001722740":[["Array","Math"],["数组","数学"]],"1002673857":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"100346498":[["Array","Hash Table","Two Pointers","Binary Search","Sorting"],["数组","哈希表","双指针","二分查找","排序"]],"1005570900":[["Math","Dynamic Programming","Probability and Statistics"],["数学","动态规划","概率与统计"]],"1007682110":[["Depth-First Search","Breadth-First Search","Graph","Hash Table"],["深度优先搜索","广度优先搜索","图","哈希表"]],"1009688921":[["Graph","Topological Sort"],["图","拓扑排序"]],"1009976390":[["Array","Simulation"],["数组","模拟"]],"1010937559":[["Array","Sorting"],["数组","排序"]],"1013970586":[["Bit Manipulation","Hash Table","String","Hash Function","Rolling Hash"],["位运算","哈希表","字符串","哈希函数","滚动哈希"]],"1014740120":[["Graph","Array","Shortest Path","Heap (Priority Queue)"],["图","数组","最短路","堆（优先队列）"]],"1016789276":[["Array","Hash Table"],["数组","哈希表"]],"1017096056":[["Math"],["数学"]],"1017177635":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"1018399535":[["Array","Hash Table"],["数组","哈希表"]],"101859828":[["Two Pointers","String"],["双指针","字符串"]],"1019076732":[["Database"],["数据库"]],"1019777981":[["Bit Manipulation","Array","Hash Table"],["位运算","数组","哈希表"]],"10205408":[["Union Find","Graph"],["并查集","图"]],"1021006246":[["Union Find","Array"],["并查集","数组"]],"102220660":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"102293615":[["Shell"],[""]],"1023487571":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"1023816398":[["Array","Dynamic Programming"],["数组","动态规划"]],"1024461884":[["Depth-First Search","Graph"],["深度优先搜索","图"]],"1024556652":[["String","Backtracking"],["字符串","回溯"]],"102575803":[["Greedy","Array","Hash Table","Binary Search"],["贪心","数组","哈希表","二分查找"]],"1026373985":[["Array","Math","Heap (Priority Queue)"],["数组","数学","堆（优先队列）"]],"1028149095":[["Array","Simulation"],["数组","模拟"]],"1029578709":[["Array","Simulation","Heap (Priority Queue)"],["数组","模拟","堆（优先队列）"]],"1029802455":[["Database"],["数据库"]],"1032257843":[["Array","Dynamic Programming"],["数组","动态规划"]],"1033176958":[["Array","Binary Search","Prefix Sum"],["数组","二分查找","前缀和"]],"1033555490":[["String"],["字符串"]],"103725426":[["Array","String"],["数组","字符串"]],"1037331293":[["Array","Matrix","Sorting","Simulation","Heap (Priority Queue)"],["数组","矩阵","排序","模拟","堆（优先队列）"]],"103770723":[["Database"],["数据库"]],"1038100878":[["Bit Manipulation","Math"],["位运算","数学"]],"1038307939":[["Stack","String"],["栈","字符串"]],"103871786":[["Array","Hash Table","Sorting","Simulation"],["数组","哈希表","排序","模拟"]],"1041979787":[["Math","String"],["数学","字符串"]],"1043390792":[["Stack","Tree","Depth-First Search","Binary Search Tree","Two Pointers","Binary Search","Binary Tree"],["栈","树","深度优先搜索","二叉搜索树","双指针","二分查找","二叉树"]],"1044473054":[["String","Dynamic Programming"],["字符串","动态规划"]],"1046441649":[["Array","Binary Search","Sorting"],["数组","二分查找","排序"]],"1047256075":[["Bit Manipulation","Array","Hash Table"],["位运算","数组","哈希表"]],"1049390106":[["Brainteaser","Math"],["脑筋急转弯","数学"]],"1049961856":[["Array","Binary Search","Sorting"],["数组","二分查找","排序"]],"1053077839":[["Array","Binary Search"],["数组","二分查找"]],"1053626998":[["Two Pointers","String"],["双指针","字符串"]],"1057920854":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"1058710996":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"1058758368":[["Database"],["数据库"]],"1058966145":[["Tree","Depth-First Search","Graph","Array","Dynamic Programming"],["树","深度优先搜索","图","数组","动态规划"]],"1059279895":[["Array","Binary Search","Prefix Sum","Sorting","Sliding Window"],["数组","二分查找","前缀和","排序","滑动窗口"]],"1060291152":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1060952697":[["Array","Math"],["数组","数学"]],"1062314990":[["Array","Binary Search","Matrix"],["数组","二分查找","矩阵"]],"1062871842":[["Array","Prefix Sum"],["数组","前缀和"]],"1063164797":[["Geometry","Array","Math","Matrix"],["几何","数组","数学","矩阵"]],"1063658457":[["Greedy","Two Pointers","String"],["贪心","双指针","字符串"]],"1066025257":[["Array","Binary Search","Sorting"],["数组","二分查找","排序"]],"1067366399":[["Math","Dynamic Programming","Backtracking"],["数学","动态规划","回溯"]],"1067400091":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"1068663704":[["Linked List","Two Pointers"],["链表","双指针"]],"1069078430":[["Array"],["数组"]],"1069219826":[["String","Dynamic Programming"],["字符串","动态规划"]],"1069956724":[["String","Dynamic Programming"],["字符串","动态规划"]],"1069999133":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"1074334353":[["Array","Two Pointers","Binary Search","Prefix Sum"],["数组","双指针","二分查找","前缀和"]],"1074391241":[["Tree","Binary Search Tree","Binary Tree","Ordered Set"],["树","二叉搜索树","二叉树","有序集合"]],"1075188600":[["Array","Hash Table"],["数组","哈希表"]],"1075377947":[["Database"],["数据库"]],"107547857":[["Array","Sliding Window"],["数组","滑动窗口"]],"1075948935":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"1075971933":[["Binary Indexed Tree","Array","Binary Search","Sorting"],["树状数组","数组","二分查找","排序"]],"1078280786":[["Graph","Hash Table"],["图","哈希表"]],"1078494316":[["Array"],["数组"]],"1079710023":[["Stack","Tree","Depth-First Search","Design","Queue","Iterator"],["栈","树","深度优先搜索","设计","队列","迭代器"]],"1080305958":[["Array","Dynamic Programming"],["数组","动态规划"]],"1081472803":[["String"],["字符串"]],"1083394541":[["Array","Dynamic Programming","Sorting"],["数组","动态规划","排序"]],"1084901915":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"1085741995":[["Stack","Design"],["栈","设计"]],"108728140":[["Math","Dynamic Programming"],["数学","动态规划"]],"1088208610":[["Array","Binary Search"],["数组","二分查找"]],"1089101531":[["Greedy","Hash Table","String","Counting","Sorting"],["贪心","哈希表","字符串","计数","排序"]],"1092713458":[["Array","Enumeration"],["数组","枚举"]],"1093275153":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"1094471227":[["Math"],["数学"]],"1095929141":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort"],["深度优先搜索","广度优先搜索","图","拓扑排序"]],"109606469":[["Greedy","Array"],["贪心","数组"]],"1096438122":[["Database"],["数据库"]],"1097720535":[["Breadth-First Search","Graph","Prefix Sum"],["广度优先搜索","图","前缀和"]],"1098465458":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1101243430":[["Bit Manipulation","Array","Hash Table","Sorting"],["位运算","数组","哈希表","排序"]],"110135796":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1102712818":[["Database"],["数据库"]],"1102749976":[["Greedy","Array","String"],["贪心","数组","字符串"]],"1103286328":[["Linked List"],["链表"]],"1104764996":[null,null],"1108078634":[["Array","Hash Table"],["数组","哈希表"]],"111167904":[["Brainteaser","Math","Two Pointers"],["脑筋急转弯","数学","双指针"]],"111192011":[["Graph","Topological Sort","Array"],["图","拓扑排序","数组"]],"111233848":[["Database"],["数据库"]],"111314097":[["Breadth-First Search","Array","Matrix","Heap (Priority Queue)"],["广度优先搜索","数组","矩阵","堆（优先队列）"]],"1113985320":[["Bit Manipulation","Array","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","动态规划","回溯","状态压缩"]],"1114191328":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"1114300382":[["Array","Binary Search"],["数组","二分查找"]],"111572636":[["Tree","Depth-First Search","Dynamic Programming","Binary Tree"],["树","深度优先搜索","动态规划","二叉树"]],"1118571941":[["Bit Manipulation","Breadth-First Search","Array","Hash Table","Matrix"],["位运算","广度优先搜索","数组","哈希表","矩阵"]],"1119710280":[["Stack","Greedy","Array","Binary Search","Sorting"],["栈","贪心","数组","二分查找","排序"]],"1122946813":[["Array","Math","Simulation"],["数组","数学","模拟"]],"1123666202":[["Bit Manipulation","Array"],["位运算","数组"]],"1129799033":[["Array","Prefix Sum"],["数组","前缀和"]],"1130768852":[["Database"],["数据库"]],"1131587707":[["Tree","Depth-First Search"],["树","深度优先搜索"]],"1132748762":[["Bit Manipulation","Array","Two Pointers","Binary Search"],["位运算","数组","双指针","二分查找"]],"1132876897":[["Bit Manipulation","Array","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","动态规划","回溯","状态压缩"]],"1134359923":[["Bit Manipulation","Array","Backtracking","Matrix"],["位运算","数组","回溯","矩阵"]],"1135090504":[["Greedy","Bit Manipulation","Array","Matrix"],["贪心","位运算","数组","矩阵"]],"1135153485":[["Two Pointers","String"],["双指针","字符串"]],"1137656154":[["Stack","Array","Simulation"],["栈","数组","模拟"]],"1137942707":[["Bit Manipulation","Array","Math"],["位运算","数组","数学"]],"113811987":[["Design","Segment Tree","Ordered Set"],["设计","线段树","有序集合"]],"1139062797":[["String","Sorting"],["字符串","排序"]],"1140950686":[["Queue","Array","Dynamic Programming","Monotonic Queue","Heap (Priority Queue)"],["队列","数组","动态规划","单调队列","堆（优先队列）"]],"1144525439":[["Depth-First Search","Design","Trie","Hash Table","String"],["深度优先搜索","设计","字典树","哈希表","字符串"]],"1146950656":[["Bit Manipulation","Array","Backtracking"],["位运算","数组","回溯"]],"1147860078":[["Design","Hash Table","Data Stream","Ordered Set","Heap (Priority Queue)"],["设计","哈希表","数据流","有序集合","堆（优先队列）"]],"1149087220":[["Array"],["数组"]],"1150623470":[["Array","Math","Sorting"],["数组","数学","排序"]],"1151236787":[["Database"],["数据库"]],"115382073":[["Design","Linked List"],["设计","链表"]],"1156930664":[["Depth-First Search","Breadth-First Search","String","Dynamic Programming"],["深度优先搜索","广度优先搜索","字符串","动态规划"]],"1160726234":[["Database"],["数据库"]],"1164168277":[["Binary Indexed Tree","Segment Tree","Array","Binary Search","Divide and Conquer","Ordered Set","Merge Sort"],["树状数组","线段树","数组","二分查找","分治","有序集合","归并排序"]],"1164523872":[["String","Counting","Prefix Sum"],["字符串","计数","前缀和"]],"1164835766":[["Math","String","Simulation"],["数学","字符串","模拟"]],"1165166058":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"1165928557":[["Stack","Greedy","String","Monotonic Stack"],["栈","贪心","字符串","单调栈"]],"1167299665":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"1167766424":[["Array","Hash Table","Binary Search","Counting"],["数组","哈希表","二分查找","计数"]],"1168254316":[["Array","Hash Table","Two Pointers"],["数组","哈希表","双指针"]],"1168505902":[["Array","Math","Dynamic Programming","Game Theory"],["数组","数学","动态规划","博弈"]],"1168558024":[["Stack","Linked List","Math"],["栈","链表","数学"]],"1170959519":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"1171095":[["Database"],["数据库"]],"117165936":[["String"],["字符串"]],"1172679970":[["Database"],["数据库"]],"1173419903":[["Greedy","Math"],["贪心","数学"]],"1174559962":[["String","Sorting"],["字符串","排序"]],"1176671732":[["Array","Hash Table","String","Counting"],["数组","哈希表","字符串","计数"]],"1177110212":[["Binary Indexed Tree","Segment Tree","Array","Divide and Conquer","Ordered Set","Line Sweep","Heap (Priority Queue)"],["树状数组","线段树","数组","分治","有序集合","扫描线","堆（优先队列）"]],"1178924986":[["String","Dynamic Programming","Suffix Array"],["字符串","动态规划","后缀数组"]],"1179475752":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"1180161064":[["Math","String","Dynamic Programming","Combinatorics"],["数学","字符串","动态规划","组合数学"]],"1180349312":[["Math"],["数学"]],"1180837306":[["Greedy","String"],["贪心","字符串"]],"1181589124":[["Array","Binary Search","Sorting"],["数组","二分查找","排序"]],"1182547848":[["Array","Math","Number Theory"],["数组","数学","数论"]],"1184414922":[["Greedy","Two Pointers","String","Dynamic Programming","Hash Function","Rolling Hash"],["贪心","双指针","字符串","动态规划","哈希函数","滚动哈希"]],"1185092838":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"1186138716":[["String","Dynamic Programming"],["字符串","动态规划"]],"1186731908":[["Greedy","String","Dynamic Programming"],["贪心","字符串","动态规划"]],"1187211206":[["Array","Prefix Sum","Sorting","Simulation","Heap (Priority Queue)"],["数组","前缀和","排序","模拟","堆（优先队列）"]],"1187527339":[["Design","Array","String"],["设计","数组","字符串"]],"1187943151":[["Database"],["数据库"]],"1188543288":[["Tree","Breadth-First Search","Binary Tree"],["树","广度优先搜索","二叉树"]],"1189152973":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"1191385639":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"1191936218":[["Array","Binary Search","Sliding Window"],["数组","二分查找","滑动窗口"]],"1192302071":[["Geometry","Math"],["几何","数学"]],"1192605817":[["Recursion","Math"],["递归","数学"]],"119361315":[["Bit Manipulation","Brainteaser","Array"],["位运算","脑筋急转弯","数组"]],"1194042995":[["Greedy","Queue","Array","Binary Search","Sorting","Monotonic Queue"],["贪心","队列","数组","二分查找","排序","单调队列"]],"119654105":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"1197839305":[["Array","Hash Table","Math","Sliding Window"],["数组","哈希表","数学","滑动窗口"]],"1197966112":[["Array","Binary Search"],["数组","二分查找"]],"1199006360":[["Stack","Array","Dynamic Programming","Matrix","Monotonic Stack"],["栈","数组","动态规划","矩阵","单调栈"]],"1199383198":[["Array","String","Binary Search","Prefix Sum"],["数组","字符串","二分查找","前缀和"]],"119954396":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"1200771569":[["Array","String"],["数组","字符串"]],"1200779115":[["Database"],["数据库"]],"1204439806":[["Greedy","Bit Manipulation","Array"],["贪心","位运算","数组"]],"1204660336":[["Math","Backtracking","Enumeration"],["数学","回溯","枚举"]],"1206307881":[["Bit Manipulation","Math"],["位运算","数学"]],"120648461":[["Hash Table","String"],["哈希表","字符串"]],"1210001971":[["Bit Manipulation","Math","Backtracking"],["位运算","数学","回溯"]],"1210196211":[["Tree","Depth-First Search","String","Binary Tree"],["树","深度优先搜索","字符串","二叉树"]],"1210455736":[["Array","Dynamic Programming","Sorting"],["数组","动态规划","排序"]],"1210688937":[["Greedy","Array","Sorting","Heap (Priority Queue)"],["贪心","数组","排序","堆（优先队列）"]],"1210757712":[["Two Pointers","String"],["双指针","字符串"]],"121112730":[["Bit Manipulation","Math"],["位运算","数学"]],"1212080245":[["Database"],["数据库"]],"1212266970":[["Stack","Tree","String","Binary Tree"],["栈","树","字符串","二叉树"]],"1218347826":[["Greedy","Binary Indexed Tree","Segment Tree","String"],["贪心","树状数组","线段树","字符串"]],"1218479039":[["Greedy","Math"],["贪心","数学"]],"122030614":[["Array","Hash Table"],["数组","哈希表"]],"122134919":[["Array","Binary Search","Sorting"],["数组","二分查找","排序"]],"1225270682":[["Array","Math"],["数组","数学"]],"1226888142":[["Bit Manipulation","String","Dynamic Programming"],["位运算","字符串","动态规划"]],"1229621552":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"123050212":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"1231586287":[["String","Dynamic Programming"],["字符串","动态规划"]],"1231673390":[["Depth-First Search","Breadth-First Search"],["深度优先搜索","广度优先搜索"]],"1231737979":[["Enumeration"],["枚举"]],"1232284801":[["Array","Hash Table","Binary Search","Sorting"],["数组","哈希表","二分查找","排序"]],"1232868918":[["Memoization","String","Dynamic Programming"],["记忆化搜索","字符串","动态规划"]],"123288766":[["Design","Segment Tree","Binary Search","Ordered Set"],["设计","线段树","二分查找","有序集合"]],"1233403465":[["Recursion","String","Simulation"],["递归","字符串","模拟"]],"1234370312":[["Array","Matrix"],["数组","矩阵"]],"1234415652":[null,null],"1235853332":[["Array","Hash Table","Dynamic Programming"],["数组","哈希表","动态规划"]],"1236291717":[["Bit Manipulation"],["位运算"]],"1236982780":[["Hash Table","String","Backtracking"],["哈希表","字符串","回溯"]],"1238400837":[["Binary Indexed Tree","Array","Simulation"],["树状数组","数组","模拟"]],"1238608911":[["Array","Backtracking"],["数组","回溯"]],"124089953":[["Tree","Breadth-First Search","Linked List","Binary Tree"],["树","广度优先搜索","链表","二叉树"]],"1241705093":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"124247488":[null,null],"124339070":[["Tree","Depth-First Search","Breadth-First Search","Union Find","Graph","Binary Tree"],["树","深度优先搜索","广度优先搜索","并查集","图","二叉树"]],"1243440018":[["Graph","Array","Shortest Path","Heap (Priority Queue)"],["图","数组","最短路","堆（优先队列）"]],"1245231548":[["Array"],["数组"]],"1245371369":[null,null],"1246328892":[["Math"],["数学"]],"1246713190":[["Array","Math","Matrix"],["数组","数学","矩阵"]],"1247027569":[["Greedy","Array","Two Pointers","Sorting"],["贪心","数组","双指针","排序"]],"1247428479":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"1249919767":[["Greedy","Array"],["贪心","数组"]],"1250723795":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1252533772":[["Design","Array","Prefix Sum"],["设计","数组","前缀和"]],"1252651878":[["Array","Math","Dynamic Programming","Number Theory"],["数组","数学","动态规划","数论"]],"1253336265":[["Recursion","Math"],["递归","数学"]],"125432943":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"1255527945":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"1257680587":[["String","String Matching"],["字符串","字符串匹配"]],"1257762070":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1258148931":[["Trie","Array","Hash Table","String","Sorting"],["字典树","数组","哈希表","字符串","排序"]],"1260215787":[["Array","Hash Table","Math","Two Pointers"],["数组","哈希表","数学","双指针"]],"1262858438":[["Greedy","Array"],["贪心","数组"]],"1263665709":[["Tree","Depth-First Search","Breadth-First Search","Design","Binary Tree"],["树","深度优先搜索","广度优先搜索","设计","二叉树"]],"1265881179":[["Depth-First Search","Design","Trie","Hash Table","String"],["深度优先搜索","设计","字典树","哈希表","字符串"]],"126670103":[["Array","Dynamic Programming"],["数组","动态规划"]],"1268853066":[["Array","Binary Search"],["数组","二分查找"]],"1269261016":[["Math","Binary Search"],["数学","二分查找"]],"1272023779":[["Design","Array","Hash Table","Ordered Set","Heap (Priority Queue)"],["设计","数组","哈希表","有序集合","堆（优先队列）"]],"1275579259":[["Greedy","Graph","Array","Sorting","Heap (Priority Queue)"],["贪心","图","数组","排序","堆（优先队列）"]],"1276354362":[["Stack","Tree","Depth-First Search","Binary Search Tree","Linked List","Binary Tree","Doubly-Linked List"],["栈","树","深度优先搜索","二叉搜索树","链表","二叉树","双向链表"]],"1278269400":[["String"],["字符串"]],"1278665216":[["Array","Enumeration"],["数组","枚举"]],"1280364978":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort"],["深度优先搜索","广度优先搜索","图","拓扑排序"]],"1282549856":[["Design","Two Pointers","Data Stream","Sorting","Heap (Priority Queue)"],["设计","双指针","数据流","排序","堆（优先队列）"]],"1287143513":[["Database"],["数据库"]],"1290173910":[["Array","Math","String","Matrix"],["数组","数学","字符串","矩阵"]],"1294188975":[["Math"],["数学"]],"1294989119":[null,null],"1295785983":[["Array","Hash Table","String","Sorting","Heap (Priority Queue)"],["数组","哈希表","字符串","排序","堆（优先队列）"]],"1299365979":[["String","Enumeration","Prefix Sum"],["字符串","枚举","前缀和"]],"1299928804":[["Array","Hash Table","Math","Counting"],["数组","哈希表","数学","计数"]],"1300584624":[["Trie","Array","Hash Table","String"],["字典树","数组","哈希表","字符串"]],"1300693519":[["Greedy","Math"],["贪心","数学"]],"1301810943":[["Array","Math"],["数组","数学"]],"1303368655":[["Array","Hash Table","String","Counting"],["数组","哈希表","字符串","计数"]],"1303459038":[["String"],["字符串"]],"1304520805":[["Array","Dynamic Programming"],["数组","动态规划"]],"1304985926":[["Greedy","Array","Hash Table","Two Pointers","Binary Search","Counting"],["贪心","数组","哈希表","双指针","二分查找","计数"]],"1305713613":[null,null],"1308115412":[["Recursion","Math","Dynamic Programming"],["递归","数学","动态规划"]],"1308745360":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"1310138170":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"1311511120":[["Stack","Recursion","Math","String"],["栈","递归","数学","字符串"]],"1311726140":[["Greedy","String","Heap (Priority Queue)"],["贪心","字符串","堆（优先队列）"]],"1312484096":[["Breadth-First Search","Hash Table","String"],["广度优先搜索","哈希表","字符串"]],"1312828534":[["Recursion","String","Dynamic Programming"],["递归","字符串","动态规划"]],"1316461889":[["Design","Queue","Array","Linked List","Data Stream"],["设计","队列","数组","链表","数据流"]],"1319672571":[["Queue","Array","Sorting","Simulation"],["队列","数组","排序","模拟"]],"1320293684":[["Bit Manipulation","Array"],["位运算","数组"]],"1321549485":[["Linked List"],["链表"]],"1322023785":[["Array","Hash Table","String","Counting"],["数组","哈希表","字符串","计数"]],"132290954":[["Database"],["数据库"]],"1323143155":[["Greedy","Array","Math","Binary Search","Number Theory"],["贪心","数组","数学","二分查找","数论"]],"1325042165":[["Hash Table","Linked List","Two Pointers"],["哈希表","链表","双指针"]],"132598439":[["Array","Dynamic Programming"],["数组","动态规划"]],"132633492":[["Hash Table","String","Counting","Sorting"],["哈希表","字符串","计数","排序"]],"1327909725":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"1329204486":[["Hash Table","Linked List"],["哈希表","链表"]],"1331006046":[["Stack","Design"],["栈","设计"]],"1331559454":[["String","String Matching"],["字符串","字符串匹配"]],"1331620430":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"133627469":[["Trie","Array","String","Binary Search","Sorting","Heap (Priority Queue)"],["字典树","数组","字符串","二分查找","排序","堆（优先队列）"]],"1337689329":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"1341926866":[["Tree","Depth-First Search","Dynamic Programming","Binary Tree"],["树","深度优先搜索","动态规划","二叉树"]],"1347652080":[["Math","Dynamic Programming"],["数学","动态规划"]],"1350925428":[["Array","Two Pointers"],["数组","双指针"]],"1351132676":[["Array","Math","Number Theory"],["数组","数学","数论"]],"1351904344":[["Database"],["数据库"]],"13544352":[["Depth-First Search","Breadth-First Search","Union Find","Array","Hash Table","String","Sorting"],["深度优先搜索","广度优先搜索","并查集","数组","哈希表","字符串","排序"]],"1356097871":[null,null],"1361459100":[["Depth-First Search","Breadth-First Search","Graph"],["深度优先搜索","广度优先搜索","图"]],"136239889":[["Array"],["数组"]],"1363331011":[["Bit Manipulation","Array","Hash Table","String","Sorting"],["位运算","数组","哈希表","字符串","排序"]],"1363446915":[["Bit Manipulation","Brainteaser","Array"],["位运算","脑筋急转弯","数组"]],"1364645526":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"1364762739":[["Tree","Depth-First Search","Breadth-First Search","Graph"],["树","深度优先搜索","广度优先搜索","图"]],"1365148367":[["Brainteaser","Array","Simulation"],["脑筋急转弯","数组","模拟"]],"1368317464":[["String"],["字符串"]],"1368794049":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"1370751449":[["Bit Manipulation","Array","Math","Matrix"],["位运算","数组","数学","矩阵"]],"1370775302":[["Queue","Dynamic Programming","Simulation"],["队列","动态规划","模拟"]],"137081663":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"1375391804":[["Array","String","Dynamic Programming"],["数组","字符串","动态规划"]],"1376431756":[["Array","Sliding Window"],["数组","滑动窗口"]],"1376748919":[["Stack","Recursion","Linked List","Two Pointers"],["栈","递归","链表","双指针"]],"1377831845":[["Array"],["数组"]],"1377883269":[["Greedy","Hash Table","String","Counting","Sorting","Heap (Priority Queue)"],["贪心","哈希表","字符串","计数","排序","堆（优先队列）"]],"1378497107":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"1381448562":[["Database"],["数据库"]],"1381994519":[["Bit Manipulation","Tree","Depth-First Search","Array","Dynamic Programming"],["位运算","树","深度优先搜索","数组","动态规划"]],"1385231803":[["Array","Math"],["数组","数学"]],"138718433":[["Dynamic Programming","Backtracking"],["动态规划","回溯"]],"1387834419":[["Memoization","Array","Dynamic Programming"],["记忆化搜索","数组","动态规划"]],"1392708979":[["Tree","Union Find","Binary Search Tree","Memoization","Array","Math","Divide and Conquer","Dynamic Programming","Binary Tree","Combinatorics"],["树","并查集","二叉搜索树","记忆化搜索","数组","数学","分治","动态规划","二叉树","组合数学"]],"1393055239":[["Array","Hash Table"],["数组","哈希表"]],"1395079998":[["Array","Math","Dynamic Programming"],["数组","数学","动态规划"]],"1395581223":[["Greedy","Array","Hash Table","Sorting"],["贪心","数组","哈希表","排序"]],"1399568330":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1401306104":[["Array","Backtracking"],["数组","回溯"]],"1402633459":[["Greedy","String"],["贪心","字符串"]],"1402867741":[["Array","Hash Table","String","Sorting"],["数组","哈希表","字符串","排序"]],"1403314808":[["Two Pointers","String","String Matching"],["双指针","字符串","字符串匹配"]],"1403965423":[["Array","Binary Search"],["数组","二分查找"]],"1405611181":[["Array","Hash Table","Math","Number Theory"],["数组","哈希表","数学","数论"]],"1405789151":[["Array","String"],["数组","字符串"]],"1405988519":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"1406878447":[["Database"],["数据库"]],"1409344146":[["Array","Hash Table"],["数组","哈希表"]],"1411796478":[["String"],["字符串"]],"1412203164":[["Tree","Binary Search Tree","Binary Tree"],["树","二叉搜索树","二叉树"]],"1414741845":[["Array","Dynamic Programming"],["数组","动态规划"]],"1417435719":[["Hash Table","Math"],["哈希表","数学"]],"1418471367":[["String"],["字符串"]],"1419735568":[["Database"],["数据库"]],"1420036364":[["Array","Heap (Priority Queue)"],["数组","堆（优先队列）"]],"1420249701":[["Array","Dynamic Programming"],["数组","动态规划"]],"1420390570":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"1421409652":[["Database"],["数据库"]],"1422717967":[["Bit Manipulation","Tree","Binary Search","Binary Tree"],["位运算","树","二分查找","二叉树"]],"1423912379":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"1426150563":[["Bit Manipulation","Recursion","Math"],["位运算","递归","数学"]],"1428000744":[["Array","Dynamic Programming"],["数组","动态规划"]],"1428852700":[["Array","Binary Search","Sorting","Heap (Priority Queue)"],["数组","二分查找","排序","堆（优先队列）"]],"143031678":[["String"],["字符串"]],"1430651253":[["Queue","Array","Simulation"],["队列","数组","模拟"]],"1432071996":[["Geometry","Math","Number Theory"],["几何","数学","数论"]],"1434911335":[["String","Hash Function","Rolling Hash"],["字符串","哈希函数","滚动哈希"]],"1435717617":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"1438711104":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"1438800814":[["Bit Manipulation","String"],["位运算","字符串"]],"144023621":[["Array","Binary Search","Dynamic Programming","Sliding Window","Hash Function","Rolling Hash"],["数组","二分查找","动态规划","滑动窗口","哈希函数","滚动哈希"]],"1441425352":[["Array","Binary Search"],["数组","二分查找"]],"1442274557":[["Geometry","Array","Math"],["几何","数组","数学"]],"1442563829":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"1442835646":[["Array","Dynamic Programming"],["数组","动态规划"]],"1449021558":[["Array","Sorting"],["数组","排序"]],"1449182323":[["Database"],["数据库"]],"1449546891":[["Two Pointers","String"],["双指针","字符串"]],"1450266090":[["Greedy","Array","Binary Search","Prefix Sum","Sorting"],["贪心","数组","二分查找","前缀和","排序"]],"145069778":[["Bit Manipulation","Array","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","动态规划","回溯","状态压缩"]],"1451306214":[["Array","Math","Dynamic Programming"],["数组","数学","动态规划"]],"1452093256":[["Hash Table","String"],["哈希表","字符串"]],"1454677217":[["Segment Tree","Array","Ordered Set"],["线段树","数组","有序集合"]],"1456955548":[["Array"],["数组"]],"1457368038":[["Depth-First Search","Breadth-First Search","Union Find","Graph","Hash Table"],["深度优先搜索","广度优先搜索","并查集","图","哈希表"]],"1459395051":[["Array","Math","Number Theory"],["数组","数学","数论"]],"1460194927":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"1460547008":[["Array","Math"],["数组","数学"]],"1461103201":[["Breadth-First Search","Array","Hash Table","String"],["广度优先搜索","数组","哈希表","字符串"]],"1463291583":[["Greedy","Math"],["贪心","数学"]],"1463471392":[["Array","Binary Search","Sorting","Sliding Window"],["数组","二分查找","排序","滑动窗口"]],"1464742605":[["Array","Binary Search","Prefix Sum","Sliding Window"],["数组","二分查找","前缀和","滑动窗口"]],"1466738944":[["Greedy","Array","Math","Number Theory"],["贪心","数组","数学","数论"]],"1467367970":[["Greedy","String"],["贪心","字符串"]],"1467581792":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"1467636476":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"146862112":[["Math","Binary Search"],["数学","二分查找"]],"1471696394":[["Array","Enumeration","Sorting"],["数组","枚举","排序"]],"1472553037":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"1474617560":[["Array","Hash Table","String","Dynamic Programming"],["数组","哈希表","字符串","动态规划"]],"14750873":[["Array","Enumeration"],["数组","枚举"]],"1475483634":[["String"],["字符串"]],"1478600712":[["Stack","Array","Sorting","Monotonic Stack"],["栈","数组","排序","单调栈"]],"147891676":[["String","Dynamic Programming","Simulation"],["字符串","动态规划","模拟"]],"1478945205":[["Stack","Design","Queue"],["栈","设计","队列"]],"1479673533":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1480696010":[["Array","Hash Table","Math","Counting"],["数组","哈希表","数学","计数"]],"1480774126":[["Array","Hash Table","Binary Search","Dynamic Programming","Sliding Window"],["数组","哈希表","二分查找","动态规划","滑动窗口"]],"1481976566":[["Array","String"],["数组","字符串"]],"1482300808":[["Union Find","Array","Math","Number Theory"],["并查集","数组","数学","数论"]],"1482821287":[["Math"],["数学"]],"1485423720":[["Array","Enumeration","Matrix"],["数组","枚举","矩阵"]],"1486913577":[["Array","Binary Search","Matrix","Sorting","Heap (Priority Queue)"],["数组","二分查找","矩阵","排序","堆（优先队列）"]],"1487915794":[["Array","Matrix"],["数组","矩阵"]],"1488658299":[["Array","Sorting"],["数组","排序"]],"1490013522":[["Database"],["数据库"]],"1490454383":[["Array","Dynamic Programming"],["数组","动态规划"]],"149268417":[["Array","Binary Search","Sliding Window"],["数组","二分查找","滑动窗口"]],"1493116499":[["Array","Simulation"],["数组","模拟"]],"1493274091":[["Hash Table","Linked List"],["哈希表","链表"]],"1493978161":[["Database"],["数据库"]],"1495787026":[["Array"],["数组"]],"1496544628":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"1497402060":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"1498707721":[["Greedy","Array","Matrix"],["贪心","数组","矩阵"]],"1500411729":[null,null],"1500920738":[["Database"],["数据库"]],"1501707049":[["Bit Manipulation","Array","Math"],["位运算","数组","数学"]],"1502235269":[["Array","Hash Table"],["数组","哈希表"]],"1502620621":[["Depth-First Search","Breadth-First Search","Graph"],["深度优先搜索","广度优先搜索","图"]],"1504907424":[["Design","Trie","Array","String","Data Stream"],["设计","字典树","数组","字符串","数据流"]],"1507011086":[["Array"],["数组"]],"1507332922":[["Segment Tree","Array"],["线段树","数组"]],"1507774284":[["String"],["字符串"]],"1508563965":[["Array","Hash Table","Sliding Window","Heap (Priority Queue)"],["数组","哈希表","滑动窗口","堆（优先队列）"]],"1512857430":[["String"],["字符串"]],"1515775640":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"1518041298":[["Stack","Greedy","Two Pointers","String"],["栈","贪心","双指针","字符串"]],"1518510268":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"1519348229":[["Stack","Array","Two Pointers","Dynamic Programming","Monotonic Stack"],["栈","数组","双指针","动态规划","单调栈"]],"1519983797":[["Greedy","Math","String","Game Theory"],["贪心","数学","字符串","博弈"]],"1520385101":[["Array","Simulation","Heap (Priority Queue)"],["数组","模拟","堆（优先队列）"]],"1520513992":[["Array","Two Pointers","Matrix","Simulation"],["数组","双指针","矩阵","模拟"]],"1522184936":[["Binary Indexed Tree","Segment Tree","Array","Binary Search","Divide and Conquer","Ordered Set","Merge Sort"],["树状数组","线段树","数组","二分查找","分治","有序集合","归并排序"]],"152251963":[["Greedy","Geometry","Array","Math"],["贪心","几何","数组","数学"]],"1523330486":[["Greedy","Array"],["贪心","数组"]],"1523645158":[["Tree","Depth-First Search","Graph","Topological Sort","Array","String"],["树","深度优先搜索","图","拓扑排序","数组","字符串"]],"1525551268":[["Array","Two Pointers"],["数组","双指针"]],"1525867551":[["Database"],["数据库"]],"1526363744":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"1526496677":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"1526624858":[["Tree","Depth-First Search","Breadth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","广度优先搜索","哈希表","二叉树"]],"1526976016":[["String","Simulation"],["字符串","模拟"]],"1528579119":[["Tree","Breadth-First Search","Binary Tree"],["树","广度优先搜索","二叉树"]],"1529011687":[["Math","Number Theory"],["数学","数论"]],"152903211":[null,null],"1529937689":[["Array","Math","Two Pointers","Sorting"],["数组","数学","双指针","排序"]],"1530394259":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"1530442140":[["Array","Hash Table"],["数组","哈希表"]],"1535345394":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"1537635707":[["Bit Manipulation","String"],["位运算","字符串"]],"1538966566":[["Geometry","Array","Math","Number Theory","Sorting"],["几何","数组","数学","数论","排序"]],"1539515792":[["Stack","Queue","Array","Binary Search","Dynamic Programming","Monotonic Queue","Monotonic Stack"],["栈","队列","数组","二分查找","动态规划","单调队列","单调栈"]],"1541316145":[["Array","Math","Simulation"],["数组","数学","模拟"]],"1541437811":[["Design","Array","Hash Table","Math","Randomized"],["设计","数组","哈希表","数学","随机化"]],"1541631847":[["String","Dynamic Programming"],["字符串","动态规划"]],"1542173395":[["Greedy","Array"],["贪心","数组"]],"1543621842":[["Recursion","Memoization","Math","String","Dynamic Programming"],["递归","记忆化搜索","数学","字符串","动态规划"]],"1546633713":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"1547023723":[["Two Pointers","String","Binary Search","String Matching","Hash Function","Rolling Hash"],["双指针","字符串","二分查找","字符串匹配","哈希函数","滚动哈希"]],"1547394567":[["String"],["字符串"]],"1548254728":[["Array","Two Pointers","String","Binary Search"],["数组","双指针","字符串","二分查找"]],"1548912992":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"1558678323":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"1559181224":[["Hash Table","String","Sorting"],["哈希表","字符串","排序"]],"1559330514":[["Greedy","Hash Table","Math","String","Combinatorics"],["贪心","哈希表","数学","字符串","组合数学"]],"1559448771":[["Tree","Depth-First Search","Breadth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉搜索树","二叉树"]],"1560892380":[["Linked List","Two Pointers","Divide and Conquer","Sorting","Merge Sort"],["链表","双指针","分治","排序","归并排序"]],"1561912001":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"1563663979":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"1565214769":[["Array","Math","Binary Search","Prefix Sum","Randomized"],["数组","数学","二分查找","前缀和","随机化"]],"1565495532":[["Array","Backtracking","Matrix"],["数组","回溯","矩阵"]],"1565798166":[["String","Counting"],["字符串","计数"]],"1567110694":[["Binary Indexed Tree","Segment Tree","Queue","Array","Divide and Conquer","Dynamic Programming","Monotonic Queue"],["树状数组","线段树","队列","数组","分治","动态规划","单调队列"]],"1568537869":[["Database"],["数据库"]],"1569081897":[null,null],"1569116237":[["Stack","Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["栈","树","深度优先搜索","二叉搜索树","二叉树"]],"1571048900":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"1572535871":[["Depth-First Search","Breadth-First Search","Array","Matrix","Simulation"],["深度优先搜索","广度优先搜索","数组","矩阵","模拟"]],"1575599751":[["Array","Sorting","Heap (Priority Queue)"],["数组","排序","堆（优先队列）"]],"1576603106":[["Array","Divide and Conquer"],["数组","分治"]],"1576706031":[["Array","Binary Search"],["数组","二分查找"]],"1577580678":[null,null],"1577638784":[["Stack","String"],["栈","字符串"]],"1579629689":[["Design","Array","Hash Table","Simulation"],["设计","数组","哈希表","模拟"]],"1580991625":[["Bit Manipulation","Array","Math","Dynamic Programming","Backtracking","Bitmask","Number Theory"],["位运算","数组","数学","动态规划","回溯","状态压缩","数论"]],"1582953363":[["Stack","String","Simulation"],["栈","字符串","模拟"]],"1583176635":[["Linked List","Divide and Conquer","Heap (Priority Queue)","Merge Sort"],["链表","分治","堆（优先队列）","归并排序"]],"1583349779":[["Bit Manipulation","Array","Hash Table","String","Prefix Sum"],["位运算","数组","哈希表","字符串","前缀和"]],"158335627":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"1584359446":[["Tree","Depth-First Search"],["树","深度优先搜索"]],"1586756425":[null,null],"1589710386":[["Tree","Depth-First Search","Dynamic Programming","Binary Tree"],["树","深度优先搜索","动态规划","二叉树"]],"1590024460":[["Brainteaser","Array","Prefix Sum","Sorting"],["脑筋急转弯","数组","前缀和","排序"]],"159003173":[["Memoization","Math","Dynamic Programming"],["记忆化搜索","数学","动态规划"]],"1590273508":[["Array","Dynamic Programming"],["数组","动态规划"]],"1590551370":[["Database"],["数据库"]],"159231277":[["Math","Enumeration"],["数学","枚举"]],"1592995979":[["Array","String"],["数组","字符串"]],"1598113371":[["Array","Counting","Matrix"],["数组","计数","矩阵"]],"1598128796":[["Array","Divide and Conquer","Quickselect","Sorting"],["数组","分治","快速选择","排序"]],"1598976020":[["Database"],["数据库"]],"1599758478":[["Array","Linked List","Matrix","Simulation"],["数组","链表","矩阵","模拟"]],"1601603749":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1602330770":[["Math"],["数学"]],"1603806327":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"1603834737":[["Greedy","Array"],["贪心","数组"]],"1603972964":[["Stack","Tree","Array","Divide and Conquer","Binary Tree","Monotonic Stack"],["栈","树","数组","分治","二叉树","单调栈"]],"1604381884":[["Depth-First Search","Breadth-First Search","Graph","Geometry","Array","Math"],["深度优先搜索","广度优先搜索","图","几何","数组","数学"]],"1610031866":[["Hash Table","String","Enumeration"],["哈希表","字符串","枚举"]],"1610939039":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"16117382":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1614249365":[["Math"],["数学"]],"1615136281":[["Array","Math","Interactive"],["数组","数学","交互"]],"1615798591":[["String","Simulation"],["字符串","模拟"]],"161597751":[["Array"],["数组"]],"1616359180":[["Array","String"],["数组","字符串"]],"1618480669":[["Array","Two Pointers"],["数组","双指针"]],"1619143061":[["String"],["字符串"]],"1620091732":[["Array","Math","Number Theory","Sorting","Heap (Priority Queue)"],["数组","数学","数论","排序","堆（优先队列）"]],"1620228801":[["String","Backtracking"],["字符串","回溯"]],"1620549524":[["Greedy","Array","Hash Table"],["贪心","数组","哈希表"]],"1620554900":[["Greedy","Array","Two Pointers","Prefix Sum","Sorting","Heap (Priority Queue)"],["贪心","数组","双指针","前缀和","排序","堆（优先队列）"]],"1621119601":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"162304303":[["Array","Math","Dynamic Programming"],["数组","数学","动态规划"]],"1627181507":[["Breadth-First Search","Union Find","Graph"],["广度优先搜索","并查集","图"]],"1627389455":[["Array","Backtracking"],["数组","回溯"]],"1627868267":[["Array","Binary Search"],["数组","二分查找"]],"1628732610":[["Database"],["数据库"]],"1628732687":[["Bit Manipulation","Memoization","Array","Dynamic Programming","Backtracking","Bitmask"],["位运算","记忆化搜索","数组","动态规划","回溯","状态压缩"]],"1629080001":[["Hash Table","Math","Dynamic Programming","Heap (Priority Queue)"],["哈希表","数学","动态规划","堆（优先队列）"]],"1629689602":[["Array","Hash Table","Prefix Sum","Sliding Window"],["数组","哈希表","前缀和","滑动窗口"]],"163006863":[["Bit Manipulation","Array"],["位运算","数组"]],"1632383781":[["Greedy","String"],["贪心","字符串"]],"1632602455":[["Queue","Array","Sliding Window","Monotonic Queue","Heap (Priority Queue)"],["队列","数组","滑动窗口","单调队列","堆（优先队列）"]],"1635315111":[["Array","Hash Table","String","Matrix","Simulation"],["数组","哈希表","字符串","矩阵","模拟"]],"163704669":[["Database"],["数据库"]],"1637468390":[["Array"],["数组"]],"1640158797":[["Greedy","Two Pointers","String"],["贪心","双指针","字符串"]],"1642092986":[["Union Find","Array","Math","Number Theory","Sorting"],["并查集","数组","数学","数论","排序"]],"164313417":[["Greedy","Recursion","String","Dynamic Programming"],["贪心","递归","字符串","动态规划"]],"1643291393":[["Tree","Depth-First Search","Breadth-First Search","Design","Hash Table","Binary Tree"],["树","深度优先搜索","广度优先搜索","设计","哈希表","二叉树"]],"1644032538":[["Greedy","Bit Manipulation","Array","Hash Table"],["贪心","位运算","数组","哈希表"]],"1644520119":[["Array","Divide and Conquer","Quickselect","Sorting","Heap (Priority Queue)"],["数组","分治","快速选择","排序","堆（优先队列）"]],"1645223251":[["Hash Table","String","Binary Search","Counting","Sliding Window"],["哈希表","字符串","二分查找","计数","滑动窗口"]],"1645809775":[["Greedy","Array","Hash Table","Sorting"],["贪心","数组","哈希表","排序"]],"1646187623":[["Graph","Topological Sort","Array","Matrix"],["图","拓扑排序","数组","矩阵"]],"1648003092":[["Recursion","Linked List"],["递归","链表"]],"1649292854":[["Array","Math"],["数组","数学"]],"1650421130":[["Greedy","Array","Hash Table","Sorting","Simulation","Heap (Priority Queue)"],["贪心","数组","哈希表","排序","模拟","堆（优先队列）"]],"1651110316":[["Two Pointers","String"],["双指针","字符串"]],"165157096":[["Array"],["数组"]],"1652287983":[null,null],"1652509718":[["Depth-First Search","Breadth-First Search","Union Find","Array","Hash Table","String","Counting"],["深度优先搜索","广度优先搜索","并查集","数组","哈希表","字符串","计数"]],"1653571628":[["Binary Indexed Tree","Segment Tree","Array","Binary Search","Divide and Conquer","Ordered Set","Merge Sort"],["树状数组","线段树","数组","二分查找","分治","有序集合","归并排序"]],"1655779586":[["Array","Dynamic Programming"],["数组","动态规划"]],"1656858690":[["Array","Sorting","Heap (Priority Queue)"],["数组","排序","堆（优先队列）"]],"1658221095":[["Array","Sliding Window"],["数组","滑动窗口"]],"1658347329":[["Array"],["数组"]],"1658547847":[["Graph","Dynamic Programming"],["图","动态规划"]],"1659259166":[["Greedy","Array"],["贪心","数组"]],"1659585642":[["Array","Math"],["数组","数学"]],"1661781078":[["Greedy","Array","Prefix Sum"],["贪心","数组","前缀和"]],"1665689312":[["Greedy","Array","Math","Sorting"],["贪心","数组","数学","排序"]],"1670099365":[["Greedy","Array","Two Pointers","Sorting"],["贪心","数组","双指针","排序"]],"1671137181":[["Breadth-First Search","Segment Tree","Array","Dynamic Programming"],["广度优先搜索","线段树","数组","动态规划"]],"1672314711":[null,null],"1676080206":[["Dynamic Programming"],["动态规划"]],"1676364478":[["Array","Hash Table"],["数组","哈希表"]],"1676853681":[["Hash Table","String","Sorting"],["哈希表","字符串","排序"]],"1677121627":[["Stack","Depth-First Search","Breadth-First Search"],["栈","深度优先搜索","广度优先搜索"]],"1677761084":[["Array","Hash Table"],["数组","哈希表"]],"1678691482":[["String","Dynamic Programming"],["字符串","动态规划"]],"1680726791":[["Database"],["数据库"]],"1684031079":[["Bit Manipulation","Recursion","Brainteaser"],["位运算","递归","脑筋急转弯"]],"1684868302":[["Math","Two Pointers","String"],["数学","双指针","字符串"]],"1687003236":[["Array","Dynamic Programming"],["数组","动态规划"]],"1687104096":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1687639369":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"1688453804":[["Array","Two Pointers","String"],["数组","双指针","字符串"]],"1689171801":[["Greedy","Array","Binary Search","Prefix Sum","Sorting"],["贪心","数组","二分查找","前缀和","排序"]],"1689274423":[["Array","Dynamic Programming"],["数组","动态规划"]],"168963992":[["Array","Hash Table","String","Binary Search","Sorting"],["数组","哈希表","字符串","二分查找","排序"]],"1690861934":[["Tree","Depth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","哈希表","二叉树"]],"1691357385":[["Array","Math","Number Theory","Sorting"],["数组","数学","数论","排序"]],"1691609067":[["Queue","Array","Dynamic Programming","Sliding Window","Monotonic Queue","Heap (Priority Queue)"],["队列","数组","动态规划","滑动窗口","单调队列","堆（优先队列）"]],"1692006284":[["Union Find","String"],["并查集","字符串"]],"169260234":[["Array","Dynamic Programming","Sorting"],["数组","动态规划","排序"]],"1692861209":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"1693120207":[["Bit Manipulation","Depth-First Search","Breadth-First Search","Math"],["位运算","深度优先搜索","广度优先搜索","数学"]],"1693289551":[["Stack","String","Dynamic Programming"],["栈","字符串","动态规划"]],"1694505048":[["Math"],["数学"]],"1695696277":[["Hash Table","Two Pointers","String"],["哈希表","双指针","字符串"]],"169616499":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"1697433369":[["Bit Manipulation","Brainteaser","Array","Math","Game Theory"],["位运算","脑筋急转弯","数组","数学","博弈"]],"1697537146":[["Array","Dynamic Programming"],["数组","动态规划"]],"1698302709":[["Bit Manipulation","Array","Dynamic Programming","Bitmask","Matrix"],["位运算","数组","动态规划","状态压缩","矩阵"]],"16997305":[["Greedy","Array","Two Pointers","Binary Search","Sorting"],["贪心","数组","双指针","二分查找","排序"]],"170017720":[["Array","String","Simulation"],["数组","字符串","模拟"]],"1700620911":[["Depth-First Search","Breadth-First Search","Memoization","Array","Dynamic Programming","Matrix"],["深度优先搜索","广度优先搜索","记忆化搜索","数组","动态规划","矩阵"]],"1702334810":[["Greedy","Array","Prefix Sum","Sorting"],["贪心","数组","前缀和","排序"]],"1705265155":[["Database"],["数据库"]],"1705502932":[["Design","Array","Hash Table","Linked List","Hash Function"],["设计","数组","哈希表","链表","哈希函数"]],"1706210690":[["Stack","Tree","Depth-First Search","Binary Search Tree","Linked List","Binary Tree"],["栈","树","深度优先搜索","二叉搜索树","链表","二叉树"]],"1706598413":[["Greedy","Array","Hash Table","Sorting","Heap (Priority Queue)"],["贪心","数组","哈希表","排序","堆（优先队列）"]],"1708402068":[["Bit Manipulation","Binary Search","Dynamic Programming"],["位运算","二分查找","动态规划"]],"1709397559":[["Stack","Recursion","Linked List","Two Pointers"],["栈","递归","链表","双指针"]],"1709868853":[["Bit Manipulation","Array","Hash Table","String"],["位运算","数组","哈希表","字符串"]],"1712826586":[["Math","Binary Search","Number Theory"],["数学","二分查找","数论"]],"1713279396":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"1714015866":[["Array","Dynamic Programming"],["数组","动态规划"]],"1715714434":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"1716064379":[["String"],["字符串"]],"1716121258":[["Database"],["数据库"]],"1716454945":[["Linked List","Two Pointers"],["链表","双指针"]],"1716625654":[["Array","Hash Table","Simulation"],["数组","哈希表","模拟"]],"1716876773":[null,null],"1717721751":[["Breadth-First Search","Hash Table","String"],["广度优先搜索","哈希表","字符串"]],"1717938721":[["Design","Hash Table","Linked List","Doubly-Linked List"],["设计","哈希表","链表","双向链表"]],"1721774399":[["Linked List"],["链表"]],"1722855645":[["Dynamic Programming"],["动态规划"]],"1723985703":[["Array","Dynamic Programming"],["数组","动态规划"]],"1725183127":[["Array"],["数组"]],"1728101846":[["Math","Enumeration"],["数学","枚举"]],"1729126971":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"1729291424":[["Bit Manipulation","Array","Hash Table","Counting"],["位运算","数组","哈希表","计数"]],"1729563423":[["Stack","Tree","Depth-First Search","Binary Search Tree","Linked List","Binary Tree","Doubly-Linked List"],["栈","树","深度优先搜索","二叉搜索树","链表","二叉树","双向链表"]],"1729632427":[["Bit Manipulation","Hash Table","String"],["位运算","哈希表","字符串"]],"1730213489":[["Stack","Breadth-First Search","String","Backtracking"],["栈","广度优先搜索","字符串","回溯"]],"1730633271":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"1732202044":[["Array","Math"],["数组","数学"]],"1733046404":[["Stack","Array","Dynamic Programming","Ordered Set","Monotonic Stack"],["栈","数组","动态规划","有序集合","单调栈"]],"173367747":[["Greedy","Bit Manipulation","Math"],["贪心","位运算","数学"]],"1734419421":[["Bit Manipulation","Math","Simulation"],["位运算","数学","模拟"]],"1735669790":[["Two Pointers","String"],["双指针","字符串"]],"1737160601":[["Greedy","Array","Math","Sorting"],["贪心","数组","数学","排序"]],"1737197781":[["Array","Hash Table","Counting","Sorting","Sliding Window"],["数组","哈希表","计数","排序","滑动窗口"]],"1737726232":[["Array","Hash Table","Counting","Sorting"],["数组","哈希表","计数","排序"]],"173858556":[["Breadth-First Search","Array","Dynamic Programming","Matrix"],["广度优先搜索","数组","动态规划","矩阵"]],"1742391300":[["Design","Hash Table","Heap (Priority Queue)"],["设计","哈希表","堆（优先队列）"]],"1742923454":[["Array","Dynamic Programming"],["数组","动态规划"]],"174306863":[["Array","Hash Table","Two Pointers","Binary Search","Sorting"],["数组","哈希表","双指针","二分查找","排序"]],"1744896373":[["Memoization","Array","Dynamic Programming","Matrix"],["记忆化搜索","数组","动态规划","矩阵"]],"174800301":[["Bit Manipulation","Array","Math","Dynamic Programming","Bitmask"],["位运算","数组","数学","动态规划","状态压缩"]],"174896176":[["Array","Bucket Sort","Ordered Set","Sorting","Sliding Window"],["数组","桶排序","有序集合","排序","滑动窗口"]],"1749795074":[["Greedy","String"],["贪心","字符串"]],"1750704590":[null,null],"1751494517":[["Math"],["数学"]],"1751556023":[["Design","Array","Hash Table","Two Pointers","Data Stream"],["设计","数组","哈希表","双指针","数据流"]],"1752876661":[["Design","Segment Tree","Binary Search","Ordered Set"],["设计","线段树","二分查找","有序集合"]],"175297842":[["Hash Table","Linked List","Two Pointers"],["哈希表","链表","双指针"]],"1753460304":[["Math"],["数学"]],"1756727384":[["Array","Hash Table","String","Sorting"],["数组","哈希表","字符串","排序"]],"1757313368":[["Database"],["数据库"]],"1757955047":[["Array","Math","Dynamic Programming","Prefix Sum"],["数组","数学","动态规划","前缀和"]],"1762249323":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"1762990534":[["Bit Manipulation","Array","String","Dynamic Programming","Bitmask"],["位运算","数组","字符串","动态规划","状态压缩"]],"1763436987":[["Array","Hash Table","Two Pointers","Counting","Sorting"],["数组","哈希表","双指针","计数","排序"]],"1765623393":[["Database"],["数据库"]],"1766481102":[["Array"],["数组"]],"1767826160":[["Greedy","Binary Search"],["贪心","二分查找"]],"177009894":[["Math","Simulation"],["数学","模拟"]],"1770113758":[["Linked List","Simulation"],["链表","模拟"]],"1770146920":[["Database"],["数据库"]],"1775341601":[["Graph","Topological Sort","Memoization","Hash Table","Dynamic Programming","Counting"],["图","拓扑排序","记忆化搜索","哈希表","动态规划","计数"]],"1777414306":[["Array","String"],["数组","字符串"]],"1779691327":[["Trie","Array","Hash Table","String"],["字典树","数组","哈希表","字符串"]],"1779771436":[["Trie","Array","Hash Table","String","Dynamic Programming"],["字典树","数组","哈希表","字符串","动态规划"]],"178132881":[["Greedy","Array","Hash Table","Binary Search","Heap (Priority Queue)"],["贪心","数组","哈希表","二分查找","堆（优先队列）"]],"1782593021":[["Math"],["数学"]],"1783870964":[["Array","Math","Combinatorics","Simulation"],["数组","数学","组合数学","模拟"]],"1784467838":[["Database"],["数据库"]],"1784527717":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"1785363546":[["Binary Indexed Tree","Segment Tree","Array","Binary Search","Divide and Conquer","Ordered Set","Merge Sort"],["树状数组","线段树","数组","二分查找","分治","有序集合","归并排序"]],"1785554828":[["Bit Manipulation","Math","String"],["位运算","数学","字符串"]],"1785562293":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"1786275394":[["Tree","Depth-First Search","Breadth-First Search","Array","Hash Table"],["树","深度优先搜索","广度优先搜索","数组","哈希表"]],"1786656286":[["Array","Matrix","Sorting"],["数组","矩阵","排序"]],"178669910":[["Math"],["数学"]],"178720857":[["Greedy","String"],["贪心","字符串"]],"1787510201":[["Stack","Memoization","Array","Math","String","Dynamic Programming"],["栈","记忆化搜索","数组","数学","字符串","动态规划"]],"1787879890":[["Depth-First Search","Breadth-First Search","Array"],["深度优先搜索","广度优先搜索","数组"]],"1788564041":[["Array","Dynamic Programming"],["数组","动态规划"]],"1788773531":[["Design","Hash Table","String"],["设计","哈希表","字符串"]],"1791591007":[["Design","Array","Hash Table","Two Pointers"],["设计","数组","哈希表","双指针"]],"1795607316":[null,null],"1796150705":[["Hash Table","Math"],["哈希表","数学"]],"1796587921":[["String","Dynamic Programming"],["字符串","动态规划"]],"179744631":[["Database"],["数据库"]],"1799515663":[["Design","Two Pointers","Data Stream","Sorting","Heap (Priority Queue)"],["设计","双指针","数据流","排序","堆（优先队列）"]],"1800599582":[["Array","String","Enumeration"],["数组","字符串","枚举"]],"1801481840":[["Hash Table","String","Backtracking"],["哈希表","字符串","回溯"]],"1802692575":[["Array","Hash Table","Matrix","Prefix Sum"],["数组","哈希表","矩阵","前缀和"]],"1808561792":[["Graph"],["图"]],"1808920633":[["Database"],["数据库"]],"1809536358":[["Array","Dynamic Programming"],["数组","动态规划"]],"1810947088":[["Dynamic Programming"],["动态规划"]],"1811191434":[["Trie","Array","Hash Table","String"],["字典树","数组","哈希表","字符串"]],"1811529317":[["Graph","Topological Sort","Memoization","Math","Dynamic Programming","Game Theory"],["图","拓扑排序","记忆化搜索","数学","动态规划","博弈"]],"1814552069":[["Array","Prefix Sum"],["数组","前缀和"]],"1815012340":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"1815395495":[["Greedy","Array","Matrix","Sorting"],["贪心","数组","矩阵","排序"]],"1816159434":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"1816814719":[["Array","Two Pointers","Binary Search","Enumeration"],["数组","双指针","二分查找","枚举"]],"181840890":[["Design","Queue","Data Stream"],["设计","队列","数据流"]],"1819395589":[["Stack","Greedy","Array","Sorting","Monotonic Stack"],["栈","贪心","数组","排序","单调栈"]],"1821672989":[["Depth-First Search","Breadth-First Search","Concurrency"],["深度优先搜索","广度优先搜索","多线程"]],"1821812912":[["Trie","Array","Hash Table","String","String Matching"],["字典树","数组","哈希表","字符串","字符串匹配"]],"1823999301":[["Graph","Topological Sort","Dynamic Programming","Shortest Path","Heap (Priority Queue)"],["图","拓扑排序","动态规划","最短路","堆（优先队列）"]],"1825399219":[["Breadth-First Search","Graph"],["广度优先搜索","图"]],"1828505458":[["Array","Two Pointers","Binary Search","Sorting","Sliding Window","Heap (Priority Queue)"],["数组","双指针","二分查找","排序","滑动窗口","堆（优先队列）"]],"1829348697":[null,null],"183030256":[["Array","Hash Table","Simulation"],["数组","哈希表","模拟"]],"183184140":[["Array","Binary Search"],["数组","二分查找"]],"1833766982":[["Array","Math","Two Pointers"],["数组","数学","双指针"]],"1834196732":[["Design","Queue","Array","Hash Table","Linked List"],["设计","队列","数组","哈希表","链表"]],"1837402011":[["Tree","Binary Search Tree","Linked List","Divide and Conquer","Binary Tree"],["树","二叉搜索树","链表","分治","二叉树"]],"1837734149":[["Hash Table","Linked List","Two Pointers"],["哈希表","链表","双指针"]],"1839844018":[["Bit Manipulation","Recursion","Math"],["位运算","递归","数学"]],"1840192802":[["Tree","Depth-First Search","Binary Tree","String Matching","Hash Function"],["树","深度优先搜索","二叉树","字符串匹配","哈希函数"]],"184027593":[["Hash Table","String","Backtracking"],["哈希表","字符串","回溯"]],"1840572711":[["Greedy","Depth-First Search","Breadth-First Search","Union Find","Graph"],["贪心","深度优先搜索","广度优先搜索","并查集","图"]],"1840603422":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"1843086828":[["Greedy","Two Pointers","String"],["贪心","双指针","字符串"]],"1844354140":[["Bit Manipulation","Array","Math","Dynamic Programming","Bitmask"],["位运算","数组","数学","动态规划","状态压缩"]],"1844925263":[["Database"],["数据库"]],"1846293530":[["Array","Math","Prefix Sum"],["数组","数学","前缀和"]],"1848363653":[["Bit Manipulation"],["位运算"]],"1848372638":[["Array"],["数组"]],"1849060569":[["Array","Binary Search","Sorting"],["数组","二分查找","排序"]],"1850684924":[["Database"],["数据库"]],"1850921957":[["Greedy","Math","Sorting"],["贪心","数学","排序"]],"18516592":[["Geometry","Math","Rejection Sampling","Randomized"],["几何","数学","拒绝采样","随机化"]],"1853031865":[["Greedy","Tree","Array","Dynamic Programming","Binary Tree"],["贪心","树","数组","动态规划","二叉树"]],"1853208613":[["Math","Enumeration","Number Theory"],["数学","枚举","数论"]],"1856172895":[["Queue","Array","Binary Search","Prefix Sum","Sliding Window","Heap (Priority Queue)"],["队列","数组","二分查找","前缀和","滑动窗口","堆（优先队列）"]],"185620528":[["Greedy","Math","Heap (Priority Queue)"],["贪心","数学","堆（优先队列）"]],"1856992647":[["Array","Dynamic Programming"],["数组","动态规划"]],"1857363494":[["String","Dynamic Programming"],["字符串","动态规划"]],"1857526630":[["Array","Hash Table","Matrix"],["数组","哈希表","矩阵"]],"1858278973":[["Array","Binary Search"],["数组","二分查找"]],"1858334582":[["Design","Queue","Array","Data Stream"],["设计","队列","数组","数据流"]],"1859819274":[["Design","Array","Hash Table"],["设计","数组","哈希表"]],"1861285155":[["Dynamic Programming"],["动态规划"]],"1862854561":[["Array","Binary Search","Divide and Conquer","Matrix"],["数组","二分查找","分治","矩阵"]],"1863065807":[["Math"],["数学"]],"186354366":[["Stack","Array","Dynamic Programming","Matrix","Monotonic Stack"],["栈","数组","动态规划","矩阵","单调栈"]],"1866851323":[["Array","Prefix Sum"],["数组","前缀和"]],"1869987706":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1871665913":[["Math","String"],["数学","字符串"]],"1872112615":[["Greedy","Array","Two Pointers"],["贪心","数组","双指针"]],"1872306454":[["Stack","Design","Array"],["栈","设计","数组"]],"1872693779":[["Database"],["数据库"]],"1872980159":[["Stack","Array","Linked List","Monotonic Stack"],["栈","数组","链表","单调栈"]],"1876544260":[["Tree","Depth-First Search","Hash Table","Binary Search","Binary Tree"],["树","深度优先搜索","哈希表","二分查找","二叉树"]],"1878147567":[["Array","String Matching","Hash Function","Rolling Hash"],["数组","字符串匹配","哈希函数","滚动哈希"]],"1879020884":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"187940940":[["Depth-First Search","Breadth-First Search","Array","Matrix","Strongly Connected Component"],["深度优先搜索","广度优先搜索","数组","矩阵","强连通分量"]],"188352287":[["Stack","Array","Linked List","Monotonic Stack"],["栈","数组","链表","单调栈"]],"1888433713":[["Array","Two Pointers"],["数组","双指针"]],"1890921841":[["Bit Manipulation","Array","Sorting"],["位运算","数组","排序"]],"1894806233":[["Array","Hash Table"],["数组","哈希表"]],"1895265333":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"1896099954":[["Array","Counting Sort","Sorting"],["数组","计数排序","排序"]],"1896286191":[["Breadth-First Search","Graph","Shortest Path"],["广度优先搜索","图","最短路"]],"1900062857":[["Array","String"],["数组","字符串"]],"1901788005":[["Database"],["数据库"]],"1903617238":[["Greedy","Memoization","String","Dynamic Programming"],["贪心","记忆化搜索","字符串","动态规划"]],"1907819963":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"1908656857":[["String","Counting"],["字符串","计数"]],"191054580":[["Depth-First Search","Linked List","Doubly-Linked List"],["深度优先搜索","链表","双向链表"]],"1910869482":[["Array","Dynamic Programming","Backtracking"],["数组","动态规划","回溯"]],"1911968707":[["String"],["字符串"]],"1912276022":[["Math","String","Sorting"],["数学","字符串","排序"]],"1913049602":[["Bit Manipulation","Array","Backtracking","Enumeration","Matrix"],["位运算","数组","回溯","枚举","矩阵"]],"1913093520":[["String"],["字符串"]],"1913772288":[["Array","Dynamic Programming","Backtracking","Sorting"],["数组","动态规划","回溯","排序"]],"1915453170":[["Array","Binary Search","Sorting"],["数组","二分查找","排序"]],"1915472102":[["String","Dynamic Programming"],["字符串","动态规划"]],"1915862517":[["Bit Manipulation","Array","Dynamic Programming"],["位运算","数组","动态规划"]],"1916011706":[["Database"],["数据库"]],"191620507":[["Greedy","Array"],["贪心","数组"]],"1916400350":[["Array","Dynamic Programming"],["数组","动态规划"]],"1917964581":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1918172852":[["Array","Binary Search","Prefix Sum","Sorting"],["数组","二分查找","前缀和","排序"]],"191868779":[["Database"],["数据库"]],"1922249884":[["String"],["字符串"]],"1924690238":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"1927271954":[["Array","Hash Table","Enumeration"],["数组","哈希表","枚举"]],"1931269506":[["Array","Prefix Sum"],["数组","前缀和"]],"1933270834":[["Array","Dynamic Programming"],["数组","动态规划"]],"1934109716":[null,null],"1937730923":[["Greedy","Tree","Depth-First Search","Binary Search Tree","Divide and Conquer","Binary Tree"],["贪心","树","深度优先搜索","二叉搜索树","分治","二叉树"]],"1938120357":[["Greedy","Array","Dynamic Programming","Sorting"],["贪心","数组","动态规划","排序"]],"193891104":[["Database"],["数据库"]],"1939591666":[["Binary Search","Interactive"],["二分查找","交互"]],"1940606693":[["Concurrency"],["多线程"]],"1941288004":[["Tree","Depth-First Search","Breadth-First Search","Linked List","Binary Tree"],["树","深度优先搜索","广度优先搜索","链表","二叉树"]],"194431856":[["Trie","String"],["字典树","字符串"]],"1944526967":[["Array","Binary Search","Dynamic Programming","Sorting"],["数组","二分查找","动态规划","排序"]],"1947285534":[["Array","Two Pointers","Simulation"],["数组","双指针","模拟"]],"1947586492":[["String","Dynamic Programming"],["字符串","动态规划"]],"1948562758":[["Math","Enumeration"],["数学","枚举"]],"1950501535":[["Greedy","String","Counting","Heap (Priority Queue)"],["贪心","字符串","计数","堆（优先队列）"]],"1950962783":[["Union Find","Array","Hash Table","Math","Number Theory"],["并查集","数组","哈希表","数学","数论"]],"1951198460":[["Greedy","Two Pointers","String"],["贪心","双指针","字符串"]],"1952470548":[["Math"],["数学"]],"1953428992":[["Tree","Binary Search Tree","Dynamic Programming","Backtracking","Binary Tree"],["树","二叉搜索树","动态规划","回溯","二叉树"]],"1953613506":[["Bit Manipulation","Backtracking"],["位运算","回溯"]],"1954801587":[["Greedy","Array","Math","Game Theory","Sorting","Heap (Priority Queue)"],["贪心","数组","数学","博弈","排序","堆（优先队列）"]],"1955132435":[["Tree","Depth-First Search","Dynamic Programming","Binary Tree"],["树","深度优先搜索","动态规划","二叉树"]],"1959436312":[["Array","Math","Binary Search","Number Theory"],["数组","数学","二分查找","数论"]],"1959774558":[["Bit Manipulation","Array","Dynamic Programming"],["位运算","数组","动态规划"]],"1959869314":[["Tree","Math","Binary Tree"],["树","数学","二叉树"]],"1959906977":[["Math"],["数学"]],"1961138257":[["Stack","Array","Math","Monotonic Stack","Heap (Priority Queue)"],["栈","数组","数学","单调栈","堆（优先队列）"]],"1962061945":[["Greedy","Bit Manipulation","Array","Prefix Sum"],["贪心","位运算","数组","前缀和"]],"1962441710":[["Math","String","Enumeration"],["数学","字符串","枚举"]],"1962595835":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"1964424077":[["Database"],["数据库"]],"1965294189":[["String","Dynamic Programming"],["字符串","动态规划"]],"1965686195":[["Geometry","Array","Hash Table","Math","Sorting"],["几何","数组","哈希表","数学","排序"]],"1965849899":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"1966056783":[["Array","Binary Search"],["数组","二分查找"]],"1966082997":[["Database"],["数据库"]],"1967582342":[["Database"],["数据库"]],"1969742700":[["Array","Simulation"],["数组","模拟"]],"1970717834":[["Hash Table","String"],["哈希表","字符串"]],"1971257507":[["String","Dynamic Programming"],["字符串","动态规划"]],"1972717643":[["String"],["字符串"]],"1972718658":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"19753391":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"197546078":[["Array","Matrix"],["数组","矩阵"]],"1975607113":[["Bit Manipulation","Array","Binary Search","Sliding Window"],["位运算","数组","二分查找","滑动窗口"]],"1977084622":[["Breadth-First Search","Array","Dynamic Programming","Matrix"],["广度优先搜索","数组","动态规划","矩阵"]],"1977813892":[["Recursion","Math","String"],["递归","数学","字符串"]],"1979291413":[["Tree","Depth-First Search","Breadth-First Search","Binary Search Tree","Hash Table","Two Pointers","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉搜索树","哈希表","双指针","二叉树"]],"1980479000":[["Array","Hash Table"],["数组","哈希表"]],"1982730574":[["Array","Two Pointers"],["数组","双指针"]],"1983440257":[["Two Pointers","String"],["双指针","字符串"]],"1987916479":[["Two Pointers","String"],["双指针","字符串"]],"1988055821":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort","Memoization","Array","Dynamic Programming","Matrix"],["深度优先搜索","广度优先搜索","图","拓扑排序","记忆化搜索","数组","动态规划","矩阵"]],"1989002691":[["Stack","Tree","Depth-First Search","Linked List","Binary Tree"],["栈","树","深度优先搜索","链表","二叉树"]],"1992185659":[["Array","Binary Search"],["数组","二分查找"]],"1992807056":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"199553622":[["String","Simulation"],["字符串","模拟"]],"1995566378":[["Linked List"],["链表"]],"1997275023":[["Tree","Depth-First Search","Breadth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","广度优先搜索","哈希表","二叉树"]],"1997404036":[["String","Simulation"],["字符串","模拟"]],"1997507835":[["Database"],["数据库"]],"1997987860":[["Greedy","Array","Sorting","Heap (Priority Queue)"],["贪心","数组","排序","堆（优先队列）"]],"2000679742":[["Tree","Depth-First Search","Breadth-First Search","Design","Binary Search","Dynamic Programming"],["树","深度优先搜索","广度优先搜索","设计","二分查找","动态规划"]],"2001412357":[["Design","Hash Table","Linked List","Doubly-Linked List"],["设计","哈希表","链表","双向链表"]],"2001540741":[["Greedy","Array","Dynamic Programming","Sorting"],["贪心","数组","动态规划","排序"]],"2003223492":[["Array","Backtracking"],["数组","回溯"]],"2005932973":[["Bit Manipulation","Trie","Array","Hash Table"],["位运算","字典树","数组","哈希表"]],"2006213514":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"2006522396":[null,null],"2006725411":[["Memoization","Math","Dynamic Programming"],["记忆化搜索","数学","动态规划"]],"2007370712":[["Array","Matrix"],["数组","矩阵"]],"2010735377":[["Database"],["数据库"]],"2011226653":[null,null],"2011811439":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"2012204931":[["Tree","Design","Binary Search Tree","Binary Tree","Data Stream","Heap (Priority Queue)"],["树","设计","二叉搜索树","二叉树","数据流","堆（优先队列）"]],"2012982950":[["Array","String","Prefix Sum"],["数组","字符串","前缀和"]],"2014057820":[["Greedy","Array","Hash Table","Sorting"],["贪心","数组","哈希表","排序"]],"2015120605":[["Array","Hash Table","Divide and Conquer","Bucket Sort","Counting","Quickselect","Sorting","Heap (Priority Queue)"],["数组","哈希表","分治","桶排序","计数","快速选择","排序","堆（优先队列）"]],"2015814436":[["Bit Manipulation","Array","Dynamic Programming","Bitmask"],["位运算","数组","动态规划","状态压缩"]],"2017058203":[["Database"],["数据库"]],"2018559703":[["Stack","Recursion","String"],["栈","递归","字符串"]],"2018741992":[["Stack","Design","Binary Indexed Tree","Array","Hash Table","Ordered Set"],["栈","设计","树状数组","数组","哈希表","有序集合"]],"2018971200":[["Array","Hash Table","Sorting","Heap (Priority Queue)"],["数组","哈希表","排序","堆（优先队列）"]],"2019191135":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"2021188790":[["Greedy","Array"],["贪心","数组"]],"2021376917":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"2024934932":[["Greedy","Array","Hash Table","Counting","Sorting","Heap (Priority Queue)"],["贪心","数组","哈希表","计数","排序","堆（优先队列）"]],"202527271":[["Depth-First Search","Breadth-First Search","Graph","Shortest Path","Heap (Priority Queue)"],["深度优先搜索","广度优先搜索","图","最短路","堆（优先队列）"]],"2025736930":[["Design","Array","Hash Table","String"],["设计","数组","哈希表","字符串"]],"2025960825":[["Array","Hash Table","Two Pointers"],["数组","哈希表","双指针"]],"2027773900":[["Graph","Array","Backtracking"],["图","数组","回溯"]],"2028541392":[["Graph","Array","Biconnected Component"],["图","数组","双连通分量"]],"2033240857":[["Bit Manipulation","Array","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","动态规划","回溯","状态压缩"]],"203427637":[["Depth-First Search","Breadth-First Search","Array","Binary Search","Matrix"],["深度优先搜索","广度优先搜索","数组","二分查找","矩阵"]],"2035240287":[["Binary Indexed Tree","Geometry","Array","Math"],["树状数组","几何","数组","数学"]],"2035720970":[["Stack","Greedy","String"],["栈","贪心","字符串"]],"2036550762":[["Database"],["数据库"]],"2036642817":[["Array","Two Pointers","Simulation"],["数组","双指针","模拟"]],"2037819195":[["Database"],["数据库"]],"2037923639":[["String","Dynamic Programming"],["字符串","动态规划"]],"2038074520":[["Recursion","String"],["递归","字符串"]],"2038782260":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"2041342956":[["Array","Binary Search","Matrix","Prefix Sum"],["数组","二分查找","矩阵","前缀和"]],"2043678372":[["Graph"],["图"]],"20438516":[["Stack","Design"],["栈","设计"]],"2045578042":[["Design","Array","Hash Table","Binary Search"],["设计","数组","哈希表","二分查找"]],"2046332745":[["Trie","Array","String","Backtracking"],["字典树","数组","字符串","回溯"]],"2046402802":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort"],["深度优先搜索","广度优先搜索","图","拓扑排序"]],"2048723677":[["Array","Hash Table","Two Pointers","String","Dynamic Programming"],["数组","哈希表","双指针","字符串","动态规划"]],"2049140185":[["Array","Hash Table","Sliding Window","Heap (Priority Queue)"],["数组","哈希表","滑动窗口","堆（优先队列）"]],"2050291763":[["Greedy","Hash Table","String"],["贪心","哈希表","字符串"]],"2051026474":[["Database"],["数据库"]],"2051273831":[["Math","Simulation"],["数学","模拟"]],"205364228":[["Array","Dynamic Programming","Sorting"],["数组","动态规划","排序"]],"2054972194":[["Database"],["数据库"]],"2055099648":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"2057048497":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"2057246561":[["Array","Binary Search","Divide and Conquer"],["数组","二分查找","分治"]],"2059004815":[["String"],["字符串"]],"2060154218":[["Database"],["数据库"]],"2062472427":[["Greedy","Binary Indexed Tree","Segment Tree","Array","Binary Search","Ordered Set","Sorting"],["贪心","树状数组","线段树","数组","二分查找","有序集合","排序"]],"2063386346":[["Array","Dynamic Programming"],["数组","动态规划"]],"2066655774":[["Breadth-First Search","Array","Matrix","Heap (Priority Queue)"],["广度优先搜索","数组","矩阵","堆（优先队列）"]],"2066860654":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"2068027715":[null,null],"2069508857":[["Design","Hash Table","Linked List","Heap (Priority Queue)"],["设计","哈希表","链表","堆（优先队列）"]],"2069762192":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort"],["深度优先搜索","广度优先搜索","图","拓扑排序"]],"2070962878":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"2074201652":[["Design","Hash Table","String","Binary Search"],["设计","哈希表","字符串","二分查找"]],"2074713320":[["Greedy","Math"],["贪心","数学"]],"2076283496":[["Database"],["数据库"]],"2077283915":[["Bit Manipulation","Brainteaser"],["位运算","脑筋急转弯"]],"2078083870":[["Math","Binary Search"],["数学","二分查找"]],"2080495144":[["Tree","Depth-First Search","Array","Math","Enumeration"],["树","深度优先搜索","数组","数学","枚举"]],"2080861390":[["Array","Math"],["数组","数学"]],"208434464":[["Recursion","Math"],["递归","数学"]],"2085579974":[["Greedy","Array","String"],["贪心","数组","字符串"]],"2085973602":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"2086212420":[["Array","Math","Dynamic Programming","Game Theory","Prefix Sum"],["数组","数学","动态规划","博弈","前缀和"]],"2087368801":[["Hash Table","Linked List","Two Pointers"],["哈希表","链表","双指针"]],"2088822497":[["Array","Hash Table","Two Pointers","Enumeration"],["数组","哈希表","双指针","枚举"]],"2088911620":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"209121812":[["Stack","Array","Prefix Sum","Monotonic Stack"],["栈","数组","前缀和","单调栈"]],"2093417498":[["Design","Queue","Array","Linked List"],["设计","队列","数组","链表"]],"2094034129":[["Binary Indexed Tree","Segment Tree","Array","Sorting"],["树状数组","线段树","数组","排序"]],"2094685164":[["Depth-First Search","Breadth-First Search","Array","Matrix"],["深度优先搜索","广度优先搜索","数组","矩阵"]],"2097099950":[["Stack","Greedy","Array","Two Pointers","Sorting","Monotonic Stack"],["栈","贪心","数组","双指针","排序","单调栈"]],"2099267983":[["Array","Dynamic Programming"],["数组","动态规划"]],"2100511060":[["Array","Math","Matrix","Sorting"],["数组","数学","矩阵","排序"]],"2101009140":[["Math","String","Simulation"],["数学","字符串","模拟"]],"2102124703":[["Bit Manipulation","Hash Table","String","Divide and Conquer","Sliding Window"],["位运算","哈希表","字符串","分治","滑动窗口"]],"210217684":[["Array","Sliding Window"],["数组","滑动窗口"]],"2105184024":[["Math","String"],["数学","字符串"]],"2105190288":[["Database"],["数据库"]],"2106508430":[["Array","Binary Search"],["数组","二分查找"]],"210734267":[["Math","String","Simulation"],["数学","字符串","模拟"]],"2107686904":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"2108728330":[["Array","Prefix Sum"],["数组","前缀和"]],"2109002994":[["Database"],["数据库"]],"2109320577":[["Array"],["数组"]],"211245592":[["Database"],["数据库"]],"2113446044":[["Array","Math","Number Theory"],["数组","数学","数论"]],"2115947356":[["Array","Simulation"],["数组","模拟"]],"2117244239":[["Design","Data Stream","Ordered Set","Heap (Priority Queue)"],["设计","数据流","有序集合","堆（优先队列）"]],"2117678052":[["Database"],["数据库"]],"212097244":[null,null],"2122371082":[["Recursion","Math"],["递归","数学"]],"2122542522":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"2123032733":[["Bit Manipulation","Array"],["位运算","数组"]],"212376193":[["Array","Dynamic Programming"],["数组","动态规划"]],"2123999060":[["Array","Dynamic Programming"],["数组","动态规划"]],"212627710":[["Breadth-First Search","Array","Hash Table"],["广度优先搜索","数组","哈希表"]],"2129258263":[["Database"],["数据库"]],"212930587":[["Greedy","Math","Heap (Priority Queue)"],["贪心","数学","堆（优先队列）"]],"2130827066":[["Math","String","Dynamic Programming","String Matching"],["数学","字符串","动态规划","字符串匹配"]],"2131267381":[["Array","Dynamic Programming"],["数组","动态规划"]],"2135327933":[["Greedy","Math"],["贪心","数学"]],"2135431142":[["Bit Manipulation","Memoization","Array","Dynamic Programming","Bitmask"],["位运算","记忆化搜索","数组","动态规划","状态压缩"]],"213777418":[["Array","Binary Search"],["数组","二分查找"]],"2137857715":[["Array","Math"],["数组","数学"]],"2137931406":[["Array","Math","Binary Search","Prefix Sum","Randomized"],["数组","数学","二分查找","前缀和","随机化"]],"2138367939":[["Array","Hash Table"],["数组","哈希表"]],"2140116935":[["Math","Rejection Sampling","Probability and Statistics","Randomized"],["数学","拒绝采样","概率与统计","随机化"]],"214184041":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"2142283134":[["Math"],["数学"]],"2143044442":[["Tree","Depth-First Search","Breadth-First Search","Design","Array","Hash Table"],["树","深度优先搜索","广度优先搜索","设计","数组","哈希表"]],"2144998386":[["String","Sliding Window"],["字符串","滑动窗口"]],"214508087":[["Array","Counting","Prefix Sum"],["数组","计数","前缀和"]],"2146548018":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"2147315027":[["Array","Sorting"],["数组","排序"]],"2147986859":[["Array","Hash Table","Sorting","Heap (Priority Queue)"],["数组","哈希表","排序","堆（优先队列）"]],"2150121610":[["Greedy","Array"],["贪心","数组"]],"2150479645":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"2152298441":[["Stack","Tree","Depth-First Search","Binary Tree"],["栈","树","深度优先搜索","二叉树"]],"2153157695":[["Two Pointers","String"],["双指针","字符串"]],"2153390386":[["Array","Divide and Conquer","Quickselect","Sorting","Heap (Priority Queue)"],["数组","分治","快速选择","排序","堆（优先队列）"]],"2154511916":[["Design","Hash Table","Linked List","Doubly-Linked List"],["设计","哈希表","链表","双向链表"]],"2154696316":[["Array","String","String Matching"],["数组","字符串","字符串匹配"]],"2155229246":[["Bit Manipulation","Array","Backtracking","Enumeration"],["位运算","数组","回溯","枚举"]],"2155696628":[null,null],"2156152723":[["Bit Manipulation","Array","Hash Table","Math","Sorting"],["位运算","数组","哈希表","数学","排序"]],"2160714813":[["Math","Binary Search"],["数学","二分查找"]],"2161204569":[["Stack","Linked List","Two Pointers"],["栈","链表","双指针"]],"2162382478":[null,null],"2164084926":[null,null],"2164343480":[["Database"],["数据库"]],"2165999334":[["Database"],["数据库"]],"2167794143":[["Array","String Matching","Sliding Window","Hash Function","Rolling Hash"],["数组","字符串匹配","滑动窗口","哈希函数","滚动哈希"]],"2168242954":[["Geometry","Math"],["几何","数学"]],"2168825861":[["Math","Number Theory"],["数学","数论"]],"2169396423":[["Bit Manipulation","Array","Dynamic Programming","Bitmask"],["位运算","数组","动态规划","状态压缩"]],"2169721379":[["Trie","Array","Hash Table","Enumeration","Hash Function","Rolling Hash"],["字典树","数组","哈希表","枚举","哈希函数","滚动哈希"]],"2170025879":[["Breadth-First Search","Graph","Array","Matrix","Shortest Path","Heap (Priority Queue)"],["广度优先搜索","图","数组","矩阵","最短路","堆（优先队列）"]],"2172902585":[["Tree","Binary Tree"],["树","二叉树"]],"217467576":[["Greedy","Geometry","Array","Math","Combinatorics","Sorting"],["贪心","几何","数组","数学","组合数学","排序"]],"217546662":[["Array"],["数组"]],"2176047848":[["Design","Hash Table","Binary Search","Ordered Set","Sorting"],["设计","哈希表","二分查找","有序集合","排序"]],"2180877898":[["Bit Manipulation"],["位运算"]],"2181231700":[["Array","Binary Search"],["数组","二分查找"]],"2182253577":[["Array","Math"],["数组","数学"]],"2182388811":[["Greedy","Array","String Matching"],["贪心","数组","字符串匹配"]],"2182831583":[["Graph","Topological Sort","Array","Hash Table","String"],["图","拓扑排序","数组","哈希表","字符串"]],"2184297331":[["Bit Manipulation","Array"],["位运算","数组"]],"2184686055":[["Array","Math","Two Pointers","Sorting"],["数组","数学","双指针","排序"]],"2185596896":[null,null],"2185644087":[["Database"],["数据库"]],"2187172880":[["Greedy","Array"],["贪心","数组"]],"218781353":[["Depth-First Search","Graph","Topological Sort"],["深度优先搜索","图","拓扑排序"]],"2188606245":[["Linked List","Two Pointers"],["链表","双指针"]],"2191074840":[["Bit Manipulation","Tree","Depth-First Search","Hash Table"],["位运算","树","深度优先搜索","哈希表"]],"2191726075":[["Bit Manipulation","Queue","Array","Prefix Sum","Sliding Window"],["位运算","队列","数组","前缀和","滑动窗口"]],"2192121612":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2192706389":[["Sorting","Heap (Priority Queue)"],["排序","堆（优先队列）"]],"2193040547":[["Greedy","Array"],["贪心","数组"]],"2193251345":[null,null],"2194073999":[["Two Pointers","String"],["双指针","字符串"]],"2194441263":[null,null],"2194831616":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"219694070":[["Math","Dynamic Programming"],["数学","动态规划"]],"2197356984":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"2199036891":[["Array","Hash Table","Binary Search","Counting","Matrix"],["数组","哈希表","二分查找","计数","矩阵"]],"2199938357":[["Tree","Binary Search Tree","Binary Tree"],["树","二叉搜索树","二叉树"]],"2201727713":[["Database"],["数据库"]],"2201981126":[["Math"],["数学"]],"2203655753":[["Math","Dynamic Programming","Game Theory"],["数学","动态规划","博弈"]],"2204380301":[["Greedy","Math"],["贪心","数学"]],"2204914887":[["Design","Array","Hash Table","Counting"],["设计","数组","哈希表","计数"]],"2205913729":[["Greedy","Hash Table","String","Counting"],["贪心","哈希表","字符串","计数"]],"220599685":[null,null],"220667062":[["Greedy","Array","Hash Table","Binary Search","Sorting"],["贪心","数组","哈希表","二分查找","排序"]],"2206719747":[["Math","Dynamic Programming","Game Theory"],["数学","动态规划","博弈"]],"2207624249":[["Array","Dynamic Programming"],["数组","动态规划"]],"2207905219":[["Database"],["数据库"]],"2208494667":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"2208585097":[["Array","Prefix Sum"],["数组","前缀和"]],"2213463441":[["String","Dynamic Programming"],["字符串","动态规划"]],"2214262554":[["Greedy","Array","Matrix"],["贪心","数组","矩阵"]],"2214824906":[["Stack","Depth-First Search","String"],["栈","深度优先搜索","字符串"]],"2216360450":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"2220648902":[["String","Dynamic Programming"],["字符串","动态规划"]],"2222019296":[["Tree","Depth-First Search","Breadth-First Search"],["树","深度优先搜索","广度优先搜索"]],"2226311468":[["Bit Manipulation","String","Backtracking"],["位运算","字符串","回溯"]],"2228358934":[["Math","Combinatorics","Enumeration"],["数学","组合数学","枚举"]],"2230494217":[["Bit Manipulation","Graph","Dynamic Programming","Bitmask"],["位运算","图","动态规划","状态压缩"]],"2232175898":[["Database"],["数据库"]],"223285376":[["Bit Manipulation"],["位运算"]],"2235555306":[["Hash Table","Math","Counting","Enumeration","Sorting"],["哈希表","数学","计数","枚举","排序"]],"2235724788":[null,null],"2235840093":[["Linked List","Two Pointers","Divide and Conquer","Sorting","Merge Sort"],["链表","双指针","分治","排序","归并排序"]],"223690290":[null,null],"2238247137":[["Bit Manipulation"],["位运算"]],"2240198172":[["Array","Hash Table","Sorting","Sliding Window"],["数组","哈希表","排序","滑动窗口"]],"2240876068":[["Math"],["数学"]],"224100421":[["Array","Dynamic Programming","Sorting"],["数组","动态规划","排序"]],"2244707838":[["Two Pointers","String"],["双指针","字符串"]],"224630615":[["Queue","Array","Ordered Set","Sliding Window","Monotonic Queue","Heap (Priority Queue)"],["队列","数组","有序集合","滑动窗口","单调队列","堆（优先队列）"]],"2247018180":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"2247565255":[["Union Find","Array","Hash Table"],["并查集","数组","哈希表"]],"2248212771":[["Array","Sliding Window"],["数组","滑动窗口"]],"2248507270":[["String","Binary Search","String Matching","Suffix Array","Hash Function","Rolling Hash"],["字符串","二分查找","字符串匹配","后缀数组","哈希函数","滚动哈希"]],"2249312740":[["Greedy","Array","Hash Table","Sorting"],["贪心","数组","哈希表","排序"]],"2249355269":[["Hash Table","String"],["哈希表","字符串"]],"2249490":[["Design","Array","Two Pointers","Iterator"],["设计","数组","双指针","迭代器"]],"2249718139":[["Stack","String","Dynamic Programming"],["栈","字符串","动态规划"]],"2249810515":[["Database"],["数据库"]],"2251334448":[["Array","Dynamic Programming"],["数组","动态规划"]],"2251945224":[["Binary Indexed Tree","Array","Binary Search"],["树状数组","数组","二分查找"]],"2252317011":[["Array","Dynamic Programming","Prefix Sum"],["数组","动态规划","前缀和"]],"225263285":[["Database"],["数据库"]],"2254789488":[["Greedy","Two Pointers","String"],["贪心","双指针","字符串"]],"2255777157":[["Array","Dynamic Programming","Sorting"],["数组","动态规划","排序"]],"2256129159":[["Array","Hash Table","Math"],["数组","哈希表","数学"]],"2257250428":[["Tree","Math","Dynamic Programming","Binary Tree","Game Theory"],["树","数学","动态规划","二叉树","博弈"]],"2257308276":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"2258141933":[["Greedy","Array","Hash Table","Counting"],["贪心","数组","哈希表","计数"]],"2258165342":[["Database"],["数据库"]],"2258623827":[["Array","Math","Dynamic Programming","Sorting"],["数组","数学","动态规划","排序"]],"2259000228":[["Array","Simulation"],["数组","模拟"]],"2259176301":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"2260151323":[["Greedy","Array","Enumeration","Prefix Sum","Sorting"],["贪心","数组","枚举","前缀和","排序"]],"2262588000":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"2265344721":[["Array","Hash Table","String","Sliding Window"],["数组","哈希表","字符串","滑动窗口"]],"2265657217":[["Array","Math"],["数组","数学"]],"2267593455":[["Array","Binary Search","Prefix Sum","Sliding Window"],["数组","二分查找","前缀和","滑动窗口"]],"2270005002":[["Math","Dynamic Programming"],["数学","动态规划"]],"2272805308":[["Geometry","Array","Math"],["几何","数组","数学"]],"2274658324":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"2277934665":[["Backtracking"],["回溯"]],"2279246890":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"2279730191":[["Tree","Depth-First Search","Breadth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","广度优先搜索","哈希表","二叉树"]],"228115268":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"228284311":[["Hash Table","String","Counting","Prefix Sum"],["哈希表","字符串","计数","前缀和"]],"2284449411":[["Recursion","Math","String"],["递归","数学","字符串"]],"2285069816":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"228551495":[["Array","Hash Table","Ordered Set"],["数组","哈希表","有序集合"]],"2285522737":[["Array","Binary Search"],["数组","二分查找"]],"2285940610":[["Array","Backtracking"],["数组","回溯"]],"2287172046":[["Graph"],["图"]],"2290049338":[["Array","Prefix Sum"],["数组","前缀和"]],"2291083428":[["Linked List"],["链表"]],"2294942579":[["Array","Hash Table"],["数组","哈希表"]],"2295408709":[["String"],["字符串"]],"2296253743":[["Database"],["数据库"]],"2297518953":[["Stack","Binary Indexed Tree","Segment Tree","Array","Binary Search","Monotonic Stack","Heap (Priority Queue)"],["栈","树状数组","线段树","数组","二分查找","单调栈","堆（优先队列）"]],"2300589345":[["Greedy","Math","Dynamic Programming"],["贪心","数学","动态规划"]],"2301924247":[["Stack","Array","Math"],["栈","数组","数学"]],"2302244531":[["Array","Hash Table","Dynamic Programming"],["数组","哈希表","动态规划"]],"2303671714":[null,null],"2304874524":[["Breadth-First Search","Backtracking"],["广度优先搜索","回溯"]],"2305702963":[["Array","Dynamic Programming"],["数组","动态规划"]],"2306188300":[["Array","Matrix"],["数组","矩阵"]],"2310137574":[["Array","Hash Table","Counting","Sorting"],["数组","哈希表","计数","排序"]],"2310396":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"2310675124":[["Array","Matrix"],["数组","矩阵"]],"2311001320":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2312427727":[["Stack","String"],["栈","字符串"]],"231349873":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"2313819845":[["Array","Binary Search"],["数组","二分查找"]],"2313861896":[null,null],"2314357296":[["Stack","Tree","Design","Binary Search Tree","Binary Tree","Iterator"],["栈","树","设计","二叉搜索树","二叉树","迭代器"]],"2315979719":[["Tree","Graph","Topological Sort","Array"],["树","图","拓扑排序","数组"]],"2316551160":[["Array","Sorting","Heap (Priority Queue)"],["数组","排序","堆（优先队列）"]],"2317418982":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"2318221471":[["Design","Hash Table","Linked List","Doubly-Linked List"],["设计","哈希表","链表","双向链表"]],"2320468943":[["String","Dynamic Programming"],["字符串","动态规划"]],"2321187859":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"2321482871":[["Array","Hash Table","String","Counting"],["数组","哈希表","字符串","计数"]],"2321691552":[["Tree","Graph","Topological Sort","Math","Dynamic Programming","Combinatorics"],["树","图","拓扑排序","数学","动态规划","组合数学"]],"2321913205":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"232328045":[["Database"],["数据库"]],"2323533689":[["Math"],["数学"]],"2324786150":[["Greedy","String"],["贪心","字符串"]],"2325031714":[["String","Dynamic Programming"],["字符串","动态规划"]],"2329981708":[["Geometry","Math"],["几何","数学"]],"2330175182":[["Linked List","Two Pointers"],["链表","双指针"]],"2330317080":[["Array","Hash Table","Math","Counting","Number Theory"],["数组","哈希表","数学","计数","数论"]],"2330484730":[["Greedy","Array","Two Pointers","Sorting"],["贪心","数组","双指针","排序"]],"2330647155":[["Hash Table","Linked List","Two Pointers"],["哈希表","链表","双指针"]],"233297408":[["Math","Simulation"],["数学","模拟"]],"2333592799":[["Depth-First Search","Breadth-First Search","Graph","Interactive"],["深度优先搜索","广度优先搜索","图","交互"]],"2333659184":[["String","Sliding Window"],["字符串","滑动窗口"]],"2335420481":[["Tree","Union Find","Graph","Array","Hash Table","Sorting"],["树","并查集","图","数组","哈希表","排序"]],"2335538835":[["String","Dynamic Programming","Prefix Sum","Sliding Window"],["字符串","动态规划","前缀和","滑动窗口"]],"2335778252":[["Depth-First Search","Breadth-First Search","Dynamic Programming"],["深度优先搜索","广度优先搜索","动态规划"]],"2336939814":[["Greedy","Array","Math","Game Theory","Sorting"],["贪心","数组","数学","博弈","排序"]],"2337606731":[["Graph","Hash Table"],["图","哈希表"]],"2338718635":[["Array","Hash Table","Two Pointers","Binary Search","Sorting"],["数组","哈希表","双指针","二分查找","排序"]],"2340825815":[["Database"],["数据库"]],"234098869":[["Stack","Design","Monotonic Stack"],["栈","设计","单调栈"]],"234159120":[["Union Find","Array","Sorting"],["并查集","数组","排序"]],"2344727128":[["Linked List"],["链表"]],"2347359100":[["Stack","String"],["栈","字符串"]],"2347660974":[["Bit Manipulation","Array","Backtracking","Enumeration"],["位运算","数组","回溯","枚举"]],"2348343671":[["Math","String","Simulation"],["数学","字符串","模拟"]],"2348993490":[["String"],["字符串"]],"2351647332":[["Database"],["数据库"]],"235206650":[["Linked List"],["链表"]],"2353125510":[["Array","Matrix","Prefix Sum"],["数组","矩阵","前缀和"]],"2354481551":[null,null],"2355594556":[["Greedy","Array","Matrix"],["贪心","数组","矩阵"]],"2355716390":[["Array","Simulation"],["数组","模拟"]],"2357679638":[["Greedy","Array","Hash Table","Math"],["贪心","数组","哈希表","数学"]],"236080983":[["Stack","Array","Two Pointers","Binary Search","Monotonic Stack"],["栈","数组","双指针","二分查找","单调栈"]],"2362247131":[null,null],"2363229918":[["Database"],["数据库"]],"2365177563":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort"],["深度优先搜索","广度优先搜索","图","拓扑排序"]],"2365828386":[["Array"],["数组"]],"2368071046":[["Stack","Array","Binary Search","Sorting","Monotonic Stack","Heap (Priority Queue)"],["栈","数组","二分查找","排序","单调栈","堆（优先队列）"]],"236837608":[["Array","Hash Table"],["数组","哈希表"]],"2368750036":[["Stack","Greedy","Monotonic Stack"],["栈","贪心","单调栈"]],"2368832701":[null,null],"2369389100":[["Math","Sorting"],["数学","排序"]],"2369595129":[["Database"],["数据库"]],"2369761961":[["Array","Matrix","Prefix Sum"],["数组","矩阵","前缀和"]],"2370285073":[["Array","Binary Search"],["数组","二分查找"]],"2370755498":[["Stack","Array","Math","Number Theory"],["栈","数组","数学","数论"]],"2371431943":[["Greedy","Array","Math","Counting","Game Theory"],["贪心","数组","数学","计数","博弈"]],"2371969629":[["Database"],["数据库"]],"237326824":[["Graph","Shortest Path"],["图","最短路"]],"2373279761":[["Array","Prefix Sum"],["数组","前缀和"]],"2373608335":[["String","Dynamic Programming","Backtracking"],["字符串","动态规划","回溯"]],"2374166461":[["Greedy","Array","Math","String"],["贪心","数组","数学","字符串"]],"2374192694":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"237462896":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2375501212":[["Binary Indexed Tree","Segment Tree","Array","Binary Search","Dynamic Programming"],["树状数组","线段树","数组","二分查找","动态规划"]],"2375816517":[["Dynamic Programming"],["动态规划"]],"2376531005":[["Database"],["数据库"]],"2377767456":[["Math","Enumeration"],["数学","枚举"]],"2380816309":[["Array","Sorting"],["数组","排序"]],"2383026168":[["Database"],["数据库"]],"2383092679":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"2384194086":[["Math","Prefix Sum"],["数学","前缀和"]],"2385909936":[["Reservoir Sampling","Linked List","Math","Randomized"],["水塘抽样","链表","数学","随机化"]],"2386103127":[["Design","Hash Table","Sorting"],["设计","哈希表","排序"]],"2386809488":[["Array"],["数组"]],"2386982504":[["Depth-First Search","Breadth-First Search","Graph"],["深度优先搜索","广度优先搜索","图"]],"2388556480":[["Database"],["数据库"]],"2390584088":[["Array"],["数组"]],"239079794":[["Array","Binary Search","Simulation"],["数组","二分查找","模拟"]],"2391605505":[null,null],"2393134541":[["Depth-First Search","Array","Matrix"],["深度优先搜索","数组","矩阵"]],"2397274802":[["Bit Manipulation","Array","Prefix Sum"],["位运算","数组","前缀和"]],"2398941022":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"2400947874":[["Array","Two Pointers","Binary Search"],["数组","双指针","二分查找"]],"2401052346":[["Concurrency"],["多线程"]],"2402216688":[["Design","Array","Hash Table","String"],["设计","数组","哈希表","字符串"]],"2404871340":[["Array","Hash Table","Matrix","Simulation"],["数组","哈希表","矩阵","模拟"]],"2405342085":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"2405658749":[["Tree","Array","Hash Table","Divide and Conquer","Binary Tree"],["树","数组","哈希表","分治","二叉树"]],"2406786533":[["Database"],["数据库"]],"2407589215":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"2407640855":[["Array","Hash Table","Matrix"],["数组","哈希表","矩阵"]],"2408289758":[["Array","Hash Table"],["数组","哈希表"]],"2409750542":[["Stack","Array","Hash Table","Prefix Sum","Monotonic Stack"],["栈","数组","哈希表","前缀和","单调栈"]],"2410692850":[["Array","Math","String"],["数组","数学","字符串"]],"2412340751":[["Array","Binary Search"],["数组","二分查找"]],"2413930996":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"2415029607":[["Union Find","Graph","Minimum Spanning Tree","Sorting","Strongly Connected Component"],["并查集","图","最小生成树","排序","强连通分量"]],"2417537933":[["Greedy","Array","Counting Sort","Sorting"],["贪心","数组","计数排序","排序"]],"2418375843":[["Database"],["数据库"]],"2420716906":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"2420933825":[["Array","Sorting"],["数组","排序"]],"2421996109":[["Array","Binary Search","Divide and Conquer","Matrix"],["数组","二分查找","分治","矩阵"]],"2422059385":[["Array","Binary Search"],["数组","二分查找"]],"2422080240":[["Design","Array","Hash Table","Data Stream"],["设计","数组","哈希表","数据流"]],"242229728":[["Database"],["数据库"]],"2422423692":[["Tree","Depth-First Search","Breadth-First Search","Graph","Array"],["树","深度优先搜索","广度优先搜索","图","数组"]],"2424933436":[["Math","Two Pointers","Enumeration"],["数学","双指针","枚举"]],"2425741756":[["Trie","Array","String","Counting"],["字典树","数组","字符串","计数"]],"2428818859":[["Bit Manipulation","Math","String"],["位运算","数学","字符串"]],"2430051677":[["Array","Binary Search"],["数组","二分查找"]],"2430259702":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"2431129875":[["Array","Dynamic Programming"],["数组","动态规划"]],"2433168244":[["Bit Manipulation","Math","String"],["位运算","数学","字符串"]],"2434134348":[["Math","String"],["数学","字符串"]],"2434964692":[["Array","Simulation"],["数组","模拟"]],"2436117632":[["Segment Tree","Queue","Array","Dynamic Programming","Prefix Sum","Monotonic Queue","Heap (Priority Queue)"],["线段树","队列","数组","动态规划","前缀和","单调队列","堆（优先队列）"]],"2436413676":[["Trie","String","Hash Function","Rolling Hash"],["字典树","字符串","哈希函数","滚动哈希"]],"2436753495":[["Breadth-First Search","Backtracking"],["广度优先搜索","回溯"]],"2442045936":[["Hash Table","String"],["哈希表","字符串"]],"2442896853":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"2443834680":[["Array","Two Pointers"],["数组","双指针"]],"244758471":[["Depth-First Search","Breadth-First Search","Union Find","Array","Hash Table","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","哈希表","矩阵"]],"2448413931":[["Math"],["数学"]],"2452001178":[["String"],["字符串"]],"2453198602":[["Recursion","Math"],["递归","数学"]],"2455085538":[["Math"],["数学"]],"2457264374":[["Database"],["数据库"]],"245796778":[["Array","Two Pointers"],["数组","双指针"]],"2460331500":[["Design","Segment Tree","Array","Hash Table","Binary Search"],["设计","线段树","数组","哈希表","二分查找"]],"246275746":[["Bit Manipulation","Array","Prefix Sum"],["位运算","数组","前缀和"]],"2464323261":[["Trie","Array","String","Sorting"],["字典树","数组","字符串","排序"]],"2465331178":[["Array","Math","Dynamic Programming"],["数组","数学","动态规划"]],"2469022748":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"2469933695":[["Array","Hash Table","Divide and Conquer","Counting","Sorting"],["数组","哈希表","分治","计数","排序"]],"2471701670":[["Two Pointers","String"],["双指针","字符串"]],"2471898191":[["String","Dynamic Programming"],["字符串","动态规划"]],"2473812468":[["Bit Manipulation","Array","Two Pointers","Dynamic Programming","Bitmask"],["位运算","数组","双指针","动态规划","状态压缩"]],"2475848461":[["Greedy","Array","Binary Search","Sorting"],["贪心","数组","二分查找","排序"]],"2479293617":[["Greedy","Array","Hash Table","Prefix Sum"],["贪心","数组","哈希表","前缀和"]],"2480987547":[["Geometry","Array","Math"],["几何","数组","数学"]],"2481240580":[["Two Pointers","String","Dynamic Programming"],["双指针","字符串","动态规划"]],"2481973138":[["Bit Manipulation","Dynamic Programming"],["位运算","动态规划"]],"248789391":[["Math","Enumeration"],["数学","枚举"]],"2488004222":[null,null],"2488135056":[["Union Find","Graph","Topological Sort","Array","Matrix","Sorting"],["并查集","图","拓扑排序","数组","矩阵","排序"]],"2491402608":[["Math"],["数学"]],"2492032151":[["Math","Divide and Conquer"],["数学","分治"]],"2493144905":[["Hash Table","Two Pointers","String","Sliding Window"],["哈希表","双指针","字符串","滑动窗口"]],"2493499746":[["Geometry","Array","Math","Sorting","Sliding Window"],["几何","数组","数学","排序","滑动窗口"]],"2493528114":[["Design","Hash Table","String","Hash Function"],["设计","哈希表","字符串","哈希函数"]],"249363528":[["Tree","Breadth-First Search","Binary Tree"],["树","广度优先搜索","二叉树"]],"2494605157":[["Database"],["数据库"]],"249521607":[["Depth-First Search","Breadth-First Search","Graph"],["深度优先搜索","广度优先搜索","图"]],"2496465634":[["Array","Hash Table","Linked List"],["数组","哈希表","链表"]],"2499674936":[null,null],"2500271603":[["Design","Hash Table","Ordered Set","Heap (Priority Queue)"],["设计","哈希表","有序集合","堆（优先队列）"]],"2500987303":[["Design","Array","Hash Table","Math","Randomized"],["设计","数组","哈希表","数学","随机化"]],"2502228330":[["Array","Line Sweep"],["数组","扫描线"]],"2502903776":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"2503581045":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"2503951076":[["Greedy","Array","Math"],["贪心","数组","数学"]],"2504097527":[["Design","Array","Hash Table","String"],["设计","数组","哈希表","字符串"]],"2504384020":[["Design","Segment Tree","Binary Search","Ordered Set"],["设计","线段树","二分查找","有序集合"]],"2505184572":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"2509232431":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort","Array","String"],["深度优先搜索","广度优先搜索","图","拓扑排序","数组","字符串"]],"251006919":[["Array","Hash Table","Binary Search","Ordered Set","Prefix Sum","Sorting"],["数组","哈希表","二分查找","有序集合","前缀和","排序"]],"2510392129":[["Bit Manipulation","Depth-First Search","Breadth-First Search"],["位运算","深度优先搜索","广度优先搜索"]],"2510517613":[["Greedy","Array","Prefix Sum","Sorting"],["贪心","数组","前缀和","排序"]],"2511234285":[["Math","Combinatorics"],["数学","组合数学"]],"2513347763":[["Array","Hash Table","Counting","Enumeration","Prefix Sum"],["数组","哈希表","计数","枚举","前缀和"]],"2513980161":[["Greedy","Array","Hash Table","Counting","Sorting"],["贪心","数组","哈希表","计数","排序"]],"251533366":[["Geometry","Array","Hash Table","Math"],["几何","数组","哈希表","数学"]],"2515340929":[["Bit Manipulation","Hash Table","String","Counting"],["位运算","哈希表","字符串","计数"]],"2519726489":[["String","Dynamic Programming","Prefix Sum"],["字符串","动态规划","前缀和"]],"2520941920":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"2521216381":[["Breadth-First Search","Graph","Array","Hash Table","Sorting"],["广度优先搜索","图","数组","哈希表","排序"]],"2521310070":[["Array"],["数组"]],"2523329139":[["Tree","Breadth-First Search","Binary Tree"],["树","广度优先搜索","二叉树"]],"2523374000":[["Design","Trie","Hash Table","String"],["设计","字典树","哈希表","字符串"]],"2526467539":[["Backtracking"],["回溯"]],"2526914852":[["Array","Backtracking","Matrix"],["数组","回溯","矩阵"]],"2529461898":[["Greedy","Array","Sorting","Heap (Priority Queue)"],["贪心","数组","排序","堆（优先队列）"]],"2529652202":[["Database"],["数据库"]],"253015942":[["Tree","Depth-First Search","Breadth-First Search","String"],["树","深度优先搜索","广度优先搜索","字符串"]],"2530621646":[["Bit Manipulation","Trie","Array","Hash Table","String"],["位运算","字典树","数组","哈希表","字符串"]],"2531808875":[["String","Dynamic Programming"],["字符串","动态规划"]],"2532000263":[["Breadth-First Search","Array","Hash Table","String"],["广度优先搜索","数组","哈希表","字符串"]],"2532136306":[null,null],"2532708840":[["Array","Hash Table","Heap (Priority Queue)"],["数组","哈希表","堆（优先队列）"]],"2534016591":[["Database"],["数据库"]],"2534323731":[["Array","Dynamic Programming"],["数组","动态规划"]],"2534500893":[["Design","Trie","Array","Hash Table","String"],["设计","字典树","数组","哈希表","字符串"]],"2534714311":[["Design","String","Backtracking","Iterator"],["设计","字符串","回溯","迭代器"]],"253585197":[["Stack","Recursion","String"],["栈","递归","字符串"]],"2541052146":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"254218602":[["Design","Array","Hash Table","Linked List","Hash Function"],["设计","数组","哈希表","链表","哈希函数"]],"2542321733":[["Stack","Greedy","Array","Dynamic Programming","Monotonic Stack"],["栈","贪心","数组","动态规划","单调栈"]],"2544348147":[["Hash Table","String"],["哈希表","字符串"]],"2546467088":[["Array","Binary Search","Dynamic Programming","Sorting","Heap (Priority Queue)"],["数组","二分查找","动态规划","排序","堆（优先队列）"]],"2548029026":[["Hash Table","Linked List"],["哈希表","链表"]],"2548478453":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"254983687":[["Tree","Graph"],["树","图"]],"2550811240":[["Array","Two Pointers"],["数组","双指针"]],"255204169":[["Array","String"],["数组","字符串"]],"2553352145":[["Stack","Queue","Array","Simulation"],["栈","队列","数组","模拟"]],"2553787403":[["Array","Binary Search"],["数组","二分查找"]],"255657392":[["Two Pointers","String"],["双指针","字符串"]],"2559668419":[["Graph","Shortest Path","Heap (Priority Queue)"],["图","最短路","堆（优先队列）"]],"2560027362":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort","Memoization","Array","Dynamic Programming","Matrix"],["深度优先搜索","广度优先搜索","图","拓扑排序","记忆化搜索","数组","动态规划","矩阵"]],"2560538129":[null,null],"2562103296":[["Math","String"],["数学","字符串"]],"2562869066":[["Design","Array","Hash Table","Matrix","Simulation"],["设计","数组","哈希表","矩阵","模拟"]],"256288757":[["Segment Tree","Array","Ordered Set"],["线段树","数组","有序集合"]],"2563069268":[["Bit Manipulation","Array","Dynamic Programming","Bitmask"],["位运算","数组","动态规划","状态压缩"]],"2563394539":[null,null],"2569057399":[["String"],["字符串"]],"2570139767":[["Recursion","Memoization","Math","Dynamic Programming"],["递归","记忆化搜索","数学","动态规划"]],"2572143666":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"2572232151":[["String","Dynamic Programming"],["字符串","动态规划"]],"2572461200":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2572867035":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"2573075022":[["Hash Table","String","Binary Search","Counting","Sliding Window"],["哈希表","字符串","二分查找","计数","滑动窗口"]],"2573211912":[["Stack","Greedy","Array","Math","Number Theory","Monotonic Stack"],["栈","贪心","数组","数学","数论","单调栈"]],"2574605858":[["String"],["字符串"]],"2575372610":[["Array","Backtracking"],["数组","回溯"]],"2575656476":[["Graph","Array","Shortest Path","Heap (Priority Queue)"],["图","数组","最短路","堆（优先队列）"]],"2576790821":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"2577818967":[null,null],"2578391134":[["Database"],["数据库"]],"2578600625":[["Array","Hash Table"],["数组","哈希表"]],"2579010831":[["Array","Backtracking","Matrix"],["数组","回溯","矩阵"]],"2579112355":[["Hash Table","String"],["哈希表","字符串"]],"2579491041":[["Database"],["数据库"]],"2579679937":[["Binary Indexed Tree","Array","Dynamic Programming","Enumeration","Prefix Sum"],["树状数组","数组","动态规划","枚举","前缀和"]],"2581904260":[["Array","Sorting"],["数组","排序"]],"2582233376":[["Array","Math"],["数组","数学"]],"2582430711":[["Array","Binary Search","Divide and Conquer"],["数组","二分查找","分治"]],"2583029056":[["Array","Matrix"],["数组","矩阵"]],"258313482":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"2586044711":[["Recursion","Queue","Array","Math","Simulation"],["递归","队列","数组","数学","模拟"]],"2588374358":[["Design","Trie","Hash Table","String"],["设计","字典树","哈希表","字符串"]],"2588489114":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"2589865335":[["Design","Array","Iterator"],["设计","数组","迭代器"]],"2590774847":[["Bit Manipulation","Dynamic Programming"],["位运算","动态规划"]],"2591484771":[["Array","Two Pointers"],["数组","双指针"]],"2595565556":[["Tree","Depth-First Search","Breadth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉搜索树","二叉树"]],"2595697191":[["Array","Simulation"],["数组","模拟"]],"2595882232":[["Array","Matrix"],["数组","矩阵"]],"2597701503":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"2598780139":[["String","Dynamic Programming"],["字符串","动态规划"]],"2599242307":[["Stack","Tree","Design","Math","Binary Tree"],["栈","树","设计","数学","二叉树"]],"2600147563":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"2600262554":[["String","Dynamic Programming"],["字符串","动态规划"]],"2600395028":[["Two Pointers","String"],["双指针","字符串"]],"2603031099":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"2604144466":[["Concurrency"],["多线程"]],"2604690450":[["Stack","Greedy","String","Dynamic Programming"],["栈","贪心","字符串","动态规划"]],"260479518":[["Greedy","Array","Two Pointers","Binary Search","Sorting"],["贪心","数组","双指针","二分查找","排序"]],"2605448197":[["Depth-First Search","Graph","Topological Sort"],["深度优先搜索","图","拓扑排序"]],"260623190":[["Bit Manipulation","Array"],["位运算","数组"]],"2606916888":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"2609641077":[["Array","Math","Dynamic Programming","Matrix"],["数组","数学","动态规划","矩阵"]],"2609962764":[["Array","Matrix"],["数组","矩阵"]],"2610426510":[["Math","Binary Search","Dynamic Programming"],["数学","二分查找","动态规划"]],"2610864298":[["Stack","Depth-First Search","String"],["栈","深度优先搜索","字符串"]],"2610865464":[["Array","Binary Search"],["数组","二分查找"]],"2612530279":[["Array","Binary Search"],["数组","二分查找"]],"2612627798":[["Database"],["数据库"]],"2613694816":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2613974860":[["Math","Binary Search"],["数学","二分查找"]],"2613979956":[["String","Sliding Window"],["字符串","滑动窗口"]],"2615198346":[["Greedy","String","Heap (Priority Queue)"],["贪心","字符串","堆（优先队列）"]],"261533544":[["Queue","Array","Dynamic Programming","Monotonic Queue","Heap (Priority Queue)"],["队列","数组","动态规划","单调队列","堆（优先队列）"]],"2616191739":[["Stack","Recursion","String"],["栈","递归","字符串"]],"2617125781":[["Tree","Depth-First Search","Breadth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","广度优先搜索","哈希表","二叉树"]],"2617837584":[["Greedy","Array","Counting","Sorting"],["贪心","数组","计数","排序"]],"2618479578":[["Array","Math","String"],["数组","数学","字符串"]],"2618637580":[["Bit Manipulation","Tree","Depth-First Search","Array"],["位运算","树","深度优先搜索","数组"]],"2619603225":[["Greedy","Array"],["贪心","数组"]],"2621107821":[["String"],["字符串"]],"2621480860":[["Array","Hash Table","Two Pointers","Sorting"],["数组","哈希表","双指针","排序"]],"2622232119":[["Bit Manipulation","Array","Hash Table","Backtracking"],["位运算","数组","哈希表","回溯"]],"2626303746":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"2626440500":[["Database"],["数据库"]],"2628400239":[["Bit Manipulation","Hash Table","String","Sorting"],["位运算","哈希表","字符串","排序"]],"2628574755":[null,null],"2629528696":[["String"],["字符串"]],"2629734466":[null,null],"2630527363":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2630992864":[["Database"],["数据库"]],"2631177392":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"2631196608":[["Geometry","Array","Math"],["几何","数组","数学"]],"2631420913":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"2632738906":[["Depth-First Search","Breadth-First Search","Array","Hash Table"],["深度优先搜索","广度优先搜索","数组","哈希表"]],"2633929455":[["Bit Manipulation","Brainteaser","Array","Math"],["位运算","脑筋急转弯","数组","数学"]],"263409464":[["Database"],["数据库"]],"2634124873":[["Greedy","Array","Sorting","Heap (Priority Queue)"],["贪心","数组","排序","堆（优先队列）"]],"2634383093":[["Array","Binary Search","Matrix","Heap (Priority Queue)"],["数组","二分查找","矩阵","堆（优先队列）"]],"2634690453":[["Database"],["数据库"]],"2635424294":[["Tree","Depth-First Search","Graph","Trie"],["树","深度优先搜索","图","字典树"]],"2636727819":[["Database"],["数据库"]],"2637994881":[["Bit Manipulation","Recursion","Array","Dynamic Programming","Bitmask"],["位运算","递归","数组","动态规划","状态压缩"]],"2638444930":[null,null],"2639105050":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"2640785054":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"2640877802":[["Tree","Divide and Conquer"],["树","分治"]],"2642386680":[["Hash Table","Linked List","Two Pointers"],["哈希表","链表","双指针"]],"2643077516":[["Array","Binary Search"],["数组","二分查找"]],"2643883804":[["Database"],["数据库"]],"2645404069":[["Greedy","Bit Manipulation"],["贪心","位运算"]],"2646645546":[["Greedy","String","Sorting"],["贪心","字符串","排序"]],"264755561":[["Array","Hash Table","Matrix"],["数组","哈希表","矩阵"]],"2648057035":[["Math","Dynamic Programming","Combinatorics","Number Theory"],["数学","动态规划","组合数学","数论"]],"2651582555":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"2651875294":[["String","Binary Search","Prefix Sum","Sliding Window"],["字符串","二分查找","前缀和","滑动窗口"]],"265213405":[["Stack","Union Find","Array","Monotonic Stack"],["栈","并查集","数组","单调栈"]],"2652913230":[["Array","Two Pointers","String","Sorting"],["数组","双指针","字符串","排序"]],"2653876812":[["Reservoir Sampling","Array","Math","Binary Search","Ordered Set","Prefix Sum","Randomized"],["水塘抽样","数组","数学","二分查找","有序集合","前缀和","随机化"]],"2654590324":[["String","String Matching","Hash Function","Rolling Hash"],["字符串","字符串匹配","哈希函数","滚动哈希"]],"2654831659":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"2655169339":[["Queue","Array","Sliding Window","Monotonic Queue","Heap (Priority Queue)"],["队列","数组","滑动窗口","单调队列","堆（优先队列）"]],"2655862888":[["Math","Simulation"],["数学","模拟"]],"2657502607":[["Greedy","Array","Hash Table","Counting"],["贪心","数组","哈希表","计数"]],"2658427199":[["Array","Binary Search"],["数组","二分查找"]],"2658657252":[["Database"],["数据库"]],"2659424902":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort","Memoization","Array","Dynamic Programming","Matrix"],["深度优先搜索","广度优先搜索","图","拓扑排序","记忆化搜索","数组","动态规划","矩阵"]],"2660105967":[["Bit Manipulation"],["位运算"]],"2661403855":[["Bit Manipulation","Hash Table","String","Prefix Sum"],["位运算","哈希表","字符串","前缀和"]],"2661850381":[["Database"],["数据库"]],"2661929533":[["Array","Hash Table","String","Counting"],["数组","哈希表","字符串","计数"]],"2664015237":[["Array","Math","Enumeration","Number Theory"],["数组","数学","枚举","数论"]],"2664544460":[["Graph","Array","Shortest Path","Heap (Priority Queue)"],["图","数组","最短路","堆（优先队列）"]],"266469116":[["Stack","Greedy","String","Monotonic Stack"],["栈","贪心","字符串","单调栈"]],"2665985011":[["Math","String","Backtracking","Enumeration"],["数学","字符串","回溯","枚举"]],"2666352866":[["Array","String","Simulation"],["数组","字符串","模拟"]],"2668311333":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"2669738738":[["Brainteaser","Math","Dynamic Programming","Game Theory"],["脑筋急转弯","数学","动态规划","博弈"]],"2670146102":[["Greedy","Array","Sorting","Heap (Priority Queue)"],["贪心","数组","排序","堆（优先队列）"]],"2670735101":[["Math"],["数学"]],"267105112":[null,null],"2671757819":[["Dynamic Programming"],["动态规划"]],"2672352527":[["Tree","Graph","Array","Strongly Connected Component"],["树","图","数组","强连通分量"]],"267246445":[["Stack","Union Find","Binary Indexed Tree","Segment Tree","Array","Binary Search","Dynamic Programming"],["栈","并查集","树状数组","线段树","数组","二分查找","动态规划"]],"267587420":[["Math","Simulation"],["数学","模拟"]],"2676463244":[["Greedy","Array","Math","Binary Search","Sorting"],["贪心","数组","数学","二分查找","排序"]],"2677897468":[["Hash Table","Math","Dynamic Programming","Heap (Priority Queue)"],["哈希表","数学","动态规划","堆（优先队列）"]],"2678350009":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"268029565":[["Bit Manipulation","Brainteaser","Math"],["位运算","脑筋急转弯","数学"]],"2680668911":[["Graph","Shortest Path","Heap (Priority Queue)"],["图","最短路","堆（优先队列）"]],"268097121":[["Array","Binary Search","Dynamic Programming"],["数组","二分查找","动态规划"]],"2681170798":[["Math","Enumeration"],["数学","枚举"]],"2681795867":[["Breadth-First Search","Array","Dynamic Programming"],["广度优先搜索","数组","动态规划"]],"268274286":[["Stack","Greedy","String"],["栈","贪心","字符串"]],"2683746085":[["Design","Queue","Array","Linked List"],["设计","队列","数组","链表"]],"268471907":[["Greedy","Array","Matrix","Sorting","Heap (Priority Queue)"],["贪心","数组","矩阵","排序","堆（优先队列）"]],"268498493":[["Array","Hash Table","Divide and Conquer","Bucket Sort","Counting","Quickselect","Sorting","Heap (Priority Queue)"],["数组","哈希表","分治","桶排序","计数","快速选择","排序","堆（优先队列）"]],"2687486440":[["Greedy","String"],["贪心","字符串"]],"2688493082":[["Greedy","Array","Two Pointers","Sorting"],["贪心","数组","双指针","排序"]],"2688612867":[["Array","Math","Number Theory"],["数组","数学","数论"]],"2689567416":[["Array","Sorting"],["数组","排序"]],"2690606528":[["Array","Math"],["数组","数学"]],"269077288":[["Tree","Binary Search Tree","Array","Divide and Conquer","Binary Tree"],["树","二叉搜索树","数组","分治","二叉树"]],"2691544887":[["Bit Manipulation","Array"],["位运算","数组"]],"269219514":[null,null],"2692580018":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"2693685785":[["Greedy","Hash Table","String","Sorting"],["贪心","哈希表","字符串","排序"]],"2694109670":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"2694237057":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"2695383302":[["Stack","Greedy","String","Monotonic Stack"],["栈","贪心","字符串","单调栈"]],"2695613806":[["Array","Sorting"],["数组","排序"]],"2697040026":[["Array","Matrix","Sorting"],["数组","矩阵","排序"]],"2697534725":[["Hash Table","Math","String","Combinatorics","Counting"],["哈希表","数学","字符串","组合数学","计数"]],"2698936427":[["Greedy","Array"],["贪心","数组"]],"2699690813":[["Bit Manipulation","Array","String"],["位运算","数组","字符串"]],"2701115423":[["Array","Binary Search","Ordered Set"],["数组","二分查找","有序集合"]],"2704310299":[["Depth-First Search","Breadth-First Search","Union Find","Array","Hash Table","String"],["深度优先搜索","广度优先搜索","并查集","数组","哈希表","字符串"]],"270435993":[["Depth-First Search","Array"],["深度优先搜索","数组"]],"2705053633":[["Tree","Design","Binary Search Tree","Binary Tree","Data Stream","Heap (Priority Queue)"],["树","设计","二叉搜索树","二叉树","数据流","堆（优先队列）"]],"2709105566":[["Database"],["数据库"]],"2710343893":[["Tree","Binary Search Tree","Backtracking","Binary Tree"],["树","二叉搜索树","回溯","二叉树"]],"2711761019":[["Bit Manipulation","Trie","Array"],["位运算","字典树","数组"]],"2711929003":[["Database"],["数据库"]],"271335539":[["Array","Dynamic Programming"],["数组","动态规划"]],"2714484334":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"2715109000":[["Array","Math","Number Theory"],["数组","数学","数论"]],"2715798469":[["Linked List"],["链表"]],"2716044195":[["Dynamic Programming"],["动态规划"]],"2716169684":[["Recursion","String","Dynamic Programming"],["递归","字符串","动态规划"]],"271664224":[["Union Find","Graph","Minimum Spanning Tree","Heap (Priority Queue)"],["并查集","图","最小生成树","堆（优先队列）"]],"2716747123":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"2717395786":[["Array","Math","Dynamic Programming","Sorting"],["数组","数学","动态规划","排序"]],"2717768736":[["Math"],["数学"]],"2718567180":[["Tree","Depth-First Search","Binary Search Tree","Binary Search","Binary Tree"],["树","深度优先搜索","二叉搜索树","二分查找","二叉树"]],"2719065978":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"2719330296":[["Greedy","Array","Two Pointers","Binary Search","Sorting"],["贪心","数组","双指针","二分查找","排序"]],"2719928959":[["Greedy","Array","Math"],["贪心","数组","数学"]],"2720318685":[["Array","Hash Table","Dynamic Programming","Sliding Window"],["数组","哈希表","动态规划","滑动窗口"]],"2721035468":[["Math"],["数学"]],"2721924500":[["Database"],["数据库"]],"2722367436":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"2724880133":[["Array","Binary Search"],["数组","二分查找"]],"2725160392":[["Greedy","Bit Manipulation","Array"],["贪心","位运算","数组"]],"2726967243":[["Stack","Recursion","Linked List","Two Pointers"],["栈","递归","链表","双指针"]],"2730930360":[["Array","Two Pointers","Simulation","Heap (Priority Queue)"],["数组","双指针","模拟","堆（优先队列）"]],"2731154173":[["Tree","Depth-First Search","Breadth-First Search","Array","Hash Table","String"],["树","深度优先搜索","广度优先搜索","数组","哈希表","字符串"]],"2731213430":[["Greedy","Array","Math","Dynamic Programming","Number Theory"],["贪心","数组","数学","动态规划","数论"]],"2732657659":[["Tree","Depth-First Search","Binary Search Tree","Array","Binary Search","Binary Tree"],["树","深度优先搜索","二叉搜索树","数组","二分查找","二叉树"]],"2733655053":[["Shell"],[""]],"2734248382":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2735085930":[["Depth-First Search","Breadth-First Search","Union Find","Array","Binary Search","Matrix","Heap (Priority Queue)"],["深度优先搜索","广度优先搜索","并查集","数组","二分查找","矩阵","堆（优先队列）"]],"2735293288":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"2735453204":[["Trie","Array","String","Backtracking"],["字典树","数组","字符串","回溯"]],"2736390850":[["Recursion","Linked List"],["递归","链表"]],"2737172644":[["Array","Hash Table","Math","Prefix Sum"],["数组","哈希表","数学","前缀和"]],"2737402297":[["Array","Binary Search","Sorting"],["数组","二分查找","排序"]],"2741739967":[["Database"],["数据库"]],"2745040429":[["Math","Backtracking"],["数学","回溯"]],"2747291591":[["Design","Queue","Data Stream","Ordered Set","Heap (Priority Queue)"],["设计","队列","数据流","有序集合","堆（优先队列）"]],"2748231496":[["Bit Manipulation","Graph","Array","Dynamic Programming","Bitmask"],["位运算","图","数组","动态规划","状态压缩"]],"2748555921":[["Graph"],["图"]],"2749155125":[["Database"],["数据库"]],"2752494454":[["Array","Bucket Sort","Ordered Set","Sorting","Sliding Window"],["数组","桶排序","有序集合","排序","滑动窗口"]],"2754272500":[["Design","Counting","Simulation"],["设计","计数","模拟"]],"2754546565":[["Hash Table","String","Counting","Sliding Window"],["哈希表","字符串","计数","滑动窗口"]],"2756999860":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"2757319898":[["Array","Math"],["数组","数学"]],"2758231762":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2758653794":[["Database"],["数据库"]],"2758696959":[["Depth-First Search","Breadth-First Search","Array","Matrix"],["深度优先搜索","广度优先搜索","数组","矩阵"]],"275986604":[["Breadth-First Search","Graph","Array"],["广度优先搜索","图","数组"]],"2760734604":[["Depth-First Search","Breadth-First Search","String","Interactive"],["深度优先搜索","广度优先搜索","字符串","交互"]],"2762853048":[["Stack","Array","Dynamic Programming","Monotonic Stack"],["栈","数组","动态规划","单调栈"]],"2764953948":[["Queue","Array","Simulation"],["队列","数组","模拟"]],"2765939834":[["Bit Manipulation"],["位运算"]],"2768437968":[["Bit Manipulation","Trie","Array"],["位运算","字典树","数组"]],"2771270445":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"2772237177":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"2772831251":[["Greedy","Array","Binary Search"],["贪心","数组","二分查找"]],"2774491833":[["Greedy","String","Dynamic Programming"],["贪心","字符串","动态规划"]],"2775325601":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort"],["深度优先搜索","广度优先搜索","图","拓扑排序"]],"2775344327":[["Greedy","Array","Binary Search","Prefix Sum","Sorting"],["贪心","数组","二分查找","前缀和","排序"]],"2775508810":[["Array","Hash Table"],["数组","哈希表"]],"2775921161":[["Shell"],[""]],"2776150092":[["Bit Manipulation","Array","String","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","字符串","动态规划","回溯","状态压缩"]],"2776357853":[["Database"],["数据库"]],"2777625264":[["Math","String","Simulation"],["数学","字符串","模拟"]],"2777743854":[["Array","Hash Table","String","String Matching"],["数组","哈希表","字符串","字符串匹配"]],"2782100417":[["Union Find","Counting","Interactive"],["并查集","计数","交互"]],"2782517328":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"2782890042":[["Array","Dynamic Programming"],["数组","动态规划"]],"2783546107":[["String","Dynamic Programming","Backtracking"],["字符串","动态规划","回溯"]],"2783905922":[["Database"],["数据库"]],"278391428":[["Design","Array","String","Iterator"],["设计","数组","字符串","迭代器"]],"278493845":[["Array","Binary Search"],["数组","二分查找"]],"2785029557":[["Database"],["数据库"]],"2786534786":[["Dynamic Programming"],["动态规划"]],"2786999216":[["Greedy","Array","Hash Table","Counting"],["贪心","数组","哈希表","计数"]],"2788838402":[["Depth-First Search","Breadth-First Search","Graph","Dynamic Programming","Shortest Path","Heap (Priority Queue)"],["深度优先搜索","广度优先搜索","图","动态规划","最短路","堆（优先队列）"]],"2791285030":[["Tree","Depth-First Search","Dynamic Programming","Binary Tree"],["树","深度优先搜索","动态规划","二叉树"]],"2792312732":[["Greedy","Array","Two Pointers","String"],["贪心","数组","双指针","字符串"]],"2792663761":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"2794667518":[["Bit Manipulation","Array","Math","Matrix"],["位运算","数组","数学","矩阵"]],"2795839755":[["Array","Two Pointers","Binary Search"],["数组","双指针","二分查找"]],"2795952868":[["Greedy","Math","String","Game Theory"],["贪心","数学","字符串","博弈"]],"2796999710":[["Recursion","Linked List"],["递归","链表"]],"2797831681":[["Math","String","Number Theory"],["数学","字符串","数论"]],"279921423":[null,null],"2799632565":[["Math"],["数学"]],"2799898824":[["Database"],["数据库"]],"2800289700":[["Greedy","Array","Hash Table","String","Counting","Sorting"],["贪心","数组","哈希表","字符串","计数","排序"]],"2801113468":[["Greedy","Array","Hash Table","Math"],["贪心","数组","哈希表","数学"]],"2802523525":[["Two Pointers","String"],["双指针","字符串"]],"2802681137":[["Stack","Hash Table","String","Sorting"],["栈","哈希表","字符串","排序"]],"280396343":[["Hash Table","String"],["哈希表","字符串"]],"2805340615":[["Stack","Recursion","Linked List","Two Pointers"],["栈","递归","链表","双指针"]],"2806136994":[["Tree","Depth-First Search","Breadth-First Search","Math"],["树","深度优先搜索","广度优先搜索","数学"]],"2806558939":[["Greedy","Array","Binary Search","Prefix Sum","Sorting","Sliding Window"],["贪心","数组","二分查找","前缀和","排序","滑动窗口"]],"2806765401":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"2809882420":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"2810226521":[["Bit Manipulation","Hash Table","String","Prefix Sum"],["位运算","哈希表","字符串","前缀和"]],"2811110978":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"2811209697":[["Math","String","Sliding Window"],["数学","字符串","滑动窗口"]],"2812871030":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"2817202669":[["Array","Sliding Window"],["数组","滑动窗口"]],"2817465096":[["Greedy","Array","String"],["贪心","数组","字符串"]],"2818199514":[["Database"],["数据库"]],"2818493377":[["Array","Hash Table","Sorting","Simulation"],["数组","哈希表","排序","模拟"]],"2818810857":[["Database"],["数据库"]],"2818984798":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"2819110526":[["Array","Binary Search"],["数组","二分查找"]],"2821066759":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"2821965653":[["Hash Table","String"],["哈希表","字符串"]],"2823295914":[["Bit Manipulation","Math"],["位运算","数学"]],"282466705":[["Union Find","Graph","Minimum Spanning Tree","Heap (Priority Queue)"],["并查集","图","最小生成树","堆（优先队列）"]],"2826164889":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"2827089777":[["Greedy","String","Enumeration"],["贪心","字符串","枚举"]],"2827658293":[["Math","Dynamic Programming","Number Theory"],["数学","动态规划","数论"]],"282802217":[["Greedy","Two Pointers","String"],["贪心","双指针","字符串"]],"2829216648":[["Greedy","String"],["贪心","字符串"]],"2829252669":[["Math","Binary Search"],["数学","二分查找"]],"28298643":[null,null],"2832741065":[["Design","Binary Indexed Tree","Binary Search","Data Stream"],["设计","树状数组","二分查找","数据流"]],"2832770135":[["Database"],["数据库"]],"2833016658":[["Array","Prefix Sum"],["数组","前缀和"]],"2833179922":[["Array","Matrix"],["数组","矩阵"]],"2833491097":[["Array","String","Prefix Sum"],["数组","字符串","前缀和"]],"2835500769":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"2836143893":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2836390896":[["Hash Table","String"],["哈希表","字符串"]],"28373825":[["Array","Dynamic Programming","Prefix Sum"],["数组","动态规划","前缀和"]],"283849083":[["Design","Queue","Array","Hash Table","Simulation"],["设计","队列","数组","哈希表","模拟"]],"28387341":[["Depth-First Search","Breadth-First Search","Union Find","Graph","Hash Table"],["深度优先搜索","广度优先搜索","并查集","图","哈希表"]],"2841712876":[["Linked List"],["链表"]],"2841881996":[["Array","Simulation"],["数组","模拟"]],"2844126076":[["Array"],["数组"]],"2844316244":[["Array","Sorting"],["数组","排序"]],"2844666696":[["Math","String"],["数学","字符串"]],"2844670670":[["Stack","Array","Simulation"],["栈","数组","模拟"]],"2844675085":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"2845488076":[["String","Dynamic Programming"],["字符串","动态规划"]],"2845865407":[["Stack","Design","Linked List"],["栈","设计","链表"]],"2845929476":[["Array","String","Binary Search","Interactive"],["数组","字符串","二分查找","交互"]],"284708083":[["Bit Manipulation","Array","Dynamic Programming","Bitmask"],["位运算","数组","动态规划","状态压缩"]],"2850260537":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2851269000":[["Depth-First Search","Breadth-First Search","Graph","Dynamic Programming"],["深度优先搜索","广度优先搜索","图","动态规划"]],"2853983730":[["Linked List","Math","Two Pointers"],["链表","数学","双指针"]],"2855675520":[["Greedy","Array","Sorting","Heap (Priority Queue)"],["贪心","数组","排序","堆（优先队列）"]],"2856501208":[["Greedy","Array","Hash Table","Counting","Sorting","Heap (Priority Queue)"],["贪心","数组","哈希表","计数","排序","堆（优先队列）"]],"2857257236":[["Database"],["数据库"]],"2857979415":[["Array","Math","String","Game Theory","Interactive"],["数组","数学","字符串","博弈","交互"]],"2858385254":[["Database"],["数据库"]],"2860419980":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"2860632733":[["Array","Dynamic Programming"],["数组","动态规划"]],"286069565":[["Array","String","Sorting"],["数组","字符串","排序"]],"2860849459":[["Graph","Array","String","Shortest Path"],["图","数组","字符串","最短路"]],"2862855056":[["Array","Math","Binary Search","Prefix Sum"],["数组","数学","二分查找","前缀和"]],"286585708":[["Binary Indexed Tree","Segment Tree","Array","Binary Search","Divide and Conquer","Ordered Set","Merge Sort"],["树状数组","线段树","数组","二分查找","分治","有序集合","归并排序"]],"2867135222":[["Memoization","Array","Dynamic Programming"],["记忆化搜索","数组","动态规划"]],"286718649":[["Array","Two Pointers"],["数组","双指针"]],"2868656571":[["Array","Hash Table","Math","Sliding Window"],["数组","哈希表","数学","滑动窗口"]],"2871847316":[["Stack","String"],["栈","字符串"]],"2874032831":[["Design","Array","Counting","Iterator"],["设计","数组","计数","迭代器"]],"2875235685":[["Array","Hash Table","Math","Matrix"],["数组","哈希表","数学","矩阵"]],"2875388393":[["Breadth-First Search","Graph","Array","Matrix","Shortest Path","Heap (Priority Queue)"],["广度优先搜索","图","数组","矩阵","最短路","堆（优先队列）"]],"2877331205":[["Bit Manipulation","Hash Table","String"],["位运算","哈希表","字符串"]],"2880212557":[["Depth-First Search","Breadth-First Search","Union Find","Array","Hash Table","String"],["深度优先搜索","广度优先搜索","并查集","数组","哈希表","字符串"]],"2882449995":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"288305998":[["Greedy","String"],["贪心","字符串"]],"2885795135":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2887178574":[["Geometry","Array","Hash Table","Math","Binary Search","Sorting"],["几何","数组","哈希表","数学","二分查找","排序"]],"2887492330":[["Greedy","String","Prefix Sum"],["贪心","字符串","前缀和"]],"2887872471":[["Tree","Depth-First Search","Array","Dynamic Programming"],["树","深度优先搜索","数组","动态规划"]],"2887915717":[["Geometry","Array","Hash Table","Math","Enumeration"],["几何","数组","哈希表","数学","枚举"]],"288912613":[["Array","String","Backtracking","Simulation"],["数组","字符串","回溯","模拟"]],"2889905668":[["Greedy","Math"],["贪心","数学"]],"2890033615":[["Two Pointers","String"],["双指针","字符串"]],"289054660":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"2890702645":[["Array","Sliding Window"],["数组","滑动窗口"]],"2891293644":[["Array","Hash Table","Counting","Sorting"],["数组","哈希表","计数","排序"]],"2893112489":[["Hash Table","String","Hash Function","Rolling Hash"],["哈希表","字符串","哈希函数","滚动哈希"]],"2893302110":[null,null],"2894413444":[["Array","Counting"],["数组","计数"]],"2894984014":[["Array","Binary Search"],["数组","二分查找"]],"2896936333":[["Bit Manipulation","Array","Backtracking","Enumeration"],["位运算","数组","回溯","枚举"]],"2899114132":[["Union Find","Array","Hash Table"],["并查集","数组","哈希表"]],"2900835893":[["Backtracking"],["回溯"]],"290394387":[["Array","Two Pointers","Simulation"],["数组","双指针","模拟"]],"2904534885":[["Greedy","Array","Hash Table"],["贪心","数组","哈希表"]],"290469472":[["Math","String","Simulation"],["数学","字符串","模拟"]],"2906372689":[["Breadth-First Search","Graph","Array","Matrix","Shortest Path","Heap (Priority Queue)"],["广度优先搜索","图","数组","矩阵","最短路","堆（优先队列）"]],"2906626601":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2907430999":[["Array","Dynamic Programming"],["数组","动态规划"]],"2907477166":[["Array","Hash Table","Math"],["数组","哈希表","数学"]],"2908043044":[["Array","Interactive","Simulation"],["数组","交互","模拟"]],"2908242202":[["Bit Manipulation","Array","Dynamic Programming"],["位运算","数组","动态规划"]],"2910887198":[["Database"],["数据库"]],"2912571228":[["Array","Math","Dynamic Programming","Probability and Statistics"],["数组","数学","动态规划","概率与统计"]],"2912901265":[["Array","Hash Table","String","Sorting"],["数组","哈希表","字符串","排序"]],"2913358439":[["Array","Hash Table","Two Pointers","Binary Search"],["数组","哈希表","双指针","二分查找"]],"2914198967":[["Stack","Greedy","String","Backtracking"],["栈","贪心","字符串","回溯"]],"2919642920":[["Tree","Depth-First Search","Binary Search Tree","Dynamic Programming","Binary Tree"],["树","深度优先搜索","二叉搜索树","动态规划","二叉树"]],"2921275572":[["Trie","Array","Hash Table","String","Hash Function"],["字典树","数组","哈希表","字符串","哈希函数"]],"2921363389":[["Array","Hash Table","Binary Search","Dynamic Programming","Sorting"],["数组","哈希表","二分查找","动态规划","排序"]],"2922912159":[["Hash Table","String","Divide and Conquer","Sliding Window"],["哈希表","字符串","分治","滑动窗口"]],"2923349215":[["Array","Hash Table","Counting","Matrix"],["数组","哈希表","计数","矩阵"]],"2923893711":[["Design","Trie","Hash Table","String"],["设计","字典树","哈希表","字符串"]],"2924722129":[["Database"],["数据库"]],"2925535868":[["Union Find","Array","Matrix"],["并查集","数组","矩阵"]],"292566381":[["Tree","Breadth-First Search","Binary Tree"],["树","广度优先搜索","二叉树"]],"2927708041":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"2929435421":[["Design","Segment Tree","Binary Search","Ordered Set"],["设计","线段树","二分查找","有序集合"]],"2929737515":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2931755222":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"2936931094":[["Array","Math","Two Pointers","String","Game Theory"],["数组","数学","双指针","字符串","博弈"]],"2937149161":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"2937224937":[["Array","Math","Matrix","Simulation"],["数组","数学","矩阵","模拟"]],"2938025699":[["Greedy","Array","Hash Table","Sorting","Sliding Window","Heap (Priority Queue)"],["贪心","数组","哈希表","排序","滑动窗口","堆（优先队列）"]],"2938169108":[["String"],["字符串"]],"2939618078":[["Array","Hash Table","String","Counting","Sorting"],["数组","哈希表","字符串","计数","排序"]],"2939895760":[["Bit Manipulation","Trie","Array"],["位运算","字典树","数组"]],"2940442922":[["String","Backtracking"],["字符串","回溯"]],"2941821802":[["Two Pointers","String"],["双指针","字符串"]],"2941915891":[["Stack","String"],["栈","字符串"]],"2942569006":[["Shell"],[""]],"2942833315":[["Union Find","Array","Matrix"],["并查集","数组","矩阵"]],"2945497882":[["Array","Math","Matrix"],["数组","数学","矩阵"]],"2945726008":[["Array","Sorting","Heap (Priority Queue)"],["数组","排序","堆（优先队列）"]],"2945975892":[["Depth-First Search","Breadth-First Search","Graph","Array","String","Matrix","Shortest Path","Heap (Priority Queue)"],["深度优先搜索","广度优先搜索","图","数组","字符串","矩阵","最短路","堆（优先队列）"]],"2946534771":[["String"],["字符串"]],"2948030094":[["Math"],["数学"]],"2948668320":[["Design","Queue","Array","Math","Data Stream"],["设计","队列","数组","数学","数据流"]],"2949409019":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"2950336182":[["Math","Backtracking"],["数学","回溯"]],"295088238":[["Design","Queue","Array","Data Stream"],["设计","队列","数组","数据流"]],"2956439807":[["Graph","Shortest Path","Heap (Priority Queue)"],["图","最短路","堆（优先队列）"]],"2957762475":[["Bit Manipulation","Array","Hash Table","Math","Binary Search","Sorting"],["位运算","数组","哈希表","数学","二分查找","排序"]],"296151509":[["Greedy","Array","Matrix","Prefix Sum"],["贪心","数组","矩阵","前缀和"]],"2962478235":[["String"],["字符串"]],"2963413938":[["Bit Manipulation","Graph","Dynamic Programming","Bitmask"],["位运算","图","动态规划","状态压缩"]],"2964379464":[["Database"],["数据库"]],"2964689219":[["Tree","Depth-First Search","Breadth-First Search","Hash Table","Counting"],["树","深度优先搜索","广度优先搜索","哈希表","计数"]],"2965139328":[["Stack","String"],["栈","字符串"]],"296740468":[["Array","Binary Search","Prefix Sum","Sliding Window"],["数组","二分查找","前缀和","滑动窗口"]],"2967621636":[["Array","Dynamic Programming","Heap (Priority Queue)"],["数组","动态规划","堆（优先队列）"]],"2970227389":[["Math"],["数学"]],"2970771602":[["Stack","Array","Simulation"],["栈","数组","模拟"]],"2972412900":[["Array","Simulation"],["数组","模拟"]],"2972764344":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"2974872053":[["Database"],["数据库"]],"2975776867":[["String"],["字符串"]],"2976472096":[["Array","Backtracking","Matrix"],["数组","回溯","矩阵"]],"2977235574":[["Greedy","Array","Hash Table","String","Counting"],["贪心","数组","哈希表","字符串","计数"]],"2980355580":[["Array","Simulation"],["数组","模拟"]],"2981004463":[["Array","Math","Counting","Number Theory"],["数组","数学","计数","数论"]],"298215454":[["Array","String","Dynamic Programming"],["数组","字符串","动态规划"]],"2982198446":[["Linked List","Two Pointers"],["链表","双指针"]],"2986133546":[["Binary Indexed Tree","Array","Ordered Set","Sliding Window"],["树状数组","数组","有序集合","滑动窗口"]],"298794774":[["Bit Manipulation","Array","String"],["位运算","数组","字符串"]],"2988189921":[["Greedy","Math"],["贪心","数学"]],"2988782714":[["Array","Math","Dynamic Programming","Combinatorics"],["数组","数学","动态规划","组合数学"]],"2993182441":[["Hash Table","Linked List","Two Pointers"],["哈希表","链表","双指针"]],"2994488407":[["Database"],["数据库"]],"29974146":[["Database"],["数据库"]],"2997800679":[["Bit Manipulation","Array","Dynamic Programming","Bitmask"],["位运算","数组","动态规划","状态压缩"]],"3000728502":[["Design","Trie","Hash Table","String"],["设计","字典树","哈希表","字符串"]],"3006111591":[["Stack","Recursion","Linked List","Two Pointers"],["栈","递归","链表","双指针"]],"3006434957":[["Math","String"],["数学","字符串"]],"3007102778":[["Math"],["数学"]],"3008054233":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"300846689":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"3008885805":[["Bit Manipulation","Array"],["位运算","数组"]],"3009824135":[["Database"],["数据库"]],"3010901510":[["Bit Manipulation","Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["位运算","树","深度优先搜索","广度优先搜索","二叉树"]],"3011717282":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"3012034950":[["Union Find","Graph","Minimum Spanning Tree"],["并查集","图","最小生成树"]],"3012401904":[["Greedy","Math","String"],["贪心","数学","字符串"]],"3013367275":[["String","Sliding Window"],["字符串","滑动窗口"]],"3014957498":[["Greedy","String"],["贪心","字符串"]],"3015354306":[["Graph","Array","Two Pointers","Binary Search","Sorting"],["图","数组","双指针","二分查找","排序"]],"301567212":[["Greedy","Array","Sorting","Heap (Priority Queue)"],["贪心","数组","排序","堆（优先队列）"]],"3016140328":[["Database"],["数据库"]],"301734990":[["Greedy","Array","Two Pointers","Sorting"],["贪心","数组","双指针","排序"]],"301753506":[["Database"],["数据库"]],"3020603346":[["Graph","Topological Sort","Dynamic Programming","Shortest Path"],["图","拓扑排序","动态规划","最短路"]],"3021409572":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"3021563284":[["Bit Manipulation","Array","Divide and Conquer","Matrix","Prefix Sum","Quickselect","Heap (Priority Queue)"],["位运算","数组","分治","矩阵","前缀和","快速选择","堆（优先队列）"]],"3022128117":[["Array","Math","String","Sorting"],["数组","数学","字符串","排序"]],"3022905195":[["Database"],["数据库"]],"3023056451":[["Array","Hash Table","Math","Simulation"],["数组","哈希表","数学","模拟"]],"3023068102":[["Stack","Array","Dynamic Programming","Matrix","Monotonic Stack"],["栈","数组","动态规划","矩阵","单调栈"]],"3023386017":[["Array","Math","String","Binary Search","Dynamic Programming"],["数组","数学","字符串","二分查找","动态规划"]],"3024031273":[["Breadth-First Search","Memoization","Dynamic Programming"],["广度优先搜索","记忆化搜索","动态规划"]],"3026486305":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"3029042062":[["Array","Two Pointers","Simulation"],["数组","双指针","模拟"]],"3030939616":[["Database"],["数据库"]],"3033578529":[["Greedy","Hash Table","String","Counting","Sorting","Heap (Priority Queue)"],["贪心","哈希表","字符串","计数","排序","堆（优先队列）"]],"3033778664":[["Math","String","Simulation"],["数学","字符串","模拟"]],"3036629795":[["Database"],["数据库"]],"3036702868":[["Array","Hash Table","Math","Number Theory"],["数组","哈希表","数学","数论"]],"3037047822":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"303821987":[["Array"],["数组"]],"3039372847":[["Tree","Array","Hash Table","Divide and Conquer","Binary Tree"],["树","数组","哈希表","分治","二叉树"]],"3039695626":[["Tree","Depth-First Search","String","Backtracking","Binary Tree"],["树","深度优先搜索","字符串","回溯","二叉树"]],"3042113223":[["Depth-First Search","Breadth-First Search","Union Find","Hash Table","Hash Function"],["深度优先搜索","广度优先搜索","并查集","哈希表","哈希函数"]],"3042599528":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"3042739559":[["Hash Table","String","Sorting"],["哈希表","字符串","排序"]],"3044209556":[["Array"],["数组"]],"3048586035":[["Array","Prefix Sum","Simulation"],["数组","前缀和","模拟"]],"3050888295":[["String","Simulation"],["字符串","模拟"]],"3052741649":[["Array","Math","Simulation"],["数组","数学","模拟"]],"3052763610":[["Database"],["数据库"]],"3054721758":[["Hash Table","String"],["哈希表","字符串"]],"3054917007":[["Database"],["数据库"]],"305518406":[["Array","Hash Table","Counting","Sorting"],["数组","哈希表","计数","排序"]],"3057194499":[["Array"],["数组"]],"3057254301":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"3057587548":[["Stack","Greedy","Array","Monotonic Stack"],["栈","贪心","数组","单调栈"]],"305762053":[["Array","Dynamic Programming"],["数组","动态规划"]],"305789656":[["String","String Matching"],["字符串","字符串匹配"]],"3058790867":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"3059718647":[["Array","Math"],["数组","数学"]],"3061824471":[["Greedy","String","Backtracking","Counting","Enumeration"],["贪心","字符串","回溯","计数","枚举"]],"3063296642":[["Greedy","Array","Two Pointers","Sorting"],["贪心","数组","双指针","排序"]],"3065232387":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"3065742618":[["Array","Hash Table","Enumeration"],["数组","哈希表","枚举"]],"306595116":[["Array","Binary Search"],["数组","二分查找"]],"3066842082":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"3067908479":[["Stack","Greedy","Hash Table","String"],["栈","贪心","哈希表","字符串"]],"3071090507":[["Array","Backtracking","Matrix"],["数组","回溯","矩阵"]],"3071565639":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"3072879804":[["Binary Indexed Tree","Segment Tree","Array","Binary Search","Divide and Conquer","Ordered Set","Merge Sort"],["树状数组","线段树","数组","二分查找","分治","有序集合","归并排序"]],"3073027638":[["Stack","Array","Simulation"],["栈","数组","模拟"]],"3073583780":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"3074518984":[["Bit Manipulation","Trie","Array","Hash Table","Sliding Window"],["位运算","字典树","数组","哈希表","滑动窗口"]],"3074557522":[null,null],"3075022101":[["Database"],["数据库"]],"3077002187":[["Array"],["数组"]],"3077217367":[["Memoization","Dynamic Programming"],["记忆化搜索","动态规划"]],"3077259720":[["Breadth-First Search"],["广度优先搜索"]],"307769453":[["Array","Hash Table","Binary Search","Prefix Sum","Sliding Window"],["数组","哈希表","二分查找","前缀和","滑动窗口"]],"3078556108":[["Bit Manipulation","Memoization","Math","Dynamic Programming","Bitmask","Game Theory"],["位运算","记忆化搜索","数学","动态规划","状态压缩","博弈"]],"3078609754":[["Math","Number Theory"],["数学","数论"]],"3081794904":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"3082325802":[["Stack","Tree","String","Binary Tree"],["栈","树","字符串","二叉树"]],"3085208156":[["Database"],["数据库"]],"3087387634":[["Design","Trie","Hash Table","String"],["设计","字典树","哈希表","字符串"]],"3089019377":[null,null],"3091785544":[["String"],["字符串"]],"3092398094":[["Greedy","String"],["贪心","字符串"]],"3092850192":[null,null],"3094069966":[["Database"],["数据库"]],"3094793771":[["Math","Binary Search"],["数学","二分查找"]],"3098562302":[["Array","Matrix","Prefix Sum"],["数组","矩阵","前缀和"]],"3098982613":[["String"],["字符串"]],"3100993645":[["Linked List"],["链表"]],"3102719435":[["Array","Hash Table","Enumeration","Sorting"],["数组","哈希表","枚举","排序"]],"3102780834":[["Greedy","Array"],["贪心","数组"]],"3104122930":[["Bit Manipulation","Array","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","动态规划","回溯","状态压缩"]],"3104482374":[["Bit Manipulation","Array","Hash Table"],["位运算","数组","哈希表"]],"3105635512":[["Math"],["数学"]],"3105899717":[["Design","Trie","Hash Table","String"],["设计","字典树","哈希表","字符串"]],"3111378170":[["Database"],["数据库"]],"3116000782":[["Database"],["数据库"]],"3117661899":[["Array","Hash Table"],["数组","哈希表"]],"3118022376":[null,null],"3118895370":[["Depth-First Search","Breadth-First Search","Array","Dynamic Programming","Matrix"],["深度优先搜索","广度优先搜索","数组","动态规划","矩阵"]],"3119137809":[["Greedy","Array"],["贪心","数组"]],"3119606051":[["Greedy","Array"],["贪心","数组"]],"3121754844":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"3123299347":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"3123575090":[["Array","Hash Table","Counting","Sliding Window"],["数组","哈希表","计数","滑动窗口"]],"3124896474":[["Array","Hash Table","Prefix Sum","Sliding Window"],["数组","哈希表","前缀和","滑动窗口"]],"3126143245":[["Binary Indexed Tree","Segment Tree","Array","Binary Search","Divide and Conquer","Ordered Set","Merge Sort"],["树状数组","线段树","数组","二分查找","分治","有序集合","归并排序"]],"3126153106":[["Bit Manipulation"],["位运算"]],"3128004049":[["Geometry","Array","Math"],["几何","数组","数学"]],"3130296264":[["Array","Bucket Sort","Radix Sort","Sorting"],["数组","桶排序","基数排序","排序"]],"3134274088":[["Stack","Array","Matrix","Monotonic Stack"],["栈","数组","矩阵","单调栈"]],"3135227116":[["Math"],["数学"]],"3135662522":[["Hash Table","Math","String"],["哈希表","数学","字符串"]],"3136260573":[["Two Pointers","String"],["双指针","字符串"]],"3137406326":[["Array","Hash Table"],["数组","哈希表"]],"3139221174":[["Depth-First Search","Breadth-First Search","Graph","Backtracking"],["深度优先搜索","广度优先搜索","图","回溯"]],"3143101757":[["Array","Hash Table","String","Sorting","Heap (Priority Queue)"],["数组","哈希表","字符串","排序","堆（优先队列）"]],"3144113364":[["Tree","Breadth-First Search","Binary Tree"],["树","广度优先搜索","二叉树"]],"3147357769":[["Two Pointers","String"],["双指针","字符串"]],"3147772108":[["Stack","Array","Prefix Sum","Monotonic Stack"],["栈","数组","前缀和","单调栈"]],"3148467486":[["Array","Sorting","Simulation","Heap (Priority Queue)"],["数组","排序","模拟","堆（优先队列）"]],"3152421262":[["Tree","Array","Hash Table","Divide and Conquer","Binary Tree"],["树","数组","哈希表","分治","二叉树"]],"3153044061":[["Depth-First Search","Breadth-First Search","Union Find","Array","Hash Table","String"],["深度优先搜索","广度优先搜索","并查集","数组","哈希表","字符串"]],"315307043":[["Breadth-First Search","Array","Binary Search","Matrix"],["广度优先搜索","数组","二分查找","矩阵"]],"3153125580":[["String"],["字符串"]],"31547081":[["Recursion","Linked List"],["递归","链表"]],"3156996757":[["Array","Hash Table","String","Simulation"],["数组","哈希表","字符串","模拟"]],"315817700":[["String"],["字符串"]],"3158353268":[["Array","Math","Matrix","Number Theory"],["数组","数学","矩阵","数论"]],"3158438690":[["Array","Prefix Sum"],["数组","前缀和"]],"3158785397":[["Hash Table","Linked List"],["哈希表","链表"]],"3163189151":[["Bit Manipulation","Trie","Array","Hash Table"],["位运算","字典树","数组","哈希表"]],"3164365433":[["Two Pointers","String"],["双指针","字符串"]],"3165325622":[["Stack","String"],["栈","字符串"]],"3167447804":[null,null],"3167797510":[["Bit Manipulation","Math","String","Simulation"],["位运算","数学","字符串","模拟"]],"3168538687":[["Database"],["数据库"]],"3168618130":[["Math"],["数学"]],"3168914756":[["Greedy","Trie","Array","String","Sorting"],["贪心","字典树","数组","字符串","排序"]],"3169129420":[["Stack","Design","Queue"],["栈","设计","队列"]],"3177194252":[["String","Simulation"],["字符串","模拟"]],"3178253488":[["Array","Hash Table","Backtracking","Matrix"],["数组","哈希表","回溯","矩阵"]],"3179731139":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"3180919205":[["Design","Segment Tree","Math","Ordered Set"],["设计","线段树","数学","有序集合"]],"3181284261":[["Dynamic Programming"],["动态规划"]],"3182582646":[["Array","Hash Table"],["数组","哈希表"]],"3183111073":[["Stack","String"],["栈","字符串"]],"3183288856":[["Array","Sorting","Sliding Window"],["数组","排序","滑动窗口"]],"3183331658":[["Array","Math"],["数组","数学"]],"3183792133":[["Array","Math","Dynamic Programming","Combinatorics","Number Theory"],["数组","数学","动态规划","组合数学","数论"]],"318431049":[["Database"],["数据库"]],"3184596428":[["Stack","Array","Two Pointers","Binary Search","Monotonic Stack"],["栈","数组","双指针","二分查找","单调栈"]],"3184774485":[["Array","Binary Search"],["数组","二分查找"]],"3187405082":[["Breadth-First Search","Graph","Prefix Sum"],["广度优先搜索","图","前缀和"]],"3188904029":[["Queue","Array","Ordered Set","Sliding Window","Monotonic Queue","Heap (Priority Queue)"],["队列","数组","有序集合","滑动窗口","单调队列","堆（优先队列）"]],"3189584402":[["Bit Manipulation","Array","Counting","Sorting"],["位运算","数组","计数","排序"]],"3189918628":[["Linked List"],["链表"]],"31900963":[["Array","Hash Table","Two Pointers","Sorting"],["数组","哈希表","双指针","排序"]],"3193935538":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"319427731":[["Depth-First Search","Breadth-First Search","Union Find","Array","Binary Search","Matrix","Heap (Priority Queue)"],["深度优先搜索","广度优先搜索","并查集","数组","二分查找","矩阵","堆（优先队列）"]],"3194441729":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"3194493363":[["Array","String","Dynamic Programming"],["数组","字符串","动态规划"]],"3196334031":[["Greedy","Dynamic Programming"],["贪心","动态规划"]],"3197252162":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"3197325121":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"3199967964":[["String","Enumeration"],["字符串","枚举"]],"3201195359":[["Bit Manipulation","Array","Dynamic Programming","Bitmask"],["位运算","数组","动态规划","状态压缩"]],"3202447407":[["Tree","Depth-First Search","Array","Binary Tree"],["树","深度优先搜索","数组","二叉树"]],"320329751":[["String","Binary Search","Dynamic Programming","Suffix Array","Hash Function","Rolling Hash"],["字符串","二分查找","动态规划","后缀数组","哈希函数","滚动哈希"]],"3203568204":[["Database"],["数据库"]],"3205928742":[["Binary Indexed Tree","Segment Tree","Array"],["树状数组","线段树","数组"]],"3210489850":[["Array","Binary Search","Matrix"],["数组","二分查找","矩阵"]],"3210707661":[["Two Pointers","String"],["双指针","字符串"]],"3211790430":[["Array","Hash Table","String","Sorting"],["数组","哈希表","字符串","排序"]],"3214093273":[["Recursion","Linked List"],["递归","链表"]],"3214600049":[["Greedy","Bit Manipulation","Array","Hash Table"],["贪心","位运算","数组","哈希表"]],"3216210693":[["Array","Enumeration"],["数组","枚举"]],"3216682975":[["Stack","Array"],["栈","数组"]],"3219095278":[["Database"],["数据库"]],"3219158198":[["Two Pointers","String","String Matching"],["双指针","字符串","字符串匹配"]],"3221082803":[["Two Pointers","String","Dynamic Programming"],["双指针","字符串","动态规划"]],"3221190981":[["Array","Binary Search"],["数组","二分查找"]],"3221222128":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"3223207411":[["Tree","Binary Search Tree","Binary Tree"],["树","二叉搜索树","二叉树"]],"322371543":[null,null],"3226814527":[null,null],"3228686257":[["Greedy","Array","Hash Table"],["贪心","数组","哈希表"]],"3229303052":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"3230369611":[["Hash Table","String","Dynamic Programming"],["哈希表","字符串","动态规划"]],"3231265233":[["Array","Dynamic Programming"],["数组","动态规划"]],"3231924477":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"3233473889":[["Database"],["数据库"]],"3235710031":[["Depth-First Search","Union Find","Array"],["深度优先搜索","并查集","数组"]],"3235832569":[["Queue","Hash Table","String","Counting"],["队列","哈希表","字符串","计数"]],"3236532355":[["Database"],["数据库"]],"3237331717":[["Recursion","Math"],["递归","数学"]],"3237851921":[["Array","Heap (Priority Queue)"],["数组","堆（优先队列）"]],"324121992":[["Array","Sliding Window"],["数组","滑动窗口"]],"3241642216":[["Bit Manipulation"],["位运算"]],"3241798110":[["Hash Table","Linked List","Two Pointers"],["哈希表","链表","双指针"]],"3241941552":[["Stack","Recursion","Math","String"],["栈","递归","数学","字符串"]],"3243357093":[["Linked List","Two Pointers"],["链表","双指针"]],"3243386336":[["Database"],["数据库"]],"3243872254":[["Array","Hash Table","Matrix"],["数组","哈希表","矩阵"]],"3246372293":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"3246928465":[["Greedy","Array","Ordered Set","Heap (Priority Queue)"],["贪心","数组","有序集合","堆（优先队列）"]],"3248412457":[["Greedy","Graph","Sorting","Heap (Priority Queue)"],["贪心","图","排序","堆（优先队列）"]],"324872429":[["Math","Enumeration","Number Theory"],["数学","枚举","数论"]],"3248742764":[["Array","Dynamic Programming"],["数组","动态规划"]],"3248828921":[["Tree","Binary Search Tree","Binary Tree"],["树","二叉搜索树","二叉树"]],"3250155411":[["String","Sliding Window"],["字符串","滑动窗口"]],"3250523305":[["Array","Binary Search","Sorting","Line Sweep","Heap (Priority Queue)"],["数组","二分查找","排序","扫描线","堆（优先队列）"]],"3250902571":[["Array","Two Pointers"],["数组","双指针"]],"3254374161":[["Array","Hash Table","Sorting","Heap (Priority Queue)"],["数组","哈希表","排序","堆（优先队列）"]],"3256507952":[["Greedy","Array","Math","Sorting"],["贪心","数组","数学","排序"]],"3257900717":[["Array","Dynamic Programming"],["数组","动态规划"]],"3259259158":[["Math","Dynamic Programming","Sliding Window","Probability and Statistics"],["数学","动态规划","滑动窗口","概率与统计"]],"3259782681":[["Stack","Math","String"],["栈","数学","字符串"]],"3261146465":[["Tree","Dynamic Programming","Binary Tree"],["树","动态规划","二叉树"]],"3261672467":[["Greedy","Array","Dynamic Programming","Sorting"],["贪心","数组","动态规划","排序"]],"3263150913":[["Tree","Dynamic Programming","Binary Tree"],["树","动态规划","二叉树"]],"3263342549":[["Hash Table","Math","Dynamic Programming","Heap (Priority Queue)"],["哈希表","数学","动态规划","堆（优先队列）"]],"3263418042":[["String"],["字符串"]],"3263594037":[["Queue","Array","Divide and Conquer","Dynamic Programming","Monotonic Queue"],["队列","数组","分治","动态规划","单调队列"]],"3267047320":[["Array","Dynamic Programming"],["数组","动态规划"]],"3268382520":[["Tree","Depth-First Search","Array","Hash Table","Binary Tree"],["树","深度优先搜索","数组","哈希表","二叉树"]],"3270667849":[["Array","Divide and Conquer","Dynamic Programming"],["数组","分治","动态规划"]],"3272610079":[["Array","Two Pointers","Matrix"],["数组","双指针","矩阵"]],"3275619185":[["Array","Math"],["数组","数学"]],"3281498525":[["Design","Heap (Priority Queue)"],["设计","堆（优先队列）"]],"3282812734":[["Stack","Math","Simulation"],["栈","数学","模拟"]],"3283031002":[["Database"],["数据库"]],"3283376524":[["Database"],["数据库"]],"32848909":[["Array","Two Pointers","String"],["数组","双指针","字符串"]],"328764621":[["String","String Matching","Hash Function","Rolling Hash"],["字符串","字符串匹配","哈希函数","滚动哈希"]],"3288770916":[["Stack","Greedy","String"],["栈","贪心","字符串"]],"3290623649":[["String"],["字符串"]],"3292003032":[["Design","Two Pointers","Data Stream","Sorting","Heap (Priority Queue)"],["设计","双指针","数据流","排序","堆（优先队列）"]],"3292459840":[["Design","Trie","Hash Table","String"],["设计","字典树","哈希表","字符串"]],"3292775470":[["Array","Dynamic Programming"],["数组","动态规划"]],"3292810974":[["Array","Hash Table","String","Sorting"],["数组","哈希表","字符串","排序"]],"3294328613":[["Bit Manipulation","Array","Hash Table","Math","Binary Search"],["位运算","数组","哈希表","数学","二分查找"]],"3298734473":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"3300902320":[["Array"],["数组"]],"3301142471":[["Array","Binary Search","Divide and Conquer","Matrix"],["数组","二分查找","分治","矩阵"]],"3302229375":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"3302467434":[["Hash Table","String","Counting","Prefix Sum"],["哈希表","字符串","计数","前缀和"]],"3302810206":[null,null],"3304159418":[["Tree","Depth-First Search","String","Binary Tree"],["树","深度优先搜索","字符串","二叉树"]],"3307683900":[["Breadth-First Search","String"],["广度优先搜索","字符串"]],"3308257979":[["Trie","Array","Hash Table","String","String Matching"],["字典树","数组","哈希表","字符串","字符串匹配"]],"330899243":[["Greedy","Array","Matrix"],["贪心","数组","矩阵"]],"3309137757":[["Array","Dynamic Programming"],["数组","动态规划"]],"3309376526":[["Bit Manipulation","Array"],["位运算","数组"]],"3312226061":[["Greedy","Array","String","Dynamic Programming"],["贪心","数组","字符串","动态规划"]],"3313294758":[["Array","Dynamic Programming"],["数组","动态规划"]],"3314430913":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"3314612233":[["Bit Manipulation","Array","Backtracking"],["位运算","数组","回溯"]],"3315363657":[["Greedy","Array","Two Pointers","Dynamic Programming"],["贪心","数组","双指针","动态规划"]],"3315441800":[["Array","Dynamic Programming"],["数组","动态规划"]],"3315472808":[["Bit Manipulation","Hash Table","String","Prefix Sum"],["位运算","哈希表","字符串","前缀和"]],"3317643285":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"3319568401":[["Database"],["数据库"]],"3320085335":[["Bit Manipulation","String","Backtracking"],["位运算","字符串","回溯"]],"3320294201":[["Stack","Design","Queue"],["栈","设计","队列"]],"3321963457":[["Geometry","Array","Math","Matrix","Sorting"],["几何","数组","数学","矩阵","排序"]],"3325416067":[["String","String Matching"],["字符串","字符串匹配"]],"3328810166":[["Math","String","Simulation"],["数学","字符串","模拟"]],"3329709268":[["Array","Sorting","Heap (Priority Queue)"],["数组","排序","堆（优先队列）"]],"3331711837":[["Breadth-First Search","Hash Table","String","Backtracking"],["广度优先搜索","哈希表","字符串","回溯"]],"3332596820":[null,null],"3334241084":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"3334808342":[["Array","Hash Table","Math","Counting","Number Theory"],["数组","哈希表","数学","计数","数论"]],"333630853":[["Tree","Depth-First Search","Breadth-First Search"],["树","深度优先搜索","广度优先搜索"]],"333667858":[["Array","Hash Table","String","Backtracking"],["数组","哈希表","字符串","回溯"]],"3336959867":[["Hash Table","String","Dynamic Programming"],["哈希表","字符串","动态规划"]],"3337273246":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"3337589064":[["Design","Queue","Monotonic Queue"],["设计","队列","单调队列"]],"3340682501":[["Database"],["数据库"]],"3340717494":[["Database"],["数据库"]],"3341470372":[["Tree","Breadth-First Search","Design","Binary Tree"],["树","广度优先搜索","设计","二叉树"]],"3343040098":[["Array","Hash Table","String","Counting","Prefix Sum"],["数组","哈希表","字符串","计数","前缀和"]],"3344221047":[["String","Dynamic Programming","Backtracking"],["字符串","动态规划","回溯"]],"3346548045":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"334656901":[["Array"],["数组"]],"3347724858":[["Array","Binary Search","Prefix Sum","Simulation"],["数组","二分查找","前缀和","模拟"]],"3348324694":[["Array","Divide and Conquer","Quickselect","Sorting","Heap (Priority Queue)"],["数组","分治","快速选择","排序","堆（优先队列）"]],"3348466517":[["Array"],["数组"]],"3348570525":[["Linked List","Two Pointers"],["链表","双指针"]],"3350592310":[["String"],["字符串"]],"3351145874":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"335140403":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"3353015937":[["Tree","Depth-First Search","Breadth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","广度优先搜索","哈希表","二叉树"]],"3354310865":[["String"],["字符串"]],"3354474202":[["Hash Table","Linked List","Two Pointers"],["哈希表","链表","双指针"]],"335486990":[["String"],["字符串"]],"3355469687":[["Bit Manipulation","Array","Sliding Window"],["位运算","数组","滑动窗口"]],"3355865266":[["Two Pointers","String"],["双指针","字符串"]],"3357587389":[["Array","Hash Table","Matrix"],["数组","哈希表","矩阵"]],"3357632986":[["Bit Manipulation","Array","Backtracking"],["位运算","数组","回溯"]],"3363218765":[["Two Pointers","String"],["双指针","字符串"]],"3363685518":[["Array","Hash Table"],["数组","哈希表"]],"3363896578":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"336413363":[["Math","Binary Search"],["数学","二分查找"]],"3364926717":[["Math"],["数学"]],"3365665787":[["Database"],["数据库"]],"3369476122":[["String","Dynamic Programming"],["字符串","动态规划"]],"3370131507":[["Array"],["数组"]],"3370261058":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"3371445858":[["Math"],["数学"]],"3372525938":[["Array","Two Pointers","Binary Search"],["数组","双指针","二分查找"]],"3374028315":[["Database"],["数据库"]],"337441895":[["Array","Binary Search","Sorting"],["数组","二分查找","排序"]],"3375593429":[["Array","Hash Table","Enumeration"],["数组","哈希表","枚举"]],"3375672025":[["Stack","Array","Simulation"],["栈","数组","模拟"]],"3376280260":[["Tree","Depth-First Search","Binary Search Tree","Dynamic Programming","Binary Tree"],["树","深度优先搜索","二叉搜索树","动态规划","二叉树"]],"3376945874":[["Stack","Design","Hash Table","Heap (Priority Queue)"],["栈","设计","哈希表","堆（优先队列）"]],"3379746851":[["Math"],["数学"]],"3379897372":[["Array","Math"],["数组","数学"]],"3381061806":[["Graph","Trie","Array","String","Dynamic Programming","Shortest Path"],["图","字典树","数组","字符串","动态规划","最短路"]],"3382549811":[["Array","Sorting"],["数组","排序"]],"3383627644":[["Stack","String"],["栈","字符串"]],"3383805178":[["Tree","Depth-First Search","Design","Hash Table"],["树","深度优先搜索","设计","哈希表"]],"3386206172":[["Array","String Matching","Hash Function","Rolling Hash"],["数组","字符串匹配","哈希函数","滚动哈希"]],"3386255965":[["Greedy","Two Pointers","String"],["贪心","双指针","字符串"]],"3386498966":[["Array","String"],["数组","字符串"]],"338661942":[["Array","Math","Dynamic Programming","Backtracking","Combinatorics","Probability and Statistics"],["数组","数学","动态规划","回溯","组合数学","概率与统计"]],"3386819075":[["Hash Table","Math","String"],["哈希表","数学","字符串"]],"3387998069":[["Array","Hash Table","Prefix Sum","Sorting"],["数组","哈希表","前缀和","排序"]],"3389539253":[["Greedy","String","Sorting"],["贪心","字符串","排序"]],"3391560370":[["Hash Table","String"],["哈希表","字符串"]],"3396007304":[["Depth-First Search","Breadth-First Search","Graph","Backtracking"],["深度优先搜索","广度优先搜索","图","回溯"]],"3397262203":[null,null],"3397964824":[["Array","Sorting"],["数组","排序"]],"3398027261":[["Array","Enumeration"],["数组","枚举"]],"3400286463":[["Array"],["数组"]],"3402568700":[["Trie","Memoization","Array","Hash Table","String","Dynamic Programming","Backtracking"],["字典树","记忆化搜索","数组","哈希表","字符串","动态规划","回溯"]],"3403473925":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"340499017":[["Array","String"],["数组","字符串"]],"3405519099":[["Database"],["数据库"]],"340770494":[["Depth-First Search","Breadth-First Search","Union Find","Graph","Sorting"],["深度优先搜索","广度优先搜索","并查集","图","排序"]],"340860484":[["Tree","Depth-First Search","Breadth-First Search","Graph"],["树","深度优先搜索","广度优先搜索","图"]],"3410974541":[["Array","String","Prefix Sum"],["数组","字符串","前缀和"]],"3411465392":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"3412927472":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"3413400617":[["Greedy","Array","Backtracking","Sorting"],["贪心","数组","回溯","排序"]],"3421555360":[["Tree","Segment Tree","Binary Search Tree","Array","Binary Search","Binary Tree","Ordered Set"],["树","线段树","二叉搜索树","数组","二分查找","二叉树","有序集合"]],"3422315602":[["Array","Dynamic Programming","Prefix Sum"],["数组","动态规划","前缀和"]],"3423908263":[["Depth-First Search","Breadth-First Search","Graph"],["深度优先搜索","广度优先搜索","图"]],"3424505272":[["Tree","Depth-First Search","Graph","Dynamic Programming"],["树","深度优先搜索","图","动态规划"]],"3427404671":[["Array","Hash Table"],["数组","哈希表"]],"3429532354":[["Array","Sorting","Heap (Priority Queue)"],["数组","排序","堆（优先队列）"]],"343052836":[["Array"],["数组"]],"3430688223":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"3430988573":[["Array","Binary Search","Suffix Array","Hash Function","Rolling Hash"],["数组","二分查找","后缀数组","哈希函数","滚动哈希"]],"3431920158":[["Depth-First Search","Graph"],["深度优先搜索","图"]],"3432459628":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"3433288749":[["Array","Math","String","Sorting"],["数组","数学","字符串","排序"]],"3433602336":[["String","Dynamic Programming"],["字符串","动态规划"]],"3434976181":[["Array","Binary Search","Prefix Sum","Sliding Window"],["数组","二分查找","前缀和","滑动窗口"]],"3435556540":[["Greedy","Array","Math"],["贪心","数组","数学"]],"3437227213":[["Array","Hash Table"],["数组","哈希表"]],"3437839264":[["Two Pointers","String","Binary Search","String Matching","Hash Function","Rolling Hash"],["双指针","字符串","二分查找","字符串匹配","哈希函数","滚动哈希"]],"3438031469":[["Database"],["数据库"]],"3439053581":[["Database"],["数据库"]],"3439295659":[null,null],"3440205245":[["String"],["字符串"]],"3441921832":[["Greedy","Array","Two Pointers","Prefix Sum","Sorting","Heap (Priority Queue)"],["贪心","数组","双指针","前缀和","排序","堆（优先队列）"]],"3444219926":[["Depth-First Search","Breadth-First Search","Array","Matrix"],["深度优先搜索","广度优先搜索","数组","矩阵"]],"344495691":[["Greedy","Hash Table","Two Pointers","String"],["贪心","哈希表","双指针","字符串"]],"3444975876":[["Bit Manipulation","Array","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","动态规划","回溯","状态压缩"]],"3445174361":[["Design","Binary Search","Ordered Set"],["设计","二分查找","有序集合"]],"3445184694":[["Math","Simulation"],["数学","模拟"]],"3445657861":[["Tree","Depth-First Search","Breadth-First Search","Design","String","Binary Tree"],["树","深度优先搜索","广度优先搜索","设计","字符串","二叉树"]],"344756565":[["Trie","Array","Hash Table","String"],["字典树","数组","哈希表","字符串"]],"344813892":[["Bit Manipulation","Math","Backtracking"],["位运算","数学","回溯"]],"3448832663":[["String","Dynamic Programming"],["字符串","动态规划"]],"345204207":[["Depth-First Search","Breadth-First Search","Array","Matrix"],["深度优先搜索","广度优先搜索","数组","矩阵"]],"3452861205":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"3454110996":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"3455944020":[["Array","Binary Search"],["数组","二分查找"]],"3456273150":[["Array","Math","Matrix"],["数组","数学","矩阵"]],"3456823213":[["Design","Trie","String","Data Stream"],["设计","字典树","字符串","数据流"]],"3457051682":[["String","Dynamic Programming"],["字符串","动态规划"]],"3458213369":[["Database"],["数据库"]],"3458248889":[["Array","Hash Table"],["数组","哈希表"]],"3460084752":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"3460806368":[["Queue","Array","Binary Search","Prefix Sum","Sliding Window","Monotonic Queue","Heap (Priority Queue)"],["队列","数组","二分查找","前缀和","滑动窗口","单调队列","堆（优先队列）"]],"3461348977":[["Hash Table","String"],["哈希表","字符串"]],"3461834167":[["Greedy","Union Find","Array","String","Dynamic Programming","Matrix"],["贪心","并查集","数组","字符串","动态规划","矩阵"]],"3462463455":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"3464418220":[["Math","String"],["数学","字符串"]],"3464701651":[["Array","Math","Number Theory","Simulation"],["数组","数学","数论","模拟"]],"3465343":[["Stack","Linked List","Math"],["栈","链表","数学"]],"3465409135":[["Math","Dynamic Programming"],["数学","动态规划"]],"3468018376":[["Array","Interactive","Simulation"],["数组","交互","模拟"]],"3468116044":[["Hash Table","Math","Dynamic Programming"],["哈希表","数学","动态规划"]],"3468213273":[["Hash Table","Math","String"],["哈希表","数学","字符串"]],"3469207858":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"3469541764":[["Array","Math"],["数组","数学"]],"3469926498":[["Math","Dynamic Programming"],["数学","动态规划"]],"3473351012":[["Tree","Depth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","哈希表","二叉树"]],"3474039417":[["Bit Manipulation","Array","Hash Table","Prefix Sum"],["位运算","数组","哈希表","前缀和"]],"3474428558":[["Tree","Breadth-First Search","Binary Tree"],["树","广度优先搜索","二叉树"]],"3475686242":[["Design","Linked List"],["设计","链表"]],"3477058065":[null,null],"3479390973":[["Hash Table","Math","String","Prefix Sum"],["哈希表","数学","字符串","前缀和"]],"3480413551":[["Bit Manipulation","Array","Backtracking"],["位运算","数组","回溯"]],"3482467445":[["Stack","Greedy","Array","Sorting","Monotonic Stack"],["栈","贪心","数组","排序","单调栈"]],"3483377785":[["Bit Manipulation","Array","Math","Dynamic Programming","Bitmask"],["位运算","数组","数学","动态规划","状态压缩"]],"3484001100":[["Math","Two Pointers","Binary Search","Interactive"],["数学","双指针","二分查找","交互"]],"3484470279":[["String","Dynamic Programming"],["字符串","动态规划"]],"348512996":[["Bit Manipulation","Math","String","Simulation"],["位运算","数学","字符串","模拟"]],"3488452469":[["Design","Segment Tree","Ordered Set"],["设计","线段树","有序集合"]],"3489386729":[["Array","Math","Dynamic Programming"],["数组","数学","动态规划"]],"3489582959":[["Database"],["数据库"]],"3489599803":[["Array","Divide and Conquer","Bucket Sort","Counting Sort","Radix Sort","Sorting","Heap (Priority Queue)","Merge Sort"],["数组","分治","桶排序","计数排序","基数排序","排序","堆（优先队列）","归并排序"]],"3491443766":[["Greedy","String"],["贪心","字符串"]],"3492185165":[["Array","Dynamic Programming"],["数组","动态规划"]],"3492742379":[["Math","Number Theory"],["数学","数论"]],"3492873499":[["Tree","Depth-First Search","Breadth-First Search","Design","Binary Search Tree","String","Binary Tree"],["树","深度优先搜索","广度优先搜索","设计","二叉搜索树","字符串","二叉树"]],"3495355750":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"349650937":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"3498345039":[["Trie","Memoization","Array","Hash Table","String","Dynamic Programming"],["字典树","记忆化搜索","数组","哈希表","字符串","动态规划"]],"3501115477":[["Array"],["数组"]],"3503134762":[["Array","Hash Table","Binary Search","Dynamic Programming","Sorting"],["数组","哈希表","二分查找","动态规划","排序"]],"3504355376":[["Array","Simulation","Heap (Priority Queue)"],["数组","模拟","堆（优先队列）"]],"3504693188":[["Greedy","Hash Table","String","Counting","Sorting"],["贪心","哈希表","字符串","计数","排序"]],"3506344616":[["Breadth-First Search","String","Backtracking"],["广度优先搜索","字符串","回溯"]],"3508427448":[["Array","Hash Table","Matrix"],["数组","哈希表","矩阵"]],"3509092584":[["Hash Table","Math"],["哈希表","数学"]],"3509327992":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"3510486381":[["Array","Hash Table","Math","Binary Search","Sorting","Randomized"],["数组","哈希表","数学","二分查找","排序","随机化"]],"3510890976":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"3513036702":[["String","Dynamic Programming"],["字符串","动态规划"]],"3514319037":[["Depth-First Search","Graph","Eulerian Circuit"],["深度优先搜索","图","欧拉回路"]],"3518502488":[["Array","Math"],["数组","数学"]],"3519471521":[["Array","Math","Combinatorics"],["数组","数学","组合数学"]],"3520046805":[["Tree","Depth-First Search","Backtracking","Binary Tree"],["树","深度优先搜索","回溯","二叉树"]],"3520875014":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"3521652117":[["Greedy","Math","String"],["贪心","数学","字符串"]],"3521871699":[["Database"],["数据库"]],"3521973284":[["Array","Matrix","Prefix Sum"],["数组","矩阵","前缀和"]],"3523871920":[["Stack","String"],["栈","字符串"]],"352505600":[["Array","Hash Table","Two Pointers","Counting","Sorting"],["数组","哈希表","双指针","计数","排序"]],"3525880478":[["Array","Hash Table","Math","Probability and Statistics"],["数组","哈希表","数学","概率与统计"]],"3527144196":[["String","Dynamic Programming"],["字符串","动态规划"]],"3527222391":[["Bit Manipulation","Breadth-First Search","Graph","Dynamic Programming","Bitmask"],["位运算","广度优先搜索","图","动态规划","状态压缩"]],"3528330030":[["Array","Matrix","Prefix Sum"],["数组","矩阵","前缀和"]],"3529094278":[["Graph"],["图"]],"3529472171":[["Array","Prefix Sum"],["数组","前缀和"]],"353053828":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"3531395010":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"3532088940":[["Graph","Two Pointers","Interactive"],["图","双指针","交互"]],"3532176892":[["Greedy","Bit Manipulation","Array"],["贪心","位运算","数组"]],"3532863467":[["Tree","Depth-First Search","Math","Dynamic Programming","Number Theory"],["树","深度优先搜索","数学","动态规划","数论"]],"3533336381":[["Database"],["数据库"]],"3534885957":[["String","Backtracking"],["字符串","回溯"]],"3535072903":[["Trie","Array","Hash Table","String"],["字典树","数组","哈希表","字符串"]],"3535624008":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"3536253643":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"3537085768":[null,null],"3537815146":[["Database"],["数据库"]],"3541832045":[["Reservoir Sampling","Hash Table","Math","Randomized"],["水塘抽样","哈希表","数学","随机化"]],"3544466917":[["Array","Dynamic Programming"],["数组","动态规划"]],"3544973036":[["Array","Binary Search","Interactive"],["数组","二分查找","交互"]],"3547308658":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"3547808888":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"3548460508":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"354880980":[["Depth-First Search","Breadth-First Search","Array","Matrix"],["深度优先搜索","广度优先搜索","数组","矩阵"]],"3548853356":[["Greedy","Array","String","Dynamic Programming"],["贪心","数组","字符串","动态规划"]],"3549637617":[["String","Dynamic Programming","String Matching"],["字符串","动态规划","字符串匹配"]],"3549688121":[["Greedy","Array","Hash Table"],["贪心","数组","哈希表"]],"3550553048":[["Array","String","Divide and Conquer","Quickselect","Sorting","Heap (Priority Queue)"],["数组","字符串","分治","快速选择","排序","堆（优先队列）"]],"3552570937":[["Array","Prefix Sum","Sliding Window"],["数组","前缀和","滑动窗口"]],"3552679614":[["Database"],["数据库"]],"3553057842":[["Array","Matrix"],["数组","矩阵"]],"3553863174":[["Database"],["数据库"]],"3554305488":[["Array","Math","Divide and Conquer"],["数组","数学","分治"]],"3554428052":[["Linked List"],["链表"]],"3554577128":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"3554657564":[["Database"],["数据库"]],"3555784215":[["Array","Dynamic Programming"],["数组","动态规划"]],"3556941422":[["Database"],["数据库"]],"3557119705":[["Array","Hash Table"],["数组","哈希表"]],"3558781406":[["String"],["字符串"]],"3559784334":[["Database"],["数据库"]],"3561342867":[["Greedy","String","Dynamic Programming"],["贪心","字符串","动态规划"]],"3562926842":[["Greedy","Array","Prefix Sum","Sliding Window"],["贪心","数组","前缀和","滑动窗口"]],"3563762803":[["Array","Dynamic Programming"],["数组","动态规划"]],"3564822043":[["Math"],["数学"]],"3565117549":[["Array","Dynamic Programming"],["数组","动态规划"]],"3565951903":[["Greedy","String","Dynamic Programming","Sliding Window"],["贪心","字符串","动态规划","滑动窗口"]],"3566296172":[["Database"],["数据库"]],"3566729670":[["Greedy","Array","Two Pointers","Binary Search","Sorting"],["贪心","数组","双指针","二分查找","排序"]],"3567189290":[["Depth-First Search","Linked List","Doubly-Linked List"],["深度优先搜索","链表","双向链表"]],"3567330607":[["String","Dynamic Programming"],["字符串","动态规划"]],"3570284045":[["Greedy","Math","Binary Search"],["贪心","数学","二分查找"]],"3570621122":[["Database"],["数据库"]],"3571222180":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"3571447692":[["Array","Binary Search","Interactive","Matrix"],["数组","二分查找","交互","矩阵"]],"3572615577":[["String"],["字符串"]],"3573276394":[["Database"],["数据库"]],"3573894690":[["Array","Hash Table","Dynamic Programming","Counting"],["数组","哈希表","动态规划","计数"]],"3574045563":[["String"],["字符串"]],"3574084572":[["Trie"],["字典树"]],"3574185695":[["Array","Counting"],["数组","计数"]],"3579143787":[["Memoization","Math","Dynamic Programming"],["记忆化搜索","数学","动态规划"]],"3580394792":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"3581728008":[["Array","Math","Dynamic Programming","Game Theory"],["数组","数学","动态规划","博弈"]],"358387829":[["Bit Manipulation","Geometry","Array","Hash Table","Math","Dynamic Programming","Backtracking","Bitmask"],["位运算","几何","数组","哈希表","数学","动态规划","回溯","状态压缩"]],"3585483303":[["Bit Manipulation","Array","Backtracking"],["位运算","数组","回溯"]],"3588035361":[["Array","Dynamic Programming","Sliding Window"],["数组","动态规划","滑动窗口"]],"3589033912":[["Design","Hash Table"],["设计","哈希表"]],"3589125798":[["Array","String"],["数组","字符串"]],"3590542886":[["Breadth-First Search","Array"],["广度优先搜索","数组"]],"3590794345":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"3593932314":[["Array","Prefix Sum"],["数组","前缀和"]],"3595421528":[["Greedy","Array","Binary Search","Dynamic Programming","Prefix Sum"],["贪心","数组","二分查找","动态规划","前缀和"]],"3596139981":[["Array","Binary Search","Dynamic Programming"],["数组","二分查找","动态规划"]],"3597054857":[["Database"],["数据库"]],"3597589308":[["String","Backtracking"],["字符串","回溯"]],"3597620749":[["Database"],["数据库"]],"359765882":[["Array","Hash Table","Dynamic Programming","Sorting"],["数组","哈希表","动态规划","排序"]],"3601789048":[["Database"],["数据库"]],"360213652":[["Math","Binary Search"],["数学","二分查找"]],"360478335":[["Math","Dynamic Programming"],["数学","动态规划"]],"3605537034":[null,null],"3605700572":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"3607071844":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"3607938850":[["Backtracking","Interactive"],["回溯","交互"]],"3607948747":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"3608105198":[["Graph","Topological Sort","Array"],["图","拓扑排序","数组"]],"3608687869":[["Array","Sorting"],["数组","排序"]],"3608956462":[["Database"],["数据库"]],"3609066875":[["Array","Binary Search"],["数组","二分查找"]],"3609197847":[["Array","String"],["数组","字符串"]],"3610450870":[["Binary Search","Interactive"],["二分查找","交互"]],"3611656717":[["String"],["字符串"]],"3612436091":[["Database"],["数据库"]],"3612858843":[["Array","String"],["数组","字符串"]],"3615735813":[["Bit Manipulation","Breadth-First Search","Array","Matrix"],["位运算","广度优先搜索","数组","矩阵"]],"3615890317":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"3615903863":[["Design","Array","Matrix"],["设计","数组","矩阵"]],"3616385781":[["String","String Matching","Hash Function","Rolling Hash"],["字符串","字符串匹配","哈希函数","滚动哈希"]],"3619173359":[["Array","Divide and Conquer","Dynamic Programming"],["数组","分治","动态规划"]],"3619796334":[["Stack","String"],["栈","字符串"]],"362145938":[["Design","Ordered Set","Heap (Priority Queue)"],["设计","有序集合","堆（优先队列）"]],"3624743731":[["Greedy","Array","Sorting","Heap (Priority Queue)"],["贪心","数组","排序","堆（优先队列）"]],"3625352354":[["Greedy","Array","Matrix"],["贪心","数组","矩阵"]],"3627963576":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"3628522165":[["Database"],["数据库"]],"3628711002":[["Dynamic Programming"],["动态规划"]],"3629682368":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"3631325739":[null,null],"3631493170":[["Greedy","String","Sorting"],["贪心","字符串","排序"]],"3632361978":[["Union Find","Array","Math","Number Theory"],["并查集","数组","数学","数论"]],"3632832155":[["Dynamic Programming"],["动态规划"]],"3633709914":[["Array","Prefix Sum"],["数组","前缀和"]],"3634042243":[["Design","Hash Table","Data Stream"],["设计","哈希表","数据流"]],"3634756972":[["Stack","Greedy","Array","Two Pointers","Sorting","Monotonic Stack"],["栈","贪心","数组","双指针","排序","单调栈"]],"3639230179":[["Math","String"],["数学","字符串"]],"3640069915":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort","Array","String"],["深度优先搜索","广度优先搜索","图","拓扑排序","数组","字符串"]],"364057867":[["Greedy","Array","Binary Search","Sorting"],["贪心","数组","二分查找","排序"]],"3643699802":[["Tree","Depth-First Search","Dynamic Programming"],["树","深度优先搜索","动态规划"]],"3647529643":[["Array","Math","Matrix","Prefix Sum","Sorting","Heap (Priority Queue)"],["数组","数学","矩阵","前缀和","排序","堆（优先队列）"]],"3647659126":[["Recursion","Linked List","Math"],["递归","链表","数学"]],"3650306921":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"3652265598":[["Database"],["数据库"]],"3654559374":[["Array","Dynamic Programming"],["数组","动态规划"]],"3654833214":[["Hash Table","String","Backtracking","Counting"],["哈希表","字符串","回溯","计数"]],"3655230005":[["Depth-First Search","Graph","Eulerian Circuit"],["深度优先搜索","图","欧拉回路"]],"3655265099":[["Greedy","Math","Backtracking"],["贪心","数学","回溯"]],"3655694361":[["Depth-First Search","Breadth-First Search","Math"],["深度优先搜索","广度优先搜索","数学"]],"3658316549":[["Bit Manipulation"],["位运算"]],"3658435518":[["Database"],["数据库"]],"3658913842":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"3663334475":[["Bit Manipulation","Array","Prefix Sum"],["位运算","数组","前缀和"]],"3666213697":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"3668290311":[["Hash Table","Math","String","Combinatorics","Counting"],["哈希表","数学","字符串","组合数学","计数"]],"3669324904":[["Union Find","Array","Hash Table","String","Backtracking"],["并查集","数组","哈希表","字符串","回溯"]],"3670047480":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"3670981421":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"3671857466":[["Greedy","Array","Hash Table","Sorting"],["贪心","数组","哈希表","排序"]],"3672640831":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"3672802568":[null,null],"3674750599":[["Depth-First Search","Breadth-First Search","Array","Matrix"],["深度优先搜索","广度优先搜索","数组","矩阵"]],"3675075625":[["Greedy","Heap (Priority Queue)"],["贪心","堆（优先队列）"]],"3676581853":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"3678361449":[["Database"],["数据库"]],"3678844870":[null,null],"3679223156":[["Stack","Recursion","Hash Table","Math","String"],["栈","递归","哈希表","数学","字符串"]],"3679518604":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"3680951455":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"3681131795":[["Bit Manipulation","Array","Math","Backtracking","Combinatorics"],["位运算","数组","数学","回溯","组合数学"]],"3681526411":[["Breadth-First Search","Graph"],["广度优先搜索","图"]],"3681668560":[["Linked List","Math"],["链表","数学"]],"3681976285":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"368544120":[null,null],"3685520053":[["Array","Binary Search"],["数组","二分查找"]],"3686317773":[["Array"],["数组"]],"369209811":[["Union Find","Graph","Array","String"],["并查集","图","数组","字符串"]],"3693635252":[["Array","Sorting"],["数组","排序"]],"3694289041":[["Array","Dynamic Programming"],["数组","动态规划"]],"3695292464":[["Array","Binary Search","Prefix Sum","Sliding Window"],["数组","二分查找","前缀和","滑动窗口"]],"3696528144":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"3696757985":[["Greedy","Math","Sorting"],["贪心","数学","排序"]],"3697179042":[["Stack","Binary Indexed Tree","Segment Tree","Array","Binary Search","Sorting","Monotonic Stack"],["栈","树状数组","线段树","数组","二分查找","排序","单调栈"]],"3698071341":[["Array","Matrix"],["数组","矩阵"]],"3698564207":[["Union Find","Graph"],["并查集","图"]],"3702844885":[["Depth-First Search","Breadth-First Search","Array","Matrix"],["深度优先搜索","广度优先搜索","数组","矩阵"]],"3704059945":[["Bit Manipulation","Array"],["位运算","数组"]],"3707233513":[["Math","Enumeration"],["数学","枚举"]],"370730607":[["Graph","Geometry","Math"],["图","几何","数学"]],"3709286362":[["Array","Sliding Window"],["数组","滑动窗口"]],"3709920516":[["Stack","Greedy","Queue","String"],["栈","贪心","队列","字符串"]],"3713605524":[["Array","Enumeration","Sorting"],["数组","枚举","排序"]],"3714339122":[["Design","Queue","Array","Iterator"],["设计","队列","数组","迭代器"]],"3722557865":[["Array","Matrix"],["数组","矩阵"]],"372608626":[["Bit Manipulation","Memoization","Dynamic Programming","Bitmask"],["位运算","记忆化搜索","动态规划","状态压缩"]],"3729546605":[["Design","Array","Hash Table","Math","Randomized"],["设计","数组","哈希表","数学","随机化"]],"3729777530":[["Array","Dynamic Programming"],["数组","动态规划"]],"3729897578":[["Greedy","Math","Dynamic Programming","Enumeration"],["贪心","数学","动态规划","枚举"]],"3730047096":[["Tree","Depth-First Search","Dynamic Programming","Sorting","Heap (Priority Queue)"],["树","深度优先搜索","动态规划","排序","堆（优先队列）"]],"3731391427":[["Array","Hash Table","String","Sorting"],["数组","哈希表","字符串","排序"]],"3732579349":[["Database"],["数据库"]],"3732893747":[["Stack","Recursion","Linked List","Two Pointers"],["栈","递归","链表","双指针"]],"3733071109":[["Stack","Tree","Depth-First Search","Binary Search Tree","Two Pointers","Binary Tree","Heap (Priority Queue)"],["栈","树","深度优先搜索","二叉搜索树","双指针","二叉树","堆（优先队列）"]],"3733738177":[null,null],"3733845637":[["Array","Binary Search","Matrix","Sorting","Heap (Priority Queue)"],["数组","二分查找","矩阵","排序","堆（优先队列）"]],"3734379548":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"3735372403":[["Greedy","Math","String"],["贪心","数学","字符串"]],"3735555259":[["Tree","Depth-First Search","Hash Table","Dynamic Programming"],["树","深度优先搜索","哈希表","动态规划"]],"3735817636":[["Array"],["数组"]],"3735818622":[["Array","String","Simulation"],["数组","字符串","模拟"]],"3736820092":[["Design","Hash Table"],["设计","哈希表"]],"3736843920":[["Greedy","Array","Two Pointers","Sorting"],["贪心","数组","双指针","排序"]],"3737350161":[["Array","Hash Table","Two Pointers","String","Sorting"],["数组","哈希表","双指针","字符串","排序"]],"3738097801":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"3738671880":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"3738902181":[["Stack","Design","Queue"],["栈","设计","队列"]],"3738917436":[["Array","String","Sorting"],["数组","字符串","排序"]],"374038880":[["Stack","Greedy","Array","Dynamic Programming","Monotonic Stack"],["栈","贪心","数组","动态规划","单调栈"]],"3740959852":[["Array","Hash Table","Math","Combinatorics"],["数组","哈希表","数学","组合数学"]],"374180471":[["Array","Math","Sorting","Heap (Priority Queue)"],["数组","数学","排序","堆（优先队列）"]],"3742724136":[["Array","Dynamic Programming"],["数组","动态规划"]],"3742810739":[["Database"],["数据库"]],"374282350":[["Recursion","Math"],["递归","数学"]],"3743671260":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"3744485747":[["Bit Manipulation","Memoization","Dynamic Programming"],["位运算","记忆化搜索","动态规划"]],"3748728257":[["Bit Manipulation","Array","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","动态规划","回溯","状态压缩"]],"3749798588":[["Array","Hash Table","Matrix"],["数组","哈希表","矩阵"]],"3750650671":[["Array","Enumeration"],["数组","枚举"]],"375088983":[["Dynamic Programming"],["动态规划"]],"3750933244":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree","Sorting"],["树","深度优先搜索","二叉搜索树","二叉树","排序"]],"3754756357":[["Stack","Linked List","Math"],["栈","链表","数学"]],"3754993583":[["Array","Hash Table","Matrix"],["数组","哈希表","矩阵"]],"3756156206":[["Greedy","Array","Hash Table","Counting"],["贪心","数组","哈希表","计数"]],"375721237":[["Tree","Depth-First Search","Dynamic Programming","Binary Tree"],["树","深度优先搜索","动态规划","二叉树"]],"3757271328":[["Tree","Breadth-First Search"],["树","广度优先搜索"]],"3757656158":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"3761575610":[["Math","String"],["数学","字符串"]],"3761670335":[["Tree","Binary Search Tree","Recursion","Binary Tree"],["树","二叉搜索树","递归","二叉树"]],"3766200583":[["Math","Number Theory"],["数学","数论"]],"376871815":[["Greedy","Math"],["贪心","数学"]],"3772256778":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"3772660335":[["Stack","Array","String"],["栈","数组","字符串"]],"3772871454":[["Array","Dynamic Programming","Matrix","Sorting"],["数组","动态规划","矩阵","排序"]],"3773526508":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"3773666854":[["Bit Manipulation","Math"],["位运算","数学"]],"3777661377":[["Database"],["数据库"]],"3778120928":[["Array","Math","Sorting"],["数组","数学","排序"]],"3778209816":[["Array","Prefix Sum"],["数组","前缀和"]],"3778856012":[["String","Prefix Sum"],["字符串","前缀和"]],"3779169819":[["Array","Hash Table","Two Pointers","Sorting"],["数组","哈希表","双指针","排序"]],"3779486178":[["Greedy","Array","Hash Table","Heap (Priority Queue)"],["贪心","数组","哈希表","堆（优先队列）"]],"3780176153":[["String","Backtracking","Enumeration"],["字符串","回溯","枚举"]],"3781646421":[["Array","Dynamic Programming","Sliding Window"],["数组","动态规划","滑动窗口"]],"3781658657":[["Greedy","Array"],["贪心","数组"]],"3782265092":[["Database"],["数据库"]],"3785395845":[["Database"],["数据库"]],"3785567301":[["Math","Number Theory","Simulation"],["数学","数论","模拟"]],"3786781582":[["Bit Manipulation","Brainteaser","Array"],["位运算","脑筋急转弯","数组"]],"3787590955":[["Greedy","Math"],["贪心","数学"]],"3789355498":[["Array","Hash Table","Enumeration","Sorting"],["数组","哈希表","枚举","排序"]],"3791950406":[["Tree","Depth-First Search","Breadth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","广度优先搜索","哈希表","二叉树"]],"3793928653":[["Memoization","Dynamic Programming","Sorting"],["记忆化搜索","动态规划","排序"]],"3794347985":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"3795047313":[["Array","Dynamic Programming","Sorting"],["数组","动态规划","排序"]],"3800630907":[["Array","String"],["数组","字符串"]],"3800747527":[["Bit Manipulation","Math"],["位运算","数学"]],"3801430886":[["String","Sliding Window","Hash Function","Rolling Hash"],["字符串","滑动窗口","哈希函数","滚动哈希"]],"3802076349":[["Bit Manipulation","Array","Hash Table","String","Enumeration"],["位运算","数组","哈希表","字符串","枚举"]],"3802833057":[["Hash Table","String","Dynamic Programming"],["哈希表","字符串","动态规划"]],"3803787289":[["Bit Manipulation","Array","Hash Table","Binary Search"],["位运算","数组","哈希表","二分查找"]],"3806017410":[["Greedy","Array","Binary Search"],["贪心","数组","二分查找"]],"3806643948":[["Depth-First Search","Breadth-First Search","Union Find","Array","Hash Table","String","Sorting"],["深度优先搜索","广度优先搜索","并查集","数组","哈希表","字符串","排序"]],"3807487459":[["Math","String","Combinatorics"],["数学","字符串","组合数学"]],"3809879849":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort"],["深度优先搜索","广度优先搜索","图","拓扑排序"]],"3812471555":[["String","Binary Search","Prefix Sum","Sliding Window"],["字符串","二分查找","前缀和","滑动窗口"]],"3813216196":[["Math","String"],["数学","字符串"]],"3813731132":[["Recursion","Array","Math","Dynamic Programming","Game Theory"],["递归","数组","数学","动态规划","博弈"]],"3813795330":[["String"],["字符串"]],"3814190795":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"3814673758":[["String"],["字符串"]],"3816685448":[["Math","String"],["数学","字符串"]],"3816847735":[["Recursion","Math"],["递归","数学"]],"3817057378":[["Tree","Dynamic Programming","Binary Tree"],["树","动态规划","二叉树"]],"3817708570":[["Bit Manipulation","Array","Math"],["位运算","数组","数学"]],"3817996291":[["Tree","Depth-First Search","Breadth-First Search","Graph","Topological Sort"],["树","深度优先搜索","广度优先搜索","图","拓扑排序"]],"3820908739":[["Queue","Array","Sliding Window","Monotonic Queue"],["队列","数组","滑动窗口","单调队列"]],"382106194":[["String","Dynamic Programming"],["字符串","动态规划"]],"3821666194":[["Array","Dynamic Programming"],["数组","动态规划"]],"3822669184":[["String","Dynamic Programming","Prefix Sum"],["字符串","动态规划","前缀和"]],"3823075784":[["Array"],["数组"]],"3823231761":[["Database"],["数据库"]],"3823656539":[["Breadth-First Search","Math","Dynamic Programming"],["广度优先搜索","数学","动态规划"]],"382558847":[["Two Pointers","String"],["双指针","字符串"]],"3825739123":[["Array","Binary Search"],["数组","二分查找"]],"3828103825":[["Database"],["数据库"]],"3828565221":[["Linked List","Two Pointers"],["链表","双指针"]],"3828674995":[["Database"],["数据库"]],"3830405744":[["String","Simulation"],["字符串","模拟"]],"3830794143":[["Array","String"],["数组","字符串"]],"3830917042":[["Bit Manipulation","Array","Backtracking","Enumeration"],["位运算","数组","回溯","枚举"]],"3832160892":[["Database"],["数据库"]],"3832931339":[["Array","Dynamic Programming","Sorting"],["数组","动态规划","排序"]],"3833541404":[["Brainteaser","Math","Game Theory"],["脑筋急转弯","数学","博弈"]],"3833659931":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"3834636412":[["Bit Manipulation","Hash Table","String","Sliding Window","Hash Function","Rolling Hash"],["位运算","哈希表","字符串","滑动窗口","哈希函数","滚动哈希"]],"3835566276":[["Math","Enumeration"],["数学","枚举"]],"3836236370":[["Depth-First Search","Graph","Topological Sort","Array"],["深度优先搜索","图","拓扑排序","数组"]],"3836670242":[["Array","String"],["数组","字符串"]],"3836897087":[null,null],"3837200173":[["Union Find","Graph","Array","Two Pointers","Sorting"],["并查集","图","数组","双指针","排序"]],"3838380426":[["Database"],["数据库"]],"3839572104":[["Array","Sliding Window"],["数组","滑动窗口"]],"3841967606":[null,null],"3843088774":[["Depth-First Search","Breadth-First Search","Union Find","Graph","Array","Shortest Path"],["深度优先搜索","广度优先搜索","并查集","图","数组","最短路"]],"3843288760":[["Bit Manipulation","Math"],["位运算","数学"]],"384406520":[["Array"],["数组"]],"3846393224":[null,null],"3849697077":[["Array"],["数组"]],"3850152805":[["Tree","Depth-First Search","Array","Dynamic Programming"],["树","深度优先搜索","数组","动态规划"]],"3850475856":[["Database"],["数据库"]],"3850567251":[["Database"],["数据库"]],"3851133364":[["Greedy","Array","Math"],["贪心","数组","数学"]],"3851205548":[["Tree","Breadth-First Search","Binary Tree","Sorting"],["树","广度优先搜索","二叉树","排序"]],"385203255":[["Graph","Memoization","Dynamic Programming"],["图","记忆化搜索","动态规划"]],"3852187784":[["Array","Math","Dynamic Programming"],["数组","数学","动态规划"]],"3854724367":[["Database"],["数据库"]],"3856718514":[["Bit Manipulation","Segment Tree","Array","Binary Search"],["位运算","线段树","数组","二分查找"]],"3859790729":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"3863149926":[null,null],"3865734981":[["Array","Hash Table","Dynamic Programming"],["数组","哈希表","动态规划"]],"3866325213":[["Tree","Binary Tree"],["树","二叉树"]],"3867293007":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"3869351459":[["Array","Backtracking"],["数组","回溯"]],"3869891296":[["Array","Two Pointers"],["数组","双指针"]],"3870173669":[["Trie","Array","String","Backtracking","Matrix"],["字典树","数组","字符串","回溯","矩阵"]],"3870941501":[["Depth-First Search","Graph","Biconnected Component"],["深度优先搜索","图","双连通分量"]],"3871311053":[["Hash Table","String"],["哈希表","字符串"]],"38742216":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"3874484865":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"3876344773":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"3876397144":[["Array","Matrix"],["数组","矩阵"]],"3877013643":[["Tree","Depth-First Search","Dynamic Programming","Binary Tree"],["树","深度优先搜索","动态规划","二叉树"]],"3877437521":[["Array","Matrix"],["数组","矩阵"]],"387774736":[["Geometry","Math"],["几何","数学"]],"3880011182":[["Array","Hash Table","Enumeration"],["数组","哈希表","枚举"]],"3880639230":[["Union Find","Graph","Array","Minimum Spanning Tree"],["并查集","图","数组","最小生成树"]],"3882420814":[["Database"],["数据库"]],"3882513191":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"3883411103":[["Hash Table","Math","Enumeration"],["哈希表","数学","枚举"]],"3883580111":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"3884874766":[["Array","Dynamic Programming"],["数组","动态规划"]],"3887653034":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"388898462":[["Array","Hash Table","Two Pointers","Binary Search","Sorting"],["数组","哈希表","双指针","二分查找","排序"]],"3889083778":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"3891355877":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"3892578893":[["Array","Math","Prefix Sum"],["数组","数学","前缀和"]],"3894678842":[["Array"],["数组"]],"3894947933":[["Depth-First Search","Breadth-First Search","Union Find","Array","Binary Search","Matrix","Heap (Priority Queue)"],["深度优先搜索","广度优先搜索","并查集","数组","二分查找","矩阵","堆（优先队列）"]],"3897579601":[["Two Pointers","String"],["双指针","字符串"]],"3898582486":[["Greedy","Array","Hash Table"],["贪心","数组","哈希表"]],"3899459924":[["Array","Simulation"],["数组","模拟"]],"3899529382":[["Graph","Dynamic Programming"],["图","动态规划"]],"389978318":[["Array","Simulation"],["数组","模拟"]],"3900992255":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"3901843098":[["Two Pointers","String"],["双指针","字符串"]],"3903413452":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"3906386545":[["Array","Two Pointers"],["数组","双指针"]],"3907062892":[["Design","Binary Indexed Tree","Segment Tree","Binary Search"],["设计","树状数组","线段树","二分查找"]],"3907541820":[["Design","Hash Table","Ordered Set","Heap (Priority Queue)"],["设计","哈希表","有序集合","堆（优先队列）"]],"3909203570":[["Bit Manipulation","Tree","Depth-First Search","Dynamic Programming","Bitmask"],["位运算","树","深度优先搜索","动态规划","状态压缩"]],"3911303073":[["Stack","Recursion","Linked List","Monotonic Stack"],["栈","递归","链表","单调栈"]],"3911640069":[["String"],["字符串"]],"391342400":[["Math"],["数学"]],"3915832963":[["Stack","Design","Array"],["栈","设计","数组"]],"3919719734":[["Breadth-First Search","Array","Hash Table"],["广度优先搜索","数组","哈希表"]],"3920003458":[["Database"],["数据库"]],"3920580036":[["Array","Math","Sorting"],["数组","数学","排序"]],"3920701236":[["Array","Dynamic Programming"],["数组","动态规划"]],"3920920642":[["Math"],["数学"]],"3920925170":[["Array","Binary Search"],["数组","二分查找"]],"3922635563":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"3926333474":[["Tree","Depth-First Search","Breadth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","广度优先搜索","哈希表","二叉树"]],"3926884655":[["Hash Table","String"],["哈希表","字符串"]],"3927353973":[["String","Dynamic Programming","Simulation"],["字符串","动态规划","模拟"]],"3927702135":[["Array","Math","Dynamic Programming","Game Theory"],["数组","数学","动态规划","博弈"]],"3928291565":[["String","String Matching"],["字符串","字符串匹配"]],"3928470194":[["Geometry","Array","Math"],["几何","数组","数学"]],"3929135553":[["Graph","Topological Sort","Array","Dynamic Programming"],["图","拓扑排序","数组","动态规划"]],"3929440255":[["Depth-First Search","Breadth-First Search","Graph","Hash Table"],["深度优先搜索","广度优先搜索","图","哈希表"]],"3930025215":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"3931327644":[["Database"],["数据库"]],"3935523633":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"3936048230":[["Array","Hash Table","Matrix"],["数组","哈希表","矩阵"]],"3936988451":[["Graph"],["图"]],"3939185799":[["Breadth-First Search","Array","Dynamic Programming","Matrix"],["广度优先搜索","数组","动态规划","矩阵"]],"3940769236":[["Array","String"],["数组","字符串"]],"3942454002":[["Two Pointers","String"],["双指针","字符串"]],"3943793700":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"3944079582":[["Array","Dynamic Programming"],["数组","动态规划"]],"3946751496":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"3946770973":[["String","Dynamic Programming"],["字符串","动态规划"]],"3947635653":[["Array","Math","Dynamic Programming","Game Theory","Prefix Sum"],["数组","数学","动态规划","博弈","前缀和"]],"3949953471":[["Breadth-First Search","Array","Matrix","Heap (Priority Queue)"],["广度优先搜索","数组","矩阵","堆（优先队列）"]],"3951026299":[["Array","Simulation"],["数组","模拟"]],"3953077425":[["Array","Dynamic Programming"],["数组","动态规划"]],"3953245616":[["Array","Sliding Window"],["数组","滑动窗口"]],"3953865894":[["Array","Dynamic Programming"],["数组","动态规划"]],"3956966956":[["Tree","Depth-First Search","Breadth-First Search","Linked List","Binary Tree"],["树","深度优先搜索","广度优先搜索","链表","二叉树"]],"3957965518":[["Breadth-First Search","Array","Matrix","Sorting","Heap (Priority Queue)"],["广度优先搜索","数组","矩阵","排序","堆（优先队列）"]],"3960620247":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"3960804215":[["Array","Binary Search","Dynamic Programming"],["数组","二分查找","动态规划"]],"3965012096":[["Array","Sorting"],["数组","排序"]],"3965390038":[["Breadth-First Search","Array","Dynamic Programming"],["广度优先搜索","数组","动态规划"]],"3966752648":[["Array","Backtracking"],["数组","回溯"]],"3967032436":[["Design","Simulation"],["设计","模拟"]],"3968538235":[["Bit Manipulation","String","Dynamic Programming","Backtracking","Bitmask"],["位运算","字符串","动态规划","回溯","状态压缩"]],"3969212159":[["Array","Math","Prefix Sum","Sorting"],["数组","数学","前缀和","排序"]],"3970030339":[["Database"],["数据库"]],"3971252642":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"3971324453":[["Math"],["数学"]],"397181519":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"3972794115":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"3973047784":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"3973609032":[["Memoization","Dynamic Programming"],["记忆化搜索","动态规划"]],"3974822873":[["Array","Dynamic Programming","Sliding Window"],["数组","动态规划","滑动窗口"]],"3975010681":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"3975371411":[["Array","Hash Table","String","Ordered Set","Sorting"],["数组","哈希表","字符串","有序集合","排序"]],"3977989551":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"3978062866":[["Array","Divide and Conquer","Quickselect","Sorting","Heap (Priority Queue)"],["数组","分治","快速选择","排序","堆（优先队列）"]],"3978152897":[["Array","Hash Table","Simulation"],["数组","哈希表","模拟"]],"3978864326":[["Array","Hash Table","Two Pointers","Sorting"],["数组","哈希表","双指针","排序"]],"3979947991":[["Array","Math","Dynamic Programming","Game Theory"],["数组","数学","动态规划","博弈"]],"3980691002":[["Bit Manipulation","Array"],["位运算","数组"]],"3981013694":[["Array","String","Divide and Conquer","Quickselect","Radix Sort","Sorting","Heap (Priority Queue)"],["数组","字符串","分治","快速选择","基数排序","排序","堆（优先队列）"]],"3981067264":[["Tree","Hash Table","Two Pointers","Binary Tree"],["树","哈希表","双指针","二叉树"]],"3982094929":[["Hash Table","String","Sorting"],["哈希表","字符串","排序"]],"3982480412":[["Tree","Depth-First Search","Breadth-First Search"],["树","深度优先搜索","广度优先搜索"]],"3982790200":[["Tree","Depth-First Search","String","Binary Tree"],["树","深度优先搜索","字符串","二叉树"]],"3983488064":[["Design","Queue","Data Stream"],["设计","队列","数据流"]],"3984829072":[["Bit Manipulation","Union Find","Array","Heap (Priority Queue)"],["位运算","并查集","数组","堆（优先队列）"]],"3985296975":[["Database"],["数据库"]],"3985685306":[["Tree","Depth-First Search","Breadth-First Search","Design","String","Binary Tree"],["树","深度优先搜索","广度优先搜索","设计","字符串","二叉树"]],"3985813844":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"3987516998":[["Breadth-First Search","String","Backtracking"],["广度优先搜索","字符串","回溯"]],"3988446663":[["String"],["字符串"]],"3989118459":[["Array"],["数组"]],"3989268391":[["Array","Math"],["数组","数学"]],"3989735780":[["Array","Dynamic Programming","Sliding Window"],["数组","动态规划","滑动窗口"]],"399050701":[["Array","Simulation"],["数组","模拟"]],"3990558875":[["Greedy","Array"],["贪心","数组"]],"3990570012":[null,null],"3992139324":[["String","Dynamic Programming"],["字符串","动态规划"]],"3992943267":[["Linked List","Two Pointers","Sorting"],["链表","双指针","排序"]],"3993074949":[["Math","Two Pointers","Binary Search"],["数学","双指针","二分查找"]],"3993583568":[["String","Dynamic Programming"],["字符串","动态规划"]],"3993903432":[null,null],"3994274623":[["Stack","Tree","Depth-First Search","Binary Tree"],["栈","树","深度优先搜索","二叉树"]],"3996294633":[["Tree","Depth-First Search","Dynamic Programming","Binary Tree"],["树","深度优先搜索","动态规划","二叉树"]],"3996759401":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"3999582587":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"4000844273":[["Array","Dynamic Programming"],["数组","动态规划"]],"4003153896":[["Database"],["数据库"]],"4004277283":[["Array"],["数组"]],"4006089601":[["Geometry","Array","Math"],["几何","数组","数学"]],"4006408746":[["Stack","String","Simulation"],["栈","字符串","模拟"]],"4006941957":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"4007529944":[["Greedy","Design","Array"],["贪心","设计","数组"]],"4008128316":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"4009778807":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"4010638251":[["Queue","Array","Dynamic Programming","Monotonic Queue","Heap (Priority Queue)"],["队列","数组","动态规划","单调队列","堆（优先队列）"]],"4011399863":[["Greedy","Array"],["贪心","数组"]],"4013191058":[["Database"],["数据库"]],"4014680480":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"4014976365":[["Math","String","Dynamic Programming"],["数学","字符串","动态规划"]],"401508981":[["Array","Two Pointers","Dynamic Programming","Enumeration"],["数组","双指针","动态规划","枚举"]],"4016027208":[["Math"],["数学"]],"4016866328":[["Graph","Design","Topological Sort","Array","Matrix"],["图","设计","拓扑排序","数组","矩阵"]],"4017385406":[["Math","Enumeration"],["数学","枚举"]],"4018527734":[["Tree","Depth-First Search","Binary Tree","String Matching","Hash Function"],["树","深度优先搜索","二叉树","字符串匹配","哈希函数"]],"4020009242":[["Design","Binary Indexed Tree","Segment Tree","Array"],["设计","树状数组","线段树","数组"]],"4021161204":[["Math","Binary Search","Number Theory"],["数学","二分查找","数论"]],"4021657799":[["Database"],["数据库"]],"4022402413":[["Array","Hash Table","String","Sorting"],["数组","哈希表","字符串","排序"]],"4022600098":[["Array","Dynamic Programming"],["数组","动态规划"]],"4023565195":[["Dynamic Programming","Prefix Sum"],["动态规划","前缀和"]],"4024970253":[["Linked List"],["链表"]],"4026628199":[["Bit Manipulation","Breadth-First Search","Array","Dynamic Programming","Bitmask","Matrix"],["位运算","广度优先搜索","数组","动态规划","状态压缩","矩阵"]],"4026864126":[["Math","Simulation"],["数学","模拟"]],"4027356240":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"4028967949":[["Linked List","Two Pointers"],["链表","双指针"]],"4029466921":[["Array","Math"],["数组","数学"]],"4029500097":[["Math","Dynamic Programming","Probability and Statistics"],["数学","动态规划","概率与统计"]],"4032339630":[["Array","Math","Randomized"],["数组","数学","随机化"]],"4032343955":[["Bit Manipulation","String"],["位运算","字符串"]],"4032901400":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"4033162779":[["Greedy","Array","Math","Binary Search","Sorting","Heap (Priority Queue)"],["贪心","数组","数学","二分查找","排序","堆（优先队列）"]],"4034022024":[["Union Find","Array","Sorting"],["并查集","数组","排序"]],"4034818195":[["Array","Hash Table","Divide and Conquer","Counting","Sorting"],["数组","哈希表","分治","计数","排序"]],"4034922554":[["String"],["字符串"]],"403672441":[["Stack","Array","Simulation"],["栈","数组","模拟"]],"4039038151":[["Concurrency"],["多线程"]],"4040819108":[["Breadth-First Search","Graph","Array"],["广度优先搜索","图","数组"]],"4043172905":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"4043400932":[["Math"],["数学"]],"4043601244":[["Array","Sorting"],["数组","排序"]],"4043627107":[["Database"],["数据库"]],"4044555832":[null,null],"4047033765":[["Hash Table","Math","Two Pointers"],["哈希表","数学","双指针"]],"4047865463":[["Depth-First Search","Trie"],["深度优先搜索","字典树"]],"4048578172":[["Greedy","Two Pointers","String"],["贪心","双指针","字符串"]],"4049556872":[["Math"],["数学"]],"4050014828":[["Breadth-First Search","Graph","Array","Matrix","Shortest Path","Heap (Priority Queue)"],["广度优先搜索","图","数组","矩阵","最短路","堆（优先队列）"]],"4050705931":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"4053796951":[["Design","Binary Indexed Tree","Segment Tree","Array","Binary Search"],["设计","树状数组","线段树","数组","二分查找"]],"4054714568":[["String","Dynamic Programming"],["字符串","动态规划"]],"4057490526":[["Greedy","Array"],["贪心","数组"]],"4057878205":[["Depth-First Search","Trie","Array","String"],["深度优先搜索","字典树","数组","字符串"]],"4058134239":[["Array","Hash Table","Simulation"],["数组","哈希表","模拟"]],"4058653877":[["Depth-First Search","Breadth-First Search","Graph","Array","Matrix","Shortest Path","Heap (Priority Queue)"],["深度优先搜索","广度优先搜索","图","数组","矩阵","最短路","堆（优先队列）"]],"4061458273":[["Array","Dynamic Programming"],["数组","动态规划"]],"40615146":[["Array","Binary Search","Interactive"],["数组","二分查找","交互"]],"4061782818":[null,null],"4062228386":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"4062961912":[["Breadth-First Search","Union Find","Array","Two Pointers","Matrix","Sorting","Heap (Priority Queue)"],["广度优先搜索","并查集","数组","双指针","矩阵","排序","堆（优先队列）"]],"4063277289":[["Array","Backtracking","Matrix"],["数组","回溯","矩阵"]],"4063900283":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"4064007490":[["String","Sliding Window"],["字符串","滑动窗口"]],"4064149855":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"4065089853":[["Array","Simulation"],["数组","模拟"]],"4066429992":[["Hash Table","String","Dynamic Programming","Backtracking"],["哈希表","字符串","动态规划","回溯"]],"4067072856":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"4067624536":[["Array","Backtracking"],["数组","回溯"]],"4070705042":[["Tree","Depth-First Search","Breadth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","广度优先搜索","哈希表","二叉树"]],"4070899391":[["Design","Queue","Array","Hash Table","Data Stream"],["设计","队列","数组","哈希表","数据流"]],"4071175900":[["Array","Two Pointers","Binary Search"],["数组","双指针","二分查找"]],"4072567494":[null,null],"4075036261":[["Design","Binary Indexed Tree","Segment Tree","Array","Matrix"],["设计","树状数组","线段树","数组","矩阵"]],"4077161289":[["Array","Simulation"],["数组","模拟"]],"4078406602":[["Array","Backtracking"],["数组","回溯"]],"4078794209":[["Array","Sorting"],["数组","排序"]],"4079777150":[["Array","Counting"],["数组","计数"]],"4082307471":[["Array","Binary Search"],["数组","二分查找"]],"4083216410":[["Greedy","Brainteaser","Math"],["贪心","脑筋急转弯","数学"]],"4085072471":[["Array","Dynamic Programming"],["数组","动态规划"]],"4085658464":[["Database"],["数据库"]],"4086617748":[["Geometry","Math"],["几何","数学"]],"4088708677":[["Tree","Depth-First Search","Breadth-First Search","Array","Hash Table","Binary Tree"],["树","深度优先搜索","广度优先搜索","数组","哈希表","二叉树"]],"4089321877":[["Design","Trie","Array","Hash Table","String"],["设计","字典树","数组","哈希表","字符串"]],"4089962714":[["Database"],["数据库"]],"4091113757":[["Database"],["数据库"]],"4091816277":[["Linked List","Two Pointers"],["链表","双指针"]],"4092227797":[["Tree","Depth-First Search","Breadth-First Search","Union Find","Graph","Array","Hash Table"],["树","深度优先搜索","广度优先搜索","并查集","图","数组","哈希表"]],"4093059486":[["Hash Table","String"],["哈希表","字符串"]],"4094576814":[null,null],"4095621901":[["String","Enumeration"],["字符串","枚举"]],"4096713010":[["Bit Manipulation","Breadth-First Search","Array","Matrix"],["位运算","广度优先搜索","数组","矩阵"]],"409977826":[["Database"],["数据库"]],"410013415":[["Database"],["数据库"]],"4100936853":[["Array","Binary Search"],["数组","二分查找"]],"4101129191":[["Depth-First Search","Breadth-First Search","Array","Matrix","Simulation"],["深度优先搜索","广度优先搜索","数组","矩阵","模拟"]],"4102134032":[["Depth-First Search","Breadth-First Search","Union Find","Graph","Array","Shortest Path"],["深度优先搜索","广度优先搜索","并查集","图","数组","最短路"]],"4103794198":[["Math","String"],["数学","字符串"]],"4107503015":[["Depth-First Search","Breadth-First Search","Array","Matrix"],["深度优先搜索","广度优先搜索","数组","矩阵"]],"4107668533":[["Database"],["数据库"]],"4108118731":[["Array","Prefix Sum"],["数组","前缀和"]],"4109762990":[["Stack","Greedy","Array","Sorting","Monotonic Stack"],["栈","贪心","数组","排序","单调栈"]],"4110942485":[["Math","Binary Search"],["数学","二分查找"]],"4112278141":[["Tree","Depth-First Search","Breadth-First Search","Hash Table"],["树","深度优先搜索","广度优先搜索","哈希表"]],"4113058721":[["Array"],["数组"]],"4115375242":[["Database"],["数据库"]],"4116532905":[["Tree","Depth-First Search","Breadth-First Search","Array","Binary Tree"],["树","深度优先搜索","广度优先搜索","数组","二叉树"]],"4119329122":[["Tree","Depth-First Search","Backtracking","Binary Tree"],["树","深度优先搜索","回溯","二叉树"]],"4119724272":[["Database"],["数据库"]],"4121584967":[["Array","Hash Table","String","Sorting"],["数组","哈希表","字符串","排序"]],"412283228":[["Database"],["数据库"]],"4123515556":[["Stack","Tree","Binary Search Tree","Array","Binary Tree","Monotonic Stack"],["栈","树","二叉搜索树","数组","二叉树","单调栈"]],"4123534788":[["Stack","Design","Hash Table","Ordered Set"],["栈","设计","哈希表","有序集合"]],"4124154827":[["Array","Hash Table","Simulation"],["数组","哈希表","模拟"]],"412491371":[["Database"],["数据库"]],"4125612782":[["String"],["字符串"]],"4125791633":[["Stack","Tree","Depth-First Search"],["栈","树","深度优先搜索"]],"41269413":[["Math"],["数学"]],"4127526700":[["Array","Two Pointers","Binary Search"],["数组","双指针","二分查找"]],"4128050064":[["Database"],["数据库"]],"4129112562":[["Linked List","Divide and Conquer","Heap (Priority Queue)","Merge Sort"],["链表","分治","堆（优先队列）","归并排序"]],"4130335825":[["Array","Dynamic Programming","Backtracking"],["数组","动态规划","回溯"]],"4130908576":[["Geometry","Array","Math"],["几何","数组","数学"]],"4130986647":[["Array","Enumeration"],["数组","枚举"]],"4131453232":[["Array"],["数组"]],"4133950075":[["Bit Manipulation"],["位运算"]],"4134643071":[["String","Dynamic Programming"],["字符串","动态规划"]],"4136320759":[["Stack","Design","Hash Table","Ordered Set"],["栈","设计","哈希表","有序集合"]],"4136678159":[["String","Dynamic Programming"],["字符串","动态规划"]],"4137220667":[["Math","Combinatorics","Enumeration"],["数学","组合数学","枚举"]],"4137779509":[["Database"],["数据库"]],"4138934238":[["Tree","Depth-First Search","String","Binary Tree"],["树","深度优先搜索","字符串","二叉树"]],"4138934893":[["String","Backtracking"],["字符串","回溯"]],"4139130918":[["Database"],["数据库"]],"4140185340":[["Stack","Recursion","Hash Table","String"],["栈","递归","哈希表","字符串"]],"4141047313":[["Greedy","Array"],["贪心","数组"]],"4143209261":[["Database"],["数据库"]],"4144023748":[["Tree","Recursion","Memoization","Dynamic Programming","Binary Tree"],["树","递归","记忆化搜索","动态规划","二叉树"]],"4144252835":[["Bit Manipulation","Dynamic Programming"],["位运算","动态规划"]],"4144328959":[["Union Find","Graph","Topological Sort","Array","Matrix","Sorting"],["并查集","图","拓扑排序","数组","矩阵","排序"]],"4145221029":[["Memoization","Array","Dynamic Programming"],["记忆化搜索","数组","动态规划"]],"4147523762":[["Array"],["数组"]],"4149053090":[["Bit Manipulation"],["位运算"]],"4149493404":[["Depth-First Search","Breadth-First Search","Array","Matrix"],["深度优先搜索","广度优先搜索","数组","矩阵"]],"4149654629":[["Database"],["数据库"]],"4151024020":[["Array","Simulation"],["数组","模拟"]],"4154176354":[["Tree","Binary Search Tree","Array","Divide and Conquer","Binary Tree"],["树","二叉搜索树","数组","分治","二叉树"]],"4154206580":[["Trie","String","Suffix Array","Hash Function","Rolling Hash"],["字典树","字符串","后缀数组","哈希函数","滚动哈希"]],"4154336589":[["Breadth-First Search","String"],["广度优先搜索","字符串"]],"4155641815":[["Greedy","Array"],["贪心","数组"]],"4156461194":[["String"],["字符串"]],"4156611370":[["Math","Dynamic Programming"],["数学","动态规划"]],"4156886477":[["String"],["字符串"]],"4159210402":[["Array","Math","Dynamic Programming"],["数组","数学","动态规划"]],"4160094583":[["Math","Dynamic Programming"],["数学","动态规划"]],"4162693857":[["Greedy","Math"],["贪心","数学"]],"4162714270":[["Array","Math","Number Theory"],["数组","数学","数论"]],"4164128971":[["Trie","Array","Hash Table","String","Dynamic Programming","Hash Function","Rolling Hash"],["字典树","数组","哈希表","字符串","动态规划","哈希函数","滚动哈希"]],"4164491486":[["Array","Hash Table","Dynamic Programming"],["数组","哈希表","动态规划"]],"4165482981":[["Recursion","Array","String"],["递归","数组","字符串"]],"416702467":[["Greedy","Array","Two Pointers"],["贪心","数组","双指针"]],"4169811109":[["Depth-First Search","Breadth-First Search","Union Find","Array","Counting","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","计数","矩阵"]],"4169935304":[["Array","Enumeration"],["数组","枚举"]],"4172058127":[["Tree","Breadth-First Search","Binary Tree"],["树","广度优先搜索","二叉树"]],"4175159080":[["Array","Binary Search"],["数组","二分查找"]],"4175827470":[["Hash Table","String"],["哈希表","字符串"]],"4176664483":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"4177070630":[["Depth-First Search","Trie","Array","String","Dynamic Programming"],["深度优先搜索","字典树","数组","字符串","动态规划"]],"4180257761":[["Dynamic Programming"],["动态规划"]],"4182324049":[["Greedy","Array","Dynamic Programming","Heap (Priority Queue)"],["贪心","数组","动态规划","堆（优先队列）"]],"4183393481":[["Graph"],["图"]],"4183600583":[["Array","Backtracking"],["数组","回溯"]],"4185588652":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"4185904896":[["Array","Math","Number Theory"],["数组","数学","数论"]],"4187483922":[["Greedy","Array","Dynamic Programming","Heap (Priority Queue)"],["贪心","数组","动态规划","堆（优先队列）"]],"4187877981":[["Design","Array","Hash Table","Binary Search"],["设计","数组","哈希表","二分查找"]],"419099305":[["Greedy","Array","Math","Binary Search"],["贪心","数组","数学","二分查找"]],"4191223408":[["Array","Hash Table","String","Sorting"],["数组","哈希表","字符串","排序"]],"4191841426":[["Database"],["数据库"]],"41924590":[["Stack","Tree","Depth-First Search","Binary Tree"],["栈","树","深度优先搜索","二叉树"]],"419265170":[["Array","Backtracking"],["数组","回溯"]],"4193156158":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"4193309664":[["String","Dynamic Programming","Sliding Window"],["字符串","动态规划","滑动窗口"]],"4193739814":[["Array","Hash Table","Binary Search","Dynamic Programming"],["数组","哈希表","二分查找","动态规划"]],"4195485236":[["Array","Prefix Sum"],["数组","前缀和"]],"4195627843":[["Stack","Tree","Design","Binary Search Tree","Binary Tree","Iterator"],["栈","树","设计","二叉搜索树","二叉树","迭代器"]],"4196448349":[["Math","String","Backtracking"],["数学","字符串","回溯"]],"4197747162":[["Math","Dynamic Programming"],["数学","动态规划"]],"419814877":[["Array","Binary Search"],["数组","二分查找"]],"4199077770":[["Array","Dynamic Programming"],["数组","动态规划"]],"4200358078":[["Stack","Greedy","String","Monotonic Stack"],["栈","贪心","字符串","单调栈"]],"4201921653":[["Geometry","Math","Randomized"],["几何","数学","随机化"]],"4207897118":[["Array","Interactive"],["数组","交互"]],"4210364548":[["Greedy","String"],["贪心","字符串"]],"4211026934":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"4211993018":[["Tree","Depth-First Search","Breadth-First Search","Array"],["树","深度优先搜索","广度优先搜索","数组"]],"4212893423":[["Array"],["数组"]],"421470137":[["Design","Hash Table","Linked List","Doubly-Linked List"],["设计","哈希表","链表","双向链表"]],"4216066459":[["Array","Dynamic Programming"],["数组","动态规划"]],"4216471965":[["Array","Hash Table","String","Sorting"],["数组","哈希表","字符串","排序"]],"4216644948":[["Bit Manipulation","Memoization","Array","Dynamic Programming","Backtracking","Bitmask"],["位运算","记忆化搜索","数组","动态规划","回溯","状态压缩"]],"4216972810":[["String","Dynamic Programming"],["字符串","动态规划"]],"421748448":[["Concurrency"],["多线程"]],"4220955865":[["Database"],["数据库"]],"4221466593":[["Trie","Array","Hash Table","String","Binary Search","Dynamic Programming","Sorting"],["字典树","数组","哈希表","字符串","二分查找","动态规划","排序"]],"4222214139":[null,null],"4224776178":[null,null],"4224854568":[["Array","Hash Table","Binary Search","Dynamic Programming","Sorting"],["数组","哈希表","二分查找","动态规划","排序"]],"4225343365":[["Array","Binary Search","Dynamic Programming","Sorting"],["数组","二分查找","动态规划","排序"]],"4225876243":[["Linked List","Math","Number Theory"],["链表","数学","数论"]],"4226664142":[["Array","Dynamic Programming"],["数组","动态规划"]],"4227366527":[["String"],["字符串"]],"4231095696":[["Array","Enumeration","Matrix"],["数组","枚举","矩阵"]],"4231261281":[["Database"],["数据库"]],"4231944752":[null,null],"4233152869":[["String"],["字符串"]],"4234423090":[["Array","Hash Table","String","Counting"],["数组","哈希表","字符串","计数"]],"4235563666":[["Array","Math","Simulation"],["数组","数学","模拟"]],"4238067501":[["Array","String","Simulation"],["数组","字符串","模拟"]],"4238290979":[["Array","Simulation"],["数组","模拟"]],"4238478834":[["Queue","Array","Simulation"],["队列","数组","模拟"]],"4239392469":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"4239622058":[["Stack","Math","String","Dynamic Programming"],["栈","数学","字符串","动态规划"]],"4242473859":[["Stack","String"],["栈","字符串"]],"4243902659":[["Math"],["数学"]],"4244339093":[["Hash Table","String","Prefix Sum"],["哈希表","字符串","前缀和"]],"4245137983":[["Dynamic Programming"],["动态规划"]],"4247310156":[["Graph","Shortest Path","Heap (Priority Queue)"],["图","最短路","堆（优先队列）"]],"424787144":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"4248915112":[["Array","Dynamic Programming"],["数组","动态规划"]],"425057592":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"4252078571":[["Array","Math","Enumeration","Game Theory"],["数组","数学","枚举","博弈"]],"4252220750":[["Greedy","Recursion","Math"],["贪心","递归","数学"]],"4253187558":[["Array","Sorting"],["数组","排序"]],"4255960109":[["Stack","Tree","Design","Binary Search Tree","Binary Tree","Iterator"],["栈","树","设计","二叉搜索树","二叉树","迭代器"]],"4256716489":[["Geometry","Array","Math","Matrix"],["几何","数组","数学","矩阵"]],"4257560677":[["String","Binary Search"],["字符串","二分查找"]],"4259911866":[["Bit Manipulation","Array","String","Backtracking"],["位运算","数组","字符串","回溯"]],"4261327361":[["Greedy","Math"],["贪心","数学"]],"4262011852":[null,null],"4265155310":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"4268196111":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"4272085250":[["Tree","Depth-First Search","Union Find","Dynamic Programming"],["树","深度优先搜索","并查集","动态规划"]],"4274227295":[["Database"],["数据库"]],"4274312628":[["Bit Manipulation","Recursion","Math"],["位运算","递归","数学"]],"4275078512":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"4275612953":[["Greedy","Binary Indexed Tree","Two Pointers","String"],["贪心","树状数组","双指针","字符串"]],"4276174201":[["Array","String","Dynamic Programming"],["数组","字符串","动态规划"]],"4276936370":[["Stack","Array","Math"],["栈","数组","数学"]],"4277286146":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"4278260851":[["Database"],["数据库"]],"4278588630":[["Database"],["数据库"]],"4278798036":[["Dynamic Programming"],["动态规划"]],"4279348799":[["Array","Dynamic Programming","Backtracking"],["数组","动态规划","回溯"]],"4279603804":[["Design","Array","Matrix","Prefix Sum"],["设计","数组","矩阵","前缀和"]],"4281929868":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"4283669919":[["Math","Simulation"],["数学","模拟"]],"4285617748":[["Greedy","Queue","String"],["贪心","队列","字符串"]],"428851356":[["Array","Math"],["数组","数学"]],"4289106415":[["Geometry","Array","Math","Divide and Conquer","Quickselect","Sorting","Heap (Priority Queue)"],["几何","数组","数学","分治","快速选择","排序","堆（优先队列）"]],"4290150798":[["Array","Matrix","Prefix Sum"],["数组","矩阵","前缀和"]],"4290496515":[["Dynamic Programming"],["动态规划"]],"4291977235":[["Concurrency"],["多线程"]],"4292187435":[null,null],"4293465808":[["Linked List","Sorting"],["链表","排序"]],"4293743842":[["Array","Sliding Window"],["数组","滑动窗口"]],"4294197536":[["Math","Simulation"],["数学","模拟"]],"430788454":[["Greedy","Array","Math","Sorting"],["贪心","数组","数学","排序"]],"432952089":[["Brainteaser","Math","Dynamic Programming","Probability and Statistics"],["脑筋急转弯","数学","动态规划","概率与统计"]],"435507573":[["Array","Prefix Sum"],["数组","前缀和"]],"435938591":[["Stack","Array","Sorting","Simulation"],["栈","数组","排序","模拟"]],"436025572":[["Array","String"],["数组","字符串"]],"438417277":[["Greedy","String"],["贪心","字符串"]],"439231056":[["Array"],["数组"]],"440012417":[["Recursion","Linked List"],["递归","链表"]],"440206256":[["String","Sorting"],["字符串","排序"]],"440656680":[["Memoization","Math","Dynamic Programming","Backtracking","Game Theory"],["记忆化搜索","数学","动态规划","回溯","博弈"]],"441435962":[["Bit Manipulation","Brainteaser","Array","Math","Dynamic Programming","Game Theory"],["位运算","脑筋急转弯","数组","数学","动态规划","博弈"]],"442815761":[["Geometry","Array","Math","Enumeration","Sorting"],["几何","数组","数学","枚举","排序"]],"443405892":[["Array","Heap (Priority Queue)"],["数组","堆（优先队列）"]],"444602377":[["Math","String"],["数学","字符串"]],"444680013":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"445102839":[["Array","Binary Search","Ordered Set","Sorting"],["数组","二分查找","有序集合","排序"]],"445458274":[["Array","Prefix Sum"],["数组","前缀和"]],"446314776":[["Geometry","Array","Math"],["几何","数组","数学"]],"44691758":[["Geometry","Array","Hash Table","Math"],["几何","数组","哈希表","数学"]],"446968474":[["Queue","Array","Sliding Window","Monotonic Queue","Heap (Priority Queue)"],["队列","数组","滑动窗口","单调队列","堆（优先队列）"]],"447209244":[["Array","Dynamic Programming","Backtracking","Matrix"],["数组","动态规划","回溯","矩阵"]],"448999750":[["Bit Manipulation","Array","Math","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","数学","动态规划","回溯","状态压缩"]],"449754376":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"449776562":[["Array","String"],["数组","字符串"]],"454305182":[["Array","Divide and Conquer","Dynamic Programming"],["数组","分治","动态规划"]],"456952191":[["Design","Math"],["设计","数学"]],"457675593":[["String","Backtracking"],["字符串","回溯"]],"457953007":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"458335295":[["Design","Array","Hash Table","String","Sorting"],["设计","数组","哈希表","字符串","排序"]],"459732998":[["Depth-First Search","Graph","Eulerian Circuit"],["深度优先搜索","图","欧拉回路"]],"461728477":[["Trie","Array","Hash Table","String","String Matching","Sliding Window"],["字典树","数组","哈希表","字符串","字符串匹配","滑动窗口"]],"462078559":[["Database"],["数据库"]],"462875391":[["Greedy","Array","Hash Table","Sorting","Heap (Priority Queue)"],["贪心","数组","哈希表","排序","堆（优先队列）"]],"463765609":[["Greedy","String","Dynamic Programming"],["贪心","字符串","动态规划"]],"465632644":[["Database"],["数据库"]],"466340061":[["String","Backtracking"],["字符串","回溯"]],"468110":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"468127487":[["Database"],["数据库"]],"469490796":[["String","Dynamic Programming","Prefix Sum"],["字符串","动态规划","前缀和"]],"469801892":[["Array","Binary Search"],["数组","二分查找"]],"47105522":[["Stack","Tree","Binary Search Tree","Recursion","Array","Binary Tree","Monotonic Stack"],["栈","树","二叉搜索树","递归","数组","二叉树","单调栈"]],"472415307":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"474089455":[["Array","Binary Search","Matrix"],["数组","二分查找","矩阵"]],"474791918":[["Array","Divide and Conquer","Interactive"],["数组","分治","交互"]],"475209872":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"475633354":[["Stack","Array","Binary Search","Ordered Set","Monotonic Stack"],["栈","数组","二分查找","有序集合","单调栈"]],"476179926":[["Stack","Array","Two Pointers","Dynamic Programming","Monotonic Stack"],["栈","数组","双指针","动态规划","单调栈"]],"478874060":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"479546084":[["Array","Counting Sort","Sorting"],["数组","计数排序","排序"]],"480223586":[["String","Prefix Sum"],["字符串","前缀和"]],"48057996":[["Bit Manipulation","Hash Table","String","Sorting"],["位运算","哈希表","字符串","排序"]],"482181283":[["Database"],["数据库"]],"482822055":[["Array","Ordered Set","Prefix Sum"],["数组","有序集合","前缀和"]],"483561018":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"484484283":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"484559816":[["Stack","Tree","Depth-First Search"],["栈","树","深度优先搜索"]],"485006616":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"485245401":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"485705274":[["Stack","Array","Sorting","Monotonic Stack"],["栈","数组","排序","单调栈"]],"486718067":[["Bit Manipulation","Trie","Array","Hash Table","Sliding Window"],["位运算","字典树","数组","哈希表","滑动窗口"]],"487061983":[["Array","Binary Search","Matrix"],["数组","二分查找","矩阵"]],"487663609":[["Graph","Dynamic Programming","Shortest Path"],["图","动态规划","最短路"]],"487789523":[["Greedy","Array"],["贪心","数组"]],"488117229":[["Array","Sorting"],["数组","排序"]],"491083091":[["Array","Dynamic Programming"],["数组","动态规划"]],"491601529":[["Math","Binary Search"],["数学","二分查找"]],"492673087":[["Greedy","Math","String","Enumeration"],["贪心","数学","字符串","枚举"]],"492684269":[["Dynamic Programming"],["动态规划"]],"492772626":[["Bit Manipulation","Array","Bitmask"],["位运算","数组","状态压缩"]],"49337297":[["Database"],["数据库"]],"495901528":[["Stack","Greedy","String"],["栈","贪心","字符串"]],"496677914":[["Graph","Array","Matrix"],["图","数组","矩阵"]],"497323702":[["Hash Table","Math","String","Number Theory","Prefix Sum"],["哈希表","数学","字符串","数论","前缀和"]],"498806458":[["Tree","Depth-First Search","Breadth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","广度优先搜索","哈希表","二叉树"]],"501148034":[null,null],"50181492":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"503793114":[["Tree","Depth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","哈希表","二叉树"]],"504472069":[["String"],["字符串"]],"505097820":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort"],["深度优先搜索","广度优先搜索","图","拓扑排序"]],"509699848":[["Greedy","Array","Binary Search","Dynamic Programming"],["贪心","数组","二分查找","动态规划"]],"509756552":[["Array","Hash Table","Counting Sort","Sorting"],["数组","哈希表","计数排序","排序"]],"5115105":[["Memoization","Dynamic Programming"],["记忆化搜索","动态规划"]],"511813355":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"512758649":[["Segment Tree","Array","Ordered Set","Line Sweep"],["线段树","数组","有序集合","扫描线"]],"518714509":[["Array","Enumeration"],["数组","枚举"]],"519326923":[["Array","Hash Table"],["数组","哈希表"]],"519673615":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"519703576":[["Database"],["数据库"]],"521103328":[["Stack","Tree","Depth-First Search","Binary Tree"],["栈","树","深度优先搜索","二叉树"]],"52174285":[["Binary Indexed Tree","Segment Tree","Array","Dynamic Programming"],["树状数组","线段树","数组","动态规划"]],"521886798":[["Memoization","Array","Binary Search","Dynamic Programming","Matrix","Sorting"],["记忆化搜索","数组","二分查找","动态规划","矩阵","排序"]],"522511593":[["Linked List","Two Pointers"],["链表","双指针"]],"523690894":[["Stack","Graph","Array","Dynamic Programming","Shortest Path","Monotonic Stack"],["栈","图","数组","动态规划","最短路","单调栈"]],"523951328":[["Bit Manipulation","Array","Hash Table","Counting"],["位运算","数组","哈希表","计数"]],"526067229":[["Array","Hash Table","String","Sorting"],["数组","哈希表","字符串","排序"]],"529027464":[["Geometry","Math"],["几何","数学"]],"529249486":[["Array","Hash Table","Counting Sort","Sorting"],["数组","哈希表","计数排序","排序"]],"530135030":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"530449553":[["Tree","Depth-First Search","Breadth-First Search","Design","String","Binary Tree"],["树","深度优先搜索","广度优先搜索","设计","字符串","二叉树"]],"530846359":[["Greedy","Queue","Array","Binary Search","Prefix Sum","Sliding Window"],["贪心","队列","数组","二分查找","前缀和","滑动窗口"]],"534082096":[["Math","Enumeration"],["数学","枚举"]],"535210813":[["Trie","Hash Table","String","Bucket Sort","Counting","Sorting","Heap (Priority Queue)"],["字典树","哈希表","字符串","桶排序","计数","排序","堆（优先队列）"]],"535469112":[["Depth-First Search","Trie"],["深度优先搜索","字典树"]],"53592478":[null,null],"535937366":[["Recursion","Linked List"],["递归","链表"]],"536229655":[["Stack","Design","Linked List","String","Doubly-Linked List","Simulation"],["栈","设计","链表","字符串","双向链表","模拟"]],"536430705":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"537590451":[["Bit Manipulation","Array","Dynamic Programming","Bitmask"],["位运算","数组","动态规划","状态压缩"]],"537971944":[["Array","String","String Matching"],["数组","字符串","字符串匹配"]],"538156740":[["String","Dynamic Programming"],["字符串","动态规划"]],"540821611":[["Bit Manipulation","Tree","Dynamic Programming","Bitmask","Enumeration"],["位运算","树","动态规划","状态压缩","枚举"]],"545408597":[["Array","Matrix"],["数组","矩阵"]],"545869308":[["Array","Prefix Sum"],["数组","前缀和"]],"547605841":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"549109709":[["Greedy","Array","Ordered Set","Heap (Priority Queue)"],["贪心","数组","有序集合","堆（优先队列）"]],"550044897":[["Bit Manipulation","Array","Math"],["位运算","数组","数学"]],"550448877":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"550627195":[["Bit Manipulation","Array","Two Pointers","Binary Search","Dynamic Programming","Bitmask","Ordered Set"],["位运算","数组","双指针","二分查找","动态规划","状态压缩","有序集合"]],"551650495":[["Bit Manipulation","Recursion","Math"],["位运算","递归","数学"]],"552299541":[["Binary Indexed Tree","Segment Tree","Array","Binary Search","Divide and Conquer","Ordered Set","Merge Sort"],["树状数组","线段树","数组","二分查找","分治","有序集合","归并排序"]],"556438904":[["Array","Heap (Priority Queue)"],["数组","堆（优先队列）"]],"556450459":[["Database"],["数据库"]],"556825118":[["Array","Hash Table","Ordered Set","Sorting"],["数组","哈希表","有序集合","排序"]],"557064072":[["Geometry","Array","Math","Divide and Conquer","Ordered Set","Sorting"],["几何","数组","数学","分治","有序集合","排序"]],"557097878":[["Array","Dynamic Programming"],["数组","动态规划"]],"558074969":[["Bit Manipulation","Math"],["位运算","数学"]],"559582932":[["Greedy","Array","Two Pointers","Sorting"],["贪心","数组","双指针","排序"]],"566662585":[["Depth-First Search","Breadth-First Search","Array","Dynamic Programming","Matrix"],["深度优先搜索","广度优先搜索","数组","动态规划","矩阵"]],"566836098":[["Database"],["数据库"]],"569105706":[["Math","Two Pointers","String"],["数学","双指针","字符串"]],"569662321":[["Database"],["数据库"]],"569821923":[["Math","Dynamic Programming"],["数学","动态规划"]],"569962978":[["Greedy","Hash Table","String"],["贪心","哈希表","字符串"]],"571415893":[["Memoization","Math","Dynamic Programming"],["记忆化搜索","数学","动态规划"]],"571559842":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"572178714":[["Bit Manipulation","Array","Hash Table","Math"],["位运算","数组","哈希表","数学"]],"572276699":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"57307685":[["Two Pointers","String"],["双指针","字符串"]],"573279484":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"576619521":[["String","Backtracking"],["字符串","回溯"]],"578346118":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"578368735":[["Depth-First Search","Design","Trie","String"],["深度优先搜索","设计","字典树","字符串"]],"578652817":[["Design","Queue"],["设计","队列"]],"579965012":[["Stack","Array","Hash Table","Monotonic Stack"],["栈","数组","哈希表","单调栈"]],"582275145":[["Array","Sliding Window"],["数组","滑动窗口"]],"582349116":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"584398620":[["Geometry","Array","Math","Binary Search","Enumeration"],["几何","数组","数学","二分查找","枚举"]],"584422611":[["Memoization","Math","Dynamic Programming"],["记忆化搜索","数学","动态规划"]],"58544596":[["Hash Table","Two Pointers","String","Sliding Window"],["哈希表","双指针","字符串","滑动窗口"]],"586474794":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"58778303":[["String"],["字符串"]],"588772553":[["Graph","Array","Hash Table"],["图","数组","哈希表"]],"590592305":[["Hash Table","Math","String","Dynamic Programming"],["哈希表","数学","字符串","动态规划"]],"591580711":[["Depth-First Search","Breadth-First Search","Graph","Interactive","Heap (Priority Queue)"],["深度优先搜索","广度优先搜索","图","交互","堆（优先队列）"]],"59158142":[["Graph","Topological Sort","Memoization","Array","Math","Dynamic Programming","Game Theory","Matrix"],["图","拓扑排序","记忆化搜索","数组","数学","动态规划","博弈","矩阵"]],"592662704":[["Bit Manipulation","Divide and Conquer"],["位运算","分治"]],"592826714":[["Greedy","Array","Matrix"],["贪心","数组","矩阵"]],"59428399":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"594551983":[["Bit Manipulation","Array","Hash Table","Math","Prefix Sum"],["位运算","数组","哈希表","数学","前缀和"]],"594904868":[["Stack","Design","Linked List","Doubly-Linked List","Ordered Set"],["栈","设计","链表","双向链表","有序集合"]],"59567354":[null,null],"596917752":[null,null],"599100436":[["Linked List","Two Pointers"],["链表","双指针"]],"601450429":[["Math","Binary Search"],["数学","二分查找"]],"602085756":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"606654355":[["Geometry","Math"],["几何","数学"]],"607026938":[["Array","Hash Table","Binary Search","Sorting"],["数组","哈希表","二分查找","排序"]],"608419542":[["Dynamic Programming"],["动态规划"]],"611100168":[["String","Counting"],["字符串","计数"]],"611620362":[["Array","Binary Search"],["数组","二分查找"]],"61296851":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"613691832":[["Stack","Design","Data Stream","Monotonic Stack"],["栈","设计","数据流","单调栈"]],"614687136":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"615729621":[["Bit Manipulation","Array","Hash Table"],["位运算","数组","哈希表"]],"617363107":[["Design","Array","Matrix","Prefix Sum"],["设计","数组","矩阵","前缀和"]],"618419204":[["Array","Sorting"],["数组","排序"]],"620562584":[["Database"],["数据库"]],"623247221":[["Bit Manipulation"],["位运算"]],"625310591":[["String","Binary Search","Suffix Array","Sliding Window","Hash Function","Rolling Hash"],["字符串","二分查找","后缀数组","滑动窗口","哈希函数","滚动哈希"]],"625709572":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"62740321":[["Hash Table","String","Bucket Sort","Counting","Sorting","Heap (Priority Queue)"],["哈希表","字符串","桶排序","计数","排序","堆（优先队列）"]],"628719688":[["Two Pointers","String"],["双指针","字符串"]],"629883391":[["Tree","Breadth-First Search","Binary Tree"],["树","广度优先搜索","二叉树"]],"634204613":[["Array","Two Pointers","Binary Search","Prefix Sum","Sorting"],["数组","双指针","二分查找","前缀和","排序"]],"635111986":[["Bit Manipulation","Array","Math"],["位运算","数组","数学"]],"636790914":[["Array","Dynamic Programming"],["数组","动态规划"]],"636908055":[["Greedy","Array","String","Sorting"],["贪心","数组","字符串","排序"]],"637379632":[["Greedy","Hash Table","String"],["贪心","哈希表","字符串"]],"637661898":[["Array","Hash Table","Matrix"],["数组","哈希表","矩阵"]],"638264577":[["Hash Table","String"],["哈希表","字符串"]],"638561610":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"639622603":[["Array","Sorting"],["数组","排序"]],"639855496":[null,null],"639984084":[null,null],"640612489":[["Array","String","Dynamic Programming"],["数组","字符串","动态规划"]],"641703821":[["Concurrency"],["多线程"]],"644735722":[["Database"],["数据库"]],"646623014":[["Tree","Depth-First Search","String","Binary Tree"],["树","深度优先搜索","字符串","二叉树"]],"648001314":[["Tree","Breadth-First Search","Binary Tree"],["树","广度优先搜索","二叉树"]],"650356357":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"651101767":[["Memoization","Math","Dynamic Programming"],["记忆化搜索","数学","动态规划"]],"65111910":[["Array","Dynamic Programming"],["数组","动态规划"]],"653475446":[["String","Dynamic Programming"],["字符串","动态规划"]],"654405691":[["Database"],["数据库"]],"655929637":[["Array","Dynamic Programming"],["数组","动态规划"]],"657641712":[["Tree","Depth-First Search","Divide and Conquer","Binary Tree"],["树","深度优先搜索","分治","二叉树"]],"658738156":[["Array","String"],["数组","字符串"]],"66053082":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"660980450":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"665333196":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"668514824":[["Math","Dynamic Programming"],["数学","动态规划"]],"669193354":[["Database"],["数据库"]],"670519393":[["String","Dynamic Programming","String Matching","Hash Function","Rolling Hash"],["字符串","动态规划","字符串匹配","哈希函数","滚动哈希"]],"670957801":[["Greedy","String","Enumeration"],["贪心","字符串","枚举"]],"672964653":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"67459313":[["Tree","Depth-First Search","Breadth-First Search","Array","Hash Table"],["树","深度优先搜索","广度优先搜索","数组","哈希表"]],"676558931":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"676949389":[["Greedy","Bit Manipulation","Dynamic Programming"],["贪心","位运算","动态规划"]],"677909483":[["Math","String","Dynamic Programming"],["数学","字符串","动态规划"]],"67823656":[["Array","Hash Table","Math"],["数组","哈希表","数学"]],"679348420":[["Greedy","Bit Manipulation","Memoization","Dynamic Programming"],["贪心","位运算","记忆化搜索","动态规划"]],"680388257":[null,null],"681133837":[["Array","Heap (Priority Queue)"],["数组","堆（优先队列）"]],"68154824":[["Depth-First Search","Union Find","Graph","Array"],["深度优先搜索","并查集","图","数组"]],"684110909":[["Array","Math","Matrix","Sorting"],["数组","数学","矩阵","排序"]],"686429748":[["Math","String"],["数学","字符串"]],"687876034":[["Brainteaser","Math"],["脑筋急转弯","数学"]],"688063365":[["Array","Dynamic Programming","Sorting"],["数组","动态规划","排序"]],"689742461":[["Database"],["数据库"]],"690173651":[["Stack","Greedy","String","Dynamic Programming"],["栈","贪心","字符串","动态规划"]],"690261450":[["Array","Math"],["数组","数学"]],"693474678":[["Design","Array","Hash Table","Simulation"],["设计","数组","哈希表","模拟"]],"694594451":[["Math","String"],["数学","字符串"]],"694631589":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"694748880":[["Bit Manipulation"],["位运算"]],"696571525":[["Database"],["数据库"]],"697239024":[["Graph","Shortest Path","Heap (Priority Queue)"],["图","最短路","堆（优先队列）"]],"700466705":[["Graph","Topological Sort","Array","Matrix"],["图","拓扑排序","数组","矩阵"]],"70049056":[["Greedy","Hash Table","String"],["贪心","哈希表","字符串"]],"700655129":[["Array","Binary Search","Matrix","Ordered Set","Prefix Sum"],["数组","二分查找","矩阵","有序集合","前缀和"]],"701261553":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"703374139":[["Concurrency"],["多线程"]],"704152903":[["Math"],["数学"]],"705186057":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"705189000":[["Stack","Greedy","Array"],["栈","贪心","数组"]],"707570247":[["Design","Trie","Hash Table","String"],["设计","字典树","哈希表","字符串"]],"707968705":[["Array","Two Pointers","String"],["数组","双指针","字符串"]],"709012070":[["Array","Hash Table","String","Counting"],["数组","哈希表","字符串","计数"]],"712189388":[["Array","Binary Search","Dynamic Programming","Sorting"],["数组","二分查找","动态规划","排序"]],"713625410":[["Bit Manipulation","Union Find","String"],["位运算","并查集","字符串"]],"715235362":[["Bit Manipulation","Array","Two Pointers","Matrix","Simulation"],["位运算","数组","双指针","矩阵","模拟"]],"718375766":[["Greedy","Array","Sorting","Heap (Priority Queue)"],["贪心","数组","排序","堆（优先队列）"]],"718987035":[["Union Find","Design","Binary Indexed Tree","Segment Tree","Binary Search","Ordered Set","Heap (Priority Queue)"],["并查集","设计","树状数组","线段树","二分查找","有序集合","堆（优先队列）"]],"719526211":[["Database"],["数据库"]],"719843162":[["Array","Math"],["数组","数学"]],"721361841":[["Bit Manipulation","Array","String","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","字符串","动态规划","回溯","状态压缩"]],"722046827":[["Tree","Depth-First Search"],["树","深度优先搜索"]],"724072362":[["Hash Table","Math","String","Counting","Prefix Sum"],["哈希表","数学","字符串","计数","前缀和"]],"724968972":[["Database"],["数据库"]],"725104396":[["Recursion","Linked List","Math"],["递归","链表","数学"]],"728229560":[["Depth-First Search","Union Find","Graph","Hash Table"],["深度优先搜索","并查集","图","哈希表"]],"729170392":[["Bit Manipulation","Array","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","动态规划","回溯","状态压缩"]],"729675571":[["Database"],["数据库"]],"730656427":[["Array","Dynamic Programming","Prefix Sum"],["数组","动态规划","前缀和"]],"730723137":[["Array","Backtracking"],["数组","回溯"]],"730943544":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"731038573":[["Binary Indexed Tree","Segment Tree","Array","Dynamic Programming"],["树状数组","线段树","数组","动态规划"]],"731708110":[["Array","String","Binary Search"],["数组","字符串","二分查找"]],"733560660":[["Greedy","Array"],["贪心","数组"]],"735587531":[["Array","String"],["数组","字符串"]],"737814347":[["Stack","Greedy","Array","String"],["栈","贪心","数组","字符串"]],"737896329":[["Graph","Design","Shortest Path","Heap (Priority Queue)"],["图","设计","最短路","堆（优先队列）"]],"739255468":[["Array"],["数组"]],"741778858":[["Array","Dynamic Programming"],["数组","动态规划"]],"74188793":[["Greedy","String","Counting"],["贪心","字符串","计数"]],"743759650":[["Array","Simulation"],["数组","模拟"]],"744773019":[["Breadth-First Search","Array","Dynamic Programming","Matrix"],["广度优先搜索","数组","动态规划","矩阵"]],"746573214":[["Union Find","Array","Ordered Set","Prefix Sum"],["并查集","数组","有序集合","前缀和"]],"747763790":[["Hash Table","String","Dynamic Programming"],["哈希表","字符串","动态规划"]],"748610431":[null,null],"74918902":[["Database"],["数据库"]],"750309798":[["Tree","Depth-First Search","Dynamic Programming"],["树","深度优先搜索","动态规划"]],"750727980":[["Hash Table","String"],["哈希表","字符串"]],"751346572":[["Math"],["数学"]],"752241853":[["Array","Hash Table"],["数组","哈希表"]],"755197791":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"756808622":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort"],["深度优先搜索","广度优先搜索","图","拓扑排序"]],"759235138":[["Recursion","Linked List"],["递归","链表"]],"760128905":[["Array"],["数组"]],"760662992":[["Array","Sorting","Simulation","Heap (Priority Queue)"],["数组","排序","模拟","堆（优先队列）"]],"761142635":[["Recursion","Math","Dynamic Programming"],["递归","数学","动态规划"]],"761999420":[["Array","Binary Search","Prefix Sum","Sorting"],["数组","二分查找","前缀和","排序"]],"765388149":[["Array","Binary Search","Sorting"],["数组","二分查找","排序"]],"769907793":[["Tree","Breadth-First Search","Design","Binary Tree"],["树","广度优先搜索","设计","二叉树"]],"770030188":[["Array","String","Dynamic Programming"],["数组","字符串","动态规划"]],"770308924":[["Array","Two Pointers","String"],["数组","双指针","字符串"]],"770550829":[["Array","Binary Search","Counting"],["数组","二分查找","计数"]],"771122731":[["Tree","Depth-First Search","Array","Hash Table","Binary Tree"],["树","深度优先搜索","数组","哈希表","二叉树"]],"773302480":[["Bit Manipulation","Math"],["位运算","数学"]],"77582966":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"775852598":[["Stack","Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["栈","树","深度优先搜索","二叉搜索树","二叉树"]],"776635260":[["Greedy","Array","Sorting","Heap (Priority Queue)"],["贪心","数组","排序","堆（优先队列）"]],"778347498":[["Design","Queue","Hash Table","Counting","Data Stream"],["设计","队列","哈希表","计数","数据流"]],"779517329":[["Bit Manipulation","String","Backtracking"],["位运算","字符串","回溯"]],"781431378":[["Array","Math","Probability and Statistics"],["数组","数学","概率与统计"]],"782263815":[["Two Pointers","String","Binary Search"],["双指针","字符串","二分查找"]],"782544976":[["Reservoir Sampling","Hash Table","Math","Randomized"],["水塘抽样","哈希表","数学","随机化"]],"782747152":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"783017459":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"78641139":[["Bit Manipulation","Array"],["位运算","数组"]],"787047636":[["Greedy","Array"],["贪心","数组"]],"787489678":[["Bit Manipulation","Array"],["位运算","数组"]],"787831673":[null,null],"791863919":[["Stack","Design","Array","Linked List","Data Stream","Doubly-Linked List"],["栈","设计","数组","链表","数据流","双向链表"]],"792209696":[["Array","Binary Search","Dynamic Programming","Sorting"],["数组","二分查找","动态规划","排序"]],"792881591":[["Stack","Breadth-First Search","Memoization","String","Dynamic Programming"],["栈","广度优先搜索","记忆化搜索","字符串","动态规划"]],"79432680":[["Geometry","Array","Math","Enumeration","Sorting"],["几何","数组","数学","枚举","排序"]],"796165027":[["Bit Manipulation","Graph","Enumeration","Shortest Path","Heap (Priority Queue)"],["位运算","图","枚举","最短路","堆（优先队列）"]],"799287649":[["Stack","Math","String"],["栈","数学","字符串"]],"800569224":[["Array","Math"],["数组","数学"]],"80255331":[["Array","Hash Table","Matrix","Simulation"],["数组","哈希表","矩阵","模拟"]],"804923256":[["Array","Math","Backtracking"],["数组","数学","回溯"]],"806315258":[["Depth-First Search","Breadth-First Search","Union Find","Hash Table","Hash Function"],["深度优先搜索","广度优先搜索","并查集","哈希表","哈希函数"]],"806863646":[["Design","Queue","Array","Binary Search","Data Stream"],["设计","队列","数组","二分查找","数据流"]],"807897834":[["Array","Two Pointers","String","Simulation"],["数组","双指针","字符串","模拟"]],"808016071":[["Array","Hash Table"],["数组","哈希表"]],"809508462":[["Array","Hash Table"],["数组","哈希表"]],"809566471":[["Array","Hash Table","Simulation"],["数组","哈希表","模拟"]],"811643351":[["Hash Table","String","Backtracking"],["哈希表","字符串","回溯"]],"816106556":[["Geometry","Array","Math"],["几何","数组","数学"]],"817020554":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"817603659":[["Recursion","Math"],["递归","数学"]],"818614665":[["Array","Dynamic Programming"],["数组","动态规划"]],"819381767":[["Design","Hash Table","Data Stream","Heap (Priority Queue)"],["设计","哈希表","数据流","堆（优先队列）"]],"820995848":[["Recursion","Array"],["递归","数组"]],"821525251":[["Depth-First Search","Breadth-First Search","Union Find","Array","Binary Search","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","二分查找","矩阵"]],"823333636":[["Recursion","Math","Dynamic Programming"],["递归","数学","动态规划"]],"823399055":[["Array","Two Pointers","String"],["数组","双指针","字符串"]],"823401403":[null,null],"823944730":[["Array","Binary Search","Interactive"],["数组","二分查找","交互"]],"824074855":[["Binary Indexed Tree","Array","Dynamic Programming"],["树状数组","数组","动态规划"]],"826909651":[["Array","Matrix","Prefix Sum"],["数组","矩阵","前缀和"]],"829222445":[["Greedy","Math"],["贪心","数学"]],"830012757":[["Stack","Recursion","Linked List","Two Pointers"],["栈","递归","链表","双指针"]],"830799973":[["Array","Two Pointers"],["数组","双指针"]],"831955542":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"83229717":[["Hash Table","String","Sorting"],["哈希表","字符串","排序"]],"833954016":[["Math"],["数学"]],"834197249":[["Bit Manipulation","String","Dynamic Programming","Bitmask"],["位运算","字符串","动态规划","状态压缩"]],"835720488":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"836765096":[["String"],["字符串"]],"83779659":[["Greedy","Math"],["贪心","数学"]],"838041291":[["Binary Indexed Tree","Array"],["树状数组","数组"]],"839436880":[["Database"],["数据库"]],"839548071":[["String","String Matching","Hash Function","Rolling Hash"],["字符串","字符串匹配","哈希函数","滚动哈希"]],"83972723":[["Tree","Binary Search Tree","Math","Dynamic Programming","Binary Tree"],["树","二叉搜索树","数学","动态规划","二叉树"]],"84037765":[["Array","Dynamic Programming"],["数组","动态规划"]],"843769556":[["Array","Enumeration"],["数组","枚举"]],"84450131":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"845051287":[null,null],"846898736":[["Array","Matrix","Sorting","Simulation","Heap (Priority Queue)"],["数组","矩阵","排序","模拟","堆（优先队列）"]],"849440197":[["Array","Math","Dynamic Programming","Number Theory"],["数组","数学","动态规划","数论"]],"8513623":[["String","Dynamic Programming"],["字符串","动态规划"]],"852170646":[["Design","Hash Table","String","Ordered Set"],["设计","哈希表","字符串","有序集合"]],"854560060":[["Backtracking"],["回溯"]],"855962181":[["Breadth-First Search","Array","Ordered Set"],["广度优先搜索","数组","有序集合"]],"857697187":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"859530118":[["Bit Manipulation","Array","Hash Table","String"],["位运算","数组","哈希表","字符串"]],"860518194":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"860689371":[["Bit Manipulation","Array","Dynamic Programming","Bitmask"],["位运算","数组","动态规划","状态压缩"]],"865538835":[["Breadth-First Search","Hash Table","String","Backtracking"],["广度优先搜索","哈希表","字符串","回溯"]],"866640334":[["Recursion","Array","String"],["递归","数组","字符串"]],"86760751":[["Database"],["数据库"]],"869195845":[["Array","Sorting"],["数组","排序"]],"869865446":[["Array","Hash Table","Binary Search","Sliding Window"],["数组","哈希表","二分查找","滑动窗口"]],"870099563":[["Array","Dynamic Programming"],["数组","动态规划"]],"87115414":[["Array","Hash Table"],["数组","哈希表"]],"875418963":[["Trie","Array","Two Pointers","String","String Matching"],["字典树","数组","双指针","字符串","字符串匹配"]],"87614958":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"877400726":[["String","Dynamic Programming"],["字符串","动态规划"]],"877809104":[["String"],["字符串"]],"879115717":[["Math","String","Simulation"],["数学","字符串","模拟"]],"87920735":[["Array","Binary Search"],["数组","二分查找"]],"880076654":[["Math","Dynamic Programming"],["数学","动态规划"]],"880748729":[["Stack","Array","Dynamic Programming","Monotonic Stack"],["栈","数组","动态规划","单调栈"]],"881741713":[["Array","String"],["数组","字符串"]],"882246184":[["Array","Sorting"],["数组","排序"]],"882447848":[["Database"],["数据库"]],"882579715":[["Bit Manipulation","Hash Table","String"],["位运算","哈希表","字符串"]],"882647661":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"883396381":[["Bit Manipulation","Array"],["位运算","数组"]],"883833496":[["Bit Manipulation","Array","Dynamic Programming","Bitmask","Matrix"],["位运算","数组","动态规划","状态压缩","矩阵"]],"884144873":[["Greedy","Array","Hash Table","Counting"],["贪心","数组","哈希表","计数"]],"885464162":[["Database"],["数据库"]],"886158615":[["Recursion","String","Simulation"],["递归","字符串","模拟"]],"886594276":[["Dynamic Programming"],["动态规划"]],"887148037":[["Graph","Array","Math"],["图","数组","数学"]],"888102063":[["Design","Array","Hash Table","Two Pointers","String"],["设计","数组","哈希表","双指针","字符串"]],"888694650":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"889856657":[["Bit Manipulation","Array","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","动态规划","回溯","状态压缩"]],"890122237":[["Linked List","Math"],["链表","数学"]],"89348328":[["Array","Dynamic Programming","Prefix Sum"],["数组","动态规划","前缀和"]],"893706977":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"894912724":[["Bit Manipulation","Array"],["位运算","数组"]],"897925931":[["Database"],["数据库"]],"900196884":[["Database"],["数据库"]],"904890527":[["String","Dynamic Programming","Backtracking"],["字符串","动态规划","回溯"]],"905487995":[["String","Dynamic Programming"],["字符串","动态规划"]],"905841209":[["Geometry","Math"],["几何","数学"]],"907391117":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"907536385":[null,null],"907763091":[["Array"],["数组"]],"908082157":[["Stack","String"],["栈","字符串"]],"909563687":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"910590803":[["Array","Hash Table","Sorting","Simulation","Heap (Priority Queue)"],["数组","哈希表","排序","模拟","堆（优先队列）"]],"911506733":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"913248466":[["Binary Indexed Tree","Segment Tree","Array","Binary Search","Divide and Conquer","Ordered Set","Merge Sort"],["树状数组","线段树","数组","二分查找","分治","有序集合","归并排序"]],"915449177":[["Memoization","Array","Dynamic Programming"],["记忆化搜索","数组","动态规划"]],"917372483":[["Stack","String","Simulation"],["栈","字符串","模拟"]],"917808097":[["Bit Manipulation","Array","Hash Table"],["位运算","数组","哈希表"]],"91788639":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"918405430":[["Tree","Array","Hash Table","Divide and Conquer","Binary Tree"],["树","数组","哈希表","分治","二叉树"]],"919200929":[["Array","Prefix Sum"],["数组","前缀和"]],"919580800":[["Array","Dynamic Programming"],["数组","动态规划"]],"920111034":[["Design","Array","Hash Table"],["设计","数组","哈希表"]],"920238680":[["Database"],["数据库"]],"921517874":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"922086852":[["Tree","Binary Tree"],["树","二叉树"]],"922159166":[["Trie","Array","Hash Table","String"],["字典树","数组","哈希表","字符串"]],"922160489":[["Greedy","Array","Prefix Sum","Sorting"],["贪心","数组","前缀和","排序"]],"922857054":[null,null],"923836112":[null,null],"924129852":[["String","Dynamic Programming"],["字符串","动态规划"]],"925231976":[null,null],"925899870":[["Array","Dynamic Programming"],["数组","动态规划"]],"926213540":[null,null],"9262188":[["Hash Table","Math","Counting"],["哈希表","数学","计数"]],"927068521":[["Greedy","Array"],["贪心","数组"]],"927391464":[null,null],"928331770":[["Array","Dynamic Programming"],["数组","动态规划"]],"928385815":[["Breadth-First Search","Array","Dynamic Programming"],["广度优先搜索","数组","动态规划"]],"929368022":[null,null],"929645229":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"929840503":[["Tree","Depth-First Search","Breadth-First Search","Linked List","Binary Tree"],["树","深度优先搜索","广度优先搜索","链表","二叉树"]],"932131549":[null,null],"933282434":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"93344773":[["Array","Simulation"],["数组","模拟"]],"933877486":[["Array"],["数组"]],"938263064":[["Greedy","Array","Binary Search","Dynamic Programming","Prefix Sum"],["贪心","数组","二分查找","动态规划","前缀和"]],"941716720":[["Stack","Two Pointers","String","Simulation"],["栈","双指针","字符串","模拟"]],"94199361":[["String"],["字符串"]],"942180030":[["Math","String","Dynamic Programming"],["数学","字符串","动态规划"]],"942356384":[["Two Pointers","String","Dynamic Programming"],["双指针","字符串","动态规划"]],"943252793":[["Tree","Depth-First Search","Breadth-First Search","Hash Table"],["树","深度优先搜索","广度优先搜索","哈希表"]],"94359620":[["Greedy","Bit Manipulation","Array"],["贪心","位运算","数组"]],"943933017":[["Dynamic Programming"],["动态规划"]],"945629510":[["Array","String","Prefix Sum"],["数组","字符串","前缀和"]],"946660529":[["Greedy","Math","String"],["贪心","数学","字符串"]],"947222494":[["Database"],["数据库"]],"949381873":[["Graph","Array","Enumeration","Sorting"],["图","数组","枚举","排序"]],"949683376":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"950521557":[["Array","Matrix"],["数组","矩阵"]],"953049578":[["Hash Table","String"],["哈希表","字符串"]],"954274595":[["Array","Dynamic Programming","Matrix","Prefix Sum"],["数组","动态规划","矩阵","前缀和"]],"957253639":[["Bit Manipulation","Divide and Conquer"],["位运算","分治"]],"95851077":[["Greedy","Array","Dynamic Programming","Sorting"],["贪心","数组","动态规划","排序"]],"959153590":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"95938088":[["Array","Prefix Sum"],["数组","前缀和"]],"959851555":[["Queue","Hash Table","String","Counting"],["队列","哈希表","字符串","计数"]],"960174485":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort","Memoization","Array","Dynamic Programming","Matrix"],["深度优先搜索","广度优先搜索","图","拓扑排序","记忆化搜索","数组","动态规划","矩阵"]],"960405407":[["Array","Dynamic Programming"],["数组","动态规划"]],"96141044":[["Segment Tree","Array","String","Ordered Set"],["线段树","数组","字符串","有序集合"]],"961906184":[["Stack","Tree","Binary Search Tree","Recursion","Binary Tree","Monotonic Stack"],["栈","树","二叉搜索树","递归","二叉树","单调栈"]],"963187635":[["Hash Table","Math","String"],["哈希表","数学","字符串"]],"963523596":[["String"],["字符串"]],"96440277":[["Greedy","Bit Manipulation","Array","Matrix"],["贪心","位运算","数组","矩阵"]],"964970911":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"965000307":[["Greedy","Array"],["贪心","数组"]],"966269583":[["Array","Math","Enumeration","Number Theory"],["数组","数学","枚举","数论"]],"967980473":[["Array","Sorting"],["数组","排序"]],"968595601":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"968851545":[["Tree","Array","Divide and Conquer","Matrix"],["树","数组","分治","矩阵"]],"969064590":[["Hash Table","String","Counting","Hash Function","Rolling Hash"],["哈希表","字符串","计数","哈希函数","滚动哈希"]],"969893325":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"970766553":[["Greedy","Array","Hash Table","Counting","Sorting"],["贪心","数组","哈希表","计数","排序"]],"974534416":[["Array","Hash Table"],["数组","哈希表"]],"976252372":[["Design","Segment Tree","Math"],["设计","线段树","数学"]],"976283641":[["Bit Manipulation","Array","String","Dynamic Programming","Bitmask"],["位运算","数组","字符串","动态规划","状态压缩"]],"977519979":[["Math","Dynamic Programming"],["数学","动态规划"]],"97873302":[["Array","Sliding Window"],["数组","滑动窗口"]],"979158748":[["Depth-First Search","Breadth-First Search","Graph","Dynamic Programming"],["深度优先搜索","广度优先搜索","图","动态规划"]],"9793507":[["Array","Math","String","Backtracking"],["数组","数学","字符串","回溯"]],"979526552":[["Array","Binary Search","Dynamic Programming","Sorting"],["数组","二分查找","动态规划","排序"]],"979891940":[["Breadth-First Search","Hash Table","String"],["广度优先搜索","哈希表","字符串"]],"981386412":[["Array","Sorting"],["数组","排序"]],"983129619":[["Bit Manipulation","Array","Hash Table"],["位运算","数组","哈希表"]],"98370052":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"986520800":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"98793972":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"988335694":[["Array","Binary Search","Prefix Sum","Sorting"],["数组","二分查找","前缀和","排序"]],"989456575":[["String","Enumeration"],["字符串","枚举"]],"991662473":[["Array","Math","Sorting"],["数组","数学","排序"]],"99323012":[["Database"],["数据库"]],"999091554":[["Breadth-First Search","Union Find","Array","Binary Search","Matrix"],["广度优先搜索","并查集","数组","二分查找","矩阵"]]} +{"1001722740":[["Array","Math"],["数组","数学"]],"1002673857":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"100346498":[["Array","Hash Table","Two Pointers","Binary Search","Sorting"],["数组","哈希表","双指针","二分查找","排序"]],"1005570900":[["Math","Dynamic Programming","Probability and Statistics"],["数学","动态规划","概率与统计"]],"1007682110":[["Depth-First Search","Breadth-First Search","Graph","Hash Table"],["深度优先搜索","广度优先搜索","图","哈希表"]],"1009688921":[["Graph","Topological Sort"],["图","拓扑排序"]],"1009976390":[["Array","Simulation"],["数组","模拟"]],"1010937559":[["Array","Sorting"],["数组","排序"]],"1013970586":[["Bit Manipulation","Hash Table","String","Hash Function","Rolling Hash"],["位运算","哈希表","字符串","哈希函数","滚动哈希"]],"1014740120":[["Graph","Array","Shortest Path","Heap (Priority Queue)"],["图","数组","最短路","堆（优先队列）"]],"1016789276":[["Array","Hash Table"],["数组","哈希表"]],"1017096056":[["Math"],["数学"]],"1017177635":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"1018399535":[["Array","Hash Table"],["数组","哈希表"]],"101859828":[["Two Pointers","String"],["双指针","字符串"]],"1019076732":[["Database"],["数据库"]],"1019777981":[["Bit Manipulation","Array","Hash Table"],["位运算","数组","哈希表"]],"10205408":[["Union Find","Graph"],["并查集","图"]],"1021006246":[["Union Find","Array"],["并查集","数组"]],"102220660":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"102293615":[["Shell"],[""]],"1023487571":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"1023816398":[["Array","Dynamic Programming"],["数组","动态规划"]],"1024461884":[["Depth-First Search","Graph"],["深度优先搜索","图"]],"1024556652":[["String","Backtracking"],["字符串","回溯"]],"102575803":[["Greedy","Array","Hash Table","Binary Search"],["贪心","数组","哈希表","二分查找"]],"1026373985":[["Array","Math","Heap (Priority Queue)"],["数组","数学","堆（优先队列）"]],"1028149095":[["Array","Simulation"],["数组","模拟"]],"1029578709":[["Array","Simulation","Heap (Priority Queue)"],["数组","模拟","堆（优先队列）"]],"1029802455":[["Database"],["数据库"]],"1032257843":[["Array","Dynamic Programming"],["数组","动态规划"]],"1033176958":[["Array","Binary Search","Prefix Sum"],["数组","二分查找","前缀和"]],"1033555490":[["String"],["字符串"]],"103725426":[["Array","String"],["数组","字符串"]],"1037331293":[["Array","Matrix","Sorting","Simulation","Heap (Priority Queue)"],["数组","矩阵","排序","模拟","堆（优先队列）"]],"103770723":[["Database"],["数据库"]],"1038100878":[["Bit Manipulation","Math"],["位运算","数学"]],"1038307939":[["Stack","String"],["栈","字符串"]],"103871786":[["Array","Hash Table","Sorting","Simulation"],["数组","哈希表","排序","模拟"]],"1041979787":[["Math","String"],["数学","字符串"]],"1043390792":[["Stack","Tree","Depth-First Search","Binary Search Tree","Two Pointers","Binary Search","Binary Tree"],["栈","树","深度优先搜索","二叉搜索树","双指针","二分查找","二叉树"]],"1044473054":[["String","Dynamic Programming"],["字符串","动态规划"]],"1046441649":[["Array","Binary Search","Sorting"],["数组","二分查找","排序"]],"1047256075":[["Bit Manipulation","Array","Hash Table"],["位运算","数组","哈希表"]],"1049390106":[["Brainteaser","Math"],["脑筋急转弯","数学"]],"1049961856":[["Array","Binary Search","Sorting"],["数组","二分查找","排序"]],"1053077839":[["Array","Binary Search"],["数组","二分查找"]],"1053626998":[["Two Pointers","String"],["双指针","字符串"]],"1057920854":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"1058710996":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"1058758368":[["Database"],["数据库"]],"1058966145":[["Tree","Depth-First Search","Graph","Array","Dynamic Programming"],["树","深度优先搜索","图","数组","动态规划"]],"1059279895":[["Array","Binary Search","Prefix Sum","Sorting","Sliding Window"],["数组","二分查找","前缀和","排序","滑动窗口"]],"1060291152":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1060952697":[["Array","Math"],["数组","数学"]],"1062314990":[["Array","Binary Search","Matrix"],["数组","二分查找","矩阵"]],"1062871842":[["Array","Prefix Sum"],["数组","前缀和"]],"1063164797":[["Geometry","Array","Math","Matrix"],["几何","数组","数学","矩阵"]],"1063658457":[["Greedy","Two Pointers","String"],["贪心","双指针","字符串"]],"1066025257":[["Array","Binary Search","Sorting"],["数组","二分查找","排序"]],"1067366399":[["Math","Dynamic Programming","Backtracking"],["数学","动态规划","回溯"]],"1067400091":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"1068663704":[["Linked List","Two Pointers"],["链表","双指针"]],"1069078430":[["Array"],["数组"]],"1069219826":[["String","Dynamic Programming"],["字符串","动态规划"]],"1069956724":[["String","Dynamic Programming"],["字符串","动态规划"]],"1069999133":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"1074334353":[["Array","Two Pointers","Binary Search","Prefix Sum"],["数组","双指针","二分查找","前缀和"]],"1074391241":[["Tree","Binary Search Tree","Binary Tree","Ordered Set"],["树","二叉搜索树","二叉树","有序集合"]],"1075188600":[["Array","Hash Table"],["数组","哈希表"]],"1075377947":[["Database"],["数据库"]],"107547857":[["Array","Sliding Window"],["数组","滑动窗口"]],"1075948935":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"1075971933":[["Binary Indexed Tree","Array","Binary Search","Sorting"],["树状数组","数组","二分查找","排序"]],"1078280786":[["Graph","Hash Table"],["图","哈希表"]],"1078494316":[["Array"],["数组"]],"1079710023":[["Stack","Tree","Depth-First Search","Design","Queue","Iterator"],["栈","树","深度优先搜索","设计","队列","迭代器"]],"1080305958":[["Array","Dynamic Programming"],["数组","动态规划"]],"1081472803":[["String"],["字符串"]],"1083394541":[["Array","Dynamic Programming","Sorting"],["数组","动态规划","排序"]],"1084901915":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"1085741995":[["Stack","Design"],["栈","设计"]],"108728140":[["Math","Dynamic Programming"],["数学","动态规划"]],"1088208610":[["Array","Binary Search"],["数组","二分查找"]],"1089101531":[["Greedy","Hash Table","String","Counting","Sorting"],["贪心","哈希表","字符串","计数","排序"]],"1092713458":[["Array","Enumeration"],["数组","枚举"]],"1093275153":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"1094471227":[["Math"],["数学"]],"1095929141":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort"],["深度优先搜索","广度优先搜索","图","拓扑排序"]],"109606469":[["Greedy","Array"],["贪心","数组"]],"1096438122":[["Database"],["数据库"]],"1097720535":[["Breadth-First Search","Graph","Prefix Sum"],["广度优先搜索","图","前缀和"]],"1098465458":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1101243430":[["Bit Manipulation","Array","Hash Table","Sorting"],["位运算","数组","哈希表","排序"]],"110135796":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1102712818":[["Database"],["数据库"]],"1102749976":[["Greedy","Array","String"],["贪心","数组","字符串"]],"1103286328":[["Linked List"],["链表"]],"1104764996":[null,null],"1108078634":[["Array","Hash Table"],["数组","哈希表"]],"111167904":[["Brainteaser","Math","Two Pointers"],["脑筋急转弯","数学","双指针"]],"111192011":[["Graph","Topological Sort","Array"],["图","拓扑排序","数组"]],"111233848":[["Database"],["数据库"]],"111314097":[["Breadth-First Search","Array","Matrix","Heap (Priority Queue)"],["广度优先搜索","数组","矩阵","堆（优先队列）"]],"1113985320":[["Bit Manipulation","Array","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","动态规划","回溯","状态压缩"]],"1114191328":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"1114300382":[["Array","Binary Search"],["数组","二分查找"]],"111572636":[["Tree","Depth-First Search","Dynamic Programming","Binary Tree"],["树","深度优先搜索","动态规划","二叉树"]],"1118571941":[["Bit Manipulation","Breadth-First Search","Array","Hash Table","Matrix"],["位运算","广度优先搜索","数组","哈希表","矩阵"]],"1119710280":[["Stack","Greedy","Array","Binary Search","Sorting"],["栈","贪心","数组","二分查找","排序"]],"1122946813":[["Array","Math","Simulation"],["数组","数学","模拟"]],"1123666202":[["Bit Manipulation","Array"],["位运算","数组"]],"1129799033":[["Array","Prefix Sum"],["数组","前缀和"]],"1130768852":[["Database"],["数据库"]],"1131587707":[["Tree","Depth-First Search"],["树","深度优先搜索"]],"1132748762":[["Bit Manipulation","Array","Two Pointers","Binary Search"],["位运算","数组","双指针","二分查找"]],"1132876897":[["Bit Manipulation","Array","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","动态规划","回溯","状态压缩"]],"1134359923":[["Bit Manipulation","Array","Backtracking","Matrix"],["位运算","数组","回溯","矩阵"]],"1135090504":[["Greedy","Bit Manipulation","Array","Matrix"],["贪心","位运算","数组","矩阵"]],"1135153485":[["Two Pointers","String"],["双指针","字符串"]],"1137656154":[["Stack","Array","Simulation"],["栈","数组","模拟"]],"1137942707":[["Bit Manipulation","Array","Math"],["位运算","数组","数学"]],"113811987":[["Design","Segment Tree","Ordered Set"],["设计","线段树","有序集合"]],"1139062797":[["String","Sorting"],["字符串","排序"]],"1140950686":[["Queue","Array","Dynamic Programming","Monotonic Queue","Heap (Priority Queue)"],["队列","数组","动态规划","单调队列","堆（优先队列）"]],"1144525439":[["Depth-First Search","Design","Trie","Hash Table","String"],["深度优先搜索","设计","字典树","哈希表","字符串"]],"1146950656":[["Bit Manipulation","Array","Backtracking"],["位运算","数组","回溯"]],"1147860078":[["Design","Hash Table","Data Stream","Ordered Set","Heap (Priority Queue)"],["设计","哈希表","数据流","有序集合","堆（优先队列）"]],"1149087220":[["Array"],["数组"]],"1150623470":[["Array","Math","Sorting"],["数组","数学","排序"]],"1151236787":[["Database"],["数据库"]],"115382073":[["Design","Linked List"],["设计","链表"]],"1156930664":[["Depth-First Search","Breadth-First Search","String","Dynamic Programming"],["深度优先搜索","广度优先搜索","字符串","动态规划"]],"1160726234":[["Database"],["数据库"]],"1164168277":[["Binary Indexed Tree","Segment Tree","Array","Binary Search","Divide and Conquer","Ordered Set","Merge Sort"],["树状数组","线段树","数组","二分查找","分治","有序集合","归并排序"]],"1164523872":[["String","Counting","Prefix Sum"],["字符串","计数","前缀和"]],"1164835766":[["Math","String","Simulation"],["数学","字符串","模拟"]],"1165166058":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"1165928557":[["Stack","Greedy","String","Monotonic Stack"],["栈","贪心","字符串","单调栈"]],"1167299665":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"1167766424":[["Array","Hash Table","Binary Search","Counting"],["数组","哈希表","二分查找","计数"]],"1168254316":[["Array","Hash Table","Two Pointers"],["数组","哈希表","双指针"]],"1168505902":[["Array","Math","Dynamic Programming","Game Theory"],["数组","数学","动态规划","博弈"]],"1168558024":[["Stack","Linked List","Math"],["栈","链表","数学"]],"1170959519":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"1171095":[["Database"],["数据库"]],"117165936":[["String"],["字符串"]],"1172679970":[["Database"],["数据库"]],"1173419903":[["Greedy","Math"],["贪心","数学"]],"1174559962":[["String","Sorting"],["字符串","排序"]],"1176671732":[["Array","Hash Table","String","Counting"],["数组","哈希表","字符串","计数"]],"1177110212":[["Binary Indexed Tree","Segment Tree","Array","Divide and Conquer","Ordered Set","Line Sweep","Heap (Priority Queue)"],["树状数组","线段树","数组","分治","有序集合","扫描线","堆（优先队列）"]],"1178924986":[["String","Dynamic Programming","Suffix Array"],["字符串","动态规划","后缀数组"]],"1179475752":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"1180161064":[["Math","String","Dynamic Programming","Combinatorics"],["数学","字符串","动态规划","组合数学"]],"1180349312":[["Math"],["数学"]],"1180837306":[["Greedy","String"],["贪心","字符串"]],"1181589124":[["Array","Binary Search","Sorting"],["数组","二分查找","排序"]],"1182482579":[null,null],"1182547848":[["Array","Math","Number Theory"],["数组","数学","数论"]],"1184414922":[["Greedy","Two Pointers","String","Dynamic Programming","Hash Function","Rolling Hash"],["贪心","双指针","字符串","动态规划","哈希函数","滚动哈希"]],"1185092838":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"1186138716":[["String","Dynamic Programming"],["字符串","动态规划"]],"1186731908":[["Greedy","String","Dynamic Programming"],["贪心","字符串","动态规划"]],"1187211206":[["Array","Prefix Sum","Sorting","Simulation","Heap (Priority Queue)"],["数组","前缀和","排序","模拟","堆（优先队列）"]],"1187527339":[["Design","Array","String"],["设计","数组","字符串"]],"1187943151":[["Database"],["数据库"]],"1188543288":[["Tree","Breadth-First Search","Binary Tree"],["树","广度优先搜索","二叉树"]],"1189152973":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"1191385639":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"1191936218":[["Array","Binary Search","Sliding Window"],["数组","二分查找","滑动窗口"]],"1192302071":[["Geometry","Math"],["几何","数学"]],"1192605817":[["Recursion","Math"],["递归","数学"]],"119361315":[["Bit Manipulation","Brainteaser","Array"],["位运算","脑筋急转弯","数组"]],"1194042995":[["Greedy","Queue","Array","Binary Search","Sorting","Monotonic Queue"],["贪心","队列","数组","二分查找","排序","单调队列"]],"119654105":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"1197839305":[["Array","Hash Table","Math","Sliding Window"],["数组","哈希表","数学","滑动窗口"]],"1197966112":[["Array","Binary Search"],["数组","二分查找"]],"1199006360":[["Stack","Array","Dynamic Programming","Matrix","Monotonic Stack"],["栈","数组","动态规划","矩阵","单调栈"]],"1199383198":[["Array","String","Binary Search","Prefix Sum"],["数组","字符串","二分查找","前缀和"]],"119954396":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"1200771569":[["Array","String"],["数组","字符串"]],"1200779115":[["Database"],["数据库"]],"1204439806":[["Greedy","Bit Manipulation","Array"],["贪心","位运算","数组"]],"1204660336":[["Math","Backtracking","Enumeration"],["数学","回溯","枚举"]],"1206307881":[["Bit Manipulation","Math"],["位运算","数学"]],"120648461":[["Hash Table","String"],["哈希表","字符串"]],"1210001971":[["Bit Manipulation","Math","Backtracking"],["位运算","数学","回溯"]],"1210196211":[["Tree","Depth-First Search","String","Binary Tree"],["树","深度优先搜索","字符串","二叉树"]],"1210455736":[["Array","Dynamic Programming","Sorting"],["数组","动态规划","排序"]],"1210688937":[["Greedy","Array","Sorting","Heap (Priority Queue)"],["贪心","数组","排序","堆（优先队列）"]],"1210757712":[["Two Pointers","String"],["双指针","字符串"]],"121112730":[["Bit Manipulation","Math"],["位运算","数学"]],"1212080245":[["Database"],["数据库"]],"1212266970":[["Stack","Tree","String","Binary Tree"],["栈","树","字符串","二叉树"]],"1218347826":[["Greedy","Binary Indexed Tree","Segment Tree","String"],["贪心","树状数组","线段树","字符串"]],"1218479039":[["Greedy","Math"],["贪心","数学"]],"122030614":[["Array","Hash Table"],["数组","哈希表"]],"122134919":[["Array","Binary Search","Sorting"],["数组","二分查找","排序"]],"1225270682":[["Array","Math"],["数组","数学"]],"1226888142":[["Bit Manipulation","String","Dynamic Programming"],["位运算","字符串","动态规划"]],"1229621552":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"123050212":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"1231586287":[["String","Dynamic Programming"],["字符串","动态规划"]],"1231673390":[["Depth-First Search","Breadth-First Search"],["深度优先搜索","广度优先搜索"]],"1231737979":[["Enumeration"],["枚举"]],"1232284801":[["Array","Hash Table","Binary Search","Sorting"],["数组","哈希表","二分查找","排序"]],"1232868918":[["Memoization","String","Dynamic Programming"],["记忆化搜索","字符串","动态规划"]],"123288766":[["Design","Segment Tree","Binary Search","Ordered Set"],["设计","线段树","二分查找","有序集合"]],"1233403465":[["Recursion","String","Simulation"],["递归","字符串","模拟"]],"1234370312":[["Array","Matrix"],["数组","矩阵"]],"1234415652":[null,null],"1235853332":[["Array","Hash Table","Dynamic Programming"],["数组","哈希表","动态规划"]],"1236291717":[["Bit Manipulation"],["位运算"]],"1236982780":[["Hash Table","String","Backtracking"],["哈希表","字符串","回溯"]],"1238400837":[["Binary Indexed Tree","Array","Simulation"],["树状数组","数组","模拟"]],"1238608911":[["Array","Backtracking"],["数组","回溯"]],"124089953":[["Tree","Breadth-First Search","Linked List","Binary Tree"],["树","广度优先搜索","链表","二叉树"]],"1241705093":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"124247488":[null,null],"124339070":[["Tree","Depth-First Search","Breadth-First Search","Union Find","Graph","Binary Tree"],["树","深度优先搜索","广度优先搜索","并查集","图","二叉树"]],"1243440018":[["Graph","Array","Shortest Path","Heap (Priority Queue)"],["图","数组","最短路","堆（优先队列）"]],"1245231548":[["Array"],["数组"]],"1245371369":[null,null],"1246328892":[["Math"],["数学"]],"1246713190":[["Array","Math","Matrix"],["数组","数学","矩阵"]],"1247027569":[["Greedy","Array","Two Pointers","Sorting"],["贪心","数组","双指针","排序"]],"1247428479":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"1249919767":[["Greedy","Array"],["贪心","数组"]],"1250723795":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1252533772":[["Design","Array","Prefix Sum"],["设计","数组","前缀和"]],"1252651878":[["Array","Math","Dynamic Programming","Number Theory"],["数组","数学","动态规划","数论"]],"1253336265":[["Recursion","Math"],["递归","数学"]],"125432943":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"1255527945":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"1257680587":[["String","String Matching"],["字符串","字符串匹配"]],"1257762070":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1258148931":[["Trie","Array","Hash Table","String","Sorting"],["字典树","数组","哈希表","字符串","排序"]],"1260215787":[["Array","Hash Table","Math","Two Pointers"],["数组","哈希表","数学","双指针"]],"1262858438":[["Greedy","Array"],["贪心","数组"]],"1263665709":[["Tree","Depth-First Search","Breadth-First Search","Design","Binary Tree"],["树","深度优先搜索","广度优先搜索","设计","二叉树"]],"1265881179":[["Depth-First Search","Design","Trie","Hash Table","String"],["深度优先搜索","设计","字典树","哈希表","字符串"]],"126670103":[["Array","Dynamic Programming"],["数组","动态规划"]],"1268853066":[["Array","Binary Search"],["数组","二分查找"]],"1269261016":[["Math","Binary Search"],["数学","二分查找"]],"1272023779":[["Design","Array","Hash Table","Ordered Set","Heap (Priority Queue)"],["设计","数组","哈希表","有序集合","堆（优先队列）"]],"1275579259":[["Greedy","Graph","Array","Sorting","Heap (Priority Queue)"],["贪心","图","数组","排序","堆（优先队列）"]],"1276354362":[["Stack","Tree","Depth-First Search","Binary Search Tree","Linked List","Binary Tree","Doubly-Linked List"],["栈","树","深度优先搜索","二叉搜索树","链表","二叉树","双向链表"]],"1278269400":[["String"],["字符串"]],"1278665216":[["Array","Enumeration"],["数组","枚举"]],"1280364978":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort"],["深度优先搜索","广度优先搜索","图","拓扑排序"]],"1282549856":[["Design","Two Pointers","Data Stream","Sorting","Heap (Priority Queue)"],["设计","双指针","数据流","排序","堆（优先队列）"]],"1287143513":[["Database"],["数据库"]],"1290173910":[["Array","Math","String","Matrix"],["数组","数学","字符串","矩阵"]],"1294188975":[["Math"],["数学"]],"1294989119":[null,null],"1295785983":[["Array","Hash Table","String","Sorting","Heap (Priority Queue)"],["数组","哈希表","字符串","排序","堆（优先队列）"]],"1299365979":[["String","Enumeration","Prefix Sum"],["字符串","枚举","前缀和"]],"1299928804":[["Array","Hash Table","Math","Counting"],["数组","哈希表","数学","计数"]],"1300584624":[["Trie","Array","Hash Table","String"],["字典树","数组","哈希表","字符串"]],"1300693519":[["Greedy","Math"],["贪心","数学"]],"1301810943":[["Array","Math"],["数组","数学"]],"1303368655":[["Array","Hash Table","String","Counting"],["数组","哈希表","字符串","计数"]],"1303459038":[["String"],["字符串"]],"1304520805":[["Array","Dynamic Programming"],["数组","动态规划"]],"1304985926":[["Greedy","Array","Hash Table","Two Pointers","Binary Search","Counting"],["贪心","数组","哈希表","双指针","二分查找","计数"]],"1305713613":[null,null],"1308115412":[["Recursion","Math","Dynamic Programming"],["递归","数学","动态规划"]],"1308745360":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"1310138170":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"1311511120":[["Stack","Recursion","Math","String"],["栈","递归","数学","字符串"]],"1311726140":[["Greedy","String","Heap (Priority Queue)"],["贪心","字符串","堆（优先队列）"]],"1312484096":[["Breadth-First Search","Hash Table","String"],["广度优先搜索","哈希表","字符串"]],"1312828534":[["Recursion","String","Dynamic Programming"],["递归","字符串","动态规划"]],"1316461889":[["Design","Queue","Array","Linked List","Data Stream"],["设计","队列","数组","链表","数据流"]],"1319672571":[["Queue","Array","Sorting","Simulation"],["队列","数组","排序","模拟"]],"1320293684":[["Bit Manipulation","Array"],["位运算","数组"]],"1321549485":[["Linked List"],["链表"]],"1322023785":[["Array","Hash Table","String","Counting"],["数组","哈希表","字符串","计数"]],"132290954":[["Database"],["数据库"]],"1323143155":[["Greedy","Array","Math","Binary Search","Number Theory"],["贪心","数组","数学","二分查找","数论"]],"1325042165":[["Hash Table","Linked List","Two Pointers"],["哈希表","链表","双指针"]],"132598439":[["Array","Dynamic Programming"],["数组","动态规划"]],"132633492":[["Hash Table","String","Counting","Sorting"],["哈希表","字符串","计数","排序"]],"1327909725":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"1329204486":[["Hash Table","Linked List"],["哈希表","链表"]],"1331006046":[["Stack","Design"],["栈","设计"]],"1331559454":[["String","String Matching"],["字符串","字符串匹配"]],"1331620430":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"133627469":[["Trie","Array","String","Binary Search","Sorting","Heap (Priority Queue)"],["字典树","数组","字符串","二分查找","排序","堆（优先队列）"]],"1337689329":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"1341926866":[["Tree","Depth-First Search","Dynamic Programming","Binary Tree"],["树","深度优先搜索","动态规划","二叉树"]],"1347652080":[["Math","Dynamic Programming"],["数学","动态规划"]],"1350925428":[["Array","Two Pointers"],["数组","双指针"]],"1351132676":[["Array","Math","Number Theory"],["数组","数学","数论"]],"1351904344":[["Database"],["数据库"]],"13544352":[["Depth-First Search","Breadth-First Search","Union Find","Array","Hash Table","String","Sorting"],["深度优先搜索","广度优先搜索","并查集","数组","哈希表","字符串","排序"]],"1356097871":[null,null],"1361459100":[["Depth-First Search","Breadth-First Search","Graph"],["深度优先搜索","广度优先搜索","图"]],"136239889":[["Array"],["数组"]],"1363331011":[["Bit Manipulation","Array","Hash Table","String","Sorting"],["位运算","数组","哈希表","字符串","排序"]],"1363446915":[["Bit Manipulation","Brainteaser","Array"],["位运算","脑筋急转弯","数组"]],"1364645526":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"1364762739":[["Tree","Depth-First Search","Breadth-First Search","Graph"],["树","深度优先搜索","广度优先搜索","图"]],"1365148367":[["Brainteaser","Array","Simulation"],["脑筋急转弯","数组","模拟"]],"1368317464":[["String"],["字符串"]],"1368794049":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"1370751449":[["Bit Manipulation","Array","Math","Matrix"],["位运算","数组","数学","矩阵"]],"1370775302":[["Queue","Dynamic Programming","Simulation"],["队列","动态规划","模拟"]],"137081663":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"1375391804":[["Array","String","Dynamic Programming"],["数组","字符串","动态规划"]],"1376431756":[["Array","Sliding Window"],["数组","滑动窗口"]],"1376748919":[["Stack","Recursion","Linked List","Two Pointers"],["栈","递归","链表","双指针"]],"1377831845":[["Array"],["数组"]],"1377883269":[["Greedy","Hash Table","String","Counting","Sorting","Heap (Priority Queue)"],["贪心","哈希表","字符串","计数","排序","堆（优先队列）"]],"1378497107":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"1381448562":[["Database"],["数据库"]],"1381994519":[["Bit Manipulation","Tree","Depth-First Search","Array","Dynamic Programming"],["位运算","树","深度优先搜索","数组","动态规划"]],"1385231803":[["Array","Math"],["数组","数学"]],"138718433":[["Dynamic Programming","Backtracking"],["动态规划","回溯"]],"1387834419":[["Memoization","Array","Dynamic Programming"],["记忆化搜索","数组","动态规划"]],"1392708979":[["Tree","Union Find","Binary Search Tree","Memoization","Array","Math","Divide and Conquer","Dynamic Programming","Binary Tree","Combinatorics"],["树","并查集","二叉搜索树","记忆化搜索","数组","数学","分治","动态规划","二叉树","组合数学"]],"1393055239":[["Array","Hash Table"],["数组","哈希表"]],"1395079998":[["Array","Math","Dynamic Programming"],["数组","数学","动态规划"]],"1395581223":[["Greedy","Array","Hash Table","Sorting"],["贪心","数组","哈希表","排序"]],"1399568330":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1401306104":[["Array","Backtracking"],["数组","回溯"]],"1402633459":[["Greedy","String"],["贪心","字符串"]],"1402867741":[["Array","Hash Table","String","Sorting"],["数组","哈希表","字符串","排序"]],"1403314808":[["Two Pointers","String","String Matching"],["双指针","字符串","字符串匹配"]],"1403965423":[["Array","Binary Search"],["数组","二分查找"]],"1405611181":[["Array","Hash Table","Math","Number Theory"],["数组","哈希表","数学","数论"]],"1405789151":[["Array","String"],["数组","字符串"]],"1405988519":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"1406878447":[["Database"],["数据库"]],"1409344146":[["Array","Hash Table"],["数组","哈希表"]],"1411796478":[["String"],["字符串"]],"1412203164":[["Tree","Binary Search Tree","Binary Tree"],["树","二叉搜索树","二叉树"]],"1414741845":[["Array","Dynamic Programming"],["数组","动态规划"]],"1417435719":[["Hash Table","Math"],["哈希表","数学"]],"1418471367":[["String"],["字符串"]],"1419735568":[["Database"],["数据库"]],"1420036364":[["Array","Heap (Priority Queue)"],["数组","堆（优先队列）"]],"1420249701":[["Array","Dynamic Programming"],["数组","动态规划"]],"1420390570":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"1421409652":[["Database"],["数据库"]],"1422717967":[["Bit Manipulation","Tree","Binary Search","Binary Tree"],["位运算","树","二分查找","二叉树"]],"1423912379":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"1426150563":[["Bit Manipulation","Recursion","Math"],["位运算","递归","数学"]],"1428000744":[["Array","Dynamic Programming"],["数组","动态规划"]],"1428852700":[["Array","Binary Search","Sorting","Heap (Priority Queue)"],["数组","二分查找","排序","堆（优先队列）"]],"143031678":[["String"],["字符串"]],"1430651253":[["Queue","Array","Simulation"],["队列","数组","模拟"]],"1432071996":[["Geometry","Math","Number Theory"],["几何","数学","数论"]],"1434911335":[["String","Hash Function","Rolling Hash"],["字符串","哈希函数","滚动哈希"]],"1435717617":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"1438711104":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"1438800814":[["Bit Manipulation","String"],["位运算","字符串"]],"144023621":[["Array","Binary Search","Dynamic Programming","Sliding Window","Hash Function","Rolling Hash"],["数组","二分查找","动态规划","滑动窗口","哈希函数","滚动哈希"]],"1441425352":[["Array","Binary Search"],["数组","二分查找"]],"1442274557":[["Geometry","Array","Math"],["几何","数组","数学"]],"1442563829":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"1442835646":[["Array","Dynamic Programming"],["数组","动态规划"]],"1449021558":[["Array","Sorting"],["数组","排序"]],"1449182323":[["Database"],["数据库"]],"1449546891":[["Two Pointers","String"],["双指针","字符串"]],"1450266090":[["Greedy","Array","Binary Search","Prefix Sum","Sorting"],["贪心","数组","二分查找","前缀和","排序"]],"145069778":[["Bit Manipulation","Array","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","动态规划","回溯","状态压缩"]],"1451306214":[["Array","Math","Dynamic Programming"],["数组","数学","动态规划"]],"1452093256":[["Hash Table","String"],["哈希表","字符串"]],"1454677217":[["Segment Tree","Array","Ordered Set"],["线段树","数组","有序集合"]],"1456955548":[["Array"],["数组"]],"1457368038":[["Depth-First Search","Breadth-First Search","Union Find","Graph","Hash Table"],["深度优先搜索","广度优先搜索","并查集","图","哈希表"]],"1459395051":[["Array","Math","Number Theory"],["数组","数学","数论"]],"1460194927":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"1460547008":[["Array","Math"],["数组","数学"]],"1461103201":[["Breadth-First Search","Array","Hash Table","String"],["广度优先搜索","数组","哈希表","字符串"]],"1463291583":[["Greedy","Math"],["贪心","数学"]],"1463471392":[["Array","Binary Search","Sorting","Sliding Window"],["数组","二分查找","排序","滑动窗口"]],"1464742605":[["Array","Binary Search","Prefix Sum","Sliding Window"],["数组","二分查找","前缀和","滑动窗口"]],"1466738944":[["Greedy","Array","Math","Number Theory"],["贪心","数组","数学","数论"]],"1467367970":[["Greedy","String"],["贪心","字符串"]],"1467581792":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"1467636476":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"146862112":[["Math","Binary Search"],["数学","二分查找"]],"1471696394":[["Array","Enumeration","Sorting"],["数组","枚举","排序"]],"1472553037":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"1474617560":[["Array","Hash Table","String","Dynamic Programming"],["数组","哈希表","字符串","动态规划"]],"14750873":[["Array","Enumeration"],["数组","枚举"]],"1475483634":[["String"],["字符串"]],"1478600712":[["Stack","Array","Sorting","Monotonic Stack"],["栈","数组","排序","单调栈"]],"147891676":[["String","Dynamic Programming","Simulation"],["字符串","动态规划","模拟"]],"1478945205":[["Stack","Design","Queue"],["栈","设计","队列"]],"1479673533":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1480696010":[["Array","Hash Table","Math","Counting"],["数组","哈希表","数学","计数"]],"1480774126":[["Array","Hash Table","Binary Search","Dynamic Programming","Sliding Window"],["数组","哈希表","二分查找","动态规划","滑动窗口"]],"1481976566":[["Array","String"],["数组","字符串"]],"1482300808":[["Union Find","Array","Math","Number Theory"],["并查集","数组","数学","数论"]],"1482821287":[["Math"],["数学"]],"1485423720":[["Array","Enumeration","Matrix"],["数组","枚举","矩阵"]],"1486913577":[["Array","Binary Search","Matrix","Sorting","Heap (Priority Queue)"],["数组","二分查找","矩阵","排序","堆（优先队列）"]],"1487915794":[["Array","Matrix"],["数组","矩阵"]],"1488658299":[["Array","Sorting"],["数组","排序"]],"1490013522":[["Database"],["数据库"]],"1490454383":[["Array","Dynamic Programming"],["数组","动态规划"]],"149268417":[["Array","Binary Search","Sliding Window"],["数组","二分查找","滑动窗口"]],"1493116499":[["Array","Simulation"],["数组","模拟"]],"1493274091":[["Hash Table","Linked List"],["哈希表","链表"]],"1493978161":[["Database"],["数据库"]],"1495787026":[["Array"],["数组"]],"1496544628":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"1497402060":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"1498707721":[["Greedy","Array","Matrix"],["贪心","数组","矩阵"]],"1500411729":[null,null],"1500920738":[["Database"],["数据库"]],"1501707049":[["Bit Manipulation","Array","Math"],["位运算","数组","数学"]],"1502235269":[["Array","Hash Table"],["数组","哈希表"]],"1502620621":[["Depth-First Search","Breadth-First Search","Graph"],["深度优先搜索","广度优先搜索","图"]],"1504907424":[["Design","Trie","Array","String","Data Stream"],["设计","字典树","数组","字符串","数据流"]],"1507011086":[["Array"],["数组"]],"1507332922":[["Segment Tree","Array"],["线段树","数组"]],"1507774284":[["String"],["字符串"]],"1508563965":[["Array","Hash Table","Sliding Window","Heap (Priority Queue)"],["数组","哈希表","滑动窗口","堆（优先队列）"]],"1512857430":[["String"],["字符串"]],"1515775640":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"1518041298":[["Stack","Greedy","Two Pointers","String"],["栈","贪心","双指针","字符串"]],"1518510268":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"1519348229":[["Stack","Array","Two Pointers","Dynamic Programming","Monotonic Stack"],["栈","数组","双指针","动态规划","单调栈"]],"1519983797":[["Greedy","Math","String","Game Theory"],["贪心","数学","字符串","博弈"]],"1520385101":[["Array","Simulation","Heap (Priority Queue)"],["数组","模拟","堆（优先队列）"]],"1520513992":[["Array","Two Pointers","Matrix","Simulation"],["数组","双指针","矩阵","模拟"]],"1522184936":[["Binary Indexed Tree","Segment Tree","Array","Binary Search","Divide and Conquer","Ordered Set","Merge Sort"],["树状数组","线段树","数组","二分查找","分治","有序集合","归并排序"]],"152251963":[["Greedy","Geometry","Array","Math"],["贪心","几何","数组","数学"]],"1523330486":[["Greedy","Array"],["贪心","数组"]],"1523645158":[["Tree","Depth-First Search","Graph","Topological Sort","Array","String"],["树","深度优先搜索","图","拓扑排序","数组","字符串"]],"1525551268":[["Array","Two Pointers"],["数组","双指针"]],"1525867551":[["Database"],["数据库"]],"1526363744":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"1526496677":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"1526624858":[["Tree","Depth-First Search","Breadth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","广度优先搜索","哈希表","二叉树"]],"1526976016":[["String","Simulation"],["字符串","模拟"]],"1528579119":[["Tree","Breadth-First Search","Binary Tree"],["树","广度优先搜索","二叉树"]],"1529011687":[["Math","Number Theory"],["数学","数论"]],"152903211":[null,null],"1529937689":[["Array","Math","Two Pointers","Sorting"],["数组","数学","双指针","排序"]],"1530394259":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"1530442140":[["Array","Hash Table"],["数组","哈希表"]],"1535345394":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"1537635707":[["Bit Manipulation","String"],["位运算","字符串"]],"1538966566":[["Geometry","Array","Math","Number Theory","Sorting"],["几何","数组","数学","数论","排序"]],"1539515792":[["Stack","Queue","Array","Binary Search","Dynamic Programming","Monotonic Queue","Monotonic Stack"],["栈","队列","数组","二分查找","动态规划","单调队列","单调栈"]],"1541316145":[["Array","Math","Simulation"],["数组","数学","模拟"]],"1541437811":[["Design","Array","Hash Table","Math","Randomized"],["设计","数组","哈希表","数学","随机化"]],"1541631847":[["String","Dynamic Programming"],["字符串","动态规划"]],"1542173395":[["Greedy","Array"],["贪心","数组"]],"1543621842":[["Recursion","Memoization","Math","String","Dynamic Programming"],["递归","记忆化搜索","数学","字符串","动态规划"]],"1546633713":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"1547023723":[["Two Pointers","String","Binary Search","String Matching","Hash Function","Rolling Hash"],["双指针","字符串","二分查找","字符串匹配","哈希函数","滚动哈希"]],"1547394567":[["String"],["字符串"]],"1548254728":[["Array","Two Pointers","String","Binary Search"],["数组","双指针","字符串","二分查找"]],"1548912992":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"1558678323":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"1559181224":[["Hash Table","String","Sorting"],["哈希表","字符串","排序"]],"1559330514":[["Greedy","Hash Table","Math","String","Combinatorics"],["贪心","哈希表","数学","字符串","组合数学"]],"1559448771":[["Tree","Depth-First Search","Breadth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉搜索树","二叉树"]],"1560892380":[["Linked List","Two Pointers","Divide and Conquer","Sorting","Merge Sort"],["链表","双指针","分治","排序","归并排序"]],"1561912001":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"1563663979":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"1565214769":[["Array","Math","Binary Search","Prefix Sum","Randomized"],["数组","数学","二分查找","前缀和","随机化"]],"1565495532":[["Array","Backtracking","Matrix"],["数组","回溯","矩阵"]],"1565798166":[["String","Counting"],["字符串","计数"]],"1567110694":[["Binary Indexed Tree","Segment Tree","Queue","Array","Divide and Conquer","Dynamic Programming","Monotonic Queue"],["树状数组","线段树","队列","数组","分治","动态规划","单调队列"]],"1568537869":[["Database"],["数据库"]],"1569081897":[null,null],"1569116237":[["Stack","Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["栈","树","深度优先搜索","二叉搜索树","二叉树"]],"1571048900":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"1572535871":[["Depth-First Search","Breadth-First Search","Array","Matrix","Simulation"],["深度优先搜索","广度优先搜索","数组","矩阵","模拟"]],"1575599751":[["Array","Sorting","Heap (Priority Queue)"],["数组","排序","堆（优先队列）"]],"1576603106":[["Array","Divide and Conquer"],["数组","分治"]],"1576706031":[["Array","Binary Search"],["数组","二分查找"]],"1577580678":[null,null],"1577638784":[["Stack","String"],["栈","字符串"]],"1579629689":[["Design","Array","Hash Table","Simulation"],["设计","数组","哈希表","模拟"]],"1580991625":[["Bit Manipulation","Array","Math","Dynamic Programming","Backtracking","Bitmask","Number Theory"],["位运算","数组","数学","动态规划","回溯","状态压缩","数论"]],"1582953363":[["Stack","String","Simulation"],["栈","字符串","模拟"]],"1583176635":[["Linked List","Divide and Conquer","Heap (Priority Queue)","Merge Sort"],["链表","分治","堆（优先队列）","归并排序"]],"1583349779":[["Bit Manipulation","Array","Hash Table","String","Prefix Sum"],["位运算","数组","哈希表","字符串","前缀和"]],"158335627":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"1584359446":[["Tree","Depth-First Search"],["树","深度优先搜索"]],"1586756425":[null,null],"1589710386":[["Tree","Depth-First Search","Dynamic Programming","Binary Tree"],["树","深度优先搜索","动态规划","二叉树"]],"1590024460":[["Brainteaser","Array","Prefix Sum","Sorting"],["脑筋急转弯","数组","前缀和","排序"]],"159003173":[["Memoization","Math","Dynamic Programming"],["记忆化搜索","数学","动态规划"]],"1590273508":[["Array","Dynamic Programming"],["数组","动态规划"]],"1590551370":[["Database"],["数据库"]],"159231277":[["Math","Enumeration"],["数学","枚举"]],"1592995979":[["Array","String"],["数组","字符串"]],"1598113371":[["Array","Counting","Matrix"],["数组","计数","矩阵"]],"1598128796":[["Array","Divide and Conquer","Quickselect","Sorting"],["数组","分治","快速选择","排序"]],"1598976020":[["Database"],["数据库"]],"1599758478":[["Array","Linked List","Matrix","Simulation"],["数组","链表","矩阵","模拟"]],"1601603749":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1602330770":[["Math"],["数学"]],"1603806327":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"1603834737":[["Greedy","Array"],["贪心","数组"]],"1603972964":[["Stack","Tree","Array","Divide and Conquer","Binary Tree","Monotonic Stack"],["栈","树","数组","分治","二叉树","单调栈"]],"1604381884":[["Depth-First Search","Breadth-First Search","Graph","Geometry","Array","Math"],["深度优先搜索","广度优先搜索","图","几何","数组","数学"]],"1610031866":[["Hash Table","String","Enumeration"],["哈希表","字符串","枚举"]],"1610939039":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"16117382":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1614249365":[["Math"],["数学"]],"1615136281":[["Array","Math","Interactive"],["数组","数学","交互"]],"1615798591":[["String","Simulation"],["字符串","模拟"]],"161597751":[["Array"],["数组"]],"1616359180":[["Array","String"],["数组","字符串"]],"1618480669":[["Array","Two Pointers"],["数组","双指针"]],"1619143061":[["String"],["字符串"]],"1620091732":[["Array","Math","Number Theory","Sorting","Heap (Priority Queue)"],["数组","数学","数论","排序","堆（优先队列）"]],"1620228801":[["String","Backtracking"],["字符串","回溯"]],"1620549524":[["Greedy","Array","Hash Table"],["贪心","数组","哈希表"]],"1620554900":[["Greedy","Array","Two Pointers","Prefix Sum","Sorting","Heap (Priority Queue)"],["贪心","数组","双指针","前缀和","排序","堆（优先队列）"]],"1621119601":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"162304303":[["Array","Math","Dynamic Programming"],["数组","数学","动态规划"]],"1627181507":[["Breadth-First Search","Union Find","Graph"],["广度优先搜索","并查集","图"]],"1627389455":[["Array","Backtracking"],["数组","回溯"]],"1627868267":[["Array","Binary Search"],["数组","二分查找"]],"1628732610":[["Database"],["数据库"]],"1628732687":[["Bit Manipulation","Memoization","Array","Dynamic Programming","Backtracking","Bitmask"],["位运算","记忆化搜索","数组","动态规划","回溯","状态压缩"]],"1629080001":[["Hash Table","Math","Dynamic Programming","Heap (Priority Queue)"],["哈希表","数学","动态规划","堆（优先队列）"]],"1629689602":[["Array","Hash Table","Prefix Sum","Sliding Window"],["数组","哈希表","前缀和","滑动窗口"]],"163006863":[["Bit Manipulation","Array"],["位运算","数组"]],"1632383781":[["Greedy","String"],["贪心","字符串"]],"1632602455":[["Queue","Array","Sliding Window","Monotonic Queue","Heap (Priority Queue)"],["队列","数组","滑动窗口","单调队列","堆（优先队列）"]],"1635315111":[["Array","Hash Table","String","Matrix","Simulation"],["数组","哈希表","字符串","矩阵","模拟"]],"163704669":[["Database"],["数据库"]],"1637468390":[["Array"],["数组"]],"1640158797":[["Greedy","Two Pointers","String"],["贪心","双指针","字符串"]],"1642092986":[["Union Find","Array","Math","Number Theory","Sorting"],["并查集","数组","数学","数论","排序"]],"164313417":[["Greedy","Recursion","String","Dynamic Programming"],["贪心","递归","字符串","动态规划"]],"1643291393":[["Tree","Depth-First Search","Breadth-First Search","Design","Hash Table","Binary Tree"],["树","深度优先搜索","广度优先搜索","设计","哈希表","二叉树"]],"1644032538":[["Greedy","Bit Manipulation","Array","Hash Table"],["贪心","位运算","数组","哈希表"]],"1644520119":[["Array","Divide and Conquer","Quickselect","Sorting","Heap (Priority Queue)"],["数组","分治","快速选择","排序","堆（优先队列）"]],"1645223251":[["Hash Table","String","Binary Search","Counting","Sliding Window"],["哈希表","字符串","二分查找","计数","滑动窗口"]],"1645809775":[["Greedy","Array","Hash Table","Sorting"],["贪心","数组","哈希表","排序"]],"1646187623":[["Graph","Topological Sort","Array","Matrix"],["图","拓扑排序","数组","矩阵"]],"1648003092":[["Recursion","Linked List"],["递归","链表"]],"1649292854":[["Array","Math"],["数组","数学"]],"1650421130":[["Greedy","Array","Hash Table","Sorting","Simulation","Heap (Priority Queue)"],["贪心","数组","哈希表","排序","模拟","堆（优先队列）"]],"1651110316":[["Two Pointers","String"],["双指针","字符串"]],"165157096":[["Array"],["数组"]],"1652287983":[null,null],"1652509718":[["Depth-First Search","Breadth-First Search","Union Find","Array","Hash Table","String","Counting"],["深度优先搜索","广度优先搜索","并查集","数组","哈希表","字符串","计数"]],"1653571628":[["Binary Indexed Tree","Segment Tree","Array","Binary Search","Divide and Conquer","Ordered Set","Merge Sort"],["树状数组","线段树","数组","二分查找","分治","有序集合","归并排序"]],"1655779586":[["Array","Dynamic Programming"],["数组","动态规划"]],"1656858690":[["Array","Sorting","Heap (Priority Queue)"],["数组","排序","堆（优先队列）"]],"1658221095":[["Array","Sliding Window"],["数组","滑动窗口"]],"1658347329":[["Array"],["数组"]],"1658547847":[["Graph","Dynamic Programming"],["图","动态规划"]],"1659259166":[["Greedy","Array"],["贪心","数组"]],"1659585642":[["Array","Math"],["数组","数学"]],"1661781078":[["Greedy","Array","Prefix Sum"],["贪心","数组","前缀和"]],"1665689312":[["Greedy","Array","Math","Sorting"],["贪心","数组","数学","排序"]],"1670099365":[["Greedy","Array","Two Pointers","Sorting"],["贪心","数组","双指针","排序"]],"1671137181":[["Breadth-First Search","Segment Tree","Array","Dynamic Programming"],["广度优先搜索","线段树","数组","动态规划"]],"1672314711":[null,null],"1676080206":[["Dynamic Programming"],["动态规划"]],"1676364478":[["Array","Hash Table"],["数组","哈希表"]],"1676853681":[["Hash Table","String","Sorting"],["哈希表","字符串","排序"]],"1677121627":[["Stack","Depth-First Search","Breadth-First Search"],["栈","深度优先搜索","广度优先搜索"]],"1677761084":[["Array","Hash Table"],["数组","哈希表"]],"1678691482":[["String","Dynamic Programming"],["字符串","动态规划"]],"1680726791":[["Database"],["数据库"]],"1684031079":[["Bit Manipulation","Recursion","Brainteaser"],["位运算","递归","脑筋急转弯"]],"1684868302":[["Math","Two Pointers","String"],["数学","双指针","字符串"]],"1687003236":[["Array","Dynamic Programming"],["数组","动态规划"]],"1687104096":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1687639369":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"1688453804":[["Array","Two Pointers","String"],["数组","双指针","字符串"]],"1689171801":[["Greedy","Array","Binary Search","Prefix Sum","Sorting"],["贪心","数组","二分查找","前缀和","排序"]],"1689274423":[["Array","Dynamic Programming"],["数组","动态规划"]],"168963992":[["Array","Hash Table","String","Binary Search","Sorting"],["数组","哈希表","字符串","二分查找","排序"]],"1690861934":[["Tree","Depth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","哈希表","二叉树"]],"1691357385":[["Array","Math","Number Theory","Sorting"],["数组","数学","数论","排序"]],"1691609067":[["Queue","Array","Dynamic Programming","Sliding Window","Monotonic Queue","Heap (Priority Queue)"],["队列","数组","动态规划","滑动窗口","单调队列","堆（优先队列）"]],"1692006284":[["Union Find","String"],["并查集","字符串"]],"169260234":[["Array","Dynamic Programming","Sorting"],["数组","动态规划","排序"]],"1692861209":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"1693120207":[["Bit Manipulation","Depth-First Search","Breadth-First Search","Math"],["位运算","深度优先搜索","广度优先搜索","数学"]],"1693289551":[["Stack","String","Dynamic Programming"],["栈","字符串","动态规划"]],"1694505048":[["Math"],["数学"]],"1695696277":[["Hash Table","Two Pointers","String"],["哈希表","双指针","字符串"]],"169616499":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"1697433369":[["Bit Manipulation","Brainteaser","Array","Math","Game Theory"],["位运算","脑筋急转弯","数组","数学","博弈"]],"1697537146":[["Array","Dynamic Programming"],["数组","动态规划"]],"1698302709":[["Bit Manipulation","Array","Dynamic Programming","Bitmask","Matrix"],["位运算","数组","动态规划","状态压缩","矩阵"]],"16997305":[["Greedy","Array","Two Pointers","Binary Search","Sorting"],["贪心","数组","双指针","二分查找","排序"]],"170017720":[["Array","String","Simulation"],["数组","字符串","模拟"]],"1700620911":[["Depth-First Search","Breadth-First Search","Memoization","Array","Dynamic Programming","Matrix"],["深度优先搜索","广度优先搜索","记忆化搜索","数组","动态规划","矩阵"]],"1702334810":[["Greedy","Array","Prefix Sum","Sorting"],["贪心","数组","前缀和","排序"]],"1705265155":[["Database"],["数据库"]],"1705502932":[["Design","Array","Hash Table","Linked List","Hash Function"],["设计","数组","哈希表","链表","哈希函数"]],"1706210690":[["Stack","Tree","Depth-First Search","Binary Search Tree","Linked List","Binary Tree"],["栈","树","深度优先搜索","二叉搜索树","链表","二叉树"]],"1706598413":[["Greedy","Array","Hash Table","Sorting","Heap (Priority Queue)"],["贪心","数组","哈希表","排序","堆（优先队列）"]],"1708402068":[["Bit Manipulation","Binary Search","Dynamic Programming"],["位运算","二分查找","动态规划"]],"1709397559":[["Stack","Recursion","Linked List","Two Pointers"],["栈","递归","链表","双指针"]],"1709868853":[["Bit Manipulation","Array","Hash Table","String"],["位运算","数组","哈希表","字符串"]],"1712826586":[["Math","Binary Search","Number Theory"],["数学","二分查找","数论"]],"1713279396":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"1714015866":[["Array","Dynamic Programming"],["数组","动态规划"]],"1715714434":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"1716064379":[["String"],["字符串"]],"1716121258":[["Database"],["数据库"]],"1716454945":[["Linked List","Two Pointers"],["链表","双指针"]],"1716625654":[["Array","Hash Table","Simulation"],["数组","哈希表","模拟"]],"1716876773":[null,null],"1717721751":[["Breadth-First Search","Hash Table","String"],["广度优先搜索","哈希表","字符串"]],"1717938721":[["Design","Hash Table","Linked List","Doubly-Linked List"],["设计","哈希表","链表","双向链表"]],"1721774399":[["Linked List"],["链表"]],"1722855645":[["Dynamic Programming"],["动态规划"]],"1723985703":[["Array","Dynamic Programming"],["数组","动态规划"]],"1725183127":[["Array"],["数组"]],"1728101846":[["Math","Enumeration"],["数学","枚举"]],"1729126971":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"1729291424":[["Bit Manipulation","Array","Hash Table","Counting"],["位运算","数组","哈希表","计数"]],"1729563423":[["Stack","Tree","Depth-First Search","Binary Search Tree","Linked List","Binary Tree","Doubly-Linked List"],["栈","树","深度优先搜索","二叉搜索树","链表","二叉树","双向链表"]],"1729632427":[["Bit Manipulation","Hash Table","String"],["位运算","哈希表","字符串"]],"1730213489":[["Stack","Breadth-First Search","String","Backtracking"],["栈","广度优先搜索","字符串","回溯"]],"1730633271":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"1732202044":[["Array","Math"],["数组","数学"]],"1733046404":[["Stack","Array","Dynamic Programming","Ordered Set","Monotonic Stack"],["栈","数组","动态规划","有序集合","单调栈"]],"173367747":[["Greedy","Bit Manipulation","Math"],["贪心","位运算","数学"]],"1734419421":[["Bit Manipulation","Math","Simulation"],["位运算","数学","模拟"]],"1735669790":[["Two Pointers","String"],["双指针","字符串"]],"1737160601":[["Greedy","Array","Math","Sorting"],["贪心","数组","数学","排序"]],"1737197781":[["Array","Hash Table","Counting","Sorting","Sliding Window"],["数组","哈希表","计数","排序","滑动窗口"]],"1737726232":[["Array","Hash Table","Counting","Sorting"],["数组","哈希表","计数","排序"]],"173858556":[["Breadth-First Search","Array","Dynamic Programming","Matrix"],["广度优先搜索","数组","动态规划","矩阵"]],"1742391300":[["Design","Hash Table","Heap (Priority Queue)"],["设计","哈希表","堆（优先队列）"]],"1742923454":[["Array","Dynamic Programming"],["数组","动态规划"]],"174306863":[["Array","Hash Table","Two Pointers","Binary Search","Sorting"],["数组","哈希表","双指针","二分查找","排序"]],"1744896373":[["Memoization","Array","Dynamic Programming","Matrix"],["记忆化搜索","数组","动态规划","矩阵"]],"174800301":[["Bit Manipulation","Array","Math","Dynamic Programming","Bitmask"],["位运算","数组","数学","动态规划","状态压缩"]],"174896176":[["Array","Bucket Sort","Ordered Set","Sorting","Sliding Window"],["数组","桶排序","有序集合","排序","滑动窗口"]],"1749795074":[["Greedy","String"],["贪心","字符串"]],"1750704590":[null,null],"1751494517":[["Math"],["数学"]],"1751556023":[["Design","Array","Hash Table","Two Pointers","Data Stream"],["设计","数组","哈希表","双指针","数据流"]],"1752876661":[["Design","Segment Tree","Binary Search","Ordered Set"],["设计","线段树","二分查找","有序集合"]],"175297842":[["Hash Table","Linked List","Two Pointers"],["哈希表","链表","双指针"]],"1753460304":[["Math"],["数学"]],"1756727384":[["Array","Hash Table","String","Sorting"],["数组","哈希表","字符串","排序"]],"1757313368":[["Database"],["数据库"]],"1757955047":[["Array","Math","Dynamic Programming","Prefix Sum"],["数组","数学","动态规划","前缀和"]],"1762249323":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"1762990534":[["Bit Manipulation","Array","String","Dynamic Programming","Bitmask"],["位运算","数组","字符串","动态规划","状态压缩"]],"1763436987":[["Array","Hash Table","Two Pointers","Counting","Sorting"],["数组","哈希表","双指针","计数","排序"]],"1765623393":[["Database"],["数据库"]],"1766481102":[["Array"],["数组"]],"1767826160":[["Greedy","Binary Search"],["贪心","二分查找"]],"177009894":[["Math","Simulation"],["数学","模拟"]],"1770113758":[["Linked List","Simulation"],["链表","模拟"]],"1770146920":[["Database"],["数据库"]],"1775341601":[["Graph","Topological Sort","Memoization","Hash Table","Dynamic Programming","Counting"],["图","拓扑排序","记忆化搜索","哈希表","动态规划","计数"]],"1777414306":[["Array","String"],["数组","字符串"]],"1779691327":[["Trie","Array","Hash Table","String"],["字典树","数组","哈希表","字符串"]],"1779771436":[["Trie","Array","Hash Table","String","Dynamic Programming"],["字典树","数组","哈希表","字符串","动态规划"]],"178132881":[["Greedy","Array","Hash Table","Binary Search","Heap (Priority Queue)"],["贪心","数组","哈希表","二分查找","堆（优先队列）"]],"1782593021":[["Math"],["数学"]],"1783870964":[["Array","Math","Combinatorics","Simulation"],["数组","数学","组合数学","模拟"]],"1784467838":[["Database"],["数据库"]],"1784527717":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"1785363546":[["Binary Indexed Tree","Segment Tree","Array","Binary Search","Divide and Conquer","Ordered Set","Merge Sort"],["树状数组","线段树","数组","二分查找","分治","有序集合","归并排序"]],"1785554828":[["Bit Manipulation","Math","String"],["位运算","数学","字符串"]],"1785562293":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"1786275394":[["Tree","Depth-First Search","Breadth-First Search","Array","Hash Table"],["树","深度优先搜索","广度优先搜索","数组","哈希表"]],"1786656286":[["Array","Matrix","Sorting"],["数组","矩阵","排序"]],"178669910":[["Math"],["数学"]],"178720857":[["Greedy","String"],["贪心","字符串"]],"1787510201":[["Stack","Memoization","Array","Math","String","Dynamic Programming"],["栈","记忆化搜索","数组","数学","字符串","动态规划"]],"1787879890":[["Depth-First Search","Breadth-First Search","Array"],["深度优先搜索","广度优先搜索","数组"]],"1788564041":[["Array","Dynamic Programming"],["数组","动态规划"]],"1788773531":[["Design","Hash Table","String"],["设计","哈希表","字符串"]],"1791591007":[["Design","Array","Hash Table","Two Pointers"],["设计","数组","哈希表","双指针"]],"1795607316":[null,null],"1796150705":[["Hash Table","Math"],["哈希表","数学"]],"1796587921":[["String","Dynamic Programming"],["字符串","动态规划"]],"179744631":[["Database"],["数据库"]],"1799515663":[["Design","Two Pointers","Data Stream","Sorting","Heap (Priority Queue)"],["设计","双指针","数据流","排序","堆（优先队列）"]],"1800599582":[["Array","String","Enumeration"],["数组","字符串","枚举"]],"1801481840":[["Hash Table","String","Backtracking"],["哈希表","字符串","回溯"]],"1802692575":[["Array","Hash Table","Matrix","Prefix Sum"],["数组","哈希表","矩阵","前缀和"]],"1808561792":[["Graph"],["图"]],"1808920633":[["Database"],["数据库"]],"1809536358":[["Array","Dynamic Programming"],["数组","动态规划"]],"1810947088":[["Dynamic Programming"],["动态规划"]],"1811191434":[["Trie","Array","Hash Table","String"],["字典树","数组","哈希表","字符串"]],"1811529317":[["Graph","Topological Sort","Memoization","Math","Dynamic Programming","Game Theory"],["图","拓扑排序","记忆化搜索","数学","动态规划","博弈"]],"1814552069":[["Array","Prefix Sum"],["数组","前缀和"]],"1815012340":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"1815395495":[["Greedy","Array","Matrix","Sorting"],["贪心","数组","矩阵","排序"]],"1816159434":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"1816814719":[["Array","Two Pointers","Binary Search","Enumeration"],["数组","双指针","二分查找","枚举"]],"181840890":[["Design","Queue","Data Stream"],["设计","队列","数据流"]],"1819395589":[["Stack","Greedy","Array","Sorting","Monotonic Stack"],["栈","贪心","数组","排序","单调栈"]],"1821672989":[["Depth-First Search","Breadth-First Search","Concurrency"],["深度优先搜索","广度优先搜索","多线程"]],"1821812912":[["Trie","Array","Hash Table","String","String Matching"],["字典树","数组","哈希表","字符串","字符串匹配"]],"1823999301":[["Graph","Topological Sort","Dynamic Programming","Shortest Path","Heap (Priority Queue)"],["图","拓扑排序","动态规划","最短路","堆（优先队列）"]],"1825399219":[["Breadth-First Search","Graph"],["广度优先搜索","图"]],"1828505458":[["Array","Two Pointers","Binary Search","Sorting","Sliding Window","Heap (Priority Queue)"],["数组","双指针","二分查找","排序","滑动窗口","堆（优先队列）"]],"1829348697":[null,null],"183030256":[["Array","Hash Table","Simulation"],["数组","哈希表","模拟"]],"183184140":[["Array","Binary Search"],["数组","二分查找"]],"1833766982":[["Array","Math","Two Pointers"],["数组","数学","双指针"]],"1834196732":[["Design","Queue","Array","Hash Table","Linked List"],["设计","队列","数组","哈希表","链表"]],"1837402011":[["Tree","Binary Search Tree","Linked List","Divide and Conquer","Binary Tree"],["树","二叉搜索树","链表","分治","二叉树"]],"1837734149":[["Hash Table","Linked List","Two Pointers"],["哈希表","链表","双指针"]],"1839844018":[["Bit Manipulation","Recursion","Math"],["位运算","递归","数学"]],"1840192802":[["Tree","Depth-First Search","Binary Tree","String Matching","Hash Function"],["树","深度优先搜索","二叉树","字符串匹配","哈希函数"]],"184027593":[["Hash Table","String","Backtracking"],["哈希表","字符串","回溯"]],"1840572711":[["Greedy","Depth-First Search","Breadth-First Search","Union Find","Graph"],["贪心","深度优先搜索","广度优先搜索","并查集","图"]],"1840603422":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"1843086828":[["Greedy","Two Pointers","String"],["贪心","双指针","字符串"]],"1844354140":[["Bit Manipulation","Array","Math","Dynamic Programming","Bitmask"],["位运算","数组","数学","动态规划","状态压缩"]],"1844925263":[["Database"],["数据库"]],"1846293530":[["Array","Math","Prefix Sum"],["数组","数学","前缀和"]],"1848363653":[["Bit Manipulation"],["位运算"]],"1848372638":[["Array"],["数组"]],"1849060569":[["Array","Binary Search","Sorting"],["数组","二分查找","排序"]],"1850684924":[["Database"],["数据库"]],"1850921957":[["Greedy","Math","Sorting"],["贪心","数学","排序"]],"18516592":[["Geometry","Math","Rejection Sampling","Randomized"],["几何","数学","拒绝采样","随机化"]],"1853031865":[["Greedy","Tree","Array","Dynamic Programming","Binary Tree"],["贪心","树","数组","动态规划","二叉树"]],"1853208613":[["Math","Enumeration","Number Theory"],["数学","枚举","数论"]],"1856172895":[["Queue","Array","Binary Search","Prefix Sum","Sliding Window","Heap (Priority Queue)"],["队列","数组","二分查找","前缀和","滑动窗口","堆（优先队列）"]],"185620528":[["Greedy","Math","Heap (Priority Queue)"],["贪心","数学","堆（优先队列）"]],"1856992647":[["Array","Dynamic Programming"],["数组","动态规划"]],"1857363494":[["String","Dynamic Programming"],["字符串","动态规划"]],"1857526630":[["Array","Hash Table","Matrix"],["数组","哈希表","矩阵"]],"1858278973":[["Array","Binary Search"],["数组","二分查找"]],"1858334582":[["Design","Queue","Array","Data Stream"],["设计","队列","数组","数据流"]],"1859819274":[["Design","Array","Hash Table"],["设计","数组","哈希表"]],"1861285155":[["Dynamic Programming"],["动态规划"]],"1862854561":[["Array","Binary Search","Divide and Conquer","Matrix"],["数组","二分查找","分治","矩阵"]],"1863065807":[["Math"],["数学"]],"186354366":[["Stack","Array","Dynamic Programming","Matrix","Monotonic Stack"],["栈","数组","动态规划","矩阵","单调栈"]],"1866851323":[["Array","Prefix Sum"],["数组","前缀和"]],"1869987706":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1871665913":[["Math","String"],["数学","字符串"]],"1872112615":[["Greedy","Array","Two Pointers"],["贪心","数组","双指针"]],"1872306454":[["Stack","Design","Array"],["栈","设计","数组"]],"1872693779":[["Database"],["数据库"]],"1872980159":[["Stack","Array","Linked List","Monotonic Stack"],["栈","数组","链表","单调栈"]],"1876544260":[["Tree","Depth-First Search","Hash Table","Binary Search","Binary Tree"],["树","深度优先搜索","哈希表","二分查找","二叉树"]],"1878147567":[["Array","String Matching","Hash Function","Rolling Hash"],["数组","字符串匹配","哈希函数","滚动哈希"]],"1879020884":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"187940940":[["Depth-First Search","Breadth-First Search","Array","Matrix","Strongly Connected Component"],["深度优先搜索","广度优先搜索","数组","矩阵","强连通分量"]],"188352287":[["Stack","Array","Linked List","Monotonic Stack"],["栈","数组","链表","单调栈"]],"1888433713":[["Array","Two Pointers"],["数组","双指针"]],"1890921841":[["Bit Manipulation","Array","Sorting"],["位运算","数组","排序"]],"1894806233":[["Array","Hash Table"],["数组","哈希表"]],"1895265333":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"1896099954":[["Array","Counting Sort","Sorting"],["数组","计数排序","排序"]],"1896286191":[["Breadth-First Search","Graph","Shortest Path"],["广度优先搜索","图","最短路"]],"1900062857":[["Array","String"],["数组","字符串"]],"1901788005":[["Database"],["数据库"]],"1903617238":[["Greedy","Memoization","String","Dynamic Programming"],["贪心","记忆化搜索","字符串","动态规划"]],"1907819963":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"1908656857":[["String","Counting"],["字符串","计数"]],"191054580":[["Depth-First Search","Linked List","Doubly-Linked List"],["深度优先搜索","链表","双向链表"]],"1910869482":[["Array","Dynamic Programming","Backtracking"],["数组","动态规划","回溯"]],"1911968707":[["String"],["字符串"]],"1912276022":[["Math","String","Sorting"],["数学","字符串","排序"]],"1913049602":[["Bit Manipulation","Array","Backtracking","Enumeration","Matrix"],["位运算","数组","回溯","枚举","矩阵"]],"1913093520":[["String"],["字符串"]],"1913772288":[["Array","Dynamic Programming","Backtracking","Sorting"],["数组","动态规划","回溯","排序"]],"1915453170":[["Array","Binary Search","Sorting"],["数组","二分查找","排序"]],"1915472102":[["String","Dynamic Programming"],["字符串","动态规划"]],"1915862517":[["Bit Manipulation","Array","Dynamic Programming"],["位运算","数组","动态规划"]],"1916011706":[["Database"],["数据库"]],"191620507":[["Greedy","Array"],["贪心","数组"]],"1916400350":[["Array","Dynamic Programming"],["数组","动态规划"]],"1917964581":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"1918172852":[["Array","Binary Search","Prefix Sum","Sorting"],["数组","二分查找","前缀和","排序"]],"191868779":[["Database"],["数据库"]],"1922249884":[["String"],["字符串"]],"1924690238":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"1927271954":[["Array","Hash Table","Enumeration"],["数组","哈希表","枚举"]],"1931269506":[["Array","Prefix Sum"],["数组","前缀和"]],"1933270834":[["Array","Dynamic Programming"],["数组","动态规划"]],"1934109716":[null,null],"1937730923":[["Greedy","Tree","Depth-First Search","Binary Search Tree","Divide and Conquer","Binary Tree"],["贪心","树","深度优先搜索","二叉搜索树","分治","二叉树"]],"1938120357":[["Greedy","Array","Dynamic Programming","Sorting"],["贪心","数组","动态规划","排序"]],"193891104":[["Database"],["数据库"]],"1939591666":[["Binary Search","Interactive"],["二分查找","交互"]],"1940606693":[["Concurrency"],["多线程"]],"1941288004":[["Tree","Depth-First Search","Breadth-First Search","Linked List","Binary Tree"],["树","深度优先搜索","广度优先搜索","链表","二叉树"]],"194431856":[["Trie","String"],["字典树","字符串"]],"1944526967":[["Array","Binary Search","Dynamic Programming","Sorting"],["数组","二分查找","动态规划","排序"]],"1947285534":[["Array","Two Pointers","Simulation"],["数组","双指针","模拟"]],"1947586492":[["String","Dynamic Programming"],["字符串","动态规划"]],"1948562758":[["Math","Enumeration"],["数学","枚举"]],"1950501535":[["Greedy","String","Counting","Heap (Priority Queue)"],["贪心","字符串","计数","堆（优先队列）"]],"1950962783":[["Union Find","Array","Hash Table","Math","Number Theory"],["并查集","数组","哈希表","数学","数论"]],"1951198460":[["Greedy","Two Pointers","String"],["贪心","双指针","字符串"]],"1952470548":[["Math"],["数学"]],"1953428992":[["Tree","Binary Search Tree","Dynamic Programming","Backtracking","Binary Tree"],["树","二叉搜索树","动态规划","回溯","二叉树"]],"1953613506":[["Bit Manipulation","Backtracking"],["位运算","回溯"]],"1954801587":[["Greedy","Array","Math","Game Theory","Sorting","Heap (Priority Queue)"],["贪心","数组","数学","博弈","排序","堆（优先队列）"]],"1955132435":[["Tree","Depth-First Search","Dynamic Programming","Binary Tree"],["树","深度优先搜索","动态规划","二叉树"]],"1959436312":[["Array","Math","Binary Search","Number Theory"],["数组","数学","二分查找","数论"]],"1959774558":[["Bit Manipulation","Array","Dynamic Programming"],["位运算","数组","动态规划"]],"1959869314":[["Tree","Math","Binary Tree"],["树","数学","二叉树"]],"1959906977":[["Math"],["数学"]],"1961138257":[["Stack","Array","Math","Monotonic Stack","Heap (Priority Queue)"],["栈","数组","数学","单调栈","堆（优先队列）"]],"1962061945":[["Greedy","Bit Manipulation","Array","Prefix Sum"],["贪心","位运算","数组","前缀和"]],"1962441710":[["Math","String","Enumeration"],["数学","字符串","枚举"]],"1962595835":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"1964424077":[["Database"],["数据库"]],"1965294189":[["String","Dynamic Programming"],["字符串","动态规划"]],"1965686195":[["Geometry","Array","Hash Table","Math","Sorting"],["几何","数组","哈希表","数学","排序"]],"1965849899":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"1966056783":[["Array","Binary Search"],["数组","二分查找"]],"1966082997":[["Database"],["数据库"]],"1967582342":[["Database"],["数据库"]],"1969742700":[["Array","Simulation"],["数组","模拟"]],"1970717834":[["Hash Table","String"],["哈希表","字符串"]],"1971257507":[["String","Dynamic Programming"],["字符串","动态规划"]],"1972717643":[["String"],["字符串"]],"1972718658":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"19753391":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"197546078":[["Array","Matrix"],["数组","矩阵"]],"1975607113":[["Bit Manipulation","Array","Binary Search","Sliding Window"],["位运算","数组","二分查找","滑动窗口"]],"1977084622":[["Breadth-First Search","Array","Dynamic Programming","Matrix"],["广度优先搜索","数组","动态规划","矩阵"]],"1977813892":[["Recursion","Math","String"],["递归","数学","字符串"]],"1979291413":[["Tree","Depth-First Search","Breadth-First Search","Binary Search Tree","Hash Table","Two Pointers","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉搜索树","哈希表","双指针","二叉树"]],"1980479000":[["Array","Hash Table"],["数组","哈希表"]],"1982730574":[["Array","Two Pointers"],["数组","双指针"]],"1983440257":[["Two Pointers","String"],["双指针","字符串"]],"1987916479":[["Two Pointers","String"],["双指针","字符串"]],"1988055821":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort","Memoization","Array","Dynamic Programming","Matrix"],["深度优先搜索","广度优先搜索","图","拓扑排序","记忆化搜索","数组","动态规划","矩阵"]],"1989002691":[["Stack","Tree","Depth-First Search","Linked List","Binary Tree"],["栈","树","深度优先搜索","链表","二叉树"]],"1992185659":[["Array","Binary Search"],["数组","二分查找"]],"1992807056":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"199553622":[["String","Simulation"],["字符串","模拟"]],"1995566378":[["Linked List"],["链表"]],"1997275023":[["Tree","Depth-First Search","Breadth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","广度优先搜索","哈希表","二叉树"]],"1997404036":[["String","Simulation"],["字符串","模拟"]],"1997507835":[["Database"],["数据库"]],"1997987860":[["Greedy","Array","Sorting","Heap (Priority Queue)"],["贪心","数组","排序","堆（优先队列）"]],"2000679742":[["Tree","Depth-First Search","Breadth-First Search","Design","Binary Search","Dynamic Programming"],["树","深度优先搜索","广度优先搜索","设计","二分查找","动态规划"]],"2001412357":[["Design","Hash Table","Linked List","Doubly-Linked List"],["设计","哈希表","链表","双向链表"]],"2001540741":[["Greedy","Array","Dynamic Programming","Sorting"],["贪心","数组","动态规划","排序"]],"2003223492":[["Array","Backtracking"],["数组","回溯"]],"2005932973":[["Bit Manipulation","Trie","Array","Hash Table"],["位运算","字典树","数组","哈希表"]],"2006213514":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"2006522396":[null,null],"2006725411":[["Memoization","Math","Dynamic Programming"],["记忆化搜索","数学","动态规划"]],"2007370712":[["Array","Matrix"],["数组","矩阵"]],"2010735377":[["Database"],["数据库"]],"2011226653":[null,null],"2011811439":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"2012204931":[["Tree","Design","Binary Search Tree","Binary Tree","Data Stream","Heap (Priority Queue)"],["树","设计","二叉搜索树","二叉树","数据流","堆（优先队列）"]],"2012982950":[["Array","String","Prefix Sum"],["数组","字符串","前缀和"]],"2014057820":[["Greedy","Array","Hash Table","Sorting"],["贪心","数组","哈希表","排序"]],"2015120605":[["Array","Hash Table","Divide and Conquer","Bucket Sort","Counting","Quickselect","Sorting","Heap (Priority Queue)"],["数组","哈希表","分治","桶排序","计数","快速选择","排序","堆（优先队列）"]],"2015814436":[["Bit Manipulation","Array","Dynamic Programming","Bitmask"],["位运算","数组","动态规划","状态压缩"]],"2017058203":[["Database"],["数据库"]],"2018559703":[["Stack","Recursion","String"],["栈","递归","字符串"]],"2018741992":[["Stack","Design","Binary Indexed Tree","Array","Hash Table","Ordered Set"],["栈","设计","树状数组","数组","哈希表","有序集合"]],"2018971200":[["Array","Hash Table","Sorting","Heap (Priority Queue)"],["数组","哈希表","排序","堆（优先队列）"]],"2019191135":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"2021188790":[["Greedy","Array"],["贪心","数组"]],"2021376917":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"2024934932":[["Greedy","Array","Hash Table","Counting","Sorting","Heap (Priority Queue)"],["贪心","数组","哈希表","计数","排序","堆（优先队列）"]],"202527271":[["Depth-First Search","Breadth-First Search","Graph","Shortest Path","Heap (Priority Queue)"],["深度优先搜索","广度优先搜索","图","最短路","堆（优先队列）"]],"2025736930":[["Design","Array","Hash Table","String"],["设计","数组","哈希表","字符串"]],"2025960825":[["Array","Hash Table","Two Pointers"],["数组","哈希表","双指针"]],"2027773900":[["Graph","Array","Backtracking"],["图","数组","回溯"]],"2028541392":[["Graph","Array","Biconnected Component"],["图","数组","双连通分量"]],"2033240857":[["Bit Manipulation","Array","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","动态规划","回溯","状态压缩"]],"203427637":[["Depth-First Search","Breadth-First Search","Array","Binary Search","Matrix"],["深度优先搜索","广度优先搜索","数组","二分查找","矩阵"]],"2035240287":[["Binary Indexed Tree","Geometry","Array","Math"],["树状数组","几何","数组","数学"]],"2035720970":[["Stack","Greedy","String"],["栈","贪心","字符串"]],"2036550762":[["Database"],["数据库"]],"2036642817":[["Array","Two Pointers","Simulation"],["数组","双指针","模拟"]],"2037819195":[["Database"],["数据库"]],"2037923639":[["String","Dynamic Programming"],["字符串","动态规划"]],"2038074520":[["Recursion","String"],["递归","字符串"]],"2038782260":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"2041342956":[["Array","Binary Search","Matrix","Prefix Sum"],["数组","二分查找","矩阵","前缀和"]],"2043678372":[["Graph"],["图"]],"20438516":[["Stack","Design"],["栈","设计"]],"2045578042":[["Design","Array","Hash Table","Binary Search"],["设计","数组","哈希表","二分查找"]],"2046332745":[["Trie","Array","String","Backtracking"],["字典树","数组","字符串","回溯"]],"2046402802":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort"],["深度优先搜索","广度优先搜索","图","拓扑排序"]],"2048723677":[["Array","Hash Table","Two Pointers","String","Dynamic Programming"],["数组","哈希表","双指针","字符串","动态规划"]],"2049140185":[["Array","Hash Table","Sliding Window","Heap (Priority Queue)"],["数组","哈希表","滑动窗口","堆（优先队列）"]],"2050291763":[["Greedy","Hash Table","String"],["贪心","哈希表","字符串"]],"2051026474":[["Database"],["数据库"]],"2051273831":[["Math","Simulation"],["数学","模拟"]],"205364228":[["Array","Dynamic Programming","Sorting"],["数组","动态规划","排序"]],"2054972194":[["Database"],["数据库"]],"2055099648":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"2057048497":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"2057246561":[["Array","Binary Search","Divide and Conquer"],["数组","二分查找","分治"]],"2059004815":[["String"],["字符串"]],"2060154218":[["Database"],["数据库"]],"2062472427":[["Greedy","Binary Indexed Tree","Segment Tree","Array","Binary Search","Ordered Set","Sorting"],["贪心","树状数组","线段树","数组","二分查找","有序集合","排序"]],"2063386346":[["Array","Dynamic Programming"],["数组","动态规划"]],"2066655774":[["Breadth-First Search","Array","Matrix","Heap (Priority Queue)"],["广度优先搜索","数组","矩阵","堆（优先队列）"]],"2066860654":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"2068027715":[null,null],"2069508857":[["Design","Hash Table","Linked List","Heap (Priority Queue)"],["设计","哈希表","链表","堆（优先队列）"]],"2069762192":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort"],["深度优先搜索","广度优先搜索","图","拓扑排序"]],"2070962878":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"2074201652":[["Design","Hash Table","String","Binary Search"],["设计","哈希表","字符串","二分查找"]],"2074713320":[["Greedy","Math"],["贪心","数学"]],"2076283496":[["Database"],["数据库"]],"2077283915":[["Bit Manipulation","Brainteaser"],["位运算","脑筋急转弯"]],"2078083870":[["Math","Binary Search"],["数学","二分查找"]],"2080495144":[["Tree","Depth-First Search","Array","Math","Enumeration"],["树","深度优先搜索","数组","数学","枚举"]],"2080861390":[["Array","Math"],["数组","数学"]],"208434464":[["Recursion","Math"],["递归","数学"]],"2085579974":[["Greedy","Array","String"],["贪心","数组","字符串"]],"2085973602":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"2086212420":[["Array","Math","Dynamic Programming","Game Theory","Prefix Sum"],["数组","数学","动态规划","博弈","前缀和"]],"2087368801":[["Hash Table","Linked List","Two Pointers"],["哈希表","链表","双指针"]],"2088822497":[["Array","Hash Table","Two Pointers","Enumeration"],["数组","哈希表","双指针","枚举"]],"2088911620":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"209121812":[["Stack","Array","Prefix Sum","Monotonic Stack"],["栈","数组","前缀和","单调栈"]],"2093417498":[["Design","Queue","Array","Linked List"],["设计","队列","数组","链表"]],"2094034129":[["Binary Indexed Tree","Segment Tree","Array","Sorting"],["树状数组","线段树","数组","排序"]],"2094685164":[["Depth-First Search","Breadth-First Search","Array","Matrix"],["深度优先搜索","广度优先搜索","数组","矩阵"]],"2097099950":[["Stack","Greedy","Array","Two Pointers","Sorting","Monotonic Stack"],["栈","贪心","数组","双指针","排序","单调栈"]],"2099267983":[["Array","Dynamic Programming"],["数组","动态规划"]],"2100511060":[["Array","Math","Matrix","Sorting"],["数组","数学","矩阵","排序"]],"2101009140":[["Math","String","Simulation"],["数学","字符串","模拟"]],"2102124703":[["Bit Manipulation","Hash Table","String","Divide and Conquer","Sliding Window"],["位运算","哈希表","字符串","分治","滑动窗口"]],"210217684":[["Array","Sliding Window"],["数组","滑动窗口"]],"2105184024":[["Math","String"],["数学","字符串"]],"2105190288":[["Database"],["数据库"]],"2106508430":[["Array","Binary Search"],["数组","二分查找"]],"210734267":[["Math","String","Simulation"],["数学","字符串","模拟"]],"2107686904":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"2108728330":[["Array","Prefix Sum"],["数组","前缀和"]],"2109002994":[["Database"],["数据库"]],"2109320577":[["Array"],["数组"]],"211245592":[["Database"],["数据库"]],"2113446044":[["Array","Math","Number Theory"],["数组","数学","数论"]],"2115947356":[["Array","Simulation"],["数组","模拟"]],"2117244239":[["Design","Data Stream","Ordered Set","Heap (Priority Queue)"],["设计","数据流","有序集合","堆（优先队列）"]],"2117678052":[["Database"],["数据库"]],"212097244":[null,null],"2122371082":[["Recursion","Math"],["递归","数学"]],"2122542522":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"2123032733":[["Bit Manipulation","Array"],["位运算","数组"]],"212376193":[["Array","Dynamic Programming"],["数组","动态规划"]],"2123999060":[["Array","Dynamic Programming"],["数组","动态规划"]],"212627710":[["Breadth-First Search","Array","Hash Table"],["广度优先搜索","数组","哈希表"]],"2129258263":[["Database"],["数据库"]],"212930587":[["Greedy","Math","Heap (Priority Queue)"],["贪心","数学","堆（优先队列）"]],"2130827066":[["Math","String","Dynamic Programming","String Matching"],["数学","字符串","动态规划","字符串匹配"]],"2131267381":[["Array","Dynamic Programming"],["数组","动态规划"]],"2135327933":[["Greedy","Math"],["贪心","数学"]],"2135431142":[["Bit Manipulation","Memoization","Array","Dynamic Programming","Bitmask"],["位运算","记忆化搜索","数组","动态规划","状态压缩"]],"213777418":[["Array","Binary Search"],["数组","二分查找"]],"2137857715":[["Array","Math"],["数组","数学"]],"2137931406":[["Array","Math","Binary Search","Prefix Sum","Randomized"],["数组","数学","二分查找","前缀和","随机化"]],"2138367939":[["Array","Hash Table"],["数组","哈希表"]],"2140116935":[["Math","Rejection Sampling","Probability and Statistics","Randomized"],["数学","拒绝采样","概率与统计","随机化"]],"214184041":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"2142283134":[["Math"],["数学"]],"2143044442":[["Tree","Depth-First Search","Breadth-First Search","Design","Array","Hash Table"],["树","深度优先搜索","广度优先搜索","设计","数组","哈希表"]],"2144998386":[["String","Sliding Window"],["字符串","滑动窗口"]],"214508087":[["Array","Counting","Prefix Sum"],["数组","计数","前缀和"]],"2146548018":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"2147315027":[["Array","Sorting"],["数组","排序"]],"2147986859":[["Array","Hash Table","Sorting","Heap (Priority Queue)"],["数组","哈希表","排序","堆（优先队列）"]],"2150121610":[["Greedy","Array"],["贪心","数组"]],"2150479645":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"2152298441":[["Stack","Tree","Depth-First Search","Binary Tree"],["栈","树","深度优先搜索","二叉树"]],"2153157695":[["Two Pointers","String"],["双指针","字符串"]],"2153390386":[["Array","Divide and Conquer","Quickselect","Sorting","Heap (Priority Queue)"],["数组","分治","快速选择","排序","堆（优先队列）"]],"2154511916":[["Design","Hash Table","Linked List","Doubly-Linked List"],["设计","哈希表","链表","双向链表"]],"2154696316":[["Array","String","String Matching"],["数组","字符串","字符串匹配"]],"2155229246":[["Bit Manipulation","Array","Backtracking","Enumeration"],["位运算","数组","回溯","枚举"]],"2155696628":[null,null],"2156152723":[["Bit Manipulation","Array","Hash Table","Math","Sorting"],["位运算","数组","哈希表","数学","排序"]],"2160714813":[["Math","Binary Search"],["数学","二分查找"]],"2161204569":[["Stack","Linked List","Two Pointers"],["栈","链表","双指针"]],"2162382478":[null,null],"2164084926":[null,null],"2164343480":[["Database"],["数据库"]],"2165999334":[["Database"],["数据库"]],"2167794143":[["Array","String Matching","Sliding Window","Hash Function","Rolling Hash"],["数组","字符串匹配","滑动窗口","哈希函数","滚动哈希"]],"2168242954":[["Geometry","Math"],["几何","数学"]],"2168825861":[["Math","Number Theory"],["数学","数论"]],"2169396423":[["Bit Manipulation","Array","Dynamic Programming","Bitmask"],["位运算","数组","动态规划","状态压缩"]],"2169721379":[["Trie","Array","Hash Table","Enumeration","Hash Function","Rolling Hash"],["字典树","数组","哈希表","枚举","哈希函数","滚动哈希"]],"2170025879":[["Breadth-First Search","Graph","Array","Matrix","Shortest Path","Heap (Priority Queue)"],["广度优先搜索","图","数组","矩阵","最短路","堆（优先队列）"]],"2172902585":[["Tree","Binary Tree"],["树","二叉树"]],"217467576":[["Greedy","Geometry","Array","Math","Combinatorics","Sorting"],["贪心","几何","数组","数学","组合数学","排序"]],"217546662":[["Array"],["数组"]],"2176047848":[["Design","Hash Table","Binary Search","Ordered Set","Sorting"],["设计","哈希表","二分查找","有序集合","排序"]],"2180877898":[["Bit Manipulation"],["位运算"]],"2181231700":[["Array","Binary Search"],["数组","二分查找"]],"2182253577":[["Array","Math"],["数组","数学"]],"2182388811":[["Greedy","Array","String Matching"],["贪心","数组","字符串匹配"]],"2182831583":[["Graph","Topological Sort","Array","Hash Table","String"],["图","拓扑排序","数组","哈希表","字符串"]],"2184297331":[["Bit Manipulation","Array"],["位运算","数组"]],"2184686055":[["Array","Math","Two Pointers","Sorting"],["数组","数学","双指针","排序"]],"2185596896":[null,null],"2185644087":[["Database"],["数据库"]],"2187172880":[["Greedy","Array"],["贪心","数组"]],"218781353":[["Depth-First Search","Graph","Topological Sort"],["深度优先搜索","图","拓扑排序"]],"2188606245":[["Linked List","Two Pointers"],["链表","双指针"]],"2191074840":[["Bit Manipulation","Tree","Depth-First Search","Hash Table"],["位运算","树","深度优先搜索","哈希表"]],"2191726075":[["Bit Manipulation","Queue","Array","Prefix Sum","Sliding Window"],["位运算","队列","数组","前缀和","滑动窗口"]],"2192121612":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2192706389":[["Sorting","Heap (Priority Queue)"],["排序","堆（优先队列）"]],"2193040547":[["Greedy","Array"],["贪心","数组"]],"2193251345":[null,null],"2194073999":[["Two Pointers","String"],["双指针","字符串"]],"2194441263":[null,null],"2194831616":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"219694070":[["Math","Dynamic Programming"],["数学","动态规划"]],"2197356984":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"2199036891":[["Array","Hash Table","Binary Search","Counting","Matrix"],["数组","哈希表","二分查找","计数","矩阵"]],"2199938357":[["Tree","Binary Search Tree","Binary Tree"],["树","二叉搜索树","二叉树"]],"2201727713":[["Database"],["数据库"]],"2201981126":[["Math"],["数学"]],"2203655753":[["Math","Dynamic Programming","Game Theory"],["数学","动态规划","博弈"]],"2204380301":[["Greedy","Math"],["贪心","数学"]],"2204914887":[["Design","Array","Hash Table","Counting"],["设计","数组","哈希表","计数"]],"2205913729":[["Greedy","Hash Table","String","Counting"],["贪心","哈希表","字符串","计数"]],"220599685":[null,null],"220667062":[["Greedy","Array","Hash Table","Binary Search","Sorting"],["贪心","数组","哈希表","二分查找","排序"]],"2206719747":[["Math","Dynamic Programming","Game Theory"],["数学","动态规划","博弈"]],"2207624249":[["Array","Dynamic Programming"],["数组","动态规划"]],"2207905219":[["Database"],["数据库"]],"2208494667":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"2208585097":[["Array","Prefix Sum"],["数组","前缀和"]],"2213463441":[["String","Dynamic Programming"],["字符串","动态规划"]],"2214262554":[["Greedy","Array","Matrix"],["贪心","数组","矩阵"]],"2214824906":[["Stack","Depth-First Search","String"],["栈","深度优先搜索","字符串"]],"2216360450":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"2220648902":[["String","Dynamic Programming"],["字符串","动态规划"]],"2222019296":[["Tree","Depth-First Search","Breadth-First Search"],["树","深度优先搜索","广度优先搜索"]],"2226311468":[["Bit Manipulation","String","Backtracking"],["位运算","字符串","回溯"]],"2228358934":[["Math","Combinatorics","Enumeration"],["数学","组合数学","枚举"]],"2230494217":[["Bit Manipulation","Graph","Dynamic Programming","Bitmask"],["位运算","图","动态规划","状态压缩"]],"2232175898":[["Database"],["数据库"]],"223285376":[["Bit Manipulation"],["位运算"]],"2235555306":[["Hash Table","Math","Counting","Enumeration","Sorting"],["哈希表","数学","计数","枚举","排序"]],"2235724788":[null,null],"2235840093":[["Linked List","Two Pointers","Divide and Conquer","Sorting","Merge Sort"],["链表","双指针","分治","排序","归并排序"]],"223690290":[null,null],"2238247137":[["Bit Manipulation"],["位运算"]],"2240198172":[["Array","Hash Table","Sorting","Sliding Window"],["数组","哈希表","排序","滑动窗口"]],"2240876068":[["Math"],["数学"]],"224100421":[["Array","Dynamic Programming","Sorting"],["数组","动态规划","排序"]],"2244707838":[["Two Pointers","String"],["双指针","字符串"]],"224630615":[["Queue","Array","Ordered Set","Sliding Window","Monotonic Queue","Heap (Priority Queue)"],["队列","数组","有序集合","滑动窗口","单调队列","堆（优先队列）"]],"2247018180":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"2247565255":[["Union Find","Array","Hash Table"],["并查集","数组","哈希表"]],"2248212771":[["Array","Sliding Window"],["数组","滑动窗口"]],"2248507270":[["String","Binary Search","String Matching","Suffix Array","Hash Function","Rolling Hash"],["字符串","二分查找","字符串匹配","后缀数组","哈希函数","滚动哈希"]],"2249312740":[["Greedy","Array","Hash Table","Sorting"],["贪心","数组","哈希表","排序"]],"2249355269":[["Hash Table","String"],["哈希表","字符串"]],"2249490":[["Design","Array","Two Pointers","Iterator"],["设计","数组","双指针","迭代器"]],"2249718139":[["Stack","String","Dynamic Programming"],["栈","字符串","动态规划"]],"2249810515":[["Database"],["数据库"]],"2251334448":[["Array","Dynamic Programming"],["数组","动态规划"]],"2251945224":[["Binary Indexed Tree","Array","Binary Search"],["树状数组","数组","二分查找"]],"2252317011":[["Array","Dynamic Programming","Prefix Sum"],["数组","动态规划","前缀和"]],"225263285":[["Database"],["数据库"]],"2254789488":[["Greedy","Two Pointers","String"],["贪心","双指针","字符串"]],"2255777157":[["Array","Dynamic Programming","Sorting"],["数组","动态规划","排序"]],"2256129159":[["Array","Hash Table","Math"],["数组","哈希表","数学"]],"2257250428":[["Tree","Math","Dynamic Programming","Binary Tree","Game Theory"],["树","数学","动态规划","二叉树","博弈"]],"2257308276":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"2258141933":[["Greedy","Array","Hash Table","Counting"],["贪心","数组","哈希表","计数"]],"2258165342":[["Database"],["数据库"]],"2258623827":[["Array","Math","Dynamic Programming","Sorting"],["数组","数学","动态规划","排序"]],"2259000228":[["Array","Simulation"],["数组","模拟"]],"2259176301":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"2260151323":[["Greedy","Array","Enumeration","Prefix Sum","Sorting"],["贪心","数组","枚举","前缀和","排序"]],"2262588000":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"2265344721":[["Array","Hash Table","String","Sliding Window"],["数组","哈希表","字符串","滑动窗口"]],"2265657217":[["Array","Math"],["数组","数学"]],"2267593455":[["Array","Binary Search","Prefix Sum","Sliding Window"],["数组","二分查找","前缀和","滑动窗口"]],"2270005002":[["Math","Dynamic Programming"],["数学","动态规划"]],"2272805308":[["Geometry","Array","Math"],["几何","数组","数学"]],"2274658324":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"2277934665":[["Backtracking"],["回溯"]],"2279246890":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"2279730191":[["Tree","Depth-First Search","Breadth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","广度优先搜索","哈希表","二叉树"]],"228115268":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"228284311":[["Hash Table","String","Counting","Prefix Sum"],["哈希表","字符串","计数","前缀和"]],"2284449411":[["Recursion","Math","String"],["递归","数学","字符串"]],"2285069816":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"228551495":[["Array","Hash Table","Ordered Set"],["数组","哈希表","有序集合"]],"2285522737":[["Array","Binary Search"],["数组","二分查找"]],"2285940610":[["Array","Backtracking"],["数组","回溯"]],"2287172046":[["Graph"],["图"]],"2290049338":[["Array","Prefix Sum"],["数组","前缀和"]],"2291083428":[["Linked List"],["链表"]],"2294942579":[["Array","Hash Table"],["数组","哈希表"]],"2295408709":[["String"],["字符串"]],"2296253743":[["Database"],["数据库"]],"2297518953":[["Stack","Binary Indexed Tree","Segment Tree","Array","Binary Search","Monotonic Stack","Heap (Priority Queue)"],["栈","树状数组","线段树","数组","二分查找","单调栈","堆（优先队列）"]],"2300589345":[["Greedy","Math","Dynamic Programming"],["贪心","数学","动态规划"]],"2301924247":[["Stack","Array","Math"],["栈","数组","数学"]],"2302244531":[["Array","Hash Table","Dynamic Programming"],["数组","哈希表","动态规划"]],"2303671714":[null,null],"2304874524":[["Breadth-First Search","Backtracking"],["广度优先搜索","回溯"]],"2305702963":[["Array","Dynamic Programming"],["数组","动态规划"]],"2306188300":[["Array","Matrix"],["数组","矩阵"]],"2310137574":[["Array","Hash Table","Counting","Sorting"],["数组","哈希表","计数","排序"]],"2310396":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"2310675124":[["Array","Matrix"],["数组","矩阵"]],"2311001320":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2312427727":[["Stack","String"],["栈","字符串"]],"231349873":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"2313819845":[["Array","Binary Search"],["数组","二分查找"]],"2313861896":[null,null],"2314357296":[["Stack","Tree","Design","Binary Search Tree","Binary Tree","Iterator"],["栈","树","设计","二叉搜索树","二叉树","迭代器"]],"2315979719":[["Tree","Graph","Topological Sort","Array"],["树","图","拓扑排序","数组"]],"2316551160":[["Array","Sorting","Heap (Priority Queue)"],["数组","排序","堆（优先队列）"]],"2317418982":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"2318221471":[["Design","Hash Table","Linked List","Doubly-Linked List"],["设计","哈希表","链表","双向链表"]],"2320468943":[["String","Dynamic Programming"],["字符串","动态规划"]],"2321187859":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"2321482871":[["Array","Hash Table","String","Counting"],["数组","哈希表","字符串","计数"]],"2321691552":[["Tree","Graph","Topological Sort","Math","Dynamic Programming","Combinatorics"],["树","图","拓扑排序","数学","动态规划","组合数学"]],"2321913205":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"232328045":[["Database"],["数据库"]],"2323533689":[["Math"],["数学"]],"2324786150":[["Greedy","String"],["贪心","字符串"]],"2325031714":[["String","Dynamic Programming"],["字符串","动态规划"]],"2329981708":[["Geometry","Math"],["几何","数学"]],"2330175182":[["Linked List","Two Pointers"],["链表","双指针"]],"2330317080":[["Array","Hash Table","Math","Counting","Number Theory"],["数组","哈希表","数学","计数","数论"]],"2330484730":[["Greedy","Array","Two Pointers","Sorting"],["贪心","数组","双指针","排序"]],"2330647155":[["Hash Table","Linked List","Two Pointers"],["哈希表","链表","双指针"]],"233297408":[["Math","Simulation"],["数学","模拟"]],"2333592799":[["Depth-First Search","Breadth-First Search","Graph","Interactive"],["深度优先搜索","广度优先搜索","图","交互"]],"2333659184":[["String","Sliding Window"],["字符串","滑动窗口"]],"2335420481":[["Tree","Union Find","Graph","Array","Hash Table","Sorting"],["树","并查集","图","数组","哈希表","排序"]],"2335538835":[["String","Dynamic Programming","Prefix Sum","Sliding Window"],["字符串","动态规划","前缀和","滑动窗口"]],"2335778252":[["Depth-First Search","Breadth-First Search","Dynamic Programming"],["深度优先搜索","广度优先搜索","动态规划"]],"2336939814":[["Greedy","Array","Math","Game Theory","Sorting"],["贪心","数组","数学","博弈","排序"]],"2337606731":[["Graph","Hash Table"],["图","哈希表"]],"2338718635":[["Array","Hash Table","Two Pointers","Binary Search","Sorting"],["数组","哈希表","双指针","二分查找","排序"]],"2340825815":[["Database"],["数据库"]],"234098869":[["Stack","Design","Monotonic Stack"],["栈","设计","单调栈"]],"234159120":[["Union Find","Array","Sorting"],["并查集","数组","排序"]],"2344727128":[["Linked List"],["链表"]],"2347359100":[["Stack","String"],["栈","字符串"]],"2347660974":[["Bit Manipulation","Array","Backtracking","Enumeration"],["位运算","数组","回溯","枚举"]],"2348343671":[["Math","String","Simulation"],["数学","字符串","模拟"]],"2348993490":[["String"],["字符串"]],"2351647332":[["Database"],["数据库"]],"235206650":[["Linked List"],["链表"]],"2353125510":[["Array","Matrix","Prefix Sum"],["数组","矩阵","前缀和"]],"2354481551":[null,null],"2355594556":[["Greedy","Array","Matrix"],["贪心","数组","矩阵"]],"2355716390":[["Array","Simulation"],["数组","模拟"]],"2357679638":[["Greedy","Array","Hash Table","Math"],["贪心","数组","哈希表","数学"]],"236080983":[["Stack","Array","Two Pointers","Binary Search","Monotonic Stack"],["栈","数组","双指针","二分查找","单调栈"]],"2362247131":[null,null],"2363229918":[["Database"],["数据库"]],"2365177563":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort"],["深度优先搜索","广度优先搜索","图","拓扑排序"]],"2365828386":[["Array"],["数组"]],"2368071046":[["Stack","Array","Binary Search","Sorting","Monotonic Stack","Heap (Priority Queue)"],["栈","数组","二分查找","排序","单调栈","堆（优先队列）"]],"236837608":[["Array","Hash Table"],["数组","哈希表"]],"2368750036":[["Stack","Greedy","Monotonic Stack"],["栈","贪心","单调栈"]],"2368832701":[null,null],"2369389100":[["Math","Sorting"],["数学","排序"]],"2369595129":[["Database"],["数据库"]],"2369761961":[["Array","Matrix","Prefix Sum"],["数组","矩阵","前缀和"]],"2370285073":[["Array","Binary Search"],["数组","二分查找"]],"2370755498":[["Stack","Array","Math","Number Theory"],["栈","数组","数学","数论"]],"2371431943":[["Greedy","Array","Math","Counting","Game Theory"],["贪心","数组","数学","计数","博弈"]],"2371969629":[["Database"],["数据库"]],"237326824":[["Graph","Shortest Path"],["图","最短路"]],"2373279761":[["Array","Prefix Sum"],["数组","前缀和"]],"2373608335":[["String","Dynamic Programming","Backtracking"],["字符串","动态规划","回溯"]],"2374166461":[["Greedy","Array","Math","String"],["贪心","数组","数学","字符串"]],"2374192694":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"237462896":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2375501212":[["Binary Indexed Tree","Segment Tree","Array","Binary Search","Dynamic Programming"],["树状数组","线段树","数组","二分查找","动态规划"]],"2375816517":[["Dynamic Programming"],["动态规划"]],"2376531005":[["Database"],["数据库"]],"2377767456":[["Math","Enumeration"],["数学","枚举"]],"2380816309":[["Array","Sorting"],["数组","排序"]],"2383026168":[["Database"],["数据库"]],"2383092679":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"2384194086":[["Math","Prefix Sum"],["数学","前缀和"]],"2385909936":[["Reservoir Sampling","Linked List","Math","Randomized"],["水塘抽样","链表","数学","随机化"]],"2386103127":[["Design","Hash Table","Sorting"],["设计","哈希表","排序"]],"2386809488":[["Array"],["数组"]],"2386982504":[["Depth-First Search","Breadth-First Search","Graph"],["深度优先搜索","广度优先搜索","图"]],"2388556480":[["Database"],["数据库"]],"2390584088":[["Array"],["数组"]],"239079794":[["Array","Binary Search","Simulation"],["数组","二分查找","模拟"]],"2391605505":[null,null],"2393134541":[["Depth-First Search","Array","Matrix"],["深度优先搜索","数组","矩阵"]],"2397274802":[["Bit Manipulation","Array","Prefix Sum"],["位运算","数组","前缀和"]],"2398941022":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"2400947874":[["Array","Two Pointers","Binary Search"],["数组","双指针","二分查找"]],"2401052346":[["Concurrency"],["多线程"]],"2402216688":[["Design","Array","Hash Table","String"],["设计","数组","哈希表","字符串"]],"2404871340":[["Array","Hash Table","Matrix","Simulation"],["数组","哈希表","矩阵","模拟"]],"2405342085":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"2405658749":[["Tree","Array","Hash Table","Divide and Conquer","Binary Tree"],["树","数组","哈希表","分治","二叉树"]],"2406786533":[["Database"],["数据库"]],"2407589215":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"2407640855":[["Array","Hash Table","Matrix"],["数组","哈希表","矩阵"]],"2408289758":[["Array","Hash Table"],["数组","哈希表"]],"2409750542":[["Stack","Array","Hash Table","Prefix Sum","Monotonic Stack"],["栈","数组","哈希表","前缀和","单调栈"]],"2410692850":[["Array","Math","String"],["数组","数学","字符串"]],"2412340751":[["Array","Binary Search"],["数组","二分查找"]],"2413930996":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"2415029607":[["Union Find","Graph","Minimum Spanning Tree","Sorting","Strongly Connected Component"],["并查集","图","最小生成树","排序","强连通分量"]],"2417537933":[["Greedy","Array","Counting Sort","Sorting"],["贪心","数组","计数排序","排序"]],"2418375843":[["Database"],["数据库"]],"2420716906":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"2420933825":[["Array","Sorting"],["数组","排序"]],"2421996109":[["Array","Binary Search","Divide and Conquer","Matrix"],["数组","二分查找","分治","矩阵"]],"2422059385":[["Array","Binary Search"],["数组","二分查找"]],"2422080240":[["Design","Array","Hash Table","Data Stream"],["设计","数组","哈希表","数据流"]],"242229728":[["Database"],["数据库"]],"2422423692":[["Tree","Depth-First Search","Breadth-First Search","Graph","Array"],["树","深度优先搜索","广度优先搜索","图","数组"]],"2424933436":[["Math","Two Pointers","Enumeration"],["数学","双指针","枚举"]],"2425741756":[["Trie","Array","String","Counting"],["字典树","数组","字符串","计数"]],"2428818859":[["Bit Manipulation","Math","String"],["位运算","数学","字符串"]],"2430051677":[["Array","Binary Search"],["数组","二分查找"]],"2430259702":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"2431129875":[["Array","Dynamic Programming"],["数组","动态规划"]],"2433168244":[["Bit Manipulation","Math","String"],["位运算","数学","字符串"]],"2434134348":[["Math","String"],["数学","字符串"]],"2434964692":[["Array","Simulation"],["数组","模拟"]],"2436117632":[["Segment Tree","Queue","Array","Dynamic Programming","Prefix Sum","Monotonic Queue","Heap (Priority Queue)"],["线段树","队列","数组","动态规划","前缀和","单调队列","堆（优先队列）"]],"2436413676":[["Trie","String","Hash Function","Rolling Hash"],["字典树","字符串","哈希函数","滚动哈希"]],"2436753495":[["Breadth-First Search","Backtracking"],["广度优先搜索","回溯"]],"2442045936":[["Hash Table","String"],["哈希表","字符串"]],"2442896853":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"2443834680":[["Array","Two Pointers"],["数组","双指针"]],"244758471":[["Depth-First Search","Breadth-First Search","Union Find","Array","Hash Table","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","哈希表","矩阵"]],"2448413931":[["Math"],["数学"]],"2452001178":[["String"],["字符串"]],"2453198602":[["Recursion","Math"],["递归","数学"]],"2455085538":[["Math"],["数学"]],"2457264374":[["Database"],["数据库"]],"245796778":[["Array","Two Pointers"],["数组","双指针"]],"2460331500":[["Design","Segment Tree","Array","Hash Table","Binary Search"],["设计","线段树","数组","哈希表","二分查找"]],"246275746":[["Bit Manipulation","Array","Prefix Sum"],["位运算","数组","前缀和"]],"2464323261":[["Trie","Array","String","Sorting"],["字典树","数组","字符串","排序"]],"2465331178":[["Array","Math","Dynamic Programming"],["数组","数学","动态规划"]],"2469022748":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"2469933695":[["Array","Hash Table","Divide and Conquer","Counting","Sorting"],["数组","哈希表","分治","计数","排序"]],"2471701670":[["Two Pointers","String"],["双指针","字符串"]],"2471898191":[["String","Dynamic Programming"],["字符串","动态规划"]],"2473812468":[["Bit Manipulation","Array","Two Pointers","Dynamic Programming","Bitmask"],["位运算","数组","双指针","动态规划","状态压缩"]],"2475848461":[["Greedy","Array","Binary Search","Sorting"],["贪心","数组","二分查找","排序"]],"2479293617":[["Greedy","Array","Hash Table","Prefix Sum"],["贪心","数组","哈希表","前缀和"]],"2480987547":[["Geometry","Array","Math"],["几何","数组","数学"]],"2481240580":[["Two Pointers","String","Dynamic Programming"],["双指针","字符串","动态规划"]],"2481973138":[["Bit Manipulation","Dynamic Programming"],["位运算","动态规划"]],"248789391":[["Math","Enumeration"],["数学","枚举"]],"2488004222":[null,null],"2488135056":[["Union Find","Graph","Topological Sort","Array","Matrix","Sorting"],["并查集","图","拓扑排序","数组","矩阵","排序"]],"2491402608":[["Math"],["数学"]],"2492032151":[["Math","Divide and Conquer"],["数学","分治"]],"2493144905":[["Hash Table","Two Pointers","String","Sliding Window"],["哈希表","双指针","字符串","滑动窗口"]],"2493499746":[["Geometry","Array","Math","Sorting","Sliding Window"],["几何","数组","数学","排序","滑动窗口"]],"2493528114":[["Design","Hash Table","String","Hash Function"],["设计","哈希表","字符串","哈希函数"]],"249363528":[["Tree","Breadth-First Search","Binary Tree"],["树","广度优先搜索","二叉树"]],"2494605157":[["Database"],["数据库"]],"249521607":[["Depth-First Search","Breadth-First Search","Graph"],["深度优先搜索","广度优先搜索","图"]],"2496465634":[["Array","Hash Table","Linked List"],["数组","哈希表","链表"]],"2499674936":[null,null],"2500271603":[["Design","Hash Table","Ordered Set","Heap (Priority Queue)"],["设计","哈希表","有序集合","堆（优先队列）"]],"2500987303":[["Design","Array","Hash Table","Math","Randomized"],["设计","数组","哈希表","数学","随机化"]],"2502228330":[["Array","Line Sweep"],["数组","扫描线"]],"2502903776":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"2503581045":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"2503951076":[["Greedy","Array","Math"],["贪心","数组","数学"]],"2504097527":[["Design","Array","Hash Table","String"],["设计","数组","哈希表","字符串"]],"2504384020":[["Design","Segment Tree","Binary Search","Ordered Set"],["设计","线段树","二分查找","有序集合"]],"2505184572":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"2509232431":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort","Array","String"],["深度优先搜索","广度优先搜索","图","拓扑排序","数组","字符串"]],"251006919":[["Array","Hash Table","Binary Search","Ordered Set","Prefix Sum","Sorting"],["数组","哈希表","二分查找","有序集合","前缀和","排序"]],"2510392129":[["Bit Manipulation","Depth-First Search","Breadth-First Search"],["位运算","深度优先搜索","广度优先搜索"]],"2510517613":[["Greedy","Array","Prefix Sum","Sorting"],["贪心","数组","前缀和","排序"]],"2511234285":[["Math","Combinatorics"],["数学","组合数学"]],"2513347763":[["Array","Hash Table","Counting","Enumeration","Prefix Sum"],["数组","哈希表","计数","枚举","前缀和"]],"2513980161":[["Greedy","Array","Hash Table","Counting","Sorting"],["贪心","数组","哈希表","计数","排序"]],"251533366":[["Geometry","Array","Hash Table","Math"],["几何","数组","哈希表","数学"]],"2515340929":[["Bit Manipulation","Hash Table","String","Counting"],["位运算","哈希表","字符串","计数"]],"2519726489":[["String","Dynamic Programming","Prefix Sum"],["字符串","动态规划","前缀和"]],"2520941920":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"2521216381":[["Breadth-First Search","Graph","Array","Hash Table","Sorting"],["广度优先搜索","图","数组","哈希表","排序"]],"2521310070":[["Array"],["数组"]],"2523329139":[["Tree","Breadth-First Search","Binary Tree"],["树","广度优先搜索","二叉树"]],"2523374000":[["Design","Trie","Hash Table","String"],["设计","字典树","哈希表","字符串"]],"2526467539":[["Backtracking"],["回溯"]],"2526914852":[["Array","Backtracking","Matrix"],["数组","回溯","矩阵"]],"2529461898":[["Greedy","Array","Sorting","Heap (Priority Queue)"],["贪心","数组","排序","堆（优先队列）"]],"2529652202":[["Database"],["数据库"]],"253015942":[["Tree","Depth-First Search","Breadth-First Search","String"],["树","深度优先搜索","广度优先搜索","字符串"]],"2530621646":[["Bit Manipulation","Trie","Array","Hash Table","String"],["位运算","字典树","数组","哈希表","字符串"]],"2531808875":[["String","Dynamic Programming"],["字符串","动态规划"]],"2532000263":[["Breadth-First Search","Array","Hash Table","String"],["广度优先搜索","数组","哈希表","字符串"]],"2532136306":[null,null],"2532708840":[["Array","Hash Table","Heap (Priority Queue)"],["数组","哈希表","堆（优先队列）"]],"2534016591":[["Database"],["数据库"]],"2534323731":[["Array","Dynamic Programming"],["数组","动态规划"]],"2534500893":[["Design","Trie","Array","Hash Table","String"],["设计","字典树","数组","哈希表","字符串"]],"2534714311":[["Design","String","Backtracking","Iterator"],["设计","字符串","回溯","迭代器"]],"253585197":[["Stack","Recursion","String"],["栈","递归","字符串"]],"2541052146":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"254218602":[["Design","Array","Hash Table","Linked List","Hash Function"],["设计","数组","哈希表","链表","哈希函数"]],"2542321733":[["Stack","Greedy","Array","Dynamic Programming","Monotonic Stack"],["栈","贪心","数组","动态规划","单调栈"]],"2544348147":[["Hash Table","String"],["哈希表","字符串"]],"2546467088":[["Array","Binary Search","Dynamic Programming","Sorting","Heap (Priority Queue)"],["数组","二分查找","动态规划","排序","堆（优先队列）"]],"2548029026":[["Hash Table","Linked List"],["哈希表","链表"]],"2548478453":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"254983687":[["Tree","Graph"],["树","图"]],"2550811240":[["Array","Two Pointers"],["数组","双指针"]],"255204169":[["Array","String"],["数组","字符串"]],"2553352145":[["Stack","Queue","Array","Simulation"],["栈","队列","数组","模拟"]],"2553787403":[["Array","Binary Search"],["数组","二分查找"]],"255657392":[["Two Pointers","String"],["双指针","字符串"]],"2559668419":[["Graph","Shortest Path","Heap (Priority Queue)"],["图","最短路","堆（优先队列）"]],"2560027362":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort","Memoization","Array","Dynamic Programming","Matrix"],["深度优先搜索","广度优先搜索","图","拓扑排序","记忆化搜索","数组","动态规划","矩阵"]],"2560538129":[null,null],"2562103296":[["Math","String"],["数学","字符串"]],"2562869066":[["Design","Array","Hash Table","Matrix","Simulation"],["设计","数组","哈希表","矩阵","模拟"]],"256288757":[["Segment Tree","Array","Ordered Set"],["线段树","数组","有序集合"]],"2563069268":[["Bit Manipulation","Array","Dynamic Programming","Bitmask"],["位运算","数组","动态规划","状态压缩"]],"2563394539":[null,null],"2569057399":[["String"],["字符串"]],"2570139767":[["Recursion","Memoization","Math","Dynamic Programming"],["递归","记忆化搜索","数学","动态规划"]],"2572143666":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"2572232151":[["String","Dynamic Programming"],["字符串","动态规划"]],"2572461200":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2572867035":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"2573075022":[["Hash Table","String","Binary Search","Counting","Sliding Window"],["哈希表","字符串","二分查找","计数","滑动窗口"]],"2573211912":[["Stack","Greedy","Array","Math","Number Theory","Monotonic Stack"],["栈","贪心","数组","数学","数论","单调栈"]],"2574605858":[["String"],["字符串"]],"2575372610":[["Array","Backtracking"],["数组","回溯"]],"2575656476":[["Graph","Array","Shortest Path","Heap (Priority Queue)"],["图","数组","最短路","堆（优先队列）"]],"2576790821":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"2577818967":[null,null],"2578391134":[["Database"],["数据库"]],"2578600625":[["Array","Hash Table"],["数组","哈希表"]],"2579010831":[["Array","Backtracking","Matrix"],["数组","回溯","矩阵"]],"2579112355":[["Hash Table","String"],["哈希表","字符串"]],"2579491041":[["Database"],["数据库"]],"2579679937":[["Binary Indexed Tree","Array","Dynamic Programming","Enumeration","Prefix Sum"],["树状数组","数组","动态规划","枚举","前缀和"]],"2581904260":[["Array","Sorting"],["数组","排序"]],"2582233376":[["Array","Math"],["数组","数学"]],"2582430711":[["Array","Binary Search","Divide and Conquer"],["数组","二分查找","分治"]],"2583029056":[["Array","Matrix"],["数组","矩阵"]],"258313482":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"2586044711":[["Recursion","Queue","Array","Math","Simulation"],["递归","队列","数组","数学","模拟"]],"2588374358":[["Design","Trie","Hash Table","String"],["设计","字典树","哈希表","字符串"]],"2588489114":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"2589865335":[["Design","Array","Iterator"],["设计","数组","迭代器"]],"2590774847":[["Bit Manipulation","Dynamic Programming"],["位运算","动态规划"]],"2591484771":[["Array","Two Pointers"],["数组","双指针"]],"2595565556":[["Tree","Depth-First Search","Breadth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉搜索树","二叉树"]],"2595697191":[["Array","Simulation"],["数组","模拟"]],"2595882232":[["Array","Matrix"],["数组","矩阵"]],"2597701503":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"2598780139":[["String","Dynamic Programming"],["字符串","动态规划"]],"2599242307":[["Stack","Tree","Design","Math","Binary Tree"],["栈","树","设计","数学","二叉树"]],"2600147563":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"2600262554":[["String","Dynamic Programming"],["字符串","动态规划"]],"2600395028":[["Two Pointers","String"],["双指针","字符串"]],"2603031099":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"2604144466":[["Concurrency"],["多线程"]],"2604690450":[["Stack","Greedy","String","Dynamic Programming"],["栈","贪心","字符串","动态规划"]],"260479518":[["Greedy","Array","Two Pointers","Binary Search","Sorting"],["贪心","数组","双指针","二分查找","排序"]],"2605448197":[["Depth-First Search","Graph","Topological Sort"],["深度优先搜索","图","拓扑排序"]],"260623190":[["Bit Manipulation","Array"],["位运算","数组"]],"2606916888":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"2609641077":[["Array","Math","Dynamic Programming","Matrix"],["数组","数学","动态规划","矩阵"]],"2609962764":[["Array","Matrix"],["数组","矩阵"]],"2610426510":[["Math","Binary Search","Dynamic Programming"],["数学","二分查找","动态规划"]],"2610864298":[["Stack","Depth-First Search","String"],["栈","深度优先搜索","字符串"]],"2610865464":[["Array","Binary Search"],["数组","二分查找"]],"2612530279":[["Array","Binary Search"],["数组","二分查找"]],"2612627798":[["Database"],["数据库"]],"2613694816":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2613974860":[["Math","Binary Search"],["数学","二分查找"]],"2613979956":[["String","Sliding Window"],["字符串","滑动窗口"]],"2615198346":[["Greedy","String","Heap (Priority Queue)"],["贪心","字符串","堆（优先队列）"]],"261533544":[["Queue","Array","Dynamic Programming","Monotonic Queue","Heap (Priority Queue)"],["队列","数组","动态规划","单调队列","堆（优先队列）"]],"2616191739":[["Stack","Recursion","String"],["栈","递归","字符串"]],"2617125781":[["Tree","Depth-First Search","Breadth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","广度优先搜索","哈希表","二叉树"]],"2617837584":[["Greedy","Array","Counting","Sorting"],["贪心","数组","计数","排序"]],"2618479578":[["Array","Math","String"],["数组","数学","字符串"]],"2618637580":[["Bit Manipulation","Tree","Depth-First Search","Array"],["位运算","树","深度优先搜索","数组"]],"2619603225":[["Greedy","Array"],["贪心","数组"]],"2621107821":[["String"],["字符串"]],"2621480860":[["Array","Hash Table","Two Pointers","Sorting"],["数组","哈希表","双指针","排序"]],"2622232119":[["Bit Manipulation","Array","Hash Table","Backtracking"],["位运算","数组","哈希表","回溯"]],"2626303746":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"2626440500":[["Database"],["数据库"]],"2628400239":[["Bit Manipulation","Hash Table","String","Sorting"],["位运算","哈希表","字符串","排序"]],"2628574755":[null,null],"2629528696":[["String"],["字符串"]],"2629734466":[null,null],"2630527363":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2630992864":[["Database"],["数据库"]],"2631177392":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"2631196608":[["Geometry","Array","Math"],["几何","数组","数学"]],"2631420913":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"2632738906":[["Depth-First Search","Breadth-First Search","Array","Hash Table"],["深度优先搜索","广度优先搜索","数组","哈希表"]],"2633929455":[["Bit Manipulation","Brainteaser","Array","Math"],["位运算","脑筋急转弯","数组","数学"]],"263409464":[["Database"],["数据库"]],"2634124873":[["Greedy","Array","Sorting","Heap (Priority Queue)"],["贪心","数组","排序","堆（优先队列）"]],"2634383093":[["Array","Binary Search","Matrix","Heap (Priority Queue)"],["数组","二分查找","矩阵","堆（优先队列）"]],"2634690453":[["Database"],["数据库"]],"2635424294":[["Tree","Depth-First Search","Graph","Trie"],["树","深度优先搜索","图","字典树"]],"2636727819":[["Database"],["数据库"]],"2637994881":[["Bit Manipulation","Recursion","Array","Dynamic Programming","Bitmask"],["位运算","递归","数组","动态规划","状态压缩"]],"2638444930":[null,null],"2639105050":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"2640785054":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"2640877802":[["Tree","Divide and Conquer"],["树","分治"]],"2642386680":[["Hash Table","Linked List","Two Pointers"],["哈希表","链表","双指针"]],"2643077516":[["Array","Binary Search"],["数组","二分查找"]],"2643883804":[["Database"],["数据库"]],"2645404069":[["Greedy","Bit Manipulation"],["贪心","位运算"]],"2646645546":[["Greedy","String","Sorting"],["贪心","字符串","排序"]],"264755561":[["Array","Hash Table","Matrix"],["数组","哈希表","矩阵"]],"2648057035":[["Math","Dynamic Programming","Combinatorics","Number Theory"],["数学","动态规划","组合数学","数论"]],"2651582555":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"2651875294":[["String","Binary Search","Prefix Sum","Sliding Window"],["字符串","二分查找","前缀和","滑动窗口"]],"265213405":[["Stack","Union Find","Array","Monotonic Stack"],["栈","并查集","数组","单调栈"]],"2652913230":[["Array","Two Pointers","String","Sorting"],["数组","双指针","字符串","排序"]],"2653876812":[["Reservoir Sampling","Array","Math","Binary Search","Ordered Set","Prefix Sum","Randomized"],["水塘抽样","数组","数学","二分查找","有序集合","前缀和","随机化"]],"2654590324":[["String","String Matching","Hash Function","Rolling Hash"],["字符串","字符串匹配","哈希函数","滚动哈希"]],"2654831659":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"2655169339":[["Queue","Array","Sliding Window","Monotonic Queue","Heap (Priority Queue)"],["队列","数组","滑动窗口","单调队列","堆（优先队列）"]],"2655862888":[["Math","Simulation"],["数学","模拟"]],"2657502607":[["Greedy","Array","Hash Table","Counting"],["贪心","数组","哈希表","计数"]],"2658427199":[["Array","Binary Search"],["数组","二分查找"]],"2658657252":[["Database"],["数据库"]],"2659424902":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort","Memoization","Array","Dynamic Programming","Matrix"],["深度优先搜索","广度优先搜索","图","拓扑排序","记忆化搜索","数组","动态规划","矩阵"]],"2660105967":[["Bit Manipulation"],["位运算"]],"2661403855":[["Bit Manipulation","Hash Table","String","Prefix Sum"],["位运算","哈希表","字符串","前缀和"]],"2661850381":[["Database"],["数据库"]],"2661929533":[["Array","Hash Table","String","Counting"],["数组","哈希表","字符串","计数"]],"2664015237":[["Array","Math","Enumeration","Number Theory"],["数组","数学","枚举","数论"]],"2664544460":[["Graph","Array","Shortest Path","Heap (Priority Queue)"],["图","数组","最短路","堆（优先队列）"]],"266469116":[["Stack","Greedy","String","Monotonic Stack"],["栈","贪心","字符串","单调栈"]],"2665985011":[["Math","String","Backtracking","Enumeration"],["数学","字符串","回溯","枚举"]],"2666352866":[["Array","String","Simulation"],["数组","字符串","模拟"]],"2668311333":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"2669738738":[["Brainteaser","Math","Dynamic Programming","Game Theory"],["脑筋急转弯","数学","动态规划","博弈"]],"2670146102":[["Greedy","Array","Sorting","Heap (Priority Queue)"],["贪心","数组","排序","堆（优先队列）"]],"2670735101":[["Math"],["数学"]],"267105112":[null,null],"2671757819":[["Dynamic Programming"],["动态规划"]],"2672352527":[["Tree","Graph","Array","Strongly Connected Component"],["树","图","数组","强连通分量"]],"267246445":[["Stack","Union Find","Binary Indexed Tree","Segment Tree","Array","Binary Search","Dynamic Programming"],["栈","并查集","树状数组","线段树","数组","二分查找","动态规划"]],"267587420":[["Math","Simulation"],["数学","模拟"]],"2676463244":[["Greedy","Array","Math","Binary Search","Sorting"],["贪心","数组","数学","二分查找","排序"]],"2677897468":[["Hash Table","Math","Dynamic Programming","Heap (Priority Queue)"],["哈希表","数学","动态规划","堆（优先队列）"]],"2678350009":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"268029565":[["Bit Manipulation","Brainteaser","Math"],["位运算","脑筋急转弯","数学"]],"2680668911":[["Graph","Shortest Path","Heap (Priority Queue)"],["图","最短路","堆（优先队列）"]],"268097121":[["Array","Binary Search","Dynamic Programming"],["数组","二分查找","动态规划"]],"2681170798":[["Math","Enumeration"],["数学","枚举"]],"2681795867":[["Breadth-First Search","Array","Dynamic Programming"],["广度优先搜索","数组","动态规划"]],"268274286":[["Stack","Greedy","String"],["栈","贪心","字符串"]],"2683746085":[["Design","Queue","Array","Linked List"],["设计","队列","数组","链表"]],"268471907":[["Greedy","Array","Matrix","Sorting","Heap (Priority Queue)"],["贪心","数组","矩阵","排序","堆（优先队列）"]],"268498493":[["Array","Hash Table","Divide and Conquer","Bucket Sort","Counting","Quickselect","Sorting","Heap (Priority Queue)"],["数组","哈希表","分治","桶排序","计数","快速选择","排序","堆（优先队列）"]],"2687486440":[["Greedy","String"],["贪心","字符串"]],"2688493082":[["Greedy","Array","Two Pointers","Sorting"],["贪心","数组","双指针","排序"]],"2688612867":[["Array","Math","Number Theory"],["数组","数学","数论"]],"2689567416":[["Array","Sorting"],["数组","排序"]],"2690606528":[["Array","Math"],["数组","数学"]],"269077288":[["Tree","Binary Search Tree","Array","Divide and Conquer","Binary Tree"],["树","二叉搜索树","数组","分治","二叉树"]],"2691544887":[["Bit Manipulation","Array"],["位运算","数组"]],"269219514":[null,null],"2692580018":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"2693685785":[["Greedy","Hash Table","String","Sorting"],["贪心","哈希表","字符串","排序"]],"2694109670":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"2694237057":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"2695383302":[["Stack","Greedy","String","Monotonic Stack"],["栈","贪心","字符串","单调栈"]],"2695613806":[["Array","Sorting"],["数组","排序"]],"2697040026":[["Array","Matrix","Sorting"],["数组","矩阵","排序"]],"2697534725":[["Hash Table","Math","String","Combinatorics","Counting"],["哈希表","数学","字符串","组合数学","计数"]],"2698936427":[["Greedy","Array"],["贪心","数组"]],"2699690813":[["Bit Manipulation","Array","String"],["位运算","数组","字符串"]],"2701115423":[["Array","Binary Search","Ordered Set"],["数组","二分查找","有序集合"]],"2704310299":[["Depth-First Search","Breadth-First Search","Union Find","Array","Hash Table","String"],["深度优先搜索","广度优先搜索","并查集","数组","哈希表","字符串"]],"270435993":[["Depth-First Search","Array"],["深度优先搜索","数组"]],"2705053633":[["Tree","Design","Binary Search Tree","Binary Tree","Data Stream","Heap (Priority Queue)"],["树","设计","二叉搜索树","二叉树","数据流","堆（优先队列）"]],"2709105566":[["Database"],["数据库"]],"2710343893":[["Tree","Binary Search Tree","Backtracking","Binary Tree"],["树","二叉搜索树","回溯","二叉树"]],"2711761019":[["Bit Manipulation","Trie","Array"],["位运算","字典树","数组"]],"2711929003":[["Database"],["数据库"]],"271335539":[["Array","Dynamic Programming"],["数组","动态规划"]],"2714484334":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"2715109000":[["Array","Math","Number Theory"],["数组","数学","数论"]],"2715798469":[["Linked List"],["链表"]],"2716044195":[["Dynamic Programming"],["动态规划"]],"2716169684":[["Recursion","String","Dynamic Programming"],["递归","字符串","动态规划"]],"271664224":[["Union Find","Graph","Minimum Spanning Tree","Heap (Priority Queue)"],["并查集","图","最小生成树","堆（优先队列）"]],"2716747123":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"2717395786":[["Array","Math","Dynamic Programming","Sorting"],["数组","数学","动态规划","排序"]],"2717768736":[["Math"],["数学"]],"2718567180":[["Tree","Depth-First Search","Binary Search Tree","Binary Search","Binary Tree"],["树","深度优先搜索","二叉搜索树","二分查找","二叉树"]],"2719065978":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"2719330296":[["Greedy","Array","Two Pointers","Binary Search","Sorting"],["贪心","数组","双指针","二分查找","排序"]],"2719928959":[["Greedy","Array","Math"],["贪心","数组","数学"]],"2720318685":[["Array","Hash Table","Dynamic Programming","Sliding Window"],["数组","哈希表","动态规划","滑动窗口"]],"2721035468":[["Math"],["数学"]],"2721924500":[["Database"],["数据库"]],"2722367436":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"2724880133":[["Array","Binary Search"],["数组","二分查找"]],"2725160392":[["Greedy","Bit Manipulation","Array"],["贪心","位运算","数组"]],"2726967243":[["Stack","Recursion","Linked List","Two Pointers"],["栈","递归","链表","双指针"]],"2730930360":[["Array","Two Pointers","Simulation","Heap (Priority Queue)"],["数组","双指针","模拟","堆（优先队列）"]],"2731154173":[["Tree","Depth-First Search","Breadth-First Search","Array","Hash Table","String"],["树","深度优先搜索","广度优先搜索","数组","哈希表","字符串"]],"2731213430":[["Greedy","Array","Math","Dynamic Programming","Number Theory"],["贪心","数组","数学","动态规划","数论"]],"2732657659":[["Tree","Depth-First Search","Binary Search Tree","Array","Binary Search","Binary Tree"],["树","深度优先搜索","二叉搜索树","数组","二分查找","二叉树"]],"2733655053":[["Shell"],[""]],"2734248382":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2735085930":[["Depth-First Search","Breadth-First Search","Union Find","Array","Binary Search","Matrix","Heap (Priority Queue)"],["深度优先搜索","广度优先搜索","并查集","数组","二分查找","矩阵","堆（优先队列）"]],"2735293288":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"2735453204":[["Trie","Array","String","Backtracking"],["字典树","数组","字符串","回溯"]],"2736390850":[["Recursion","Linked List"],["递归","链表"]],"2737172644":[["Array","Hash Table","Math","Prefix Sum"],["数组","哈希表","数学","前缀和"]],"2737402297":[["Array","Binary Search","Sorting"],["数组","二分查找","排序"]],"2741739967":[["Database"],["数据库"]],"2745040429":[["Math","Backtracking"],["数学","回溯"]],"2747291591":[["Design","Queue","Data Stream","Ordered Set","Heap (Priority Queue)"],["设计","队列","数据流","有序集合","堆（优先队列）"]],"274815330":[null,null],"2748231496":[["Bit Manipulation","Graph","Array","Dynamic Programming","Bitmask"],["位运算","图","数组","动态规划","状态压缩"]],"2748555921":[["Graph"],["图"]],"2749155125":[["Database"],["数据库"]],"2752494454":[["Array","Bucket Sort","Ordered Set","Sorting","Sliding Window"],["数组","桶排序","有序集合","排序","滑动窗口"]],"2754272500":[["Design","Counting","Simulation"],["设计","计数","模拟"]],"2754546565":[["Hash Table","String","Counting","Sliding Window"],["哈希表","字符串","计数","滑动窗口"]],"2756999860":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"2757319898":[["Array","Math"],["数组","数学"]],"2758231762":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2758653794":[["Database"],["数据库"]],"2758696959":[["Depth-First Search","Breadth-First Search","Array","Matrix"],["深度优先搜索","广度优先搜索","数组","矩阵"]],"275986604":[["Breadth-First Search","Graph","Array"],["广度优先搜索","图","数组"]],"2760734604":[["Depth-First Search","Breadth-First Search","String","Interactive"],["深度优先搜索","广度优先搜索","字符串","交互"]],"2762853048":[["Stack","Array","Dynamic Programming","Monotonic Stack"],["栈","数组","动态规划","单调栈"]],"2764953948":[["Queue","Array","Simulation"],["队列","数组","模拟"]],"2765939834":[["Bit Manipulation"],["位运算"]],"2768437968":[["Bit Manipulation","Trie","Array"],["位运算","字典树","数组"]],"2771270445":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"2772237177":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"2772831251":[["Greedy","Array","Binary Search"],["贪心","数组","二分查找"]],"2774491833":[["Greedy","String","Dynamic Programming"],["贪心","字符串","动态规划"]],"2775325601":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort"],["深度优先搜索","广度优先搜索","图","拓扑排序"]],"2775344327":[["Greedy","Array","Binary Search","Prefix Sum","Sorting"],["贪心","数组","二分查找","前缀和","排序"]],"2775508810":[["Array","Hash Table"],["数组","哈希表"]],"2775921161":[["Shell"],[""]],"2776150092":[["Bit Manipulation","Array","String","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","字符串","动态规划","回溯","状态压缩"]],"2776357853":[["Database"],["数据库"]],"2777625264":[["Math","String","Simulation"],["数学","字符串","模拟"]],"2777743854":[["Array","Hash Table","String","String Matching"],["数组","哈希表","字符串","字符串匹配"]],"2782100417":[["Union Find","Counting","Interactive"],["并查集","计数","交互"]],"2782517328":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"2782890042":[["Array","Dynamic Programming"],["数组","动态规划"]],"2783546107":[["String","Dynamic Programming","Backtracking"],["字符串","动态规划","回溯"]],"2783905922":[["Database"],["数据库"]],"278391428":[["Design","Array","String","Iterator"],["设计","数组","字符串","迭代器"]],"278493845":[["Array","Binary Search"],["数组","二分查找"]],"2785029557":[["Database"],["数据库"]],"2786534786":[["Dynamic Programming"],["动态规划"]],"2786999216":[["Greedy","Array","Hash Table","Counting"],["贪心","数组","哈希表","计数"]],"2788838402":[["Depth-First Search","Breadth-First Search","Graph","Dynamic Programming","Shortest Path","Heap (Priority Queue)"],["深度优先搜索","广度优先搜索","图","动态规划","最短路","堆（优先队列）"]],"2791285030":[["Tree","Depth-First Search","Dynamic Programming","Binary Tree"],["树","深度优先搜索","动态规划","二叉树"]],"2792312732":[["Greedy","Array","Two Pointers","String"],["贪心","数组","双指针","字符串"]],"2792663761":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"2794667518":[["Bit Manipulation","Array","Math","Matrix"],["位运算","数组","数学","矩阵"]],"2795839755":[["Array","Two Pointers","Binary Search"],["数组","双指针","二分查找"]],"2795952868":[["Greedy","Math","String","Game Theory"],["贪心","数学","字符串","博弈"]],"2796999710":[["Recursion","Linked List"],["递归","链表"]],"2797831681":[["Math","String","Number Theory"],["数学","字符串","数论"]],"279921423":[null,null],"2799632565":[["Math"],["数学"]],"2799898824":[["Database"],["数据库"]],"2800289700":[["Greedy","Array","Hash Table","String","Counting","Sorting"],["贪心","数组","哈希表","字符串","计数","排序"]],"2801113468":[["Greedy","Array","Hash Table","Math"],["贪心","数组","哈希表","数学"]],"2802523525":[["Two Pointers","String"],["双指针","字符串"]],"2802681137":[["Stack","Hash Table","String","Sorting"],["栈","哈希表","字符串","排序"]],"280396343":[["Hash Table","String"],["哈希表","字符串"]],"2805340615":[["Stack","Recursion","Linked List","Two Pointers"],["栈","递归","链表","双指针"]],"2806136994":[["Tree","Depth-First Search","Breadth-First Search","Math"],["树","深度优先搜索","广度优先搜索","数学"]],"2806558939":[["Greedy","Array","Binary Search","Prefix Sum","Sorting","Sliding Window"],["贪心","数组","二分查找","前缀和","排序","滑动窗口"]],"2806765401":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"2809882420":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"2810226521":[["Bit Manipulation","Hash Table","String","Prefix Sum"],["位运算","哈希表","字符串","前缀和"]],"2811110978":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"2811209697":[["Math","String","Sliding Window"],["数学","字符串","滑动窗口"]],"2812871030":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"2817202669":[["Array","Sliding Window"],["数组","滑动窗口"]],"2817465096":[["Greedy","Array","String"],["贪心","数组","字符串"]],"2818199514":[["Database"],["数据库"]],"2818493377":[["Array","Hash Table","Sorting","Simulation"],["数组","哈希表","排序","模拟"]],"2818810857":[["Database"],["数据库"]],"2818984798":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"2819110526":[["Array","Binary Search"],["数组","二分查找"]],"2821066759":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"2821965653":[["Hash Table","String"],["哈希表","字符串"]],"2823295914":[["Bit Manipulation","Math"],["位运算","数学"]],"282466705":[["Union Find","Graph","Minimum Spanning Tree","Heap (Priority Queue)"],["并查集","图","最小生成树","堆（优先队列）"]],"2826164889":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"2827089777":[["Greedy","String","Enumeration"],["贪心","字符串","枚举"]],"2827658293":[["Math","Dynamic Programming","Number Theory"],["数学","动态规划","数论"]],"282802217":[["Greedy","Two Pointers","String"],["贪心","双指针","字符串"]],"2829216648":[["Greedy","String"],["贪心","字符串"]],"2829252669":[["Math","Binary Search"],["数学","二分查找"]],"28298643":[null,null],"2832741065":[["Design","Binary Indexed Tree","Binary Search","Data Stream"],["设计","树状数组","二分查找","数据流"]],"2832770135":[["Database"],["数据库"]],"2833016658":[["Array","Prefix Sum"],["数组","前缀和"]],"2833179922":[["Array","Matrix"],["数组","矩阵"]],"2833491097":[["Array","String","Prefix Sum"],["数组","字符串","前缀和"]],"2835500769":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"2836143893":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2836390896":[["Hash Table","String"],["哈希表","字符串"]],"28373825":[["Array","Dynamic Programming","Prefix Sum"],["数组","动态规划","前缀和"]],"283849083":[["Design","Queue","Array","Hash Table","Simulation"],["设计","队列","数组","哈希表","模拟"]],"28387341":[["Depth-First Search","Breadth-First Search","Union Find","Graph","Hash Table"],["深度优先搜索","广度优先搜索","并查集","图","哈希表"]],"2841712876":[["Linked List"],["链表"]],"2841881996":[["Array","Simulation"],["数组","模拟"]],"2844126076":[["Array"],["数组"]],"2844316244":[["Array","Sorting"],["数组","排序"]],"2844666696":[["Math","String"],["数学","字符串"]],"2844670670":[["Stack","Array","Simulation"],["栈","数组","模拟"]],"2844675085":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"2845488076":[["String","Dynamic Programming"],["字符串","动态规划"]],"2845865407":[["Stack","Design","Linked List"],["栈","设计","链表"]],"2845929476":[["Array","String","Binary Search","Interactive"],["数组","字符串","二分查找","交互"]],"284708083":[["Bit Manipulation","Array","Dynamic Programming","Bitmask"],["位运算","数组","动态规划","状态压缩"]],"2850260537":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2851269000":[["Depth-First Search","Breadth-First Search","Graph","Dynamic Programming"],["深度优先搜索","广度优先搜索","图","动态规划"]],"2853983730":[["Linked List","Math","Two Pointers"],["链表","数学","双指针"]],"2855675520":[["Greedy","Array","Sorting","Heap (Priority Queue)"],["贪心","数组","排序","堆（优先队列）"]],"2856501208":[["Greedy","Array","Hash Table","Counting","Sorting","Heap (Priority Queue)"],["贪心","数组","哈希表","计数","排序","堆（优先队列）"]],"2857257236":[["Database"],["数据库"]],"2857979415":[["Array","Math","String","Game Theory","Interactive"],["数组","数学","字符串","博弈","交互"]],"2858385254":[["Database"],["数据库"]],"2860419980":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"2860632733":[["Array","Dynamic Programming"],["数组","动态规划"]],"286069565":[["Array","String","Sorting"],["数组","字符串","排序"]],"2860849459":[["Graph","Array","String","Shortest Path"],["图","数组","字符串","最短路"]],"2862855056":[["Array","Math","Binary Search","Prefix Sum"],["数组","数学","二分查找","前缀和"]],"286585708":[["Binary Indexed Tree","Segment Tree","Array","Binary Search","Divide and Conquer","Ordered Set","Merge Sort"],["树状数组","线段树","数组","二分查找","分治","有序集合","归并排序"]],"2867135222":[["Memoization","Array","Dynamic Programming"],["记忆化搜索","数组","动态规划"]],"286718649":[["Array","Two Pointers"],["数组","双指针"]],"2868656571":[["Array","Hash Table","Math","Sliding Window"],["数组","哈希表","数学","滑动窗口"]],"2871847316":[["Stack","String"],["栈","字符串"]],"2874032831":[["Design","Array","Counting","Iterator"],["设计","数组","计数","迭代器"]],"2875235685":[["Array","Hash Table","Math","Matrix"],["数组","哈希表","数学","矩阵"]],"2875388393":[["Breadth-First Search","Graph","Array","Matrix","Shortest Path","Heap (Priority Queue)"],["广度优先搜索","图","数组","矩阵","最短路","堆（优先队列）"]],"2877331205":[["Bit Manipulation","Hash Table","String"],["位运算","哈希表","字符串"]],"2880212557":[["Depth-First Search","Breadth-First Search","Union Find","Array","Hash Table","String"],["深度优先搜索","广度优先搜索","并查集","数组","哈希表","字符串"]],"2882449995":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"288305998":[["Greedy","String"],["贪心","字符串"]],"2885795135":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2887178574":[["Geometry","Array","Hash Table","Math","Binary Search","Sorting"],["几何","数组","哈希表","数学","二分查找","排序"]],"2887492330":[["Greedy","String","Prefix Sum"],["贪心","字符串","前缀和"]],"2887872471":[["Tree","Depth-First Search","Array","Dynamic Programming"],["树","深度优先搜索","数组","动态规划"]],"2887915717":[["Geometry","Array","Hash Table","Math","Enumeration"],["几何","数组","哈希表","数学","枚举"]],"288912613":[["Array","String","Backtracking","Simulation"],["数组","字符串","回溯","模拟"]],"2889905668":[["Greedy","Math"],["贪心","数学"]],"2890033615":[["Two Pointers","String"],["双指针","字符串"]],"289054660":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"2890702645":[["Array","Sliding Window"],["数组","滑动窗口"]],"2891293644":[["Array","Hash Table","Counting","Sorting"],["数组","哈希表","计数","排序"]],"2893112489":[["Hash Table","String","Hash Function","Rolling Hash"],["哈希表","字符串","哈希函数","滚动哈希"]],"2893302110":[null,null],"2894413444":[["Array","Counting"],["数组","计数"]],"2894984014":[["Array","Binary Search"],["数组","二分查找"]],"2896936333":[["Bit Manipulation","Array","Backtracking","Enumeration"],["位运算","数组","回溯","枚举"]],"2899114132":[["Union Find","Array","Hash Table"],["并查集","数组","哈希表"]],"2900835893":[["Backtracking"],["回溯"]],"290394387":[["Array","Two Pointers","Simulation"],["数组","双指针","模拟"]],"2904534885":[["Greedy","Array","Hash Table"],["贪心","数组","哈希表"]],"290469472":[["Math","String","Simulation"],["数学","字符串","模拟"]],"2906372689":[["Breadth-First Search","Graph","Array","Matrix","Shortest Path","Heap (Priority Queue)"],["广度优先搜索","图","数组","矩阵","最短路","堆（优先队列）"]],"2906626601":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2907430999":[["Array","Dynamic Programming"],["数组","动态规划"]],"2907477166":[["Array","Hash Table","Math"],["数组","哈希表","数学"]],"2908043044":[["Array","Interactive","Simulation"],["数组","交互","模拟"]],"2908242202":[["Bit Manipulation","Array","Dynamic Programming"],["位运算","数组","动态规划"]],"2910887198":[["Database"],["数据库"]],"2912571228":[["Array","Math","Dynamic Programming","Probability and Statistics"],["数组","数学","动态规划","概率与统计"]],"2912901265":[["Array","Hash Table","String","Sorting"],["数组","哈希表","字符串","排序"]],"2913358439":[["Array","Hash Table","Two Pointers","Binary Search"],["数组","哈希表","双指针","二分查找"]],"2914198967":[["Stack","Greedy","String","Backtracking"],["栈","贪心","字符串","回溯"]],"2919642920":[["Tree","Depth-First Search","Binary Search Tree","Dynamic Programming","Binary Tree"],["树","深度优先搜索","二叉搜索树","动态规划","二叉树"]],"2921275572":[["Trie","Array","Hash Table","String","Hash Function"],["字典树","数组","哈希表","字符串","哈希函数"]],"2921363389":[["Array","Hash Table","Binary Search","Dynamic Programming","Sorting"],["数组","哈希表","二分查找","动态规划","排序"]],"2922912159":[["Hash Table","String","Divide and Conquer","Sliding Window"],["哈希表","字符串","分治","滑动窗口"]],"2923349215":[["Array","Hash Table","Counting","Matrix"],["数组","哈希表","计数","矩阵"]],"2923893711":[["Design","Trie","Hash Table","String"],["设计","字典树","哈希表","字符串"]],"2924722129":[["Database"],["数据库"]],"2925535868":[["Union Find","Array","Matrix"],["并查集","数组","矩阵"]],"292566381":[["Tree","Breadth-First Search","Binary Tree"],["树","广度优先搜索","二叉树"]],"2927708041":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"2929435421":[["Design","Segment Tree","Binary Search","Ordered Set"],["设计","线段树","二分查找","有序集合"]],"2929737515":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"2931755222":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"2936931094":[["Array","Math","Two Pointers","String","Game Theory"],["数组","数学","双指针","字符串","博弈"]],"2937149161":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"2937224937":[["Array","Math","Matrix","Simulation"],["数组","数学","矩阵","模拟"]],"2938025699":[["Greedy","Array","Hash Table","Sorting","Sliding Window","Heap (Priority Queue)"],["贪心","数组","哈希表","排序","滑动窗口","堆（优先队列）"]],"2938169108":[["String"],["字符串"]],"2939618078":[["Array","Hash Table","String","Counting","Sorting"],["数组","哈希表","字符串","计数","排序"]],"2939895760":[["Bit Manipulation","Trie","Array"],["位运算","字典树","数组"]],"2940442922":[["String","Backtracking"],["字符串","回溯"]],"2941821802":[["Two Pointers","String"],["双指针","字符串"]],"2941915891":[["Stack","String"],["栈","字符串"]],"2942569006":[["Shell"],[""]],"2942833315":[["Union Find","Array","Matrix"],["并查集","数组","矩阵"]],"2945497882":[["Array","Math","Matrix"],["数组","数学","矩阵"]],"2945726008":[["Array","Sorting","Heap (Priority Queue)"],["数组","排序","堆（优先队列）"]],"2945975892":[["Depth-First Search","Breadth-First Search","Graph","Array","String","Matrix","Shortest Path","Heap (Priority Queue)"],["深度优先搜索","广度优先搜索","图","数组","字符串","矩阵","最短路","堆（优先队列）"]],"2946534771":[["String"],["字符串"]],"2948030094":[["Math"],["数学"]],"2948668320":[["Design","Queue","Array","Math","Data Stream"],["设计","队列","数组","数学","数据流"]],"2949409019":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"2950336182":[["Math","Backtracking"],["数学","回溯"]],"295088238":[["Design","Queue","Array","Data Stream"],["设计","队列","数组","数据流"]],"2956439807":[["Graph","Shortest Path","Heap (Priority Queue)"],["图","最短路","堆（优先队列）"]],"2957762475":[["Bit Manipulation","Array","Hash Table","Math","Binary Search","Sorting"],["位运算","数组","哈希表","数学","二分查找","排序"]],"296151509":[["Greedy","Array","Matrix","Prefix Sum"],["贪心","数组","矩阵","前缀和"]],"2962478235":[["String"],["字符串"]],"2963413938":[["Bit Manipulation","Graph","Dynamic Programming","Bitmask"],["位运算","图","动态规划","状态压缩"]],"2964379464":[["Database"],["数据库"]],"2964689219":[["Tree","Depth-First Search","Breadth-First Search","Hash Table","Counting"],["树","深度优先搜索","广度优先搜索","哈希表","计数"]],"2965139328":[["Stack","String"],["栈","字符串"]],"296740468":[["Array","Binary Search","Prefix Sum","Sliding Window"],["数组","二分查找","前缀和","滑动窗口"]],"2967621636":[["Array","Dynamic Programming","Heap (Priority Queue)"],["数组","动态规划","堆（优先队列）"]],"2970227389":[["Math"],["数学"]],"2970771602":[["Stack","Array","Simulation"],["栈","数组","模拟"]],"2972412900":[["Array","Simulation"],["数组","模拟"]],"2972764344":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"2974872053":[["Database"],["数据库"]],"2975776867":[["String"],["字符串"]],"2976472096":[["Array","Backtracking","Matrix"],["数组","回溯","矩阵"]],"2977235574":[["Greedy","Array","Hash Table","String","Counting"],["贪心","数组","哈希表","字符串","计数"]],"2980355580":[["Array","Simulation"],["数组","模拟"]],"2981004463":[["Array","Math","Counting","Number Theory"],["数组","数学","计数","数论"]],"298215454":[["Array","String","Dynamic Programming"],["数组","字符串","动态规划"]],"2982198446":[["Linked List","Two Pointers"],["链表","双指针"]],"2986133546":[["Binary Indexed Tree","Array","Ordered Set","Sliding Window"],["树状数组","数组","有序集合","滑动窗口"]],"298794774":[["Bit Manipulation","Array","String"],["位运算","数组","字符串"]],"2988189921":[["Greedy","Math"],["贪心","数学"]],"2988782714":[["Array","Math","Dynamic Programming","Combinatorics"],["数组","数学","动态规划","组合数学"]],"2993182441":[["Hash Table","Linked List","Two Pointers"],["哈希表","链表","双指针"]],"2994488407":[["Database"],["数据库"]],"29974146":[["Database"],["数据库"]],"2997800679":[["Bit Manipulation","Array","Dynamic Programming","Bitmask"],["位运算","数组","动态规划","状态压缩"]],"3000728502":[["Design","Trie","Hash Table","String"],["设计","字典树","哈希表","字符串"]],"3006111591":[["Stack","Recursion","Linked List","Two Pointers"],["栈","递归","链表","双指针"]],"3006434957":[["Math","String"],["数学","字符串"]],"3007102778":[["Math"],["数学"]],"3008054233":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"300846689":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"3008885805":[["Bit Manipulation","Array"],["位运算","数组"]],"3009824135":[["Database"],["数据库"]],"3010901510":[["Bit Manipulation","Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["位运算","树","深度优先搜索","广度优先搜索","二叉树"]],"3011717282":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"3012034950":[["Union Find","Graph","Minimum Spanning Tree"],["并查集","图","最小生成树"]],"3012401904":[["Greedy","Math","String"],["贪心","数学","字符串"]],"3013367275":[["String","Sliding Window"],["字符串","滑动窗口"]],"3014957498":[["Greedy","String"],["贪心","字符串"]],"3015354306":[["Graph","Array","Two Pointers","Binary Search","Sorting"],["图","数组","双指针","二分查找","排序"]],"301567212":[["Greedy","Array","Sorting","Heap (Priority Queue)"],["贪心","数组","排序","堆（优先队列）"]],"3016140328":[["Database"],["数据库"]],"301734990":[["Greedy","Array","Two Pointers","Sorting"],["贪心","数组","双指针","排序"]],"301753506":[["Database"],["数据库"]],"3020603346":[["Graph","Topological Sort","Dynamic Programming","Shortest Path"],["图","拓扑排序","动态规划","最短路"]],"3021409572":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"3021563284":[["Bit Manipulation","Array","Divide and Conquer","Matrix","Prefix Sum","Quickselect","Heap (Priority Queue)"],["位运算","数组","分治","矩阵","前缀和","快速选择","堆（优先队列）"]],"3022128117":[["Array","Math","String","Sorting"],["数组","数学","字符串","排序"]],"3022905195":[["Database"],["数据库"]],"3023056451":[["Array","Hash Table","Math","Simulation"],["数组","哈希表","数学","模拟"]],"3023068102":[["Stack","Array","Dynamic Programming","Matrix","Monotonic Stack"],["栈","数组","动态规划","矩阵","单调栈"]],"3023386017":[["Array","Math","String","Binary Search","Dynamic Programming"],["数组","数学","字符串","二分查找","动态规划"]],"3024031273":[["Breadth-First Search","Memoization","Dynamic Programming"],["广度优先搜索","记忆化搜索","动态规划"]],"3026486305":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"3029042062":[["Array","Two Pointers","Simulation"],["数组","双指针","模拟"]],"3030939616":[["Database"],["数据库"]],"3033578529":[["Greedy","Hash Table","String","Counting","Sorting","Heap (Priority Queue)"],["贪心","哈希表","字符串","计数","排序","堆（优先队列）"]],"3033778664":[["Math","String","Simulation"],["数学","字符串","模拟"]],"3036629795":[["Database"],["数据库"]],"3036702868":[["Array","Hash Table","Math","Number Theory"],["数组","哈希表","数学","数论"]],"3037047822":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"303821987":[["Array"],["数组"]],"3039372847":[["Tree","Array","Hash Table","Divide and Conquer","Binary Tree"],["树","数组","哈希表","分治","二叉树"]],"3039695626":[["Tree","Depth-First Search","String","Backtracking","Binary Tree"],["树","深度优先搜索","字符串","回溯","二叉树"]],"3042113223":[["Depth-First Search","Breadth-First Search","Union Find","Hash Table","Hash Function"],["深度优先搜索","广度优先搜索","并查集","哈希表","哈希函数"]],"3042599528":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"3042739559":[["Hash Table","String","Sorting"],["哈希表","字符串","排序"]],"3044209556":[["Array"],["数组"]],"3048586035":[["Array","Prefix Sum","Simulation"],["数组","前缀和","模拟"]],"3050888295":[["String","Simulation"],["字符串","模拟"]],"3052741649":[["Array","Math","Simulation"],["数组","数学","模拟"]],"3052763610":[["Database"],["数据库"]],"3054721758":[["Hash Table","String"],["哈希表","字符串"]],"3054917007":[["Database"],["数据库"]],"305518406":[["Array","Hash Table","Counting","Sorting"],["数组","哈希表","计数","排序"]],"3057194499":[["Array"],["数组"]],"3057254301":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"3057587548":[["Stack","Greedy","Array","Monotonic Stack"],["栈","贪心","数组","单调栈"]],"305762053":[["Array","Dynamic Programming"],["数组","动态规划"]],"305789656":[["String","String Matching"],["字符串","字符串匹配"]],"3058790867":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"3059718647":[["Array","Math"],["数组","数学"]],"3061824471":[["Greedy","String","Backtracking","Counting","Enumeration"],["贪心","字符串","回溯","计数","枚举"]],"3063296642":[["Greedy","Array","Two Pointers","Sorting"],["贪心","数组","双指针","排序"]],"3065232387":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"3065742618":[["Array","Hash Table","Enumeration"],["数组","哈希表","枚举"]],"306595116":[["Array","Binary Search"],["数组","二分查找"]],"3066842082":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"3067908479":[["Stack","Greedy","Hash Table","String"],["栈","贪心","哈希表","字符串"]],"3071090507":[["Array","Backtracking","Matrix"],["数组","回溯","矩阵"]],"3071565639":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"3072879804":[["Binary Indexed Tree","Segment Tree","Array","Binary Search","Divide and Conquer","Ordered Set","Merge Sort"],["树状数组","线段树","数组","二分查找","分治","有序集合","归并排序"]],"3073027638":[["Stack","Array","Simulation"],["栈","数组","模拟"]],"3073583780":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"3074518984":[["Bit Manipulation","Trie","Array","Hash Table","Sliding Window"],["位运算","字典树","数组","哈希表","滑动窗口"]],"3074557522":[null,null],"3075022101":[["Database"],["数据库"]],"3077002187":[["Array"],["数组"]],"3077217367":[["Memoization","Dynamic Programming"],["记忆化搜索","动态规划"]],"3077259720":[["Breadth-First Search"],["广度优先搜索"]],"307769453":[["Array","Hash Table","Binary Search","Prefix Sum","Sliding Window"],["数组","哈希表","二分查找","前缀和","滑动窗口"]],"3078556108":[["Bit Manipulation","Memoization","Math","Dynamic Programming","Bitmask","Game Theory"],["位运算","记忆化搜索","数学","动态规划","状态压缩","博弈"]],"3078609754":[["Math","Number Theory"],["数学","数论"]],"3081794904":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"3082325802":[["Stack","Tree","String","Binary Tree"],["栈","树","字符串","二叉树"]],"3085208156":[["Database"],["数据库"]],"3087387634":[["Design","Trie","Hash Table","String"],["设计","字典树","哈希表","字符串"]],"3089019377":[null,null],"3091785544":[["String"],["字符串"]],"3092398094":[["Greedy","String"],["贪心","字符串"]],"3092850192":[null,null],"3094069966":[["Database"],["数据库"]],"3094793771":[["Math","Binary Search"],["数学","二分查找"]],"3098562302":[["Array","Matrix","Prefix Sum"],["数组","矩阵","前缀和"]],"3098982613":[["String"],["字符串"]],"3099950101":[null,null],"3100993645":[["Linked List"],["链表"]],"3102719435":[["Array","Hash Table","Enumeration","Sorting"],["数组","哈希表","枚举","排序"]],"3102780834":[["Greedy","Array"],["贪心","数组"]],"3104122930":[["Bit Manipulation","Array","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","动态规划","回溯","状态压缩"]],"3104482374":[["Bit Manipulation","Array","Hash Table"],["位运算","数组","哈希表"]],"3105635512":[["Math"],["数学"]],"3105899717":[["Design","Trie","Hash Table","String"],["设计","字典树","哈希表","字符串"]],"3111378170":[["Database"],["数据库"]],"3116000782":[["Database"],["数据库"]],"3117661899":[["Array","Hash Table"],["数组","哈希表"]],"3118022376":[null,null],"3118895370":[["Depth-First Search","Breadth-First Search","Array","Dynamic Programming","Matrix"],["深度优先搜索","广度优先搜索","数组","动态规划","矩阵"]],"3119137809":[["Greedy","Array"],["贪心","数组"]],"3119606051":[["Greedy","Array"],["贪心","数组"]],"3121754844":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"3123299347":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"3123575090":[["Array","Hash Table","Counting","Sliding Window"],["数组","哈希表","计数","滑动窗口"]],"3124896474":[["Array","Hash Table","Prefix Sum","Sliding Window"],["数组","哈希表","前缀和","滑动窗口"]],"3126143245":[["Binary Indexed Tree","Segment Tree","Array","Binary Search","Divide and Conquer","Ordered Set","Merge Sort"],["树状数组","线段树","数组","二分查找","分治","有序集合","归并排序"]],"3126153106":[["Bit Manipulation"],["位运算"]],"3128004049":[["Geometry","Array","Math"],["几何","数组","数学"]],"3130296264":[["Array","Bucket Sort","Radix Sort","Sorting"],["数组","桶排序","基数排序","排序"]],"3134274088":[["Stack","Array","Matrix","Monotonic Stack"],["栈","数组","矩阵","单调栈"]],"3135227116":[["Math"],["数学"]],"3135662522":[["Hash Table","Math","String"],["哈希表","数学","字符串"]],"3136260573":[["Two Pointers","String"],["双指针","字符串"]],"3137406326":[["Array","Hash Table"],["数组","哈希表"]],"3139221174":[["Depth-First Search","Breadth-First Search","Graph","Backtracking"],["深度优先搜索","广度优先搜索","图","回溯"]],"3143101757":[["Array","Hash Table","String","Sorting","Heap (Priority Queue)"],["数组","哈希表","字符串","排序","堆（优先队列）"]],"3144113364":[["Tree","Breadth-First Search","Binary Tree"],["树","广度优先搜索","二叉树"]],"3147357769":[["Two Pointers","String"],["双指针","字符串"]],"3147772108":[["Stack","Array","Prefix Sum","Monotonic Stack"],["栈","数组","前缀和","单调栈"]],"3148467486":[["Array","Sorting","Simulation","Heap (Priority Queue)"],["数组","排序","模拟","堆（优先队列）"]],"3152421262":[["Tree","Array","Hash Table","Divide and Conquer","Binary Tree"],["树","数组","哈希表","分治","二叉树"]],"3153044061":[["Depth-First Search","Breadth-First Search","Union Find","Array","Hash Table","String"],["深度优先搜索","广度优先搜索","并查集","数组","哈希表","字符串"]],"315307043":[["Breadth-First Search","Array","Binary Search","Matrix"],["广度优先搜索","数组","二分查找","矩阵"]],"3153125580":[["String"],["字符串"]],"31547081":[["Recursion","Linked List"],["递归","链表"]],"3156996757":[["Array","Hash Table","String","Simulation"],["数组","哈希表","字符串","模拟"]],"315817700":[["String"],["字符串"]],"3158353268":[["Array","Math","Matrix","Number Theory"],["数组","数学","矩阵","数论"]],"3158438690":[["Array","Prefix Sum"],["数组","前缀和"]],"3158785397":[["Hash Table","Linked List"],["哈希表","链表"]],"3163189151":[["Bit Manipulation","Trie","Array","Hash Table"],["位运算","字典树","数组","哈希表"]],"3164365433":[["Two Pointers","String"],["双指针","字符串"]],"3165325622":[["Stack","String"],["栈","字符串"]],"3167447804":[null,null],"3167797510":[["Bit Manipulation","Math","String","Simulation"],["位运算","数学","字符串","模拟"]],"3168538687":[["Database"],["数据库"]],"3168618130":[["Math"],["数学"]],"3168914756":[["Greedy","Trie","Array","String","Sorting"],["贪心","字典树","数组","字符串","排序"]],"3169129420":[["Stack","Design","Queue"],["栈","设计","队列"]],"3177194252":[["String","Simulation"],["字符串","模拟"]],"3178253488":[["Array","Hash Table","Backtracking","Matrix"],["数组","哈希表","回溯","矩阵"]],"3179731139":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"3180919205":[["Design","Segment Tree","Math","Ordered Set"],["设计","线段树","数学","有序集合"]],"3181284261":[["Dynamic Programming"],["动态规划"]],"3182582646":[["Array","Hash Table"],["数组","哈希表"]],"3183111073":[["Stack","String"],["栈","字符串"]],"3183288856":[["Array","Sorting","Sliding Window"],["数组","排序","滑动窗口"]],"3183331658":[["Array","Math"],["数组","数学"]],"3183792133":[["Array","Math","Dynamic Programming","Combinatorics","Number Theory"],["数组","数学","动态规划","组合数学","数论"]],"318431049":[["Database"],["数据库"]],"3184596428":[["Stack","Array","Two Pointers","Binary Search","Monotonic Stack"],["栈","数组","双指针","二分查找","单调栈"]],"3184774485":[["Array","Binary Search"],["数组","二分查找"]],"3187405082":[["Breadth-First Search","Graph","Prefix Sum"],["广度优先搜索","图","前缀和"]],"3188904029":[["Queue","Array","Ordered Set","Sliding Window","Monotonic Queue","Heap (Priority Queue)"],["队列","数组","有序集合","滑动窗口","单调队列","堆（优先队列）"]],"3189584402":[["Bit Manipulation","Array","Counting","Sorting"],["位运算","数组","计数","排序"]],"3189918628":[["Linked List"],["链表"]],"31900963":[["Array","Hash Table","Two Pointers","Sorting"],["数组","哈希表","双指针","排序"]],"3193935538":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"319427731":[["Depth-First Search","Breadth-First Search","Union Find","Array","Binary Search","Matrix","Heap (Priority Queue)"],["深度优先搜索","广度优先搜索","并查集","数组","二分查找","矩阵","堆（优先队列）"]],"3194441729":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"3194493363":[["Array","String","Dynamic Programming"],["数组","字符串","动态规划"]],"3196334031":[["Greedy","Dynamic Programming"],["贪心","动态规划"]],"3197252162":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"3197325121":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"3199967964":[["String","Enumeration"],["字符串","枚举"]],"3201195359":[["Bit Manipulation","Array","Dynamic Programming","Bitmask"],["位运算","数组","动态规划","状态压缩"]],"3202447407":[["Tree","Depth-First Search","Array","Binary Tree"],["树","深度优先搜索","数组","二叉树"]],"320329751":[["String","Binary Search","Dynamic Programming","Suffix Array","Hash Function","Rolling Hash"],["字符串","二分查找","动态规划","后缀数组","哈希函数","滚动哈希"]],"3203568204":[["Database"],["数据库"]],"3205928742":[["Binary Indexed Tree","Segment Tree","Array"],["树状数组","线段树","数组"]],"3210489850":[["Array","Binary Search","Matrix"],["数组","二分查找","矩阵"]],"3210707661":[["Two Pointers","String"],["双指针","字符串"]],"3211790430":[["Array","Hash Table","String","Sorting"],["数组","哈希表","字符串","排序"]],"3214093273":[["Recursion","Linked List"],["递归","链表"]],"3214600049":[["Greedy","Bit Manipulation","Array","Hash Table"],["贪心","位运算","数组","哈希表"]],"3216210693":[["Array","Enumeration"],["数组","枚举"]],"3216682975":[["Stack","Array"],["栈","数组"]],"3219095278":[["Database"],["数据库"]],"3219158198":[["Two Pointers","String","String Matching"],["双指针","字符串","字符串匹配"]],"3221082803":[["Two Pointers","String","Dynamic Programming"],["双指针","字符串","动态规划"]],"3221190981":[["Array","Binary Search"],["数组","二分查找"]],"3221222128":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"3223207411":[["Tree","Binary Search Tree","Binary Tree"],["树","二叉搜索树","二叉树"]],"322371543":[null,null],"3226814527":[null,null],"3228686257":[["Greedy","Array","Hash Table"],["贪心","数组","哈希表"]],"3229303052":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"3230369611":[["Hash Table","String","Dynamic Programming"],["哈希表","字符串","动态规划"]],"3231265233":[["Array","Dynamic Programming"],["数组","动态规划"]],"3231924477":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"3233473889":[["Database"],["数据库"]],"3235710031":[["Depth-First Search","Union Find","Array"],["深度优先搜索","并查集","数组"]],"3235832569":[["Queue","Hash Table","String","Counting"],["队列","哈希表","字符串","计数"]],"3236532355":[["Database"],["数据库"]],"3237331717":[["Recursion","Math"],["递归","数学"]],"3237851921":[["Array","Heap (Priority Queue)"],["数组","堆（优先队列）"]],"324121992":[["Array","Sliding Window"],["数组","滑动窗口"]],"3241642216":[["Bit Manipulation"],["位运算"]],"3241798110":[["Hash Table","Linked List","Two Pointers"],["哈希表","链表","双指针"]],"3241941552":[["Stack","Recursion","Math","String"],["栈","递归","数学","字符串"]],"3243357093":[["Linked List","Two Pointers"],["链表","双指针"]],"3243386336":[["Database"],["数据库"]],"3243872254":[["Array","Hash Table","Matrix"],["数组","哈希表","矩阵"]],"3246372293":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"3246928465":[["Greedy","Array","Ordered Set","Heap (Priority Queue)"],["贪心","数组","有序集合","堆（优先队列）"]],"3248412457":[["Greedy","Graph","Sorting","Heap (Priority Queue)"],["贪心","图","排序","堆（优先队列）"]],"324872429":[["Math","Enumeration","Number Theory"],["数学","枚举","数论"]],"3248742764":[["Array","Dynamic Programming"],["数组","动态规划"]],"3248828921":[["Tree","Binary Search Tree","Binary Tree"],["树","二叉搜索树","二叉树"]],"3250155411":[["String","Sliding Window"],["字符串","滑动窗口"]],"3250523305":[["Array","Binary Search","Sorting","Line Sweep","Heap (Priority Queue)"],["数组","二分查找","排序","扫描线","堆（优先队列）"]],"3250902571":[["Array","Two Pointers"],["数组","双指针"]],"3254374161":[["Array","Hash Table","Sorting","Heap (Priority Queue)"],["数组","哈希表","排序","堆（优先队列）"]],"3256507952":[["Greedy","Array","Math","Sorting"],["贪心","数组","数学","排序"]],"3257900717":[["Array","Dynamic Programming"],["数组","动态规划"]],"3259259158":[["Math","Dynamic Programming","Sliding Window","Probability and Statistics"],["数学","动态规划","滑动窗口","概率与统计"]],"3259782681":[["Stack","Math","String"],["栈","数学","字符串"]],"3261146465":[["Tree","Dynamic Programming","Binary Tree"],["树","动态规划","二叉树"]],"3261672467":[["Greedy","Array","Dynamic Programming","Sorting"],["贪心","数组","动态规划","排序"]],"3263150913":[["Tree","Dynamic Programming","Binary Tree"],["树","动态规划","二叉树"]],"3263342549":[["Hash Table","Math","Dynamic Programming","Heap (Priority Queue)"],["哈希表","数学","动态规划","堆（优先队列）"]],"3263418042":[["String"],["字符串"]],"3263594037":[["Queue","Array","Divide and Conquer","Dynamic Programming","Monotonic Queue"],["队列","数组","分治","动态规划","单调队列"]],"3267047320":[["Array","Dynamic Programming"],["数组","动态规划"]],"3268382520":[["Tree","Depth-First Search","Array","Hash Table","Binary Tree"],["树","深度优先搜索","数组","哈希表","二叉树"]],"3270667849":[["Array","Divide and Conquer","Dynamic Programming"],["数组","分治","动态规划"]],"3272610079":[["Array","Two Pointers","Matrix"],["数组","双指针","矩阵"]],"3275619185":[["Array","Math"],["数组","数学"]],"3281498525":[["Design","Heap (Priority Queue)"],["设计","堆（优先队列）"]],"3282812734":[["Stack","Math","Simulation"],["栈","数学","模拟"]],"3283031002":[["Database"],["数据库"]],"3283376524":[["Database"],["数据库"]],"32848909":[["Array","Two Pointers","String"],["数组","双指针","字符串"]],"328764621":[["String","String Matching","Hash Function","Rolling Hash"],["字符串","字符串匹配","哈希函数","滚动哈希"]],"3288770916":[["Stack","Greedy","String"],["栈","贪心","字符串"]],"3290623649":[["String"],["字符串"]],"3292003032":[["Design","Two Pointers","Data Stream","Sorting","Heap (Priority Queue)"],["设计","双指针","数据流","排序","堆（优先队列）"]],"3292459840":[["Design","Trie","Hash Table","String"],["设计","字典树","哈希表","字符串"]],"3292775470":[["Array","Dynamic Programming"],["数组","动态规划"]],"3292810974":[["Array","Hash Table","String","Sorting"],["数组","哈希表","字符串","排序"]],"3294328613":[["Bit Manipulation","Array","Hash Table","Math","Binary Search"],["位运算","数组","哈希表","数学","二分查找"]],"3298734473":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"3300902320":[["Array"],["数组"]],"3301142471":[["Array","Binary Search","Divide and Conquer","Matrix"],["数组","二分查找","分治","矩阵"]],"3302229375":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"3302467434":[["Hash Table","String","Counting","Prefix Sum"],["哈希表","字符串","计数","前缀和"]],"3302810206":[null,null],"3304159418":[["Tree","Depth-First Search","String","Binary Tree"],["树","深度优先搜索","字符串","二叉树"]],"3307683900":[["Breadth-First Search","String"],["广度优先搜索","字符串"]],"3308257979":[["Trie","Array","Hash Table","String","String Matching"],["字典树","数组","哈希表","字符串","字符串匹配"]],"330899243":[["Greedy","Array","Matrix"],["贪心","数组","矩阵"]],"3309137757":[["Array","Dynamic Programming"],["数组","动态规划"]],"3309376526":[["Bit Manipulation","Array"],["位运算","数组"]],"3312226061":[["Greedy","Array","String","Dynamic Programming"],["贪心","数组","字符串","动态规划"]],"3313294758":[["Array","Dynamic Programming"],["数组","动态规划"]],"3314430913":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"3314612233":[["Bit Manipulation","Array","Backtracking"],["位运算","数组","回溯"]],"3315363657":[["Greedy","Array","Two Pointers","Dynamic Programming"],["贪心","数组","双指针","动态规划"]],"3315441800":[["Array","Dynamic Programming"],["数组","动态规划"]],"3315472808":[["Bit Manipulation","Hash Table","String","Prefix Sum"],["位运算","哈希表","字符串","前缀和"]],"3317643285":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"3319568401":[["Database"],["数据库"]],"3320085335":[["Bit Manipulation","String","Backtracking"],["位运算","字符串","回溯"]],"3320294201":[["Stack","Design","Queue"],["栈","设计","队列"]],"3321963457":[["Geometry","Array","Math","Matrix","Sorting"],["几何","数组","数学","矩阵","排序"]],"3325416067":[["String","String Matching"],["字符串","字符串匹配"]],"3328810166":[["Math","String","Simulation"],["数学","字符串","模拟"]],"3329709268":[["Array","Sorting","Heap (Priority Queue)"],["数组","排序","堆（优先队列）"]],"3331711837":[["Breadth-First Search","Hash Table","String","Backtracking"],["广度优先搜索","哈希表","字符串","回溯"]],"3332596820":[null,null],"3334241084":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"3334808342":[["Array","Hash Table","Math","Counting","Number Theory"],["数组","哈希表","数学","计数","数论"]],"333630853":[["Tree","Depth-First Search","Breadth-First Search"],["树","深度优先搜索","广度优先搜索"]],"333667858":[["Array","Hash Table","String","Backtracking"],["数组","哈希表","字符串","回溯"]],"3336959867":[["Hash Table","String","Dynamic Programming"],["哈希表","字符串","动态规划"]],"3337273246":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"3337589064":[["Design","Queue","Monotonic Queue"],["设计","队列","单调队列"]],"3340682501":[["Database"],["数据库"]],"3340717494":[["Database"],["数据库"]],"3341470372":[["Tree","Breadth-First Search","Design","Binary Tree"],["树","广度优先搜索","设计","二叉树"]],"3343040098":[["Array","Hash Table","String","Counting","Prefix Sum"],["数组","哈希表","字符串","计数","前缀和"]],"3344221047":[["String","Dynamic Programming","Backtracking"],["字符串","动态规划","回溯"]],"3346548045":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"334656901":[["Array"],["数组"]],"3347724858":[["Array","Binary Search","Prefix Sum","Simulation"],["数组","二分查找","前缀和","模拟"]],"3348324694":[["Array","Divide and Conquer","Quickselect","Sorting","Heap (Priority Queue)"],["数组","分治","快速选择","排序","堆（优先队列）"]],"3348466517":[["Array"],["数组"]],"3348570525":[["Linked List","Two Pointers"],["链表","双指针"]],"3350592310":[["String"],["字符串"]],"3351145874":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"335140403":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"3353015937":[["Tree","Depth-First Search","Breadth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","广度优先搜索","哈希表","二叉树"]],"3354310865":[["String"],["字符串"]],"3354474202":[["Hash Table","Linked List","Two Pointers"],["哈希表","链表","双指针"]],"335486990":[["String"],["字符串"]],"3355469687":[["Bit Manipulation","Array","Sliding Window"],["位运算","数组","滑动窗口"]],"3355865266":[["Two Pointers","String"],["双指针","字符串"]],"3357587389":[["Array","Hash Table","Matrix"],["数组","哈希表","矩阵"]],"3357632986":[["Bit Manipulation","Array","Backtracking"],["位运算","数组","回溯"]],"3363218765":[["Two Pointers","String"],["双指针","字符串"]],"3363685518":[["Array","Hash Table"],["数组","哈希表"]],"3363896578":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"336413363":[["Math","Binary Search"],["数学","二分查找"]],"3364926717":[["Math"],["数学"]],"3365665787":[["Database"],["数据库"]],"3369476122":[["String","Dynamic Programming"],["字符串","动态规划"]],"3370131507":[["Array"],["数组"]],"3370261058":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"3371445858":[["Math"],["数学"]],"3372525938":[["Array","Two Pointers","Binary Search"],["数组","双指针","二分查找"]],"3374028315":[["Database"],["数据库"]],"337441895":[["Array","Binary Search","Sorting"],["数组","二分查找","排序"]],"3375593429":[["Array","Hash Table","Enumeration"],["数组","哈希表","枚举"]],"3375672025":[["Stack","Array","Simulation"],["栈","数组","模拟"]],"3376280260":[["Tree","Depth-First Search","Binary Search Tree","Dynamic Programming","Binary Tree"],["树","深度优先搜索","二叉搜索树","动态规划","二叉树"]],"3376945874":[["Stack","Design","Hash Table","Heap (Priority Queue)"],["栈","设计","哈希表","堆（优先队列）"]],"3379746851":[["Math"],["数学"]],"3379897372":[["Array","Math"],["数组","数学"]],"3381061806":[["Graph","Trie","Array","String","Dynamic Programming","Shortest Path"],["图","字典树","数组","字符串","动态规划","最短路"]],"3382549811":[["Array","Sorting"],["数组","排序"]],"3383627644":[["Stack","String"],["栈","字符串"]],"3383805178":[["Tree","Depth-First Search","Design","Hash Table"],["树","深度优先搜索","设计","哈希表"]],"3386206172":[["Array","String Matching","Hash Function","Rolling Hash"],["数组","字符串匹配","哈希函数","滚动哈希"]],"3386255965":[["Greedy","Two Pointers","String"],["贪心","双指针","字符串"]],"3386498966":[["Array","String"],["数组","字符串"]],"338661942":[["Array","Math","Dynamic Programming","Backtracking","Combinatorics","Probability and Statistics"],["数组","数学","动态规划","回溯","组合数学","概率与统计"]],"3386819075":[["Hash Table","Math","String"],["哈希表","数学","字符串"]],"3387998069":[["Array","Hash Table","Prefix Sum","Sorting"],["数组","哈希表","前缀和","排序"]],"3389539253":[["Greedy","String","Sorting"],["贪心","字符串","排序"]],"3391560370":[["Hash Table","String"],["哈希表","字符串"]],"3396007304":[["Depth-First Search","Breadth-First Search","Graph","Backtracking"],["深度优先搜索","广度优先搜索","图","回溯"]],"3397262203":[null,null],"3397964824":[["Array","Sorting"],["数组","排序"]],"3398027261":[["Array","Enumeration"],["数组","枚举"]],"3400286463":[["Array"],["数组"]],"3402568700":[["Trie","Memoization","Array","Hash Table","String","Dynamic Programming","Backtracking"],["字典树","记忆化搜索","数组","哈希表","字符串","动态规划","回溯"]],"3403473925":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"340499017":[["Array","String"],["数组","字符串"]],"3405519099":[["Database"],["数据库"]],"340770494":[["Depth-First Search","Breadth-First Search","Union Find","Graph","Sorting"],["深度优先搜索","广度优先搜索","并查集","图","排序"]],"340860484":[["Tree","Depth-First Search","Breadth-First Search","Graph"],["树","深度优先搜索","广度优先搜索","图"]],"3410974541":[["Array","String","Prefix Sum"],["数组","字符串","前缀和"]],"3411465392":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"3412927472":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"3413400617":[["Greedy","Array","Backtracking","Sorting"],["贪心","数组","回溯","排序"]],"3421555360":[["Tree","Segment Tree","Binary Search Tree","Array","Binary Search","Binary Tree","Ordered Set"],["树","线段树","二叉搜索树","数组","二分查找","二叉树","有序集合"]],"3422315602":[["Array","Dynamic Programming","Prefix Sum"],["数组","动态规划","前缀和"]],"3423908263":[["Depth-First Search","Breadth-First Search","Graph"],["深度优先搜索","广度优先搜索","图"]],"3424505272":[["Tree","Depth-First Search","Graph","Dynamic Programming"],["树","深度优先搜索","图","动态规划"]],"3427404671":[["Array","Hash Table"],["数组","哈希表"]],"3429532354":[["Array","Sorting","Heap (Priority Queue)"],["数组","排序","堆（优先队列）"]],"343052836":[["Array"],["数组"]],"3430688223":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"3430988573":[["Array","Binary Search","Suffix Array","Hash Function","Rolling Hash"],["数组","二分查找","后缀数组","哈希函数","滚动哈希"]],"3431920158":[["Depth-First Search","Graph"],["深度优先搜索","图"]],"3432459628":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"3433288749":[["Array","Math","String","Sorting"],["数组","数学","字符串","排序"]],"3433602336":[["String","Dynamic Programming"],["字符串","动态规划"]],"3434976181":[["Array","Binary Search","Prefix Sum","Sliding Window"],["数组","二分查找","前缀和","滑动窗口"]],"3435556540":[["Greedy","Array","Math"],["贪心","数组","数学"]],"3437227213":[["Array","Hash Table"],["数组","哈希表"]],"3437839264":[["Two Pointers","String","Binary Search","String Matching","Hash Function","Rolling Hash"],["双指针","字符串","二分查找","字符串匹配","哈希函数","滚动哈希"]],"3438031469":[["Database"],["数据库"]],"3439053581":[["Database"],["数据库"]],"3439295659":[null,null],"3440205245":[["String"],["字符串"]],"3441921832":[["Greedy","Array","Two Pointers","Prefix Sum","Sorting","Heap (Priority Queue)"],["贪心","数组","双指针","前缀和","排序","堆（优先队列）"]],"3444219926":[["Depth-First Search","Breadth-First Search","Array","Matrix"],["深度优先搜索","广度优先搜索","数组","矩阵"]],"344495691":[["Greedy","Hash Table","Two Pointers","String"],["贪心","哈希表","双指针","字符串"]],"3444975876":[["Bit Manipulation","Array","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","动态规划","回溯","状态压缩"]],"3445174361":[["Design","Binary Search","Ordered Set"],["设计","二分查找","有序集合"]],"3445184694":[["Math","Simulation"],["数学","模拟"]],"3445657861":[["Tree","Depth-First Search","Breadth-First Search","Design","String","Binary Tree"],["树","深度优先搜索","广度优先搜索","设计","字符串","二叉树"]],"344756565":[["Trie","Array","Hash Table","String"],["字典树","数组","哈希表","字符串"]],"344813892":[["Bit Manipulation","Math","Backtracking"],["位运算","数学","回溯"]],"3448832663":[["String","Dynamic Programming"],["字符串","动态规划"]],"345204207":[["Depth-First Search","Breadth-First Search","Array","Matrix"],["深度优先搜索","广度优先搜索","数组","矩阵"]],"3452861205":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"3454110996":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"3455944020":[["Array","Binary Search"],["数组","二分查找"]],"3456273150":[["Array","Math","Matrix"],["数组","数学","矩阵"]],"3456823213":[["Design","Trie","String","Data Stream"],["设计","字典树","字符串","数据流"]],"3457051682":[["String","Dynamic Programming"],["字符串","动态规划"]],"3458213369":[["Database"],["数据库"]],"3458248889":[["Array","Hash Table"],["数组","哈希表"]],"3460084752":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"3460806368":[["Queue","Array","Binary Search","Prefix Sum","Sliding Window","Monotonic Queue","Heap (Priority Queue)"],["队列","数组","二分查找","前缀和","滑动窗口","单调队列","堆（优先队列）"]],"3461348977":[["Hash Table","String"],["哈希表","字符串"]],"3461834167":[["Greedy","Union Find","Array","String","Dynamic Programming","Matrix"],["贪心","并查集","数组","字符串","动态规划","矩阵"]],"3462463455":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"3464418220":[["Math","String"],["数学","字符串"]],"3464701651":[["Array","Math","Number Theory","Simulation"],["数组","数学","数论","模拟"]],"3465343":[["Stack","Linked List","Math"],["栈","链表","数学"]],"3465409135":[["Math","Dynamic Programming"],["数学","动态规划"]],"3468018376":[["Array","Interactive","Simulation"],["数组","交互","模拟"]],"3468116044":[["Hash Table","Math","Dynamic Programming"],["哈希表","数学","动态规划"]],"3468213273":[["Hash Table","Math","String"],["哈希表","数学","字符串"]],"3469207858":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"3469541764":[["Array","Math"],["数组","数学"]],"3469926498":[["Math","Dynamic Programming"],["数学","动态规划"]],"3473351012":[["Tree","Depth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","哈希表","二叉树"]],"3474039417":[["Bit Manipulation","Array","Hash Table","Prefix Sum"],["位运算","数组","哈希表","前缀和"]],"3474428558":[["Tree","Breadth-First Search","Binary Tree"],["树","广度优先搜索","二叉树"]],"3475686242":[["Design","Linked List"],["设计","链表"]],"3477058065":[null,null],"3479390973":[["Hash Table","Math","String","Prefix Sum"],["哈希表","数学","字符串","前缀和"]],"3480413551":[["Bit Manipulation","Array","Backtracking"],["位运算","数组","回溯"]],"3482467445":[["Stack","Greedy","Array","Sorting","Monotonic Stack"],["栈","贪心","数组","排序","单调栈"]],"3483377785":[["Bit Manipulation","Array","Math","Dynamic Programming","Bitmask"],["位运算","数组","数学","动态规划","状态压缩"]],"3484001100":[["Math","Two Pointers","Binary Search","Interactive"],["数学","双指针","二分查找","交互"]],"3484470279":[["String","Dynamic Programming"],["字符串","动态规划"]],"348512996":[["Bit Manipulation","Math","String","Simulation"],["位运算","数学","字符串","模拟"]],"3488452469":[["Design","Segment Tree","Ordered Set"],["设计","线段树","有序集合"]],"3489386729":[["Array","Math","Dynamic Programming"],["数组","数学","动态规划"]],"3489582959":[["Database"],["数据库"]],"3489599803":[["Array","Divide and Conquer","Bucket Sort","Counting Sort","Radix Sort","Sorting","Heap (Priority Queue)","Merge Sort"],["数组","分治","桶排序","计数排序","基数排序","排序","堆（优先队列）","归并排序"]],"3491443766":[["Greedy","String"],["贪心","字符串"]],"3492185165":[["Array","Dynamic Programming"],["数组","动态规划"]],"3492742379":[["Math","Number Theory"],["数学","数论"]],"3492873499":[["Tree","Depth-First Search","Breadth-First Search","Design","Binary Search Tree","String","Binary Tree"],["树","深度优先搜索","广度优先搜索","设计","二叉搜索树","字符串","二叉树"]],"3495355750":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"349650937":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"3498345039":[["Trie","Memoization","Array","Hash Table","String","Dynamic Programming"],["字典树","记忆化搜索","数组","哈希表","字符串","动态规划"]],"3501115477":[["Array"],["数组"]],"3503134762":[["Array","Hash Table","Binary Search","Dynamic Programming","Sorting"],["数组","哈希表","二分查找","动态规划","排序"]],"3504355376":[["Array","Simulation","Heap (Priority Queue)"],["数组","模拟","堆（优先队列）"]],"3504693188":[["Greedy","Hash Table","String","Counting","Sorting"],["贪心","哈希表","字符串","计数","排序"]],"3506344616":[["Breadth-First Search","String","Backtracking"],["广度优先搜索","字符串","回溯"]],"3508427448":[["Array","Hash Table","Matrix"],["数组","哈希表","矩阵"]],"3509092584":[["Hash Table","Math"],["哈希表","数学"]],"3509327992":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"3510486381":[["Array","Hash Table","Math","Binary Search","Sorting","Randomized"],["数组","哈希表","数学","二分查找","排序","随机化"]],"3510890976":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"3513036702":[["String","Dynamic Programming"],["字符串","动态规划"]],"3514319037":[["Depth-First Search","Graph","Eulerian Circuit"],["深度优先搜索","图","欧拉回路"]],"3518502488":[["Array","Math"],["数组","数学"]],"3519471521":[["Array","Math","Combinatorics"],["数组","数学","组合数学"]],"3520046805":[["Tree","Depth-First Search","Backtracking","Binary Tree"],["树","深度优先搜索","回溯","二叉树"]],"3520875014":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"3521652117":[["Greedy","Math","String"],["贪心","数学","字符串"]],"3521871699":[["Database"],["数据库"]],"3521973284":[["Array","Matrix","Prefix Sum"],["数组","矩阵","前缀和"]],"3523871920":[["Stack","String"],["栈","字符串"]],"352505600":[["Array","Hash Table","Two Pointers","Counting","Sorting"],["数组","哈希表","双指针","计数","排序"]],"3525880478":[["Array","Hash Table","Math","Probability and Statistics"],["数组","哈希表","数学","概率与统计"]],"3527144196":[["String","Dynamic Programming"],["字符串","动态规划"]],"3527222391":[["Bit Manipulation","Breadth-First Search","Graph","Dynamic Programming","Bitmask"],["位运算","广度优先搜索","图","动态规划","状态压缩"]],"3528330030":[["Array","Matrix","Prefix Sum"],["数组","矩阵","前缀和"]],"3529094278":[["Graph"],["图"]],"3529472171":[["Array","Prefix Sum"],["数组","前缀和"]],"353053828":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"3531395010":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"3532088940":[["Graph","Two Pointers","Interactive"],["图","双指针","交互"]],"3532176892":[["Greedy","Bit Manipulation","Array"],["贪心","位运算","数组"]],"3532863467":[["Tree","Depth-First Search","Math","Dynamic Programming","Number Theory"],["树","深度优先搜索","数学","动态规划","数论"]],"3533336381":[["Database"],["数据库"]],"3534885957":[["String","Backtracking"],["字符串","回溯"]],"3535072903":[["Trie","Array","Hash Table","String"],["字典树","数组","哈希表","字符串"]],"3535624008":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"3536253643":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"3537085768":[null,null],"3537815146":[["Database"],["数据库"]],"3541832045":[["Reservoir Sampling","Hash Table","Math","Randomized"],["水塘抽样","哈希表","数学","随机化"]],"3544466917":[["Array","Dynamic Programming"],["数组","动态规划"]],"3544973036":[["Array","Binary Search","Interactive"],["数组","二分查找","交互"]],"3547308658":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"3547808888":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"3548460508":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"354880980":[["Depth-First Search","Breadth-First Search","Array","Matrix"],["深度优先搜索","广度优先搜索","数组","矩阵"]],"3548853356":[["Greedy","Array","String","Dynamic Programming"],["贪心","数组","字符串","动态规划"]],"3549637617":[["String","Dynamic Programming","String Matching"],["字符串","动态规划","字符串匹配"]],"3549688121":[["Greedy","Array","Hash Table"],["贪心","数组","哈希表"]],"3550553048":[["Array","String","Divide and Conquer","Quickselect","Sorting","Heap (Priority Queue)"],["数组","字符串","分治","快速选择","排序","堆（优先队列）"]],"3552570937":[["Array","Prefix Sum","Sliding Window"],["数组","前缀和","滑动窗口"]],"3552679614":[["Database"],["数据库"]],"3553057842":[["Array","Matrix"],["数组","矩阵"]],"3553863174":[["Database"],["数据库"]],"3554305488":[["Array","Math","Divide and Conquer"],["数组","数学","分治"]],"3554428052":[["Linked List"],["链表"]],"3554577128":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"3554657564":[["Database"],["数据库"]],"3555784215":[["Array","Dynamic Programming"],["数组","动态规划"]],"3556941422":[["Database"],["数据库"]],"3557119705":[["Array","Hash Table"],["数组","哈希表"]],"3558781406":[["String"],["字符串"]],"3559784334":[["Database"],["数据库"]],"3561342867":[["Greedy","String","Dynamic Programming"],["贪心","字符串","动态规划"]],"3562926842":[["Greedy","Array","Prefix Sum","Sliding Window"],["贪心","数组","前缀和","滑动窗口"]],"3563762803":[["Array","Dynamic Programming"],["数组","动态规划"]],"3564822043":[["Math"],["数学"]],"3565117549":[["Array","Dynamic Programming"],["数组","动态规划"]],"3565951903":[["Greedy","String","Dynamic Programming","Sliding Window"],["贪心","字符串","动态规划","滑动窗口"]],"3566296172":[["Database"],["数据库"]],"3566729670":[["Greedy","Array","Two Pointers","Binary Search","Sorting"],["贪心","数组","双指针","二分查找","排序"]],"3567189290":[["Depth-First Search","Linked List","Doubly-Linked List"],["深度优先搜索","链表","双向链表"]],"3567330607":[["String","Dynamic Programming"],["字符串","动态规划"]],"3570284045":[["Greedy","Math","Binary Search"],["贪心","数学","二分查找"]],"3570621122":[["Database"],["数据库"]],"3571222180":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"3571447692":[["Array","Binary Search","Interactive","Matrix"],["数组","二分查找","交互","矩阵"]],"3572615577":[["String"],["字符串"]],"3573276394":[["Database"],["数据库"]],"3573894690":[["Array","Hash Table","Dynamic Programming","Counting"],["数组","哈希表","动态规划","计数"]],"3574045563":[["String"],["字符串"]],"3574084572":[["Trie"],["字典树"]],"3574185695":[["Array","Counting"],["数组","计数"]],"3579143787":[["Memoization","Math","Dynamic Programming"],["记忆化搜索","数学","动态规划"]],"3580394792":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"3581728008":[["Array","Math","Dynamic Programming","Game Theory"],["数组","数学","动态规划","博弈"]],"358387829":[["Bit Manipulation","Geometry","Array","Hash Table","Math","Dynamic Programming","Backtracking","Bitmask"],["位运算","几何","数组","哈希表","数学","动态规划","回溯","状态压缩"]],"3585483303":[["Bit Manipulation","Array","Backtracking"],["位运算","数组","回溯"]],"3588035361":[["Array","Dynamic Programming","Sliding Window"],["数组","动态规划","滑动窗口"]],"3589033912":[["Design","Hash Table"],["设计","哈希表"]],"3589125798":[["Array","String"],["数组","字符串"]],"3590542886":[["Breadth-First Search","Array"],["广度优先搜索","数组"]],"3590794345":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"3593932314":[["Array","Prefix Sum"],["数组","前缀和"]],"3595421528":[["Greedy","Array","Binary Search","Dynamic Programming","Prefix Sum"],["贪心","数组","二分查找","动态规划","前缀和"]],"3596139981":[["Array","Binary Search","Dynamic Programming"],["数组","二分查找","动态规划"]],"3597054857":[["Database"],["数据库"]],"3597589308":[["String","Backtracking"],["字符串","回溯"]],"3597620749":[["Database"],["数据库"]],"359765882":[["Array","Hash Table","Dynamic Programming","Sorting"],["数组","哈希表","动态规划","排序"]],"3601789048":[["Database"],["数据库"]],"360213652":[["Math","Binary Search"],["数学","二分查找"]],"360478335":[["Math","Dynamic Programming"],["数学","动态规划"]],"3605537034":[null,null],"3605700572":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"3607071844":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"3607938850":[["Backtracking","Interactive"],["回溯","交互"]],"3607948747":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"3608105198":[["Graph","Topological Sort","Array"],["图","拓扑排序","数组"]],"3608687869":[["Array","Sorting"],["数组","排序"]],"3608956462":[["Database"],["数据库"]],"3609066875":[["Array","Binary Search"],["数组","二分查找"]],"3609197847":[["Array","String"],["数组","字符串"]],"3610450870":[["Binary Search","Interactive"],["二分查找","交互"]],"3611656717":[["String"],["字符串"]],"3612436091":[["Database"],["数据库"]],"3612858843":[["Array","String"],["数组","字符串"]],"3615735813":[["Bit Manipulation","Breadth-First Search","Array","Matrix"],["位运算","广度优先搜索","数组","矩阵"]],"3615890317":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"3615903863":[["Design","Array","Matrix"],["设计","数组","矩阵"]],"3616385781":[["String","String Matching","Hash Function","Rolling Hash"],["字符串","字符串匹配","哈希函数","滚动哈希"]],"3619173359":[["Array","Divide and Conquer","Dynamic Programming"],["数组","分治","动态规划"]],"3619796334":[["Stack","String"],["栈","字符串"]],"362145938":[["Design","Ordered Set","Heap (Priority Queue)"],["设计","有序集合","堆（优先队列）"]],"3624743731":[["Greedy","Array","Sorting","Heap (Priority Queue)"],["贪心","数组","排序","堆（优先队列）"]],"3625352354":[["Greedy","Array","Matrix"],["贪心","数组","矩阵"]],"3627963576":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"3628522165":[["Database"],["数据库"]],"3628711002":[["Dynamic Programming"],["动态规划"]],"3629682368":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"3631325739":[null,null],"3631493170":[["Greedy","String","Sorting"],["贪心","字符串","排序"]],"3632361978":[["Union Find","Array","Math","Number Theory"],["并查集","数组","数学","数论"]],"3632832155":[["Dynamic Programming"],["动态规划"]],"3633709914":[["Array","Prefix Sum"],["数组","前缀和"]],"3634042243":[["Design","Hash Table","Data Stream"],["设计","哈希表","数据流"]],"3634756972":[["Stack","Greedy","Array","Two Pointers","Sorting","Monotonic Stack"],["栈","贪心","数组","双指针","排序","单调栈"]],"3639230179":[["Math","String"],["数学","字符串"]],"3640069915":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort","Array","String"],["深度优先搜索","广度优先搜索","图","拓扑排序","数组","字符串"]],"364057867":[["Greedy","Array","Binary Search","Sorting"],["贪心","数组","二分查找","排序"]],"3643699802":[["Tree","Depth-First Search","Dynamic Programming"],["树","深度优先搜索","动态规划"]],"3647529643":[["Array","Math","Matrix","Prefix Sum","Sorting","Heap (Priority Queue)"],["数组","数学","矩阵","前缀和","排序","堆（优先队列）"]],"3647659126":[["Recursion","Linked List","Math"],["递归","链表","数学"]],"3650306921":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"3652265598":[["Database"],["数据库"]],"3654559374":[["Array","Dynamic Programming"],["数组","动态规划"]],"3654833214":[["Hash Table","String","Backtracking","Counting"],["哈希表","字符串","回溯","计数"]],"3655230005":[["Depth-First Search","Graph","Eulerian Circuit"],["深度优先搜索","图","欧拉回路"]],"3655265099":[["Greedy","Math","Backtracking"],["贪心","数学","回溯"]],"3655694361":[["Depth-First Search","Breadth-First Search","Math"],["深度优先搜索","广度优先搜索","数学"]],"3658316549":[["Bit Manipulation"],["位运算"]],"3658435518":[["Database"],["数据库"]],"3658913842":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"3663334475":[["Bit Manipulation","Array","Prefix Sum"],["位运算","数组","前缀和"]],"3666213697":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"3668290311":[["Hash Table","Math","String","Combinatorics","Counting"],["哈希表","数学","字符串","组合数学","计数"]],"3669324904":[["Union Find","Array","Hash Table","String","Backtracking"],["并查集","数组","哈希表","字符串","回溯"]],"3670047480":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"3670981421":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"3671857466":[["Greedy","Array","Hash Table","Sorting"],["贪心","数组","哈希表","排序"]],"3672640831":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"3672802568":[null,null],"3674750599":[["Depth-First Search","Breadth-First Search","Array","Matrix"],["深度优先搜索","广度优先搜索","数组","矩阵"]],"3675075625":[["Greedy","Heap (Priority Queue)"],["贪心","堆（优先队列）"]],"3676581853":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"3678361449":[["Database"],["数据库"]],"3678844870":[null,null],"3679223156":[["Stack","Recursion","Hash Table","Math","String"],["栈","递归","哈希表","数学","字符串"]],"3679518604":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"3680951455":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"3681131795":[["Bit Manipulation","Array","Math","Backtracking","Combinatorics"],["位运算","数组","数学","回溯","组合数学"]],"3681526411":[["Breadth-First Search","Graph"],["广度优先搜索","图"]],"3681668560":[["Linked List","Math"],["链表","数学"]],"3681976285":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"368544120":[null,null],"3685520053":[["Array","Binary Search"],["数组","二分查找"]],"3686317773":[["Array"],["数组"]],"369209811":[["Union Find","Graph","Array","String"],["并查集","图","数组","字符串"]],"3693635252":[["Array","Sorting"],["数组","排序"]],"3694289041":[["Array","Dynamic Programming"],["数组","动态规划"]],"3695292464":[["Array","Binary Search","Prefix Sum","Sliding Window"],["数组","二分查找","前缀和","滑动窗口"]],"3696528144":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"3696757985":[["Greedy","Math","Sorting"],["贪心","数学","排序"]],"3697179042":[["Stack","Binary Indexed Tree","Segment Tree","Array","Binary Search","Sorting","Monotonic Stack"],["栈","树状数组","线段树","数组","二分查找","排序","单调栈"]],"3698071341":[["Array","Matrix"],["数组","矩阵"]],"3698564207":[["Union Find","Graph"],["并查集","图"]],"3702844885":[["Depth-First Search","Breadth-First Search","Array","Matrix"],["深度优先搜索","广度优先搜索","数组","矩阵"]],"3704059945":[["Bit Manipulation","Array"],["位运算","数组"]],"3707233513":[["Math","Enumeration"],["数学","枚举"]],"370730607":[["Graph","Geometry","Math"],["图","几何","数学"]],"3709286362":[["Array","Sliding Window"],["数组","滑动窗口"]],"3709920516":[["Stack","Greedy","Queue","String"],["栈","贪心","队列","字符串"]],"3713605524":[["Array","Enumeration","Sorting"],["数组","枚举","排序"]],"3714339122":[["Design","Queue","Array","Iterator"],["设计","队列","数组","迭代器"]],"3722557865":[["Array","Matrix"],["数组","矩阵"]],"372608626":[["Bit Manipulation","Memoization","Dynamic Programming","Bitmask"],["位运算","记忆化搜索","动态规划","状态压缩"]],"3729546605":[["Design","Array","Hash Table","Math","Randomized"],["设计","数组","哈希表","数学","随机化"]],"3729777530":[["Array","Dynamic Programming"],["数组","动态规划"]],"3729897578":[["Greedy","Math","Dynamic Programming","Enumeration"],["贪心","数学","动态规划","枚举"]],"3730047096":[["Tree","Depth-First Search","Dynamic Programming","Sorting","Heap (Priority Queue)"],["树","深度优先搜索","动态规划","排序","堆（优先队列）"]],"3731391427":[["Array","Hash Table","String","Sorting"],["数组","哈希表","字符串","排序"]],"3732579349":[["Database"],["数据库"]],"3732893747":[["Stack","Recursion","Linked List","Two Pointers"],["栈","递归","链表","双指针"]],"3733071109":[["Stack","Tree","Depth-First Search","Binary Search Tree","Two Pointers","Binary Tree","Heap (Priority Queue)"],["栈","树","深度优先搜索","二叉搜索树","双指针","二叉树","堆（优先队列）"]],"3733738177":[null,null],"3733845637":[["Array","Binary Search","Matrix","Sorting","Heap (Priority Queue)"],["数组","二分查找","矩阵","排序","堆（优先队列）"]],"3734379548":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"3735372403":[["Greedy","Math","String"],["贪心","数学","字符串"]],"3735555259":[["Tree","Depth-First Search","Hash Table","Dynamic Programming"],["树","深度优先搜索","哈希表","动态规划"]],"3735817636":[["Array"],["数组"]],"3735818622":[["Array","String","Simulation"],["数组","字符串","模拟"]],"3736820092":[["Design","Hash Table"],["设计","哈希表"]],"3736843920":[["Greedy","Array","Two Pointers","Sorting"],["贪心","数组","双指针","排序"]],"3737350161":[["Array","Hash Table","Two Pointers","String","Sorting"],["数组","哈希表","双指针","字符串","排序"]],"3738097801":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"3738671880":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"3738902181":[["Stack","Design","Queue"],["栈","设计","队列"]],"3738917436":[["Array","String","Sorting"],["数组","字符串","排序"]],"374038880":[["Stack","Greedy","Array","Dynamic Programming","Monotonic Stack"],["栈","贪心","数组","动态规划","单调栈"]],"3740959852":[["Array","Hash Table","Math","Combinatorics"],["数组","哈希表","数学","组合数学"]],"374180471":[["Array","Math","Sorting","Heap (Priority Queue)"],["数组","数学","排序","堆（优先队列）"]],"3742724136":[["Array","Dynamic Programming"],["数组","动态规划"]],"3742810739":[["Database"],["数据库"]],"374282350":[["Recursion","Math"],["递归","数学"]],"3743671260":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"3744485747":[["Bit Manipulation","Memoization","Dynamic Programming"],["位运算","记忆化搜索","动态规划"]],"3748728257":[["Bit Manipulation","Array","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","动态规划","回溯","状态压缩"]],"3749798588":[["Array","Hash Table","Matrix"],["数组","哈希表","矩阵"]],"3750650671":[["Array","Enumeration"],["数组","枚举"]],"375088983":[["Dynamic Programming"],["动态规划"]],"3750933244":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree","Sorting"],["树","深度优先搜索","二叉搜索树","二叉树","排序"]],"3754756357":[["Stack","Linked List","Math"],["栈","链表","数学"]],"3754993583":[["Array","Hash Table","Matrix"],["数组","哈希表","矩阵"]],"3756156206":[["Greedy","Array","Hash Table","Counting"],["贪心","数组","哈希表","计数"]],"375721237":[["Tree","Depth-First Search","Dynamic Programming","Binary Tree"],["树","深度优先搜索","动态规划","二叉树"]],"3757271328":[["Tree","Breadth-First Search"],["树","广度优先搜索"]],"3757656158":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"3761575610":[["Math","String"],["数学","字符串"]],"3761670335":[["Tree","Binary Search Tree","Recursion","Binary Tree"],["树","二叉搜索树","递归","二叉树"]],"3766200583":[["Math","Number Theory"],["数学","数论"]],"376871815":[["Greedy","Math"],["贪心","数学"]],"3772256778":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"3772660335":[["Stack","Array","String"],["栈","数组","字符串"]],"3772871454":[["Array","Dynamic Programming","Matrix","Sorting"],["数组","动态规划","矩阵","排序"]],"3773526508":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"3773666854":[["Bit Manipulation","Math"],["位运算","数学"]],"3777661377":[["Database"],["数据库"]],"3778120928":[["Array","Math","Sorting"],["数组","数学","排序"]],"3778209816":[["Array","Prefix Sum"],["数组","前缀和"]],"3778856012":[["String","Prefix Sum"],["字符串","前缀和"]],"3779169819":[["Array","Hash Table","Two Pointers","Sorting"],["数组","哈希表","双指针","排序"]],"3779486178":[["Greedy","Array","Hash Table","Heap (Priority Queue)"],["贪心","数组","哈希表","堆（优先队列）"]],"3780176153":[["String","Backtracking","Enumeration"],["字符串","回溯","枚举"]],"3781646421":[["Array","Dynamic Programming","Sliding Window"],["数组","动态规划","滑动窗口"]],"3781658657":[["Greedy","Array"],["贪心","数组"]],"3782265092":[["Database"],["数据库"]],"3785395845":[["Database"],["数据库"]],"3785567301":[["Math","Number Theory","Simulation"],["数学","数论","模拟"]],"3786781582":[["Bit Manipulation","Brainteaser","Array"],["位运算","脑筋急转弯","数组"]],"3787590955":[["Greedy","Math"],["贪心","数学"]],"3789355498":[["Array","Hash Table","Enumeration","Sorting"],["数组","哈希表","枚举","排序"]],"3791950406":[["Tree","Depth-First Search","Breadth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","广度优先搜索","哈希表","二叉树"]],"3793928653":[["Memoization","Dynamic Programming","Sorting"],["记忆化搜索","动态规划","排序"]],"3794347985":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"3795047313":[["Array","Dynamic Programming","Sorting"],["数组","动态规划","排序"]],"3800630907":[["Array","String"],["数组","字符串"]],"3800747527":[["Bit Manipulation","Math"],["位运算","数学"]],"3801430886":[["String","Sliding Window","Hash Function","Rolling Hash"],["字符串","滑动窗口","哈希函数","滚动哈希"]],"3802076349":[["Bit Manipulation","Array","Hash Table","String","Enumeration"],["位运算","数组","哈希表","字符串","枚举"]],"3802833057":[["Hash Table","String","Dynamic Programming"],["哈希表","字符串","动态规划"]],"3803787289":[["Bit Manipulation","Array","Hash Table","Binary Search"],["位运算","数组","哈希表","二分查找"]],"3806017410":[["Greedy","Array","Binary Search"],["贪心","数组","二分查找"]],"3806643948":[["Depth-First Search","Breadth-First Search","Union Find","Array","Hash Table","String","Sorting"],["深度优先搜索","广度优先搜索","并查集","数组","哈希表","字符串","排序"]],"3807487459":[["Math","String","Combinatorics"],["数学","字符串","组合数学"]],"3809879849":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort"],["深度优先搜索","广度优先搜索","图","拓扑排序"]],"3812471555":[["String","Binary Search","Prefix Sum","Sliding Window"],["字符串","二分查找","前缀和","滑动窗口"]],"3813216196":[["Math","String"],["数学","字符串"]],"3813731132":[["Recursion","Array","Math","Dynamic Programming","Game Theory"],["递归","数组","数学","动态规划","博弈"]],"3813795330":[["String"],["字符串"]],"3814190795":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"3814673758":[["String"],["字符串"]],"3816685448":[["Math","String"],["数学","字符串"]],"3816847735":[["Recursion","Math"],["递归","数学"]],"3817057378":[["Tree","Dynamic Programming","Binary Tree"],["树","动态规划","二叉树"]],"3817708570":[["Bit Manipulation","Array","Math"],["位运算","数组","数学"]],"3817996291":[["Tree","Depth-First Search","Breadth-First Search","Graph","Topological Sort"],["树","深度优先搜索","广度优先搜索","图","拓扑排序"]],"3820908739":[["Queue","Array","Sliding Window","Monotonic Queue"],["队列","数组","滑动窗口","单调队列"]],"382106194":[["String","Dynamic Programming"],["字符串","动态规划"]],"3821666194":[["Array","Dynamic Programming"],["数组","动态规划"]],"3822669184":[["String","Dynamic Programming","Prefix Sum"],["字符串","动态规划","前缀和"]],"3823075784":[["Array"],["数组"]],"3823231761":[["Database"],["数据库"]],"3823656539":[["Breadth-First Search","Math","Dynamic Programming"],["广度优先搜索","数学","动态规划"]],"382558847":[["Two Pointers","String"],["双指针","字符串"]],"3825739123":[["Array","Binary Search"],["数组","二分查找"]],"3828103825":[["Database"],["数据库"]],"3828565221":[["Linked List","Two Pointers"],["链表","双指针"]],"3828674995":[["Database"],["数据库"]],"3830405744":[["String","Simulation"],["字符串","模拟"]],"3830794143":[["Array","String"],["数组","字符串"]],"3830917042":[["Bit Manipulation","Array","Backtracking","Enumeration"],["位运算","数组","回溯","枚举"]],"3832160892":[["Database"],["数据库"]],"3832931339":[["Array","Dynamic Programming","Sorting"],["数组","动态规划","排序"]],"3833541404":[["Brainteaser","Math","Game Theory"],["脑筋急转弯","数学","博弈"]],"3833659931":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"3834636412":[["Bit Manipulation","Hash Table","String","Sliding Window","Hash Function","Rolling Hash"],["位运算","哈希表","字符串","滑动窗口","哈希函数","滚动哈希"]],"3835566276":[["Math","Enumeration"],["数学","枚举"]],"3836236370":[["Depth-First Search","Graph","Topological Sort","Array"],["深度优先搜索","图","拓扑排序","数组"]],"3836670242":[["Array","String"],["数组","字符串"]],"3836897087":[null,null],"3837200173":[["Union Find","Graph","Array","Two Pointers","Sorting"],["并查集","图","数组","双指针","排序"]],"3838380426":[["Database"],["数据库"]],"3839572104":[["Array","Sliding Window"],["数组","滑动窗口"]],"3841967606":[null,null],"3843088774":[["Depth-First Search","Breadth-First Search","Union Find","Graph","Array","Shortest Path"],["深度优先搜索","广度优先搜索","并查集","图","数组","最短路"]],"3843288760":[["Bit Manipulation","Math"],["位运算","数学"]],"384406520":[["Array"],["数组"]],"3846393224":[null,null],"3849697077":[["Array"],["数组"]],"3850152805":[["Tree","Depth-First Search","Array","Dynamic Programming"],["树","深度优先搜索","数组","动态规划"]],"3850475856":[["Database"],["数据库"]],"3850567251":[["Database"],["数据库"]],"3851133364":[["Greedy","Array","Math"],["贪心","数组","数学"]],"3851205548":[["Tree","Breadth-First Search","Binary Tree","Sorting"],["树","广度优先搜索","二叉树","排序"]],"385203255":[["Graph","Memoization","Dynamic Programming"],["图","记忆化搜索","动态规划"]],"3852187784":[["Array","Math","Dynamic Programming"],["数组","数学","动态规划"]],"3854724367":[["Database"],["数据库"]],"3856718514":[["Bit Manipulation","Segment Tree","Array","Binary Search"],["位运算","线段树","数组","二分查找"]],"3859790729":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"3863149926":[null,null],"3865734981":[["Array","Hash Table","Dynamic Programming"],["数组","哈希表","动态规划"]],"3866325213":[["Tree","Binary Tree"],["树","二叉树"]],"3867293007":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"3869351459":[["Array","Backtracking"],["数组","回溯"]],"3869891296":[["Array","Two Pointers"],["数组","双指针"]],"3870173669":[["Trie","Array","String","Backtracking","Matrix"],["字典树","数组","字符串","回溯","矩阵"]],"3870941501":[["Depth-First Search","Graph","Biconnected Component"],["深度优先搜索","图","双连通分量"]],"3871311053":[["Hash Table","String"],["哈希表","字符串"]],"38742216":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"3874484865":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"3876344773":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"3876397144":[["Array","Matrix"],["数组","矩阵"]],"3877013643":[["Tree","Depth-First Search","Dynamic Programming","Binary Tree"],["树","深度优先搜索","动态规划","二叉树"]],"3877437521":[["Array","Matrix"],["数组","矩阵"]],"387774736":[["Geometry","Math"],["几何","数学"]],"3880011182":[["Array","Hash Table","Enumeration"],["数组","哈希表","枚举"]],"3880639230":[["Union Find","Graph","Array","Minimum Spanning Tree"],["并查集","图","数组","最小生成树"]],"3882420814":[["Database"],["数据库"]],"3882513191":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"3883411103":[["Hash Table","Math","Enumeration"],["哈希表","数学","枚举"]],"3883580111":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"3884874766":[["Array","Dynamic Programming"],["数组","动态规划"]],"3887653034":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"388898462":[["Array","Hash Table","Two Pointers","Binary Search","Sorting"],["数组","哈希表","双指针","二分查找","排序"]],"3889083778":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"3891355877":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"3892578893":[["Array","Math","Prefix Sum"],["数组","数学","前缀和"]],"3894678842":[["Array"],["数组"]],"3894947933":[["Depth-First Search","Breadth-First Search","Union Find","Array","Binary Search","Matrix","Heap (Priority Queue)"],["深度优先搜索","广度优先搜索","并查集","数组","二分查找","矩阵","堆（优先队列）"]],"3897579601":[["Two Pointers","String"],["双指针","字符串"]],"3898582486":[["Greedy","Array","Hash Table"],["贪心","数组","哈希表"]],"3899459924":[["Array","Simulation"],["数组","模拟"]],"3899529382":[["Graph","Dynamic Programming"],["图","动态规划"]],"389978318":[["Array","Simulation"],["数组","模拟"]],"3900992255":[["Math","Dynamic Programming","Combinatorics"],["数学","动态规划","组合数学"]],"3901843098":[["Two Pointers","String"],["双指针","字符串"]],"3903413452":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"3906386545":[["Array","Two Pointers"],["数组","双指针"]],"3907062892":[["Design","Binary Indexed Tree","Segment Tree","Binary Search"],["设计","树状数组","线段树","二分查找"]],"3907541820":[["Design","Hash Table","Ordered Set","Heap (Priority Queue)"],["设计","哈希表","有序集合","堆（优先队列）"]],"3909203570":[["Bit Manipulation","Tree","Depth-First Search","Dynamic Programming","Bitmask"],["位运算","树","深度优先搜索","动态规划","状态压缩"]],"3911303073":[["Stack","Recursion","Linked List","Monotonic Stack"],["栈","递归","链表","单调栈"]],"3911640069":[["String"],["字符串"]],"391342400":[["Math"],["数学"]],"3915832963":[["Stack","Design","Array"],["栈","设计","数组"]],"3919719734":[["Breadth-First Search","Array","Hash Table"],["广度优先搜索","数组","哈希表"]],"3920003458":[["Database"],["数据库"]],"3920580036":[["Array","Math","Sorting"],["数组","数学","排序"]],"3920701236":[["Array","Dynamic Programming"],["数组","动态规划"]],"3920920642":[["Math"],["数学"]],"3920925170":[["Array","Binary Search"],["数组","二分查找"]],"3922635563":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"3926333474":[["Tree","Depth-First Search","Breadth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","广度优先搜索","哈希表","二叉树"]],"3926884655":[["Hash Table","String"],["哈希表","字符串"]],"3927353973":[["String","Dynamic Programming","Simulation"],["字符串","动态规划","模拟"]],"3927702135":[["Array","Math","Dynamic Programming","Game Theory"],["数组","数学","动态规划","博弈"]],"3928291565":[["String","String Matching"],["字符串","字符串匹配"]],"3928470194":[["Geometry","Array","Math"],["几何","数组","数学"]],"3929135553":[["Graph","Topological Sort","Array","Dynamic Programming"],["图","拓扑排序","数组","动态规划"]],"3929440255":[["Depth-First Search","Breadth-First Search","Graph","Hash Table"],["深度优先搜索","广度优先搜索","图","哈希表"]],"3930025215":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"3931327644":[["Database"],["数据库"]],"3935523633":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"3936048230":[["Array","Hash Table","Matrix"],["数组","哈希表","矩阵"]],"3936988451":[["Graph"],["图"]],"3939185799":[["Breadth-First Search","Array","Dynamic Programming","Matrix"],["广度优先搜索","数组","动态规划","矩阵"]],"3940769236":[["Array","String"],["数组","字符串"]],"3942454002":[["Two Pointers","String"],["双指针","字符串"]],"3943793700":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"3944079582":[["Array","Dynamic Programming"],["数组","动态规划"]],"3946751496":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"3946770973":[["String","Dynamic Programming"],["字符串","动态规划"]],"3947635653":[["Array","Math","Dynamic Programming","Game Theory","Prefix Sum"],["数组","数学","动态规划","博弈","前缀和"]],"3949953471":[["Breadth-First Search","Array","Matrix","Heap (Priority Queue)"],["广度优先搜索","数组","矩阵","堆（优先队列）"]],"3951026299":[["Array","Simulation"],["数组","模拟"]],"3953077425":[["Array","Dynamic Programming"],["数组","动态规划"]],"3953245616":[["Array","Sliding Window"],["数组","滑动窗口"]],"3953865894":[["Array","Dynamic Programming"],["数组","动态规划"]],"3956966956":[["Tree","Depth-First Search","Breadth-First Search","Linked List","Binary Tree"],["树","深度优先搜索","广度优先搜索","链表","二叉树"]],"3957965518":[["Breadth-First Search","Array","Matrix","Sorting","Heap (Priority Queue)"],["广度优先搜索","数组","矩阵","排序","堆（优先队列）"]],"3960620247":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"3960804215":[["Array","Binary Search","Dynamic Programming"],["数组","二分查找","动态规划"]],"3965012096":[["Array","Sorting"],["数组","排序"]],"3965390038":[["Breadth-First Search","Array","Dynamic Programming"],["广度优先搜索","数组","动态规划"]],"3966752648":[["Array","Backtracking"],["数组","回溯"]],"3967032436":[["Design","Simulation"],["设计","模拟"]],"3968538235":[["Bit Manipulation","String","Dynamic Programming","Backtracking","Bitmask"],["位运算","字符串","动态规划","回溯","状态压缩"]],"3969212159":[["Array","Math","Prefix Sum","Sorting"],["数组","数学","前缀和","排序"]],"3970030339":[["Database"],["数据库"]],"3971252642":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"3971324453":[["Math"],["数学"]],"397181519":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"3972794115":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"3973047784":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"3973609032":[["Memoization","Dynamic Programming"],["记忆化搜索","动态规划"]],"3974822873":[["Array","Dynamic Programming","Sliding Window"],["数组","动态规划","滑动窗口"]],"3975010681":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"3975371411":[["Array","Hash Table","String","Ordered Set","Sorting"],["数组","哈希表","字符串","有序集合","排序"]],"3977989551":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"3978062866":[["Array","Divide and Conquer","Quickselect","Sorting","Heap (Priority Queue)"],["数组","分治","快速选择","排序","堆（优先队列）"]],"3978152897":[["Array","Hash Table","Simulation"],["数组","哈希表","模拟"]],"3978864326":[["Array","Hash Table","Two Pointers","Sorting"],["数组","哈希表","双指针","排序"]],"3979947991":[["Array","Math","Dynamic Programming","Game Theory"],["数组","数学","动态规划","博弈"]],"3980691002":[["Bit Manipulation","Array"],["位运算","数组"]],"3981013694":[["Array","String","Divide and Conquer","Quickselect","Radix Sort","Sorting","Heap (Priority Queue)"],["数组","字符串","分治","快速选择","基数排序","排序","堆（优先队列）"]],"3981067264":[["Tree","Hash Table","Two Pointers","Binary Tree"],["树","哈希表","双指针","二叉树"]],"3982094929":[["Hash Table","String","Sorting"],["哈希表","字符串","排序"]],"3982480412":[["Tree","Depth-First Search","Breadth-First Search"],["树","深度优先搜索","广度优先搜索"]],"3982790200":[["Tree","Depth-First Search","String","Binary Tree"],["树","深度优先搜索","字符串","二叉树"]],"3983488064":[["Design","Queue","Data Stream"],["设计","队列","数据流"]],"3984829072":[["Bit Manipulation","Union Find","Array","Heap (Priority Queue)"],["位运算","并查集","数组","堆（优先队列）"]],"3985296975":[["Database"],["数据库"]],"3985685306":[["Tree","Depth-First Search","Breadth-First Search","Design","String","Binary Tree"],["树","深度优先搜索","广度优先搜索","设计","字符串","二叉树"]],"3985813844":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"3987516998":[["Breadth-First Search","String","Backtracking"],["广度优先搜索","字符串","回溯"]],"3988446663":[["String"],["字符串"]],"3989118459":[["Array"],["数组"]],"3989268391":[["Array","Math"],["数组","数学"]],"3989735780":[["Array","Dynamic Programming","Sliding Window"],["数组","动态规划","滑动窗口"]],"399050701":[["Array","Simulation"],["数组","模拟"]],"3990558875":[["Greedy","Array"],["贪心","数组"]],"3990570012":[null,null],"3992139324":[["String","Dynamic Programming"],["字符串","动态规划"]],"3992943267":[["Linked List","Two Pointers","Sorting"],["链表","双指针","排序"]],"3993074949":[["Math","Two Pointers","Binary Search"],["数学","双指针","二分查找"]],"3993583568":[["String","Dynamic Programming"],["字符串","动态规划"]],"3993903432":[null,null],"3994274623":[["Stack","Tree","Depth-First Search","Binary Tree"],["栈","树","深度优先搜索","二叉树"]],"3996294633":[["Tree","Depth-First Search","Dynamic Programming","Binary Tree"],["树","深度优先搜索","动态规划","二叉树"]],"3996759401":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"3999582587":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"4000844273":[["Array","Dynamic Programming"],["数组","动态规划"]],"4003153896":[["Database"],["数据库"]],"4004277283":[["Array"],["数组"]],"4006089601":[["Geometry","Array","Math"],["几何","数组","数学"]],"4006408746":[["Stack","String","Simulation"],["栈","字符串","模拟"]],"4006941957":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"4007529944":[["Greedy","Design","Array"],["贪心","设计","数组"]],"4008128316":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"4009778807":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"4010638251":[["Queue","Array","Dynamic Programming","Monotonic Queue","Heap (Priority Queue)"],["队列","数组","动态规划","单调队列","堆（优先队列）"]],"4011399863":[["Greedy","Array"],["贪心","数组"]],"4013191058":[["Database"],["数据库"]],"4014680480":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"4014976365":[["Math","String","Dynamic Programming"],["数学","字符串","动态规划"]],"401508981":[["Array","Two Pointers","Dynamic Programming","Enumeration"],["数组","双指针","动态规划","枚举"]],"4016027208":[["Math"],["数学"]],"4016866328":[["Graph","Design","Topological Sort","Array","Matrix"],["图","设计","拓扑排序","数组","矩阵"]],"4017385406":[["Math","Enumeration"],["数学","枚举"]],"4018527734":[["Tree","Depth-First Search","Binary Tree","String Matching","Hash Function"],["树","深度优先搜索","二叉树","字符串匹配","哈希函数"]],"4020009242":[["Design","Binary Indexed Tree","Segment Tree","Array"],["设计","树状数组","线段树","数组"]],"4021161204":[["Math","Binary Search","Number Theory"],["数学","二分查找","数论"]],"4021657799":[["Database"],["数据库"]],"4022402413":[["Array","Hash Table","String","Sorting"],["数组","哈希表","字符串","排序"]],"4022600098":[["Array","Dynamic Programming"],["数组","动态规划"]],"4023565195":[["Dynamic Programming","Prefix Sum"],["动态规划","前缀和"]],"4024970253":[["Linked List"],["链表"]],"4026628199":[["Bit Manipulation","Breadth-First Search","Array","Dynamic Programming","Bitmask","Matrix"],["位运算","广度优先搜索","数组","动态规划","状态压缩","矩阵"]],"4026864126":[["Math","Simulation"],["数学","模拟"]],"4027356240":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"4028967949":[["Linked List","Two Pointers"],["链表","双指针"]],"4029466921":[["Array","Math"],["数组","数学"]],"4029500097":[["Math","Dynamic Programming","Probability and Statistics"],["数学","动态规划","概率与统计"]],"4032339630":[["Array","Math","Randomized"],["数组","数学","随机化"]],"4032343955":[["Bit Manipulation","String"],["位运算","字符串"]],"4032901400":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"4033162779":[["Greedy","Array","Math","Binary Search","Sorting","Heap (Priority Queue)"],["贪心","数组","数学","二分查找","排序","堆（优先队列）"]],"4034022024":[["Union Find","Array","Sorting"],["并查集","数组","排序"]],"4034818195":[["Array","Hash Table","Divide and Conquer","Counting","Sorting"],["数组","哈希表","分治","计数","排序"]],"4034922554":[["String"],["字符串"]],"403672441":[["Stack","Array","Simulation"],["栈","数组","模拟"]],"4039038151":[["Concurrency"],["多线程"]],"4040819108":[["Breadth-First Search","Graph","Array"],["广度优先搜索","图","数组"]],"4043172905":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"4043400932":[["Math"],["数学"]],"4043601244":[["Array","Sorting"],["数组","排序"]],"4043627107":[["Database"],["数据库"]],"4044555832":[null,null],"4047033765":[["Hash Table","Math","Two Pointers"],["哈希表","数学","双指针"]],"4047865463":[["Depth-First Search","Trie"],["深度优先搜索","字典树"]],"4048578172":[["Greedy","Two Pointers","String"],["贪心","双指针","字符串"]],"4049556872":[["Math"],["数学"]],"4050014828":[["Breadth-First Search","Graph","Array","Matrix","Shortest Path","Heap (Priority Queue)"],["广度优先搜索","图","数组","矩阵","最短路","堆（优先队列）"]],"4050705931":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"4053796951":[["Design","Binary Indexed Tree","Segment Tree","Array","Binary Search"],["设计","树状数组","线段树","数组","二分查找"]],"4054714568":[["String","Dynamic Programming"],["字符串","动态规划"]],"4057490526":[["Greedy","Array"],["贪心","数组"]],"4057878205":[["Depth-First Search","Trie","Array","String"],["深度优先搜索","字典树","数组","字符串"]],"4058134239":[["Array","Hash Table","Simulation"],["数组","哈希表","模拟"]],"4058653877":[["Depth-First Search","Breadth-First Search","Graph","Array","Matrix","Shortest Path","Heap (Priority Queue)"],["深度优先搜索","广度优先搜索","图","数组","矩阵","最短路","堆（优先队列）"]],"4061458273":[["Array","Dynamic Programming"],["数组","动态规划"]],"40615146":[["Array","Binary Search","Interactive"],["数组","二分查找","交互"]],"4061782818":[null,null],"4062228386":[["Array","Hash Table","Sorting"],["数组","哈希表","排序"]],"4062961912":[["Breadth-First Search","Union Find","Array","Two Pointers","Matrix","Sorting","Heap (Priority Queue)"],["广度优先搜索","并查集","数组","双指针","矩阵","排序","堆（优先队列）"]],"4063277289":[["Array","Backtracking","Matrix"],["数组","回溯","矩阵"]],"4063900283":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"4064007490":[["String","Sliding Window"],["字符串","滑动窗口"]],"4064149855":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"4065089853":[["Array","Simulation"],["数组","模拟"]],"4066429992":[["Hash Table","String","Dynamic Programming","Backtracking"],["哈希表","字符串","动态规划","回溯"]],"4067072856":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"4067624536":[["Array","Backtracking"],["数组","回溯"]],"4070705042":[["Tree","Depth-First Search","Breadth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","广度优先搜索","哈希表","二叉树"]],"4070899391":[["Design","Queue","Array","Hash Table","Data Stream"],["设计","队列","数组","哈希表","数据流"]],"4071175900":[["Array","Two Pointers","Binary Search"],["数组","双指针","二分查找"]],"4072567494":[null,null],"4075036261":[["Design","Binary Indexed Tree","Segment Tree","Array","Matrix"],["设计","树状数组","线段树","数组","矩阵"]],"4077161289":[["Array","Simulation"],["数组","模拟"]],"4078406602":[["Array","Backtracking"],["数组","回溯"]],"4078794209":[["Array","Sorting"],["数组","排序"]],"4079777150":[["Array","Counting"],["数组","计数"]],"4082307471":[["Array","Binary Search"],["数组","二分查找"]],"4083216410":[["Greedy","Brainteaser","Math"],["贪心","脑筋急转弯","数学"]],"4085072471":[["Array","Dynamic Programming"],["数组","动态规划"]],"4085658464":[["Database"],["数据库"]],"4086617748":[["Geometry","Math"],["几何","数学"]],"4088708677":[["Tree","Depth-First Search","Breadth-First Search","Array","Hash Table","Binary Tree"],["树","深度优先搜索","广度优先搜索","数组","哈希表","二叉树"]],"4089321877":[["Design","Trie","Array","Hash Table","String"],["设计","字典树","数组","哈希表","字符串"]],"4089962714":[["Database"],["数据库"]],"4091113757":[["Database"],["数据库"]],"4091816277":[["Linked List","Two Pointers"],["链表","双指针"]],"4092227797":[["Tree","Depth-First Search","Breadth-First Search","Union Find","Graph","Array","Hash Table"],["树","深度优先搜索","广度优先搜索","并查集","图","数组","哈希表"]],"4093059486":[["Hash Table","String"],["哈希表","字符串"]],"4094576814":[null,null],"4095621901":[["String","Enumeration"],["字符串","枚举"]],"4096713010":[["Bit Manipulation","Breadth-First Search","Array","Matrix"],["位运算","广度优先搜索","数组","矩阵"]],"409977826":[["Database"],["数据库"]],"410013415":[["Database"],["数据库"]],"4100936853":[["Array","Binary Search"],["数组","二分查找"]],"4101129191":[["Depth-First Search","Breadth-First Search","Array","Matrix","Simulation"],["深度优先搜索","广度优先搜索","数组","矩阵","模拟"]],"4102134032":[["Depth-First Search","Breadth-First Search","Union Find","Graph","Array","Shortest Path"],["深度优先搜索","广度优先搜索","并查集","图","数组","最短路"]],"4103794198":[["Math","String"],["数学","字符串"]],"4107503015":[["Depth-First Search","Breadth-First Search","Array","Matrix"],["深度优先搜索","广度优先搜索","数组","矩阵"]],"4107668533":[["Database"],["数据库"]],"4108118731":[["Array","Prefix Sum"],["数组","前缀和"]],"4109762990":[["Stack","Greedy","Array","Sorting","Monotonic Stack"],["栈","贪心","数组","排序","单调栈"]],"4110942485":[["Math","Binary Search"],["数学","二分查找"]],"4112278141":[["Tree","Depth-First Search","Breadth-First Search","Hash Table"],["树","深度优先搜索","广度优先搜索","哈希表"]],"4113058721":[["Array"],["数组"]],"4115375242":[["Database"],["数据库"]],"4116532905":[["Tree","Depth-First Search","Breadth-First Search","Array","Binary Tree"],["树","深度优先搜索","广度优先搜索","数组","二叉树"]],"4119329122":[["Tree","Depth-First Search","Backtracking","Binary Tree"],["树","深度优先搜索","回溯","二叉树"]],"4119724272":[["Database"],["数据库"]],"4121584967":[["Array","Hash Table","String","Sorting"],["数组","哈希表","字符串","排序"]],"412283228":[["Database"],["数据库"]],"4123515556":[["Stack","Tree","Binary Search Tree","Array","Binary Tree","Monotonic Stack"],["栈","树","二叉搜索树","数组","二叉树","单调栈"]],"4123534788":[["Stack","Design","Hash Table","Ordered Set"],["栈","设计","哈希表","有序集合"]],"4124154827":[["Array","Hash Table","Simulation"],["数组","哈希表","模拟"]],"412491371":[["Database"],["数据库"]],"4125612782":[["String"],["字符串"]],"4125791633":[["Stack","Tree","Depth-First Search"],["栈","树","深度优先搜索"]],"41269413":[["Math"],["数学"]],"4127526700":[["Array","Two Pointers","Binary Search"],["数组","双指针","二分查找"]],"4128050064":[["Database"],["数据库"]],"4129112562":[["Linked List","Divide and Conquer","Heap (Priority Queue)","Merge Sort"],["链表","分治","堆（优先队列）","归并排序"]],"4130335825":[["Array","Dynamic Programming","Backtracking"],["数组","动态规划","回溯"]],"4130908576":[["Geometry","Array","Math"],["几何","数组","数学"]],"4130986647":[["Array","Enumeration"],["数组","枚举"]],"4131453232":[["Array"],["数组"]],"4133950075":[["Bit Manipulation"],["位运算"]],"4134643071":[["String","Dynamic Programming"],["字符串","动态规划"]],"4136320759":[["Stack","Design","Hash Table","Ordered Set"],["栈","设计","哈希表","有序集合"]],"4136678159":[["String","Dynamic Programming"],["字符串","动态规划"]],"4137220667":[["Math","Combinatorics","Enumeration"],["数学","组合数学","枚举"]],"4137779509":[["Database"],["数据库"]],"4138934238":[["Tree","Depth-First Search","String","Binary Tree"],["树","深度优先搜索","字符串","二叉树"]],"4138934893":[["String","Backtracking"],["字符串","回溯"]],"4139130918":[["Database"],["数据库"]],"4140185340":[["Stack","Recursion","Hash Table","String"],["栈","递归","哈希表","字符串"]],"4141047313":[["Greedy","Array"],["贪心","数组"]],"4143209261":[["Database"],["数据库"]],"4144023748":[["Tree","Recursion","Memoization","Dynamic Programming","Binary Tree"],["树","递归","记忆化搜索","动态规划","二叉树"]],"4144252835":[["Bit Manipulation","Dynamic Programming"],["位运算","动态规划"]],"4144328959":[["Union Find","Graph","Topological Sort","Array","Matrix","Sorting"],["并查集","图","拓扑排序","数组","矩阵","排序"]],"4145221029":[["Memoization","Array","Dynamic Programming"],["记忆化搜索","数组","动态规划"]],"4147523762":[["Array"],["数组"]],"4149053090":[["Bit Manipulation"],["位运算"]],"4149493404":[["Depth-First Search","Breadth-First Search","Array","Matrix"],["深度优先搜索","广度优先搜索","数组","矩阵"]],"4149654629":[["Database"],["数据库"]],"4151024020":[["Array","Simulation"],["数组","模拟"]],"4154176354":[["Tree","Binary Search Tree","Array","Divide and Conquer","Binary Tree"],["树","二叉搜索树","数组","分治","二叉树"]],"4154206580":[["Trie","String","Suffix Array","Hash Function","Rolling Hash"],["字典树","字符串","后缀数组","哈希函数","滚动哈希"]],"4154336589":[["Breadth-First Search","String"],["广度优先搜索","字符串"]],"4155641815":[["Greedy","Array"],["贪心","数组"]],"4156461194":[["String"],["字符串"]],"4156611370":[["Math","Dynamic Programming"],["数学","动态规划"]],"4156886477":[["String"],["字符串"]],"4159210402":[["Array","Math","Dynamic Programming"],["数组","数学","动态规划"]],"4160094583":[["Math","Dynamic Programming"],["数学","动态规划"]],"4162693857":[["Greedy","Math"],["贪心","数学"]],"4162714270":[["Array","Math","Number Theory"],["数组","数学","数论"]],"4164128971":[["Trie","Array","Hash Table","String","Dynamic Programming","Hash Function","Rolling Hash"],["字典树","数组","哈希表","字符串","动态规划","哈希函数","滚动哈希"]],"4164491486":[["Array","Hash Table","Dynamic Programming"],["数组","哈希表","动态规划"]],"4165482981":[["Recursion","Array","String"],["递归","数组","字符串"]],"416702467":[["Greedy","Array","Two Pointers"],["贪心","数组","双指针"]],"4169811109":[["Depth-First Search","Breadth-First Search","Union Find","Array","Counting","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","计数","矩阵"]],"4169935304":[["Array","Enumeration"],["数组","枚举"]],"4172058127":[["Tree","Breadth-First Search","Binary Tree"],["树","广度优先搜索","二叉树"]],"4175159080":[["Array","Binary Search"],["数组","二分查找"]],"4175827470":[["Hash Table","String"],["哈希表","字符串"]],"4176664483":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"4177070630":[["Depth-First Search","Trie","Array","String","Dynamic Programming"],["深度优先搜索","字典树","数组","字符串","动态规划"]],"4180257761":[["Dynamic Programming"],["动态规划"]],"4182324049":[["Greedy","Array","Dynamic Programming","Heap (Priority Queue)"],["贪心","数组","动态规划","堆（优先队列）"]],"4183393481":[["Graph"],["图"]],"4183600583":[["Array","Backtracking"],["数组","回溯"]],"4185588652":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"4185904896":[["Array","Math","Number Theory"],["数组","数学","数论"]],"4187483922":[["Greedy","Array","Dynamic Programming","Heap (Priority Queue)"],["贪心","数组","动态规划","堆（优先队列）"]],"4187877981":[["Design","Array","Hash Table","Binary Search"],["设计","数组","哈希表","二分查找"]],"419099305":[["Greedy","Array","Math","Binary Search"],["贪心","数组","数学","二分查找"]],"4191223408":[["Array","Hash Table","String","Sorting"],["数组","哈希表","字符串","排序"]],"4191841426":[["Database"],["数据库"]],"41924590":[["Stack","Tree","Depth-First Search","Binary Tree"],["栈","树","深度优先搜索","二叉树"]],"419265170":[["Array","Backtracking"],["数组","回溯"]],"4193156158":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"4193309664":[["String","Dynamic Programming","Sliding Window"],["字符串","动态规划","滑动窗口"]],"4193739814":[["Array","Hash Table","Binary Search","Dynamic Programming"],["数组","哈希表","二分查找","动态规划"]],"4195485236":[["Array","Prefix Sum"],["数组","前缀和"]],"4195627843":[["Stack","Tree","Design","Binary Search Tree","Binary Tree","Iterator"],["栈","树","设计","二叉搜索树","二叉树","迭代器"]],"4196448349":[["Math","String","Backtracking"],["数学","字符串","回溯"]],"4197747162":[["Math","Dynamic Programming"],["数学","动态规划"]],"419814877":[["Array","Binary Search"],["数组","二分查找"]],"4199077770":[["Array","Dynamic Programming"],["数组","动态规划"]],"4200358078":[["Stack","Greedy","String","Monotonic Stack"],["栈","贪心","字符串","单调栈"]],"4201921653":[["Geometry","Math","Randomized"],["几何","数学","随机化"]],"4207897118":[["Array","Interactive"],["数组","交互"]],"4210364548":[["Greedy","String"],["贪心","字符串"]],"4211026934":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"4211993018":[["Tree","Depth-First Search","Breadth-First Search","Array"],["树","深度优先搜索","广度优先搜索","数组"]],"4212893423":[["Array"],["数组"]],"421470137":[["Design","Hash Table","Linked List","Doubly-Linked List"],["设计","哈希表","链表","双向链表"]],"4216066459":[["Array","Dynamic Programming"],["数组","动态规划"]],"4216471965":[["Array","Hash Table","String","Sorting"],["数组","哈希表","字符串","排序"]],"4216644948":[["Bit Manipulation","Memoization","Array","Dynamic Programming","Backtracking","Bitmask"],["位运算","记忆化搜索","数组","动态规划","回溯","状态压缩"]],"4216972810":[["String","Dynamic Programming"],["字符串","动态规划"]],"421748448":[["Concurrency"],["多线程"]],"4220955865":[["Database"],["数据库"]],"4221466593":[["Trie","Array","Hash Table","String","Binary Search","Dynamic Programming","Sorting"],["字典树","数组","哈希表","字符串","二分查找","动态规划","排序"]],"4222214139":[null,null],"4224776178":[null,null],"4224854568":[["Array","Hash Table","Binary Search","Dynamic Programming","Sorting"],["数组","哈希表","二分查找","动态规划","排序"]],"4225343365":[["Array","Binary Search","Dynamic Programming","Sorting"],["数组","二分查找","动态规划","排序"]],"4225876243":[["Linked List","Math","Number Theory"],["链表","数学","数论"]],"4226664142":[["Array","Dynamic Programming"],["数组","动态规划"]],"4227366527":[["String"],["字符串"]],"4231095696":[["Array","Enumeration","Matrix"],["数组","枚举","矩阵"]],"4231261281":[["Database"],["数据库"]],"4231944752":[null,null],"4233152869":[["String"],["字符串"]],"4234423090":[["Array","Hash Table","String","Counting"],["数组","哈希表","字符串","计数"]],"4235563666":[["Array","Math","Simulation"],["数组","数学","模拟"]],"4238067501":[["Array","String","Simulation"],["数组","字符串","模拟"]],"4238290979":[["Array","Simulation"],["数组","模拟"]],"4238478834":[["Queue","Array","Simulation"],["队列","数组","模拟"]],"4239392469":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"4239622058":[["Stack","Math","String","Dynamic Programming"],["栈","数学","字符串","动态规划"]],"4242473859":[["Stack","String"],["栈","字符串"]],"4243902659":[["Math"],["数学"]],"4244339093":[["Hash Table","String","Prefix Sum"],["哈希表","字符串","前缀和"]],"4245137983":[["Dynamic Programming"],["动态规划"]],"4247310156":[["Graph","Shortest Path","Heap (Priority Queue)"],["图","最短路","堆（优先队列）"]],"424787144":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"4248915112":[["Array","Dynamic Programming"],["数组","动态规划"]],"425057592":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"4252078571":[["Array","Math","Enumeration","Game Theory"],["数组","数学","枚举","博弈"]],"4252220750":[["Greedy","Recursion","Math"],["贪心","递归","数学"]],"4253187558":[["Array","Sorting"],["数组","排序"]],"4255960109":[["Stack","Tree","Design","Binary Search Tree","Binary Tree","Iterator"],["栈","树","设计","二叉搜索树","二叉树","迭代器"]],"4256716489":[["Geometry","Array","Math","Matrix"],["几何","数组","数学","矩阵"]],"4257560677":[["String","Binary Search"],["字符串","二分查找"]],"4259911866":[["Bit Manipulation","Array","String","Backtracking"],["位运算","数组","字符串","回溯"]],"4261327361":[["Greedy","Math"],["贪心","数学"]],"4262011852":[null,null],"4265155310":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"4268196111":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"4272085250":[["Tree","Depth-First Search","Union Find","Dynamic Programming"],["树","深度优先搜索","并查集","动态规划"]],"4274227295":[["Database"],["数据库"]],"4274312628":[["Bit Manipulation","Recursion","Math"],["位运算","递归","数学"]],"4275078512":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"4275612953":[["Greedy","Binary Indexed Tree","Two Pointers","String"],["贪心","树状数组","双指针","字符串"]],"4276174201":[["Array","String","Dynamic Programming"],["数组","字符串","动态规划"]],"4276936370":[["Stack","Array","Math"],["栈","数组","数学"]],"4277286146":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"4278260851":[["Database"],["数据库"]],"4278588630":[["Database"],["数据库"]],"4278798036":[["Dynamic Programming"],["动态规划"]],"4279348799":[["Array","Dynamic Programming","Backtracking"],["数组","动态规划","回溯"]],"4279603804":[["Design","Array","Matrix","Prefix Sum"],["设计","数组","矩阵","前缀和"]],"4281929868":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"4283669919":[["Math","Simulation"],["数学","模拟"]],"4285617748":[["Greedy","Queue","String"],["贪心","队列","字符串"]],"428851356":[["Array","Math"],["数组","数学"]],"4289106415":[["Geometry","Array","Math","Divide and Conquer","Quickselect","Sorting","Heap (Priority Queue)"],["几何","数组","数学","分治","快速选择","排序","堆（优先队列）"]],"4290150798":[["Array","Matrix","Prefix Sum"],["数组","矩阵","前缀和"]],"4290496515":[["Dynamic Programming"],["动态规划"]],"4291977235":[["Concurrency"],["多线程"]],"4292187435":[null,null],"4293465808":[["Linked List","Sorting"],["链表","排序"]],"4293743842":[["Array","Sliding Window"],["数组","滑动窗口"]],"4294197536":[["Math","Simulation"],["数学","模拟"]],"430788454":[["Greedy","Array","Math","Sorting"],["贪心","数组","数学","排序"]],"432952089":[["Brainteaser","Math","Dynamic Programming","Probability and Statistics"],["脑筋急转弯","数学","动态规划","概率与统计"]],"435507573":[["Array","Prefix Sum"],["数组","前缀和"]],"435938591":[["Stack","Array","Sorting","Simulation"],["栈","数组","排序","模拟"]],"436025572":[["Array","String"],["数组","字符串"]],"438417277":[["Greedy","String"],["贪心","字符串"]],"439231056":[["Array"],["数组"]],"440012417":[["Recursion","Linked List"],["递归","链表"]],"440206256":[["String","Sorting"],["字符串","排序"]],"440656680":[["Memoization","Math","Dynamic Programming","Backtracking","Game Theory"],["记忆化搜索","数学","动态规划","回溯","博弈"]],"441435962":[["Bit Manipulation","Brainteaser","Array","Math","Dynamic Programming","Game Theory"],["位运算","脑筋急转弯","数组","数学","动态规划","博弈"]],"442815761":[["Geometry","Array","Math","Enumeration","Sorting"],["几何","数组","数学","枚举","排序"]],"443405892":[["Array","Heap (Priority Queue)"],["数组","堆（优先队列）"]],"444602377":[["Math","String"],["数学","字符串"]],"444680013":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"445102839":[["Array","Binary Search","Ordered Set","Sorting"],["数组","二分查找","有序集合","排序"]],"445458274":[["Array","Prefix Sum"],["数组","前缀和"]],"446314776":[["Geometry","Array","Math"],["几何","数组","数学"]],"44691758":[["Geometry","Array","Hash Table","Math"],["几何","数组","哈希表","数学"]],"446968474":[["Queue","Array","Sliding Window","Monotonic Queue","Heap (Priority Queue)"],["队列","数组","滑动窗口","单调队列","堆（优先队列）"]],"447209244":[["Array","Dynamic Programming","Backtracking","Matrix"],["数组","动态规划","回溯","矩阵"]],"448999750":[["Bit Manipulation","Array","Math","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","数学","动态规划","回溯","状态压缩"]],"449754376":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"449776562":[["Array","String"],["数组","字符串"]],"454305182":[["Array","Divide and Conquer","Dynamic Programming"],["数组","分治","动态规划"]],"456952191":[["Design","Math"],["设计","数学"]],"457675593":[["String","Backtracking"],["字符串","回溯"]],"457953007":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"458335295":[["Design","Array","Hash Table","String","Sorting"],["设计","数组","哈希表","字符串","排序"]],"459732998":[["Depth-First Search","Graph","Eulerian Circuit"],["深度优先搜索","图","欧拉回路"]],"461728477":[["Trie","Array","Hash Table","String","String Matching","Sliding Window"],["字典树","数组","哈希表","字符串","字符串匹配","滑动窗口"]],"462078559":[["Database"],["数据库"]],"462875391":[["Greedy","Array","Hash Table","Sorting","Heap (Priority Queue)"],["贪心","数组","哈希表","排序","堆（优先队列）"]],"463765609":[["Greedy","String","Dynamic Programming"],["贪心","字符串","动态规划"]],"465632644":[["Database"],["数据库"]],"466340061":[["String","Backtracking"],["字符串","回溯"]],"468110":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"468127487":[["Database"],["数据库"]],"469490796":[["String","Dynamic Programming","Prefix Sum"],["字符串","动态规划","前缀和"]],"469801892":[["Array","Binary Search"],["数组","二分查找"]],"47105522":[["Stack","Tree","Binary Search Tree","Recursion","Array","Binary Tree","Monotonic Stack"],["栈","树","二叉搜索树","递归","数组","二叉树","单调栈"]],"472415307":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"474089455":[["Array","Binary Search","Matrix"],["数组","二分查找","矩阵"]],"474791918":[["Array","Divide and Conquer","Interactive"],["数组","分治","交互"]],"475209872":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"475633354":[["Stack","Array","Binary Search","Ordered Set","Monotonic Stack"],["栈","数组","二分查找","有序集合","单调栈"]],"476179926":[["Stack","Array","Two Pointers","Dynamic Programming","Monotonic Stack"],["栈","数组","双指针","动态规划","单调栈"]],"478874060":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"479546084":[["Array","Counting Sort","Sorting"],["数组","计数排序","排序"]],"480223586":[["String","Prefix Sum"],["字符串","前缀和"]],"48057996":[["Bit Manipulation","Hash Table","String","Sorting"],["位运算","哈希表","字符串","排序"]],"482181283":[["Database"],["数据库"]],"482822055":[["Array","Ordered Set","Prefix Sum"],["数组","有序集合","前缀和"]],"483561018":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"484484283":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"484559816":[["Stack","Tree","Depth-First Search"],["栈","树","深度优先搜索"]],"485006616":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"485245401":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"485705274":[["Stack","Array","Sorting","Monotonic Stack"],["栈","数组","排序","单调栈"]],"486718067":[["Bit Manipulation","Trie","Array","Hash Table","Sliding Window"],["位运算","字典树","数组","哈希表","滑动窗口"]],"487061983":[["Array","Binary Search","Matrix"],["数组","二分查找","矩阵"]],"487663609":[["Graph","Dynamic Programming","Shortest Path"],["图","动态规划","最短路"]],"487789523":[["Greedy","Array"],["贪心","数组"]],"488117229":[["Array","Sorting"],["数组","排序"]],"491083091":[["Array","Dynamic Programming"],["数组","动态规划"]],"491601529":[["Math","Binary Search"],["数学","二分查找"]],"492673087":[["Greedy","Math","String","Enumeration"],["贪心","数学","字符串","枚举"]],"492684269":[["Dynamic Programming"],["动态规划"]],"492772626":[["Bit Manipulation","Array","Bitmask"],["位运算","数组","状态压缩"]],"49337297":[["Database"],["数据库"]],"495901528":[["Stack","Greedy","String"],["栈","贪心","字符串"]],"496677914":[["Graph","Array","Matrix"],["图","数组","矩阵"]],"497323702":[["Hash Table","Math","String","Number Theory","Prefix Sum"],["哈希表","数学","字符串","数论","前缀和"]],"498806458":[["Tree","Depth-First Search","Breadth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","广度优先搜索","哈希表","二叉树"]],"501148034":[null,null],"50181492":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"503793114":[["Tree","Depth-First Search","Hash Table","Binary Tree"],["树","深度优先搜索","哈希表","二叉树"]],"504472069":[["String"],["字符串"]],"505097820":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort"],["深度优先搜索","广度优先搜索","图","拓扑排序"]],"509699848":[["Greedy","Array","Binary Search","Dynamic Programming"],["贪心","数组","二分查找","动态规划"]],"509756552":[["Array","Hash Table","Counting Sort","Sorting"],["数组","哈希表","计数排序","排序"]],"5115105":[["Memoization","Dynamic Programming"],["记忆化搜索","动态规划"]],"511813355":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"512758649":[["Segment Tree","Array","Ordered Set","Line Sweep"],["线段树","数组","有序集合","扫描线"]],"518714509":[["Array","Enumeration"],["数组","枚举"]],"519326923":[["Array","Hash Table"],["数组","哈希表"]],"519673615":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"519703576":[["Database"],["数据库"]],"521103328":[["Stack","Tree","Depth-First Search","Binary Tree"],["栈","树","深度优先搜索","二叉树"]],"52174285":[["Binary Indexed Tree","Segment Tree","Array","Dynamic Programming"],["树状数组","线段树","数组","动态规划"]],"521886798":[["Memoization","Array","Binary Search","Dynamic Programming","Matrix","Sorting"],["记忆化搜索","数组","二分查找","动态规划","矩阵","排序"]],"522511593":[["Linked List","Two Pointers"],["链表","双指针"]],"523690894":[["Stack","Graph","Array","Dynamic Programming","Shortest Path","Monotonic Stack"],["栈","图","数组","动态规划","最短路","单调栈"]],"523951328":[["Bit Manipulation","Array","Hash Table","Counting"],["位运算","数组","哈希表","计数"]],"526067229":[["Array","Hash Table","String","Sorting"],["数组","哈希表","字符串","排序"]],"529027464":[["Geometry","Math"],["几何","数学"]],"529249486":[["Array","Hash Table","Counting Sort","Sorting"],["数组","哈希表","计数排序","排序"]],"530135030":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"530449553":[["Tree","Depth-First Search","Breadth-First Search","Design","String","Binary Tree"],["树","深度优先搜索","广度优先搜索","设计","字符串","二叉树"]],"530846359":[["Greedy","Queue","Array","Binary Search","Prefix Sum","Sliding Window"],["贪心","队列","数组","二分查找","前缀和","滑动窗口"]],"534082096":[["Math","Enumeration"],["数学","枚举"]],"535210813":[["Trie","Hash Table","String","Bucket Sort","Counting","Sorting","Heap (Priority Queue)"],["字典树","哈希表","字符串","桶排序","计数","排序","堆（优先队列）"]],"535469112":[["Depth-First Search","Trie"],["深度优先搜索","字典树"]],"53592478":[null,null],"535937366":[["Recursion","Linked List"],["递归","链表"]],"536229655":[["Stack","Design","Linked List","String","Doubly-Linked List","Simulation"],["栈","设计","链表","字符串","双向链表","模拟"]],"536430705":[["Greedy","Array","Heap (Priority Queue)"],["贪心","数组","堆（优先队列）"]],"537590451":[["Bit Manipulation","Array","Dynamic Programming","Bitmask"],["位运算","数组","动态规划","状态压缩"]],"537971944":[["Array","String","String Matching"],["数组","字符串","字符串匹配"]],"538156740":[["String","Dynamic Programming"],["字符串","动态规划"]],"540821611":[["Bit Manipulation","Tree","Dynamic Programming","Bitmask","Enumeration"],["位运算","树","动态规划","状态压缩","枚举"]],"545408597":[["Array","Matrix"],["数组","矩阵"]],"545869308":[["Array","Prefix Sum"],["数组","前缀和"]],"547605841":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"549109709":[["Greedy","Array","Ordered Set","Heap (Priority Queue)"],["贪心","数组","有序集合","堆（优先队列）"]],"550044897":[["Bit Manipulation","Array","Math"],["位运算","数组","数学"]],"550448877":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"550627195":[["Bit Manipulation","Array","Two Pointers","Binary Search","Dynamic Programming","Bitmask","Ordered Set"],["位运算","数组","双指针","二分查找","动态规划","状态压缩","有序集合"]],"551650495":[["Bit Manipulation","Recursion","Math"],["位运算","递归","数学"]],"552299541":[["Binary Indexed Tree","Segment Tree","Array","Binary Search","Divide and Conquer","Ordered Set","Merge Sort"],["树状数组","线段树","数组","二分查找","分治","有序集合","归并排序"]],"556438904":[["Array","Heap (Priority Queue)"],["数组","堆（优先队列）"]],"556450459":[["Database"],["数据库"]],"556825118":[["Array","Hash Table","Ordered Set","Sorting"],["数组","哈希表","有序集合","排序"]],"557064072":[["Geometry","Array","Math","Divide and Conquer","Ordered Set","Sorting"],["几何","数组","数学","分治","有序集合","排序"]],"557097878":[["Array","Dynamic Programming"],["数组","动态规划"]],"558074969":[["Bit Manipulation","Math"],["位运算","数学"]],"559582932":[["Greedy","Array","Two Pointers","Sorting"],["贪心","数组","双指针","排序"]],"566662585":[["Depth-First Search","Breadth-First Search","Array","Dynamic Programming","Matrix"],["深度优先搜索","广度优先搜索","数组","动态规划","矩阵"]],"566836098":[["Database"],["数据库"]],"569105706":[["Math","Two Pointers","String"],["数学","双指针","字符串"]],"569662321":[["Database"],["数据库"]],"569821923":[["Math","Dynamic Programming"],["数学","动态规划"]],"569962978":[["Greedy","Hash Table","String"],["贪心","哈希表","字符串"]],"571415893":[["Memoization","Math","Dynamic Programming"],["记忆化搜索","数学","动态规划"]],"571559842":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"572178714":[["Bit Manipulation","Array","Hash Table","Math"],["位运算","数组","哈希表","数学"]],"572276699":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"57307685":[["Two Pointers","String"],["双指针","字符串"]],"573279484":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"576619521":[["String","Backtracking"],["字符串","回溯"]],"578346118":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"578368735":[["Depth-First Search","Design","Trie","String"],["深度优先搜索","设计","字典树","字符串"]],"578652817":[["Design","Queue"],["设计","队列"]],"579965012":[["Stack","Array","Hash Table","Monotonic Stack"],["栈","数组","哈希表","单调栈"]],"582275145":[["Array","Sliding Window"],["数组","滑动窗口"]],"582349116":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"584398620":[["Geometry","Array","Math","Binary Search","Enumeration"],["几何","数组","数学","二分查找","枚举"]],"584422611":[["Memoization","Math","Dynamic Programming"],["记忆化搜索","数学","动态规划"]],"58544596":[["Hash Table","Two Pointers","String","Sliding Window"],["哈希表","双指针","字符串","滑动窗口"]],"586474794":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"58778303":[["String"],["字符串"]],"588772553":[["Graph","Array","Hash Table"],["图","数组","哈希表"]],"590592305":[["Hash Table","Math","String","Dynamic Programming"],["哈希表","数学","字符串","动态规划"]],"591580711":[["Depth-First Search","Breadth-First Search","Graph","Interactive","Heap (Priority Queue)"],["深度优先搜索","广度优先搜索","图","交互","堆（优先队列）"]],"59158142":[["Graph","Topological Sort","Memoization","Array","Math","Dynamic Programming","Game Theory","Matrix"],["图","拓扑排序","记忆化搜索","数组","数学","动态规划","博弈","矩阵"]],"592662704":[["Bit Manipulation","Divide and Conquer"],["位运算","分治"]],"592826714":[["Greedy","Array","Matrix"],["贪心","数组","矩阵"]],"59428399":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"594551983":[["Bit Manipulation","Array","Hash Table","Math","Prefix Sum"],["位运算","数组","哈希表","数学","前缀和"]],"594904868":[["Stack","Design","Linked List","Doubly-Linked List","Ordered Set"],["栈","设计","链表","双向链表","有序集合"]],"59567354":[null,null],"596917752":[null,null],"599100436":[["Linked List","Two Pointers"],["链表","双指针"]],"601450429":[["Math","Binary Search"],["数学","二分查找"]],"602085756":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"606654355":[["Geometry","Math"],["几何","数学"]],"607026938":[["Array","Hash Table","Binary Search","Sorting"],["数组","哈希表","二分查找","排序"]],"608419542":[["Dynamic Programming"],["动态规划"]],"611100168":[["String","Counting"],["字符串","计数"]],"611620362":[["Array","Binary Search"],["数组","二分查找"]],"61296851":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"613691832":[["Stack","Design","Data Stream","Monotonic Stack"],["栈","设计","数据流","单调栈"]],"614687136":[["Array","Hash Table","Sliding Window"],["数组","哈希表","滑动窗口"]],"615729621":[["Bit Manipulation","Array","Hash Table"],["位运算","数组","哈希表"]],"617363107":[["Design","Array","Matrix","Prefix Sum"],["设计","数组","矩阵","前缀和"]],"618419204":[["Array","Sorting"],["数组","排序"]],"620562584":[["Database"],["数据库"]],"623247221":[["Bit Manipulation"],["位运算"]],"625310591":[["String","Binary Search","Suffix Array","Sliding Window","Hash Function","Rolling Hash"],["字符串","二分查找","后缀数组","滑动窗口","哈希函数","滚动哈希"]],"625709572":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"62740321":[["Hash Table","String","Bucket Sort","Counting","Sorting","Heap (Priority Queue)"],["哈希表","字符串","桶排序","计数","排序","堆（优先队列）"]],"628719688":[["Two Pointers","String"],["双指针","字符串"]],"629883391":[["Tree","Breadth-First Search","Binary Tree"],["树","广度优先搜索","二叉树"]],"634204613":[["Array","Two Pointers","Binary Search","Prefix Sum","Sorting"],["数组","双指针","二分查找","前缀和","排序"]],"635111986":[["Bit Manipulation","Array","Math"],["位运算","数组","数学"]],"636790914":[["Array","Dynamic Programming"],["数组","动态规划"]],"636908055":[["Greedy","Array","String","Sorting"],["贪心","数组","字符串","排序"]],"637379632":[["Greedy","Hash Table","String"],["贪心","哈希表","字符串"]],"637661898":[["Array","Hash Table","Matrix"],["数组","哈希表","矩阵"]],"638264577":[["Hash Table","String"],["哈希表","字符串"]],"638561610":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"639622603":[["Array","Sorting"],["数组","排序"]],"639855496":[null,null],"639984084":[null,null],"640612489":[["Array","String","Dynamic Programming"],["数组","字符串","动态规划"]],"641703821":[["Concurrency"],["多线程"]],"644735722":[["Database"],["数据库"]],"646623014":[["Tree","Depth-First Search","String","Binary Tree"],["树","深度优先搜索","字符串","二叉树"]],"648001314":[["Tree","Breadth-First Search","Binary Tree"],["树","广度优先搜索","二叉树"]],"650356357":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"651101767":[["Memoization","Math","Dynamic Programming"],["记忆化搜索","数学","动态规划"]],"65111910":[["Array","Dynamic Programming"],["数组","动态规划"]],"653475446":[["String","Dynamic Programming"],["字符串","动态规划"]],"654405691":[["Database"],["数据库"]],"655929637":[["Array","Dynamic Programming"],["数组","动态规划"]],"657641712":[["Tree","Depth-First Search","Divide and Conquer","Binary Tree"],["树","深度优先搜索","分治","二叉树"]],"658738156":[["Array","String"],["数组","字符串"]],"66053082":[["Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["树","深度优先搜索","二叉搜索树","二叉树"]],"660980450":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"665333196":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"668514824":[["Math","Dynamic Programming"],["数学","动态规划"]],"669193354":[["Database"],["数据库"]],"670519393":[["String","Dynamic Programming","String Matching","Hash Function","Rolling Hash"],["字符串","动态规划","字符串匹配","哈希函数","滚动哈希"]],"670957801":[["Greedy","String","Enumeration"],["贪心","字符串","枚举"]],"672964653":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"67459313":[["Tree","Depth-First Search","Breadth-First Search","Array","Hash Table"],["树","深度优先搜索","广度优先搜索","数组","哈希表"]],"676558931":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"676949389":[["Greedy","Bit Manipulation","Dynamic Programming"],["贪心","位运算","动态规划"]],"677909483":[["Math","String","Dynamic Programming"],["数学","字符串","动态规划"]],"67823656":[["Array","Hash Table","Math"],["数组","哈希表","数学"]],"679348420":[["Greedy","Bit Manipulation","Memoization","Dynamic Programming"],["贪心","位运算","记忆化搜索","动态规划"]],"680388257":[null,null],"681133837":[["Array","Heap (Priority Queue)"],["数组","堆（优先队列）"]],"68154824":[["Depth-First Search","Union Find","Graph","Array"],["深度优先搜索","并查集","图","数组"]],"684110909":[["Array","Math","Matrix","Sorting"],["数组","数学","矩阵","排序"]],"686429748":[["Math","String"],["数学","字符串"]],"687876034":[["Brainteaser","Math"],["脑筋急转弯","数学"]],"688063365":[["Array","Dynamic Programming","Sorting"],["数组","动态规划","排序"]],"689742461":[["Database"],["数据库"]],"690173651":[["Stack","Greedy","String","Dynamic Programming"],["栈","贪心","字符串","动态规划"]],"690261450":[["Array","Math"],["数组","数学"]],"693474678":[["Design","Array","Hash Table","Simulation"],["设计","数组","哈希表","模拟"]],"694594451":[["Math","String"],["数学","字符串"]],"694631589":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"694748880":[["Bit Manipulation"],["位运算"]],"696571525":[["Database"],["数据库"]],"697239024":[["Graph","Shortest Path","Heap (Priority Queue)"],["图","最短路","堆（优先队列）"]],"700466705":[["Graph","Topological Sort","Array","Matrix"],["图","拓扑排序","数组","矩阵"]],"70049056":[["Greedy","Hash Table","String"],["贪心","哈希表","字符串"]],"700655129":[["Array","Binary Search","Matrix","Ordered Set","Prefix Sum"],["数组","二分查找","矩阵","有序集合","前缀和"]],"701261553":[["Greedy","Array","Dynamic Programming"],["贪心","数组","动态规划"]],"703374139":[["Concurrency"],["多线程"]],"704152903":[["Math"],["数学"]],"705186057":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"705189000":[["Stack","Greedy","Array"],["栈","贪心","数组"]],"707570247":[["Design","Trie","Hash Table","String"],["设计","字典树","哈希表","字符串"]],"707968705":[["Array","Two Pointers","String"],["数组","双指针","字符串"]],"709012070":[["Array","Hash Table","String","Counting"],["数组","哈希表","字符串","计数"]],"712189388":[["Array","Binary Search","Dynamic Programming","Sorting"],["数组","二分查找","动态规划","排序"]],"713625410":[["Bit Manipulation","Union Find","String"],["位运算","并查集","字符串"]],"715235362":[["Bit Manipulation","Array","Two Pointers","Matrix","Simulation"],["位运算","数组","双指针","矩阵","模拟"]],"718375766":[["Greedy","Array","Sorting","Heap (Priority Queue)"],["贪心","数组","排序","堆（优先队列）"]],"718987035":[["Union Find","Design","Binary Indexed Tree","Segment Tree","Binary Search","Ordered Set","Heap (Priority Queue)"],["并查集","设计","树状数组","线段树","二分查找","有序集合","堆（优先队列）"]],"719526211":[["Database"],["数据库"]],"719843162":[["Array","Math"],["数组","数学"]],"721361841":[["Bit Manipulation","Array","String","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","字符串","动态规划","回溯","状态压缩"]],"722046827":[["Tree","Depth-First Search"],["树","深度优先搜索"]],"724072362":[["Hash Table","Math","String","Counting","Prefix Sum"],["哈希表","数学","字符串","计数","前缀和"]],"724968972":[["Database"],["数据库"]],"725104396":[["Recursion","Linked List","Math"],["递归","链表","数学"]],"728229560":[["Depth-First Search","Union Find","Graph","Hash Table"],["深度优先搜索","并查集","图","哈希表"]],"729170392":[["Bit Manipulation","Array","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","动态规划","回溯","状态压缩"]],"729675571":[["Database"],["数据库"]],"730656427":[["Array","Dynamic Programming","Prefix Sum"],["数组","动态规划","前缀和"]],"730723137":[["Array","Backtracking"],["数组","回溯"]],"730943544":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"731038573":[["Binary Indexed Tree","Segment Tree","Array","Dynamic Programming"],["树状数组","线段树","数组","动态规划"]],"731708110":[["Array","String","Binary Search"],["数组","字符串","二分查找"]],"733560660":[["Greedy","Array"],["贪心","数组"]],"735587531":[["Array","String"],["数组","字符串"]],"737814347":[["Stack","Greedy","Array","String"],["栈","贪心","数组","字符串"]],"737896329":[["Graph","Design","Shortest Path","Heap (Priority Queue)"],["图","设计","最短路","堆（优先队列）"]],"739255468":[["Array"],["数组"]],"741778858":[["Array","Dynamic Programming"],["数组","动态规划"]],"74188793":[["Greedy","String","Counting"],["贪心","字符串","计数"]],"743759650":[["Array","Simulation"],["数组","模拟"]],"744773019":[["Breadth-First Search","Array","Dynamic Programming","Matrix"],["广度优先搜索","数组","动态规划","矩阵"]],"746573214":[["Union Find","Array","Ordered Set","Prefix Sum"],["并查集","数组","有序集合","前缀和"]],"747763790":[["Hash Table","String","Dynamic Programming"],["哈希表","字符串","动态规划"]],"748610431":[null,null],"74918902":[["Database"],["数据库"]],"750309798":[["Tree","Depth-First Search","Dynamic Programming"],["树","深度优先搜索","动态规划"]],"750727980":[["Hash Table","String"],["哈希表","字符串"]],"751346572":[["Math"],["数学"]],"752241853":[["Array","Hash Table"],["数组","哈希表"]],"755197791":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"756808622":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort"],["深度优先搜索","广度优先搜索","图","拓扑排序"]],"759235138":[["Recursion","Linked List"],["递归","链表"]],"760128905":[["Array"],["数组"]],"760662992":[["Array","Sorting","Simulation","Heap (Priority Queue)"],["数组","排序","模拟","堆（优先队列）"]],"761142635":[["Recursion","Math","Dynamic Programming"],["递归","数学","动态规划"]],"761999420":[["Array","Binary Search","Prefix Sum","Sorting"],["数组","二分查找","前缀和","排序"]],"765388149":[["Array","Binary Search","Sorting"],["数组","二分查找","排序"]],"769907793":[["Tree","Breadth-First Search","Design","Binary Tree"],["树","广度优先搜索","设计","二叉树"]],"770030188":[["Array","String","Dynamic Programming"],["数组","字符串","动态规划"]],"770308924":[["Array","Two Pointers","String"],["数组","双指针","字符串"]],"770550829":[["Array","Binary Search","Counting"],["数组","二分查找","计数"]],"771122731":[["Tree","Depth-First Search","Array","Hash Table","Binary Tree"],["树","深度优先搜索","数组","哈希表","二叉树"]],"773302480":[["Bit Manipulation","Math"],["位运算","数学"]],"77582966":[["Array","Two Pointers","Binary Search","Sorting"],["数组","双指针","二分查找","排序"]],"775852598":[["Stack","Tree","Depth-First Search","Binary Search Tree","Binary Tree"],["栈","树","深度优先搜索","二叉搜索树","二叉树"]],"776635260":[["Greedy","Array","Sorting","Heap (Priority Queue)"],["贪心","数组","排序","堆（优先队列）"]],"778347498":[["Design","Queue","Hash Table","Counting","Data Stream"],["设计","队列","哈希表","计数","数据流"]],"779517329":[["Bit Manipulation","String","Backtracking"],["位运算","字符串","回溯"]],"781431378":[["Array","Math","Probability and Statistics"],["数组","数学","概率与统计"]],"782263815":[["Two Pointers","String","Binary Search"],["双指针","字符串","二分查找"]],"782544976":[["Reservoir Sampling","Hash Table","Math","Randomized"],["水塘抽样","哈希表","数学","随机化"]],"782747152":[["Breadth-First Search","Array","Matrix"],["广度优先搜索","数组","矩阵"]],"783017459":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"78641139":[["Bit Manipulation","Array"],["位运算","数组"]],"787047636":[["Greedy","Array"],["贪心","数组"]],"787489678":[["Bit Manipulation","Array"],["位运算","数组"]],"787831673":[null,null],"791863919":[["Stack","Design","Array","Linked List","Data Stream","Doubly-Linked List"],["栈","设计","数组","链表","数据流","双向链表"]],"792209696":[["Array","Binary Search","Dynamic Programming","Sorting"],["数组","二分查找","动态规划","排序"]],"792881591":[["Stack","Breadth-First Search","Memoization","String","Dynamic Programming"],["栈","广度优先搜索","记忆化搜索","字符串","动态规划"]],"79432680":[["Geometry","Array","Math","Enumeration","Sorting"],["几何","数组","数学","枚举","排序"]],"796165027":[["Bit Manipulation","Graph","Enumeration","Shortest Path","Heap (Priority Queue)"],["位运算","图","枚举","最短路","堆（优先队列）"]],"799287649":[["Stack","Math","String"],["栈","数学","字符串"]],"800569224":[["Array","Math"],["数组","数学"]],"80255331":[["Array","Hash Table","Matrix","Simulation"],["数组","哈希表","矩阵","模拟"]],"804923256":[["Array","Math","Backtracking"],["数组","数学","回溯"]],"806315258":[["Depth-First Search","Breadth-First Search","Union Find","Hash Table","Hash Function"],["深度优先搜索","广度优先搜索","并查集","哈希表","哈希函数"]],"806863646":[["Design","Queue","Array","Binary Search","Data Stream"],["设计","队列","数组","二分查找","数据流"]],"807897834":[["Array","Two Pointers","String","Simulation"],["数组","双指针","字符串","模拟"]],"808016071":[["Array","Hash Table"],["数组","哈希表"]],"809508462":[["Array","Hash Table"],["数组","哈希表"]],"809566471":[["Array","Hash Table","Simulation"],["数组","哈希表","模拟"]],"811643351":[["Hash Table","String","Backtracking"],["哈希表","字符串","回溯"]],"816106556":[["Geometry","Array","Math"],["几何","数组","数学"]],"817020554":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"817603659":[["Recursion","Math"],["递归","数学"]],"818614665":[["Array","Dynamic Programming"],["数组","动态规划"]],"819381767":[["Design","Hash Table","Data Stream","Heap (Priority Queue)"],["设计","哈希表","数据流","堆（优先队列）"]],"820995848":[["Recursion","Array"],["递归","数组"]],"821525251":[["Depth-First Search","Breadth-First Search","Union Find","Array","Binary Search","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","二分查找","矩阵"]],"823333636":[["Recursion","Math","Dynamic Programming"],["递归","数学","动态规划"]],"823399055":[["Array","Two Pointers","String"],["数组","双指针","字符串"]],"823401403":[null,null],"823944730":[["Array","Binary Search","Interactive"],["数组","二分查找","交互"]],"824074855":[["Binary Indexed Tree","Array","Dynamic Programming"],["树状数组","数组","动态规划"]],"826909651":[["Array","Matrix","Prefix Sum"],["数组","矩阵","前缀和"]],"829222445":[["Greedy","Math"],["贪心","数学"]],"830012757":[["Stack","Recursion","Linked List","Two Pointers"],["栈","递归","链表","双指针"]],"830799973":[["Array","Two Pointers"],["数组","双指针"]],"831955542":[["Array","Hash Table","Prefix Sum"],["数组","哈希表","前缀和"]],"83229717":[["Hash Table","String","Sorting"],["哈希表","字符串","排序"]],"833954016":[["Math"],["数学"]],"834197249":[["Bit Manipulation","String","Dynamic Programming","Bitmask"],["位运算","字符串","动态规划","状态压缩"]],"835720488":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"836765096":[["String"],["字符串"]],"83779659":[["Greedy","Math"],["贪心","数学"]],"838041291":[["Binary Indexed Tree","Array"],["树状数组","数组"]],"839436880":[["Database"],["数据库"]],"839548071":[["String","String Matching","Hash Function","Rolling Hash"],["字符串","字符串匹配","哈希函数","滚动哈希"]],"83972723":[["Tree","Binary Search Tree","Math","Dynamic Programming","Binary Tree"],["树","二叉搜索树","数学","动态规划","二叉树"]],"84037765":[["Array","Dynamic Programming"],["数组","动态规划"]],"843769556":[["Array","Enumeration"],["数组","枚举"]],"84450131":[["Hash Table","String","Counting"],["哈希表","字符串","计数"]],"845051287":[null,null],"846898736":[["Array","Matrix","Sorting","Simulation","Heap (Priority Queue)"],["数组","矩阵","排序","模拟","堆（优先队列）"]],"849440197":[["Array","Math","Dynamic Programming","Number Theory"],["数组","数学","动态规划","数论"]],"8513623":[["String","Dynamic Programming"],["字符串","动态规划"]],"852170646":[["Design","Hash Table","String","Ordered Set"],["设计","哈希表","字符串","有序集合"]],"854560060":[["Backtracking"],["回溯"]],"855962181":[["Breadth-First Search","Array","Ordered Set"],["广度优先搜索","数组","有序集合"]],"857697187":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"859530118":[["Bit Manipulation","Array","Hash Table","String"],["位运算","数组","哈希表","字符串"]],"860518194":[["Depth-First Search","Breadth-First Search","Union Find","Graph"],["深度优先搜索","广度优先搜索","并查集","图"]],"860689371":[["Bit Manipulation","Array","Dynamic Programming","Bitmask"],["位运算","数组","动态规划","状态压缩"]],"865538835":[["Breadth-First Search","Hash Table","String","Backtracking"],["广度优先搜索","哈希表","字符串","回溯"]],"866640334":[["Recursion","Array","String"],["递归","数组","字符串"]],"86760751":[["Database"],["数据库"]],"869195845":[["Array","Sorting"],["数组","排序"]],"869865446":[["Array","Hash Table","Binary Search","Sliding Window"],["数组","哈希表","二分查找","滑动窗口"]],"870099563":[["Array","Dynamic Programming"],["数组","动态规划"]],"87115414":[["Array","Hash Table"],["数组","哈希表"]],"875418963":[["Trie","Array","Two Pointers","String","String Matching"],["字典树","数组","双指针","字符串","字符串匹配"]],"87614958":[["Hash Table","String","Sliding Window"],["哈希表","字符串","滑动窗口"]],"877400726":[["String","Dynamic Programming"],["字符串","动态规划"]],"877809104":[["String"],["字符串"]],"879115717":[["Math","String","Simulation"],["数学","字符串","模拟"]],"87920735":[["Array","Binary Search"],["数组","二分查找"]],"880076654":[["Math","Dynamic Programming"],["数学","动态规划"]],"880748729":[["Stack","Array","Dynamic Programming","Monotonic Stack"],["栈","数组","动态规划","单调栈"]],"881741713":[["Array","String"],["数组","字符串"]],"882246184":[["Array","Sorting"],["数组","排序"]],"882447848":[["Database"],["数据库"]],"882579715":[["Bit Manipulation","Hash Table","String"],["位运算","哈希表","字符串"]],"882647661":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"883396381":[["Bit Manipulation","Array"],["位运算","数组"]],"883833496":[["Bit Manipulation","Array","Dynamic Programming","Bitmask","Matrix"],["位运算","数组","动态规划","状态压缩","矩阵"]],"884144873":[["Greedy","Array","Hash Table","Counting"],["贪心","数组","哈希表","计数"]],"885464162":[["Database"],["数据库"]],"886158615":[["Recursion","String","Simulation"],["递归","字符串","模拟"]],"886594276":[["Dynamic Programming"],["动态规划"]],"887148037":[["Graph","Array","Math"],["图","数组","数学"]],"888102063":[["Design","Array","Hash Table","Two Pointers","String"],["设计","数组","哈希表","双指针","字符串"]],"888694650":[["Tree","Depth-First Search","Breadth-First Search","Binary Tree"],["树","深度优先搜索","广度优先搜索","二叉树"]],"889856657":[["Bit Manipulation","Array","Dynamic Programming","Backtracking","Bitmask"],["位运算","数组","动态规划","回溯","状态压缩"]],"890122237":[["Linked List","Math"],["链表","数学"]],"89348328":[["Array","Dynamic Programming","Prefix Sum"],["数组","动态规划","前缀和"]],"893706977":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"894912724":[["Bit Manipulation","Array"],["位运算","数组"]],"897925931":[["Database"],["数据库"]],"900196884":[["Database"],["数据库"]],"904890527":[["String","Dynamic Programming","Backtracking"],["字符串","动态规划","回溯"]],"905487995":[["String","Dynamic Programming"],["字符串","动态规划"]],"905841209":[["Geometry","Math"],["几何","数学"]],"907391117":[["Array","Hash Table","String"],["数组","哈希表","字符串"]],"907536385":[null,null],"907763091":[["Array"],["数组"]],"908082157":[["Stack","String"],["栈","字符串"]],"909563687":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"910590803":[["Array","Hash Table","Sorting","Simulation","Heap (Priority Queue)"],["数组","哈希表","排序","模拟","堆（优先队列）"]],"911506733":[["Array","Hash Table","Counting"],["数组","哈希表","计数"]],"913248466":[["Binary Indexed Tree","Segment Tree","Array","Binary Search","Divide and Conquer","Ordered Set","Merge Sort"],["树状数组","线段树","数组","二分查找","分治","有序集合","归并排序"]],"915449177":[["Memoization","Array","Dynamic Programming"],["记忆化搜索","数组","动态规划"]],"917372483":[["Stack","String","Simulation"],["栈","字符串","模拟"]],"917808097":[["Bit Manipulation","Array","Hash Table"],["位运算","数组","哈希表"]],"91788639":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"918405430":[["Tree","Array","Hash Table","Divide and Conquer","Binary Tree"],["树","数组","哈希表","分治","二叉树"]],"919200929":[["Array","Prefix Sum"],["数组","前缀和"]],"919580800":[["Array","Dynamic Programming"],["数组","动态规划"]],"920111034":[["Design","Array","Hash Table"],["设计","数组","哈希表"]],"920238680":[["Database"],["数据库"]],"921517874":[["Array","Matrix","Simulation"],["数组","矩阵","模拟"]],"922086852":[["Tree","Binary Tree"],["树","二叉树"]],"922159166":[["Trie","Array","Hash Table","String"],["字典树","数组","哈希表","字符串"]],"922160489":[["Greedy","Array","Prefix Sum","Sorting"],["贪心","数组","前缀和","排序"]],"922857054":[null,null],"923836112":[null,null],"924129852":[["String","Dynamic Programming"],["字符串","动态规划"]],"925231976":[null,null],"925899870":[["Array","Dynamic Programming"],["数组","动态规划"]],"926213540":[null,null],"9262188":[["Hash Table","Math","Counting"],["哈希表","数学","计数"]],"927068521":[["Greedy","Array"],["贪心","数组"]],"927391464":[null,null],"928331770":[["Array","Dynamic Programming"],["数组","动态规划"]],"928385815":[["Breadth-First Search","Array","Dynamic Programming"],["广度优先搜索","数组","动态规划"]],"929368022":[null,null],"929645229":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"929840503":[["Tree","Depth-First Search","Breadth-First Search","Linked List","Binary Tree"],["树","深度优先搜索","广度优先搜索","链表","二叉树"]],"932131549":[null,null],"933282434":[["Array","Dynamic Programming","Matrix"],["数组","动态规划","矩阵"]],"93344773":[["Array","Simulation"],["数组","模拟"]],"933877486":[["Array"],["数组"]],"938263064":[["Greedy","Array","Binary Search","Dynamic Programming","Prefix Sum"],["贪心","数组","二分查找","动态规划","前缀和"]],"941716720":[["Stack","Two Pointers","String","Simulation"],["栈","双指针","字符串","模拟"]],"94199361":[["String"],["字符串"]],"942180030":[["Math","String","Dynamic Programming"],["数学","字符串","动态规划"]],"942356384":[["Two Pointers","String","Dynamic Programming"],["双指针","字符串","动态规划"]],"943252793":[["Tree","Depth-First Search","Breadth-First Search","Hash Table"],["树","深度优先搜索","广度优先搜索","哈希表"]],"94359620":[["Greedy","Bit Manipulation","Array"],["贪心","位运算","数组"]],"943933017":[["Dynamic Programming"],["动态规划"]],"945629510":[["Array","String","Prefix Sum"],["数组","字符串","前缀和"]],"946660529":[["Greedy","Math","String"],["贪心","数学","字符串"]],"947222494":[["Database"],["数据库"]],"949381873":[["Graph","Array","Enumeration","Sorting"],["图","数组","枚举","排序"]],"949683376":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"950521557":[["Array","Matrix"],["数组","矩阵"]],"953049578":[["Hash Table","String"],["哈希表","字符串"]],"954274595":[["Array","Dynamic Programming","Matrix","Prefix Sum"],["数组","动态规划","矩阵","前缀和"]],"957253639":[["Bit Manipulation","Divide and Conquer"],["位运算","分治"]],"95851077":[["Greedy","Array","Dynamic Programming","Sorting"],["贪心","数组","动态规划","排序"]],"959153590":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"95938088":[["Array","Prefix Sum"],["数组","前缀和"]],"959851555":[["Queue","Hash Table","String","Counting"],["队列","哈希表","字符串","计数"]],"960174485":[["Depth-First Search","Breadth-First Search","Graph","Topological Sort","Memoization","Array","Dynamic Programming","Matrix"],["深度优先搜索","广度优先搜索","图","拓扑排序","记忆化搜索","数组","动态规划","矩阵"]],"960405407":[["Array","Dynamic Programming"],["数组","动态规划"]],"96141044":[["Segment Tree","Array","String","Ordered Set"],["线段树","数组","字符串","有序集合"]],"961906184":[["Stack","Tree","Binary Search Tree","Recursion","Binary Tree","Monotonic Stack"],["栈","树","二叉搜索树","递归","二叉树","单调栈"]],"963187635":[["Hash Table","Math","String"],["哈希表","数学","字符串"]],"963523596":[["String"],["字符串"]],"96440277":[["Greedy","Bit Manipulation","Array","Matrix"],["贪心","位运算","数组","矩阵"]],"964970911":[["Greedy","Array","Sorting"],["贪心","数组","排序"]],"965000307":[["Greedy","Array"],["贪心","数组"]],"966269583":[["Array","Math","Enumeration","Number Theory"],["数组","数学","枚举","数论"]],"967980473":[["Array","Sorting"],["数组","排序"]],"968595601":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"968851545":[["Tree","Array","Divide and Conquer","Matrix"],["树","数组","分治","矩阵"]],"969064590":[["Hash Table","String","Counting","Hash Function","Rolling Hash"],["哈希表","字符串","计数","哈希函数","滚动哈希"]],"969893325":[["Array","Two Pointers","Sorting"],["数组","双指针","排序"]],"970766553":[["Greedy","Array","Hash Table","Counting","Sorting"],["贪心","数组","哈希表","计数","排序"]],"974534416":[["Array","Hash Table"],["数组","哈希表"]],"976252372":[["Design","Segment Tree","Math"],["设计","线段树","数学"]],"976283641":[["Bit Manipulation","Array","String","Dynamic Programming","Bitmask"],["位运算","数组","字符串","动态规划","状态压缩"]],"977519979":[["Math","Dynamic Programming"],["数学","动态规划"]],"97873302":[["Array","Sliding Window"],["数组","滑动窗口"]],"979158748":[["Depth-First Search","Breadth-First Search","Graph","Dynamic Programming"],["深度优先搜索","广度优先搜索","图","动态规划"]],"9793507":[["Array","Math","String","Backtracking"],["数组","数学","字符串","回溯"]],"979526552":[["Array","Binary Search","Dynamic Programming","Sorting"],["数组","二分查找","动态规划","排序"]],"979891940":[["Breadth-First Search","Hash Table","String"],["广度优先搜索","哈希表","字符串"]],"981386412":[["Array","Sorting"],["数组","排序"]],"983129619":[["Bit Manipulation","Array","Hash Table"],["位运算","数组","哈希表"]],"98370052":[["Stack","Array","Monotonic Stack"],["栈","数组","单调栈"]],"986520800":[["Depth-First Search","Breadth-First Search","Union Find","Array","Matrix"],["深度优先搜索","广度优先搜索","并查集","数组","矩阵"]],"98793972":[["Tree","Depth-First Search","Binary Tree"],["树","深度优先搜索","二叉树"]],"988335694":[["Array","Binary Search","Prefix Sum","Sorting"],["数组","二分查找","前缀和","排序"]],"989456575":[["String","Enumeration"],["字符串","枚举"]],"991662473":[["Array","Math","Sorting"],["数组","数学","排序"]],"99323012":[["Database"],["数据库"]],"999091554":[["Breadth-First Search","Union Find","Array","Binary Search","Matrix"],["广度优先搜索","并查集","数组","二分查找","矩阵"]]} diff --git a/public/ratings.json b/public/ratings.json index 5886e85..d82fa1c 100644 --- a/public/ratings.json +++ b/public/ratings.json @@ -1 +1 @@ -{"1001722740":1151.2537511408,"1002673857":1245.2741257148,"100346498":0,"1005570900":2396.6267778669,"1007682110":0,"1009688921":1710.0787625377,"1009976390":1295.75504698,"1010937559":1301.9276849391,"1013970586":1504.0178888667,"1014740120":1846.4077077642,"1016789276":0,"1017096056":1182.3093772964,"1017177635":2084.5752686737,"1018399535":1579.2309881035,"101859828":1271.3313760514,"1019076732":0,"1019777981":2084.9697035674,"10205408":2130.9348604091,"1021006246":0,"102220660":0,"102293615":0,"1023487571":1675.989407584,"1023816398":2008.40650791,"1024461884":1714.992763701,"1024556652":0,"102575803":2350.9694374861,"1026373985":0,"1028149095":1160.4439395369,"1029578709":2588.8752130913,"1029802455":0,"1032257843":1658.8190087768,"1033176958":0,"1033555490":1479.6908339113,"103725426":0,"1037331293":1309.7266159448,"103770723":0,"1038100878":1180.923623906,"1038307939":1485.6550472186,"103871786":1235.8413685224,"1041979787":0,"1043390792":1389.0328392117,"1044473054":0,"1046441649":0,"1047256075":2081.698529877,"1049390106":1421.2624065513,"1049961856":1919.7433862082,"1053077839":2029.1301557536,"1053626998":1864.0948676111,"1057920854":1613.0429766636,"1058710996":0,"1058758368":0,"1058966145":2238.2830745228,"1059279895":2444.2791027022,"1060291152":1361.8801013336,"1060952697":1516.8229485853,"1062314990":0,"1062871842":1104.7359028407,"1063164797":1507.8701119064,"1063658457":1422.7125559974,"1066025257":1724.1545485476,"1067366399":0,"1067400091":1253.1107481745,"1068663704":0,"1069078430":1249.7770522505,"1069219826":0,"1069956724":2344.3664724791,"1069999133":0,"1074334353":2078.6986769435,"1074391241":0,"1075188600":0,"1075377947":0,"107547857":1748.4522689101,"1075948935":1426.948379305,"1075971933":1997.7013718153,"1078280786":1418.9758090724,"1078494316":1139.6630206282,"1079710023":0,"1080305958":0,"1081472803":0,"1083394541":0,"1084901915":0,"1085741995":0,"108728140":1951.3509259668,"1088208610":2081.1880297942,"1089101531":1533.5722750742,"1092713458":1665.24907247,"1093275153":1309.1422268153,"1094471227":1581.4162718925,"1095929141":1787.8550568757,"109606469":1558.7188539503,"1096438122":0,"1097720535":1657.5344546445,"1098465458":1407.1322366299,"1101243430":0,"110135796":1741.4527995252,"1102712818":0,"1102749976":1445.3734269673,"1103286328":1685.3599641299,"1104764996":0,"1108078634":0,"111167904":1328.5499677186,"111192011":0,"111233848":0,"111314097":0,"1113985320":1995.2937073376,"1114191328":2378.6234112504,"1114300382":0,"111572636":0,"1118571941":1810.7690062079,"1119710280":2380.5983169295,"1122946813":1450.6986543984,"1123666202":1284.4514662456,"1129799033":0,"1130768852":0,"1131587707":0,"1132748762":0,"1132876897":0,"1134359923":1830.3165569278,"1135090504":1818.0024504436,"1135153485":0,"1137656154":1180.3543157775,"1137942707":1678.6241816708,"113811987":2222.4805422748,"1139062797":1290.0361853035,"1140950686":1708.9663754668,"1144525439":0,"1146950656":0,"1147860078":1831.9395911303,"1149087220":1234.4144116814,"1150623470":2182.6180030785,"1151236787":0,"115382073":0,"1156930664":0,"1160726234":0,"1164168277":0,"1164523872":0,"1164835766":0,"1165166058":2399.5729141925,"1165928557":0,"1167299665":1744.0388789755,"1167766424":1259.1979660519,"1168254316":1281.0889272532,"1168505902":1951.2096212775,"1168558024":1393.7857353048,"1170959519":0,"1171095":0,"117165936":1321.9346201204,"1172679970":0,"1173419903":1347.2146542772,"1174559962":1266.5014127879,"1176671732":0,"1177110212":0,"1178924986":2817.267212602,"1179475752":1228.4824438011,"1180161064":1663.3912882908,"1180349312":1356.4450869217,"1180837306":1346.3556309143,"1181589124":2081.7518764643,"1182547848":1301.1576743638,"1184414922":1912.0829958001,"1185092838":1615.4767730477,"1186138716":0,"1186731908":1791.0336923305,"1187211206":1441.4290319373,"1187527339":0,"1187943151":0,"1188543288":0,"1189152973":2033.4597721985,"1191385639":1807.4618172386,"1191936218":0,"1192302071":1708.9983361411,"1192605817":0,"119361315":1495.5180147817,"1194042995":2648.1748409542,"119654105":1178.4942541235,"1197839305":0,"1197966112":1981.3072959787,"1199006360":0,"1199383198":1819.3068421506,"119954396":1527.6868660176,"1200771569":1367.0197235097,"1200779115":0,"1204439806":1749.5115037045,"1204660336":1734.0550202798,"1206307881":0,"120648461":1949.0920823355,"1210001971":1774.8764591297,"1210196211":1429.1878389249,"1210455736":2171.716066664,"1210688937":2042.4005521254,"1210757712":1166.5264284193,"121112730":0,"1212080245":0,"1212266970":0,"1218347826":2336.5210003185,"1218479039":0,"122030614":1594.2563236049,"122134919":1606.9895296459,"1225270682":1244.317367883,"1226888142":1499.7136257352,"1229621552":1638.3134093066,"123050212":1516.4104902196,"1231586287":0,"1231673390":0,"1231737979":1373.8113453501,"1232284801":1334.0564009231,"1232868918":0,"123288766":0,"1233403465":0,"1234370312":1544.6371526659,"1234415652":0,"1235853332":1597.1931473887,"1236291717":0,"1236982780":1739.5831401172,"1238400837":1334.5718985411,"1238608911":0,"124089953":0,"1241705093":1229.7575626899,"124247488":0,"124339070":1464.6895034875,"1243440018":2153.8943791656,"1245231548":0,"1245371369":0,"1246328892":0,"1246713190":0,"1247027569":1590.5791055102,"1247428479":0,"1249919767":1322.5926536743,"1250723795":0,"1252533772":0,"1252651878":0,"1253336265":1674.7986939472,"125432943":0,"1255527945":1685.5389350949,"1257680587":1395.5132479177,"1257762070":1674.9985842835,"1258148931":0,"1260215787":1593.8926580448,"1262858438":0,"1263665709":0,"1265881179":0,"126670103":0,"1268853066":0,"1269261016":0,"1272023779":2181.7821188042,"1275579259":1682.16892078,"1276354362":0,"1278269400":0,"1278665216":1279.3383966145,"1280364978":0,"1282549856":0,"1287143513":0,"1290173910":1280.2203734882,"1294188975":1209.3722198224,"1294989119":0,"1295785983":1636.7472106213,"1299365979":1450.8514438667,"1299928804":1160.8899403409,"1300584624":0,"1300693519":0,"1301810943":0,"1303368655":1297.5338328524,"1303459038":1285.1547123119,"1304520805":1785.6872758693,"1304985926":1749.9743684275,"1305713613":0,"1308115412":0,"1308745360":0,"1310138170":0,"1311511120":0,"1311726140":1820.58557644,"1312484096":0,"1312828534":0,"1316461889":1610.1866391145,"1319672571":1686.4493679523,"1320293684":1524.5856276651,"1321549485":0,"1322023785":1350.6048768377,"132290954":0,"1323143155":1779.0712927572,"1325042165":0,"132598439":0,"132633492":1530.4652027753,"1327909725":0,"1329204486":0,"1331006046":0,"1331559454":0,"1331620430":1418.6847740057,"133627469":1573.4042963622,"1337689329":1332.4653491345,"1341926866":0,"1347652080":2025.1529365814,"1350925428":1262.5890311992,"1351132676":2246.0452639352,"1351904344":0,"13544352":1855.4479039876,"1356097871":0,"1361459100":1412.2790156634,"136239889":1467.9366439696,"1363331011":1828.2700238306,"1363446915":1754.1710323358,"1364645526":0,"1364762739":1823.8779711373,"1365148367":1618.6016480451,"1368317464":1165.4768151611,"1368794049":0,"1370751449":0,"1370775302":1893.5143805402,"137081663":0,"1375391804":0,"1376431756":1317.1729927899,"1376748919":0,"1377831845":1253.5161450678,"1377883269":1681.3263732456,"1378497107":0,"1381448562":0,"1381994519":2350.7421492104,"1385231803":1315.8569286597,"138718433":0,"1387834419":2055.0970201875,"1392708979":2288.2117442123,"1393055239":1267.223591366,"1395079998":0,"1395581223":1557.017055582,"1399568330":0,"1401306104":0,"1402633459":1600.5573262373,"1402867741":1590.0883962313,"1403314808":1125.575238274,"1403965423":1940.6002290953,"1405611181":2159.4844281244,"1405789151":1178.6580069402,"1405988519":1309.8100518373,"1406878447":0,"1409344146":1207.748239075,"1411796478":0,"1412203164":0,"1414741845":1786.3121598293,"1417435719":1341.0476642293,"1418471367":1084.1319467318,"1419735568":0,"1420036364":1172.6819789183,"1420249701":2030.922770301,"1420390570":1431.0523656241,"1421409652":0,"1422717967":0,"1423912379":1658.3474650806,"1426150563":0,"1428000744":0,"1428852700":2168.7531235448,"143031678":1283.51021448,"1430651253":1325.3607218257,"1432071996":1880.7433591583,"1434911335":2690.5859406179,"1435717617":1697.0187705319,"1438711104":0,"1438800814":1396.5990609759,"144023621":0,"1441425352":0,"1442274557":2201.8209584221,"1442563829":0,"1442835646":0,"1449021558":1201.8730954169,"1449182323":0,"1449546891":1414.6100987673,"1450266090":2021.7790710467,"145069778":2307.0161713185,"1451306214":0,"1452093256":1405.4005354401,"1454677217":0,"1456955548":0,"1457368038":1985.2504512337,"1459395051":2291.6794536377,"1460194927":0,"1460547008":1167.1331831913,"1461103201":1877.5624603804,"1463291583":1465.7023558248,"1463471392":1638.4147703093,"1464742605":1808.3407696613,"1466738944":1832.7167755024,"1467367970":1473.864993045,"1467581792":0,"1467636476":0,"146862112":1880.3261182293,"1471696394":1291.744935731,"1472553037":0,"1474617560":1422.3308967485,"14750873":1151.9363042898,"1475483634":1253.1463945043,"1478600712":1678.1133886034,"147891676":1481.1046340847,"1478945205":0,"1479673533":1287.8970301681,"1480696010":1737.8431142688,"1480774126":1850.5506342426,"1481976566":1315.3715333947,"1482300808":2171.9645269732,"1482821287":1294.5297034757,"1485423720":1929.897343316,"1486913577":1224.7606792444,"1487915794":1182.6489068544,"1488658299":0,"1490013522":0,"1490454383":1927.4000816649,"149268417":2080.7845644831,"1493116499":1216.612918849,"1493274091":1782.3312212058,"1493978161":0,"1495787026":0,"1496544628":0,"1497402060":1255.5461825223,"1498707721":1505.8669082864,"1500411729":0,"1500920738":0,"1501707049":1549.945040184,"1502235269":0,"1502620621":1769.4344566771,"1504907424":1970.4608098164,"1507011086":1390.5023027273,"1507332922":2397.8728428256,"1507774284":1308.948547975,"1508563965":0,"1512857430":1577.1141767118,"1515775640":1243.6250741657,"1518041298":1688.9209684568,"1518510268":0,"1519348229":0,"1519983797":2004.5346526204,"1520385101":1276.7817742915,"1520513992":0,"1522184936":0,"152251963":0,"1523330486":0,"1523645158":2126.3922279277,"1525551268":0,"1525867551":0,"1526363744":1766.2506177612,"1526496677":0,"1526624858":0,"1526976016":1379.8787648129,"1528579119":0,"1529011687":1499.5903720292,"152903211":0,"1529937689":0,"1530394259":0,"1530442140":1524.3227469,"1535345394":1658.7495899767,"1537635707":1604.6299874552,"1538966566":1680.866917849,"1539515792":2943.2173551759,"1541316145":1444.6795731919,"1541437811":0,"1541631847":0,"1542173395":1413.4238697034,"1543621842":0,"1546633713":0,"1547023723":2016.2085876254,"1547394567":1232.8314427996,"1548254728":1912.8440554296,"1548912992":0,"1558678323":0,"1559181224":0,"1559330514":2091.6580433632,"1559448771":0,"1560892380":0,"1561912001":0,"1563663979":0,"1565214769":0,"1565495532":0,"1565798166":1689.7569144085,"1567110694":2280.3143643878,"1568537869":0,"1569081897":0,"1569116237":1473.2523136772,"1571048900":1406.1279714442,"1572535871":2277.0238076464,"1575599751":0,"1576603106":2872.0290327119,"1576706031":0,"1577580678":0,"1577638784":1541.5405749918,"1579629689":1745.5352025872,"1580991625":2072.7264178313,"1582953363":1581.4963716166,"1583176635":0,"1583349779":1848.0912848518,"158335627":1793.3033536992,"1584359446":1967.5589835406,"1586756425":0,"1589710386":2124.1329592058,"1590024460":1922.9521758079,"159003173":0,"1590273508":0,"1590551370":0,"159231277":2140.0220703954,"1592995979":1235.6114196155,"1598113371":0,"1598128796":0,"1598976020":0,"1599758478":1421.7251191403,"1601603749":1380.1541980647,"1602330770":1168.6157473032,"1603806327":1625.9636825798,"1603834737":0,"1603972964":0,"1604381884":1880.0511044074,"1610031866":1242.8939284628,"1610939039":0,"16117382":1786.5491561897,"1614249365":1153.427255962,"1615136281":0,"1615798591":1301.9432665133,"161597751":1258.6719675401,"1616359180":1459.7513584849,"1618480669":0,"1619143061":1271.3776510163,"1620091732":1640.8976042503,"1620228801":1575.6324598387,"1620549524":2132.1944636902,"1620554900":1713.3954468582,"1621119601":1816.556997127,"162304303":0,"1627181507":2415.2802039252,"1627389455":0,"1627868267":1249.9947800752,"1628732610":0,"1628732687":0,"1629080001":0,"1629689602":1591.5492530876,"163006863":0,"1632383781":1825.4207082682,"1632602455":0,"1635315111":0,"163704669":0,"1637468390":1438.8988489545,"1640158797":2073.0124645606,"1642092986":2429.0940568399,"164313417":0,"1643291393":1439.5656079032,"1644032538":2301.4069974024,"1644520119":0,"1645223251":1505.3120825678,"1645809775":0,"1646187623":2290.9040038639,"1648003092":0,"1649292854":2059.4040623264,"1650421130":1225.3923012413,"1651110316":1868.1914861381,"165157096":1229.1709574783,"1652287983":0,"1652509718":0,"1653571628":0,"1655779586":0,"1656858690":1121.0677596555,"1658221095":1700.8505554268,"1658347329":0,"1658547847":0,"1659259166":0,"1659585642":0,"1661781078":0,"1665689312":1340.5559417151,"1670099365":1301.381757401,"1671137181":0,"1672314711":0,"1676080206":1653.7337081336,"1676364478":0,"1676853681":1423.5501543781,"1677121627":0,"1677761084":1161.6227767245,"1678691482":0,"1680726791":0,"1684031079":0,"1684868302":0,"1687003236":2105.7761215397,"1687104096":0,"1687639369":1929.9086934334,"1688453804":1588.9690763997,"1689171801":2005.3737929084,"1689274423":0,"168963992":1431.6864980883,"1690861934":0,"1691357385":2071.3208991938,"1691609067":2032.4773038683,"1692006284":0,"169260234":2453.9054896968,"1692861209":1249.9086403595,"1693120207":0,"1693289551":0,"1694505048":0,"1695696277":0,"169616499":1360.2184128413,"1697433369":2341.4506355884,"1697537146":1909.5535861652,"1698302709":2385.8072128533,"16997305":1708.812923679,"170017720":1165.2135167215,"1700620911":0,"1702334810":1871.3112059413,"1705265155":0,"1705502932":0,"1706210690":0,"1706598413":1303.022570497,"1708402068":2258.0069047781,"1709397559":0,"1709868853":1959.2696201953,"1712826586":2302.4005640818,"1713279396":1355.9817184778,"1714015866":2310.3824631335,"1715714434":1287.9002757199,"1716064379":0,"1716121258":0,"1716454945":0,"1716625654":1525.2146106195,"1716876773":0,"1717721751":0,"1717938721":0,"1721774399":0,"1722855645":0,"1723985703":2315.0547336936,"1725183127":1705.2545641354,"1728101846":1323.8236471852,"1729126971":0,"1729291424":1642.1446933109,"1729563423":0,"1729632427":0,"1730213489":2348.5159376523,"1730633271":0,"1732202044":1222.2354919459,"1733046404":2079.1911227043,"173367747":2127.5100545681,"1734419421":1629.5416832545,"1735669790":0,"1737160601":2134.5448970405,"1737197781":0,"1737726232":1316.2046992429,"173858556":0,"1742391300":1375.0376362104,"1742923454":1799.4635458535,"174306863":1225.3601348675,"1744896373":2126.6864346508,"174800301":1982.5085994817,"174896176":0,"1749795074":1295.8868965907,"1750704590":0,"1751494517":1301.4167433184,"1751556023":0,"1752876661":0,"175297842":0,"1753460304":0,"1756727384":1606.2185826486,"1757313368":0,"1757955047":1610.569398159,"1762249323":1402.0863615706,"1762990534":2185.5444704515,"1763436987":0,"1765623393":0,"1766481102":1257.8344655358,"1767826160":1929.3184180196,"177009894":1257.1556875655,"1770113758":1333.192050397,"1770146920":0,"1775341601":2312.9919953644,"1777414306":0,"1779691327":0,"1779771436":1735.8505509901,"178132881":1973.7407637067,"1782593021":1140.0534541481,"1783870964":1317.2976846981,"1784467838":0,"1784527717":1397.9519549403,"1785363546":2030.1021023033,"1785554828":0,"1785562293":1608.577875807,"1786275394":0,"1786656286":1548.4678056182,"178669910":1386.3256313989,"178720857":2415.7434855724,"1787510201":2583.9006314254,"1787879890":1396.5448074496,"1788564041":1805.5947071171,"1788773531":1464.5254961488,"1791591007":0,"1795607316":0,"1796150705":1874.6468976233,"1796587921":1924.964639491,"179744631":0,"1799515663":0,"1800599582":1495.3186477678,"1801481840":0,"1802692575":2189.3802630548,"1808561792":2005.2755755378,"1808920633":0,"1809536358":0,"1810947088":1854.0126399812,"1811191434":0,"1811529317":2566.5910742837,"1814552069":0,"1815012340":0,"1815395495":1926.7059583253,"1816159434":0,"1816814719":1563.2283814548,"181840890":1337.8472367494,"1819395589":1860.742934291,"1821672989":0,"1821812912":1547.0385279086,"1823999301":2078.5417326415,"1825399219":1904.2279434479,"1828505458":0,"1829348697":0,"183030256":1382.6941570342,"183184140":0,"1833766982":0,"1834196732":0,"1837402011":0,"1837734149":0,"1839844018":0,"1840192802":0,"184027593":0,"1840572711":1999.1208076854,"1840603422":0,"1843086828":0,"1844354140":2464.5077611012,"1844925263":0,"1846293530":1408.7923640745,"1848363653":0,"1848372638":0,"1849060569":0,"1850684924":0,"1850921957":1350.5883729249,"18516592":0,"1853031865":1917.1049672432,"1853208613":1172.0548998046,"1856172895":1917.2145829853,"185620528":1487.5826663483,"1856992647":0,"1857363494":0,"1857526630":1797.5851607225,"1858278973":1945.5095833982,"1858334582":0,"1859819274":1680.82425993,"1861285155":0,"1862854561":0,"1863065807":1277.8260125315,"186354366":0,"1866851323":2029.4024513478,"1869987706":0,"1871665913":1498.1542511841,"1872112615":0,"1872306454":0,"1872693779":0,"1872980159":1570.8347522104,"1876544260":2483.9435767299,"1878147567":1894.5496928891,"1879020884":1545.9654593951,"187940940":2208.5532172086,"188352287":2481.8722909195,"1888433713":0,"1890921841":1496.6441112156,"1894806233":1214.542864891,"1895265333":0,"1896099954":0,"1896286191":2201.6219336792,"1900062857":1294.7724244077,"1901788005":0,"1903617238":1839.9203623221,"1907819963":1279.7669712099,"1908656857":1294.2819324126,"191054580":0,"1910869482":0,"1911968707":0,"1912276022":2096.6098086765,"1913049602":1718.8256321624,"1913093520":0,"1913772288":2023.4303440211,"1915453170":1152.1494742874,"1915472102":2172.3890687963,"1915862517":2768.8154223451,"1916011706":0,"191620507":1314.8600143277,"1916400350":1916.0689858272,"1917964581":0,"1918172852":0,"191868779":0,"1922249884":1348.577010609,"1924690238":1787.2310751136,"1927271954":1241.5775825621,"1931269506":1314.3600610974,"1933270834":1358.3561730566,"1934109716":0,"1937730923":1540.5750839091,"1938120357":0,"193891104":0,"1939591666":0,"1940606693":0,"1941288004":0,"194431856":0,"1944526967":2040.5621123027,"1947285534":1507.1617507911,"1947586492":0,"1948562758":0,"1950501535":1680.1353258588,"1950962783":2272.1122260637,"1951198460":1828.6438563573,"1952470548":1187.1344261572,"1953428992":0,"1953613506":0,"1954801587":2000.8441804448,"1955132435":0,"1959436312":0,"1959774558":2133.1003195919,"1959869314":1544.8391626032,"1959906977":1141.2363999461,"1961138257":2530.6905139914,"1962061945":1912.1926699881,"1962441710":1563.9451046163,"1962595835":1260.9112824221,"1964424077":0,"1965294189":0,"1965686195":1752.2621077596,"1965849899":1784.3506628869,"1966056783":0,"1966082997":0,"1967582342":0,"1969742700":1208.0417047337,"1970717834":1333.3138174157,"1971257507":0,"1972717643":0,"1972718658":1962.2005269503,"19753391":1519.2070276362,"197546078":1280.2941647587,"1975607113":1938.0586460002,"1977084622":0,"1977813892":0,"1979291413":0,"1980479000":2146.639581998,"1982730574":1157.6407631819,"1983440257":0,"1987916479":0,"1988055821":0,"1989002691":0,"1992185659":0,"1992807056":0,"199553622":1254.8626139269,"1995566378":0,"1997275023":1607.0005715974,"1997404036":1759.2287478055,"1997507835":0,"1997987860":2091.3820373571,"2000679742":2115.0911494487,"2001412357":0,"2001540741":1762.0307532652,"2003223492":0,"2005932973":0,"2006213514":0,"2006522396":0,"2006725411":0,"2007370712":1282.5186784876,"2010735377":0,"2011226653":0,"2011811439":0,"2012204931":0,"2012982950":1793.3037316825,"2014057820":1565.2483424929,"2015120605":0,"2015814436":0,"2017058203":0,"2018559703":0,"2018741992":0,"2018971200":1327.0282989915,"2019191135":1720.7470612766,"2021188790":0,"2021376917":1663.1853149056,"2024934932":1701.5735371897,"202527271":0,"2025736930":0,"2025960825":0,"2027773900":2178.4249114144,"2028541392":0,"2033240857":0,"203427637":0,"2035240287":0,"2035720970":1867.9916069568,"2036550762":0,"2036642817":1259.949137745,"2037819195":0,"2037923639":0,"2038074520":2292.1434666805,"2038782260":1787.4514432151,"2041342956":1734.8208369949,"2043678372":1286.7934718934,"20438516":0,"2045578042":2000.8021428612,"2046332745":0,"2046402802":1692.5884631801,"2048723677":1599.2720584736,"2049140185":2540.438150736,"2050291763":0,"2051026474":0,"2051273831":1262.100652797,"205364228":2027.3839266711,"2054972194":0,"2055099648":1249.2572200035,"2057048497":2276.4233585631,"2057246561":0,"2059004815":0,"2060154218":0,"2062472427":2281.8816902545,"2063386346":0,"2066655774":0,"2066860654":0,"2068027715":0,"2069508857":0,"2069762192":1962.3314335449,"2070962878":2104.7441214305,"2074201652":1574.7542247682,"2074713320":1530.6451141787,"2076283496":0,"2077283915":2132.06233459,"2078083870":0,"2080495144":2460.3152437576,"2080861390":0,"208434464":0,"2085579974":0,"2085973602":0,"2086212420":2034.9740902393,"2087368801":0,"2088822497":1203.0737869081,"2088911620":1947.8832856412,"209121812":2051.0879431258,"2093417498":0,"2094034129":0,"2094685164":0,"2097099950":0,"2099267983":2014.2979320644,"2100511060":0,"2101009140":0,"2102124703":1521.7133617698,"210217684":1358.152613403,"2105184024":0,"2105190288":0,"2106508430":0,"210734267":0,"2107686904":0,"2108728330":1614.4877804672,"2109002994":0,"2109320577":1317.4638832497,"211245592":0,"2113446044":1928.7961204946,"2115947356":0,"2117244239":2158.7683843245,"2117678052":0,"212097244":0,"2122371082":0,"2122542522":0,"2123032733":0,"212376193":1730.3052054913,"2123999060":0,"212627710":1809.8192888474,"2129258263":0,"212930587":2250.2578740769,"2130827066":2857.6543956169,"2131267381":0,"2135327933":1417.3934930077,"2135431142":2559.4351004238,"213777418":0,"2137857715":1611.7621820686,"2137931406":0,"2138367939":0,"2140116935":0,"214184041":0,"2142283134":0,"2143044442":1861.4906863586,"2144998386":1877.8983358307,"214508087":1370.4186698287,"2146548018":1387.9431104106,"2147315027":0,"2147986859":1308.9617729374,"2150121610":1541.348438509,"2150479645":1624.9775945043,"2152298441":0,"2153157695":1628.5072578803,"2153390386":0,"2154511916":0,"2154696316":1223.3861903833,"2155229246":1868.9864493463,"2155696628":0,"2156152723":0,"2160714813":2100.3248877105,"2161204569":1317.9207508583,"2162382478":0,"2164084926":0,"2164343480":0,"2165999334":0,"2167794143":0,"2168242954":0,"2168825861":1231.999241335,"2169396423":0,"2169721379":1724.394164934,"2170025879":2381.625583289,"2172902585":0,"217467576":0,"217546662":1500.8381829812,"2176047848":2036.7206020719,"2180877898":0,"2181231700":0,"2182253577":1994.3618892548,"2182388811":1588.3835994255,"2182831583":1678.5871762113,"2184297331":1233.5034839998,"2184686055":2455.8244137907,"2185596896":0,"2185644087":0,"2187172880":0,"218781353":1897.1863301576,"2188606245":1231.6157956848,"2191074840":0,"2191726075":1835.4868365659,"2192121612":0,"2192706389":1365.2269076492,"2193040547":1213.4070467355,"2193251345":0,"2194073999":0,"2194441263":0,"2194831616":0,"219694070":2324.1192580053,"2197356984":1648.3540381514,"2199036891":1401.2246983038,"2199938357":0,"2201727713":0,"2201981126":1505.82499953,"2203655753":1786.9268132617,"2204380301":1396.1044458638,"2204914887":1841.4067816266,"2205913729":1530.495439788,"220599685":0,"220667062":1333.2008827592,"2206719747":0,"2207624249":0,"2207905219":0,"2208494667":0,"2208585097":0,"2213463441":1985.2417520906,"2214262554":1880.5909929633,"2214824906":0,"2216360450":1837.8252904904,"2220648902":1786.688543054,"2222019296":1561.0553908973,"2226311468":0,"2228358934":1701.4341867571,"2230494217":0,"2232175898":0,"223285376":1206.5675296817,"2235555306":1504.8237159326,"2235724788":0,"2235840093":0,"223690290":0,"2238247137":0,"2240198172":2405.3375364501,"2240876068":1897.3309169423,"224100421":2978.7961959355,"2244707838":0,"224630615":1940.2116985812,"2247018180":1334.5708444649,"2247565255":0,"2248212771":0,"2248507270":2220.0903365738,"2249312740":1490.2370387981,"2249355269":1281.9771427903,"2249490":0,"2249718139":1793.8027487553,"2249810515":0,"2251334448":2381.479024858,"2251945224":1933.2169470617,"2252317011":1702.4962514406,"225263285":0,"2254789488":0,"2255777157":0,"2256129159":0,"2257250428":0,"2257308276":0,"2258141933":1850.4091449367,"2258165342":0,"2258623827":2190.1757477854,"2259000228":1436.3892315914,"2259176301":0,"2260151323":1748.1339100823,"2262588000":1332.622596763,"2265344721":2203.5694828019,"2265657217":1822.1301265412,"2267593455":0,"2270005002":0,"2272805308":1255.9002796024,"2274658324":1317.9521104466,"2277934665":0,"2279246890":2038.8592725467,"2279730191":1676.5007365375,"228115268":1549.9747683007,"228284311":0,"2284449411":0,"2285069816":0,"228551495":2277.7923804151,"2285522737":1181.5839867359,"2285940610":0,"2287172046":0,"2290049338":0,"2291083428":0,"2294942579":1873.0367582475,"2295408709":0,"2296253743":0,"2297518953":2327.4743300299,"2300589345":0,"2301924247":0,"2302244531":0,"2303671714":0,"2304874524":1674.5365205597,"2305702963":0,"2306188300":1207.7810914125,"2310137574":1152.1377893605,"2310396":1377.1913915125,"2310675124":0,"2311001320":1472.7864965062,"2312427727":1322.8302750313,"231349873":0,"2313819845":0,"2313861896":0,"2314357296":0,"2315979719":2711.8717381409,"2316551160":1779.8364613072,"2317418982":0,"2318221471":0,"2320468943":0,"2321187859":0,"2321482871":1346.9594471871,"2321691552":2486.2339675701,"2321913205":1711.4873176824,"232328045":0,"2323533689":1260.8697515006,"2324786150":1392.6601629182,"2325031714":0,"2329981708":1246.0341186297,"2330175182":0,"2330317080":1435.9559888935,"2330484730":0,"2330647155":0,"233297408":1278.0092842613,"2333592799":0,"2333659184":1360.0511262593,"2335420481":2444.6660756903,"2335538835":1896.1411567598,"2335778252":0,"2336939814":1405.5786892723,"2337606731":2060.0720834082,"2338718635":0,"2340825815":0,"234098869":0,"234159120":1558.4971807039,"2344727128":0,"2347359100":0,"2347660974":1979.9454101467,"2348343671":0,"2348993490":1460.9105672071,"2351647332":0,"235206650":1428.1443796872,"2353125510":1483.8137189709,"2354481551":0,"2355594556":1867.8619694847,"2355716390":1324.1714505166,"2357679638":1845.6611654401,"236080983":1931.7335479582,"2362247131":0,"2363229918":0,"2365177563":0,"2365828386":1229.4850365142,"2368071046":2175.1190473433,"236837608":1875.4217845362,"2368750036":0,"2368832701":0,"2369389100":1361.5824742947,"2369595129":0,"2369761961":2036.7410194704,"2370285073":1765.5654059263,"2370755498":2057.4788263111,"2371431943":2277.3595662538,"2371969629":0,"237326824":2364.3455634374,"2373279761":0,"2373608335":0,"2374166461":0,"2374192694":0,"237462896":0,"2375501212":2448.4455464535,"2375816517":1607.7036437819,"2376531005":0,"2377767456":1694.433951503,"2380816309":1198.5705825982,"2383026168":0,"2383092679":1489.7210915287,"2384194086":1207.3151378208,"2385909936":0,"2386103127":1354.1247827015,"2386809488":1270.0775640451,"2386982504":1712.4010133221,"2388556480":0,"2390584088":1354.5231125217,"239079794":1928.2304187946,"2391605505":0,"2393134541":0,"2397274802":1609.7858209851,"2398941022":1395.9639246414,"2400947874":2152.8032001597,"2401052346":0,"2402216688":0,"2404871340":1336.9494482313,"2405342085":0,"2405658749":0,"2406786533":0,"2407589215":1931.0849921121,"2407640855":0,"2408289758":1172.5106645463,"2409750542":1908.3866125757,"2410692850":1541.3741526845,"2412340751":1646.1765343383,"2413930996":0,"2415029607":2571.552028121,"2417537933":0,"2418375843":0,"2420716906":0,"2420933825":0,"2421996109":0,"2422059385":1915.2628132733,"2422080240":1418.8205349928,"242229728":0,"2422423692":2053.354609292,"2424933436":0,"2425741756":1725.1995150882,"2428818859":1561.2655635205,"2430051677":0,"2430259702":1714.6960124182,"2431129875":0,"2433168244":0,"2434134348":1490.8990184504,"2434964692":1443.2353621969,"2436117632":2610.0826855063,"2436413676":1836.536348078,"2436753495":1432.9593207076,"2442045936":1341.2659819842,"2442896853":0,"2443834680":0,"244758471":2135.5738659086,"2448413931":0,"2452001178":1161.8236318927,"2453198602":0,"2455085538":0,"2457264374":0,"245796778":0,"2460331500":1702.4387527636,"246275746":1523.4113866454,"2464323261":1389.331169471,"2465331178":0,"2469022748":1273.0588534723,"2469933695":0,"2471701670":0,"2471898191":1979.1323403633,"2473812468":2363.5096568214,"2475848461":0,"2479293617":1855.377046154,"2480987547":1302.7005460171,"2481240580":2607.9418744903,"2481973138":0,"248789391":1851.7255023016,"2488004222":0,"2488135056":2529.5251086936,"2491402608":1191.3681720998,"2492032151":0,"2493144905":0,"2493499746":2147.1828941776,"2493528114":0,"249363528":0,"2494605157":0,"249521607":1633.6202302555,"2496465634":1428.712905903,"2499674936":0,"2500271603":1540.2351411176,"2500987303":0,"2502228330":0,"2502903776":0,"2503581045":0,"2503951076":1407.5442381391,"2504097527":1751.5101577001,"2504384020":0,"2505184572":0,"2509232431":0,"251006919":2022.3137128296,"2510392129":1990.2800994214,"2510517613":1521.1616133347,"2511234285":0,"2513347763":2217.8090802563,"2513980161":1501.1152614679,"251533366":0,"2515340929":1155.4545579447,"2519726489":2433.3767704629,"2520941920":1364.6787168645,"2521216381":1652.5809810428,"2521310070":1324.5320836804,"2523329139":0,"2523374000":0,"2526467539":2241.5199974312,"2526914852":0,"2529461898":2015.7291888336,"2529652202":0,"253015942":0,"2530621646":2233.963903408,"2531808875":0,"2532000263":0,"2532136306":0,"2532708840":1695.2832486322,"2534016591":0,"2534323731":0,"2534500893":0,"2534714311":1591.4725328821,"253585197":1880.4226853663,"2541052146":0,"254218602":0,"2542321733":1919.1749818083,"2544348147":1166.78818332,"2546467088":1883.3541964032,"2548029026":0,"2548478453":0,"254983687":3018.4940165727,"2550811240":1266.341468955,"255204169":1260.870208308,"2553352145":1404.1839222,"2553787403":0,"255657392":1693.4495728383,"2559668419":0,"2560027362":2001.2074132383,"2560538129":0,"2562103296":1351.4184681108,"2562869066":0,"256288757":0,"2563069268":0,"2563394539":0,"2569057399":1241.5396695569,"2570139767":0,"2572143666":1335.0295688697,"2572232151":0,"2572461200":0,"2572867035":1184.795721284,"2573075022":1772.9528456848,"2573211912":2396.6770372863,"2574605858":0,"2575372610":0,"2575656476":0,"2576790821":1519.1715594347,"2577818967":0,"2578391134":0,"2578600625":1249.8425270142,"2579010831":1663.2612318917,"2579112355":0,"2579491041":0,"2579679937":2432.713399111,"2581904260":1154.828067979,"2582233376":1234.7692637513,"2582430711":0,"2583029056":1896.4053993495,"258313482":0,"2586044711":1412.3053230205,"2588374358":0,"2588489114":1697.2356875149,"2589865335":0,"2590774847":0,"2591484771":0,"2595565556":1303.3201984827,"2595697191":1169.4209117977,"2595882232":1969.9845549158,"2597701503":1151.5250329621,"2598780139":2219.3465296423,"2599242307":0,"2600147563":0,"2600262554":0,"2600395028":0,"2603031099":0,"2604144466":0,"2604690450":0,"260479518":1843.2383664194,"2605448197":2449.1323757838,"260623190":0,"2606916888":1454.3901912166,"2609641077":1651.5845871727,"2609962764":0,"2610426510":2376.8658923518,"2610864298":0,"2610865464":0,"2612530279":1675.761234741,"2612627798":0,"2613694816":0,"2613974860":1896.7975214446,"2613979956":1483.3041242255,"2615198346":0,"261533544":1954.2533254344,"2616191739":0,"2617125781":0,"2617837584":1448.1207963663,"2618479578":0,"2618637580":2391.657270733,"2619603225":1526.2429110307,"2621107821":1187.1641565458,"2621480860":1250.0975318308,"2622232119":0,"2626303746":1386.1200017827,"2626440500":0,"2628400239":0,"2628574755":0,"2629528696":1347.5885281778,"2629734466":0,"2630527363":0,"2630992864":0,"2631177392":0,"2631196608":1990.7738526153,"2631420913":1998.889914712,"2632738906":2164.8287157213,"2633929455":0,"263409464":0,"2634124873":0,"2634383093":2133.9592509012,"2634690453":0,"2635424294":0,"2636727819":0,"2637994881":0,"2638444930":0,"2639105050":0,"2640785054":0,"2640877802":0,"2642386680":0,"2643077516":0,"2643883804":0,"2645404069":1532.3349133769,"2646645546":1436.1125054038,"264755561":0,"2648057035":2615.1468269481,"2651582555":0,"2651875294":1643.1325351423,"265213405":2381.2160234811,"2652913230":0,"2653876812":0,"2654590324":1659.6231386056,"2654831659":0,"2655169339":0,"2655862888":1245.2999833877,"2657502607":1392.3629194433,"2658427199":0,"2658657252":0,"2659424902":0,"2660105967":0,"2661403855":1533.3376144199,"2661850381":0,"2661929533":1377.6120218199,"2664015237":1504.9263037499,"2664544460":0,"266469116":2561.7794931859,"2665985011":0,"2666352866":1328.7281033317,"2668311333":1891.8455273506,"2669738738":1435.3564963722,"2670146102":0,"2670735101":0,"267105112":0,"2671757819":1817.5282352022,"2672352527":2507.9960044659,"267246445":2581.9961985753,"267587420":1257.1166915286,"2676463244":2619.7016189999,"2677897468":0,"2678350009":1710.3243520032,"268029565":0,"2680668911":0,"268097121":1721.1964988483,"2681170798":1269.8118442786,"2681795867":2124.0317207867,"268274286":1759.0197295594,"2683746085":0,"268471907":1822.3170524016,"268498493":0,"2687486440":2362.6480880348,"2688493082":1762.3115124143,"2688612867":1184.4264833435,"2689567416":1188.6470369782,"2690606528":0,"269077288":0,"2691544887":2024.3797833173,"269219514":0,"2692580018":2071.6322841217,"2693685785":1509.5432131875,"2694109670":1405.7482709086,"2694237057":1242.6172898768,"2695383302":2184.5241011615,"2695613806":1496.1462748679,"2697040026":1294.0257382852,"2697534725":2069.7848729824,"2698936427":0,"2699690813":0,"2701115423":1889.4554322242,"2704310299":2053.7468090497,"270435993":0,"2705053633":0,"2709105566":0,"2710343893":0,"2711761019":2479.3282985529,"2711929003":0,"271335539":2034.9420578559,"2714484334":0,"2715109000":1559.9709348417,"2715798469":0,"2716044195":0,"2716169684":0,"271664224":2069.4030284676,"2716747123":2022.4752963768,"2717395786":0,"2717768736":0,"2718567180":0,"2719065978":2092.0222850837,"2719330296":2561.508149216,"2719928959":1619.505461912,"2720318685":2758.9704056427,"2721035468":1533.9285875234,"2721924500":0,"2722367436":1782.9801784101,"2724880133":0,"2725160392":1637.0082208814,"2726967243":0,"2730930360":1763.6404758359,"2731154173":1654.0793660142,"2731213430":0,"2732657659":1596.9852244916,"2733655053":0,"2734248382":1709.1461451873,"2735085930":2096.6201393558,"2735293288":1430.3429533629,"2735453204":0,"2736390850":0,"2737172644":0,"2737402297":1369.614440152,"2741739967":0,"2745040429":1678.6245760413,"2747291591":2395.8765531206,"2748231496":0,"2748555921":0,"2749155125":0,"2752494454":0,"2754272500":1324.1757200103,"2754546565":1248.7224675206,"2756999860":0,"2757319898":0,"2758231762":0,"2758653794":0,"2758696959":0,"275986604":1865.3441063734,"2760734604":0,"2762853048":1975.5726300727,"2764953948":0,"2765939834":1234.7084656358,"2768437968":2358.9669560824,"2771270445":1708.7056764058,"2772237177":0,"2772831251":1759.0470795449,"2774491833":1429.9599761889,"2775325601":0,"2775344327":1387.7347071166,"2775508810":0,"2775921161":0,"2776150092":1881.6810367589,"2776357853":0,"2777625264":1521.1768537583,"2777743854":1860.5166780235,"2782100417":0,"2782517328":1850.8490524791,"2782890042":0,"2783546107":0,"2783905922":0,"278391428":0,"278493845":1541.7840320661,"2785029557":0,"2786534786":1690.1655236843,"2786999216":1371.8092952004,"2788838402":1786.4753467293,"2791285030":0,"2792312732":1444.2068009303,"2792663761":0,"2794667518":2429.6705422448,"2795839755":0,"2795952868":1467.7383709213,"2796999710":0,"2797831681":1268.5768566953,"279921423":0,"2799632565":2476.7727985927,"2799898824":0,"2800289700":1856.6336926997,"2801113468":1453.1833769825,"2802523525":0,"2802681137":0,"280396343":1268.0287696194,"2805340615":0,"2806136994":2231.8099102949,"2806558939":1876.3611046625,"2806765401":0,"2809882420":1562.9186033202,"2810226521":2040.539289037,"2811110978":0,"2811209697":1279.7894769956,"2812871030":1746.135917977,"2817202669":1420.3698647434,"2817465096":1876.3854625677,"2818199514":0,"2818493377":1613.2485081262,"2818810857":0,"2818984798":0,"2819110526":1885.9015646531,"2821066759":0,"2821965653":1257.7670945029,"2823295914":0,"282466705":1752.9555725796,"2826164889":0,"2827089777":1855.561153694,"2827658293":0,"282802217":1362.7144100401,"2829216648":1355.3825442341,"2829252669":0,"28298643":0,"2832741065":0,"2832770135":0,"2833016658":2129.7051442916,"2833179922":1249.4294341104,"2833491097":1455.8516200241,"2835500769":1351.6909336495,"2836143893":0,"2836390896":1242.9383307344,"28373825":2157.5814371481,"283849083":0,"28387341":1868.9146755896,"2841712876":0,"2841881996":1198.4180401014,"2844126076":1259.5707438932,"2844316244":1207.7491943483,"2844666696":1315.4085759361,"2844670670":0,"2844675085":1307.5663523368,"2845488076":2575.9570281316,"2845865407":0,"2845929476":0,"284708083":2392.0799451298,"2850260537":1446.4280778775,"2851269000":2294.8289305714,"2853983730":0,"2855675520":1360.421258727,"2856501208":0,"2857257236":0,"2857979415":2077.5054883516,"2858385254":0,"2860419980":1369.0053354603,"2860632733":0,"286069565":1460.9610936441,"2860849459":1882.0842446557,"2862855056":2170.1079846744,"286585708":2272.4412003208,"2867135222":0,"286718649":1817.0597073686,"2868656571":1623.9443250479,"2871847316":1562.7212466716,"2874032831":1532.2539947529,"2875235685":1244.8064626533,"2875388393":2068.806637566,"2877331205":2221.7336557442,"2880212557":0,"2882449995":0,"288305998":1381.2168789318,"2885795135":0,"2887178574":0,"2887492330":1550.4297615307,"2887872471":2397.9722495587,"2887915717":1602.7242171967,"288912613":2610.9906730644,"2889905668":1680.0815931601,"2890033615":0,"289054660":1307.3265298181,"2890702645":0,"2891293644":0,"2893112489":0,"2893302110":0,"2894413444":1664.7703749741,"2894984014":0,"2896936333":2118.7923652824,"2899114132":0,"2900835893":0,"290394387":1337.6115578703,"2904534885":1983.70440706,"290469472":0,"2906372689":0,"2906626601":0,"2907430999":0,"2907477166":1218.9011436003,"2908043044":0,"2908242202":2640.3824813624,"2910887198":0,"2912571228":1808.5754920785,"2912901265":0,"2913358439":1249.7515196656,"2914198967":1641.9424376927,"2919642920":1913.6704728453,"2921275572":2533.7796160302,"2921363389":1871.8245218615,"2922912159":0,"2923349215":0,"2923893711":0,"2924722129":0,"2925535868":2765.2533837781,"292566381":0,"2927708041":0,"2929435421":0,"2929737515":0,"2931755222":0,"2936931094":0,"2937149161":1216.9550221615,"2937224937":1405.8442434352,"2938025699":0,"2938169108":0,"2939618078":1626.3266982141,"2939895760":2502.5176603922,"2940442922":0,"2941821802":1228.630993648,"2941915891":1286.3167937403,"2942569006":0,"2942833315":0,"2945497882":0,"2945726008":2647.8258771458,"2945975892":0,"2946534771":1201.7686271329,"2948030094":1214.703724776,"2948668320":1473.7057465272,"2949409019":1337.3722299775,"2950336182":2076.8975497986,"295088238":0,"2956439807":2328.4294689238,"2957762475":0,"296151509":2364.3930657709,"2962478235":1274.7596170193,"2963413938":2081.8087755451,"2964379464":0,"2964689219":1808.787108831,"2965139328":1426.7144554733,"296740468":1655.6433885989,"2967621636":2225.3877535768,"2970227389":1282.4111853142,"2970771602":0,"2972412900":1548.0854419238,"2972764344":0,"2974872053":0,"2975776867":1164.5575871589,"2976472096":0,"2977235574":1556.8824239708,"2980355580":1558.1421869292,"2981004463":2539.863726397,"298215454":2126.1931814161,"2982198446":1324.3520304377,"2986133546":0,"298794774":0,"2988189921":1193.9819783429,"2988782714":2079.9846866239,"2993182441":0,"2994488407":0,"29974146":0,"2997800679":2389.9634276167,"3000728502":1479.0110934646,"3006111591":0,"3006434957":1328.513147726,"3007102778":1489.0102202162,"3008054233":1226.2960135431,"300846689":0,"3008885805":0,"3009824135":0,"3010901510":1405.0021415178,"3011717282":0,"3012034950":0,"3012401904":1324.2140587436,"3013367275":1263.2728668041,"3014957498":1364.154859918,"3015354306":2457.115574186,"301567212":2056.2598215101,"3016140328":0,"301734990":1648.341757882,"301753506":0,"3020603346":2094.592426537,"3021409572":1205.6698455508,"3021563284":1671.4657554194,"3022128117":0,"3022905195":0,"3023056451":1265.8320564115,"3023068102":1845.0428731248,"3023386017":1989.5369509422,"3024031273":1794.6129370985,"3026486305":0,"3029042062":1235.9216009709,"3030939616":0,"3033578529":0,"3033778664":0,"3036629795":0,"3036702868":1413.0376809608,"3037047822":1248.8026990632,"303821987":1376.4549624575,"3039372847":0,"3039695626":0,"3042113223":0,"3042599528":0,"3042739559":0,"3044209556":1246.0141927368,"3048586035":1115.8258444602,"3050888295":0,"3052741649":1491.4638194905,"3052763610":0,"3054721758":1199.2392672964,"3054917007":0,"305518406":1264.4778916192,"3057194499":1176.4547272896,"3057254301":0,"3057587548":1802.2256875356,"305762053":2092.4861692502,"305789656":1167.0749837258,"3058790867":0,"3059718647":0,"3061824471":2558.3297484354,"3063296642":1569.1579260438,"3065232387":0,"3065742618":1873.0424923433,"306595116":1640.9591585343,"3066842082":1288.1970048184,"3067908479":1953.137726744,"3071090507":0,"3071565639":0,"3072879804":0,"3073027638":0,"3073583780":1414.4918812526,"3074518984":1246.3593898992,"3074557522":0,"3075022101":0,"3077002187":1461.2892510067,"3077217367":2048.0976546787,"3077259720":1722.3088173214,"307769453":1817.224026292,"3078556108":0,"3078609754":1144.9508874557,"3081794904":2198.3290662783,"3082325802":0,"3085208156":0,"3087387634":0,"3089019377":0,"3091785544":1231.8671440198,"3092398094":1405.123188264,"3092850192":0,"3094069966":0,"3094793771":0,"3098562302":1718.9772466681,"3098982613":1271.7055549365,"3100993645":0,"3102719435":2158.8988728254,"3102780834":1432.0967926378,"3104122930":2284.4463940346,"3104482374":0,"3105635512":1938.2224916289,"3105899717":0,"3111378170":0,"3116000782":0,"3117661899":2050.715977457,"3118022376":0,"3118895370":2368.6674771307,"3119137809":1240.829758176,"3119606051":1633.1789521619,"3121754844":0,"3123299347":0,"3123575090":2210.3503183571,"3124896474":1913.930869473,"3126143245":0,"3126153106":1282.1502428906,"3128004049":1380.0192844155,"3130296264":0,"3134274088":0,"3135227116":0,"3135662522":0,"3136260573":0,"3137406326":1360.3005775112,"3139221174":1382.5129151601,"3143101757":1548.1751146981,"3144113364":1438.223135905,"3147357769":1199.4477805501,"3147772108":2621.1208072273,"3148467486":1665.1885910815,"3152421262":1731.5555445321,"3153044061":0,"315307043":2346.5717839654,"3153125580":1357.6553050616,"31547081":0,"3156996757":1405.8938478338,"315817700":1300.9041426403,"3158353268":1375.4261931199,"3158438690":0,"3158785397":0,"3163189151":0,"3164365433":1501.6846714598,"3165325622":0,"3167447804":0,"3167797510":0,"3168538687":0,"3168618130":1293.4904281819,"3168914756":0,"3169129420":0,"3177194252":1192.9770230345,"3178253488":0,"3179731139":0,"3180919205":0,"3181284261":0,"3182582646":1295.0947625986,"3183111073":1344.226133202,"3183288856":1306.2821637677,"3183331658":0,"3183792133":2499.5640490579,"318431049":0,"3184596428":1945.7515607928,"3184774485":1295.4970938463,"3187405082":2709.4067070911,"3188904029":1672.1678031263,"3189584402":1257.7082143289,"3189918628":0,"31900963":1345.737168609,"3193935538":0,"319427731":2011.3542735398,"3194441729":0,"3194493363":2246.8671174565,"3196334031":0,"3197252162":0,"3197325121":0,"3199967964":0,"3201195359":2145.183995267,"3202447407":1911.7063530593,"320329751":0,"3203568204":0,"3205928742":0,"3210489850":0,"3210707661":0,"3211790430":1536.5893223179,"3214093273":0,"3214600049":1636.6877598712,"3216210693":2043.1015779104,"3216682975":0,"3219095278":0,"3219158198":0,"3221082803":0,"3221190981":0,"3221222128":1499.3290269267,"3223207411":0,"322371543":0,"3226814527":0,"3228686257":1917.4314822412,"3229303052":0,"3230369611":1744.7611048301,"3231265233":2068.0043466118,"3231924477":0,"3233473889":0,"3235710031":1892.1600619469,"3235832569":0,"3236532355":0,"3237331717":2070.2102619334,"3237851921":1979.1112273597,"324121992":1508.1169489285,"3241642216":0,"3241798110":0,"3241941552":0,"3243357093":0,"3243386336":0,"3243872254":1264.2868345638,"3246372293":1348.670191438,"3246928465":2275.7337818748,"3248412457":1496.2502937005,"324872429":1203.7504950404,"3248742764":0,"3248828921":0,"3250155411":1580.3620959714,"3250523305":2286.1378742318,"3250902571":1450.0534545623,"3254374161":1447.0268321102,"3256507952":2116.3244842355,"3257900717":0,"3259259158":2350.0380300939,"3259782681":0,"3261146465":0,"3261672467":1679.2607152001,"3263150913":0,"3263342549":0,"3263418042":0,"3263594037":1777.3786570233,"3267047320":1541.6176288991,"3268382520":0,"3270667849":0,"3272610079":1536.7018543075,"3275619185":1806.5891699944,"3281498525":1428.6729861424,"3282812734":1407.9870845299,"3283031002":0,"3283376524":0,"32848909":1234.058537565,"328764621":0,"3288770916":1242.4710735813,"3290623649":1175.5552151972,"3292003032":0,"3292459840":0,"3292775470":0,"3292810974":1658.6836278802,"3294328613":0,"3298734473":1822.9768689716,"3300902320":0,"3301142471":0,"3302229375":0,"3302467434":1952.7073399331,"3302810206":0,"3304159418":1804.5283324227,"3307683900":1992.0032292739,"3308257979":0,"330899243":1648.0880791614,"3309137757":0,"3309376526":0,"3312226061":1468.8739273624,"3313294758":0,"3314430913":0,"3314612233":0,"3315363657":1961.4987013156,"3315441800":1753.4775753993,"3315472808":2234.9191877602,"3317643285":0,"3319568401":0,"3320085335":0,"3320294201":0,"3321963457":1585.5793143983,"3325416067":0,"3328810166":0,"3329709268":1710.1120861153,"3331711837":0,"3332596820":0,"3334241084":2073.048019317,"3334808342":1370.6144908238,"333630853":1732.7813534239,"333667858":1361.6459603518,"3336959867":1834.868034709,"3337273246":1679.5737760149,"3337589064":0,"3340682501":0,"3340717494":0,"3341470372":1690.9043557462,"3343040098":0,"3344221047":0,"3346548045":1252.7479413966,"334656901":1256.0514740971,"3347724858":1355.5386161215,"3348324694":0,"3348466517":1179.1495967491,"3348570525":0,"3350592310":0,"3351145874":0,"335140403":1543.1204810684,"3353015937":1534.325005151,"3354310865":1221.8477681772,"3354474202":0,"335486990":1257.264923599,"3355469687":1749.5432375672,"3355865266":0,"3357587389":0,"3357632986":0,"3363218765":0,"3363685518":1768.9138093037,"3363896578":0,"336413363":0,"3364926717":0,"3365665787":0,"3369476122":2367.4705934718,"3370131507":1382.7178688716,"3370261058":0,"3371445858":1515.1162664342,"3372525938":0,"3374028315":0,"337441895":2020.6775180586,"3375593429":2175.7874705227,"3375672025":0,"3376280260":0,"3376945874":2109.9830154953,"3379746851":0,"3379897372":0,"3381061806":2695.809667046,"3382549811":1332.6187879411,"3383627644":2010.5524756946,"3383805178":1768.623896829,"3386206172":1383.775103528,"3386255965":1303.7347742929,"3386498966":0,"338661942":2356.5811122453,"3386819075":0,"3387998069":1969.2019235672,"3389539253":0,"3391560370":1631.338145683,"3396007304":0,"3397262203":0,"3397964824":0,"3398027261":1802.7875657754,"3400286463":1215.7827321325,"3402568700":0,"3403473925":1550.0978082682,"340499017":1217.1184374247,"3405519099":0,"340770494":2003.5794613668,"340860484":2011.9703133514,"3410974541":1352.7250049956,"3411465392":1118.1080334618,"3412927472":1300.8009461582,"3413400617":1502.2633100489,"3421555360":0,"3422315602":1695.0815222626,"3423908263":0,"3424505272":2197.0951445919,"3427404671":0,"3429532354":1797.7466000366,"343052836":1478.8676835951,"3430688223":1416.4124723866,"3430988573":2661.0670044656,"3431920158":0,"3432459628":1722.8129701098,"3433288749":0,"3433602336":1976.7214151234,"3434976181":2062.3601158741,"3435556540":2060.379991517,"3437227213":1195.7512695571,"3437839264":1480.1120711991,"3438031469":0,"3439053581":0,"3439295659":0,"3440205245":1241.9262857175,"3441921832":0,"3444219926":0,"344495691":1443.0697629277,"3444975876":1886.7040111218,"3445174361":0,"3445184694":1199.8592887103,"3445657861":0,"344756565":1632.0191837349,"344813892":0,"3448832663":0,"345204207":1578.8503818621,"3452861205":0,"3454110996":1421.9944676861,"3455944020":0,"3456273150":1425.9672522649,"3456823213":0,"3457051682":1601.511760532,"3458213369":0,"3458248889":0,"3460084752":0,"3460806368":2306.8472649456,"3461348977":1508.099765827,"3461834167":2681.7054310332,"3462463455":2449.3352959316,"3464418220":1590.547713663,"3464701651":0,"3465343":0,"3465409135":0,"3468018376":0,"3468116044":0,"3468213273":0,"3469207858":1933.9571917853,"3469541764":2374.1850487395,"3469926498":2230.1673059455,"3473351012":0,"3474039417":1696.8895579594,"3474428558":0,"3475686242":0,"3477058065":0,"3479390973":0,"3480413551":1567.6884942977,"3482467445":1566.2526716951,"3483377785":2419.5791089724,"3484001100":1404.7016862187,"3484470279":1919.6391896894,"348512996":0,"3488452469":0,"3489386729":0,"3489582959":0,"3489599803":0,"3491443766":1474.0150725665,"3492185165":0,"3492742379":1649.7120733311,"3492873499":0,"3495355750":1646.1943237127,"349650937":0,"3498345039":0,"3501115477":1379.3426970242,"3503134762":1851.2677996923,"3504355376":1711.1205064321,"3504693188":0,"3506344616":1480.1116248664,"3508427448":0,"3509092584":1227.91037348,"3509327992":0,"3510486381":0,"3510890976":2333.2401505813,"3513036702":2013.4354344791,"3514319037":2273.7910625337,"3518502488":1597.5718383661,"3519471521":2644.8498152558,"3520046805":0,"3520875014":0,"3521652117":1237.693464609,"3521871699":0,"3521973284":1583.3117784523,"3523871920":0,"352505600":1710.9105378431,"3525880478":0,"3527144196":0,"3527222391":2200.6623666057,"3528330030":1289.945159062,"3529094278":1521.9977490324,"3529472171":1858.9581916885,"353053828":0,"3531395010":1199.2892732505,"3532088940":0,"3532176892":2917.8273567322,"3532863467":2428.3242593838,"3533336381":0,"3534885957":0,"3535072903":0,"3535624008":1348.0079390256,"3536253643":2227.3896051956,"3537085768":0,"3537815146":0,"3541832045":0,"3544466917":0,"3544973036":0,"3547308658":0,"3547808888":0,"3548460508":1795.0422250815,"354880980":0,"3548853356":1574.0392121288,"3549637617":2666.668150845,"3549688121":2221.793185714,"3550553048":1414.4351202231,"3552570937":1573.824807946,"3552679614":0,"3553057842":1331.3935128035,"3553863174":0,"3554305488":2294.0981174197,"3554428052":0,"3554577128":1696.9920075471,"3554657564":0,"3555784215":1779.7001728541,"3556941422":0,"3557119705":0,"3558781406":1262.938740364,"3559784334":0,"3561342867":1604.5128423093,"3562926842":2466.8891773908,"3563762803":2424.6761561972,"3564822043":1227.3485530532,"3565117549":1790.5747006625,"3565951903":2005.5862669078,"3566296172":0,"3566729670":0,"3567189290":0,"3567330607":2422.3128048015,"3570284045":2198.4642973466,"3570621122":0,"3571222180":0,"3571447692":0,"3572615577":1450.5787293419,"3573276394":0,"3573894690":2019.9859462755,"3574045563":0,"3574084572":0,"3574185695":0,"3579143787":0,"3580394792":1967.3284576938,"3581728008":2087.2049275667,"358387829":0,"3585483303":0,"3588035361":1393.4123491817,"3589033912":1509.6237874441,"3589125798":1174.8589329736,"3590542886":1849.8122180044,"3590794345":0,"3593932314":1212.2309421538,"3595421528":0,"3596139981":0,"3597054857":0,"3597589308":0,"3597620749":0,"359765882":1899.6213866649,"3601789048":0,"360213652":0,"360478335":1396.8422030812,"3605537034":0,"3605700572":0,"3607071844":1760.9131492436,"3607938850":0,"3607948747":1274.6742564805,"3608105198":0,"3608687869":1486.764933431,"3608956462":0,"3609066875":1725.4481937307,"3609197847":1257.323514611,"3610450870":0,"3611656717":1362.6613797387,"3612436091":0,"3612858843":1396.4853538164,"3615735813":2258.6371797452,"3615890317":1462.4423844498,"3615903863":1326.4047670018,"3616385781":1876.146019008,"3619173359":0,"3619796334":1749.4981778209,"362145938":2067.0643721733,"3624743731":1663.456591933,"3625352354":1376.2600892096,"3627963576":1604.0695445163,"3628522165":0,"3628711002":1844.6289439644,"3629682368":1815.1286459024,"3631325739":0,"3631493170":2333.0078041754,"3632361978":2221.3538766773,"3632832155":0,"3633709914":0,"3634042243":0,"3634756972":0,"3639230179":2121.3147151648,"3640069915":0,"364057867":2265.2118886972,"3643699802":0,"3647529643":1897.5516652727,"3647659126":0,"3650306921":0,"3652265598":0,"3654559374":0,"3654833214":1740.5014205942,"3655230005":0,"3655265099":1538.233149704,"3655694361":0,"3658316549":1307.2991245272,"3658435518":0,"3658913842":1173.505926482,"3663334475":1459.8208951847,"3666213697":0,"3668290311":0,"3669324904":1847.2077654978,"3670047480":1212.2606422181,"3670981421":0,"3671857466":1547.5714796512,"3672640831":1275.6108152653,"3672802568":0,"3674750599":1539.2250193318,"3675075625":2366.7099607655,"3676581853":0,"3678361449":0,"3678844870":0,"3679223156":2863.1378294349,"3679518604":2076.0155978787,"3680951455":0,"3681131795":1372.1152262488,"3681526411":1779.7534349429,"3681668560":1151.3534799042,"3681976285":1633.1372577433,"368544120":0,"3685520053":2084.2010769193,"3686317773":1221.6801628274,"369209811":1638.0148920643,"3693635252":1423.1058649921,"3694289041":1732.5146472785,"3695292464":0,"3696528144":0,"3696757985":1314.2912238536,"3697179042":2533.2830157959,"3698071341":1407.0629410799,"3698564207":2131.7917160422,"3702844885":0,"3704059945":0,"3707233513":2209.8815936961,"370730607":0,"3709286362":0,"3709920516":2583.406911951,"3713605524":1625.7172632295,"3714339122":0,"3722557865":1200.9464053417,"372608626":2655.2178711909,"3729546605":0,"3729777530":1791.5102962397,"3729897578":1558.9522968448,"3730047096":2276.9256951751,"3731391427":1294.5800368625,"3732579349":0,"3732893747":0,"3733071109":0,"3733738177":0,"3733845637":0,"3734379548":0,"3735372403":1597.0215918551,"3735555259":2228.3454693625,"3735817636":1142.0341823205,"3735818622":1372.4759842416,"3736820092":1534.0648719302,"3736843920":1381.0888968455,"3737350161":0,"3738097801":1552.8935571247,"3738671880":1374.6755455786,"3738902181":0,"3738917436":1387.3672639293,"374038880":1872.0350138774,"3740959852":1984.9685663849,"374180471":2011.0496162515,"3742724136":1709.1054732427,"3742810739":0,"374282350":1662.7075394144,"3743671260":0,"3744485747":2345.3418191684,"3748728257":0,"3749798588":0,"3750650671":1352.1791099256,"375088983":2391.8086687918,"3750933244":1260.1755576607,"3754756357":0,"3754993583":1428.7246677159,"3756156206":2633.0144045478,"375721237":0,"3757271328":0,"3757656158":0,"3761575610":1562.0956544608,"3761670335":1809.5579156134,"3766200583":2220.8257124139,"376871815":1909.4189035523,"3772256778":1541.2260256298,"3772660335":1297.3006230632,"3772871454":0,"3773526508":1956.7059585934,"3773666854":1163.6047095526,"3777661377":0,"3778120928":1134.7862697576,"3778209816":1334.0516779626,"3778856012":1237.7565585875,"3779169819":1167.647122501,"3779486178":0,"3780176153":1707.8992927609,"3781646421":0,"3781658657":0,"3782265092":0,"3785395845":0,"3785567301":0,"3786781582":1622.3970914116,"3787590955":0,"3789355498":1454.7459647138,"3791950406":1675.9610355975,"3793928653":1506.8958220609,"3794347985":1192.3167969426,"3795047313":1866.3014601125,"3800630907":1292.8993325204,"3800747527":0,"3801430886":2062.9876807625,"3802076349":2305.4498281454,"3802833057":2033.1699277531,"3803787289":2075.9046975409,"3806017410":2155.3424932408,"3806643948":0,"3807487459":2620.4181842249,"3809879849":0,"3812471555":1496.9128643588,"3813216196":1384.4078082338,"3813731132":0,"3813795330":0,"3814190795":0,"3814673758":1779.3931248179,"3816685448":1397.8875115008,"3816847735":0,"3817057378":0,"3817708570":0,"3817996291":1792.076794537,"3820908739":2092.5366031561,"382106194":0,"3821666194":0,"3822669184":2105.8582288624,"3823075784":0,"3823231761":0,"3823656539":0,"382558847":0,"3825739123":1939.9323330472,"3828103825":0,"3828565221":0,"3828674995":0,"3830405744":1273.046473797,"3830794143":1182.2102562446,"3830917042":0,"3832160892":0,"3832931339":0,"3833541404":0,"3833659931":1234.8049089605,"3834636412":0,"3835566276":1376.0047008182,"3836236370":1783.2337340478,"3836670242":1301.4117757184,"3836897087":0,"3837200173":2300.1557840589,"3838380426":0,"3839572104":1416.8961009909,"3841967606":0,"3843088774":0,"3843288760":0,"384406520":0,"3846393224":0,"3849697077":1167.8737144048,"3850152805":0,"3850475856":0,"3850567251":0,"3851133364":2481.7175364169,"3851205548":1374.3527967199,"385203255":2209.8785430371,"3852187784":0,"3854724367":0,"3856718514":2383.7724811656,"3859790729":1372.7398808669,"3863149926":0,"3865734981":1911.1959516695,"3866325213":1497.8880991093,"3867293007":1751.115625465,"3869351459":2080.0425875741,"3869891296":1541.6944600975,"3870173669":0,"3870941501":2084.6866916045,"3871311053":1458.356493039,"38742216":0,"3874484865":1573.2701790739,"3876344773":0,"3876397144":1235.6484230513,"3877013643":1713.2768268466,"3877437521":1321.2748903388,"387774736":0,"3880011182":1741.3694833067,"3880639230":1857.6431822094,"3882420814":0,"3882513191":0,"3883411103":1338.8322315568,"3883580111":0,"3884874766":2204.3524370174,"3887653034":0,"388898462":0,"3889083778":0,"3891355877":1335.4613368501,"3892578893":1495.715740828,"3894678842":1129.3432988996,"3894947933":1947.5013967785,"3897579601":0,"3898582486":1960.5763266754,"3899459924":1301.4027057843,"3899529382":2413.3969129689,"389978318":1223.9335618833,"3900992255":2333.0621537307,"3901843098":0,"3903413452":0,"3906386545":0,"3907062892":2470.2118194809,"3907541820":1781.8156963676,"3909203570":2677.1682592316,"3911303073":1454.5942017003,"3911640069":1471.8964024887,"391342400":1231.4004525633,"3915832963":1285.9726675488,"3919719734":1964.3793590858,"3920003458":0,"3920580036":0,"3920701236":0,"3920920642":1382.4809893713,"3920925170":1307.9800903088,"3922635563":2009.7322365973,"3926333474":0,"3926884655":1226.8332278145,"3927353973":0,"3927702135":1590.0463215721,"3928291565":0,"3928470194":0,"3929135553":2084.1404698713,"3929440255":0,"3930025215":1951.5918682146,"3931327644":0,"3935523633":2104.9526046945,"3936048230":0,"3936988451":1430.3094955812,"3939185799":2001.4515854273,"3940769236":1193.1328299324,"3942454002":0,"3943793700":1778.4880620629,"3944079582":0,"3946751496":1761.9162628125,"3946770973":0,"3947635653":2439.7337408636,"3949953471":2297.105362516,"3951026299":1433.0795554833,"3953077425":2260.2799775623,"3953245616":1418.1401949854,"3953865894":2066.0972575597,"3956966956":1649.9728054796,"3957965518":1836.5345744332,"3960620247":1241.5645130241,"3960804215":1626.6740430119,"3965012096":0,"3965390038":0,"3966752648":0,"3967032436":1918.9960035055,"3968538235":1869.402439128,"3969212159":2060.0818824378,"3970030339":0,"3971252642":1785.6006955353,"3971324453":0,"397181519":0,"3972794115":1528.7183829005,"3973047784":0,"3973609032":2090.4183788498,"3974822873":1680.4852623991,"3975010681":0,"3975371411":1485.135401269,"3977989551":1530.0343519239,"3978062866":0,"3978152897":1622.7743864401,"3978864326":1323.1893756783,"3979947991":2026.8957817007,"3980691002":0,"3981013694":1651.569267834,"3981067264":0,"3982094929":0,"3982480412":0,"3982790200":0,"3983488064":0,"3984829072":0,"3985296975":0,"3985685306":0,"3985813844":0,"3987516998":0,"3988446663":1206.1240971343,"3989118459":1583.212966224,"3989268391":1478.3848028264,"3989735780":1423.0355763093,"399050701":1241.0825147417,"3990558875":1635.6879273926,"3990570012":0,"3992139324":2027.7304121046,"3992943267":0,"3993074949":0,"3993583568":0,"3993903432":0,"3994274623":0,"3996294633":0,"3996759401":1299.6035132992,"3999582587":1289.1912178611,"4000844273":1533.47383662,"4003153896":0,"4004277283":0,"4006089601":0,"4006408746":1282.3870247003,"4006941957":1764.9170564773,"4007529944":1616.2067360638,"4008128316":1900.8434122725,"4009778807":0,"4010638251":0,"4011399863":0,"4013191058":0,"4014680480":0,"4014976365":1914.6717285348,"401508981":1436.5343999134,"4016027208":0,"4016866328":0,"4017385406":0,"4018527734":0,"4020009242":0,"4021161204":2039.110874689,"4021657799":0,"4022402413":1193.0585534828,"4022600098":0,"4023565195":2175.6850426027,"4024970253":1310.9129840277,"4026628199":0,"4026864126":1203.1408035909,"4027356240":1299.8393735643,"4028967949":1386.9203620297,"4029466921":0,"4029500097":0,"4032339630":0,"4032343955":2025.0377429311,"4032901400":0,"4033162779":2050.2553211463,"4034022024":2047.3919190727,"4034818195":0,"4034922554":1164.0227691933,"403672441":1461.9157715206,"4039038151":0,"4040819108":1824.829446341,"4043172905":0,"4043400932":0,"4043601244":1631.5850830561,"4043627107":0,"4044555832":0,"4047033765":0,"4047865463":0,"4048578172":0,"4049556872":0,"4050014828":2137.5633267453,"4050705931":0,"4053796951":2205.4304373587,"4054714568":0,"4057490526":0,"4057878205":1544.8261365027,"4058134239":1445.1422945604,"4058653877":0,"4061458273":1823.5831437787,"40615146":1827.090740222,"4061782818":0,"4062228386":1376.2376633804,"4062961912":2195.6540241654,"4063277289":0,"4063900283":0,"4064007490":1501.9080845668,"4064149855":1607.80608595,"4065089853":1283.6412252736,"4066429992":1864.5644306171,"4067072856":1476.9062320302,"4067624536":0,"4070705042":0,"4070899391":0,"4071175900":1514.8181710611,"4072567494":0,"4075036261":0,"4077161289":1832.2280384591,"4078406602":0,"4078794209":1375.0234414965,"4079777150":0,"4082307471":0,"4083216410":1607.4192947808,"4085072471":0,"4085658464":0,"4086617748":1442.9468304752,"4088708677":1643.5283095007,"4089321877":1944.5673996888,"4089962714":0,"4091113757":0,"4091816277":0,"4092227797":1476.9118898539,"4093059486":1259.409726189,"4094576814":0,"4095621901":1426.9800910361,"4096713010":0,"409977826":0,"410013415":0,"4100936853":0,"4101129191":1448.1865030721,"4102134032":0,"4103794198":0,"4107503015":1825.770486008,"4107668533":0,"4108118731":1394.9149882274,"4109762990":1787.6346864268,"4110942485":0,"4112278141":0,"4113058721":1266.7001363197,"4115375242":0,"4116532905":2298.6242048519,"4119329122":0,"4119724272":0,"4121584967":0,"412283228":0,"4123515556":1562.9802666517,"4123534788":0,"4124154827":0,"412491371":0,"4125612782":1204.9864820183,"4125791633":0,"41269413":1324.5696223867,"4127526700":0,"4128050064":0,"4129112562":0,"4130335825":0,"4130908576":1247.3198836387,"4130986647":1580.9748095835,"4131453232":1219.4252907184,"4133950075":0,"4134643071":0,"4136320759":2027.8772739639,"4136678159":1753.9062487685,"4137220667":1393.3604603199,"4137779509":0,"4138934238":1797.4917663632,"4138934893":0,"4139130918":0,"4140185340":0,"4141047313":1484.8385256564,"4143209261":0,"4144023748":1784.2539813582,"4144252835":0,"4144328959":0,"4145221029":0,"4147523762":0,"4149053090":0,"4149493404":0,"4149654629":0,"4151024020":0,"4154176354":0,"4154206580":0,"4154336589":2377.3895801187,"4155641815":1384.0226911434,"4156461194":1274.881752217,"4156611370":0,"4156886477":0,"4159210402":1408.427592417,"4160094583":0,"4162693857":1426.7384112327,"4162714270":1602.7742849665,"4164128971":0,"4164491486":0,"4165482981":0,"416702467":0,"4169811109":1374.574900311,"4169935304":1796.5392133092,"4172058127":1702.8035923458,"4175159080":2517.6829964848,"4175827470":1164.8182315157,"4176664483":0,"4177070630":0,"4180257761":1855.5957296285,"4182324049":2074.4120526679,"4183393481":1512.3323577063,"4183600583":0,"4185588652":0,"4185904896":1983.2319731313,"4187483922":2409.7580728676,"4187877981":1770.8924569497,"419099305":1502.5363677723,"4191223408":1558.6880035344,"4191841426":0,"41924590":0,"419265170":0,"4193156158":1853.0880092558,"4193309664":0,"4193739814":1758.75255141,"4195485236":0,"4195627843":0,"4196448349":0,"4197747162":2120.4466386371,"419814877":2084.4980206639,"4199077770":0,"4200358078":0,"4201921653":2156.9515428364,"4207897118":0,"4210364548":1264.4836883082,"4211026934":1481.5701319876,"4211993018":0,"4212893423":1208.0130656905,"421470137":0,"4216066459":0,"4216471965":0,"4216644948":0,"4216972810":0,"421748448":0,"4220955865":0,"4221466593":1695.3076664977,"4222214139":0,"4224776178":0,"4224854568":1479.9828219111,"4225343365":2022.8520613737,"4225876243":1279.0301521682,"4226664142":0,"4227366527":1221.9872943569,"4231095696":1658.5967147757,"4231261281":0,"4231944752":0,"4233152869":1368.0043517215,"4234423090":1341.3713970313,"4235563666":1283.4980318021,"4238067501":0,"4238290979":1132.6812943289,"4238478834":0,"4239392469":0,"4239622058":2531.6452775023,"4242473859":1657.1231739081,"4243902659":0,"4244339093":2779.7855167601,"4245137983":1694.4308657594,"4247310156":2873.9745576413,"424787144":0,"4248915112":0,"425057592":0,"4252078571":0,"4252220750":1966.7067914206,"4253187558":1201.3497763919,"4255960109":0,"4256716489":1425.3981616639,"4257560677":2381.6019709166,"4259911866":1719.945199874,"4261327361":1409.2288385791,"4262011852":0,"4265155310":1330.918577828,"4268196111":0,"4272085250":2415.0089731911,"4274227295":0,"4274312628":1571.1721048101,"4275078512":0,"4275612953":2090.6800569319,"4276174201":2081.6909344021,"4276936370":0,"4277286146":0,"4278260851":0,"4278588630":0,"4278798036":1729.6074000215,"4279348799":1701.7584658834,"4279603804":0,"4281929868":1444.6098846511,"4283669919":1387.2941868867,"4285617748":0,"428851356":1209.6571020247,"4289106415":1213.8073621345,"4290150798":2074.8331146269,"4290496515":2170.0439693714,"4291977235":0,"4292187435":0,"4293465808":0,"4293743842":0,"4294197536":1287.1053917452,"430788454":1658.921022733,"432952089":0,"435507573":1590.269030833,"435938591":2091.6474629767,"436025572":1239.1621762681,"438417277":1460.5903088359,"439231056":1193.2687290573,"440012417":0,"440206256":1309.3113721825,"440656680":0,"441435962":0,"442815761":1707.4309979043,"443405892":0,"444602377":0,"444680013":1477.4844514104,"445102839":1934.3556201811,"445458274":1256.6807087287,"446314776":0,"44691758":0,"446968474":2456.3900212097,"447209244":0,"448999750":1932.3730795204,"449754376":0,"449776562":0,"454305182":0,"456952191":0,"457675593":0,"457953007":1307.3797385769,"458335295":0,"459732998":2650.8996457642,"461728477":0,"462078559":0,"462875391":2582.0814855506,"463765609":1622.8414025136,"465632644":0,"466340061":1779.9495819318,"468110":1356.6925765299,"468127487":0,"469490796":1656.5588918365,"469801892":0,"47105522":0,"472415307":1177.5660617941,"474089455":1139.4248492279,"474791918":1997.1824403719,"475209872":1181.9716216714,"475633354":0,"476179926":0,"478874060":2019.5399647546,"479546084":1303.0179795942,"480223586":1494.500749598,"48057996":0,"482181283":0,"482822055":0,"483561018":0,"484484283":1259.3406231708,"484559816":0,"485006616":1775.854606648,"485245401":0,"485705274":0,"486718067":2348.7273357105,"487061983":0,"487663609":1854.9547783559,"487789523":1285.7282180721,"488117229":0,"491083091":2130.1135718486,"491601529":0,"492673087":1588.4826339516,"492684269":0,"492772626":2020.7095306378,"49337297":0,"495901528":2037.6527962599,"496677914":0,"497323702":2444.7192647604,"498806458":0,"501148034":0,"50181492":0,"503793114":0,"504472069":1257.679633165,"505097820":2418.5742747632,"509699848":1912.8455659711,"509756552":1188.6311093158,"5115105":2454.7653333657,"511813355":0,"512758649":2235.9672341699,"518714509":1189.4358388136,"519326923":1797.8728515982,"519673615":0,"519703576":0,"521103328":0,"52174285":0,"521886798":2387.3525635254,"522511593":0,"523690894":0,"523951328":1223.406570396,"526067229":0,"529027464":0,"529249486":0,"530135030":0,"530449553":0,"530846359":2235.5784618885,"534082096":1399.8468905274,"535210813":0,"535469112":0,"53592478":0,"535937366":0,"536229655":1911.8282317986,"536430705":1817.9978644712,"537590451":2250.9318291559,"537971944":1167.1241589729,"538156740":0,"540821611":2308.6545905335,"545408597":1180.5927490268,"545869308":1569.7528744586,"547605841":1804.5783242151,"549109709":2533.3027905062,"550044897":0,"550448877":0,"550627195":2489.6652421066,"551650495":0,"552299541":2207.8565809952,"556438904":0,"556450459":0,"556825118":1270.6712381632,"557064072":0,"557097878":2587.8725248485,"558074969":0,"559582932":1529.7617243868,"566662585":0,"566836098":0,"569105706":0,"569662321":0,"569821923":0,"569962978":1355.3956434989,"571415893":2594.135673452,"571559842":1678.3947690537,"572178714":1392.0853311911,"572276699":1840.9122452886,"57307685":0,"573279484":0,"576619521":1746.8757919578,"578346118":0,"578368735":0,"578652817":0,"579965012":0,"582275145":0,"582349116":0,"584398620":0,"584422611":0,"58544596":0,"586474794":1303.5594588137,"58778303":0,"588772553":1201.6117337798,"590592305":1856.8610192187,"591580711":0,"59158142":2849.4841858619,"592662704":0,"592826714":1743.731976554,"59428399":1481.960807786,"594551983":1524.5693481538,"594904868":0,"59567354":0,"596917752":0,"599100436":0,"601450429":1758.5135073787,"602085756":0,"606654355":0,"607026938":0,"608419542":1830.1493771696,"611100168":1207.7224406285,"611620362":0,"61296851":1372.5139179378,"613691832":1708.8735585776,"614687136":1535.3680469616,"615729621":1272.3340330895,"617363107":0,"618419204":1252.8406166148,"620562584":0,"623247221":1382.760607823,"625310591":2428.7985254341,"625709572":1748.1523771585,"62740321":0,"628719688":1938.6883365596,"629883391":1635.1520858279,"634204613":0,"635111986":1825.0056908946,"636790914":2414.6227484407,"636908055":0,"637379632":0,"637661898":1502.6623568929,"638264577":1410.5239927267,"638561610":1258.8401788462,"639622603":1144.6237559885,"639855496":0,"639984084":0,"640612489":0,"641703821":0,"644735722":0,"646623014":0,"648001314":0,"650356357":1745.6490739887,"651101767":1142.8650731632,"65111910":1747.6755111029,"653475446":2182.054452981,"654405691":0,"655929637":2125.3125624762,"657641712":0,"658738156":1151.9713084499,"66053082":0,"660980450":0,"665333196":1391.7243180131,"668514824":0,"669193354":0,"670519393":2101.867342004,"670957801":1331.5287857686,"672964653":0,"67459313":0,"676558931":0,"676949389":1649.2000410344,"677909483":2351.2293628792,"67823656":0,"679348420":0,"680388257":0,"681133837":2014.7655493665,"68154824":0,"684110909":1671.9261598,"686429748":1421.6541140049,"687876034":0,"688063365":2116.493528295,"689742461":0,"690173651":1477.7669322402,"690261450":1298.5921473119,"693474678":1356.1920189231,"694594451":1199.4427635582,"694631589":0,"694748880":0,"696571525":0,"697239024":0,"700466705":1960.5517123728,"70049056":1636.47322627,"700655129":0,"701261553":1885.0178370385,"703374139":0,"704152903":1697.8500495479,"705186057":0,"705189000":1509.5562928491,"707570247":0,"707968705":1266.3368046515,"709012070":1307.4608905199,"712189388":0,"713625410":2499.3282271507,"715235362":1243.1009943284,"718375766":2259.6572191969,"718987035":1604.1602280047,"719526211":0,"719843162":0,"721361841":0,"722046827":0,"724072362":0,"724968972":0,"725104396":0,"728229560":2034.6759416871,"729170392":1885.1051527272,"729675571":0,"730656427":2422.5309771173,"730723137":0,"730943544":1658.3530344788,"731038573":2816.0706257586,"731708110":0,"733560660":1378.7570411077,"735587531":1322.3886921778,"737814347":0,"737896329":1810.6470004623,"739255468":1120.698183624,"741778858":2056.335494216,"74188793":1219.5284561367,"743759650":1658.3305547865,"744773019":1666.346990979,"746573214":2136.3013259524,"747763790":2034.4067304341,"748610431":0,"74918902":0,"750309798":1939.560165526,"750727980":1341.8397242604,"751346572":0,"752241853":1266.5231114343,"755197791":0,"756808622":0,"759235138":0,"760128905":1524.8218282113,"760662992":1184.8359383057,"761142635":0,"761999420":1903.1973989877,"765388149":0,"769907793":0,"770030188":1898.8339532179,"770308924":1215.7443346869,"770550829":1195.9731842298,"771122731":1511.3725353467,"773302480":1383.4424411643,"77582966":1165.8838207286,"775852598":0,"776635260":0,"778347498":1444.3218903725,"779517329":1341.5076441361,"781431378":1471.6221713607,"782263815":2432.4146343542,"782544976":0,"782747152":1432.9051050881,"783017459":0,"78641139":1517.8263048447,"787047636":1803.7518552874,"787489678":1218.1083231462,"787831673":0,"791863919":1453.7818053022,"792209696":0,"792881591":0,"79432680":2020.1846215023,"796165027":2077.4738459704,"799287649":0,"800569224":1256.4891142083,"80255331":1286.3841359213,"804923256":0,"806315258":0,"806863646":0,"807897834":1315.1890809249,"808016071":0,"809508462":1622.2389577197,"809566471":1846.3568350016,"811643351":0,"816106556":1542.5630367445,"817020554":0,"817603659":0,"818614665":0,"819381767":0,"820995848":0,"821525251":2123.5708982185,"823333636":0,"823399055":1604.9737380545,"823401403":0,"823944730":0,"824074855":1343.628913055,"826909651":1781.3664141686,"829222445":1434.2392062372,"830012757":0,"830799973":1763.787679959,"831955542":0,"83229717":1486.2147876747,"833954016":1184.3385083575,"834197249":3039.3003256659,"835720488":0,"836765096":1251.822378691,"83779659":0,"838041291":0,"839436880":0,"839548071":2277.9557248587,"83972723":0,"84037765":0,"843769556":1486.4687014051,"84450131":1253.4847783954,"845051287":0,"846898736":1333.0179956774,"849440197":0,"8513623":0,"852170646":0,"854560060":0,"855962181":2824.4551372454,"857697187":1624.4737611923,"859530118":1288.5621697906,"860518194":1794.5827898448,"860689371":2273.2215764545,"865538835":0,"866640334":0,"86760751":0,"869195845":1427.7906804882,"869865446":1975.9693382075,"870099563":0,"87115414":1297.4179875409,"875418963":1537.1387686755,"87614958":0,"877400726":0,"877809104":1353.629677812,"879115717":0,"87920735":0,"880076654":0,"880748729":0,"881741713":1198.8420836551,"882246184":1374.3549007913,"882447848":0,"882579715":0,"882647661":0,"883396381":1366.6789652398,"883833496":2537.7965575726,"884144873":1662.6673692545,"885464162":0,"886158615":1479.4837595809,"886594276":0,"887148037":0,"888102063":0,"888694650":0,"889856657":1704.360891641,"890122237":0,"89348328":1936.6613414859,"893706977":0,"894912724":1388.5363323598,"897925931":0,"900196884":0,"904890527":0,"905487995":2803.7652028979,"905841209":0,"907391117":0,"907536385":0,"907763091":0,"908082157":1311.3495317884,"909563687":1745.6580748712,"910590803":2092.8943149547,"911506733":1271.7726574892,"913248466":0,"915449177":2363.0240184484,"917372483":1347.8521638635,"917808097":1304.1180812515,"91788639":1504.2133321504,"918405430":0,"919200929":1302.6469071738,"919580800":0,"920111034":1429.6349292399,"920238680":0,"921517874":0,"922086852":1948.489500779,"922159166":0,"922160489":1336.7830451625,"922857054":0,"923836112":0,"924129852":2223.1762282199,"925231976":0,"925899870":0,"926213540":0,"9262188":1277.9987709491,"927068521":1716.9721777,"927391464":0,"928331770":2515.7520586008,"928385815":0,"929368022":0,"929645229":1653.0356626499,"929840503":0,"932131549":0,"933282434":0,"93344773":1320.6485731562,"933877486":1216.6376846517,"938263064":1965.1266122355,"941716720":1227.7906887239,"94199361":0,"942180030":2354.5411153127,"942356384":1638.1281256708,"943252793":1682.8882177724,"94359620":2207.4917475411,"943933017":0,"945629510":1435.0179887342,"946660529":1248.8547072235,"947222494":0,"949381873":2304.3094138939,"949683376":0,"950521557":1174.3019990918,"953049578":0,"954274595":0,"957253639":0,"95851077":0,"959153590":0,"95938088":1206.0712568518,"959851555":0,"960174485":0,"960405407":2203.1738850937,"96141044":2628.7957821141,"961906184":0,"963187635":0,"963523596":1250.8974254752,"96440277":2239.7101856677,"964970911":0,"965000307":0,"966269583":0,"967980473":1677.4559378473,"968595601":0,"968851545":0,"969064590":0,"969893325":1129.949090232,"970766553":1284.3625733813,"974534416":1373.8916796083,"976252372":2476.451764287,"976283641":0,"977519979":0,"97873302":1397.7743198793,"979158748":0,"9793507":2250.0454791316,"979526552":2315.6037017989,"979891940":0,"981386412":1147.8274860083,"983129619":1269.7567553523,"98370052":0,"986520800":1678.7231378948,"98793972":0,"988335694":2214.4798747386,"989456575":1611.8434720083,"991662473":0,"99323012":0,"999091554":2153.5854429139} +{"1001722740":1151.2537511408,"1002673857":1245.2741257148,"100346498":0,"1005570900":2396.6267778669,"1007682110":0,"1009688921":1710.0787625377,"1009976390":1295.75504698,"1010937559":1301.9276849391,"1013970586":1504.0178888667,"1014740120":1846.4077077642,"1016789276":0,"1017096056":1182.3093772964,"1017177635":2084.5752686737,"1018399535":1579.2309881035,"101859828":1271.3313760514,"1019076732":0,"1019777981":2084.9697035674,"10205408":2130.9348604091,"1021006246":0,"102220660":0,"102293615":0,"1023487571":1675.989407584,"1023816398":2008.40650791,"1024461884":1714.992763701,"1024556652":0,"102575803":2350.9694374861,"1026373985":0,"1028149095":1160.4439395369,"1029578709":2588.8752130913,"1029802455":0,"1032257843":1658.8190087768,"1033176958":0,"1033555490":1479.6908339113,"103725426":0,"1037331293":1309.7266159448,"103770723":0,"1038100878":1180.923623906,"1038307939":1485.6550472186,"103871786":1235.8413685224,"1041979787":0,"1043390792":1389.0328392117,"1044473054":0,"1046441649":0,"1047256075":2081.698529877,"1049390106":1421.2624065513,"1049961856":1919.7433862082,"1053077839":2029.1301557536,"1053626998":1864.0948676111,"1057920854":1613.0429766636,"1058710996":0,"1058758368":0,"1058966145":2238.2830745228,"1059279895":2444.2791027022,"1060291152":1361.8801013336,"1060952697":1516.8229485853,"1062314990":0,"1062871842":1104.7359028407,"1063164797":1507.8701119064,"1063658457":1422.7125559974,"1066025257":1724.1545485476,"1067366399":0,"1067400091":1253.1107481745,"1068663704":0,"1069078430":1249.7770522505,"1069219826":0,"1069956724":2344.3664724791,"1069999133":0,"1074334353":2078.6986769435,"1074391241":0,"1075188600":0,"1075377947":0,"107547857":1748.4522689101,"1075948935":1426.948379305,"1075971933":1997.7013718153,"1078280786":1418.9758090724,"1078494316":1139.6630206282,"1079710023":0,"1080305958":0,"1081472803":0,"1083394541":0,"1084901915":0,"1085741995":0,"108728140":1951.3509259668,"1088208610":2081.1880297942,"1089101531":1533.5722750742,"1092713458":1665.24907247,"1093275153":1309.1422268153,"1094471227":1581.4162718925,"1095929141":1787.8550568757,"109606469":1558.7188539503,"1096438122":0,"1097720535":1657.5344546445,"1098465458":1407.1322366299,"1101243430":0,"110135796":1741.4527995252,"1102712818":0,"1102749976":1445.3734269673,"1103286328":1685.3599641299,"1104764996":0,"1108078634":0,"111167904":1328.5499677186,"111192011":0,"111233848":0,"111314097":0,"1113985320":1995.2937073376,"1114191328":2378.6234112504,"1114300382":0,"111572636":0,"1118571941":1810.7690062079,"1119710280":2380.5983169295,"1122946813":1450.6986543984,"1123666202":1284.4514662456,"1129799033":0,"1130768852":0,"1131587707":0,"1132748762":0,"1132876897":0,"1134359923":1830.3165569278,"1135090504":1818.0024504436,"1135153485":0,"1137656154":1180.3543157775,"1137942707":1678.6241816708,"113811987":2222.4805422748,"1139062797":1290.0361853035,"1140950686":1708.9663754668,"1144525439":0,"1146950656":0,"1147860078":1831.9395911303,"1149087220":1234.4144116814,"1150623470":2182.6180030785,"1151236787":0,"115382073":0,"1156930664":0,"1160726234":0,"1164168277":0,"1164523872":0,"1164835766":0,"1165166058":2399.5729141925,"1165928557":0,"1167299665":1744.0388789755,"1167766424":1259.1979660519,"1168254316":1281.0889272532,"1168505902":1951.2096212775,"1168558024":1393.7857353048,"1170959519":0,"1171095":0,"117165936":1321.9346201204,"1172679970":0,"1173419903":1347.2146542772,"1174559962":1266.5014127879,"1176671732":0,"1177110212":0,"1178924986":2817.267212602,"1179475752":1228.4824438011,"1180161064":1663.3912882908,"1180349312":1356.4450869217,"1180837306":1346.3556309143,"1181589124":2081.7518764643,"1182482579":0,"1182547848":1301.1576743638,"1184414922":1912.0829958001,"1185092838":1615.4767730477,"1186138716":0,"1186731908":1791.0336923305,"1187211206":1441.4290319373,"1187527339":0,"1187943151":0,"1188543288":0,"1189152973":2033.4597721985,"1191385639":1807.4618172386,"1191936218":0,"1192302071":1708.9983361411,"1192605817":0,"119361315":1495.5180147817,"1194042995":2648.1748409542,"119654105":1178.4942541235,"1197839305":0,"1197966112":1981.3072959787,"1199006360":0,"1199383198":1819.3068421506,"119954396":1527.6868660176,"1200771569":1367.0197235097,"1200779115":0,"1204439806":1749.5115037045,"1204660336":1734.0550202798,"1206307881":0,"120648461":1949.0920823355,"1210001971":1774.8764591297,"1210196211":1429.1878389249,"1210455736":2171.716066664,"1210688937":2042.4005521254,"1210757712":1166.5264284193,"121112730":0,"1212080245":0,"1212266970":0,"1218347826":2336.5210003185,"1218479039":0,"122030614":1594.2563236049,"122134919":1606.9895296459,"1225270682":1244.317367883,"1226888142":1499.7136257352,"1229621552":1638.3134093066,"123050212":1516.4104902196,"1231586287":0,"1231673390":0,"1231737979":1373.8113453501,"1232284801":1334.0564009231,"1232868918":0,"123288766":0,"1233403465":0,"1234370312":1544.6371526659,"1234415652":0,"1235853332":1597.1931473887,"1236291717":0,"1236982780":1739.5831401172,"1238400837":1334.5718985411,"1238608911":0,"124089953":0,"1241705093":1229.7575626899,"124247488":0,"124339070":1464.6895034875,"1243440018":2153.8943791656,"1245231548":0,"1245371369":0,"1246328892":0,"1246713190":0,"1247027569":1590.5791055102,"1247428479":0,"1249919767":1322.5926536743,"1250723795":0,"1252533772":0,"1252651878":0,"1253336265":1674.7986939472,"125432943":0,"1255527945":1685.5389350949,"1257680587":1395.5132479177,"1257762070":1674.9985842835,"1258148931":0,"1260215787":1593.8926580448,"1262858438":0,"1263665709":0,"1265881179":0,"126670103":0,"1268853066":0,"1269261016":0,"1272023779":2181.7821188042,"1275579259":1682.16892078,"1276354362":0,"1278269400":0,"1278665216":1279.3383966145,"1280364978":0,"1282549856":0,"1287143513":0,"1290173910":1280.2203734882,"1294188975":1209.3722198224,"1294989119":0,"1295785983":1636.7472106213,"1299365979":1450.8514438667,"1299928804":1160.8899403409,"1300584624":0,"1300693519":0,"1301810943":0,"1303368655":1297.5338328524,"1303459038":1285.1547123119,"1304520805":1785.6872758693,"1304985926":1749.9743684275,"1305713613":0,"1308115412":0,"1308745360":0,"1310138170":0,"1311511120":0,"1311726140":1820.58557644,"1312484096":0,"1312828534":0,"1316461889":1610.1866391145,"1319672571":1686.4493679523,"1320293684":1524.5856276651,"1321549485":0,"1322023785":1350.6048768377,"132290954":0,"1323143155":1779.0712927572,"1325042165":0,"132598439":0,"132633492":1530.4652027753,"1327909725":0,"1329204486":0,"1331006046":0,"1331559454":0,"1331620430":1418.6847740057,"133627469":1573.4042963622,"1337689329":1332.4653491345,"1341926866":0,"1347652080":2025.1529365814,"1350925428":1262.5890311992,"1351132676":2246.0452639352,"1351904344":0,"13544352":1855.4479039876,"1356097871":0,"1361459100":1412.2790156634,"136239889":1467.9366439696,"1363331011":1828.2700238306,"1363446915":1754.1710323358,"1364645526":0,"1364762739":1823.8779711373,"1365148367":1618.6016480451,"1368317464":1165.4768151611,"1368794049":0,"1370751449":0,"1370775302":1893.5143805402,"137081663":0,"1375391804":0,"1376431756":1317.1729927899,"1376748919":0,"1377831845":1253.5161450678,"1377883269":1681.3263732456,"1378497107":0,"1381448562":0,"1381994519":2350.7421492104,"1385231803":1315.8569286597,"138718433":0,"1387834419":2055.0970201875,"1392708979":2288.2117442123,"1393055239":1267.223591366,"1395079998":0,"1395581223":1557.017055582,"1399568330":0,"1401306104":0,"1402633459":1600.5573262373,"1402867741":1590.0883962313,"1403314808":1125.575238274,"1403965423":1940.6002290953,"1405611181":2159.4844281244,"1405789151":1178.6580069402,"1405988519":1309.8100518373,"1406878447":0,"1409344146":1207.748239075,"1411796478":0,"1412203164":0,"1414741845":1786.3121598293,"1417435719":1341.0476642293,"1418471367":1084.1319467318,"1419735568":0,"1420036364":1172.6819789183,"1420249701":2030.922770301,"1420390570":1431.0523656241,"1421409652":0,"1422717967":0,"1423912379":1658.3474650806,"1426150563":0,"1428000744":0,"1428852700":2168.7531235448,"143031678":1283.51021448,"1430651253":1325.3607218257,"1432071996":1880.7433591583,"1434911335":2690.5859406179,"1435717617":1697.0187705319,"1438711104":0,"1438800814":1396.5990609759,"144023621":0,"1441425352":0,"1442274557":2201.8209584221,"1442563829":0,"1442835646":0,"1449021558":1201.8730954169,"1449182323":0,"1449546891":1414.6100987673,"1450266090":2021.7790710467,"145069778":2307.0161713185,"1451306214":0,"1452093256":1405.4005354401,"1454677217":0,"1456955548":0,"1457368038":1985.2504512337,"1459395051":2291.6794536377,"1460194927":0,"1460547008":1167.1331831913,"1461103201":1877.5624603804,"1463291583":1465.7023558248,"1463471392":1638.4147703093,"1464742605":1808.3407696613,"1466738944":1832.7167755024,"1467367970":1473.864993045,"1467581792":0,"1467636476":0,"146862112":1880.3261182293,"1471696394":1291.744935731,"1472553037":0,"1474617560":1422.3308967485,"14750873":1151.9363042898,"1475483634":1253.1463945043,"1478600712":1678.1133886034,"147891676":1481.1046340847,"1478945205":0,"1479673533":1287.8970301681,"1480696010":1737.8431142688,"1480774126":1850.5506342426,"1481976566":1315.3715333947,"1482300808":2171.9645269732,"1482821287":1294.5297034757,"1485423720":1929.897343316,"1486913577":1224.7606792444,"1487915794":1182.6489068544,"1488658299":0,"1490013522":0,"1490454383":1927.4000816649,"149268417":2080.7845644831,"1493116499":1216.612918849,"1493274091":1782.3312212058,"1493978161":0,"1495787026":0,"1496544628":0,"1497402060":1255.5461825223,"1498707721":1505.8669082864,"1500411729":0,"1500920738":0,"1501707049":1549.945040184,"1502235269":0,"1502620621":1769.4344566771,"1504907424":1970.4608098164,"1507011086":1390.5023027273,"1507332922":2397.8728428256,"1507774284":1308.948547975,"1508563965":0,"1512857430":1577.1141767118,"1515775640":1243.6250741657,"1518041298":1688.9209684568,"1518510268":0,"1519348229":0,"1519983797":2004.5346526204,"1520385101":1276.7817742915,"1520513992":0,"1522184936":0,"152251963":0,"1523330486":0,"1523645158":2126.3922279277,"1525551268":0,"1525867551":0,"1526363744":1766.2506177612,"1526496677":0,"1526624858":0,"1526976016":1379.8787648129,"1528579119":0,"1529011687":1499.5903720292,"152903211":0,"1529937689":0,"1530394259":0,"1530442140":1524.3227469,"1535345394":1658.7495899767,"1537635707":1604.6299874552,"1538966566":1680.866917849,"1539515792":2943.2173551759,"1541316145":1444.6795731919,"1541437811":0,"1541631847":0,"1542173395":1413.4238697034,"1543621842":0,"1546633713":0,"1547023723":2016.2085876254,"1547394567":1232.8314427996,"1548254728":1912.8440554296,"1548912992":0,"1558678323":0,"1559181224":0,"1559330514":2091.6580433632,"1559448771":0,"1560892380":0,"1561912001":0,"1563663979":0,"1565214769":0,"1565495532":0,"1565798166":1689.7569144085,"1567110694":2280.3143643878,"1568537869":0,"1569081897":0,"1569116237":1473.2523136772,"1571048900":1406.1279714442,"1572535871":2277.0238076464,"1575599751":0,"1576603106":2872.0290327119,"1576706031":0,"1577580678":0,"1577638784":1541.5405749918,"1579629689":1745.5352025872,"1580991625":2072.7264178313,"1582953363":1581.4963716166,"1583176635":0,"1583349779":1848.0912848518,"158335627":1793.3033536992,"1584359446":1967.5589835406,"1586756425":0,"1589710386":2124.1329592058,"1590024460":1922.9521758079,"159003173":0,"1590273508":0,"1590551370":0,"159231277":2140.0220703954,"1592995979":1235.6114196155,"1598113371":0,"1598128796":0,"1598976020":0,"1599758478":1421.7251191403,"1601603749":1380.1541980647,"1602330770":1168.6157473032,"1603806327":1625.9636825798,"1603834737":0,"1603972964":0,"1604381884":1880.0511044074,"1610031866":1242.8939284628,"1610939039":0,"16117382":1786.5491561897,"1614249365":1153.427255962,"1615136281":0,"1615798591":1301.9432665133,"161597751":1258.6719675401,"1616359180":1459.7513584849,"1618480669":0,"1619143061":1271.3776510163,"1620091732":1640.8976042503,"1620228801":1575.6324598387,"1620549524":2132.1944636902,"1620554900":1713.3954468582,"1621119601":1816.556997127,"162304303":0,"1627181507":2415.2802039252,"1627389455":0,"1627868267":1249.9947800752,"1628732610":0,"1628732687":0,"1629080001":0,"1629689602":1591.5492530876,"163006863":0,"1632383781":1825.4207082682,"1632602455":0,"1635315111":0,"163704669":0,"1637468390":1438.8988489545,"1640158797":2073.0124645606,"1642092986":2429.0940568399,"164313417":0,"1643291393":1439.5656079032,"1644032538":2301.4069974024,"1644520119":0,"1645223251":1505.3120825678,"1645809775":0,"1646187623":2290.9040038639,"1648003092":0,"1649292854":2059.4040623264,"1650421130":1225.3923012413,"1651110316":1868.1914861381,"165157096":1229.1709574783,"1652287983":0,"1652509718":0,"1653571628":0,"1655779586":0,"1656858690":1121.0677596555,"1658221095":1700.8505554268,"1658347329":0,"1658547847":0,"1659259166":0,"1659585642":0,"1661781078":0,"1665689312":1340.5559417151,"1670099365":1301.381757401,"1671137181":0,"1672314711":0,"1676080206":1653.7337081336,"1676364478":0,"1676853681":1423.5501543781,"1677121627":0,"1677761084":1161.6227767245,"1678691482":0,"1680726791":0,"1684031079":0,"1684868302":0,"1687003236":2105.7761215397,"1687104096":0,"1687639369":1929.9086934334,"1688453804":1588.9690763997,"1689171801":2005.3737929084,"1689274423":0,"168963992":1431.6864980883,"1690861934":0,"1691357385":2071.3208991938,"1691609067":2032.4773038683,"1692006284":0,"169260234":2453.9054896968,"1692861209":1249.9086403595,"1693120207":0,"1693289551":0,"1694505048":0,"1695696277":0,"169616499":1360.2184128413,"1697433369":2341.4506355884,"1697537146":1909.5535861652,"1698302709":2385.8072128533,"16997305":1708.812923679,"170017720":1165.2135167215,"1700620911":0,"1702334810":1871.3112059413,"1705265155":0,"1705502932":0,"1706210690":0,"1706598413":1303.022570497,"1708402068":2258.0069047781,"1709397559":0,"1709868853":1959.2696201953,"1712826586":2302.4005640818,"1713279396":1355.9817184778,"1714015866":2310.3824631335,"1715714434":1287.9002757199,"1716064379":0,"1716121258":0,"1716454945":0,"1716625654":1525.2146106195,"1716876773":0,"1717721751":0,"1717938721":0,"1721774399":0,"1722855645":0,"1723985703":2315.0547336936,"1725183127":1705.2545641354,"1728101846":1323.8236471852,"1729126971":0,"1729291424":1642.1446933109,"1729563423":0,"1729632427":0,"1730213489":2348.5159376523,"1730633271":0,"1732202044":1222.2354919459,"1733046404":2079.1911227043,"173367747":2127.5100545681,"1734419421":1629.5416832545,"1735669790":0,"1737160601":2134.5448970405,"1737197781":0,"1737726232":1316.2046992429,"173858556":0,"1742391300":1375.0376362104,"1742923454":1799.4635458535,"174306863":1225.3601348675,"1744896373":2126.6864346508,"174800301":1982.5085994817,"174896176":0,"1749795074":1295.8868965907,"1750704590":0,"1751494517":1301.4167433184,"1751556023":0,"1752876661":0,"175297842":0,"1753460304":0,"1756727384":1606.2185826486,"1757313368":0,"1757955047":1610.569398159,"1762249323":1402.0863615706,"1762990534":2185.5444704515,"1763436987":0,"1765623393":0,"1766481102":1257.8344655358,"1767826160":1929.3184180196,"177009894":1257.1556875655,"1770113758":1333.192050397,"1770146920":0,"1775341601":2312.9919953644,"1777414306":0,"1779691327":0,"1779771436":1735.8505509901,"178132881":1973.7407637067,"1782593021":1140.0534541481,"1783870964":1317.2976846981,"1784467838":0,"1784527717":1397.9519549403,"1785363546":2030.1021023033,"1785554828":0,"1785562293":1608.577875807,"1786275394":0,"1786656286":1548.4678056182,"178669910":1386.3256313989,"178720857":2415.7434855724,"1787510201":2583.9006314254,"1787879890":1396.5448074496,"1788564041":1805.5947071171,"1788773531":1464.5254961488,"1791591007":0,"1795607316":0,"1796150705":1874.6468976233,"1796587921":1924.964639491,"179744631":0,"1799515663":0,"1800599582":1495.3186477678,"1801481840":0,"1802692575":2189.3802630548,"1808561792":2005.2755755378,"1808920633":0,"1809536358":0,"1810947088":1854.0126399812,"1811191434":0,"1811529317":2566.5910742837,"1814552069":0,"1815012340":0,"1815395495":1926.7059583253,"1816159434":0,"1816814719":1563.2283814548,"181840890":1337.8472367494,"1819395589":1860.742934291,"1821672989":0,"1821812912":1547.0385279086,"1823999301":2078.5417326415,"1825399219":1904.2279434479,"1828505458":0,"1829348697":0,"183030256":1382.6941570342,"183184140":0,"1833766982":0,"1834196732":0,"1837402011":0,"1837734149":0,"1839844018":0,"1840192802":0,"184027593":0,"1840572711":1999.1208076854,"1840603422":0,"1843086828":0,"1844354140":2464.5077611012,"1844925263":0,"1846293530":1408.7923640745,"1848363653":0,"1848372638":0,"1849060569":0,"1850684924":0,"1850921957":1350.5883729249,"18516592":0,"1853031865":1917.1049672432,"1853208613":1172.0548998046,"1856172895":1917.2145829853,"185620528":1487.5826663483,"1856992647":0,"1857363494":0,"1857526630":1797.5851607225,"1858278973":1945.5095833982,"1858334582":0,"1859819274":1680.82425993,"1861285155":0,"1862854561":0,"1863065807":1277.8260125315,"186354366":0,"1866851323":2029.4024513478,"1869987706":0,"1871665913":1498.1542511841,"1872112615":0,"1872306454":0,"1872693779":0,"1872980159":1570.8347522104,"1876544260":2483.9435767299,"1878147567":1894.5496928891,"1879020884":1545.9654593951,"187940940":2208.5532172086,"188352287":2481.8722909195,"1888433713":0,"1890921841":1496.6441112156,"1894806233":1214.542864891,"1895265333":0,"1896099954":0,"1896286191":2201.6219336792,"1900062857":1294.7724244077,"1901788005":0,"1903617238":1839.9203623221,"1907819963":1279.7669712099,"1908656857":1294.2819324126,"191054580":0,"1910869482":0,"1911968707":0,"1912276022":2096.6098086765,"1913049602":1718.8256321624,"1913093520":0,"1913772288":2023.4303440211,"1915453170":1152.1494742874,"1915472102":2172.3890687963,"1915862517":2768.8154223451,"1916011706":0,"191620507":1314.8600143277,"1916400350":1916.0689858272,"1917964581":0,"1918172852":0,"191868779":0,"1922249884":1348.577010609,"1924690238":1787.2310751136,"1927271954":1241.5775825621,"1931269506":1314.3600610974,"1933270834":1358.3561730566,"1934109716":0,"1937730923":1540.5750839091,"1938120357":0,"193891104":0,"1939591666":0,"1940606693":0,"1941288004":0,"194431856":0,"1944526967":2040.5621123027,"1947285534":1507.1617507911,"1947586492":0,"1948562758":0,"1950501535":1680.1353258588,"1950962783":2272.1122260637,"1951198460":1828.6438563573,"1952470548":1187.1344261572,"1953428992":0,"1953613506":0,"1954801587":2000.8441804448,"1955132435":0,"1959436312":0,"1959774558":2133.1003195919,"1959869314":1544.8391626032,"1959906977":1141.2363999461,"1961138257":2530.6905139914,"1962061945":1912.1926699881,"1962441710":1563.9451046163,"1962595835":1260.9112824221,"1964424077":0,"1965294189":0,"1965686195":1752.2621077596,"1965849899":1784.3506628869,"1966056783":0,"1966082997":0,"1967582342":0,"1969742700":1208.0417047337,"1970717834":1333.3138174157,"1971257507":0,"1972717643":0,"1972718658":1962.2005269503,"19753391":1519.2070276362,"197546078":1280.2941647587,"1975607113":1938.0586460002,"1977084622":0,"1977813892":0,"1979291413":0,"1980479000":2146.639581998,"1982730574":1157.6407631819,"1983440257":0,"1987916479":0,"1988055821":0,"1989002691":0,"1992185659":0,"1992807056":0,"199553622":1254.8626139269,"1995566378":0,"1997275023":1607.0005715974,"1997404036":1759.2287478055,"1997507835":0,"1997987860":2091.3820373571,"2000679742":2115.0911494487,"2001412357":0,"2001540741":1762.0307532652,"2003223492":0,"2005932973":0,"2006213514":0,"2006522396":0,"2006725411":0,"2007370712":1282.5186784876,"2010735377":0,"2011226653":0,"2011811439":0,"2012204931":0,"2012982950":1793.3037316825,"2014057820":1565.2483424929,"2015120605":0,"2015814436":0,"2017058203":0,"2018559703":0,"2018741992":0,"2018971200":1327.0282989915,"2019191135":1720.7470612766,"2021188790":0,"2021376917":1663.1853149056,"2024934932":1701.5735371897,"202527271":0,"2025736930":0,"2025960825":0,"2027773900":2178.4249114144,"2028541392":0,"2033240857":0,"203427637":0,"2035240287":0,"2035720970":1867.9916069568,"2036550762":0,"2036642817":1259.949137745,"2037819195":0,"2037923639":0,"2038074520":2292.1434666805,"2038782260":1787.4514432151,"2041342956":1734.8208369949,"2043678372":1286.7934718934,"20438516":0,"2045578042":2000.8021428612,"2046332745":0,"2046402802":1692.5884631801,"2048723677":1599.2720584736,"2049140185":2540.438150736,"2050291763":0,"2051026474":0,"2051273831":1262.100652797,"205364228":2027.3839266711,"2054972194":0,"2055099648":1249.2572200035,"2057048497":2276.4233585631,"2057246561":0,"2059004815":0,"2060154218":0,"2062472427":2281.8816902545,"2063386346":0,"2066655774":0,"2066860654":0,"2068027715":0,"2069508857":0,"2069762192":1962.3314335449,"2070962878":2104.7441214305,"2074201652":1574.7542247682,"2074713320":1530.6451141787,"2076283496":0,"2077283915":2132.06233459,"2078083870":0,"2080495144":2460.3152437576,"2080861390":0,"208434464":0,"2085579974":0,"2085973602":0,"2086212420":2034.9740902393,"2087368801":0,"2088822497":1203.0737869081,"2088911620":1947.8832856412,"209121812":2051.0879431258,"2093417498":0,"2094034129":0,"2094685164":0,"2097099950":0,"2099267983":2014.2979320644,"2100511060":0,"2101009140":0,"2102124703":1521.7133617698,"210217684":1358.152613403,"2105184024":0,"2105190288":0,"2106508430":0,"210734267":0,"2107686904":0,"2108728330":1614.4877804672,"2109002994":0,"2109320577":1317.4638832497,"211245592":0,"2113446044":1928.7961204946,"2115947356":0,"2117244239":2158.7683843245,"2117678052":0,"212097244":0,"2122371082":0,"2122542522":0,"2123032733":0,"212376193":1730.3052054913,"2123999060":0,"212627710":1809.8192888474,"2129258263":0,"212930587":2250.2578740769,"2130827066":2857.6543956169,"2131267381":0,"2135327933":1417.3934930077,"2135431142":2559.4351004238,"213777418":0,"2137857715":1611.7621820686,"2137931406":0,"2138367939":0,"2140116935":0,"214184041":0,"2142283134":0,"2143044442":1861.4906863586,"2144998386":1877.8983358307,"214508087":1370.4186698287,"2146548018":1387.9431104106,"2147315027":0,"2147986859":1308.9617729374,"2150121610":1541.348438509,"2150479645":1624.9775945043,"2152298441":0,"2153157695":1628.5072578803,"2153390386":0,"2154511916":0,"2154696316":1223.3861903833,"2155229246":1868.9864493463,"2155696628":0,"2156152723":0,"2160714813":2100.3248877105,"2161204569":1317.9207508583,"2162382478":0,"2164084926":0,"2164343480":0,"2165999334":0,"2167794143":0,"2168242954":0,"2168825861":1231.999241335,"2169396423":0,"2169721379":1724.394164934,"2170025879":2381.625583289,"2172902585":0,"217467576":0,"217546662":1500.8381829812,"2176047848":2036.7206020719,"2180877898":0,"2181231700":0,"2182253577":1994.3618892548,"2182388811":1588.3835994255,"2182831583":1678.5871762113,"2184297331":1233.5034839998,"2184686055":2455.8244137907,"2185596896":0,"2185644087":0,"2187172880":0,"218781353":1897.1863301576,"2188606245":1231.6157956848,"2191074840":0,"2191726075":1835.4868365659,"2192121612":0,"2192706389":1365.2269076492,"2193040547":1213.4070467355,"2193251345":0,"2194073999":0,"2194441263":0,"2194831616":0,"219694070":2324.1192580053,"2197356984":1648.3540381514,"2199036891":1401.2246983038,"2199938357":0,"2201727713":0,"2201981126":1505.82499953,"2203655753":1786.9268132617,"2204380301":1396.1044458638,"2204914887":1841.4067816266,"2205913729":1530.495439788,"220599685":0,"220667062":1333.2008827592,"2206719747":0,"2207624249":0,"2207905219":0,"2208494667":0,"2208585097":0,"2213463441":1985.2417520906,"2214262554":1880.5909929633,"2214824906":0,"2216360450":1837.8252904904,"2220648902":1786.688543054,"2222019296":1561.0553908973,"2226311468":0,"2228358934":1701.4341867571,"2230494217":0,"2232175898":0,"223285376":1206.5675296817,"2235555306":1504.8237159326,"2235724788":0,"2235840093":0,"223690290":0,"2238247137":0,"2240198172":2405.3375364501,"2240876068":1897.3309169423,"224100421":2978.7961959355,"2244707838":0,"224630615":1940.2116985812,"2247018180":1334.5708444649,"2247565255":0,"2248212771":0,"2248507270":2220.0903365738,"2249312740":1490.2370387981,"2249355269":1281.9771427903,"2249490":0,"2249718139":1793.8027487553,"2249810515":0,"2251334448":2381.479024858,"2251945224":1933.2169470617,"2252317011":1702.4962514406,"225263285":0,"2254789488":0,"2255777157":0,"2256129159":0,"2257250428":0,"2257308276":0,"2258141933":1850.4091449367,"2258165342":0,"2258623827":2190.1757477854,"2259000228":1436.3892315914,"2259176301":0,"2260151323":1748.1339100823,"2262588000":1332.622596763,"2265344721":2203.5694828019,"2265657217":1822.1301265412,"2267593455":0,"2270005002":0,"2272805308":1255.9002796024,"2274658324":1317.9521104466,"2277934665":0,"2279246890":2038.8592725467,"2279730191":1676.5007365375,"228115268":1549.9747683007,"228284311":0,"2284449411":0,"2285069816":0,"228551495":2277.7923804151,"2285522737":1181.5839867359,"2285940610":0,"2287172046":0,"2290049338":0,"2291083428":0,"2294942579":1873.0367582475,"2295408709":0,"2296253743":0,"2297518953":2327.4743300299,"2300589345":0,"2301924247":0,"2302244531":0,"2303671714":0,"2304874524":1674.5365205597,"2305702963":0,"2306188300":1207.7810914125,"2310137574":1152.1377893605,"2310396":1377.1913915125,"2310675124":0,"2311001320":1472.7864965062,"2312427727":1322.8302750313,"231349873":0,"2313819845":0,"2313861896":0,"2314357296":0,"2315979719":2711.8717381409,"2316551160":1779.8364613072,"2317418982":0,"2318221471":0,"2320468943":0,"2321187859":0,"2321482871":1346.9594471871,"2321691552":2486.2339675701,"2321913205":1711.4873176824,"232328045":0,"2323533689":1260.8697515006,"2324786150":1392.6601629182,"2325031714":0,"2329981708":1246.0341186297,"2330175182":0,"2330317080":1435.9559888935,"2330484730":0,"2330647155":0,"233297408":1278.0092842613,"2333592799":0,"2333659184":1360.0511262593,"2335420481":2444.6660756903,"2335538835":1896.1411567598,"2335778252":0,"2336939814":1405.5786892723,"2337606731":2060.0720834082,"2338718635":0,"2340825815":0,"234098869":0,"234159120":1558.4971807039,"2344727128":0,"2347359100":0,"2347660974":1979.9454101467,"2348343671":0,"2348993490":1460.9105672071,"2351647332":0,"235206650":1428.1443796872,"2353125510":1483.8137189709,"2354481551":0,"2355594556":1867.8619694847,"2355716390":1324.1714505166,"2357679638":1845.6611654401,"236080983":1931.7335479582,"2362247131":0,"2363229918":0,"2365177563":0,"2365828386":1229.4850365142,"2368071046":2175.1190473433,"236837608":1875.4217845362,"2368750036":0,"2368832701":0,"2369389100":1361.5824742947,"2369595129":0,"2369761961":2036.7410194704,"2370285073":1765.5654059263,"2370755498":2057.4788263111,"2371431943":2277.3595662538,"2371969629":0,"237326824":2364.3455634374,"2373279761":0,"2373608335":0,"2374166461":0,"2374192694":0,"237462896":0,"2375501212":2448.4455464535,"2375816517":1607.7036437819,"2376531005":0,"2377767456":1694.433951503,"2380816309":1198.5705825982,"2383026168":0,"2383092679":1489.7210915287,"2384194086":1207.3151378208,"2385909936":0,"2386103127":1354.1247827015,"2386809488":1270.0775640451,"2386982504":1712.4010133221,"2388556480":0,"2390584088":1354.5231125217,"239079794":1928.2304187946,"2391605505":0,"2393134541":0,"2397274802":1609.7858209851,"2398941022":1395.9639246414,"2400947874":2152.8032001597,"2401052346":0,"2402216688":0,"2404871340":1336.9494482313,"2405342085":0,"2405658749":0,"2406786533":0,"2407589215":1931.0849921121,"2407640855":0,"2408289758":1172.5106645463,"2409750542":1908.3866125757,"2410692850":1541.3741526845,"2412340751":1646.1765343383,"2413930996":0,"2415029607":2571.552028121,"2417537933":0,"2418375843":0,"2420716906":0,"2420933825":0,"2421996109":0,"2422059385":1915.2628132733,"2422080240":1418.8205349928,"242229728":0,"2422423692":2053.354609292,"2424933436":0,"2425741756":1725.1995150882,"2428818859":1561.2655635205,"2430051677":0,"2430259702":1714.6960124182,"2431129875":0,"2433168244":0,"2434134348":1490.8990184504,"2434964692":1443.2353621969,"2436117632":2610.0826855063,"2436413676":1836.536348078,"2436753495":1432.9593207076,"2442045936":1341.2659819842,"2442896853":0,"2443834680":0,"244758471":2135.5738659086,"2448413931":0,"2452001178":1161.8236318927,"2453198602":0,"2455085538":0,"2457264374":0,"245796778":0,"2460331500":1702.4387527636,"246275746":1523.4113866454,"2464323261":1389.331169471,"2465331178":0,"2469022748":1273.0588534723,"2469933695":0,"2471701670":0,"2471898191":1979.1323403633,"2473812468":2363.5096568214,"2475848461":0,"2479293617":1855.377046154,"2480987547":1302.7005460171,"2481240580":2607.9418744903,"2481973138":0,"248789391":1851.7255023016,"2488004222":0,"2488135056":2529.5251086936,"2491402608":1191.3681720998,"2492032151":0,"2493144905":0,"2493499746":2147.1828941776,"2493528114":0,"249363528":0,"2494605157":0,"249521607":1633.6202302555,"2496465634":1428.712905903,"2499674936":0,"2500271603":1540.2351411176,"2500987303":0,"2502228330":0,"2502903776":0,"2503581045":0,"2503951076":1407.5442381391,"2504097527":1751.5101577001,"2504384020":0,"2505184572":0,"2509232431":0,"251006919":2022.3137128296,"2510392129":1990.2800994214,"2510517613":1521.1616133347,"2511234285":0,"2513347763":2217.8090802563,"2513980161":1501.1152614679,"251533366":0,"2515340929":1155.4545579447,"2519726489":2433.3767704629,"2520941920":1364.6787168645,"2521216381":1652.5809810428,"2521310070":1324.5320836804,"2523329139":0,"2523374000":0,"2526467539":2241.5199974312,"2526914852":0,"2529461898":2015.7291888336,"2529652202":0,"253015942":0,"2530621646":2233.963903408,"2531808875":0,"2532000263":0,"2532136306":0,"2532708840":1695.2832486322,"2534016591":0,"2534323731":0,"2534500893":0,"2534714311":1591.4725328821,"253585197":1880.4226853663,"2541052146":0,"254218602":0,"2542321733":1919.1749818083,"2544348147":1166.78818332,"2546467088":1883.3541964032,"2548029026":0,"2548478453":0,"254983687":3018.4940165727,"2550811240":1266.341468955,"255204169":1260.870208308,"2553352145":1404.1839222,"2553787403":0,"255657392":1693.4495728383,"2559668419":0,"2560027362":2001.2074132383,"2560538129":0,"2562103296":1351.4184681108,"2562869066":0,"256288757":0,"2563069268":0,"2563394539":0,"2569057399":1241.5396695569,"2570139767":0,"2572143666":1335.0295688697,"2572232151":0,"2572461200":0,"2572867035":1184.795721284,"2573075022":1772.9528456848,"2573211912":2396.6770372863,"2574605858":0,"2575372610":0,"2575656476":0,"2576790821":1519.1715594347,"2577818967":0,"2578391134":0,"2578600625":1249.8425270142,"2579010831":1663.2612318917,"2579112355":0,"2579491041":0,"2579679937":2432.713399111,"2581904260":1154.828067979,"2582233376":1234.7692637513,"2582430711":0,"2583029056":1896.4053993495,"258313482":0,"2586044711":1412.3053230205,"2588374358":0,"2588489114":1697.2356875149,"2589865335":0,"2590774847":0,"2591484771":0,"2595565556":1303.3201984827,"2595697191":1169.4209117977,"2595882232":1969.9845549158,"2597701503":1151.5250329621,"2598780139":2219.3465296423,"2599242307":0,"2600147563":0,"2600262554":0,"2600395028":0,"2603031099":0,"2604144466":0,"2604690450":0,"260479518":1843.2383664194,"2605448197":2449.1323757838,"260623190":0,"2606916888":1454.3901912166,"2609641077":1651.5845871727,"2609962764":0,"2610426510":2376.8658923518,"2610864298":0,"2610865464":0,"2612530279":1675.761234741,"2612627798":0,"2613694816":0,"2613974860":1896.7975214446,"2613979956":1483.3041242255,"2615198346":0,"261533544":1954.2533254344,"2616191739":0,"2617125781":0,"2617837584":1448.1207963663,"2618479578":0,"2618637580":2391.657270733,"2619603225":1526.2429110307,"2621107821":1187.1641565458,"2621480860":1250.0975318308,"2622232119":0,"2626303746":1386.1200017827,"2626440500":0,"2628400239":0,"2628574755":0,"2629528696":1347.5885281778,"2629734466":0,"2630527363":0,"2630992864":0,"2631177392":0,"2631196608":1990.7738526153,"2631420913":1998.889914712,"2632738906":2164.8287157213,"2633929455":0,"263409464":0,"2634124873":0,"2634383093":2133.9592509012,"2634690453":0,"2635424294":0,"2636727819":0,"2637994881":0,"2638444930":0,"2639105050":0,"2640785054":0,"2640877802":0,"2642386680":0,"2643077516":0,"2643883804":0,"2645404069":1532.3349133769,"2646645546":1436.1125054038,"264755561":0,"2648057035":2615.1468269481,"2651582555":0,"2651875294":1643.1325351423,"265213405":2381.2160234811,"2652913230":0,"2653876812":0,"2654590324":1659.6231386056,"2654831659":0,"2655169339":0,"2655862888":1245.2999833877,"2657502607":1392.3629194433,"2658427199":0,"2658657252":0,"2659424902":0,"2660105967":0,"2661403855":1533.3376144199,"2661850381":0,"2661929533":1377.6120218199,"2664015237":1504.9263037499,"2664544460":0,"266469116":2561.7794931859,"2665985011":0,"2666352866":1328.7281033317,"2668311333":1891.8455273506,"2669738738":1435.3564963722,"2670146102":0,"2670735101":0,"267105112":0,"2671757819":1817.5282352022,"2672352527":2507.9960044659,"267246445":2581.9961985753,"267587420":1257.1166915286,"2676463244":2619.7016189999,"2677897468":0,"2678350009":1710.3243520032,"268029565":0,"2680668911":0,"268097121":1721.1964988483,"2681170798":1269.8118442786,"2681795867":2124.0317207867,"268274286":1759.0197295594,"2683746085":0,"268471907":1822.3170524016,"268498493":0,"2687486440":2362.6480880348,"2688493082":1762.3115124143,"2688612867":1184.4264833435,"2689567416":1188.6470369782,"2690606528":0,"269077288":0,"2691544887":2024.3797833173,"269219514":0,"2692580018":2071.6322841217,"2693685785":1509.5432131875,"2694109670":1405.7482709086,"2694237057":1242.6172898768,"2695383302":2184.5241011615,"2695613806":1496.1462748679,"2697040026":1294.0257382852,"2697534725":2069.7848729824,"2698936427":0,"2699690813":0,"2701115423":1889.4554322242,"2704310299":2053.7468090497,"270435993":0,"2705053633":0,"2709105566":0,"2710343893":0,"2711761019":2479.3282985529,"2711929003":0,"271335539":2034.9420578559,"2714484334":0,"2715109000":1559.9709348417,"2715798469":0,"2716044195":0,"2716169684":0,"271664224":2069.4030284676,"2716747123":2022.4752963768,"2717395786":0,"2717768736":0,"2718567180":0,"2719065978":2092.0222850837,"2719330296":2561.508149216,"2719928959":1619.505461912,"2720318685":2758.9704056427,"2721035468":1533.9285875234,"2721924500":0,"2722367436":1782.9801784101,"2724880133":0,"2725160392":1637.0082208814,"2726967243":0,"2730930360":1763.6404758359,"2731154173":1654.0793660142,"2731213430":0,"2732657659":1596.9852244916,"2733655053":0,"2734248382":1709.1461451873,"2735085930":2096.6201393558,"2735293288":1430.3429533629,"2735453204":0,"2736390850":0,"2737172644":0,"2737402297":1369.614440152,"2741739967":0,"2745040429":1678.6245760413,"2747291591":2395.8765531206,"274815330":0,"2748231496":0,"2748555921":0,"2749155125":0,"2752494454":0,"2754272500":1324.1757200103,"2754546565":1248.7224675206,"2756999860":0,"2757319898":0,"2758231762":0,"2758653794":0,"2758696959":0,"275986604":1865.3441063734,"2760734604":0,"2762853048":1975.5726300727,"2764953948":0,"2765939834":1234.7084656358,"2768437968":2358.9669560824,"2771270445":1708.7056764058,"2772237177":0,"2772831251":1759.0470795449,"2774491833":1429.9599761889,"2775325601":0,"2775344327":1387.7347071166,"2775508810":0,"2775921161":0,"2776150092":1881.6810367589,"2776357853":0,"2777625264":1521.1768537583,"2777743854":1860.5166780235,"2782100417":0,"2782517328":1850.8490524791,"2782890042":0,"2783546107":0,"2783905922":0,"278391428":0,"278493845":1541.7840320661,"2785029557":0,"2786534786":1690.1655236843,"2786999216":1371.8092952004,"2788838402":1786.4753467293,"2791285030":0,"2792312732":1444.2068009303,"2792663761":0,"2794667518":2429.6705422448,"2795839755":0,"2795952868":1467.7383709213,"2796999710":0,"2797831681":1268.5768566953,"279921423":0,"2799632565":2476.7727985927,"2799898824":0,"2800289700":1856.6336926997,"2801113468":1453.1833769825,"2802523525":0,"2802681137":0,"280396343":1268.0287696194,"2805340615":0,"2806136994":2231.8099102949,"2806558939":1876.3611046625,"2806765401":0,"2809882420":1562.9186033202,"2810226521":2040.539289037,"2811110978":0,"2811209697":1279.7894769956,"2812871030":1746.135917977,"2817202669":1420.3698647434,"2817465096":1876.3854625677,"2818199514":0,"2818493377":1613.2485081262,"2818810857":0,"2818984798":0,"2819110526":1885.9015646531,"2821066759":0,"2821965653":1257.7670945029,"2823295914":0,"282466705":1752.9555725796,"2826164889":0,"2827089777":1855.561153694,"2827658293":0,"282802217":1362.7144100401,"2829216648":1355.3825442341,"2829252669":0,"28298643":0,"2832741065":0,"2832770135":0,"2833016658":2129.7051442916,"2833179922":1249.4294341104,"2833491097":1455.8516200241,"2835500769":1351.6909336495,"2836143893":0,"2836390896":1242.9383307344,"28373825":2157.5814371481,"283849083":0,"28387341":1868.9146755896,"2841712876":0,"2841881996":1198.4180401014,"2844126076":1259.5707438932,"2844316244":1207.7491943483,"2844666696":1315.4085759361,"2844670670":0,"2844675085":1307.5663523368,"2845488076":2575.9570281316,"2845865407":0,"2845929476":0,"284708083":2392.0799451298,"2850260537":1446.4280778775,"2851269000":2294.8289305714,"2853983730":0,"2855675520":1360.421258727,"2856501208":0,"2857257236":0,"2857979415":2077.5054883516,"2858385254":0,"2860419980":1369.0053354603,"2860632733":0,"286069565":1460.9610936441,"2860849459":1882.0842446557,"2862855056":2170.1079846744,"286585708":2272.4412003208,"2867135222":0,"286718649":1817.0597073686,"2868656571":1623.9443250479,"2871847316":1562.7212466716,"2874032831":1532.2539947529,"2875235685":1244.8064626533,"2875388393":2068.806637566,"2877331205":2221.7336557442,"2880212557":0,"2882449995":0,"288305998":1381.2168789318,"2885795135":0,"2887178574":0,"2887492330":1550.4297615307,"2887872471":2397.9722495587,"2887915717":1602.7242171967,"288912613":2610.9906730644,"2889905668":1680.0815931601,"2890033615":0,"289054660":1307.3265298181,"2890702645":0,"2891293644":0,"2893112489":0,"2893302110":0,"2894413444":1664.7703749741,"2894984014":0,"2896936333":2118.7923652824,"2899114132":0,"2900835893":0,"290394387":1337.6115578703,"2904534885":1983.70440706,"290469472":0,"2906372689":0,"2906626601":0,"2907430999":0,"2907477166":1218.9011436003,"2908043044":0,"2908242202":2640.3824813624,"2910887198":0,"2912571228":1808.5754920785,"2912901265":0,"2913358439":1249.7515196656,"2914198967":1641.9424376927,"2919642920":1913.6704728453,"2921275572":2533.7796160302,"2921363389":1871.8245218615,"2922912159":0,"2923349215":0,"2923893711":0,"2924722129":0,"2925535868":2765.2533837781,"292566381":0,"2927708041":0,"2929435421":0,"2929737515":0,"2931755222":0,"2936931094":0,"2937149161":1216.9550221615,"2937224937":1405.8442434352,"2938025699":0,"2938169108":0,"2939618078":1626.3266982141,"2939895760":2502.5176603922,"2940442922":0,"2941821802":1228.630993648,"2941915891":1286.3167937403,"2942569006":0,"2942833315":0,"2945497882":0,"2945726008":2647.8258771458,"2945975892":0,"2946534771":1201.7686271329,"2948030094":1214.703724776,"2948668320":1473.7057465272,"2949409019":1337.3722299775,"2950336182":2076.8975497986,"295088238":0,"2956439807":2328.4294689238,"2957762475":0,"296151509":2364.3930657709,"2962478235":1274.7596170193,"2963413938":2081.8087755451,"2964379464":0,"2964689219":1808.787108831,"2965139328":1426.7144554733,"296740468":1655.6433885989,"2967621636":2225.3877535768,"2970227389":1282.4111853142,"2970771602":0,"2972412900":1548.0854419238,"2972764344":0,"2974872053":0,"2975776867":1164.5575871589,"2976472096":0,"2977235574":1556.8824239708,"2980355580":1558.1421869292,"2981004463":2539.863726397,"298215454":2126.1931814161,"2982198446":1324.3520304377,"2986133546":0,"298794774":0,"2988189921":1193.9819783429,"2988782714":2079.9846866239,"2993182441":0,"2994488407":0,"29974146":0,"2997800679":2389.9634276167,"3000728502":1479.0110934646,"3006111591":0,"3006434957":1328.513147726,"3007102778":1489.0102202162,"3008054233":1226.2960135431,"300846689":0,"3008885805":0,"3009824135":0,"3010901510":1405.0021415178,"3011717282":0,"3012034950":0,"3012401904":1324.2140587436,"3013367275":1263.2728668041,"3014957498":1364.154859918,"3015354306":2457.115574186,"301567212":2056.2598215101,"3016140328":0,"301734990":1648.341757882,"301753506":0,"3020603346":2094.592426537,"3021409572":1205.6698455508,"3021563284":1671.4657554194,"3022128117":0,"3022905195":0,"3023056451":1265.8320564115,"3023068102":1845.0428731248,"3023386017":1989.5369509422,"3024031273":1794.6129370985,"3026486305":0,"3029042062":1235.9216009709,"3030939616":0,"3033578529":0,"3033778664":0,"3036629795":0,"3036702868":1413.0376809608,"3037047822":1248.8026990632,"303821987":1376.4549624575,"3039372847":0,"3039695626":0,"3042113223":0,"3042599528":0,"3042739559":0,"3044209556":1246.0141927368,"3048586035":1115.8258444602,"3050888295":0,"3052741649":1491.4638194905,"3052763610":0,"3054721758":1199.2392672964,"3054917007":0,"305518406":1264.4778916192,"3057194499":1176.4547272896,"3057254301":0,"3057587548":1802.2256875356,"305762053":2092.4861692502,"305789656":1167.0749837258,"3058790867":0,"3059718647":0,"3061824471":2558.3297484354,"3063296642":1569.1579260438,"3065232387":0,"3065742618":1873.0424923433,"306595116":1640.9591585343,"3066842082":1288.1970048184,"3067908479":1953.137726744,"3071090507":0,"3071565639":0,"3072879804":0,"3073027638":0,"3073583780":1414.4918812526,"3074518984":1246.3593898992,"3074557522":0,"3075022101":0,"3077002187":1461.2892510067,"3077217367":2048.0976546787,"3077259720":1722.3088173214,"307769453":1817.224026292,"3078556108":0,"3078609754":1144.9508874557,"3081794904":2198.3290662783,"3082325802":0,"3085208156":0,"3087387634":0,"3089019377":0,"3091785544":1231.8671440198,"3092398094":1405.123188264,"3092850192":0,"3094069966":0,"3094793771":0,"3098562302":1718.9772466681,"3098982613":1271.7055549365,"3099950101":0,"3100993645":0,"3102719435":2158.8988728254,"3102780834":1432.0967926378,"3104122930":2284.4463940346,"3104482374":0,"3105635512":1938.2224916289,"3105899717":0,"3111378170":0,"3116000782":0,"3117661899":2050.715977457,"3118022376":0,"3118895370":2368.6674771307,"3119137809":1240.829758176,"3119606051":1633.1789521619,"3121754844":0,"3123299347":0,"3123575090":2210.3503183571,"3124896474":1913.930869473,"3126143245":0,"3126153106":1282.1502428906,"3128004049":1380.0192844155,"3130296264":0,"3134274088":0,"3135227116":0,"3135662522":0,"3136260573":0,"3137406326":1360.3005775112,"3139221174":1382.5129151601,"3143101757":1548.1751146981,"3144113364":1438.223135905,"3147357769":1199.4477805501,"3147772108":2621.1208072273,"3148467486":1665.1885910815,"3152421262":1731.5555445321,"3153044061":0,"315307043":2346.5717839654,"3153125580":1357.6553050616,"31547081":0,"3156996757":1405.8938478338,"315817700":1300.9041426403,"3158353268":1375.4261931199,"3158438690":0,"3158785397":0,"3163189151":0,"3164365433":1501.6846714598,"3165325622":0,"3167447804":0,"3167797510":0,"3168538687":0,"3168618130":1293.4904281819,"3168914756":0,"3169129420":0,"3177194252":1192.9770230345,"3178253488":0,"3179731139":0,"3180919205":0,"3181284261":0,"3182582646":1295.0947625986,"3183111073":1344.226133202,"3183288856":1306.2821637677,"3183331658":0,"3183792133":2499.5640490579,"318431049":0,"3184596428":1945.7515607928,"3184774485":1295.4970938463,"3187405082":2709.4067070911,"3188904029":1672.1678031263,"3189584402":1257.7082143289,"3189918628":0,"31900963":1345.737168609,"3193935538":0,"319427731":2011.3542735398,"3194441729":0,"3194493363":2246.8671174565,"3196334031":0,"3197252162":0,"3197325121":0,"3199967964":0,"3201195359":2145.183995267,"3202447407":1911.7063530593,"320329751":0,"3203568204":0,"3205928742":0,"3210489850":0,"3210707661":0,"3211790430":1536.5893223179,"3214093273":0,"3214600049":1636.6877598712,"3216210693":2043.1015779104,"3216682975":0,"3219095278":0,"3219158198":0,"3221082803":0,"3221190981":0,"3221222128":1499.3290269267,"3223207411":0,"322371543":0,"3226814527":0,"3228686257":1917.4314822412,"3229303052":0,"3230369611":1744.7611048301,"3231265233":2068.0043466118,"3231924477":0,"3233473889":0,"3235710031":1892.1600619469,"3235832569":0,"3236532355":0,"3237331717":2070.2102619334,"3237851921":1979.1112273597,"324121992":1508.1169489285,"3241642216":0,"3241798110":0,"3241941552":0,"3243357093":0,"3243386336":0,"3243872254":1264.2868345638,"3246372293":1348.670191438,"3246928465":2275.7337818748,"3248412457":1496.2502937005,"324872429":1203.7504950404,"3248742764":0,"3248828921":0,"3250155411":1580.3620959714,"3250523305":2286.1378742318,"3250902571":1450.0534545623,"3254374161":1447.0268321102,"3256507952":2116.3244842355,"3257900717":0,"3259259158":2350.0380300939,"3259782681":0,"3261146465":0,"3261672467":1679.2607152001,"3263150913":0,"3263342549":0,"3263418042":0,"3263594037":1777.3786570233,"3267047320":1541.6176288991,"3268382520":0,"3270667849":0,"3272610079":1536.7018543075,"3275619185":1806.5891699944,"3281498525":1428.6729861424,"3282812734":1407.9870845299,"3283031002":0,"3283376524":0,"32848909":1234.058537565,"328764621":0,"3288770916":1242.4710735813,"3290623649":1175.5552151972,"3292003032":0,"3292459840":0,"3292775470":0,"3292810974":1658.6836278802,"3294328613":0,"3298734473":1822.9768689716,"3300902320":0,"3301142471":0,"3302229375":0,"3302467434":1952.7073399331,"3302810206":0,"3304159418":1804.5283324227,"3307683900":1992.0032292739,"3308257979":0,"330899243":1648.0880791614,"3309137757":0,"3309376526":0,"3312226061":1468.8739273624,"3313294758":0,"3314430913":0,"3314612233":0,"3315363657":1961.4987013156,"3315441800":1753.4775753993,"3315472808":2234.9191877602,"3317643285":0,"3319568401":0,"3320085335":0,"3320294201":0,"3321963457":1585.5793143983,"3325416067":0,"3328810166":0,"3329709268":1710.1120861153,"3331711837":0,"3332596820":0,"3334241084":2073.048019317,"3334808342":1370.6144908238,"333630853":1732.7813534239,"333667858":1361.6459603518,"3336959867":1834.868034709,"3337273246":1679.5737760149,"3337589064":0,"3340682501":0,"3340717494":0,"3341470372":1690.9043557462,"3343040098":0,"3344221047":0,"3346548045":1252.7479413966,"334656901":1256.0514740971,"3347724858":1355.5386161215,"3348324694":0,"3348466517":1179.1495967491,"3348570525":0,"3350592310":0,"3351145874":0,"335140403":1543.1204810684,"3353015937":1534.325005151,"3354310865":1221.8477681772,"3354474202":0,"335486990":1257.264923599,"3355469687":1749.5432375672,"3355865266":0,"3357587389":0,"3357632986":0,"3363218765":0,"3363685518":1768.9138093037,"3363896578":0,"336413363":0,"3364926717":0,"3365665787":0,"3369476122":2367.4705934718,"3370131507":1382.7178688716,"3370261058":0,"3371445858":1515.1162664342,"3372525938":0,"3374028315":0,"337441895":2020.6775180586,"3375593429":2175.7874705227,"3375672025":0,"3376280260":0,"3376945874":2109.9830154953,"3379746851":0,"3379897372":0,"3381061806":2695.809667046,"3382549811":1332.6187879411,"3383627644":2010.5524756946,"3383805178":1768.623896829,"3386206172":1383.775103528,"3386255965":1303.7347742929,"3386498966":0,"338661942":2356.5811122453,"3386819075":0,"3387998069":1969.2019235672,"3389539253":0,"3391560370":1631.338145683,"3396007304":0,"3397262203":0,"3397964824":0,"3398027261":1802.7875657754,"3400286463":1215.7827321325,"3402568700":0,"3403473925":1550.0978082682,"340499017":1217.1184374247,"3405519099":0,"340770494":2003.5794613668,"340860484":2011.9703133514,"3410974541":1352.7250049956,"3411465392":1118.1080334618,"3412927472":1300.8009461582,"3413400617":1502.2633100489,"3421555360":0,"3422315602":1695.0815222626,"3423908263":0,"3424505272":2197.0951445919,"3427404671":0,"3429532354":1797.7466000366,"343052836":1478.8676835951,"3430688223":1416.4124723866,"3430988573":2661.0670044656,"3431920158":0,"3432459628":1722.8129701098,"3433288749":0,"3433602336":1976.7214151234,"3434976181":2062.3601158741,"3435556540":2060.379991517,"3437227213":1195.7512695571,"3437839264":1480.1120711991,"3438031469":0,"3439053581":0,"3439295659":0,"3440205245":1241.9262857175,"3441921832":0,"3444219926":0,"344495691":1443.0697629277,"3444975876":1886.7040111218,"3445174361":0,"3445184694":1199.8592887103,"3445657861":0,"344756565":1632.0191837349,"344813892":0,"3448832663":0,"345204207":1578.8503818621,"3452861205":0,"3454110996":1421.9944676861,"3455944020":0,"3456273150":1425.9672522649,"3456823213":0,"3457051682":1601.511760532,"3458213369":0,"3458248889":0,"3460084752":0,"3460806368":2306.8472649456,"3461348977":1508.099765827,"3461834167":2681.7054310332,"3462463455":2449.3352959316,"3464418220":1590.547713663,"3464701651":0,"3465343":0,"3465409135":0,"3468018376":0,"3468116044":0,"3468213273":0,"3469207858":1933.9571917853,"3469541764":2374.1850487395,"3469926498":2230.1673059455,"3473351012":0,"3474039417":1696.8895579594,"3474428558":0,"3475686242":0,"3477058065":0,"3479390973":0,"3480413551":1567.6884942977,"3482467445":1566.2526716951,"3483377785":2419.5791089724,"3484001100":1404.7016862187,"3484470279":1919.6391896894,"348512996":0,"3488452469":0,"3489386729":0,"3489582959":0,"3489599803":0,"3491443766":1474.0150725665,"3492185165":0,"3492742379":1649.7120733311,"3492873499":0,"3495355750":1646.1943237127,"349650937":0,"3498345039":0,"3501115477":1379.3426970242,"3503134762":1851.2677996923,"3504355376":1711.1205064321,"3504693188":0,"3506344616":1480.1116248664,"3508427448":0,"3509092584":1227.91037348,"3509327992":0,"3510486381":0,"3510890976":2333.2401505813,"3513036702":2013.4354344791,"3514319037":2273.7910625337,"3518502488":1597.5718383661,"3519471521":2644.8498152558,"3520046805":0,"3520875014":0,"3521652117":1237.693464609,"3521871699":0,"3521973284":1583.3117784523,"3523871920":0,"352505600":1710.9105378431,"3525880478":0,"3527144196":0,"3527222391":2200.6623666057,"3528330030":1289.945159062,"3529094278":1521.9977490324,"3529472171":1858.9581916885,"353053828":0,"3531395010":1199.2892732505,"3532088940":0,"3532176892":2917.8273567322,"3532863467":2428.3242593838,"3533336381":0,"3534885957":0,"3535072903":0,"3535624008":1348.0079390256,"3536253643":2227.3896051956,"3537085768":0,"3537815146":0,"3541832045":0,"3544466917":0,"3544973036":0,"3547308658":0,"3547808888":0,"3548460508":1795.0422250815,"354880980":0,"3548853356":1574.0392121288,"3549637617":2666.668150845,"3549688121":2221.793185714,"3550553048":1414.4351202231,"3552570937":1573.824807946,"3552679614":0,"3553057842":1331.3935128035,"3553863174":0,"3554305488":2294.0981174197,"3554428052":0,"3554577128":1696.9920075471,"3554657564":0,"3555784215":1779.7001728541,"3556941422":0,"3557119705":0,"3558781406":1262.938740364,"3559784334":0,"3561342867":1604.5128423093,"3562926842":2466.8891773908,"3563762803":2424.6761561972,"3564822043":1227.3485530532,"3565117549":1790.5747006625,"3565951903":2005.5862669078,"3566296172":0,"3566729670":0,"3567189290":0,"3567330607":2422.3128048015,"3570284045":2198.4642973466,"3570621122":0,"3571222180":0,"3571447692":0,"3572615577":1450.5787293419,"3573276394":0,"3573894690":2019.9859462755,"3574045563":0,"3574084572":0,"3574185695":0,"3579143787":0,"3580394792":1967.3284576938,"3581728008":2087.2049275667,"358387829":0,"3585483303":0,"3588035361":1393.4123491817,"3589033912":1509.6237874441,"3589125798":1174.8589329736,"3590542886":1849.8122180044,"3590794345":0,"3593932314":1212.2309421538,"3595421528":0,"3596139981":0,"3597054857":0,"3597589308":0,"3597620749":0,"359765882":1899.6213866649,"3601789048":0,"360213652":0,"360478335":1396.8422030812,"3605537034":0,"3605700572":0,"3607071844":1760.9131492436,"3607938850":0,"3607948747":1274.6742564805,"3608105198":0,"3608687869":1486.764933431,"3608956462":0,"3609066875":1725.4481937307,"3609197847":1257.323514611,"3610450870":0,"3611656717":1362.6613797387,"3612436091":0,"3612858843":1396.4853538164,"3615735813":2258.6371797452,"3615890317":1462.4423844498,"3615903863":1326.4047670018,"3616385781":1876.146019008,"3619173359":0,"3619796334":1749.4981778209,"362145938":2067.0643721733,"3624743731":1663.456591933,"3625352354":1376.2600892096,"3627963576":1604.0695445163,"3628522165":0,"3628711002":1844.6289439644,"3629682368":1815.1286459024,"3631325739":0,"3631493170":2333.0078041754,"3632361978":2221.3538766773,"3632832155":0,"3633709914":0,"3634042243":0,"3634756972":0,"3639230179":2121.3147151648,"3640069915":0,"364057867":2265.2118886972,"3643699802":0,"3647529643":1897.5516652727,"3647659126":0,"3650306921":0,"3652265598":0,"3654559374":0,"3654833214":1740.5014205942,"3655230005":0,"3655265099":1538.233149704,"3655694361":0,"3658316549":1307.2991245272,"3658435518":0,"3658913842":1173.505926482,"3663334475":1459.8208951847,"3666213697":0,"3668290311":0,"3669324904":1847.2077654978,"3670047480":1212.2606422181,"3670981421":0,"3671857466":1547.5714796512,"3672640831":1275.6108152653,"3672802568":0,"3674750599":1539.2250193318,"3675075625":2366.7099607655,"3676581853":0,"3678361449":0,"3678844870":0,"3679223156":2863.1378294349,"3679518604":2076.0155978787,"3680951455":0,"3681131795":1372.1152262488,"3681526411":1779.7534349429,"3681668560":1151.3534799042,"3681976285":1633.1372577433,"368544120":0,"3685520053":2084.2010769193,"3686317773":1221.6801628274,"369209811":1638.0148920643,"3693635252":1423.1058649921,"3694289041":1732.5146472785,"3695292464":0,"3696528144":0,"3696757985":1314.2912238536,"3697179042":2533.2830157959,"3698071341":1407.0629410799,"3698564207":2131.7917160422,"3702844885":0,"3704059945":0,"3707233513":2209.8815936961,"370730607":0,"3709286362":0,"3709920516":2583.406911951,"3713605524":1625.7172632295,"3714339122":0,"3722557865":1200.9464053417,"372608626":2655.2178711909,"3729546605":0,"3729777530":1791.5102962397,"3729897578":1558.9522968448,"3730047096":2276.9256951751,"3731391427":1294.5800368625,"3732579349":0,"3732893747":0,"3733071109":0,"3733738177":0,"3733845637":0,"3734379548":0,"3735372403":1597.0215918551,"3735555259":2228.3454693625,"3735817636":1142.0341823205,"3735818622":1372.4759842416,"3736820092":1534.0648719302,"3736843920":1381.0888968455,"3737350161":0,"3738097801":1552.8935571247,"3738671880":1374.6755455786,"3738902181":0,"3738917436":1387.3672639293,"374038880":1872.0350138774,"3740959852":1984.9685663849,"374180471":2011.0496162515,"3742724136":1709.1054732427,"3742810739":0,"374282350":1662.7075394144,"3743671260":0,"3744485747":2345.3418191684,"3748728257":0,"3749798588":0,"3750650671":1352.1791099256,"375088983":2391.8086687918,"3750933244":1260.1755576607,"3754756357":0,"3754993583":1428.7246677159,"3756156206":2633.0144045478,"375721237":0,"3757271328":0,"3757656158":0,"3761575610":1562.0956544608,"3761670335":1809.5579156134,"3766200583":2220.8257124139,"376871815":1909.4189035523,"3772256778":1541.2260256298,"3772660335":1297.3006230632,"3772871454":0,"3773526508":1956.7059585934,"3773666854":1163.6047095526,"3777661377":0,"3778120928":1134.7862697576,"3778209816":1334.0516779626,"3778856012":1237.7565585875,"3779169819":1167.647122501,"3779486178":0,"3780176153":1707.8992927609,"3781646421":0,"3781658657":0,"3782265092":0,"3785395845":0,"3785567301":0,"3786781582":1622.3970914116,"3787590955":0,"3789355498":1454.7459647138,"3791950406":1675.9610355975,"3793928653":1506.8958220609,"3794347985":1192.3167969426,"3795047313":1866.3014601125,"3800630907":1292.8993325204,"3800747527":0,"3801430886":2062.9876807625,"3802076349":2305.4498281454,"3802833057":2033.1699277531,"3803787289":2075.9046975409,"3806017410":2155.3424932408,"3806643948":0,"3807487459":2620.4181842249,"3809879849":0,"3812471555":1496.9128643588,"3813216196":1384.4078082338,"3813731132":0,"3813795330":0,"3814190795":0,"3814673758":1779.3931248179,"3816685448":1397.8875115008,"3816847735":0,"3817057378":0,"3817708570":0,"3817996291":1792.076794537,"3820908739":2092.5366031561,"382106194":0,"3821666194":0,"3822669184":2105.8582288624,"3823075784":0,"3823231761":0,"3823656539":0,"382558847":0,"3825739123":1939.9323330472,"3828103825":0,"3828565221":0,"3828674995":0,"3830405744":1273.046473797,"3830794143":1182.2102562446,"3830917042":0,"3832160892":0,"3832931339":0,"3833541404":0,"3833659931":1234.8049089605,"3834636412":0,"3835566276":1376.0047008182,"3836236370":1783.2337340478,"3836670242":1301.4117757184,"3836897087":0,"3837200173":2300.1557840589,"3838380426":0,"3839572104":1416.8961009909,"3841967606":0,"3843088774":0,"3843288760":0,"384406520":0,"3846393224":0,"3849697077":1167.8737144048,"3850152805":0,"3850475856":0,"3850567251":0,"3851133364":2481.7175364169,"3851205548":1374.3527967199,"385203255":2209.8785430371,"3852187784":0,"3854724367":0,"3856718514":2383.7724811656,"3859790729":1372.7398808669,"3863149926":0,"3865734981":1911.1959516695,"3866325213":1497.8880991093,"3867293007":1751.115625465,"3869351459":2080.0425875741,"3869891296":1541.6944600975,"3870173669":0,"3870941501":2084.6866916045,"3871311053":1458.356493039,"38742216":0,"3874484865":1573.2701790739,"3876344773":0,"3876397144":1235.6484230513,"3877013643":1713.2768268466,"3877437521":1321.2748903388,"387774736":0,"3880011182":1741.3694833067,"3880639230":1857.6431822094,"3882420814":0,"3882513191":0,"3883411103":1338.8322315568,"3883580111":0,"3884874766":2204.3524370174,"3887653034":0,"388898462":0,"3889083778":0,"3891355877":1335.4613368501,"3892578893":1495.715740828,"3894678842":1129.3432988996,"3894947933":1947.5013967785,"3897579601":0,"3898582486":1960.5763266754,"3899459924":1301.4027057843,"3899529382":2413.3969129689,"389978318":1223.9335618833,"3900992255":2333.0621537307,"3901843098":0,"3903413452":0,"3906386545":0,"3907062892":2470.2118194809,"3907541820":1781.8156963676,"3909203570":2677.1682592316,"3911303073":1454.5942017003,"3911640069":1471.8964024887,"391342400":1231.4004525633,"3915832963":1285.9726675488,"3919719734":1964.3793590858,"3920003458":0,"3920580036":0,"3920701236":0,"3920920642":1382.4809893713,"3920925170":1307.9800903088,"3922635563":2009.7322365973,"3926333474":0,"3926884655":1226.8332278145,"3927353973":0,"3927702135":1590.0463215721,"3928291565":0,"3928470194":0,"3929135553":2084.1404698713,"3929440255":0,"3930025215":1951.5918682146,"3931327644":0,"3935523633":2104.9526046945,"3936048230":0,"3936988451":1430.3094955812,"3939185799":2001.4515854273,"3940769236":1193.1328299324,"3942454002":0,"3943793700":1778.4880620629,"3944079582":0,"3946751496":1761.9162628125,"3946770973":0,"3947635653":2439.7337408636,"3949953471":2297.105362516,"3951026299":1433.0795554833,"3953077425":2260.2799775623,"3953245616":1418.1401949854,"3953865894":2066.0972575597,"3956966956":1649.9728054796,"3957965518":1836.5345744332,"3960620247":1241.5645130241,"3960804215":1626.6740430119,"3965012096":0,"3965390038":0,"3966752648":0,"3967032436":1918.9960035055,"3968538235":1869.402439128,"3969212159":2060.0818824378,"3970030339":0,"3971252642":1785.6006955353,"3971324453":0,"397181519":0,"3972794115":1528.7183829005,"3973047784":0,"3973609032":2090.4183788498,"3974822873":1680.4852623991,"3975010681":0,"3975371411":1485.135401269,"3977989551":1530.0343519239,"3978062866":0,"3978152897":1622.7743864401,"3978864326":1323.1893756783,"3979947991":2026.8957817007,"3980691002":0,"3981013694":1651.569267834,"3981067264":0,"3982094929":0,"3982480412":0,"3982790200":0,"3983488064":0,"3984829072":0,"3985296975":0,"3985685306":0,"3985813844":0,"3987516998":0,"3988446663":1206.1240971343,"3989118459":1583.212966224,"3989268391":1478.3848028264,"3989735780":1423.0355763093,"399050701":1241.0825147417,"3990558875":1635.6879273926,"3990570012":0,"3992139324":2027.7304121046,"3992943267":0,"3993074949":0,"3993583568":0,"3993903432":0,"3994274623":0,"3996294633":0,"3996759401":1299.6035132992,"3999582587":1289.1912178611,"4000844273":1533.47383662,"4003153896":0,"4004277283":0,"4006089601":0,"4006408746":1282.3870247003,"4006941957":1764.9170564773,"4007529944":1616.2067360638,"4008128316":1900.8434122725,"4009778807":0,"4010638251":0,"4011399863":0,"4013191058":0,"4014680480":0,"4014976365":1914.6717285348,"401508981":1436.5343999134,"4016027208":0,"4016866328":0,"4017385406":0,"4018527734":0,"4020009242":0,"4021161204":2039.110874689,"4021657799":0,"4022402413":1193.0585534828,"4022600098":0,"4023565195":2175.6850426027,"4024970253":1310.9129840277,"4026628199":0,"4026864126":1203.1408035909,"4027356240":1299.8393735643,"4028967949":1386.9203620297,"4029466921":0,"4029500097":0,"4032339630":0,"4032343955":2025.0377429311,"4032901400":0,"4033162779":2050.2553211463,"4034022024":2047.3919190727,"4034818195":0,"4034922554":1164.0227691933,"403672441":1461.9157715206,"4039038151":0,"4040819108":1824.829446341,"4043172905":0,"4043400932":0,"4043601244":1631.5850830561,"4043627107":0,"4044555832":0,"4047033765":0,"4047865463":0,"4048578172":0,"4049556872":0,"4050014828":2137.5633267453,"4050705931":0,"4053796951":2205.4304373587,"4054714568":0,"4057490526":0,"4057878205":1544.8261365027,"4058134239":1445.1422945604,"4058653877":0,"4061458273":1823.5831437787,"40615146":1827.090740222,"4061782818":0,"4062228386":1376.2376633804,"4062961912":2195.6540241654,"4063277289":0,"4063900283":0,"4064007490":1501.9080845668,"4064149855":1607.80608595,"4065089853":1283.6412252736,"4066429992":1864.5644306171,"4067072856":1476.9062320302,"4067624536":0,"4070705042":0,"4070899391":0,"4071175900":1514.8181710611,"4072567494":0,"4075036261":0,"4077161289":1832.2280384591,"4078406602":0,"4078794209":1375.0234414965,"4079777150":0,"4082307471":0,"4083216410":1607.4192947808,"4085072471":0,"4085658464":0,"4086617748":1442.9468304752,"4088708677":1643.5283095007,"4089321877":1944.5673996888,"4089962714":0,"4091113757":0,"4091816277":0,"4092227797":1476.9118898539,"4093059486":1259.409726189,"4094576814":0,"4095621901":1426.9800910361,"4096713010":0,"409977826":0,"410013415":0,"4100936853":0,"4101129191":1448.1865030721,"4102134032":0,"4103794198":0,"4107503015":1825.770486008,"4107668533":0,"4108118731":1394.9149882274,"4109762990":1787.6346864268,"4110942485":0,"4112278141":0,"4113058721":1266.7001363197,"4115375242":0,"4116532905":2298.6242048519,"4119329122":0,"4119724272":0,"4121584967":0,"412283228":0,"4123515556":1562.9802666517,"4123534788":0,"4124154827":0,"412491371":0,"4125612782":1204.9864820183,"4125791633":0,"41269413":1324.5696223867,"4127526700":0,"4128050064":0,"4129112562":0,"4130335825":0,"4130908576":1247.3198836387,"4130986647":1580.9748095835,"4131453232":1219.4252907184,"4133950075":0,"4134643071":0,"4136320759":2027.8772739639,"4136678159":1753.9062487685,"4137220667":1393.3604603199,"4137779509":0,"4138934238":1797.4917663632,"4138934893":0,"4139130918":0,"4140185340":0,"4141047313":1484.8385256564,"4143209261":0,"4144023748":1784.2539813582,"4144252835":0,"4144328959":0,"4145221029":0,"4147523762":0,"4149053090":0,"4149493404":0,"4149654629":0,"4151024020":0,"4154176354":0,"4154206580":0,"4154336589":2377.3895801187,"4155641815":1384.0226911434,"4156461194":1274.881752217,"4156611370":0,"4156886477":0,"4159210402":1408.427592417,"4160094583":0,"4162693857":1426.7384112327,"4162714270":1602.7742849665,"4164128971":0,"4164491486":0,"4165482981":0,"416702467":0,"4169811109":1374.574900311,"4169935304":1796.5392133092,"4172058127":1702.8035923458,"4175159080":2517.6829964848,"4175827470":1164.8182315157,"4176664483":0,"4177070630":0,"4180257761":1855.5957296285,"4182324049":2074.4120526679,"4183393481":1512.3323577063,"4183600583":0,"4185588652":0,"4185904896":1983.2319731313,"4187483922":2409.7580728676,"4187877981":1770.8924569497,"419099305":1502.5363677723,"4191223408":1558.6880035344,"4191841426":0,"41924590":0,"419265170":0,"4193156158":1853.0880092558,"4193309664":0,"4193739814":1758.75255141,"4195485236":0,"4195627843":0,"4196448349":0,"4197747162":2120.4466386371,"419814877":2084.4980206639,"4199077770":0,"4200358078":0,"4201921653":2156.9515428364,"4207897118":0,"4210364548":1264.4836883082,"4211026934":1481.5701319876,"4211993018":0,"4212893423":1208.0130656905,"421470137":0,"4216066459":0,"4216471965":0,"4216644948":0,"4216972810":0,"421748448":0,"4220955865":0,"4221466593":1695.3076664977,"4222214139":0,"4224776178":0,"4224854568":1479.9828219111,"4225343365":2022.8520613737,"4225876243":1279.0301521682,"4226664142":0,"4227366527":1221.9872943569,"4231095696":1658.5967147757,"4231261281":0,"4231944752":0,"4233152869":1368.0043517215,"4234423090":1341.3713970313,"4235563666":1283.4980318021,"4238067501":0,"4238290979":1132.6812943289,"4238478834":0,"4239392469":0,"4239622058":2531.6452775023,"4242473859":1657.1231739081,"4243902659":0,"4244339093":2779.7855167601,"4245137983":1694.4308657594,"4247310156":2873.9745576413,"424787144":0,"4248915112":0,"425057592":0,"4252078571":0,"4252220750":1966.7067914206,"4253187558":1201.3497763919,"4255960109":0,"4256716489":1425.3981616639,"4257560677":2381.6019709166,"4259911866":1719.945199874,"4261327361":1409.2288385791,"4262011852":0,"4265155310":1330.918577828,"4268196111":0,"4272085250":2415.0089731911,"4274227295":0,"4274312628":1571.1721048101,"4275078512":0,"4275612953":2090.6800569319,"4276174201":2081.6909344021,"4276936370":0,"4277286146":0,"4278260851":0,"4278588630":0,"4278798036":1729.6074000215,"4279348799":1701.7584658834,"4279603804":0,"4281929868":1444.6098846511,"4283669919":1387.2941868867,"4285617748":0,"428851356":1209.6571020247,"4289106415":1213.8073621345,"4290150798":2074.8331146269,"4290496515":2170.0439693714,"4291977235":0,"4292187435":0,"4293465808":0,"4293743842":0,"4294197536":1287.1053917452,"430788454":1658.921022733,"432952089":0,"435507573":1590.269030833,"435938591":2091.6474629767,"436025572":1239.1621762681,"438417277":1460.5903088359,"439231056":1193.2687290573,"440012417":0,"440206256":1309.3113721825,"440656680":0,"441435962":0,"442815761":1707.4309979043,"443405892":0,"444602377":0,"444680013":1477.4844514104,"445102839":1934.3556201811,"445458274":1256.6807087287,"446314776":0,"44691758":0,"446968474":2456.3900212097,"447209244":0,"448999750":1932.3730795204,"449754376":0,"449776562":0,"454305182":0,"456952191":0,"457675593":0,"457953007":1307.3797385769,"458335295":0,"459732998":2650.8996457642,"461728477":0,"462078559":0,"462875391":2582.0814855506,"463765609":1622.8414025136,"465632644":0,"466340061":1779.9495819318,"468110":1356.6925765299,"468127487":0,"469490796":1656.5588918365,"469801892":0,"47105522":0,"472415307":1177.5660617941,"474089455":1139.4248492279,"474791918":1997.1824403719,"475209872":1181.9716216714,"475633354":0,"476179926":0,"478874060":2019.5399647546,"479546084":1303.0179795942,"480223586":1494.500749598,"48057996":0,"482181283":0,"482822055":0,"483561018":0,"484484283":1259.3406231708,"484559816":0,"485006616":1775.854606648,"485245401":0,"485705274":0,"486718067":2348.7273357105,"487061983":0,"487663609":1854.9547783559,"487789523":1285.7282180721,"488117229":0,"491083091":2130.1135718486,"491601529":0,"492673087":1588.4826339516,"492684269":0,"492772626":2020.7095306378,"49337297":0,"495901528":2037.6527962599,"496677914":0,"497323702":2444.7192647604,"498806458":0,"501148034":0,"50181492":0,"503793114":0,"504472069":1257.679633165,"505097820":2418.5742747632,"509699848":1912.8455659711,"509756552":1188.6311093158,"5115105":2454.7653333657,"511813355":0,"512758649":2235.9672341699,"518714509":1189.4358388136,"519326923":1797.8728515982,"519673615":0,"519703576":0,"521103328":0,"52174285":0,"521886798":2387.3525635254,"522511593":0,"523690894":0,"523951328":1223.406570396,"526067229":0,"529027464":0,"529249486":0,"530135030":0,"530449553":0,"530846359":2235.5784618885,"534082096":1399.8468905274,"535210813":0,"535469112":0,"53592478":0,"535937366":0,"536229655":1911.8282317986,"536430705":1817.9978644712,"537590451":2250.9318291559,"537971944":1167.1241589729,"538156740":0,"540821611":2308.6545905335,"545408597":1180.5927490268,"545869308":1569.7528744586,"547605841":1804.5783242151,"549109709":2533.3027905062,"550044897":0,"550448877":0,"550627195":2489.6652421066,"551650495":0,"552299541":2207.8565809952,"556438904":0,"556450459":0,"556825118":1270.6712381632,"557064072":0,"557097878":2587.8725248485,"558074969":0,"559582932":1529.7617243868,"566662585":0,"566836098":0,"569105706":0,"569662321":0,"569821923":0,"569962978":1355.3956434989,"571415893":2594.135673452,"571559842":1678.3947690537,"572178714":1392.0853311911,"572276699":1840.9122452886,"57307685":0,"573279484":0,"576619521":1746.8757919578,"578346118":0,"578368735":0,"578652817":0,"579965012":0,"582275145":0,"582349116":0,"584398620":0,"584422611":0,"58544596":0,"586474794":1303.5594588137,"58778303":0,"588772553":1201.6117337798,"590592305":1856.8610192187,"591580711":0,"59158142":2849.4841858619,"592662704":0,"592826714":1743.731976554,"59428399":1481.960807786,"594551983":1524.5693481538,"594904868":0,"59567354":0,"596917752":0,"599100436":0,"601450429":1758.5135073787,"602085756":0,"606654355":0,"607026938":0,"608419542":1830.1493771696,"611100168":1207.7224406285,"611620362":0,"61296851":1372.5139179378,"613691832":1708.8735585776,"614687136":1535.3680469616,"615729621":1272.3340330895,"617363107":0,"618419204":1252.8406166148,"620562584":0,"623247221":1382.760607823,"625310591":2428.7985254341,"625709572":1748.1523771585,"62740321":0,"628719688":1938.6883365596,"629883391":1635.1520858279,"634204613":0,"635111986":1825.0056908946,"636790914":2414.6227484407,"636908055":0,"637379632":0,"637661898":1502.6623568929,"638264577":1410.5239927267,"638561610":1258.8401788462,"639622603":1144.6237559885,"639855496":0,"639984084":0,"640612489":0,"641703821":0,"644735722":0,"646623014":0,"648001314":0,"650356357":1745.6490739887,"651101767":1142.8650731632,"65111910":1747.6755111029,"653475446":2182.054452981,"654405691":0,"655929637":2125.3125624762,"657641712":0,"658738156":1151.9713084499,"66053082":0,"660980450":0,"665333196":1391.7243180131,"668514824":0,"669193354":0,"670519393":2101.867342004,"670957801":1331.5287857686,"672964653":0,"67459313":0,"676558931":0,"676949389":1649.2000410344,"677909483":2351.2293628792,"67823656":0,"679348420":0,"680388257":0,"681133837":2014.7655493665,"68154824":0,"684110909":1671.9261598,"686429748":1421.6541140049,"687876034":0,"688063365":2116.493528295,"689742461":0,"690173651":1477.7669322402,"690261450":1298.5921473119,"693474678":1356.1920189231,"694594451":1199.4427635582,"694631589":0,"694748880":0,"696571525":0,"697239024":0,"700466705":1960.5517123728,"70049056":1636.47322627,"700655129":0,"701261553":1885.0178370385,"703374139":0,"704152903":1697.8500495479,"705186057":0,"705189000":1509.5562928491,"707570247":0,"707968705":1266.3368046515,"709012070":1307.4608905199,"712189388":0,"713625410":2499.3282271507,"715235362":1243.1009943284,"718375766":2259.6572191969,"718987035":1604.1602280047,"719526211":0,"719843162":0,"721361841":0,"722046827":0,"724072362":0,"724968972":0,"725104396":0,"728229560":2034.6759416871,"729170392":1885.1051527272,"729675571":0,"730656427":2422.5309771173,"730723137":0,"730943544":1658.3530344788,"731038573":2816.0706257586,"731708110":0,"733560660":1378.7570411077,"735587531":1322.3886921778,"737814347":0,"737896329":1810.6470004623,"739255468":1120.698183624,"741778858":2056.335494216,"74188793":1219.5284561367,"743759650":1658.3305547865,"744773019":1666.346990979,"746573214":2136.3013259524,"747763790":2034.4067304341,"748610431":0,"74918902":0,"750309798":1939.560165526,"750727980":1341.8397242604,"751346572":0,"752241853":1266.5231114343,"755197791":0,"756808622":0,"759235138":0,"760128905":1524.8218282113,"760662992":1184.8359383057,"761142635":0,"761999420":1903.1973989877,"765388149":0,"769907793":0,"770030188":1898.8339532179,"770308924":1215.7443346869,"770550829":1195.9731842298,"771122731":1511.3725353467,"773302480":1383.4424411643,"77582966":1165.8838207286,"775852598":0,"776635260":0,"778347498":1444.3218903725,"779517329":1341.5076441361,"781431378":1471.6221713607,"782263815":2432.4146343542,"782544976":0,"782747152":1432.9051050881,"783017459":0,"78641139":1517.8263048447,"787047636":1803.7518552874,"787489678":1218.1083231462,"787831673":0,"791863919":1453.7818053022,"792209696":0,"792881591":0,"79432680":2020.1846215023,"796165027":2077.4738459704,"799287649":0,"800569224":1256.4891142083,"80255331":1286.3841359213,"804923256":0,"806315258":0,"806863646":0,"807897834":1315.1890809249,"808016071":0,"809508462":1622.2389577197,"809566471":1846.3568350016,"811643351":0,"816106556":1542.5630367445,"817020554":0,"817603659":0,"818614665":0,"819381767":0,"820995848":0,"821525251":2123.5708982185,"823333636":0,"823399055":1604.9737380545,"823401403":0,"823944730":0,"824074855":1343.628913055,"826909651":1781.3664141686,"829222445":1434.2392062372,"830012757":0,"830799973":1763.787679959,"831955542":0,"83229717":1486.2147876747,"833954016":1184.3385083575,"834197249":3039.3003256659,"835720488":0,"836765096":1251.822378691,"83779659":0,"838041291":0,"839436880":0,"839548071":2277.9557248587,"83972723":0,"84037765":0,"843769556":1486.4687014051,"84450131":1253.4847783954,"845051287":0,"846898736":1333.0179956774,"849440197":0,"8513623":0,"852170646":0,"854560060":0,"855962181":2824.4551372454,"857697187":1624.4737611923,"859530118":1288.5621697906,"860518194":1794.5827898448,"860689371":2273.2215764545,"865538835":0,"866640334":0,"86760751":0,"869195845":1427.7906804882,"869865446":1975.9693382075,"870099563":0,"87115414":1297.4179875409,"875418963":1537.1387686755,"87614958":0,"877400726":0,"877809104":1353.629677812,"879115717":0,"87920735":0,"880076654":0,"880748729":0,"881741713":1198.8420836551,"882246184":1374.3549007913,"882447848":0,"882579715":0,"882647661":0,"883396381":1366.6789652398,"883833496":2537.7965575726,"884144873":1662.6673692545,"885464162":0,"886158615":1479.4837595809,"886594276":0,"887148037":0,"888102063":0,"888694650":0,"889856657":1704.360891641,"890122237":0,"89348328":1936.6613414859,"893706977":0,"894912724":1388.5363323598,"897925931":0,"900196884":0,"904890527":0,"905487995":2803.7652028979,"905841209":0,"907391117":0,"907536385":0,"907763091":0,"908082157":1311.3495317884,"909563687":1745.6580748712,"910590803":2092.8943149547,"911506733":1271.7726574892,"913248466":0,"915449177":2363.0240184484,"917372483":1347.8521638635,"917808097":1304.1180812515,"91788639":1504.2133321504,"918405430":0,"919200929":1302.6469071738,"919580800":0,"920111034":1429.6349292399,"920238680":0,"921517874":0,"922086852":1948.489500779,"922159166":0,"922160489":1336.7830451625,"922857054":0,"923836112":0,"924129852":2223.1762282199,"925231976":0,"925899870":0,"926213540":0,"9262188":1277.9987709491,"927068521":1716.9721777,"927391464":0,"928331770":2515.7520586008,"928385815":0,"929368022":0,"929645229":1653.0356626499,"929840503":0,"932131549":0,"933282434":0,"93344773":1320.6485731562,"933877486":1216.6376846517,"938263064":1965.1266122355,"941716720":1227.7906887239,"94199361":0,"942180030":2354.5411153127,"942356384":1638.1281256708,"943252793":1682.8882177724,"94359620":2207.4917475411,"943933017":0,"945629510":1435.0179887342,"946660529":1248.8547072235,"947222494":0,"949381873":2304.3094138939,"949683376":0,"950521557":1174.3019990918,"953049578":0,"954274595":0,"957253639":0,"95851077":0,"959153590":0,"95938088":1206.0712568518,"959851555":0,"960174485":0,"960405407":2203.1738850937,"96141044":2628.7957821141,"961906184":0,"963187635":0,"963523596":1250.8974254752,"96440277":2239.7101856677,"964970911":0,"965000307":0,"966269583":0,"967980473":1677.4559378473,"968595601":0,"968851545":0,"969064590":0,"969893325":1129.949090232,"970766553":1284.3625733813,"974534416":1373.8916796083,"976252372":2476.451764287,"976283641":0,"977519979":0,"97873302":1397.7743198793,"979158748":0,"9793507":2250.0454791316,"979526552":2315.6037017989,"979891940":0,"981386412":1147.8274860083,"983129619":1269.7567553523,"98370052":0,"986520800":1678.7231378948,"98793972":0,"988335694":2214.4798747386,"989456575":1611.8434720083,"991662473":0,"99323012":0,"999091554":2153.5854429139} diff --git a/public/solutions.json b/public/solutions.json index 4f81659..16bb2b9 100644 --- a/public/solutions.json +++ b/public/solutions.json @@ -1 +1 @@ -{"1001722740":["遍历（Python/Java/C++/Go）","bian-li-by-endlesscheng-2gmw","2022-10-30T04:09:44.703343+00:00","2455","可被三整除的偶数的平均值","average-value-of-even-numbers-that-are-divisible-by-three",1001722740],"1007682110":["回溯不会写？套路在此！（Python/Java/C++/Go）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-q1yu","2023-03-09T02:58:22.697557+00:00","LCR 086","分割回文串","M99OJA",1007682110],"1009976390":["分类讨论+简洁写法（Python/Java/C++/Go）","fen-lei-tao-lun-jian-ji-xie-fa-pythonjav-vynj","2023-06-04T04:43:52.356024+00:00","2717","半有序排列","semi-ordered-permutation",1009976390],"1010937559":["脑筋急转弯","nao-jin-ji-zhuan-wan-by-endlesscheng-sihd","2023-06-18T04:26:49.178344+00:00","2740","找出分区值","find-the-value-of-the-partition",1010937559],"1017096056":["数学做法：O(1) 容斥原理（Python/Java/C++/Go/JS/Rust）","o1-rong-chi-yuan-li-by-endlesscheng-yxc4","2023-04-23T04:10:43.708994+00:00","2652","倍数求和","sum-multiples",1017096056],"1017177635":["添加状态后 DFS + 剪枝优化（Python/Java/C++/Go）","tian-jia-zhuang-tai-hou-dfscpythonjavago-f287","2022-05-08T04:06:21.423498+00:00","2267","检查是否有合法括号字符串路径","check-if-there-is-a-valid-parentheses-string-path",1017177635],"1019777981":["有技巧的枚举 + 常数优化（Python/Java/C++/Go）","you-ji-qiao-de-mei-ju-chang-shu-you-hua-daxit","2023-03-03T14:17:54.361268+00:00","982","按位与为零的三元组","triples-with-bitwise-and-equal-to-zero",1019777981],"10205408":["O(nlogn) 做法：用并查集维护朋友关系，同时用哈希表维护代表元之间能否成为朋友","bing-cha-ji-by-endlesscheng-8ipg","2021-11-14T04:07:23.603268+00:00","2076","处理含限制条件的好友请求","process-restricted-friend-requests",10205408],"1023816398":["教你一步步思考动态规划！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-sje6","2023-02-10T01:44:21.734805+00:00","1223","掷骰子模拟","dice-roll-simulation",1023816398],"1024461884":["计算到每个点的距离（Python/Java/C++/Go）","ji-suan-dao-mei-ge-dian-de-ju-chi-python-gr2u","2022-07-31T04:06:12.389994+00:00","2359","找到离给定两个节点最近的节点","find-closest-node-to-given-two-nodes",1024461884],"1026373985":["转换+中位数贪心+对顶堆（Python/Java/C++/Go/JS/Rust）","zhuan-huan-zhong-wei-shu-tan-xin-dui-din-7r9b","2024-02-01T00:11:39.257569+00:00","LCP 24","数字游戏","5TxKeK",1026373985],"1028149095":["模拟","mo-ni-by-endlesscheng-a7hu","2021-07-04T04:07:39.433556+00:00","1920","基于排列构建数组","build-array-from-permutation",1028149095],"1029578709":["复杂模拟题如何思考？视频讲解！（Python/Java/C++/Go）","by-endlesscheng-nzqo","2023-01-08T04:21:34.495005+00:00","2532","过桥的时间","time-to-cross-a-bridge",1029578709],"1032257843":["【模板】恰好装满型 0-1 背包（Python/Java/C++/Go）","mo-ban-qia-hao-zhuang-man-xing-0-1-bei-b-0nca","2023-10-29T00:00:59.966463+00:00","2915","和为目标值的最长子序列的长度","length-of-the-longest-subsequence-that-sums-to-target",1032257843],"1033555490":["统计 s[i] != s[i+1]（Python/Java/C++/Go）","nao-jin-ji-zhuan-wan-pythonjavacgo-by-en-qcm1","2023-10-29T01:54:41.453802+00:00","2914","使二进制字符串变美丽的最少修改次数","minimum-number-of-changes-to-make-binary-string-beautiful",1033555490],"1037331293":["无需模拟，排序即可（Python/Java/C++/Go/JS）","wu-xu-mo-ni-pai-xu-ji-ke-by-endlesscheng-g2cd","2022-12-11T04:09:12.626606+00:00","2500","删除每行中的最大值","delete-greatest-value-in-each-row",1037331293],"103871786":["巧妙利用位运算优化空间复杂度：从 O(n) 到 O(log C) 到 O(1)","ha-xi-biao-mo-ni-by-endlesscheng-ipk3","2022-01-30T04:08:32.267523+00:00","2154","将找到的值乘以 2","keep-multiplying-found-values-by-two",103871786],"1044473054":["【视频】教你一步步思考动态规划！（Python/Java/C++/Go）","shi-pin-jiao-ni-yi-bu-bu-si-kao-dong-tai-kgkg","2023-04-01T11:10:42.262871+00:00","516","最长回文子序列","longest-palindromic-subsequence",1044473054],"1047256075":["暴力：注意 k 的范围（Python/Java/C++/Go/JS）","bao-li-zhu-yi-k-de-fan-wei-by-endlessche-3i1b","2023-09-17T00:41:23.395728+00:00","2857","统计距离为 k 的点对","count-pairs-of-points-with-distance-k",1047256075],"1049390106":["分类讨论（Python/Java/C++/Go）","fen-lei-tao-lun-pythonjavacgo-by-endless-2qyo","2023-04-29T13:48:54.317727+00:00","1033","移动石子直到连续","moving-stones-until-consecutive",1049390106],"1058966145":["两种方法：暴力 DFS / 树上差分（Python/Java/C++/Go/JS/Rust）","lei-si-da-jia-jie-she-iii-pythonjavacgo-4k3wq","2023-04-16T04:07:47.501267+00:00","2646","最小化旅行的价格总和","minimize-the-total-price-of-the-trips",1058966145],"1059279895":["两种方法：滑动窗口+中位数贪心+前缀和/贡献法（Python/Java/C++/Go）","hua-dong-chuang-kou-zhong-wei-shu-tan-xi-nuvr","2023-12-17T04:07:59.118005+00:00","2968","执行操作使频率分数最大","apply-operations-to-maximize-frequency-score",1059279895],"1062314990":["【图解】利用行最大值判断峰顶位置，附二分题单（Python/Java/C++/Go/JS/Rust）","tu-jie-li-yong-xing-zui-da-zhi-pan-duan-r4e0n","2023-12-19T00:17:36.124600+00:00","1901","寻找峰值 II","find-a-peak-element-ii",1062314990],"1063658457":["累加每个 0 左边的 1 的个数（Python/Java/C++/Go）","lei-jia-mei-ge-0-zuo-bian-de-1-de-ge-shu-luuh","2023-11-19T04:10:31.644925+00:00","2938","区分黑球与白球","separate-black-and-white-balls",1063658457],"1066025257":["将询问离线 + 排序","jiang-xun-wen-chi-xian-pai-xu-by-endless-o5j0","2021-11-14T01:09:47.102802+00:00","2070","每一个查询的最大美丽值","most-beautiful-item-for-each-query",1066025257],"1067400091":["累加各个字母出现次数的差值","lei-jia-ge-ge-zi-mu-chu-xian-ci-shu-de-j-w1ja","2022-02-27T04:15:57.873105+00:00","2186","制造字母异位词的最小步骤数 II","minimum-number-of-steps-to-make-two-strings-anagram-ii",1067400091],"1069078430":["简洁写法，O(n) 一次遍历（Python/Java/C++/Go）","jian-ji-xie-fa-on-yi-ci-bian-li-pythonja-exzg","2024-01-07T04:46:54.604804+00:00","3000","对角线最长的矩形的面积","maximum-area-of-longest-diagonal-rectangle",1069078430],"1069956724":["动态规划 + 简洁写法 + 循环优化（Python/Java/C++/Go）","dong-tai-gui-hua-jian-ji-xie-fa-xun-huan-xyw3","2022-11-20T04:07:19.352498+00:00","2478","完美分割的方案数","number-of-beautiful-partitions",1069956724],"107547857":["断环成链 + 滑动窗口","duan-huan-cheng-lian-hua-dong-chuang-kou-ws80","2022-01-09T04:11:51.154855+00:00","2134","最少交换次数来组合所有的 1 II","minimum-swaps-to-group-all-1s-together-ii",107547857],"1075971933":["排序 + 排序 + 排序（Python/Java/C++/Go）","pai-xu-pai-xu-pai-xu-pythonjavacgo-by-en-ou4k","2022-04-24T04:16:16.490851+00:00","2250","统计包含每个点的矩形数目","count-number-of-rectangles-containing-each-point",1075971933],"1078280786":["一次遍历","by-endlesscheng-z1sm","2022-08-14T04:08:56.512976+00:00","2374","边积分最高的节点","node-with-highest-edge-score",1078280786],"1088208610":["两种方法：二分+DP/二分+贪心（Python/Java/C++/Go）","er-fen-da-an-dp-by-endlesscheng-m558","2023-02-05T04:26:17.250822+00:00","2560","打家劫舍 IV","house-robber-iv",1088208610],"1089101531":["根据排序不等式贪心，简洁写法（Python/Java/C++/Go）","tan-xin-jian-ji-xie-fa-pythonjavacgo-by-5l4je","2024-01-21T05:15:24.696304+00:00","3016","输入单词需要的最少按键次数 II","minimum-number-of-pushes-to-type-word-ii",1089101531],"1093275153":["计算每个字母个数的平均数","ji-suan-mei-ge-zi-mu-ge-shu-de-ping-jun-6mmol","2021-06-13T04:08:27.055992+00:00","1897","重新分配字符使所有字符串都相等","redistribute-characters-to-make-all-strings-equal",1093275153],"1094471227":["O(1) 公式，一行代码（Python/Java/C++/Go）","o1-gong-shi-yi-xing-dai-ma-pythonjavacgo-f7ch","2024-01-28T04:26:30.212704+00:00","3021","Alice 和 Bob 玩鲜花游戏","alice-and-bob-playing-flower-game",1094471227],"109606469":["没有思路？一步步提示你思考！（Python/Java/C++/Go/JS）","mei-you-si-lu-yi-bu-bu-ti-shi-ni-si-kao-cm0h2","2023-02-26T15:20:10.606743+00:00","1144","递减元素使数组呈锯齿状","decrease-elements-to-make-array-zigzag",109606469],"1097720535":["非暴力做法：差分数组+分类讨论（Python/Java/C++/Go）","fei-bao-li-zuo-fa-chai-fen-shu-zu-fen-le-g6wo","2024-01-21T05:28:37.950167+00:00","3015","按距离统计房屋对数目 I","count-the-number-of-houses-at-a-certain-distance-i",1097720535],"110135796":["没有思路？一张图秒懂！（Python/Java/C++/Go）","mei-you-si-lu-yi-zhang-tu-miao-dong-pyth-btav","2023-02-03T00:15:34.985739+00:00","1145","二叉树着色游戏","binary-tree-coloring-game",110135796],"1102749976":["Go 贪心","go-tan-xin-by-endlesscheng-znuz","2021-07-25T04:08:26.793146+00:00","1946","子字符串突变后可能得到的最大整数","largest-number-after-mutating-substring",1102749976],"1103286328":["交换元素值的写法","zhi-jie-jiao-huan-yuan-su-zhi-by-endless-hsfq","2021-11-14T04:25:39.108420+00:00","2074","反转偶数长度组的节点","reverse-nodes-in-even-length-groups",1103286328],"111167904":["数学证明","shu-xue-zheng-ming-by-endlesscheng-8ozj","2022-09-04T00:17:27.708228+00:00","2396","严格回文的数字","strictly-palindromic-number",111167904],"1113985320":["子集动态规划","zi-ji-dong-tai-gui-hua-by-endlesscheng-wtua","2021-08-29T04:06:25.529846+00:00","1986","完成任务的最少工作时间段","minimum-number-of-work-sessions-to-finish-the-tasks",1113985320],"1114300382":["只要你会 153 就能看懂！（Python/Java/C++/Go）","zhi-yao-ni-hui-153-jiu-neng-kan-dong-pyt-qqc6","2023-02-24T12:21:55.775259+00:00","154","寻找旋转排序数组中的最小值 II","find-minimum-in-rotated-sorted-array-ii",1114300382],"1119710280":["三种方法：暴力/线段树/栈（Python/Java/C++/Go）","tan-xin-pythonjavacgo-by-endlesscheng-w3k3","2023-03-12T04:08:21.175878+00:00","2589","完成所有任务的最少时间","minimum-time-to-complete-all-tasks",1119710280],"1122946813":["快速幂（Python/Java/C++/Go）","kuai-su-mi-pythonjavacgo-by-endlesscheng-xeth","2023-12-10T04:09:12.225238+00:00","2961","双模幂运算","double-modular-exponentiation",1122946813],"1132876897":["子集状压 DP，附视频讲解（Java/C++/Go）","zi-ji-zhuang-ya-dp-by-endlesscheng-mxjr","2022-07-08T08:17:57.075305+00:00","465","最优账单平衡","optimal-account-balancing",1132876897],"1134359923":["两种方法：回溯/状态压缩+记忆化搜索（Python/Java/C++/Go/JS）","liang-chong-fang-fa-hui-su-zhuang-tai-ya-26py","2023-08-04T00:23:54.744757+00:00","980","不同路径 III","unique-paths-iii",1134359923],"1137942707":["一步步提示如何做出此题（Python/Java/C++/Go）","yi-bu-bu-tis-by-endlesscheng-89kw","2022-06-25T23:11:20.739546+00:00","2317","操作后的最大异或和","maximum-xor-after-operations",1137942707],"113811987":["两种做法：珂朵莉树 / 动态开点线段树（Python/Java/C++/Go）","by-endlesscheng-clk2","2022-05-15T05:05:19.798874+00:00","2276","统计区间中的整数数目","count-integers-in-intervals",113811987],"1139062797":["简洁写法","jian-ji-xie-fa-by-endlesscheng-6k4m","2021-05-15T17:01:05.052462+00:00","1859","将句子排序","sorting-the-sentence",1139062797],"1140950686":["DP：从 O(n^2) 到 O(n)（Python/Java/C++/Go）","dpcong-on2-dao-onpythonjavacgo-by-endles-nux5","2023-11-26T00:30:20.628053+00:00","2944","购买水果需要的最少金币数","minimum-number-of-coins-for-fruits",1140950686],"1146950656":["回溯不会写？套路在此！（Python/Java/C++/Go）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-8tkl","2023-01-13T01:34:08.039412+00:00","78","子集","subsets",1146950656],"1150623470":["计算每个元素对答案的贡献，多解法（Python/Java/C++/Go）","by-endlesscheng-upd1","2022-11-17T23:36:57.963602+00:00","891","子序列宽度之和","sum-of-subsequence-widths",1150623470],"1156930664":["两种 O(nm) 做法：DP / BFS（Python/Java/C++/Go）","onm-zuo-fa-cong-ji-yi-hua-sou-suo-dao-di-dnec","2024-01-29T00:41:00.320379+00:00","514","自由之路","freedom-trail",1156930664],"1165928557":["跟着我过一遍示例 2，你就明白怎么做了（Python/Java/C++/Go/JS）","gen-zhao-wo-guo-yi-bian-shi-li-2ni-jiu-m-zd6u","2023-08-10T03:27:21.601039+00:00","316","去除重复字母","remove-duplicate-letters",1165928557],"1167299665":["【图解】前缀和轻松 AC！（Python/Java/C++/Go）","tu-jie-qian-zhui-he-qing-song-acpythonja-5mnn","2023-02-16T15:49:20.591870+00:00","1139","最大的以 1 为边界的正方形","largest-1-bordered-square",1167299665],"1168254316":["线性做法：归并排序 + O(1) 额外空间","xian-xing-zuo-fa-gui-bing-pai-xu-o1-e-wa-iy7u","2023-02-19T04:18:07.133806+00:00","2570","合并两个二维数组 - 求和法","merge-two-2d-arrays-by-summing-values",1168254316],"1168505902":["教你一步步思考动态规划：从记忆化搜索到递推（Python/Java/C++/Go/JS/Rust）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-zktx","2024-02-03T00:24:34.112581+00:00","1690","石子游戏 VII","stone-game-vii",1168505902],"1168558024":["两种方法：调用 445 题 / 一次遍历（Python/Java/C++/Go/JS/Rust）","o1-kong-jian-zuo-fa-kan-cheng-shi-head-y-1dco","2023-08-13T04:21:04.301264+00:00","2816","翻倍以链表形式表示的数字","double-a-number-represented-as-a-linked-list",1168558024],"1173419903":["O(1) 公式（Python/Java/C++/Go）","o1-gong-shi-pythonjavacgo-by-endlesschen-cztk","2023-08-20T04:14:16.041826+00:00","2829","k-avoiding 数组的最小总和","determine-the-minimum-sum-of-a-k-avoiding-array",1173419903],"1174559962":["位运算加速","wei-yun-suan-jia-su-by-endlesscheng-c7h9","2023-07-23T00:18:00.895916+00:00","2785","将字符串中的元音字母排序","sort-vowels-in-a-string",1174559962],"1176671732":["Python 一行","python-yi-xing-by-endlesscheng-6s44","2022-10-07T23:35:17.756363+00:00","LCP 66","最小展台数量","600YaG",1176671732],"1178924986":["预处理 + 动态规划","yu-chu-li-dong-tai-gui-hua-by-endlessche-7am2","2021-08-21T16:15:56.892391+00:00","1977","划分数字的方案数","number-of-ways-to-separate-numbers",1178924986],"1180161064":["单独计算每个元音的出现次数","dan-du-ji-suan-mei-ge-yuan-yin-de-chu-xi-eyjf","2021-11-07T04:05:42.759998+00:00","2063","所有子字符串中的元音","vowels-of-all-substrings",1180161064],"1180349312":["找规律","zhao-gui-lu-by-endlesscheng-gksh","2023-03-04T16:14:44.201133+00:00","2579","统计染色格子数","count-total-number-of-colored-cells",1180349312],"1180837306":["贪心模拟 简洁写法","tan-xin-by-endlesscheng-8jk9","2021-10-03T04:07:59.241276+00:00","2027","转换字符串的最少操作次数","minimum-moves-to-convert-string",1180837306],"1182547848":["O(10n) 非暴力做法（Python/Java/C++/Go）","o10n-fei-bao-li-zuo-fa-by-endlesscheng-36eb","2023-06-25T04:24:39.610874+00:00","2748","美丽下标对的数目","number-of-beautiful-pairs",1182547848],"1184414922":["【图解】贪心做法，一图秒懂！（Python/Java/C++/Go）","tu-jie-tan-xin-zuo-fa-yi-tu-miao-dong-py-huik","2023-04-11T14:24:28.046269+00:00","1147","段式回文","longest-chunked-palindrome-decomposition",1184414922],"1186731908":["一次遍历，简洁写法（Python/Java/C++/Go/JS）","yi-ci-bian-li-jian-ji-xie-fa-pythonjavac-aut0","2023-05-28T04:25:40.209809+00:00","2712","使所有字符相等的最小成本","minimum-cost-to-make-all-characters-equal",1186731908],"1187211206":["【算法小课堂】差分数组（附题单）Python/Java/C++/Go/JS/Rust","suan-fa-xiao-ke-tang-chai-fen-shu-zu-fu-9d4ra","2023-12-02T00:24:38.592013+00:00","1094","拼车","car-pooling",1187211206],"1188543288":[" BFS 为什么要用队列？一个视频讲透！（Python/Java/C++/Go/JS）","bfs-wei-shi-yao-yao-yong-dui-lie-yi-ge-s-yxdi","2023-07-18T09:08:33.687800+00:00","LCR 151","彩灯装饰记录 III","cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof",1188543288],"1189152973":["贪心及其证明（Python/Java/C++/Go/JS/Rust）","tan-xin-ji-qi-zheng-ming-by-endlesscheng-hfwe","2022-01-09T04:07:33.420770+00:00","2136","全部开花的最早一天","earliest-possible-day-of-full-bloom",1189152973],"119361315":["脑筋急转弯 + 一次遍历","nao-jin-ji-zhuan-wan-by-endlesscheng-75dq","2022-09-25T04:20:14.751370+00:00","2419","按位与最大的最长子数组","longest-subarray-with-maximum-bitwise-and",119361315],"1197839305":["线性做法，不用快速幂（Python/Java/C++/Go）","xian-xing-zuo-fa-bu-yong-kuai-su-mi-pyth-bqhe","2023-02-02T08:21:13.421821+00:00","2524","子数组的最大频率分数","maximum-frequency-score-of-a-subarray",1197839305],"1197966112":["二分答案（附题单！）Python/Java/C++/Go/JS","er-fen-da-an-fu-ti-dan-by-endlesscheng-3jdr","2023-09-17T04:17:00.984194+00:00","2861","最大合金数","maximum-number-of-alloys",1197966112],"1199383198":["线性做法：前缀和+每个位置的最近蜡烛","xian-xing-zuo-fa-qian-zhui-he-mei-ge-wei-b2if","2021-10-30T23:53:10.010526+00:00","2055","蜡烛之间的盘子","plates-between-candles",1199383198],"119954396":["按照时间排序+贪心","an-zhao-shi-jian-pai-xu-tan-xin-by-endle-3wjf","2021-07-04T04:08:24.301158+00:00","1921","消灭怪物的最大数量","eliminate-maximum-number-of-monsters",119954396],"1200771569":["一次遍历","yi-ci-bian-li-by-endlesscheng-65m5","2022-12-25T04:09:46.689583+00:00","2515","到目标字符串的最短距离","shortest-distance-to-target-string-in-a-circular-array",1200771569],"1204439806":["利用 AND 性质+一次遍历（Python/Java/C++/Go/JS/Rust）","li-yong-and-xing-zhi-yi-ci-bian-li-pytho-p3bj","2023-10-01T01:09:14.383203+00:00","2871","将数组分割成最多数目的子数组","split-array-into-maximum-number-of-subarrays",1204439806],"1210455736":["【图解】算法优化+详细证明（Python/Java/C++/Go）","tu-jie-suan-fa-you-hua-xiang-xi-zheng-mi-b6fq","2022-12-10T00:00:54.464832+00:00","1691","堆叠长方体的最大高度","maximum-height-by-stacking-cuboids",1210455736],"1210688937":["问题转化 + 排序贪心（Python/Go/C++/Java）","wen-ti-zhuan-hua-pai-xu-tan-xin-by-endle-bx8t","2023-01-29T04:07:06.461325+00:00","2551","将珠子放入背包中","put-marbles-in-bags",1210688937],"122030614":["阅读理解题（Python/Java/C++/Go/JS）","yue-du-li-jie-ti-pythonjavacgojs-by-endl-ze7f","2023-08-02T00:23:02.437414+00:00","822","翻转卡片游戏","card-flipping-game",122030614],"1229621552":["Go BFS","go-bfs-by-endlesscheng-k2cu","2021-07-11T02:20:44.213995+00:00","1926","迷宫中离入口最近的出口","nearest-exit-from-entrance-in-maze",1229621552],"123288766":["Go 平衡树","go-ping-heng-shu-by-endlesscheng-ihq4","2021-07-13T13:35:37.698078+00:00","729","我的日程安排表 I","my-calendar-i",123288766],"1234415652":["三维 BFS","san-wei-bfs-by-endlesscheng-eebk","2023-05-07T10:43:31.580769+00:00","LCP 79","提取咒文","kjpLFZ",1234415652],"1238608911":["回溯套路秒杀N皇后！视频讲解！（Python/Java/C++/Go/JS）","hui-su-tao-lu-miao-sha-nhuang-hou-shi-pi-mljv","2023-01-28T10:30:58.654825+00:00","51","N 皇后","n-queens",1238608911],"1241705093":["差分数组线性做法（Python/Java/C++/Go/JS）","chai-fen-shu-zu-xian-xing-zuo-fa-by-endl-3xpm","2023-09-10T04:26:47.977984+00:00","2848","与车相交的点","points-that-intersect-with-cars",1241705093],"1243440018":["无需建图，直接朴素 Dijkstra 求最短路（Python/Java/C++/Go）","zhi-jie-qiu-zui-duan-lu-wu-xu-jian-tu-by-i8h7","2023-04-30T04:44:19.031782+00:00","2662","前往目标的最小代价","minimum-cost-of-a-path-with-special-roads",1243440018],"1249919767":["贪心+上取整","tan-xin-shang-qu-zheng-by-endlesscheng-l02f","2021-07-18T04:10:24.582105+00:00","1936","新增的最少台阶数","add-minimum-number-of-rungs",1249919767],"1253336265":["乘法原理+快速幂","cheng-fa-yuan-li-kuai-su-mi-by-endlessch-btkn","2021-07-04T04:09:40.518329+00:00","1922","统计好数字的数目","count-good-numbers",1253336265],"125432943":["贪心+栈优化（Python/Java/C++/Go）","tan-xin-zhan-you-hua-pythonjavacgo-by-en-sp1s","2023-03-12T13:10:19.332762+00:00","LCP 32","批量处理任务","t3fKg1",125432943],"1255527945":["贪心：每次给最小的元素加一","tan-xin-mei-ci-gei-zui-xiao-de-yuan-su-j-jxnl","2022-04-10T04:10:15.752583+00:00","2233","K 次增加后的最大乘积","maximum-product-after-k-increments",1255527945],"1275579259":["枚举+排序","mei-ju-pai-xu-by-endlesscheng-pblv","2022-12-11T01:12:35.971552+00:00","2497","图中最大星和","maximum-star-sum-of-a-graph",1275579259],"1278269400":["Go 一行解决","go-yi-xing-jie-jue-by-endlesscheng-88c8","2021-08-15T07:30:59.378084+00:00","551","学生出勤记录 I","student-attendance-record-i",1278269400],"1290173910":["按照题意模拟：一次遍历","yi-ci-bian-li-by-endlesscheng-53th","2022-01-02T04:13:39.081804+00:00","2125","银行中的激光束数量","number-of-laser-beams-in-a-bank",1290173910],"1295785983":["模拟","mo-ni-by-endlesscheng-kqzb","2022-12-25T00:12:18.155642+00:00","2512","奖励最顶尖的 K 名学生","reward-top-k-students",1295785983],"1299365979":["O(n) 做法：分解质因子+前缀和+哈希表（Python/Java/C++/Go）","on-zuo-fa-fen-jie-zhi-yin-zi-qian-zhui-h-tnpt","2023-11-26T09:45:23.640566+00:00","2947","统计美丽子字符串 I","count-beautiful-substrings-i",1299365979],"1300693519":["一次遍历，简洁写法（Python/Java/C++/Go/JS/Rust）","yi-ci-bian-li-jian-ji-xie-fa-pythonjavac-c9b1","2024-01-22T00:44:49.367210+00:00","670","最大交换","maximum-swap",1300693519],"1303459038":["O(n) 通用做法（Python/Java/C++/Go）","on-tong-yong-zuo-fa-pythonjavacgo-by-end-oj0d","2023-09-03T12:13:07.602921+00:00","2839","判断通过操作能否让字符串相等 I","check-if-strings-can-be-made-equal-with-operations-i",1303459038],"1304520805":["动态规划","dong-tai-gui-hua-by-endlesscheng-d92a","2021-06-26T16:06:53.115562+00:00","1911","最大子序列交替和","maximum-alternating-subsequence-sum",1304520805],"1304985926":["O(log n) 贪心+二分查找（Python/Java/C++/Go/JS）","olog-n-tan-xin-er-fen-cha-zhao-pythonjav-t3qn","2023-09-17T05:25:52.018382+00:00","2856","删除数对后的最小数组长度","minimum-array-length-after-pair-removals",1304985926],"1308115412":["数位 DP 通用模板，附题单（Python/Java/C++/Go）","by-endlesscheng-x4mf","2022-08-15T11:05:07.787713+00:00","面试题 17.06","2出现的次数","number-of-2s-in-range-lcci",1308115412],"1310138170":["看完这个视频，让你对递归的理解更上一层楼！（Python/Java/C++/Go）","kan-wan-zhe-ge-shi-pin-rang-ni-dui-di-gu-h1j7","2022-12-07T11:14:31.336327+00:00","LCR 175","计算二叉树的深度","er-cha-shu-de-shen-du-lcof",1310138170],"1312828534":["Go 一行","go-yi-xing-by-endlesscheng-7x8c","2021-07-14T03:17:06.917384+00:00","LCR 137","模糊搜索验证","zheng-ze-biao-da-shi-pi-pei-lcof",1312828534],"1320293684":["简洁写法（Python/Java/C++/Go）","jian-ji-xie-fa-pythonjavacgo-by-endlessc-5gps","2024-01-07T01:32:32.196105+00:00","2997","使数组异或和等于 K 的最少操作次数","minimum-number-of-operations-to-make-array-xor-equal-to-k",1320293684],"1322023785":["哈希表扫两遍","ha-xi-biao-sao-liang-bian-by-endlesschen-btuz","2021-10-30T23:13:16.381665+00:00","2053","数组中第 K 个独一无二的字符串","kth-distinct-string-in-an-array",1322023785],"1323143155":["【简洁写法】筛质数+二分查找（Python/Java/C++/Go）","jian-ji-xie-fa-shai-zhi-shu-er-fen-cha-z-wj7i","2023-03-26T05:20:59.943009+00:00","2601","质数减法运算","prime-subtraction-operation",1323143155],"132633492":["理解操作本质+简洁写法（Python/Java/C++/Go/JS/Rust）","li-jie-cao-zuo-ben-zhi-jian-ji-xie-fa-py-b18i","2023-11-30T00:34:24.259901+00:00","1657","确定两个字符串是否接近","determine-if-two-strings-are-close",132633492],"1331620430":["原地堆化 O(1) 空间（Python/Java/C++/Go/JS/Rust）","yuan-di-dui-hua-o1-kong-jian-pythonjavac-29iz","2023-12-23T00:20:46.164514+00:00","1962","移除石子使总数最小","remove-stones-to-minimize-the-total",1331620430],"1341926866":["【视频】彻底掌握直径 DP！从二叉树到一般树！（Python/Java/C++/Go）","shi-pin-che-di-zhang-wo-zhi-jing-dpcong-n9s91","2023-04-14T11:14:00.307738+00:00","124","二叉树中的最大路径和","binary-tree-maximum-path-sum",1341926866],"1351132676":["统计因子出现次数（Python/Java/C++/Go）","tong-ji-yin-zi-chu-xian-ci-shu-by-endles-t5k8","2022-02-20T05:50:44.705608+00:00","2183","统计可以被 K 整除的下标对数目","count-array-pairs-divisible-by-k",1351132676],"1356097871":["统计字母出现次数和最后一次出现的下标（Python/Java/C++/Go）","tong-ji-zi-mu-chu-xian-ci-shu-he-zui-hou-0r5g","2024-02-18T00:36:18.876282+00:00","3039","进行操作使字符串为空","apply-operations-to-make-string-empty",1356097871],"136239889":["前缀最大值+后缀最小值","qian-zhui-zui-da-zhi-hou-zhui-zui-xiao-z-h9qz","2021-09-19T04:07:21.645427+00:00","2012","数组美丽值求和","sum-of-beauty-in-the-array",136239889],"1363331011":["逆向思维 + 位运算 + 哈希表","ni-xiang-si-wei-wei-yun-suan-ha-xi-biao-l4153","2022-01-09T04:10:42.036888+00:00","2135","统计追加字母可以获得的单词数","count-words-obtained-after-adding-a-letter",1363331011],"1363446915":["脑筋急转弯+lowbit优化（Python/Java/C++/Go）","nao-jin-ji-zhuan-wan-pythonjavacgo-by-en-7j89","2023-02-18T16:19:30.611589+00:00","2568","最小无法得到的或值","minimum-impossible-or",1363446915],"1364762739":["DFS + 记一次有趣的 hack","dfs-ji-yi-ci-you-qu-de-hack-by-endlessch-jtsr","2023-05-23T23:57:41.462944+00:00","1377","T 秒后青蛙的位置","frog-position-after-t-seconds",1364762739],"1368794049":["Go 统计每个元素的出现次数","go-tong-ji-mei-ge-yuan-su-de-chu-xian-ci-izr2","2021-12-06T02:03:30.422034+00:00","1940","排序数组之间的最长公共子序列","longest-common-subsequence-between-sorted-arrays",1368794049],"1370775302":["两种 O(n) 做法：刷表法 / 填表法（Python/Java/C++/Go）","by-endlesscheng-2x0z","2022-07-03T04:09:06.442779+00:00","2327","知道秘密的人数","number-of-people-aware-of-a-secret",1370775302],"1375391804":["动态规划","dong-tai-gui-hua-by-endlesscheng-bcmi","2021-09-11T09:41:21.410313+00:00","LCP 43","十字路口的交通","Y1VbOX",1375391804],"1377831845":["O(n) 做法：枚举 nums[j]+前后缀分解（Python/Java/C++/Go）","on-zuo-fa-mei-ju-numsjqian-hou-zhui-fen-xweo4","2023-10-22T08:04:07.243483+00:00","2908","元素和最小的山形三元组 I","minimum-sum-of-mountain-triplets-i",1377831845],"1381994519":["两种写法：自顶向下 / 自底向上（Python/Java/C++/Go）","shu-xing-dp-ji-yi-hua-sou-suo-by-endless-phzx","2023-10-29T04:10:12.018677+00:00","2920","收集所有金币可获得的最大积分","maximum-points-after-collecting-coins-from-all-nodes",1381994519],"1385231803":["子数组统计问题的处理技巧（Python/Java/C++/Go）","by-endlesscheng-men8","2022-07-23T23:22:31.743896+00:00","2348","全 0 子数组的数目","number-of-zero-filled-subarrays",1385231803],"1395581223":["排序+遍历","pai-xu-bian-li-by-endlesscheng-25ww","2021-09-18T16:08:16.877384+00:00","2007","从双倍数组中还原原数组","find-original-array-from-doubled-array",1395581223],"1402633459":["比较 1010... 或 0101... 的最小不同值","bi-jiao-1010-huo-0101-de-zui-xiao-bu-ton-1xpx","2021-05-16T04:07:37.627127+00:00","1864","构成交替字符串需要的最小交换次数","minimum-number-of-swaps-to-make-the-binary-string-alternating",1402633459],"1403965423":["最长不降子序列","zui-chang-fei-jiang-zi-xu-lie-by-endless-x54c","2021-12-19T04:06:57.602389+00:00","2111","使数组 K 递增的最少操作次数","minimum-operations-to-make-the-array-k-increasing",1403965423],"1405611181":["本质是跳跃游戏（Python/Java/C++/Go）","ben-zhi-shi-tiao-yue-you-xi-by-endlessch-8chd","2023-03-05T04:07:38.701273+00:00","2584","分割数组使乘积互质","split-the-array-to-make-coprime-products",1405611181],"1405789151":["遍历（Python/Java/C++/Go/JS/Rust）","mei-ju-by-endlesscheng-p5ju","2023-03-12T04:13:56.265357+00:00","2586","统计范围内的元音字符串数","count-the-number-of-vowel-strings-in-range",1405789151],"1409344146":["O(n) 模拟","on-mo-ni-by-endlesscheng-0plx","2022-03-27T04:08:53.005748+00:00","2215","找出两数组的不同","find-the-difference-of-two-arrays",1409344146],"1420249701":["巧妙设计状态+选或不选（Python/Java/C++/Go）","qiao-miao-she-ji-zhuang-tai-xuan-huo-bu-8547u","2023-10-29T04:11:08.219456+00:00","2919","使数组变美的最小增量运算数","minimum-increment-operations-to-make-array-beautiful",1420249701],"1420390570":["直接交换值：BFS / DFS","zhi-jie-jiao-huan-zhi-by-endlesscheng-o8ze","2022-09-18T04:11:51.439299+00:00","2415","反转二叉树的奇数层","reverse-odd-levels-of-binary-tree",1420390570],"1430651253":["O(n) 一次遍历","on-yi-ci-bian-li-by-endlesscheng-thmm","2021-11-14T04:05:46.101175+00:00","2073","买票需要的时间","time-needed-to-buy-tickets",1430651253],"1434911335":["Go 马拉车算法，附详细注释","go-ma-la-che-suan-fa-fu-xiang-xi-zhu-shi-98xx","2021-08-10T13:12:02.805194+00:00","1960","两个回文子字符串长度的最大乘积","maximum-product-of-the-length-of-two-palindromic-substrings",1434911335],"144023621":["O(N) 后缀数组，击败 100%","on-hou-zhui-shu-zu-by-endlesscheng-jwr2","2021-07-09T02:44:41.535789+00:00","718","最长重复子数组","maximum-length-of-repeated-subarray",144023621],"1449021558":["O(n) 一次遍历","on-yi-ci-bian-li-by-endlesscheng-t4yr","2022-01-23T04:09:02.810914+00:00","2148","元素计数","count-elements-with-strictly-smaller-and-greater-elements",1449021558],"1449546891":["双指针","shuang-zhi-zhen-by-endlesscheng-h553","2023-08-20T02:24:16.809741+00:00","2825","循环增长使字符串子序列等于另一个字符串","make-string-a-subsequence-using-cyclic-increments",1449546891],"1450266090":["排序 + 双指针（Python/Java/C++/Go）","by-endlesscheng-kdy9","2022-05-15T11:35:50.584800+00:00","2271","毯子覆盖的最多白色砖块数","maximum-white-tiles-covered-by-a-carpet",1450266090],"145069778":["Go 子集状压 DP","go-zi-ji-zhuang-ya-dp-by-endlesscheng-h8z0","2021-08-07T04:23:57.878698+00:00","1655","分配重复整数","distribute-repeating-integers",145069778],"1459395051":["三种方法：按照 core 分组 / 枚举 core / 打表预处理（Python/Java/C++/Go/JS）","an-zhao-corei-fen-zu-pythonjavacgo-by-en-i6nu","2023-09-17T04:19:21.110687+00:00","2862","完全子集的最大元素和","maximum-element-sum-of-a-complete-subset-of-indices",1459395051],"1463471392":["排序+滑动窗口","pai-xu-shuang-zhi-zhen-by-endlesscheng-hbqx","2023-07-16T04:09:11.416691+00:00","2779","数组的最大美丽值","maximum-beauty-of-an-array-after-applying-operation",1463471392],"1464742605":["双指针 + O(1) 空间（Python/Java/C++/Go）","by-endlesscheng-b120","2022-06-11T23:29:40.162513+00:00","2302","统计得分小于 K 的子数组数目","count-subarrays-with-score-less-than-k",1464742605],"1466738944":["O(n) 脑筋急转弯（Python/Java/C++/Go）","on-nao-jin-ji-zhuan-wan-pythonjavacgo-by-2lea","2024-01-21T01:13:27.528741+00:00","3012","通过操作使数组长度最小","minimize-length-of-array-using-operations",1466738944],"146862112":["分类讨论+详细证明+简洁写法+优化（Python/Java/C++/Go）","fen-lei-tao-lun-xiang-xi-zheng-ming-jian-sqj2","2022-11-03T23:34:40.301281+00:00","754","到达终点数字","reach-a-number",146862112],"1471696394":["从 O(nlogn) 到 O(n)（Python/Java/C++/Go）","cong-onlogn-dao-onpythonjavacgo-by-endle-gmna","2024-01-21T08:46:48.129358+00:00","3010","将数组分成最小总代价的子数组 I","divide-an-array-into-subarrays-with-minimum-cost-i",1471696394],"1474617560":["【转换】最大子数组和（Python/Java/C++/Go）","zhuan-huan-zui-da-zi-shu-zu-he-pythonjav-6it2","2023-04-01T23:41:16.886175+00:00","2606","找到最大开销的子字符串","find-the-substring-with-maximum-cost",1474617560],"14750873":["两种方法：遍历/枚举因子","bian-li-by-endlesscheng-kst7","2023-07-16T04:11:41.074852+00:00","2778","特殊元素平方和","sum-of-squares-of-special-elements",14750873],"1475483634":["模拟","mo-ni-by-endlesscheng-tuxo","2022-03-06T04:09:28.205178+00:00","2194","Excel 表中某个范围内的单元格","cells-in-a-range-on-an-excel-sheet",1475483634],"147891676":["O(n) 一次遍历（Python/Java/C++/Go）","by-endlesscheng-pq2x","2022-08-20T23:57:50.888796+00:00","2380","二进制字符串重新安排顺序需要的时间","time-needed-to-rearrange-a-binary-string",147891676],"1485423720":["遍历两个 # 之间的字符","mei-ju-liang-ge-zhi-jian-de-zi-fu-by-end-pjq1","2021-09-26T04:12:19.876343+00:00","2018","判断单词是否能放入填字游戏内","check-if-word-can-be-placed-in-crossword",1485423720],"149268417":["同向双指针 + 记录第一条线段的最大覆盖数（Python/Java/C++/Go）","tong-xiang-shuang-zhi-zhen-ji-lu-di-yi-t-5hlh","2023-02-04T16:13:19.508927+00:00","2555","两个线段获得的最多奖品","maximize-win-from-two-segments",149268417],"1493116499":["O(1) 额外空间做法","o1-kong-jian-zuo-fa-by-endlesscheng-lz2r","2023-02-04T16:16:36.707428+00:00","2553","分割数组中数字的数位","separate-the-digits-in-an-array",1493116499],"1497402060":["两种非暴力做法：排序 / 哈希表","fei-bao-li-zuo-fa-by-endlesscheng-9ekp","2022-11-20T04:21:42.376860+00:00","2475","数组中不等三元组的数目","number-of-unequal-triplets-in-array",1497402060],"1501707049":["拆位+化简成一个漂亮的结论（Python/Java/C++/Go）","chai-wei-hua-jian-cheng-yi-ge-piao-liang-pun6","2023-01-07T16:13:29.873864+00:00","2527","查询数组异或美丽值","find-xor-beauty-of-array",1501707049],"1502620621":["DFS 求每个连通块的点数和边数（Python/Java/C++/Go）","dfs-qiu-mei-ge-lian-tong-kuai-de-dian-sh-opg4","2023-05-14T04:10:26.815405+00:00","2685","统计完全连通分量的数量","count-the-number-of-complete-components",1502620621],"1507011086":["计算前后缀 + 简洁写法","ji-suan-qian-hou-zhui-jian-ji-xie-fa-by-b8els","2022-01-30T04:36:03.923779+00:00","2155","分组得分最高的所有下标","all-divisions-with-the-highest-score-of-a-binary-array",1507011086],"1507332922":["【模板】Lazy 线段树（Python/Java/C++/Go/JS）","xian-duan-shu-by-endlesscheng-vx80","2023-02-18T16:10:20.386628+00:00","2569","更新数组后处理求和查询","handling-sum-queries-after-update",1507332922],"1507774284":["库函数模拟","ku-han-shu-mo-ni-by-endlesscheng-95jd","2022-05-08T04:07:50.295156+00:00","2264","字符串中最大的 3 位相同数字","largest-3-same-digit-number-in-string",1507774284],"1512857430":["Go 库函数模拟","go-ku-han-shu-by-endlesscheng-1jx1","2022-05-29T06:14:15.928650+00:00","2288","价格减免","apply-discount-to-prices",1512857430],"1515775640":["一次遍历：记录字母上次出现的位置（Python/Java/C++/Go）","yi-ci-bian-li-ji-lu-zi-mu-shang-ci-chu-x-r6wc","2022-09-04T04:09:17.198778+00:00","2399","检查相同字母间的距离","check-distances-between-same-letters",1515775640],"1518041298":["贪心及其正确性证明","go-tan-xin-by-endlesscheng-7h9n","2021-08-08T04:09:27.862882+00:00","1963","使字符串平衡的最小交换次数","minimum-number-of-swaps-to-make-the-string-balanced",1518041298],"1518510268":["反悔贪心，附题单（Python/Java/C++/Go/JS/Rust）","fan-hui-tan-xin-fu-ti-dan-pythonjavacgoj-hxup","2024-02-06T00:26:07.328645+00:00","LCP 30","魔塔游戏","p0NxJO",1518510268],"1519348229":["【视频】做了N遍还不会？一个视频讲透！（Python/Java/C++/Go/JS/Rust）","zuo-liao-nbian-huan-bu-hui-yi-ge-shi-pin-ukwm","2022-11-16T09:30:04.634527+00:00","42","接雨水","trapping-rain-water",1519348229],"1520385101":["原地堆化 O(1) 空间（附题单）Python/Java/C++/Go/JS/Rust","yuan-di-dui-hua-o1-kong-jian-fu-ti-dan-p-fzdh","2023-10-27T23:57:48.259515+00:00","2558","从数量最多的堆取走礼物","take-gifts-from-the-richest-pile",1520385101],"1523645158":["经典题：树的直径（Python/Java/C++/Go）","by-endlesscheng-92fw","2022-04-17T04:12:08.579295+00:00","2246","相邻字符不同的最长路径","longest-path-with-different-adjacent-characters",1523645158],"1526363744":["Go 模拟","go-mo-ni-by-endlesscheng-92l9","2021-06-27T04:08:47.089115+00:00","1914","循环轮转矩阵","cyclically-rotating-a-grid",1526363744],"1526976016":["暴力+模拟","bao-li-mo-ni-by-endlesscheng-8u6v","2021-12-26T04:08:47.118515+00:00","2120","执行所有后缀指令","execution-of-all-suffix-instructions-staying-in-a-grid",1526976016],"1528579119":["BFS 为什么要用队列？一个视频讲透！（Python/Java/C++/Go/JS/Rust）","bfs-wei-shi-yao-yao-yong-dui-lie-yi-ge-s-wmul","2024-02-14T23:59:31.591592+00:00","107","二叉树的层序遍历 II","binary-tree-level-order-traversal-ii",1528579119],"1529011687":["暴力","bao-li-by-endlesscheng-xh0b","2022-12-18T04:07:20.781190+00:00","2507","使用质因数之和替换后可以取到的最小值","smallest-value-after-replacing-with-sum-of-prime-factors",1529011687],"1535345394":["两种思路：先外后内/出界标记（附题单！）","liang-chong-si-lu-xian-wai-hou-nei-chu-j-b1e4","2023-06-18T00:29:42.656952+00:00","1254","统计封闭岛屿的数目","number-of-closed-islands",1535345394],"1537635707":["脑筋急转弯+一行代码（Python/Java/C++/Go）","nao-jin-ji-zhuan-wan-yi-xing-dai-ma-by-e-0fce","2023-01-22T04:07:16.849019+00:00","2546","执行逐位运算使字符串相等","apply-bitwise-operations-to-make-strings-equal",1537635707],"1538966566":["判断三点共线","pan-duan-san-dian-gong-xian-chao-jian-ji-0n0o","2022-05-22T04:13:32.874938+00:00","2280","表示一个折线图的最少线段数","minimum-lines-to-represent-a-line-chart",1538966566],"1539515792":["单调队列优化 DP（Python/Java/C++/Go）","dan-diao-dui-lie-you-hua-dp-by-endlessch-j5qd","2023-11-26T01:54:23.187309+00:00","2945","找到最大非递减数组的长度","find-maximum-non-decreasing-array-length",1539515792],"1541316145":["Go 模拟","mo-ni-by-endlesscheng-70do","2021-10-03T04:06:49.706453+00:00","2028","找出缺失的观测数据","find-missing-observations",1541316145],"1542173395":["贪心+一次遍历（Python/Java/C++/Go）","mo-ni-by-endlesscheng-bx0d","2022-08-21T04:25:21.708258+00:00","2383","赢得比赛需要的最少训练时长","minimum-hours-of-training-to-win-a-competition",1542173395],"1546633713":["【视频】股票买卖通用方法！教你一步步思考动态规划！（Python/Java/C++/Go/JS/Rust）","shi-pin-gu-piao-mai-mai-tong-yong-fang-f-0u38","2023-10-06T00:28:32.902412+00:00","714","买卖股票的最佳时机含手续费","best-time-to-buy-and-sell-stock-with-transaction-fee",1546633713],"1547023723":["两种写法：KMP+二分查找/双指针（Python/Java/C++/Go）","kmper-fen-cha-zhao-by-endlesscheng-7bjm","2024-01-14T04:18:32.856356+00:00","3008","找出数组中的美丽下标 II","find-beautiful-indices-in-the-given-array-ii",1547023723],"1548254728":["Go 二分","go-er-fen-by-endlesscheng-yal5","2021-06-13T04:09:03.690335+00:00","1898","可移除字符的最大数目","maximum-number-of-removable-characters",1548254728],"1558678323":["BFS 为什么要用队列？一个视频讲透！（Python/Java/C++/Go）","bfs-wei-shi-yao-yao-yong-dui-lie-yi-ge-s-loh4","2023-01-16T07:34:25.283703+00:00","LCR 045","找树左下角的值","LwUNpT",1558678323],"1559330514":["组合数学（Python/Java/C++/Go）","zu-he-shu-xue-pythonjavacgo-by-endlessch-whff","2023-09-03T11:57:54.519765+00:00","2842","统计一个字符串的 k 子序列美丽值最大的数目","count-k-subsequences-of-a-string-with-maximum-beauty",1559330514],"1565798166":["别想太复杂，模拟题罢了！（Python/Java/C++/Go）","bie-xiang-tai-fu-za-mo-ni-ti-ba-liao-pyt-9t87","2023-05-05T14:21:12.577068+00:00","1419","数青蛙","minimum-number-of-frogs-croaking",1565798166],"1567110694":["线段树优化 DP（Python/Java/C++/Go）","zhi-yu-xian-duan-shu-pythonjavacgo-by-en-p1gz","2022-09-11T04:11:37.712895+00:00","2407","最长递增子序列 II","longest-increasing-subsequence-ii",1567110694],"1571048900":["哈希表","ha-xi-biao-by-endlesscheng-k6f5","2022-10-29T23:53:46.127485+00:00","2451","差值数组不同的字符串","odd-string-difference",1571048900],"1576706031":["又写死循环了？一个视频讲透二分！（Python/Java/C++/Go）","by-endlesscheng-9ass","2022-11-23T10:10:26.579288+00:00","162","寻找峰值","find-peak-element",1576706031],"1579629689":["暴力模拟","bao-li-mo-ni-by-endlesscheng-bqba","2022-12-11T04:24:09.278107+00:00","2502","设计内存分配器","design-memory-allocator",1579629689],"1582953363":["结论题：三行搞定（Python/Java/C++/Go）","jie-lun-ti-san-xing-gao-ding-by-endlessc-bvnw","2022-03-20T04:10:47.224962+00:00","2211","统计道路上的碰撞次数","count-collisions-on-a-road",1582953363],"1583176635":["两种方法：最小堆/分治（Python/Java/C++/Go/JS）","liang-chong-fang-fa-zui-xiao-dui-fen-zhi-zbzx","2023-08-12T00:05:51.579273+00:00","23","合并 K 个升序链表","merge-k-sorted-lists",1583176635],"1583349779":["一步步优化！从前缀和到前缀异或和（附题单！）","yi-bu-bu-you-hua-cong-qian-zhui-he-dao-q-yh5p","2023-06-15T00:19:15.694350+00:00","1177","构建回文串检测","can-make-palindrome-from-substring",1583349779],"158335627":["两种 O(n) 方法：照搬 2602 / 考虑距离之和的增量","zhao-ban-2602-ti-by-endlesscheng-6pbi","2023-04-09T04:31:04.938868+00:00","2615","等值距离和","sum-of-distances",158335627],"1584359446":["判断子树点权和是否为 k 的倍数（Python/Java/C++/Go）","pan-duan-zi-shu-dian-quan-he-shi-fou-wei-uvsg","2023-10-01T02:01:17.796867+00:00","2872","可以被 K 整除连通块的最大数目","maximum-number-of-k-divisible-components",1584359446],"1589710386":["【视频】如何思考树形 DP？改成一般树要怎么做？（Python/Java/C++/Go/JS/Rust）","shi-pin-ru-he-si-kao-shu-xing-dpgai-chen-uqsf","2023-09-21T09:02:30.443700+00:00","968","监控二叉树","binary-tree-cameras",1589710386],"1590024460":["脑筋急转弯+排序统计（Python/Java/C++/Go/JS/Rust）","nao-jin-ji-zhuan-wan-pai-xu-tong-ji-pyth-we55","2023-06-11T01:05:23.132769+00:00","2731","移动机器人","movement-of-robots",1590024460],"1599758478":["模拟（代码同 59 题）","by-endlesscheng-4dwy","2022-07-03T04:10:05.918472+00:00","2326","螺旋矩阵 IV","spiral-matrix-iv",1599758478],"1602330770":["按题意实现（Python/Java/C++/Go/JS）","an-ti-yi-shi-xian-by-endlesscheng-a34t","2023-04-23T04:18:15.808581+00:00","2651","计算列车到站时间","calculate-delayed-arrival-time",1602330770],"1603806327":["两种方法：DP / BFS","cong-ji-yi-hua-sou-suo-dao-di-tui-by-end-pgq3","2023-05-14T04:07:35.203807+00:00","2684","矩阵中移动的最大次数","maximum-number-of-moves-in-a-grid",1603806327],"1604381884":["建图 + 暴力枚举所有起点","jian-tu-bao-li-mei-ju-suo-you-qi-dian-by-h4mj","2021-12-11T16:11:56.629648+00:00","2101","引爆最多的炸弹","detonate-the-maximum-bombs",1604381884],"1610031866":["统计 + 倒序枚举（附位运算做法）","tong-ji-dao-xu-mei-ju-by-endlesscheng-5pli","2022-06-19T04:24:26.467729+00:00","2309","兼具大小写的最好英文字母","greatest-english-letter-in-upper-and-lower-case",1610031866],"1614249365":["模拟","mo-ni-by-endlesscheng-gc3m","2022-11-13T04:06:56.927690+00:00","2469","温度转换","convert-the-temperature",1614249365],"1615798591":["模拟","mo-ni-by-endlesscheng-2a18","2022-04-17T04:13:57.779867+00:00","2243","计算字符串的数字和","calculate-digit-sum-of-a-string",1615798591],"1616359180":["暴力枚举","bao-li-mei-ju-by-endlesscheng-afko","2022-10-29T23:58:44.829128+00:00","2452","距离字典两次编辑以内的单词","words-within-two-edits-of-dictionary",1616359180],"1620091732":["转换 + 贪心（Python/Java/C++/Go）","zhuan-huan-tan-xin-pythonjavacgo-by-endl-vdgw","2022-07-17T04:09:24.999931+00:00","2344","使数组可以被整除的最少删除次数","minimum-deletions-to-make-array-divisible",1620091732],"1620549524":["本题最简单写法（Python/Java/C++/Go）","ben-ti-zui-jian-dan-xie-fa-pythonjavacgo-t174","2023-10-22T05:45:03.792395+00:00","2910","合法分组的最少组数","minimum-number-of-groups-to-create-a-valid-assignment",1620549524],"1620554900":["一题双解：贪心+堆 / 差分","by-endlesscheng-ze3t","2022-09-11T04:16:38.965677+00:00","2406","将区间分为最少组数","divide-intervals-into-minimum-number-of-groups",1620554900],"1621119601":["前缀和+哈希表（附题单）Python/Java/C++/Go","qian-zhui-he-ha-xi-biao-fu-ti-dan-python-z61d","2024-02-04T00:58:10.672668+00:00","3026","最大好子数组和","maximum-good-subarray-sum",1621119601],"1627181507":["枚举起点跑 BFS（Python/Java/C++/Go）","mei-ju-qi-dian-pao-bfs-by-endlesscheng-s5bu","2022-12-04T04:14:26.304848+00:00","2493","将节点分成尽可能多的组","divide-nodes-into-the-maximum-number-of-groups",1627181507],"1632602455":["【视频】一个视频秒懂单调队列！附题单！（Python/Java/C++/Go/JS/Rust）","shi-pin-yi-ge-shi-pin-miao-dong-dan-diao-ezj6","2023-10-26T09:28:34.061808+00:00","239","滑动窗口最大值","sliding-window-maximum",1632602455],"1637468390":["巧妙利用性质，维护最大值（Python/Java/C++/Go）","qiao-miao-li-yong-xing-zhi-wei-hu-zui-da-79yx","2023-06-13T23:51:35.881364+00:00","1375","二进制字符串前缀一致的次数","number-of-times-binary-string-is-prefix-aligned",1637468390],"1642092986":["并查集+分组排序","bing-cha-ji-fen-zu-pai-xu-by-endlesschen-kfav","2021-09-05T04:06:56.444113+00:00","1998","数组的最大公因数排序","gcd-sort-of-an-array",1642092986],"164313417":["Go 库函数正则匹配","go-ku-han-shu-zhengz-by-endlesscheng-8c1u","2022-05-13T12:48:56.424216+00:00","44","通配符匹配","wildcard-matching",164313417],"1644032538":["把 1 都聚在一起（Python/Java/C++/Go）","ba-1-du-ju-zai-yi-qi-pythonjavacgo-by-en-rzng","2023-10-08T04:10:54.873220+00:00","2897","对数组执行操作使平方和最大","apply-operations-on-array-to-maximize-sum-of-squares",1644032538],"1645223251":["非暴力做法，分类讨论（Python/Java/C++/Go）","fei-bao-li-zuo-fa-fen-lei-tao-lun-python-p1g2","2023-12-31T04:25:42.032993+00:00","2981","找出出现至少三次的最长特殊子字符串 I","find-longest-special-substring-that-occurs-thrice-i",1645223251],"1645809775":["贪心","tan-xin-by-endlesscheng-kz1d","2021-06-19T07:51:13.015704+00:00","LCS 02","完成一半题目","WqXACV",1645809775],"1648003092":["又写错了？一个视频讲透！O(1) 空间写法（Python/Java/C++/Go/JS/Rust）","you-xie-cuo-liao-yi-ge-shi-pin-jiang-tou-o5zy","2022-11-26T09:41:15.890716+00:00","206","反转链表","reverse-linked-list",1648003092],"1650421130":["转换成求不同元素的个数","zhuan-huan-cheng-qiu-bu-tong-yuan-su-de-vcnq8","2022-07-31T04:06:53.003504+00:00","2357","使数组中所有元素都等于零","make-array-zero-by-subtracting-equal-amounts",1650421130],"1651110316":["没想明白？一张图秒懂！（Python/Java/C++/Go）","mei-xiang-ming-bai-yi-zhang-tu-miao-dong-imvy","2023-03-17T13:44:11.122665+00:00","1616","分割两个字符串得到回文串","split-two-strings-to-make-palindrome",1651110316],"1652287983":["按题意模拟","an-ti-yi-mo-ni-by-endlesscheng-koed","2023-04-23T01:03:18.000284+00:00","LCP 73","探险营地","0Zeoeg",1652287983],"1658221095":["滑动窗口（附题单！）Python/Java/C++/Go","hua-dong-chuang-kou-fu-ti-dan-pythonjava-xvwg","2023-12-10T04:08:15.372761+00:00","2962","统计最大元素出现至少 K 次的子数组","count-subarrays-where-max-element-appears-at-least-k-times",1658221095],"1659259166":["本题最简单写法（Python/Java/C++/Go/JS/Rust）","ben-ti-zui-jian-dan-xie-fa-pythonjavacgo-6a6k","2023-09-29T00:05:30.971055+00:00","605","种花问题","can-place-flowers",1659259166],"1661781078":["Go 前缀和","go-qian-zhui-he-by-endlesscheng-10hh","2021-12-06T03:12:03.968180+00:00","1788","最大化花园的美观度","maximize-the-beauty-of-the-garden",1661781078],"1670099365":["Go 贪心","tan-xin-by-endlesscheng-fwk8","2021-05-29T16:10:22.189449+00:00","1877","数组中最大数对和的最小值","minimize-maximum-pair-sum-in-array",1670099365],"1676080206":["击败 100%！从记忆化搜索到递推，教你一步步思考动态规划！（Python/Java/C++/Go/JS/Rust）","ji-bai-100cong-ji-yi-hua-sou-suo-dao-di-421ab","2023-10-23T23:27:38.621898+00:00","1155","掷骰子等于目标和的方法数","number-of-dice-rolls-with-target-sum",1676080206],"1687003236":["DP 优化技巧：拆项+前后缀最大值","dp-you-hua-ji-qiao-chai-xiang-qian-hou-z-5vvc","2021-07-18T04:06:30.733987+00:00","1937","扣分后的最大得分","maximum-number-of-points-with-cost",1687003236],"1689171801":["两种做法：枚举+考虑变化量 / 中位数贪心","by-endlesscheng-i10r","2022-10-23T08:19:58.724437+00:00","2448","使数组相等的最小开销","minimum-cost-to-make-array-equal",1689171801],"1691357385":["【转换】中位数贪心+裴蜀定理（Python/Java/C++/Go）","zhuan-huan-zhong-wei-shu-tan-xin-pei-shu-4dut","2023-04-01T23:21:53.330520+00:00","2607","使子数组元素和相等","make-k-subarray-sums-equal",1691357385],"169260234":["两种做法：记忆化搜索 / 递推（Python/Java/C++/Go）","ji-yi-hua-sou-suo-by-endlesscheng-qctr","2022-11-06T04:07:51.028782+00:00","2463","最小移动总距离","minimum-total-distance-traveled",169260234],"169616499":["简洁写法（Python/Java/C++/Go/JS）","jian-ji-xie-fa-pythonjavacgojs-by-endles-gwxt","2023-08-25T00:28:55.719334+00:00","1448","统计二叉树中好节点的数目","count-good-nodes-in-binary-tree",169616499],"1697537146":["【模板】多重背包求方案数（Python/Java/C++/Go）","fen-zu-bei-bao-pythonjavacgo-by-endlessc-ludl","2023-03-05T04:06:53.368913+00:00","2585","获得分数的方法数","number-of-ways-to-earn-points",1697537146],"1698302709":["教你一步步思考动态规划：从记忆化搜索到递推（两种状态定义+题单）Python/Java/C++/Go/JS/Rust","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-9y5k","2023-12-26T00:51:10.770954+00:00","1349","参加考试的最大学生数","maximum-students-taking-exam",1698302709],"170017720":["Go 模拟","go-mo-ni-by-endlesscheng-w4it","2021-09-19T04:06:46.866797+00:00","2011","执行操作后的变量值","final-value-of-variable-after-performing-operations",170017720],"1700620911":["状态设计+BFS ","zhuang-tai-she-ji-bfs-by-endlesscheng-nf0j","2021-09-25T10:07:14.534832+00:00","LCP 45","自行车炫技赛场","kplEvH",1700620911],"1708402068":["三种方法：二分答案+数位 DP/数学公式/逐位构造（Python/Java/C++/Go）","er-fen-da-an-shu-wei-dpwei-yun-suan-pyth-tkir","2024-01-14T04:10:06.179077+00:00","3007","价值和小于等于 K 的最大数字","maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k",1708402068],"1709868853":["预处理 s 中的所有数字（Python/Java/C++/Go）","yu-chu-li-suo-you-s-zhong-de-shu-zi-by-e-yxl2","2023-02-12T04:14:55.138619+00:00","2564","子字符串异或查询","substring-xor-queries",1709868853],"1712826586":["二分答案（视频讲解）","er-fen-da-an-by-endlesscheng-y8fp","2022-12-25T00:53:33.039196+00:00","2513","最小化两个数组中的最大值","minimize-the-maximum-of-two-arrays",1712826586],"1715714434":["DFS+记录深度和父节点（Python/Java/C++/Go）","liang-chong-dfs-xie-fa-pythonjavacgojsru-wzb2","2024-02-08T00:53:07.748906+00:00","993","二叉树的堂兄弟节点","cousins-in-binary-tree",1715714434],"1716625654":["暴力枚举 + 哈希表","mo-ni-ha-xi-biao-by-endlesscheng-ncai","2022-03-13T04:10:20.970623+00:00","2201","统计可以提取的工件","count-artifacts-that-can-be-extracted",1716625654],"1717938721":["【图解】一张图秒懂 LFU！（Python/Java/C++/Go/JS/Rust）","tu-jie-yi-zhang-tu-miao-dong-lfupythonja-f56h","2023-09-25T00:24:52.685904+00:00","460","LFU 缓存","lfu-cache",1717938721],"1723985703":["结合性质巧妙 DP（Python/Java/C++/Go）","jie-he-xing-zhi-qiao-miao-dp-by-endlessc-b963","2022-02-27T04:11:36.332389+00:00","2188","完成比赛的最少时间","minimum-time-to-finish-the-race",1723985703],"1725183127":["模拟（Python/Java/C++/Go）","mo-ni-pythonjavacgo-by-endlesscheng-42qp","2023-05-07T05:02:22.291843+00:00","2672","有相同颜色的相邻元素数目","number-of-adjacent-elements-with-the-same-color",1725183127],"1728101846":["Go 预处理优化","go-yu-chu-li-you-hua-by-endlesscheng-61mj","2021-07-11T02:01:25.766437+00:00","1925","统计平方和三元组的数目","count-square-sum-triples",1728101846],"1729291424":["逐个考虑每一个比特位","by-endlesscheng-dwja","2022-05-15T08:52:55.001614+00:00","2275","按位与结果大于零的最长组合","largest-combination-with-bitwise-and-greater-than-zero",1729291424],"1732202044":["遍历+利用性质简化代码","bian-li-by-endlesscheng-hi82","2023-01-15T04:13:52.920309+00:00","2535","数组元素和与数字和的绝对差","difference-between-element-sum-and-digit-sum-of-an-array",1732202044],"173367747":["O(1) 做法！位运算的巧妙运用！（Python/Java/C++/Go）","o1-zuo-fa-wei-yun-suan-de-qiao-miao-yun-lvnvr","2023-11-19T04:07:44.463448+00:00","2939","最大异或乘积","maximum-xor-product",173367747],"1737726232":["哈希表模拟","ha-xi-biao-mo-ni-by-endlesscheng-6p09","2022-04-03T04:08:20.813274+00:00","2225","找出输掉零场或一场比赛的玩家","find-players-with-zero-or-one-losses",1737726232],"1742923454":["教你一步步思考动态规划！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-hzz6","2023-06-27T00:47:32.632311+00:00","1186","删除一次得到子数组最大和","maximum-subarray-sum-with-one-deletion",1742923454],"1744896373":["击败 100%！从递归到递推到优化，教你一步步思考动态规划！（Python/Java/C++/Go/JS）","ji-bai-100cong-di-gui-dao-di-tui-dao-you-dxz5","2023-08-17T00:04:32.584109+00:00","1444","切披萨的方案数","number-of-ways-of-cutting-a-pizza",1744896373],"1749795074":["从大往小贪心 + 简洁写法","by-endlesscheng-kt0y","2022-04-03T04:08:48.945608+00:00","2224","转化时间需要的最少操作数","minimum-number-of-operations-to-convert-time",1749795074],"1751494517":["分类讨论（Python/Java/C++/Go/JS/Rust）","fen-lei-tao-lun-by-endlesscheng-aerr","2023-01-08T00:31:04.266560+00:00","2525","根据规则将箱子分类","categorize-box-according-to-criteria",1751494517],"1766481102":["暴力枚举","bao-li-mei-ju-by-endlesscheng-nz2g","2023-04-16T04:19:28.514577+00:00","2644","找出可整除性得分最大的整数","find-the-maximum-divisibility-score",1766481102],"177009894":["简单数学","mo-ni-by-endlesscheng-fidq","2022-02-19T16:11:00.011687+00:00","2177","找到和为给定整数的三个连续整数","find-three-consecutive-integers-that-sum-to-a-given-number",177009894],"1770113758":["原地修改算法，O(1) 额外空间","jian-ji-xie-fa-by-endlesscheng-c4gf","2022-02-20T05:51:56.879210+00:00","2181","合并零之间的节点","merge-nodes-in-between-zeros",1770113758],"1775341601":["按照拓扑序 DP","an-zhao-tuo-bu-xu-dp-by-endlesscheng-2n4g","2021-05-09T04:05:53.201411+00:00","1857","有向图中最大颜色值","largest-color-value-in-a-directed-graph",1775341601],"1779771436":["动态规划：从记忆化搜索到递推（Python/Java/C++/Go）","dong-tai-gui-hua-cong-ji-yi-hua-sou-suo-wtd7a","2023-05-28T01:15:05.832258+00:00","2707","字符串中的额外字符","extra-characters-in-a-string",1779771436],"1782593021":["O(1) 数学公式，一行搞定（Python/Java/C++/Go）","o1-shu-xue-gong-shi-yi-xing-gao-ding-pyt-m5cq","2023-10-08T04:17:41.738023+00:00","2894","分类求和并作差","divisible-and-non-divisible-sums-difference",1782593021],"1783870964":["简洁模拟 + O(1) 空间","o-by-endlesscheng-952i","2022-04-02T16:13:29.403035+00:00","2221","数组的三角和","find-triangular-sum-of-an-array",1783870964],"1784527717":["O(n) 滑动窗口（Python/Java/C++/Go/JS）","on-hua-dong-chuang-kou-by-endlesscheng-9ztb","2023-07-30T04:21:54.727137+00:00","2799","统计完全子数组的数目","count-complete-subarrays-in-an-array",1784527717],"1785363546":["转换成逆序对模型（Python/Java/C++/Go）","by-endlesscheng-9prc","2022-10-02T01:01:48.005188+00:00","2426","满足不等式的数对数目","number-of-pairs-satisfying-inequality",1785363546],"1785554828":["证明：至多循环 6 次（Python/Java/C++/Go）","zheng-ming-zhi-duo-xun-huan-6-ci-pythonj-b6sj","2023-03-01T14:38:51.401430+00:00","面试题 05.02","二进制数转字符串","binary-number-to-string-lcci",1785554828],"1785562293":["脑筋急转弯","nao-jin-ji-zhuan-wan-by-endlesscheng-9l4m","2023-02-18T16:13:55.771593+00:00","2567","修改两个元素的最小分数","minimum-score-by-changing-two-elements",1785562293],"178720857":["贪心（Python/Java/C++/Go）","tan-xin-pythonjavacgo-by-endlesscheng-yix5","2023-04-30T04:07:44.632421+00:00","2663","字典序最小的美丽字符串","lexicographically-smallest-beautiful-string",178720857],"1787510201":["区间 DP+哈希表","qu-jian-dpha-xi-biao-by-endlesscheng-62fj","2021-09-26T06:26:48.199513+00:00","2019","解出数学表达式的学生分数","the-score-of-students-solving-math-expression",1787510201],"1795607316":["离散化+二维差分（Python/Java/C++/Go）","chi-san-hua-er-wei-chai-fen-by-endlessch-q43z","2023-04-22T09:50:47.026935+00:00","LCP 74","最强祝福力场","xepqZ5",1795607316],"1796150705":["三种算法+优化（Python/Java/C++/Go）","san-chong-suan-fa-you-hua-pythonjavacgo-tk4cj","2023-05-09T15:39:53.511980+00:00","1015","可被 K 整除的最小整数","smallest-integer-divisible-by-k",1796150705],"1814552069":["O(n^2) 前缀和+哈希表","on2-qian-zhui-he-ha-xi-biao-by-endlessch-iae7","2021-12-06T05:37:01.164460+00:00","548","将数组分割成和相等的子数组","split-array-with-equal-sum",1814552069],"1816814719":["双指针，O(n) 时间 O(1) 空间（Python/Java/C++/Go）","shuang-zhi-zhen-on-shi-jian-o1-kong-jian-3fl2","2023-12-24T01:14:06.394608+00:00","2970","统计移除递增子数组的数目 I","count-the-number-of-incremovable-subarrays-i",1816814719],"1819395589":["简洁写法：排序+一次遍历（Python/Java/C++/Go）","jian-ji-xie-fa-pai-xu-yi-ci-bian-li-by-e-unnb","2021-09-05T04:07:53.955079+00:00","1996","游戏中弱角色的数量","the-number-of-weak-characters-in-the-game",1819395589],"1825399219":["【一图秒懂】枚举起点跑 BFS（Python/Java/C++/Go）","yi-tu-miao-dong-mei-ju-qi-dian-pao-bfspy-ntck","2023-04-01T22:49:25.771043+00:00","2608","图中的最短环","shortest-cycle-in-a-graph",1825399219],"1829348697":["枚举（Python/Java/C++/Go）","mei-ju-pythonjavacgo-by-endlesscheng-enj0","2024-02-18T04:50:29.990328+00:00","3044","出现频率最高的质数","most-frequent-prime",1829348697],"183030256":["模拟（Python/Java/C++/Go/JS）","mo-ni-by-endlesscheng-cmsg","2023-05-14T04:10:57.587657+00:00","2682","找出转圈游戏输家","find-the-losers-of-the-circular-game",183030256],"184027593":["【视频】回溯不会写？套路在此！（Python/Java/C++/Go）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-3orv","2023-01-13T01:39:54.943391+00:00","17","电话号码的字母组合","letter-combinations-of-a-phone-number",184027593],"1840603422":["【视频】如何灵活运用递归？（Python/Java/C++/Go/JS/Rust）","ru-he-ling-huo-yun-yong-di-gui-lai-kan-s-empk","2022-12-10T10:03:46.818837+00:00","100","相同的树","same-tree",1840603422],"1850921957":["贪心：排序+奇偶分组（Python/Java/C++/Go/JS/Rust）","tan-xin-by-endlesscheng-x2o6","2023-03-04T16:15:34.791934+00:00","2578","最小和分割","split-with-minimum-sum",1850921957],"1853031865":["贪心，简洁写法（Python/Java/C++/Go）","tan-xin-jian-ji-xie-fa-pythonjavacgo-by-5svh1","2023-05-07T04:40:58.447896+00:00","2673","使二叉树所有路径值相等的最小代价","make-costs-of-paths-equal-in-a-binary-tree",1853031865],"1853208613":["计算 gcd(a,b) 的因子（Python/Java/C++/Go）","mei-ju-yin-zi-by-endlesscheng-v3fb","2022-10-02T04:08:40.454009+00:00","2427","公因子的数目","number-of-common-factors",1853208613],"1856172895":["O(n) 做法：双指针 + 单调队列（Python/Java/C++/Go）","by-endlesscheng-7ukp","2022-09-04T00:04:45.113603+00:00","2398","预算内的最多机器人数目","maximum-number-of-robots-within-budget",1856172895],"1857526630":["逆向思维（Python/Java/C++/Go）","ni-xiang-si-wei-pythonjavacgo-by-endless-915k","2023-05-14T14:06:01.799743+00:00","1072","按列翻转得到最大值等行数","flip-columns-for-maximum-number-of-equal-rows",1857526630],"1859819274":["Go map","go-map-by-endlesscheng-i2xz","2021-05-16T04:18:44.408373+00:00","1865","找出和为指定值的下标对","finding-pairs-with-a-certain-sum",1859819274],"1866851323":["差分数组（Python/Java/C++/Go/JS）","chai-fen-shu-zu-pythonjavacgojs-by-endle-8qrt","2023-07-09T04:07:48.353336+00:00","2772","使数组中的所有元素都等于零","apply-operations-to-make-all-array-elements-equal-to-zero",1866851323],"1871665913":["简洁写法，避免计算出 -1","jian-ji-xie-fa-by-endlesscheng-egqb","2021-06-20T04:07:40.812292+00:00","1904","你完成的完整对局数","the-number-of-full-rounds-you-have-played",1871665913],"1872112615":["做了N遍还不会？一个视频讲透！（Python/Java/C++/Go/JS/Rust）","by-endlesscheng-f0xz","2022-11-16T09:28:54.597543+00:00","11","盛最多水的容器","container-with-most-water",1872112615],"1872980159":["【图解单调栈】两种方法，两张图秒懂！附题单（Python/Java/C++/Go）","tu-jie-dan-diao-zhan-liang-chong-fang-fa-v9ab","2023-04-09T15:52:19.531679+00:00","1019","链表中的下一个更大节点","next-greater-node-in-linked-list",1872980159],"1876544260":["根据二叉搜索树的性质合并","gen-ju-er-cha-sou-suo-shu-de-xing-zhi-he-v8sv","2021-07-11T06:00:50.045177+00:00","1932","合并多棵二叉搜索树","merge-bsts-to-create-single-bst",1876544260],"1878147567":["两种方法：KMP / Z函数（Python/Java/C++/Go）","liang-chong-fang-fa-kmp-zhan-shu-pythonj-zil4","2024-02-11T04:31:00.476311+00:00","3036","匹配模式数组的子数组数目 II","number-of-subarrays-that-match-a-pattern-ii",1878147567],"1879020884":["滑动窗口（附题单！）Python/Java/C++/Go","hua-dong-chuang-kou-fu-ti-dan-pythonjava-2vd6","2023-09-03T11:26:54.949597+00:00","2841","几乎唯一子数组的最大和","maximum-sum-of-almost-unique-subarray",1879020884],"188352287":["等价转换 + 利用单调性（Python/Java/C++/Go）","by-endlesscheng-s2yc","2022-05-29T05:07:12.167208+00:00","2289","使数组按非递减顺序排列","steps-to-make-array-non-decreasing",188352287],"1890921841":["教你一次性把代码写对！O(n) 分组循环（Python/Java/C++/Go）","jiao-ni-yi-ci-xing-ba-dai-ma-xie-dui-on-j3nik","2024-01-21T00:48:17.463730+00:00","3011","判断一个数组是否可以变为有序","find-if-array-can-be-sorted",1890921841],"1894806233":["线性做法（Python/Java/C++/Go）","xian-xing-zuo-fa-pythonjavacgo-by-endles-e04u","2023-12-10T01:03:24.744669+00:00","2956","找到两个数组中的公共元素","find-common-elements-between-two-arrays",1894806233],"1896099954":["没看懂题意？一张图秒懂（Python/Java/C++/Go/JS/Rust）","mei-kan-dong-ti-yi-yi-zhang-tu-miao-dong-8zps","2023-10-28T23:38:53.147170+00:00","274","H 指数","h-index",1896099954],"1896286191":["BFS 求次短路，附详细注释","bfs-qiu-ci-duan-lu-fu-xiang-xi-zhu-shi-b-igf7","2021-10-17T04:06:10.097623+00:00","2045","到达目的地的第二短时间","second-minimum-time-to-reach-destination",1896286191],"1903617238":["O(n) 分类讨论 + 贪心（Python/Java/C++/Go）","fen-lei-tao-lun-tan-xin-by-endlesscheng-vnlx","2022-06-19T04:08:14.020729+00:00","2311","小于等于 K 的最长二进制子序列","longest-binary-subsequence-less-than-or-equal-to-k",1903617238],"1908656857":["脑筋急转弯：一行代码","nao-jin-ji-zhuan-wan-yi-xing-dai-ma-by-e-yfn0","2023-08-27T04:15:34.835277+00:00","2833","距离原点最远的点","furthest-point-from-origin",1908656857],"1910869482":["教你一步步思考动态规划！一个视频讲透！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-s1cx","2023-02-18T12:31:31.065482+00:00","494","目标和","target-sum",1910869482],"1913049602":["两种方法：二进制枚举 / Gosper's Hack（Python/Java/C++/Go）","by-endlesscheng-dvxe","2022-09-04T00:57:50.089683+00:00","2397","被列覆盖的最多行数","maximum-rows-covered-by-columns",1913049602],"1913772288":["两种方法：回溯/动态规划（Python/Java/C++/Go）","tao-lu-zi-ji-xing-hui-su-pythonjavacgo-b-fcgs","2023-03-19T04:09:34.732942+00:00","2597","美丽子集的数目","the-number-of-beautiful-subsets",1913772288],"1915453170":["O(n) 做法：统计小于和等于 target 的元素个数","on-zuo-fa-tong-ji-xiao-yu-he-deng-yu-tar-7ejk","2021-11-28T04:07:43.613775+00:00","2089","找出数组排序后的目标下标","find-target-indices-after-sorting-array",1915453170],"1915472102":["两种方法：从 O(n^2) 到 O(n)（Python/Java/C++/Go）","ji-yi-hua-sou-suo-by-endlesscheng-64vq","2023-10-08T04:12:01.272942+00:00","2896","执行操作使两个字符串相等","apply-operations-to-make-two-strings-equal",1915472102],"1915862517":["【模板】树上倍增（Python/Java/C++/Go）","shu-shang-bei-zeng-by-endlesscheng-xvsv","2023-08-27T04:11:03.805536+00:00","2836","在传球游戏中最大化函数值","maximize-value-of-function-in-a-ball-passing-game",1915862517],"1916400350":["教你一步步思考动态规划！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-rq5i","2023-04-18T14:49:54.161114+00:00","1043","分隔数组以得到最大和","partition-array-for-maximum-sum",1916400350],"1922249884":["O(n) 分段遍历（Python/Java/C++/Go/JS/Rust）","o1-kong-jian-jian-ji-xie-fa-pythonjavacg-u8g3","2023-04-02T05:34:05.147974+00:00","2609","最长平衡子字符串","find-the-longest-balanced-substring-of-a-binary-string",1922249884],"1927271954":["两种做法：哈希表 / 位运算","liang-chong-zuo-fa-ha-xi-biao-wei-yun-su-k69f","2023-04-01T23:45:33.447359+00:00","2605","从两个数字数组里生成最小数字","form-smallest-number-from-two-digit-arrays",1927271954],"1931269506":["一边遍历，一边计算","yi-bian-bian-li-yi-bian-ji-suan-by-endle-ep7x","2023-04-15T16:14:51.807518+00:00","2640","一个数组所有前缀的分数","find-the-score-of-all-prefixes-of-an-array",1931269506],"1933270834":["教你一步步思考动态规划：从记忆化搜索到递推（Python/Java/C++/Go/JS/Rust）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-j99e","2023-12-17T00:15:07.623644+00:00","746","使用最小花费爬楼梯","min-cost-climbing-stairs",1933270834],"1941288004":["三种方法：DFS/BFS/BFS+链表（附题单）Python/Java/C++/Go/JS","san-chong-fang-fa-dfsbfsbfslian-biao-fu-1bmqp","2023-11-02T23:07:26.693061+00:00","117","填充每个节点的下一个右侧节点指针 II","populating-next-right-pointers-in-each-node-ii",1941288004],"1944526967":["动态规划 + 二分查找优化（Python/Java/C++/Go）","dong-tai-gui-hua-er-fen-cha-zhao-you-hua-fuip","2022-10-21T23:35:32.083584+00:00","1751","最多可以参加的会议数目 II","maximum-number-of-events-that-can-be-attended-ii",1944526967],"1947285534":["双指针模拟","shuang-zhi-zhen-mo-ni-by-endlesscheng-9l76","2021-12-12T04:07:55.455217+00:00","2105","给植物浇水 II","watering-plants-ii",1947285534],"1950501535":["简洁写法：从大到小贪心","cong-da-dao-xiao-tan-xin-by-endlesscheng-b7ob","2022-02-20T05:51:14.696226+00:00","2182","构造限制重复的字符串","construct-string-with-repeat-limit",1950501535],"1952470548":["Go 一行","go-yi-xing-by-endlesscheng-p92z","2021-12-26T04:09:36.020416+00:00","2119","反转两次的数字","a-number-after-a-double-reversal",1952470548],"1954801587":["详细解释为什么要按照 a[i]+b[i] 排序（Python/Java/C++/Go/JS/Rust）","xiang-xi-jie-shi-wei-shi-yao-yao-an-zhao-0zsg","2024-02-02T00:43:37.577750+00:00","1686","石子游戏 VI","stone-game-vi",1954801587],"1955132435":["【视频】彻底掌握直径 DP！从二叉树到一般树！（Python/Java/C++/Go）","shi-pin-che-di-zhang-wo-zhi-jing-dpcong-6aoh9","2023-04-15T05:21:49.895988+00:00","LCR 051","二叉树中的最大路径和","jC7MId",1955132435],"1962061945":["贪心+前后缀分解（Python/Java/C++/Go）","tan-xin-qian-hou-zhui-fen-jie-pythonjava-wrv1","2023-05-13T16:12:35.055301+00:00","2680","最大或值","maximum-or",1962061945],"1962595835":["从大到小排序贪心","cong-da-dao-xiao-pai-xu-tan-xin-by-endle-smhf","2022-01-22T16:14:26.898990+00:00","2144","打折购买糖果的最小开销","minimum-cost-of-buying-candies-with-discount",1962595835],"1965849899":["用归纳法思考（Python/Java/C++/Go）","yong-gui-na-fa-si-kao-pythonjavacgo-by-e-8etj","2023-12-03T04:07:39.918169+00:00","2952","需要添加的硬币的最小数量","minimum-number-of-coins-to-be-added",1965849899],"1971257507":["教你一步步思考动态规划！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-f5k9","2023-03-01T01:43:57.593088+00:00","LCR 095","最长公共子序列","qJnOS7",1971257507],"19753391":["O(n) 前后缀分解+单调栈（Python/Java/C++/Go）","on-qian-hou-zhui-fen-jie-dan-diao-zhan-p-w3g0","2023-09-24T04:14:06.314918+00:00","2865","美丽塔 I","beautiful-towers-i",19753391],"1975607113":["利用或运算的性质 + 通用模板（Python/Java/C++/Go）","by-endlesscheng-zai1","2022-09-18T00:05:44.366531+00:00","2411","按位或最大的最小子数组长度","smallest-subarrays-with-maximum-bitwise-or",1975607113],"1980479000":["前缀和，或者二分位置","er-fen-wei-zhi-by-endlesscheng-zxky","2021-06-20T04:09:49.048037+00:00","1906","查询差绝对值的最小值","minimum-absolute-difference-queries",1980479000],"1982730574":["O(n) 做法：双指针+维护最大最小（Python/Java/C++/Go）","on-zuo-fa-shuang-zhi-zhen-wei-hu-zui-da-rkbk9","2023-10-15T04:20:57.442293+00:00","2903","找出满足差值条件的下标 I","find-indices-with-index-and-value-difference-i",1982730574],"1983440257":["几种不同的写法（Python/Java/C++/Go/JS）","ji-chong-bu-tong-de-xie-fa-pythonjavacgo-9trb","2023-08-06T23:55:50.683157+00:00","344","反转字符串","reverse-string",1983440257],"1988055821":["暴力枚举模拟","mei-ju-by-endlesscheng-5wzf","2022-09-24T14:59:05.293236+00:00","LCP 63","弹珠游戏","EXvqDp",1988055821],"1992185659":["二分查找总是写不对？一个视频讲透！（Python/Java/C++/Go）","er-fen-cha-zhao-zong-shi-xie-bu-dui-yi-g-eplk","2022-12-17T00:50:13.186116+00:00","704","二分查找","binary-search",1992185659],"199553622":["Go 模拟","go-mo-ni-by-endlesscheng-968e","2021-07-25T04:08:52.765538+00:00","1945","字符串转化后的各位数字之和","sum-of-digits-of-string-after-convert",199553622],"1997275023":["两种递归思路（Python/Java/C++/Go/JS）","liang-chong-di-gui-si-lu-pythonjavacgojs-xxnk","2023-09-05T23:52:06.535674+00:00","1123","最深叶节点的最近公共祖先","lowest-common-ancestor-of-deepest-leaves",1997275023],"1997404036":["模拟：将 encodedText 视作二维矩阵","mo-ni-jiang-encodedtext-shi-zuo-er-wei-j-ixba","2021-11-14T04:06:28.043091+00:00","2075","解码斜向换位密码","decode-the-slanted-ciphertext",1997404036],"2000679742":["【模板讲解】树上倍增算法（以及最近公共祖先）","mo-ban-jiang-jie-shu-shang-bei-zeng-suan-v3rw","2023-06-12T00:19:58.829459+00:00","1483","树节点的第 K 个祖先","kth-ancestor-of-a-tree-node",2000679742],"2001412357":["【图解】一张图秒懂 LRU！（Python/Java/C++/Go/JS/Rust）","tu-jie-yi-zhang-tu-miao-dong-lrupythonja-czgt","2023-09-24T00:07:08.752627+00:00","146","LRU 缓存","lru-cache",2001412357],"2001540741":["两种算法：贪心/动态规划（Python/Java/C++/Go）","liang-chong-suan-fa-tan-xin-dong-tai-gui-tsll","2023-06-19T00:45:49.841889+00:00","1262","可被三整除的最大和","greatest-sum-divisible-by-three",2001540741],"2003223492":["回溯不会写？套路在此！（Python/Java/C++/Go）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-6zca","2023-02-01T12:07:24.461774+00:00","LCR 080","组合","uUsW3B",2003223492],"2005932973":["【图解】简洁高效，一图秒懂！（Python/Java/C++/Go/JS/Rust）","tu-jie-jian-ji-gao-xiao-yi-tu-miao-dong-1427d","2023-11-03T23:48:43.909751+00:00","421","数组中两个数的最大异或值","maximum-xor-of-two-numbers-in-an-array",2005932973],"2006725411":["教你一步步思考动态规划：从记忆化搜索到递推（Python/Java/C++/Go/JS/Rust）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-7zm1","2023-12-10T00:36:40.241091+00:00","70","爬楼梯","climbing-stairs",2006725411],"2007370712":["简洁写法 / O(1) 空间写法","jian-ji-xie-fa-by-endlesscheng-xudg","2023-04-15T16:24:35.408878+00:00","2639","查询网格图中每一列的宽度","find-the-width-of-columns-of-a-grid",2007370712],"2012982950":["差分（Python 简洁写法）","by-endlesscheng-z0ad","2022-08-20T23:00:23.237228+00:00","2381","字母移位 II","shifting-letters-ii",2012982950],"2019191135":["二分查找的灵活运用！（Python/Java/C++/Go）","er-fen-cha-zhao-de-ling-huo-yun-yong-by-wplbj","2023-02-12T04:21:48.682623+00:00","2563","统计公平数对的数目","count-the-number-of-fair-pairs",2019191135],"2027773900":["暴搜+剪枝","bao-sou-jian-zhi-by-endlesscheng-iv6z","2021-11-07T04:06:15.337350+00:00","2065","最大化一张图中的路径价值","maximum-path-quality-of-a-graph",2027773900],"2036642817":["O(1) 空间写法（Python/Java/C++/Go/JS/Rust）","o1-kong-jian-xie-fa-by-endlesscheng-4vbi","2023-02-12T04:26:40.823314+00:00","2562","找出数组的串联值","find-the-array-concatenation-value",2036642817],"2048723677":["教你一步步思考动态规划！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-wdkm","2023-04-26T13:52:37.970763+00:00","1048","最长字符串链","longest-string-chain",2048723677],"2049140185":["两个有序集合维护前 k-1 小（Python/Java/C++/Go）","liang-ge-you-xu-ji-he-wei-hu-qian-k-1-xi-zdzx","2024-01-21T12:42:38.399784+00:00","3013","将数组分成最小总代价的子数组 II","divide-an-array-into-subarrays-with-minimum-cost-ii",2049140185],"2051273831":["两种模拟思路","liang-chong-mo-ni-si-lu-by-endlesscheng-axsc","2023-06-18T09:06:33.265561+00:00","2739","总行驶距离","total-distance-traveled",2051273831],"205364228":["最长递增子序列：从 O(n^2) 到 O(nlogn)（Python/Java/C++/Go）","zui-chang-di-zeng-zi-xu-lie-cong-on2-dao-ojqu","2023-03-21T14:54:42.052476+00:00","1626","无矛盾的最佳球队","best-team-with-no-conflicts",205364228],"2055099648":["排序 + 贪心","by-endlesscheng-iik6","2022-05-22T04:13:19.831105+00:00","2279","装满石头的背包的最大数量","maximum-bags-with-full-capacity-of-rocks",2055099648],"2057246561":["库函数简洁写法","ku-han-shu-jian-ji-xie-fa-by-endlesschen-ajmb","2023-12-22T08:48:26.526845+00:00","2936","包含相等值数字块的数量","number-of-equal-numbers-blocks",2057246561],"2062472427":["两种思路：树状数组模拟/挖掘性质（Python/Java/C++/Go）","shu-zhuang-shu-zu-mo-ni-pythonjavacgo-by-ygvb","2023-04-29T16:09:33.238382+00:00","2659","将数组清空","make-array-empty",2062472427],"2066860654":["【视频】讲清楚为什么要用单调栈！两种写法：从右到左/从左到右（Python/Java/C++/Go/JS/Rust）","shi-pin-jiang-qing-chu-wei-shi-yao-yao-y-k0ks","2023-10-06T12:04:21.092857+00:00","739","每日温度","daily-temperatures",2066860654],"2070962878":["O(mn) 动态规划","dong-tai-gui-hua-by-endlesscheng-depp","2021-11-27T16:16:45.157744+00:00","2088","统计农场中肥沃金字塔的数目","count-fertile-pyramids-in-a-land",2070962878],"2074713320":["分类讨论 + O(1) 做法（Python/Java/C++/Go）","fen-lei-tao-lun-o1-zuo-fa-by-endlesschen-95ef","2023-03-18T16:08:21.118839+00:00","2591","将钱分给最多的儿童","distribute-money-to-maximum-children",2074713320],"2077283915":["枚举答案（Python/Java/C++/Go）","mei-ju-da-an-pythonjavacgo-by-endlessche-t4co","2023-06-25T04:07:32.835642+00:00","2749","得到整数零需要执行的最少操作数","minimum-operations-to-make-the-integer-zero",2077283915],"2080495144":["枚举答案 + DFS（Python/Java/C++/Go）","by-endlesscheng-u03q","2022-10-16T01:10:16.425286+00:00","2440","创建价值相同的连通块","create-components-with-same-value",2080495144],"2086212420":["教你一步步思考动态规划！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-jjax","2023-02-21T15:46:44.086340+00:00","1140","石子游戏 II","stone-game-ii",2086212420],"2087368801":["没想明白？一个视频讲透！含数学推导（Python/Java/C++/Go/JS）","mei-xiang-ming-bai-yi-ge-shi-pin-jiang-t-nvsq","2022-11-30T08:50:38.572497+00:00","142","环形链表 II","linked-list-cycle-ii",2087368801],"2088822497":["两种 O(n) 做法：哈希表 / 三指针","by-endlesscheng-mpxt","2022-08-07T04:07:33.892322+00:00","2367","算术三元组的数目","number-of-arithmetic-triplets",2088822497],"2088911620":["O(n) 双指针（视频讲解）","on-shuang-zhi-zhen-by-endlesscheng-4g9p","2022-12-25T04:08:50.473968+00:00","2516","每种字符至少取 K 个","take-k-of-each-character-from-left-and-right",2088911620],"2099267983":["教你一步步思考动态规划！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-0vg6","2023-04-22T14:59:37.553789+00:00","1105","填充书架","filling-bookcase-shelves",2099267983],"210217684":["O(n) 滑动窗口","on-hua-dong-chuang-kou-by-endlesscheng-jtr5","2021-11-28T04:07:07.638463+00:00","2090","半径为 k 的子数组平均值","k-radius-subarray-averages",210217684],"2107686904":["暴力枚举","bao-li-mei-ju-by-endlesscheng-dbco","2021-09-11T09:39:43.862768+00:00","LCP 41","黑白翻转棋","fHi6rV",2107686904],"2108728330":["还原差分数组","huan-yuan-chai-fen-shu-zu-by-endlesschen-v38b","2022-01-22T16:13:52.541775+00:00","2145","统计隐藏数组数目","count-the-hidden-sequences",2108728330],"2113446044":["两种方法：暴力枚举/利用GCD性质，附题单（Python/Java/C++/Go）","liang-chong-fang-fa-bao-li-mei-ju-li-yon-refp","2023-04-23T04:09:19.688327+00:00","2654","使数组所有元素变成 1 的最少操作次数","minimum-number-of-operations-to-make-all-array-elements-equal-to-1",2113446044],"2117244239":["巧妙利用查询的特殊性","qiao-miao-li-yong-cha-xun-de-te-shu-xing-7eyg","2021-12-11T16:11:34.458794+00:00","2102","序列顺序查询","sequentially-ordinal-rank-tracker",2117244239],"2123032733":["利用异或的性质（附题单）Python/Java/C++/Go/JS/Rust","li-yong-yi-huo-de-xing-zhi-fu-ti-dan-pyt-oizc","2023-10-13T23:59:12.227077+00:00","136","只出现一次的数字","single-number",2123032733],"2123999060":["O(NB) 倒序动态规划","onb-dao-xu-dong-tai-gui-hua-by-endlessch-9khy","2021-12-08T06:35:07.093304+00:00","656","金币路径","coin-path",2123999060],"2130827066":["KMP + 矩阵快速幂优化 DP（附题单）Python/Java/C++/Go/JS","kmp-ju-zhen-kuai-su-mi-you-hua-dp-by-end-vypf","2023-09-10T04:16:10.526547+00:00","2851","字符串转换","string-transformation",2130827066],"2135327933":["逆向思维 + 贪心","ni-xiang-si-wei-tan-xin-by-endlesscheng-rwfl","2022-01-16T04:07:43.804210+00:00","2139","得到目标值的最少行动次数","minimum-moves-to-reach-target-score",2135327933],"2135431142":["位运算的魔法（Python/Java/C++/Go）","by-endlesscheng-r5ve","2023-01-22T00:22:21.009692+00:00","1815","得到新鲜甜甜圈的最多组数","maximum-number-of-groups-getting-fresh-donuts",2135431142],"2144998386":["同向双指针（滑动窗口）Python/Java/C++/Go","tong-xiang-shuang-zhi-zhen-hua-dong-chua-z7tu","2023-02-12T15:24:16.835788+00:00","1234","替换子串得到平衡字符串","replace-the-substring-for-balanced-string",2144998386],"2147986859":["枚举右，维护左（Python/Java/C++/Go/JS/Rust）","mei-ju-you-wei-hu-zuo-pythonjavacgojsrus-eoys","2023-11-18T00:10:51.409658+00:00","2342","数位和相等数对的最大和","max-sum-of-a-pair-with-equal-sum-of-digits",2147986859],"2154511916":["【图解】一张图秒懂 LRU！（Python/Java/C++/Go/JS/Rust）","tu-jie-yi-zhang-tu-miao-dong-lrupythonja-5udb","2023-12-12T14:08:27.294537+00:00","LCR 031","LRU 缓存","OrIXps",2154511916],"2155229246":["二进制枚举","er-jin-zhi-mei-ju-by-endlesscheng-rjul","2022-03-20T04:10:16.727677+00:00","2212","射箭比赛中的最大得分","maximum-points-in-an-archery-competition",2155229246],"2161204569":["Go 模拟","go-mo-ni-by-endlesscheng-2l2f","2022-01-08T16:16:54.918588+00:00","2130","链表最大孪生和","maximum-twin-sum-of-a-linked-list",2161204569],"2162382478":["拆位+线段树","chai-wei-xian-duan-shu-by-endlesscheng-d18s","2023-05-07T10:10:17.290640+00:00","LCP 81","与非的谜题","ryfUiz",2162382478],"2169721379":["哈希表模拟","ha-xi-biao-mo-ni-by-endlesscheng-wrc7","2022-05-01T04:06:28.877093+00:00","2261","含最多 K 个可整除元素的子数组","k-divisible-elements-subarrays",2169721379],"2170025879":["两种方法：Dijkstra/二分答案+BFS（Python/Java/C++/Go）","er-fen-da-an-bfspythonjavacgo-by-endless-j10w","2023-02-26T04:37:20.713182+00:00","2577","在网格图中访问一个格子的最少时间","minimum-time-to-visit-a-cell-in-a-grid",2170025879],"2172902585":["扩展：如果有 n 个节点要怎么做？（Python/Java/C++/Go/JS）","kuo-zhan-ru-guo-you-n-ge-jie-dian-yao-ze-eevi","2023-08-20T00:44:15.898542+00:00","2236","判断根结点是否等于子结点之和","root-equals-sum-of-children",2172902585],"2181231700":["二分查找，一个视频讲透！（Python/Java/C++/Go）","er-fen-cha-zhao-yi-ge-shi-pin-jiang-tou-1kbvh","2023-02-26T11:23:07.752637+00:00","LCR 128","库存管理 I","xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof",2181231700],"2182831583":["简洁写法：哈希表+拓扑排序","go-tuo-bu-pai-xu-by-endlesscheng-lnlg","2021-12-25T17:19:13.281359+00:00","2115","从给定原材料中找到所有可以做出的菜","find-all-possible-recipes-from-given-supplies",2182831583],"2184297331":["判断是否有至少两个偶数（Python/Java/C++/Go）","pan-duan-shi-fou-you-zhi-shao-liang-ge-o-aggh","2023-12-31T04:30:17.760647+00:00","2980","检查按位或是否存在尾随零","check-if-bitwise-or-has-trailing-zeros",2184297331],"2184686055":["【图解】下跳棋（Python/Java/C++/Go）","tu-jie-xia-tiao-qi-pythonjavacgo-by-endl-r1eb","2023-04-06T15:20:40.034990+00:00","1040","移动石子直到连续 II","moving-stones-until-consecutive-ii",2184686055],"218781353":["内向基环树找环 + 利用时间戳简单实现（Python/Java/C++/Go）","nei-xiang-ji-huan-shu-zhao-huan-li-yong-pmqmr","2022-07-31T04:05:51.069232+00:00","2360","图中的最长环","longest-cycle-in-a-graph",218781353],"2188606245":["没想明白？一个视频讲透！（Python/Java/C++/Go/JS/Rust）","mei-xiang-ming-bai-yi-ge-shi-pin-jiang-t-wzwm","2022-11-30T08:48:16.020937+00:00","876","链表的中间结点","middle-of-the-linked-list",2188606245],"2192706389":["三部曲：分组 - 排序 - 填回","go-mo-ni-by-endlesscheng-ttaj","2022-04-10T04:17:33.220109+00:00","2231","按奇偶性交换后的最大数字","largest-number-after-digit-swaps-by-parity",2192706389],"2193040547":["脑筋急转弯（Python/Java/C++/Go/JS/Rust）","nao-jin-ji-zhuan-wan-by-endlesscheng-vkb4","2023-04-29T16:15:40.689829+00:00","2656","K 个元素的最大和","maximum-sum-with-exactly-k-elements",2193040547],"2194073999":["Go nextPermutation","go-nextpermutation-by-endlesscheng-050e","2021-12-06T02:55:32.295222+00:00","1842","下个由相同数字构成的回文串","next-palindrome-using-same-digits",2194073999],"219694070":["数位 DP（Python/Java/C++/Go）","shu-wei-dppythonjavacgo-by-endlesscheng-4gvw","2023-08-20T02:21:50.732087+00:00","2827","范围中美丽整数的数目","number-of-beautiful-integers-in-the-range",219694070],"2197356984":["两种方法：暴力/分类讨论（Python/Java/C++/Go）","liang-chong-fang-fa-bao-li-fen-lei-tao-l-crt9","2023-04-28T13:04:12.229513+00:00","2423","删除字符使频率相同","remove-letter-to-equalize-frequency",2197356984],"2204380301":["贪心 O(log n) 做法","mei-ju-by-endlesscheng-slfa","2023-02-18T16:12:35.821967+00:00","2566","替换一个数字后的最大差值","maximum-difference-by-remapping-a-digit",2204380301],"2204914887":["枚举底边或顶边","mei-ju-di-bian-huo-ding-bian-by-endlessc-z0k9","2021-09-19T04:11:03.994507+00:00","2013","检测正方形","detect-squares",2204914887],"220667062":["贪心","tan-xin-by-endlesscheng-6q1q","2023-02-04T16:13:56.646815+00:00","2554","从一个范围内选择最多整数 I","maximum-number-of-integers-to-choose-from-a-range-i",220667062],"2207624249":["数形结合 + 巧妙地定义状态（Python/Java/C++/Go）","by-endlesscheng-fu9b","2022-09-24T15:52:46.714773+00:00","LCP 65","舒适的湿度","3aqs1c",2207624249],"2208494667":["一写就错？请看这！（Python/Java/C++/Go）","yi-xie-jiu-cuo-qing-kan-zhe-pythonjavacg-31u3","2023-03-21T03:11:23.916454+00:00","LCR 167","招式拆解 I","zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof",2208494667],"2213463441":["细分问题 + 复杂度优化（Python/Java/C++/Go）","xi-fen-wen-ti-fu-za-du-you-hua-pythonjav-1ihu","2022-10-14T00:05:29.170948+00:00","940","不同的子序列 II","distinct-subsequences-ii",2213463441],"2222019296":["深入理解递归：自顶向下/自底向上（附 O(1) 空间迭代写法！）","shen-ru-li-jie-di-gui-zi-ding-xiang-xia-ps0mm","2023-04-30T14:50:51.801278+00:00","1376","通知所有员工所需的时间","time-needed-to-inform-all-employees",2222019296],"2228358934":["O(1) 容斥原理（Python/Java/C++/Go）","o1-rong-chi-yuan-li-pythonjavacgo-by-end-2woj","2023-11-12T01:08:31.319060+00:00","2929","给小朋友们分糖果 II","distribute-candies-among-children-ii",2228358934],"223285376":["两种写法：从 O(logn) 到 O(1)（Python/Java/C++/Go）","er-jin-zhi-ji-ben-cao-zuo-pythonjavacgo-o82o2","2023-03-19T04:13:54.979454+00:00","2595","奇偶位数","number-of-even-and-odd-bits",223285376],"2240198172":["离线+滑动窗口（Python/Java/C++/Go）","chi-xian-hua-dong-chuang-kou-pythonjavac-b573","2023-06-25T09:37:49.532844+00:00","2747","统计没有收到请求的服务器数目","count-zero-request-servers",2240198172],"224100421":["教你一步步思考本题！（Python/Java/C++/Go/JS/Rust）","jiao-ni-yi-bu-bu-si-kao-ben-ti-by-endles-2eho","2023-08-06T01:56:34.808834+00:00","2809","使数组和小于等于 x 的最少时间","minimum-time-to-make-array-sum-at-most-x",224100421],"224630615":["双指针+平衡树/哈希表（Python/Java/C++/Go）","shuang-zhi-zhen-ping-heng-shu-ha-xi-biao-4frl","2023-07-02T04:09:57.804102+00:00","2762","不间断子数组","continuous-subarrays",224630615],"2247018180":["贪心，从最小的开始碰撞","tan-xin-cong-zui-xiao-de-kai-shi-peng-zh-h7d4","2022-01-02T04:15:31.895074+00:00","2126","摧毁小行星","destroying-asteroids",2247018180],"2248507270":["O(n) 扩展 KMP","on-kuo-zhan-kmp-by-endlesscheng-9nhs","2022-04-02T16:10:21.254007+00:00","2223","构造字符串的总得分和","sum-of-scores-of-built-strings",2248507270],"2249718139":["前后缀分解，一张图秒懂！（附动态规划）Python/Java/C++/Go","qian-hou-zhui-fen-jie-yi-zhang-tu-miao-d-dor2","2023-03-05T14:02:16.500825+00:00","1653","使字符串平衡的最少删除次数","minimum-deletions-to-make-string-balanced",2249718139],"2251945224":["计算每个前缀的最长非降子序列的长度","ji-suan-mei-ge-qian-zhui-de-zui-chang-sh-d2vd","2021-08-08T04:10:23.300722+00:00","1964","找出到每个位置为止最长的有效障碍赛跑路线","find-the-longest-valid-obstacle-course-at-each-position",2251945224],"2252317011":["两次遍历 + 前后缀分解","liang-ci-bian-li-qian-hou-zhui-by-endles-pq67","2021-12-11T16:12:30.269417+00:00","2100","适合野炊的日子","find-good-days-to-rob-the-bank",2252317011],"2258141933":["没想明白？一个动画秒懂！（Python/Java/C++/Go）","mei-xiang-ming-bai-yi-ge-dong-hua-miao-d-ocuu","2022-12-07T00:18:44.686457+00:00","1775","通过最少操作次数使数组的和相等","equal-sum-arrays-with-minimum-number-of-operations",2258141933],"2260151323":["枚举最后袋子中魔法豆的数目（Python/Java/C++/Go/JS/Rust）","pai-xu-hou-yi-ci-bian-li-by-endlesscheng-36g8","2022-02-13T04:12:40.965813+00:00","2171","拿出最少数目的魔法豆","removing-minimum-number-of-magic-beans",2260151323],"2265344721":["哈希表+滑动窗口（Python/Java/C++/Go/JS）","ha-xi-biao-shuang-zhi-zhen-pythonjavacgo-bcez","2023-07-16T04:07:00.588139+00:00","2781","最长合法子字符串的长度","length-of-the-longest-valid-substring",2265344721],"2265657217":["反转回文数左半部分","fan-zhuan-hui-wen-shu-zuo-ban-bu-fen-by-4pvs0","2022-03-27T04:08:10.226670+00:00","2217","找到指定长度的回文数","find-palindrome-with-fixed-length",2265657217],"2267593455":["下标总算错？请看这！","biao-ti-xia-biao-zong-suan-cuo-qing-kan-k81nh","2022-11-09T09:34:48.360856+00:00","209","长度最小的子数组","minimum-size-subarray-sum",2267593455],"2277934665":["回溯不会写？套路在此！（Python/Java/C++/Go）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-65lh","2023-01-20T09:25:40.252408+00:00","77","组合","combinations",2277934665],"2279246890":["【套路】前缀和+哈希表（Python/Java/C++/Go）","tao-lu-qian-zhui-he-ha-xi-biao-pythonjav-rzl0","2023-03-09T14:02:04.625831+00:00","1590","使数组和能被 P 整除","make-sum-divisible-by-p",2279246890],"2279730191":["BFS+算两次（Python/Java/C++/Go）","bfssuan-liang-ci-pythonjavacgo-by-endles-b72a","2023-04-15T16:11:07.509246+00:00","2641","二叉树的堂兄弟节点 II","cousins-in-binary-tree-ii",2279730191],"228115268":["结论证明+枚举","jie-lun-zheng-ming-mei-ju-by-endlesschen-w156","2023-07-16T04:07:36.579106+00:00","2780","合法分割的最小下标","minimum-index-of-a-valid-split",228115268],"228551495":["两种方法：枚举/贡献法（Python/Java/C++/Go）","bao-li-mei-ju-pythonjavacgo-by-endlessch-2r7p","2023-07-02T04:08:55.428259+00:00","2763","所有子数组中不平衡数字之和","sum-of-imbalance-numbers-of-all-subarrays",228551495],"2287172046":["按题意模拟","an-zhao-ti-yi-mo-ni-by-endlesscheng-41jb","2022-09-25T01:31:28.418793+00:00","LCP 62","交通枢纽","D9PW8w",2287172046],"2291083428":["如何去重？一个视频讲透！（Python/Java/C++/Go/JS）","ru-he-qu-zhong-yi-ge-shi-pin-jiang-tou-p-98g7","2022-12-03T08:46:49.364506+00:00","83","删除排序链表中的重复元素","remove-duplicates-from-sorted-list",2291083428],"2297518953":["两种方法：离线+最小堆/在线+线段树二分（Python/Java/C++/Go）","chi-xian-zui-xiao-dui-pythonjavacgo-by-e-9ewj","2023-11-19T04:57:08.729844+00:00","2940","找到 Alice 和 Bob 可以相遇的建筑","find-building-where-alice-and-bob-can-meet",2297518953],"2300589345":["一行写法","yi-xing-xie-fa-by-endlesscheng-p1gx","2021-06-19T07:49:00.526950+00:00","LCS 01","下载插件","Ju9Xwi",2300589345],"2310396":["「两数之和」的本质是什么？","liang-shu-zhi-he-de-ben-zhi-shi-shi-yao-bd0r1","2023-05-06T14:16:10.273739+00:00","1010","总持续时间可被 60 整除的歌曲","pairs-of-songs-with-total-durations-divisible-by-60",2310396],"2311001320":["统计子树的节点和及节点数","tong-ji-zi-shu-de-jie-dian-he-ji-jie-dia-va8t","2022-05-08T04:07:24.676124+00:00","2265","统计值等于子树平均值的节点数","count-nodes-equal-to-average-of-subtree",2311001320],"2315979719":["拓扑排序（Python/Java/C++/Go/JS/Rust）","tuo-bu-pai-xu-ji-lu-ru-dui-shi-jian-pyth-6uli","2023-03-26T04:13:05.567602+00:00","2603","收集树中金币","collect-coins-in-a-tree",2315979719],"2321482871":["统计空格个数 + 模拟","by-endlesscheng-pwzz","2022-05-29T00:07:33.732600+00:00","2284","最多单词数的发件人","sender-with-largest-word-count",2321482871],"2321913205":["DFS + BFS","dfs-bfs-by-endlesscheng-48cz","2022-08-21T04:31:59.718630+00:00","2385","感染二叉树需要的总时间","amount-of-time-for-binary-tree-to-be-infected",2321913205],"2323533689":["O(1) 空间写法（Python/Java/C++/Go/JS/Rust）","o1-kong-jian-xie-fa-pythonjavacgojsrust-8fesf","2023-10-26T00:10:09.132194+00:00","2520","统计能整除数字的位数","count-the-digits-that-divide-a-number",2323533689],"2329981708":["根据对称性作答","gen-ju-dui-cheng-xing-zuo-da-by-endlessc-bzv7","2022-11-27T00:31:12.183133+00:00","2481","分割圆的最少切割次数","minimum-cuts-to-divide-a-circle",2329981708],"2330317080":["统计比值的最简分数","tong-ji-bi-zhi-de-zui-jian-fen-shu-by-en-7p1b","2021-09-12T04:06:19.514471+00:00","2001","可互换矩形的组数","number-of-pairs-of-interchangeable-rectangles",2330317080],"233297408":["O(1) 公式（Python/Java/C++/Go）","o1-gong-shi-by-endlesscheng-z4xz","2023-03-05T04:08:47.662531+00:00","2582","递枕头","pass-the-pillow",233297408],"2333659184":["滑动窗口+避免分支预测（Python/Java/C++/Go）","on-hua-dong-chuang-kou-by-endlesscheng-s4fx","2022-08-20T23:24:37.148710+00:00","2379","得到 K 个黑块的最少涂色次数","minimum-recolors-to-get-k-consecutive-black-blocks",2333659184],"2335420481":["并查集（Python/Java/C++/Go）","bing-cha-ji-by-endlesscheng-tbz8","2022-09-25T04:13:58.361187+00:00","2421","好路径的数目","number-of-good-paths",2335420481],"2335538835":["前缀和优化 DP","qian-zhui-he-you-hua-dp-by-endlesscheng-k9d2","2021-05-23T05:17:13.319206+00:00","1871","跳跃游戏 VII","jump-game-vii",2335538835],"2337606731":["分类讨论（Python/Java/C++/Go）","fen-lei-tao-lun-by-endlesscheng-z71j","2022-12-18T04:06:35.918414+00:00","2508","添加边使所有节点度数都为偶数","add-edges-to-make-degrees-of-all-nodes-even",2337606731],"2347660974":["二进制枚举","er-jin-zhi-mei-ju-by-endlesscheng-ttix","2022-01-23T04:08:15.485538+00:00","2151","基于陈述统计最多好人数","maximum-good-people-based-on-statements",2347660974],"2348993490":["Go 简单模拟","go-jian-dan-mo-ni-by-endlesscheng-f8cw","2021-06-26T16:07:27.070256+00:00","1910","删除一个字符串中所有出现的给定子字符串","remove-all-occurrences-of-a-substring",2348993490],"2355594556":["没有思路？一个动画秒懂！附优化写法（Python/Java/C++/Go）","mei-you-si-lu-yi-ge-dong-hua-miao-dong-f-eezj","2023-03-13T14:58:06.991560+00:00","1605","给定行和列的和求可行矩阵","find-valid-matrix-given-row-and-column-sums",2355594556],"2357679638":["同余分组（Python/Java/C++/Go）","tong-yu-pythonjavacgo-by-endlesscheng-qoan","2023-03-19T04:06:00.316404+00:00","2598","执行操作后的最大 MEX","smallest-missing-non-negative-integer-after-operations",2357679638],"236080983":["【动画】一写就错？两种写法，总有一种适合你！（Python/Java/C++/Go）","dong-hua-yi-xie-jiu-cuo-liang-chong-xie-iijwz","2023-03-24T14:51:12.108621+00:00","1574","删除最短的子数组使剩余数组有序","shortest-subarray-to-be-removed-to-make-array-sorted",236080983],"2368071046":["O(n) 一次遍历+双单调栈（附题单）Python/Java/C++/Go/JS/Rust","by-endlesscheng-q6t5","2022-10-30T01:24:49.159678+00:00","2454","下一个更大元素 IV","next-greater-element-iv",2368071046],"236837608":["把问题看成是【扩散】元素（Python/Java/C++/Go）","ba-wen-ti-kan-cheng-shi-kuo-san-yuan-su-jddr9","2023-08-06T02:08:29.973775+00:00","2808","使循环数组所有元素相等的最少秒数","minimum-seconds-to-equalize-a-circular-array",236837608],"2369389100":["排序：正数从小到大，负数从大到小","pai-xu-zheng-shu-cong-xiao-dao-da-fu-shu-ptop","2022-02-06T04:09:58.913934+00:00","2165","重排数字的最小值","smallest-value-of-the-rearranged-number",2369389100],"2369761961":["前缀和 + 从上往下/从下往上 + 左拐/右拐（Python/Java/C++/Go）","by-endlesscheng-7z5a","2022-04-17T04:12:42.713075+00:00","2245","转角路径的乘积中最多能有几个尾随零","maximum-trailing-zeros-in-a-cornered-path",2369761961],"2370755498":["利用栈模拟（Python/Java/C++/Go）","li-yong-zhan-mo-ni-gocpythonjava-by-endl-bnbv","2022-03-06T04:07:27.000569+00:00","2197","替换数组中的非互质数","replace-non-coprime-numbers-in-array",2370755498],"2371431943":["博弈要点：构造移除序列，计算回合数","guan-jian-zai-yu-qiu-chu-hui-he-shu-by-e-mcgv","2021-10-03T04:06:12.788966+00:00","2029","石子游戏 IX","stone-game-ix",2371431943],"237326824":["枚举三条最短路的交汇点（Python/Java/C++/Go）","by-endlesscheng-2mxm","2022-03-13T04:08:55.574093+00:00","2203","得到要求路径的最小带权子图","minimum-weighted-subgraph-with-the-required-paths",237326824],"2373608335":["回溯不会写？套路在此！（Python/Java/C++/Go/JS）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-fues","2023-01-13T01:39:16.330047+00:00","131","分割回文串","palindrome-partitioning",2373608335],"237462896":["【视频】如何灵活运用递归？（Python/Java/C++/Go/JS/Rust）","ru-he-ling-huo-yun-yong-di-gui-lai-kan-s-c3wj","2022-12-10T10:20:56.580314+00:00","110","平衡二叉树","balanced-binary-tree",237462896],"2375501212":["树状数组优化 DP（Python/Java/C++/Go）","shu-zhuang-shu-zu-you-hua-dp-by-endlessc-3zf4","2023-11-05T04:17:09.024434+00:00","2926","平衡子序列的最大和","maximum-balanced-subsequence-sum",2375501212],"2375816517":["线性 DP（Python/Java/C++/Go）","d-by-endlesscheng-gybx","2022-06-26T04:24:57.942400+00:00","2320","统计放置房子的方式数","count-number-of-ways-to-place-houses",2375816517],"2383092679":["网格图 DFS 模板（Python/Java/C++/Go）","wang-ge-tu-dfs-mo-ban-pythonjavacgo-by-e-lykw","2023-04-30T00:24:35.537193+00:00","2658","网格图中鱼的最大数目","maximum-number-of-fish-in-a-grid",2383092679],"2384194086":["两种 O(1) 做法：数学公式 / 打表","o1-zuo-fa-by-endlesscheng-571j","2022-11-27T04:07:49.740066+00:00","2485","找出中枢整数","find-the-pivot-integer",2384194086],"2386809488":["两种 O(n) 做法：枚举 j / 枚举 k（Python/Java/C++/Go）","on-zuo-fa-by-endlesscheng-01x5","2023-10-01T04:19:01.587861+00:00","2873","有序三元组中的最大值 I","maximum-value-of-an-ordered-triplet-i",2386809488],"2386982504":["两种写法：哈希表（数组）/位运算（Python/Java/C++/Go）","liang-chong-xie-fa-ha-xi-biao-shu-zu-wei-7hm8","2023-04-14T14:15:29.414612+00:00","1042","不邻接植花","flower-planting-with-no-adjacent",2386982504],"2390584088":["O(n) 一次遍历","by-endlesscheng-59gn","2022-03-20T04:11:14.272078+00:00","2210","统计数组中峰和谷的数量","count-hills-and-valleys-in-an-array",2390584088],"2397274802":["暴力 / 预处理","bao-li-yu-chu-li-by-endlesscheng-kt0t","2022-10-16T01:26:09.677182+00:00","2438","二的幂数组中查询范围内的乘积","range-product-queries-of-powers",2397274802],"2398941022":["排序后切分（Python/Java/C++/Go）","pai-xu-hou-qie-fen-pythonjavacgo-by-endl-lewc","2023-12-17T04:24:02.544613+00:00","2966","划分数组并满足最大差限制","divide-array-into-arrays-with-max-difference",2398941022],"2400947874":["双指针，O(n) 时间 O(1) 空间（Python/Java/C++/Go）","shuang-zhi-zhen-on-shi-jian-o1-kong-jian-2hsz","2023-12-24T01:11:46.880456+00:00","2972","统计移除递增子数组的数目 II","count-the-number-of-incremovable-subarrays-ii",2400947874],"2405342085":["【视频】下标总算错？一个视频讲透滑动窗口！（Python/Java/C++/Go/JS/Rust）","xia-biao-zong-suan-cuo-qing-kan-zhe-by-e-iaks","2022-11-09T09:37:24.627736+00:00","3","无重复字符的最长子串","longest-substring-without-repeating-characters",2405342085],"2405658749":["【图解】从 O(n^2) 到 O(n)（Python/Java/C++/Go/JS/Rust）","tu-jie-cong-on2-dao-onpythonjavacgojsrus-aob8","2024-02-19T23:58:33.059132+00:00","105","从前序与中序遍历序列构造二叉树","construct-binary-tree-from-preorder-and-inorder-traversal",2405658749],"2407589215":["没想明白？一张图秒懂！（Python/Java/C++/Go）","mei-xiang-ming-bai-yi-zhang-tu-miao-dong-7xlx","2023-02-03T15:51:23.075297+00:00","1798","你能构造出连续值的最大数目","maximum-number-of-consecutive-values-you-can-make",2407589215],"2409750542":["两种做法，两张图秒懂！（Python/Java/C++/Go）","liang-chong-zuo-fa-liang-zhang-tu-miao-d-hysl","2023-02-13T15:16:18.701640+00:00","1124","表现良好的最长时间段","longest-well-performing-interval",2409750542],"2410692850":["模运算的性质+从左到右计算","cong-zuo-dao-you-ji-suan-by-endlesscheng-ywls","2023-02-26T04:49:11.667765+00:00","2575","找出字符串的可整除数组","find-the-divisibility-array-of-a-string",2410692850],"2412340751":["二分答案（Python 一行）","by-endlesscheng-y031","2022-04-03T04:08:04.123336+00:00","2226","每个小孩最多能分到多少糖果","maximum-candies-allocated-to-k-children",2412340751],"2422059385":["二分答案+优化（附题单！）Python/Java/C++/Go/JS","er-fen-da-an-pythonjavacgo-by-endlessche-keqf","2023-03-18T16:11:27.194893+00:00","2594","修车的最少时间","minimum-time-to-repair-cars",2422059385],"2422423692":["两遍 DFS（视频讲解）","liang-bian-dfs-by-endlesscheng-da7j","2022-11-13T00:53:49.190421+00:00","2467","树上最大得分和路径","most-profitable-path-in-a-tree",2422423692],"2425741756":["字典树：两次遍历 / DFS（Python/Java/C++/Go）","by-endlesscheng-ghfr","2022-09-18T04:11:17.970100+00:00","2416","字符串的前缀分数和","sum-of-prefix-scores-of-strings",2425741756],"2448413931":["Go 九进制 递归","go-jiu-jin-zhi-di-gui-by-endlesscheng-xdqn","2021-12-06T05:18:52.161312+00:00","660","移除 9","remove-9",2448413931],"2452001178":["库函数模拟","ku-han-shu-mo-ni-by-endlesscheng-fqad","2022-05-22T04:12:56.616990+00:00","2278","字母在字符串中的百分比","percentage-of-letter-in-string",2452001178],"2460331500":["简洁写法：统计位置 + 二分位置","tong-ji-wei-zhi-er-fen-wei-zhi-by-endles-8l9u","2021-11-21T04:07:30.629066+00:00","2080","区间内查询数字的频率","range-frequency-queries",2460331500],"2469022748":["Go 模拟","go-mo-ni-by-endlesscheng-thqf","2021-11-13T23:54:02.835719+00:00","2068","检查两个字符串是否几乎相等","check-whether-two-strings-are-almost-equivalent",2469022748],"2481240580":["预处理+记忆化搜索/递推（附题单！）Python/Java/C++/Go","yu-chu-li-ji-yi-hua-sou-suo-by-endlessch-qp47","2023-10-22T04:13:46.614424+00:00","2911","得到 K 个半回文串的最少修改次数","minimum-changes-to-make-k-semi-palindromes",2481240580],"248789391":["分类讨论","fen-lei-tao-lun-by-endlesscheng-w66r","2022-02-05T16:12:58.486792+00:00","2162","设置时间的最少代价","minimum-cost-to-set-cooking-time",248789391],"2488004222":["递归+排序","di-gui-pai-xu-by-endlesscheng-hnjf","2023-05-07T15:29:04.409321+00:00","LCP 80","生物进化录","qoQAMX",2488004222],"2491402608":["简单数学题","jian-dan-shu-xue-ti-by-endlesscheng-pojw","2023-07-09T04:10:44.923649+00:00","2769","找出最大的可达成数字","find-the-maximum-achievable-number",2491402608],"249363528":[" BFS 为什么要用队列？一个视频讲透！（Python/Java/C++/Go/JS）","bfs-wei-shi-yao-yao-yong-dui-lie-yi-ge-s-ji8i","2023-07-17T06:37:39.588177+00:00","LCR 149","彩灯装饰记录 I","cong-shang-dao-xia-da-yin-er-cha-shu-lcof",249363528],"2500271603":["哈希表套平衡树 / 懒删除堆（Python/Java/C++/Go）","by-endlesscheng-wlwa","2022-07-23T23:52:45.230520+00:00","2349","设计数字容器系统","design-a-number-container-system",2500271603],"2504097527":["懒标记法","lan-biao-ji-fa-by-endlesscheng-f07m","2022-02-06T04:08:24.556167+00:00","2166","设计位集","design-bitset",2504097527],"251006919":["两种方法：二分/差分（Python/Java/C++/Go/JS/Rust）","chai-fen-pythonjavacgo-by-endlesscheng-wz35","2022-04-24T04:11:17.812453+00:00","2251","花期内花的数目","number-of-flowers-in-full-bloom",251006919],"2510517613":["排序+枚举，O(1) 空间写法（Python/Java/C++/Go）","tan-xin-pythonjavacgo-by-endlesscheng-mke6","2023-12-24T00:09:11.695321+00:00","2971","找到最大周长的多边形","find-polygon-with-the-largest-perimeter",2510517613],"2511234285":["O(1) 容斥原理（Python/Java/C++/Go）","o1-rong-chi-yuan-li-pythonjavacgo-by-end-bko1","2023-11-12T01:23:04.611830+00:00","2927","给小朋友们分糖果 III","distribute-candies-among-children-iii",2511234285],"2513347763":["前缀和+双哈希表+枚举修改元素","qian-zhui-he-ha-xi-biao-mei-ju-xiu-gai-y-l546","2021-10-02T16:11:48.432564+00:00","2025","分割数组的最多方案数","maximum-number-of-ways-to-partition-an-array",2513347763],"2515340929":["位运算 O(1) 空间","wei-yun-suan-zuo-fa-by-endlesscheng-bwkn","2022-07-24T04:11:16.804030+00:00","2351","第一个出现两次的字母","first-letter-to-appear-twice",2515340929],"2520941920":["贪心+哈希表","by-endlesscheng-rv10","2022-05-01T04:07:07.922888+00:00","2260","必须拿起的最小连续卡牌数","minimum-consecutive-cards-to-pick-up",2520941920],"2523329139":["BFS 为什么要用队列？一个视频讲透！（Python/Java/C++/Go）","bfs-wei-shi-yao-yao-yong-dui-lie-yi-ge-s-xlv3","2023-01-07T12:33:09.451678+00:00","103","二叉树的锯齿形层序遍历","binary-tree-zigzag-level-order-traversal",2523329139],"2523374000":["Go 写法","go-xie-fa-by-endlesscheng-i16o","2021-05-15T09:26:53.125615+00:00","1804","实现 Trie （前缀树） II","implement-trie-ii-prefix-tree",2523374000],"2532708840":["两种做法：Bitset 或堆","shi-jian-sao-miao-xian-dui-by-endlessche-5tzj","2021-07-24T16:06:34.338429+00:00","1942","最小未被占据椅子的编号","the-number-of-the-smallest-unoccupied-chair",2532708840],"2534323731":["转换为 01 背包方案数","zhuan-huan-wei-01-bei-bao-fang-an-shu-by-1dax","2021-09-25T10:16:30.216097+00:00","LCP 47","入场安检","oPs9Bm",2534323731],"2546467088":["用优先队列维护另一个活动的最大价值","yong-you-xian-dui-lie-wei-hu-ling-yi-ge-8ld3x","2021-10-30T23:38:47.922639+00:00","2054","两个最好的不重叠活动","two-best-non-overlapping-events",2546467088],"2550811240":["O(n) 做法","mo-ni-by-endlesscheng-57j9","2022-03-13T04:10:44.553037+00:00","2200","找出数组中的所有 K 近邻下标","find-all-k-distant-indices-in-an-array",2550811240],"255204169":["库函数模拟","mo-ni-by-endlesscheng-0hxy","2022-04-30T16:42:41.416504+00:00","2255","统计是给定字符串前缀的字符串数目","count-prefixes-of-a-given-string",255204169],"255657392":["脑筋急转弯（Python/Java/C++/Go/JS）","nao-jin-ji-zhuan-wan-pythonjavacgo-by-en-9sqt","2022-07-10T04:10:26.362887+00:00","2337","移动片段得到字符串","move-pieces-to-obtain-a-string",255657392],"2560027362":["记忆化搜索（Python/Java/C++/Go）","ji-yi-hua-sou-suo-pythonjavacgo-by-endle-xecc","2022-07-03T04:09:43.962230+00:00","2328","网格图中递增路径的数目","number-of-increasing-paths-in-a-grid",2560027362],"2560538129":["非暴力做法（Python/Java/C++/Go）","fei-bao-li-zuo-fa-pythonjavacgo-by-endle-onrr","2024-02-18T05:16:18.211589+00:00","3042","统计前后缀下标对 I","count-prefix-and-suffix-pairs-i",2560538129],"2563069268":["O(n*3^m) 子集状压 DP + 贪心预处理（Python/Java/C++/Go）","by-endlesscheng-pk2q","2022-04-16T13:25:29.933912+00:00","LCP 53","守护太空城","EJvmW4",2563069268],"2569057399":["利用位运算简化代码","go-jian-ji-xie-fa-by-endlesscheng-w3lu","2022-06-11T22:55:35.272707+00:00","2299","强密码检验器 II","strong-password-checker-ii",2569057399],"2572867035":["哈希表","by-endlesscheng-8f6t","2022-07-17T04:14:15.144819+00:00","2341","数组能形成多少数对","maximum-number-of-pairs-in-array",2572867035],"2573075022":["分类讨论，简洁写法（Python/Java/C++/Go）","fen-lei-tao-lun-jian-ji-xie-fa-pythonjav-671l","2023-12-31T04:09:43.527676+00:00","2982","找出出现至少三次的最长特殊子字符串 II","find-longest-special-substring-that-occurs-thrice-ii",2573075022],"2573211912":["贡献法+单调栈（Python/Java/C++/Go）","gong-xian-fa-dan-diao-zhan-pythonjavacgo-23c4","2023-08-13T04:14:35.390483+00:00","2818","操作使得分最大","apply-operations-to-maximize-score",2573211912],"2578600625":["简洁写法（Python/Java/C++/Go）","by-endlesscheng-wth1","2022-09-04T00:24:55.624324+00:00","2395","和相等的子数组","find-subarrays-with-equal-sum",2578600625],"2579679937":["有技巧的枚举 + 预处理（Python/Java/C++/Go）","you-ji-qiao-de-mei-ju-yu-chu-li-pythonja-exja","2023-01-29T04:15:46.909284+00:00","2552","统计上升四元组","count-increasing-quadruplets",2579679937],"2583029056":["阅读理解（Python/Java/C++/Go）","yue-du-li-jie-pythonjavacgo-by-endlessch-pcnd","2024-02-04T04:24:02.422614+00:00","3030","找出网格的区域平均强度","find-the-grid-of-region-average",2583029056],"2595697191":["O(n) 优雅写法（Python/Java/C++/Go）","on-zuo-fa-pythonjavacgo-by-endlesscheng-fc5k","2023-12-10T04:09:57.623215+00:00","2960","统计已测试设备","count-tested-devices-after-test-operations",2595697191],"2598780139":["前后缀分解 + DP（Python/Java/C++/Go）","qian-hou-zhui-fen-jie-dp-by-endlesscheng-6u1b","2022-02-06T04:06:22.788051+00:00","2167","移除所有载有违禁货物车厢所需的最少时间","minimum-time-to-remove-all-cars-containing-illegal-goods",2598780139],"2603031099":["【视频】如何灵活运用递归？（Python/Java/C++/Go/JS/Rust）","ru-he-ling-huo-yun-yong-di-gui-lai-kan-s-6dq5","2022-12-10T10:13:55.585487+00:00","101","对称二叉树","symmetric-tree",2603031099],"260479518":["两种方法：二分答案/双指针（Python/Java/C++/Go）","er-fen-da-an-pythonjavacgo-by-endlessche-t9f5","2023-02-26T04:08:48.394478+00:00","2576","求出最多标记下标","find-the-maximum-number-of-marked-indices",260479518],"2605448197":["内向基环树：拓扑排序 + 分类讨论（Python/Java/C++/Go/JS/Rust）","nei-xiang-ji-huan-shu-tuo-bu-pai-xu-fen-c1i1b","2022-01-02T04:08:23.606909+00:00","2127","参加会议的最多员工数","maximum-employees-to-be-invited-to-a-meeting",2605448197],"2610865464":["二分查找总是写不对？一个视频讲透！（Python/Java/C++/Go/JS）","er-fen-cha-zhao-zong-shi-xie-bu-dui-yi-g-w3ol","2023-08-03T12:48:22.672899+00:00","LCR 172","统计目标成绩的出现次数","zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof",2610865464],"2612530279":["避免浮点运算的写法","bi-mian-fu-dian-yun-suan-de-xie-fa-by-en-9fc6","2021-05-23T04:22:22.549327+00:00","1870","准时到达的列车最小时速","minimum-speed-to-arrive-on-time",2612530279],"2613694816":["【视频】本题最简单写法！（Python/Java/C++/Go/JS/Rust）","fen-lei-tao-lun-luan-ru-ma-yi-ge-shi-pin-2r95","2022-12-17T08:55:33.832547+00:00","236","二叉树的最近公共祖先","lowest-common-ancestor-of-a-binary-tree",2613694816],"2613974860":["二分答案+容斥原理","er-fen-da-an-rong-chi-yuan-li-by-endless-9j34","2022-11-21T23:32:05.765729+00:00","878","第 N 个神奇数字","nth-magical-number",2613974860],"2613979956":["两种方法：枚举/滑动窗口（Python/Java/C++/Go）","mei-ju-pythonjavacgo-by-endlesscheng-5th8","2023-10-15T04:14:25.937572+00:00","2904","最短且字典序最小的美丽子字符串","shortest-and-lexicographically-smallest-beautiful-string",2613979956],"261533544":["一步步优化：从递归到递推到单调队列（Python/Java/C++/Go/JS/Rust）","yi-bu-bu-you-hua-cong-di-gui-dao-di-tui-84qn3","2024-02-05T00:11:45.681199+00:00","1696","跳跃游戏 VI","jump-game-vi",261533544],"2618637580":["DFS 时间戳——处理树上问题的有力工具（Python/Java/C++/Go）","dfs-shi-jian-chuo-chu-li-shu-shang-wen-t-x1kk","2022-06-26T04:15:46.038457+00:00","2322","从树中删除边的最小分数","minimum-score-after-removals-on-a-tree",2618637580],"2619603225":["分类讨论（Python/Java/C++/Go）","fen-lei-tao-lun-by-endlesscheng-y57m","2023-10-29T04:14:57.807547+00:00","2918","数组的最小相等和","minimum-equal-sum-of-two-arrays-after-replacing-zeros",2619603225],"2621107821":["Go 模拟","mo-ni-by-endlesscheng-jykc","2021-05-30T04:19:53.978764+00:00","1880","检查某单词是否等于两单词之和","check-if-word-equals-summation-of-two-words",2621107821],"2621480860":["排序+遍历（Python/Java/C++/Go）","by-endlesscheng-z7t8","2022-11-13T00:14:41.905517+00:00","2465","不同的平均值数目","number-of-distinct-averages",2621480860],"2626303746":["O(1) 空间做法（Python/Java/C++/Go/JS/Rust）","o1-kong-jian-zuo-fa-pythonjavacgojsrust-ztx6f","2023-10-18T01:04:41.280453+00:00","2530","执行 K 次操作后的最大分数","maximal-score-after-applying-k-operations",2626303746],"2629528696":["计算三个字符串的最长公共前缀（Python/Java/C++/Go）","ji-suan-san-ge-zi-fu-chuan-de-zui-chang-ej505","2023-11-19T05:03:18.612970+00:00","2937","使三个字符串相等","make-three-strings-equal",2629528696],"2629734466":["预处理终点到其余点的距离+二分答案（Python/Java/C++/Go）","yu-chu-li-zhong-dian-dao-qi-yu-dian-de-j-nxfs","2023-04-22T09:35:46.246829+00:00","LCP 75","传送卷轴","rdmXM7",2629734466],"2631177392":["看完这个视频，让你对递归的理解更上一层楼！（Python/Java/C++/Go）","kan-wan-zhe-ge-shi-pin-rang-ni-dui-di-gu-44uz","2022-12-07T10:06:47.292337+00:00","104","二叉树的最大深度","maximum-depth-of-binary-tree",2631177392],"2631420913":["【套路】子数组统计问题常用技巧：等价转换（Python/Java/C++/Go）","deng-jie-zhuan-huan-pythonjavacgo-by-end-5w11","2022-11-27T04:07:07.019491+00:00","2488","统计中位数为 K 的子数组","count-subarrays-with-median-k",2631420913],"2634383093":["三种算法：暴力/二分答案/堆（附题单！）","san-chong-suan-fa-bao-li-er-fen-da-an-du-k1vd","2023-05-28T00:28:22.843518+00:00","1439","有序矩阵中的第 k 个最小数组和","find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows",2634383093],"2638444930":["排序+遍历（Python/Java/C++/Go）","pai-xu-bian-li-pythonjavacgo-by-endlessc-651x","2023-05-07T15:38:02.798297+00:00","LCP 77","符文储备","W2ZX4X",2638444930],"2640785054":["排序+贪心","pai-xu-tan-xin-by-endlesscheng-wgk7","2021-09-11T09:38:40.895387+00:00","LCP 40","心算挑战","uOAnQW",2640785054],"2642386680":["没想明白？一个视频讲透快慢指针！（Python/Java/C++/Go/JS）","mei-xiang-ming-bai-yi-ge-shi-pin-jiang-t-c4sw","2022-11-30T08:49:10.530676+00:00","141","环形链表","linked-list-cycle",2642386680],"2643077516":["Go 超简洁二分写法","go-er-fen-by-endlesscheng-bga4","2021-06-22T07:57:40.986589+00:00","540","有序数组中的单一元素","single-element-in-a-sorted-array",2643077516],"2645404069":["贪心 + O(1) 空间复杂度做法（Python/Java/C++/Go）","o1-kong-jian-fu-za-du-zuo-fa-by-endlessc-ywio","2022-10-02T04:07:38.742400+00:00","2429","最小异或","minimize-xor",2645404069],"2648057035":["纯数学做法（Python/Java/C++/Go）","shu-lun-zu-he-shu-xue-zuo-fa-by-endlessc-iouh","2022-07-10T04:43:41.688619+00:00","2338","统计理想数组的数目","count-the-number-of-ideal-arrays",2648057035],"2651875294":["直接照搬 1004 的代码","zhi-jie-zhao-ban-1004-de-dai-ma-by-endle-42x3","2021-10-02T16:44:12.937346+00:00","2024","考试的最大困扰度","maximize-the-confusion-of-an-exam",2651875294],"265213405":["两种做法：并查集 / 单调栈（Python/Java/C++/Go）","by-endlesscheng-j6pp","2022-07-10T00:14:40.957687+00:00","2334","元素值大于变化阈值的子数组","subarray-with-elements-greater-than-varying-threshold",265213405],"2654590324":["O(n) 做法","on-zuo-fa-by-endlesscheng-wubs","2024-02-04T04:24:17.144460+00:00","3029","将单词恢复初始状态所需的最短时间 I","minimum-time-to-revert-word-to-initial-state-i",2654590324],"2657502607":["贪心+简洁写法（Python/Java/C++/Go）","tan-xin-jian-ji-xie-fa-pythonjavacgo-by-ziiin","2023-10-01T01:42:51.258391+00:00","2870","使数组为空的最少操作次数","minimum-number-of-operations-to-make-array-empty",2657502607],"2658427199":["又写死循环了？一个视频讲透二分！（Python/Java/C++/Go）","by-endlesscheng-auuh","2022-11-23T10:16:30.889618+00:00","33","搜索旋转排序数组","search-in-rotated-sorted-array",2658427199],"2661403855":["枚举中间字符，然后根据前后缀和判断","mei-ju-zhong-jian-zi-fu-ran-hou-gen-ju-q-186d","2021-07-11T04:08:57.775107+00:00","1930","长度为 3 的不同回文子序列","unique-length-3-palindromic-subsequences",2661403855],"2664015237":["预处理质数+枚举+特判奇数（Python/Java/C++/Go）","yu-chu-li-zhi-shu-mei-ju-by-endlesscheng-cq9b","2023-07-02T04:13:56.487663+00:00","2761","和等于目标值的质数对","prime-pairs-with-target-sum",2664015237],"266469116":["Go 单调队列","go-dan-diao-zhan-by-endlesscheng-4yqf","2021-10-03T04:34:56.545916+00:00","2030","含特定字母的最小子序列","smallest-k-length-subsequence-with-occurrences-of-a-letter",266469116],"2668311333":["双指针 两种写法（Python/Java/C++/Go）","shuang-zhi-zhen-by-endlesscheng-lkd9","2023-01-15T04:08:25.551059+00:00","2537","统计好子数组的数目","count-the-number-of-good-subarrays",2668311333],"2670146102":["贪心还能反悔？（Python/Java/C++/Go/JS）","tan-xin-huan-neng-fan-hui-pythonjavacgoj-lcwp","2023-09-11T01:12:08.058758+00:00","630","课程表 III","course-schedule-iii",2670146102],"267105112":["本题最简单写法（Python/Java/C++/Go）","ben-ti-zui-jian-dan-xie-fa-pythonjavacgo-kcc6","2024-02-18T00:11:09.457534+00:00","3041","修改数组后最大化数组中的连续元素数目","maximize-consecutive-elements-in-an-array-after-modification",267105112],"2671757819":["0-1 背包模板题","0-1-bei-bao-mo-ban-ti-by-endlesscheng-ap09","2023-07-23T00:09:53.752062+00:00","2787","将一个数字表示成幂的和的方案数","ways-to-express-an-integer-as-sum-of-powers",2671757819],"2672352527":["LCA 模板（Python/Java/C++/Go）","lca-mo-ban-by-endlesscheng-j54b","2023-09-03T04:11:42.406781+00:00","2846","边权重均等查询","minimum-edge-weight-equilibrium-queries-in-a-tree",2672352527],"267246445":["DP + 单调栈二分优化（Python/Java/C++/Go）","dan-diao-zhan-you-hua-dp-by-endlesscheng-mc50","2023-04-09T04:16:26.792556+00:00","2617","网格图中最少访问的格子数","minimum-number-of-visited-cells-in-a-grid",267246445],"267587420":["模拟 + 位运算","mo-ni-wei-yun-suan-by-endlesscheng-7zfi","2022-02-20T05:52:57.493367+00:00","2180","统计各位数字之和为偶数的整数个数","count-integers-with-even-digit-sum",267587420],"268097121":["两种非暴力做法：LIS/状态机DP（Python/Java/C++/Go）","liang-chong-fei-bao-li-zuo-fa-liszhuang-38zac","2023-08-20T04:38:54.882009+00:00","2826","将三个组排序","sorting-three-groups",268097121],"2681170798":["枚举（Python/Java/C++/Go/JS）","mei-ju-by-endlesscheng-oo2d","2023-09-03T04:21:37.025767+00:00","2843","统计对称整数的数目","count-symmetric-integers",2681170798],"268471907":["两种方法：排序/最小堆（Python/Java/C++/Go）","liang-chong-fang-fa-pai-xu-zui-xiao-dui-bzedc","2023-11-11T23:31:39.443733+00:00","2931","购买物品的最大开销","maximum-spending-after-buying-items",268471907],"2688612867":["Go 模拟","go-mo-ni-by-endlesscheng-cg8e","2021-08-22T04:11:41.605708+00:00","1979","找出数组的最大公约数","find-greatest-common-divisor-of-array",2688612867],"269219514":["模拟+简洁写法（Python/Java/C++/Go）","mo-ni-jian-ji-xie-fa-pythonjavacgo-by-en-welu","2023-04-23T12:24:32.288030+00:00","LCP 72","补给马车","hqCnmP",269219514],"2692580018":["前后缀分解+单调栈（附题单！）Python/Java/C++/Go","qian-hou-zhui-fen-jie-dan-diao-zhan-pyth-1exe","2023-09-24T04:13:21.585236+00:00","2866","美丽塔 II","beautiful-towers-ii",2692580018],"2694109670":["O(n) 做法（Python/Java/C++/Go）","on-zuo-fa-pythonjavacgo-by-endlesscheng-nkuy","2024-01-07T01:39:49.294300+00:00","2996","大于等于顺序前缀和的最小缺失整数","smallest-missing-integer-greater-than-sequential-prefix-sum",2694109670],"2694237057":["Go 模拟","mo-ni-by-endlesscheng-euwh","2021-07-24T16:06:59.017051+00:00","1941","检查是否所有字符出现次数相同","check-if-all-characters-have-equal-number-of-occurrences",2694237057],"2695383302":["跟着我过一遍示例 2，你就明白怎么做了（Python/Java/C++/Go/JS）","gen-zhao-wo-guo-yi-bian-shi-li-2ni-jiu-m-2jqm","2023-08-10T03:33:47.044879+00:00","1081","不同字符的最小子序列","smallest-subsequence-of-distinct-characters",2695383302],"2697040026":["语法题","yu-fa-ti-by-endlesscheng-lako","2023-01-22T04:07:59.438785+00:00","2545","根据第 K 场考试的分数排序","sort-the-students-by-their-kth-score",2697040026],"2697534725":["组合计数（视频讲解）","zu-he-ji-shu-by-endlesscheng-leem","2022-12-25T01:20:23.176754+00:00","2514","统计同位异构字符串数目","count-anagrams",2697534725],"2701115423":["平衡树+双指针（Python/Java/C++/Go）","ping-heng-shu-shuang-zhi-zhen-pythonjava-50eh","2023-08-13T04:44:51.236767+00:00","2817","限制条件下元素之间的最小绝对差","minimum-absolute-difference-between-elements-with-constraint",2701115423],"2711761019":["不会字典树？只用哈希表也能做！（Python/Java/C++/Go）","bu-hui-zi-dian-shu-zhi-yong-ha-xi-biao-y-p2pu","2023-01-05T00:08:21.631826+00:00","1803","统计异或值在范围内的数对有多少","count-pairs-with-xor-in-a-range",2711761019],"271335539":["两种思路：动态规划/单调栈（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-68nx","2023-05-16T00:50:27.983950+00:00","1335","工作计划的最低难度","minimum-difficulty-of-a-job-schedule",271335539],"2715109000":["两种做法：暴力 / 利用 LCM 的性质","by-endlesscheng-3qnt","2022-11-13T04:08:07.585846+00:00","2470","最小公倍数为 K 的子数组数目","number-of-subarrays-with-lcm-equal-to-k",2715109000],"2716169684":["Go 一行","go-yi-xing-by-endlesscheng-1vf3","2021-07-29T06:06:50.814509+00:00","10","正则表达式匹配","regular-expression-matching",2716169684],"2716747123":["还在 if-else？一个循环处理六种移动！（Python/Java/C++/Go）","huan-zai-if-elseyi-ge-xun-huan-chu-li-li-tw8b","2023-02-04T15:31:01.581219+00:00","1210","穿过迷宫的最少移动次数","minimum-moves-to-reach-target-with-rotations",2716747123],"2719065978":["贪心 + 一次遍历（Python/Java/C++/Go）","by-endlesscheng-lvym","2022-09-17T23:45:08.758644+00:00","2412","完成所有交易的初始最少钱数","minimum-money-required-before-transactions",2719065978],"2719330296":["贪心：排序后枚举后缀，再求其余花园最小值的最大值（Python/Java/C++/Go）","by-endlesscheng-10i7","2022-04-10T04:13:17.056717+00:00","2234","花园的最大总美丽值","maximum-total-beauty-of-the-gardens",2719330296],"2719928959":["转换+一次遍历","zhuan-huan-yi-ci-bian-li-by-endlesscheng-hc0y","2023-01-22T07:53:29.374105+00:00","2541","使数组中所有元素相等的最小操作数 II","minimum-operations-to-make-array-equal-ii",2719928959],"2720318685":["多重背包方案数：从朴素 DP 到优化（Python/Java/C++/Go）","duo-zhong-bei-bao-fang-an-shu-cong-po-su-f5ay","2023-10-15T01:37:44.768621+00:00","2902","和带限制的子多重集合的数目","count-of-sub-multisets-with-bounded-sum",2720318685],"2724880133":["二分查找总是写不对？三种写法，一个视频讲透！（Python/Java/C++/Go/JS）","er-fen-cha-zhao-zong-shi-xie-bu-dui-yi-g-t9l9","2022-11-19T08:41:41.595499+00:00","34","在排序数组中查找元素的第一个和最后一个位置","find-first-and-last-position-of-element-in-sorted-array",2724880133],"2730930360":["两个最小堆模拟 + 视频讲解","liang-ge-zui-xiao-dui-mo-ni-by-endlessch-nagm","2022-11-06T04:06:26.079599+00:00","2462","雇佣 K 位工人的总代价","total-cost-to-hire-k-workers",2730930360],"2732657659":["中序遍历+二分查找（Python/Java/C++/Go/JS/Rust）","zhong-xu-bian-li-er-fen-cha-zhao-pythonj-4ic0","2024-02-24T00:45:55.860358+00:00","2476","二叉搜索树最近节点查询","closest-nodes-queries-in-a-binary-search-tree",2732657659],"2734248382":["【图解】没有思路？进来秒懂！（Python/Java/C++/Go/JS）","tu-jie-mei-you-si-lu-jin-lai-miao-dong-p-vrni","2023-07-14T00:23:31.228151+00:00","979","在二叉树中分配硬币","distribute-coins-in-binary-tree",2734248382],"2745040429":["预处理+递归（Python/Java/C++/Go/JS/Rust）","yu-chu-li-hui-su-by-endlesscheng-ro3s","2023-05-21T04:07:12.443291+00:00","2698","求一个整数的惩罚数","find-the-punishment-number-of-an-integer",2745040429],"2754546565":["模拟","mo-ni-by-endlesscheng-jn5x","2021-05-29T16:09:05.375974+00:00","1876","长度为三且各字符不同的子字符串","substrings-of-size-three-with-distinct-characters",2754546565],"275986604":["BFS + 统计每个点变为空闲状态的最早秒数","bfs-tong-ji-mei-ge-dian-bian-wei-kong-xi-mnm7","2021-10-16T16:07:45.252631+00:00","2039","网络空闲的时刻","the-time-when-the-network-becomes-idle",275986604],"2762853048":["贡献法+单调栈+三种实现版本（附题单）Python/Java/C++/Go","gong-xian-fa-dan-diao-zhan-san-chong-shi-gxa5","2022-10-27T23:37:33.731503+00:00","907","子数组的最小值之和","sum-of-subarray-minimums",2762853048],"2771270445":["模拟 + 分组循环","mo-ni-by-endlesscheng-voye","2022-04-30T16:43:22.032876+00:00","2257","统计网格图中没有被保卫的格子数","count-unguarded-cells-in-the-grid",2771270445],"2772831251":["间隔跳跃+简单证明","tan-xin-by-endlesscheng-wj2k","2022-12-11T01:27:42.184798+00:00","2498","青蛙过河 II","frog-jump-ii",2772831251],"2774491833":["贪心（Python/Java/C++/Go）","tan-xin-pythonjavacgo-by-endlesscheng-2ub2","2023-12-10T01:13:10.593425+00:00","2957","消除相邻近似相等字符","remove-adjacent-almost-equal-characters",2774491833],"2775344327":["非暴力做法：前缀和 + 二分查找 + 原地 O(1) 空间（Python/Java/C++/Go）","fei-bao-li-zuo-fa-qian-zhui-he-er-fen-by-ny4m","2022-08-28T04:08:53.932275+00:00","2389","和有限的最长子序列","longest-subsequence-with-limited-sum",2775344327],"2776150092":["回溯三问：思考回溯问题的通用方法（Python/Java/C++/Go）","hui-su-san-wen-si-kao-hui-su-wen-ti-de-t-kw3y","2023-02-25T14:48:04.919991+00:00","1255","得分最高的单词集合","maximum-score-words-formed-by-letters",2776150092],"2777743854":["预处理 + 暴力枚举","by-endlesscheng-jocl","2022-06-11T23:16:36.568010+00:00","2301","替换字符后匹配","match-substring-after-replacement",2777743854],"2783546107":["回溯不会写？套路在此！（Python/Java/C++/Go/JS）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-kfk3","2023-08-02T02:23:55.828692+00:00","面试题 08.09","括号","bracket-lcci",2783546107],"2786999216":["哈希表 + 贪心（Python 两行）","ha-xi-biao-tan-xin-by-endlesscheng-tgtf","2022-04-17T04:13:31.102534+00:00","2244","完成所有任务需要的最少轮数","minimum-rounds-to-complete-all-tasks",2786999216],"2791285030":["【视频】如何思考树形 DP？（Python/Java/C++/Go/JS）","shi-pin-ru-he-si-kao-shu-xing-dppythonja-a7t1","2023-05-24T08:12:55.838438+00:00","337","打家劫舍 III","house-robber-iii",2791285030],"2792663761":["【模板】网格图 DFS（附题单！）","mo-ban-wang-ge-tu-dfsfu-ti-dan-by-endles-p0n1","2023-06-22T00:18:34.022568+00:00","面试题 16.19","水域大小","pond-sizes-lcci",2792663761],"2795952868":["统计连续相同颜色的长度","tong-ji-lian-xu-xiang-tong-yan-se-de-cha-zynp","2021-10-16T16:09:26.627802+00:00","2038","如果相邻两个颜色均相同则删除当前颜色","remove-colored-pieces-if-both-neighbors-are-the-same-color",2795952868],"2796999710":["【图解】迭代/递归，一张图秒懂！（Python/Java/C++/Go/JS）","tu-jie-die-dai-di-gui-yi-zhang-tu-miao-d-51ap","2023-08-06T00:41:06.723826+00:00","24","两两交换链表中的节点","swap-nodes-in-pairs",2796999710],"2799632565":["[更新高精度算法] 拆分成四个问题：计算对数 + 对 1e5 取模 + 计算尾零个数 + 判断剩余数字的长度","chai-fen-cheng-si-ge-wen-ti-ji-suan-dui-6karq","2021-12-25T16:14:30.356946+00:00","2117","一个区间内所有数乘积的缩写","abbreviating-the-product-of-a-range",2799632565],"2800289700":["两种方法：正向思维 / 逆向思维（Python/Java/C++/Go）","gou-zao-tan-xin-pythonjavacgo-by-endless-ib49","2024-02-11T04:09:06.519666+00:00","3035","回文字符串的最大数量","maximum-palindromes-after-operations",2800289700],"280396343":["简化代码的小技巧","jian-hua-dai-ma-de-xiao-ji-qiao-by-endle-i81p","2022-07-03T04:10:44.595269+00:00","2325","解密消息","decode-the-message",280396343],"2805340615":["没想明白？一个视频讲透！（Python/Java/C++/Go/JS）","mei-xiang-ming-bai-yi-ge-shi-pin-jiang-t-u66q","2022-11-30T08:55:29.066681+00:00","143","重排链表","reorder-list",2805340615],"2811209697":["两种做法：字符串 / 数学","mo-ni-by-endlesscheng-burh","2022-05-15T11:47:04.327627+00:00","2269","找到一个数字的 K 美丽值","find-the-k-beauty-of-a-number",2811209697],"2817202669":["教你一次性把代码写对！O(n) 分组循环（Python/Java/C++/Go/JS/Rust）","jiao-ni-yi-ci-xing-ba-dai-ma-xie-dui-on-zuspx","2023-11-16T00:09:36.223810+00:00","2760","最长奇偶子数组","longest-even-odd-subarray-with-threshold",2817202669],"2818493377":["简洁写法","jian-ji-xie-fa-by-endlesscheng-thul","2023-07-09T01:11:42.996823+00:00","2766","重新放置石块","relocate-marbles",2818493377],"2819110526":["二分答案","er-fen-da-an-by-endlesscheng-aape","2021-11-07T04:06:41.188334+00:00","2064","分配给商店的最多商品的最小值","minimized-maximum-of-products-distributed-to-any-store",2819110526],"2827089777":["枚举","mei-ju-by-endlesscheng-qc44","2023-07-30T05:03:06.317614+00:00","2800","包含三个字符串的最短字符串","shortest-string-that-contains-three-strings",2827089777],"282802217":["两种双指针写法","tan-xin-pi-pei-by-endlesscheng-d6eq","2022-11-27T04:09:05.651614+00:00","2486","追加字符以获得子序列","append-characters-to-string-to-make-subsequence",282802217],"2833491097":["贪心 + 模拟","by-endlesscheng-bxks","2022-08-28T04:08:06.706604+00:00","2391","收集垃圾的最少总时间","minimum-amount-of-time-to-collect-garbage",2833491097],"2835500769":["贪心（Python/Java/C++/Go）","tan-xin-pythonjavacgo-by-endlesscheng-8fzf","2023-10-08T04:16:03.481673+00:00","2895","最小处理时间","minimum-processing-time",2835500769],"2836390896":["O(1) 空间位运算写法（Python/Java/C++/Go）","o1-kong-jian-wei-yun-suan-xie-fa-pythonj-7t4p","2023-06-04T04:29:56.683844+00:00","2716","最小化字符串长度","minimize-string-length",2836390896],"28373825":["转化成分组背包（Python/Java/C++/Go）","zhuan-hua-cheng-fen-zu-bei-bao-pythongoc-3xnk","2022-03-27T04:07:38.017956+00:00","2218","从栈中取出 K 个硬币的最大面值和","maximum-value-of-k-coins-from-piles",28373825],"2844316244":["O(n) 一次遍历","on-yi-ci-bian-li-by-endlesscheng-gw3w","2023-05-28T11:07:50.302869+00:00","2706","购买两块巧克力","buy-two-chocolates",2844316244],"284708083":["状态压缩 DP（附最小费用最大流做法）","zhuang-tai-ya-suo-dp-by-endlesscheng-5eqn","2022-02-13T04:09:16.096285+00:00","2172","数组的最大与和","maximum-and-sum-of-array",284708083],"2850260537":["两种方法：自顶向下/自底向上（Python/Java/C++/Go）","liang-chong-fang-fa-zi-ding-xiang-xia-zi-wj9v","2023-04-17T14:12:07.670967+00:00","1026","节点与其祖先之间的最大差值","maximum-difference-between-node-and-ancestor",2850260537],"2851269000":["【模板】换根 DP（Python/Java/C++/Go/JS）","mo-ban-huan-gen-dppythonjavacgojs-by-end-8qiu","2023-09-17T01:28:01.628707+00:00","2858","可以到达每一个节点的最少边反转次数","minimum-edge-reversals-so-every-node-is-reachable",2851269000],"2855675520":["贪心","tan-xin-by-endlesscheng-y0tw","2022-07-10T04:11:17.171694+00:00","2335","装满杯子需要的最短总时长","minimum-amount-of-time-to-fill-cups",2855675520],"2860632733":["【视频】教你一步步思考动态规划！股票问题通用解法！（Python/Java/C++/Go/JS/Rust）","shi-pin-jiao-ni-yi-bu-bu-si-kao-dong-tai-0k0l","2023-03-31T10:43:32.994656+00:00","309","买卖股票的最佳时机含冷冻期","best-time-to-buy-and-sell-stock-with-cooldown",2860632733],"286069565":["线性做法（Python/Java/C++/Go/JS）","xian-xing-zuo-fa-pythonjavacgojs-by-endl-uofo","2023-08-14T23:52:23.141282+00:00","833","字符串中的查找与替换","find-and-replace-in-string",286069565],"2860849459":["Floyd 算法（Python/Java/C++/Go）","floyd-suan-fa-by-endlesscheng-ug8s","2023-12-24T04:17:53.824053+00:00","2976","转换字符串的最小成本 I","minimum-cost-to-convert-string-i",2860849459],"2862855056":["值域前缀和+枚举分母和商","zhi-yu-qian-zhui-he-mei-ju-fen-mu-he-sha-2143","2021-05-15T16:25:21.768643+00:00","1862","向下取整数对和","sum-of-floored-pairs",2862855056],"286585708":["等价转换 + 树状数组（Java/Python/C++/Go）","deng-jie-zhuan-huan-shu-zhuang-shu-zu-by-xmyd","2022-02-19T16:08:50.138290+00:00","2179","统计数组中好三元组数目","count-good-triplets-in-an-array",286585708],"286718649":["【图解】一次遍历+简洁写法（Python/Java/C++/Go）","tu-jie-yi-ci-bian-li-jian-ji-xie-fa-pyth-n75l","2022-11-23T23:27:43.628215+00:00","795","区间子数组个数","number-of-subarrays-with-bounded-maximum",286718649],"2875235685":["模拟（Python/Java/C++/Go）","mo-ni-pythonjavacgo-by-endlesscheng-mexz","2023-12-17T09:11:40.160177+00:00","2965","找出缺失和重复的数字","find-missing-and-repeated-values",2875235685],"2882449995":["BFS 为什么要用队列？一个视频讲透！（Python/Java/C++/Go）","bfs-wei-shi-yao-yao-yong-dui-lie-yi-ge-s-f34y","2023-01-07T11:57:08.610784+00:00","513","找树左下角的值","find-bottom-left-tree-value",2882449995],"288305998":["贪心，扫描一遍寻找插入位置","tan-xin-sao-miao-yi-bian-xun-zhao-cha-ru-yxj8","2021-05-30T04:17:31.950434+00:00","1881","插入后的最大值","maximum-value-after-insertion",288305998],"2887178574":["排序二分+暴力枚举","er-fen-bao-li-mei-ju-by-endlesscheng-vezb","2021-09-11T09:40:25.214882+00:00","LCP 42","玩具套圈","vFjcfV",2887178574],"2887492330":["贪心 + 一次遍历","by-endlesscheng-yfyf","2022-03-20T01:00:17.849394+00:00","2207","字符串中最多数目的子序列","maximize-number-of-subsequences-in-a-string",2887492330],"2887872471":["树形 DP：转换成树上最大路径和（Python/Java/C++/Go）","by-endlesscheng-5l70","2023-01-15T04:13:25.274494+00:00","2538","最大价值和与最小价值和的差值","difference-between-maximum-and-minimum-price-sum",2887872471],"2887915717":["排序优化 + 枚举所有点","mei-ju-suo-you-dian-by-endlesscheng-u049","2022-04-24T04:18:57.903196+00:00","2249","统计圆内格点数目","count-lattice-points-inside-a-circle",2887915717],"288912613":["Go 模拟","go-mo-ni-by-endlesscheng-kjpt","2021-10-31T01:49:07.872527+00:00","2056","棋盘上有效移动组合的数目","number-of-valid-move-combinations-on-chessboard",288912613],"2889905668":["贪心 + 视频讲解","tan-xin-by-endlesscheng-f7e4","2022-10-30T04:08:03.935705+00:00","2457","美丽整数的最小增量","minimum-addition-to-make-integer-beautiful",2889905668],"289054660":["Go 模拟","go-mo-ni-by-endlesscheng-t3a5","2021-10-02T16:07:55.401818+00:00","2022","将一维数组转变成二维数组","convert-1d-array-into-2d-array",289054660],"2890702645":["双指针","s-by-endlesscheng-m0pg","2022-10-07T23:59:48.164669+00:00","LCP 68","美观的花束","1GxJYY",2890702645],"290394387":["划分成三组然后合并","go-mo-ni-by-endlesscheng-axo2","2022-02-05T16:18:48.843166+00:00","2161","根据给定数字划分数组","partition-array-according-to-given-pivot",290394387],"2907477166":["一次遍历","yi-ci-bian-li-by-endlesscheng-bun4","2022-10-16T04:07:08.037532+00:00","2442","反转之后不同整数的数目","count-number-of-distinct-integers-after-reverse-operations",2907477166],"2913358439":["双指针（附一行写法）","by-endlesscheng-f6bd","2023-01-22T07:52:19.443118+00:00","2540","最小公共值","minimum-common-value",2913358439],"2914198967":["贪心 O(n) 做法（Python/Java/C++/Go）","by-endlesscheng-8ee3","2022-08-14T04:08:40.034712+00:00","2375","根据模式串构造最小数字","construct-smallest-number-from-di-string",2914198967],"2919642920":["后序遍历（Python/Java/C++/Go）","hou-xu-bian-li-pythonjavacgo-by-endlessc-gll3","2023-05-20T00:58:16.214162+00:00","1373","二叉搜索子树的最大键值和","maximum-sum-bst-in-binary-tree",2919642920],"2921275572":["字典树+括号表示法+哈希表","zi-dian-shu-ha-xi-biao-by-endlesscheng-115r","2021-07-25T04:06:01.535191+00:00","1948","删除系统中的重复文件夹","delete-duplicate-folders-in-system",2921275572],"2921363389":["教你一步步思考动态规划：从记忆化搜索到递推（Python/Java/C++/Go/JS/Rust）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-k15a","2023-12-08T00:25:16.927014+00:00","2008","出租车的最大盈利","maximum-earnings-from-taxi",2921363389],"2923349215":["用哈希表统计差异","jian-ji-xie-fa-yong-ha-xi-biao-tong-ji-c-7qzn","2021-09-11T09:37:46.079191+00:00","LCP 39","无人机方阵","0jQkd0",2923349215],"292566381":["BFS 为什么要用队列？一个视频讲透！（Python/Java/C++/Go）","bfs-wei-shi-yao-yao-yong-dui-lie-yi-ge-s-bgzr","2023-06-02T09:37:00.798989+00:00","LCR 150","彩灯装饰记录 II","cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof",292566381],"2937149161":["O(n) 一次遍历（Python/Java/C++/Go）","on-yi-ci-bian-li-pythonjavacgo-by-endles-0jye","2024-01-14T04:38:31.012947+00:00","3005","最大频率元素计数","count-elements-with-maximum-frequency",2937149161],"2937224937":["简洁写法！（Python/Java/C++/Go）","xian-qu-mo-zai-mo-ni-by-endlesscheng-iabk","2023-11-26T04:20:05.509828+00:00","2946","循环移位后的矩阵相似检查","matrix-similarity-after-cyclic-shifts",2937224937],"2939895760":["离线+字典树","chi-xian-zi-dian-shu-by-endlesscheng-ojnw","2021-07-18T04:07:49.781082+00:00","1938","查询最大基因差","maximum-genetic-difference-query",2939895760],"2942833315":["建图技巧 + 并查集（Python/Java/C++/Go）","jiantu-by-endlesscheng-rkra","2022-10-08T02:20:53.297595+00:00","LCP 71","集水器","kskhHQ",2942833315],"2945726008":["两种做法：堆 / 二分+搜索（Python/Java/C++/Go）","zhuan-huan-dui-by-endlesscheng-8yiq","2022-08-21T04:13:02.509397+00:00","2386","找出数组的第 K 大和","find-the-k-sum-of-an-array",2945726008],"2946534771":["简洁写法：不出现 ba 即可","jian-ji-xie-fa-bu-chu-xian-ba-ji-ke-by-e-0ka0","2022-01-02T04:13:08.704508+00:00","2124","检查是否所有 A 都在 B 之前","check-if-all-as-appears-before-all-bs",2946534771],"2948030094":["一行写法","yi-xing-xie-fa-by-endlesscheng-yfe2","2023-08-06T00:51:30.999749+00:00","2806","取整购买后的账户余额","account-balance-after-rounded-purchase",2948030094],"2956439807":["【图解】转换成单源最短路问题（Python/Java/C++/Go）","tu-jie-zhuan-huan-cheng-dan-yuan-zui-dua-6l8o","2022-11-25T23:54:14.254388+00:00","882","细分图中的可到达节点","reachable-nodes-in-subdivided-graph",2956439807],"296151509":["【图解】从一维差分到二维差分（Python/Java/C++/Go/JS/Rust）","wu-nao-zuo-fa-er-wei-qian-zhui-he-er-wei-zwiu","2022-01-08T16:14:50.649687+00:00","2132","用邮票贴满网格图","stamping-the-grid",296151509],"2963413938":["子集状压 DP：从记忆化搜索到递推（附题单！）","zi-ji-zhuang-ya-dpcong-ji-yi-hua-sou-suo-oxwd","2023-06-16T01:45:44.090279+00:00","1494","并行课程 II","parallel-courses-ii",2963413938],"2965139328":["栈+简洁写法（Python/Java/C++/Go）","zhan-jian-ji-xie-fa-pythonjavacgo-by-end-i9o7","2023-05-02T14:20:36.756094+00:00","1003","检查替换后的词是否有效","check-if-word-is-valid-after-substitutions",2965139328],"296740468":["滑动窗口，一个视频讲透！（Python/Java/C++/Go）","hua-dong-chuang-kou-yi-ge-shi-pin-jiang-yowmi","2023-02-22T06:57:16.432110+00:00","1004","最大连续1的个数 III","max-consecutive-ones-iii",296740468],"2967621636":["前缀最小和 + 后缀最大和 + 堆","qian-zhui-zui-xiao-he-hou-zhui-zui-da-he-yz3d","2022-02-05T16:12:30.306809+00:00","2163","删除元素后和的最小差值","minimum-difference-in-sums-after-removal-of-elements",2967621636],"2975776867":["库函数写法（Python/Java/C++/Go）","ku-han-shu-xie-fa-pythonjavacgo-by-endle-fjmr","2023-05-28T10:54:13.807126+00:00","2710","移除字符串中的尾随零","remove-trailing-zeros-from-a-string",2975776867],"2977235574":["构造 + 贪心 + 分类讨论","gou-zao-tan-xin-fen-lei-tao-lun-by-endle-dqr8","2022-01-08T16:14:06.048446+00:00","2131","连接两字母单词得到的最长回文串","longest-palindrome-by-concatenating-two-letter-words",2977235574],"2981004463":["击败100%！枚举GCD+循环优化（Python/Java/C++/Go）","ji-bai-100mei-ju-gcdxun-huan-you-hua-pyt-get7","2023-01-14T00:25:45.284543+00:00","1819","序列中不同最大公约数的数目","number-of-different-subsequences-gcds",2981004463],"2982198446":["快慢指针","kuai-man-zhi-zhen-by-endlesscheng-jodm","2021-12-05T04:06:42.040368+00:00","2095","删除链表的中间节点","delete-the-middle-node-of-a-linked-list",2982198446],"3008885805":["【图解】一张图秒懂！转换成 136！（Python/Java/C++/Go/JS/Rust）","tu-jie-yi-zhang-tu-miao-dong-zhuan-huan-np9d2","2023-10-15T23:57:44.801820+00:00","260","只出现一次的数字 III","single-number-iii",3008885805],"3010901510":["一步步优化：从数组到位运算（Python/Java/C++/Go/JS/Rust）","yi-bu-bu-you-hua-cong-shu-zu-dao-wei-yun-hu0b","2023-11-25T00:26:33.846362+00:00","1457","二叉树中的伪回文路径","pseudo-palindromic-paths-in-a-binary-tree",3010901510],"3012401904":["O(1) 数学公式（Python/Java/C++/Go）","o1-shu-xue-gong-shi-pythonjavacgo-by-end-v2bt","2024-01-21T05:25:52.980117+00:00","3014","输入单词需要的最少按键次数 I","minimum-number-of-pushes-to-type-word-i",3012401904],"3014957498":["Go 贪心","go-tan-xin-by-endlesscheng-wz53","2021-08-21T16:12:03.084663+00:00","1974","使用特殊打字机键入单词的最少时间","minimum-time-to-type-word-using-special-typewriter",3014957498],"3015354306":["击败 100%！从双指针到终极优化，十万个查询都不怕！（Python/Java/C++/Go/JS）","ji-bai-100cong-shuang-zhi-zhen-dao-zhong-yhze","2023-08-22T23:53:41.406502+00:00","1782","统计点对的数目","count-pairs-of-nodes",3015354306],"301567212":["转换问题+最小堆","zhuan-huan-wen-ti-zui-xiao-dui-by-endles-9t8t","2023-01-22T07:54:35.174107+00:00","2542","最大子序列的分数","maximum-subsequence-score",301567212],"301734990":["田忌赛马（Python/Java/C++/Go）","tian-ji-sai-ma-by-endlesscheng-yxm6","2022-10-07T23:40:03.670706+00:00","870","优势洗牌","advantage-shuffle",301734990],"3020603346":["单源最短路 + 拓扑序 DP","dan-yuan-zui-duan-lu-tuo-bu-xu-dp-by-end-i3ml","2021-08-21T16:08:51.990880+00:00","1976","到达目的地的方案数","number-of-ways-to-arrive-at-destination",3020603346],"3023056451":["数学 O(1) 解","shu-xue-o1-jie-by-endlesscheng-hucn","2023-01-29T04:08:39.469188+00:00","2549","统计桌面上的不同数字","count-distinct-numbers-on-board",3023056451],"3023386017":["数位 DP 通用模板 + 详细注释 + 题单（Python/Java/C++/Go）","shu-wei-dp-tong-yong-mo-ban-xiang-xi-zhu-e5dg","2022-10-17T23:46:36.650136+00:00","902","最大为 N 的数字组合","numbers-at-most-n-given-digit-set",3023386017],"3024031273":["两种方法：BFS/记忆化搜索（Python/Java/C++/Go）","liang-chong-fang-fa-bfsji-yi-hua-sou-suo-djba","2024-01-07T01:07:02.820496+00:00","2998","使 X 和 Y 相等的最少操作次数","minimum-number-of-operations-to-make-x-and-y-equal",3024031273],"3029042062":["简洁写法 + 一次遍历","jian-ji-xie-fa-yi-ci-bian-li-by-endlessc-za1f","2022-01-23T04:08:41.811502+00:00","2149","按符号重排数组","rearrange-array-elements-by-sign",3029042062],"3033778664":["Go 三行解决","go-san-xing-jie-jue-by-endlesscheng-jfzf","2021-10-16T12:31:25.987317+00:00","537","复数乘法","complex-number-multiplication",3033778664],"3036702868":["分解质因数","fen-jie-zhi-yin-shu-by-endlesscheng-x3kz","2023-01-01T04:09:36.709890+00:00","2521","数组乘积中的不同质因数数目","distinct-prime-factors-of-product-of-array",3036702868],"3044209556":["O(n) 做法","on-zuo-fa-by-endlesscheng-o2wp","2021-09-26T04:32:54.809512+00:00","2016","增量元素之间的最大差值","maximum-difference-between-increasing-elements",3044209556],"3048586035":["统计前缀和中的 0 的个数（Python/Java/C++/Go）","tong-ji-qian-zhui-he-zhong-de-0-de-ge-sh-fh1u","2024-02-04T04:36:07.473252+00:00","3028","边界上的蚂蚁","ant-on-the-boundary",3048586035],"305518406":["统计每个元素的出现次数","by-endlesscheng-h1uj","2022-04-24T04:18:39.184518+00:00","2248","多个数组求交集","intersection-of-multiple-arrays",305518406],"3057254301":["【视频】极致优化！一个视频讲透双指针！（Python/Java/C++/Go/JS/Rust）","shuang-zhi-zhen-xiang-bu-ming-bai-yi-ge-pno55","2022-11-12T04:34:09.608600+00:00","15","三数之和","3sum",3057254301],"3061824471":["枚举排列+子序列匹配","mei-ju-pai-lie-zi-xu-lie-pi-pei-by-endle-oi2h","2021-09-19T04:26:16.312560+00:00","2014","重复 K 次的最长子序列","longest-subsequence-repeated-k-times",3061824471],"3063296642":["田忌赛马，从 O(nlogn) 到 O(n)","tian-ji-sai-ma-by-endlesscheng-buk1","2023-03-18T16:08:53.261195+00:00","2592","最大化数组的伟大值","maximize-greatness-of-an-array",3063296642],"3065232387":["极致优化！基于三数之和的做法（Python/Java/C++/Go/JS）","ji-zhi-you-hua-ji-yu-san-shu-zhi-he-de-z-qgqi","2023-07-10T00:26:38.330188+00:00","16","最接近的三数之和","3sum-closest",3065232387],"3065742618":["分别计算，暴力枚举（Python/Java/C++/Go）","fen-bie-ji-suan-bao-li-mei-ju-by-endless-zxhr","2023-12-24T04:08:27.454256+00:00","2975","移除栅栏得到的正方形田地的最大面积","maximum-square-area-by-removing-fences-from-a-field",3065742618],"306595116":["二分答案（Python 一行搞定）","er-fen-da-an-python-yi-xing-gao-ding-by-xwvs8","2022-02-27T04:14:20.037831+00:00","2187","完成旅途的最少时间","minimum-time-to-complete-trips",306595116],"3067908479":["贪心 + 栈（Python/Java/C++/Go）","tan-xin-zhan-by-endlesscheng-ldds","2022-10-09T04:07:27.496778+00:00","2434","使用机器人打印字典序最小的字符串","using-a-robot-to-print-the-lexicographically-smallest-string",3067908479],"3071565639":["最近公共祖先，一个视频讲透！（Python/Java/C++/Go/JS/Rust）","zui-jin-gong-gong-zu-xian-yi-ge-shi-pin-8h2zc","2022-12-17T08:56:28.423747+00:00","235","二叉搜索树的最近公共祖先","lowest-common-ancestor-of-a-binary-search-tree",3071565639],"3074518984":["两种非暴力做法：0-1 trie+滑窗 / 哈希表（Python/Java/C++/Go）","o7n-zuo-fa-0-1-trie-hua-dong-chuang-kou-5h2t0","2023-11-12T04:13:54.626791+00:00","2932","找出强数对的最大异或值 I","maximum-strong-pair-xor-i",3074518984],"3077002187":["O(n) 做法","go-bao-li-by-endlesscheng-w2fr","2021-06-26T16:08:03.422449+00:00","1909","删除一个元素使数组严格递增","remove-one-element-to-make-the-array-strictly-increasing",3077002187],"307769453":["两种写法：逆向思维/直接双指针（Python/Java/C++/Go）","ni-xiang-si-wei-pythonjavacgo-by-endless-b4jt","2023-01-07T00:13:45.242065+00:00","1658","将 x 减到 0 的最小操作数","minimum-operations-to-reduce-x-to-zero",307769453],"3078609754":["不调库！一行代码搞定！（Python/Java/C++/Go）","yi-xing-gong-shi-by-endlesscheng-ixss","2022-09-18T04:12:37.496128+00:00","2413","最小偶倍数","smallest-even-multiple",3078609754],"3091785544":["Go 模拟","mo-ni-by-endlesscheng-chru","2021-08-15T04:07:53.545224+00:00","1967","作为子字符串出现在单词中的字符串数目","number-of-strings-that-appear-as-substrings-in-word",3091785544],"3092398094":["贪心（Python/Java/C++/Go）","tan-xin-pythonjavacgo-by-endlesscheng-gm1d","2023-06-11T04:23:25.942869+00:00","2734","执行子串操作后的字典序最小字符串","lexicographically-smallest-string-after-substring-operation",3092398094],"3098562302":["枚举第一个机器人的拐弯位置","mei-ju-di-yi-ge-ji-qi-ren-de-guai-wan-we-prfy","2021-09-26T04:09:36.814252+00:00","2017","网格游戏","grid-game",3098562302],"3100993645":["又写错了？一个视频讲透！（Python/Java/C++/Go）","you-xie-cuo-liao-yi-ge-shi-pin-jiang-tou-teqq","2022-11-26T09:50:31.176600+00:00","92","反转链表 II","reverse-linked-list-ii",3100993645],"3102719435":["枚举 higher[0] + 双指针","mei-ju-higher0-shuang-zhi-zhen-by-endles-ic64","2021-12-26T04:07:03.761465+00:00","2122","还原原数组","recover-the-original-array",3102719435],"3104122930":["如何用 Python 的状压 DP 递推写法通过此题","by-endlesscheng-d2oa","2021-05-04T01:29:43.563495+00:00","1723","完成所有工作的最短时间","find-minimum-time-to-finish-all-jobs",3104122930],"3118022376":["两种方法：Z 函数+字典树/只用字典树（Python/Java/C++/Go）","z-han-shu-zi-dian-shu-pythonjavacgo-by-e-5c2v","2024-02-18T04:49:23.317901+00:00","3045","统计前后缀下标对 II","count-prefix-and-suffix-pairs-ii",3118022376],"3118895370":["转换成求轮廓是否相交（Python/Java/C++/Go）","zhuan-huan-cheng-qiu-lun-kuo-shi-fou-xia-io8x","2023-02-04T16:12:27.035474+00:00","2556","二进制矩阵中翻转最多一次使路径不连通","disconnect-path-in-a-binary-matrix-by-at-most-one-flip",3118895370],"3119137809":["O(n) 贪心做法","on-zuo-fa-by-endlesscheng-an8b","2021-11-21T04:18:59.422762+00:00","2078","两栋颜色不同且距离最远的房子","two-furthest-houses-with-different-colors",3119137809],"3123299347":["【视频】如何灵活运用递归？让你对递归的理解更上一层楼！（Python/Java/C++/Go）","shi-pin-ru-he-ling-huo-yun-yong-di-gui-r-p925","2023-04-17T02:30:24.821316+00:00","LCR 176","判断是否为平衡二叉树","ping-heng-er-cha-shu-lcof",3123299347],"3124896474":["滑动窗口 O(n) 时间 O(1) 空间，附题单！（Python/Java/C++/Go/JS/Rust）","hua-dong-chuang-kou-on-shi-jian-o1-kong-cqawc","2023-10-01T04:17:53.381502+00:00","2875","无限数组的最短子数组","minimum-size-subarray-in-infinite-array",3124896474],"3126153106":["Go 一行","go-yi-xing-by-endlesscheng-7yl3","2022-04-02T16:14:39.132639+00:00","2220","转换数字的最少位翻转次数","minimum-bit-flips-to-convert-number",3126153106],"3143101757":["遍历","bian-li-by-endlesscheng-a77m","2022-10-30T04:09:16.801563+00:00","2456","最流行的视频创作者","most-popular-video-creator",3143101757],"3147357769":["Go 模拟","go-mo-ni-by-endlesscheng-tq1p","2021-09-12T04:05:47.572919+00:00","2000","反转单词前缀","reverse-prefix-of-word",3147357769],"3147772108":["单调栈 + 前缀和的前缀和（Python/Java/C++/Go）","dan-diao-zhan-qian-zhui-he-de-qian-zhui-d9nki","2022-05-22T04:09:32.848492+00:00","2281","巫师的总力量和","sum-of-total-strength-of-wizards",3147772108],"3148467486":["两种做法：从 O(nlogn) 到 O(n)（Python/Java/C++/Go）","dai-zhao-xia-biao-qu-pai-xu-pythonjavacg-umuv","2023-03-18T16:17:45.955681+00:00","2593","标记所有元素后数组的分数","find-score-of-an-array-after-marking-all-elements",3148467486],"3152421262":["【图解】从 O(n^2) 到 O(n)（Python/Java/C++/Go/JS/Rust）","tu-jie-cong-on2-dao-onpythonjavacgojsrus-h0o5","2024-02-21T23:58:35.939169+00:00","889","根据前序和后序遍历构造二叉树","construct-binary-tree-from-preorder-and-postorder-traversal",3152421262],"315307043":["【图解】两种方法：二分答案 / 直接计算（Python/Java/C++/Go/JS/Rust）","er-fen-bfspythonjavacgo-by-endlesscheng-ypp1","2022-04-30T16:08:54.191904+00:00","2258","逃离火灾","escape-the-spreading-fire",315307043],"31547081":["又写错了？一个视频讲透！（Python/Java/C++/Go/JS）","you-xie-cuo-liao-yi-ge-shi-pin-jiang-tou-kcmj","2022-12-01T06:48:11.958579+00:00","LCR 141","训练计划 III","fan-zhuan-lian-biao-lcof",31547081],"3156996757":["O(n) 一次遍历（Python/Java/C++/Go/JS/Rust）","on-yi-ci-bian-li-pythonjavacgojsrust-by-l9jat","2024-01-16T23:55:09.771058+00:00","2744","最大字符串配对数目","find-maximum-number-of-string-pairs",3156996757],"3158353268":["判断质数（Python/Java/C++/Go）","pan-duan-zhi-shu-by-endlesscheng-m6nt","2023-04-09T04:21:49.252049+00:00","2614","对角线上的质数","prime-in-diagonal",3158353268],"3177194252":["双端队列 O(n) 做法（Python/Java/C++/Go）","shuang-duan-dui-lie-on-zuo-fa-by-endless-5pe1","2023-08-06T04:16:52.674960+00:00","2810","故障键盘","faulty-keyboard",3177194252],"3182582646":["一次遍历（Python/Java/C++/Go/JS）","yi-ci-bian-li-by-endlesscheng-6zt9","2023-08-13T04:30:14.044978+00:00","2815","数组中的最大数对和","max-pair-sum-in-an-array",3182582646],"3183288856":["排序+滑动窗口","pai-xu-hua-dong-chuang-kou-by-endlessche-s49g","2021-08-29T04:07:39.279219+00:00","1984","学生分数的最小差值","minimum-difference-between-highest-and-lowest-of-k-scores",3183288856],"3187405082":["两种分类讨论思路（Python/Java/C++/Go）","yong-che-xiao-de-fang-shi-si-kao-pythonj-o253","2024-01-21T05:06:00.340531+00:00","3017","按距离统计房屋对数目 II","count-the-number-of-houses-at-a-certain-distance-ii",3187405082],"3189918628":["如何删除节点？六分钟搞定四道题目！（Python/Java/C++/Go）","ru-he-shan-chu-jie-dian-liu-fen-zhong-ga-x3kn","2022-12-03T08:43:02.662487+00:00","237","删除链表中的节点","delete-node-in-a-linked-list",3189918628],"3201195359":["状压 DP","zhuang-ya-dp-by-endlesscheng-d8sw","2021-05-29T16:07:02.645483+00:00","1879","两个数组最小的异或值之和","minimum-xor-sum-of-two-arrays",3201195359],"3202447407":["DFS 的同时计算分数","liang-bian-dfs-by-endlesscheng-utf8","2021-10-24T04:06:43.757510+00:00","2049","统计最高分的节点数目","count-nodes-with-the-highest-score",3202447407],"320329751":["O(N) 后缀数组做法","hou-zhui-shu-zu-on-zuo-fa-by-endlesschen-mgg3","2021-07-07T02:54:56.784417+00:00","1062","最长重复子串","longest-repeating-substring",320329751],"3211790430":["按照名字分组+排序（Python/Java/C++/Go）","an-zhao-ming-zi-fen-zu-pai-xu-pythonjava-fkax","2023-11-12T04:09:58.481568+00:00","2933","高访问员工","high-access-employees",3211790430],"3214093273":["又写错了？一个视频讲透！（Python/Java/C++/Go）","you-xie-cuo-liao-yi-ge-shi-pin-jiang-tou-plfs","2022-11-26T09:51:12.243797+00:00","25","K 个一组翻转链表","reverse-nodes-in-k-group",3214093273],"3216210693":["巧妙枚举（Python/Java/C++/Go/JS/Rust）","qiao-miao-mei-ju-pythonjavacgo-by-endles-5ws2","2023-06-11T04:10:02.105031+00:00","2735","收集巧克力","collecting-chocolates",3216210693],"3221190981":["又写死循环了？一个视频讲透二分！（Python/Java/C++/Go）","by-endlesscheng-owgd","2022-11-23T10:15:21.430178+00:00","153","寻找旋转排序数组中的最小值","find-minimum-in-rotated-sorted-array",3221190981],"3221222128":["排序后从中间分开，错开一位合并","pai-xu-hou-cuo-kai-yi-wei-he-bing-by-end-mqrk","2021-08-15T04:07:31.510050+00:00","1968","构造元素不等于两相邻元素平均值的数组","array-with-elements-not-equal-to-average-of-neighbors",3221222128],"3228686257":["两种思考问题的角度：移除元素/添加元素（Python/Java/C++/Go）","tan-xin-pythonjavacgo-by-endlesscheng-ymuh","2024-01-07T04:21:32.153913+00:00","3002","移除后集合的最多元素数","maximum-size-of-a-set-after-removals",3228686257],"3230369611":["【图解】非暴力 O(nm) 算法（Python/Java/C++/Go）","tu-jie-fei-bao-li-onm-suan-fa-pythonjava-k5og","2023-03-26T14:55:32.443032+00:00","1638","统计只差一个字符的子串数目","count-substrings-that-differ-by-one-character",3230369611],"3231924477":["【视频】分类讨论乱如麻？一个视频梳理清楚！（Python/Java/C++/Go）","shi-pin-fen-lei-tao-lun-luan-ru-ma-yi-ge-vote","2023-04-17T03:18:55.812949+00:00","LCR 193","二叉搜索树的最近公共祖先","er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof",3231924477],"3243872254":["高效写法，只需初始化一次统计数组","gao-xiao-xie-fa-zhi-xu-chu-shi-hua-yi-ci-4zs3","2022-01-09T04:12:33.175142+00:00","2133","检查是否每一行每一列都包含全部整数","check-if-every-row-and-column-contains-all-numbers",3243872254],"3248412457":["排序不等式","by-endlesscheng-9p6y","2022-05-29T00:12:49.578478+00:00","2285","道路的最大总重要性","maximum-total-importance-of-roads",3248412457],"324872429":["Go 统计因子个数","go-tong-ji-yin-zi-ge-shu-by-endlesscheng-doxu","2021-08-01T04:09:07.699966+00:00","1952","三除数","three-divisors",324872429],"3250902571":["一次遍历（Python/Java/C++/Go/JS）","mo-ni-by-endlesscheng-is4i","2022-12-24T23:57:51.929834+00:00","2511","最多可以摧毁的敌人城堡数目","maximum-enemy-forts-that-can-be-captured",3250902571],"3254374161":["两次排序","liang-ci-pai-xu-by-endlesscheng-994b","2021-12-11T16:12:42.531028+00:00","2099","找到和最大的长度为 K 的子序列","find-subsequence-of-length-k-with-the-largest-sum",3254374161],"3256507952":["预处理回文数+中位数贪心（Python/Java/C++/Go）","yu-chu-li-hui-wen-shu-zhong-wei-shu-tan-7j0zy","2023-12-17T04:12:12.806397+00:00","2967","使数组成为等数数组的最小代价","minimum-cost-to-make-array-equalindromic",3256507952],"3261672467":["枚举做几道菜+贪心（Python/Java/C++/Go/JS/Rust）","mei-ju-zuo-ji-dao-cai-tan-xin-pythonjava-k7w2","2023-10-21T23:31:19.801070+00:00","1402","做菜顺序","reducing-dishes",3261672467],"3263594037":["没有思路？一张图秒懂！（Python/Java/C++/Go/JS）","mei-you-si-lu-yi-zhang-tu-miao-dong-pyth-ilqh","2023-07-19T23:53:17.291420+00:00","918","环形子数组的最大和","maximum-sum-circular-subarray",3263594037],"3267047320":["两种方法：动态规划/前缀和（附题单！Python/Java/C++/Go/JS）","liang-chong-fang-fa-dong-tai-gui-hua-qia-dczr","2023-08-08T00:28:13.629404+00:00","1749","任意子数组和的绝对值的最大值","maximum-absolute-sum-of-any-subarray",3267047320],"3272610079":["每行分段统计","mei-xing-fen-duan-tong-ji-by-endlesschen-umie","2021-05-15T16:56:45.275916+00:00","1861","旋转盒子","rotating-the-box",3272610079],"32848909":["线性做法","xian-xing-zuo-fa-by-endlesscheng-pgbv","2021-08-08T04:06:05.093867+00:00","1961","检查字符串是否为数组前缀","check-if-string-is-a-prefix-of-array",32848909],"3290623649":["位运算简洁写法（Python/Java/C++/Go）","wei-yun-suan-jian-ji-xie-fa-pythonjavacg-h7rz","2024-01-28T04:29:23.541498+00:00","3019","按键变更的次数","number-of-changing-keys",3290623649],"3300902320":["一些简化代码的技巧","mo-ni-by-endlesscheng-mc05","2022-09-25T01:40:11.829597+00:00","LCP 61","气温变化趋势","6CE719",3300902320],"3302229375":["【视频】教你一步步思考动态规划！股票问题通用解法！（Python/Java/C++/Go/JS/Rust）","shi-pin-jiao-ni-yi-bu-bu-si-kao-dong-tai-o3y4","2023-03-31T10:38:12.318698+00:00","122","买卖股票的最佳时机 II","best-time-to-buy-and-sell-stock-ii",3302229375],"3304159418":["一题双解：DFS + BFS / 最近公共祖先","bfs-zuo-fa-by-endlesscheng-dfcf","2021-12-05T04:10:15.376692+00:00","2096","从二叉树一个节点到另一个节点每一步的方向","step-by-step-directions-from-a-binary-tree-node-to-another",3304159418],"330899243":["Go 贪心","go-tan-xin-by-endlesscheng-opwm","2021-08-21T16:13:25.262800+00:00","1975","最大方阵和","maximum-matrix-sum",330899243],"3312226061":["脑筋急转弯，O(n) 一次遍历（Python/Java/C++/Go）","nao-jin-ji-zhuan-wan-on-yi-ci-bian-li-py-cv1q","2023-10-15T00:01:50.299077+00:00","2900","最长相邻不相等子序列 I","longest-unequal-adjacent-groups-subsequence-i",3312226061],"3315472808":["前缀和常见技巧（Python/Java/C++/Go）","qian-zhui-he-chang-jian-ji-qiao-by-endle-t57t","2021-06-27T04:05:54.839918+00:00","1915","最美子字符串的数目","number-of-wonderful-substrings",3315472808],"3329709268":["Go 差分+位运算压缩状态","go-chai-fen-wei-yun-suan-ya-suo-zhuang-t-smpb","2021-12-07T05:58:56.920083+00:00","759","员工空闲时间","employee-free-time",3329709268],"3334241084":["前缀和+式子变形（附题单）Python/Java/C++/Go/JS","qian-zhui-he-ha-xi-biao-fu-ti-dan-by-end-74bb","2023-09-03T04:12:30.518984+00:00","2845","统计趣味子数组的数目","count-of-interesting-subarrays",3334241084],"333667858":["Go 模拟","go-jian-ji-xie-fa-by-endlesscheng-mcwc","2021-08-22T04:13:01.368526+00:00","1980","找出不同的二进制字符串","find-unique-binary-string",333667858],"3336959867":["子序列 DP + 枚举字符 + 空间优化（Python/Java/C++/Go）","by-endlesscheng-t7zf","2022-08-07T04:06:37.770561+00:00","2370","最长理想子序列","longest-ideal-subsequence",3336959867],"3337273246":["读题题","du-ti-ti-by-endlesscheng-qp1m","2022-12-04T04:07:11.493850+00:00","2492","两个城市间路径的最小分数","minimum-score-of-a-path-between-two-cities",3337273246],"3344221047":["回溯不会写？套路在此！（Python/Java/C++/Go/JS）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-wcdw","2023-01-20T09:24:48.614561+00:00","22","括号生成","generate-parentheses",3344221047],"334656901":["模拟","mo-ni-by-endlesscheng-p5va","2022-04-16T16:12:25.401281+00:00","2239","找到最接近 0 的数字","find-closest-number-to-zero",334656901],"3347724858":["Go 模拟","go-mo-ni-by-endlesscheng-wxi2","2021-06-12T16:15:45.840883+00:00","1894","找到需要补充粉笔的学生编号","find-the-student-that-will-replace-the-chalk",3347724858],"3348570525":["如何去重？一个视频讲透！（Python/Java/C++/Go）","ru-he-qu-zhong-yi-ge-shi-pin-jiang-tou-p-2ddn","2022-12-03T08:48:10.054794+00:00","82","删除排序链表中的重复元素 II","remove-duplicates-from-sorted-list-ii",3348570525],"335140403":["脑筋急转弯（Python/Java/C++/Go）","nao-jin-ji-zhuan-wan-by-endlesscheng-0l19","2023-08-06T04:25:36.659151+00:00","2811","判断是否能拆分数组","check-if-it-is-possible-to-split-array",335140403],"3353015937":["两种 O(n) 递归写法（Python/Java/C++/Go/JS）","liang-chong-on-di-gui-xie-fa-pythonjavac-hac3","2023-09-06T00:01:29.941959+00:00","865","具有所有最深节点的最小子树","smallest-subtree-with-all-the-deepest-nodes",3353015937],"3354310865":["模拟","by-endlesscheng-rant","2022-09-18T04:12:18.517051+00:00","2414","最长的字母序连续子字符串的长度","length-of-the-longest-alphabetical-continuous-substring",3354310865],"335486990":["Go 模拟","go-mo-ni-by-endlesscheng-bjeo","2021-10-17T04:07:42.281312+00:00","2042","检查句子中的数字是否递增","check-if-numbers-are-ascending-in-a-sentence",335486990],"3355469687":["暴力枚举 / 双指针（Python/Java/C++/Go）","bao-li-mei-ju-pythonjavacgo-by-endlessch-z6t6","2022-09-04T04:08:08.538117+00:00","2401","最长优雅子数组","longest-nice-subarray",3355469687],"3357632986":["回溯不会写？套路在此！（Python/Java/C++/Go）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-zbxu","2023-02-01T12:00:24.791331+00:00","LCR 079","子集","TVdhkn",3357632986],"3363685518":["倒序操作+简洁写法！（Python/Java/C++/Go）","dao-xu-cao-zuo-jian-ji-xie-fa-pythonjava-7rqh","2023-06-04T04:23:48.053174+00:00","2718","查询后矩阵的和","sum-of-matrix-after-queries",3363685518],"3369476122":["数位 DP 通用模板","shu-wei-dp-tong-yong-mo-ban-by-endlessch-h8fj","2023-07-30T04:06:56.422450+00:00","2801","统计范围内的步进数字数目","count-stepping-numbers-in-range",3369476122],"3371445858":["先斜着走再直走，然后在终点绕圈圈（Python/Java/C++/Go/JS）","xian-xie-zhao-zou-zai-zhi-zou-ran-hou-za-lkxu","2023-09-10T04:09:58.198270+00:00","2849","判断能否在给定时间到达单元格","determine-if-a-cell-is-reachable-at-a-given-time",3371445858],"3372525938":["【视频】双指针想不明白？一个视频讲透！（Python/Java/C++/Go/JS/Rust）","san-shu-zhi-he-bu-hui-xie-xiang-xiang-sh-6wbq","2022-11-12T04:17:02.175043+00:00","167","两数之和 II - 输入有序数组","two-sum-ii-input-array-is-sorted",3372525938],"337441895":["【套路】二分答案！附题单！","er-fen-da-an-by-endlesscheng-r418","2022-12-25T04:08:09.774252+00:00","2517","礼盒的最大甜蜜度","maximum-tastiness-of-candy-basket",337441895],"3375593429":["枚举","mei-ju-by-endlesscheng-0mnx","2023-07-09T01:31:22.459371+00:00","2768","黑格子的数目","number-of-black-blocks",3375593429],"3376945874":["与其维护第一个未满栈，不如维护所有未满栈（Python/Java/C++/Go）","yu-qi-wei-hu-di-yi-ge-wei-man-zhan-bu-ru-sphs","2023-04-27T14:10:19.359856+00:00","1172","餐盘栈","dinner-plate-stacks",3376945874],"3381061806":["字典树+Floyd+记忆化搜索/递推（Python/Java/C++/Go）","zi-dian-shu-floyddp-by-endlesscheng-oi2r","2023-12-24T04:10:15.561726+00:00","2977","转换字符串的最小成本 II","minimum-cost-to-convert-string-ii",3381061806],"3382549811":["排序 + 简化代码的技巧","pai-xu-by-endlesscheng-nm1r","2022-05-15T05:44:40.237983+00:00","2274","不含特殊楼层的最大连续楼层数","maximum-consecutive-floors-without-special-floors",3382549811],"3386206172":["两种 O(n) 做法：KMP / Z函数（Python/Java/C++/Go）","liang-chong-on-zuo-fa-kmp-zhan-shu-pytho-1ty6","2024-02-11T04:34:59.558357+00:00","3034","匹配模式数组的子数组数目 I","number-of-subarrays-that-match-a-pattern-i",3386206172],"3386255965":["贪心（Python/Java/C++/Go）","tan-xin-pythonjavacgo-by-endlesscheng-r0py","2023-05-21T10:57:21.738759+00:00","2697","字典序最小回文串","lexicographically-smallest-palindrome",3386255965],"3387998069":["事件扫描线","shi-jian-sao-miao-xian-by-endlesscheng-a6v1","2021-07-24T16:06:07.182865+00:00","1943","描述绘画结果","describe-the-painting",3387998069],"3398027261":["只有两种情况（Python/Java/C++/Go）","zhi-you-liang-chong-qing-kuang-pythonjav-jdeg","2023-11-12T04:09:03.651688+00:00","2934","最大化数组末位元素的最少操作次数","minimum-operations-to-maximize-last-elements-in-arrays",3398027261],"3400286463":["模拟","mo-ni-by-endlesscheng-wegn","2022-02-19T16:11:16.964464+00:00","2176","统计数组中相等且可以被整除的数对","count-equal-and-divisible-pairs-in-an-array",3400286463],"3403473925":["避免浮点数的写法","by-endlesscheng-xzk2","2022-03-20T08:07:15.056293+00:00","2208","将数组和减半的最少操作次数","minimum-operations-to-halve-array-sum",3403473925],"340770494":["按照相同时间分组 + 建图 DFS","an-zhao-xiang-tong-shi-jian-fen-zu-jian-2y4yx","2021-11-28T04:06:16.749974+00:00","2092","找出知晓秘密的所有专家","find-all-people-with-secret",340770494],"340860484":["【图解】没有思路？一张图秒懂！（Python/Java/C++/Go/JS/Rust）","kao-lu-mei-tiao-bian-shang-zhi-shao-xu-y-uamv","2022-11-20T04:11:03.471891+00:00","2477","到达首都的最少油耗","minimum-fuel-cost-to-report-to-the-capital",340860484],"3422315602":["递推 + 枚举","d-by-endlesscheng-kya3","2022-09-25T04:25:57.292282+00:00","2420","找到所有好下标","find-all-good-indices",3422315602],"3424505272":["【图解】一张图秒懂换根 DP！（Python/Java/C++/Go/JS）","tu-jie-yi-zhang-tu-miao-dong-huan-gen-dp-6bgb","2023-07-16T00:38:34.796392+00:00","834","树中距离之和","sum-of-distances-in-tree",3424505272],"3427404671":["【动画】从两数之和中，我们可以学到什么？（Python/Java/C++/Go/JS/Rust）","dong-hua-cong-liang-shu-zhi-he-zhong-wo-0yvmj","2023-06-30T23:33:48.737195+00:00","1","两数之和","two-sum",3427404671],"343052836":["枚举 nums[j] + 前后缀分解（Python/Java/C++/Go）","mei-ju-numsj-qian-hou-zhui-fen-jie-pytho-tskf","2023-10-22T08:03:09.032969+00:00","2909","元素和最小的山形三元组 II","minimum-sum-of-mountain-triplets-ii",343052836],"3430688223":["排序 + 贪心","pai-xu-tan-xin-by-endlesscheng-k5i4","2022-06-05T04:23:52.842691+00:00","2294","划分数组使最大差为 K","partition-array-such-that-maximum-difference-is-k",3430688223],"3430988573":["后缀数组+二分答案","hou-zhui-shu-zu-er-fen-da-an-by-endlessc-ocar","2021-07-04T04:10:07.148151+00:00","1923","最长公共子路径","longest-common-subpath",3430988573],"3433602336":["从递归到递推，教你一步步思考动态规划！（Python/Java/C++/Go）","cong-di-gui-dao-di-tui-jiao-ni-yi-bu-bu-auy8z","2023-03-27T15:27:44.510030+00:00","1092","最短公共超序列","shortest-common-supersequence",3433602336],"3434976181":["滑动窗口，简洁写法（Python/Java/C++/Go）","hua-dong-chuang-kou-jian-ji-xie-fa-pytho-1c2d","2023-05-03T15:54:46.421113+00:00","2106","摘水果","maximum-fruits-harvested-after-at-most-k-steps",3434976181],"3435556540":["贪心 + 详细证明（Python/Java/C++/Go）","by-endlesscheng-d11y","2022-08-06T22:51:56.109611+00:00","2366","将数组排序的最少替换次数","minimum-replacements-to-sort-the-array",3435556540],"3437839264":["两种非暴力做法：KMP+二分查找/双指针（Python/Java/C++/Go）","fei-bao-li-zuo-fa-kmper-fen-cha-zhao-pyt-0o8y","2024-01-14T04:29:57.834965+00:00","3006","找出数组中的美丽下标 I","find-beautiful-indices-in-the-given-array-i",3437839264],"3444975876":["子集状压 DP（Python/Java/C++/Go/JS）","by-endlesscheng-80ao","2022-06-12T04:12:06.835035+00:00","2305","公平分发饼干","fair-distribution-of-cookies",3444975876],"3445184694":["O(log) 辗转相除法","olog-zhan-zhuan-xiang-chu-fa-by-endlessc-vxq0","2022-02-13T04:13:54.242893+00:00","2169","得到 0 的操作数","count-operations-to-obtain-zero",3445184694],"3448832663":["教你一步步思考动态规划！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-lbz5","2023-02-25T11:22:27.302671+00:00","1143","最长公共子序列","longest-common-subsequence",3448832663],"3460806368":["两张图秒懂单调队列（Python/Java/C++/Go）","liang-zhang-tu-miao-dong-dan-diao-dui-li-9fvh","2022-10-25T23:33:32.230667+00:00","862","和至少为 K 的最短子数组","shortest-subarray-with-sum-at-least-k",3460806368],"3461834167":["教你一步步思考构造题！（Python/Java/C++/Go）","tan-xin-gou-zao-yan-zheng-o1e-wai-kong-j-82ik","2023-02-19T04:08:47.961474+00:00","2573","找出对应 LCP 矩阵的字符串","find-the-string-with-lcp",3461834167],"3462463455":["枚举滑动窗口内有多少种字母（Python/Java/C++/Go）","bao-li-hua-chuang-mei-ju-chuang-kou-nei-31j5m","2023-12-03T04:17:32.001639+00:00","2953","统计完全子字符串","count-complete-substrings",3462463455],"3469926498":["数位 DP 通用模板，附题单（Python/Java/C++/Go）","by-endlesscheng-c5vg","2022-08-14T14:51:47.549288+00:00","1012","至少有 1 位重复的数字","numbers-with-repeated-digits",3469926498],"3474039417":["【套路】前缀和+哈希表（Python/Java/C++/Go）","tao-lu-qian-zhui-he-ha-xi-biao-pythonjav-3fna","2023-03-12T04:09:05.761121+00:00","2588","统计美丽子数组数目","count-the-number-of-beautiful-subarrays",3474039417],"3480413551":["O(2^n) 迭代子集或","o2n-zi-ji-huo-xie-fa-by-endlesscheng-bczp","2021-10-17T04:06:47.731735+00:00","2044","统计按位或能得到最大值的子集数目","count-number-of-maximum-bitwise-or-subsets",3480413551],"3483377785":["两种写法：01背包/子集状压DP（Python/Java/C++/Go）","liang-chong-xie-fa-01bei-bao-zi-ji-zhuan-3ooi","2023-02-19T10:03:03.475004+00:00","2572","无平方子集计数","count-the-number-of-square-free-subsets",3483377785],"3484001100":["相向双指针，一个视频讲透！（Python/Java/C++/Go）","xiang-xiang-shuang-zhi-zhen-yi-ge-shi-pi-nr4y","2023-02-17T14:32:24.954196+00:00","1237","找出给定方程的正整数解","find-positive-integer-solution-for-a-given-equation",3484001100],"3492742379":["预处理质数 + 枚举（Python/Java/C++/Go）","yu-chu-li-zhi-shu-mei-ju-by-endlesscheng-uw2b","2023-01-01T04:16:49.700806+00:00","2523","范围内最接近的两个质数","closest-prime-numbers-in-range",3492742379],"3501115477":["从 O(n^2) 到 O(n)：至多两段递增子数组","cong-on2-dao-onzhi-duo-liang-duan-di-zen-yruq","2023-09-17T01:44:29.784799+00:00","2855","使数组成为递增数组的最少右移次数","minimum-right-shifts-to-sort-the-array",3501115477],"3503134762":["线性 DP，附相似题目（Python/Java/C++/Go）","xian-xing-dpfu-xiang-si-ti-mu-pythonjava-wmh7","2023-08-20T04:13:35.535770+00:00","2830","销售利润最大化","maximize-the-profit-as-the-salesman",3503134762],"3509092584":["两种做法：位运算/打表（Python/Java/C++/Go）","liang-chong-zuo-fa-wei-yun-suan-da-biao-w4war","2023-06-11T09:50:31.497118+00:00","2729","判断一个数是否迷人","check-if-the-number-is-fascinating",3509092584],"3513036702":["中心扩展 + DP（Python/Java/C++/Go）","zhong-xin-kuo-zhan-dppythonjavacgo-by-en-1yt1","2022-11-13T04:12:27.046745+00:00","2472","不重叠回文子字符串的最大数目","maximum-number-of-non-overlapping-palindrome-substrings",3513036702],"3518502488":["乘法原理（Python/Java/C++/Go）","cheng-fa-yuan-li-by-endlesscheng-hypt","2023-06-25T04:09:49.042524+00:00","2750","将数组划分成若干好子数组的方式","ways-to-split-array-into-good-subarrays",3518502488],"3519471521":["组合数学题，附模板（Python/Java/C++/Go）","zu-he-shu-xue-ti-by-endlesscheng-5fjp","2023-12-03T04:13:06.063057+00:00","2954","统计感冒序列的数目","count-the-number-of-infection-sequences",3519471521],"3520875014":["看到递归就晕？带你理解递归的本质！（Python/Java/C++/Go/JS）","kan-dao-di-gui-jiu-yun-dai-ni-li-jie-di-leixm","2023-08-14T00:16:03.119009+00:00","617","合并二叉树","merge-two-binary-trees",3520875014],"3521652117":["贪心（每个语言都只需要两行！）Python/Java/C++/Go/JS/Rust","tan-xin-by-endlesscheng-0nsi","2023-09-24T04:20:35.210738+00:00","2864","最大二进制奇数","maximum-odd-binary-number",3521652117],"3521973284":["二维差分（Python/Java/C++/Go）","er-wei-chai-fen-by-endlesscheng-mh0h","2023-01-15T04:07:57.759152+00:00","2536","子矩阵元素加 1","increment-submatrices-by-one",3521973284],"3528330030":["遍历","bian-li-by-endlesscheng-k17h","2022-10-02T04:08:21.621883+00:00","2428","沙漏的最大总和","maximum-sum-of-an-hourglass",3528330030],"3532176892":["试填法（Python/Java/C++/Go）","shi-tian-fa-pythonjavacgo-by-endlesschen-ysom","2024-01-28T04:25:26.534887+00:00","3022","给定操作次数内使剩余元素的或值最小","minimize-or-of-remaining-elements-using-operations",3532176892],"3532863467":["【图解】O(n) 线性做法（Python/Java/C++/Go）","tu-jie-on-xian-xing-zuo-fa-pythonjavacgo-tjz2","2023-09-24T05:44:23.412584+00:00","2867","统计树中的合法路径数目","count-valid-paths-in-a-tree",3532863467],"3536253643":["O(log n) 容斥原理（附记忆化搜索）","olog-n-rong-chi-yuan-li-fu-ji-yi-hua-sou-okjf","2023-11-12T00:35:08.655580+00:00","2930","重新排列后包含指定子字符串的字符串数目","number-of-strings-which-can-be-rearranged-to-contain-substring",3536253643],"3547308658":["【视频】如何灵活运用递归？让你对递归的理解更上一层楼！（Python/Java/C++/Go）","shi-pin-ru-he-ling-huo-yun-yong-di-gui-r-4708","2023-04-17T05:48:46.943708+00:00","LCR 046","二叉树的右视图","WNC0Lk",3547308658],"3549688121":["贪心 + 构造（Python/Java/C++/Go）","tan-xin-gou-zao-by-endlesscheng-c2ui","2023-02-05T04:11:00.932985+00:00","2561","重排水果","rearranging-fruits",3549688121],"3550553048":["Go 自定义排序","go-zi-ding-yi-pai-xu-by-endlesscheng-4rg3","2021-08-29T04:07:17.919794+00:00","1985","找出数组中的第 K 大整数","find-the-kth-largest-integer-in-the-array",3550553048],"3552570937":["两种方法：逆向思维/正向思维（附题单）Python/Java/C++/Go/JS/Rust","liang-chong-fang-fa-ni-xiang-si-wei-zhen-e3gb","2023-12-03T00:50:11.100144+00:00","1423","可获得的最大点数","maximum-points-you-can-obtain-from-cards",3552570937],"3553057842":["原地修改","yuan-di-xiu-gai-by-endlesscheng-m1k3","2022-08-14T04:09:10.921955+00:00","2373","矩阵中的局部最大值","largest-local-values-in-a-matrix",3553057842],"3555784215":["划分型 DP（Python/Java/C++/Go）","by-endlesscheng-8y73","2022-08-07T04:06:56.753485+00:00","2369","检查数组是否存在有效划分","check-if-there-is-a-valid-partition-for-the-array",3555784215],"3558781406":["判断空格前后字符是否相同（附 Python 一行）","pan-duan-kong-ge-qian-hou-zi-fu-shi-fou-zstrn","2022-12-04T04:08:17.972731+00:00","2490","回环句","circular-sentence",3558781406],"3561342867":["贪心 + 一次遍历","bian-li-by-endlesscheng-7ojw","2023-01-01T04:10:01.202119+00:00","2522","将字符串分割成值不超过 K 的子字符串","partition-string-into-substrings-with-values-at-most-k",3561342867],"3562926842":["【图解】转换成中位数贪心+空间优化（Python/Java/C++/Go）","tu-jie-zhuan-huan-cheng-zhong-wei-shu-ta-iz4v","2022-12-17T23:30:50.467806+00:00","1703","得到连续 K 个 1 的最少相邻交换次数","minimum-adjacent-swaps-for-k-consecutive-ones",3562926842],"3563762803":["两种方法：选或不选/转换成0-1背包","xuan-huo-bu-xuan-de-dian-xing-si-lu-by-e-ulcd","2023-06-18T04:10:57.364928+00:00","2742","给墙壁刷油漆","painting-the-walls",3563762803],"3565117549":["转换成最大子数组和（Python/Java/C++/Go）","by-endlesscheng-fm8l","2022-06-26T04:44:26.256900+00:00","2321","拼接数组的最大分数","maximum-score-of-spliced-array",3565117549],"3565951903":["从前往后匹配+从后往前匹配","cong-qian-wang-hou-pi-pei-cong-hou-wang-uiq6a","2021-06-06T04:32:03.509613+00:00","1888","使二进制字符串字符交替的最少反转次数","minimum-number-of-flips-to-make-the-binary-string-alternating",3565951903],"3566729670":["转换成 a+b\u003ec，用相向双指针解决（Python/Java/C++/Go/JS）","zhuan-huan-cheng-abcyong-xiang-xiang-shu-1ex3","2023-09-08T08:41:24.440600+00:00","611","有效三角形的个数","valid-triangle-number",3566729670],"3567330607":["倒序动态规划","jian-ji-xie-fa-by-endlesscheng-bvrx","2021-08-29T04:17:25.695512+00:00","1987","不同的好子序列数目","number-of-unique-good-subsequences",3567330607],"3570284045":["没想明白？一个动画秒懂！附 O(1) 做法（Python/Java/C++/Go）","mei-xiang-ming-bai-yi-ge-dong-hua-miao-d-8vbe","2022-12-24T23:48:55.891923+00:00","1739","放置盒子","building-boxes",3570284045],"3573894690":["动态规划+线段树优化（Python/Java/C++/Go）","by-endlesscheng-05s0","2023-01-22T04:06:32.852414+00:00","2547","拆分数组的最小代价","minimum-cost-to-split-an-array",3573894690],"3585483303":["回溯不会写？套路在此！（Python/Java/C++/Go/JS）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-8rbi","2023-07-17T09:13:10.674456+00:00","面试题 08.04","幂集","power-set-lcci",3585483303],"3589033912":["双哈希表，O(1) 做法（Python/Java/C++/Go）","shuang-ha-xi-biao-o1-zuo-fa-pythonjavacg-jo68","2023-05-07T05:52:12.821829+00:00","2671","频率跟踪器","frequency-tracker",3589033912],"3590542886":["BFS 简洁写法","go-bfs-by-endlesscheng-kymv","2021-10-31T05:45:04.467223+00:00","2059","转化数字的最小运算数","minimum-operations-to-convert-number",3590542886],"3595421528":["二分答案，附题单！（Python/Java/C++/Go/JS/Rust）","er-fen-da-an-fu-ti-dan-pythonjavacgojsru-n5la","2024-01-21T00:37:48.720623+00:00","410","分割数组的最大值","split-array-largest-sum",3595421528],"3596139981":["教你一步步思考 DP！附 O(1) 空间写法！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dpfu-o1-kong-jia-4zma","2023-03-04T10:46:03.346462+00:00","300","最长递增子序列","longest-increasing-subsequence",3596139981],"359765882":["从记忆化搜索到递推，教你一步步思考动态规划！（Python/Java/C++/Go/JS）","cong-ji-yi-hua-sou-suo-dao-di-tui-jiao-n-nbk6","2023-08-28T23:55:23.347335+00:00","823","带因子的二叉树","binary-trees-with-factors",359765882],"360478335":["数位 DP 通用模板，附题单（Python/Java/C++/Go）","by-endlesscheng-9b96","2022-09-25T00:29:26.257241+00:00","788","旋转数字","rotated-digits",360478335],"3605700572":["无向基环树","by-endlesscheng-422f","2022-04-05T09:31:09.824533+00:00","2204","无向图中到环的距离","distance-to-a-cycle-in-undirected-graph",3605700572],"3607071844":["O(n) 做法：考虑间隔和的变化量（Python/Java/C++/Go）","on-zuo-fa-ha-xi-biao-mei-ju-xiang-tong-y-f5yb","2021-12-26T04:07:30.050061+00:00","2121","相同元素的间隔之和","intervals-between-identical-elements",3607071844],"3609197847":["统计空格个数 +1 即为单词个数","tong-ji-kong-ge-de-ge-shu-1-by-endlessch-6f1g","2021-12-25T16:30:59.317461+00:00","2114","句子中的最多单词数","maximum-number-of-words-found-in-sentences",3609197847],"3619173359":["前缀和做法：本质是买卖股票问题（附题单！）Python/Java/C++/Go/JS/Rust","qian-zhui-he-zuo-fa-ben-zhi-shi-mai-mai-abu71","2023-11-20T00:12:17.437533+00:00","53","最大子数组和","maximum-subarray",3619173359],"3624743731":["贪心，最优可以 O(n)","tan-xin-ji-qi-zheng-ming-by-endlesscheng-u783","2023-04-02T05:18:37.256440+00:00","2611","老鼠和奶酪","mice-and-cheese",3624743731],"3627963576":["DFS 求连通块大小（Python/Java/C++/Go/JS/Rust）","by-endlesscheng-7l50","2022-06-26T00:30:29.350122+00:00","2316","统计无向图中无法互相到达点对数","count-unreachable-pairs-of-nodes-in-an-undirected-graph",3627963576],"3631325739":["线性做法（Python/Java/C++/Go/JS）","xian-xing-zuo-fa-pythonjavacgojs-by-endl-w6gs","2023-07-06T11:48:42.353720+00:00","2753","计算一个环形街道上的房屋数量 II","count-houses-in-a-circular-street-ii",3631325739],"364057867":["两种做法：二分答案 / 排序+贪心（附详细证明 Python/Java/C++/Go）","liang-chong-jie-fa-er-fen-da-an-pai-xu-t-grd8","2022-01-16T07:41:30.628469+00:00","2141","同时运行 N 台电脑的最长时间","maximum-running-time-of-n-computers",364057867],"3647529643":["Go 斜向前缀和","go-qian-zhui-he-by-endlesscheng-30l0","2021-05-30T08:52:49.067014+00:00","1878","矩阵中最大的三个菱形和","get-biggest-three-rhombus-sums-in-a-grid",3647529643],"3654559374":["【视频】教你一步步思考动态规划！股票问题通用解法！（Python/Java/C++/Go/JS/Rust）","shi-pin-jiao-ni-yi-bu-bu-si-kao-dong-tai-kksg","2023-03-31T11:54:01.045636+00:00","188","买卖股票的最佳时机 IV","best-time-to-buy-and-sell-stock-iv",3654559374],"3654833214":["O(n^2) 计数 DP（Python/Java/C++/Go）","on2-ji-shu-dppythonjavacgo-by-endlessche-hmez","2023-05-18T14:49:35.500079+00:00","1079","活字印刷","letter-tile-possibilities",3654833214],"3655265099":["贪心 + 简洁写法（Python/Java/C++/Go/JS）","tan-xin-jian-ji-xie-fa-by-endlesscheng-uxbg","2022-02-19T16:10:40.762705+00:00","2178","拆分成最多数目的正偶数之和","maximum-split-of-positive-even-integers",3655265099],"3670981421":["【视频】彻底掌握直径 DP！从二叉树到一般树！（Python/Java/C++/Go）","shi-pin-che-di-zhang-wo-zhi-jing-dpcong-taqma","2023-04-14T11:11:04.045213+00:00","543","二叉树的直径","diameter-of-binary-tree",3670981421],"3672640831":["哈希表模拟","ha-xi-biao-mo-ni-by-endlesscheng-9a0w","2022-01-23T04:13:26.356143+00:00","2150","找出数组中的所有孤独数字","find-all-lonely-numbers-in-the-array",3672640831],"3674750599":["Go 模拟","go-mo-ni-by-endlesscheng-j42f","2021-09-04T16:08:10.753503+00:00","1992","找到所有的农场组","find-all-groups-of-farmland",3674750599],"3679518604":["按奇偶性分类贪心（Python/Java/C++/Go）","by-endlesscheng-lusx","2022-10-23T08:18:25.420447+00:00","2449","使数组相似的最少操作次数","minimum-number-of-operations-to-make-arrays-similar",3679518604],"3695292464":["一写就错？请看这！（Python/Java/C++/Go）","yi-xie-jiu-cuo-qing-kan-zhe-pythonjavacg-91vz","2023-02-02T06:43:14.865344+00:00","LCR 008","长度最小的子数组","2VG8Kg",3695292464],"3696757985":[" 贪心 + 排序","tan-xin-pai-xu-by-endlesscheng-dkq1","2022-02-05T16:18:25.775979+00:00","2160","拆分数位后四位数字的最小和","minimum-sum-of-four-digit-number-after-splitting-digits",3696757985],"3697179042":["排序+单调栈上二分（Python/Java/C++/Go/JS/Rust）","pai-xu-dan-diao-zhan-shang-er-fen-by-end-of9h","2023-06-11T09:20:48.720107+00:00","2736","最大和查询","maximum-sum-queries",3697179042],"3698071341":["枚举旋转次数","mei-ju-xuan-zhuan-ci-shu-by-endlesscheng-xue9","2021-06-06T04:34:49.779369+00:00","1886","判断矩阵经轮转后是否一致","determine-whether-matrix-can-be-obtained-by-rotation",3698071341],"3707233513":["打表做法，枚举回文数","da-biao-zuo-fa-by-endlesscheng-7ojf","2021-11-21T04:06:57.759584+00:00","2081","k 镜像数字的和","sum-of-k-mirror-numbers",3707233513],"3709286362":["下标总算错？请看这！","xia-biao-zong-suan-cuo-qing-kan-zhe-by-e-jebq","2022-11-09T09:36:35.111502+00:00","713","乘积小于 K 的子数组","subarray-product-less-than-k",3709286362],"3713605524":["我的思考过程（Python/Java/C++/Go/JS）","pai-xu-pythonjavacgojs-by-endlesscheng-ptzl","2023-09-17T04:16:07.667313+00:00","2860","让所有学生保持开心的分组方法数","happy-students",3713605524],"3722557865":["简洁写法（Python 一行）","jian-ji-xie-fa-by-endlesscheng-ivjs","2022-06-26T04:21:23.665651+00:00","2319","判断矩阵是否是一个 X 矩阵","check-if-matrix-is-x-matrix",3722557865],"3729777530":["动态规划：从记忆化搜索到递推，再到空间优化","dong-tai-gui-hua-cong-ji-yi-hua-sou-suo-hxalb","2023-07-09T04:08:39.467139+00:00","2771","构造最长非递减子数组","longest-non-decreasing-subarray-from-two-arrays",3729777530],"3729897578":["枚举答案 + 利用同余性质优化至 O(1) 时间复杂度","mei-ju-da-an-by-endlesscheng-zh75","2022-06-19T04:28:15.832998+00:00","2310","个位数字为 K 的整数之和","sum-of-numbers-with-units-digit-k",3729897578],"3730047096":["贪心（Python/Java/C++/Go）","tan-xin-pythonjavacgo-by-endlesscheng-j58c","2023-12-24T01:32:32.680943+00:00","2973","树中每个节点放置的金币数目","find-number-of-coins-to-place-in-tree-nodes",3730047096],"3731391427":["从左往右遍历每个单词","cong-zuo-wang-you-bian-li-by-endlesschen-pct5","2022-05-15T08:57:35.816236+00:00","2273","移除字母异位词后的结果数组","find-resultant-array-after-removing-anagrams",3731391427],"3735372403":["没想明白？一张图秒懂！（Python/Java/C++/Go）","mei-xiang-ming-bai-yi-zhang-tu-miao-dong-a6r1","2023-02-24T14:35:17.016543+00:00","1247","交换字符使得字符串相同","minimum-swaps-to-make-strings-equal",3735372403],"3735555259":["换根 DP（Python/Java/C++/Go）","huan-gen-dppythonjavacgo-by-endlesscheng-ccwy","2023-03-04T16:13:27.019587+00:00","2581","统计可能的树根数目","count-number-of-possible-root-nodes",3735555259],"3735817636":["《2023 年度最简单题目》","python-yi-xing-by-endlesscheng-g7qn","2023-07-30T04:30:28.422286+00:00","2798","满足目标工作时长的员工数目","number-of-employees-who-met-the-target",3735817636],"3735818622":["按题意模拟即可（Python/Java/C++/Go）","an-ti-yi-mo-ni-ji-ke-by-endlesscheng-k819","2023-10-15T01:51:55.777676+00:00","2899","上一个遍历的整数","last-visited-integers",3735818622],"3736843920":["排序 + 双指针","pai-xu-shuang-zhi-zhen-by-endlesscheng-h54k","2022-09-17T23:55:00.226447+00:00","2410","运动员和训练师的最大匹配数","maximum-matching-of-players-with-trainers",3736843920],"3738097801":["滑动窗口","hua-dong-chuang-kou-by-endlesscheng-m0gm","2022-11-06T04:06:47.226378+00:00","2461","长度为 K 子数组中的最大和","maximum-sum-of-distinct-subarrays-with-length-k",3738097801],"3738671880":["简洁写法，利用二叉搜索树的性质（Python/Java/C++/Go/JS/Rust）","jian-ji-xie-fa-li-yong-er-cha-sou-suo-sh-r5zm","2023-12-04T00:46:57.220273+00:00","1038","从二叉搜索树到更大和树","binary-search-tree-to-greater-sum-tree",3738671880],"3740959852":["合并区间的两种写法（Python/Java/C++/Go）","he-bing-qu-jian-pythonjavacgo-by-endless-yxhw","2023-12-10T04:07:23.381360+00:00","2963","统计好分割方案的数目","count-the-number-of-good-partitions",3740959852],"374180471":["等价转换 + 贪心（Python/Java/C++/Go）","by-endlesscheng-5qmk","2022-07-09T23:05:14.252820+00:00","2333","最小差值平方和","minimum-sum-of-squared-difference",374180471],"3742724136":["两种 DP 做法：倒序填表 / 正序刷表（Python/Java/C++/Go）","dao-xu-dp-by-endlesscheng-2qkc","2022-01-16T04:07:14.635168+00:00","2140","解决智力问题","solving-questions-with-brainpower",3742724136],"374282350":["正难则反","zheng-nan-ze-fan-by-endlesscheng-t7ag","2023-01-29T04:07:34.865110+00:00","2550","猴子碰撞的方法数","count-collisions-of-monkeys-on-a-polygon",374282350],"3743671260":["简洁写法，利用二叉搜索树的性质（Python/Java/C++/Go/JS/Rust）","jian-ji-xie-fa-li-yong-er-cha-sou-suo-sh-lz3i","2023-12-04T00:50:40.251907+00:00","538","把二叉搜索树转换为累加树","convert-bst-to-greater-tree",3743671260],"3754756357":["反转链表+两数相加=秒杀！（Python/Java/C++/Go/JS）","fan-zhuan-lian-biao-liang-shu-xiang-jia-okw6q","2023-07-03T00:03:43.031887+00:00","445","两数相加 II","add-two-numbers-ii",3754756357],"3754993583":["从 O(50^3) 到 O(50^2)","cong-o503-dao-o502-by-endlesscheng-5wp4","2023-05-28T09:57:01.125849+00:00","2711","对角线上不同值的数量差","difference-of-number-of-distinct-values-on-diagonals",3754993583],"3756156206":["思维题 + 分类讨论（Python/Java/C++/Go）","li-yong-nums10-tan-xin-zhao-bu-deng-yu-z-amvw","2022-12-11T00:57:35.567617+00:00","2499","让数组不相等的最小总代价","minimum-total-cost-to-make-arrays-unequal",3756156206],"375721237":["树形 DP","shu-xing-dp-by-endlesscheng-isuo","2022-09-24T14:32:08.294575+00:00","LCP 64","二叉树灯饰","U7WvvU",375721237],"3757271328":["两种 BFS 写法：双数组/队列（Python/Java/C++/Go/JS）","liang-chong-bfs-xie-fa-shuang-shu-zu-dui-a4hd","2024-02-17T00:08:59.975546+00:00","429","N 叉树的层序遍历","n-ary-tree-level-order-traversal",3757271328],"3761575610":["模拟 + 计算区间交集","by-endlesscheng-3r0d","2022-09-18T01:06:05.616744+00:00","2409","统计共同度过的日子数","count-days-spent-together",3761575610],"3766200583":["问题转换+GCD+具体构造方法（Python/Java/C++/Go）","wen-ti-zhuan-huan-gcdju-ti-gou-zao-fang-0plx0","2023-01-22T07:55:35.584916+00:00","2543","判断一个点是否可以到达","check-if-point-is-reachable",3766200583],"3778120928":["按题意模拟（Python/Java/C++/Go）","an-ti-yi-mo-ni-pythonjavacgo-by-endlessc-zq6e","2024-02-04T01:31:54.732077+00:00","3024","三角形类型","type-of-triangle",3778120928],"3778209816":["两次遍历","by-endlesscheng-nufi","2022-05-15T11:45:19.065316+00:00","2270","分割数组的方案数","number-of-ways-to-split-array",3778209816],"3779169819":["O(n) 一次遍历（Python/Java/C++/Go）","by-endlesscheng-jjtb","2022-10-16T04:07:31.964483+00:00","2441","与对应负数同时存在的最大正整数","largest-positive-integer-that-exists-with-its-negative",3779169819],"3786781582":["贡献法：讨论每个元素在答案中的出现次数","tao-lun-mei-ge-yuan-su-zai-da-an-zhong-d-uutg","2022-10-01T23:41:54.673541+00:00","2425","所有数对的异或和","bitwise-xor-of-all-pairings",3786781582],"3789355498":["枚举所有三位数偶数","mei-ju-suo-you-san-wei-shu-ou-shu-by-end-8n7d","2021-12-05T04:07:10.096097+00:00","2094","找出 3 位偶数","finding-3-digit-even-numbers",3789355498],"3791950406":["四种写法：DFS+哈希表/双数组/单数组（Python/Java/C++/Go）","si-chong-xie-fa-dfsha-xi-biao-shuang-shu-tg6q","2024-02-13T00:35:15.813178+00:00","987","二叉树的垂序遍历","vertical-order-traversal-of-a-binary-tree",3791950406],"3800630907":["库函数写法（Python/Java/C++/Go）","mo-ni-by-endlesscheng-b2sg","2022-12-11T01:03:34.667629+00:00","2496","数组中字符串的最大值","maximum-value-of-a-string-in-an-array",3800630907],"3801430886":["倒序滑动窗口 + O(1) 额外空间","dao-xu-hua-dong-chuang-kou-o1-kong-jian-xpgkp","2022-01-30T05:03:02.253655+00:00","2156","查找给定哈希值的子串","find-substring-with-given-hash-value",3801430886],"3802076349":["三种写法：分组 + 枚举首字母（Python/Java/C++/Go）","by-endlesscheng-ruz8","2022-06-12T04:19:58.259499+00:00","2306","公司命名","naming-a-company",3802076349],"3802833057":["考虑引力和的变化量（Python/Java/C++/Go）","by-endlesscheng-g405","2022-05-01T04:06:00.522127+00:00","2262","字符串的总引力","total-appeal-of-a-string",3802833057],"3803787289":["等价转换 + 后缀和优化（Python/Java/C++/Go）","deng-jie-zhuan-huan-pythonjavacgo-by-end-2qzs","2022-07-24T04:09:04.362336+00:00","2354","优质数对的数目","number-of-excellent-pairs",3803787289],"3806017410":["二分答案 + 贪心，附题单（Python/Java/C++/Go）","er-fen-da-an-tan-xin-by-endlesscheng-dlxv","2023-04-09T04:14:13.570270+00:00","2616","最小化数对的最大差值","minimize-the-maximum-difference-of-pairs",3806017410],"3813795330":["Go 库函数+特判","go-ku-han-shu-da-fa-by-endlesscheng-lxnp","2021-11-14T15:01:20.764619+00:00","468","验证IP地址","validate-ip-address",3813795330],"3814673758":["三种算法：从暴力到优化（Python/Java/C++/Go）","san-chong-suan-fa-cong-bao-li-dao-you-hu-nmtq","2023-05-10T15:05:09.519486+00:00","1016","子串能表示从 1 到 N 数字的二进制串","binary-string-with-substrings-representing-1-to-n",3814673758],"3820908739":["简洁写法：一次遍历+O(1) 空间（Python/Java/C++/Go/JS/Rust）","jian-ji-xie-fa-pythonjavacgo-by-endlessc-gag2","2022-10-16T04:06:23.987161+00:00","2444","统计定界子数组的数目","count-subarrays-with-fixed-bounds",3820908739],"3821666194":["枚举卖出价格，维护买入的最小值（Python/Java/C++/Go/JS/Rust）","mei-ju-mai-chu-jie-ge-wei-hu-mai-ru-de-z-02ud","2023-10-01T01:16:52.641096+00:00","121","买卖股票的最佳时机","best-time-to-buy-and-sell-stock",3821666194],"3822669184":["动态规划的典型思考策略（Python/Java/C++/Go）","by-endlesscheng-pa3v","2022-03-20T01:23:31.362946+00:00","2209","用地毯覆盖后的最少白色砖块","minimum-white-tiles-after-covering-with-carpets",3822669184],"3828565221":["【视频讲解】前后指针（Python/Java/C++/Go/JS）","shi-pin-jiang-jie-qian-hou-zhi-zhen-pyth-xptk","2023-08-04T07:24:44.414063+00:00","LCR 140","训练计划 II","lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof",3828565221],"3830405744":["Go 模拟","go-mo-ni-by-endlesscheng-tv8c","2022-01-16T04:11:18.022824+00:00","2138","将字符串拆分为若干长度为 k 的组","divide-a-string-into-groups-of-size-k",3830405744],"3830794143":["6 种语言 API 应用（Python/Java/C++/Go/JS/Rust）","6-chong-yu-yan-api-ying-yong-pythonjavac-k3ae","2023-11-26T11:05:18.353319+00:00","2942","查找包含给定字符的单词","find-words-containing-character",3830794143],"3835566276":["暴力枚举","bao-li-mei-ju-by-endlesscheng-p7b4","2022-10-16T04:06:47.865388+00:00","2443","反转之后的数字和","sum-of-number-and-its-reverse",3835566276],"3836897087":["两种写法：用字符串/不用字符串（Python/Java/C++/Go）","liang-chong-xie-fa-yong-zi-fu-chuan-bu-y-qwh8","2024-02-18T04:57:15.198678+00:00","3043","最长公共前缀的长度","find-the-length-of-the-longest-common-prefix",3836897087],"3843288760":["Go 一行","go-yi-xing-by-endlesscheng-61aw","2021-09-29T23:36:38.597166+00:00","405","数字转换为十六进制数","convert-a-number-to-hexadecimal",3843288760],"3849697077":["Go 模拟","go-mo-ni-by-endlesscheng-f551","2021-10-31T05:26:45.512083+00:00","2057","值相等的最小索引","smallest-index-with-equal-value",3849697077],"3851133364":["不会化简？请看这！（Python/Java/C++/Go）","bu-hui-hua-jian-qing-kan-zhe-pythonjavac-c2s6","2023-05-11T14:47:53.906667+00:00","1330","翻转子数组得到最大的数组值","reverse-subarray-to-maximize-array-value",3851133364],"3851205548":["BFS+排序/快速选择（Python/Java/C++/Go/JS/Rust）","bfspai-xu-kuai-su-xuan-ze-pythonjavacgoj-kl5c","2024-02-23T00:04:44.852492+00:00","2583","二叉树中的第 K 大层和","kth-largest-sum-in-a-binary-tree",3851205548],"385203255":["【模板】内向基环树，附题单（Python/Java/C++/Go）","nei-xiang-ji-huan-shu-pythonjavacgo-by-e-zrzh","2023-10-01T04:09:38.344886+00:00","2876","有向图访问计数","count-visited-nodes-in-a-directed-graph",385203255],"3867293007":["记忆化搜索","by-endlesscheng-6yvy","2022-09-04T04:14:08.539828+00:00","2400","恰好移动 k 步到达某一位置的方法数目","number-of-ways-to-reach-a-position-after-exactly-k-steps",3867293007],"3871311053":["O(n) 双指针写法","on-shuang-zhi-zhen-xie-fa-by-endlesschen-6dkt","2021-11-07T04:07:10.649971+00:00","2062","统计字符串中的元音子字符串","count-vowel-substrings-of-a-string",3871311053],"3874484865":["从递归到递推，教你一步步思考动态规划！（附题单）","cong-di-gui-dao-di-tui-jiao-ni-yi-bu-bu-2cwkb","2023-07-13T00:23:31.698182+00:00","931","下降路径最小和","minimum-falling-path-sum",3874484865],"3876397144":["寻找全为 0 的列（Python/Java/C++/Go）","jian-ji-xie-fa-by-endlesscheng-wry2","2023-11-05T04:26:53.085236+00:00","2923","找到冠军 I","find-champion-i",3876397144],"3880011182":["暴力枚举，简洁写法（Python/Java/C++/Go）","bao-li-mei-ju-xpythonjavacgo-by-endlessc-hdmc","2024-01-28T05:12:34.477568+00:00","3020","子集中元素的最大数量","find-the-maximum-number-of-elements-in-subset",3880011182],"3891355877":["线性做法：哈希表+位运算","xian-xing-zuo-fa-ha-xi-biao-wei-yun-suan-lii4","2022-12-18T04:07:59.405768+00:00","2506","统计相似字符串对的数目","count-pairs-of-similar-strings",3891355877],"3898582486":["贪心及其证明（Python/Java/C++/Go）","by-endlesscheng-diiq","2022-07-23T23:17:45.750361+00:00","2350","不可能得到的最短骰子序列","shortest-impossible-sequence-of-rolls",3898582486],"389978318":["O(1) 空间写法","o1-kong-jian-xie-fa-by-endlesscheng-ji12","2022-11-06T04:07:05.356483+00:00","2460","对数组执行操作","apply-operations-to-an-array",389978318],"3900992255":["可以转换成第一类斯特林数的理由","zhuan-huan-cheng-di-yi-lei-si-te-lin-shu-2y1k","2021-05-16T04:51:13.960237+00:00","1866","恰有 K 根木棍可以看到的排列数目","number-of-ways-to-rearrange-sticks-with-k-sticks-visible",3900992255],"3907062892":["线段树二分（Python/Java/C++/Go）","by-endlesscheng-okcu","2022-05-28T23:21:46.976837+00:00","2286","以组为单位订音乐会的门票","booking-concert-tickets-in-groups",3907062892],"3907541820":["哈希表套平衡树 / 懒删除堆（Python/Java/C++/Go）","ha-xi-biao-tao-ping-heng-shu-by-endlessc-hzct","2022-07-24T04:10:32.708944+00:00","2353","设计食物评分系统","design-a-food-rating-system",3907541820],"3909203570":["状态压缩+两数异或（Python/Java/C++/Go）","yong-wei-yun-suan-chu-li-by-endlesscheng-n9ws","2023-07-23T04:17:34.488376+00:00","2791","树中可以形成回文的路径数","count-paths-that-can-form-a-palindrome-in-a-tree",3909203570],"3911303073":["两种做法：递归 / 迭代（Python/Java/C++/Go）","di-gui-jian-ji-xie-fa-by-endlesscheng-jfwi","2022-11-27T04:15:33.345262+00:00","2487","从链表中移除节点","remove-nodes-from-linked-list",3911303073],"3911640069":["Go 简洁写法，附详细注释","go-mo-ni-fu-xiang-xi-zhu-shi-by-endlessc-wqyc","2021-10-24T04:06:08.769738+00:00","2047","句子中的有效单词数","number-of-valid-words-in-a-sentence",3911640069],"3920920642":["各种语言的库函数写法（Python/Java/C++/Go/JS）","ge-chong-yu-yan-de-ku-han-shu-xie-fa-pyt-w29z","2023-12-30T00:27:32.602938+00:00","1185","一周中的第几天","day-of-the-week",3920920642],"3922635563":["每组恰好选一个的分组背包 + 常数优化至 40ms","fen-zu-bei-bao-by-endlesscheng-fret","2021-08-22T04:15:41.679830+00:00","1981","最小化目标值与所选元素的差","minimize-the-difference-between-target-and-chosen-elements",3922635563],"3926333474":["Go DFS+哈希表","go-dfsha-xi-biao-by-endlesscheng-lqli","2021-09-25T10:05:46.084484+00:00","LCP 44","开幕式焰火","sZ59z6",3926333474],"3926884655":["Go 简洁写法","go-jian-ji-xie-fa-by-endlesscheng-92b4","2021-07-18T04:09:46.461909+00:00","1935","可以输入的最大单词数","maximum-number-of-words-you-can-type",3926884655],"3929135553":["拓扑排序+动态规划（Python/Java/C++/Go/JS）","tuo-bu-pai-xu-dong-tai-gui-hua-by-endles-dph6","2021-10-24T04:07:15.278330+00:00","2050","并行课程 III","parallel-courses-iii",3929135553],"3930025215":["动态规划（Python/Java/C++/Go）","dong-tai-gui-hua-pythonjavacgo-by-endles-94wq","2022-10-09T04:21:22.209975+00:00","2435","矩阵中和能被 K 整除的路径","paths-in-matrix-whose-sum-is-divisible-by-k",3930025215],"3935523633":["单调栈的本质：及时去掉无用数据（Python/Java/C++/Go/JS/Rust）","dan-diao-zhan-de-ben-zhi-ji-shi-qu-diao-8tp3s","2024-01-05T00:10:44.425648+00:00","1944","队列中可以看到的人数","number-of-visible-people-in-a-queue",3935523633],"3936988451":["不在 edges[i][1] 中的唯一编号（Python/Java/C++/Go）","bu-zai-edgesi1-zhong-de-wei-yi-bian-hao-44ur6","2023-11-05T04:29:56.714618+00:00","2924","找到冠军 II","find-champion-ii",3936988451],"3939185799":["两种方法：枚举全排列 / 最小费用最大流（Python/Java/C++/Go/JS）","tong-yong-zuo-fa-zui-xiao-fei-yong-zui-d-iuw8","2023-09-10T04:08:19.521461+00:00","2850","将石头分散到网格图的最少移动次数","minimum-moves-to-spread-stones-over-grid",3939185799],"3943793700":["从 0 到 1 的 0-1 BFS（Python/Java/C++/Go）","cong-0-dao-1-de-0-1-bfspythonjavacgo-by-1m8z4","2023-01-20T23:37:49.488486+00:00","1824","最少侧跳次数","minimum-sideway-jumps",3943793700],"3944079582":["如何想出状态定义和状态转移方程？一个视频学会！（Python/Java/C++/Go/JS）","ru-he-xiang-chu-zhuang-tai-ding-yi-he-zh-1wt1","2023-02-09T13:40:32.818428+00:00","198","打家劫舍","house-robber",3944079582],"3946751496":["按模 space 的结果分组","a-by-endlesscheng-own9","2022-10-30T00:17:58.119655+00:00","2453","摧毁一系列目标","destroy-sequential-targets",3946751496],"3947635653":["在前缀和上倒序 DP","zai-qian-zhui-he-shang-dao-xu-dp-by-endl-jxqs","2021-05-23T04:06:17.640223+00:00","1872","石子游戏 VIII","stone-game-viii",3947635653],"3953077425":["前缀和优化 DP","qian-zhui-he-you-hua-dp-by-endlesscheng-j10b","2021-09-05T04:05:57.111173+00:00","1997","访问完所有房间的第一天","first-day-where-you-have-been-in-all-the-rooms",3953077425],"3953865894":["动态规划：考虑相邻元素的大小关系（Python/Java/C++/Go）","dong-tai-gui-hua-kao-lu-xiang-lin-yuan-s-ni0p","2022-10-09T23:22:08.960454+00:00","801","使序列递增的最小交换次数","minimum-swaps-to-make-sequences-increasing",3953865894],"3957965518":["分层 BFS 的同时排序（Python/Java/C++/Go）","fen-ceng-bfs-de-tong-shi-pai-xu-by-endle-ash6","2022-01-22T16:11:51.168085+00:00","2146","价格范围内最高排名的 K 样物品","k-highest-ranked-items-within-a-price-range",3957965518],"3960620247":["模拟","mo-ni-by-endlesscheng-li9j","2022-07-23T23:21:28.510009+00:00","2347","最好的扑克手牌","best-poker-hand",3960620247],"3965390038":["教你一步步思考动态规划！一个视频讲透！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-kmrs","2023-02-23T01:45:46.907074+00:00","LCR 103","零钱兑换","gaM7Ch",3965390038],"3967032436":["时空复杂度均为 O(1) 的写法（外圈模拟器）","go-mo-ni-by-endlesscheng-exyr","2021-11-14T00:20:57.598798+00:00","2069","模拟行走机器人 II","walking-robot-simulation-ii",3967032436],"3968538235":["Go 爆搜","go-bao-sou-by-endlesscheng-ivn0","2021-09-12T04:07:23.642230+00:00","2002","两个回文子序列长度的最大乘积","maximum-product-of-the-length-of-two-palindromic-subsequences",3968538235],"3969212159":["贡献法（Python/Java/C++/Go/JS）","gong-xian-fa-pythonjavacgo-by-endlessche-d4jx","2023-05-13T16:11:40.737280+00:00","2681","英雄的力量","power-of-heroes",3969212159],"3971252642":["滑动窗口+暴力枚举（Python/Java/C++/Go）","hua-dong-chuang-kou-bao-li-mei-ju-by-end-9mvl","2023-04-23T04:16:27.873583+00:00","2653","滑动子数组的美丽值","sliding-subarray-beauty",3971252642],"3971324453":["真•梦开始的地方（Python/Java/C++/Go/JS）","zhen-meng-kai-shi-de-di-fang-by-endlessc-rwxa","2022-04-18T04:48:25.795769+00:00","2235","两整数相加","add-two-integers",3971324453],"3973047784":["极简写法：调用自身","jijian-by-endlesscheng-4oqo","2022-10-07T11:14:39.559916+00:00","LCP 67","装饰树","KnLfVT",3973047784],"3973609032":["从三维到二维（Python/Java/C++/Go）","by-endlesscheng-tgkn","2022-06-25T23:49:44.218792+00:00","2318","不同骰子序列的数目","number-of-distinct-roll-sequences",3973609032],"3974822873":["【图解】没有思路？一张图秒懂！（Python/Java/C++/Go）","tu-jie-mei-you-si-lu-yi-zhang-tu-miao-do-3lli","2023-04-25T13:23:06.123408+00:00","1031","两个非重叠子数组的最大和","maximum-sum-of-two-non-overlapping-subarrays",3974822873],"3978152897":["模拟 + 简洁写法","mo-ni-by-endlesscheng-oiuw","2022-08-06T23:36:23.729755+00:00","2365","任务调度器 II","task-scheduler-ii",3978152897],"3978864326":["两种做法：排序 / 哈希表","pai-xu-hou-zui-xiao-zui-da-pi-pei-by-end-7sta","2022-12-04T04:07:48.841105+00:00","2491","划分技能点相等的团队","divide-players-into-teams-of-equal-skill",3978864326],"3981013694":["两种做法：直接排序 / 离线+增量排序（Python/Java/C++/Go）","pai-xu-by-endlesscheng-ylft","2022-07-17T04:09:54.852699+00:00","2343","裁剪数字后查询第 K 小的数字","query-kth-smallest-trimmed-number",3981013694],"3985813844":["前序中序后序，三种方法，一个视频讲透！（Python/Java/C++/Go）","qian-xu-zhong-xu-hou-xu-san-chong-fang-f-90zr","2022-12-15T02:43:03.483651+00:00","面试题 04.05","合法二叉搜索树","legal-binary-search-tree-lcci",3985813844],"3989118459":["两种方法：枚举 j / 枚举 k（Python/Java/C++/Go）","mei-ju-jzhao-qian-hou-zui-da-zhi-pythonj-um8q","2023-10-01T04:10:41.636720+00:00","2874","有序三元组中的最大值 II","maximum-value-of-an-ordered-triplet-ii",3989118459],"399050701":["Go 模拟","go-mo-ni-by-endlesscheng-fcue","2022-06-05T04:25:36.163812+00:00","2293","极大极小游戏","min-max-game",399050701],"3990558875":["判断满足要求的三元组各部分是否出现过","pan-duan-man-zu-yao-qiu-de-san-yuan-zu-g-dnom","2021-06-13T04:11:16.299054+00:00","1899","合并若干三元组以形成目标三元组","merge-triplets-to-form-target-triplet",3990558875],"4000844273":["动态规划：从记忆化搜索到递推","dong-tai-gui-hua-cong-ji-yi-hua-sou-suo-2ptkg","2023-07-09T04:09:25.746632+00:00","2770","达到末尾下标所需的最大跳跃次数","maximum-number-of-jumps-to-reach-the-last-index",4000844273],"4006089601":["Go 最小圆覆盖 Welzl 算法","go-zui-xiao-yuan-fu-gai-welzl-suan-fa-by-v6yz","2021-12-06T02:23:44.043587+00:00","1924","安装栅栏 II","erect-the-fence-ii",4006089601],"4006408746":["两种算法：暴力替换/栈（Python/Java/C++/Go）","liang-chong-suan-fa-bao-li-ti-huan-zhan-vto0o","2023-05-21T10:49:03.811642+00:00","2696","删除子串后的字符串最小长度","minimum-string-length-after-removing-substrings",4006408746],"4007529944":["模拟","mo-ni-by-endlesscheng-lnia","2022-04-16T16:11:27.844079+00:00","2241","设计一个 ATM 机器","design-an-atm-machine",4007529944],"4011399863":["【视频讲解】用归纳法证明（Python/Java/C++/Go/JS/Rust）","yong-gui-na-fa-zheng-ming-pythonjavacgo-mvyu1","2023-12-03T05:03:11.761935+00:00","330","按要求补齐数组","patching-array",4011399863],"4014976365":["按照题意模拟 + O(1) 额外空间（Python/Java/C++/Go）","an-zhao-ti-yi-mo-ni-o1-e-wai-kong-jian-b-5oqd","2022-01-22T16:13:24.261381+00:00","2147","分隔长廊的方案数","number-of-ways-to-divide-a-long-corridor",4014976365],"4020009242":["带你发明树状数组！附数学证明（Python/Java/C++/Go/JS/Rust）","dai-ni-fa-ming-shu-zhuang-shu-zu-fu-shu-lyfll","2023-11-13T00:14:39.086691+00:00","307","区域和检索 - 数组可修改","range-sum-query-mutable",4020009242],"4022402413":["常用编程技巧（Python/Java/C++/Go）","python-yi-xing-by-endlesscheng-xnvy","2022-09-25T04:18:44.138770+00:00","2418","按身高排序","sort-the-people",4022402413],"4024970253":["一次遍历 + 常数空间","go-mo-ni-bian-li-lian-biao-bian-li-lin-j-rx9s","2021-10-31T05:33:33.303236+00:00","2058","找出临界点之间的最小和最大距离","find-the-minimum-and-maximum-number-of-nodes-between-critical-points",4024970253],"4027356240":["计数（木桶原理）","tan-xin-by-endlesscheng-99t7","2022-05-29T06:16:32.905274+00:00","2287","重排字符形成目标字符串","rearrange-characters-to-make-target-string",4027356240],"4034022024":["排序+分组循环（Python/Java/C++/Go）","pai-xu-fen-zu-xun-huan-pythonjavacgo-by-pbfey","2023-11-26T10:06:01.562313+00:00","2948","交换得到字典序最小的数组","make-lexicographically-smallest-array-by-swapping-elements",4034022024],"4043172905":["【视频】本题最简单写法！（Python/Java/C++/Go/JS/Rust）","shi-pin-fen-lei-tao-lun-luan-ru-ma-yi-ge-dmyx","2023-04-15T08:12:07.089086+00:00","LCR 194","二叉树的最近公共祖先","er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof",4043172905],"4043601244":["合并区间+方案数（Python/Java/C++/Go）","tiao-yue-you-xi-bian-xing-by-endlesschen-hatn","2023-03-04T16:14:14.533140+00:00","2580","统计将重叠区间合并成组的方案数","count-ways-to-group-overlapping-ranges",4043601244],"4050014828":["0-1 BFS（Python/Java/C++/Go）","0-1-bfs-by-endlesscheng-4pjt","2022-05-29T06:08:08.582927+00:00","2290","到达角落需要移除障碍物的最小数目","minimum-obstacle-removal-to-reach-corner",4050014828],"4058134239":["两种做法：正序（利用特殊条件） or 逆序（更加通用）","naojin-by-endlesscheng-aq0n","2022-06-05T04:20:14.186066+00:00","2295","替换数组中的元素","replace-elements-in-an-array",4058134239],"40615146":["Go 库函数二分","go-ku-han-shu-er-fen-by-endlesscheng-dl6a","2021-12-08T03:06:10.981543+00:00","1095","山脉数组中查找目标值","find-in-mountain-array",40615146],"4062228386":["O(n) 一次遍历","on-yi-ci-bian-li-by-endlesscheng-rdpp","2023-07-23T01:00:58.134588+00:00","2784","检查数组是否是好的","check-if-array-is-good",4062228386],"4062961912":["两种写法：离线询问 + 并查集 / 最小堆（Python/Java/C++/Go）","by-endlesscheng-qeei","2022-12-11T04:07:23.571796+00:00","2503","矩阵查询可获得的最大分数","maximum-number-of-points-from-grid-queries",4062961912],"4063277289":["0ms 最强剪枝","0ms-zui-qiang-jian-zhi-by-endlesscheng-1beq","2022-04-24T01:37:17.117401+00:00","LCP 58","积木拼接","De4qBB",4063277289],"4064007490":["滑动窗口，简洁写法（Python/Java/C++/Go）","shuang-zhi-zhen-hua-chuang-pythonjavacgo-nurf","2023-06-11T01:58:38.437978+00:00","2730","找到最长的半重复子字符串","find-the-longest-semi-repetitive-substring",4064007490],"4065089853":["Go 模拟（避免运算中出现浮点数）","go-mo-ni-by-endlesscheng-ohnv","2022-06-12T04:39:06.701509+00:00","2303","计算应缴税款总额","calculate-amount-paid-in-taxes",4065089853],"4066429992":["O(n^2) 记忆化搜索到递推","on2-ji-yi-hua-sou-suo-dao-di-tui-by-endl-99lb","2023-07-09T01:07:17.031842+00:00","2767","将字符串分割为最少的美丽子字符串","partition-string-into-minimum-beautiful-substrings",4066429992],"4067072856":["排序 + 二分（Python/Java/C++/Go/JS/Rust）","by-endlesscheng-1kbp","2022-06-11T23:00:31.246427+00:00","2300","咒语和药水的成功对数","successful-pairs-of-spells-and-potions",4067072856],"4067624536":["回溯不会写？套路在此！精确计算搜索树的节点个数！（Python/Java/C++/Go）","hui-su-bu-hui-xie-tao-lu-zai-ci-jing-que-6hrh","2023-01-28T10:30:00.305183+00:00","46","全排列","permutations",4067624536],"4071175900":["二分","er-fen-by-endlesscheng-83jy","2021-05-09T04:09:14.409077+00:00","1855","下标对中的最大距离","maximum-distance-between-a-pair-of-values",4071175900],"4082307471":["二分查找总是写不对？一个视频讲透！（Python/Java/C++/Go/JS）","er-fen-cha-zhao-zong-shi-xie-bu-dui-yi-g-nq23","2022-12-17T00:26:06.258717+00:00","35","搜索插入位置","search-insert-position",4082307471],"4083216410":["两种方法：O(1) 公式 / 记忆化搜索（Python/Java/C++/Go）","liang-chong-fang-fa-o1-gong-shi-ji-yi-hu-7fdi","2023-06-25T01:00:28.839524+00:00","2745","构造最长的新字符串","construct-the-longest-new-string",4083216410],"4088708677":["哈希表 + 建树 + 找根","jian-tu-dfs-by-endlesscheng-vl17","2022-03-06T04:09:04.278714+00:00","2196","根据描述创建二叉树","create-binary-tree-from-descriptions",4088708677],"4089321877":["逆向思维（Python/Java/C++/Go）","by-endlesscheng-sm8h","2022-04-03T04:07:45.622277+00:00","2227","加密解密字符串","encrypt-and-decrypt-strings",4089321877],"4092227797":["DFS + 哈希表","by-endlesscheng-fg6o","2022-08-07T04:07:17.768249+00:00","2368","受限条件下可到达节点的数目","reachable-nodes-with-restrictions",4092227797],"4095621901":["乘法原理：分别计算小时和分钟（Python/Java/C++/Go）","cheng-fa-yuan-li-fen-bie-ji-suan-xiao-sh-66d9","2022-10-15T23:33:54.896615+00:00","2437","有效时间的数目","number-of-valid-clock-times",4095621901],"4101129191":["按题意模拟","an-ti-yi-mo-ni-by-endlesscheng-ldwj","2023-03-19T04:09:00.279674+00:00","2596","检查骑士巡视方案","check-knight-tour-configuration",4101129191],"4108118731":["前后缀分解","qian-hou-zhui-fen-jie-by-endlesscheng-a47e","2022-04-30T16:43:01.937794+00:00","2256","最小平均差","minimum-average-difference",4108118731],"4113058721":["阅读理解（Python/Java/C++/Go）","mo-ni-by-endlesscheng-ka78","2022-10-09T04:27:31.385834+00:00","2432","处理用时最长的那个任务的员工","the-employee-that-worked-on-the-longest-task",4113058721],"4116532905":["两遍 DFS（Python/Java/C++/Go）","liang-bian-dfspythonjavacgo-by-endlessch-vvs4","2022-10-30T04:07:28.997922+00:00","2458","移除子树后的二叉树高度","height-of-binary-tree-after-subtree-removal-queries",4116532905],"4125612782":["分组循环","fen-zu-xun-huan-by-endlesscheng-f2i1","2021-05-23T04:29:07.835791+00:00","1869","哪种连续子字符串更长","longer-contiguous-segments-of-ones-than-zeros",4125612782],"4125791633":["简单 DFS（Python/Java/C++/Go/JS）","jian-dan-dfspythonjavacgojs-by-endlessch-ytdk","2024-02-19T00:56:20.972017+00:00","590","N 叉树的后序遍历","n-ary-tree-postorder-traversal",4125791633],"4130335825":["教你一步步思考动态规划！一个视频讲透！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-aj9f","2023-03-09T05:24:01.046248+00:00","LCR 102","目标和","YaVDxD",4130335825],"4130986647":["教你一次性把代码写对！O(n) 分组循环（Python/Java/C++/Go/JS/Rust）","jiao-ni-yi-ci-xing-ba-dai-ma-xie-dui-on-r57bz","2024-01-23T00:09:03.088763+00:00","2765","最长交替子数组","longest-alternating-subarray",4130986647],"4133950075":["Go 一行","go-yi-xing-by-endlesscheng-bzua","2021-10-19T01:17:43.603520+00:00","476","数字的补数","number-complement",4133950075],"4134643071":["【视频】教你一步步思考动态规划！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-uo5q","2023-02-25T11:48:31.589163+00:00","72","编辑距离","edit-distance",4134643071],"4136320759":["没想明白？一个动画秒懂！（Python/Java/C++/Go）","mei-xiang-ming-bai-yi-ge-dong-hua-miao-d-oich","2022-11-30T00:02:55.484502+00:00","895","最大频率栈","maximum-frequency-stack",4136320759],"4137220667":["O(1) 容斥原理（Python/Java/C++/Go）","o1-rong-chi-yuan-li-pythonjavacgo-by-end-smj5","2023-11-12T01:10:43.426261+00:00","2928","给小朋友们分糖果 I","distribute-candies-among-children-i",4137220667],"4154206580":["O(N) 后缀数组 / 后缀自动机","on-hou-zhui-shu-zu-by-endlesscheng-jo3p","2021-07-09T02:38:59.168906+00:00","1698","字符串的不同子字符串个数","number-of-distinct-substrings-in-a-string",4154206580],"4155641815":["三种贪心策略取最小值","san-chong-tan-xin-ce-lue-qu-zui-xiao-zhi-fhnn","2021-11-28T04:06:48.990564+00:00","2091","从数组中移除最大值和最小值","removing-minimum-and-maximum-from-array",4155641815],"4156461194":["Go 库函数模拟","go-ku-han-shu-mo-ni-by-endlesscheng-yryg","2022-01-08T16:15:49.888082+00:00","2129","将标题首字母大写","capitalize-the-title",4156461194],"4159210402":["分组循环","fen-zu-xun-huan-by-endlesscheng-ykhm","2021-12-19T04:07:24.748927+00:00","2110","股票平滑下跌阶段的数目","number-of-smooth-descent-periods-of-a-stock",4159210402],"4162714270":["两种做法：暴力枚举 / 利用 GCD 的性质","by-endlesscheng-1f1r","2022-10-23T08:28:36.260188+00:00","2447","最大公因数等于 K 的子数组数目","number-of-subarrays-with-gcd-equal-to-k",4162714270],"4169935304":["分类讨论+简洁写法（Python/Java/C++/Go）","fen-lei-tao-lun-jian-ji-xie-fa-pythonjav-aoa8","2024-01-07T04:38:28.564676+00:00","3001","捕获黑皇后需要的最少移动次数","minimum-moves-to-capture-the-queen",4169935304],"4175159080":["分类讨论+二分答案","fen-lei-tao-lun-er-fen-da-an-by-endlessc-nl81","2021-10-16T16:13:28.226630+00:00","2040","两个有序数组的第 K 小乘积","kth-smallest-product-of-two-sorted-arrays",4175159080],"4175827470":["本题最优解！线性时间+常数空间（Python/Java/C++/Go/JS）","ben-ti-zui-you-jie-xian-xing-shi-jian-ch-ddw3","2023-07-24T00:16:36.894654+00:00","771","宝石与石头","jewels-and-stones",4175827470],"4176664483":["简洁写法","jian-ji-xie-fa-by-endlesscheng-suo2","2023-10-12T10:53:13.272103+00:00","1430","判断给定的序列是否是二叉树从根到叶的路径","check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree",4176664483],"4183600583":["回溯不会写？套路在此！精确计算搜索树的节点个数！（Python/Java/C++/Go）","hui-su-bu-hui-xie-tao-lu-zai-ci-jing-que-f0sr","2023-02-01T11:52:47.364648+00:00","LCR 083","全排列","VvJkup",4183600583],"419099305":["两种做法：排序 + 贪心模拟 / 脑筋急转弯","pai-xu-tan-xin-mo-ni-by-endlesscheng-zq8m","2022-07-31T04:06:30.673444+00:00","2358","分组的最大数量","maximum-number-of-groups-entering-a-competition",419099305],"419265170":["回溯不会写？套路在此！（Python/Java/C++/Go）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-feme","2023-01-20T09:18:30.543807+00:00","216","组合总和 III","combination-sum-iii",419265170],"4193309664":["子序列自动机","zi-xu-lie-zi-dong-ji-by-endlesscheng-guks","2021-12-06T05:09:39.573741+00:00","727","最小窗口子序列","minimum-window-subsequence",4193309664],"4193739814":["记忆化搜索-\u003e递推-\u003e常数优化（Python/Java/C++/Go）","ji-yi-hua-sou-suo-di-tui-chang-shu-you-h-czvx","2023-04-21T14:12:42.550692+00:00","1027","最长等差数列","longest-arithmetic-subsequence",4193739814],"4197747162":["数位 DP 通用模板，附题单（Python/Java/C++/Go）","shu-wei-dp-mo-ban-by-endlesscheng-xtgx","2022-08-14T04:21:05.737032+00:00","2376","统计特殊整数","count-special-integers",4197747162],"419814877":["排序+去重+二分","on-zuo-fa-by-endlesscheng-l7yi","2021-09-18T16:10:24.968833+00:00","2009","使数组连续的最少操作数","minimum-number-of-operations-to-make-array-continuous",419814877],"4199077770":["告别特判！简洁写法！（Python/Java/C++/Go）","gao-bie-te-pan-jian-ji-xie-fa-pythonjava-ameq","2023-02-23T02:19:53.736817+00:00","LCR 090","打家劫舍 II","PzWKhm",4199077770],"421470137":["【图解】一张图秒懂 LRU！（Python/Java/C++/Go/JS/Rust）","tu-jie-yi-zhang-tu-miao-dong-lrupythonja-gk15","2023-12-12T14:15:04.576519+00:00","面试题 16.25","LRU 缓存","lru-cache-lcci",421470137],"4224854568":["两种方法：暴力枚举 / 记忆化搜索","by-endlesscheng-koht","2022-12-11T04:14:37.856098+00:00","2501","数组中最长的方波","longest-square-streak-in-an-array",4224854568],"4225343365":["动态规划 + 二分查找优化（Python/Java/C++/Go）","dong-tai-gui-hua-er-fen-cha-zhao-you-hua-zkcg","2022-10-21T23:37:25.367420+00:00","1235","规划兼职工作","maximum-profit-in-job-scheduling",4225343365],"4225876243":["简洁写法（Python/Java/C++/Go/JS/Rust）","jian-ji-xie-fa-pythonjavacgojsrust-by-en-i1rn","2024-01-06T00:13:00.417184+00:00","2807","在链表中插入最大公约数","insert-greatest-common-divisors-in-linked-list",4225876243],"4226664142":["如何想出状态定义和状态转移方程？一个视频学会！（Python/Java/C++/Go）","ru-he-xiang-chu-zhuang-tai-ding-yi-he-zh-8zrv","2023-02-11T05:05:09.097499+00:00","LCR 089","打家劫舍","Gu0c2T",4226664142],"4231944752":["区间 DP 的套路（Python/Java/C++/Go）","qu-jian-dp-de-tao-lu-pythonjavacgo-by-en-nynz","2024-02-18T01:15:13.051043+00:00","3040","相同分数的最大操作数目 II","maximum-number-of-operations-with-the-same-score-ii",4231944752],"4234423090":["哈希表做法：枚举前缀+后缀","ha-xi-biao-zuo-fa-by-endlesscheng-y2ci","2021-10-02T16:08:59.765885+00:00","2023","连接后等于目标字符串的字符串对","number-of-pairs-of-strings-with-concatenation-equal-to-target",4234423090],"4238290979":["Go 一行","yi-xing-by-endlesscheng-bnpb","2021-07-11T04:07:29.213639+00:00","1929","数组串联","concatenation-of-array",4238290979],"4239392469":["【视频】彻底掌握直径 DP！从二叉树到一般树！（Python/Java/C++/Go）","shi-pin-che-di-zhang-wo-zhi-jing-dpcong-524j4","2023-04-14T12:42:40.840405+00:00","687","最长同值路径","longest-univalue-path",4239392469],"4244339093":["分类讨论（Python/Java/C++/Go）","fen-lei-tao-lun-by-endlesscheng-jxg0","2023-12-31T04:39:53.764206+00:00","2983","回文串重新排列查询","palindrome-rearrangement-queries",4244339093],"4245137983":["爬楼梯换皮（Python/Java/C++/Go/JS）","by-endlesscheng-4j22","2022-11-13T00:44:42.696160+00:00","2466","统计构造好字符串的方案数","count-ways-to-build-good-strings",4245137983],"4247310156":["详细分析两次 Dijkstra（稠密图下是线性做法）","xiang-xi-fen-xi-liang-ci-dijkstrachou-mi-gv1m","2023-05-21T10:01:37.581786+00:00","2699","修改图中的边权","modify-graph-edge-weights",4247310156],"4252078571":["分类讨论+枚举","fen-lei-tao-lun-mei-ju-by-endlesscheng-89hq","2021-09-25T10:56:25.660028+00:00","LCP 48","无限棋局","fsa7oZ",4252078571],"4252220750":["贪心及其数学证明","tan-xin-ji-qi-shu-xue-zheng-ming-by-endl-uumv","2021-08-15T04:05:55.752939+00:00","1969","数组元素的最小非零乘积","minimum-non-zero-product-of-the-array-elements",4252220750],"4257560677":["枚举+视频讲解（Python/Java/C++/Go）","mei-ju-by-endlesscheng-gt7c","2022-11-13T01:10:00.085973+00:00","2468","根据限制分割消息","split-message-based-on-limit",4257560677],"4261327361":["O(1) 数学公式（Python/Java/C++/Go/JS）","o1-shu-xue-gong-shi-pythonjavacgo-by-end-xsxg","2023-08-27T04:12:03.270998+00:00","2834","找出美丽数组的最小和","find-the-minimum-possible-sum-of-a-beautiful-array",4261327361],"4272085250":["【图解】一张图秒懂！多种写法！（Python/Java/C++/Go/JS/Rust）","tu-jie-yi-zhang-tu-miao-dong-duo-chong-x-q095","2023-10-30T23:51:08.301821+00:00","2003","每棵子树内缺失的最小基因值","smallest-missing-genetic-value-in-each-subtree",4272085250],"4275078512":["【视频】如何灵活运用递归？让你对递归的理解更上一层楼！（Python/Java/C++/Go）","shi-pin-ru-he-ling-huo-yun-yong-di-gui-r-xjm2","2023-04-15T06:38:00.587799+00:00","LCR 145","判断对称二叉树","dui-cheng-de-er-cha-shu-lcof",4275078512],"4281929868":["横切和竖切是互相独立的（Python/Java/C++/Go/JS/Rust）","heng-qie-he-shu-qie-shi-hu-xiang-du-li-d-gywp","2023-10-27T00:11:59.984414+00:00","1465","切割后面积最大的蛋糕","maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts",4281929868],"4283669919":["模拟","mo-ni-by-endlesscheng-gxlp","2021-05-15T17:05:16.768364+00:00","1860","增长的内存泄露","incremental-memory-leak",4283669919],"4290150798":["【周赛常考】前后缀分解（Python/Java/C++/Go）","zhou-sai-chang-kao-qian-hou-zhui-fen-jie-21hr","2023-10-15T04:12:20.467280+00:00","2906","构造乘积矩阵","construct-product-matrix",4290150798],"4290496515":["状压 DP + 预处理合法状态及其合法转移","zhuang-ya-dp-yu-chu-li-he-fa-zhuang-tai-l927s","2021-07-11T04:09:58.690749+00:00","1931","用三种不同颜色为网格涂色","painting-a-grid-with-three-different-colors",4290496515],"4293743842":["一写就错？请看这！（Python/Java/C++/Go）","yi-xie-jiu-cuo-qing-kan-zhe-pythonjavacg-qtx2","2023-02-01T12:05:54.593230+00:00","LCR 009","乘积小于 K 的子数组","ZVAVXX",4293743842],"430788454":["只用到排序的做法","pai-xu-bian-li-by-endlesscheng-81er","2022-03-06T04:13:07.314794+00:00","2195","向数组中追加 K 个整数","append-k-integers-with-minimal-sum",430788454],"435938591":["栈模拟（Python/Java/C++/Go）","zhan-mo-ni-by-endlesscheng-fu26","2023-06-25T04:16:41.189757+00:00","2751","机器人碰撞","robot-collisions",435938591],"442815761":["O(n^2) 优雅枚举（Python/Java/C++/Go）","on2-you-ya-mei-ju-pythonjavacgo-by-endle-ii0q","2024-02-04T01:26:05.726020+00:00","3025","人员站位的方案数 I","find-the-number-of-ways-to-place-people-i",442815761],"443405892":["讲清楚为什么一开始要把 (i,0) 都入堆！附题单！","jiang-qing-chu-wei-shi-yao-yi-kai-shi-ya-i0dj","2023-05-27T15:17:31.006497+00:00","373","查找和最小的 K 对数字","find-k-pairs-with-smallest-sums",443405892],"446968474":["O(n) 单调队列，附题单！（Python/Java/C++/Go/JS）","on-dan-diao-dui-lie-fu-ti-dan-pythonjava-hhrr","2023-07-21T00:14:35.879259+00:00","1499","满足不等式的最大值","max-value-of-equation",446968474],"457953007":["差分写法","chai-fen-xie-fa-by-endlesscheng-kh8v","2021-06-12T16:15:02.361740+00:00","1893","检查是否区域内所有整数都被覆盖","check-if-all-the-integers-in-a-range-are-covered",457953007],"459732998":["有向图欧拉路径","you-xiang-tu-ou-la-lu-jing-by-endlessche-j2i3","2021-12-05T04:43:16.712372+00:00","2097","合法重新排列数对","valid-arrangement-of-pairs",459732998],"462875391":["反悔贪心（Python/Java/C++/Go）","fan-hui-tan-xin-pythonjavacgo-by-endless-v2w1","2023-08-06T04:10:28.315310+00:00","2813","子序列最大优雅度","maximum-elegance-of-a-k-length-subsequence",462875391],"463765609":["贪心：O(n) 一次遍历 + O(1) 额外空间","tan-xin-on-yi-ci-bian-li-o1-kong-jian-by-hshg","2021-11-27T16:07:16.163013+00:00","2086","从房屋收集雨水需要的最少水桶数","minimum-number-of-food-buckets-to-feed-the-hamsters",463765609],"468110":["排序+贪心","pai-xu-tan-xin-by-endlesscheng-vv35","2021-10-16T16:08:19.507105+00:00","2037","使每位学生都有座位的最少移动次数","minimum-number-of-moves-to-seat-everyone",468110],"469490796":["计算 010 和 101 的出现次数","mei-ju-by-endlesscheng-xp5r","2022-04-02T16:15:01.217086+00:00","2222","选择建筑的方案数","number-of-ways-to-select-buildings",469490796],"480223586":["前后缀分解 + O(1) 空间","qian-hou-zhui-fen-jie-o1-kong-jian-by-en-c2m5","2022-11-27T01:02:27.258982+00:00","2483","商店的最少代价","minimum-penalty-for-a-shop",480223586],"482822055":["Go 差分数组+排序+位运算压缩状态","go-chai-fen-shu-zu-pai-xu-wei-yun-suan-y-4ydd","2021-12-06T02:41:04.865173+00:00","2021","街上最亮的位置","brightest-position-on-street",482822055],"484484283":["一次遍历（Python/Java/C++/Go）","ha-xi-biao-tong-ji-by-endlesscheng-lfuh","2022-09-11T04:12:45.138585+00:00","2404","出现最频繁的偶数元素","most-frequent-even-element",484484283],"484559816":["简单 DFS（Python/Java/C++/Go/JS）","jian-dan-dfspythonjavacgojsrust-by-endle-0sf4","2024-02-17T23:49:37.038083+00:00","589","N 叉树的前序遍历","n-ary-tree-preorder-traversal",484559816],"485006616":["枚举+简洁写法+视频讲解（Python/Java/C++/Go）","mei-ju-jian-ji-xie-fa-by-endlesscheng-tjpp","2023-01-08T04:44:17.728655+00:00","2531","使字符串中不同字符的数目相等","make-number-of-distinct-characters-equal",485006616],"486718067":["两种方法：0-1 trie+滑窗 / 哈希表（Python/Java/C++/Go）","0-1-trie-hua-dong-chuang-kou-pythonjavac-gvv2","2023-11-12T04:08:00.880633+00:00","2935","找出强数对的最大异或值 II","maximum-strong-pair-xor-ii",486718067],"487663609":["带你发明 Floyd 算法：从记忆化搜索到递推（Python/Java/C++/Go/JS/Rust）","dai-ni-fa-ming-floyd-suan-fa-cong-ji-yi-m8s51","2023-11-14T00:39:06.261520+00:00","1334","阈值距离内邻居最少的城市","find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance",487663609],"487789523":["分类讨论+简洁写法（Python/Java/C++/Go/JS）","fen-lei-tao-lun-jian-ji-xie-fa-pythonjav-37oe","2023-07-22T00:03:18.452257+00:00","860","柠檬水找零","lemonade-change",487789523],"491083091":["【视频讲解】教你一步步思考动态规划！（Python/Java/C++/Go）","shi-pin-jiao-ni-yi-bu-bu-si-kao-dong-tai-aty6","2023-04-01T11:12:16.716052+00:00","1039","多边形三角剖分的最低得分","minimum-score-triangulation-of-polygon",491083091],"492673087":["枚举删除后以 00/25/50/75 结尾（Python/Java/C++/Go）","mei-ju-shan-chu-hou-yi-00255075-jie-wei-zhjlu","2023-09-03T04:14:02.426745+00:00","2844","生成特殊数字的最少操作","minimum-operations-to-make-a-special-number",492673087],"492772626":["状压 DP","zhuang-ya-dp-by-endlesscheng-4jkr","2023-06-18T04:07:20.776788+00:00","2741","特别的排列","special-permutations",492772626],"495901528":["正反两次遍历","zheng-fan-liang-ci-bian-li-by-endlessche-z8ac","2021-12-26T09:33:29.033397+00:00","2116","判断一个括号字符串是否有效","check-if-a-parentheses-string-can-be-valid",495901528],"497323702":["分解质因子+前缀和+哈希表（Python/Java/C++/Go）","fen-jie-zhi-yin-zi-qian-zhui-he-ha-xi-bi-ceil","2023-11-26T04:09:51.947396+00:00","2949","统计美丽子字符串 II","count-beautiful-substrings-ii",497323702],"509699848":["前后缀分解+最长递增子序列，附题单（Python/Java/C++/Go/JS/Rust）","qian-hou-zhui-fen-jie-zui-chang-di-zeng-9vowl","2023-12-22T00:26:32.018587+00:00","1671","得到山形数组的最少删除次数","minimum-number-of-removals-to-make-mountain-array",509699848],"5115105":["DP，枚举下一轮两名选手的位置","dpmei-ju-xia-yi-lun-liang-ming-xuan-shou-okfu","2021-06-13T04:06:14.271507+00:00","1900","最佳运动员的比拼回合","the-earliest-and-latest-rounds-where-players-compete",5115105],"518714509":["遍历+与相邻数字比大小（Python/Java/C++/Go）","bian-li-yu-xiang-lin-shu-zi-bi-da-xiao-p-e70u","2023-12-03T04:22:16.210951+00:00","2951","找出峰值","find-the-peaks",518714509],"519673615":["倒序双指针：为什么倒序就一定能避免覆盖？（Python/Java/C++/Go/JS）","dao-xu-shuang-zhi-zhen-wei-shi-yao-dao-x-xxkp","2023-08-13T00:00:02.324527+00:00","88","合并两个有序数组","merge-sorted-array",519673615],"521886798":["动态规划+优化（Python/Java/C++/Go）","dong-tai-gui-hua-you-hua-pythonjavacgo-b-axv0","2023-05-28T04:24:35.860358+00:00","2713","矩阵中严格递增的单元格数","maximum-strictly-increasing-cells-in-a-matrix",521886798],"522511593":["如何删除节点？六分钟搞定四道题目！（Python/Java/C++/Go）","ru-he-shan-chu-jie-dian-liu-fen-zhong-ga-xpfs","2022-12-03T08:43:43.791393+00:00","19","删除链表的倒数第 N 个结点","remove-nth-node-from-end-of-list",522511593],"523951328":["O(n) 一次遍历","go-mo-ni-by-endlesscheng-50fm","2022-03-20T00:06:07.918866+00:00","2206","将数组划分成相等数对","divide-array-into-equal-pairs",523951328],"530135030":["极致优化！基于三数之和的做法（Python/Java/C++/Go/JS）","ji-zhi-you-hua-ji-yu-san-shu-zhi-he-de-z-1f0b","2023-07-15T00:34:56.150113+00:00","18","四数之和","4sum",530135030],"530846359":["二分答案+前缀和+差分数组+贪心（Python/Java/C++/Go）","er-fen-da-an-qian-zhui-he-chai-fen-shu-z-jnyv","2023-01-07T16:28:56.729184+00:00","2528","最大化城市的最小电量","maximize-the-minimum-powered-city",530846359],"534082096":["枚举买了多少支钢笔（附 O(log) 类欧几里得算法）","mei-ju-mai-liao-duo-shao-zhi-gang-bi-by-r97vg","2022-04-16T16:11:52.487856+00:00","2240","买钢笔和铅笔的方案数","number-of-ways-to-buy-pens-and-pencils",534082096],"535469112":["字典树+DFS","zi-dian-shu-dfs-by-endlesscheng-fy5u","2021-05-15T09:41:20.851666+00:00","1858","包含所有前缀的最长单词","longest-word-with-all-prefixes",535469112],"535937366":["两种方法：迭代/递归（Python/Java/C++/Go/JS）","liang-chong-fang-fa-die-dai-di-gui-pytho-wf75","2023-08-05T00:07:01.864333+00:00","21","合并两个有序链表","merge-two-sorted-lists",535937366],"536229655":["三种做法：双向链表 / 对顶栈 / Splay（Python/Java/C++/Go）","lian-biao-mo-ni-pythonjavacgo-by-endless-egw4","2022-06-05T04:07:24.793905+00:00","2296","设计一个文本编辑器","design-a-text-editor",536229655],"537590451":["状压 0-1 背包，查表法 vs 刷表法（Python/Java/C++/Go）","zhuang-ya-0-1-bei-bao-cha-biao-fa-vs-shu-qode","2023-04-07T15:42:01.642357+00:00","1125","最小的必要团队","smallest-sufficient-team",537590451],"537971944":["模拟","mo-ni-by-endlesscheng-1fxk","2022-02-27T04:16:25.931709+00:00","2185","统计包含给定前缀的字符串","counting-words-with-a-given-prefix",537971944],"540821611":["【图解】回溯/二进制枚举/O(n^3)枚举直径端点（Python/Java/C++/Go）","tu-jie-on3-mei-ju-zhi-jing-duan-dian-che-am2n","2023-03-11T15:57:14.772740+00:00","1617","统计子树中城市之间最大距离","count-subtrees-with-max-distance-between-cities",540821611],"545408597":["简洁写法（Python/Java/C++/Go）","jian-ji-xie-fa-pythonjavacgo-by-endlessc-7ak3","2024-02-11T04:40:54.554797+00:00","3033","修改矩阵","modify-the-matrix",545408597],"547605841":["简洁写法，调用自身！（Python/Java/C++/Go）","jian-ji-xie-fa-diao-yong-zi-shen-pythonj-64lf","2023-05-22T01:10:41.162249+00:00","1080","根到叶路径上的不足节点","insufficient-nodes-in-root-to-leaf-paths",547605841],"550448877":["前序中序后序，三种方法，一个视频讲透！（Python/Java/C++/Go/JS）","qian-xu-zhong-xu-hou-xu-san-chong-fang-f-yxvh","2022-12-14T10:56:14.600576+00:00","98","验证二叉搜索树","validate-binary-search-tree",550448877],"550627195":["折半枚举+排序+二分","zhe-ban-mei-ju-pai-xu-er-fen-by-endlessc-04fn","2021-10-10T04:08:48.863506+00:00","2035","将数组分成两个数组并最小化数组和的差","partition-array-into-two-arrays-to-minimize-sum-difference",550627195],"556438904":["讲清楚为什么一开始要把 (i,0) 都入堆！附题单！","jiang-qing-chu-wei-shi-yao-yi-kai-shi-ya-d3na","2023-12-12T14:31:24.397405+00:00","LCR 061","查找和最小的 K 对数字","qn8gGX",556438904],"556825118":["语法题（Python/Java/C++/Go）","mo-ni-by-endlesscheng-tz4z","2022-08-06T23:47:24.619277+00:00","2363","合并相似的物品","merge-similar-items",556825118],"557097878":["动态规划 + 避免浮点运算的写法","jiang-dp-mu-biao-gai-wei-zui-xiao-hua-fe-kg1k","2021-05-30T04:08:08.947908+00:00","1883","准时抵达会议现场的最小跳过休息次数","minimum-skips-to-arrive-at-meeting-on-time",557097878],"569962978":["贪心 + 位运算 O(1) 空间","wei-yun-suan-o1-kong-jian-by-endlesschen-m0q5","2022-09-11T04:12:18.021778+00:00","2405","子字符串的最优划分","optimal-partition-of-string",569962978],"572276699":["脑筋急转弯（Python/Java/C++/Go）","pai-xu-by-endlesscheng-h9w9","2022-07-09T23:14:36.027741+00:00","2332","坐上公交的最晚时间","the-latest-time-to-catch-a-bus",572276699],"57307685":["一个动画秒懂本题+简洁写法（Python/Java/C++/Go）","by-endlesscheng-z8o1","2022-10-30T23:28:12.998505+00:00","481","神奇字符串","magical-string",57307685],"586474794":["简洁写法，自身递归","by-endlesscheng-391l","2022-07-09T22:26:36.793676+00:00","2331","计算布尔二叉树的值","evaluate-boolean-binary-tree",586474794],"590592305":["分组 + 线性 DP + 乘法原理（Python/Go/C++/Java）","by-endlesscheng-gj8f","2022-05-08T04:06:44.661214+00:00","2266","统计打字方案数","count-number-of-texts",590592305],"592826714":["阅读理解","yue-du-li-jie-by-endlesscheng-xz4d","2021-11-27T16:10:31.426270+00:00","2087","网格图中机器人回家的最小代价","minimum-cost-homecoming-of-a-robot-in-a-grid",592826714],"601450429":["【图解】O(1) 做法（Python/Java/C++/Go/JS/Rust）","tu-jie-o1-zuo-fa-pythonjavacgojsrust-by-oms4k","2023-12-24T00:10:31.998202+00:00","1954","收集足够苹果的最小花园周长","minimum-garden-perimeter-to-collect-enough-apples",601450429],"608419542":["找不到规律？请看图！（Python/Java/C++/Go）","by-endlesscheng-umpp","2022-11-11T23:30:41.036180+00:00","790","多米诺和托米诺平铺","domino-and-tromino-tiling",608419542],"61296851":["模拟 + 两个优化","mo-ni-liang-ge-you-hua-by-endlesscheng-jldf","2022-11-27T00:37:13.282691+00:00","2482","行和列中一和零的差值","difference-between-ones-and-zeros-in-row-and-column",61296851],"613691832":["【视频】一个视频讲透单调栈！附题单（Python/Java/C++/Go/JS/Rust）","shi-pin-yi-ge-shi-pin-jiang-tou-dan-diao-cuk7","2023-10-07T00:23:22.421007+00:00","901","股票价格跨度","online-stock-span",613691832],"614687136":["滑动窗口（附题单！）Python/Java/C++/Go","hua-dong-chuang-kou-fu-ti-dan-pythonjava-6fxo","2023-12-09T23:49:22.222084+00:00","2958","最多 K 个重复元素的最长子数组","length-of-longest-subarray-with-at-most-k-frequency",614687136],"615729621":["位运算 O(1) 空间做法（Python/Java/C++/Go）","wei-yun-suan-o1-kong-jian-zuo-fa-pythonj-wk2p","2023-10-01T01:32:20.930881+00:00","2869","收集元素的最少操作次数","minimum-operations-to-collect-elements",615729621],"618419204":["模拟","pai-xu-zheng-shu-cong-xiao-dao-da-fu-shu-5iiz","2022-02-06T04:09:00.442655+00:00","2164","对奇偶下标分别排序","sort-even-and-odd-indices-independently",618419204],"625310591":["O(N) 后缀数组做法","on-hou-zhui-shu-zu-zuo-fa-by-endlesschen-rqkp","2021-07-07T02:46:47.730729+00:00","1044","最长重复子串","longest-duplicate-substring",625310591],"628719688":["脑筋急转弯（Python/Java/C++/Go）","by-endlesscheng-fcgc","2022-07-10T09:15:19.204387+00:00","777","在LR字符串中交换相邻字符","swap-adjacent-in-lr-string",628719688],"629883391":["BFS + 置换环 + 离散化","by-endlesscheng-97i9","2022-11-13T04:07:15.929516+00:00","2471","逐层排序二叉树所需的最少操作数目","minimum-number-of-operations-to-sort-a-binary-tree-by-level",629883391],"636790914":["逆向思维 + 01 背包方案数（Python/Java/C++/Go）","ni-xiang-si-wei-01-bei-bao-fang-an-shu-p-v47x","2022-12-25T04:12:02.938271+00:00","2518","好分区的数目","number-of-great-partitions",636790914],"638264577":["注意 z 的位置（Python/Java/C++/Go）","zhu-yi-z-de-wei-zhi-pythonjavacgo-by-end-1ha7","2023-02-11T15:08:19.215625+00:00","1138","字母板上的路径","alphabet-board-path",638264577],"639622603":["贪心，取最大两个与最小两个相减","tan-xin-qu-zui-da-liang-ge-he-zui-xiao-l-mvja","2021-06-27T04:08:12.535208+00:00","1913","两个数对之间的最大乘积差","maximum-product-difference-between-two-pairs",639622603],"648001314":["BFS 为什么要用队列？一个视频讲透！（Python/Java/C++/Go/JS/Rust）","bfs-wei-shi-yao-yao-yong-dui-lie-yi-ge-s-xlpz","2023-01-07T12:21:00.288356+00:00","102","二叉树的层序遍历","binary-tree-level-order-traversal",648001314],"653475446":["【视频】巧妙转换！516 变形题！（Python/Java/C++/Go）","shi-pin-qiao-miao-zhuan-huan-516-bian-xi-jhrt","2023-05-26T14:17:11.627201+00:00","1771","由子序列构造的最长回文串的长度","maximize-palindrome-length-from-subsequences",653475446],"655929637":["动态规划","dong-tai-gui-hua-by-endlesscheng-4onu","2021-08-01T04:21:01.162244+00:00","1955","统计特殊子序列的数目","count-number-of-special-subsequences",655929637],"658738156":["模拟（Python/Java/C++/Go）","mo-ni-pythonjavacgo-by-endlesscheng-1dia","2023-08-20T04:14:47.624091+00:00","2828","判别首字母缩略词","check-if-a-string-is-an-acronym-of-words",658738156],"660980450":["教你一步步思考动态规划！从递归到递推到 O(1) 额外空间！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dpcong-hui-su-da-epvl","2023-03-07T12:46:45.868584+00:00","LCR 166","珠宝的最高价值","li-wu-de-zui-da-jie-zhi-lcof",660980450],"665333196":["统计能被国王「看到」的皇后（Python/Java/C++/Go/JS）","tong-ji-neng-bei-guo-wang-kan-dao-de-hua-08s6","2023-09-14T00:34:46.489075+00:00","1222","可以攻击国王的皇后","queens-that-can-attack-the-king",665333196],"670519393":["线性 DP（Python/Java/C++/Go）","xian-xing-dppythonjavacgo-by-endlesschen-gpx9","2022-10-02T04:06:57.329379+00:00","2430","对字母串可执行的最大删除数","maximum-deletions-on-a-string",670519393],"670957801":["暴力（附 Python 一行）","bao-li-by-endlesscheng-g5qz","2022-05-01T04:07:51.915875+00:00","2259","移除指定数字得到的最大结果","remove-digit-from-number-to-maximize-result",670957801],"672964653":["分类讨论乱如麻？一个视频讲透！（Python/Java/C++/Go）","fen-lei-tao-lun-luan-ru-ma-yi-ge-shi-pin-rair","2023-01-16T07:56:33.706370+00:00","面试题 04.08","首个共同祖先","first-common-ancestor-lcci",672964653],"676558931":["【套路】前缀和+哈希表，消除分支的技巧（Python/Java/C++/Go）","tao-lu-qian-zhui-he-ha-xi-biao-xiao-chu-3mb11","2023-03-10T14:03:14.621722+00:00","面试题 17.05"," 字母与数字","find-longest-subarray-lcci",676558931],"676949389":["位运算一行搞定！附记忆化搜索做法（Python/Java/C++/Go）","ji-yi-hua-sou-suo-by-endlesscheng-cm6l","2023-02-19T04:13:43.977199+00:00","2571","将整数减少到零需要的最少操作数","minimum-operations-to-reduce-an-integer-to-0",676949389],"677909483":["数位 DP 上下界模板（附题单）Python/Java/C++/Go","shu-wei-dp-shang-xia-jie-mo-ban-fu-ti-da-h6ci","2024-01-07T13:02:39.748136+00:00","2999","统计强大整数的数目","count-the-number-of-powerful-integers",677909483],"67823656":["简洁写法，附相似题目（Python/Java/C++/Go/JS/Rust）","jian-ji-xie-fa-fu-xiang-si-ti-mu-pythonj-39p8","2024-01-08T00:34:45.503268+00:00","447","回旋镖的数量","number-of-boomerangs",67823656],"684110909":["贪心取中位数的理由","zhong-wei-shu-by-endlesscheng-p0vj","2021-10-10T04:13:30.802381+00:00","2033","获取单值网格的最小操作数","minimum-operations-to-make-a-uni-value-grid",684110909],"690173651":["两种方法：考虑相邻字母/abc个数（Python/Java/C++/Go/JS/Rust）","kao-lu-xiang-lin-zi-mu-pythonjavacgo-by-m9yrc","2023-04-16T04:10:46.923433+00:00","2645","构造有效字符串的最少插入数","minimum-additions-to-make-valid-string",690173651],"693474678":["Go 模拟","go-mo-ni-by-endlesscheng-46hj","2021-10-17T04:07:13.969165+00:00","2043","简易银行系统","simple-bank-system",693474678],"694594451":["各种语言的库函数写法（Python/Java/C++/Go/JS）","ge-chong-yu-yan-de-ku-han-shu-xie-fa-pyt-6gdt","2023-12-31T00:14:03.172790+00:00","1154","一年中的第几天","day-of-the-year",694594451],"700466705":["拓扑排序 + 构造（Python/Java/C++/Go）","by-endlesscheng-gpev","2022-08-28T04:07:40.088215+00:00","2392","给定条件下构造矩阵","build-a-matrix-with-conditions",700466705],"70049056":["统计 + 贪心","tan-xin-by-endlesscheng-epjv","2022-08-21T04:28:29.354797+00:00","2384","最大回文数字","largest-palindromic-number",70049056],"701261553":["一张图秒懂！（Python/Java/C++/Go）","yi-zhang-tu-miao-dong-pythonjavacgo-by-e-wqry","2023-02-20T15:53:03.662407+00:00","1326","灌溉花园的最少水龙头数目","minimum-number-of-taps-to-open-to-water-a-garden",701261553],"705189000":["栈思想模拟 + O(1) 额外空间","zhan-si-xiang-mo-ni-o1-e-wai-kong-jian-b-mlx0","2022-03-27T04:08:31.814673+00:00","2216","美化数组的最少删除数","minimum-deletions-to-make-array-beautiful",705189000],"713625410":["哈希并查集 + 位运算（Python/Java/C++/Go）","bing-cha-ji-wei-yun-suan-by-endlesscheng-uejd","2022-01-30T04:07:48.965068+00:00","2157","字符串分组","groups-of-strings",713625410],"718375766":["一步步提示如何思考此题（Python/Java/C++/Go）","yi-bu-bu-ti-shi-ru-he-si-kao-ci-ti-by-en-1p00","2022-09-10T23:50:49.590652+00:00","857","雇佣 K 名工人的最低成本","minimum-cost-to-hire-k-workers",718375766],"718987035":["利用最长上传前缀不会减小的性质","by-endlesscheng-n3ta","2022-10-01T23:54:41.478809+00:00","2424","最长上传前缀","longest-uploaded-prefix",718987035],"725104396":["【动画】简洁写法！从递归到迭代！（Python/Java/C++/Go/JS/Rust）","dong-hua-jian-ji-xie-fa-cong-di-gui-dao-oe0di","2023-07-01T23:38:22.642308+00:00","2","两数相加","add-two-numbers",725104396],"730656427":["【图解】区间 DP：状态设计与优化（Python/Java/C++/Go）","tu-jie-qu-jian-dpzhuang-tai-she-ji-yu-yo-ppv0","2023-04-03T15:53:21.484897+00:00","1000","合并石头的最低成本","minimum-cost-to-merge-stones",730656427],"730943544":["教你一步步思考动态规划：从记忆化搜索到递推，再到 O(1) 空间！（Python/Java/C++/Go/JS/Rust）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-bd25","2023-11-22T01:56:54.166781+00:00","2304","网格中的最小路径代价","minimum-path-cost-in-a-grid",730943544],"731038573":["一步步提示你思考本题！（Python/Java/C++/Go）","yi-bu-bu-ti-shi-ni-si-kao-ben-ti-pythonj-zhhs","2023-10-29T01:24:11.317713+00:00","2916","子数组不同元素数目的平方和 II","subarrays-distinct-element-sum-of-squares-ii",731038573],"735587531":["一行代码：比较两对字符串（Python/Java/C++/Go）","yi-xing-dai-ma-bi-jiao-liang-dui-zi-fu-c-34ae","2022-10-23T08:29:57.694670+00:00","2446","判断两个事件是否存在冲突","determine-if-two-events-have-conflict",735587531],"737896329":["【理论讲解】Dijkstra 和 Floyd 算法模板（Python/Java/C++/Go）","dijkstra-suan-fa-mo-ban-pythonjavacgo-by-unmv","2023-04-15T16:12:06.133238+00:00","2642","设计可以求最短路径的图类","design-graph-with-shortest-path-calculator",737896329],"746573214":["倒序回答 + 并查集（Python/Java/C++/Go）","by-endlesscheng-p61j","2022-08-20T23:22:05.318437+00:00","2382","删除操作后的最大子段和","maximum-segment-sum-after-removals",746573214],"747763790":["一次遍历：用变化量来思考（Python/Java/C++/Go）","by-endlesscheng-ko4z","2022-09-01T10:06:06.603507+00:00","828","统计子串中的唯一字符","count-unique-characters-of-all-substrings-of-a-given-string",747763790],"750309798":["树形 DP：选或不选（Python/Java/C++/Go）","shu-xing-dpxuan-huo-bu-xuan-pythonjavacg-7aj6","2023-11-05T04:10:05.623770+00:00","2925","在树上执行操作以后得到的最大分数","maximum-score-after-applying-operations-on-a-tree",750309798],"752241853":["O(n) 前后缀分解（Python/Java/C++/Go）","on-qian-hou-zhui-fen-jie-pythonjavacgo-b-wssq","2023-05-07T06:01:47.190246+00:00","2670","找出不同元素数目差数组","find-the-distinct-difference-array",752241853],"757825181":["倒序回答 + 并查集（Python/Java/C++/Go）","dao-xu-hui-da-bing-cha-ji-by-endlesschen-sdki","2022-08-22T11:23:12.222309+00:00","meituan-002","小美的仓库整理","TJZLyC",757825181],"760662992":["排序后两两交换，简洁写法（Python/Java/C++/Go）","pai-xu-hou-liang-liang-jiao-huan-pythonj-udxc","2023-12-24T04:21:15.967285+00:00","2974","最小数字游戏","minimum-number-game",760662992],"761142635":["数位 DP 通用模板，附题单（Python/Java/C++/Go）","by-endlesscheng-h9ua","2021-08-10T04:36:09.962323+00:00","233","数字 1 的个数","number-of-digit-one",761142635],"761999420":["【一图秒懂】排序+前缀和+二分查找（Python/Java/C++/Go）","yi-tu-miao-dong-pai-xu-qian-zhui-he-er-f-nf55","2023-03-26T04:26:11.075544+00:00","2602","使数组元素全部相等的最少操作次数","minimum-operations-to-make-all-array-elements-equal",761999420],"770030188":["子序列 DP 的思考套路（Python/Java/C++/Go）","zi-xu-lie-dp-de-si-kao-tao-lu-pythonjava-kmaf","2023-10-15T00:45:10.684428+00:00","2901","最长相邻不相等子序列 II","longest-unequal-adjacent-groups-subsequence-ii",770030188],"770308924":["遍历，找第一个回文串","bian-li-zhao-di-yi-ge-hui-wen-chuan-by-e-eaf6","2021-12-19T04:08:45.693546+00:00","2108","找出数组中的第一个回文字符串","find-first-palindromic-string-in-the-array",770308924],"770550829":["两种做法：遍历 / 二分查找（Python/Java/C++/Go）","mo-ni-by-endlesscheng-8e43","2023-01-08T04:26:16.734019+00:00","2529","正整数和负整数的最大计数","maximum-count-of-positive-integer-and-negative-integer",770550829],"771122731":["简洁写法！（Python/Java/C++/Go）","he-shi-ji-lu-da-an-pythonjavacgo-by-endl-lpcd","2023-05-30T00:11:25.377777+00:00","1110","删点成林","delete-nodes-and-return-forest",771122731],"77582966":["O(nlogn) 排序+双指针（Python/Java/C++/Go/JS）","onlogn-pai-xu-shuang-zhi-zhen-by-endless-qk40","2023-08-20T02:25:08.366367+00:00","2824","统计和小于目标的下标对数目","count-pairs-whose-sum-is-less-than-target",77582966],"778347498":["模拟","mo-ni-by-endlesscheng-rcjh","2023-01-08T00:29:15.375404+00:00","2526","找到数据流中的连续整数","find-consecutive-integers-from-a-data-stream",778347498],"782263815":["前后缀分解+双指针（Python/Java/C++/Go）","qian-hou-zhui-fen-jie-san-zhi-zhen-pytho-6cmr","2023-02-12T04:06:51.938960+00:00","2565","最少得分子序列","subsequence-with-the-minimum-score",782263815],"78641139":["推公式","tui-gong-shi-by-endlesscheng-90t5","2023-05-14T04:07:01.305719+00:00","2683","相邻值的按位异或","neighboring-bitwise-xor",78641139],"787047636":["贪心","tan-xin-by-endlesscheng-by6s","2021-08-01T04:07:50.197409+00:00","1953","你可以工作的最大周数","maximum-number-of-weeks-for-which-you-can-work",787047636],"787489678":["库函数写法（Python/Java/C++/Go）","ku-han-shu-xie-fa-pythonjavacgo-by-endle-hull","2023-09-17T04:22:00.251444+00:00","2859","计算 K 置位下标对应元素的和","sum-of-values-at-indices-with-k-set-bits",787489678],"787831673":["简单模拟（Python/Java/C++/Go）","jian-dan-mo-ni-pythonjavacgo-by-endlessc-tilg","2024-02-18T01:21:07.835815+00:00","3038","相同分数的最大操作数目 I","maximum-number-of-operations-with-the-same-score-i",787831673],"79432680":["O(n^2) 优雅枚举","on2-you-ya-mei-ju-by-endlesscheng-z86d","2024-02-04T01:21:37.140162+00:00","3027","人员站位的方案数 II","find-the-number-of-ways-to-place-people-ii",79432680],"796165027":["二进制枚举+Floyd，高效写法，附题单（Python/Java/C++/Go）","er-jin-zhi-mei-ju-floydgao-xiao-xie-fa-f-t7ou","2023-12-10T00:48:43.541519+00:00","2959","关闭分部的可行集合数目","number-of-possible-sets-of-closing-branches",796165027],"80255331":["哈希表（Python 两行）","ha-xi-biao-python-liang-xing-by-endlessc-ljae","2022-07-24T04:10:58.892510+00:00","2352","相等行列对","equal-row-and-column-pairs",80255331],"807897834":["Go 模拟","go-mo-ni-by-endlesscheng-8lv2","2021-12-19T04:08:00.965965+00:00","2109","向字符串添加空格","adding-spaces-to-a-string",807897834],"809508462":["式子变形 + 简洁写法","by-endlesscheng-uam3","2022-08-06T23:57:38.730276+00:00","2364","统计坏数对的数目","count-number-of-bad-pairs",809508462],"821525251":["倒序并查集","dao-xu-bing-cha-ji-by-endlesscheng-canj","2021-08-15T04:07:05.158739+00:00","1970","你能穿过矩阵的最后一天","last-day-where-you-can-still-cross",821525251],"826909651":["Go 前缀和","go-qian-zhui-he-by-endlesscheng-59wj","2021-06-12T16:16:38.436311+00:00","1895","最大的幻方","largest-magic-square",826909651],"829222445":["贪心，简洁写法（Python/Java/C++/Go/JS）","tan-xin-jian-ji-xie-fa-by-endlesscheng-zjea","2023-03-26T04:31:29.345827+00:00","2600","K 件物品的最大和","k-items-with-the-maximum-sum",829222445],"830799973":["双指针+维护最大最小（Python/Java/C++/Go）","shuang-zhi-zhen-wei-hu-zui-da-zui-xiao-p-h4bx","2023-10-15T04:14:13.824875+00:00","2905","找出满足差值条件的下标 II","find-indices-with-index-and-value-difference-ii",830799973],"83229717":["看下标为偶数/奇数的字符个数是否都一样（Python/Java/C++/Go）","kan-xia-biao-wei-ou-shu-qi-shu-de-zi-fu-edtw8","2023-09-03T12:15:05.461388+00:00","2840","判断通过操作能否让字符串相等 II","check-if-strings-can-be-made-equal-with-operations-ii",83229717],"833954016":["不用字符串，O(1) 空间写法（Python/Java/C++/Go/JS）","o1kong-jian-jian-ji-xie-fa-by-endlessche-jehj","2023-01-22T04:07:35.867139+00:00","2544","交替数字和","alternating-digit-sum",833954016],"834197249":["两种方法：记忆化搜索/O(n)前后缀分解（Python/Java/C++/Go）","ji-yi-hua-sou-suo-jian-ji-xie-fa-pythonj-6g5z","2024-01-07T12:06:09.815371+00:00","3003","执行操作后的最大分割数量","maximize-the-number-of-partitions-after-operations",834197249],"839548071":["【视频讲解】Z 函数（扩展 KMP）","z-han-shu-kuo-zhan-kmp-by-endlesscheng-w44j","2024-02-04T04:19:29.523765+00:00","3031","将单词恢复初始状态所需的最短时间 II","minimum-time-to-revert-word-to-initial-state-ii",839548071],"84450131":["模拟","mo-ni-by-endlesscheng-f6wa","2022-05-29T00:06:01.841857+00:00","2283","判断一个数的数字计数是否等于数位的值","check-if-number-has-equal-digit-count-and-digit-value",84450131],"846898736":["排序（Python/Java/C++/Go/JS）","pai-xu-pythonjavacgo-by-endlesscheng-u70i","2023-05-13T16:14:51.664664+00:00","2679","矩阵中的和","sum-in-a-matrix",846898736],"854560060":["回溯秒杀N皇后！一个视频讲透！（Python/Java/C++/Go/JS）","hui-su-miao-sha-nhuang-hou-yi-ge-shi-pin-l41l","2023-08-10T08:03:50.560392+00:00","52","N 皇后 II","n-queens-ii",854560060],"855962181":["两种做法：BFS+平衡树/并查集（Python/Java/C++/Go）","liang-chong-zuo-fa-ping-heng-shu-bing-ch-vr0z","2023-04-02T05:09:49.551008+00:00","2612","最少翻转操作数","minimum-reverse-operations",855962181],"869195845":["排序后遍历，简洁写法","pai-xu-hou-bian-li-xiang-dang-yu-qiu-chu-excq","2021-06-06T04:31:05.351307+00:00","1887","使数组元素相等的减少操作次数","reduction-operations-to-make-the-array-elements-equal",869195845],"869865446":["分组+双指针（Python/Java/C++/Go）","fen-zu-shuang-zhi-zhen-pythonjavacgo-by-lqqau","2023-08-20T04:12:49.710998+00:00","2831","找出最长等值子数组","find-the-longest-equal-subarray",869865446],"870099563":["简洁写法！直接调用 198 题代码！（Python/Java/C++/Go/JS）","jian-ji-xie-fa-zhi-jie-diao-yong-198-ti-qhvri","2023-09-17T00:26:22.923531+00:00","213","打家劫舍 II","house-robber-ii",870099563],"87115414":["O(nlogn) 线段树做法（Python/Java/C++/Go）","onlogn-xian-duan-shu-zuo-fa-pythonjavacg-pd8r","2023-10-29T01:56:25.107033+00:00","2913","子数组不同元素数目的平方和 I","subarrays-distinct-element-sum-of-squares-i",87115414],"879115717":["Go 库函数","go-ku-han-shu-by-endlesscheng-yhwn","2022-03-04T01:25:19.960685+00:00","592","分数加减运算","fraction-addition-and-subtraction",879115717],"87920735":["【图解】一图掌握二分答案！四种写法！附题单！（Python/Java/C++/Go/JS/Rust）","tu-jie-yi-tu-zhang-wo-er-fen-da-an-si-ch-d15k","2023-10-29T23:36:47.065997+00:00","275","H 指数 II","h-index-ii",87920735],"880748729":["单调栈 + DP + 一次遍历（Python/Java/C++/Go）","dan-diao-zhan-dp-by-endlesscheng-9d6y","2022-07-28T08:26:20.861275+00:00","2355","你能拿走的最大图书数量","maximum-number-of-books-you-can-take",880748729],"881741713":["遍历（Python/Java/C++/Go/JS/Rust）","bian-li-pythonjavacgo-by-endlesscheng-ge9h","2023-05-13T16:15:20.158784+00:00","2678","老人的数目","number-of-senior-citizens",881741713],"883396381":["利用差分的思想（Python 一行）","li-yong-chai-fen-shu-zu-de-si-xiang-by-e-8ve6","2022-10-09T04:24:11.382395+00:00","2433","找出前缀异或的原始数组","find-the-original-array-of-prefix-xor",883396381],"883833496":["教你一步步思考动态规划！（附题单）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-djxq","2023-06-20T00:29:38.852587+00:00","1595","连通两组点的最小成本","minimum-cost-to-connect-two-groups-of-points",883833496],"884144873":["贪心 + 分类讨论","tan-xin-fen-lei-tao-lun-by-endlesscheng-qj15","2022-02-13T04:38:10.649742+00:00","2170","使数组变成交替数组的最少操作数","minimum-operations-to-make-the-array-alternating",884144873],"886594276":["数位 DP 通用模板，附题单（Python/Java/C++/Go）","by-endlesscheng-1egu","2021-09-10T08:16:01.435394+00:00","600","不含连续1的非负整数","non-negative-integers-without-consecutive-ones",886594276],"888694650":["如何灵活运用递归？来看四道热门二叉树题目！（Python/Java/C++/Go）","ru-he-ling-huo-yun-yong-di-gui-lai-kan-s-r1nc","2022-12-10T10:10:56.987940+00:00","199","二叉树的右视图","binary-tree-right-side-view",888694650],"889856657":["O(m^3) 带权二分图最大完美匹配","om3-er-fen-tu-zui-da-dai-quan-pi-pei-by-a0wqb","2021-07-25T04:07:30.023350+00:00","1947","最大兼容性评分和","maximum-compatibility-score-sum",889856657],"894912724":["按题意模拟（Python/Java/C++/Go）","an-ti-yi-mo-ni-by-endlesscheng-34t1","2023-10-29T04:15:42.307956+00:00","2917","找出数组中的 K-or 值","find-the-k-or-of-an-array",894912724],"904890527":["回溯不会写？套路在此！（Python/Java/C++/Go）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-a92r","2023-03-09T07:32:19.942862+00:00","LCR 085","括号生成","IDBivT",904890527],"905487995":["DFS + 分类讨论","ji-yi-hua-sou-suo-by-endlesscheng-ll3r","2021-10-31T04:54:38.881795+00:00","2060","同源字符串检测","check-if-an-original-string-exists-given-two-encoded-strings",905487995],"910590803":["双堆模拟（Python/Java/C++/Go）","shuang-dui-mo-ni-pythonjavacgo-by-endles-ctwc","2022-09-04T04:07:37.971309+00:00","2402","会议室 III","meeting-rooms-iii",910590803],"911506733":["O(n) 做法","pai-xu-qu-zhong-er-fen-by-endlesscheng-pgu0","2021-09-18T16:07:35.534348+00:00","2006","差的绝对值为 K 的数对数目","count-number-of-pairs-with-absolute-difference-k",911506733],"915449177":["线性 DP + 枚举切割位置 + 循环优化（Python/Java/C++/Go）","by-endlesscheng-mrmd","2022-06-19T04:22:23.166975+00:00","2312","卖木头块","selling-pieces-of-wood",915449177],"917372483":["栈的经典应用","zhan-de-jing-dian-ying-yong-by-endlessch-ljym","2022-08-28T04:08:33.357408+00:00","2390","从字符串中移除星号","removing-stars-from-a-string",917372483],"917808097":["利用位运算加速（Python/Java/C++/Go）","li-yong-wei-yun-suan-jia-su-pythonjavacg-uzme","2023-04-29T16:11:55.921865+00:00","2657","找到两个数组的前缀公共数组","find-the-prefix-common-array-of-two-arrays",917808097],"91788639":["从 O(n^2) 到 O(n)：单调栈+计算每个元素对答案的贡献","cong-on2-dao-ondan-diao-zhan-ji-suan-mei-o1op","2021-12-12T04:06:25.517560+00:00","2104","子数组范围和","sum-of-subarray-ranges",91788639],"918405430":["【图解】从 O(n^2) 到 O(n)（Python/Java/C++/Go/JS/Rust）","tu-jie-cong-on2-dao-onpythonjavacgojsrus-w8ny","2024-02-21T00:51:32.222193+00:00","106","从中序与后序遍历序列构造二叉树","construct-binary-tree-from-inorder-and-postorder-traversal",918405430],"919200929":["Go 模拟","go-mo-ni-by-endlesscheng-tpc5","2021-09-04T16:08:33.051741+00:00","1991","找到数组的中间位置","find-the-middle-index-in-array",919200929],"922086852":["最近公共祖先 + 位运算优化时间复杂度（Python/Java/C++/Go）","zui-jin-gong-gong-zu-xian-pythonjavacgo-v8ata","2022-12-18T04:06:09.034326+00:00","2509","查询树中环的长度","cycle-length-queries-in-a-tree",922086852],"922160489":["排序+贪心","pai-xu-tan-xin-by-endlesscheng-14ea","2023-03-12T04:09:39.117753+00:00","2587","重排数组以得到最大前缀分数","rearrange-array-to-maximize-prefix-score",922160489],"923836112":["二分答案+贪心","er-fen-da-an-tan-xin-by-endlesscheng-x5cx","2023-05-07T10:22:42.406569+00:00","LCP 78","城墙防线","Nsibyl",923836112],"924129852":["前后缀分解 + O(100) 常数空间（Python/Java/C++/Go）","qian-hou-zhui-fen-jie-o100-chang-shu-kon-51cv","2022-11-27T01:37:11.560500+00:00","2484","统计回文子序列数目","count-palindromic-subsequences",924129852],"927068521":["分类讨论（Python 一行）","by-endlesscheng-vmtr","2022-03-13T04:09:34.216243+00:00","2202","K 次操作后最大化顶端元素","maximize-the-topmost-element-after-k-moves",927068521],"928331770":["最大子数组和的变形题（Python/Java/C++/Go）","by-endlesscheng-5775","2022-05-15T01:27:18.011837+00:00","2272","最大波动的子字符串","substring-with-largest-variance",928331770],"928385815":["教你一步步思考动态规划！一个视频讲透！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-21m5","2023-02-18T12:45:46.201620+00:00","322","零钱兑换","coin-change",928385815],"929368022":["状压 DP + 爆搜下一个状态","zhuang-ya-dp-bao-sou-xia-yi-ge-zhuang-ta-9dad","2023-04-22T11:20:25.754940+00:00","LCP 76","魔法棋盘","1ybDKD",929368022],"929840503":["三种方法：DFS/BFS/BFS+链表（附题单）Python/Java/C++/Go/JS","san-chong-fang-fa-dfsbfsbfslian-biao-fu-5alnq","2023-11-02T23:54:21.964139+00:00","116","填充每个节点的下一个右侧节点指针","populating-next-right-pointers-in-each-node",929840503],"93344773":["O(n) 一次遍历","yi-ci-bian-li-by-endlesscheng-s6a0","2021-11-21T04:08:03.259188+00:00","2079","给植物浇水","watering-plants",93344773],"938263064":["两种做法：二分答案 / 分类讨论","liang-chong-zuo-fa-er-fen-da-an-fen-lei-qhee6","2022-10-16T00:25:10.207054+00:00","2439","最小化数组中的最大值","minimize-maximum-of-array",938263064],"942180030":["两种数位 DP 模板，附题单（Python/Java/C++/Go）","shu-wei-dp-tong-yong-mo-ban-pythonjavacg-9tuc","2023-06-04T04:18:55.690184+00:00","2719","统计整数数目","count-of-integers",942180030],"94359620":["贪心（Python/Java/C++/Go）","tan-xin-by-endlesscheng-immn","2023-08-27T04:23:17.841049+00:00","2835","使子序列的和等于目标的最少操作次数","minimum-operations-to-form-subsequence-with-target-sum",94359620],"945629510":["算法小课堂：前缀和","suan-fa-xiao-ke-tang-qian-zhui-he-by-end-n0mx","2023-02-05T04:33:54.806830+00:00","2559","统计范围内的元音字符串数","count-vowel-strings-in-ranges",945629510],"946660529":["找最后一个奇数位置（附一行写法）","zhao-zui-hou-yi-ge-qi-shu-wei-zhi-by-end-j98d","2021-06-20T04:07:15.251978+00:00","1903","字符串中的最大奇数","largest-odd-number-in-string",946660529],"949381873":["一步步提示如何做出此题（Python/Java/C++/Go）","by-endlesscheng-dt8h","2022-04-16T16:11:02.178161+00:00","2242","节点序列的最大得分","maximum-score-of-a-node-sequence",949381873],"950521557":["遍历每一行","bian-li-mei-yi-xing-by-endlesscheng-ltx3","2023-04-16T04:11:20.316840+00:00","2643","一最多的行","row-with-maximum-ones",950521557],"95938088":["O(1) 空间写法！","mo-ni-jian-ji-xie-fa-by-endlesscheng-utdr","2023-02-26T04:44:26.401102+00:00","2574","左右元素和的差值","left-and-right-sum-differences",95938088],"96141044":["和字符集大小无关的线段树做法（Python/Java/C++/Go）","by-endlesscheng-qpbw","2022-03-20T04:09:08.471993+00:00","2213","由单个字符重复的最长子字符串","longest-substring-of-one-repeating-character",96141044],"963523596":["库函数模拟（Python 一行）","go-by-endlesscheng-qrhd","2022-06-25T23:06:58.227175+00:00","2315","统计星号","count-asterisks",963523596],"96440277":["详细分析为什么至多考虑两行（Python/Java/C++/Go）","xiang-xi-fen-xi-wei-shi-yao-zhi-duo-kao-mbl6a","2023-06-11T10:47:40.661888+00:00","2732","找到矩阵中的好子集","find-a-good-subset-of-the-matrix",96440277],"967980473":["横竖分别统计+分组循环（Python/Java/C++/Go）","heng-shu-fen-bie-tong-ji-fen-zu-xun-huan-nboj","2023-11-26T10:57:49.262453+00:00","2943","最大化网格图中正方形空洞的面积","maximize-area-of-square-hole-in-grid",967980473],"974534416":["哈希表模拟（Python/Java/C++/Go）","ha-xi-biao-mo-ni-by-endlesscheng-6rgb","2023-04-02T05:24:10.186478+00:00","2610","转换二维数组","convert-an-array-into-a-2d-array-with-conditions",974534416],"976283641":["预处理+状压DP","z-by-endlesscheng-6ver","2022-10-08T01:21:19.775623+00:00","LCP 69","Hello LeetCode!","rMeRt2",976283641],"979526552":["最长递增子序列的变形：选或不选/枚举选哪个（Python/Java/C++/Go）","zui-chang-di-zeng-zi-xu-lie-de-bian-xing-jhgg","2023-04-19T15:36:18.988418+00:00","1187","使数组严格递增","make-array-strictly-increasing",979526552],"981386412":["O(1) 时间做法（Python/Java/C++/Go）","o1-shi-jian-zuo-fa-pythonjavacgo-by-endl-sa7h","2023-06-11T09:19:55.228282+00:00","2733","既不是最小值也不是最大值","neither-minimum-nor-maximum",981386412],"983129619":["位运算写法","wei-yun-suan-xie-fa-by-endlesscheng-g1i6","2021-10-10T04:09:48.616373+00:00","2032","至少在两个数组中出现的值","two-out-of-three",983129619],"98370052":["Go 单调栈","go-dan-diao-zhan-by-endlesscheng-2lfi","2021-12-06T03:18:13.308119+00:00","1063","有效子数组的数目","number-of-valid-subarrays",98370052],"986520800":["不存在水域即为子岛屿","bu-cun-zai-shui-yu-ji-wei-zi-dao-yu-by-e-wbz5","2021-06-20T04:08:50.281137+00:00","1905","统计子岛屿","count-sub-islands",986520800],"988335694":["贪心+二分：使箱子的尺寸之和尽可能地小","qian-zhui-he-shang-er-fen-by-endlesschen-vmku","2021-06-06T04:33:25.928711+00:00","1889","装包裹的最小浪费空间","minimum-space-wasted-from-packaging",988335694],"989456575":["暴力枚举所有插入括号的位置","bao-li-mei-ju-suo-you-by-endlesscheng-evdu","2022-04-10T04:09:06.276234+00:00","2232","向表达式添加括号后的最小结果","minimize-result-by-adding-parentheses-to-expression",989456575],"999091554":["接近 O(n^2) 的做法：多源BFS+倒序枚举答案+并查集（Python/Java/C++/Go）","jie-jin-on2-de-zuo-fa-duo-yuan-bfsdao-xu-r5um","2023-08-06T08:24:53.082995+00:00","2812","找出最安全路径","find-the-safest-path-in-a-grid",999091554]} +{"1001722740":["遍历（Python/Java/C++/Go）","bian-li-by-endlesscheng-2gmw","2022-10-30T04:09:44.703343+00:00","2455","可被三整除的偶数的平均值","average-value-of-even-numbers-that-are-divisible-by-three",1001722740],"1007682110":["回溯不会写？套路在此！（Python/Java/C++/Go）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-q1yu","2023-03-09T02:58:22.697557+00:00","LCR 086","分割回文串","M99OJA",1007682110],"1009976390":["分类讨论+简洁写法（Python/Java/C++/Go）","fen-lei-tao-lun-jian-ji-xie-fa-pythonjav-vynj","2023-06-04T04:43:52.356024+00:00","2717","半有序排列","semi-ordered-permutation",1009976390],"1010937559":["脑筋急转弯","nao-jin-ji-zhuan-wan-by-endlesscheng-sihd","2023-06-18T04:26:49.178344+00:00","2740","找出分区值","find-the-value-of-the-partition",1010937559],"1017096056":["数学做法：O(1) 容斥原理（Python/Java/C++/Go/JS/Rust）","o1-rong-chi-yuan-li-by-endlesscheng-yxc4","2023-04-23T04:10:43.708994+00:00","2652","倍数求和","sum-multiples",1017096056],"1017177635":["添加状态后 DFS + 剪枝优化（Python/Java/C++/Go）","tian-jia-zhuang-tai-hou-dfscpythonjavago-f287","2022-05-08T04:06:21.423498+00:00","2267","检查是否有合法括号字符串路径","check-if-there-is-a-valid-parentheses-string-path",1017177635],"1019777981":["有技巧的枚举 + 常数优化（Python/Java/C++/Go）","you-ji-qiao-de-mei-ju-chang-shu-you-hua-daxit","2023-03-03T14:17:54.361268+00:00","982","按位与为零的三元组","triples-with-bitwise-and-equal-to-zero",1019777981],"10205408":["O(nlogn) 做法：用并查集维护朋友关系，同时用哈希表维护代表元之间能否成为朋友","bing-cha-ji-by-endlesscheng-8ipg","2021-11-14T04:07:23.603268+00:00","2076","处理含限制条件的好友请求","process-restricted-friend-requests",10205408],"1023816398":["教你一步步思考动态规划！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-sje6","2023-02-10T01:44:21.734805+00:00","1223","掷骰子模拟","dice-roll-simulation",1023816398],"1024461884":["计算到每个点的距离（Python/Java/C++/Go）","ji-suan-dao-mei-ge-dian-de-ju-chi-python-gr2u","2022-07-31T04:06:12.389994+00:00","2359","找到离给定两个节点最近的节点","find-closest-node-to-given-two-nodes",1024461884],"1026373985":["转换+中位数贪心+对顶堆（Python/Java/C++/Go/JS/Rust）","zhuan-huan-zhong-wei-shu-tan-xin-dui-din-7r9b","2024-02-01T00:11:39.257569+00:00","LCP 24","数字游戏","5TxKeK",1026373985],"1028149095":["模拟","mo-ni-by-endlesscheng-a7hu","2021-07-04T04:07:39.433556+00:00","1920","基于排列构建数组","build-array-from-permutation",1028149095],"1029578709":["复杂模拟题如何思考？视频讲解！（Python/Java/C++/Go）","by-endlesscheng-nzqo","2023-01-08T04:21:34.495005+00:00","2532","过桥的时间","time-to-cross-a-bridge",1029578709],"1032257843":["【模板】恰好装满型 0-1 背包（Python/Java/C++/Go）","mo-ban-qia-hao-zhuang-man-xing-0-1-bei-b-0nca","2023-10-29T00:00:59.966463+00:00","2915","和为目标值的最长子序列的长度","length-of-the-longest-subsequence-that-sums-to-target",1032257843],"1033555490":["统计 s[i] != s[i+1]（Python/Java/C++/Go）","nao-jin-ji-zhuan-wan-pythonjavacgo-by-en-qcm1","2023-10-29T01:54:41.453802+00:00","2914","使二进制字符串变美丽的最少修改次数","minimum-number-of-changes-to-make-binary-string-beautiful",1033555490],"1037331293":["无需模拟，排序即可（Python/Java/C++/Go/JS）","wu-xu-mo-ni-pai-xu-ji-ke-by-endlesscheng-g2cd","2022-12-11T04:09:12.626606+00:00","2500","删除每行中的最大值","delete-greatest-value-in-each-row",1037331293],"103871786":["巧妙利用位运算优化空间复杂度：从 O(n) 到 O(log C) 到 O(1)","ha-xi-biao-mo-ni-by-endlesscheng-ipk3","2022-01-30T04:08:32.267523+00:00","2154","将找到的值乘以 2","keep-multiplying-found-values-by-two",103871786],"1044473054":["【视频】教你一步步思考动态规划！（Python/Java/C++/Go）","shi-pin-jiao-ni-yi-bu-bu-si-kao-dong-tai-kgkg","2023-04-01T11:10:42.262871+00:00","516","最长回文子序列","longest-palindromic-subsequence",1044473054],"1047256075":["暴力：注意 k 的范围（Python/Java/C++/Go/JS）","bao-li-zhu-yi-k-de-fan-wei-by-endlessche-3i1b","2023-09-17T00:41:23.395728+00:00","2857","统计距离为 k 的点对","count-pairs-of-points-with-distance-k",1047256075],"1049390106":["分类讨论（Python/Java/C++/Go）","fen-lei-tao-lun-pythonjavacgo-by-endless-2qyo","2023-04-29T13:48:54.317727+00:00","1033","移动石子直到连续","moving-stones-until-consecutive",1049390106],"1058966145":["两种方法：暴力 DFS / 树上差分（Python/Java/C++/Go/JS/Rust）","lei-si-da-jia-jie-she-iii-pythonjavacgo-4k3wq","2023-04-16T04:07:47.501267+00:00","2646","最小化旅行的价格总和","minimize-the-total-price-of-the-trips",1058966145],"1059279895":["两种方法：滑动窗口+中位数贪心+前缀和/贡献法（Python/Java/C++/Go）","hua-dong-chuang-kou-zhong-wei-shu-tan-xi-nuvr","2023-12-17T04:07:59.118005+00:00","2968","执行操作使频率分数最大","apply-operations-to-maximize-frequency-score",1059279895],"1062314990":["【图解】利用行最大值判断峰顶位置，附二分题单（Python/Java/C++/Go/JS/Rust）","tu-jie-li-yong-xing-zui-da-zhi-pan-duan-r4e0n","2023-12-19T00:17:36.124600+00:00","1901","寻找峰值 II","find-a-peak-element-ii",1062314990],"1063658457":["累加每个 0 左边的 1 的个数（Python/Java/C++/Go）","lei-jia-mei-ge-0-zuo-bian-de-1-de-ge-shu-luuh","2023-11-19T04:10:31.644925+00:00","2938","区分黑球与白球","separate-black-and-white-balls",1063658457],"1066025257":["将询问离线 + 排序","jiang-xun-wen-chi-xian-pai-xu-by-endless-o5j0","2021-11-14T01:09:47.102802+00:00","2070","每一个查询的最大美丽值","most-beautiful-item-for-each-query",1066025257],"1067400091":["累加各个字母出现次数的差值","lei-jia-ge-ge-zi-mu-chu-xian-ci-shu-de-j-w1ja","2022-02-27T04:15:57.873105+00:00","2186","制造字母异位词的最小步骤数 II","minimum-number-of-steps-to-make-two-strings-anagram-ii",1067400091],"1069078430":["简洁写法，O(n) 一次遍历（Python/Java/C++/Go）","jian-ji-xie-fa-on-yi-ci-bian-li-pythonja-exzg","2024-01-07T04:46:54.604804+00:00","3000","对角线最长的矩形的面积","maximum-area-of-longest-diagonal-rectangle",1069078430],"1069956724":["动态规划 + 简洁写法 + 循环优化（Python/Java/C++/Go）","dong-tai-gui-hua-jian-ji-xie-fa-xun-huan-xyw3","2022-11-20T04:07:19.352498+00:00","2478","完美分割的方案数","number-of-beautiful-partitions",1069956724],"107547857":["断环成链 + 滑动窗口","duan-huan-cheng-lian-hua-dong-chuang-kou-ws80","2022-01-09T04:11:51.154855+00:00","2134","最少交换次数来组合所有的 1 II","minimum-swaps-to-group-all-1s-together-ii",107547857],"1075971933":["排序 + 排序 + 排序（Python/Java/C++/Go）","pai-xu-pai-xu-pai-xu-pythonjavacgo-by-en-ou4k","2022-04-24T04:16:16.490851+00:00","2250","统计包含每个点的矩形数目","count-number-of-rectangles-containing-each-point",1075971933],"1078280786":["一次遍历","by-endlesscheng-z1sm","2022-08-14T04:08:56.512976+00:00","2374","边积分最高的节点","node-with-highest-edge-score",1078280786],"1088208610":["两种方法：二分+DP/二分+贪心（Python/Java/C++/Go）","er-fen-da-an-dp-by-endlesscheng-m558","2023-02-05T04:26:17.250822+00:00","2560","打家劫舍 IV","house-robber-iv",1088208610],"1089101531":["根据排序不等式贪心，简洁写法（Python/Java/C++/Go）","tan-xin-jian-ji-xie-fa-pythonjavacgo-by-5l4je","2024-01-21T05:15:24.696304+00:00","3016","输入单词需要的最少按键次数 II","minimum-number-of-pushes-to-type-word-ii",1089101531],"1093275153":["计算每个字母个数的平均数","ji-suan-mei-ge-zi-mu-ge-shu-de-ping-jun-6mmol","2021-06-13T04:08:27.055992+00:00","1897","重新分配字符使所有字符串都相等","redistribute-characters-to-make-all-strings-equal",1093275153],"1094471227":["O(1) 公式，一行代码（Python/Java/C++/Go）","o1-gong-shi-yi-xing-dai-ma-pythonjavacgo-f7ch","2024-01-28T04:26:30.212704+00:00","3021","Alice 和 Bob 玩鲜花游戏","alice-and-bob-playing-flower-game",1094471227],"109606469":["没有思路？一步步提示你思考！（Python/Java/C++/Go/JS）","mei-you-si-lu-yi-bu-bu-ti-shi-ni-si-kao-cm0h2","2023-02-26T15:20:10.606743+00:00","1144","递减元素使数组呈锯齿状","decrease-elements-to-make-array-zigzag",109606469],"1097720535":["非暴力做法：差分数组+分类讨论（Python/Java/C++/Go）","fei-bao-li-zuo-fa-chai-fen-shu-zu-fen-le-g6wo","2024-01-21T05:28:37.950167+00:00","3015","按距离统计房屋对数目 I","count-the-number-of-houses-at-a-certain-distance-i",1097720535],"110135796":["没有思路？一张图秒懂！（Python/Java/C++/Go）","mei-you-si-lu-yi-zhang-tu-miao-dong-pyth-btav","2023-02-03T00:15:34.985739+00:00","1145","二叉树着色游戏","binary-tree-coloring-game",110135796],"1102749976":["Go 贪心","go-tan-xin-by-endlesscheng-znuz","2021-07-25T04:08:26.793146+00:00","1946","子字符串突变后可能得到的最大整数","largest-number-after-mutating-substring",1102749976],"1103286328":["交换元素值的写法","zhi-jie-jiao-huan-yuan-su-zhi-by-endless-hsfq","2021-11-14T04:25:39.108420+00:00","2074","反转偶数长度组的节点","reverse-nodes-in-even-length-groups",1103286328],"111167904":["数学证明","shu-xue-zheng-ming-by-endlesscheng-8ozj","2022-09-04T00:17:27.708228+00:00","2396","严格回文的数字","strictly-palindromic-number",111167904],"1113985320":["子集动态规划","zi-ji-dong-tai-gui-hua-by-endlesscheng-wtua","2021-08-29T04:06:25.529846+00:00","1986","完成任务的最少工作时间段","minimum-number-of-work-sessions-to-finish-the-tasks",1113985320],"1114300382":["只要你会 153 就能看懂！（Python/Java/C++/Go）","zhi-yao-ni-hui-153-jiu-neng-kan-dong-pyt-qqc6","2023-02-24T12:21:55.775259+00:00","154","寻找旋转排序数组中的最小值 II","find-minimum-in-rotated-sorted-array-ii",1114300382],"1119710280":["三种方法：暴力/线段树/栈（Python/Java/C++/Go）","tan-xin-pythonjavacgo-by-endlesscheng-w3k3","2023-03-12T04:08:21.175878+00:00","2589","完成所有任务的最少时间","minimum-time-to-complete-all-tasks",1119710280],"1122946813":["快速幂（Python/Java/C++/Go）","kuai-su-mi-pythonjavacgo-by-endlesscheng-xeth","2023-12-10T04:09:12.225238+00:00","2961","双模幂运算","double-modular-exponentiation",1122946813],"1132876897":["子集状压 DP，附视频讲解（Java/C++/Go）","zi-ji-zhuang-ya-dp-by-endlesscheng-mxjr","2022-07-08T08:17:57.075305+00:00","465","最优账单平衡","optimal-account-balancing",1132876897],"1134359923":["两种方法：回溯/状态压缩+记忆化搜索（Python/Java/C++/Go/JS）","liang-chong-fang-fa-hui-su-zhuang-tai-ya-26py","2023-08-04T00:23:54.744757+00:00","980","不同路径 III","unique-paths-iii",1134359923],"1137942707":["一步步提示如何做出此题（Python/Java/C++/Go）","yi-bu-bu-tis-by-endlesscheng-89kw","2022-06-25T23:11:20.739546+00:00","2317","操作后的最大异或和","maximum-xor-after-operations",1137942707],"113811987":["两种做法：珂朵莉树 / 动态开点线段树（Python/Java/C++/Go）","by-endlesscheng-clk2","2022-05-15T05:05:19.798874+00:00","2276","统计区间中的整数数目","count-integers-in-intervals",113811987],"1139062797":["简洁写法","jian-ji-xie-fa-by-endlesscheng-6k4m","2021-05-15T17:01:05.052462+00:00","1859","将句子排序","sorting-the-sentence",1139062797],"1140950686":["DP：从 O(n^2) 到 O(n)（Python/Java/C++/Go）","dpcong-on2-dao-onpythonjavacgo-by-endles-nux5","2023-11-26T00:30:20.628053+00:00","2944","购买水果需要的最少金币数","minimum-number-of-coins-for-fruits",1140950686],"1146950656":["回溯不会写？套路在此！（Python/Java/C++/Go）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-8tkl","2023-01-13T01:34:08.039412+00:00","78","子集","subsets",1146950656],"1150623470":["计算每个元素对答案的贡献，多解法（Python/Java/C++/Go）","by-endlesscheng-upd1","2022-11-17T23:36:57.963602+00:00","891","子序列宽度之和","sum-of-subsequence-widths",1150623470],"1156930664":["两种 O(nm) 做法：DP / BFS（Python/Java/C++/Go）","onm-zuo-fa-cong-ji-yi-hua-sou-suo-dao-di-dnec","2024-01-29T00:41:00.320379+00:00","514","自由之路","freedom-trail",1156930664],"1165928557":["跟着我过一遍示例 2，你就明白怎么做了（Python/Java/C++/Go/JS）","gen-zhao-wo-guo-yi-bian-shi-li-2ni-jiu-m-zd6u","2023-08-10T03:27:21.601039+00:00","316","去除重复字母","remove-duplicate-letters",1165928557],"1167299665":["【图解】前缀和轻松 AC！（Python/Java/C++/Go）","tu-jie-qian-zhui-he-qing-song-acpythonja-5mnn","2023-02-16T15:49:20.591870+00:00","1139","最大的以 1 为边界的正方形","largest-1-bordered-square",1167299665],"1168254316":["线性做法：归并排序 + O(1) 额外空间","xian-xing-zuo-fa-gui-bing-pai-xu-o1-e-wa-iy7u","2023-02-19T04:18:07.133806+00:00","2570","合并两个二维数组 - 求和法","merge-two-2d-arrays-by-summing-values",1168254316],"1168505902":["教你一步步思考动态规划：从记忆化搜索到递推（Python/Java/C++/Go/JS/Rust）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-zktx","2024-02-03T00:24:34.112581+00:00","1690","石子游戏 VII","stone-game-vii",1168505902],"1168558024":["两种方法：调用 445 题 / 一次遍历（Python/Java/C++/Go/JS/Rust）","o1-kong-jian-zuo-fa-kan-cheng-shi-head-y-1dco","2023-08-13T04:21:04.301264+00:00","2816","翻倍以链表形式表示的数字","double-a-number-represented-as-a-linked-list",1168558024],"1173419903":["O(1) 公式（Python/Java/C++/Go）","o1-gong-shi-pythonjavacgo-by-endlesschen-cztk","2023-08-20T04:14:16.041826+00:00","2829","k-avoiding 数组的最小总和","determine-the-minimum-sum-of-a-k-avoiding-array",1173419903],"1174559962":["位运算加速","wei-yun-suan-jia-su-by-endlesscheng-c7h9","2023-07-23T00:18:00.895916+00:00","2785","将字符串中的元音字母排序","sort-vowels-in-a-string",1174559962],"1176671732":["Python 一行","python-yi-xing-by-endlesscheng-6s44","2022-10-07T23:35:17.756363+00:00","LCP 66","最小展台数量","600YaG",1176671732],"1178924986":["预处理 + 动态规划","yu-chu-li-dong-tai-gui-hua-by-endlessche-7am2","2021-08-21T16:15:56.892391+00:00","1977","划分数字的方案数","number-of-ways-to-separate-numbers",1178924986],"1180161064":["单独计算每个元音的出现次数","dan-du-ji-suan-mei-ge-yuan-yin-de-chu-xi-eyjf","2021-11-07T04:05:42.759998+00:00","2063","所有子字符串中的元音","vowels-of-all-substrings",1180161064],"1180349312":["找规律","zhao-gui-lu-by-endlesscheng-gksh","2023-03-04T16:14:44.201133+00:00","2579","统计染色格子数","count-total-number-of-colored-cells",1180349312],"1180837306":["贪心模拟 简洁写法","tan-xin-by-endlesscheng-8jk9","2021-10-03T04:07:59.241276+00:00","2027","转换字符串的最少操作次数","minimum-moves-to-convert-string",1180837306],"1182547848":["O(10n) 非暴力做法（Python/Java/C++/Go）","o10n-fei-bao-li-zuo-fa-by-endlesscheng-36eb","2023-06-25T04:24:39.610874+00:00","2748","美丽下标对的数目","number-of-beautiful-pairs",1182547848],"1184414922":["【图解】贪心做法，一图秒懂！（Python/Java/C++/Go）","tu-jie-tan-xin-zuo-fa-yi-tu-miao-dong-py-huik","2023-04-11T14:24:28.046269+00:00","1147","段式回文","longest-chunked-palindrome-decomposition",1184414922],"1186731908":["一次遍历，简洁写法（Python/Java/C++/Go/JS）","yi-ci-bian-li-jian-ji-xie-fa-pythonjavac-aut0","2023-05-28T04:25:40.209809+00:00","2712","使所有字符相等的最小成本","minimum-cost-to-make-all-characters-equal",1186731908],"1187211206":["【算法小课堂】差分数组（附题单）Python/Java/C++/Go/JS/Rust","suan-fa-xiao-ke-tang-chai-fen-shu-zu-fu-9d4ra","2023-12-02T00:24:38.592013+00:00","1094","拼车","car-pooling",1187211206],"1188543288":[" BFS 为什么要用队列？一个视频讲透！（Python/Java/C++/Go/JS）","bfs-wei-shi-yao-yao-yong-dui-lie-yi-ge-s-yxdi","2023-07-18T09:08:33.687800+00:00","LCR 151","彩灯装饰记录 III","cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof",1188543288],"1189152973":["贪心及其证明（Python/Java/C++/Go/JS/Rust）","tan-xin-ji-qi-zheng-ming-by-endlesscheng-hfwe","2022-01-09T04:07:33.420770+00:00","2136","全部开花的最早一天","earliest-possible-day-of-full-bloom",1189152973],"119361315":["脑筋急转弯 + 一次遍历","nao-jin-ji-zhuan-wan-by-endlesscheng-75dq","2022-09-25T04:20:14.751370+00:00","2419","按位与最大的最长子数组","longest-subarray-with-maximum-bitwise-and",119361315],"1197839305":["线性做法，不用快速幂（Python/Java/C++/Go）","xian-xing-zuo-fa-bu-yong-kuai-su-mi-pyth-bqhe","2023-02-02T08:21:13.421821+00:00","2524","子数组的最大频率分数","maximum-frequency-score-of-a-subarray",1197839305],"1197966112":["二分答案（附题单！）Python/Java/C++/Go/JS","er-fen-da-an-fu-ti-dan-by-endlesscheng-3jdr","2023-09-17T04:17:00.984194+00:00","2861","最大合金数","maximum-number-of-alloys",1197966112],"1199383198":["线性做法：前缀和+每个位置的最近蜡烛","xian-xing-zuo-fa-qian-zhui-he-mei-ge-wei-b2if","2021-10-30T23:53:10.010526+00:00","2055","蜡烛之间的盘子","plates-between-candles",1199383198],"119954396":["按照时间排序+贪心","an-zhao-shi-jian-pai-xu-tan-xin-by-endle-3wjf","2021-07-04T04:08:24.301158+00:00","1921","消灭怪物的最大数量","eliminate-maximum-number-of-monsters",119954396],"1200771569":["一次遍历","yi-ci-bian-li-by-endlesscheng-65m5","2022-12-25T04:09:46.689583+00:00","2515","到目标字符串的最短距离","shortest-distance-to-target-string-in-a-circular-array",1200771569],"1204439806":["利用 AND 性质+一次遍历（Python/Java/C++/Go/JS/Rust）","li-yong-and-xing-zhi-yi-ci-bian-li-pytho-p3bj","2023-10-01T01:09:14.383203+00:00","2871","将数组分割成最多数目的子数组","split-array-into-maximum-number-of-subarrays",1204439806],"1210455736":["【图解】算法优化+详细证明（Python/Java/C++/Go）","tu-jie-suan-fa-you-hua-xiang-xi-zheng-mi-b6fq","2022-12-10T00:00:54.464832+00:00","1691","堆叠长方体的最大高度","maximum-height-by-stacking-cuboids",1210455736],"1210688937":["问题转化 + 排序贪心（Python/Go/C++/Java）","wen-ti-zhuan-hua-pai-xu-tan-xin-by-endle-bx8t","2023-01-29T04:07:06.461325+00:00","2551","将珠子放入背包中","put-marbles-in-bags",1210688937],"122030614":["阅读理解题（Python/Java/C++/Go/JS）","yue-du-li-jie-ti-pythonjavacgojs-by-endl-ze7f","2023-08-02T00:23:02.437414+00:00","822","翻转卡片游戏","card-flipping-game",122030614],"1229621552":["Go BFS","go-bfs-by-endlesscheng-k2cu","2021-07-11T02:20:44.213995+00:00","1926","迷宫中离入口最近的出口","nearest-exit-from-entrance-in-maze",1229621552],"123288766":["Go 平衡树","go-ping-heng-shu-by-endlesscheng-ihq4","2021-07-13T13:35:37.698078+00:00","729","我的日程安排表 I","my-calendar-i",123288766],"1234415652":["三维 BFS","san-wei-bfs-by-endlesscheng-eebk","2023-05-07T10:43:31.580769+00:00","LCP 79","提取咒文","kjpLFZ",1234415652],"1238608911":["回溯套路秒杀N皇后！视频讲解！（Python/Java/C++/Go/JS）","hui-su-tao-lu-miao-sha-nhuang-hou-shi-pi-mljv","2023-01-28T10:30:58.654825+00:00","51","N 皇后","n-queens",1238608911],"1241705093":["差分数组线性做法（Python/Java/C++/Go/JS）","chai-fen-shu-zu-xian-xing-zuo-fa-by-endl-3xpm","2023-09-10T04:26:47.977984+00:00","2848","与车相交的点","points-that-intersect-with-cars",1241705093],"1243440018":["无需建图，直接朴素 Dijkstra 求最短路（Python/Java/C++/Go）","zhi-jie-qiu-zui-duan-lu-wu-xu-jian-tu-by-i8h7","2023-04-30T04:44:19.031782+00:00","2662","前往目标的最小代价","minimum-cost-of-a-path-with-special-roads",1243440018],"1249919767":["贪心+上取整","tan-xin-shang-qu-zheng-by-endlesscheng-l02f","2021-07-18T04:10:24.582105+00:00","1936","新增的最少台阶数","add-minimum-number-of-rungs",1249919767],"1253336265":["乘法原理+快速幂","cheng-fa-yuan-li-kuai-su-mi-by-endlessch-btkn","2021-07-04T04:09:40.518329+00:00","1922","统计好数字的数目","count-good-numbers",1253336265],"125432943":["贪心+栈优化（Python/Java/C++/Go）","tan-xin-zhan-you-hua-pythonjavacgo-by-en-sp1s","2023-03-12T13:10:19.332762+00:00","LCP 32","批量处理任务","t3fKg1",125432943],"1255527945":["贪心：每次给最小的元素加一","tan-xin-mei-ci-gei-zui-xiao-de-yuan-su-j-jxnl","2022-04-10T04:10:15.752583+00:00","2233","K 次增加后的最大乘积","maximum-product-after-k-increments",1255527945],"1264664962":["简洁写法，无需分类讨论（Python/Java/C++/Go）","jian-ji-xie-fa-wu-xu-fen-lei-tao-lun-pyt-b7yq","2024-02-25T11:16:44.416669+00:00","100225","求交集区域内的最大正方形面积","find-the-largest-area-of-square-inside-two-rectangles",1264664962],"1275579259":["枚举+排序","mei-ju-pai-xu-by-endlesscheng-pblv","2022-12-11T01:12:35.971552+00:00","2497","图中最大星和","maximum-star-sum-of-a-graph",1275579259],"1278269400":["Go 一行解决","go-yi-xing-jie-jue-by-endlesscheng-88c8","2021-08-15T07:30:59.378084+00:00","551","学生出勤记录 I","student-attendance-record-i",1278269400],"1290173910":["按照题意模拟：一次遍历","yi-ci-bian-li-by-endlesscheng-53th","2022-01-02T04:13:39.081804+00:00","2125","银行中的激光束数量","number-of-laser-beams-in-a-bank",1290173910],"1295785983":["模拟","mo-ni-by-endlesscheng-kqzb","2022-12-25T00:12:18.155642+00:00","2512","奖励最顶尖的 K 名学生","reward-top-k-students",1295785983],"1299365979":["O(n) 做法：分解质因子+前缀和+哈希表（Python/Java/C++/Go）","on-zuo-fa-fen-jie-zhi-yin-zi-qian-zhui-h-tnpt","2023-11-26T09:45:23.640566+00:00","2947","统计美丽子字符串 I","count-beautiful-substrings-i",1299365979],"1300693519":["一次遍历，简洁写法（Python/Java/C++/Go/JS/Rust）","yi-ci-bian-li-jian-ji-xie-fa-pythonjavac-c9b1","2024-01-22T00:44:49.367210+00:00","670","最大交换","maximum-swap",1300693519],"1303459038":["O(n) 通用做法（Python/Java/C++/Go）","on-tong-yong-zuo-fa-pythonjavacgo-by-end-oj0d","2023-09-03T12:13:07.602921+00:00","2839","判断通过操作能否让字符串相等 I","check-if-strings-can-be-made-equal-with-operations-i",1303459038],"1304520805":["动态规划","dong-tai-gui-hua-by-endlesscheng-d92a","2021-06-26T16:06:53.115562+00:00","1911","最大子序列交替和","maximum-alternating-subsequence-sum",1304520805],"1304985926":["O(log n) 贪心+二分查找（Python/Java/C++/Go/JS）","olog-n-tan-xin-er-fen-cha-zhao-pythonjav-t3qn","2023-09-17T05:25:52.018382+00:00","2856","删除数对后的最小数组长度","minimum-array-length-after-pair-removals",1304985926],"1308115412":["数位 DP 通用模板，附题单（Python/Java/C++/Go）","by-endlesscheng-x4mf","2022-08-15T11:05:07.787713+00:00","面试题 17.06","2出现的次数","number-of-2s-in-range-lcci",1308115412],"1310138170":["看完这个视频，让你对递归的理解更上一层楼！（Python/Java/C++/Go）","kan-wan-zhe-ge-shi-pin-rang-ni-dui-di-gu-h1j7","2022-12-07T11:14:31.336327+00:00","LCR 175","计算二叉树的深度","er-cha-shu-de-shen-du-lcof",1310138170],"1312828534":["Go 一行","go-yi-xing-by-endlesscheng-7x8c","2021-07-14T03:17:06.917384+00:00","LCR 137","模糊搜索验证","zheng-ze-biao-da-shi-pi-pei-lcof",1312828534],"1320293684":["简洁写法（Python/Java/C++/Go）","jian-ji-xie-fa-pythonjavacgo-by-endlessc-5gps","2024-01-07T01:32:32.196105+00:00","2997","使数组异或和等于 K 的最少操作次数","minimum-number-of-operations-to-make-array-xor-equal-to-k",1320293684],"1322023785":["哈希表扫两遍","ha-xi-biao-sao-liang-bian-by-endlesschen-btuz","2021-10-30T23:13:16.381665+00:00","2053","数组中第 K 个独一无二的字符串","kth-distinct-string-in-an-array",1322023785],"1323143155":["【简洁写法】筛质数+二分查找（Python/Java/C++/Go）","jian-ji-xie-fa-shai-zhi-shu-er-fen-cha-z-wj7i","2023-03-26T05:20:59.943009+00:00","2601","质数减法运算","prime-subtraction-operation",1323143155],"132633492":["理解操作本质+简洁写法（Python/Java/C++/Go/JS/Rust）","li-jie-cao-zuo-ben-zhi-jian-ji-xie-fa-py-b18i","2023-11-30T00:34:24.259901+00:00","1657","确定两个字符串是否接近","determine-if-two-strings-are-close",132633492],"1331620430":["原地堆化 O(1) 空间（Python/Java/C++/Go/JS/Rust）","yuan-di-dui-hua-o1-kong-jian-pythonjavac-29iz","2023-12-23T00:20:46.164514+00:00","1962","移除石子使总数最小","remove-stones-to-minimize-the-total",1331620430],"1341926866":["【视频】彻底掌握直径 DP！从二叉树到一般树！（Python/Java/C++/Go）","shi-pin-che-di-zhang-wo-zhi-jing-dpcong-n9s91","2023-04-14T11:14:00.307738+00:00","124","二叉树中的最大路径和","binary-tree-maximum-path-sum",1341926866],"1351132676":["统计因子出现次数（Python/Java/C++/Go）","tong-ji-yin-zi-chu-xian-ci-shu-by-endles-t5k8","2022-02-20T05:50:44.705608+00:00","2183","统计可以被 K 整除的下标对数目","count-array-pairs-divisible-by-k",1351132676],"1356097871":["统计字母出现次数和最后一次出现的下标（Python/Java/C++/Go）","tong-ji-zi-mu-chu-xian-ci-shu-he-zui-hou-0r5g","2024-02-18T00:36:18.876282+00:00","3039","进行操作使字符串为空","apply-operations-to-make-string-empty",1356097871],"136239889":["前缀最大值+后缀最小值","qian-zhui-zui-da-zhi-hou-zhui-zui-xiao-z-h9qz","2021-09-19T04:07:21.645427+00:00","2012","数组美丽值求和","sum-of-beauty-in-the-array",136239889],"1363331011":["逆向思维 + 位运算 + 哈希表","ni-xiang-si-wei-wei-yun-suan-ha-xi-biao-l4153","2022-01-09T04:10:42.036888+00:00","2135","统计追加字母可以获得的单词数","count-words-obtained-after-adding-a-letter",1363331011],"1363446915":["脑筋急转弯+lowbit优化（Python/Java/C++/Go）","nao-jin-ji-zhuan-wan-pythonjavacgo-by-en-7j89","2023-02-18T16:19:30.611589+00:00","2568","最小无法得到的或值","minimum-impossible-or",1363446915],"1364762739":["DFS + 记一次有趣的 hack","dfs-ji-yi-ci-you-qu-de-hack-by-endlessch-jtsr","2023-05-23T23:57:41.462944+00:00","1377","T 秒后青蛙的位置","frog-position-after-t-seconds",1364762739],"1368794049":["Go 统计每个元素的出现次数","go-tong-ji-mei-ge-yuan-su-de-chu-xian-ci-izr2","2021-12-06T02:03:30.422034+00:00","1940","排序数组之间的最长公共子序列","longest-common-subsequence-between-sorted-arrays",1368794049],"1370775302":["两种 O(n) 做法：刷表法 / 填表法（Python/Java/C++/Go）","by-endlesscheng-2x0z","2022-07-03T04:09:06.442779+00:00","2327","知道秘密的人数","number-of-people-aware-of-a-secret",1370775302],"1375391804":["动态规划","dong-tai-gui-hua-by-endlesscheng-bcmi","2021-09-11T09:41:21.410313+00:00","LCP 43","十字路口的交通","Y1VbOX",1375391804],"1377831845":["O(n) 做法：枚举 nums[j]+前后缀分解（Python/Java/C++/Go）","on-zuo-fa-mei-ju-numsjqian-hou-zhui-fen-xweo4","2023-10-22T08:04:07.243483+00:00","2908","元素和最小的山形三元组 I","minimum-sum-of-mountain-triplets-i",1377831845],"1381994519":["两种写法：自顶向下 / 自底向上（Python/Java/C++/Go）","shu-xing-dp-ji-yi-hua-sou-suo-by-endless-phzx","2023-10-29T04:10:12.018677+00:00","2920","收集所有金币可获得的最大积分","maximum-points-after-collecting-coins-from-all-nodes",1381994519],"1385231803":["子数组统计问题的处理技巧（Python/Java/C++/Go）","by-endlesscheng-men8","2022-07-23T23:22:31.743896+00:00","2348","全 0 子数组的数目","number-of-zero-filled-subarrays",1385231803],"1395581223":["排序+遍历","pai-xu-bian-li-by-endlesscheng-25ww","2021-09-18T16:08:16.877384+00:00","2007","从双倍数组中还原原数组","find-original-array-from-doubled-array",1395581223],"1402633459":["比较 1010... 或 0101... 的最小不同值","bi-jiao-1010-huo-0101-de-zui-xiao-bu-ton-1xpx","2021-05-16T04:07:37.627127+00:00","1864","构成交替字符串需要的最小交换次数","minimum-number-of-swaps-to-make-the-binary-string-alternating",1402633459],"1403965423":["最长不降子序列","zui-chang-fei-jiang-zi-xu-lie-by-endless-x54c","2021-12-19T04:06:57.602389+00:00","2111","使数组 K 递增的最少操作次数","minimum-operations-to-make-the-array-k-increasing",1403965423],"1405611181":["本质是跳跃游戏（Python/Java/C++/Go）","ben-zhi-shi-tiao-yue-you-xi-by-endlessch-8chd","2023-03-05T04:07:38.701273+00:00","2584","分割数组使乘积互质","split-the-array-to-make-coprime-products",1405611181],"1405789151":["遍历（Python/Java/C++/Go/JS/Rust）","mei-ju-by-endlesscheng-p5ju","2023-03-12T04:13:56.265357+00:00","2586","统计范围内的元音字符串数","count-the-number-of-vowel-strings-in-range",1405789151],"1409344146":["O(n) 模拟","on-mo-ni-by-endlesscheng-0plx","2022-03-27T04:08:53.005748+00:00","2215","找出两数组的不同","find-the-difference-of-two-arrays",1409344146],"1420249701":["巧妙设计状态+选或不选（Python/Java/C++/Go）","qiao-miao-she-ji-zhuang-tai-xuan-huo-bu-8547u","2023-10-29T04:11:08.219456+00:00","2919","使数组变美的最小增量运算数","minimum-increment-operations-to-make-array-beautiful",1420249701],"1420390570":["直接交换值：BFS / DFS","zhi-jie-jiao-huan-zhi-by-endlesscheng-o8ze","2022-09-18T04:11:51.439299+00:00","2415","反转二叉树的奇数层","reverse-odd-levels-of-binary-tree",1420390570],"1430651253":["O(n) 一次遍历","on-yi-ci-bian-li-by-endlesscheng-thmm","2021-11-14T04:05:46.101175+00:00","2073","买票需要的时间","time-needed-to-buy-tickets",1430651253],"1434911335":["Go 马拉车算法，附详细注释","go-ma-la-che-suan-fa-fu-xiang-xi-zhu-shi-98xx","2021-08-10T13:12:02.805194+00:00","1960","两个回文子字符串长度的最大乘积","maximum-product-of-the-length-of-two-palindromic-substrings",1434911335],"144023621":["O(N) 后缀数组，击败 100%","on-hou-zhui-shu-zu-by-endlesscheng-jwr2","2021-07-09T02:44:41.535789+00:00","718","最长重复子数组","maximum-length-of-repeated-subarray",144023621],"1449021558":["O(n) 一次遍历","on-yi-ci-bian-li-by-endlesscheng-t4yr","2022-01-23T04:09:02.810914+00:00","2148","元素计数","count-elements-with-strictly-smaller-and-greater-elements",1449021558],"1449546891":["双指针","shuang-zhi-zhen-by-endlesscheng-h553","2023-08-20T02:24:16.809741+00:00","2825","循环增长使字符串子序列等于另一个字符串","make-string-a-subsequence-using-cyclic-increments",1449546891],"1450266090":["排序 + 双指针（Python/Java/C++/Go）","by-endlesscheng-kdy9","2022-05-15T11:35:50.584800+00:00","2271","毯子覆盖的最多白色砖块数","maximum-white-tiles-covered-by-a-carpet",1450266090],"145069778":["Go 子集状压 DP","go-zi-ji-zhuang-ya-dp-by-endlesscheng-h8z0","2021-08-07T04:23:57.878698+00:00","1655","分配重复整数","distribute-repeating-integers",145069778],"1459395051":["三种方法：按照 core 分组 / 枚举 core / 打表预处理（Python/Java/C++/Go/JS）","an-zhao-corei-fen-zu-pythonjavacgo-by-en-i6nu","2023-09-17T04:19:21.110687+00:00","2862","完全子集的最大元素和","maximum-element-sum-of-a-complete-subset-of-indices",1459395051],"1463471392":["排序+滑动窗口","pai-xu-shuang-zhi-zhen-by-endlesscheng-hbqx","2023-07-16T04:09:11.416691+00:00","2779","数组的最大美丽值","maximum-beauty-of-an-array-after-applying-operation",1463471392],"1464742605":["双指针 + O(1) 空间（Python/Java/C++/Go）","by-endlesscheng-b120","2022-06-11T23:29:40.162513+00:00","2302","统计得分小于 K 的子数组数目","count-subarrays-with-score-less-than-k",1464742605],"1466738944":["O(n) 脑筋急转弯（Python/Java/C++/Go）","on-nao-jin-ji-zhuan-wan-pythonjavacgo-by-2lea","2024-01-21T01:13:27.528741+00:00","3012","通过操作使数组长度最小","minimize-length-of-array-using-operations",1466738944],"146862112":["分类讨论+详细证明+简洁写法+优化（Python/Java/C++/Go）","fen-lei-tao-lun-xiang-xi-zheng-ming-jian-sqj2","2022-11-03T23:34:40.301281+00:00","754","到达终点数字","reach-a-number",146862112],"1471696394":["从 O(nlogn) 到 O(n)（Python/Java/C++/Go）","cong-onlogn-dao-onpythonjavacgo-by-endle-gmna","2024-01-21T08:46:48.129358+00:00","3010","将数组分成最小总代价的子数组 I","divide-an-array-into-subarrays-with-minimum-cost-i",1471696394],"1474617560":["【转换】最大子数组和（Python/Java/C++/Go）","zhuan-huan-zui-da-zi-shu-zu-he-pythonjav-6it2","2023-04-01T23:41:16.886175+00:00","2606","找到最大开销的子字符串","find-the-substring-with-maximum-cost",1474617560],"14750873":["两种方法：遍历/枚举因子","bian-li-by-endlesscheng-kst7","2023-07-16T04:11:41.074852+00:00","2778","特殊元素平方和","sum-of-squares-of-special-elements",14750873],"1475483634":["模拟","mo-ni-by-endlesscheng-tuxo","2022-03-06T04:09:28.205178+00:00","2194","Excel 表中某个范围内的单元格","cells-in-a-range-on-an-excel-sheet",1475483634],"147891676":["O(n) 一次遍历（Python/Java/C++/Go）","by-endlesscheng-pq2x","2022-08-20T23:57:50.888796+00:00","2380","二进制字符串重新安排顺序需要的时间","time-needed-to-rearrange-a-binary-string",147891676],"1485423720":["遍历两个 # 之间的字符","mei-ju-liang-ge-zhi-jian-de-zi-fu-by-end-pjq1","2021-09-26T04:12:19.876343+00:00","2018","判断单词是否能放入填字游戏内","check-if-word-can-be-placed-in-crossword",1485423720],"149268417":["同向双指针 + 记录第一条线段的最大覆盖数（Python/Java/C++/Go）","tong-xiang-shuang-zhi-zhen-ji-lu-di-yi-t-5hlh","2023-02-04T16:13:19.508927+00:00","2555","两个线段获得的最多奖品","maximize-win-from-two-segments",149268417],"1493116499":["O(1) 额外空间做法","o1-kong-jian-zuo-fa-by-endlesscheng-lz2r","2023-02-04T16:16:36.707428+00:00","2553","分割数组中数字的数位","separate-the-digits-in-an-array",1493116499],"1497402060":["两种非暴力做法：排序 / 哈希表","fei-bao-li-zuo-fa-by-endlesscheng-9ekp","2022-11-20T04:21:42.376860+00:00","2475","数组中不等三元组的数目","number-of-unequal-triplets-in-array",1497402060],"1501707049":["拆位+化简成一个漂亮的结论（Python/Java/C++/Go）","chai-wei-hua-jian-cheng-yi-ge-piao-liang-pun6","2023-01-07T16:13:29.873864+00:00","2527","查询数组异或美丽值","find-xor-beauty-of-array",1501707049],"1502620621":["DFS 求每个连通块的点数和边数（Python/Java/C++/Go）","dfs-qiu-mei-ge-lian-tong-kuai-de-dian-sh-opg4","2023-05-14T04:10:26.815405+00:00","2685","统计完全连通分量的数量","count-the-number-of-complete-components",1502620621],"1507011086":["计算前后缀 + 简洁写法","ji-suan-qian-hou-zhui-jian-ji-xie-fa-by-b8els","2022-01-30T04:36:03.923779+00:00","2155","分组得分最高的所有下标","all-divisions-with-the-highest-score-of-a-binary-array",1507011086],"1507332922":["【模板】Lazy 线段树（Python/Java/C++/Go/JS）","xian-duan-shu-by-endlesscheng-vx80","2023-02-18T16:10:20.386628+00:00","2569","更新数组后处理求和查询","handling-sum-queries-after-update",1507332922],"1507774284":["库函数模拟","ku-han-shu-mo-ni-by-endlesscheng-95jd","2022-05-08T04:07:50.295156+00:00","2264","字符串中最大的 3 位相同数字","largest-3-same-digit-number-in-string",1507774284],"1512857430":["Go 库函数模拟","go-ku-han-shu-by-endlesscheng-1jx1","2022-05-29T06:14:15.928650+00:00","2288","价格减免","apply-discount-to-prices",1512857430],"1515775640":["一次遍历：记录字母上次出现的位置（Python/Java/C++/Go）","yi-ci-bian-li-ji-lu-zi-mu-shang-ci-chu-x-r6wc","2022-09-04T04:09:17.198778+00:00","2399","检查相同字母间的距离","check-distances-between-same-letters",1515775640],"1518041298":["贪心及其正确性证明","go-tan-xin-by-endlesscheng-7h9n","2021-08-08T04:09:27.862882+00:00","1963","使字符串平衡的最小交换次数","minimum-number-of-swaps-to-make-the-string-balanced",1518041298],"1518510268":["反悔贪心，附题单（Python/Java/C++/Go/JS/Rust）","fan-hui-tan-xin-fu-ti-dan-pythonjavacgoj-hxup","2024-02-06T00:26:07.328645+00:00","LCP 30","魔塔游戏","p0NxJO",1518510268],"1519348229":["【视频】做了N遍还不会？一个视频讲透！（Python/Java/C++/Go/JS/Rust）","zuo-liao-nbian-huan-bu-hui-yi-ge-shi-pin-ukwm","2022-11-16T09:30:04.634527+00:00","42","接雨水","trapping-rain-water",1519348229],"1520385101":["原地堆化 O(1) 空间（附题单）Python/Java/C++/Go/JS/Rust","yuan-di-dui-hua-o1-kong-jian-fu-ti-dan-p-fzdh","2023-10-27T23:57:48.259515+00:00","2558","从数量最多的堆取走礼物","take-gifts-from-the-richest-pile",1520385101],"1523645158":["经典题：树的直径（Python/Java/C++/Go）","by-endlesscheng-92fw","2022-04-17T04:12:08.579295+00:00","2246","相邻字符不同的最长路径","longest-path-with-different-adjacent-characters",1523645158],"1526363744":["Go 模拟","go-mo-ni-by-endlesscheng-92l9","2021-06-27T04:08:47.089115+00:00","1914","循环轮转矩阵","cyclically-rotating-a-grid",1526363744],"1526976016":["暴力+模拟","bao-li-mo-ni-by-endlesscheng-8u6v","2021-12-26T04:08:47.118515+00:00","2120","执行所有后缀指令","execution-of-all-suffix-instructions-staying-in-a-grid",1526976016],"1528579119":["BFS 为什么要用队列？一个视频讲透！（Python/Java/C++/Go/JS/Rust）","bfs-wei-shi-yao-yao-yong-dui-lie-yi-ge-s-wmul","2024-02-14T23:59:31.591592+00:00","107","二叉树的层序遍历 II","binary-tree-level-order-traversal-ii",1528579119],"1529011687":["暴力","bao-li-by-endlesscheng-xh0b","2022-12-18T04:07:20.781190+00:00","2507","使用质因数之和替换后可以取到的最小值","smallest-value-after-replacing-with-sum-of-prime-factors",1529011687],"1535345394":["两种思路：先外后内/出界标记（附题单！）","liang-chong-si-lu-xian-wai-hou-nei-chu-j-b1e4","2023-06-18T00:29:42.656952+00:00","1254","统计封闭岛屿的数目","number-of-closed-islands",1535345394],"1537635707":["脑筋急转弯+一行代码（Python/Java/C++/Go）","nao-jin-ji-zhuan-wan-yi-xing-dai-ma-by-e-0fce","2023-01-22T04:07:16.849019+00:00","2546","执行逐位运算使字符串相等","apply-bitwise-operations-to-make-strings-equal",1537635707],"1538966566":["判断三点共线","pan-duan-san-dian-gong-xian-chao-jian-ji-0n0o","2022-05-22T04:13:32.874938+00:00","2280","表示一个折线图的最少线段数","minimum-lines-to-represent-a-line-chart",1538966566],"1539515792":["单调队列优化 DP（Python/Java/C++/Go）","dan-diao-dui-lie-you-hua-dp-by-endlessch-j5qd","2023-11-26T01:54:23.187309+00:00","2945","找到最大非递减数组的长度","find-maximum-non-decreasing-array-length",1539515792],"1541316145":["Go 模拟","mo-ni-by-endlesscheng-70do","2021-10-03T04:06:49.706453+00:00","2028","找出缺失的观测数据","find-missing-observations",1541316145],"1542173395":["贪心+一次遍历（Python/Java/C++/Go）","mo-ni-by-endlesscheng-bx0d","2022-08-21T04:25:21.708258+00:00","2383","赢得比赛需要的最少训练时长","minimum-hours-of-training-to-win-a-competition",1542173395],"1546633713":["【视频】股票买卖通用方法！教你一步步思考动态规划！（Python/Java/C++/Go/JS/Rust）","shi-pin-gu-piao-mai-mai-tong-yong-fang-f-0u38","2023-10-06T00:28:32.902412+00:00","714","买卖股票的最佳时机含手续费","best-time-to-buy-and-sell-stock-with-transaction-fee",1546633713],"1547023723":["两种写法：KMP+二分查找/双指针（Python/Java/C++/Go）","kmper-fen-cha-zhao-by-endlesscheng-7bjm","2024-01-14T04:18:32.856356+00:00","3008","找出数组中的美丽下标 II","find-beautiful-indices-in-the-given-array-ii",1547023723],"1548254728":["Go 二分","go-er-fen-by-endlesscheng-yal5","2021-06-13T04:09:03.690335+00:00","1898","可移除字符的最大数目","maximum-number-of-removable-characters",1548254728],"1558678323":["BFS 为什么要用队列？一个视频讲透！（Python/Java/C++/Go）","bfs-wei-shi-yao-yao-yong-dui-lie-yi-ge-s-loh4","2023-01-16T07:34:25.283703+00:00","LCR 045","找树左下角的值","LwUNpT",1558678323],"1559330514":["组合数学（Python/Java/C++/Go）","zu-he-shu-xue-pythonjavacgo-by-endlessch-whff","2023-09-03T11:57:54.519765+00:00","2842","统计一个字符串的 k 子序列美丽值最大的数目","count-k-subsequences-of-a-string-with-maximum-beauty",1559330514],"1565798166":["别想太复杂，模拟题罢了！（Python/Java/C++/Go）","bie-xiang-tai-fu-za-mo-ni-ti-ba-liao-pyt-9t87","2023-05-05T14:21:12.577068+00:00","1419","数青蛙","minimum-number-of-frogs-croaking",1565798166],"1567110694":["线段树优化 DP（Python/Java/C++/Go）","zhi-yu-xian-duan-shu-pythonjavacgo-by-en-p1gz","2022-09-11T04:11:37.712895+00:00","2407","最长递增子序列 II","longest-increasing-subsequence-ii",1567110694],"1571048900":["哈希表","ha-xi-biao-by-endlesscheng-k6f5","2022-10-29T23:53:46.127485+00:00","2451","差值数组不同的字符串","odd-string-difference",1571048900],"1576706031":["又写死循环了？一个视频讲透二分！（Python/Java/C++/Go）","by-endlesscheng-9ass","2022-11-23T10:10:26.579288+00:00","162","寻找峰值","find-peak-element",1576706031],"1579629689":["暴力模拟","bao-li-mo-ni-by-endlesscheng-bqba","2022-12-11T04:24:09.278107+00:00","2502","设计内存分配器","design-memory-allocator",1579629689],"1582953363":["结论题：三行搞定（Python/Java/C++/Go）","jie-lun-ti-san-xing-gao-ding-by-endlessc-bvnw","2022-03-20T04:10:47.224962+00:00","2211","统计道路上的碰撞次数","count-collisions-on-a-road",1582953363],"1583176635":["两种方法：最小堆/分治（Python/Java/C++/Go/JS）","liang-chong-fang-fa-zui-xiao-dui-fen-zhi-zbzx","2023-08-12T00:05:51.579273+00:00","23","合并 K 个升序链表","merge-k-sorted-lists",1583176635],"1583349779":["一步步优化！从前缀和到前缀异或和（附题单！）","yi-bu-bu-you-hua-cong-qian-zhui-he-dao-q-yh5p","2023-06-15T00:19:15.694350+00:00","1177","构建回文串检测","can-make-palindrome-from-substring",1583349779],"158335627":["两种 O(n) 方法：照搬 2602 / 考虑距离之和的增量","zhao-ban-2602-ti-by-endlesscheng-6pbi","2023-04-09T04:31:04.938868+00:00","2615","等值距离和","sum-of-distances",158335627],"1584359446":["判断子树点权和是否为 k 的倍数（Python/Java/C++/Go）","pan-duan-zi-shu-dian-quan-he-shi-fou-wei-uvsg","2023-10-01T02:01:17.796867+00:00","2872","可以被 K 整除连通块的最大数目","maximum-number-of-k-divisible-components",1584359446],"1589710386":["【视频】如何思考树形 DP？改成一般树要怎么做？（Python/Java/C++/Go/JS/Rust）","shi-pin-ru-he-si-kao-shu-xing-dpgai-chen-uqsf","2023-09-21T09:02:30.443700+00:00","968","监控二叉树","binary-tree-cameras",1589710386],"1590024460":["脑筋急转弯+排序统计（Python/Java/C++/Go/JS/Rust）","nao-jin-ji-zhuan-wan-pai-xu-tong-ji-pyth-we55","2023-06-11T01:05:23.132769+00:00","2731","移动机器人","movement-of-robots",1590024460],"1599758478":["模拟（代码同 59 题）","by-endlesscheng-4dwy","2022-07-03T04:10:05.918472+00:00","2326","螺旋矩阵 IV","spiral-matrix-iv",1599758478],"1602330770":["按题意实现（Python/Java/C++/Go/JS）","an-ti-yi-shi-xian-by-endlesscheng-a34t","2023-04-23T04:18:15.808581+00:00","2651","计算列车到站时间","calculate-delayed-arrival-time",1602330770],"1603806327":["两种方法：DP / BFS","cong-ji-yi-hua-sou-suo-dao-di-tui-by-end-pgq3","2023-05-14T04:07:35.203807+00:00","2684","矩阵中移动的最大次数","maximum-number-of-moves-in-a-grid",1603806327],"1604381884":["建图 + 暴力枚举所有起点","jian-tu-bao-li-mei-ju-suo-you-qi-dian-by-h4mj","2021-12-11T16:11:56.629648+00:00","2101","引爆最多的炸弹","detonate-the-maximum-bombs",1604381884],"1610031866":["统计 + 倒序枚举（附位运算做法）","tong-ji-dao-xu-mei-ju-by-endlesscheng-5pli","2022-06-19T04:24:26.467729+00:00","2309","兼具大小写的最好英文字母","greatest-english-letter-in-upper-and-lower-case",1610031866],"1614249365":["模拟","mo-ni-by-endlesscheng-gc3m","2022-11-13T04:06:56.927690+00:00","2469","温度转换","convert-the-temperature",1614249365],"1615798591":["模拟","mo-ni-by-endlesscheng-2a18","2022-04-17T04:13:57.779867+00:00","2243","计算字符串的数字和","calculate-digit-sum-of-a-string",1615798591],"1616359180":["暴力枚举","bao-li-mei-ju-by-endlesscheng-afko","2022-10-29T23:58:44.829128+00:00","2452","距离字典两次编辑以内的单词","words-within-two-edits-of-dictionary",1616359180],"1620091732":["转换 + 贪心（Python/Java/C++/Go）","zhuan-huan-tan-xin-pythonjavacgo-by-endl-vdgw","2022-07-17T04:09:24.999931+00:00","2344","使数组可以被整除的最少删除次数","minimum-deletions-to-make-array-divisible",1620091732],"1620549524":["本题最简单写法（Python/Java/C++/Go）","ben-ti-zui-jian-dan-xie-fa-pythonjavacgo-t174","2023-10-22T05:45:03.792395+00:00","2910","合法分组的最少组数","minimum-number-of-groups-to-create-a-valid-assignment",1620549524],"1620554900":["一题双解：贪心+堆 / 差分","by-endlesscheng-ze3t","2022-09-11T04:16:38.965677+00:00","2406","将区间分为最少组数","divide-intervals-into-minimum-number-of-groups",1620554900],"1621119601":["前缀和+哈希表（附题单）Python/Java/C++/Go","qian-zhui-he-ha-xi-biao-fu-ti-dan-python-z61d","2024-02-04T00:58:10.672668+00:00","3026","最大好子数组和","maximum-good-subarray-sum",1621119601],"1627181507":["枚举起点跑 BFS（Python/Java/C++/Go）","mei-ju-qi-dian-pao-bfs-by-endlesscheng-s5bu","2022-12-04T04:14:26.304848+00:00","2493","将节点分成尽可能多的组","divide-nodes-into-the-maximum-number-of-groups",1627181507],"1632602455":["【视频】一个视频秒懂单调队列！附题单！（Python/Java/C++/Go/JS/Rust）","shi-pin-yi-ge-shi-pin-miao-dong-dan-diao-ezj6","2023-10-26T09:28:34.061808+00:00","239","滑动窗口最大值","sliding-window-maximum",1632602455],"1637468390":["巧妙利用性质，维护最大值（Python/Java/C++/Go）","qiao-miao-li-yong-xing-zhi-wei-hu-zui-da-79yx","2023-06-13T23:51:35.881364+00:00","1375","二进制字符串前缀一致的次数","number-of-times-binary-string-is-prefix-aligned",1637468390],"1642092986":["并查集+分组排序","bing-cha-ji-fen-zu-pai-xu-by-endlesschen-kfav","2021-09-05T04:06:56.444113+00:00","1998","数组的最大公因数排序","gcd-sort-of-an-array",1642092986],"164313417":["Go 库函数正则匹配","go-ku-han-shu-zhengz-by-endlesscheng-8c1u","2022-05-13T12:48:56.424216+00:00","44","通配符匹配","wildcard-matching",164313417],"1644032538":["把 1 都聚在一起（Python/Java/C++/Go）","ba-1-du-ju-zai-yi-qi-pythonjavacgo-by-en-rzng","2023-10-08T04:10:54.873220+00:00","2897","对数组执行操作使平方和最大","apply-operations-on-array-to-maximize-sum-of-squares",1644032538],"1645223251":["非暴力做法，分类讨论（Python/Java/C++/Go）","fei-bao-li-zuo-fa-fen-lei-tao-lun-python-p1g2","2023-12-31T04:25:42.032993+00:00","2981","找出出现至少三次的最长特殊子字符串 I","find-longest-special-substring-that-occurs-thrice-i",1645223251],"1645809775":["贪心","tan-xin-by-endlesscheng-kz1d","2021-06-19T07:51:13.015704+00:00","LCS 02","完成一半题目","WqXACV",1645809775],"1648003092":["又写错了？一个视频讲透！O(1) 空间写法（Python/Java/C++/Go/JS/Rust）","you-xie-cuo-liao-yi-ge-shi-pin-jiang-tou-o5zy","2022-11-26T09:41:15.890716+00:00","206","反转链表","reverse-linked-list",1648003092],"1650421130":["转换成求不同元素的个数","zhuan-huan-cheng-qiu-bu-tong-yuan-su-de-vcnq8","2022-07-31T04:06:53.003504+00:00","2357","使数组中所有元素都等于零","make-array-zero-by-subtracting-equal-amounts",1650421130],"1651110316":["没想明白？一张图秒懂！（Python/Java/C++/Go）","mei-xiang-ming-bai-yi-zhang-tu-miao-dong-imvy","2023-03-17T13:44:11.122665+00:00","1616","分割两个字符串得到回文串","split-two-strings-to-make-palindrome",1651110316],"1652287983":["按题意模拟","an-ti-yi-mo-ni-by-endlesscheng-koed","2023-04-23T01:03:18.000284+00:00","LCP 73","探险营地","0Zeoeg",1652287983],"1658221095":["滑动窗口（附题单！）Python/Java/C++/Go","hua-dong-chuang-kou-fu-ti-dan-pythonjava-xvwg","2023-12-10T04:08:15.372761+00:00","2962","统计最大元素出现至少 K 次的子数组","count-subarrays-where-max-element-appears-at-least-k-times",1658221095],"1659259166":["本题最简单写法（Python/Java/C++/Go/JS/Rust）","ben-ti-zui-jian-dan-xie-fa-pythonjavacgo-6a6k","2023-09-29T00:05:30.971055+00:00","605","种花问题","can-place-flowers",1659259166],"1661781078":["Go 前缀和","go-qian-zhui-he-by-endlesscheng-10hh","2021-12-06T03:12:03.968180+00:00","1788","最大化花园的美观度","maximize-the-beauty-of-the-garden",1661781078],"1670099365":["Go 贪心","tan-xin-by-endlesscheng-fwk8","2021-05-29T16:10:22.189449+00:00","1877","数组中最大数对和的最小值","minimize-maximum-pair-sum-in-array",1670099365],"1676080206":["击败 100%！从记忆化搜索到递推，教你一步步思考动态规划！（Python/Java/C++/Go/JS/Rust）","ji-bai-100cong-ji-yi-hua-sou-suo-dao-di-421ab","2023-10-23T23:27:38.621898+00:00","1155","掷骰子等于目标和的方法数","number-of-dice-rolls-with-target-sum",1676080206],"1687003236":["DP 优化技巧：拆项+前后缀最大值","dp-you-hua-ji-qiao-chai-xiang-qian-hou-z-5vvc","2021-07-18T04:06:30.733987+00:00","1937","扣分后的最大得分","maximum-number-of-points-with-cost",1687003236],"1689171801":["两种做法：枚举+考虑变化量 / 中位数贪心","by-endlesscheng-i10r","2022-10-23T08:19:58.724437+00:00","2448","使数组相等的最小开销","minimum-cost-to-make-array-equal",1689171801],"1691357385":["【转换】中位数贪心+裴蜀定理（Python/Java/C++/Go）","zhuan-huan-zhong-wei-shu-tan-xin-pei-shu-4dut","2023-04-01T23:21:53.330520+00:00","2607","使子数组元素和相等","make-k-subarray-sums-equal",1691357385],"169260234":["两种做法：记忆化搜索 / 递推（Python/Java/C++/Go）","ji-yi-hua-sou-suo-by-endlesscheng-qctr","2022-11-06T04:07:51.028782+00:00","2463","最小移动总距离","minimum-total-distance-traveled",169260234],"169616499":["简洁写法（Python/Java/C++/Go/JS）","jian-ji-xie-fa-pythonjavacgojs-by-endles-gwxt","2023-08-25T00:28:55.719334+00:00","1448","统计二叉树中好节点的数目","count-good-nodes-in-binary-tree",169616499],"1697537146":["【模板】多重背包求方案数（Python/Java/C++/Go）","fen-zu-bei-bao-pythonjavacgo-by-endlessc-ludl","2023-03-05T04:06:53.368913+00:00","2585","获得分数的方法数","number-of-ways-to-earn-points",1697537146],"1698302709":["教你一步步思考动态规划：从记忆化搜索到递推（两种状态定义+题单）Python/Java/C++/Go/JS/Rust","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-9y5k","2023-12-26T00:51:10.770954+00:00","1349","参加考试的最大学生数","maximum-students-taking-exam",1698302709],"170017720":["Go 模拟","go-mo-ni-by-endlesscheng-w4it","2021-09-19T04:06:46.866797+00:00","2011","执行操作后的变量值","final-value-of-variable-after-performing-operations",170017720],"1700620911":["状态设计+BFS ","zhuang-tai-she-ji-bfs-by-endlesscheng-nf0j","2021-09-25T10:07:14.534832+00:00","LCP 45","自行车炫技赛场","kplEvH",1700620911],"1708402068":["三种方法：二分答案+数位 DP/数学公式/逐位构造（Python/Java/C++/Go）","er-fen-da-an-shu-wei-dpwei-yun-suan-pyth-tkir","2024-01-14T04:10:06.179077+00:00","3007","价值和小于等于 K 的最大数字","maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k",1708402068],"1709868853":["预处理 s 中的所有数字（Python/Java/C++/Go）","yu-chu-li-suo-you-s-zhong-de-shu-zi-by-e-yxl2","2023-02-12T04:14:55.138619+00:00","2564","子字符串异或查询","substring-xor-queries",1709868853],"1712826586":["二分答案（视频讲解）","er-fen-da-an-by-endlesscheng-y8fp","2022-12-25T00:53:33.039196+00:00","2513","最小化两个数组中的最大值","minimize-the-maximum-of-two-arrays",1712826586],"1715714434":["DFS+记录深度和父节点（Python/Java/C++/Go）","liang-chong-dfs-xie-fa-pythonjavacgojsru-wzb2","2024-02-08T00:53:07.748906+00:00","993","二叉树的堂兄弟节点","cousins-in-binary-tree",1715714434],"1716625654":["暴力枚举 + 哈希表","mo-ni-ha-xi-biao-by-endlesscheng-ncai","2022-03-13T04:10:20.970623+00:00","2201","统计可以提取的工件","count-artifacts-that-can-be-extracted",1716625654],"1717938721":["【图解】一张图秒懂 LFU！（Python/Java/C++/Go/JS/Rust）","tu-jie-yi-zhang-tu-miao-dong-lfupythonja-f56h","2023-09-25T00:24:52.685904+00:00","460","LFU 缓存","lfu-cache",1717938721],"1723985703":["结合性质巧妙 DP（Python/Java/C++/Go）","jie-he-xing-zhi-qiao-miao-dp-by-endlessc-b963","2022-02-27T04:11:36.332389+00:00","2188","完成比赛的最少时间","minimum-time-to-finish-the-race",1723985703],"1725183127":["模拟（Python/Java/C++/Go）","mo-ni-pythonjavacgo-by-endlesscheng-42qp","2023-05-07T05:02:22.291843+00:00","2672","有相同颜色的相邻元素数目","number-of-adjacent-elements-with-the-same-color",1725183127],"1728101846":["Go 预处理优化","go-yu-chu-li-you-hua-by-endlesscheng-61mj","2021-07-11T02:01:25.766437+00:00","1925","统计平方和三元组的数目","count-square-sum-triples",1728101846],"1729291424":["逐个考虑每一个比特位","by-endlesscheng-dwja","2022-05-15T08:52:55.001614+00:00","2275","按位与结果大于零的最长组合","largest-combination-with-bitwise-and-greater-than-zero",1729291424],"1732202044":["遍历+利用性质简化代码","bian-li-by-endlesscheng-hi82","2023-01-15T04:13:52.920309+00:00","2535","数组元素和与数字和的绝对差","difference-between-element-sum-and-digit-sum-of-an-array",1732202044],"173367747":["O(1) 做法！位运算的巧妙运用！（Python/Java/C++/Go）","o1-zuo-fa-wei-yun-suan-de-qiao-miao-yun-lvnvr","2023-11-19T04:07:44.463448+00:00","2939","最大异或乘积","maximum-xor-product",173367747],"1737726232":["哈希表模拟","ha-xi-biao-mo-ni-by-endlesscheng-6p09","2022-04-03T04:08:20.813274+00:00","2225","找出输掉零场或一场比赛的玩家","find-players-with-zero-or-one-losses",1737726232],"1742923454":["教你一步步思考动态规划！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-hzz6","2023-06-27T00:47:32.632311+00:00","1186","删除一次得到子数组最大和","maximum-subarray-sum-with-one-deletion",1742923454],"1744896373":["击败 100%！从递归到递推到优化，教你一步步思考动态规划！（Python/Java/C++/Go/JS）","ji-bai-100cong-di-gui-dao-di-tui-dao-you-dxz5","2023-08-17T00:04:32.584109+00:00","1444","切披萨的方案数","number-of-ways-of-cutting-a-pizza",1744896373],"1749795074":["从大往小贪心 + 简洁写法","by-endlesscheng-kt0y","2022-04-03T04:08:48.945608+00:00","2224","转化时间需要的最少操作数","minimum-number-of-operations-to-convert-time",1749795074],"1751494517":["分类讨论（Python/Java/C++/Go/JS/Rust）","fen-lei-tao-lun-by-endlesscheng-aerr","2023-01-08T00:31:04.266560+00:00","2525","根据规则将箱子分类","categorize-box-according-to-criteria",1751494517],"1766481102":["暴力枚举","bao-li-mei-ju-by-endlesscheng-nz2g","2023-04-16T04:19:28.514577+00:00","2644","找出可整除性得分最大的整数","find-the-maximum-divisibility-score",1766481102],"177009894":["简单数学","mo-ni-by-endlesscheng-fidq","2022-02-19T16:11:00.011687+00:00","2177","找到和为给定整数的三个连续整数","find-three-consecutive-integers-that-sum-to-a-given-number",177009894],"1770113758":["原地修改算法，O(1) 额外空间","jian-ji-xie-fa-by-endlesscheng-c4gf","2022-02-20T05:51:56.879210+00:00","2181","合并零之间的节点","merge-nodes-in-between-zeros",1770113758],"1775341601":["按照拓扑序 DP","an-zhao-tuo-bu-xu-dp-by-endlesscheng-2n4g","2021-05-09T04:05:53.201411+00:00","1857","有向图中最大颜色值","largest-color-value-in-a-directed-graph",1775341601],"1779771436":["动态规划：从记忆化搜索到递推（Python/Java/C++/Go）","dong-tai-gui-hua-cong-ji-yi-hua-sou-suo-wtd7a","2023-05-28T01:15:05.832258+00:00","2707","字符串中的额外字符","extra-characters-in-a-string",1779771436],"1782593021":["O(1) 数学公式，一行搞定（Python/Java/C++/Go）","o1-shu-xue-gong-shi-yi-xing-gao-ding-pyt-m5cq","2023-10-08T04:17:41.738023+00:00","2894","分类求和并作差","divisible-and-non-divisible-sums-difference",1782593021],"1783870964":["简洁模拟 + O(1) 空间","o-by-endlesscheng-952i","2022-04-02T16:13:29.403035+00:00","2221","数组的三角和","find-triangular-sum-of-an-array",1783870964],"1784527717":["O(n) 滑动窗口（Python/Java/C++/Go/JS）","on-hua-dong-chuang-kou-by-endlesscheng-9ztb","2023-07-30T04:21:54.727137+00:00","2799","统计完全子数组的数目","count-complete-subarrays-in-an-array",1784527717],"1785363546":["转换成逆序对模型（Python/Java/C++/Go）","by-endlesscheng-9prc","2022-10-02T01:01:48.005188+00:00","2426","满足不等式的数对数目","number-of-pairs-satisfying-inequality",1785363546],"1785554828":["证明：至多循环 6 次（Python/Java/C++/Go）","zheng-ming-zhi-duo-xun-huan-6-ci-pythonj-b6sj","2023-03-01T14:38:51.401430+00:00","面试题 05.02","二进制数转字符串","binary-number-to-string-lcci",1785554828],"1785562293":["脑筋急转弯","nao-jin-ji-zhuan-wan-by-endlesscheng-9l4m","2023-02-18T16:13:55.771593+00:00","2567","修改两个元素的最小分数","minimum-score-by-changing-two-elements",1785562293],"178720857":["贪心（Python/Java/C++/Go）","tan-xin-pythonjavacgo-by-endlesscheng-yix5","2023-04-30T04:07:44.632421+00:00","2663","字典序最小的美丽字符串","lexicographically-smallest-beautiful-string",178720857],"1787510201":["区间 DP+哈希表","qu-jian-dpha-xi-biao-by-endlesscheng-62fj","2021-09-26T06:26:48.199513+00:00","2019","解出数学表达式的学生分数","the-score-of-students-solving-math-expression",1787510201],"1795607316":["离散化+二维差分（Python/Java/C++/Go）","chi-san-hua-er-wei-chai-fen-by-endlessch-q43z","2023-04-22T09:50:47.026935+00:00","LCP 74","最强祝福力场","xepqZ5",1795607316],"1796150705":["三种算法+优化（Python/Java/C++/Go）","san-chong-suan-fa-you-hua-pythonjavacgo-tk4cj","2023-05-09T15:39:53.511980+00:00","1015","可被 K 整除的最小整数","smallest-integer-divisible-by-k",1796150705],"1814552069":["O(n^2) 前缀和+哈希表","on2-qian-zhui-he-ha-xi-biao-by-endlessch-iae7","2021-12-06T05:37:01.164460+00:00","548","将数组分割成和相等的子数组","split-array-with-equal-sum",1814552069],"1816814719":["双指针，O(n) 时间 O(1) 空间（Python/Java/C++/Go）","shuang-zhi-zhen-on-shi-jian-o1-kong-jian-3fl2","2023-12-24T01:14:06.394608+00:00","2970","统计移除递增子数组的数目 I","count-the-number-of-incremovable-subarrays-i",1816814719],"1819395589":["简洁写法：排序+一次遍历（Python/Java/C++/Go）","jian-ji-xie-fa-pai-xu-yi-ci-bian-li-by-e-unnb","2021-09-05T04:07:53.955079+00:00","1996","游戏中弱角色的数量","the-number-of-weak-characters-in-the-game",1819395589],"1825399219":["【一图秒懂】枚举起点跑 BFS（Python/Java/C++/Go）","yi-tu-miao-dong-mei-ju-qi-dian-pao-bfspy-ntck","2023-04-01T22:49:25.771043+00:00","2608","图中的最短环","shortest-cycle-in-a-graph",1825399219],"1829348697":["枚举（Python/Java/C++/Go）","mei-ju-pythonjavacgo-by-endlesscheng-enj0","2024-02-18T04:50:29.990328+00:00","3044","出现频率最高的质数","most-frequent-prime",1829348697],"183030256":["模拟（Python/Java/C++/Go/JS）","mo-ni-by-endlesscheng-cmsg","2023-05-14T04:10:57.587657+00:00","2682","找出转圈游戏输家","find-the-losers-of-the-circular-game",183030256],"184027593":["【视频】回溯不会写？套路在此！（Python/Java/C++/Go）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-3orv","2023-01-13T01:39:54.943391+00:00","17","电话号码的字母组合","letter-combinations-of-a-phone-number",184027593],"1840603422":["【视频】如何灵活运用递归？（Python/Java/C++/Go/JS/Rust）","ru-he-ling-huo-yun-yong-di-gui-lai-kan-s-empk","2022-12-10T10:03:46.818837+00:00","100","相同的树","same-tree",1840603422],"1850921957":["贪心：排序+奇偶分组（Python/Java/C++/Go/JS/Rust）","tan-xin-by-endlesscheng-x2o6","2023-03-04T16:15:34.791934+00:00","2578","最小和分割","split-with-minimum-sum",1850921957],"1853031865":["贪心，简洁写法（Python/Java/C++/Go）","tan-xin-jian-ji-xie-fa-pythonjavacgo-by-5svh1","2023-05-07T04:40:58.447896+00:00","2673","使二叉树所有路径值相等的最小代价","make-costs-of-paths-equal-in-a-binary-tree",1853031865],"1853208613":["计算 gcd(a,b) 的因子（Python/Java/C++/Go）","mei-ju-yin-zi-by-endlesscheng-v3fb","2022-10-02T04:08:40.454009+00:00","2427","公因子的数目","number-of-common-factors",1853208613],"1856172895":["O(n) 做法：双指针 + 单调队列（Python/Java/C++/Go）","by-endlesscheng-7ukp","2022-09-04T00:04:45.113603+00:00","2398","预算内的最多机器人数目","maximum-number-of-robots-within-budget",1856172895],"1857526630":["逆向思维（Python/Java/C++/Go）","ni-xiang-si-wei-pythonjavacgo-by-endless-915k","2023-05-14T14:06:01.799743+00:00","1072","按列翻转得到最大值等行数","flip-columns-for-maximum-number-of-equal-rows",1857526630],"1859819274":["Go map","go-map-by-endlesscheng-i2xz","2021-05-16T04:18:44.408373+00:00","1865","找出和为指定值的下标对","finding-pairs-with-a-certain-sum",1859819274],"1866851323":["差分数组（Python/Java/C++/Go/JS）","chai-fen-shu-zu-pythonjavacgojs-by-endle-8qrt","2023-07-09T04:07:48.353336+00:00","2772","使数组中的所有元素都等于零","apply-operations-to-make-all-array-elements-equal-to-zero",1866851323],"1871665913":["简洁写法，避免计算出 -1","jian-ji-xie-fa-by-endlesscheng-egqb","2021-06-20T04:07:40.812292+00:00","1904","你完成的完整对局数","the-number-of-full-rounds-you-have-played",1871665913],"1872112615":["做了N遍还不会？一个视频讲透！（Python/Java/C++/Go/JS/Rust）","by-endlesscheng-f0xz","2022-11-16T09:28:54.597543+00:00","11","盛最多水的容器","container-with-most-water",1872112615],"1872980159":["【图解单调栈】两种方法，两张图秒懂！附题单（Python/Java/C++/Go）","tu-jie-dan-diao-zhan-liang-chong-fang-fa-v9ab","2023-04-09T15:52:19.531679+00:00","1019","链表中的下一个更大节点","next-greater-node-in-linked-list",1872980159],"1876544260":["根据二叉搜索树的性质合并","gen-ju-er-cha-sou-suo-shu-de-xing-zhi-he-v8sv","2021-07-11T06:00:50.045177+00:00","1932","合并多棵二叉搜索树","merge-bsts-to-create-single-bst",1876544260],"1878147567":["两种方法：KMP / Z函数（Python/Java/C++/Go）","liang-chong-fang-fa-kmp-zhan-shu-pythonj-zil4","2024-02-11T04:31:00.476311+00:00","3036","匹配模式数组的子数组数目 II","number-of-subarrays-that-match-a-pattern-ii",1878147567],"1879020884":["滑动窗口（附题单！）Python/Java/C++/Go","hua-dong-chuang-kou-fu-ti-dan-pythonjava-2vd6","2023-09-03T11:26:54.949597+00:00","2841","几乎唯一子数组的最大和","maximum-sum-of-almost-unique-subarray",1879020884],"188352287":["等价转换 + 利用单调性（Python/Java/C++/Go）","by-endlesscheng-s2yc","2022-05-29T05:07:12.167208+00:00","2289","使数组按非递减顺序排列","steps-to-make-array-non-decreasing",188352287],"1890921841":["教你一次性把代码写对！O(n) 分组循环（Python/Java/C++/Go）","jiao-ni-yi-ci-xing-ba-dai-ma-xie-dui-on-j3nik","2024-01-21T00:48:17.463730+00:00","3011","判断一个数组是否可以变为有序","find-if-array-can-be-sorted",1890921841],"1894806233":["线性做法（Python/Java/C++/Go）","xian-xing-zuo-fa-pythonjavacgo-by-endles-e04u","2023-12-10T01:03:24.744669+00:00","2956","找到两个数组中的公共元素","find-common-elements-between-two-arrays",1894806233],"1896099954":["没看懂题意？一张图秒懂（Python/Java/C++/Go/JS/Rust）","mei-kan-dong-ti-yi-yi-zhang-tu-miao-dong-8zps","2023-10-28T23:38:53.147170+00:00","274","H 指数","h-index",1896099954],"1896286191":["BFS 求次短路，附详细注释","bfs-qiu-ci-duan-lu-fu-xiang-xi-zhu-shi-b-igf7","2021-10-17T04:06:10.097623+00:00","2045","到达目的地的第二短时间","second-minimum-time-to-reach-destination",1896286191],"1903617238":["O(n) 分类讨论 + 贪心（Python/Java/C++/Go）","fen-lei-tao-lun-tan-xin-by-endlesscheng-vnlx","2022-06-19T04:08:14.020729+00:00","2311","小于等于 K 的最长二进制子序列","longest-binary-subsequence-less-than-or-equal-to-k",1903617238],"1908656857":["脑筋急转弯：一行代码","nao-jin-ji-zhuan-wan-yi-xing-dai-ma-by-e-yfn0","2023-08-27T04:15:34.835277+00:00","2833","距离原点最远的点","furthest-point-from-origin",1908656857],"1910869482":["教你一步步思考动态规划！一个视频讲透！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-s1cx","2023-02-18T12:31:31.065482+00:00","494","目标和","target-sum",1910869482],"1913049602":["两种方法：二进制枚举 / Gosper's Hack（Python/Java/C++/Go）","by-endlesscheng-dvxe","2022-09-04T00:57:50.089683+00:00","2397","被列覆盖的最多行数","maximum-rows-covered-by-columns",1913049602],"1913772288":["两种方法：回溯/动态规划（Python/Java/C++/Go）","tao-lu-zi-ji-xing-hui-su-pythonjavacgo-b-fcgs","2023-03-19T04:09:34.732942+00:00","2597","美丽子集的数目","the-number-of-beautiful-subsets",1913772288],"1915453170":["O(n) 做法：统计小于和等于 target 的元素个数","on-zuo-fa-tong-ji-xiao-yu-he-deng-yu-tar-7ejk","2021-11-28T04:07:43.613775+00:00","2089","找出数组排序后的目标下标","find-target-indices-after-sorting-array",1915453170],"1915472102":["两种方法：从 O(n^2) 到 O(n)（Python/Java/C++/Go）","ji-yi-hua-sou-suo-by-endlesscheng-64vq","2023-10-08T04:12:01.272942+00:00","2896","执行操作使两个字符串相等","apply-operations-to-make-two-strings-equal",1915472102],"1915862517":["【模板】树上倍增（Python/Java/C++/Go）","shu-shang-bei-zeng-by-endlesscheng-xvsv","2023-08-27T04:11:03.805536+00:00","2836","在传球游戏中最大化函数值","maximize-value-of-function-in-a-ball-passing-game",1915862517],"1916400350":["教你一步步思考动态规划！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-rq5i","2023-04-18T14:49:54.161114+00:00","1043","分隔数组以得到最大和","partition-array-for-maximum-sum",1916400350],"1922249884":["O(n) 分段遍历（Python/Java/C++/Go/JS/Rust）","o1-kong-jian-jian-ji-xie-fa-pythonjavacg-u8g3","2023-04-02T05:34:05.147974+00:00","2609","最长平衡子字符串","find-the-longest-balanced-substring-of-a-binary-string",1922249884],"1927271954":["两种做法：哈希表 / 位运算","liang-chong-zuo-fa-ha-xi-biao-wei-yun-su-k69f","2023-04-01T23:45:33.447359+00:00","2605","从两个数字数组里生成最小数字","form-smallest-number-from-two-digit-arrays",1927271954],"1931269506":["一边遍历，一边计算","yi-bian-bian-li-yi-bian-ji-suan-by-endle-ep7x","2023-04-15T16:14:51.807518+00:00","2640","一个数组所有前缀的分数","find-the-score-of-all-prefixes-of-an-array",1931269506],"1933270834":["教你一步步思考动态规划：从记忆化搜索到递推（Python/Java/C++/Go/JS/Rust）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-j99e","2023-12-17T00:15:07.623644+00:00","746","使用最小花费爬楼梯","min-cost-climbing-stairs",1933270834],"1941288004":["三种方法：DFS/BFS/BFS+链表（附题单）Python/Java/C++/Go/JS","san-chong-fang-fa-dfsbfsbfslian-biao-fu-1bmqp","2023-11-02T23:07:26.693061+00:00","117","填充每个节点的下一个右侧节点指针 II","populating-next-right-pointers-in-each-node-ii",1941288004],"1944526967":["动态规划 + 二分查找优化（Python/Java/C++/Go）","dong-tai-gui-hua-er-fen-cha-zhao-you-hua-fuip","2022-10-21T23:35:32.083584+00:00","1751","最多可以参加的会议数目 II","maximum-number-of-events-that-can-be-attended-ii",1944526967],"1947285534":["双指针模拟","shuang-zhi-zhen-mo-ni-by-endlesscheng-9l76","2021-12-12T04:07:55.455217+00:00","2105","给植物浇水 II","watering-plants-ii",1947285534],"1950501535":["简洁写法：从大到小贪心","cong-da-dao-xiao-tan-xin-by-endlesscheng-b7ob","2022-02-20T05:51:14.696226+00:00","2182","构造限制重复的字符串","construct-string-with-repeat-limit",1950501535],"1952470548":["Go 一行","go-yi-xing-by-endlesscheng-p92z","2021-12-26T04:09:36.020416+00:00","2119","反转两次的数字","a-number-after-a-double-reversal",1952470548],"1954801587":["详细解释为什么要按照 a[i]+b[i] 排序（Python/Java/C++/Go/JS/Rust）","xiang-xi-jie-shi-wei-shi-yao-yao-an-zhao-0zsg","2024-02-02T00:43:37.577750+00:00","1686","石子游戏 VI","stone-game-vi",1954801587],"1955132435":["【视频】彻底掌握直径 DP！从二叉树到一般树！（Python/Java/C++/Go）","shi-pin-che-di-zhang-wo-zhi-jing-dpcong-6aoh9","2023-04-15T05:21:49.895988+00:00","LCR 051","二叉树中的最大路径和","jC7MId",1955132435],"1962061945":["贪心+前后缀分解（Python/Java/C++/Go）","tan-xin-qian-hou-zhui-fen-jie-pythonjava-wrv1","2023-05-13T16:12:35.055301+00:00","2680","最大或值","maximum-or",1962061945],"1962595835":["从大到小排序贪心","cong-da-dao-xiao-pai-xu-tan-xin-by-endle-smhf","2022-01-22T16:14:26.898990+00:00","2144","打折购买糖果的最小开销","minimum-cost-of-buying-candies-with-discount",1962595835],"1965849899":["用归纳法思考（Python/Java/C++/Go）","yong-gui-na-fa-si-kao-pythonjavacgo-by-e-8etj","2023-12-03T04:07:39.918169+00:00","2952","需要添加的硬币的最小数量","minimum-number-of-coins-to-be-added",1965849899],"1971257507":["教你一步步思考动态规划！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-f5k9","2023-03-01T01:43:57.593088+00:00","LCR 095","最长公共子序列","qJnOS7",1971257507],"19753391":["O(n) 前后缀分解+单调栈（Python/Java/C++/Go）","on-qian-hou-zhui-fen-jie-dan-diao-zhan-p-w3g0","2023-09-24T04:14:06.314918+00:00","2865","美丽塔 I","beautiful-towers-i",19753391],"1975607113":["利用或运算的性质 + 通用模板（Python/Java/C++/Go）","by-endlesscheng-zai1","2022-09-18T00:05:44.366531+00:00","2411","按位或最大的最小子数组长度","smallest-subarrays-with-maximum-bitwise-or",1975607113],"1980479000":["前缀和，或者二分位置","er-fen-wei-zhi-by-endlesscheng-zxky","2021-06-20T04:09:49.048037+00:00","1906","查询差绝对值的最小值","minimum-absolute-difference-queries",1980479000],"1982730574":["O(n) 做法：双指针+维护最大最小（Python/Java/C++/Go）","on-zuo-fa-shuang-zhi-zhen-wei-hu-zui-da-rkbk9","2023-10-15T04:20:57.442293+00:00","2903","找出满足差值条件的下标 I","find-indices-with-index-and-value-difference-i",1982730574],"1983440257":["几种不同的写法（Python/Java/C++/Go/JS）","ji-chong-bu-tong-de-xie-fa-pythonjavacgo-9trb","2023-08-06T23:55:50.683157+00:00","344","反转字符串","reverse-string",1983440257],"1988055821":["暴力枚举模拟","mei-ju-by-endlesscheng-5wzf","2022-09-24T14:59:05.293236+00:00","LCP 63","弹珠游戏","EXvqDp",1988055821],"1992185659":["二分查找总是写不对？一个视频讲透！（Python/Java/C++/Go）","er-fen-cha-zhao-zong-shi-xie-bu-dui-yi-g-eplk","2022-12-17T00:50:13.186116+00:00","704","二分查找","binary-search",1992185659],"199553622":["Go 模拟","go-mo-ni-by-endlesscheng-968e","2021-07-25T04:08:52.765538+00:00","1945","字符串转化后的各位数字之和","sum-of-digits-of-string-after-convert",199553622],"1997275023":["两种递归思路（Python/Java/C++/Go/JS）","liang-chong-di-gui-si-lu-pythonjavacgojs-xxnk","2023-09-05T23:52:06.535674+00:00","1123","最深叶节点的最近公共祖先","lowest-common-ancestor-of-deepest-leaves",1997275023],"1997404036":["模拟：将 encodedText 视作二维矩阵","mo-ni-jiang-encodedtext-shi-zuo-er-wei-j-ixba","2021-11-14T04:06:28.043091+00:00","2075","解码斜向换位密码","decode-the-slanted-ciphertext",1997404036],"2000679742":["【模板讲解】树上倍增算法（以及最近公共祖先）","mo-ban-jiang-jie-shu-shang-bei-zeng-suan-v3rw","2023-06-12T00:19:58.829459+00:00","1483","树节点的第 K 个祖先","kth-ancestor-of-a-tree-node",2000679742],"2001412357":["【图解】一张图秒懂 LRU！（Python/Java/C++/Go/JS/Rust）","tu-jie-yi-zhang-tu-miao-dong-lrupythonja-czgt","2023-09-24T00:07:08.752627+00:00","146","LRU 缓存","lru-cache",2001412357],"2001540741":["两种算法：贪心/动态规划（Python/Java/C++/Go）","liang-chong-suan-fa-tan-xin-dong-tai-gui-tsll","2023-06-19T00:45:49.841889+00:00","1262","可被三整除的最大和","greatest-sum-divisible-by-three",2001540741],"2003223492":["回溯不会写？套路在此！（Python/Java/C++/Go）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-6zca","2023-02-01T12:07:24.461774+00:00","LCR 080","组合","uUsW3B",2003223492],"2005932973":["【图解】简洁高效，一图秒懂！（Python/Java/C++/Go/JS/Rust）","tu-jie-jian-ji-gao-xiao-yi-tu-miao-dong-1427d","2023-11-03T23:48:43.909751+00:00","421","数组中两个数的最大异或值","maximum-xor-of-two-numbers-in-an-array",2005932973],"2006725411":["教你一步步思考动态规划：从记忆化搜索到递推（Python/Java/C++/Go/JS/Rust）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-7zm1","2023-12-10T00:36:40.241091+00:00","70","爬楼梯","climbing-stairs",2006725411],"2007370712":["简洁写法 / O(1) 空间写法","jian-ji-xie-fa-by-endlesscheng-xudg","2023-04-15T16:24:35.408878+00:00","2639","查询网格图中每一列的宽度","find-the-width-of-columns-of-a-grid",2007370712],"2012982950":["差分（Python 简洁写法）","by-endlesscheng-z0ad","2022-08-20T23:00:23.237228+00:00","2381","字母移位 II","shifting-letters-ii",2012982950],"2019191135":["二分查找的灵活运用！（Python/Java/C++/Go）","er-fen-cha-zhao-de-ling-huo-yun-yong-by-wplbj","2023-02-12T04:21:48.682623+00:00","2563","统计公平数对的数目","count-the-number-of-fair-pairs",2019191135],"2027773900":["暴搜+剪枝","bao-sou-jian-zhi-by-endlesscheng-iv6z","2021-11-07T04:06:15.337350+00:00","2065","最大化一张图中的路径价值","maximum-path-quality-of-a-graph",2027773900],"2036642817":["O(1) 空间写法（Python/Java/C++/Go/JS/Rust）","o1-kong-jian-xie-fa-by-endlesscheng-4vbi","2023-02-12T04:26:40.823314+00:00","2562","找出数组的串联值","find-the-array-concatenation-value",2036642817],"2048723677":["教你一步步思考动态规划！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-wdkm","2023-04-26T13:52:37.970763+00:00","1048","最长字符串链","longest-string-chain",2048723677],"2049140185":["两个有序集合维护前 k-1 小（Python/Java/C++/Go）","liang-ge-you-xu-ji-he-wei-hu-qian-k-1-xi-zdzx","2024-01-21T12:42:38.399784+00:00","3013","将数组分成最小总代价的子数组 II","divide-an-array-into-subarrays-with-minimum-cost-ii",2049140185],"2051273831":["两种模拟思路","liang-chong-mo-ni-si-lu-by-endlesscheng-axsc","2023-06-18T09:06:33.265561+00:00","2739","总行驶距离","total-distance-traveled",2051273831],"205364228":["最长递增子序列：从 O(n^2) 到 O(nlogn)（Python/Java/C++/Go）","zui-chang-di-zeng-zi-xu-lie-cong-on2-dao-ojqu","2023-03-21T14:54:42.052476+00:00","1626","无矛盾的最佳球队","best-team-with-no-conflicts",205364228],"2055099648":["排序 + 贪心","by-endlesscheng-iik6","2022-05-22T04:13:19.831105+00:00","2279","装满石头的背包的最大数量","maximum-bags-with-full-capacity-of-rocks",2055099648],"2057246561":["库函数简洁写法","ku-han-shu-jian-ji-xie-fa-by-endlesschen-ajmb","2023-12-22T08:48:26.526845+00:00","2936","包含相等值数字块的数量","number-of-equal-numbers-blocks",2057246561],"2062472427":["两种思路：树状数组模拟/挖掘性质（Python/Java/C++/Go）","shu-zhuang-shu-zu-mo-ni-pythonjavacgo-by-ygvb","2023-04-29T16:09:33.238382+00:00","2659","将数组清空","make-array-empty",2062472427],"2066860654":["【视频】讲清楚为什么要用单调栈！两种写法：从右到左/从左到右（Python/Java/C++/Go/JS/Rust）","shi-pin-jiang-qing-chu-wei-shi-yao-yao-y-k0ks","2023-10-06T12:04:21.092857+00:00","739","每日温度","daily-temperatures",2066860654],"2070962878":["O(mn) 动态规划","dong-tai-gui-hua-by-endlesscheng-depp","2021-11-27T16:16:45.157744+00:00","2088","统计农场中肥沃金字塔的数目","count-fertile-pyramids-in-a-land",2070962878],"2074713320":["分类讨论 + O(1) 做法（Python/Java/C++/Go）","fen-lei-tao-lun-o1-zuo-fa-by-endlesschen-95ef","2023-03-18T16:08:21.118839+00:00","2591","将钱分给最多的儿童","distribute-money-to-maximum-children",2074713320],"2077283915":["枚举答案（Python/Java/C++/Go）","mei-ju-da-an-pythonjavacgo-by-endlessche-t4co","2023-06-25T04:07:32.835642+00:00","2749","得到整数零需要执行的最少操作数","minimum-operations-to-make-the-integer-zero",2077283915],"2080495144":["枚举答案 + DFS（Python/Java/C++/Go）","by-endlesscheng-u03q","2022-10-16T01:10:16.425286+00:00","2440","创建价值相同的连通块","create-components-with-same-value",2080495144],"2086212420":["教你一步步思考动态规划！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-jjax","2023-02-21T15:46:44.086340+00:00","1140","石子游戏 II","stone-game-ii",2086212420],"2087368801":["没想明白？一个视频讲透！含数学推导（Python/Java/C++/Go/JS）","mei-xiang-ming-bai-yi-ge-shi-pin-jiang-t-nvsq","2022-11-30T08:50:38.572497+00:00","142","环形链表 II","linked-list-cycle-ii",2087368801],"2088822497":["两种 O(n) 做法：哈希表 / 三指针","by-endlesscheng-mpxt","2022-08-07T04:07:33.892322+00:00","2367","算术三元组的数目","number-of-arithmetic-triplets",2088822497],"2088911620":["O(n) 双指针（视频讲解）","on-shuang-zhi-zhen-by-endlesscheng-4g9p","2022-12-25T04:08:50.473968+00:00","2516","每种字符至少取 K 个","take-k-of-each-character-from-left-and-right",2088911620],"2099267983":["教你一步步思考动态规划！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-0vg6","2023-04-22T14:59:37.553789+00:00","1105","填充书架","filling-bookcase-shelves",2099267983],"210217684":["O(n) 滑动窗口","on-hua-dong-chuang-kou-by-endlesscheng-jtr5","2021-11-28T04:07:07.638463+00:00","2090","半径为 k 的子数组平均值","k-radius-subarray-averages",210217684],"2107686904":["暴力枚举","bao-li-mei-ju-by-endlesscheng-dbco","2021-09-11T09:39:43.862768+00:00","LCP 41","黑白翻转棋","fHi6rV",2107686904],"2108728330":["还原差分数组","huan-yuan-chai-fen-shu-zu-by-endlesschen-v38b","2022-01-22T16:13:52.541775+00:00","2145","统计隐藏数组数目","count-the-hidden-sequences",2108728330],"2113446044":["两种方法：暴力枚举/利用GCD性质，附题单（Python/Java/C++/Go）","liang-chong-fang-fa-bao-li-mei-ju-li-yon-refp","2023-04-23T04:09:19.688327+00:00","2654","使数组所有元素变成 1 的最少操作次数","minimum-number-of-operations-to-make-all-array-elements-equal-to-1",2113446044],"2117244239":["巧妙利用查询的特殊性","qiao-miao-li-yong-cha-xun-de-te-shu-xing-7eyg","2021-12-11T16:11:34.458794+00:00","2102","序列顺序查询","sequentially-ordinal-rank-tracker",2117244239],"2123032733":["利用异或的性质（附题单）Python/Java/C++/Go/JS/Rust","li-yong-yi-huo-de-xing-zhi-fu-ti-dan-pyt-oizc","2023-10-13T23:59:12.227077+00:00","136","只出现一次的数字","single-number",2123032733],"2123999060":["O(NB) 倒序动态规划","onb-dao-xu-dong-tai-gui-hua-by-endlessch-9khy","2021-12-08T06:35:07.093304+00:00","656","金币路径","coin-path",2123999060],"2130827066":["KMP + 矩阵快速幂优化 DP（附题单）Python/Java/C++/Go/JS","kmp-ju-zhen-kuai-su-mi-you-hua-dp-by-end-vypf","2023-09-10T04:16:10.526547+00:00","2851","字符串转换","string-transformation",2130827066],"2135327933":["逆向思维 + 贪心","ni-xiang-si-wei-tan-xin-by-endlesscheng-rwfl","2022-01-16T04:07:43.804210+00:00","2139","得到目标值的最少行动次数","minimum-moves-to-reach-target-score",2135327933],"2135431142":["位运算的魔法（Python/Java/C++/Go）","by-endlesscheng-r5ve","2023-01-22T00:22:21.009692+00:00","1815","得到新鲜甜甜圈的最多组数","maximum-number-of-groups-getting-fresh-donuts",2135431142],"2144998386":["同向双指针（滑动窗口）Python/Java/C++/Go","tong-xiang-shuang-zhi-zhen-hua-dong-chua-z7tu","2023-02-12T15:24:16.835788+00:00","1234","替换子串得到平衡字符串","replace-the-substring-for-balanced-string",2144998386],"2147986859":["枚举右，维护左（Python/Java/C++/Go/JS/Rust）","mei-ju-you-wei-hu-zuo-pythonjavacgojsrus-eoys","2023-11-18T00:10:51.409658+00:00","2342","数位和相等数对的最大和","max-sum-of-a-pair-with-equal-sum-of-digits",2147986859],"2154511916":["【图解】一张图秒懂 LRU！（Python/Java/C++/Go/JS/Rust）","tu-jie-yi-zhang-tu-miao-dong-lrupythonja-5udb","2023-12-12T14:08:27.294537+00:00","LCR 031","LRU 缓存","OrIXps",2154511916],"2155229246":["二进制枚举","er-jin-zhi-mei-ju-by-endlesscheng-rjul","2022-03-20T04:10:16.727677+00:00","2212","射箭比赛中的最大得分","maximum-points-in-an-archery-competition",2155229246],"2161204569":["Go 模拟","go-mo-ni-by-endlesscheng-2l2f","2022-01-08T16:16:54.918588+00:00","2130","链表最大孪生和","maximum-twin-sum-of-a-linked-list",2161204569],"2162382478":["拆位+线段树","chai-wei-xian-duan-shu-by-endlesscheng-d18s","2023-05-07T10:10:17.290640+00:00","LCP 81","与非的谜题","ryfUiz",2162382478],"2169721379":["哈希表模拟","ha-xi-biao-mo-ni-by-endlesscheng-wrc7","2022-05-01T04:06:28.877093+00:00","2261","含最多 K 个可整除元素的子数组","k-divisible-elements-subarrays",2169721379],"2170025879":["两种方法：Dijkstra/二分答案+BFS（Python/Java/C++/Go）","er-fen-da-an-bfspythonjavacgo-by-endless-j10w","2023-02-26T04:37:20.713182+00:00","2577","在网格图中访问一个格子的最少时间","minimum-time-to-visit-a-cell-in-a-grid",2170025879],"2172902585":["扩展：如果有 n 个节点要怎么做？（Python/Java/C++/Go/JS）","kuo-zhan-ru-guo-you-n-ge-jie-dian-yao-ze-eevi","2023-08-20T00:44:15.898542+00:00","2236","判断根结点是否等于子结点之和","root-equals-sum-of-children",2172902585],"2181231700":["二分查找，一个视频讲透！（Python/Java/C++/Go）","er-fen-cha-zhao-yi-ge-shi-pin-jiang-tou-1kbvh","2023-02-26T11:23:07.752637+00:00","LCR 128","库存管理 I","xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof",2181231700],"2182831583":["简洁写法：哈希表+拓扑排序","go-tuo-bu-pai-xu-by-endlesscheng-lnlg","2021-12-25T17:19:13.281359+00:00","2115","从给定原材料中找到所有可以做出的菜","find-all-possible-recipes-from-given-supplies",2182831583],"2184297331":["判断是否有至少两个偶数（Python/Java/C++/Go）","pan-duan-shi-fou-you-zhi-shao-liang-ge-o-aggh","2023-12-31T04:30:17.760647+00:00","2980","检查按位或是否存在尾随零","check-if-bitwise-or-has-trailing-zeros",2184297331],"2184686055":["【图解】下跳棋（Python/Java/C++/Go）","tu-jie-xia-tiao-qi-pythonjavacgo-by-endl-r1eb","2023-04-06T15:20:40.034990+00:00","1040","移动石子直到连续 II","moving-stones-until-consecutive-ii",2184686055],"218781353":["内向基环树找环 + 利用时间戳简单实现（Python/Java/C++/Go）","nei-xiang-ji-huan-shu-zhao-huan-li-yong-pmqmr","2022-07-31T04:05:51.069232+00:00","2360","图中的最长环","longest-cycle-in-a-graph",218781353],"2188606245":["没想明白？一个视频讲透！（Python/Java/C++/Go/JS/Rust）","mei-xiang-ming-bai-yi-ge-shi-pin-jiang-t-wzwm","2022-11-30T08:48:16.020937+00:00","876","链表的中间结点","middle-of-the-linked-list",2188606245],"2192706389":["三部曲：分组 - 排序 - 填回","go-mo-ni-by-endlesscheng-ttaj","2022-04-10T04:17:33.220109+00:00","2231","按奇偶性交换后的最大数字","largest-number-after-digit-swaps-by-parity",2192706389],"2193040547":["脑筋急转弯（Python/Java/C++/Go/JS/Rust）","nao-jin-ji-zhuan-wan-by-endlesscheng-vkb4","2023-04-29T16:15:40.689829+00:00","2656","K 个元素的最大和","maximum-sum-with-exactly-k-elements",2193040547],"2194073999":["Go nextPermutation","go-nextpermutation-by-endlesscheng-050e","2021-12-06T02:55:32.295222+00:00","1842","下个由相同数字构成的回文串","next-palindrome-using-same-digits",2194073999],"219694070":["数位 DP（Python/Java/C++/Go）","shu-wei-dppythonjavacgo-by-endlesscheng-4gvw","2023-08-20T02:21:50.732087+00:00","2827","范围中美丽整数的数目","number-of-beautiful-integers-in-the-range",219694070],"2197356984":["两种方法：暴力/分类讨论（Python/Java/C++/Go）","liang-chong-fang-fa-bao-li-fen-lei-tao-l-crt9","2023-04-28T13:04:12.229513+00:00","2423","删除字符使频率相同","remove-letter-to-equalize-frequency",2197356984],"2204380301":["贪心 O(log n) 做法","mei-ju-by-endlesscheng-slfa","2023-02-18T16:12:35.821967+00:00","2566","替换一个数字后的最大差值","maximum-difference-by-remapping-a-digit",2204380301],"2204914887":["枚举底边或顶边","mei-ju-di-bian-huo-ding-bian-by-endlessc-z0k9","2021-09-19T04:11:03.994507+00:00","2013","检测正方形","detect-squares",2204914887],"220667062":["贪心","tan-xin-by-endlesscheng-6q1q","2023-02-04T16:13:56.646815+00:00","2554","从一个范围内选择最多整数 I","maximum-number-of-integers-to-choose-from-a-range-i",220667062],"2207624249":["数形结合 + 巧妙地定义状态（Python/Java/C++/Go）","by-endlesscheng-fu9b","2022-09-24T15:52:46.714773+00:00","LCP 65","舒适的湿度","3aqs1c",2207624249],"2208494667":["一写就错？请看这！（Python/Java/C++/Go）","yi-xie-jiu-cuo-qing-kan-zhe-pythonjavacg-31u3","2023-03-21T03:11:23.916454+00:00","LCR 167","招式拆解 I","zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof",2208494667],"2213463441":["细分问题 + 复杂度优化（Python/Java/C++/Go）","xi-fen-wen-ti-fu-za-du-you-hua-pythonjav-1ihu","2022-10-14T00:05:29.170948+00:00","940","不同的子序列 II","distinct-subsequences-ii",2213463441],"2222019296":["深入理解递归：自顶向下/自底向上（附 O(1) 空间迭代写法！）","shen-ru-li-jie-di-gui-zi-ding-xiang-xia-ps0mm","2023-04-30T14:50:51.801278+00:00","1376","通知所有员工所需的时间","time-needed-to-inform-all-employees",2222019296],"2228358934":["O(1) 容斥原理（Python/Java/C++/Go）","o1-rong-chi-yuan-li-pythonjavacgo-by-end-2woj","2023-11-12T01:08:31.319060+00:00","2929","给小朋友们分糖果 II","distribute-candies-among-children-ii",2228358934],"223285376":["两种写法：从 O(logn) 到 O(1)（Python/Java/C++/Go）","er-jin-zhi-ji-ben-cao-zuo-pythonjavacgo-o82o2","2023-03-19T04:13:54.979454+00:00","2595","奇偶位数","number-of-even-and-odd-bits",223285376],"2240198172":["离线+滑动窗口（Python/Java/C++/Go）","chi-xian-hua-dong-chuang-kou-pythonjavac-b573","2023-06-25T09:37:49.532844+00:00","2747","统计没有收到请求的服务器数目","count-zero-request-servers",2240198172],"224100421":["教你一步步思考本题！（Python/Java/C++/Go/JS/Rust）","jiao-ni-yi-bu-bu-si-kao-ben-ti-by-endles-2eho","2023-08-06T01:56:34.808834+00:00","2809","使数组和小于等于 x 的最少时间","minimum-time-to-make-array-sum-at-most-x",224100421],"224630615":["双指针+平衡树/哈希表（Python/Java/C++/Go）","shuang-zhi-zhen-ping-heng-shu-ha-xi-biao-4frl","2023-07-02T04:09:57.804102+00:00","2762","不间断子数组","continuous-subarrays",224630615],"2247018180":["贪心，从最小的开始碰撞","tan-xin-cong-zui-xiao-de-kai-shi-peng-zh-h7d4","2022-01-02T04:15:31.895074+00:00","2126","摧毁小行星","destroying-asteroids",2247018180],"2248507270":["O(n) 扩展 KMP","on-kuo-zhan-kmp-by-endlesscheng-9nhs","2022-04-02T16:10:21.254007+00:00","2223","构造字符串的总得分和","sum-of-scores-of-built-strings",2248507270],"2249718139":["前后缀分解，一张图秒懂！（附动态规划）Python/Java/C++/Go","qian-hou-zhui-fen-jie-yi-zhang-tu-miao-d-dor2","2023-03-05T14:02:16.500825+00:00","1653","使字符串平衡的最少删除次数","minimum-deletions-to-make-string-balanced",2249718139],"2251945224":["计算每个前缀的最长非降子序列的长度","ji-suan-mei-ge-qian-zhui-de-zui-chang-sh-d2vd","2021-08-08T04:10:23.300722+00:00","1964","找出到每个位置为止最长的有效障碍赛跑路线","find-the-longest-valid-obstacle-course-at-each-position",2251945224],"2252317011":["两次遍历 + 前后缀分解","liang-ci-bian-li-qian-hou-zhui-by-endles-pq67","2021-12-11T16:12:30.269417+00:00","2100","适合野炊的日子","find-good-days-to-rob-the-bank",2252317011],"2258141933":["没想明白？一个动画秒懂！（Python/Java/C++/Go）","mei-xiang-ming-bai-yi-ge-dong-hua-miao-d-ocuu","2022-12-07T00:18:44.686457+00:00","1775","通过最少操作次数使数组的和相等","equal-sum-arrays-with-minimum-number-of-operations",2258141933],"2260151323":["枚举最后袋子中魔法豆的数目（Python/Java/C++/Go/JS/Rust）","pai-xu-hou-yi-ci-bian-li-by-endlesscheng-36g8","2022-02-13T04:12:40.965813+00:00","2171","拿出最少数目的魔法豆","removing-minimum-number-of-magic-beans",2260151323],"2265344721":["哈希表+滑动窗口（Python/Java/C++/Go/JS）","ha-xi-biao-shuang-zhi-zhen-pythonjavacgo-bcez","2023-07-16T04:07:00.588139+00:00","2781","最长合法子字符串的长度","length-of-the-longest-valid-substring",2265344721],"2265657217":["反转回文数左半部分","fan-zhuan-hui-wen-shu-zuo-ban-bu-fen-by-4pvs0","2022-03-27T04:08:10.226670+00:00","2217","找到指定长度的回文数","find-palindrome-with-fixed-length",2265657217],"2267593455":["下标总算错？请看这！","biao-ti-xia-biao-zong-suan-cuo-qing-kan-k81nh","2022-11-09T09:34:48.360856+00:00","209","长度最小的子数组","minimum-size-subarray-sum",2267593455],"2277934665":["回溯不会写？套路在此！（Python/Java/C++/Go）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-65lh","2023-01-20T09:25:40.252408+00:00","77","组合","combinations",2277934665],"2279246890":["【套路】前缀和+哈希表（Python/Java/C++/Go）","tao-lu-qian-zhui-he-ha-xi-biao-pythonjav-rzl0","2023-03-09T14:02:04.625831+00:00","1590","使数组和能被 P 整除","make-sum-divisible-by-p",2279246890],"2279730191":["BFS+算两次（Python/Java/C++/Go）","bfssuan-liang-ci-pythonjavacgo-by-endles-b72a","2023-04-15T16:11:07.509246+00:00","2641","二叉树的堂兄弟节点 II","cousins-in-binary-tree-ii",2279730191],"228115268":["结论证明+枚举","jie-lun-zheng-ming-mei-ju-by-endlesschen-w156","2023-07-16T04:07:36.579106+00:00","2780","合法分割的最小下标","minimum-index-of-a-valid-split",228115268],"228551495":["两种方法：枚举/贡献法（Python/Java/C++/Go）","bao-li-mei-ju-pythonjavacgo-by-endlessch-2r7p","2023-07-02T04:08:55.428259+00:00","2763","所有子数组中不平衡数字之和","sum-of-imbalance-numbers-of-all-subarrays",228551495],"2287172046":["按题意模拟","an-zhao-ti-yi-mo-ni-by-endlesscheng-41jb","2022-09-25T01:31:28.418793+00:00","LCP 62","交通枢纽","D9PW8w",2287172046],"2291083428":["如何去重？一个视频讲透！（Python/Java/C++/Go/JS）","ru-he-qu-zhong-yi-ge-shi-pin-jiang-tou-p-98g7","2022-12-03T08:46:49.364506+00:00","83","删除排序链表中的重复元素","remove-duplicates-from-sorted-list",2291083428],"2297518953":["两种方法：离线+最小堆/在线+线段树二分（Python/Java/C++/Go）","chi-xian-zui-xiao-dui-pythonjavacgo-by-e-9ewj","2023-11-19T04:57:08.729844+00:00","2940","找到 Alice 和 Bob 可以相遇的建筑","find-building-where-alice-and-bob-can-meet",2297518953],"2300589345":["一行写法","yi-xing-xie-fa-by-endlesscheng-p1gx","2021-06-19T07:49:00.526950+00:00","LCS 01","下载插件","Ju9Xwi",2300589345],"2310396":["「两数之和」的本质是什么？","liang-shu-zhi-he-de-ben-zhi-shi-shi-yao-bd0r1","2023-05-06T14:16:10.273739+00:00","1010","总持续时间可被 60 整除的歌曲","pairs-of-songs-with-total-durations-divisible-by-60",2310396],"2311001320":["统计子树的节点和及节点数","tong-ji-zi-shu-de-jie-dian-he-ji-jie-dia-va8t","2022-05-08T04:07:24.676124+00:00","2265","统计值等于子树平均值的节点数","count-nodes-equal-to-average-of-subtree",2311001320],"2315979719":["拓扑排序（Python/Java/C++/Go/JS/Rust）","tuo-bu-pai-xu-ji-lu-ru-dui-shi-jian-pyth-6uli","2023-03-26T04:13:05.567602+00:00","2603","收集树中金币","collect-coins-in-a-tree",2315979719],"2321482871":["统计空格个数 + 模拟","by-endlesscheng-pwzz","2022-05-29T00:07:33.732600+00:00","2284","最多单词数的发件人","sender-with-largest-word-count",2321482871],"2321913205":["DFS + BFS","dfs-bfs-by-endlesscheng-48cz","2022-08-21T04:31:59.718630+00:00","2385","感染二叉树需要的总时间","amount-of-time-for-binary-tree-to-be-infected",2321913205],"2323533689":["O(1) 空间写法（Python/Java/C++/Go/JS/Rust）","o1-kong-jian-xie-fa-pythonjavacgojsrust-8fesf","2023-10-26T00:10:09.132194+00:00","2520","统计能整除数字的位数","count-the-digits-that-divide-a-number",2323533689],"2329981708":["根据对称性作答","gen-ju-dui-cheng-xing-zuo-da-by-endlessc-bzv7","2022-11-27T00:31:12.183133+00:00","2481","分割圆的最少切割次数","minimum-cuts-to-divide-a-circle",2329981708],"2330317080":["统计比值的最简分数","tong-ji-bi-zhi-de-zui-jian-fen-shu-by-en-7p1b","2021-09-12T04:06:19.514471+00:00","2001","可互换矩形的组数","number-of-pairs-of-interchangeable-rectangles",2330317080],"233297408":["O(1) 公式（Python/Java/C++/Go）","o1-gong-shi-by-endlesscheng-z4xz","2023-03-05T04:08:47.662531+00:00","2582","递枕头","pass-the-pillow",233297408],"2333659184":["滑动窗口+避免分支预测（Python/Java/C++/Go）","on-hua-dong-chuang-kou-by-endlesscheng-s4fx","2022-08-20T23:24:37.148710+00:00","2379","得到 K 个黑块的最少涂色次数","minimum-recolors-to-get-k-consecutive-black-blocks",2333659184],"2335420481":["并查集（Python/Java/C++/Go）","bing-cha-ji-by-endlesscheng-tbz8","2022-09-25T04:13:58.361187+00:00","2421","好路径的数目","number-of-good-paths",2335420481],"2335538835":["前缀和优化 DP","qian-zhui-he-you-hua-dp-by-endlesscheng-k9d2","2021-05-23T05:17:13.319206+00:00","1871","跳跃游戏 VII","jump-game-vii",2335538835],"2337606731":["分类讨论（Python/Java/C++/Go）","fen-lei-tao-lun-by-endlesscheng-z71j","2022-12-18T04:06:35.918414+00:00","2508","添加边使所有节点度数都为偶数","add-edges-to-make-degrees-of-all-nodes-even",2337606731],"2347660974":["二进制枚举","er-jin-zhi-mei-ju-by-endlesscheng-ttix","2022-01-23T04:08:15.485538+00:00","2151","基于陈述统计最多好人数","maximum-good-people-based-on-statements",2347660974],"2348993490":["Go 简单模拟","go-jian-dan-mo-ni-by-endlesscheng-f8cw","2021-06-26T16:07:27.070256+00:00","1910","删除一个字符串中所有出现的给定子字符串","remove-all-occurrences-of-a-substring",2348993490],"2355594556":["没有思路？一个动画秒懂！附优化写法（Python/Java/C++/Go）","mei-you-si-lu-yi-ge-dong-hua-miao-dong-f-eezj","2023-03-13T14:58:06.991560+00:00","1605","给定行和列的和求可行矩阵","find-valid-matrix-given-row-and-column-sums",2355594556],"2357679638":["同余分组（Python/Java/C++/Go）","tong-yu-pythonjavacgo-by-endlesscheng-qoan","2023-03-19T04:06:00.316404+00:00","2598","执行操作后的最大 MEX","smallest-missing-non-negative-integer-after-operations",2357679638],"236080983":["【动画】一写就错？两种写法，总有一种适合你！（Python/Java/C++/Go）","dong-hua-yi-xie-jiu-cuo-liang-chong-xie-iijwz","2023-03-24T14:51:12.108621+00:00","1574","删除最短的子数组使剩余数组有序","shortest-subarray-to-be-removed-to-make-array-sorted",236080983],"2368071046":["O(n) 一次遍历+双单调栈（附题单）Python/Java/C++/Go/JS/Rust","by-endlesscheng-q6t5","2022-10-30T01:24:49.159678+00:00","2454","下一个更大元素 IV","next-greater-element-iv",2368071046],"236837608":["把问题看成是【扩散】元素（Python/Java/C++/Go）","ba-wen-ti-kan-cheng-shi-kuo-san-yuan-su-jddr9","2023-08-06T02:08:29.973775+00:00","2808","使循环数组所有元素相等的最少秒数","minimum-seconds-to-equalize-a-circular-array",236837608],"2369389100":["排序：正数从小到大，负数从大到小","pai-xu-zheng-shu-cong-xiao-dao-da-fu-shu-ptop","2022-02-06T04:09:58.913934+00:00","2165","重排数字的最小值","smallest-value-of-the-rearranged-number",2369389100],"2369761961":["前缀和 + 从上往下/从下往上 + 左拐/右拐（Python/Java/C++/Go）","by-endlesscheng-7z5a","2022-04-17T04:12:42.713075+00:00","2245","转角路径的乘积中最多能有几个尾随零","maximum-trailing-zeros-in-a-cornered-path",2369761961],"2370755498":["利用栈模拟（Python/Java/C++/Go）","li-yong-zhan-mo-ni-gocpythonjava-by-endl-bnbv","2022-03-06T04:07:27.000569+00:00","2197","替换数组中的非互质数","replace-non-coprime-numbers-in-array",2370755498],"2371431943":["博弈要点：构造移除序列，计算回合数","guan-jian-zai-yu-qiu-chu-hui-he-shu-by-e-mcgv","2021-10-03T04:06:12.788966+00:00","2029","石子游戏 IX","stone-game-ix",2371431943],"237326824":["枚举三条最短路的交汇点（Python/Java/C++/Go）","by-endlesscheng-2mxm","2022-03-13T04:08:55.574093+00:00","2203","得到要求路径的最小带权子图","minimum-weighted-subgraph-with-the-required-paths",237326824],"2373608335":["回溯不会写？套路在此！（Python/Java/C++/Go/JS）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-fues","2023-01-13T01:39:16.330047+00:00","131","分割回文串","palindrome-partitioning",2373608335],"237462896":["【视频】如何灵活运用递归？（Python/Java/C++/Go/JS/Rust）","ru-he-ling-huo-yun-yong-di-gui-lai-kan-s-c3wj","2022-12-10T10:20:56.580314+00:00","110","平衡二叉树","balanced-binary-tree",237462896],"2375501212":["树状数组优化 DP（Python/Java/C++/Go）","shu-zhuang-shu-zu-you-hua-dp-by-endlessc-3zf4","2023-11-05T04:17:09.024434+00:00","2926","平衡子序列的最大和","maximum-balanced-subsequence-sum",2375501212],"2375816517":["线性 DP（Python/Java/C++/Go）","d-by-endlesscheng-gybx","2022-06-26T04:24:57.942400+00:00","2320","统计放置房子的方式数","count-number-of-ways-to-place-houses",2375816517],"2383092679":["网格图 DFS 模板（Python/Java/C++/Go）","wang-ge-tu-dfs-mo-ban-pythonjavacgo-by-e-lykw","2023-04-30T00:24:35.537193+00:00","2658","网格图中鱼的最大数目","maximum-number-of-fish-in-a-grid",2383092679],"2384194086":["两种 O(1) 做法：数学公式 / 打表","o1-zuo-fa-by-endlesscheng-571j","2022-11-27T04:07:49.740066+00:00","2485","找出中枢整数","find-the-pivot-integer",2384194086],"2386809488":["两种 O(n) 做法：枚举 j / 枚举 k（Python/Java/C++/Go）","on-zuo-fa-by-endlesscheng-01x5","2023-10-01T04:19:01.587861+00:00","2873","有序三元组中的最大值 I","maximum-value-of-an-ordered-triplet-i",2386809488],"2386982504":["两种写法：哈希表（数组）/位运算（Python/Java/C++/Go）","liang-chong-xie-fa-ha-xi-biao-shu-zu-wei-7hm8","2023-04-14T14:15:29.414612+00:00","1042","不邻接植花","flower-planting-with-no-adjacent",2386982504],"2390584088":["O(n) 一次遍历","by-endlesscheng-59gn","2022-03-20T04:11:14.272078+00:00","2210","统计数组中峰和谷的数量","count-hills-and-valleys-in-an-array",2390584088],"2397274802":["暴力 / 预处理","bao-li-yu-chu-li-by-endlesscheng-kt0t","2022-10-16T01:26:09.677182+00:00","2438","二的幂数组中查询范围内的乘积","range-product-queries-of-powers",2397274802],"2398941022":["排序后切分（Python/Java/C++/Go）","pai-xu-hou-qie-fen-pythonjavacgo-by-endl-lewc","2023-12-17T04:24:02.544613+00:00","2966","划分数组并满足最大差限制","divide-array-into-arrays-with-max-difference",2398941022],"2400947874":["双指针，O(n) 时间 O(1) 空间（Python/Java/C++/Go）","shuang-zhi-zhen-on-shi-jian-o1-kong-jian-2hsz","2023-12-24T01:11:46.880456+00:00","2972","统计移除递增子数组的数目 II","count-the-number-of-incremovable-subarrays-ii",2400947874],"2405342085":["【视频】下标总算错？一个视频讲透滑动窗口！（Python/Java/C++/Go/JS/Rust）","xia-biao-zong-suan-cuo-qing-kan-zhe-by-e-iaks","2022-11-09T09:37:24.627736+00:00","3","无重复字符的最长子串","longest-substring-without-repeating-characters",2405342085],"2405658749":["【图解】从 O(n^2) 到 O(n)（Python/Java/C++/Go/JS/Rust）","tu-jie-cong-on2-dao-onpythonjavacgojsrus-aob8","2024-02-19T23:58:33.059132+00:00","105","从前序与中序遍历序列构造二叉树","construct-binary-tree-from-preorder-and-inorder-traversal",2405658749],"2407589215":["没想明白？一张图秒懂！（Python/Java/C++/Go）","mei-xiang-ming-bai-yi-zhang-tu-miao-dong-7xlx","2023-02-03T15:51:23.075297+00:00","1798","你能构造出连续值的最大数目","maximum-number-of-consecutive-values-you-can-make",2407589215],"2409750542":["两种做法，两张图秒懂！（Python/Java/C++/Go）","liang-chong-zuo-fa-liang-zhang-tu-miao-d-hysl","2023-02-13T15:16:18.701640+00:00","1124","表现良好的最长时间段","longest-well-performing-interval",2409750542],"2410692850":["模运算的性质+从左到右计算","cong-zuo-dao-you-ji-suan-by-endlesscheng-ywls","2023-02-26T04:49:11.667765+00:00","2575","找出字符串的可整除数组","find-the-divisibility-array-of-a-string",2410692850],"2412340751":["二分答案（Python 一行）","by-endlesscheng-y031","2022-04-03T04:08:04.123336+00:00","2226","每个小孩最多能分到多少糖果","maximum-candies-allocated-to-k-children",2412340751],"2422059385":["二分答案+优化（附题单！）Python/Java/C++/Go/JS","er-fen-da-an-pythonjavacgo-by-endlessche-keqf","2023-03-18T16:11:27.194893+00:00","2594","修车的最少时间","minimum-time-to-repair-cars",2422059385],"2422423692":["两遍 DFS（视频讲解）","liang-bian-dfs-by-endlesscheng-da7j","2022-11-13T00:53:49.190421+00:00","2467","树上最大得分和路径","most-profitable-path-in-a-tree",2422423692],"2425741756":["字典树：两次遍历 / DFS（Python/Java/C++/Go）","by-endlesscheng-ghfr","2022-09-18T04:11:17.970100+00:00","2416","字符串的前缀分数和","sum-of-prefix-scores-of-strings",2425741756],"2448413931":["Go 九进制 递归","go-jiu-jin-zhi-di-gui-by-endlesscheng-xdqn","2021-12-06T05:18:52.161312+00:00","660","移除 9","remove-9",2448413931],"2452001178":["库函数模拟","ku-han-shu-mo-ni-by-endlesscheng-fqad","2022-05-22T04:12:56.616990+00:00","2278","字母在字符串中的百分比","percentage-of-letter-in-string",2452001178],"2460331500":["简洁写法：统计位置 + 二分位置","tong-ji-wei-zhi-er-fen-wei-zhi-by-endles-8l9u","2021-11-21T04:07:30.629066+00:00","2080","区间内查询数字的频率","range-frequency-queries",2460331500],"2469022748":["Go 模拟","go-mo-ni-by-endlesscheng-thqf","2021-11-13T23:54:02.835719+00:00","2068","检查两个字符串是否几乎相等","check-whether-two-strings-are-almost-equivalent",2469022748],"2474207721":["二分答案（Python/Java/C++/Go）","er-fen-da-an-pythonjavacgo-by-endlessche-or61","2024-02-25T05:08:14.380861+00:00","100200","标记所有下标的最早秒数 I","earliest-second-to-mark-indices-i",2474207721],"2481240580":["预处理+记忆化搜索/递推（附题单！）Python/Java/C++/Go","yu-chu-li-ji-yi-hua-sou-suo-by-endlessch-qp47","2023-10-22T04:13:46.614424+00:00","2911","得到 K 个半回文串的最少修改次数","minimum-changes-to-make-k-semi-palindromes",2481240580],"248789391":["分类讨论","fen-lei-tao-lun-by-endlesscheng-w66r","2022-02-05T16:12:58.486792+00:00","2162","设置时间的最少代价","minimum-cost-to-set-cooking-time",248789391],"2488004222":["递归+排序","di-gui-pai-xu-by-endlesscheng-hnjf","2023-05-07T15:29:04.409321+00:00","LCP 80","生物进化录","qoQAMX",2488004222],"2491402608":["简单数学题","jian-dan-shu-xue-ti-by-endlesscheng-pojw","2023-07-09T04:10:44.923649+00:00","2769","找出最大的可达成数字","find-the-maximum-achievable-number",2491402608],"249363528":[" BFS 为什么要用队列？一个视频讲透！（Python/Java/C++/Go/JS）","bfs-wei-shi-yao-yao-yong-dui-lie-yi-ge-s-ji8i","2023-07-17T06:37:39.588177+00:00","LCR 149","彩灯装饰记录 I","cong-shang-dao-xia-da-yin-er-cha-shu-lcof",249363528],"2500271603":["哈希表套平衡树 / 懒删除堆（Python/Java/C++/Go）","by-endlesscheng-wlwa","2022-07-23T23:52:45.230520+00:00","2349","设计数字容器系统","design-a-number-container-system",2500271603],"2504097527":["懒标记法","lan-biao-ji-fa-by-endlesscheng-f07m","2022-02-06T04:08:24.556167+00:00","2166","设计位集","design-bitset",2504097527],"251006919":["两种方法：二分/差分（Python/Java/C++/Go/JS/Rust）","chai-fen-pythonjavacgo-by-endlesscheng-wz35","2022-04-24T04:11:17.812453+00:00","2251","花期内花的数目","number-of-flowers-in-full-bloom",251006919],"2510517613":["排序+枚举，O(1) 空间写法（Python/Java/C++/Go）","tan-xin-pythonjavacgo-by-endlesscheng-mke6","2023-12-24T00:09:11.695321+00:00","2971","找到最大周长的多边形","find-polygon-with-the-largest-perimeter",2510517613],"2511234285":["O(1) 容斥原理（Python/Java/C++/Go）","o1-rong-chi-yuan-li-pythonjavacgo-by-end-bko1","2023-11-12T01:23:04.611830+00:00","2927","给小朋友们分糖果 III","distribute-candies-among-children-iii",2511234285],"2513347763":["前缀和+双哈希表+枚举修改元素","qian-zhui-he-ha-xi-biao-mei-ju-xiu-gai-y-l546","2021-10-02T16:11:48.432564+00:00","2025","分割数组的最多方案数","maximum-number-of-ways-to-partition-an-array",2513347763],"2515340929":["位运算 O(1) 空间","wei-yun-suan-zuo-fa-by-endlesscheng-bwkn","2022-07-24T04:11:16.804030+00:00","2351","第一个出现两次的字母","first-letter-to-appear-twice",2515340929],"2520941920":["贪心+哈希表","by-endlesscheng-rv10","2022-05-01T04:07:07.922888+00:00","2260","必须拿起的最小连续卡牌数","minimum-consecutive-cards-to-pick-up",2520941920],"2523329139":["BFS 为什么要用队列？一个视频讲透！（Python/Java/C++/Go）","bfs-wei-shi-yao-yao-yong-dui-lie-yi-ge-s-xlv3","2023-01-07T12:33:09.451678+00:00","103","二叉树的锯齿形层序遍历","binary-tree-zigzag-level-order-traversal",2523329139],"2523374000":["Go 写法","go-xie-fa-by-endlesscheng-i16o","2021-05-15T09:26:53.125615+00:00","1804","实现 Trie （前缀树） II","implement-trie-ii-prefix-tree",2523374000],"2532708840":["两种做法：Bitset 或堆","shi-jian-sao-miao-xian-dui-by-endlessche-5tzj","2021-07-24T16:06:34.338429+00:00","1942","最小未被占据椅子的编号","the-number-of-the-smallest-unoccupied-chair",2532708840],"2534323731":["转换为 01 背包方案数","zhuan-huan-wei-01-bei-bao-fang-an-shu-by-1dax","2021-09-25T10:16:30.216097+00:00","LCP 47","入场安检","oPs9Bm",2534323731],"2546467088":["用优先队列维护另一个活动的最大价值","yong-you-xian-dui-lie-wei-hu-ling-yi-ge-8ld3x","2021-10-30T23:38:47.922639+00:00","2054","两个最好的不重叠活动","two-best-non-overlapping-events",2546467088],"2550811240":["O(n) 做法","mo-ni-by-endlesscheng-57j9","2022-03-13T04:10:44.553037+00:00","2200","找出数组中的所有 K 近邻下标","find-all-k-distant-indices-in-an-array",2550811240],"255204169":["库函数模拟","mo-ni-by-endlesscheng-0hxy","2022-04-30T16:42:41.416504+00:00","2255","统计是给定字符串前缀的字符串数目","count-prefixes-of-a-given-string",255204169],"255657392":["脑筋急转弯（Python/Java/C++/Go/JS）","nao-jin-ji-zhuan-wan-pythonjavacgo-by-en-9sqt","2022-07-10T04:10:26.362887+00:00","2337","移动片段得到字符串","move-pieces-to-obtain-a-string",255657392],"2560027362":["记忆化搜索（Python/Java/C++/Go）","ji-yi-hua-sou-suo-pythonjavacgo-by-endle-xecc","2022-07-03T04:09:43.962230+00:00","2328","网格图中递增路径的数目","number-of-increasing-paths-in-a-grid",2560027362],"2560538129":["非暴力做法（Python/Java/C++/Go）","fei-bao-li-zuo-fa-pythonjavacgo-by-endle-onrr","2024-02-18T05:16:18.211589+00:00","3042","统计前后缀下标对 I","count-prefix-and-suffix-pairs-i",2560538129],"2563069268":["O(n*3^m) 子集状压 DP + 贪心预处理（Python/Java/C++/Go）","by-endlesscheng-pk2q","2022-04-16T13:25:29.933912+00:00","LCP 53","守护太空城","EJvmW4",2563069268],"2569057399":["利用位运算简化代码","go-jian-ji-xie-fa-by-endlesscheng-w3lu","2022-06-11T22:55:35.272707+00:00","2299","强密码检验器 II","strong-password-checker-ii",2569057399],"2572143666":["简洁写法（Python/Java/C++/Go/JS/Rust）","jian-ji-xie-fa-pythonjavacgojsrust-by-en-7jw4","2024-02-25T23:43:37.467403+00:00","938","二叉搜索树的范围和","range-sum-of-bst",2572143666],"2572867035":["哈希表","by-endlesscheng-8f6t","2022-07-17T04:14:15.144819+00:00","2341","数组能形成多少数对","maximum-number-of-pairs-in-array",2572867035],"2573075022":["分类讨论，简洁写法（Python/Java/C++/Go）","fen-lei-tao-lun-jian-ji-xie-fa-pythonjav-671l","2023-12-31T04:09:43.527676+00:00","2982","找出出现至少三次的最长特殊子字符串 II","find-longest-special-substring-that-occurs-thrice-ii",2573075022],"2573211912":["贡献法+单调栈（Python/Java/C++/Go）","gong-xian-fa-dan-diao-zhan-pythonjavacgo-23c4","2023-08-13T04:14:35.390483+00:00","2818","操作使得分最大","apply-operations-to-maximize-score",2573211912],"2578600625":["简洁写法（Python/Java/C++/Go）","by-endlesscheng-wth1","2022-09-04T00:24:55.624324+00:00","2395","和相等的子数组","find-subarrays-with-equal-sum",2578600625],"2579679937":["有技巧的枚举 + 预处理（Python/Java/C++/Go）","you-ji-qiao-de-mei-ju-yu-chu-li-pythonja-exja","2023-01-29T04:15:46.909284+00:00","2552","统计上升四元组","count-increasing-quadruplets",2579679937],"2583029056":["阅读理解（Python/Java/C++/Go）","yue-du-li-jie-pythonjavacgo-by-endlessch-pcnd","2024-02-04T04:24:02.422614+00:00","3030","找出网格的区域平均强度","find-the-grid-of-region-average",2583029056],"2595697191":["O(n) 优雅写法（Python/Java/C++/Go）","on-zuo-fa-pythonjavacgo-by-endlesscheng-fc5k","2023-12-10T04:09:57.623215+00:00","2960","统计已测试设备","count-tested-devices-after-test-operations",2595697191],"2598780139":["前后缀分解 + DP（Python/Java/C++/Go）","qian-hou-zhui-fen-jie-dp-by-endlesscheng-6u1b","2022-02-06T04:06:22.788051+00:00","2167","移除所有载有违禁货物车厢所需的最少时间","minimum-time-to-remove-all-cars-containing-illegal-goods",2598780139],"2603031099":["【视频】如何灵活运用递归？（Python/Java/C++/Go/JS/Rust）","ru-he-ling-huo-yun-yong-di-gui-lai-kan-s-6dq5","2022-12-10T10:13:55.585487+00:00","101","对称二叉树","symmetric-tree",2603031099],"260479518":["两种方法：二分答案/双指针（Python/Java/C++/Go）","er-fen-da-an-pythonjavacgo-by-endlessche-t9f5","2023-02-26T04:08:48.394478+00:00","2576","求出最多标记下标","find-the-maximum-number-of-marked-indices",260479518],"2605448197":["内向基环树：拓扑排序 + 分类讨论（Python/Java/C++/Go/JS/Rust）","nei-xiang-ji-huan-shu-tuo-bu-pai-xu-fen-c1i1b","2022-01-02T04:08:23.606909+00:00","2127","参加会议的最多员工数","maximum-employees-to-be-invited-to-a-meeting",2605448197],"2610865464":["二分查找总是写不对？一个视频讲透！（Python/Java/C++/Go/JS）","er-fen-cha-zhao-zong-shi-xie-bu-dui-yi-g-w3ol","2023-08-03T12:48:22.672899+00:00","LCR 172","统计目标成绩的出现次数","zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof",2610865464],"2612530279":["避免浮点运算的写法","bi-mian-fu-dian-yun-suan-de-xie-fa-by-en-9fc6","2021-05-23T04:22:22.549327+00:00","1870","准时到达的列车最小时速","minimum-speed-to-arrive-on-time",2612530279],"2613694816":["【视频】本题最简单写法！（Python/Java/C++/Go/JS/Rust）","fen-lei-tao-lun-luan-ru-ma-yi-ge-shi-pin-2r95","2022-12-17T08:55:33.832547+00:00","236","二叉树的最近公共祖先","lowest-common-ancestor-of-a-binary-tree",2613694816],"2613974860":["二分答案+容斥原理","er-fen-da-an-rong-chi-yuan-li-by-endless-9j34","2022-11-21T23:32:05.765729+00:00","878","第 N 个神奇数字","nth-magical-number",2613974860],"2613979956":["两种方法：枚举/滑动窗口（Python/Java/C++/Go）","mei-ju-pythonjavacgo-by-endlesscheng-5th8","2023-10-15T04:14:25.937572+00:00","2904","最短且字典序最小的美丽子字符串","shortest-and-lexicographically-smallest-beautiful-string",2613979956],"261533544":["一步步优化：从递归到递推到单调队列（Python/Java/C++/Go/JS/Rust）","yi-bu-bu-you-hua-cong-di-gui-dao-di-tui-84qn3","2024-02-05T00:11:45.681199+00:00","1696","跳跃游戏 VI","jump-game-vi",261533544],"2618637580":["DFS 时间戳——处理树上问题的有力工具（Python/Java/C++/Go）","dfs-shi-jian-chuo-chu-li-shu-shang-wen-t-x1kk","2022-06-26T04:15:46.038457+00:00","2322","从树中删除边的最小分数","minimum-score-after-removals-on-a-tree",2618637580],"2619603225":["分类讨论（Python/Java/C++/Go）","fen-lei-tao-lun-by-endlesscheng-y57m","2023-10-29T04:14:57.807547+00:00","2918","数组的最小相等和","minimum-equal-sum-of-two-arrays-after-replacing-zeros",2619603225],"2621107821":["Go 模拟","mo-ni-by-endlesscheng-jykc","2021-05-30T04:19:53.978764+00:00","1880","检查某单词是否等于两单词之和","check-if-word-equals-summation-of-two-words",2621107821],"2621480860":["排序+遍历（Python/Java/C++/Go）","by-endlesscheng-z7t8","2022-11-13T00:14:41.905517+00:00","2465","不同的平均值数目","number-of-distinct-averages",2621480860],"2626303746":["O(1) 空间做法（Python/Java/C++/Go/JS/Rust）","o1-kong-jian-zuo-fa-pythonjavacgojsrust-ztx6f","2023-10-18T01:04:41.280453+00:00","2530","执行 K 次操作后的最大分数","maximal-score-after-applying-k-operations",2626303746],"2629528696":["计算三个字符串的最长公共前缀（Python/Java/C++/Go）","ji-suan-san-ge-zi-fu-chuan-de-zui-chang-ej505","2023-11-19T05:03:18.612970+00:00","2937","使三个字符串相等","make-three-strings-equal",2629528696],"2629734466":["预处理终点到其余点的距离+二分答案（Python/Java/C++/Go）","yu-chu-li-zhong-dian-dao-qi-yu-dian-de-j-nxfs","2023-04-22T09:35:46.246829+00:00","LCP 75","传送卷轴","rdmXM7",2629734466],"2631177392":["看完这个视频，让你对递归的理解更上一层楼！（Python/Java/C++/Go）","kan-wan-zhe-ge-shi-pin-rang-ni-dui-di-gu-44uz","2022-12-07T10:06:47.292337+00:00","104","二叉树的最大深度","maximum-depth-of-binary-tree",2631177392],"2631420913":["【套路】子数组统计问题常用技巧：等价转换（Python/Java/C++/Go）","deng-jie-zhuan-huan-pythonjavacgo-by-end-5w11","2022-11-27T04:07:07.019491+00:00","2488","统计中位数为 K 的子数组","count-subarrays-with-median-k",2631420913],"2634383093":["三种算法：暴力/二分答案/堆（附题单！）","san-chong-suan-fa-bao-li-er-fen-da-an-du-k1vd","2023-05-28T00:28:22.843518+00:00","1439","有序矩阵中的第 k 个最小数组和","find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows",2634383093],"2638444930":["排序+遍历（Python/Java/C++/Go）","pai-xu-bian-li-pythonjavacgo-by-endlessc-651x","2023-05-07T15:38:02.798297+00:00","LCP 77","符文储备","W2ZX4X",2638444930],"2640785054":["排序+贪心","pai-xu-tan-xin-by-endlesscheng-wgk7","2021-09-11T09:38:40.895387+00:00","LCP 40","心算挑战","uOAnQW",2640785054],"2642386680":["没想明白？一个视频讲透快慢指针！（Python/Java/C++/Go/JS）","mei-xiang-ming-bai-yi-ge-shi-pin-jiang-t-c4sw","2022-11-30T08:49:10.530676+00:00","141","环形链表","linked-list-cycle",2642386680],"2643077516":["Go 超简洁二分写法","go-er-fen-by-endlesscheng-bga4","2021-06-22T07:57:40.986589+00:00","540","有序数组中的单一元素","single-element-in-a-sorted-array",2643077516],"2645404069":["贪心 + O(1) 空间复杂度做法（Python/Java/C++/Go）","o1-kong-jian-fu-za-du-zuo-fa-by-endlessc-ywio","2022-10-02T04:07:38.742400+00:00","2429","最小异或","minimize-xor",2645404069],"2648057035":["纯数学做法（Python/Java/C++/Go）","shu-lun-zu-he-shu-xue-zuo-fa-by-endlessc-iouh","2022-07-10T04:43:41.688619+00:00","2338","统计理想数组的数目","count-the-number-of-ideal-arrays",2648057035],"2651875294":["直接照搬 1004 的代码","zhi-jie-zhao-ban-1004-de-dai-ma-by-endle-42x3","2021-10-02T16:44:12.937346+00:00","2024","考试的最大困扰度","maximize-the-confusion-of-an-exam",2651875294],"265213405":["两种做法：并查集 / 单调栈（Python/Java/C++/Go）","by-endlesscheng-j6pp","2022-07-10T00:14:40.957687+00:00","2334","元素值大于变化阈值的子数组","subarray-with-elements-greater-than-varying-threshold",265213405],"2654590324":["O(n) 做法","on-zuo-fa-by-endlesscheng-wubs","2024-02-04T04:24:17.144460+00:00","3029","将单词恢复初始状态所需的最短时间 I","minimum-time-to-revert-word-to-initial-state-i",2654590324],"2657502607":["贪心+简洁写法（Python/Java/C++/Go）","tan-xin-jian-ji-xie-fa-pythonjavacgo-by-ziiin","2023-10-01T01:42:51.258391+00:00","2870","使数组为空的最少操作次数","minimum-number-of-operations-to-make-array-empty",2657502607],"2658427199":["又写死循环了？一个视频讲透二分！（Python/Java/C++/Go）","by-endlesscheng-auuh","2022-11-23T10:16:30.889618+00:00","33","搜索旋转排序数组","search-in-rotated-sorted-array",2658427199],"2661403855":["枚举中间字符，然后根据前后缀和判断","mei-ju-zhong-jian-zi-fu-ran-hou-gen-ju-q-186d","2021-07-11T04:08:57.775107+00:00","1930","长度为 3 的不同回文子序列","unique-length-3-palindromic-subsequences",2661403855],"2664015237":["预处理质数+枚举+特判奇数（Python/Java/C++/Go）","yu-chu-li-zhi-shu-mei-ju-by-endlesscheng-cq9b","2023-07-02T04:13:56.487663+00:00","2761","和等于目标值的质数对","prime-pairs-with-target-sum",2664015237],"266469116":["Go 单调队列","go-dan-diao-zhan-by-endlesscheng-4yqf","2021-10-03T04:34:56.545916+00:00","2030","含特定字母的最小子序列","smallest-k-length-subsequence-with-occurrences-of-a-letter",266469116],"2668311333":["双指针 两种写法（Python/Java/C++/Go）","shuang-zhi-zhen-by-endlesscheng-lkd9","2023-01-15T04:08:25.551059+00:00","2537","统计好子数组的数目","count-the-number-of-good-subarrays",2668311333],"2670146102":["贪心还能反悔？（Python/Java/C++/Go/JS）","tan-xin-huan-neng-fan-hui-pythonjavacgoj-lcwp","2023-09-11T01:12:08.058758+00:00","630","课程表 III","course-schedule-iii",2670146102],"267105112":["本题最简单写法（Python/Java/C++/Go）","ben-ti-zui-jian-dan-xie-fa-pythonjavacgo-kcc6","2024-02-18T00:11:09.457534+00:00","3041","修改数组后最大化数组中的连续元素数目","maximize-consecutive-elements-in-an-array-after-modification",267105112],"2671757819":["0-1 背包模板题","0-1-bei-bao-mo-ban-ti-by-endlesscheng-ap09","2023-07-23T00:09:53.752062+00:00","2787","将一个数字表示成幂的和的方案数","ways-to-express-an-integer-as-sum-of-powers",2671757819],"2672352527":["LCA 模板（Python/Java/C++/Go）","lca-mo-ban-by-endlesscheng-j54b","2023-09-03T04:11:42.406781+00:00","2846","边权重均等查询","minimum-edge-weight-equilibrium-queries-in-a-tree",2672352527],"267246445":["DP + 单调栈二分优化（Python/Java/C++/Go）","dan-diao-zhan-you-hua-dp-by-endlesscheng-mc50","2023-04-09T04:16:26.792556+00:00","2617","网格图中最少访问的格子数","minimum-number-of-visited-cells-in-a-grid",267246445],"267587420":["模拟 + 位运算","mo-ni-wei-yun-suan-by-endlesscheng-7zfi","2022-02-20T05:52:57.493367+00:00","2180","统计各位数字之和为偶数的整数个数","count-integers-with-even-digit-sum",267587420],"268097121":["两种非暴力做法：LIS/状态机DP（Python/Java/C++/Go）","liang-chong-fei-bao-li-zuo-fa-liszhuang-38zac","2023-08-20T04:38:54.882009+00:00","2826","将三个组排序","sorting-three-groups",268097121],"2681170798":["枚举（Python/Java/C++/Go/JS）","mei-ju-by-endlesscheng-oo2d","2023-09-03T04:21:37.025767+00:00","2843","统计对称整数的数目","count-symmetric-integers",2681170798],"268471907":["两种方法：排序/最小堆（Python/Java/C++/Go）","liang-chong-fang-fa-pai-xu-zui-xiao-dui-bzedc","2023-11-11T23:31:39.443733+00:00","2931","购买物品的最大开销","maximum-spending-after-buying-items",268471907],"2688612867":["Go 模拟","go-mo-ni-by-endlesscheng-cg8e","2021-08-22T04:11:41.605708+00:00","1979","找出数组的最大公约数","find-greatest-common-divisor-of-array",2688612867],"269219514":["模拟+简洁写法（Python/Java/C++/Go）","mo-ni-jian-ji-xie-fa-pythonjavacgo-by-en-welu","2023-04-23T12:24:32.288030+00:00","LCP 72","补给马车","hqCnmP",269219514],"2692580018":["前后缀分解+单调栈（附题单！）Python/Java/C++/Go","qian-hou-zhui-fen-jie-dan-diao-zhan-pyth-1exe","2023-09-24T04:13:21.585236+00:00","2866","美丽塔 II","beautiful-towers-ii",2692580018],"2694109670":["O(n) 做法（Python/Java/C++/Go）","on-zuo-fa-pythonjavacgo-by-endlesscheng-nkuy","2024-01-07T01:39:49.294300+00:00","2996","大于等于顺序前缀和的最小缺失整数","smallest-missing-integer-greater-than-sequential-prefix-sum",2694109670],"2694237057":["Go 模拟","mo-ni-by-endlesscheng-euwh","2021-07-24T16:06:59.017051+00:00","1941","检查是否所有字符出现次数相同","check-if-all-characters-have-equal-number-of-occurrences",2694237057],"2695383302":["跟着我过一遍示例 2，你就明白怎么做了（Python/Java/C++/Go/JS）","gen-zhao-wo-guo-yi-bian-shi-li-2ni-jiu-m-2jqm","2023-08-10T03:33:47.044879+00:00","1081","不同字符的最小子序列","smallest-subsequence-of-distinct-characters",2695383302],"2697040026":["语法题","yu-fa-ti-by-endlesscheng-lako","2023-01-22T04:07:59.438785+00:00","2545","根据第 K 场考试的分数排序","sort-the-students-by-their-kth-score",2697040026],"2697534725":["组合计数（视频讲解）","zu-he-ji-shu-by-endlesscheng-leem","2022-12-25T01:20:23.176754+00:00","2514","统计同位异构字符串数目","count-anagrams",2697534725],"2701115423":["平衡树+双指针（Python/Java/C++/Go）","ping-heng-shu-shuang-zhi-zhen-pythonjava-50eh","2023-08-13T04:44:51.236767+00:00","2817","限制条件下元素之间的最小绝对差","minimum-absolute-difference-between-elements-with-constraint",2701115423],"2711761019":["不会字典树？只用哈希表也能做！（Python/Java/C++/Go）","bu-hui-zi-dian-shu-zhi-yong-ha-xi-biao-y-p2pu","2023-01-05T00:08:21.631826+00:00","1803","统计异或值在范围内的数对有多少","count-pairs-with-xor-in-a-range",2711761019],"271335539":["两种思路：动态规划/单调栈（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-68nx","2023-05-16T00:50:27.983950+00:00","1335","工作计划的最低难度","minimum-difficulty-of-a-job-schedule",271335539],"2715109000":["两种做法：暴力 / 利用 LCM 的性质","by-endlesscheng-3qnt","2022-11-13T04:08:07.585846+00:00","2470","最小公倍数为 K 的子数组数目","number-of-subarrays-with-lcm-equal-to-k",2715109000],"2716169684":["Go 一行","go-yi-xing-by-endlesscheng-1vf3","2021-07-29T06:06:50.814509+00:00","10","正则表达式匹配","regular-expression-matching",2716169684],"2716747123":["还在 if-else？一个循环处理六种移动！（Python/Java/C++/Go）","huan-zai-if-elseyi-ge-xun-huan-chu-li-li-tw8b","2023-02-04T15:31:01.581219+00:00","1210","穿过迷宫的最少移动次数","minimum-moves-to-reach-target-with-rotations",2716747123],"2719065978":["贪心 + 一次遍历（Python/Java/C++/Go）","by-endlesscheng-lvym","2022-09-17T23:45:08.758644+00:00","2412","完成所有交易的初始最少钱数","minimum-money-required-before-transactions",2719065978],"2719330296":["贪心：排序后枚举后缀，再求其余花园最小值的最大值（Python/Java/C++/Go）","by-endlesscheng-10i7","2022-04-10T04:13:17.056717+00:00","2234","花园的最大总美丽值","maximum-total-beauty-of-the-gardens",2719330296],"2719928959":["转换+一次遍历","zhuan-huan-yi-ci-bian-li-by-endlesscheng-hc0y","2023-01-22T07:53:29.374105+00:00","2541","使数组中所有元素相等的最小操作数 II","minimum-operations-to-make-array-equal-ii",2719928959],"2720318685":["多重背包方案数：从朴素 DP 到优化（Python/Java/C++/Go）","duo-zhong-bei-bao-fang-an-shu-cong-po-su-f5ay","2023-10-15T01:37:44.768621+00:00","2902","和带限制的子多重集合的数目","count-of-sub-multisets-with-bounded-sum",2720318685],"2724880133":["二分查找总是写不对？三种写法，一个视频讲透！（Python/Java/C++/Go/JS）","er-fen-cha-zhao-zong-shi-xie-bu-dui-yi-g-t9l9","2022-11-19T08:41:41.595499+00:00","34","在排序数组中查找元素的第一个和最后一个位置","find-first-and-last-position-of-element-in-sorted-array",2724880133],"2730930360":["两个最小堆模拟 + 视频讲解","liang-ge-zui-xiao-dui-mo-ni-by-endlessch-nagm","2022-11-06T04:06:26.079599+00:00","2462","雇佣 K 位工人的总代价","total-cost-to-hire-k-workers",2730930360],"2732657659":["中序遍历+二分查找（Python/Java/C++/Go/JS/Rust）","zhong-xu-bian-li-er-fen-cha-zhao-pythonj-4ic0","2024-02-24T00:45:55.860358+00:00","2476","二叉搜索树最近节点查询","closest-nodes-queries-in-a-binary-search-tree",2732657659],"2734248382":["【图解】没有思路？进来秒懂！（Python/Java/C++/Go/JS）","tu-jie-mei-you-si-lu-jin-lai-miao-dong-p-vrni","2023-07-14T00:23:31.228151+00:00","979","在二叉树中分配硬币","distribute-coins-in-binary-tree",2734248382],"2745040429":["预处理+递归（Python/Java/C++/Go/JS/Rust）","yu-chu-li-hui-su-by-endlesscheng-ro3s","2023-05-21T04:07:12.443291+00:00","2698","求一个整数的惩罚数","find-the-punishment-number-of-an-integer",2745040429],"2754546565":["模拟","mo-ni-by-endlesscheng-jn5x","2021-05-29T16:09:05.375974+00:00","1876","长度为三且各字符不同的子字符串","substrings-of-size-three-with-distinct-characters",2754546565],"275986604":["BFS + 统计每个点变为空闲状态的最早秒数","bfs-tong-ji-mei-ge-dian-bian-wei-kong-xi-mnm7","2021-10-16T16:07:45.252631+00:00","2039","网络空闲的时刻","the-time-when-the-network-becomes-idle",275986604],"2762853048":["贡献法+单调栈+三种实现版本（附题单）Python/Java/C++/Go","gong-xian-fa-dan-diao-zhan-san-chong-shi-gxa5","2022-10-27T23:37:33.731503+00:00","907","子数组的最小值之和","sum-of-subarray-minimums",2762853048],"2771270445":["模拟 + 分组循环","mo-ni-by-endlesscheng-voye","2022-04-30T16:43:22.032876+00:00","2257","统计网格图中没有被保卫的格子数","count-unguarded-cells-in-the-grid",2771270445],"2772831251":["间隔跳跃+简单证明","tan-xin-by-endlesscheng-wj2k","2022-12-11T01:27:42.184798+00:00","2498","青蛙过河 II","frog-jump-ii",2772831251],"2774491833":["贪心（Python/Java/C++/Go）","tan-xin-pythonjavacgo-by-endlesscheng-2ub2","2023-12-10T01:13:10.593425+00:00","2957","消除相邻近似相等字符","remove-adjacent-almost-equal-characters",2774491833],"2775344327":["非暴力做法：前缀和 + 二分查找 + 原地 O(1) 空间（Python/Java/C++/Go）","fei-bao-li-zuo-fa-qian-zhui-he-er-fen-by-ny4m","2022-08-28T04:08:53.932275+00:00","2389","和有限的最长子序列","longest-subsequence-with-limited-sum",2775344327],"2776150092":["回溯三问：思考回溯问题的通用方法（Python/Java/C++/Go）","hui-su-san-wen-si-kao-hui-su-wen-ti-de-t-kw3y","2023-02-25T14:48:04.919991+00:00","1255","得分最高的单词集合","maximum-score-words-formed-by-letters",2776150092],"2777743854":["预处理 + 暴力枚举","by-endlesscheng-jocl","2022-06-11T23:16:36.568010+00:00","2301","替换字符后匹配","match-substring-after-replacement",2777743854],"2783546107":["回溯不会写？套路在此！（Python/Java/C++/Go/JS）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-kfk3","2023-08-02T02:23:55.828692+00:00","面试题 08.09","括号","bracket-lcci",2783546107],"2786999216":["哈希表 + 贪心（Python 两行）","ha-xi-biao-tan-xin-by-endlesscheng-tgtf","2022-04-17T04:13:31.102534+00:00","2244","完成所有任务需要的最少轮数","minimum-rounds-to-complete-all-tasks",2786999216],"2791285030":["【视频】如何思考树形 DP？（Python/Java/C++/Go/JS）","shi-pin-ru-he-si-kao-shu-xing-dppythonja-a7t1","2023-05-24T08:12:55.838438+00:00","337","打家劫舍 III","house-robber-iii",2791285030],"2792663761":["【模板】网格图 DFS（附题单！）","mo-ban-wang-ge-tu-dfsfu-ti-dan-by-endles-p0n1","2023-06-22T00:18:34.022568+00:00","面试题 16.19","水域大小","pond-sizes-lcci",2792663761],"2795952868":["统计连续相同颜色的长度","tong-ji-lian-xu-xiang-tong-yan-se-de-cha-zynp","2021-10-16T16:09:26.627802+00:00","2038","如果相邻两个颜色均相同则删除当前颜色","remove-colored-pieces-if-both-neighbors-are-the-same-color",2795952868],"2796999710":["【图解】迭代/递归，一张图秒懂！（Python/Java/C++/Go/JS）","tu-jie-die-dai-di-gui-yi-zhang-tu-miao-d-51ap","2023-08-06T00:41:06.723826+00:00","24","两两交换链表中的节点","swap-nodes-in-pairs",2796999710],"2799632565":["[更新高精度算法] 拆分成四个问题：计算对数 + 对 1e5 取模 + 计算尾零个数 + 判断剩余数字的长度","chai-fen-cheng-si-ge-wen-ti-ji-suan-dui-6karq","2021-12-25T16:14:30.356946+00:00","2117","一个区间内所有数乘积的缩写","abbreviating-the-product-of-a-range",2799632565],"2800289700":["两种方法：正向思维 / 逆向思维（Python/Java/C++/Go）","gou-zao-tan-xin-pythonjavacgo-by-endless-ib49","2024-02-11T04:09:06.519666+00:00","3035","回文字符串的最大数量","maximum-palindromes-after-operations",2800289700],"280396343":["简化代码的小技巧","jian-hua-dai-ma-de-xiao-ji-qiao-by-endle-i81p","2022-07-03T04:10:44.595269+00:00","2325","解密消息","decode-the-message",280396343],"2805340615":["没想明白？一个视频讲透！（Python/Java/C++/Go/JS）","mei-xiang-ming-bai-yi-ge-shi-pin-jiang-t-u66q","2022-11-30T08:55:29.066681+00:00","143","重排链表","reorder-list",2805340615],"2811209697":["两种做法：字符串 / 数学","mo-ni-by-endlesscheng-burh","2022-05-15T11:47:04.327627+00:00","2269","找到一个数字的 K 美丽值","find-the-k-beauty-of-a-number",2811209697],"2817202669":["教你一次性把代码写对！O(n) 分组循环（Python/Java/C++/Go/JS/Rust）","jiao-ni-yi-ci-xing-ba-dai-ma-xie-dui-on-zuspx","2023-11-16T00:09:36.223810+00:00","2760","最长奇偶子数组","longest-even-odd-subarray-with-threshold",2817202669],"2818493377":["简洁写法","jian-ji-xie-fa-by-endlesscheng-thul","2023-07-09T01:11:42.996823+00:00","2766","重新放置石块","relocate-marbles",2818493377],"2819110526":["二分答案","er-fen-da-an-by-endlesscheng-aape","2021-11-07T04:06:41.188334+00:00","2064","分配给商店的最多商品的最小值","minimized-maximum-of-products-distributed-to-any-store",2819110526],"2820740224":["二分答案+反悔贪心（Python/Java/C++/Go）","er-fen-da-an-fan-hui-tan-xin-pythonjavac-997n","2024-02-25T04:27:17.207332+00:00","100197","标记所有下标的最早秒数 II","earliest-second-to-mark-indices-ii",2820740224],"2827089777":["枚举","mei-ju-by-endlesscheng-qc44","2023-07-30T05:03:06.317614+00:00","2800","包含三个字符串的最短字符串","shortest-string-that-contains-three-strings",2827089777],"282802217":["两种双指针写法","tan-xin-pi-pei-by-endlesscheng-d6eq","2022-11-27T04:09:05.651614+00:00","2486","追加字符以获得子序列","append-characters-to-string-to-make-subsequence",282802217],"2833491097":["贪心 + 模拟","by-endlesscheng-bxks","2022-08-28T04:08:06.706604+00:00","2391","收集垃圾的最少总时间","minimum-amount-of-time-to-collect-garbage",2833491097],"2835500769":["贪心（Python/Java/C++/Go）","tan-xin-pythonjavacgo-by-endlesscheng-8fzf","2023-10-08T04:16:03.481673+00:00","2895","最小处理时间","minimum-processing-time",2835500769],"2836390896":["O(1) 空间位运算写法（Python/Java/C++/Go）","o1-kong-jian-wei-yun-suan-xie-fa-pythonj-7t4p","2023-06-04T04:29:56.683844+00:00","2716","最小化字符串长度","minimize-string-length",2836390896],"28373825":["转化成分组背包（Python/Java/C++/Go）","zhuan-hua-cheng-fen-zu-bei-bao-pythongoc-3xnk","2022-03-27T04:07:38.017956+00:00","2218","从栈中取出 K 个硬币的最大面值和","maximum-value-of-k-coins-from-piles",28373825],"2844316244":["O(n) 一次遍历","on-yi-ci-bian-li-by-endlesscheng-gw3w","2023-05-28T11:07:50.302869+00:00","2706","购买两块巧克力","buy-two-chocolates",2844316244],"284708083":["状态压缩 DP（附最小费用最大流做法）","zhuang-tai-ya-suo-dp-by-endlesscheng-5eqn","2022-02-13T04:09:16.096285+00:00","2172","数组的最大与和","maximum-and-sum-of-array",284708083],"2850260537":["两种方法：自顶向下/自底向上（Python/Java/C++/Go）","liang-chong-fang-fa-zi-ding-xiang-xia-zi-wj9v","2023-04-17T14:12:07.670967+00:00","1026","节点与其祖先之间的最大差值","maximum-difference-between-node-and-ancestor",2850260537],"2851269000":["【模板】换根 DP（Python/Java/C++/Go/JS）","mo-ban-huan-gen-dppythonjavacgojs-by-end-8qiu","2023-09-17T01:28:01.628707+00:00","2858","可以到达每一个节点的最少边反转次数","minimum-edge-reversals-so-every-node-is-reachable",2851269000],"2855675520":["贪心","tan-xin-by-endlesscheng-y0tw","2022-07-10T04:11:17.171694+00:00","2335","装满杯子需要的最短总时长","minimum-amount-of-time-to-fill-cups",2855675520],"2860632733":["【视频】教你一步步思考动态规划！股票问题通用解法！（Python/Java/C++/Go/JS/Rust）","shi-pin-jiao-ni-yi-bu-bu-si-kao-dong-tai-0k0l","2023-03-31T10:43:32.994656+00:00","309","买卖股票的最佳时机含冷冻期","best-time-to-buy-and-sell-stock-with-cooldown",2860632733],"286069565":["线性做法（Python/Java/C++/Go/JS）","xian-xing-zuo-fa-pythonjavacgojs-by-endl-uofo","2023-08-14T23:52:23.141282+00:00","833","字符串中的查找与替换","find-and-replace-in-string",286069565],"2860849459":["Floyd 算法（Python/Java/C++/Go）","floyd-suan-fa-by-endlesscheng-ug8s","2023-12-24T04:17:53.824053+00:00","2976","转换字符串的最小成本 I","minimum-cost-to-convert-string-i",2860849459],"2862855056":["值域前缀和+枚举分母和商","zhi-yu-qian-zhui-he-mei-ju-fen-mu-he-sha-2143","2021-05-15T16:25:21.768643+00:00","1862","向下取整数对和","sum-of-floored-pairs",2862855056],"286585708":["等价转换 + 树状数组（Java/Python/C++/Go）","deng-jie-zhuan-huan-shu-zhuang-shu-zu-by-xmyd","2022-02-19T16:08:50.138290+00:00","2179","统计数组中好三元组数目","count-good-triplets-in-an-array",286585708],"286718649":["【图解】一次遍历+简洁写法（Python/Java/C++/Go）","tu-jie-yi-ci-bian-li-jian-ji-xie-fa-pyth-n75l","2022-11-23T23:27:43.628215+00:00","795","区间子数组个数","number-of-subarrays-with-bounded-maximum",286718649],"2875235685":["模拟（Python/Java/C++/Go）","mo-ni-pythonjavacgo-by-endlesscheng-mexz","2023-12-17T09:11:40.160177+00:00","2965","找出缺失和重复的数字","find-missing-and-repeated-values",2875235685],"2882449995":["BFS 为什么要用队列？一个视频讲透！（Python/Java/C++/Go）","bfs-wei-shi-yao-yao-yong-dui-lie-yi-ge-s-f34y","2023-01-07T11:57:08.610784+00:00","513","找树左下角的值","find-bottom-left-tree-value",2882449995],"288305998":["贪心，扫描一遍寻找插入位置","tan-xin-sao-miao-yi-bian-xun-zhao-cha-ru-yxj8","2021-05-30T04:17:31.950434+00:00","1881","插入后的最大值","maximum-value-after-insertion",288305998],"2887178574":["排序二分+暴力枚举","er-fen-bao-li-mei-ju-by-endlesscheng-vezb","2021-09-11T09:40:25.214882+00:00","LCP 42","玩具套圈","vFjcfV",2887178574],"2887492330":["贪心 + 一次遍历","by-endlesscheng-yfyf","2022-03-20T01:00:17.849394+00:00","2207","字符串中最多数目的子序列","maximize-number-of-subsequences-in-a-string",2887492330],"2887872471":["树形 DP：转换成树上最大路径和（Python/Java/C++/Go）","by-endlesscheng-5l70","2023-01-15T04:13:25.274494+00:00","2538","最大价值和与最小价值和的差值","difference-between-maximum-and-minimum-price-sum",2887872471],"2887915717":["排序优化 + 枚举所有点","mei-ju-suo-you-dian-by-endlesscheng-u049","2022-04-24T04:18:57.903196+00:00","2249","统计圆内格点数目","count-lattice-points-inside-a-circle",2887915717],"288912613":["Go 模拟","go-mo-ni-by-endlesscheng-kjpt","2021-10-31T01:49:07.872527+00:00","2056","棋盘上有效移动组合的数目","number-of-valid-move-combinations-on-chessboard",288912613],"2889905668":["贪心 + 视频讲解","tan-xin-by-endlesscheng-f7e4","2022-10-30T04:08:03.935705+00:00","2457","美丽整数的最小增量","minimum-addition-to-make-integer-beautiful",2889905668],"289054660":["Go 模拟","go-mo-ni-by-endlesscheng-t3a5","2021-10-02T16:07:55.401818+00:00","2022","将一维数组转变成二维数组","convert-1d-array-into-2d-array",289054660],"2890702645":["双指针","s-by-endlesscheng-m0pg","2022-10-07T23:59:48.164669+00:00","LCP 68","美观的花束","1GxJYY",2890702645],"290394387":["划分成三组然后合并","go-mo-ni-by-endlesscheng-axo2","2022-02-05T16:18:48.843166+00:00","2161","根据给定数字划分数组","partition-array-according-to-given-pivot",290394387],"2907477166":["一次遍历","yi-ci-bian-li-by-endlesscheng-bun4","2022-10-16T04:07:08.037532+00:00","2442","反转之后不同整数的数目","count-number-of-distinct-integers-after-reverse-operations",2907477166],"2913358439":["双指针（附一行写法）","by-endlesscheng-f6bd","2023-01-22T07:52:19.443118+00:00","2540","最小公共值","minimum-common-value",2913358439],"2914198967":["贪心 O(n) 做法（Python/Java/C++/Go）","by-endlesscheng-8ee3","2022-08-14T04:08:40.034712+00:00","2375","根据模式串构造最小数字","construct-smallest-number-from-di-string",2914198967],"2919642920":["后序遍历（Python/Java/C++/Go）","hou-xu-bian-li-pythonjavacgo-by-endlessc-gll3","2023-05-20T00:58:16.214162+00:00","1373","二叉搜索子树的最大键值和","maximum-sum-bst-in-binary-tree",2919642920],"2921275572":["字典树+括号表示法+哈希表","zi-dian-shu-ha-xi-biao-by-endlesscheng-115r","2021-07-25T04:06:01.535191+00:00","1948","删除系统中的重复文件夹","delete-duplicate-folders-in-system",2921275572],"2921363389":["教你一步步思考动态规划：从记忆化搜索到递推（Python/Java/C++/Go/JS/Rust）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-k15a","2023-12-08T00:25:16.927014+00:00","2008","出租车的最大盈利","maximum-earnings-from-taxi",2921363389],"2923349215":["用哈希表统计差异","jian-ji-xie-fa-yong-ha-xi-biao-tong-ji-c-7qzn","2021-09-11T09:37:46.079191+00:00","LCP 39","无人机方阵","0jQkd0",2923349215],"292566381":["BFS 为什么要用队列？一个视频讲透！（Python/Java/C++/Go）","bfs-wei-shi-yao-yao-yong-dui-lie-yi-ge-s-bgzr","2023-06-02T09:37:00.798989+00:00","LCR 150","彩灯装饰记录 II","cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof",292566381],"2937149161":["O(n) 一次遍历（Python/Java/C++/Go）","on-yi-ci-bian-li-pythonjavacgo-by-endles-0jye","2024-01-14T04:38:31.012947+00:00","3005","最大频率元素计数","count-elements-with-maximum-frequency",2937149161],"2937224937":["简洁写法！（Python/Java/C++/Go）","xian-qu-mo-zai-mo-ni-by-endlesscheng-iabk","2023-11-26T04:20:05.509828+00:00","2946","循环移位后的矩阵相似检查","matrix-similarity-after-cyclic-shifts",2937224937],"2939895760":["离线+字典树","chi-xian-zi-dian-shu-by-endlesscheng-ojnw","2021-07-18T04:07:49.781082+00:00","1938","查询最大基因差","maximum-genetic-difference-query",2939895760],"2942833315":["建图技巧 + 并查集（Python/Java/C++/Go）","jiantu-by-endlesscheng-rkra","2022-10-08T02:20:53.297595+00:00","LCP 71","集水器","kskhHQ",2942833315],"2945726008":["两种做法：堆 / 二分+搜索（Python/Java/C++/Go）","zhuan-huan-dui-by-endlesscheng-8yiq","2022-08-21T04:13:02.509397+00:00","2386","找出数组的第 K 大和","find-the-k-sum-of-an-array",2945726008],"2946534771":["简洁写法：不出现 ba 即可","jian-ji-xie-fa-bu-chu-xian-ba-ji-ke-by-e-0ka0","2022-01-02T04:13:08.704508+00:00","2124","检查是否所有 A 都在 B 之前","check-if-all-as-appears-before-all-bs",2946534771],"2948030094":["一行写法","yi-xing-xie-fa-by-endlesscheng-yfe2","2023-08-06T00:51:30.999749+00:00","2806","取整购买后的账户余额","account-balance-after-rounded-purchase",2948030094],"2956439807":["【图解】转换成单源最短路问题（Python/Java/C++/Go）","tu-jie-zhuan-huan-cheng-dan-yuan-zui-dua-6l8o","2022-11-25T23:54:14.254388+00:00","882","细分图中的可到达节点","reachable-nodes-in-subdivided-graph",2956439807],"296151509":["【图解】从一维差分到二维差分（Python/Java/C++/Go/JS/Rust）","wu-nao-zuo-fa-er-wei-qian-zhui-he-er-wei-zwiu","2022-01-08T16:14:50.649687+00:00","2132","用邮票贴满网格图","stamping-the-grid",296151509],"2963413938":["子集状压 DP：从记忆化搜索到递推（附题单！）","zi-ji-zhuang-ya-dpcong-ji-yi-hua-sou-suo-oxwd","2023-06-16T01:45:44.090279+00:00","1494","并行课程 II","parallel-courses-ii",2963413938],"2965139328":["栈+简洁写法（Python/Java/C++/Go）","zhan-jian-ji-xie-fa-pythonjavacgo-by-end-i9o7","2023-05-02T14:20:36.756094+00:00","1003","检查替换后的词是否有效","check-if-word-is-valid-after-substitutions",2965139328],"296740468":["滑动窗口，一个视频讲透！（Python/Java/C++/Go）","hua-dong-chuang-kou-yi-ge-shi-pin-jiang-yowmi","2023-02-22T06:57:16.432110+00:00","1004","最大连续1的个数 III","max-consecutive-ones-iii",296740468],"2967621636":["前缀最小和 + 后缀最大和 + 堆","qian-zhui-zui-xiao-he-hou-zhui-zui-da-he-yz3d","2022-02-05T16:12:30.306809+00:00","2163","删除元素后和的最小差值","minimum-difference-in-sums-after-removal-of-elements",2967621636],"2975776867":["库函数写法（Python/Java/C++/Go）","ku-han-shu-xie-fa-pythonjavacgo-by-endle-fjmr","2023-05-28T10:54:13.807126+00:00","2710","移除字符串中的尾随零","remove-trailing-zeros-from-a-string",2975776867],"2977235574":["构造 + 贪心 + 分类讨论","gou-zao-tan-xin-fen-lei-tao-lun-by-endle-dqr8","2022-01-08T16:14:06.048446+00:00","2131","连接两字母单词得到的最长回文串","longest-palindrome-by-concatenating-two-letter-words",2977235574],"2981004463":["击败100%！枚举GCD+循环优化（Python/Java/C++/Go）","ji-bai-100mei-ju-gcdxun-huan-you-hua-pyt-get7","2023-01-14T00:25:45.284543+00:00","1819","序列中不同最大公约数的数目","number-of-different-subsequences-gcds",2981004463],"2982198446":["快慢指针","kuai-man-zhi-zhen-by-endlesscheng-jodm","2021-12-05T04:06:42.040368+00:00","2095","删除链表的中间节点","delete-the-middle-node-of-a-linked-list",2982198446],"3008885805":["【图解】一张图秒懂！转换成 136！（Python/Java/C++/Go/JS/Rust）","tu-jie-yi-zhang-tu-miao-dong-zhuan-huan-np9d2","2023-10-15T23:57:44.801820+00:00","260","只出现一次的数字 III","single-number-iii",3008885805],"3010901510":["一步步优化：从数组到位运算（Python/Java/C++/Go/JS/Rust）","yi-bu-bu-you-hua-cong-shu-zu-dao-wei-yun-hu0b","2023-11-25T00:26:33.846362+00:00","1457","二叉树中的伪回文路径","pseudo-palindromic-paths-in-a-binary-tree",3010901510],"3012401904":["O(1) 数学公式（Python/Java/C++/Go）","o1-shu-xue-gong-shi-pythonjavacgo-by-end-v2bt","2024-01-21T05:25:52.980117+00:00","3014","输入单词需要的最少按键次数 I","minimum-number-of-pushes-to-type-word-i",3012401904],"3014957498":["Go 贪心","go-tan-xin-by-endlesscheng-wz53","2021-08-21T16:12:03.084663+00:00","1974","使用特殊打字机键入单词的最少时间","minimum-time-to-type-word-using-special-typewriter",3014957498],"3015354306":["击败 100%！从双指针到终极优化，十万个查询都不怕！（Python/Java/C++/Go/JS）","ji-bai-100cong-shuang-zhi-zhen-dao-zhong-yhze","2023-08-22T23:53:41.406502+00:00","1782","统计点对的数目","count-pairs-of-nodes",3015354306],"301567212":["转换问题+最小堆","zhuan-huan-wen-ti-zui-xiao-dui-by-endles-9t8t","2023-01-22T07:54:35.174107+00:00","2542","最大子序列的分数","maximum-subsequence-score",301567212],"301734990":["田忌赛马（Python/Java/C++/Go）","tian-ji-sai-ma-by-endlesscheng-yxm6","2022-10-07T23:40:03.670706+00:00","870","优势洗牌","advantage-shuffle",301734990],"3020603346":["单源最短路 + 拓扑序 DP","dan-yuan-zui-duan-lu-tuo-bu-xu-dp-by-end-i3ml","2021-08-21T16:08:51.990880+00:00","1976","到达目的地的方案数","number-of-ways-to-arrive-at-destination",3020603346],"3023056451":["数学 O(1) 解","shu-xue-o1-jie-by-endlesscheng-hucn","2023-01-29T04:08:39.469188+00:00","2549","统计桌面上的不同数字","count-distinct-numbers-on-board",3023056451],"3023386017":["数位 DP 通用模板 + 详细注释 + 题单（Python/Java/C++/Go）","shu-wei-dp-tong-yong-mo-ban-xiang-xi-zhu-e5dg","2022-10-17T23:46:36.650136+00:00","902","最大为 N 的数字组合","numbers-at-most-n-given-digit-set",3023386017],"3024031273":["两种方法：BFS/记忆化搜索（Python/Java/C++/Go）","liang-chong-fang-fa-bfsji-yi-hua-sou-suo-djba","2024-01-07T01:07:02.820496+00:00","2998","使 X 和 Y 相等的最少操作次数","minimum-number-of-operations-to-make-x-and-y-equal",3024031273],"3029042062":["简洁写法 + 一次遍历","jian-ji-xie-fa-yi-ci-bian-li-by-endlessc-za1f","2022-01-23T04:08:41.811502+00:00","2149","按符号重排数组","rearrange-array-elements-by-sign",3029042062],"3033778664":["Go 三行解决","go-san-xing-jie-jue-by-endlesscheng-jfzf","2021-10-16T12:31:25.987317+00:00","537","复数乘法","complex-number-multiplication",3033778664],"3036702868":["分解质因数","fen-jie-zhi-yin-shu-by-endlesscheng-x3kz","2023-01-01T04:09:36.709890+00:00","2521","数组乘积中的不同质因数数目","distinct-prime-factors-of-product-of-array",3036702868],"3044209556":["O(n) 做法","on-zuo-fa-by-endlesscheng-o2wp","2021-09-26T04:32:54.809512+00:00","2016","增量元素之间的最大差值","maximum-difference-between-increasing-elements",3044209556],"3048586035":["统计前缀和中的 0 的个数（Python/Java/C++/Go）","tong-ji-qian-zhui-he-zhong-de-0-de-ge-sh-fh1u","2024-02-04T04:36:07.473252+00:00","3028","边界上的蚂蚁","ant-on-the-boundary",3048586035],"305518406":["统计每个元素的出现次数","by-endlesscheng-h1uj","2022-04-24T04:18:39.184518+00:00","2248","多个数组求交集","intersection-of-multiple-arrays",305518406],"3057254301":["【视频】极致优化！一个视频讲透双指针！（Python/Java/C++/Go/JS/Rust）","shuang-zhi-zhen-xiang-bu-ming-bai-yi-ge-pno55","2022-11-12T04:34:09.608600+00:00","15","三数之和","3sum",3057254301],"3061824471":["枚举排列+子序列匹配","mei-ju-pai-lie-zi-xu-lie-pi-pei-by-endle-oi2h","2021-09-19T04:26:16.312560+00:00","2014","重复 K 次的最长子序列","longest-subsequence-repeated-k-times",3061824471],"3063296642":["田忌赛马，从 O(nlogn) 到 O(n)","tian-ji-sai-ma-by-endlesscheng-buk1","2023-03-18T16:08:53.261195+00:00","2592","最大化数组的伟大值","maximize-greatness-of-an-array",3063296642],"3065232387":["极致优化！基于三数之和的做法（Python/Java/C++/Go/JS）","ji-zhi-you-hua-ji-yu-san-shu-zhi-he-de-z-qgqi","2023-07-10T00:26:38.330188+00:00","16","最接近的三数之和","3sum-closest",3065232387],"3065742618":["分别计算，暴力枚举（Python/Java/C++/Go）","fen-bie-ji-suan-bao-li-mei-ju-by-endless-zxhr","2023-12-24T04:08:27.454256+00:00","2975","移除栅栏得到的正方形田地的最大面积","maximum-square-area-by-removing-fences-from-a-field",3065742618],"306595116":["二分答案（Python 一行搞定）","er-fen-da-an-python-yi-xing-gao-ding-by-xwvs8","2022-02-27T04:14:20.037831+00:00","2187","完成旅途的最少时间","minimum-time-to-complete-trips",306595116],"3067908479":["贪心 + 栈（Python/Java/C++/Go）","tan-xin-zhan-by-endlesscheng-ldds","2022-10-09T04:07:27.496778+00:00","2434","使用机器人打印字典序最小的字符串","using-a-robot-to-print-the-lexicographically-smallest-string",3067908479],"3071565639":["最近公共祖先，一个视频讲透！（Python/Java/C++/Go/JS/Rust）","zui-jin-gong-gong-zu-xian-yi-ge-shi-pin-8h2zc","2022-12-17T08:56:28.423747+00:00","235","二叉搜索树的最近公共祖先","lowest-common-ancestor-of-a-binary-search-tree",3071565639],"3074518984":["两种非暴力做法：0-1 trie+滑窗 / 哈希表（Python/Java/C++/Go）","o7n-zuo-fa-0-1-trie-hua-dong-chuang-kou-5h2t0","2023-11-12T04:13:54.626791+00:00","2932","找出强数对的最大异或值 I","maximum-strong-pair-xor-i",3074518984],"3077002187":["O(n) 做法","go-bao-li-by-endlesscheng-w2fr","2021-06-26T16:08:03.422449+00:00","1909","删除一个元素使数组严格递增","remove-one-element-to-make-the-array-strictly-increasing",3077002187],"307769453":["两种写法：逆向思维/直接双指针（Python/Java/C++/Go）","ni-xiang-si-wei-pythonjavacgo-by-endless-b4jt","2023-01-07T00:13:45.242065+00:00","1658","将 x 减到 0 的最小操作数","minimum-operations-to-reduce-x-to-zero",307769453],"3078609754":["不调库！一行代码搞定！（Python/Java/C++/Go）","yi-xing-gong-shi-by-endlesscheng-ixss","2022-09-18T04:12:37.496128+00:00","2413","最小偶倍数","smallest-even-multiple",3078609754],"3091785544":["Go 模拟","mo-ni-by-endlesscheng-chru","2021-08-15T04:07:53.545224+00:00","1967","作为子字符串出现在单词中的字符串数目","number-of-strings-that-appear-as-substrings-in-word",3091785544],"3092398094":["贪心（Python/Java/C++/Go）","tan-xin-pythonjavacgo-by-endlesscheng-gm1d","2023-06-11T04:23:25.942869+00:00","2734","执行子串操作后的字典序最小字符串","lexicographically-smallest-string-after-substring-operation",3092398094],"3098562302":["枚举第一个机器人的拐弯位置","mei-ju-di-yi-ge-ji-qi-ren-de-guai-wan-we-prfy","2021-09-26T04:09:36.814252+00:00","2017","网格游戏","grid-game",3098562302],"3100993645":["又写错了？一个视频讲透！（Python/Java/C++/Go）","you-xie-cuo-liao-yi-ge-shi-pin-jiang-tou-teqq","2022-11-26T09:50:31.176600+00:00","92","反转链表 II","reverse-linked-list-ii",3100993645],"3102719435":["枚举 higher[0] + 双指针","mei-ju-higher0-shuang-zhi-zhen-by-endles-ic64","2021-12-26T04:07:03.761465+00:00","2122","还原原数组","recover-the-original-array",3102719435],"3104122930":["如何用 Python 的状压 DP 递推写法通过此题","by-endlesscheng-d2oa","2021-05-04T01:29:43.563495+00:00","1723","完成所有工作的最短时间","find-minimum-time-to-finish-all-jobs",3104122930],"3118022376":["两种方法：Z 函数+字典树/只用字典树（Python/Java/C++/Go）","z-han-shu-zi-dian-shu-pythonjavacgo-by-e-5c2v","2024-02-18T04:49:23.317901+00:00","3045","统计前后缀下标对 II","count-prefix-and-suffix-pairs-ii",3118022376],"3118895370":["转换成求轮廓是否相交（Python/Java/C++/Go）","zhuan-huan-cheng-qiu-lun-kuo-shi-fou-xia-io8x","2023-02-04T16:12:27.035474+00:00","2556","二进制矩阵中翻转最多一次使路径不连通","disconnect-path-in-a-binary-matrix-by-at-most-one-flip",3118895370],"3119137809":["O(n) 贪心做法","on-zuo-fa-by-endlesscheng-an8b","2021-11-21T04:18:59.422762+00:00","2078","两栋颜色不同且距离最远的房子","two-furthest-houses-with-different-colors",3119137809],"3123299347":["【视频】如何灵活运用递归？让你对递归的理解更上一层楼！（Python/Java/C++/Go）","shi-pin-ru-he-ling-huo-yun-yong-di-gui-r-p925","2023-04-17T02:30:24.821316+00:00","LCR 176","判断是否为平衡二叉树","ping-heng-er-cha-shu-lcof",3123299347],"3124896474":["滑动窗口 O(n) 时间 O(1) 空间，附题单！（Python/Java/C++/Go/JS/Rust）","hua-dong-chuang-kou-on-shi-jian-o1-kong-cqawc","2023-10-01T04:17:53.381502+00:00","2875","无限数组的最短子数组","minimum-size-subarray-in-infinite-array",3124896474],"3126153106":["Go 一行","go-yi-xing-by-endlesscheng-7yl3","2022-04-02T16:14:39.132639+00:00","2220","转换数字的最少位翻转次数","minimum-bit-flips-to-convert-number",3126153106],"3143101757":["遍历","bian-li-by-endlesscheng-a77m","2022-10-30T04:09:16.801563+00:00","2456","最流行的视频创作者","most-popular-video-creator",3143101757],"3147357769":["Go 模拟","go-mo-ni-by-endlesscheng-tq1p","2021-09-12T04:05:47.572919+00:00","2000","反转单词前缀","reverse-prefix-of-word",3147357769],"3147772108":["单调栈 + 前缀和的前缀和（Python/Java/C++/Go）","dan-diao-zhan-qian-zhui-he-de-qian-zhui-d9nki","2022-05-22T04:09:32.848492+00:00","2281","巫师的总力量和","sum-of-total-strength-of-wizards",3147772108],"3148467486":["两种做法：从 O(nlogn) 到 O(n)（Python/Java/C++/Go）","dai-zhao-xia-biao-qu-pai-xu-pythonjavacg-umuv","2023-03-18T16:17:45.955681+00:00","2593","标记所有元素后数组的分数","find-score-of-an-array-after-marking-all-elements",3148467486],"3152421262":["【图解】从 O(n^2) 到 O(n)（Python/Java/C++/Go/JS/Rust）","tu-jie-cong-on2-dao-onpythonjavacgojsrus-h0o5","2024-02-21T23:58:35.939169+00:00","889","根据前序和后序遍历构造二叉树","construct-binary-tree-from-preorder-and-postorder-traversal",3152421262],"315307043":["【图解】两种方法：二分答案 / 直接计算（Python/Java/C++/Go/JS/Rust）","er-fen-bfspythonjavacgo-by-endlesscheng-ypp1","2022-04-30T16:08:54.191904+00:00","2258","逃离火灾","escape-the-spreading-fire",315307043],"31547081":["又写错了？一个视频讲透！（Python/Java/C++/Go/JS）","you-xie-cuo-liao-yi-ge-shi-pin-jiang-tou-kcmj","2022-12-01T06:48:11.958579+00:00","LCR 141","训练计划 III","fan-zhuan-lian-biao-lcof",31547081],"3156996757":["O(n) 一次遍历（Python/Java/C++/Go/JS/Rust）","on-yi-ci-bian-li-pythonjavacgojsrust-by-l9jat","2024-01-16T23:55:09.771058+00:00","2744","最大字符串配对数目","find-maximum-number-of-string-pairs",3156996757],"3158353268":["判断质数（Python/Java/C++/Go）","pan-duan-zhi-shu-by-endlesscheng-m6nt","2023-04-09T04:21:49.252049+00:00","2614","对角线上的质数","prime-in-diagonal",3158353268],"3177194252":["双端队列 O(n) 做法（Python/Java/C++/Go）","shuang-duan-dui-lie-on-zuo-fa-by-endless-5pe1","2023-08-06T04:16:52.674960+00:00","2810","故障键盘","faulty-keyboard",3177194252],"3182582646":["一次遍历（Python/Java/C++/Go/JS）","yi-ci-bian-li-by-endlesscheng-6zt9","2023-08-13T04:30:14.044978+00:00","2815","数组中的最大数对和","max-pair-sum-in-an-array",3182582646],"3183288856":["排序+滑动窗口","pai-xu-hua-dong-chuang-kou-by-endlessche-s49g","2021-08-29T04:07:39.279219+00:00","1984","学生分数的最小差值","minimum-difference-between-highest-and-lowest-of-k-scores",3183288856],"3187405082":["两种分类讨论思路（Python/Java/C++/Go）","yong-che-xiao-de-fang-shi-si-kao-pythonj-o253","2024-01-21T05:06:00.340531+00:00","3017","按距离统计房屋对数目 II","count-the-number-of-houses-at-a-certain-distance-ii",3187405082],"3189918628":["如何删除节点？六分钟搞定四道题目！（Python/Java/C++/Go）","ru-he-shan-chu-jie-dian-liu-fen-zhong-ga-x3kn","2022-12-03T08:43:02.662487+00:00","237","删除链表中的节点","delete-node-in-a-linked-list",3189918628],"3201195359":["状压 DP","zhuang-ya-dp-by-endlesscheng-d8sw","2021-05-29T16:07:02.645483+00:00","1879","两个数组最小的异或值之和","minimum-xor-sum-of-two-arrays",3201195359],"3202447407":["DFS 的同时计算分数","liang-bian-dfs-by-endlesscheng-utf8","2021-10-24T04:06:43.757510+00:00","2049","统计最高分的节点数目","count-nodes-with-the-highest-score",3202447407],"320329751":["O(N) 后缀数组做法","hou-zhui-shu-zu-on-zuo-fa-by-endlesschen-mgg3","2021-07-07T02:54:56.784417+00:00","1062","最长重复子串","longest-repeating-substring",320329751],"3211790430":["按照名字分组+排序（Python/Java/C++/Go）","an-zhao-ming-zi-fen-zu-pai-xu-pythonjava-fkax","2023-11-12T04:09:58.481568+00:00","2933","高访问员工","high-access-employees",3211790430],"3214093273":["又写错了？一个视频讲透！（Python/Java/C++/Go）","you-xie-cuo-liao-yi-ge-shi-pin-jiang-tou-plfs","2022-11-26T09:51:12.243797+00:00","25","K 个一组翻转链表","reverse-nodes-in-k-group",3214093273],"3216210693":["巧妙枚举（Python/Java/C++/Go/JS/Rust）","qiao-miao-mei-ju-pythonjavacgo-by-endles-5ws2","2023-06-11T04:10:02.105031+00:00","2735","收集巧克力","collecting-chocolates",3216210693],"3221190981":["又写死循环了？一个视频讲透二分！（Python/Java/C++/Go）","by-endlesscheng-owgd","2022-11-23T10:15:21.430178+00:00","153","寻找旋转排序数组中的最小值","find-minimum-in-rotated-sorted-array",3221190981],"3221222128":["排序后从中间分开，错开一位合并","pai-xu-hou-cuo-kai-yi-wei-he-bing-by-end-mqrk","2021-08-15T04:07:31.510050+00:00","1968","构造元素不等于两相邻元素平均值的数组","array-with-elements-not-equal-to-average-of-neighbors",3221222128],"3228686257":["两种思考问题的角度：移除元素/添加元素（Python/Java/C++/Go）","tan-xin-pythonjavacgo-by-endlesscheng-ymuh","2024-01-07T04:21:32.153913+00:00","3002","移除后集合的最多元素数","maximum-size-of-a-set-after-removals",3228686257],"3230369611":["【图解】非暴力 O(nm) 算法（Python/Java/C++/Go）","tu-jie-fei-bao-li-onm-suan-fa-pythonjava-k5og","2023-03-26T14:55:32.443032+00:00","1638","统计只差一个字符的子串数目","count-substrings-that-differ-by-one-character",3230369611],"3231924477":["【视频】分类讨论乱如麻？一个视频梳理清楚！（Python/Java/C++/Go）","shi-pin-fen-lei-tao-lun-luan-ru-ma-yi-ge-vote","2023-04-17T03:18:55.812949+00:00","LCR 193","二叉搜索树的最近公共祖先","er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof",3231924477],"3243872254":["高效写法，只需初始化一次统计数组","gao-xiao-xie-fa-zhi-xu-chu-shi-hua-yi-ci-4zs3","2022-01-09T04:12:33.175142+00:00","2133","检查是否每一行每一列都包含全部整数","check-if-every-row-and-column-contains-all-numbers",3243872254],"3248412457":["排序不等式","by-endlesscheng-9p6y","2022-05-29T00:12:49.578478+00:00","2285","道路的最大总重要性","maximum-total-importance-of-roads",3248412457],"324872429":["Go 统计因子个数","go-tong-ji-yin-zi-ge-shu-by-endlesscheng-doxu","2021-08-01T04:09:07.699966+00:00","1952","三除数","three-divisors",324872429],"3250902571":["一次遍历（Python/Java/C++/Go/JS）","mo-ni-by-endlesscheng-is4i","2022-12-24T23:57:51.929834+00:00","2511","最多可以摧毁的敌人城堡数目","maximum-enemy-forts-that-can-be-captured",3250902571],"3254374161":["两次排序","liang-ci-pai-xu-by-endlesscheng-994b","2021-12-11T16:12:42.531028+00:00","2099","找到和最大的长度为 K 的子序列","find-subsequence-of-length-k-with-the-largest-sum",3254374161],"3256507952":["预处理回文数+中位数贪心（Python/Java/C++/Go）","yu-chu-li-hui-wen-shu-zhong-wei-shu-tan-7j0zy","2023-12-17T04:12:12.806397+00:00","2967","使数组成为等数数组的最小代价","minimum-cost-to-make-array-equalindromic",3256507952],"3261672467":["枚举做几道菜+贪心（Python/Java/C++/Go/JS/Rust）","mei-ju-zuo-ji-dao-cai-tan-xin-pythonjava-k7w2","2023-10-21T23:31:19.801070+00:00","1402","做菜顺序","reducing-dishes",3261672467],"3263594037":["没有思路？一张图秒懂！（Python/Java/C++/Go/JS）","mei-you-si-lu-yi-zhang-tu-miao-dong-pyth-ilqh","2023-07-19T23:53:17.291420+00:00","918","环形子数组的最大和","maximum-sum-circular-subarray",3263594037],"3267047320":["两种方法：动态规划/前缀和（附题单！Python/Java/C++/Go/JS）","liang-chong-fang-fa-dong-tai-gui-hua-qia-dczr","2023-08-08T00:28:13.629404+00:00","1749","任意子数组和的绝对值的最大值","maximum-absolute-sum-of-any-subarray",3267047320],"3272610079":["每行分段统计","mei-xing-fen-duan-tong-ji-by-endlesschen-umie","2021-05-15T16:56:45.275916+00:00","1861","旋转盒子","rotating-the-box",3272610079],"32848909":["线性做法","xian-xing-zuo-fa-by-endlesscheng-pgbv","2021-08-08T04:06:05.093867+00:00","1961","检查字符串是否为数组前缀","check-if-string-is-a-prefix-of-array",32848909],"3290623649":["位运算简洁写法（Python/Java/C++/Go）","wei-yun-suan-jian-ji-xie-fa-pythonjavacg-h7rz","2024-01-28T04:29:23.541498+00:00","3019","按键变更的次数","number-of-changing-keys",3290623649],"3300902320":["一些简化代码的技巧","mo-ni-by-endlesscheng-mc05","2022-09-25T01:40:11.829597+00:00","LCP 61","气温变化趋势","6CE719",3300902320],"3302229375":["【视频】教你一步步思考动态规划！股票问题通用解法！（Python/Java/C++/Go/JS/Rust）","shi-pin-jiao-ni-yi-bu-bu-si-kao-dong-tai-o3y4","2023-03-31T10:38:12.318698+00:00","122","买卖股票的最佳时机 II","best-time-to-buy-and-sell-stock-ii",3302229375],"3304159418":["一题双解：DFS + BFS / 最近公共祖先","bfs-zuo-fa-by-endlesscheng-dfcf","2021-12-05T04:10:15.376692+00:00","2096","从二叉树一个节点到另一个节点每一步的方向","step-by-step-directions-from-a-binary-tree-node-to-another",3304159418],"330899243":["Go 贪心","go-tan-xin-by-endlesscheng-opwm","2021-08-21T16:13:25.262800+00:00","1975","最大方阵和","maximum-matrix-sum",330899243],"3312226061":["脑筋急转弯，O(n) 一次遍历（Python/Java/C++/Go）","nao-jin-ji-zhuan-wan-on-yi-ci-bian-li-py-cv1q","2023-10-15T00:01:50.299077+00:00","2900","最长相邻不相等子序列 I","longest-unequal-adjacent-groups-subsequence-i",3312226061],"3315472808":["前缀和常见技巧（Python/Java/C++/Go）","qian-zhui-he-chang-jian-ji-qiao-by-endle-t57t","2021-06-27T04:05:54.839918+00:00","1915","最美子字符串的数目","number-of-wonderful-substrings",3315472808],"3329709268":["Go 差分+位运算压缩状态","go-chai-fen-wei-yun-suan-ya-suo-zhuang-t-smpb","2021-12-07T05:58:56.920083+00:00","759","员工空闲时间","employee-free-time",3329709268],"3334241084":["前缀和+式子变形（附题单）Python/Java/C++/Go/JS","qian-zhui-he-ha-xi-biao-fu-ti-dan-by-end-74bb","2023-09-03T04:12:30.518984+00:00","2845","统计趣味子数组的数目","count-of-interesting-subarrays",3334241084],"333667858":["Go 模拟","go-jian-ji-xie-fa-by-endlesscheng-mcwc","2021-08-22T04:13:01.368526+00:00","1980","找出不同的二进制字符串","find-unique-binary-string",333667858],"3336959867":["子序列 DP + 枚举字符 + 空间优化（Python/Java/C++/Go）","by-endlesscheng-t7zf","2022-08-07T04:06:37.770561+00:00","2370","最长理想子序列","longest-ideal-subsequence",3336959867],"3337273246":["读题题","du-ti-ti-by-endlesscheng-qp1m","2022-12-04T04:07:11.493850+00:00","2492","两个城市间路径的最小分数","minimum-score-of-a-path-between-two-cities",3337273246],"3344221047":["回溯不会写？套路在此！（Python/Java/C++/Go/JS）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-wcdw","2023-01-20T09:24:48.614561+00:00","22","括号生成","generate-parentheses",3344221047],"334656901":["模拟","mo-ni-by-endlesscheng-p5va","2022-04-16T16:12:25.401281+00:00","2239","找到最接近 0 的数字","find-closest-number-to-zero",334656901],"3347724858":["Go 模拟","go-mo-ni-by-endlesscheng-wxi2","2021-06-12T16:15:45.840883+00:00","1894","找到需要补充粉笔的学生编号","find-the-student-that-will-replace-the-chalk",3347724858],"3348570525":["如何去重？一个视频讲透！（Python/Java/C++/Go）","ru-he-qu-zhong-yi-ge-shi-pin-jiang-tou-p-2ddn","2022-12-03T08:48:10.054794+00:00","82","删除排序链表中的重复元素 II","remove-duplicates-from-sorted-list-ii",3348570525],"335140403":["脑筋急转弯（Python/Java/C++/Go）","nao-jin-ji-zhuan-wan-by-endlesscheng-0l19","2023-08-06T04:25:36.659151+00:00","2811","判断是否能拆分数组","check-if-it-is-possible-to-split-array",335140403],"3353015937":["两种 O(n) 递归写法（Python/Java/C++/Go/JS）","liang-chong-on-di-gui-xie-fa-pythonjavac-hac3","2023-09-06T00:01:29.941959+00:00","865","具有所有最深节点的最小子树","smallest-subtree-with-all-the-deepest-nodes",3353015937],"3354310865":["模拟","by-endlesscheng-rant","2022-09-18T04:12:18.517051+00:00","2414","最长的字母序连续子字符串的长度","length-of-the-longest-alphabetical-continuous-substring",3354310865],"335486990":["Go 模拟","go-mo-ni-by-endlesscheng-bjeo","2021-10-17T04:07:42.281312+00:00","2042","检查句子中的数字是否递增","check-if-numbers-are-ascending-in-a-sentence",335486990],"3355469687":["暴力枚举 / 双指针（Python/Java/C++/Go）","bao-li-mei-ju-pythonjavacgo-by-endlessch-z6t6","2022-09-04T04:08:08.538117+00:00","2401","最长优雅子数组","longest-nice-subarray",3355469687],"3357632986":["回溯不会写？套路在此！（Python/Java/C++/Go）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-zbxu","2023-02-01T12:00:24.791331+00:00","LCR 079","子集","TVdhkn",3357632986],"3363685518":["倒序操作+简洁写法！（Python/Java/C++/Go）","dao-xu-cao-zuo-jian-ji-xie-fa-pythonjava-7rqh","2023-06-04T04:23:48.053174+00:00","2718","查询后矩阵的和","sum-of-matrix-after-queries",3363685518],"3369476122":["数位 DP 通用模板","shu-wei-dp-tong-yong-mo-ban-by-endlessch-h8fj","2023-07-30T04:06:56.422450+00:00","2801","统计范围内的步进数字数目","count-stepping-numbers-in-range",3369476122],"3371445858":["先斜着走再直走，然后在终点绕圈圈（Python/Java/C++/Go/JS）","xian-xie-zhao-zou-zai-zhi-zou-ran-hou-za-lkxu","2023-09-10T04:09:58.198270+00:00","2849","判断能否在给定时间到达单元格","determine-if-a-cell-is-reachable-at-a-given-time",3371445858],"3372525938":["【视频】双指针想不明白？一个视频讲透！（Python/Java/C++/Go/JS/Rust）","san-shu-zhi-he-bu-hui-xie-xiang-xiang-sh-6wbq","2022-11-12T04:17:02.175043+00:00","167","两数之和 II - 输入有序数组","two-sum-ii-input-array-is-sorted",3372525938],"337441895":["【套路】二分答案！附题单！","er-fen-da-an-by-endlesscheng-r418","2022-12-25T04:08:09.774252+00:00","2517","礼盒的最大甜蜜度","maximum-tastiness-of-candy-basket",337441895],"3375593429":["枚举","mei-ju-by-endlesscheng-0mnx","2023-07-09T01:31:22.459371+00:00","2768","黑格子的数目","number-of-black-blocks",3375593429],"3376945874":["与其维护第一个未满栈，不如维护所有未满栈（Python/Java/C++/Go）","yu-qi-wei-hu-di-yi-ge-wei-man-zhan-bu-ru-sphs","2023-04-27T14:10:19.359856+00:00","1172","餐盘栈","dinner-plate-stacks",3376945874],"3381061806":["字典树+Floyd+记忆化搜索/递推（Python/Java/C++/Go）","zi-dian-shu-floyddp-by-endlesscheng-oi2r","2023-12-24T04:10:15.561726+00:00","2977","转换字符串的最小成本 II","minimum-cost-to-convert-string-ii",3381061806],"3382549811":["排序 + 简化代码的技巧","pai-xu-by-endlesscheng-nm1r","2022-05-15T05:44:40.237983+00:00","2274","不含特殊楼层的最大连续楼层数","maximum-consecutive-floors-without-special-floors",3382549811],"3386206172":["两种 O(n) 做法：KMP / Z函数（Python/Java/C++/Go）","liang-chong-on-zuo-fa-kmp-zhan-shu-pytho-1ty6","2024-02-11T04:34:59.558357+00:00","3034","匹配模式数组的子数组数目 I","number-of-subarrays-that-match-a-pattern-i",3386206172],"3386255965":["贪心（Python/Java/C++/Go）","tan-xin-pythonjavacgo-by-endlesscheng-r0py","2023-05-21T10:57:21.738759+00:00","2697","字典序最小回文串","lexicographically-smallest-palindrome",3386255965],"3387998069":["事件扫描线","shi-jian-sao-miao-xian-by-endlesscheng-a6v1","2021-07-24T16:06:07.182865+00:00","1943","描述绘画结果","describe-the-painting",3387998069],"3398027261":["只有两种情况（Python/Java/C++/Go）","zhi-you-liang-chong-qing-kuang-pythonjav-jdeg","2023-11-12T04:09:03.651688+00:00","2934","最大化数组末位元素的最少操作次数","minimum-operations-to-maximize-last-elements-in-arrays",3398027261],"3400286463":["模拟","mo-ni-by-endlesscheng-wegn","2022-02-19T16:11:16.964464+00:00","2176","统计数组中相等且可以被整除的数对","count-equal-and-divisible-pairs-in-an-array",3400286463],"3403473925":["避免浮点数的写法","by-endlesscheng-xzk2","2022-03-20T08:07:15.056293+00:00","2208","将数组和减半的最少操作次数","minimum-operations-to-halve-array-sum",3403473925],"340770494":["按照相同时间分组 + 建图 DFS","an-zhao-xiang-tong-shi-jian-fen-zu-jian-2y4yx","2021-11-28T04:06:16.749974+00:00","2092","找出知晓秘密的所有专家","find-all-people-with-secret",340770494],"340860484":["【图解】没有思路？一张图秒懂！（Python/Java/C++/Go/JS/Rust）","kao-lu-mei-tiao-bian-shang-zhi-shao-xu-y-uamv","2022-11-20T04:11:03.471891+00:00","2477","到达首都的最少油耗","minimum-fuel-cost-to-report-to-the-capital",340860484],"3422315602":["递推 + 枚举","d-by-endlesscheng-kya3","2022-09-25T04:25:57.292282+00:00","2420","找到所有好下标","find-all-good-indices",3422315602],"3424505272":["【图解】一张图秒懂换根 DP！（Python/Java/C++/Go/JS）","tu-jie-yi-zhang-tu-miao-dong-huan-gen-dp-6bgb","2023-07-16T00:38:34.796392+00:00","834","树中距离之和","sum-of-distances-in-tree",3424505272],"3427404671":["【动画】从两数之和中，我们可以学到什么？（Python/Java/C++/Go/JS/Rust）","dong-hua-cong-liang-shu-zhi-he-zhong-wo-0yvmj","2023-06-30T23:33:48.737195+00:00","1","两数之和","two-sum",3427404671],"343052836":["枚举 nums[j] + 前后缀分解（Python/Java/C++/Go）","mei-ju-numsj-qian-hou-zhui-fen-jie-pytho-tskf","2023-10-22T08:03:09.032969+00:00","2909","元素和最小的山形三元组 II","minimum-sum-of-mountain-triplets-ii",343052836],"3430688223":["排序 + 贪心","pai-xu-tan-xin-by-endlesscheng-k5i4","2022-06-05T04:23:52.842691+00:00","2294","划分数组使最大差为 K","partition-array-such-that-maximum-difference-is-k",3430688223],"3430988573":["后缀数组+二分答案","hou-zhui-shu-zu-er-fen-da-an-by-endlessc-ocar","2021-07-04T04:10:07.148151+00:00","1923","最长公共子路径","longest-common-subpath",3430988573],"3433602336":["从递归到递推，教你一步步思考动态规划！（Python/Java/C++/Go）","cong-di-gui-dao-di-tui-jiao-ni-yi-bu-bu-auy8z","2023-03-27T15:27:44.510030+00:00","1092","最短公共超序列","shortest-common-supersequence",3433602336],"3434976181":["滑动窗口，简洁写法（Python/Java/C++/Go）","hua-dong-chuang-kou-jian-ji-xie-fa-pytho-1c2d","2023-05-03T15:54:46.421113+00:00","2106","摘水果","maximum-fruits-harvested-after-at-most-k-steps",3434976181],"3435556540":["贪心 + 详细证明（Python/Java/C++/Go）","by-endlesscheng-d11y","2022-08-06T22:51:56.109611+00:00","2366","将数组排序的最少替换次数","minimum-replacements-to-sort-the-array",3435556540],"3437839264":["两种非暴力做法：KMP+二分查找/双指针（Python/Java/C++/Go）","fei-bao-li-zuo-fa-kmper-fen-cha-zhao-pyt-0o8y","2024-01-14T04:29:57.834965+00:00","3006","找出数组中的美丽下标 I","find-beautiful-indices-in-the-given-array-i",3437839264],"3444975876":["子集状压 DP（Python/Java/C++/Go/JS）","by-endlesscheng-80ao","2022-06-12T04:12:06.835035+00:00","2305","公平分发饼干","fair-distribution-of-cookies",3444975876],"3445184694":["O(log) 辗转相除法","olog-zhan-zhuan-xiang-chu-fa-by-endlessc-vxq0","2022-02-13T04:13:54.242893+00:00","2169","得到 0 的操作数","count-operations-to-obtain-zero",3445184694],"3448832663":["教你一步步思考动态规划！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-lbz5","2023-02-25T11:22:27.302671+00:00","1143","最长公共子序列","longest-common-subsequence",3448832663],"3460806368":["两张图秒懂单调队列（Python/Java/C++/Go）","liang-zhang-tu-miao-dong-dan-diao-dui-li-9fvh","2022-10-25T23:33:32.230667+00:00","862","和至少为 K 的最短子数组","shortest-subarray-with-sum-at-least-k",3460806368],"3461834167":["教你一步步思考构造题！（Python/Java/C++/Go）","tan-xin-gou-zao-yan-zheng-o1e-wai-kong-j-82ik","2023-02-19T04:08:47.961474+00:00","2573","找出对应 LCP 矩阵的字符串","find-the-string-with-lcp",3461834167],"3462463455":["枚举滑动窗口内有多少种字母（Python/Java/C++/Go）","bao-li-hua-chuang-mei-ju-chuang-kou-nei-31j5m","2023-12-03T04:17:32.001639+00:00","2953","统计完全子字符串","count-complete-substrings",3462463455],"3469926498":["数位 DP 通用模板，附题单（Python/Java/C++/Go）","by-endlesscheng-c5vg","2022-08-14T14:51:47.549288+00:00","1012","至少有 1 位重复的数字","numbers-with-repeated-digits",3469926498],"3474039417":["【套路】前缀和+哈希表（Python/Java/C++/Go）","tao-lu-qian-zhui-he-ha-xi-biao-pythonjav-3fna","2023-03-12T04:09:05.761121+00:00","2588","统计美丽子数组数目","count-the-number-of-beautiful-subarrays",3474039417],"3480413551":["O(2^n) 迭代子集或","o2n-zi-ji-huo-xie-fa-by-endlesscheng-bczp","2021-10-17T04:06:47.731735+00:00","2044","统计按位或能得到最大值的子集数目","count-number-of-maximum-bitwise-or-subsets",3480413551],"3483377785":["两种写法：01背包/子集状压DP（Python/Java/C++/Go）","liang-chong-xie-fa-01bei-bao-zi-ji-zhuan-3ooi","2023-02-19T10:03:03.475004+00:00","2572","无平方子集计数","count-the-number-of-square-free-subsets",3483377785],"3484001100":["相向双指针，一个视频讲透！（Python/Java/C++/Go）","xiang-xiang-shuang-zhi-zhen-yi-ge-shi-pi-nr4y","2023-02-17T14:32:24.954196+00:00","1237","找出给定方程的正整数解","find-positive-integer-solution-for-a-given-equation",3484001100],"3492742379":["预处理质数 + 枚举（Python/Java/C++/Go）","yu-chu-li-zhi-shu-mei-ju-by-endlesscheng-uw2b","2023-01-01T04:16:49.700806+00:00","2523","范围内最接近的两个质数","closest-prime-numbers-in-range",3492742379],"3501115477":["从 O(n^2) 到 O(n)：至多两段递增子数组","cong-on2-dao-onzhi-duo-liang-duan-di-zen-yruq","2023-09-17T01:44:29.784799+00:00","2855","使数组成为递增数组的最少右移次数","minimum-right-shifts-to-sort-the-array",3501115477],"3503134762":["线性 DP，附相似题目（Python/Java/C++/Go）","xian-xing-dpfu-xiang-si-ti-mu-pythonjava-wmh7","2023-08-20T04:13:35.535770+00:00","2830","销售利润最大化","maximize-the-profit-as-the-salesman",3503134762],"3509092584":["两种做法：位运算/打表（Python/Java/C++/Go）","liang-chong-zuo-fa-wei-yun-suan-da-biao-w4war","2023-06-11T09:50:31.497118+00:00","2729","判断一个数是否迷人","check-if-the-number-is-fascinating",3509092584],"3513036702":["中心扩展 + DP（Python/Java/C++/Go）","zhong-xin-kuo-zhan-dppythonjavacgo-by-en-1yt1","2022-11-13T04:12:27.046745+00:00","2472","不重叠回文子字符串的最大数目","maximum-number-of-non-overlapping-palindrome-substrings",3513036702],"3518502488":["乘法原理（Python/Java/C++/Go）","cheng-fa-yuan-li-by-endlesscheng-hypt","2023-06-25T04:09:49.042524+00:00","2750","将数组划分成若干好子数组的方式","ways-to-split-array-into-good-subarrays",3518502488],"3519471521":["组合数学题，附模板（Python/Java/C++/Go）","zu-he-shu-xue-ti-by-endlesscheng-5fjp","2023-12-03T04:13:06.063057+00:00","2954","统计感冒序列的数目","count-the-number-of-infection-sequences",3519471521],"3520875014":["看到递归就晕？带你理解递归的本质！（Python/Java/C++/Go/JS）","kan-dao-di-gui-jiu-yun-dai-ni-li-jie-di-leixm","2023-08-14T00:16:03.119009+00:00","617","合并二叉树","merge-two-binary-trees",3520875014],"3521652117":["贪心（每个语言都只需要两行！）Python/Java/C++/Go/JS/Rust","tan-xin-by-endlesscheng-0nsi","2023-09-24T04:20:35.210738+00:00","2864","最大二进制奇数","maximum-odd-binary-number",3521652117],"3521973284":["二维差分（Python/Java/C++/Go）","er-wei-chai-fen-by-endlesscheng-mh0h","2023-01-15T04:07:57.759152+00:00","2536","子矩阵元素加 1","increment-submatrices-by-one",3521973284],"3528330030":["遍历","bian-li-by-endlesscheng-k17h","2022-10-02T04:08:21.621883+00:00","2428","沙漏的最大总和","maximum-sum-of-an-hourglass",3528330030],"3532176892":["试填法（Python/Java/C++/Go）","shi-tian-fa-pythonjavacgo-by-endlesschen-ysom","2024-01-28T04:25:26.534887+00:00","3022","给定操作次数内使剩余元素的或值最小","minimize-or-of-remaining-elements-using-operations",3532176892],"3532863467":["【图解】O(n) 线性做法（Python/Java/C++/Go）","tu-jie-on-xian-xing-zuo-fa-pythonjavacgo-tjz2","2023-09-24T05:44:23.412584+00:00","2867","统计树中的合法路径数目","count-valid-paths-in-a-tree",3532863467],"3536253643":["O(log n) 容斥原理（附记忆化搜索）","olog-n-rong-chi-yuan-li-fu-ji-yi-hua-sou-okjf","2023-11-12T00:35:08.655580+00:00","2930","重新排列后包含指定子字符串的字符串数目","number-of-strings-which-can-be-rearranged-to-contain-substring",3536253643],"3547308658":["【视频】如何灵活运用递归？让你对递归的理解更上一层楼！（Python/Java/C++/Go）","shi-pin-ru-he-ling-huo-yun-yong-di-gui-r-4708","2023-04-17T05:48:46.943708+00:00","LCR 046","二叉树的右视图","WNC0Lk",3547308658],"3549688121":["贪心 + 构造（Python/Java/C++/Go）","tan-xin-gou-zao-by-endlesscheng-c2ui","2023-02-05T04:11:00.932985+00:00","2561","重排水果","rearranging-fruits",3549688121],"3550553048":["Go 自定义排序","go-zi-ding-yi-pai-xu-by-endlesscheng-4rg3","2021-08-29T04:07:17.919794+00:00","1985","找出数组中的第 K 大整数","find-the-kth-largest-integer-in-the-array",3550553048],"3552570937":["两种方法：逆向思维/正向思维（附题单）Python/Java/C++/Go/JS/Rust","liang-chong-fang-fa-ni-xiang-si-wei-zhen-e3gb","2023-12-03T00:50:11.100144+00:00","1423","可获得的最大点数","maximum-points-you-can-obtain-from-cards",3552570937],"3553057842":["原地修改","yuan-di-xiu-gai-by-endlesscheng-m1k3","2022-08-14T04:09:10.921955+00:00","2373","矩阵中的局部最大值","largest-local-values-in-a-matrix",3553057842],"3555784215":["划分型 DP（Python/Java/C++/Go）","by-endlesscheng-8y73","2022-08-07T04:06:56.753485+00:00","2369","检查数组是否存在有效划分","check-if-there-is-a-valid-partition-for-the-array",3555784215],"3558781406":["判断空格前后字符是否相同（附 Python 一行）","pan-duan-kong-ge-qian-hou-zi-fu-shi-fou-zstrn","2022-12-04T04:08:17.972731+00:00","2490","回环句","circular-sentence",3558781406],"3561342867":["贪心 + 一次遍历","bian-li-by-endlesscheng-7ojw","2023-01-01T04:10:01.202119+00:00","2522","将字符串分割成值不超过 K 的子字符串","partition-string-into-substrings-with-values-at-most-k",3561342867],"3562926842":["【图解】转换成中位数贪心+空间优化（Python/Java/C++/Go）","tu-jie-zhuan-huan-cheng-zhong-wei-shu-ta-iz4v","2022-12-17T23:30:50.467806+00:00","1703","得到连续 K 个 1 的最少相邻交换次数","minimum-adjacent-swaps-for-k-consecutive-ones",3562926842],"3563762803":["两种方法：选或不选/转换成0-1背包","xuan-huo-bu-xuan-de-dian-xing-si-lu-by-e-ulcd","2023-06-18T04:10:57.364928+00:00","2742","给墙壁刷油漆","painting-the-walls",3563762803],"3565117549":["转换成最大子数组和（Python/Java/C++/Go）","by-endlesscheng-fm8l","2022-06-26T04:44:26.256900+00:00","2321","拼接数组的最大分数","maximum-score-of-spliced-array",3565117549],"3565951903":["从前往后匹配+从后往前匹配","cong-qian-wang-hou-pi-pei-cong-hou-wang-uiq6a","2021-06-06T04:32:03.509613+00:00","1888","使二进制字符串字符交替的最少反转次数","minimum-number-of-flips-to-make-the-binary-string-alternating",3565951903],"3566729670":["转换成 a+b\u003ec，用相向双指针解决（Python/Java/C++/Go/JS）","zhuan-huan-cheng-abcyong-xiang-xiang-shu-1ex3","2023-09-08T08:41:24.440600+00:00","611","有效三角形的个数","valid-triangle-number",3566729670],"3567330607":["倒序动态规划","jian-ji-xie-fa-by-endlesscheng-bvrx","2021-08-29T04:17:25.695512+00:00","1987","不同的好子序列数目","number-of-unique-good-subsequences",3567330607],"3570284045":["没想明白？一个动画秒懂！附 O(1) 做法（Python/Java/C++/Go）","mei-xiang-ming-bai-yi-ge-dong-hua-miao-d-8vbe","2022-12-24T23:48:55.891923+00:00","1739","放置盒子","building-boxes",3570284045],"3573894690":["动态规划+线段树优化（Python/Java/C++/Go）","by-endlesscheng-05s0","2023-01-22T04:06:32.852414+00:00","2547","拆分数组的最小代价","minimum-cost-to-split-an-array",3573894690],"3585483303":["回溯不会写？套路在此！（Python/Java/C++/Go/JS）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-8rbi","2023-07-17T09:13:10.674456+00:00","面试题 08.04","幂集","power-set-lcci",3585483303],"3589033912":["双哈希表，O(1) 做法（Python/Java/C++/Go）","shuang-ha-xi-biao-o1-zuo-fa-pythonjavacg-jo68","2023-05-07T05:52:12.821829+00:00","2671","频率跟踪器","frequency-tracker",3589033912],"3590542886":["BFS 简洁写法","go-bfs-by-endlesscheng-kymv","2021-10-31T05:45:04.467223+00:00","2059","转化数字的最小运算数","minimum-operations-to-convert-number",3590542886],"3595421528":["二分答案，附题单！（Python/Java/C++/Go/JS/Rust）","er-fen-da-an-fu-ti-dan-pythonjavacgojsru-n5la","2024-01-21T00:37:48.720623+00:00","410","分割数组的最大值","split-array-largest-sum",3595421528],"3596139981":["教你一步步思考 DP！附 O(1) 空间写法！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dpfu-o1-kong-jia-4zma","2023-03-04T10:46:03.346462+00:00","300","最长递增子序列","longest-increasing-subsequence",3596139981],"359765882":["从记忆化搜索到递推，教你一步步思考动态规划！（Python/Java/C++/Go/JS）","cong-ji-yi-hua-sou-suo-dao-di-tui-jiao-n-nbk6","2023-08-28T23:55:23.347335+00:00","823","带因子的二叉树","binary-trees-with-factors",359765882],"360478335":["数位 DP 通用模板，附题单（Python/Java/C++/Go）","by-endlesscheng-9b96","2022-09-25T00:29:26.257241+00:00","788","旋转数字","rotated-digits",360478335],"3605700572":["无向基环树","by-endlesscheng-422f","2022-04-05T09:31:09.824533+00:00","2204","无向图中到环的距离","distance-to-a-cycle-in-undirected-graph",3605700572],"3607071844":["O(n) 做法：考虑间隔和的变化量（Python/Java/C++/Go）","on-zuo-fa-ha-xi-biao-mei-ju-xiang-tong-y-f5yb","2021-12-26T04:07:30.050061+00:00","2121","相同元素的间隔之和","intervals-between-identical-elements",3607071844],"3609197847":["统计空格个数 +1 即为单词个数","tong-ji-kong-ge-de-ge-shu-1-by-endlessch-6f1g","2021-12-25T16:30:59.317461+00:00","2114","句子中的最多单词数","maximum-number-of-words-found-in-sentences",3609197847],"3619173359":["前缀和做法：本质是买卖股票问题（附题单！）Python/Java/C++/Go/JS/Rust","qian-zhui-he-zuo-fa-ben-zhi-shi-mai-mai-abu71","2023-11-20T00:12:17.437533+00:00","53","最大子数组和","maximum-subarray",3619173359],"3624743731":["贪心，最优可以 O(n)","tan-xin-ji-qi-zheng-ming-by-endlesscheng-u783","2023-04-02T05:18:37.256440+00:00","2611","老鼠和奶酪","mice-and-cheese",3624743731],"3627963576":["DFS 求连通块大小（Python/Java/C++/Go/JS/Rust）","by-endlesscheng-7l50","2022-06-26T00:30:29.350122+00:00","2316","统计无向图中无法互相到达点对数","count-unreachable-pairs-of-nodes-in-an-undirected-graph",3627963576],"3631325739":["线性做法（Python/Java/C++/Go/JS）","xian-xing-zuo-fa-pythonjavacgojs-by-endl-w6gs","2023-07-06T11:48:42.353720+00:00","2753","计算一个环形街道上的房屋数量 II","count-houses-in-a-circular-street-ii",3631325739],"364057867":["两种做法：二分答案 / 排序+贪心（附详细证明 Python/Java/C++/Go）","liang-chong-jie-fa-er-fen-da-an-pai-xu-t-grd8","2022-01-16T07:41:30.628469+00:00","2141","同时运行 N 台电脑的最长时间","maximum-running-time-of-n-computers",364057867],"3647529643":["Go 斜向前缀和","go-qian-zhui-he-by-endlesscheng-30l0","2021-05-30T08:52:49.067014+00:00","1878","矩阵中最大的三个菱形和","get-biggest-three-rhombus-sums-in-a-grid",3647529643],"3654559374":["【视频】教你一步步思考动态规划！股票问题通用解法！（Python/Java/C++/Go/JS/Rust）","shi-pin-jiao-ni-yi-bu-bu-si-kao-dong-tai-kksg","2023-03-31T11:54:01.045636+00:00","188","买卖股票的最佳时机 IV","best-time-to-buy-and-sell-stock-iv",3654559374],"3654833214":["O(n^2) 计数 DP（Python/Java/C++/Go）","on2-ji-shu-dppythonjavacgo-by-endlessche-hmez","2023-05-18T14:49:35.500079+00:00","1079","活字印刷","letter-tile-possibilities",3654833214],"3655265099":["贪心 + 简洁写法（Python/Java/C++/Go/JS）","tan-xin-jian-ji-xie-fa-by-endlesscheng-uxbg","2022-02-19T16:10:40.762705+00:00","2178","拆分成最多数目的正偶数之和","maximum-split-of-positive-even-integers",3655265099],"3670981421":["【视频】彻底掌握直径 DP！从二叉树到一般树！（Python/Java/C++/Go）","shi-pin-che-di-zhang-wo-zhi-jing-dpcong-taqma","2023-04-14T11:11:04.045213+00:00","543","二叉树的直径","diameter-of-binary-tree",3670981421],"3672640831":["哈希表模拟","ha-xi-biao-mo-ni-by-endlesscheng-9a0w","2022-01-23T04:13:26.356143+00:00","2150","找出数组中的所有孤独数字","find-all-lonely-numbers-in-the-array",3672640831],"3674750599":["Go 模拟","go-mo-ni-by-endlesscheng-j42f","2021-09-04T16:08:10.753503+00:00","1992","找到所有的农场组","find-all-groups-of-farmland",3674750599],"3679518604":["按奇偶性分类贪心（Python/Java/C++/Go）","by-endlesscheng-lusx","2022-10-23T08:18:25.420447+00:00","2449","使数组相似的最少操作次数","minimum-number-of-operations-to-make-arrays-similar",3679518604],"3695292464":["一写就错？请看这！（Python/Java/C++/Go）","yi-xie-jiu-cuo-qing-kan-zhe-pythonjavacg-91vz","2023-02-02T06:43:14.865344+00:00","LCR 008","长度最小的子数组","2VG8Kg",3695292464],"3696757985":[" 贪心 + 排序","tan-xin-pai-xu-by-endlesscheng-dkq1","2022-02-05T16:18:25.775979+00:00","2160","拆分数位后四位数字的最小和","minimum-sum-of-four-digit-number-after-splitting-digits",3696757985],"3697179042":["排序+单调栈上二分（Python/Java/C++/Go/JS/Rust）","pai-xu-dan-diao-zhan-shang-er-fen-by-end-of9h","2023-06-11T09:20:48.720107+00:00","2736","最大和查询","maximum-sum-queries",3697179042],"3698071341":["枚举旋转次数","mei-ju-xuan-zhuan-ci-shu-by-endlesscheng-xue9","2021-06-06T04:34:49.779369+00:00","1886","判断矩阵经轮转后是否一致","determine-whether-matrix-can-be-obtained-by-rotation",3698071341],"3707233513":["打表做法，枚举回文数","da-biao-zuo-fa-by-endlesscheng-7ojf","2021-11-21T04:06:57.759584+00:00","2081","k 镜像数字的和","sum-of-k-mirror-numbers",3707233513],"3709286362":["下标总算错？请看这！","xia-biao-zong-suan-cuo-qing-kan-zhe-by-e-jebq","2022-11-09T09:36:35.111502+00:00","713","乘积小于 K 的子数组","subarray-product-less-than-k",3709286362],"3713605524":["我的思考过程（Python/Java/C++/Go/JS）","pai-xu-pythonjavacgojs-by-endlesscheng-ptzl","2023-09-17T04:16:07.667313+00:00","2860","让所有学生保持开心的分组方法数","happy-students",3713605524],"3722557865":["简洁写法（Python 一行）","jian-ji-xie-fa-by-endlesscheng-ivjs","2022-06-26T04:21:23.665651+00:00","2319","判断矩阵是否是一个 X 矩阵","check-if-matrix-is-x-matrix",3722557865],"3729777530":["动态规划：从记忆化搜索到递推，再到空间优化","dong-tai-gui-hua-cong-ji-yi-hua-sou-suo-hxalb","2023-07-09T04:08:39.467139+00:00","2771","构造最长非递减子数组","longest-non-decreasing-subarray-from-two-arrays",3729777530],"3729897578":["枚举答案 + 利用同余性质优化至 O(1) 时间复杂度","mei-ju-da-an-by-endlesscheng-zh75","2022-06-19T04:28:15.832998+00:00","2310","个位数字为 K 的整数之和","sum-of-numbers-with-units-digit-k",3729897578],"3730047096":["贪心（Python/Java/C++/Go）","tan-xin-pythonjavacgo-by-endlesscheng-j58c","2023-12-24T01:32:32.680943+00:00","2973","树中每个节点放置的金币数目","find-number-of-coins-to-place-in-tree-nodes",3730047096],"3731391427":["从左往右遍历每个单词","cong-zuo-wang-you-bian-li-by-endlesschen-pct5","2022-05-15T08:57:35.816236+00:00","2273","移除字母异位词后的结果数组","find-resultant-array-after-removing-anagrams",3731391427],"3735372403":["没想明白？一张图秒懂！（Python/Java/C++/Go）","mei-xiang-ming-bai-yi-zhang-tu-miao-dong-a6r1","2023-02-24T14:35:17.016543+00:00","1247","交换字符使得字符串相同","minimum-swaps-to-make-strings-equal",3735372403],"3735555259":["换根 DP（Python/Java/C++/Go）","huan-gen-dppythonjavacgo-by-endlesscheng-ccwy","2023-03-04T16:13:27.019587+00:00","2581","统计可能的树根数目","count-number-of-possible-root-nodes",3735555259],"3735817636":["《2023 年度最简单题目》","python-yi-xing-by-endlesscheng-g7qn","2023-07-30T04:30:28.422286+00:00","2798","满足目标工作时长的员工数目","number-of-employees-who-met-the-target",3735817636],"3735818622":["按题意模拟即可（Python/Java/C++/Go）","an-ti-yi-mo-ni-ji-ke-by-endlesscheng-k819","2023-10-15T01:51:55.777676+00:00","2899","上一个遍历的整数","last-visited-integers",3735818622],"3736843920":["排序 + 双指针","pai-xu-shuang-zhi-zhen-by-endlesscheng-h54k","2022-09-17T23:55:00.226447+00:00","2410","运动员和训练师的最大匹配数","maximum-matching-of-players-with-trainers",3736843920],"3738097801":["滑动窗口","hua-dong-chuang-kou-by-endlesscheng-m0gm","2022-11-06T04:06:47.226378+00:00","2461","长度为 K 子数组中的最大和","maximum-sum-of-distinct-subarrays-with-length-k",3738097801],"3738671880":["简洁写法，利用二叉搜索树的性质（Python/Java/C++/Go/JS/Rust）","jian-ji-xie-fa-li-yong-er-cha-sou-suo-sh-r5zm","2023-12-04T00:46:57.220273+00:00","1038","从二叉搜索树到更大和树","binary-search-tree-to-greater-sum-tree",3738671880],"3740959852":["合并区间的两种写法（Python/Java/C++/Go）","he-bing-qu-jian-pythonjavacgo-by-endless-yxhw","2023-12-10T04:07:23.381360+00:00","2963","统计好分割方案的数目","count-the-number-of-good-partitions",3740959852],"374180471":["等价转换 + 贪心（Python/Java/C++/Go）","by-endlesscheng-5qmk","2022-07-09T23:05:14.252820+00:00","2333","最小差值平方和","minimum-sum-of-squared-difference",374180471],"3742724136":["两种 DP 做法：倒序填表 / 正序刷表（Python/Java/C++/Go）","dao-xu-dp-by-endlesscheng-2qkc","2022-01-16T04:07:14.635168+00:00","2140","解决智力问题","solving-questions-with-brainpower",3742724136],"374282350":["正难则反","zheng-nan-ze-fan-by-endlesscheng-t7ag","2023-01-29T04:07:34.865110+00:00","2550","猴子碰撞的方法数","count-collisions-of-monkeys-on-a-polygon",374282350],"3743671260":["简洁写法，利用二叉搜索树的性质（Python/Java/C++/Go/JS/Rust）","jian-ji-xie-fa-li-yong-er-cha-sou-suo-sh-lz3i","2023-12-04T00:50:40.251907+00:00","538","把二叉搜索树转换为累加树","convert-bst-to-greater-tree",3743671260],"3754756357":["反转链表+两数相加=秒杀！（Python/Java/C++/Go/JS）","fan-zhuan-lian-biao-liang-shu-xiang-jia-okw6q","2023-07-03T00:03:43.031887+00:00","445","两数相加 II","add-two-numbers-ii",3754756357],"3754993583":["从 O(50^3) 到 O(50^2)","cong-o503-dao-o502-by-endlesscheng-5wp4","2023-05-28T09:57:01.125849+00:00","2711","对角线上不同值的数量差","difference-of-number-of-distinct-values-on-diagonals",3754993583],"3756156206":["思维题 + 分类讨论（Python/Java/C++/Go）","li-yong-nums10-tan-xin-zhao-bu-deng-yu-z-amvw","2022-12-11T00:57:35.567617+00:00","2499","让数组不相等的最小总代价","minimum-total-cost-to-make-arrays-unequal",3756156206],"375721237":["树形 DP","shu-xing-dp-by-endlesscheng-isuo","2022-09-24T14:32:08.294575+00:00","LCP 64","二叉树灯饰","U7WvvU",375721237],"3757271328":["两种 BFS 写法：双数组/队列（Python/Java/C++/Go/JS）","liang-chong-bfs-xie-fa-shuang-shu-zu-dui-a4hd","2024-02-17T00:08:59.975546+00:00","429","N 叉树的层序遍历","n-ary-tree-level-order-traversal",3757271328],"3761575610":["模拟 + 计算区间交集","by-endlesscheng-3r0d","2022-09-18T01:06:05.616744+00:00","2409","统计共同度过的日子数","count-days-spent-together",3761575610],"3766200583":["问题转换+GCD+具体构造方法（Python/Java/C++/Go）","wen-ti-zhuan-huan-gcdju-ti-gou-zao-fang-0plx0","2023-01-22T07:55:35.584916+00:00","2543","判断一个点是否可以到达","check-if-point-is-reachable",3766200583],"3778120928":["按题意模拟（Python/Java/C++/Go）","an-ti-yi-mo-ni-pythonjavacgo-by-endlessc-zq6e","2024-02-04T01:31:54.732077+00:00","3024","三角形类型","type-of-triangle",3778120928],"3778209816":["两次遍历","by-endlesscheng-nufi","2022-05-15T11:45:19.065316+00:00","2270","分割数组的方案数","number-of-ways-to-split-array",3778209816],"3779169819":["O(n) 一次遍历（Python/Java/C++/Go）","by-endlesscheng-jjtb","2022-10-16T04:07:31.964483+00:00","2441","与对应负数同时存在的最大正整数","largest-positive-integer-that-exists-with-its-negative",3779169819],"3786781582":["贡献法：讨论每个元素在答案中的出现次数","tao-lun-mei-ge-yuan-su-zai-da-an-zhong-d-uutg","2022-10-01T23:41:54.673541+00:00","2425","所有数对的异或和","bitwise-xor-of-all-pairings",3786781582],"3789355498":["枚举所有三位数偶数","mei-ju-suo-you-san-wei-shu-ou-shu-by-end-8n7d","2021-12-05T04:07:10.096097+00:00","2094","找出 3 位偶数","finding-3-digit-even-numbers",3789355498],"3791950406":["四种写法：DFS+哈希表/双数组/单数组（Python/Java/C++/Go）","si-chong-xie-fa-dfsha-xi-biao-shuang-shu-tg6q","2024-02-13T00:35:15.813178+00:00","987","二叉树的垂序遍历","vertical-order-traversal-of-a-binary-tree",3791950406],"3800630907":["库函数写法（Python/Java/C++/Go）","mo-ni-by-endlesscheng-b2sg","2022-12-11T01:03:34.667629+00:00","2496","数组中字符串的最大值","maximum-value-of-a-string-in-an-array",3800630907],"3801430886":["倒序滑动窗口 + O(1) 额外空间","dao-xu-hua-dong-chuang-kou-o1-kong-jian-xpgkp","2022-01-30T05:03:02.253655+00:00","2156","查找给定哈希值的子串","find-substring-with-given-hash-value",3801430886],"3802076349":["三种写法：分组 + 枚举首字母（Python/Java/C++/Go）","by-endlesscheng-ruz8","2022-06-12T04:19:58.259499+00:00","2306","公司命名","naming-a-company",3802076349],"3802833057":["考虑引力和的变化量（Python/Java/C++/Go）","by-endlesscheng-g405","2022-05-01T04:06:00.522127+00:00","2262","字符串的总引力","total-appeal-of-a-string",3802833057],"3803787289":["等价转换 + 后缀和优化（Python/Java/C++/Go）","deng-jie-zhuan-huan-pythonjavacgo-by-end-2qzs","2022-07-24T04:09:04.362336+00:00","2354","优质数对的数目","number-of-excellent-pairs",3803787289],"3806017410":["二分答案 + 贪心，附题单（Python/Java/C++/Go）","er-fen-da-an-tan-xin-by-endlesscheng-dlxv","2023-04-09T04:14:13.570270+00:00","2616","最小化数对的最大差值","minimize-the-maximum-difference-of-pairs",3806017410],"3813795330":["Go 库函数+特判","go-ku-han-shu-da-fa-by-endlesscheng-lxnp","2021-11-14T15:01:20.764619+00:00","468","验证IP地址","validate-ip-address",3813795330],"3814673758":["三种算法：从暴力到优化（Python/Java/C++/Go）","san-chong-suan-fa-cong-bao-li-dao-you-hu-nmtq","2023-05-10T15:05:09.519486+00:00","1016","子串能表示从 1 到 N 数字的二进制串","binary-string-with-substrings-representing-1-to-n",3814673758],"3820908739":["简洁写法：一次遍历+O(1) 空间（Python/Java/C++/Go/JS/Rust）","jian-ji-xie-fa-pythonjavacgo-by-endlessc-gag2","2022-10-16T04:06:23.987161+00:00","2444","统计定界子数组的数目","count-subarrays-with-fixed-bounds",3820908739],"3821666194":["枚举卖出价格，维护买入的最小值（Python/Java/C++/Go/JS/Rust）","mei-ju-mai-chu-jie-ge-wei-hu-mai-ru-de-z-02ud","2023-10-01T01:16:52.641096+00:00","121","买卖股票的最佳时机","best-time-to-buy-and-sell-stock",3821666194],"3822669184":["动态规划的典型思考策略（Python/Java/C++/Go）","by-endlesscheng-pa3v","2022-03-20T01:23:31.362946+00:00","2209","用地毯覆盖后的最少白色砖块","minimum-white-tiles-after-covering-with-carpets",3822669184],"3828565221":["【视频讲解】前后指针（Python/Java/C++/Go/JS）","shi-pin-jiang-jie-qian-hou-zhi-zhen-pyth-xptk","2023-08-04T07:24:44.414063+00:00","LCR 140","训练计划 II","lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof",3828565221],"3830405744":["Go 模拟","go-mo-ni-by-endlesscheng-tv8c","2022-01-16T04:11:18.022824+00:00","2138","将字符串拆分为若干长度为 k 的组","divide-a-string-into-groups-of-size-k",3830405744],"3830794143":["6 种语言 API 应用（Python/Java/C++/Go/JS/Rust）","6-chong-yu-yan-api-ying-yong-pythonjavac-k3ae","2023-11-26T11:05:18.353319+00:00","2942","查找包含给定字符的单词","find-words-containing-character",3830794143],"3835566276":["暴力枚举","bao-li-mei-ju-by-endlesscheng-p7b4","2022-10-16T04:06:47.865388+00:00","2443","反转之后的数字和","sum-of-number-and-its-reverse",3835566276],"3836897087":["两种写法：用字符串/不用字符串（Python/Java/C++/Go）","liang-chong-xie-fa-yong-zi-fu-chuan-bu-y-qwh8","2024-02-18T04:57:15.198678+00:00","3043","最长公共前缀的长度","find-the-length-of-the-longest-common-prefix",3836897087],"3843288760":["Go 一行","go-yi-xing-by-endlesscheng-61aw","2021-09-29T23:36:38.597166+00:00","405","数字转换为十六进制数","convert-a-number-to-hexadecimal",3843288760],"3849697077":["Go 模拟","go-mo-ni-by-endlesscheng-f551","2021-10-31T05:26:45.512083+00:00","2057","值相等的最小索引","smallest-index-with-equal-value",3849697077],"3851133364":["不会化简？请看这！（Python/Java/C++/Go）","bu-hui-hua-jian-qing-kan-zhe-pythonjavac-c2s6","2023-05-11T14:47:53.906667+00:00","1330","翻转子数组得到最大的数组值","reverse-subarray-to-maximize-array-value",3851133364],"3851205548":["BFS+排序/快速选择（Python/Java/C++/Go/JS/Rust）","bfspai-xu-kuai-su-xuan-ze-pythonjavacgoj-kl5c","2024-02-23T00:04:44.852492+00:00","2583","二叉树中的第 K 大层和","kth-largest-sum-in-a-binary-tree",3851205548],"385203255":["【模板】内向基环树，附题单（Python/Java/C++/Go）","nei-xiang-ji-huan-shu-pythonjavacgo-by-e-zrzh","2023-10-01T04:09:38.344886+00:00","2876","有向图访问计数","count-visited-nodes-in-a-directed-graph",385203255],"3867293007":["记忆化搜索","by-endlesscheng-6yvy","2022-09-04T04:14:08.539828+00:00","2400","恰好移动 k 步到达某一位置的方法数目","number-of-ways-to-reach-a-position-after-exactly-k-steps",3867293007],"3871311053":["O(n) 双指针写法","on-shuang-zhi-zhen-xie-fa-by-endlesschen-6dkt","2021-11-07T04:07:10.649971+00:00","2062","统计字符串中的元音子字符串","count-vowel-substrings-of-a-string",3871311053],"3874484865":["从递归到递推，教你一步步思考动态规划！（附题单）","cong-di-gui-dao-di-tui-jiao-ni-yi-bu-bu-2cwkb","2023-07-13T00:23:31.698182+00:00","931","下降路径最小和","minimum-falling-path-sum",3874484865],"3876397144":["寻找全为 0 的列（Python/Java/C++/Go）","jian-ji-xie-fa-by-endlesscheng-wry2","2023-11-05T04:26:53.085236+00:00","2923","找到冠军 I","find-champion-i",3876397144],"3880011182":["暴力枚举，简洁写法（Python/Java/C++/Go）","bao-li-mei-ju-xpythonjavacgo-by-endlessc-hdmc","2024-01-28T05:12:34.477568+00:00","3020","子集中元素的最大数量","find-the-maximum-number-of-elements-in-subset",3880011182],"3891355877":["线性做法：哈希表+位运算","xian-xing-zuo-fa-ha-xi-biao-wei-yun-suan-lii4","2022-12-18T04:07:59.405768+00:00","2506","统计相似字符串对的数目","count-pairs-of-similar-strings",3891355877],"3898582486":["贪心及其证明（Python/Java/C++/Go）","by-endlesscheng-diiq","2022-07-23T23:17:45.750361+00:00","2350","不可能得到的最短骰子序列","shortest-impossible-sequence-of-rolls",3898582486],"389978318":["O(1) 空间写法","o1-kong-jian-xie-fa-by-endlesscheng-ji12","2022-11-06T04:07:05.356483+00:00","2460","对数组执行操作","apply-operations-to-an-array",389978318],"3900992255":["可以转换成第一类斯特林数的理由","zhuan-huan-cheng-di-yi-lei-si-te-lin-shu-2y1k","2021-05-16T04:51:13.960237+00:00","1866","恰有 K 根木棍可以看到的排列数目","number-of-ways-to-rearrange-sticks-with-k-sticks-visible",3900992255],"3907062892":["线段树二分（Python/Java/C++/Go）","by-endlesscheng-okcu","2022-05-28T23:21:46.976837+00:00","2286","以组为单位订音乐会的门票","booking-concert-tickets-in-groups",3907062892],"3907541820":["哈希表套平衡树 / 懒删除堆（Python/Java/C++/Go）","ha-xi-biao-tao-ping-heng-shu-by-endlessc-hzct","2022-07-24T04:10:32.708944+00:00","2353","设计食物评分系统","design-a-food-rating-system",3907541820],"3909203570":["状态压缩+两数异或（Python/Java/C++/Go）","yong-wei-yun-suan-chu-li-by-endlesscheng-n9ws","2023-07-23T04:17:34.488376+00:00","2791","树中可以形成回文的路径数","count-paths-that-can-form-a-palindrome-in-a-tree",3909203570],"3911303073":["两种做法：递归 / 迭代（Python/Java/C++/Go）","di-gui-jian-ji-xie-fa-by-endlesscheng-jfwi","2022-11-27T04:15:33.345262+00:00","2487","从链表中移除节点","remove-nodes-from-linked-list",3911303073],"3911640069":["Go 简洁写法，附详细注释","go-mo-ni-fu-xiang-xi-zhu-shi-by-endlessc-wqyc","2021-10-24T04:06:08.769738+00:00","2047","句子中的有效单词数","number-of-valid-words-in-a-sentence",3911640069],"3920920642":["各种语言的库函数写法（Python/Java/C++/Go/JS）","ge-chong-yu-yan-de-ku-han-shu-xie-fa-pyt-w29z","2023-12-30T00:27:32.602938+00:00","1185","一周中的第几天","day-of-the-week",3920920642],"3922635563":["每组恰好选一个的分组背包 + 常数优化至 40ms","fen-zu-bei-bao-by-endlesscheng-fret","2021-08-22T04:15:41.679830+00:00","1981","最小化目标值与所选元素的差","minimize-the-difference-between-target-and-chosen-elements",3922635563],"3926333474":["Go DFS+哈希表","go-dfsha-xi-biao-by-endlesscheng-lqli","2021-09-25T10:05:46.084484+00:00","LCP 44","开幕式焰火","sZ59z6",3926333474],"3926884655":["Go 简洁写法","go-jian-ji-xie-fa-by-endlesscheng-92b4","2021-07-18T04:09:46.461909+00:00","1935","可以输入的最大单词数","maximum-number-of-words-you-can-type",3926884655],"3929135553":["拓扑排序+动态规划（Python/Java/C++/Go/JS）","tuo-bu-pai-xu-dong-tai-gui-hua-by-endles-dph6","2021-10-24T04:07:15.278330+00:00","2050","并行课程 III","parallel-courses-iii",3929135553],"3930025215":["动态规划（Python/Java/C++/Go）","dong-tai-gui-hua-pythonjavacgo-by-endles-94wq","2022-10-09T04:21:22.209975+00:00","2435","矩阵中和能被 K 整除的路径","paths-in-matrix-whose-sum-is-divisible-by-k",3930025215],"3935523633":["单调栈的本质：及时去掉无用数据（Python/Java/C++/Go/JS/Rust）","dan-diao-zhan-de-ben-zhi-ji-shi-qu-diao-8tp3s","2024-01-05T00:10:44.425648+00:00","1944","队列中可以看到的人数","number-of-visible-people-in-a-queue",3935523633],"3936988451":["不在 edges[i][1] 中的唯一编号（Python/Java/C++/Go）","bu-zai-edgesi1-zhong-de-wei-yi-bian-hao-44ur6","2023-11-05T04:29:56.714618+00:00","2924","找到冠军 II","find-champion-ii",3936988451],"3939185799":["两种方法：枚举全排列 / 最小费用最大流（Python/Java/C++/Go/JS）","tong-yong-zuo-fa-zui-xiao-fei-yong-zui-d-iuw8","2023-09-10T04:08:19.521461+00:00","2850","将石头分散到网格图的最少移动次数","minimum-moves-to-spread-stones-over-grid",3939185799],"3943793700":["从 0 到 1 的 0-1 BFS（Python/Java/C++/Go）","cong-0-dao-1-de-0-1-bfspythonjavacgo-by-1m8z4","2023-01-20T23:37:49.488486+00:00","1824","最少侧跳次数","minimum-sideway-jumps",3943793700],"3944079582":["如何想出状态定义和状态转移方程？一个视频学会！（Python/Java/C++/Go/JS）","ru-he-xiang-chu-zhuang-tai-ding-yi-he-zh-1wt1","2023-02-09T13:40:32.818428+00:00","198","打家劫舍","house-robber",3944079582],"3946751496":["按模 space 的结果分组","a-by-endlesscheng-own9","2022-10-30T00:17:58.119655+00:00","2453","摧毁一系列目标","destroy-sequential-targets",3946751496],"3947635653":["在前缀和上倒序 DP","zai-qian-zhui-he-shang-dao-xu-dp-by-endl-jxqs","2021-05-23T04:06:17.640223+00:00","1872","石子游戏 VIII","stone-game-viii",3947635653],"3953077425":["前缀和优化 DP","qian-zhui-he-you-hua-dp-by-endlesscheng-j10b","2021-09-05T04:05:57.111173+00:00","1997","访问完所有房间的第一天","first-day-where-you-have-been-in-all-the-rooms",3953077425],"3953865894":["动态规划：考虑相邻元素的大小关系（Python/Java/C++/Go）","dong-tai-gui-hua-kao-lu-xiang-lin-yuan-s-ni0p","2022-10-09T23:22:08.960454+00:00","801","使序列递增的最小交换次数","minimum-swaps-to-make-sequences-increasing",3953865894],"3957965518":["分层 BFS 的同时排序（Python/Java/C++/Go）","fen-ceng-bfs-de-tong-shi-pai-xu-by-endle-ash6","2022-01-22T16:11:51.168085+00:00","2146","价格范围内最高排名的 K 样物品","k-highest-ranked-items-within-a-price-range",3957965518],"3960620247":["模拟","mo-ni-by-endlesscheng-li9j","2022-07-23T23:21:28.510009+00:00","2347","最好的扑克手牌","best-poker-hand",3960620247],"3965390038":["教你一步步思考动态规划！一个视频讲透！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-kmrs","2023-02-23T01:45:46.907074+00:00","LCR 103","零钱兑换","gaM7Ch",3965390038],"3967032436":["时空复杂度均为 O(1) 的写法（外圈模拟器）","go-mo-ni-by-endlesscheng-exyr","2021-11-14T00:20:57.598798+00:00","2069","模拟行走机器人 II","walking-robot-simulation-ii",3967032436],"3968538235":["Go 爆搜","go-bao-sou-by-endlesscheng-ivn0","2021-09-12T04:07:23.642230+00:00","2002","两个回文子序列长度的最大乘积","maximum-product-of-the-length-of-two-palindromic-subsequences",3968538235],"3969212159":["贡献法（Python/Java/C++/Go/JS）","gong-xian-fa-pythonjavacgo-by-endlessche-d4jx","2023-05-13T16:11:40.737280+00:00","2681","英雄的力量","power-of-heroes",3969212159],"3971252642":["滑动窗口+暴力枚举（Python/Java/C++/Go）","hua-dong-chuang-kou-bao-li-mei-ju-by-end-9mvl","2023-04-23T04:16:27.873583+00:00","2653","滑动子数组的美丽值","sliding-subarray-beauty",3971252642],"3971324453":["真•梦开始的地方（Python/Java/C++/Go/JS）","zhen-meng-kai-shi-de-di-fang-by-endlessc-rwxa","2022-04-18T04:48:25.795769+00:00","2235","两整数相加","add-two-integers",3971324453],"3973047784":["极简写法：调用自身","jijian-by-endlesscheng-4oqo","2022-10-07T11:14:39.559916+00:00","LCP 67","装饰树","KnLfVT",3973047784],"3973609032":["从三维到二维（Python/Java/C++/Go）","by-endlesscheng-tgkn","2022-06-25T23:49:44.218792+00:00","2318","不同骰子序列的数目","number-of-distinct-roll-sequences",3973609032],"3974822873":["【图解】没有思路？一张图秒懂！（Python/Java/C++/Go）","tu-jie-mei-you-si-lu-yi-zhang-tu-miao-do-3lli","2023-04-25T13:23:06.123408+00:00","1031","两个非重叠子数组的最大和","maximum-sum-of-two-non-overlapping-subarrays",3974822873],"3978152897":["模拟 + 简洁写法","mo-ni-by-endlesscheng-oiuw","2022-08-06T23:36:23.729755+00:00","2365","任务调度器 II","task-scheduler-ii",3978152897],"3978864326":["两种做法：排序 / 哈希表","pai-xu-hou-zui-xiao-zui-da-pi-pei-by-end-7sta","2022-12-04T04:07:48.841105+00:00","2491","划分技能点相等的团队","divide-players-into-teams-of-equal-skill",3978864326],"3981013694":["两种做法：直接排序 / 离线+增量排序（Python/Java/C++/Go）","pai-xu-by-endlesscheng-ylft","2022-07-17T04:09:54.852699+00:00","2343","裁剪数字后查询第 K 小的数字","query-kth-smallest-trimmed-number",3981013694],"3985813844":["前序中序后序，三种方法，一个视频讲透！（Python/Java/C++/Go）","qian-xu-zhong-xu-hou-xu-san-chong-fang-f-90zr","2022-12-15T02:43:03.483651+00:00","面试题 04.05","合法二叉搜索树","legal-binary-search-tree-lcci",3985813844],"3989118459":["两种方法：枚举 j / 枚举 k（Python/Java/C++/Go）","mei-ju-jzhao-qian-hou-zui-da-zhi-pythonj-um8q","2023-10-01T04:10:41.636720+00:00","2874","有序三元组中的最大值 II","maximum-value-of-an-ordered-triplet-ii",3989118459],"399050701":["Go 模拟","go-mo-ni-by-endlesscheng-fcue","2022-06-05T04:25:36.163812+00:00","2293","极大极小游戏","min-max-game",399050701],"3990558875":["判断满足要求的三元组各部分是否出现过","pan-duan-man-zu-yao-qiu-de-san-yuan-zu-g-dnom","2021-06-13T04:11:16.299054+00:00","1899","合并若干三元组以形成目标三元组","merge-triplets-to-form-target-triplet",3990558875],"4000844273":["动态规划：从记忆化搜索到递推","dong-tai-gui-hua-cong-ji-yi-hua-sou-suo-2ptkg","2023-07-09T04:09:25.746632+00:00","2770","达到末尾下标所需的最大跳跃次数","maximum-number-of-jumps-to-reach-the-last-index",4000844273],"4006089601":["Go 最小圆覆盖 Welzl 算法","go-zui-xiao-yuan-fu-gai-welzl-suan-fa-by-v6yz","2021-12-06T02:23:44.043587+00:00","1924","安装栅栏 II","erect-the-fence-ii",4006089601],"4006408746":["两种算法：暴力替换/栈（Python/Java/C++/Go）","liang-chong-suan-fa-bao-li-ti-huan-zhan-vto0o","2023-05-21T10:49:03.811642+00:00","2696","删除子串后的字符串最小长度","minimum-string-length-after-removing-substrings",4006408746],"4007529944":["模拟","mo-ni-by-endlesscheng-lnia","2022-04-16T16:11:27.844079+00:00","2241","设计一个 ATM 机器","design-an-atm-machine",4007529944],"4011399863":["【视频讲解】用归纳法证明（Python/Java/C++/Go/JS/Rust）","yong-gui-na-fa-zheng-ming-pythonjavacgo-mvyu1","2023-12-03T05:03:11.761935+00:00","330","按要求补齐数组","patching-array",4011399863],"4014976365":["按照题意模拟 + O(1) 额外空间（Python/Java/C++/Go）","an-zhao-ti-yi-mo-ni-o1-e-wai-kong-jian-b-5oqd","2022-01-22T16:13:24.261381+00:00","2147","分隔长廊的方案数","number-of-ways-to-divide-a-long-corridor",4014976365],"4020009242":["带你发明树状数组！附数学证明（Python/Java/C++/Go/JS/Rust）","dai-ni-fa-ming-shu-zhuang-shu-zu-fu-shu-lyfll","2023-11-13T00:14:39.086691+00:00","307","区域和检索 - 数组可修改","range-sum-query-mutable",4020009242],"4022402413":["常用编程技巧（Python/Java/C++/Go）","python-yi-xing-by-endlesscheng-xnvy","2022-09-25T04:18:44.138770+00:00","2418","按身高排序","sort-the-people",4022402413],"4024970253":["一次遍历 + 常数空间","go-mo-ni-bian-li-lian-biao-bian-li-lin-j-rx9s","2021-10-31T05:33:33.303236+00:00","2058","找出临界点之间的最小和最大距离","find-the-minimum-and-maximum-number-of-nodes-between-critical-points",4024970253],"4027356240":["计数（木桶原理）","tan-xin-by-endlesscheng-99t7","2022-05-29T06:16:32.905274+00:00","2287","重排字符形成目标字符串","rearrange-characters-to-make-target-string",4027356240],"4034022024":["排序+分组循环（Python/Java/C++/Go）","pai-xu-fen-zu-xun-huan-pythonjavacgo-by-pbfey","2023-11-26T10:06:01.562313+00:00","2948","交换得到字典序最小的数组","make-lexicographically-smallest-array-by-swapping-elements",4034022024],"4043172905":["【视频】本题最简单写法！（Python/Java/C++/Go/JS/Rust）","shi-pin-fen-lei-tao-lun-luan-ru-ma-yi-ge-dmyx","2023-04-15T08:12:07.089086+00:00","LCR 194","二叉树的最近公共祖先","er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof",4043172905],"4043601244":["合并区间+方案数（Python/Java/C++/Go）","tiao-yue-you-xi-bian-xing-by-endlesschen-hatn","2023-03-04T16:14:14.533140+00:00","2580","统计将重叠区间合并成组的方案数","count-ways-to-group-overlapping-ranges",4043601244],"4050014828":["0-1 BFS（Python/Java/C++/Go）","0-1-bfs-by-endlesscheng-4pjt","2022-05-29T06:08:08.582927+00:00","2290","到达角落需要移除障碍物的最小数目","minimum-obstacle-removal-to-reach-corner",4050014828],"4058134239":["两种做法：正序（利用特殊条件） or 逆序（更加通用）","naojin-by-endlesscheng-aq0n","2022-06-05T04:20:14.186066+00:00","2295","替换数组中的元素","replace-elements-in-an-array",4058134239],"40615146":["Go 库函数二分","go-ku-han-shu-er-fen-by-endlesscheng-dl6a","2021-12-08T03:06:10.981543+00:00","1095","山脉数组中查找目标值","find-in-mountain-array",40615146],"4062228386":["O(n) 一次遍历","on-yi-ci-bian-li-by-endlesscheng-rdpp","2023-07-23T01:00:58.134588+00:00","2784","检查数组是否是好的","check-if-array-is-good",4062228386],"4062961912":["两种写法：离线询问 + 并查集 / 最小堆（Python/Java/C++/Go）","by-endlesscheng-qeei","2022-12-11T04:07:23.571796+00:00","2503","矩阵查询可获得的最大分数","maximum-number-of-points-from-grid-queries",4062961912],"4063277289":["0ms 最强剪枝","0ms-zui-qiang-jian-zhi-by-endlesscheng-1beq","2022-04-24T01:37:17.117401+00:00","LCP 58","积木拼接","De4qBB",4063277289],"4064007490":["滑动窗口，简洁写法（Python/Java/C++/Go）","shuang-zhi-zhen-hua-chuang-pythonjavacgo-nurf","2023-06-11T01:58:38.437978+00:00","2730","找到最长的半重复子字符串","find-the-longest-semi-repetitive-substring",4064007490],"4065089853":["Go 模拟（避免运算中出现浮点数）","go-mo-ni-by-endlesscheng-ohnv","2022-06-12T04:39:06.701509+00:00","2303","计算应缴税款总额","calculate-amount-paid-in-taxes",4065089853],"4066429992":["O(n^2) 记忆化搜索到递推","on2-ji-yi-hua-sou-suo-dao-di-tui-by-endl-99lb","2023-07-09T01:07:17.031842+00:00","2767","将字符串分割为最少的美丽子字符串","partition-string-into-minimum-beautiful-substrings",4066429992],"4067072856":["排序 + 二分（Python/Java/C++/Go/JS/Rust）","by-endlesscheng-1kbp","2022-06-11T23:00:31.246427+00:00","2300","咒语和药水的成功对数","successful-pairs-of-spells-and-potions",4067072856],"4067624536":["回溯不会写？套路在此！精确计算搜索树的节点个数！（Python/Java/C++/Go）","hui-su-bu-hui-xie-tao-lu-zai-ci-jing-que-6hrh","2023-01-28T10:30:00.305183+00:00","46","全排列","permutations",4067624536],"4071175900":["二分","er-fen-by-endlesscheng-83jy","2021-05-09T04:09:14.409077+00:00","1855","下标对中的最大距离","maximum-distance-between-a-pair-of-values",4071175900],"4082307471":["二分查找总是写不对？一个视频讲透！（Python/Java/C++/Go/JS）","er-fen-cha-zhao-zong-shi-xie-bu-dui-yi-g-nq23","2022-12-17T00:26:06.258717+00:00","35","搜索插入位置","search-insert-position",4082307471],"4083216410":["两种方法：O(1) 公式 / 记忆化搜索（Python/Java/C++/Go）","liang-chong-fang-fa-o1-gong-shi-ji-yi-hu-7fdi","2023-06-25T01:00:28.839524+00:00","2745","构造最长的新字符串","construct-the-longest-new-string",4083216410],"4088708677":["哈希表 + 建树 + 找根","jian-tu-dfs-by-endlesscheng-vl17","2022-03-06T04:09:04.278714+00:00","2196","根据描述创建二叉树","create-binary-tree-from-descriptions",4088708677],"4089321877":["逆向思维（Python/Java/C++/Go）","by-endlesscheng-sm8h","2022-04-03T04:07:45.622277+00:00","2227","加密解密字符串","encrypt-and-decrypt-strings",4089321877],"4092227797":["DFS + 哈希表","by-endlesscheng-fg6o","2022-08-07T04:07:17.768249+00:00","2368","受限条件下可到达节点的数目","reachable-nodes-with-restrictions",4092227797],"4095621901":["乘法原理：分别计算小时和分钟（Python/Java/C++/Go）","cheng-fa-yuan-li-fen-bie-ji-suan-xiao-sh-66d9","2022-10-15T23:33:54.896615+00:00","2437","有效时间的数目","number-of-valid-clock-times",4095621901],"4101129191":["按题意模拟","an-ti-yi-mo-ni-by-endlesscheng-ldwj","2023-03-19T04:09:00.279674+00:00","2596","检查骑士巡视方案","check-knight-tour-configuration",4101129191],"4108118731":["前后缀分解","qian-hou-zhui-fen-jie-by-endlesscheng-a47e","2022-04-30T16:43:01.937794+00:00","2256","最小平均差","minimum-average-difference",4108118731],"4113058721":["阅读理解（Python/Java/C++/Go）","mo-ni-by-endlesscheng-ka78","2022-10-09T04:27:31.385834+00:00","2432","处理用时最长的那个任务的员工","the-employee-that-worked-on-the-longest-task",4113058721],"4116532905":["两遍 DFS（Python/Java/C++/Go）","liang-bian-dfspythonjavacgo-by-endlessch-vvs4","2022-10-30T04:07:28.997922+00:00","2458","移除子树后的二叉树高度","height-of-binary-tree-after-subtree-removal-queries",4116532905],"4125612782":["分组循环","fen-zu-xun-huan-by-endlesscheng-f2i1","2021-05-23T04:29:07.835791+00:00","1869","哪种连续子字符串更长","longer-contiguous-segments-of-ones-than-zeros",4125612782],"4125791633":["简单 DFS（Python/Java/C++/Go/JS）","jian-dan-dfspythonjavacgojs-by-endlessch-ytdk","2024-02-19T00:56:20.972017+00:00","590","N 叉树的后序遍历","n-ary-tree-postorder-traversal",4125791633],"4130335825":["教你一步步思考动态规划！一个视频讲透！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-aj9f","2023-03-09T05:24:01.046248+00:00","LCR 102","目标和","YaVDxD",4130335825],"4130986647":["教你一次性把代码写对！O(n) 分组循环（Python/Java/C++/Go/JS/Rust）","jiao-ni-yi-ci-xing-ba-dai-ma-xie-dui-on-r57bz","2024-01-23T00:09:03.088763+00:00","2765","最长交替子数组","longest-alternating-subarray",4130986647],"4133950075":["Go 一行","go-yi-xing-by-endlesscheng-bzua","2021-10-19T01:17:43.603520+00:00","476","数字的补数","number-complement",4133950075],"4134643071":["【视频】教你一步步思考动态规划！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-uo5q","2023-02-25T11:48:31.589163+00:00","72","编辑距离","edit-distance",4134643071],"4136320759":["没想明白？一个动画秒懂！（Python/Java/C++/Go）","mei-xiang-ming-bai-yi-ge-dong-hua-miao-d-oich","2022-11-30T00:02:55.484502+00:00","895","最大频率栈","maximum-frequency-stack",4136320759],"4137220667":["O(1) 容斥原理（Python/Java/C++/Go）","o1-rong-chi-yuan-li-pythonjavacgo-by-end-smj5","2023-11-12T01:10:43.426261+00:00","2928","给小朋友们分糖果 I","distribute-candies-among-children-i",4137220667],"4154206580":["O(N) 后缀数组 / 后缀自动机","on-hou-zhui-shu-zu-by-endlesscheng-jo3p","2021-07-09T02:38:59.168906+00:00","1698","字符串的不同子字符串个数","number-of-distinct-substrings-in-a-string",4154206580],"4155641815":["三种贪心策略取最小值","san-chong-tan-xin-ce-lue-qu-zui-xiao-zhi-fhnn","2021-11-28T04:06:48.990564+00:00","2091","从数组中移除最大值和最小值","removing-minimum-and-maximum-from-array",4155641815],"4156461194":["Go 库函数模拟","go-ku-han-shu-mo-ni-by-endlesscheng-yryg","2022-01-08T16:15:49.888082+00:00","2129","将标题首字母大写","capitalize-the-title",4156461194],"4159210402":["分组循环","fen-zu-xun-huan-by-endlesscheng-ykhm","2021-12-19T04:07:24.748927+00:00","2110","股票平滑下跌阶段的数目","number-of-smooth-descent-periods-of-a-stock",4159210402],"4162714270":["两种做法：暴力枚举 / 利用 GCD 的性质","by-endlesscheng-1f1r","2022-10-23T08:28:36.260188+00:00","2447","最大公因数等于 K 的子数组数目","number-of-subarrays-with-gcd-equal-to-k",4162714270],"4169935304":["分类讨论+简洁写法（Python/Java/C++/Go）","fen-lei-tao-lun-jian-ji-xie-fa-pythonjav-aoa8","2024-01-07T04:38:28.564676+00:00","3001","捕获黑皇后需要的最少移动次数","minimum-moves-to-capture-the-queen",4169935304],"4175159080":["分类讨论+二分答案","fen-lei-tao-lun-er-fen-da-an-by-endlessc-nl81","2021-10-16T16:13:28.226630+00:00","2040","两个有序数组的第 K 小乘积","kth-smallest-product-of-two-sorted-arrays",4175159080],"4175827470":["本题最优解！线性时间+常数空间（Python/Java/C++/Go/JS）","ben-ti-zui-you-jie-xian-xing-shi-jian-ch-ddw3","2023-07-24T00:16:36.894654+00:00","771","宝石与石头","jewels-and-stones",4175827470],"4176664483":["简洁写法","jian-ji-xie-fa-by-endlesscheng-suo2","2023-10-12T10:53:13.272103+00:00","1430","判断给定的序列是否是二叉树从根到叶的路径","check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree",4176664483],"4183600583":["回溯不会写？套路在此！精确计算搜索树的节点个数！（Python/Java/C++/Go）","hui-su-bu-hui-xie-tao-lu-zai-ci-jing-que-f0sr","2023-02-01T11:52:47.364648+00:00","LCR 083","全排列","VvJkup",4183600583],"419099305":["两种做法：排序 + 贪心模拟 / 脑筋急转弯","pai-xu-tan-xin-mo-ni-by-endlesscheng-zq8m","2022-07-31T04:06:30.673444+00:00","2358","分组的最大数量","maximum-number-of-groups-entering-a-competition",419099305],"419265170":["回溯不会写？套路在此！（Python/Java/C++/Go）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-feme","2023-01-20T09:18:30.543807+00:00","216","组合总和 III","combination-sum-iii",419265170],"4193309664":["子序列自动机","zi-xu-lie-zi-dong-ji-by-endlesscheng-guks","2021-12-06T05:09:39.573741+00:00","727","最小窗口子序列","minimum-window-subsequence",4193309664],"4193739814":["记忆化搜索-\u003e递推-\u003e常数优化（Python/Java/C++/Go）","ji-yi-hua-sou-suo-di-tui-chang-shu-you-h-czvx","2023-04-21T14:12:42.550692+00:00","1027","最长等差数列","longest-arithmetic-subsequence",4193739814],"4197747162":["数位 DP 通用模板，附题单（Python/Java/C++/Go）","shu-wei-dp-mo-ban-by-endlesscheng-xtgx","2022-08-14T04:21:05.737032+00:00","2376","统计特殊整数","count-special-integers",4197747162],"419814877":["排序+去重+二分","on-zuo-fa-by-endlesscheng-l7yi","2021-09-18T16:10:24.968833+00:00","2009","使数组连续的最少操作数","minimum-number-of-operations-to-make-array-continuous",419814877],"4199077770":["告别特判！简洁写法！（Python/Java/C++/Go）","gao-bie-te-pan-jian-ji-xie-fa-pythonjava-ameq","2023-02-23T02:19:53.736817+00:00","LCR 090","打家劫舍 II","PzWKhm",4199077770],"421470137":["【图解】一张图秒懂 LRU！（Python/Java/C++/Go/JS/Rust）","tu-jie-yi-zhang-tu-miao-dong-lrupythonja-gk15","2023-12-12T14:15:04.576519+00:00","面试题 16.25","LRU 缓存","lru-cache-lcci",421470137],"4224854568":["两种方法：暴力枚举 / 记忆化搜索","by-endlesscheng-koht","2022-12-11T04:14:37.856098+00:00","2501","数组中最长的方波","longest-square-streak-in-an-array",4224854568],"4225343365":["动态规划 + 二分查找优化（Python/Java/C++/Go）","dong-tai-gui-hua-er-fen-cha-zhao-you-hua-zkcg","2022-10-21T23:37:25.367420+00:00","1235","规划兼职工作","maximum-profit-in-job-scheduling",4225343365],"4225876243":["简洁写法（Python/Java/C++/Go/JS/Rust）","jian-ji-xie-fa-pythonjavacgojsrust-by-en-i1rn","2024-01-06T00:13:00.417184+00:00","2807","在链表中插入最大公约数","insert-greatest-common-divisors-in-linked-list",4225876243],"4226664142":["如何想出状态定义和状态转移方程？一个视频学会！（Python/Java/C++/Go）","ru-he-xiang-chu-zhuang-tai-ding-yi-he-zh-8zrv","2023-02-11T05:05:09.097499+00:00","LCR 089","打家劫舍","Gu0c2T",4226664142],"4231944752":["区间 DP 的套路（Python/Java/C++/Go）","qu-jian-dp-de-tao-lu-pythonjavacgo-by-en-nynz","2024-02-18T01:15:13.051043+00:00","3040","相同分数的最大操作数目 II","maximum-number-of-operations-with-the-same-score-ii",4231944752],"4234423090":["哈希表做法：枚举前缀+后缀","ha-xi-biao-zuo-fa-by-endlesscheng-y2ci","2021-10-02T16:08:59.765885+00:00","2023","连接后等于目标字符串的字符串对","number-of-pairs-of-strings-with-concatenation-equal-to-target",4234423090],"4238290979":["Go 一行","yi-xing-by-endlesscheng-bnpb","2021-07-11T04:07:29.213639+00:00","1929","数组串联","concatenation-of-array",4238290979],"4239392469":["【视频】彻底掌握直径 DP！从二叉树到一般树！（Python/Java/C++/Go）","shi-pin-che-di-zhang-wo-zhi-jing-dpcong-524j4","2023-04-14T12:42:40.840405+00:00","687","最长同值路径","longest-univalue-path",4239392469],"4244339093":["分类讨论（Python/Java/C++/Go）","fen-lei-tao-lun-by-endlesscheng-jxg0","2023-12-31T04:39:53.764206+00:00","2983","回文串重新排列查询","palindrome-rearrangement-queries",4244339093],"4245137983":["爬楼梯换皮（Python/Java/C++/Go/JS）","by-endlesscheng-4j22","2022-11-13T00:44:42.696160+00:00","2466","统计构造好字符串的方案数","count-ways-to-build-good-strings",4245137983],"4247310156":["详细分析两次 Dijkstra（稠密图下是线性做法）","xiang-xi-fen-xi-liang-ci-dijkstrachou-mi-gv1m","2023-05-21T10:01:37.581786+00:00","2699","修改图中的边权","modify-graph-edge-weights",4247310156],"4252078571":["分类讨论+枚举","fen-lei-tao-lun-mei-ju-by-endlesscheng-89hq","2021-09-25T10:56:25.660028+00:00","LCP 48","无限棋局","fsa7oZ",4252078571],"4252220750":["贪心及其数学证明","tan-xin-ji-qi-shu-xue-zheng-ming-by-endl-uumv","2021-08-15T04:05:55.752939+00:00","1969","数组元素的最小非零乘积","minimum-non-zero-product-of-the-array-elements",4252220750],"4257560677":["枚举+视频讲解（Python/Java/C++/Go）","mei-ju-by-endlesscheng-gt7c","2022-11-13T01:10:00.085973+00:00","2468","根据限制分割消息","split-message-based-on-limit",4257560677],"4261327361":["O(1) 数学公式（Python/Java/C++/Go/JS）","o1-shu-xue-gong-shi-pythonjavacgo-by-end-xsxg","2023-08-27T04:12:03.270998+00:00","2834","找出美丽数组的最小和","find-the-minimum-possible-sum-of-a-beautiful-array",4261327361],"4272085250":["【图解】一张图秒懂！多种写法！（Python/Java/C++/Go/JS/Rust）","tu-jie-yi-zhang-tu-miao-dong-duo-chong-x-q095","2023-10-30T23:51:08.301821+00:00","2003","每棵子树内缺失的最小基因值","smallest-missing-genetic-value-in-each-subtree",4272085250],"4275078512":["【视频】如何灵活运用递归？让你对递归的理解更上一层楼！（Python/Java/C++/Go）","shi-pin-ru-he-ling-huo-yun-yong-di-gui-r-xjm2","2023-04-15T06:38:00.587799+00:00","LCR 145","判断对称二叉树","dui-cheng-de-er-cha-shu-lcof",4275078512],"4281929868":["横切和竖切是互相独立的（Python/Java/C++/Go/JS/Rust）","heng-qie-he-shu-qie-shi-hu-xiang-du-li-d-gywp","2023-10-27T00:11:59.984414+00:00","1465","切割后面积最大的蛋糕","maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts",4281929868],"4283669919":["模拟","mo-ni-by-endlesscheng-gxlp","2021-05-15T17:05:16.768364+00:00","1860","增长的内存泄露","incremental-memory-leak",4283669919],"4290150798":["【周赛常考】前后缀分解（Python/Java/C++/Go）","zhou-sai-chang-kao-qian-hou-zhui-fen-jie-21hr","2023-10-15T04:12:20.467280+00:00","2906","构造乘积矩阵","construct-product-matrix",4290150798],"4290496515":["状压 DP + 预处理合法状态及其合法转移","zhuang-ya-dp-yu-chu-li-he-fa-zhuang-tai-l927s","2021-07-11T04:09:58.690749+00:00","1931","用三种不同颜色为网格涂色","painting-a-grid-with-three-different-colors",4290496515],"4293743842":["一写就错？请看这！（Python/Java/C++/Go）","yi-xie-jiu-cuo-qing-kan-zhe-pythonjavacg-qtx2","2023-02-01T12:05:54.593230+00:00","LCR 009","乘积小于 K 的子数组","ZVAVXX",4293743842],"430788454":["只用到排序的做法","pai-xu-bian-li-by-endlesscheng-81er","2022-03-06T04:13:07.314794+00:00","2195","向数组中追加 K 个整数","append-k-integers-with-minimal-sum",430788454],"435938591":["栈模拟（Python/Java/C++/Go）","zhan-mo-ni-by-endlesscheng-fu26","2023-06-25T04:16:41.189757+00:00","2751","机器人碰撞","robot-collisions",435938591],"442815761":["O(n^2) 优雅枚举（Python/Java/C++/Go）","on2-you-ya-mei-ju-pythonjavacgo-by-endle-ii0q","2024-02-04T01:26:05.726020+00:00","3025","人员站位的方案数 I","find-the-number-of-ways-to-place-people-i",442815761],"443405892":["讲清楚为什么一开始要把 (i,0) 都入堆！附题单！","jiang-qing-chu-wei-shi-yao-yi-kai-shi-ya-i0dj","2023-05-27T15:17:31.006497+00:00","373","查找和最小的 K 对数字","find-k-pairs-with-smallest-sums",443405892],"446968474":["O(n) 单调队列，附题单！（Python/Java/C++/Go/JS）","on-dan-diao-dui-lie-fu-ti-dan-pythonjava-hhrr","2023-07-21T00:14:35.879259+00:00","1499","满足不等式的最大值","max-value-of-equation",446968474],"457953007":["差分写法","chai-fen-xie-fa-by-endlesscheng-kh8v","2021-06-12T16:15:02.361740+00:00","1893","检查是否区域内所有整数都被覆盖","check-if-all-the-integers-in-a-range-are-covered",457953007],"459732998":["有向图欧拉路径","you-xiang-tu-ou-la-lu-jing-by-endlessche-j2i3","2021-12-05T04:43:16.712372+00:00","2097","合法重新排列数对","valid-arrangement-of-pairs",459732998],"462875391":["反悔贪心（Python/Java/C++/Go）","fan-hui-tan-xin-pythonjavacgo-by-endless-v2w1","2023-08-06T04:10:28.315310+00:00","2813","子序列最大优雅度","maximum-elegance-of-a-k-length-subsequence",462875391],"463765609":["贪心：O(n) 一次遍历 + O(1) 额外空间","tan-xin-on-yi-ci-bian-li-o1-kong-jian-by-hshg","2021-11-27T16:07:16.163013+00:00","2086","从房屋收集雨水需要的最少水桶数","minimum-number-of-food-buckets-to-feed-the-hamsters",463765609],"468110":["排序+贪心","pai-xu-tan-xin-by-endlesscheng-vv35","2021-10-16T16:08:19.507105+00:00","2037","使每位学生都有座位的最少移动次数","minimum-number-of-moves-to-seat-everyone",468110],"469490796":["计算 010 和 101 的出现次数","mei-ju-by-endlesscheng-xp5r","2022-04-02T16:15:01.217086+00:00","2222","选择建筑的方案数","number-of-ways-to-select-buildings",469490796],"480223586":["前后缀分解 + O(1) 空间","qian-hou-zhui-fen-jie-o1-kong-jian-by-en-c2m5","2022-11-27T01:02:27.258982+00:00","2483","商店的最少代价","minimum-penalty-for-a-shop",480223586],"482822055":["Go 差分数组+排序+位运算压缩状态","go-chai-fen-shu-zu-pai-xu-wei-yun-suan-y-4ydd","2021-12-06T02:41:04.865173+00:00","2021","街上最亮的位置","brightest-position-on-street",482822055],"484484283":["一次遍历（Python/Java/C++/Go）","ha-xi-biao-tong-ji-by-endlesscheng-lfuh","2022-09-11T04:12:45.138585+00:00","2404","出现最频繁的偶数元素","most-frequent-even-element",484484283],"484559816":["简单 DFS（Python/Java/C++/Go/JS）","jian-dan-dfspythonjavacgojsrust-by-endle-0sf4","2024-02-17T23:49:37.038083+00:00","589","N 叉树的前序遍历","n-ary-tree-preorder-traversal",484559816],"485006616":["枚举+简洁写法+视频讲解（Python/Java/C++/Go）","mei-ju-jian-ji-xie-fa-by-endlesscheng-tjpp","2023-01-08T04:44:17.728655+00:00","2531","使字符串中不同字符的数目相等","make-number-of-distinct-characters-equal",485006616],"486718067":["两种方法：0-1 trie+滑窗 / 哈希表（Python/Java/C++/Go）","0-1-trie-hua-dong-chuang-kou-pythonjavac-gvv2","2023-11-12T04:08:00.880633+00:00","2935","找出强数对的最大异或值 II","maximum-strong-pair-xor-ii",486718067],"487663609":["带你发明 Floyd 算法：从记忆化搜索到递推（Python/Java/C++/Go/JS/Rust）","dai-ni-fa-ming-floyd-suan-fa-cong-ji-yi-m8s51","2023-11-14T00:39:06.261520+00:00","1334","阈值距离内邻居最少的城市","find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance",487663609],"487789523":["分类讨论+简洁写法（Python/Java/C++/Go/JS）","fen-lei-tao-lun-jian-ji-xie-fa-pythonjav-37oe","2023-07-22T00:03:18.452257+00:00","860","柠檬水找零","lemonade-change",487789523],"491083091":["【视频讲解】教你一步步思考动态规划！（Python/Java/C++/Go）","shi-pin-jiao-ni-yi-bu-bu-si-kao-dong-tai-aty6","2023-04-01T11:12:16.716052+00:00","1039","多边形三角剖分的最低得分","minimum-score-triangulation-of-polygon",491083091],"492673087":["枚举删除后以 00/25/50/75 结尾（Python/Java/C++/Go）","mei-ju-shan-chu-hou-yi-00255075-jie-wei-zhjlu","2023-09-03T04:14:02.426745+00:00","2844","生成特殊数字的最少操作","minimum-operations-to-make-a-special-number",492673087],"492772626":["状压 DP","zhuang-ya-dp-by-endlesscheng-4jkr","2023-06-18T04:07:20.776788+00:00","2741","特别的排列","special-permutations",492772626],"495901528":["正反两次遍历","zheng-fan-liang-ci-bian-li-by-endlessche-z8ac","2021-12-26T09:33:29.033397+00:00","2116","判断一个括号字符串是否有效","check-if-a-parentheses-string-can-be-valid",495901528],"497323702":["分解质因子+前缀和+哈希表（Python/Java/C++/Go）","fen-jie-zhi-yin-zi-qian-zhui-he-ha-xi-bi-ceil","2023-11-26T04:09:51.947396+00:00","2949","统计美丽子字符串 II","count-beautiful-substrings-ii",497323702],"509699848":["前后缀分解+最长递增子序列，附题单（Python/Java/C++/Go/JS/Rust）","qian-hou-zhui-fen-jie-zui-chang-di-zeng-9vowl","2023-12-22T00:26:32.018587+00:00","1671","得到山形数组的最少删除次数","minimum-number-of-removals-to-make-mountain-array",509699848],"5115105":["DP，枚举下一轮两名选手的位置","dpmei-ju-xia-yi-lun-liang-ming-xuan-shou-okfu","2021-06-13T04:06:14.271507+00:00","1900","最佳运动员的比拼回合","the-earliest-and-latest-rounds-where-players-compete",5115105],"518714509":["遍历+与相邻数字比大小（Python/Java/C++/Go）","bian-li-yu-xiang-lin-shu-zi-bi-da-xiao-p-e70u","2023-12-03T04:22:16.210951+00:00","2951","找出峰值","find-the-peaks",518714509],"519673615":["倒序双指针：为什么倒序就一定能避免覆盖？（Python/Java/C++/Go/JS）","dao-xu-shuang-zhi-zhen-wei-shi-yao-dao-x-xxkp","2023-08-13T00:00:02.324527+00:00","88","合并两个有序数组","merge-sorted-array",519673615],"521886798":["动态规划+优化（Python/Java/C++/Go）","dong-tai-gui-hua-you-hua-pythonjavacgo-b-axv0","2023-05-28T04:24:35.860358+00:00","2713","矩阵中严格递增的单元格数","maximum-strictly-increasing-cells-in-a-matrix",521886798],"522511593":["如何删除节点？六分钟搞定四道题目！（Python/Java/C++/Go）","ru-he-shan-chu-jie-dian-liu-fen-zhong-ga-xpfs","2022-12-03T08:43:43.791393+00:00","19","删除链表的倒数第 N 个结点","remove-nth-node-from-end-of-list",522511593],"523951328":["O(n) 一次遍历","go-mo-ni-by-endlesscheng-50fm","2022-03-20T00:06:07.918866+00:00","2206","将数组划分成相等数对","divide-array-into-equal-pairs",523951328],"530135030":["极致优化！基于三数之和的做法（Python/Java/C++/Go/JS）","ji-zhi-you-hua-ji-yu-san-shu-zhi-he-de-z-1f0b","2023-07-15T00:34:56.150113+00:00","18","四数之和","4sum",530135030],"530846359":["二分答案+前缀和+差分数组+贪心（Python/Java/C++/Go）","er-fen-da-an-qian-zhui-he-chai-fen-shu-z-jnyv","2023-01-07T16:28:56.729184+00:00","2528","最大化城市的最小电量","maximize-the-minimum-powered-city",530846359],"534082096":["枚举买了多少支钢笔（附 O(log) 类欧几里得算法）","mei-ju-mai-liao-duo-shao-zhi-gang-bi-by-r97vg","2022-04-16T16:11:52.487856+00:00","2240","买钢笔和铅笔的方案数","number-of-ways-to-buy-pens-and-pencils",534082096],"535469112":["字典树+DFS","zi-dian-shu-dfs-by-endlesscheng-fy5u","2021-05-15T09:41:20.851666+00:00","1858","包含所有前缀的最长单词","longest-word-with-all-prefixes",535469112],"535937366":["两种方法：迭代/递归（Python/Java/C++/Go/JS）","liang-chong-fang-fa-die-dai-di-gui-pytho-wf75","2023-08-05T00:07:01.864333+00:00","21","合并两个有序链表","merge-two-sorted-lists",535937366],"536229655":["三种做法：双向链表 / 对顶栈 / Splay（Python/Java/C++/Go）","lian-biao-mo-ni-pythonjavacgo-by-endless-egw4","2022-06-05T04:07:24.793905+00:00","2296","设计一个文本编辑器","design-a-text-editor",536229655],"537590451":["状压 0-1 背包，查表法 vs 刷表法（Python/Java/C++/Go）","zhuang-ya-0-1-bei-bao-cha-biao-fa-vs-shu-qode","2023-04-07T15:42:01.642357+00:00","1125","最小的必要团队","smallest-sufficient-team",537590451],"537971944":["模拟","mo-ni-by-endlesscheng-1fxk","2022-02-27T04:16:25.931709+00:00","2185","统计包含给定前缀的字符串","counting-words-with-a-given-prefix",537971944],"540821611":["【图解】回溯/二进制枚举/O(n^3)枚举直径端点（Python/Java/C++/Go）","tu-jie-on3-mei-ju-zhi-jing-duan-dian-che-am2n","2023-03-11T15:57:14.772740+00:00","1617","统计子树中城市之间最大距离","count-subtrees-with-max-distance-between-cities",540821611],"545408597":["简洁写法（Python/Java/C++/Go）","jian-ji-xie-fa-pythonjavacgo-by-endlessc-7ak3","2024-02-11T04:40:54.554797+00:00","3033","修改矩阵","modify-the-matrix",545408597],"547605841":["简洁写法，调用自身！（Python/Java/C++/Go）","jian-ji-xie-fa-diao-yong-zi-shen-pythonj-64lf","2023-05-22T01:10:41.162249+00:00","1080","根到叶路径上的不足节点","insufficient-nodes-in-root-to-leaf-paths",547605841],"550448877":["前序中序后序，三种方法，一个视频讲透！（Python/Java/C++/Go/JS）","qian-xu-zhong-xu-hou-xu-san-chong-fang-f-yxvh","2022-12-14T10:56:14.600576+00:00","98","验证二叉搜索树","validate-binary-search-tree",550448877],"550627195":["折半枚举+排序+二分","zhe-ban-mei-ju-pai-xu-er-fen-by-endlessc-04fn","2021-10-10T04:08:48.863506+00:00","2035","将数组分成两个数组并最小化数组和的差","partition-array-into-two-arrays-to-minimize-sum-difference",550627195],"556438904":["讲清楚为什么一开始要把 (i,0) 都入堆！附题单！","jiang-qing-chu-wei-shi-yao-yi-kai-shi-ya-d3na","2023-12-12T14:31:24.397405+00:00","LCR 061","查找和最小的 K 对数字","qn8gGX",556438904],"556825118":["语法题（Python/Java/C++/Go）","mo-ni-by-endlesscheng-tz4z","2022-08-06T23:47:24.619277+00:00","2363","合并相似的物品","merge-similar-items",556825118],"557097878":["动态规划 + 避免浮点运算的写法","jiang-dp-mu-biao-gai-wei-zui-xiao-hua-fe-kg1k","2021-05-30T04:08:08.947908+00:00","1883","准时抵达会议现场的最小跳过休息次数","minimum-skips-to-arrive-at-meeting-on-time",557097878],"569962978":["贪心 + 位运算 O(1) 空间","wei-yun-suan-o1-kong-jian-by-endlesschen-m0q5","2022-09-11T04:12:18.021778+00:00","2405","子字符串的最优划分","optimal-partition-of-string",569962978],"570608577":["简洁写法（Python/Java/C++/Go）","jian-ji-xie-fa-pythonjavacgo-by-endlessc-8k36","2024-02-25T11:22:48.933995+00:00","100224","分割数组","split-the-array",570608577],"572276699":["脑筋急转弯（Python/Java/C++/Go）","pai-xu-by-endlesscheng-h9w9","2022-07-09T23:14:36.027741+00:00","2332","坐上公交的最晚时间","the-latest-time-to-catch-a-bus",572276699],"57307685":["一个动画秒懂本题+简洁写法（Python/Java/C++/Go）","by-endlesscheng-z8o1","2022-10-30T23:28:12.998505+00:00","481","神奇字符串","magical-string",57307685],"586474794":["简洁写法，自身递归","by-endlesscheng-391l","2022-07-09T22:26:36.793676+00:00","2331","计算布尔二叉树的值","evaluate-boolean-binary-tree",586474794],"590592305":["分组 + 线性 DP + 乘法原理（Python/Go/C++/Java）","by-endlesscheng-gj8f","2022-05-08T04:06:44.661214+00:00","2266","统计打字方案数","count-number-of-texts",590592305],"592826714":["阅读理解","yue-du-li-jie-by-endlesscheng-xz4d","2021-11-27T16:10:31.426270+00:00","2087","网格图中机器人回家的最小代价","minimum-cost-homecoming-of-a-robot-in-a-grid",592826714],"601450429":["【图解】O(1) 做法（Python/Java/C++/Go/JS/Rust）","tu-jie-o1-zuo-fa-pythonjavacgojsrust-by-oms4k","2023-12-24T00:10:31.998202+00:00","1954","收集足够苹果的最小花园周长","minimum-garden-perimeter-to-collect-enough-apples",601450429],"608419542":["找不到规律？请看图！（Python/Java/C++/Go）","by-endlesscheng-umpp","2022-11-11T23:30:41.036180+00:00","790","多米诺和托米诺平铺","domino-and-tromino-tiling",608419542],"61296851":["模拟 + 两个优化","mo-ni-liang-ge-you-hua-by-endlesscheng-jldf","2022-11-27T00:37:13.282691+00:00","2482","行和列中一和零的差值","difference-between-ones-and-zeros-in-row-and-column",61296851],"613691832":["【视频】一个视频讲透单调栈！附题单（Python/Java/C++/Go/JS/Rust）","shi-pin-yi-ge-shi-pin-jiang-tou-dan-diao-cuk7","2023-10-07T00:23:22.421007+00:00","901","股票价格跨度","online-stock-span",613691832],"614687136":["滑动窗口（附题单！）Python/Java/C++/Go","hua-dong-chuang-kou-fu-ti-dan-pythonjava-6fxo","2023-12-09T23:49:22.222084+00:00","2958","最多 K 个重复元素的最长子数组","length-of-longest-subarray-with-at-most-k-frequency",614687136],"615729621":["位运算 O(1) 空间做法（Python/Java/C++/Go）","wei-yun-suan-o1-kong-jian-zuo-fa-pythonj-wk2p","2023-10-01T01:32:20.930881+00:00","2869","收集元素的最少操作次数","minimum-operations-to-collect-elements",615729621],"618419204":["模拟","pai-xu-zheng-shu-cong-xiao-dao-da-fu-shu-5iiz","2022-02-06T04:09:00.442655+00:00","2164","对奇偶下标分别排序","sort-even-and-odd-indices-independently",618419204],"625310591":["O(N) 后缀数组做法","on-hou-zhui-shu-zu-zuo-fa-by-endlesschen-rqkp","2021-07-07T02:46:47.730729+00:00","1044","最长重复子串","longest-duplicate-substring",625310591],"628719688":["脑筋急转弯（Python/Java/C++/Go）","by-endlesscheng-fcgc","2022-07-10T09:15:19.204387+00:00","777","在LR字符串中交换相邻字符","swap-adjacent-in-lr-string",628719688],"629883391":["BFS + 置换环 + 离散化","by-endlesscheng-97i9","2022-11-13T04:07:15.929516+00:00","2471","逐层排序二叉树所需的最少操作数目","minimum-number-of-operations-to-sort-a-binary-tree-by-level",629883391],"636790914":["逆向思维 + 01 背包方案数（Python/Java/C++/Go）","ni-xiang-si-wei-01-bei-bao-fang-an-shu-p-v47x","2022-12-25T04:12:02.938271+00:00","2518","好分区的数目","number-of-great-partitions",636790914],"638264577":["注意 z 的位置（Python/Java/C++/Go）","zhu-yi-z-de-wei-zhi-pythonjavacgo-by-end-1ha7","2023-02-11T15:08:19.215625+00:00","1138","字母板上的路径","alphabet-board-path",638264577],"639622603":["贪心，取最大两个与最小两个相减","tan-xin-qu-zui-da-liang-ge-he-zui-xiao-l-mvja","2021-06-27T04:08:12.535208+00:00","1913","两个数对之间的最大乘积差","maximum-product-difference-between-two-pairs",639622603],"648001314":["BFS 为什么要用队列？一个视频讲透！（Python/Java/C++/Go/JS/Rust）","bfs-wei-shi-yao-yao-yong-dui-lie-yi-ge-s-xlpz","2023-01-07T12:21:00.288356+00:00","102","二叉树的层序遍历","binary-tree-level-order-traversal",648001314],"653475446":["【视频】巧妙转换！516 变形题！（Python/Java/C++/Go）","shi-pin-qiao-miao-zhuan-huan-516-bian-xi-jhrt","2023-05-26T14:17:11.627201+00:00","1771","由子序列构造的最长回文串的长度","maximize-palindrome-length-from-subsequences",653475446],"655929637":["动态规划","dong-tai-gui-hua-by-endlesscheng-4onu","2021-08-01T04:21:01.162244+00:00","1955","统计特殊子序列的数目","count-number-of-special-subsequences",655929637],"658738156":["模拟（Python/Java/C++/Go）","mo-ni-pythonjavacgo-by-endlesscheng-1dia","2023-08-20T04:14:47.624091+00:00","2828","判别首字母缩略词","check-if-a-string-is-an-acronym-of-words",658738156],"660980450":["教你一步步思考动态规划！从递归到递推到 O(1) 额外空间！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dpcong-hui-su-da-epvl","2023-03-07T12:46:45.868584+00:00","LCR 166","珠宝的最高价值","li-wu-de-zui-da-jie-zhi-lcof",660980450],"665333196":["统计能被国王「看到」的皇后（Python/Java/C++/Go/JS）","tong-ji-neng-bei-guo-wang-kan-dao-de-hua-08s6","2023-09-14T00:34:46.489075+00:00","1222","可以攻击国王的皇后","queens-that-can-attack-the-king",665333196],"670519393":["线性 DP（Python/Java/C++/Go）","xian-xing-dppythonjavacgo-by-endlesschen-gpx9","2022-10-02T04:06:57.329379+00:00","2430","对字母串可执行的最大删除数","maximum-deletions-on-a-string",670519393],"670957801":["暴力（附 Python 一行）","bao-li-by-endlesscheng-g5qz","2022-05-01T04:07:51.915875+00:00","2259","移除指定数字得到的最大结果","remove-digit-from-number-to-maximize-result",670957801],"672964653":["分类讨论乱如麻？一个视频讲透！（Python/Java/C++/Go）","fen-lei-tao-lun-luan-ru-ma-yi-ge-shi-pin-rair","2023-01-16T07:56:33.706370+00:00","面试题 04.08","首个共同祖先","first-common-ancestor-lcci",672964653],"676558931":["【套路】前缀和+哈希表，消除分支的技巧（Python/Java/C++/Go）","tao-lu-qian-zhui-he-ha-xi-biao-xiao-chu-3mb11","2023-03-10T14:03:14.621722+00:00","面试题 17.05"," 字母与数字","find-longest-subarray-lcci",676558931],"676949389":["位运算一行搞定！附记忆化搜索做法（Python/Java/C++/Go）","ji-yi-hua-sou-suo-by-endlesscheng-cm6l","2023-02-19T04:13:43.977199+00:00","2571","将整数减少到零需要的最少操作数","minimum-operations-to-reduce-an-integer-to-0",676949389],"677909483":["数位 DP 上下界模板（附题单）Python/Java/C++/Go","shu-wei-dp-shang-xia-jie-mo-ban-fu-ti-da-h6ci","2024-01-07T13:02:39.748136+00:00","2999","统计强大整数的数目","count-the-number-of-powerful-integers",677909483],"67823656":["简洁写法，附相似题目（Python/Java/C++/Go/JS/Rust）","jian-ji-xie-fa-fu-xiang-si-ti-mu-pythonj-39p8","2024-01-08T00:34:45.503268+00:00","447","回旋镖的数量","number-of-boomerangs",67823656],"684110909":["贪心取中位数的理由","zhong-wei-shu-by-endlesscheng-p0vj","2021-10-10T04:13:30.802381+00:00","2033","获取单值网格的最小操作数","minimum-operations-to-make-a-uni-value-grid",684110909],"690173651":["两种方法：考虑相邻字母/abc个数（Python/Java/C++/Go/JS/Rust）","kao-lu-xiang-lin-zi-mu-pythonjavacgo-by-m9yrc","2023-04-16T04:10:46.923433+00:00","2645","构造有效字符串的最少插入数","minimum-additions-to-make-valid-string",690173651],"693474678":["Go 模拟","go-mo-ni-by-endlesscheng-46hj","2021-10-17T04:07:13.969165+00:00","2043","简易银行系统","simple-bank-system",693474678],"694594451":["各种语言的库函数写法（Python/Java/C++/Go/JS）","ge-chong-yu-yan-de-ku-han-shu-xie-fa-pyt-6gdt","2023-12-31T00:14:03.172790+00:00","1154","一年中的第几天","day-of-the-year",694594451],"700466705":["拓扑排序 + 构造（Python/Java/C++/Go）","by-endlesscheng-gpev","2022-08-28T04:07:40.088215+00:00","2392","给定条件下构造矩阵","build-a-matrix-with-conditions",700466705],"70049056":["统计 + 贪心","tan-xin-by-endlesscheng-epjv","2022-08-21T04:28:29.354797+00:00","2384","最大回文数字","largest-palindromic-number",70049056],"701261553":["一张图秒懂！（Python/Java/C++/Go）","yi-zhang-tu-miao-dong-pythonjavacgo-by-e-wqry","2023-02-20T15:53:03.662407+00:00","1326","灌溉花园的最少水龙头数目","minimum-number-of-taps-to-open-to-water-a-garden",701261553],"705189000":["栈思想模拟 + O(1) 额外空间","zhan-si-xiang-mo-ni-o1-e-wai-kong-jian-b-mlx0","2022-03-27T04:08:31.814673+00:00","2216","美化数组的最少删除数","minimum-deletions-to-make-array-beautiful",705189000],"713625410":["哈希并查集 + 位运算（Python/Java/C++/Go）","bing-cha-ji-wei-yun-suan-by-endlesscheng-uejd","2022-01-30T04:07:48.965068+00:00","2157","字符串分组","groups-of-strings",713625410],"718375766":["一步步提示如何思考此题（Python/Java/C++/Go）","yi-bu-bu-ti-shi-ru-he-si-kao-ci-ti-by-en-1p00","2022-09-10T23:50:49.590652+00:00","857","雇佣 K 名工人的最低成本","minimum-cost-to-hire-k-workers",718375766],"718987035":["利用最长上传前缀不会减小的性质","by-endlesscheng-n3ta","2022-10-01T23:54:41.478809+00:00","2424","最长上传前缀","longest-uploaded-prefix",718987035],"725104396":["【动画】简洁写法！从递归到迭代！（Python/Java/C++/Go/JS/Rust）","dong-hua-jian-ji-xie-fa-cong-di-gui-dao-oe0di","2023-07-01T23:38:22.642308+00:00","2","两数相加","add-two-numbers",725104396],"730656427":["【图解】区间 DP：状态设计与优化（Python/Java/C++/Go）","tu-jie-qu-jian-dpzhuang-tai-she-ji-yu-yo-ppv0","2023-04-03T15:53:21.484897+00:00","1000","合并石头的最低成本","minimum-cost-to-merge-stones",730656427],"730943544":["教你一步步思考动态规划：从记忆化搜索到递推，再到 O(1) 空间！（Python/Java/C++/Go/JS/Rust）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-bd25","2023-11-22T01:56:54.166781+00:00","2304","网格中的最小路径代价","minimum-path-cost-in-a-grid",730943544],"731038573":["一步步提示你思考本题！（Python/Java/C++/Go）","yi-bu-bu-ti-shi-ni-si-kao-ben-ti-pythonj-zhhs","2023-10-29T01:24:11.317713+00:00","2916","子数组不同元素数目的平方和 II","subarrays-distinct-element-sum-of-squares-ii",731038573],"735587531":["一行代码：比较两对字符串（Python/Java/C++/Go）","yi-xing-dai-ma-bi-jiao-liang-dui-zi-fu-c-34ae","2022-10-23T08:29:57.694670+00:00","2446","判断两个事件是否存在冲突","determine-if-two-events-have-conflict",735587531],"737896329":["【理论讲解】Dijkstra 和 Floyd 算法模板（Python/Java/C++/Go）","dijkstra-suan-fa-mo-ban-pythonjavacgo-by-unmv","2023-04-15T16:12:06.133238+00:00","2642","设计可以求最短路径的图类","design-graph-with-shortest-path-calculator",737896329],"746573214":["倒序回答 + 并查集（Python/Java/C++/Go）","by-endlesscheng-p61j","2022-08-20T23:22:05.318437+00:00","2382","删除操作后的最大子段和","maximum-segment-sum-after-removals",746573214],"747763790":["一次遍历：用变化量来思考（Python/Java/C++/Go）","by-endlesscheng-ko4z","2022-09-01T10:06:06.603507+00:00","828","统计子串中的唯一字符","count-unique-characters-of-all-substrings-of-a-given-string",747763790],"750309798":["树形 DP：选或不选（Python/Java/C++/Go）","shu-xing-dpxuan-huo-bu-xuan-pythonjavacg-7aj6","2023-11-05T04:10:05.623770+00:00","2925","在树上执行操作以后得到的最大分数","maximum-score-after-applying-operations-on-a-tree",750309798],"752241853":["O(n) 前后缀分解（Python/Java/C++/Go）","on-qian-hou-zhui-fen-jie-pythonjavacgo-b-wssq","2023-05-07T06:01:47.190246+00:00","2670","找出不同元素数目差数组","find-the-distinct-difference-array",752241853],"757825181":["倒序回答 + 并查集（Python/Java/C++/Go）","dao-xu-hui-da-bing-cha-ji-by-endlesschen-sdki","2022-08-22T11:23:12.222309+00:00","meituan-002","小美的仓库整理","TJZLyC",757825181],"760662992":["排序后两两交换，简洁写法（Python/Java/C++/Go）","pai-xu-hou-liang-liang-jiao-huan-pythonj-udxc","2023-12-24T04:21:15.967285+00:00","2974","最小数字游戏","minimum-number-game",760662992],"761142635":["数位 DP 通用模板，附题单（Python/Java/C++/Go）","by-endlesscheng-h9ua","2021-08-10T04:36:09.962323+00:00","233","数字 1 的个数","number-of-digit-one",761142635],"761999420":["【一图秒懂】排序+前缀和+二分查找（Python/Java/C++/Go）","yi-tu-miao-dong-pai-xu-qian-zhui-he-er-f-nf55","2023-03-26T04:26:11.075544+00:00","2602","使数组元素全部相等的最少操作次数","minimum-operations-to-make-all-array-elements-equal",761999420],"770030188":["子序列 DP 的思考套路（Python/Java/C++/Go）","zi-xu-lie-dp-de-si-kao-tao-lu-pythonjava-kmaf","2023-10-15T00:45:10.684428+00:00","2901","最长相邻不相等子序列 II","longest-unequal-adjacent-groups-subsequence-ii",770030188],"770308924":["遍历，找第一个回文串","bian-li-zhao-di-yi-ge-hui-wen-chuan-by-e-eaf6","2021-12-19T04:08:45.693546+00:00","2108","找出数组中的第一个回文字符串","find-first-palindromic-string-in-the-array",770308924],"770550829":["两种做法：遍历 / 二分查找（Python/Java/C++/Go）","mo-ni-by-endlesscheng-8e43","2023-01-08T04:26:16.734019+00:00","2529","正整数和负整数的最大计数","maximum-count-of-positive-integer-and-negative-integer",770550829],"771122731":["简洁写法！（Python/Java/C++/Go）","he-shi-ji-lu-da-an-pythonjavacgo-by-endl-lpcd","2023-05-30T00:11:25.377777+00:00","1110","删点成林","delete-nodes-and-return-forest",771122731],"77582966":["O(nlogn) 排序+双指针（Python/Java/C++/Go/JS）","onlogn-pai-xu-shuang-zhi-zhen-by-endless-qk40","2023-08-20T02:25:08.366367+00:00","2824","统计和小于目标的下标对数目","count-pairs-whose-sum-is-less-than-target",77582966],"778347498":["模拟","mo-ni-by-endlesscheng-rcjh","2023-01-08T00:29:15.375404+00:00","2526","找到数据流中的连续整数","find-consecutive-integers-from-a-data-stream",778347498],"782263815":["前后缀分解+双指针（Python/Java/C++/Go）","qian-hou-zhui-fen-jie-san-zhi-zhen-pytho-6cmr","2023-02-12T04:06:51.938960+00:00","2565","最少得分子序列","subsequence-with-the-minimum-score",782263815],"78641139":["推公式","tui-gong-shi-by-endlesscheng-90t5","2023-05-14T04:07:01.305719+00:00","2683","相邻值的按位异或","neighboring-bitwise-xor",78641139],"787047636":["贪心","tan-xin-by-endlesscheng-by6s","2021-08-01T04:07:50.197409+00:00","1953","你可以工作的最大周数","maximum-number-of-weeks-for-which-you-can-work",787047636],"787489678":["库函数写法（Python/Java/C++/Go）","ku-han-shu-xie-fa-pythonjavacgo-by-endle-hull","2023-09-17T04:22:00.251444+00:00","2859","计算 K 置位下标对应元素的和","sum-of-values-at-indices-with-k-set-bits",787489678],"787831673":["简单模拟（Python/Java/C++/Go）","jian-dan-mo-ni-pythonjavacgo-by-endlessc-tilg","2024-02-18T01:21:07.835815+00:00","3038","相同分数的最大操作数目 I","maximum-number-of-operations-with-the-same-score-i",787831673],"79432680":["O(n^2) 优雅枚举","on2-you-ya-mei-ju-by-endlesscheng-z86d","2024-02-04T01:21:37.140162+00:00","3027","人员站位的方案数 II","find-the-number-of-ways-to-place-people-ii",79432680],"796165027":["二进制枚举+Floyd，高效写法，附题单（Python/Java/C++/Go）","er-jin-zhi-mei-ju-floydgao-xiao-xie-fa-f-t7ou","2023-12-10T00:48:43.541519+00:00","2959","关闭分部的可行集合数目","number-of-possible-sets-of-closing-branches",796165027],"80255331":["哈希表（Python 两行）","ha-xi-biao-python-liang-xing-by-endlessc-ljae","2022-07-24T04:10:58.892510+00:00","2352","相等行列对","equal-row-and-column-pairs",80255331],"807897834":["Go 模拟","go-mo-ni-by-endlesscheng-8lv2","2021-12-19T04:08:00.965965+00:00","2109","向字符串添加空格","adding-spaces-to-a-string",807897834],"809508462":["式子变形 + 简洁写法","by-endlesscheng-uam3","2022-08-06T23:57:38.730276+00:00","2364","统计坏数对的数目","count-number-of-bad-pairs",809508462],"821525251":["倒序并查集","dao-xu-bing-cha-ji-by-endlesscheng-canj","2021-08-15T04:07:05.158739+00:00","1970","你能穿过矩阵的最后一天","last-day-where-you-can-still-cross",821525251],"826909651":["Go 前缀和","go-qian-zhui-he-by-endlesscheng-59wj","2021-06-12T16:16:38.436311+00:00","1895","最大的幻方","largest-magic-square",826909651],"829222445":["贪心，简洁写法（Python/Java/C++/Go/JS）","tan-xin-jian-ji-xie-fa-by-endlesscheng-zjea","2023-03-26T04:31:29.345827+00:00","2600","K 件物品的最大和","k-items-with-the-maximum-sum",829222445],"830799973":["双指针+维护最大最小（Python/Java/C++/Go）","shuang-zhi-zhen-wei-hu-zui-da-zui-xiao-p-h4bx","2023-10-15T04:14:13.824875+00:00","2905","找出满足差值条件的下标 II","find-indices-with-index-and-value-difference-ii",830799973],"83229717":["看下标为偶数/奇数的字符个数是否都一样（Python/Java/C++/Go）","kan-xia-biao-wei-ou-shu-qi-shu-de-zi-fu-edtw8","2023-09-03T12:15:05.461388+00:00","2840","判断通过操作能否让字符串相等 II","check-if-strings-can-be-made-equal-with-operations-ii",83229717],"833954016":["不用字符串，O(1) 空间写法（Python/Java/C++/Go/JS）","o1kong-jian-jian-ji-xie-fa-by-endlessche-jehj","2023-01-22T04:07:35.867139+00:00","2544","交替数字和","alternating-digit-sum",833954016],"834197249":["两种方法：记忆化搜索/O(n)前后缀分解（Python/Java/C++/Go）","ji-yi-hua-sou-suo-jian-ji-xie-fa-pythonj-6g5z","2024-01-07T12:06:09.815371+00:00","3003","执行操作后的最大分割数量","maximize-the-number-of-partitions-after-operations",834197249],"839548071":["【视频讲解】Z 函数（扩展 KMP）","z-han-shu-kuo-zhan-kmp-by-endlesscheng-w44j","2024-02-04T04:19:29.523765+00:00","3031","将单词恢复初始状态所需的最短时间 II","minimum-time-to-revert-word-to-initial-state-ii",839548071],"84450131":["模拟","mo-ni-by-endlesscheng-f6wa","2022-05-29T00:06:01.841857+00:00","2283","判断一个数的数字计数是否等于数位的值","check-if-number-has-equal-digit-count-and-digit-value",84450131],"846898736":["排序（Python/Java/C++/Go/JS）","pai-xu-pythonjavacgo-by-endlesscheng-u70i","2023-05-13T16:14:51.664664+00:00","2679","矩阵中的和","sum-in-a-matrix",846898736],"854560060":["回溯秒杀N皇后！一个视频讲透！（Python/Java/C++/Go/JS）","hui-su-miao-sha-nhuang-hou-yi-ge-shi-pin-l41l","2023-08-10T08:03:50.560392+00:00","52","N 皇后 II","n-queens-ii",854560060],"855962181":["两种做法：BFS+平衡树/并查集（Python/Java/C++/Go）","liang-chong-zuo-fa-ping-heng-shu-bing-ch-vr0z","2023-04-02T05:09:49.551008+00:00","2612","最少翻转操作数","minimum-reverse-operations",855962181],"869195845":["排序后遍历，简洁写法","pai-xu-hou-bian-li-xiang-dang-yu-qiu-chu-excq","2021-06-06T04:31:05.351307+00:00","1887","使数组元素相等的减少操作次数","reduction-operations-to-make-the-array-elements-equal",869195845],"869865446":["分组+双指针（Python/Java/C++/Go）","fen-zu-shuang-zhi-zhen-pythonjavacgo-by-lqqau","2023-08-20T04:12:49.710998+00:00","2831","找出最长等值子数组","find-the-longest-equal-subarray",869865446],"870099563":["简洁写法！直接调用 198 题代码！（Python/Java/C++/Go/JS）","jian-ji-xie-fa-zhi-jie-diao-yong-198-ti-qhvri","2023-09-17T00:26:22.923531+00:00","213","打家劫舍 II","house-robber-ii",870099563],"87115414":["O(nlogn) 线段树做法（Python/Java/C++/Go）","onlogn-xian-duan-shu-zuo-fa-pythonjavacg-pd8r","2023-10-29T01:56:25.107033+00:00","2913","子数组不同元素数目的平方和 I","subarrays-distinct-element-sum-of-squares-i",87115414],"879115717":["Go 库函数","go-ku-han-shu-by-endlesscheng-yhwn","2022-03-04T01:25:19.960685+00:00","592","分数加减运算","fraction-addition-and-subtraction",879115717],"87920735":["【图解】一图掌握二分答案！四种写法！附题单！（Python/Java/C++/Go/JS/Rust）","tu-jie-yi-tu-zhang-wo-er-fen-da-an-si-ch-d15k","2023-10-29T23:36:47.065997+00:00","275","H 指数 II","h-index-ii",87920735],"880748729":["单调栈 + DP + 一次遍历（Python/Java/C++/Go）","dan-diao-zhan-dp-by-endlesscheng-9d6y","2022-07-28T08:26:20.861275+00:00","2355","你能拿走的最大图书数量","maximum-number-of-books-you-can-take",880748729],"881741713":["遍历（Python/Java/C++/Go/JS/Rust）","bian-li-pythonjavacgo-by-endlesscheng-ge9h","2023-05-13T16:15:20.158784+00:00","2678","老人的数目","number-of-senior-citizens",881741713],"883396381":["利用差分的思想（Python 一行）","li-yong-chai-fen-shu-zu-de-si-xiang-by-e-8ve6","2022-10-09T04:24:11.382395+00:00","2433","找出前缀异或的原始数组","find-the-original-array-of-prefix-xor",883396381],"883833496":["教你一步步思考动态规划！（附题单）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-djxq","2023-06-20T00:29:38.852587+00:00","1595","连通两组点的最小成本","minimum-cost-to-connect-two-groups-of-points",883833496],"884144873":["贪心 + 分类讨论","tan-xin-fen-lei-tao-lun-by-endlesscheng-qj15","2022-02-13T04:38:10.649742+00:00","2170","使数组变成交替数组的最少操作数","minimum-operations-to-make-the-array-alternating",884144873],"886594276":["数位 DP 通用模板，附题单（Python/Java/C++/Go）","by-endlesscheng-1egu","2021-09-10T08:16:01.435394+00:00","600","不含连续1的非负整数","non-negative-integers-without-consecutive-ones",886594276],"888694650":["如何灵活运用递归？来看四道热门二叉树题目！（Python/Java/C++/Go）","ru-he-ling-huo-yun-yong-di-gui-lai-kan-s-r1nc","2022-12-10T10:10:56.987940+00:00","199","二叉树的右视图","binary-tree-right-side-view",888694650],"889856657":["O(m^3) 带权二分图最大完美匹配","om3-er-fen-tu-zui-da-dai-quan-pi-pei-by-a0wqb","2021-07-25T04:07:30.023350+00:00","1947","最大兼容性评分和","maximum-compatibility-score-sum",889856657],"894912724":["按题意模拟（Python/Java/C++/Go）","an-ti-yi-mo-ni-by-endlesscheng-34t1","2023-10-29T04:15:42.307956+00:00","2917","找出数组中的 K-or 值","find-the-k-or-of-an-array",894912724],"904890527":["回溯不会写？套路在此！（Python/Java/C++/Go）","hui-su-bu-hui-xie-tao-lu-zai-ci-pythonja-a92r","2023-03-09T07:32:19.942862+00:00","LCR 085","括号生成","IDBivT",904890527],"905487995":["DFS + 分类讨论","ji-yi-hua-sou-suo-by-endlesscheng-ll3r","2021-10-31T04:54:38.881795+00:00","2060","同源字符串检测","check-if-an-original-string-exists-given-two-encoded-strings",905487995],"910590803":["双堆模拟（Python/Java/C++/Go）","shuang-dui-mo-ni-pythonjavacgo-by-endles-ctwc","2022-09-04T04:07:37.971309+00:00","2402","会议室 III","meeting-rooms-iii",910590803],"911506733":["O(n) 做法","pai-xu-qu-zhong-er-fen-by-endlesscheng-pgu0","2021-09-18T16:07:35.534348+00:00","2006","差的绝对值为 K 的数对数目","count-number-of-pairs-with-absolute-difference-k",911506733],"915449177":["线性 DP + 枚举切割位置 + 循环优化（Python/Java/C++/Go）","by-endlesscheng-mrmd","2022-06-19T04:22:23.166975+00:00","2312","卖木头块","selling-pieces-of-wood",915449177],"917372483":["栈的经典应用","zhan-de-jing-dian-ying-yong-by-endlessch-ljym","2022-08-28T04:08:33.357408+00:00","2390","从字符串中移除星号","removing-stars-from-a-string",917372483],"917808097":["利用位运算加速（Python/Java/C++/Go）","li-yong-wei-yun-suan-jia-su-pythonjavacg-uzme","2023-04-29T16:11:55.921865+00:00","2657","找到两个数组的前缀公共数组","find-the-prefix-common-array-of-two-arrays",917808097],"91788639":["从 O(n^2) 到 O(n)：单调栈+计算每个元素对答案的贡献","cong-on2-dao-ondan-diao-zhan-ji-suan-mei-o1op","2021-12-12T04:06:25.517560+00:00","2104","子数组范围和","sum-of-subarray-ranges",91788639],"918405430":["【图解】从 O(n^2) 到 O(n)（Python/Java/C++/Go/JS/Rust）","tu-jie-cong-on2-dao-onpythonjavacgojsrus-w8ny","2024-02-21T00:51:32.222193+00:00","106","从中序与后序遍历序列构造二叉树","construct-binary-tree-from-inorder-and-postorder-traversal",918405430],"919200929":["Go 模拟","go-mo-ni-by-endlesscheng-tpc5","2021-09-04T16:08:33.051741+00:00","1991","找到数组的中间位置","find-the-middle-index-in-array",919200929],"922086852":["最近公共祖先 + 位运算优化时间复杂度（Python/Java/C++/Go）","zui-jin-gong-gong-zu-xian-pythonjavacgo-v8ata","2022-12-18T04:06:09.034326+00:00","2509","查询树中环的长度","cycle-length-queries-in-a-tree",922086852],"922160489":["排序+贪心","pai-xu-tan-xin-by-endlesscheng-14ea","2023-03-12T04:09:39.117753+00:00","2587","重排数组以得到最大前缀分数","rearrange-array-to-maximize-prefix-score",922160489],"923836112":["二分答案+贪心","er-fen-da-an-tan-xin-by-endlesscheng-x5cx","2023-05-07T10:22:42.406569+00:00","LCP 78","城墙防线","Nsibyl",923836112],"924129852":["前后缀分解 + O(100) 常数空间（Python/Java/C++/Go）","qian-hou-zhui-fen-jie-o100-chang-shu-kon-51cv","2022-11-27T01:37:11.560500+00:00","2484","统计回文子序列数目","count-palindromic-subsequences",924129852],"927068521":["分类讨论（Python 一行）","by-endlesscheng-vmtr","2022-03-13T04:09:34.216243+00:00","2202","K 次操作后最大化顶端元素","maximize-the-topmost-element-after-k-moves",927068521],"928331770":["最大子数组和的变形题（Python/Java/C++/Go）","by-endlesscheng-5775","2022-05-15T01:27:18.011837+00:00","2272","最大波动的子字符串","substring-with-largest-variance",928331770],"928385815":["教你一步步思考动态规划！一个视频讲透！（Python/Java/C++/Go）","jiao-ni-yi-bu-bu-si-kao-dong-tai-gui-hua-21m5","2023-02-18T12:45:46.201620+00:00","322","零钱兑换","coin-change",928385815],"929368022":["状压 DP + 爆搜下一个状态","zhuang-ya-dp-bao-sou-xia-yi-ge-zhuang-ta-9dad","2023-04-22T11:20:25.754940+00:00","LCP 76","魔法棋盘","1ybDKD",929368022],"929840503":["三种方法：DFS/BFS/BFS+链表（附题单）Python/Java/C++/Go/JS","san-chong-fang-fa-dfsbfsbfslian-biao-fu-5alnq","2023-11-02T23:54:21.964139+00:00","116","填充每个节点的下一个右侧节点指针","populating-next-right-pointers-in-each-node",929840503],"93344773":["O(n) 一次遍历","yi-ci-bian-li-by-endlesscheng-s6a0","2021-11-21T04:08:03.259188+00:00","2079","给植物浇水","watering-plants",93344773],"938263064":["两种做法：二分答案 / 分类讨论","liang-chong-zuo-fa-er-fen-da-an-fen-lei-qhee6","2022-10-16T00:25:10.207054+00:00","2439","最小化数组中的最大值","minimize-maximum-of-array",938263064],"942180030":["两种数位 DP 模板，附题单（Python/Java/C++/Go）","shu-wei-dp-tong-yong-mo-ban-pythonjavacg-9tuc","2023-06-04T04:18:55.690184+00:00","2719","统计整数数目","count-of-integers",942180030],"94359620":["贪心（Python/Java/C++/Go）","tan-xin-by-endlesscheng-immn","2023-08-27T04:23:17.841049+00:00","2835","使子序列的和等于目标的最少操作次数","minimum-operations-to-form-subsequence-with-target-sum",94359620],"945629510":["算法小课堂：前缀和","suan-fa-xiao-ke-tang-qian-zhui-he-by-end-n0mx","2023-02-05T04:33:54.806830+00:00","2559","统计范围内的元音字符串数","count-vowel-strings-in-ranges",945629510],"946660529":["找最后一个奇数位置（附一行写法）","zhao-zui-hou-yi-ge-qi-shu-wei-zhi-by-end-j98d","2021-06-20T04:07:15.251978+00:00","1903","字符串中的最大奇数","largest-odd-number-in-string",946660529],"949381873":["一步步提示如何做出此题（Python/Java/C++/Go）","by-endlesscheng-dt8h","2022-04-16T16:11:02.178161+00:00","2242","节点序列的最大得分","maximum-score-of-a-node-sequence",949381873],"950521557":["遍历每一行","bian-li-mei-yi-xing-by-endlesscheng-ltx3","2023-04-16T04:11:20.316840+00:00","2643","一最多的行","row-with-maximum-ones",950521557],"95938088":["O(1) 空间写法！","mo-ni-jian-ji-xie-fa-by-endlesscheng-utdr","2023-02-26T04:44:26.401102+00:00","2574","左右元素和的差值","left-and-right-sum-differences",95938088],"96141044":["和字符集大小无关的线段树做法（Python/Java/C++/Go）","by-endlesscheng-qpbw","2022-03-20T04:09:08.471993+00:00","2213","由单个字符重复的最长子字符串","longest-substring-of-one-repeating-character",96141044],"963523596":["库函数模拟（Python 一行）","go-by-endlesscheng-qrhd","2022-06-25T23:06:58.227175+00:00","2315","统计星号","count-asterisks",963523596],"96440277":["详细分析为什么至多考虑两行（Python/Java/C++/Go）","xiang-xi-fen-xi-wei-shi-yao-zhi-duo-kao-mbl6a","2023-06-11T10:47:40.661888+00:00","2732","找到矩阵中的好子集","find-a-good-subset-of-the-matrix",96440277],"967980473":["横竖分别统计+分组循环（Python/Java/C++/Go）","heng-shu-fen-bie-tong-ji-fen-zu-xun-huan-nboj","2023-11-26T10:57:49.262453+00:00","2943","最大化网格图中正方形空洞的面积","maximize-area-of-square-hole-in-grid",967980473],"974534416":["哈希表模拟（Python/Java/C++/Go）","ha-xi-biao-mo-ni-by-endlesscheng-6rgb","2023-04-02T05:24:10.186478+00:00","2610","转换二维数组","convert-an-array-into-a-2d-array-with-conditions",974534416],"976283641":["预处理+状压DP","z-by-endlesscheng-6ver","2022-10-08T01:21:19.775623+00:00","LCP 69","Hello LeetCode!","rMeRt2",976283641],"979526552":["最长递增子序列的变形：选或不选/枚举选哪个（Python/Java/C++/Go）","zui-chang-di-zeng-zi-xu-lie-de-bian-xing-jhgg","2023-04-19T15:36:18.988418+00:00","1187","使数组严格递增","make-array-strictly-increasing",979526552],"981386412":["O(1) 时间做法（Python/Java/C++/Go）","o1-shi-jian-zuo-fa-pythonjavacgo-by-endl-sa7h","2023-06-11T09:19:55.228282+00:00","2733","既不是最小值也不是最大值","neither-minimum-nor-maximum",981386412],"983129619":["位运算写法","wei-yun-suan-xie-fa-by-endlesscheng-g1i6","2021-10-10T04:09:48.616373+00:00","2032","至少在两个数组中出现的值","two-out-of-three",983129619],"98370052":["Go 单调栈","go-dan-diao-zhan-by-endlesscheng-2lfi","2021-12-06T03:18:13.308119+00:00","1063","有效子数组的数目","number-of-valid-subarrays",98370052],"986520800":["不存在水域即为子岛屿","bu-cun-zai-shui-yu-ji-wei-zi-dao-yu-by-e-wbz5","2021-06-20T04:08:50.281137+00:00","1905","统计子岛屿","count-sub-islands",986520800],"988335694":["贪心+二分：使箱子的尺寸之和尽可能地小","qian-zhui-he-shang-er-fen-by-endlesschen-vmku","2021-06-06T04:33:25.928711+00:00","1889","装包裹的最小浪费空间","minimum-space-wasted-from-packaging",988335694],"989456575":["暴力枚举所有插入括号的位置","bao-li-mei-ju-suo-you-by-endlesscheng-evdu","2022-04-10T04:09:06.276234+00:00","2232","向表达式添加括号后的最小结果","minimize-result-by-adding-parentheses-to-expression",989456575],"999091554":["接近 O(n^2) 的做法：多源BFS+倒序枚举答案+并查集（Python/Java/C++/Go）","jie-jin-on2-de-zuo-fa-duo-yuan-bfsdao-xu-r5um","2023-08-06T08:24:53.082995+00:00","2812","找出最安全路径","find-the-safest-path-in-a-grid",999091554]} diff --git a/public/tags.json b/public/tags.json index 9f15b5e..c9d66f2 100644 --- a/public/tags.json +++ b/public/tags.json @@ -1 +1 @@ -[[1858746375,"Recursion","递归"],[2720626878,"Doubly-Linked List","双向链表"],[3008118568,"Randomized","随机化"],[2282267785,"Number Theory","数论"],[2745966228,"Divide and Conquer","分治"],[2967599592,"Binary Search","二分查找"],[3988226293,"Tree","树"],[1692555020,"Topological Sort","拓扑排序"],[851369480,"Bitmask","状态压缩"],[1378748721,"Strongly Connected Component","强连通分量"],[4015258302,"Prefix Sum","前缀和"],[2300936473,"Two Pointers","双指针"],[3504911592,"Linked List","链表"],[4036243672,"Database","数据库"],[1618992015,"Monotonic Stack","单调栈"],[777015263,"Data Stream","数据流"],[2952532185,"Greedy","贪心"],[954837032,"Monotonic Queue","单调队列"],[2981007068,"Combinatorics","组合数学"],[3122227617,"Shell","Shell"],[3381359851,"Dynamic Programming","动态规划"],[868588451,"Hash Function","哈希函数"],[20600792,"Counting Sort","计数排序"],[226253435,"Radix Sort","基数排序"],[4257256577,"Trie","字典树"],[805400942,"Segment Tree","线段树"],[1132225755,"Sliding Window","滑动窗口"],[4116070215,"String Matching","字符串匹配"],[882398702,"Breadth-First Search","广度优先搜索"],[135058847,"Stack","栈"],[803820082,"Ordered Set","有序集合"],[3200621928,"Game Theory","博弈"],[3164438233,"Suffix Array","后缀数组"],[2465402031,"Backtracking","回溯"],[3901555439,"Design","设计"],[2947477999,"Sorting","排序"],[2604685700,"Counting","计数"],[608099761,"Geometry","几何"],[2593860184,"Queue","队列"],[3376788625,"Eulerian Circuit","欧拉回路"],[446798627,"Line Sweep","扫描线"],[604962628,"Binary Tree","二叉树"],[4141685903,"Union Find","并查集"],[1432994735,"Math","数学"],[1597208551,"Graph","图"],[1614322657,"Bucket Sort","桶排序"],[3349326461,"Rejection Sampling","拒绝采样"],[382270662,"Array","数组"],[3361825412,"Quickselect","快速选择"],[3152783174,"Shortest Path","最短路"],[681488273,"Bit Manipulation","位运算"],[1808652384,"Binary Search Tree","二叉搜索树"],[1674020409,"Memoization","记忆化搜索"],[1526846831,"Iterator","迭代器"],[492620472,"Concurrency","多线程"],[1615808600,"String","字符串"],[666045116,"Enumeration","枚举"],[3789650833,"Merge Sort","归并排序"],[334724963,"Reservoir Sampling","水塘抽样"],[1315724598,"Simulation","模拟"],[3609828652,"Probability and Statistics","概率与统计"],[3922821388,"Matrix","矩阵"],[1631658827,"Depth-First Search","深度优先搜索"],[2777070981,"Hash Table","哈希表"],[4013823363,"Heap (Priority Queue)","堆（优先队列）"],[4247755135,"Binary Indexed Tree","树状数组"],[3084752268,"Biconnected Component","双连通分量"],[767310859,"Interactive","交互"],[1303275809,"Minimum Spanning Tree","最小生成树"],[1645884698,"Rolling Hash","滚动哈希"],[110965111,"Brainteaser","脑筋急转弯"]] +[[2465402031,"Backtracking","回溯"],[135058847,"Stack","栈"],[382270662,"Array","数组"],[1808652384,"Binary Search Tree","二叉搜索树"],[4247755135,"Binary Indexed Tree","树状数组"],[2777070981,"Hash Table","哈希表"],[3922821388,"Matrix","矩阵"],[3789650833,"Merge Sort","归并排序"],[1614322657,"Bucket Sort","桶排序"],[3152783174,"Shortest Path","最短路"],[4257256577,"Trie","字典树"],[681488273,"Bit Manipulation","位运算"],[4116070215,"String Matching","字符串匹配"],[2745966228,"Divide and Conquer","分治"],[3504911592,"Linked List","链表"],[2604685700,"Counting","计数"],[2720626878,"Doubly-Linked List","双向链表"],[226253435,"Radix Sort","基数排序"],[1615808600,"String","字符串"],[4036243672,"Database","数据库"],[446798627,"Line Sweep","扫描线"],[334724963,"Reservoir Sampling","水塘抽样"],[666045116,"Enumeration","枚举"],[1618992015,"Monotonic Stack","单调栈"],[3901555439,"Design","设计"],[3988226293,"Tree","树"],[608099761,"Geometry","几何"],[1674020409,"Memoization","记忆化搜索"],[3376788625,"Eulerian Circuit","欧拉回路"],[492620472,"Concurrency","多线程"],[3122227617,"Shell","Shell"],[882398702,"Breadth-First Search","广度优先搜索"],[1597208551,"Graph","图"],[3609828652,"Probability and Statistics","概率与统计"],[1692555020,"Topological Sort","拓扑排序"],[20600792,"Counting Sort","计数排序"],[767310859,"Interactive","交互"],[3349326461,"Rejection Sampling","拒绝采样"],[4015258302,"Prefix Sum","前缀和"],[1132225755,"Sliding Window","滑动窗口"],[1315724598,"Simulation","模拟"],[2952532185,"Greedy","贪心"],[2593860184,"Queue","队列"],[3008118568,"Randomized","随机化"],[3084752268,"Biconnected Component","双连通分量"],[4013823363,"Heap (Priority Queue)","堆（优先队列）"],[868588451,"Hash Function","哈希函数"],[1645884698,"Rolling Hash","滚动哈希"],[1432994735,"Math","数学"],[2282267785,"Number Theory","数论"],[1378748721,"Strongly Connected Component","强连通分量"],[2947477999,"Sorting","排序"],[777015263,"Data Stream","数据流"],[1631658827,"Depth-First Search","深度优先搜索"],[803820082,"Ordered Set","有序集合"],[1303275809,"Minimum Spanning Tree","最小生成树"],[2300936473,"Two Pointers","双指针"],[604962628,"Binary Tree","二叉树"],[2967599592,"Binary Search","二分查找"],[4141685903,"Union Find","并查集"],[1858746375,"Recursion","递归"],[2981007068,"Combinatorics","组合数学"],[3164438233,"Suffix Array","后缀数组"],[3381359851,"Dynamic Programming","动态规划"],[3200621928,"Game Theory","博弈"],[3361825412,"Quickselect","快速选择"],[954837032,"Monotonic Queue","单调队列"],[1526846831,"Iterator","迭代器"],[110965111,"Brainteaser","脑筋急转弯"],[805400942,"Segment Tree","线段树"],[851369480,"Bitmask","状态压缩"]] diff --git a/public/zenk.json b/public/zenk.json index 74924ab..aa96233 100755 --- a/public/zenk.json +++ b/public/zenk.json @@ -1 +1 @@ -[{"question_id":3043,"title":"最长公共前缀的长度","title_slug":"find-the-length-of-the-longest-common-prefix","rating":0,"_hash":3836897087,"paid_only":false,"cont_title":"第 385 场周赛","cont_title_slug":"weekly-contest-385"},{"question_id":3044,"title":"出现频率最高的质数","title_slug":"most-frequent-prime","rating":0,"_hash":1829348697,"paid_only":false,"cont_title":"第 385 场周赛","cont_title_slug":"weekly-contest-385"},{"question_id":3045,"title":"统计前后缀下标对 II","title_slug":"count-prefix-and-suffix-pairs-ii","rating":0,"_hash":3118022376,"paid_only":false,"cont_title":"第 385 场周赛","cont_title_slug":"weekly-contest-385"},{"question_id":3038,"title":"相同分数的最大操作数目 I","title_slug":"maximum-number-of-operations-with-the-same-score-i","rating":0,"_hash":787831673,"paid_only":false,"cont_title":"第 124 场双周赛","cont_title_slug":"biweekly-contest-124"},{"question_id":3039,"title":"进行操作使字符串为空","title_slug":"apply-operations-to-make-string-empty","rating":0,"_hash":1356097871,"paid_only":false,"cont_title":"第 124 场双周赛","cont_title_slug":"biweekly-contest-124"},{"question_id":3040,"title":"相同分数的最大操作数目 II","title_slug":"maximum-number-of-operations-with-the-same-score-ii","rating":0,"_hash":4231944752,"paid_only":false,"cont_title":"第 124 场双周赛","cont_title_slug":"biweekly-contest-124"},{"question_id":3041,"title":"修改数组后最大化数组中的连续元素数目","title_slug":"maximize-consecutive-elements-in-an-array-after-modification","rating":0,"_hash":267105112,"paid_only":false,"cont_title":"第 124 场双周赛","cont_title_slug":"biweekly-contest-124"},{"question_id":3042,"title":"统计前后缀下标对 I","title_slug":"count-prefix-and-suffix-pairs-i","rating":0,"_hash":2560538129,"paid_only":false,"cont_title":"第 385 场周赛","cont_title_slug":"weekly-contest-385"},{"question_id":1108,"title":"IP 地址无效化","title_slug":"defanging-an-ip-address","rating":1084.1319467318,"_hash":1418471367,"paid_only":false,"cont_title":"第 144 场周赛","cont_title_slug":"weekly-contest-144"},{"question_id":1480,"title":"一维数组的动态和","title_slug":"running-sum-of-1d-array","rating":1104.7359028407,"_hash":1062871842,"paid_only":false,"cont_title":"第 193 场周赛","cont_title_slug":"weekly-contest-193"},{"question_id":3028,"title":"边界上的蚂蚁","title_slug":"ant-on-the-boundary","rating":1115.8258444602,"_hash":3048586035,"paid_only":false,"cont_title":"第 383 场周赛","cont_title_slug":"weekly-contest-383"},{"question_id":1394,"title":"找出数组中的幸运数","title_slug":"find-lucky-integer-in-an-array","rating":1118.1080334618,"_hash":3411465392,"paid_only":false,"cont_title":"第 182 场周赛","cont_title_slug":"weekly-contest-182"},{"question_id":1470,"title":"重新排列数组","title_slug":"shuffle-the-array","rating":1120.698183624,"_hash":739255468,"paid_only":false,"cont_title":"第 192 场周赛","cont_title_slug":"weekly-contest-192"},{"question_id":1464,"title":"数组中两元素的最大乘积","title_slug":"maximum-product-of-two-elements-in-an-array","rating":1121.0677596555,"_hash":1656858690,"paid_only":false,"cont_title":"第 191 场周赛","cont_title_slug":"weekly-contest-191"},{"question_id":1455,"title":"检查单词是否为句中其他单词的前缀","title_slug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence","rating":1125.575238274,"_hash":1403314808,"paid_only":false,"cont_title":"第 190 场周赛","cont_title_slug":"weekly-contest-190"},{"question_id":1450,"title":"在既定时间做作业的学生人数","title_slug":"number-of-students-doing-homework-at-a-given-time","rating":1129.3432988996,"_hash":3894678842,"paid_only":false,"cont_title":"第 189 场周赛","cont_title_slug":"weekly-contest-189"},{"question_id":977,"title":"有序数组的平方","title_slug":"squares-of-a-sorted-array","rating":1129.949090232,"_hash":969893325,"paid_only":false,"cont_title":"第 120 场周赛","cont_title_slug":"weekly-contest-120"},{"question_id":1929,"title":"数组串联","title_slug":"concatenation-of-array","rating":1132.6812943289,"_hash":4238290979,"paid_only":false,"cont_title":"第 249 场周赛","cont_title_slug":"weekly-contest-249"},{"question_id":3024,"title":"三角形类型","title_slug":"type-of-triangle","rating":1134.7862697576,"_hash":3778120928,"paid_only":false,"cont_title":"第 123 场双周赛","cont_title_slug":"biweekly-contest-123"},{"question_id":1351,"title":"统计有序矩阵中的负数","title_slug":"count-negative-numbers-in-a-sorted-matrix","rating":1139.4248492279,"_hash":474089455,"paid_only":false,"cont_title":"第 176 场周赛","cont_title_slug":"weekly-contest-176"},{"question_id":1295,"title":"统计位数为偶数的数字","title_slug":"find-numbers-with-even-number-of-digits","rating":1139.6630206282,"_hash":1078494316,"paid_only":false,"cont_title":"第 168 场周赛","cont_title_slug":"weekly-contest-168"},{"question_id":2894,"title":"分类求和并作差","title_slug":"divisible-and-non-divisible-sums-difference","rating":1140.0534541481,"_hash":1782593021,"paid_only":false,"cont_title":"第 366 场周赛","cont_title_slug":"weekly-contest-366"},{"question_id":1281,"title":"整数的各位积和之差","title_slug":"subtract-the-product-and-sum-of-digits-of-an-integer","rating":1141.2363999461,"_hash":1959906977,"paid_only":false,"cont_title":"第 166 场周赛","cont_title_slug":"weekly-contest-166"},{"question_id":2798,"title":"满足目标工作时长的员工数目","title_slug":"number-of-employees-who-met-the-target","rating":1142.0341823205,"_hash":3735817636,"paid_only":false,"cont_title":"第 356 场周赛","cont_title_slug":"weekly-contest-356"},{"question_id":1137,"title":"第 N 个泰波那契数","title_slug":"n-th-tribonacci-number","rating":1142.8650731632,"_hash":651101767,"paid_only":false,"cont_title":"第 147 场周赛","cont_title_slug":"weekly-contest-147"},{"question_id":1913,"title":"两个数对之间的最大乘积差","title_slug":"maximum-product-difference-between-two-pairs","rating":1144.6237559885,"_hash":639622603,"paid_only":false,"cont_title":"第 247 场周赛","cont_title_slug":"weekly-contest-247"},{"question_id":2413,"title":"最小偶倍数","title_slug":"smallest-even-multiple","rating":1144.9508874557,"_hash":3078609754,"paid_only":false,"cont_title":"第 311 场周赛","cont_title_slug":"weekly-contest-311"},{"question_id":2733,"title":"既不是最小值也不是最大值","title_slug":"neither-minimum-nor-maximum","rating":1147.8274860083,"_hash":981386412,"paid_only":false,"cont_title":"第 349 场周赛","cont_title_slug":"weekly-contest-349"},{"question_id":2455,"title":"可被三整除的偶数的平均值","title_slug":"average-value-of-even-numbers-that-are-divisible-by-three","rating":1151.2537511408,"_hash":1001722740,"paid_only":false,"cont_title":"第 317 场周赛","cont_title_slug":"weekly-contest-317"},{"question_id":1290,"title":"二进制链表转整数","title_slug":"convert-binary-number-in-a-linked-list-to-integer","rating":1151.3534799042,"_hash":3681668560,"paid_only":false,"cont_title":"第 167 场周赛","cont_title_slug":"weekly-contest-167"},{"question_id":1460,"title":"通过翻转子数组使两个数组相等","title_slug":"make-two-arrays-equal-by-reversing-subarrays","rating":1151.5250329621,"_hash":2597701503,"paid_only":false,"cont_title":"第 27 场双周赛","cont_title_slug":"biweekly-contest-27"},{"question_id":2778,"title":"特殊元素平方和","title_slug":"sum-of-squares-of-special-elements","rating":1151.9363042898,"_hash":14750873,"paid_only":false,"cont_title":"第 354 场周赛","cont_title_slug":"weekly-contest-354"},{"question_id":2828,"title":"判别首字母缩略词","title_slug":"check-if-a-string-is-an-acronym-of-words","rating":1151.9713084499,"_hash":658738156,"paid_only":false,"cont_title":"第 359 场周赛","cont_title_slug":"weekly-contest-359"},{"question_id":1365,"title":"有多少小于当前数字的数字","title_slug":"how-many-numbers-are-smaller-than-the-current-number","rating":1152.1377893605,"_hash":2310137574,"paid_only":false,"cont_title":"第 178 场周赛","cont_title_slug":"weekly-contest-178"},{"question_id":2089,"title":"找出数组排序后的目标下标","title_slug":"find-target-indices-after-sorting-array","rating":1152.1494742874,"_hash":1915453170,"paid_only":false,"cont_title":"第 269 场周赛","cont_title_slug":"weekly-contest-269"},{"question_id":2469,"title":"温度转换","title_slug":"convert-the-temperature","rating":1153.427255962,"_hash":1614249365,"paid_only":false,"cont_title":"第 319 场周赛","cont_title_slug":"weekly-contest-319"},{"question_id":1502,"title":"判断能否形成等差数列","title_slug":"can-make-arithmetic-progression-from-sequence","rating":1154.828067979,"_hash":2581904260,"paid_only":false,"cont_title":"第 196 场周赛","cont_title_slug":"weekly-contest-196"},{"question_id":2351,"title":"第一个出现两次的字母","title_slug":"first-letter-to-appear-twice","rating":1155.4545579447,"_hash":2515340929,"paid_only":false,"cont_title":"第 303 场周赛","cont_title_slug":"weekly-contest-303"},{"question_id":2903,"title":"找出满足差值条件的下标 I","title_slug":"find-indices-with-index-and-value-difference-i","rating":1157.6407631819,"_hash":1982730574,"paid_only":false,"cont_title":"第 367 场周赛","cont_title_slug":"weekly-contest-367"},{"question_id":1920,"title":"基于排列构建数组","title_slug":"build-array-from-permutation","rating":1160.4439395369,"_hash":1028149095,"paid_only":false,"cont_title":"第 248 场周赛","cont_title_slug":"weekly-contest-248"},{"question_id":1512,"title":"好数对的数目","title_slug":"number-of-good-pairs","rating":1160.8899403409,"_hash":1299928804,"paid_only":false,"cont_title":"第 197 场周赛","cont_title_slug":"weekly-contest-197"},{"question_id":961,"title":"在长度 2N 的数组中找出重复 N 次的元素","title_slug":"n-repeated-element-in-size-2n-array","rating":1161.6227767245,"_hash":1677761084,"paid_only":false,"cont_title":"第 116 场周赛","cont_title_slug":"weekly-contest-116"},{"question_id":2278,"title":"字母在字符串中的百分比","title_slug":"percentage-of-letter-in-string","rating":1161.8236318927,"_hash":2452001178,"paid_only":false,"cont_title":"第 294 场周赛","cont_title_slug":"weekly-contest-294"},{"question_id":1342,"title":"将数字变成 0 的操作次数","title_slug":"number-of-steps-to-reduce-a-number-to-zero","rating":1163.6047095526,"_hash":3773666854,"paid_only":false,"cont_title":"第 19 场双周赛","cont_title_slug":"biweekly-contest-19"},{"question_id":1374,"title":"生成每种字符都是奇数个的字符串","title_slug":"generate-a-string-with-characters-that-have-odd-counts","rating":1164.0227691933,"_hash":4034922554,"paid_only":false,"cont_title":"第 179 场周赛","cont_title_slug":"weekly-contest-179"},{"question_id":2710,"title":"移除字符串中的尾随零","title_slug":"remove-trailing-zeros-from-a-string","rating":1164.5575871589,"_hash":2975776867,"paid_only":false,"cont_title":"第 347 场周赛","cont_title_slug":"weekly-contest-347"},{"question_id":2011,"title":"执行操作后的变量值","title_slug":"final-value-of-variable-after-performing-operations","rating":1165.2135167215,"_hash":170017720,"paid_only":false,"cont_title":"第 259 场周赛","cont_title_slug":"weekly-contest-259"},{"question_id":1446,"title":"连续字符","title_slug":"consecutive-characters","rating":1165.4768151611,"_hash":1368317464,"paid_only":false,"cont_title":"第 26 场双周赛","cont_title_slug":"biweekly-contest-26"},{"question_id":2824,"title":"统计和小于目标的下标对数目","title_slug":"count-pairs-whose-sum-is-less-than-target","rating":1165.8838207286,"_hash":77582966,"paid_only":false,"cont_title":"第 111 场双周赛","cont_title_slug":"biweekly-contest-111"},{"question_id":1768,"title":"交替合并字符串","title_slug":"merge-strings-alternately","rating":1166.5264284193,"_hash":1210757712,"paid_only":false,"cont_title":"第 229 场周赛","cont_title_slug":"weekly-contest-229"},{"question_id":1832,"title":"判断句子是否为全字母句","title_slug":"check-if-the-sentence-is-pangram","rating":1166.78818332,"_hash":2544348147,"paid_only":false,"cont_title":"第 237 场周赛","cont_title_slug":"weekly-contest-237"},{"question_id":2185,"title":"统计包含给定前缀的字符串","title_slug":"counting-words-with-a-given-prefix","rating":1167.1241589729,"_hash":537971944,"paid_only":false,"cont_title":"第 282 场周赛","cont_title_slug":"weekly-contest-282"},{"question_id":1304,"title":"和为零的 N 个不同整数","title_slug":"find-n-unique-integers-sum-up-to-zero","rating":1167.1331831913,"_hash":1460547008,"paid_only":false,"cont_title":"第 169 场周赛","cont_title_slug":"weekly-contest-169"},{"question_id":2441,"title":"与对应负数同时存在的最大正整数","title_slug":"largest-positive-integer-that-exists-with-its-negative","rating":1167.647122501,"_hash":3779169819,"paid_only":false,"cont_title":"第 315 场周赛","cont_title_slug":"weekly-contest-315"},{"question_id":2057,"title":"值相等的最小索引","title_slug":"smallest-index-with-equal-value","rating":1167.8737144048,"_hash":3849697077,"paid_only":false,"cont_title":"第 265 场周赛","cont_title_slug":"weekly-contest-265"},{"question_id":2651,"title":"计算列车到站时间","title_slug":"calculate-delayed-arrival-time","rating":1168.6157473032,"_hash":1602330770,"paid_only":false,"cont_title":"第 342 场周赛","cont_title_slug":"weekly-contest-342"},{"question_id":2960,"title":"统计已测试设备","title_slug":"count-tested-devices-after-test-operations","rating":1169.4209117977,"_hash":2595697191,"paid_only":false,"cont_title":"第 375 场周赛","cont_title_slug":"weekly-contest-375"},{"question_id":2427,"title":"公因子的数目","title_slug":"number-of-common-factors","rating":1172.0548998046,"_hash":1853208613,"paid_only":false,"cont_title":"第 313 场周赛","cont_title_slug":"weekly-contest-313"},{"question_id":1046,"title":"最后一块石头的重量","title_slug":"last-stone-weight","rating":1172.6819789183,"_hash":1420036364,"paid_only":false,"cont_title":"第 137 场周赛","cont_title_slug":"weekly-contest-137"},{"question_id":922,"title":"按奇偶排序数组 II","title_slug":"sort-array-by-parity-ii","rating":1173.505926482,"_hash":3658913842,"paid_only":false,"cont_title":"第 106 场周赛","cont_title_slug":"weekly-contest-106"},{"question_id":2643,"title":"一最多的行","title_slug":"row-with-maximum-ones","rating":1174.3019990918,"_hash":950521557,"paid_only":false,"cont_title":"第 341 场周赛","cont_title_slug":"weekly-contest-341"},{"question_id":1773,"title":"统计匹配检索规则的物品数量","title_slug":"count-items-matching-a-rule","rating":1174.8589329736,"_hash":3589125798,"paid_only":false,"cont_title":"第 230 场周赛","cont_title_slug":"weekly-contest-230"},{"question_id":3019,"title":"按键变更的次数","title_slug":"number-of-changing-keys","rating":1175.5552151972,"_hash":3290623649,"paid_only":false,"cont_title":"第 382 场周赛","cont_title_slug":"weekly-contest-382"},{"question_id":1431,"title":"拥有最多糖果的孩子","title_slug":"kids-with-the-greatest-number-of-candies","rating":1176.4547272896,"_hash":3057194499,"paid_only":false,"cont_title":"第 25 场双周赛","cont_title_slug":"biweekly-contest-25"},{"question_id":965,"title":"单值二叉树","title_slug":"univalued-binary-tree","rating":1177.5660617941,"_hash":472415307,"paid_only":false,"cont_title":"第 117 场周赛","cont_title_slug":"weekly-contest-117"},{"question_id":905,"title":"按奇偶排序数组","title_slug":"sort-array-by-parity","rating":1178.4942541235,"_hash":119654105,"paid_only":false,"cont_title":"第 102 场周赛","cont_title_slug":"weekly-contest-102"},{"question_id":2586,"title":"统计范围内的元音字符串数","title_slug":"count-the-number-of-vowel-strings-in-range","rating":1178.6580069402,"_hash":1405789151,"paid_only":false,"cont_title":"第 336 场周赛","cont_title_slug":"weekly-contest-336"},{"question_id":1287,"title":"有序数组中出现次数超过25%的元素","title_slug":"element-appearing-more-than-25-in-sorted-array","rating":1179.1495967491,"_hash":3348466517,"paid_only":false,"cont_title":"第 15 场双周赛","cont_title_slug":"biweekly-contest-15"},{"question_id":1441,"title":"用栈操作构建数组","title_slug":"build-an-array-with-stack-operations","rating":1180.3543157775,"_hash":1137656154,"paid_only":false,"cont_title":"第 188 场周赛","cont_title_slug":"weekly-contest-188"},{"question_id":3033,"title":"修改矩阵","title_slug":"modify-the-matrix","rating":1180.5927490268,"_hash":545408597,"paid_only":false,"cont_title":"第 384 场周赛","cont_title_slug":"weekly-contest-384"},{"question_id":1486,"title":"数组异或操作","title_slug":"xor-operation-in-an-array","rating":1180.923623906,"_hash":1038100878,"paid_only":false,"cont_title":"第 194 场周赛","cont_title_slug":"weekly-contest-194"},{"question_id":852,"title":"山脉数组的峰顶索引","title_slug":"peak-index-in-a-mountain-array","rating":1181.5839867359,"_hash":2285522737,"paid_only":false,"cont_title":"第 89 场周赛","cont_title_slug":"weekly-contest-89"},{"question_id":1189,"title":"“气球” 的最大数量","title_slug":"maximum-number-of-balloons","rating":1181.9716216714,"_hash":475209872,"paid_only":false,"cont_title":"第 154 场周赛","cont_title_slug":"weekly-contest-154"},{"question_id":2942,"title":"查找包含给定字符的单词","title_slug":"find-words-containing-character","rating":1182.2102562446,"_hash":3830794143,"paid_only":false,"cont_title":"第 118 场双周赛","cont_title_slug":"biweekly-contest-118"},{"question_id":2652,"title":"倍数求和","title_slug":"sum-multiples","rating":1182.3093772964,"_hash":1017096056,"paid_only":false,"cont_title":"第 342 场周赛","cont_title_slug":"weekly-contest-342"},{"question_id":1672,"title":"最富有客户的资产总量","title_slug":"richest-customer-wealth","rating":1182.6489068544,"_hash":1487915794,"paid_only":false,"cont_title":"第 217 场周赛","cont_title_slug":"weekly-contest-217"},{"question_id":2544,"title":"交替数字和","title_slug":"alternating-digit-sum","rating":1184.3385083575,"_hash":833954016,"paid_only":false,"cont_title":"第 329 场周赛","cont_title_slug":"weekly-contest-329"},{"question_id":1979,"title":"找出数组的最大公约数","title_slug":"find-greatest-common-divisor-of-array","rating":1184.4264833435,"_hash":2688612867,"paid_only":false,"cont_title":"第 255 场周赛","cont_title_slug":"weekly-contest-255"},{"question_id":2341,"title":"数组能形成多少数对","title_slug":"maximum-number-of-pairs-in-array","rating":1184.795721284,"_hash":2572867035,"paid_only":false,"cont_title":"第 302 场周赛","cont_title_slug":"weekly-contest-302"},{"question_id":2974,"title":"最小数字游戏","title_slug":"minimum-number-game","rating":1184.8359383057,"_hash":760662992,"paid_only":false,"cont_title":"第 377 场周赛","cont_title_slug":"weekly-contest-377"},{"question_id":2119,"title":"反转两次的数字","title_slug":"a-number-after-a-double-reversal","rating":1187.1344261572,"_hash":1952470548,"paid_only":false,"cont_title":"第 273 场周赛","cont_title_slug":"weekly-contest-273"},{"question_id":1880,"title":"检查某单词是否等于两单词之和","title_slug":"check-if-word-equals-summation-of-two-words","rating":1187.1641565458,"_hash":2621107821,"paid_only":false,"cont_title":"第 243 场周赛","cont_title_slug":"weekly-contest-243"},{"question_id":1122,"title":"数组的相对排序","title_slug":"relative-sort-array","rating":1188.6311093158,"_hash":509756552,"paid_only":false,"cont_title":"第 145 场周赛","cont_title_slug":"weekly-contest-145"},{"question_id":2951,"title":"找出峰值","title_slug":"find-the-peaks","rating":1189.4358388136,"_hash":518714509,"paid_only":false,"cont_title":"第 374 场周赛","cont_title_slug":"weekly-contest-374"},{"question_id":2769,"title":"找出最大的可达成数字","title_slug":"find-the-maximum-achievable-number","rating":1191.3681720998,"_hash":2491402608,"paid_only":false,"cont_title":"第 353 场周赛","cont_title_slug":"weekly-contest-353"},{"question_id":1436,"title":"旅行终点站","title_slug":"destination-city","rating":1192.3167969426,"_hash":3794347985,"paid_only":false,"cont_title":"第 187 场周赛","cont_title_slug":"weekly-contest-187"},{"question_id":2810,"title":"故障键盘","title_slug":"faulty-keyboard","rating":1192.9770230345,"_hash":3177194252,"paid_only":false,"cont_title":"第 357 场周赛","cont_title_slug":"weekly-contest-357"},{"question_id":2418,"title":"按身高排序","title_slug":"sort-the-people","rating":1193.0585534828,"_hash":4022402413,"paid_only":false,"cont_title":"第 312 场周赛","cont_title_slug":"weekly-contest-312"},{"question_id":1528,"title":"重新排列字符串","title_slug":"shuffle-string","rating":1193.1328299324,"_hash":3940769236,"paid_only":false,"cont_title":"第 199 场周赛","cont_title_slug":"weekly-contest-199"},{"question_id":1437,"title":"是否所有 1 都至少相隔 k 个元素","title_slug":"check-if-all-1s-are-at-least-length-k-places-away","rating":1193.2687290573,"_hash":439231056,"paid_only":false,"cont_title":"第 187 场周赛","cont_title_slug":"weekly-contest-187"},{"question_id":1323,"title":"6 和 9 组成的最大数字","title_slug":"maximum-69-number","rating":1193.9819783429,"_hash":2988189921,"paid_only":false,"cont_title":"第 172 场周赛","cont_title_slug":"weekly-contest-172"},{"question_id":1207,"title":"独一无二的出现次数","title_slug":"unique-number-of-occurrences","rating":1195.7512695571,"_hash":3437227213,"paid_only":false,"cont_title":"第 156 场周赛","cont_title_slug":"weekly-contest-156"},{"question_id":2529,"title":"正整数和负整数的最大计数","title_slug":"maximum-count-of-positive-integer-and-negative-integer","rating":1195.9731842298,"_hash":770550829,"paid_only":false,"cont_title":"第 327 场周赛","cont_title_slug":"weekly-contest-327"},{"question_id":985,"title":"查询后的偶数和","title_slug":"sum-of-even-numbers-after-queries","rating":1198.4180401014,"_hash":2841881996,"paid_only":false,"cont_title":"第 122 场周赛","cont_title_slug":"weekly-contest-122"},{"question_id":1200,"title":"最小绝对差","title_slug":"minimum-absolute-difference","rating":1198.5705825982,"_hash":2380816309,"paid_only":false,"cont_title":"第 155 场周赛","cont_title_slug":"weekly-contest-155"},{"question_id":2678,"title":"老人的数目","title_slug":"number-of-senior-citizens","rating":1198.8420836551,"_hash":881741713,"paid_only":false,"cont_title":"第 104 场双周赛","cont_title_slug":"biweekly-contest-104"},{"question_id":1165,"title":"单行键盘","title_slug":"single-row-keyboard","rating":1199.2392672964,"_hash":3054721758,"paid_only":false,"cont_title":"第 7 场双周赛","cont_title_slug":"biweekly-contest-7"},{"question_id":929,"title":"独特的电子邮件地址","title_slug":"unique-email-addresses","rating":1199.2892732505,"_hash":3531395010,"paid_only":false,"cont_title":"第 108 场周赛","cont_title_slug":"weekly-contest-108"},{"question_id":1154,"title":"一年中的第几天","title_slug":"day-of-the-year","rating":1199.4427635582,"_hash":694594451,"paid_only":false,"cont_title":"第 149 场周赛","cont_title_slug":"weekly-contest-149"},{"question_id":2000,"title":"反转单词前缀","title_slug":"reverse-prefix-of-word","rating":1199.4477805501,"_hash":3147357769,"paid_only":false,"cont_title":"第 258 场周赛","cont_title_slug":"weekly-contest-258"},{"question_id":2169,"title":"得到 0 的操作数","title_slug":"count-operations-to-obtain-zero","rating":1199.8592887103,"_hash":3445184694,"paid_only":false,"cont_title":"第 280 场周赛","cont_title_slug":"weekly-contest-280"},{"question_id":2319,"title":"判断矩阵是否是一个 X 矩阵","title_slug":"check-if-matrix-is-x-matrix","rating":1200.9464053417,"_hash":3722557865,"paid_only":false,"cont_title":"第 299 场周赛","cont_title_slug":"weekly-contest-299"},{"question_id":1491,"title":"去掉最低工资和最高工资后的工资平均值","title_slug":"average-salary-excluding-the-minimum-and-maximum-salary","rating":1201.3497763919,"_hash":4253187558,"paid_only":false,"cont_title":"第 29 场双周赛","cont_title_slug":"biweekly-contest-29"},{"question_id":997,"title":"找到小镇的法官","title_slug":"find-the-town-judge","rating":1201.6117337798,"_hash":588772553,"paid_only":false,"cont_title":"第 125 场周赛","cont_title_slug":"weekly-contest-125"},{"question_id":2124,"title":"检查是否所有 A 都在 B 之前","title_slug":"check-if-all-as-appears-before-all-bs","rating":1201.7686271329,"_hash":2946534771,"paid_only":false,"cont_title":"第 274 场周赛","cont_title_slug":"weekly-contest-274"},{"question_id":2148,"title":"元素计数","title_slug":"count-elements-with-strictly-smaller-and-greater-elements","rating":1201.8730954169,"_hash":1449021558,"paid_only":false,"cont_title":"第 277 场周赛","cont_title_slug":"weekly-contest-277"},{"question_id":2367,"title":"算术三元组的数目","title_slug":"number-of-arithmetic-triplets","rating":1203.0737869081,"_hash":2088822497,"paid_only":false,"cont_title":"第 305 场周赛","cont_title_slug":"weekly-contest-305"},{"question_id":1688,"title":"比赛中的配对次数","title_slug":"count-of-matches-in-tournament","rating":1203.1408035909,"_hash":4026864126,"paid_only":false,"cont_title":"第 219 场周赛","cont_title_slug":"weekly-contest-219"},{"question_id":1952,"title":"三除数","title_slug":"three-divisors","rating":1203.7504950404,"_hash":324872429,"paid_only":false,"cont_title":"第 252 场周赛","cont_title_slug":"weekly-contest-252"},{"question_id":1869,"title":"哪种连续子字符串更长","title_slug":"longer-contiguous-segments-of-ones-than-zeros","rating":1204.9864820183,"_hash":4125612782,"paid_only":false,"cont_title":"第 242 场周赛","cont_title_slug":"weekly-contest-242"},{"question_id":1160,"title":"拼写单词","title_slug":"find-words-that-can-be-formed-by-characters","rating":1205.6698455508,"_hash":3021409572,"paid_only":false,"cont_title":"第 150 场周赛","cont_title_slug":"weekly-contest-150"},{"question_id":2574,"title":"左右元素和的差值","title_slug":"left-and-right-sum-differences","rating":1206.0712568518,"_hash":95938088,"paid_only":false,"cont_title":"第 334 场周赛","cont_title_slug":"weekly-contest-334"},{"question_id":1784,"title":"检查二进制字符串字段","title_slug":"check-if-binary-string-has-at-most-one-segment-of-ones","rating":1206.1240971343,"_hash":3988446663,"paid_only":false,"cont_title":"第 231 场周赛","cont_title_slug":"weekly-contest-231"},{"question_id":2595,"title":"奇偶位数","title_slug":"number-of-even-and-odd-bits","rating":1206.5675296817,"_hash":223285376,"paid_only":false,"cont_title":"第 337 场周赛","cont_title_slug":"weekly-contest-337"},{"question_id":2485,"title":"找出中枢整数","title_slug":"find-the-pivot-integer","rating":1207.3151378208,"_hash":2384194086,"paid_only":false,"cont_title":"第 321 场周赛","cont_title_slug":"weekly-contest-321"},{"question_id":1704,"title":"判断字符串的两半是否相似","title_slug":"determine-if-string-halves-are-alike","rating":1207.7224406285,"_hash":611100168,"paid_only":false,"cont_title":"第 221 场周赛","cont_title_slug":"weekly-contest-221"},{"question_id":2215,"title":"找出两数组的不同","title_slug":"find-the-difference-of-two-arrays","rating":1207.748239075,"_hash":1409344146,"paid_only":false,"cont_title":"第 286 场周赛","cont_title_slug":"weekly-contest-286"},{"question_id":2706,"title":"购买两块巧克力","title_slug":"buy-two-chocolates","rating":1207.7491943483,"_hash":2844316244,"paid_only":false,"cont_title":"第 105 场双周赛","cont_title_slug":"biweekly-contest-105"},{"question_id":1380,"title":"矩阵中的幸运数","title_slug":"lucky-numbers-in-a-matrix","rating":1207.7810914125,"_hash":2306188300,"paid_only":false,"cont_title":"第 180 场周赛","cont_title_slug":"weekly-contest-180"},{"question_id":941,"title":"有效的山脉数组","title_slug":"valid-mountain-array","rating":1208.0130656905,"_hash":4212893423,"paid_only":false,"cont_title":"第 111 场周赛","cont_title_slug":"weekly-contest-111"},{"question_id":1389,"title":"按既定顺序创建目标数组","title_slug":"create-target-array-in-the-given-order","rating":1208.0417047337,"_hash":1969742700,"paid_only":false,"cont_title":"第 181 场周赛","cont_title_slug":"weekly-contest-181"},{"question_id":1523,"title":"在区间范围内统计奇数数目","title_slug":"count-odd-numbers-in-an-interval-range","rating":1209.3722198224,"_hash":1294188975,"paid_only":false,"cont_title":"第 31 场双周赛","cont_title_slug":"biweekly-contest-31"},{"question_id":1822,"title":"数组元素积的符号","title_slug":"sign-of-the-product-of-an-array","rating":1209.6571020247,"_hash":428851356,"paid_only":false,"cont_title":"第 236 场周赛","cont_title_slug":"weekly-contest-236"},{"question_id":1413,"title":"逐步求和得到正数的最小值","title_slug":"minimum-value-to-get-positive-step-by-step-sum","rating":1212.2309421538,"_hash":3593932314,"paid_only":false,"cont_title":"第 24 场双周赛","cont_title_slug":"biweekly-contest-24"},{"question_id":1475,"title":"商品折扣后的最终价格","title_slug":"final-prices-with-a-special-discount-in-a-shop","rating":1212.2606422181,"_hash":3670047480,"paid_only":false,"cont_title":"第 28 场双周赛","cont_title_slug":"biweekly-contest-28"},{"question_id":2656,"title":"K 个元素的最大和","title_slug":"maximum-sum-with-exactly-k-elements","rating":1213.4070467355,"_hash":2193040547,"paid_only":false,"cont_title":"第 103 场双周赛","cont_title_slug":"biweekly-contest-103"},{"question_id":973,"title":"最接近原点的 K 个点","title_slug":"k-closest-points-to-origin","rating":1213.8073621345,"_hash":4289106415,"paid_only":false,"cont_title":"第 119 场周赛","cont_title_slug":"weekly-contest-119"},{"question_id":2956,"title":"找到两个数组中的公共元素","title_slug":"find-common-elements-between-two-arrays","rating":1214.542864891,"_hash":1894806233,"paid_only":false,"cont_title":"第 119 场双周赛","cont_title_slug":"biweekly-contest-119"},{"question_id":2806,"title":"取整购买后的账户余额","title_slug":"account-balance-after-rounded-purchase","rating":1214.703724776,"_hash":2948030094,"paid_only":false,"cont_title":"第 110 场双周赛","cont_title_slug":"biweekly-contest-110"},{"question_id":2108,"title":"找出数组中的第一个回文字符串","title_slug":"find-first-palindromic-string-in-the-array","rating":1215.7443346869,"_hash":770308924,"paid_only":false,"cont_title":"第 272 场周赛","cont_title_slug":"weekly-contest-272"},{"question_id":2176,"title":"统计数组中相等且可以被整除的数对","title_slug":"count-equal-and-divisible-pairs-in-an-array","rating":1215.7827321325,"_hash":3400286463,"paid_only":false,"cont_title":"第 72 场双周赛","cont_title_slug":"biweekly-contest-72"},{"question_id":2553,"title":"分割数组中数字的数位","title_slug":"separate-the-digits-in-an-array","rating":1216.612918849,"_hash":1493116499,"paid_only":false,"cont_title":"第 97 场双周赛","cont_title_slug":"biweekly-contest-97"},{"question_id":1848,"title":"到目标元素的最小距离","title_slug":"minimum-distance-to-the-target-element","rating":1216.6376846517,"_hash":933877486,"paid_only":false,"cont_title":"第 239 场周赛","cont_title_slug":"weekly-contest-239"},{"question_id":3005,"title":"最大频率元素计数","title_slug":"count-elements-with-maximum-frequency","rating":1216.9550221615,"_hash":2937149161,"paid_only":false,"cont_title":"第 380 场周赛","cont_title_slug":"weekly-contest-380"},{"question_id":1662,"title":"检查两个字符串数组是否相等","title_slug":"check-if-two-string-arrays-are-equivalent","rating":1217.1184374247,"_hash":340499017,"paid_only":false,"cont_title":"第 216 场周赛","cont_title_slug":"weekly-contest-216"},{"question_id":2859,"title":"计算 K 置位下标对应元素的和","title_slug":"sum-of-values-at-indices-with-k-set-bits","rating":1218.1083231462,"_hash":787489678,"paid_only":false,"cont_title":"第 363 场周赛","cont_title_slug":"weekly-contest-363"},{"question_id":2442,"title":"反转之后不同整数的数目","title_slug":"count-number-of-distinct-integers-after-reverse-operations","rating":1218.9011436003,"_hash":2907477166,"paid_only":false,"cont_title":"第 315 场周赛","cont_title_slug":"weekly-contest-315"},{"question_id":1299,"title":"将每个元素替换为右侧最大元素","title_slug":"replace-elements-with-greatest-element-on-right-side","rating":1219.4252907184,"_hash":4131453232,"paid_only":false,"cont_title":"第 16 场双周赛","cont_title_slug":"biweekly-contest-16"},{"question_id":1221,"title":"分割平衡字符串","title_slug":"split-a-string-in-balanced-strings","rating":1219.5284561367,"_hash":74188793,"paid_only":false,"cont_title":"第 158 场周赛","cont_title_slug":"weekly-contest-158"},{"question_id":1550,"title":"存在连续三个奇数的数组","title_slug":"three-consecutive-odds","rating":1221.6801628274,"_hash":3686317773,"paid_only":false,"cont_title":"第 202 场周赛","cont_title_slug":"weekly-contest-202"},{"question_id":2414,"title":"最长的字母序连续子字符串的长度","title_slug":"length-of-the-longest-alphabetical-continuous-substring","rating":1221.8477681772,"_hash":3354310865,"paid_only":false,"cont_title":"第 311 场周赛","cont_title_slug":"weekly-contest-311"},{"question_id":1678,"title":"设计 Goal 解析器","title_slug":"goal-parser-interpretation","rating":1221.9872943569,"_hash":4227366527,"paid_only":false,"cont_title":"第 218 场周赛","cont_title_slug":"weekly-contest-218"},{"question_id":2535,"title":"数组元素和与数字和的绝对差","title_slug":"difference-between-element-sum-and-digit-sum-of-an-array","rating":1222.2354919459,"_hash":1732202044,"paid_only":false,"cont_title":"第 328 场周赛","cont_title_slug":"weekly-contest-328"},{"question_id":1408,"title":"数组中的字符串匹配","title_slug":"string-matching-in-an-array","rating":1223.3861903833,"_hash":2154696316,"paid_only":false,"cont_title":"第 184 场周赛","cont_title_slug":"weekly-contest-184"},{"question_id":2206,"title":"将数组划分成相等数对","title_slug":"divide-array-into-equal-pairs","rating":1223.406570396,"_hash":523951328,"paid_only":false,"cont_title":"第 74 场双周赛","cont_title_slug":"biweekly-contest-74"},{"question_id":2460,"title":"对数组执行操作","title_slug":"apply-operations-to-an-array","rating":1223.9335618833,"_hash":389978318,"paid_only":false,"cont_title":"第 318 场周赛","cont_title_slug":"weekly-contest-318"},{"question_id":1337,"title":"矩阵中战斗力最弱的 K 行","title_slug":"the-k-weakest-rows-in-a-matrix","rating":1224.7606792444,"_hash":1486913577,"paid_only":false,"cont_title":"第 174 场周赛","cont_title_slug":"weekly-contest-174"},{"question_id":1346,"title":"检查整数及其两倍数是否存在","title_slug":"check-if-n-and-its-double-exist","rating":1225.3601348675,"_hash":174306863,"paid_only":false,"cont_title":"第 175 场周赛","cont_title_slug":"weekly-contest-175"},{"question_id":2357,"title":"使数组中所有元素都等于零","title_slug":"make-array-zero-by-subtracting-equal-amounts","rating":1225.3923012413,"_hash":1650421130,"paid_only":false,"cont_title":"第 304 场周赛","cont_title_slug":"weekly-contest-304"},{"question_id":1133,"title":"最大唯一数","title_slug":"largest-unique-number","rating":1226.2960135431,"_hash":3008054233,"paid_only":false,"cont_title":"第 5 场双周赛","cont_title_slug":"biweekly-contest-5"},{"question_id":1935,"title":"可以输入的最大单词数","title_slug":"maximum-number-of-words-you-can-type","rating":1226.8332278145,"_hash":3926884655,"paid_only":false,"cont_title":"第 250 场周赛","cont_title_slug":"weekly-contest-250"},{"question_id":1118,"title":"一月有多少天","title_slug":"number-of-days-in-a-month","rating":1227.3485530532,"_hash":3564822043,"paid_only":false,"cont_title":"第 4 场双周赛","cont_title_slug":"biweekly-contest-4"},{"question_id":844,"title":"比较含退格的字符串","title_slug":"backspace-string-compare","rating":1227.7906887239,"_hash":941716720,"paid_only":false,"cont_title":"第 87 场周赛","cont_title_slug":"weekly-contest-87"},{"question_id":2729,"title":"判断一个数是否迷人","title_slug":"check-if-the-number-is-fascinating","rating":1227.91037348,"_hash":3509092584,"paid_only":false,"cont_title":"第 106 场双周赛","cont_title_slug":"biweekly-contest-106"},{"question_id":1748,"title":"唯一元素的和","title_slug":"sum-of-unique-elements","rating":1228.4824438011,"_hash":1179475752,"paid_only":false,"cont_title":"第 45 场双周赛","cont_title_slug":"biweekly-contest-45"},{"question_id":917,"title":"仅仅反转字母","title_slug":"reverse-only-letters","rating":1228.630993648,"_hash":2941821802,"paid_only":false,"cont_title":"第 105 场周赛","cont_title_slug":"weekly-contest-105"},{"question_id":1800,"title":"最大升序子数组和","title_slug":"maximum-ascending-subarray-sum","rating":1229.1709574783,"_hash":165157096,"paid_only":false,"cont_title":"第 233 场周赛","cont_title_slug":"weekly-contest-233"},{"question_id":1725,"title":"可以形成最大正方形的矩形数目","title_slug":"number-of-rectangles-that-can-form-the-largest-square","rating":1229.4850365142,"_hash":2365828386,"paid_only":false,"cont_title":"第 224 场周赛","cont_title_slug":"weekly-contest-224"},{"question_id":2848,"title":"与车相交的点","title_slug":"points-that-intersect-with-cars","rating":1229.7575626899,"_hash":1241705093,"paid_only":false,"cont_title":"第 362 场周赛","cont_title_slug":"weekly-contest-362"},{"question_id":1134,"title":"阿姆斯特朗数","title_slug":"armstrong-number","rating":1231.4004525633,"_hash":391342400,"paid_only":false,"cont_title":"第 5 场双周赛","cont_title_slug":"biweekly-contest-5"},{"question_id":876,"title":"链表的中间结点","title_slug":"middle-of-the-linked-list","rating":1231.6157956848,"_hash":2188606245,"paid_only":false,"cont_title":"第 95 场周赛","cont_title_slug":"weekly-contest-95"},{"question_id":1967,"title":"作为子字符串出现在单词中的字符串数目","title_slug":"number-of-strings-that-appear-as-substrings-in-word","rating":1231.8671440198,"_hash":3091785544,"paid_only":false,"cont_title":"第 254 场周赛","cont_title_slug":"weekly-contest-254"},{"question_id":1492,"title":"n 的第 k 个因子","title_slug":"the-kth-factor-of-n","rating":1231.999241335,"_hash":2168825861,"paid_only":false,"cont_title":"第 29 场双周赛","cont_title_slug":"biweekly-contest-29"},{"question_id":1119,"title":"删去字符串中的元音","title_slug":"remove-vowels-from-a-string","rating":1232.8314427996,"_hash":1547394567,"paid_only":false,"cont_title":"第 4 场双周赛","cont_title_slug":"biweekly-contest-4"},{"question_id":2980,"title":"检查按位或是否存在尾随零","title_slug":"check-if-bitwise-or-has-trailing-zeros","rating":1233.5034839998,"_hash":2184297331,"paid_only":false,"cont_title":"第 378 场周赛","cont_title_slug":"weekly-contest-378"},{"question_id":1961,"title":"检查字符串是否为数组前缀","title_slug":"check-if-string-is-a-prefix-of-array","rating":1234.058537565,"_hash":32848909,"paid_only":false,"cont_title":"第 253 场周赛","cont_title_slug":"weekly-contest-253"},{"question_id":1184,"title":"公交站间的距离","title_slug":"distance-between-bus-stops","rating":1234.4144116814,"_hash":1149087220,"paid_only":false,"cont_title":"第 153 场周赛","cont_title_slug":"weekly-contest-153"},{"question_id":1009,"title":"十进制整数的反码","title_slug":"complement-of-base-10-integer","rating":1234.7084656358,"_hash":2765939834,"paid_only":false,"cont_title":"第 128 场周赛","cont_title_slug":"weekly-contest-128"},{"question_id":989,"title":"数组形式的整数加法","title_slug":"add-to-array-form-of-integer","rating":1234.7692637513,"_hash":2582233376,"paid_only":false,"cont_title":"第 123 场周赛","cont_title_slug":"weekly-contest-123"},{"question_id":1385,"title":"两个数组间的距离值","title_slug":"find-the-distance-value-between-two-arrays","rating":1234.8049089605,"_hash":3833659931,"paid_only":false,"cont_title":"第 22 场双周赛","cont_title_slug":"biweekly-contest-22"},{"question_id":1816,"title":"截断句子","title_slug":"truncate-sentence","rating":1235.6114196155,"_hash":1592995979,"paid_only":false,"cont_title":"第 235 场周赛","cont_title_slug":"weekly-contest-235"},{"question_id":2923,"title":"找到冠军 I","title_slug":"find-champion-i","rating":1235.6484230513,"_hash":3876397144,"paid_only":false,"cont_title":"第 370 场周赛","cont_title_slug":"weekly-contest-370"},{"question_id":2154,"title":"将找到的值乘以 2","title_slug":"keep-multiplying-found-values-by-two","rating":1235.8413685224,"_hash":103871786,"paid_only":false,"cont_title":"第 278 场周赛","cont_title_slug":"weekly-contest-278"},{"question_id":2149,"title":"按符号重排数组","title_slug":"rearrange-array-elements-by-sign","rating":1235.9216009709,"_hash":3029042062,"paid_only":false,"cont_title":"第 277 场周赛","cont_title_slug":"weekly-contest-277"},{"question_id":2864,"title":"最大二进制奇数","title_slug":"maximum-odd-binary-number","rating":1237.693464609,"_hash":3521652117,"paid_only":false,"cont_title":"第 364 场周赛","cont_title_slug":"weekly-contest-364"},{"question_id":1422,"title":"分割字符串的最大得分","title_slug":"maximum-score-after-splitting-a-string","rating":1237.7565585875,"_hash":3778856012,"paid_only":false,"cont_title":"第 186 场周赛","cont_title_slug":"weekly-contest-186"},{"question_id":2788,"title":"按分隔符拆分字符串","title_slug":"split-strings-by-separator","rating":1239.1621762681,"_hash":436025572,"paid_only":false,"cont_title":"第 355 场周赛","cont_title_slug":"weekly-contest-355"},{"question_id":2078,"title":"两栋颜色不同且距离最远的房子","title_slug":"two-furthest-houses-with-different-colors","rating":1240.829758176,"_hash":3119137809,"paid_only":false,"cont_title":"第 268 场周赛","cont_title_slug":"weekly-contest-268"},{"question_id":2293,"title":"极大极小游戏","title_slug":"min-max-game","rating":1241.0825147417,"_hash":399050701,"paid_only":false,"cont_title":"第 296 场周赛","cont_title_slug":"weekly-contest-296"},{"question_id":2299,"title":"强密码检验器 II","title_slug":"strong-password-checker-ii","rating":1241.5396695569,"_hash":2569057399,"paid_only":false,"cont_title":"第 80 场双周赛","cont_title_slug":"biweekly-contest-80"},{"question_id":2347,"title":"最好的扑克手牌","title_slug":"best-poker-hand","rating":1241.5645130241,"_hash":3960620247,"paid_only":false,"cont_title":"第 83 场双周赛","cont_title_slug":"biweekly-contest-83"},{"question_id":2605,"title":"从两个数字数组里生成最小数字","title_slug":"form-smallest-number-from-two-digit-arrays","rating":1241.5775825621,"_hash":1927271954,"paid_only":false,"cont_title":"第 101 场双周赛","cont_title_slug":"biweekly-contest-101"},{"question_id":1417,"title":"重新格式化字符串","title_slug":"reformat-the-string","rating":1241.9262857175,"_hash":3440205245,"paid_only":false,"cont_title":"第 185 场周赛","cont_title_slug":"weekly-contest-185"},{"question_id":921,"title":"使括号有效的最少添加","title_slug":"minimum-add-to-make-parentheses-valid","rating":1242.4710735813,"_hash":3288770916,"paid_only":false,"cont_title":"第 106 场周赛","cont_title_slug":"weekly-contest-106"},{"question_id":1941,"title":"检查是否所有字符出现次数相同","title_slug":"check-if-all-characters-have-equal-number-of-occurrences","rating":1242.6172898768,"_hash":2694237057,"paid_only":false,"cont_title":"第 57 场双周赛","cont_title_slug":"biweekly-contest-57"},{"question_id":2309,"title":"兼具大小写的最好英文字母","title_slug":"greatest-english-letter-in-upper-and-lower-case","rating":1242.8939284628,"_hash":1610031866,"paid_only":false,"cont_title":"第 298 场周赛","cont_title_slug":"weekly-contest-298"},{"question_id":2716,"title":"最小化字符串长度","title_slug":"minimize-string-length","rating":1242.9383307344,"_hash":2836390896,"paid_only":false,"cont_title":"第 348 场周赛","cont_title_slug":"weekly-contest-348"},{"question_id":832,"title":"翻转图像","title_slug":"flipping-an-image","rating":1243.1009943284,"_hash":715235362,"paid_only":false,"cont_title":"第 84 场周赛","cont_title_slug":"weekly-contest-84"},{"question_id":2399,"title":"检查相同字母间的距离","title_slug":"check-distances-between-same-letters","rating":1243.6250741657,"_hash":1515775640,"paid_only":false,"cont_title":"第 309 场周赛","cont_title_slug":"weekly-contest-309"},{"question_id":1228,"title":"等差数列中缺失的数字","title_slug":"missing-number-in-arithmetic-progression","rating":1244.317367883,"_hash":1225270682,"paid_only":false,"cont_title":"第 11 场双周赛","cont_title_slug":"biweekly-contest-11"},{"question_id":2965,"title":"找出缺失和重复的数字","title_slug":"find-missing-and-repeated-values","rating":1244.8064626533,"_hash":2875235685,"paid_only":false,"cont_title":"第 376 场周赛","cont_title_slug":"weekly-contest-376"},{"question_id":1099,"title":"小于 K 的两数之和","title_slug":"two-sum-less-than-k","rating":1245.2741257148,"_hash":1002673857,"paid_only":false,"cont_title":"第 3 场双周赛","cont_title_slug":"biweekly-contest-3"},{"question_id":1518,"title":"换水问题","title_slug":"water-bottles","rating":1245.2999833877,"_hash":2655862888,"paid_only":false,"cont_title":"第 198 场周赛","cont_title_slug":"weekly-contest-198"},{"question_id":2016,"title":"增量元素之间的最大差值","title_slug":"maximum-difference-between-increasing-elements","rating":1246.0141927368,"_hash":3044209556,"paid_only":false,"cont_title":"第 260 场周赛","cont_title_slug":"weekly-contest-260"},{"question_id":2481,"title":"分割圆的最少切割次数","title_slug":"minimum-cuts-to-divide-a-circle","rating":1246.0341186297,"_hash":2329981708,"paid_only":false,"cont_title":"第 92 场双周赛","cont_title_slug":"biweekly-contest-92"},{"question_id":2932,"title":"找出强数对的最大异或值 I","title_slug":"maximum-strong-pair-xor-i","rating":1246.3593898992,"_hash":3074518984,"paid_only":false,"cont_title":"第 371 场周赛","cont_title_slug":"weekly-contest-371"},{"question_id":1232,"title":"缀点成线","title_slug":"check-if-it-is-a-straight-line","rating":1247.3198836387,"_hash":4130908576,"paid_only":false,"cont_title":"第 159 场周赛","cont_title_slug":"weekly-contest-159"},{"question_id":1876,"title":"长度为三且各字符不同的子字符串","title_slug":"substrings-of-size-three-with-distinct-characters","rating":1248.7224675206,"_hash":2754546565,"paid_only":false,"cont_title":"第 53 场双周赛","cont_title_slug":"biweekly-contest-53"},{"question_id":1196,"title":"最多可以买到的苹果数量","title_slug":"how-many-apples-can-you-put-into-the-basket","rating":1248.8026990632,"_hash":3037047822,"paid_only":false,"cont_title":"第 9 场双周赛","cont_title_slug":"biweekly-contest-9"},{"question_id":1903,"title":"字符串中的最大奇数","title_slug":"largest-odd-number-in-string","rating":1248.8547072235,"_hash":946660529,"paid_only":false,"cont_title":"第 246 场周赛","cont_title_slug":"weekly-contest-246"},{"question_id":2279,"title":"装满石头的背包的最大数量","title_slug":"maximum-bags-with-full-capacity-of-rocks","rating":1249.2572200035,"_hash":2055099648,"paid_only":false,"cont_title":"第 294 场周赛","cont_title_slug":"weekly-contest-294"},{"question_id":2540,"title":"最小公共值","title_slug":"minimum-common-value","rating":1249.7515196656,"_hash":2913358439,"paid_only":false,"cont_title":"第 96 场双周赛","cont_title_slug":"biweekly-contest-96"},{"question_id":3000,"title":"对角线最长的矩形的面积","title_slug":"maximum-area-of-longest-diagonal-rectangle","rating":1249.7770522505,"_hash":1069078430,"paid_only":false,"cont_title":"第 379 场周赛","cont_title_slug":"weekly-contest-379"},{"question_id":2395,"title":"和相等的子数组","title_slug":"find-subarrays-with-equal-sum","rating":1249.8425270142,"_hash":2578600625,"paid_only":false,"cont_title":"第 86 场双周赛","cont_title_slug":"biweekly-contest-86"},{"question_id":1161,"title":"最大层内元素和","title_slug":"maximum-level-sum-of-a-binary-tree","rating":1249.9086403595,"_hash":1692861209,"paid_only":false,"cont_title":"第 150 场周赛","cont_title_slug":"weekly-contest-150"},{"question_id":1150,"title":"检查一个数是否在数组中占绝大多数","title_slug":"check-if-a-number-is-majority-element-in-a-sorted-array","rating":1249.9947800752,"_hash":1627868267,"paid_only":false,"cont_title":"第 6 场双周赛","cont_title_slug":"biweekly-contest-6"},{"question_id":2465,"title":"不同的平均值数目","title_slug":"number-of-distinct-averages","rating":1250.0975318308,"_hash":2621480860,"paid_only":false,"cont_title":"第 91 场双周赛","cont_title_slug":"biweekly-contest-91"},{"question_id":2315,"title":"统计星号","title_slug":"count-asterisks","rating":1250.8974254752,"_hash":963523596,"paid_only":false,"cont_title":"第 81 场双周赛","cont_title_slug":"biweekly-contest-81"},{"question_id":830,"title":"较大分组的位置","title_slug":"positions-of-large-groups","rating":1251.822378691,"_hash":836765096,"paid_only":false,"cont_title":"第 83 场周赛","cont_title_slug":"weekly-contest-83"},{"question_id":1833,"title":"雪糕的最大数量","title_slug":"maximum-ice-cream-bars","rating":1252.7479413966,"_hash":3346548045,"paid_only":false,"cont_title":"第 237 场周赛","cont_title_slug":"weekly-contest-237"},{"question_id":2164,"title":"对奇偶下标分别排序","title_slug":"sort-even-and-odd-indices-independently","rating":1252.8406166148,"_hash":618419204,"paid_only":false,"cont_title":"第 279 场周赛","cont_title_slug":"weekly-contest-279"},{"question_id":2186,"title":"制造字母异位词的最小步骤数 II","title_slug":"minimum-number-of-steps-to-make-two-strings-anagram-ii","rating":1253.1107481745,"_hash":1067400091,"paid_only":false,"cont_title":"第 282 场周赛","cont_title_slug":"weekly-contest-282"},{"question_id":2194,"title":"Excel 表中某个范围内的单元格","title_slug":"cells-in-a-range-on-an-excel-sheet","rating":1253.1463945043,"_hash":1475483634,"paid_only":false,"cont_title":"第 283 场周赛","cont_title_slug":"weekly-contest-283"},{"question_id":2283,"title":"判断一个数的数字计数是否等于数位的值","title_slug":"check-if-number-has-equal-digit-count-and-digit-value","rating":1253.4847783954,"_hash":84450131,"paid_only":false,"cont_title":"第 79 场双周赛","cont_title_slug":"biweekly-contest-79"},{"question_id":2908,"title":"元素和最小的山形三元组 I","title_slug":"minimum-sum-of-mountain-triplets-i","rating":1253.5161450678,"_hash":1377831845,"paid_only":false,"cont_title":"第 368 场周赛","cont_title_slug":"weekly-contest-368"},{"question_id":1945,"title":"字符串转化后的各位数字之和","title_slug":"sum-of-digits-of-string-after-convert","rating":1254.8626139269,"_hash":199553622,"paid_only":false,"cont_title":"第 251 场周赛","cont_title_slug":"weekly-contest-251"},{"question_id":2475,"title":"数组中不等三元组的数目","title_slug":"number-of-unequal-triplets-in-array","rating":1255.5461825223,"_hash":1497402060,"paid_only":false,"cont_title":"第 320 场周赛","cont_title_slug":"weekly-contest-320"},{"question_id":1037,"title":"有效的回旋镖","title_slug":"valid-boomerang","rating":1255.9002796024,"_hash":2272805308,"paid_only":false,"cont_title":"第 135 场周赛","cont_title_slug":"weekly-contest-135"},{"question_id":2239,"title":"找到最接近 0 的数字","title_slug":"find-closest-number-to-zero","rating":1256.0514740971,"_hash":334656901,"paid_only":false,"cont_title":"第 76 场双周赛","cont_title_slug":"biweekly-contest-76"},{"question_id":1085,"title":"最小元素各数位之和","title_slug":"sum-of-digits-in-the-minimum-number","rating":1256.4891142083,"_hash":800569224,"paid_only":false,"cont_title":"第 2 场双周赛","cont_title_slug":"biweekly-contest-2"},{"question_id":1732,"title":"找到最高海拔","title_slug":"find-the-highest-altitude","rating":1256.6807087287,"_hash":445458274,"paid_only":false,"cont_title":"第 44 场双周赛","cont_title_slug":"biweekly-contest-44"},{"question_id":2180,"title":"统计各位数字之和为偶数的整数个数","title_slug":"count-integers-with-even-digit-sum","rating":1257.1166915286,"_hash":267587420,"paid_only":false,"cont_title":"第 281 场周赛","cont_title_slug":"weekly-contest-281"},{"question_id":2177,"title":"找到和为给定整数的三个连续整数","title_slug":"find-three-consecutive-integers-that-sum-to-a-given-number","rating":1257.1556875655,"_hash":177009894,"paid_only":false,"cont_title":"第 72 场双周赛","cont_title_slug":"biweekly-contest-72"},{"question_id":2042,"title":"检查句子中的数字是否递增","title_slug":"check-if-numbers-are-ascending-in-a-sentence","rating":1257.264923599,"_hash":335486990,"paid_only":false,"cont_title":"第 263 场周赛","cont_title_slug":"weekly-contest-263"},{"question_id":2114,"title":"句子中的最多单词数","title_slug":"maximum-number-of-words-found-in-sentences","rating":1257.323514611,"_hash":3609197847,"paid_only":false,"cont_title":"第 68 场双周赛","cont_title_slug":"biweekly-contest-68"},{"question_id":1309,"title":"解码字母到整数映射","title_slug":"decrypt-string-from-alphabet-to-integer-mapping","rating":1257.679633165,"_hash":504472069,"paid_only":false,"cont_title":"第 170 场周赛","cont_title_slug":"weekly-contest-170"},{"question_id":1356,"title":"根据数字二进制下 1 的数目排序","title_slug":"sort-integers-by-the-number-of-1-bits","rating":1257.7082143289,"_hash":3189584402,"paid_only":false,"cont_title":"第 20 场双周赛","cont_title_slug":"biweekly-contest-20"},{"question_id":2103,"title":"环和杆","title_slug":"rings-and-rods","rating":1257.7670945029,"_hash":2821965653,"paid_only":false,"cont_title":"第 271 场周赛","cont_title_slug":"weekly-contest-271"},{"question_id":2644,"title":"找出可整除性得分最大的整数","title_slug":"find-the-maximum-divisibility-score","rating":1257.8344655358,"_hash":1766481102,"paid_only":false,"cont_title":"第 341 场周赛","cont_title_slug":"weekly-contest-341"},{"question_id":896,"title":"单调数列","title_slug":"monotonic-array","rating":1258.6719675401,"_hash":161597751,"paid_only":false,"cont_title":"第 100 场周赛","cont_title_slug":"weekly-contest-100"},{"question_id":867,"title":"转置矩阵","title_slug":"transpose-matrix","rating":1258.8401788462,"_hash":638561610,"paid_only":false,"cont_title":"第 92 场周赛","cont_title_slug":"weekly-contest-92"},{"question_id":1213,"title":"三个有序数组的交集","title_slug":"intersection-of-three-sorted-arrays","rating":1259.1979660519,"_hash":1167766424,"paid_only":false,"cont_title":"第 10 场双周赛","cont_title_slug":"biweekly-contest-10"},{"question_id":2404,"title":"出现最频繁的偶数元素","title_slug":"most-frequent-even-element","rating":1259.3406231708,"_hash":484484283,"paid_only":false,"cont_title":"第 310 场周赛","cont_title_slug":"weekly-contest-310"},{"question_id":884,"title":"两句话中的不常见单词","title_slug":"uncommon-words-from-two-sentences","rating":1259.409726189,"_hash":4093059486,"paid_only":false,"cont_title":"第 97 场周赛","cont_title_slug":"weekly-contest-97"},{"question_id":1779,"title":"找到最近的有相同 X 或 Y 坐标的点","title_slug":"find-nearest-point-that-has-the-same-x-or-y-coordinate","rating":1259.5707438932,"_hash":2844126076,"paid_only":false,"cont_title":"第 47 场双周赛","cont_title_slug":"biweekly-contest-47"},{"question_id":2562,"title":"找出数组的串联值","title_slug":"find-the-array-concatenation-value","rating":1259.949137745,"_hash":2036642817,"paid_only":false,"cont_title":"第 332 场周赛","cont_title_slug":"weekly-contest-332"},{"question_id":1305,"title":"两棵二叉搜索树中的所有元素","title_slug":"all-elements-in-two-binary-search-trees","rating":1260.1755576607,"_hash":3750933244,"paid_only":false,"cont_title":"第 169 场周赛","cont_title_slug":"weekly-contest-169"},{"question_id":2520,"title":"统计能整除数字的位数","title_slug":"count-the-digits-that-divide-a-number","rating":1260.8697515006,"_hash":2323533689,"paid_only":false,"cont_title":"第 326 场周赛","cont_title_slug":"weekly-contest-326"},{"question_id":2255,"title":"统计是给定字符串前缀的字符串数目","title_slug":"count-prefixes-of-a-given-string","rating":1260.870208308,"_hash":255204169,"paid_only":false,"cont_title":"第 77 场双周赛","cont_title_slug":"biweekly-contest-77"},{"question_id":2144,"title":"打折购买糖果的最小开销","title_slug":"minimum-cost-of-buying-candies-with-discount","rating":1260.9112824221,"_hash":1962595835,"paid_only":false,"cont_title":"第 70 场双周赛","cont_title_slug":"biweekly-contest-70"},{"question_id":2739,"title":"总行驶距离","title_slug":"total-distance-traveled","rating":1262.100652797,"_hash":2051273831,"paid_only":false,"cont_title":"第 350 场周赛","cont_title_slug":"weekly-contest-350"},{"question_id":1089,"title":"复写零","title_slug":"duplicate-zeros","rating":1262.5890311992,"_hash":1350925428,"paid_only":false,"cont_title":"第 141 场周赛","cont_title_slug":"weekly-contest-141"},{"question_id":2490,"title":"回环句","title_slug":"circular-sentence","rating":1262.938740364,"_hash":3558781406,"paid_only":false,"cont_title":"第 322 场周赛","cont_title_slug":"weekly-contest-322"},{"question_id":1456,"title":"定长子串中元音的最大数目","title_slug":"maximum-number-of-vowels-in-a-substring-of-given-length","rating":1263.2728668041,"_hash":3013367275,"paid_only":false,"cont_title":"第 190 场周赛","cont_title_slug":"weekly-contest-190"},{"question_id":2133,"title":"检查是否每一行每一列都包含全部整数","title_slug":"check-if-every-row-and-column-contains-all-numbers","rating":1264.2868345638,"_hash":3243872254,"paid_only":false,"cont_title":"第 275 场周赛","cont_title_slug":"weekly-contest-275"},{"question_id":2248,"title":"多个数组求交集","title_slug":"intersection-of-multiple-arrays","rating":1264.4778916192,"_hash":305518406,"paid_only":false,"cont_title":"第 290 场周赛","cont_title_slug":"weekly-contest-290"},{"question_id":1736,"title":"替换隐藏数字得到的最晚时间","title_slug":"latest-time-by-replacing-hidden-digits","rating":1264.4836883082,"_hash":4210364548,"paid_only":false,"cont_title":"第 225 场周赛","cont_title_slug":"weekly-contest-225"},{"question_id":2549,"title":"统计桌面上的不同数字","title_slug":"count-distinct-numbers-on-board","rating":1265.8320564115,"_hash":3023056451,"paid_only":false,"cont_title":"第 330 场周赛","cont_title_slug":"weekly-contest-330"},{"question_id":2200,"title":"找出数组中的所有 K 近邻下标","title_slug":"find-all-k-distant-indices-in-an-array","rating":1266.341468955,"_hash":2550811240,"paid_only":false,"cont_title":"第 284 场周赛","cont_title_slug":"weekly-contest-284"},{"question_id":2785,"title":"将字符串中的元音字母排序","title_slug":"sort-vowels-in-a-string","rating":1266.5014127879,"_hash":1174559962,"paid_only":false,"cont_title":"第 109 场双周赛","cont_title_slug":"biweekly-contest-109"},{"question_id":2670,"title":"找出不同元素数目差数组","title_slug":"find-the-distinct-difference-array","rating":1266.5231114343,"_hash":752241853,"paid_only":false,"cont_title":"第 344 场周赛","cont_title_slug":"weekly-contest-344"},{"question_id":2432,"title":"处理用时最长的那个任务的员工","title_slug":"the-employee-that-worked-on-the-longest-task","rating":1266.7001363197,"_hash":4113058721,"paid_only":false,"cont_title":"第 314 场周赛","cont_title_slug":"weekly-contest-314"},{"question_id":1282,"title":"用户分组","title_slug":"group-the-people-given-the-group-size-they-belong-to","rating":1267.223591366,"_hash":1393055239,"paid_only":false,"cont_title":"第 166 场周赛","cont_title_slug":"weekly-contest-166"},{"question_id":2325,"title":"解密消息","title_slug":"decode-the-message","rating":1268.0287696194,"_hash":280396343,"paid_only":false,"cont_title":"第 300 场周赛","cont_title_slug":"weekly-contest-300"},{"question_id":1447,"title":"最简分数","title_slug":"simplified-fractions","rating":1268.5768566953,"_hash":2797831681,"paid_only":false,"cont_title":"第 26 场双周赛","cont_title_slug":"biweekly-contest-26"},{"question_id":2032,"title":"至少在两个数组中出现的值","title_slug":"two-out-of-three","rating":1269.7567553523,"_hash":983129619,"paid_only":false,"cont_title":"第 262 场周赛","cont_title_slug":"weekly-contest-262"},{"question_id":2843,"title":"统计对称整数的数目","title_slug":"count-symmetric-integers","rating":1269.8118442786,"_hash":2681170798,"paid_only":false,"cont_title":"第 361 场周赛","cont_title_slug":"weekly-contest-361"},{"question_id":2873,"title":"有序三元组中的最大值 I","title_slug":"maximum-value-of-an-ordered-triplet-i","rating":1270.0775640451,"_hash":2386809488,"paid_only":false,"cont_title":"第 365 场周赛","cont_title_slug":"weekly-contest-365"},{"question_id":2363,"title":"合并相似的物品","title_slug":"merge-similar-items","rating":1270.6712381632,"_hash":556825118,"paid_only":false,"cont_title":"第 84 场双周赛","cont_title_slug":"biweekly-contest-84"},{"question_id":925,"title":"长按键入","title_slug":"long-pressed-name","rating":1271.3313760514,"_hash":101859828,"paid_only":false,"cont_title":"第 107 场周赛","cont_title_slug":"weekly-contest-107"},{"question_id":1556,"title":"千位分隔数","title_slug":"thousand-separator","rating":1271.3776510163,"_hash":1619143061,"paid_only":false,"cont_title":"第 33 场双周赛","cont_title_slug":"biweekly-contest-33"},{"question_id":2006,"title":"差的绝对值为 K 的数对数目","title_slug":"count-number-of-pairs-with-absolute-difference-k","rating":1271.7726574892,"_hash":911506733,"paid_only":false,"cont_title":"第 61 场双周赛","cont_title_slug":"biweekly-contest-61"},{"question_id":2869,"title":"收集元素的最少操作次数","title_slug":"minimum-operations-to-collect-elements","rating":1272.3340330895,"_hash":615729621,"paid_only":false,"cont_title":"第 114 场双周赛","cont_title_slug":"biweekly-contest-114"},{"question_id":2138,"title":"将字符串拆分为若干长度为 k 的组","title_slug":"divide-a-string-into-groups-of-size-k","rating":1273.046473797,"_hash":3830405744,"paid_only":false,"cont_title":"第 276 场周赛","cont_title_slug":"weekly-contest-276"},{"question_id":2068,"title":"检查两个字符串是否几乎相等","title_slug":"check-whether-two-strings-are-almost-equivalent","rating":1273.0588534723,"_hash":2469022748,"paid_only":false,"cont_title":"第 65 场双周赛","cont_title_slug":"biweekly-contest-65"},{"question_id":1005,"title":"K 次取反后最大化的数组和","title_slug":"maximize-sum-of-array-after-k-negations","rating":1274.6742564805,"_hash":3607948747,"paid_only":false,"cont_title":"第 127 场周赛","cont_title_slug":"weekly-contest-127"},{"question_id":1078,"title":"Bigram 分词","title_slug":"occurrences-after-bigram","rating":1274.7596170193,"_hash":2962478235,"paid_only":false,"cont_title":"第 140 场周赛","cont_title_slug":"weekly-contest-140"},{"question_id":2129,"title":"将标题首字母大写","title_slug":"capitalize-the-title","rating":1274.881752217,"_hash":4156461194,"paid_only":false,"cont_title":"第 69 场双周赛","cont_title_slug":"biweekly-contest-69"},{"question_id":2150,"title":"找出数组中的所有孤独数字","title_slug":"find-all-lonely-numbers-in-the-array","rating":1275.6108152653,"_hash":3672640831,"paid_only":false,"cont_title":"第 277 场周赛","cont_title_slug":"weekly-contest-277"},{"question_id":2558,"title":"从数量最多的堆取走礼物","title_slug":"take-gifts-from-the-richest-pile","rating":1276.7817742915,"_hash":1520385101,"paid_only":false,"cont_title":"第 331 场周赛","cont_title_slug":"weekly-contest-331"},{"question_id":1317,"title":"将整数转换为两个无零整数的和","title_slug":"convert-integer-to-the-sum-of-two-no-zero-integers","rating":1277.8260125315,"_hash":1863065807,"paid_only":false,"cont_title":"第 171 场周赛","cont_title_slug":"weekly-contest-171"},{"question_id":1742,"title":"盒子中小球的最大数量","title_slug":"maximum-number-of-balls-in-a-box","rating":1277.9987709491,"_hash":9262188,"paid_only":false,"cont_title":"第 226 场周赛","cont_title_slug":"weekly-contest-226"},{"question_id":2582,"title":"递枕头","title_slug":"pass-the-pillow","rating":1278.0092842613,"_hash":233297408,"paid_only":false,"cont_title":"第 335 场周赛","cont_title_slug":"weekly-contest-335"},{"question_id":2807,"title":"在链表中插入最大公约数","title_slug":"insert-greatest-common-divisors-in-linked-list","rating":1279.0301521682,"_hash":4225876243,"paid_only":false,"cont_title":"第 110 场双周赛","cont_title_slug":"biweekly-contest-110"},{"question_id":1534,"title":"统计好三元组","title_slug":"count-good-triplets","rating":1279.3383966145,"_hash":1278665216,"paid_only":false,"cont_title":"第 200 场周赛","cont_title_slug":"weekly-contest-200"},{"question_id":1002,"title":"查找共用字符","title_slug":"find-common-characters","rating":1279.7669712099,"_hash":1907819963,"paid_only":false,"cont_title":"第 126 场周赛","cont_title_slug":"weekly-contest-126"},{"question_id":2269,"title":"找到一个数字的 K 美丽值","title_slug":"find-the-k-beauty-of-a-number","rating":1279.7894769956,"_hash":2811209697,"paid_only":false,"cont_title":"第 78 场双周赛","cont_title_slug":"biweekly-contest-78"},{"question_id":2125,"title":"银行中的激光束数量","title_slug":"number-of-laser-beams-in-a-bank","rating":1280.2203734882,"_hash":1290173910,"paid_only":false,"cont_title":"第 274 场周赛","cont_title_slug":"weekly-contest-274"},{"question_id":1572,"title":"矩阵对角线元素的和","title_slug":"matrix-diagonal-sum","rating":1280.2941647587,"_hash":197546078,"paid_only":false,"cont_title":"第 34 场双周赛","cont_title_slug":"biweekly-contest-34"},{"question_id":2570,"title":"合并两个二维数组 - 求和法","title_slug":"merge-two-2d-arrays-by-summing-values","rating":1281.0889272532,"_hash":1168254316,"paid_only":false,"cont_title":"第 333 场周赛","cont_title_slug":"weekly-contest-333"},{"question_id":1624,"title":"两个相同字符之间的最长子字符串","title_slug":"largest-substring-between-two-equal-characters","rating":1281.9771427903,"_hash":2249355269,"paid_only":false,"cont_title":"第 211 场周赛","cont_title_slug":"weekly-contest-211"},{"question_id":2220,"title":"转换数字的最少位翻转次数","title_slug":"minimum-bit-flips-to-convert-number","rating":1282.1502428906,"_hash":3126153106,"paid_only":false,"cont_title":"第 75 场双周赛","cont_title_slug":"biweekly-contest-75"},{"question_id":2696,"title":"删除子串后的字符串最小长度","title_slug":"minimum-string-length-after-removing-substrings","rating":1282.3870247003,"_hash":4006408746,"paid_only":false,"cont_title":"第 346 场周赛","cont_title_slug":"weekly-contest-346"},{"question_id":1837,"title":"K 进制表示下的各位数字总和","title_slug":"sum-of-digits-in-base-k","rating":1282.4111853142,"_hash":2970227389,"paid_only":false,"cont_title":"第 238 场周赛","cont_title_slug":"weekly-contest-238"},{"question_id":2639,"title":"查询网格图中每一列的宽度","title_slug":"find-the-width-of-columns-of-a-grid","rating":1282.5186784876,"_hash":2007370712,"paid_only":false,"cont_title":"第 102 场双周赛","cont_title_slug":"biweekly-contest-102"},{"question_id":1252,"title":"奇数值单元格的数目","title_slug":"cells-with-odd-values-in-a-matrix","rating":1283.4980318021,"_hash":4235563666,"paid_only":false,"cont_title":"第 162 场周赛","cont_title_slug":"weekly-contest-162"},{"question_id":1507,"title":"转变日期格式","title_slug":"reformat-date","rating":1283.51021448,"_hash":143031678,"paid_only":false,"cont_title":"第 30 场双周赛","cont_title_slug":"biweekly-contest-30"},{"question_id":2303,"title":"计算应缴税款总额","title_slug":"calculate-amount-paid-in-taxes","rating":1283.6412252736,"_hash":4065089853,"paid_only":false,"cont_title":"第 297 场周赛","cont_title_slug":"weekly-contest-297"},{"question_id":1481,"title":"不同整数的最少数目","title_slug":"least-number-of-unique-integers-after-k-removals","rating":1284.3625733813,"_hash":970766553,"paid_only":false,"cont_title":"第 193 场周赛","cont_title_slug":"weekly-contest-193"},{"question_id":1720,"title":"解码异或后的数组","title_slug":"decode-xored-array","rating":1284.4514662456,"_hash":1123666202,"paid_only":false,"cont_title":"第 223 场周赛","cont_title_slug":"weekly-contest-223"},{"question_id":2839,"title":"判断通过操作能否让字符串相等 I","title_slug":"check-if-strings-can-be-made-equal-with-operations-i","rating":1285.1547123119,"_hash":1303459038,"paid_only":false,"cont_title":"第 112 场双周赛","cont_title_slug":"biweekly-contest-112"},{"question_id":860,"title":"柠檬水找零","title_slug":"lemonade-change","rating":1285.7282180721,"_hash":487789523,"paid_only":false,"cont_title":"第 91 场周赛","cont_title_slug":"weekly-contest-91"},{"question_id":1381,"title":"设计一个支持增量操作的栈","title_slug":"design-a-stack-with-increment-operation","rating":1285.9726675488,"_hash":3915832963,"paid_only":false,"cont_title":"第 180 场周赛","cont_title_slug":"weekly-contest-180"},{"question_id":1047,"title":"删除字符串中的所有相邻重复项","title_slug":"remove-all-adjacent-duplicates-in-string","rating":1286.3167937403,"_hash":2941915891,"paid_only":false,"cont_title":"第 137 场周赛","cont_title_slug":"weekly-contest-137"},{"question_id":2352,"title":"相等行列对","title_slug":"equal-row-and-column-pairs","rating":1286.3841359213,"_hash":80255331,"paid_only":false,"cont_title":"第 303 场周赛","cont_title_slug":"weekly-contest-303"},{"question_id":1791,"title":"找出星型图的中心节点","title_slug":"find-center-of-star-graph","rating":1286.7934718934,"_hash":2043678372,"paid_only":false,"cont_title":"第 232 场周赛","cont_title_slug":"weekly-contest-232"},{"question_id":1103,"title":"分糖果 II","title_slug":"distribute-candies-to-people","rating":1287.1053917452,"_hash":4294197536,"paid_only":false,"cont_title":"第 143 场周赛","cont_title_slug":"weekly-contest-143"},{"question_id":872,"title":"叶子相似的树","title_slug":"leaf-similar-trees","rating":1287.8970301681,"_hash":1479673533,"paid_only":false,"cont_title":"第 94 场周赛","cont_title_slug":"weekly-contest-94"},{"question_id":993,"title":"二叉树的堂兄弟节点","title_slug":"cousins-in-binary-tree","rating":1287.9002757199,"_hash":1715714434,"paid_only":false,"cont_title":"第 124 场周赛","cont_title_slug":"weekly-contest-124"},{"question_id":1403,"title":"非递增顺序的最小子序列","title_slug":"minimum-subsequence-in-non-increasing-order","rating":1288.1970048184,"_hash":3066842082,"paid_only":false,"cont_title":"第 183 场周赛","cont_title_slug":"weekly-contest-183"},{"question_id":1684,"title":"统计一致字符串的数目","title_slug":"count-the-number-of-consistent-strings","rating":1288.5621697906,"_hash":859530118,"paid_only":false,"cont_title":"第 41 场双周赛","cont_title_slug":"biweekly-contest-41"},{"question_id":2190,"title":"数组中紧跟 key 之后出现最频繁的数字","title_slug":"most-frequent-number-following-key-in-an-array","rating":1289.1912178611,"_hash":3999582587,"paid_only":false,"cont_title":"第 73 场双周赛","cont_title_slug":"biweekly-contest-73"},{"question_id":2428,"title":"沙漏的最大总和","title_slug":"maximum-sum-of-an-hourglass","rating":1289.945159062,"_hash":3528330030,"paid_only":false,"cont_title":"第 313 场周赛","cont_title_slug":"weekly-contest-313"},{"question_id":1859,"title":"将句子排序","title_slug":"sorting-the-sentence","rating":1290.0361853035,"_hash":1139062797,"paid_only":false,"cont_title":"第 52 场双周赛","cont_title_slug":"biweekly-contest-52"},{"question_id":3010,"title":"将数组分成最小总代价的子数组 I","title_slug":"divide-an-array-into-subarrays-with-minimum-cost-i","rating":1291.744935731,"_hash":1471696394,"paid_only":false,"cont_title":"第 122 场双周赛","cont_title_slug":"biweekly-contest-122"},{"question_id":2496,"title":"数组中字符串的最大值","title_slug":"maximum-value-of-a-string-in-an-array","rating":1292.8993325204,"_hash":3800630907,"paid_only":false,"cont_title":"第 93 场双周赛","cont_title_slug":"biweekly-contest-93"},{"question_id":1551,"title":"使数组中所有元素相等的最小操作数","title_slug":"minimum-operations-to-make-array-equal","rating":1293.4904281819,"_hash":3168618130,"paid_only":false,"cont_title":"第 202 场周赛","cont_title_slug":"weekly-contest-202"},{"question_id":2545,"title":"根据第 K 场考试的分数排序","title_slug":"sort-the-students-by-their-kth-score","rating":1294.0257382852,"_hash":2697040026,"paid_only":false,"cont_title":"第 329 场周赛","cont_title_slug":"weekly-contest-329"},{"question_id":2833,"title":"距离原点最远的点","title_slug":"furthest-point-from-origin","rating":1294.2819324126,"_hash":1908656857,"paid_only":false,"cont_title":"第 360 场周赛","cont_title_slug":"weekly-contest-360"},{"question_id":1716,"title":"计算力扣银行的钱","title_slug":"calculate-money-in-leetcode-bank","rating":1294.5297034757,"_hash":1482821287,"paid_only":false,"cont_title":"第 43 场双周赛","cont_title_slug":"biweekly-contest-43"},{"question_id":2273,"title":"移除字母异位词后的结果数组","title_slug":"find-resultant-array-after-removing-anagrams","rating":1294.5800368625,"_hash":3731391427,"paid_only":false,"cont_title":"第 293 场周赛","cont_title_slug":"weekly-contest-293"},{"question_id":1769,"title":"移动所有球到每个盒子所需的最小操作数","title_slug":"minimum-number-of-operations-to-move-all-balls-to-each-box","rating":1294.7724244077,"_hash":1900062857,"paid_only":false,"cont_title":"第 229 场周赛","cont_title_slug":"weekly-contest-229"},{"question_id":2815,"title":"数组中的最大数对和","title_slug":"max-pair-sum-in-an-array","rating":1295.0947625986,"_hash":3182582646,"paid_only":false,"cont_title":"第 358 场周赛","cont_title_slug":"weekly-contest-358"},{"question_id":1539,"title":"第 k 个缺失的正整数","title_slug":"kth-missing-positive-number","rating":1295.4970938463,"_hash":3184774485,"paid_only":false,"cont_title":"第 32 场双周赛","cont_title_slug":"biweekly-contest-32"},{"question_id":2717,"title":"半有序排列","title_slug":"semi-ordered-permutation","rating":1295.75504698,"_hash":1009976390,"paid_only":false,"cont_title":"第 348 场周赛","cont_title_slug":"weekly-contest-348"},{"question_id":2224,"title":"转化时间需要的最少操作数","title_slug":"minimum-number-of-operations-to-convert-time","rating":1295.8868965907,"_hash":1749795074,"paid_only":false,"cont_title":"第 287 场周赛","cont_title_slug":"weekly-contest-287"},{"question_id":1598,"title":"文件夹操作日志搜集器","title_slug":"crawler-log-folder","rating":1297.3006230632,"_hash":3772660335,"paid_only":false,"cont_title":"第 208 场周赛","cont_title_slug":"weekly-contest-208"},{"question_id":2913,"title":"子数组不同元素数目的平方和 I","title_slug":"subarrays-distinct-element-sum-of-squares-i","rating":1297.4179875409,"_hash":87115414,"paid_only":false,"cont_title":"第 116 场双周赛","cont_title_slug":"biweekly-contest-116"},{"question_id":908,"title":"最小差值 I","title_slug":"smallest-range-i","rating":1298.5921473119,"_hash":690261450,"paid_only":false,"cont_title":"第 103 场周赛","cont_title_slug":"weekly-contest-103"},{"question_id":953,"title":"验证外星语词典","title_slug":"verifying-an-alien-dictionary","rating":1299.6035132992,"_hash":3996759401,"paid_only":false,"cont_title":"第 114 场周赛","cont_title_slug":"weekly-contest-114"},{"question_id":2287,"title":"重排字符形成目标字符串","title_slug":"rearrange-characters-to-make-target-string","rating":1299.8393735643,"_hash":4027356240,"paid_only":false,"cont_title":"第 295 场周赛","cont_title_slug":"weekly-contest-295"},{"question_id":1790,"title":"仅执行一次字符串交换能否使两个字符串相等","title_slug":"check-if-one-string-swap-can-make-strings-equal","rating":1300.8009461582,"_hash":3412927472,"paid_only":false,"cont_title":"第 232 场周赛","cont_title_slug":"weekly-contest-232"},{"question_id":1844,"title":"将所有数字用字符替换","title_slug":"replace-all-digits-with-characters","rating":1300.9041426403,"_hash":315817700,"paid_only":false,"cont_title":"第 51 场双周赛","cont_title_slug":"biweekly-contest-51"},{"question_id":2748,"title":"美丽下标对的数目","title_slug":"number-of-beautiful-pairs","rating":1301.1576743638,"_hash":1182547848,"paid_only":false,"cont_title":"第 351 场周赛","cont_title_slug":"weekly-contest-351"},{"question_id":1877,"title":"数组中最大数对和的最小值","title_slug":"minimize-maximum-pair-sum-in-array","rating":1301.381757401,"_hash":1670099365,"paid_only":false,"cont_title":"第 53 场双周赛","cont_title_slug":"biweekly-contest-53"},{"question_id":1646,"title":"获取生成数组中的最大值","title_slug":"get-maximum-in-generated-array","rating":1301.4027057843,"_hash":3899459924,"paid_only":false,"cont_title":"第 214 场周赛","cont_title_slug":"weekly-contest-214"},{"question_id":2525,"title":"根据规则将箱子分类","title_slug":"categorize-box-according-to-criteria","rating":1301.4167433184,"_hash":1751494517,"paid_only":false,"cont_title":"第 95 场双周赛","cont_title_slug":"biweekly-contest-95"},{"question_id":2740,"title":"找出分区值","title_slug":"find-the-value-of-the-partition","rating":1301.9276849391,"_hash":1010937559,"paid_only":false,"cont_title":"第 350 场周赛","cont_title_slug":"weekly-contest-350"},{"question_id":2243,"title":"计算字符串的数字和","title_slug":"calculate-digit-sum-of-a-string","rating":1301.9432665133,"_hash":1615798591,"paid_only":false,"cont_title":"第 289 场周赛","cont_title_slug":"weekly-contest-289"},{"question_id":1991,"title":"找到数组的中间位置","title_slug":"find-the-middle-index-in-array","rating":1302.6469071738,"_hash":919200929,"paid_only":false,"cont_title":"第 60 场双周赛","cont_title_slug":"biweekly-contest-60"},{"question_id":1266,"title":"访问所有点的最小时间","title_slug":"minimum-time-visiting-all-points","rating":1302.7005460171,"_hash":2480987547,"paid_only":false,"cont_title":"第 164 场周赛","cont_title_slug":"weekly-contest-164"},{"question_id":1051,"title":"高度检查器","title_slug":"height-checker","rating":1303.0179795942,"_hash":479546084,"paid_only":false,"cont_title":"第 138 场周赛","cont_title_slug":"weekly-contest-138"},{"question_id":1338,"title":"数组大小减半","title_slug":"reduce-array-size-to-the-half","rating":1303.022570497,"_hash":1706598413,"paid_only":false,"cont_title":"第 174 场周赛","cont_title_slug":"weekly-contest-174"},{"question_id":2331,"title":"计算布尔二叉树的值","title_slug":"evaluate-boolean-binary-tree","rating":1303.5594588137,"_hash":586474794,"paid_only":false,"cont_title":"第 82 场双周赛","cont_title_slug":"biweekly-contest-82"},{"question_id":2697,"title":"字典序最小回文串","title_slug":"lexicographically-smallest-palindrome","rating":1303.7347742929,"_hash":3386255965,"paid_only":false,"cont_title":"第 346 场周赛","cont_title_slug":"weekly-contest-346"},{"question_id":2657,"title":"找到两个数组的前缀公共数组","title_slug":"find-the-prefix-common-array-of-two-arrays","rating":1304.1180812515,"_hash":917808097,"paid_only":false,"cont_title":"第 103 场双周赛","cont_title_slug":"biweekly-contest-103"},{"question_id":1984,"title":"学生分数的最小差值","title_slug":"minimum-difference-between-highest-and-lowest-of-k-scores","rating":1306.2821637677,"_hash":3183288856,"paid_only":false,"cont_title":"第 256 场周赛","cont_title_slug":"weekly-contest-256"},{"question_id":868,"title":"二进制间距","title_slug":"binary-gap","rating":1307.2991245272,"_hash":3658316549,"paid_only":false,"cont_title":"第 93 场周赛","cont_title_slug":"weekly-contest-93"},{"question_id":2022,"title":"将一维数组转变成二维数组","title_slug":"convert-1d-array-into-2d-array","rating":1307.3265298181,"_hash":289054660,"paid_only":false,"cont_title":"第 62 场双周赛","cont_title_slug":"biweekly-contest-62"},{"question_id":1893,"title":"检查是否区域内所有整数都被覆盖","title_slug":"check-if-all-the-integers-in-a-range-are-covered","rating":1307.3797385769,"_hash":457953007,"paid_only":false,"cont_title":"第 54 场双周赛","cont_title_slug":"biweekly-contest-54"},{"question_id":2085,"title":"统计出现过一次的公共字符串","title_slug":"count-common-words-with-one-occurrence","rating":1307.4608905199,"_hash":709012070,"paid_only":false,"cont_title":"第 66 场双周赛","cont_title_slug":"biweekly-contest-66"},{"question_id":1064,"title":"不动点","title_slug":"fixed-point","rating":1307.9800903088,"_hash":3920925170,"paid_only":false,"cont_title":"第 1 场双周赛","cont_title_slug":"biweekly-contest-1"},{"question_id":2264,"title":"字符串中最大的 3 位相同数字","title_slug":"largest-3-same-digit-number-in-string","rating":1308.948547975,"_hash":1507774284,"paid_only":false,"cont_title":"第 292 场周赛","cont_title_slug":"weekly-contest-292"},{"question_id":2342,"title":"数位和相等数对的最大和","title_slug":"max-sum-of-a-pair-with-equal-sum-of-digits","rating":1308.9617729374,"_hash":2147986859,"paid_only":false,"cont_title":"第 302 场周赛","cont_title_slug":"weekly-contest-302"},{"question_id":1897,"title":"重新分配字符使所有字符串都相等","title_slug":"redistribute-characters-to-make-all-strings-equal","rating":1309.1422268153,"_hash":1093275153,"paid_only":false,"cont_title":"第 245 场周赛","cont_title_slug":"weekly-contest-245"},{"question_id":1451,"title":"重新排列句子中的单词","title_slug":"rearrange-words-in-a-sentence","rating":1309.3113721825,"_hash":440206256,"paid_only":false,"cont_title":"第 189 场周赛","cont_title_slug":"weekly-contest-189"},{"question_id":2500,"title":"删除每行中的最大值","title_slug":"delete-greatest-value-in-each-row","rating":1309.7266159448,"_hash":1037331293,"paid_only":false,"cont_title":"第 323 场周赛","cont_title_slug":"weekly-contest-323"},{"question_id":1710,"title":"卡车上的最大单元数","title_slug":"maximum-units-on-a-truck","rating":1309.8100518373,"_hash":1405988519,"paid_only":false,"cont_title":"第 222 场周赛","cont_title_slug":"weekly-contest-222"},{"question_id":2058,"title":"找出临界点之间的最小和最大距离","title_slug":"find-the-minimum-and-maximum-number-of-nodes-between-critical-points","rating":1310.9129840277,"_hash":4024970253,"paid_only":false,"cont_title":"第 265 场周赛","cont_title_slug":"weekly-contest-265"},{"question_id":1021,"title":"删除最外层的括号","title_slug":"remove-outermost-parentheses","rating":1311.3495317884,"_hash":908082157,"paid_only":false,"cont_title":"第 131 场周赛","cont_title_slug":"weekly-contest-131"},{"question_id":2160,"title":"拆分数位后四位数字的最小和","title_slug":"minimum-sum-of-four-digit-number-after-splitting-digits","rating":1314.2912238536,"_hash":3696757985,"paid_only":false,"cont_title":"第 71 场双周赛","cont_title_slug":"biweekly-contest-71"},{"question_id":2640,"title":"一个数组所有前缀的分数","title_slug":"find-the-score-of-all-prefixes-of-an-array","rating":1314.3600610974,"_hash":1931269506,"paid_only":false,"cont_title":"第 102 场双周赛","cont_title_slug":"biweekly-contest-102"},{"question_id":1827,"title":"最少操作使数组递增","title_slug":"minimum-operations-to-make-the-array-increasing","rating":1314.8600143277,"_hash":191620507,"paid_only":false,"cont_title":"第 50 场双周赛","cont_title_slug":"biweekly-contest-50"},{"question_id":2109,"title":"向字符串添加空格","title_slug":"adding-spaces-to-a-string","rating":1315.1890809249,"_hash":807897834,"paid_only":false,"cont_title":"第 272 场周赛","cont_title_slug":"weekly-contest-272"},{"question_id":1629,"title":"按键持续时间最长的键","title_slug":"slowest-key","rating":1315.3715333947,"_hash":1481976566,"paid_only":false,"cont_title":"第 212 场周赛","cont_title_slug":"weekly-contest-212"},{"question_id":1180,"title":"统计只含单一字母的子串","title_slug":"count-substrings-with-only-one-distinct-letter","rating":1315.4085759361,"_hash":2844666696,"paid_only":false,"cont_title":"第 8 场双周赛","cont_title_slug":"biweekly-contest-8"},{"question_id":2348,"title":"全 0 子数组的数目","title_slug":"number-of-zero-filled-subarrays","rating":1315.8569286597,"_hash":1385231803,"paid_only":false,"cont_title":"第 83 场双周赛","cont_title_slug":"biweekly-contest-83"},{"question_id":2225,"title":"找出输掉零场或一场比赛的玩家","title_slug":"find-players-with-zero-or-one-losses","rating":1316.2046992429,"_hash":1737726232,"paid_only":false,"cont_title":"第 287 场周赛","cont_title_slug":"weekly-contest-287"},{"question_id":1343,"title":"大小为 K 且平均值大于等于阈值的子数组数目","title_slug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold","rating":1317.1729927899,"_hash":1376431756,"paid_only":false,"cont_title":"第 19 场双周赛","cont_title_slug":"biweekly-contest-19"},{"question_id":2221,"title":"数组的三角和","title_slug":"find-triangular-sum-of-an-array","rating":1317.2976846981,"_hash":1783870964,"paid_only":false,"cont_title":"第 75 场双周赛","cont_title_slug":"biweekly-contest-75"},{"question_id":1313,"title":"解压缩编码列表","title_slug":"decompress-run-length-encoded-list","rating":1317.4638832497,"_hash":2109320577,"paid_only":false,"cont_title":"第 17 场双周赛","cont_title_slug":"biweekly-contest-17"},{"question_id":2130,"title":"链表最大孪生和","title_slug":"maximum-twin-sum-of-a-linked-list","rating":1317.9207508583,"_hash":2161204569,"paid_only":false,"cont_title":"第 69 场双周赛","cont_title_slug":"biweekly-contest-69"},{"question_id":999,"title":"可以被一步捕获的棋子数","title_slug":"available-captures-for-rook","rating":1317.9521104466,"_hash":2274658324,"paid_only":false,"cont_title":"第 125 场周赛","cont_title_slug":"weekly-contest-125"},{"question_id":2079,"title":"给植物浇水","title_slug":"watering-plants","rating":1320.6485731562,"_hash":93344773,"paid_only":false,"cont_title":"第 268 场周赛","cont_title_slug":"weekly-contest-268"},{"question_id":1582,"title":"二进制矩阵中的特殊位置","title_slug":"special-positions-in-a-binary-matrix","rating":1321.2748903388,"_hash":3877437521,"paid_only":false,"cont_title":"第 206 场周赛","cont_title_slug":"weekly-contest-206"},{"question_id":1694,"title":"重新格式化电话号码","title_slug":"reformat-phone-number","rating":1321.9346201204,"_hash":117165936,"paid_only":false,"cont_title":"第 220 场周赛","cont_title_slug":"weekly-contest-220"},{"question_id":2446,"title":"判断两个事件是否存在冲突","title_slug":"determine-if-two-events-have-conflict","rating":1322.3886921778,"_hash":735587531,"paid_only":false,"cont_title":"第 316 场周赛","cont_title_slug":"weekly-contest-316"},{"question_id":1936,"title":"新增的最少台阶数","title_slug":"add-minimum-number-of-rungs","rating":1322.5926536743,"_hash":1249919767,"paid_only":false,"cont_title":"第 250 场周赛","cont_title_slug":"weekly-contest-250"},{"question_id":1614,"title":"括号的最大嵌套深度","title_slug":"maximum-nesting-depth-of-the-parentheses","rating":1322.8302750313,"_hash":2312427727,"paid_only":false,"cont_title":"第 210 场周赛","cont_title_slug":"weekly-contest-210"},{"question_id":2491,"title":"划分技能点相等的团队","title_slug":"divide-players-into-teams-of-equal-skill","rating":1323.1893756783,"_hash":3978864326,"paid_only":false,"cont_title":"第 322 场周赛","cont_title_slug":"weekly-contest-322"},{"question_id":1925,"title":"统计平方和三元组的数目","title_slug":"count-square-sum-triples","rating":1323.8236471852,"_hash":1728101846,"paid_only":false,"cont_title":"第 56 场双周赛","cont_title_slug":"biweekly-contest-56"},{"question_id":2660,"title":"保龄球游戏的获胜者","title_slug":"determine-the-winner-of-a-bowling-game","rating":1324.1714505166,"_hash":2355716390,"paid_only":false,"cont_title":"第 343 场周赛","cont_title_slug":"weekly-contest-343"},{"question_id":1603,"title":"设计停车系统","title_slug":"design-parking-system","rating":1324.1757200103,"_hash":2754272500,"paid_only":false,"cont_title":"第 36 场双周赛","cont_title_slug":"biweekly-contest-36"},{"question_id":3014,"title":"输入单词需要的最少按键次数 I","title_slug":"minimum-number-of-pushes-to-type-word-i","rating":1324.2140587436,"_hash":3012401904,"paid_only":false,"cont_title":"第 381 场周赛","cont_title_slug":"weekly-contest-381"},{"question_id":2095,"title":"删除链表的中间节点","title_slug":"delete-the-middle-node-of-a-linked-list","rating":1324.3520304377,"_hash":2982198446,"paid_only":false,"cont_title":"第 270 场周赛","cont_title_slug":"weekly-contest-270"},{"question_id":1752,"title":"检查数组是否经排序和轮转得到","title_slug":"check-if-array-is-sorted-and-rotated","rating":1324.5320836804,"_hash":2521310070,"paid_only":false,"cont_title":"第 227 场周赛","cont_title_slug":"weekly-contest-227"},{"question_id":1344,"title":"时钟指针的夹角","title_slug":"angle-between-hands-of-a-clock","rating":1324.5696223867,"_hash":41269413,"paid_only":false,"cont_title":"第 19 场双周赛","cont_title_slug":"biweekly-contest-19"},{"question_id":2073,"title":"买票需要的时间","title_slug":"time-needed-to-buy-tickets","rating":1325.3607218257,"_hash":1430651253,"paid_only":false,"cont_title":"第 267 场周赛","cont_title_slug":"weekly-contest-267"},{"question_id":1476,"title":"子矩形查询","title_slug":"subrectangle-queries","rating":1326.4047670018,"_hash":3615903863,"paid_only":false,"cont_title":"第 28 场双周赛","cont_title_slug":"biweekly-contest-28"},{"question_id":1086,"title":"前五科的均分","title_slug":"high-five","rating":1327.0282989915,"_hash":2018971200,"paid_only":false,"cont_title":"第 2 场双周赛","cont_title_slug":"biweekly-contest-2"},{"question_id":1812,"title":"判断国际象棋棋盘中一个格子的颜色","title_slug":"determine-color-of-a-chessboard-square","rating":1328.513147726,"_hash":3006434957,"paid_only":false,"cont_title":"第 49 场双周赛","cont_title_slug":"biweekly-contest-49"},{"question_id":2396,"title":"严格回文的数字","title_slug":"strictly-palindromic-number","rating":1328.5499677186,"_hash":111167904,"paid_only":false,"cont_title":"第 86 场双周赛","cont_title_slug":"biweekly-contest-86"},{"question_id":1324,"title":"竖直打印单词","title_slug":"print-words-vertically","rating":1328.7281033317,"_hash":2666352866,"paid_only":false,"cont_title":"第 172 场周赛","cont_title_slug":"weekly-contest-172"},{"question_id":1347,"title":"制造字母异位词的最小步骤数","title_slug":"minimum-number-of-steps-to-make-two-strings-anagram","rating":1330.918577828,"_hash":4265155310,"paid_only":false,"cont_title":"第 175 场周赛","cont_title_slug":"weekly-contest-175"},{"question_id":2373,"title":"矩阵中的局部最大值","title_slug":"largest-local-values-in-a-matrix","rating":1331.3935128035,"_hash":3553057842,"paid_only":false,"cont_title":"第 306 场周赛","cont_title_slug":"weekly-contest-306"},{"question_id":2259,"title":"移除指定数字得到的最大结果","title_slug":"remove-digit-from-number-to-maximize-result","rating":1331.5287857686,"_hash":670957801,"paid_only":false,"cont_title":"第 291 场周赛","cont_title_slug":"weekly-contest-291"},{"question_id":1471,"title":"数组中的 k 个最强值","title_slug":"the-k-strongest-values-in-an-array","rating":1332.4653491345,"_hash":1337689329,"paid_only":false,"cont_title":"第 192 场周赛","cont_title_slug":"weekly-contest-192"},{"question_id":2274,"title":"不含特殊楼层的最大连续楼层数","title_slug":"maximum-consecutive-floors-without-special-floors","rating":1332.6187879411,"_hash":3382549811,"paid_only":false,"cont_title":"第 293 场周赛","cont_title_slug":"weekly-contest-293"},{"question_id":1128,"title":"等价多米诺骨牌对的数量","title_slug":"number-of-equivalent-domino-pairs","rating":1332.622596763,"_hash":2262588000,"paid_only":false,"cont_title":"第 146 场周赛","cont_title_slug":"weekly-contest-146"},{"question_id":2679,"title":"矩阵中的和","title_slug":"sum-in-a-matrix","rating":1333.0179956774,"_hash":846898736,"paid_only":false,"cont_title":"第 104 场双周赛","cont_title_slug":"biweekly-contest-104"},{"question_id":2181,"title":"合并零之间的节点","title_slug":"merge-nodes-in-between-zeros","rating":1333.192050397,"_hash":1770113758,"paid_only":false,"cont_title":"第 281 场周赛","cont_title_slug":"weekly-contest-281"},{"question_id":2554,"title":"从一个范围内选择最多整数 I","title_slug":"maximum-number-of-integers-to-choose-from-a-range-i","rating":1333.2008827592,"_hash":220667062,"paid_only":false,"cont_title":"第 97 场双周赛","cont_title_slug":"biweekly-contest-97"},{"question_id":1805,"title":"字符串中不同整数的数目","title_slug":"number-of-different-integers-in-a-string","rating":1333.3138174157,"_hash":1970717834,"paid_only":false,"cont_title":"第 234 场周赛","cont_title_slug":"weekly-contest-234"},{"question_id":2270,"title":"分割数组的方案数","title_slug":"number-of-ways-to-split-array","rating":1334.0516779626,"_hash":3778209816,"paid_only":false,"cont_title":"第 78 场双周赛","cont_title_slug":"biweekly-contest-78"},{"question_id":888,"title":"公平的糖果交换","title_slug":"fair-candy-swap","rating":1334.0564009231,"_hash":1232284801,"paid_only":false,"cont_title":"第 98 场周赛","cont_title_slug":"weekly-contest-98"},{"question_id":2126,"title":"摧毁小行星","title_slug":"destroying-asteroids","rating":1334.5708444649,"_hash":2247018180,"paid_only":false,"cont_title":"第 274 场周赛","cont_title_slug":"weekly-contest-274"},{"question_id":1409,"title":"查询带键的排列","title_slug":"queries-on-a-permutation-with-key","rating":1334.5718985411,"_hash":1238400837,"paid_only":false,"cont_title":"第 184 场周赛","cont_title_slug":"weekly-contest-184"},{"question_id":938,"title":"二叉搜索树的范围和","title_slug":"range-sum-of-bst","rating":1335.0295688697,"_hash":2572143666,"paid_only":false,"cont_title":"第 110 场周赛","cont_title_slug":"weekly-contest-110"},{"question_id":2506,"title":"统计相似字符串对的数目","title_slug":"count-pairs-of-similar-strings","rating":1335.4613368501,"_hash":3891355877,"paid_only":false,"cont_title":"第 324 场周赛","cont_title_slug":"weekly-contest-324"},{"question_id":2587,"title":"重排数组以得到最大前缀分数","title_slug":"rearrange-array-to-maximize-prefix-score","rating":1336.7830451625,"_hash":922160489,"paid_only":false,"cont_title":"第 336 场周赛","cont_title_slug":"weekly-contest-336"},{"question_id":1275,"title":"找出井字棋的获胜者","title_slug":"find-winner-on-a-tic-tac-toe-game","rating":1336.9494482313,"_hash":2404871340,"paid_only":false,"cont_title":"第 165 场周赛","cont_title_slug":"weekly-contest-165"},{"question_id":1260,"title":"二维网格迁移","title_slug":"shift-2d-grid","rating":1337.3722299775,"_hash":2949409019,"paid_only":false,"cont_title":"第 163 场周赛","cont_title_slug":"weekly-contest-163"},{"question_id":2161,"title":"根据给定数字划分数组","title_slug":"partition-array-according-to-given-pivot","rating":1337.6115578703,"_hash":290394387,"paid_only":false,"cont_title":"第 71 场双周赛","cont_title_slug":"biweekly-contest-71"},{"question_id":933,"title":"最近的请求次数","title_slug":"number-of-recent-calls","rating":1337.8472367494,"_hash":181840890,"paid_only":false,"cont_title":"第 109 场周赛","cont_title_slug":"weekly-contest-109"},{"question_id":970,"title":"强整数","title_slug":"powerful-integers","rating":1338.8322315568,"_hash":3883411103,"paid_only":false,"cont_title":"第 118 场周赛","cont_title_slug":"weekly-contest-118"},{"question_id":976,"title":"三角形的最大周长","title_slug":"largest-perimeter-triangle","rating":1340.5559417151,"_hash":1665689312,"paid_only":false,"cont_title":"第 119 场周赛","cont_title_slug":"weekly-contest-119"},{"question_id":1399,"title":"统计最大组的数目","title_slug":"count-largest-group","rating":1341.0476642293,"_hash":1417435719,"paid_only":false,"cont_title":"第 23 场双周赛","cont_title_slug":"biweekly-contest-23"},{"question_id":859,"title":"亲密字符串","title_slug":"buddy-strings","rating":1341.2659819842,"_hash":2442045936,"paid_only":false,"cont_title":"第 90 场周赛","cont_title_slug":"weekly-contest-90"},{"question_id":2023,"title":"连接后等于目标字符串的字符串对","title_slug":"number-of-pairs-of-strings-with-concatenation-equal-to-target","rating":1341.3713970313,"_hash":4234423090,"paid_only":false,"cont_title":"第 62 场双周赛","cont_title_slug":"biweekly-contest-62"},{"question_id":1796,"title":"字符串中第二大的数字","title_slug":"second-largest-digit-in-a-string","rating":1341.8397242604,"_hash":750727980,"paid_only":false,"cont_title":"第 48 场双周赛","cont_title_slug":"biweekly-contest-48"},{"question_id":1395,"title":"统计作战单位数","title_slug":"count-number-of-teams","rating":1343.628913055,"_hash":824074855,"paid_only":false,"cont_title":"第 182 场周赛","cont_title_slug":"weekly-contest-182"},{"question_id":1544,"title":"整理字符串","title_slug":"make-the-string-great","rating":1344.226133202,"_hash":3183111073,"paid_only":false,"cont_title":"第 201 场周赛","cont_title_slug":"weekly-contest-201"},{"question_id":1679,"title":"K 和数对的最大数目","title_slug":"max-number-of-k-sum-pairs","rating":1345.737168609,"_hash":31900963,"paid_only":false,"cont_title":"第 218 场周赛","cont_title_slug":"weekly-contest-218"},{"question_id":2027,"title":"转换字符串的最少操作次数","title_slug":"minimum-moves-to-convert-string","rating":1346.3556309143,"_hash":1180837306,"paid_only":false,"cont_title":"第 261 场周赛","cont_title_slug":"weekly-contest-261"},{"question_id":2284,"title":"最多单词数的发件人","title_slug":"sender-with-largest-word-count","rating":1346.9594471871,"_hash":2321482871,"paid_only":false,"cont_title":"第 79 场双周赛","cont_title_slug":"biweekly-contest-79"},{"question_id":2829,"title":"k-avoiding 数组的最小总和","title_slug":"determine-the-minimum-sum-of-a-k-avoiding-array","rating":1347.2146542772,"_hash":1173419903,"paid_only":false,"cont_title":"第 359 场周赛","cont_title_slug":"weekly-contest-359"},{"question_id":2937,"title":"使三个字符串相等","title_slug":"make-three-strings-equal","rating":1347.5885281778,"_hash":2629528696,"paid_only":false,"cont_title":"第 372 场周赛","cont_title_slug":"weekly-contest-372"},{"question_id":2390,"title":"从字符串中移除星号","title_slug":"removing-stars-from-a-string","rating":1347.8521638635,"_hash":917372483,"paid_only":false,"cont_title":"第 308 场周赛","cont_title_slug":"weekly-contest-308"},{"question_id":1029,"title":"两地调度","title_slug":"two-city-scheduling","rating":1348.0079390256,"_hash":3535624008,"paid_only":false,"cont_title":"第 133 场周赛","cont_title_slug":"weekly-contest-133"},{"question_id":2609,"title":"最长平衡子字符串","title_slug":"find-the-longest-balanced-substring-of-a-binary-string","rating":1348.577010609,"_hash":1922249884,"paid_only":false,"cont_title":"第 339 场周赛","cont_title_slug":"weekly-contest-339"},{"question_id":1100,"title":"长度为 K 的无重复字符子串","title_slug":"find-k-length-substrings-with-no-repeated-characters","rating":1348.670191438,"_hash":3246372293,"paid_only":false,"cont_title":"第 3 场双周赛","cont_title_slug":"biweekly-contest-3"},{"question_id":2578,"title":"最小和分割","title_slug":"split-with-minimum-sum","rating":1350.5883729249,"_hash":1850921957,"paid_only":false,"cont_title":"第 99 场双周赛","cont_title_slug":"biweekly-contest-99"},{"question_id":2053,"title":"数组中第 K 个独一无二的字符串","title_slug":"kth-distinct-string-in-an-array","rating":1350.6048768377,"_hash":1322023785,"paid_only":false,"cont_title":"第 64 场双周赛","cont_title_slug":"biweekly-contest-64"},{"question_id":1513,"title":"仅含 1 的子串数","title_slug":"number-of-substrings-with-only-1s","rating":1351.4184681108,"_hash":2562103296,"paid_only":false,"cont_title":"第 197 场周赛","cont_title_slug":"weekly-contest-197"},{"question_id":2895,"title":"最小处理时间","title_slug":"minimum-processing-time","rating":1351.6909336495,"_hash":2835500769,"paid_only":false,"cont_title":"第 366 场周赛","cont_title_slug":"weekly-contest-366"},{"question_id":1995,"title":"统计特殊四元组","title_slug":"count-special-quadruplets","rating":1352.1791099256,"_hash":3750650671,"paid_only":false,"cont_title":"第 257 场周赛","cont_title_slug":"weekly-contest-257"},{"question_id":848,"title":"字母移位","title_slug":"shifting-letters","rating":1352.7250049956,"_hash":3410974541,"paid_only":false,"cont_title":"第 88 场周赛","cont_title_slug":"weekly-contest-88"},{"question_id":1758,"title":"生成交替二进制字符串的最少操作数","title_slug":"minimum-changes-to-make-alternating-binary-string","rating":1353.629677812,"_hash":877809104,"paid_only":false,"cont_title":"第 228 场周赛","cont_title_slug":"weekly-contest-228"},{"question_id":1244,"title":"力扣排行榜","title_slug":"design-a-leaderboard","rating":1354.1247827015,"_hash":2386103127,"paid_only":false,"cont_title":"第 12 场双周赛","cont_title_slug":"biweekly-contest-12"},{"question_id":2210,"title":"统计数组中峰和谷的数量","title_slug":"count-hills-and-valleys-in-an-array","rating":1354.5231125217,"_hash":2390584088,"paid_only":false,"cont_title":"第 285 场周赛","cont_title_slug":"weekly-contest-285"},{"question_id":1689,"title":"十-二进制数的最少数目","title_slug":"partitioning-into-minimum-number-of-deci-binary-numbers","rating":1355.3825442341,"_hash":2829216648,"paid_only":false,"cont_title":"第 219 场周赛","cont_title_slug":"weekly-contest-219"},{"question_id":2405,"title":"子字符串的最优划分","title_slug":"optimal-partition-of-string","rating":1355.3956434989,"_hash":569962978,"paid_only":false,"cont_title":"第 310 场周赛","cont_title_slug":"weekly-contest-310"},{"question_id":1894,"title":"找到需要补充粉笔的学生编号","title_slug":"find-the-student-that-will-replace-the-chalk","rating":1355.5386161215,"_hash":3347724858,"paid_only":false,"cont_title":"第 54 场双周赛","cont_title_slug":"biweekly-contest-54"},{"question_id":1331,"title":"数组序号转换","title_slug":"rank-transform-of-an-array","rating":1355.9817184778,"_hash":1713279396,"paid_only":false,"cont_title":"第 18 场双周赛","cont_title_slug":"biweekly-contest-18"},{"question_id":2043,"title":"简易银行系统","title_slug":"simple-bank-system","rating":1356.1920189231,"_hash":693474678,"paid_only":false,"cont_title":"第 263 场周赛","cont_title_slug":"weekly-contest-263"},{"question_id":2579,"title":"统计染色格子数","title_slug":"count-total-number-of-colored-cells","rating":1356.4450869217,"_hash":1180349312,"paid_only":false,"cont_title":"第 99 场双周赛","cont_title_slug":"biweekly-contest-99"},{"question_id":2037,"title":"使每位学生都有座位的最少移动次数","title_slug":"minimum-number-of-moves-to-seat-everyone","rating":1356.6925765299,"_hash":468110,"paid_only":false,"cont_title":"第 63 场双周赛","cont_title_slug":"biweekly-contest-63"},{"question_id":1957,"title":"删除字符使字符串变好","title_slug":"delete-characters-to-make-fancy-string","rating":1357.6553050616,"_hash":3153125580,"paid_only":false,"cont_title":"第 58 场双周赛","cont_title_slug":"biweekly-contest-58"},{"question_id":2090,"title":"半径为 k 的子数组平均值","title_slug":"k-radius-subarray-averages","rating":1358.152613403,"_hash":210217684,"paid_only":false,"cont_title":"第 269 场周赛","cont_title_slug":"weekly-contest-269"},{"question_id":2379,"title":"得到 K 个黑块的最少涂色次数","title_slug":"minimum-recolors-to-get-k-consecutive-black-blocks","rating":1360.0511262593,"_hash":2333659184,"paid_only":false,"cont_title":"第 85 场双周赛","cont_title_slug":"biweekly-contest-85"},{"question_id":1448,"title":"统计二叉树中好节点的数目","title_slug":"count-good-nodes-in-binary-tree","rating":1360.2184128413,"_hash":169616499,"paid_only":false,"cont_title":"第 26 场双周赛","cont_title_slug":"biweekly-contest-26"},{"question_id":1817,"title":"查找用户活跃分钟数","title_slug":"finding-the-users-active-minutes","rating":1360.3005775112,"_hash":3137406326,"paid_only":false,"cont_title":"第 235 场周赛","cont_title_slug":"weekly-contest-235"},{"question_id":2335,"title":"装满杯子需要的最短总时长","title_slug":"minimum-amount-of-time-to-fill-cups","rating":1360.421258727,"_hash":2855675520,"paid_only":false,"cont_title":"第 301 场周赛","cont_title_slug":"weekly-contest-301"},{"question_id":2165,"title":"重排数字的最小值","title_slug":"smallest-value-of-the-rearranged-number","rating":1361.5824742947,"_hash":2369389100,"paid_only":false,"cont_title":"第 279 场周赛","cont_title_slug":"weekly-contest-279"},{"question_id":1980,"title":"找出不同的二进制字符串","title_slug":"find-unique-binary-string","rating":1361.6459603518,"_hash":333667858,"paid_only":false,"cont_title":"第 255 场周赛","cont_title_slug":"weekly-contest-255"},{"question_id":1120,"title":"子树的最大平均值","title_slug":"maximum-average-subtree","rating":1361.8801013336,"_hash":1060291152,"paid_only":false,"cont_title":"第 4 场双周赛","cont_title_slug":"biweekly-contest-4"},{"question_id":1592,"title":"重新排列单词间的空格","title_slug":"rearrange-spaces-between-words","rating":1362.6613797387,"_hash":3611656717,"paid_only":false,"cont_title":"第 207 场周赛","cont_title_slug":"weekly-contest-207"},{"question_id":2486,"title":"追加字符以获得子序列","title_slug":"append-characters-to-string-to-make-subsequence","rating":1362.7144100401,"_hash":282802217,"paid_only":false,"cont_title":"第 321 场周赛","cont_title_slug":"weekly-contest-321"},{"question_id":1974,"title":"使用特殊打字机键入单词的最少时间","title_slug":"minimum-time-to-type-word-using-special-typewriter","rating":1364.154859918,"_hash":3014957498,"paid_only":false,"cont_title":"第 59 场双周赛","cont_title_slug":"biweekly-contest-59"},{"question_id":2260,"title":"必须拿起的最小连续卡牌数","title_slug":"minimum-consecutive-cards-to-pick-up","rating":1364.6787168645,"_hash":2520941920,"paid_only":false,"cont_title":"第 291 场周赛","cont_title_slug":"weekly-contest-291"},{"question_id":2231,"title":"按奇偶性交换后的最大数字","title_slug":"largest-number-after-digit-swaps-by-parity","rating":1365.2269076492,"_hash":2192706389,"paid_only":false,"cont_title":"第 288 场周赛","cont_title_slug":"weekly-contest-288"},{"question_id":2433,"title":"找出前缀异或的原始数组","title_slug":"find-the-original-array-of-prefix-xor","rating":1366.6789652398,"_hash":883396381,"paid_only":false,"cont_title":"第 314 场周赛","cont_title_slug":"weekly-contest-314"},{"question_id":2515,"title":"到目标字符串的最短距离","title_slug":"shortest-distance-to-target-string-in-a-circular-array","rating":1367.0197235097,"_hash":1200771569,"paid_only":false,"cont_title":"第 325 场周赛","cont_title_slug":"weekly-contest-325"},{"question_id":1576,"title":"替换所有的问号","title_slug":"replace-all-s-to-avoid-consecutive-repeating-characters","rating":1368.0043517215,"_hash":4233152869,"paid_only":false,"cont_title":"第 205 场周赛","cont_title_slug":"weekly-contest-205"},{"question_id":1370,"title":"上升下降字符串","title_slug":"increasing-decreasing-string","rating":1369.0053354603,"_hash":2860419980,"paid_only":false,"cont_title":"第 21 场双周赛","cont_title_slug":"biweekly-contest-21"},{"question_id":1608,"title":"特殊数组的特征值","title_slug":"special-array-with-x-elements-greater-than-or-equal-x","rating":1369.614440152,"_hash":2737402297,"paid_only":false,"cont_title":"第 209 场周赛","cont_title_slug":"weekly-contest-209"},{"question_id":1854,"title":"人口最多的年份","title_slug":"maximum-population-year","rating":1370.4186698287,"_hash":214508087,"paid_only":false,"cont_title":"第 240 场周赛","cont_title_slug":"weekly-contest-240"},{"question_id":914,"title":"卡牌分组","title_slug":"x-of-a-kind-in-a-deck-of-cards","rating":1370.6144908238,"_hash":3334808342,"paid_only":false,"cont_title":"第 104 场周赛","cont_title_slug":"weekly-contest-104"},{"question_id":2244,"title":"完成所有任务需要的最少轮数","title_slug":"minimum-rounds-to-complete-all-tasks","rating":1371.8092952004,"_hash":2786999216,"paid_only":false,"cont_title":"第 289 场周赛","cont_title_slug":"weekly-contest-289"},{"question_id":1863,"title":"找出所有子集的异或总和再求和","title_slug":"sum-of-all-subset-xor-totals","rating":1372.1152262488,"_hash":3681131795,"paid_only":false,"cont_title":"第 241 场周赛","cont_title_slug":"weekly-contest-241"},{"question_id":2899,"title":"上一个遍历的整数","title_slug":"last-visited-integers","rating":1372.4759842416,"_hash":3735818622,"paid_only":false,"cont_title":"第 115 场双周赛","cont_title_slug":"biweekly-contest-115"},{"question_id":2482,"title":"行和列中一和零的差值","title_slug":"difference-between-ones-and-zeros-in-row-and-column","rating":1372.5139179378,"_hash":61296851,"paid_only":false,"cont_title":"第 92 场双周赛","cont_title_slug":"biweekly-contest-92"},{"question_id":1291,"title":"顺次数","title_slug":"sequential-digits","rating":1373.8113453501,"_hash":1231737979,"paid_only":false,"cont_title":"第 167 场周赛","cont_title_slug":"weekly-contest-167"},{"question_id":2610,"title":"转换二维数组","title_slug":"convert-an-array-into-a-2d-array-with-conditions","rating":1373.8916796083,"_hash":974534416,"paid_only":false,"cont_title":"第 339 场周赛","cont_title_slug":"weekly-contest-339"},{"question_id":2583,"title":"二叉树中的第 K 大层和","title_slug":"kth-largest-sum-in-a-binary-tree","rating":1374.3527967199,"_hash":3851205548,"paid_only":false,"cont_title":"第 335 场周赛","cont_title_slug":"weekly-contest-335"},{"question_id":1619,"title":"删除某些元素后的数组均值","title_slug":"mean-of-array-after-removing-some-elements","rating":1374.3549007913,"_hash":882246184,"paid_only":false,"cont_title":"第 37 场双周赛","cont_title_slug":"biweekly-contest-37"},{"question_id":1267,"title":"统计参与通信的服务器","title_slug":"count-servers-that-communicate","rating":1374.574900311,"_hash":4169811109,"paid_only":false,"cont_title":"第 164 场周赛","cont_title_slug":"weekly-contest-164"},{"question_id":1038,"title":"从二叉搜索树到更大和树","title_slug":"binary-search-tree-to-greater-sum-tree","rating":1374.6755455786,"_hash":3738671880,"paid_only":false,"cont_title":"第 135 场周赛","cont_title_slug":"weekly-contest-135"},{"question_id":1288,"title":"删除被覆盖区间","title_slug":"remove-covered-intervals","rating":1375.0234414965,"_hash":4078794209,"paid_only":false,"cont_title":"第 15 场双周赛","cont_title_slug":"biweekly-contest-15"},{"question_id":2336,"title":"无限集中的最小数字","title_slug":"smallest-number-in-infinite-set","rating":1375.0376362104,"_hash":1742391300,"paid_only":false,"cont_title":"第 301 场周赛","cont_title_slug":"weekly-contest-301"},{"question_id":2614,"title":"对角线上的质数","title_slug":"prime-in-diagonal","rating":1375.4261931199,"_hash":3158353268,"paid_only":false,"cont_title":"第 340 场周赛","cont_title_slug":"weekly-contest-340"},{"question_id":2443,"title":"反转之后的数字和","title_slug":"sum-of-number-and-its-reverse","rating":1376.0047008182,"_hash":3835566276,"paid_only":false,"cont_title":"第 315 场周赛","cont_title_slug":"weekly-contest-315"},{"question_id":2784,"title":"检查数组是否是好的","title_slug":"check-if-array-is-good","rating":1376.2376633804,"_hash":4062228386,"paid_only":false,"cont_title":"第 109 场双周赛","cont_title_slug":"biweekly-contest-109"},{"question_id":1018,"title":"可被 5 整除的二进制前缀","title_slug":"binary-prefix-divisible-by-5","rating":1376.4549624575,"_hash":303821987,"paid_only":false,"cont_title":"第 130 场周赛","cont_title_slug":"weekly-contest-130"},{"question_id":1010,"title":"总持续时间可被 60 整除的歌曲","title_slug":"pairs-of-songs-with-total-durations-divisible-by-60","rating":1377.1913915125,"_hash":2310396,"paid_only":false,"cont_title":"第 128 场周赛","cont_title_slug":"weekly-contest-128"},{"question_id":1013,"title":"将数组分成和相等的三个部分","title_slug":"partition-array-into-three-parts-with-equal-sum","rating":1378.7570411077,"_hash":733560660,"paid_only":false,"cont_title":"第 129 场周赛","cont_title_slug":"weekly-contest-129"},{"question_id":2855,"title":"使数组成为递增数组的最少右移次数","title_slug":"minimum-right-shifts-to-sort-the-array","rating":1379.3426970242,"_hash":3501115477,"paid_only":false,"cont_title":"第 113 场双周赛","cont_title_slug":"biweekly-contest-113"},{"question_id":2120,"title":"执行所有后缀指令","title_slug":"execution-of-all-suffix-instructions-staying-in-a-grid","rating":1379.8787648129,"_hash":1526976016,"paid_only":false,"cont_title":"第 273 场周赛","cont_title_slug":"weekly-contest-273"},{"question_id":1828,"title":"统计一个圆中点的数目","title_slug":"queries-on-number-of-points-inside-a-circle","rating":1380.0192844155,"_hash":3128004049,"paid_only":false,"cont_title":"第 50 场双周赛","cont_title_slug":"biweekly-contest-50"},{"question_id":2410,"title":"运动员和训练师的最大匹配数","title_slug":"maximum-matching-of-players-with-trainers","rating":1381.0888968455,"_hash":3736843920,"paid_only":false,"cont_title":"第 87 场双周赛","cont_title_slug":"biweekly-contest-87"},{"question_id":1881,"title":"插入后的最大值","title_slug":"maximum-value-after-insertion","rating":1381.2168789318,"_hash":288305998,"paid_only":false,"cont_title":"第 243 场周赛","cont_title_slug":"weekly-contest-243"},{"question_id":1185,"title":"一周中的第几天","title_slug":"day-of-the-week","rating":1382.4809893713,"_hash":3920920642,"paid_only":false,"cont_title":"第 153 场周赛","cont_title_slug":"weekly-contest-153"},{"question_id":2682,"title":"找出转圈游戏输家","title_slug":"find-the-losers-of-the-circular-game","rating":1382.6941570342,"_hash":183030256,"paid_only":false,"cont_title":"第 345 场周赛","cont_title_slug":"weekly-contest-345"},{"question_id":849,"title":"到最近的人的最大距离","title_slug":"maximize-distance-to-closest-person","rating":1382.7178688716,"_hash":3370131507,"paid_only":false,"cont_title":"第 88 场周赛","cont_title_slug":"weekly-contest-88"},{"question_id":1318,"title":"或运算的最小翻转次数","title_slug":"minimum-flips-to-make-a-or-b-equal-to-c","rating":1382.760607823,"_hash":623247221,"paid_only":false,"cont_title":"第 171 场周赛","cont_title_slug":"weekly-contest-171"},{"question_id":3034,"title":"匹配模式数组的子数组数目 I","title_slug":"number-of-subarrays-that-match-a-pattern-i","rating":1383.775103528,"_hash":3386206172,"paid_only":false,"cont_title":"第 384 场周赛","cont_title_slug":"weekly-contest-384"},{"question_id":2091,"title":"从数组中移除最大值和最小值","title_slug":"removing-minimum-and-maximum-from-array","rating":1384.0226911434,"_hash":4155641815,"paid_only":false,"cont_title":"第 269 场周赛","cont_title_slug":"weekly-contest-269"},{"question_id":1271,"title":"十六进制魔术数字","title_slug":"hexspeak","rating":1384.4078082338,"_hash":3813216196,"paid_only":false,"cont_title":"第 14 场双周赛","cont_title_slug":"biweekly-contest-14"},{"question_id":2530,"title":"执行 K 次操作后的最大分数","title_slug":"maximal-score-after-applying-k-operations","rating":1386.1200017827,"_hash":2626303746,"paid_only":false,"cont_title":"第 327 场周赛","cont_title_slug":"weekly-contest-327"},{"question_id":1276,"title":"不浪费原料的汉堡制作方案","title_slug":"number-of-burgers-with-no-waste-of-ingredients","rating":1386.3256313989,"_hash":178669910,"paid_only":false,"cont_title":"第 165 场周赛","cont_title_slug":"weekly-contest-165"},{"question_id":1721,"title":"交换链表中的节点","title_slug":"swapping-nodes-in-a-linked-list","rating":1386.9203620297,"_hash":4028967949,"paid_only":false,"cont_title":"第 223 场周赛","cont_title_slug":"weekly-contest-223"},{"question_id":1860,"title":"增长的内存泄露","title_slug":"incremental-memory-leak","rating":1387.2941868867,"_hash":4283669919,"paid_only":false,"cont_title":"第 52 场双周赛","cont_title_slug":"biweekly-contest-52"},{"question_id":937,"title":"重新排列日志文件","title_slug":"reorder-data-in-log-files","rating":1387.3672639293,"_hash":3738917436,"paid_only":false,"cont_title":"第 110 场周赛","cont_title_slug":"weekly-contest-110"},{"question_id":2389,"title":"和有限的最长子序列","title_slug":"longest-subsequence-with-limited-sum","rating":1387.7347071166,"_hash":2775344327,"paid_only":false,"cont_title":"第 308 场周赛","cont_title_slug":"weekly-contest-308"},{"question_id":1302,"title":"层数最深叶子节点的和","title_slug":"deepest-leaves-sum","rating":1387.9431104106,"_hash":2146548018,"paid_only":false,"cont_title":"第 16 场双周赛","cont_title_slug":"biweekly-contest-16"},{"question_id":2917,"title":"找出数组中的 K-or 值","title_slug":"find-the-k-or-of-an-array","rating":1388.5363323598,"_hash":894912724,"paid_only":false,"cont_title":"第 369 场周赛","cont_title_slug":"weekly-contest-369"},{"question_id":1214,"title":"查找两棵二叉搜索树之和","title_slug":"two-sum-bsts","rating":1389.0328392117,"_hash":1043390792,"paid_only":false,"cont_title":"第 10 场双周赛","cont_title_slug":"biweekly-contest-10"},{"question_id":1065,"title":"字符串的索引对","title_slug":"index-pairs-of-a-string","rating":1389.331169471,"_hash":2464323261,"paid_only":false,"cont_title":"第 1 场双周赛","cont_title_slug":"biweekly-contest-1"},{"question_id":2155,"title":"分组得分最高的所有下标","title_slug":"all-divisions-with-the-highest-score-of-a-binary-array","rating":1390.5023027273,"_hash":1507011086,"paid_only":false,"cont_title":"第 278 场周赛","cont_title_slug":"weekly-contest-278"},{"question_id":1222,"title":"可以攻击国王的皇后","title_slug":"queens-that-can-attack-the-king","rating":1391.7243180131,"_hash":665333196,"paid_only":false,"cont_title":"第 158 场周赛","cont_title_slug":"weekly-contest-158"},{"question_id":957,"title":"N 天后的牢房","title_slug":"prison-cells-after-n-days","rating":1392.0853311911,"_hash":572178714,"paid_only":false,"cont_title":"第 115 场周赛","cont_title_slug":"weekly-contest-115"},{"question_id":2870,"title":"使数组为空的最少操作次数","title_slug":"minimum-number-of-operations-to-make-array-empty","rating":1392.3629194433,"_hash":2657502607,"paid_only":false,"cont_title":"第 114 场双周赛","cont_title_slug":"biweekly-contest-114"},{"question_id":1529,"title":"最少的后缀翻转次数","title_slug":"minimum-suffix-flips","rating":1392.6601629182,"_hash":2324786150,"paid_only":false,"cont_title":"第 199 场周赛","cont_title_slug":"weekly-contest-199"},{"question_id":2928,"title":"给小朋友们分糖果 I","title_slug":"distribute-candies-among-children-i","rating":1393.3604603199,"_hash":4137220667,"paid_only":false,"cont_title":"第 117 场双周赛","cont_title_slug":"biweekly-contest-117"},{"question_id":978,"title":"最长湍流子数组","title_slug":"longest-turbulent-subarray","rating":1393.4123491817,"_hash":3588035361,"paid_only":false,"cont_title":"第 120 场周赛","cont_title_slug":"weekly-contest-120"},{"question_id":2816,"title":"翻倍以链表形式表示的数字","title_slug":"double-a-number-represented-as-a-linked-list","rating":1393.7857353048,"_hash":1168558024,"paid_only":false,"cont_title":"第 358 场周赛","cont_title_slug":"weekly-contest-358"},{"question_id":2256,"title":"最小平均差","title_slug":"minimum-average-difference","rating":1394.9149882274,"_hash":4108118731,"paid_only":false,"cont_title":"第 77 场双周赛","cont_title_slug":"biweekly-contest-77"},{"question_id":1668,"title":"最大重复子字符串","title_slug":"maximum-repeating-substring","rating":1395.5132479177,"_hash":1257680587,"paid_only":false,"cont_title":"第 40 场双周赛","cont_title_slug":"biweekly-contest-40"},{"question_id":2966,"title":"划分数组并满足最大差限制","title_slug":"divide-array-into-arrays-with-max-difference","rating":1395.9639246414,"_hash":2398941022,"paid_only":false,"cont_title":"第 376 场周赛","cont_title_slug":"weekly-contest-376"},{"question_id":2566,"title":"替换一个数字后的最大差值","title_slug":"maximum-difference-by-remapping-a-digit","rating":1396.1044458638,"_hash":2204380301,"paid_only":false,"cont_title":"第 98 场双周赛","cont_title_slug":"biweekly-contest-98"},{"question_id":944,"title":"删列造序","title_slug":"delete-columns-to-make-sorted","rating":1396.4853538164,"_hash":3612858843,"paid_only":false,"cont_title":"第 111 场周赛","cont_title_slug":"weekly-contest-111"},{"question_id":1306,"title":"跳跃游戏 III","title_slug":"jump-game-iii","rating":1396.5448074496,"_hash":1787879890,"paid_only":false,"cont_title":"第 169 场周赛","cont_title_slug":"weekly-contest-169"},{"question_id":1404,"title":"将二进制表示减到 1 的步骤数","title_slug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one","rating":1396.5990609759,"_hash":1438800814,"paid_only":false,"cont_title":"第 183 场周赛","cont_title_slug":"weekly-contest-183"},{"question_id":1176,"title":"健身计划评估","title_slug":"diet-plan-performance","rating":1397.7743198793,"_hash":97873302,"paid_only":false,"cont_title":"第 152 场周赛","cont_title_slug":"weekly-contest-152"},{"question_id":1071,"title":"字符串的最大公因子","title_slug":"greatest-common-divisor-of-strings","rating":1397.8875115008,"_hash":3816685448,"paid_only":false,"cont_title":"第 139 场周赛","cont_title_slug":"weekly-contest-139"},{"question_id":2799,"title":"统计完全子数组的数目","title_slug":"count-complete-subarrays-in-an-array","rating":1397.9519549403,"_hash":1784527717,"paid_only":false,"cont_title":"第 356 场周赛","cont_title_slug":"weekly-contest-356"},{"question_id":2240,"title":"买钢笔和铅笔的方案数","title_slug":"number-of-ways-to-buy-pens-and-pencils","rating":1399.8468905274,"_hash":534082096,"paid_only":false,"cont_title":"第 76 场双周赛","cont_title_slug":"biweekly-contest-76"},{"question_id":1198,"title":"找出所有行中最小公共元素","title_slug":"find-smallest-common-element-in-all-rows","rating":1401.2246983038,"_hash":2199036891,"paid_only":false,"cont_title":"第 9 场双周赛","cont_title_slug":"biweekly-contest-9"},{"question_id":1508,"title":"子数组和排序后的区间和","title_slug":"range-sum-of-sorted-subarray-sums","rating":1402.0863615706,"_hash":1762249323,"paid_only":false,"cont_title":"第 30 场双周赛","cont_title_slug":"biweekly-contest-30"},{"question_id":1700,"title":"无法吃午餐的学生数量","title_slug":"number-of-students-unable-to-eat-lunch","rating":1404.1839222,"_hash":2553352145,"paid_only":false,"cont_title":"第 42 场双周赛","cont_title_slug":"biweekly-contest-42"},{"question_id":1237,"title":"找出给定方程的正整数解","title_slug":"find-positive-integer-solution-for-a-given-equation","rating":1404.7016862187,"_hash":3484001100,"paid_only":false,"cont_title":"第 160 场周赛","cont_title_slug":"weekly-contest-160"},{"question_id":1457,"title":"二叉树中的伪回文路径","title_slug":"pseudo-palindromic-paths-in-a-binary-tree","rating":1405.0021415178,"_hash":3010901510,"paid_only":false,"cont_title":"第 190 场周赛","cont_title_slug":"weekly-contest-190"},{"question_id":2734,"title":"执行子串操作后的字典序最小字符串","title_slug":"lexicographically-smallest-string-after-substring-operation","rating":1405.123188264,"_hash":3092398094,"paid_only":false,"cont_title":"第 349 场周赛","cont_title_slug":"weekly-contest-349"},{"question_id":1410,"title":"HTML 实体解析器","title_slug":"html-entity-parser","rating":1405.4005354401,"_hash":1452093256,"paid_only":false,"cont_title":"第 184 场周赛","cont_title_slug":"weekly-contest-184"},{"question_id":1561,"title":"你可以获得的最大硬币数目","title_slug":"maximum-number-of-coins-you-can-get","rating":1405.5786892723,"_hash":2336939814,"paid_only":false,"cont_title":"第 203 场周赛","cont_title_slug":"weekly-contest-203"},{"question_id":2996,"title":"大于等于顺序前缀和的最小缺失整数","title_slug":"smallest-missing-integer-greater-than-sequential-prefix-sum","rating":1405.7482709086,"_hash":2694109670,"paid_only":false,"cont_title":"第 121 场双周赛","cont_title_slug":"biweekly-contest-121"},{"question_id":2946,"title":"循环移位后的矩阵相似检查","title_slug":"matrix-similarity-after-cyclic-shifts","rating":1405.8442434352,"_hash":2937224937,"paid_only":false,"cont_title":"第 373 场周赛","cont_title_slug":"weekly-contest-373"},{"question_id":2744,"title":"最大字符串配对数目","title_slug":"find-maximum-number-of-string-pairs","rating":1405.8938478338,"_hash":3156996757,"paid_only":false,"cont_title":"第 107 场双周赛","cont_title_slug":"biweekly-contest-107"},{"question_id":2451,"title":"差值数组不同的字符串","title_slug":"odd-string-difference","rating":1406.1279714442,"_hash":1571048900,"paid_only":false,"cont_title":"第 90 场双周赛","cont_title_slug":"biweekly-contest-90"},{"question_id":1886,"title":"判断矩阵经轮转后是否一致","title_slug":"determine-whether-matrix-can-be-obtained-by-rotation","rating":1407.0629410799,"_hash":3698071341,"paid_only":false,"cont_title":"第 244 场周赛","cont_title_slug":"weekly-contest-244"},{"question_id":1325,"title":"删除给定值的叶子节点","title_slug":"delete-leaves-with-a-given-value","rating":1407.1322366299,"_hash":1098465458,"paid_only":false,"cont_title":"第 172 场周赛","cont_title_slug":"weekly-contest-172"},{"question_id":1217,"title":"玩筹码","title_slug":"minimum-cost-to-move-chips-to-the-same-position","rating":1407.5442381391,"_hash":2503951076,"paid_only":false,"cont_title":"第 157 场周赛","cont_title_slug":"weekly-contest-157"},{"question_id":1006,"title":"笨阶乘","title_slug":"clumsy-factorial","rating":1407.9870845299,"_hash":3282812734,"paid_only":false,"cont_title":"第 127 场周赛","cont_title_slug":"weekly-contest-127"},{"question_id":2110,"title":"股票平滑下跌阶段的数目","title_slug":"number-of-smooth-descent-periods-of-a-stock","rating":1408.427592417,"_hash":4159210402,"paid_only":false,"cont_title":"第 272 场周赛","cont_title_slug":"weekly-contest-272"},{"question_id":1588,"title":"所有奇数长度子数组的和","title_slug":"sum-of-all-odd-length-subarrays","rating":1408.7923640745,"_hash":1846293530,"paid_only":false,"cont_title":"第 35 场双周赛","cont_title_slug":"biweekly-contest-35"},{"question_id":2834,"title":"找出美丽数组的最小和","title_slug":"find-the-minimum-possible-sum-of-a-beautiful-array","rating":1409.2288385791,"_hash":4261327361,"paid_only":false,"cont_title":"第 360 场周赛","cont_title_slug":"weekly-contest-360"},{"question_id":1138,"title":"字母板上的路径","title_slug":"alphabet-board-path","rating":1410.5239927267,"_hash":638264577,"paid_only":false,"cont_title":"第 147 场周赛","cont_title_slug":"weekly-contest-147"},{"question_id":841,"title":"钥匙和房间","title_slug":"keys-and-rooms","rating":1412.2790156634,"_hash":1361459100,"paid_only":false,"cont_title":"第 86 场周赛","cont_title_slug":"weekly-contest-86"},{"question_id":1823,"title":"找出游戏的获胜者","title_slug":"find-the-winner-of-the-circular-game","rating":1412.3053230205,"_hash":2586044711,"paid_only":false,"cont_title":"第 236 场周赛","cont_title_slug":"weekly-contest-236"},{"question_id":2521,"title":"数组乘积中的不同质因数数目","title_slug":"distinct-prime-factors-of-product-of-array","rating":1413.0376809608,"_hash":3036702868,"paid_only":false,"cont_title":"第 326 场周赛","cont_title_slug":"weekly-contest-326"},{"question_id":2383,"title":"赢得比赛需要的最少训练时长","title_slug":"minimum-hours-of-training-to-win-a-competition","rating":1413.4238697034,"_hash":1542173395,"paid_only":false,"cont_title":"第 307 场周赛","cont_title_slug":"weekly-contest-307"},{"question_id":1985,"title":"找出数组中的第 K 大整数","title_slug":"find-the-kth-largest-integer-in-the-array","rating":1414.4351202231,"_hash":3550553048,"paid_only":false,"cont_title":"第 256 场周赛","cont_title_slug":"weekly-contest-256"},{"question_id":890,"title":"查找和替换模式","title_slug":"find-and-replace-pattern","rating":1414.4918812526,"_hash":3073583780,"paid_only":false,"cont_title":"第 98 场周赛","cont_title_slug":"weekly-contest-98"},{"question_id":2825,"title":"循环增长使字符串子序列等于另一个字符串","title_slug":"make-string-a-subsequence-using-cyclic-increments","rating":1414.6100987673,"_hash":1449546891,"paid_only":false,"cont_title":"第 111 场双周赛","cont_title_slug":"biweekly-contest-111"},{"question_id":2294,"title":"划分数组使最大差为 K","title_slug":"partition-array-such-that-maximum-difference-is-k","rating":1416.4124723866,"_hash":3430688223,"paid_only":false,"cont_title":"第 296 场周赛","cont_title_slug":"weekly-contest-296"},{"question_id":1652,"title":"拆炸弹","title_slug":"defuse-the-bomb","rating":1416.8961009909,"_hash":3839572104,"paid_only":false,"cont_title":"第 39 场双周赛","cont_title_slug":"biweekly-contest-39"},{"question_id":2139,"title":"得到目标值的最少行动次数","title_slug":"minimum-moves-to-reach-target-score","rating":1417.3934930077,"_hash":2135327933,"paid_only":false,"cont_title":"第 276 场周赛","cont_title_slug":"weekly-contest-276"},{"question_id":1052,"title":"爱生气的书店老板","title_slug":"grumpy-bookstore-owner","rating":1418.1401949854,"_hash":3953245616,"paid_only":false,"cont_title":"第 138 场周赛","cont_title_slug":"weekly-contest-138"},{"question_id":1962,"title":"移除石子使总数最小","title_slug":"remove-stones-to-minimize-the-total","rating":1418.6847740057,"_hash":1331620430,"paid_only":false,"cont_title":"第 253 场周赛","cont_title_slug":"weekly-contest-253"},{"question_id":1656,"title":"设计有序流","title_slug":"design-an-ordered-stream","rating":1418.8205349928,"_hash":2422080240,"paid_only":false,"cont_title":"第 215 场周赛","cont_title_slug":"weekly-contest-215"},{"question_id":2374,"title":"边积分最高的节点","title_slug":"node-with-highest-edge-score","rating":1418.9758090724,"_hash":1078280786,"paid_only":false,"cont_title":"第 306 场周赛","cont_title_slug":"weekly-contest-306"},{"question_id":2760,"title":"最长奇偶子数组","title_slug":"longest-even-odd-subarray-with-threshold","rating":1420.3698647434,"_hash":2817202669,"paid_only":false,"cont_title":"第 352 场周赛","cont_title_slug":"weekly-contest-352"},{"question_id":1033,"title":"移动石子直到连续","title_slug":"moving-stones-until-consecutive","rating":1421.2624065513,"_hash":1049390106,"paid_only":false,"cont_title":"第 134 场周赛","cont_title_slug":"weekly-contest-134"},{"question_id":1360,"title":"日期之间隔几天","title_slug":"number-of-days-between-two-dates","rating":1421.6541140049,"_hash":686429748,"paid_only":false,"cont_title":"第 177 场周赛","cont_title_slug":"weekly-contest-177"},{"question_id":2326,"title":"螺旋矩阵 IV","title_slug":"spiral-matrix-iv","rating":1421.7251191403,"_hash":1599758478,"paid_only":false,"cont_title":"第 300 场周赛","cont_title_slug":"weekly-contest-300"},{"question_id":1630,"title":"等差子数组","title_slug":"arithmetic-subarrays","rating":1421.9944676861,"_hash":3454110996,"paid_only":false,"cont_title":"第 212 场周赛","cont_title_slug":"weekly-contest-212"},{"question_id":2606,"title":"找到最大开销的子字符串","title_slug":"find-the-substring-with-maximum-cost","rating":1422.3308967485,"_hash":1474617560,"paid_only":false,"cont_title":"第 101 场双周赛","cont_title_slug":"biweekly-contest-101"},{"question_id":2938,"title":"区分黑球与白球","title_slug":"separate-black-and-white-balls","rating":1422.7125559974,"_hash":1063658457,"paid_only":false,"cont_title":"第 372 场周赛","cont_title_slug":"weekly-contest-372"},{"question_id":1493,"title":"删掉一个元素以后全为 1 的最长子数组","title_slug":"longest-subarray-of-1s-after-deleting-one-element","rating":1423.0355763093,"_hash":3989735780,"paid_only":false,"cont_title":"第 29 场双周赛","cont_title_slug":"biweekly-contest-29"},{"question_id":1333,"title":"餐厅过滤器","title_slug":"filter-restaurants-by-vegan-friendly-price-and-distance","rating":1423.1058649921,"_hash":3693635252,"paid_only":false,"cont_title":"第 173 场周赛","cont_title_slug":"weekly-contest-173"},{"question_id":883,"title":"三维形体投影面积","title_slug":"projection-area-of-3d-shapes","rating":1425.3981616639,"_hash":4256716489,"paid_only":false,"cont_title":"第 96 场周赛","cont_title_slug":"weekly-contest-96"},{"question_id":840,"title":"矩阵中的幻方","title_slug":"magic-squares-in-grid","rating":1425.9672522649,"_hash":3456273150,"paid_only":false,"cont_title":"第 86 场周赛","cont_title_slug":"weekly-contest-86"},{"question_id":1003,"title":"检查替换后的词是否有效","title_slug":"check-if-word-is-valid-after-substitutions","rating":1426.7144554733,"_hash":2965139328,"paid_only":false,"cont_title":"第 126 场周赛","cont_title_slug":"weekly-contest-126"},{"question_id":1432,"title":"改变一个整数能得到的最大差值","title_slug":"max-difference-you-can-get-from-changing-an-integer","rating":1426.7384112327,"_hash":4162693857,"paid_only":false,"cont_title":"第 25 场双周赛","cont_title_slug":"biweekly-contest-25"},{"question_id":1315,"title":"祖父节点值为偶数的节点和","title_slug":"sum-of-nodes-with-even-valued-grandparent","rating":1426.948379305,"_hash":1075948935,"paid_only":false,"cont_title":"第 17 场双周赛","cont_title_slug":"biweekly-contest-17"},{"question_id":2437,"title":"有效时间的数目","title_slug":"number-of-valid-clock-times","rating":1426.9800910361,"_hash":4095621901,"paid_only":false,"cont_title":"第 89 场双周赛","cont_title_slug":"biweekly-contest-89"},{"question_id":1887,"title":"使数组元素相等的减少操作次数","title_slug":"reduction-operations-to-make-the-array-elements-equal","rating":1427.7906804882,"_hash":869195845,"paid_only":false,"cont_title":"第 244 场周赛","cont_title_slug":"weekly-contest-244"},{"question_id":1669,"title":"合并两个链表","title_slug":"merge-in-between-linked-lists","rating":1428.1443796872,"_hash":235206650,"paid_only":false,"cont_title":"第 40 场双周赛","cont_title_slug":"biweekly-contest-40"},{"question_id":1845,"title":"座位预约管理系统","title_slug":"seat-reservation-manager","rating":1428.6729861424,"_hash":3281498525,"paid_only":false,"cont_title":"第 51 场双周赛","cont_title_slug":"biweekly-contest-51"},{"question_id":2711,"title":"对角线上不同值的数量差","title_slug":"difference-of-number-of-distinct-values-on-diagonals","rating":1428.7246677159,"_hash":3754993583,"paid_only":false,"cont_title":"第 347 场周赛","cont_title_slug":"weekly-contest-347"},{"question_id":988,"title":"从叶结点开始的最小字符串","title_slug":"smallest-string-starting-from-leaf","rating":1429.1878389249,"_hash":1210196211,"paid_only":false,"cont_title":"第 122 场周赛","cont_title_slug":"weekly-contest-122"},{"question_id":1357,"title":"每隔 n 个顾客打折","title_slug":"apply-discount-every-n-orders","rating":1429.6349292399,"_hash":920111034,"paid_only":false,"cont_title":"第 20 场双周赛","cont_title_slug":"biweekly-contest-20"},{"question_id":2957,"title":"消除相邻近似相等字符","title_slug":"remove-adjacent-almost-equal-characters","rating":1429.9599761889,"_hash":2774491833,"paid_only":false,"cont_title":"第 119 场双周赛","cont_title_slug":"biweekly-contest-119"},{"question_id":2924,"title":"找到冠军 II","title_slug":"find-champion-ii","rating":1430.3094955812,"_hash":3936988451,"paid_only":false,"cont_title":"第 370 场周赛","cont_title_slug":"weekly-contest-370"},{"question_id":1636,"title":"按照频率将数组升序排序","title_slug":"sort-array-by-increasing-frequency","rating":1430.3429533629,"_hash":2735293288,"paid_only":false,"cont_title":"第 38 场双周赛","cont_title_slug":"biweekly-contest-38"},{"question_id":2415,"title":"反转二叉树的奇数层","title_slug":"reverse-odd-levels-of-binary-tree","rating":1431.0523656241,"_hash":1420390570,"paid_only":false,"cont_title":"第 311 场周赛","cont_title_slug":"weekly-contest-311"},{"question_id":1170,"title":"比较字符串最小字母出现频次","title_slug":"compare-strings-by-frequency-of-the-smallest-character","rating":1431.6864980883,"_hash":168963992,"paid_only":false,"cont_title":"第 151 场周赛","cont_title_slug":"weekly-contest-151"},{"question_id":1785,"title":"构成特定和需要添加的最少元素","title_slug":"minimum-elements-to-add-to-form-a-given-sum","rating":1432.0967926378,"_hash":3102780834,"paid_only":false,"cont_title":"第 231 场周赛","cont_title_slug":"weekly-contest-231"},{"question_id":994,"title":"腐烂的橘子","title_slug":"rotting-oranges","rating":1432.9051050881,"_hash":782747152,"paid_only":false,"cont_title":"第 124 场周赛","cont_title_slug":"weekly-contest-124"},{"question_id":967,"title":"连续差相同的数字","title_slug":"numbers-with-same-consecutive-differences","rating":1432.9593207076,"_hash":2436753495,"paid_only":false,"cont_title":"第 117 场周赛","cont_title_slug":"weekly-contest-117"},{"question_id":1535,"title":"找出数组游戏的赢家","title_slug":"find-the-winner-of-an-array-game","rating":1433.0795554833,"_hash":3951026299,"paid_only":false,"cont_title":"第 200 场周赛","cont_title_slug":"weekly-contest-200"},{"question_id":2600,"title":"K 件物品的最大和","title_slug":"k-items-with-the-maximum-sum","rating":1434.2392062372,"_hash":829222445,"paid_only":false,"cont_title":"第 338 场周赛","cont_title_slug":"weekly-contest-338"},{"question_id":2559,"title":"统计范围内的元音字符串数","title_slug":"count-vowel-strings-in-ranges","rating":1435.0179887342,"_hash":945629510,"paid_only":false,"cont_title":"第 331 场周赛","cont_title_slug":"weekly-contest-331"},{"question_id":1025,"title":"除数博弈","title_slug":"divisor-game","rating":1435.3564963722,"_hash":2669738738,"paid_only":false,"cont_title":"第 132 场周赛","cont_title_slug":"weekly-contest-132"},{"question_id":2001,"title":"可互换矩形的组数","title_slug":"number-of-pairs-of-interchangeable-rectangles","rating":1435.9559888935,"_hash":2330317080,"paid_only":false,"cont_title":"第 258 场周赛","cont_title_slug":"weekly-contest-258"},{"question_id":1433,"title":"检查一个字符串是否可以打破另一个字符串","title_slug":"check-if-a-string-can-break-another-string","rating":1436.1125054038,"_hash":2646645546,"paid_only":false,"cont_title":"第 25 场双周赛","cont_title_slug":"biweekly-contest-25"},{"question_id":1701,"title":"平均等待时间","title_slug":"average-waiting-time","rating":1436.3892315914,"_hash":2259000228,"paid_only":false,"cont_title":"第 42 场双周赛","cont_title_slug":"biweekly-contest-42"},{"question_id":845,"title":"数组中的最长山脉","title_slug":"longest-mountain-in-array","rating":1436.5343999134,"_hash":401508981,"paid_only":false,"cont_title":"第 87 场周赛","cont_title_slug":"weekly-contest-87"},{"question_id":1609,"title":"奇偶树","title_slug":"even-odd-tree","rating":1438.223135905,"_hash":3144113364,"paid_only":false,"cont_title":"第 209 场周赛","cont_title_slug":"weekly-contest-209"},{"question_id":1375,"title":"二进制字符串前缀一致的次数","title_slug":"number-of-times-binary-string-is-prefix-aligned","rating":1438.8988489545,"_hash":1637468390,"paid_only":false,"cont_title":"第 179 场周赛","cont_title_slug":"weekly-contest-179"},{"question_id":1261,"title":"在受污染的二叉树中查找元素","title_slug":"find-elements-in-a-contaminated-binary-tree","rating":1439.5656079032,"_hash":1643291393,"paid_only":false,"cont_title":"第 163 场周赛","cont_title_slug":"weekly-contest-163"},{"question_id":1094,"title":"拼车","title_slug":"car-pooling","rating":1441.4290319373,"_hash":1187211206,"paid_only":false,"cont_title":"第 142 场周赛","cont_title_slug":"weekly-contest-142"},{"question_id":836,"title":"矩形重叠","title_slug":"rectangle-overlap","rating":1442.9468304752,"_hash":4086617748,"paid_only":false,"cont_title":"第 85 场周赛","cont_title_slug":"weekly-contest-85"},{"question_id":1560,"title":"圆形赛道上经过次数最多的扇区","title_slug":"most-visited-sector-in-a-circular-track","rating":1443.2353621969,"_hash":2434964692,"paid_only":false,"cont_title":"第 203 场周赛","cont_title_slug":"weekly-contest-203"},{"question_id":942,"title":"增减字符串匹配","title_slug":"di-string-match","rating":1444.2068009303,"_hash":2792312732,"paid_only":false,"cont_title":"第 111 场周赛","cont_title_slug":"weekly-contest-111"},{"question_id":2526,"title":"找到数据流中的连续整数","title_slug":"find-consecutive-integers-from-a-data-stream","rating":1444.3218903725,"_hash":778347498,"paid_only":false,"cont_title":"第 95 场双周赛","cont_title_slug":"biweekly-contest-95"},{"question_id":1465,"title":"切割后面积最大的蛋糕","title_slug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts","rating":1444.6098846511,"_hash":4281929868,"paid_only":false,"cont_title":"第 191 场周赛","cont_title_slug":"weekly-contest-191"},{"question_id":2028,"title":"找出缺失的观测数据","title_slug":"find-missing-observations","rating":1444.6795731919,"_hash":1541316145,"paid_only":false,"cont_title":"第 261 场周赛","cont_title_slug":"weekly-contest-261"},{"question_id":2295,"title":"替换数组中的元素","title_slug":"replace-elements-in-an-array","rating":1445.1422945604,"_hash":4058134239,"paid_only":false,"cont_title":"第 296 场周赛","cont_title_slug":"weekly-contest-296"},{"question_id":1946,"title":"子字符串突变后可能得到的最大整数","title_slug":"largest-number-after-mutating-substring","rating":1445.3734269673,"_hash":1102749976,"paid_only":false,"cont_title":"第 251 场周赛","cont_title_slug":"weekly-contest-251"},{"question_id":1026,"title":"节点与其祖先之间的最大差值","title_slug":"maximum-difference-between-node-and-ancestor","rating":1446.4280778775,"_hash":2850260537,"paid_only":false,"cont_title":"第 132 场周赛","cont_title_slug":"weekly-contest-132"},{"question_id":2099,"title":"找到和最大的长度为 K 的子序列","title_slug":"find-subsequence-of-length-k-with-the-largest-sum","rating":1447.0268321102,"_hash":3254374161,"paid_only":false,"cont_title":"第 67 场双周赛","cont_title_slug":"biweekly-contest-67"},{"question_id":945,"title":"使数组唯一的最小增量","title_slug":"minimum-increment-to-make-array-unique","rating":1448.1207963663,"_hash":2617837584,"paid_only":false,"cont_title":"第 112 场周赛","cont_title_slug":"weekly-contest-112"},{"question_id":2596,"title":"检查骑士巡视方案","title_slug":"check-knight-tour-configuration","rating":1448.1865030721,"_hash":4101129191,"paid_only":false,"cont_title":"第 337 场周赛","cont_title_slug":"weekly-contest-337"},{"question_id":2511,"title":"最多可以摧毁的敌人城堡数目","title_slug":"maximum-enemy-forts-that-can-be-captured","rating":1450.0534545623,"_hash":3250902571,"paid_only":false,"cont_title":"第 94 场双周赛","cont_title_slug":"biweekly-contest-94"},{"question_id":831,"title":"隐藏个人信息","title_slug":"masking-personal-information","rating":1450.5787293419,"_hash":3572615577,"paid_only":false,"cont_title":"第 83 场周赛","cont_title_slug":"weekly-contest-83"},{"question_id":2961,"title":"双模幂运算","title_slug":"double-modular-exponentiation","rating":1450.6986543984,"_hash":1122946813,"paid_only":false,"cont_title":"第 375 场周赛","cont_title_slug":"weekly-contest-375"},{"question_id":2947,"title":"统计美丽子字符串 I","title_slug":"count-beautiful-substrings-i","rating":1450.8514438667,"_hash":1299365979,"paid_only":false,"cont_title":"第 373 场周赛","cont_title_slug":"weekly-contest-373"},{"question_id":1472,"title":"设计浏览器历史记录","title_slug":"design-browser-history","rating":1453.7818053022,"_hash":791863919,"paid_only":false,"cont_title":"第 192 场周赛","cont_title_slug":"weekly-contest-192"},{"question_id":1846,"title":"减小和重新排列数组后的最大元素","title_slug":"maximum-element-after-decreasing-and-rearranging","rating":1454.3901912166,"_hash":2606916888,"paid_only":false,"cont_title":"第 51 场双周赛","cont_title_slug":"biweekly-contest-51"},{"question_id":2487,"title":"从链表中移除节点","title_slug":"remove-nodes-from-linked-list","rating":1454.5942017003,"_hash":3911303073,"paid_only":false,"cont_title":"第 321 场周赛","cont_title_slug":"weekly-contest-321"},{"question_id":2094,"title":"找出 3 位偶数","title_slug":"finding-3-digit-even-numbers","rating":1454.7459647138,"_hash":3789355498,"paid_only":false,"cont_title":"第 270 场周赛","cont_title_slug":"weekly-contest-270"},{"question_id":2391,"title":"收集垃圾的最少总时间","title_slug":"minimum-amount-of-time-to-collect-garbage","rating":1455.8516200241,"_hash":2833491097,"paid_only":false,"cont_title":"第 308 场周赛","cont_title_slug":"weekly-contest-308"},{"question_id":2062,"title":"统计字符串中的元音子字符串","title_slug":"count-vowel-substrings-of-a-string","rating":1458.356493039,"_hash":3871311053,"paid_only":false,"cont_title":"第 266 场周赛","cont_title_slug":"weekly-contest-266"},{"question_id":2452,"title":"距离字典两次编辑以内的单词","title_slug":"words-within-two-edits-of-dictionary","rating":1459.7513584849,"_hash":1616359180,"paid_only":false,"cont_title":"第 90 场双周赛","cont_title_slug":"biweekly-contest-90"},{"question_id":1310,"title":"子数组异或查询","title_slug":"xor-queries-of-a-subarray","rating":1459.8208951847,"_hash":3663334475,"paid_only":false,"cont_title":"第 170 场周赛","cont_title_slug":"weekly-contest-170"},{"question_id":1663,"title":"具有给定数值的最小字符串","title_slug":"smallest-string-with-a-given-numeric-value","rating":1460.5903088359,"_hash":438417277,"paid_only":false,"cont_title":"第 216 场周赛","cont_title_slug":"weekly-contest-216"},{"question_id":1910,"title":"删除一个字符串中所有出现的给定子字符串","title_slug":"remove-all-occurrences-of-a-substring","rating":1460.9105672071,"_hash":2348993490,"paid_only":false,"cont_title":"第 55 场双周赛","cont_title_slug":"biweekly-contest-55"},{"question_id":833,"title":"字符串中的查找与替换","title_slug":"find-and-replace-in-string","rating":1460.9610936441,"_hash":286069565,"paid_only":false,"cont_title":"第 84 场周赛","cont_title_slug":"weekly-contest-84"},{"question_id":1909,"title":"删除一个元素使数组严格递增","title_slug":"remove-one-element-to-make-the-array-strictly-increasing","rating":1461.2892510067,"_hash":3077002187,"paid_only":false,"cont_title":"第 55 场双周赛","cont_title_slug":"biweekly-contest-55"},{"question_id":946,"title":"验证栈序列","title_slug":"validate-stack-sequences","rating":1461.9157715206,"_hash":403672441,"paid_only":false,"cont_title":"第 112 场周赛","cont_title_slug":"weekly-contest-112"},{"question_id":1022,"title":"从根到叶的二进制数之和","title_slug":"sum-of-root-to-leaf-binary-numbers","rating":1462.4423844498,"_hash":3615890317,"paid_only":false,"cont_title":"第 131 场周赛","cont_title_slug":"weekly-contest-131"},{"question_id":1396,"title":"设计地铁系统","title_slug":"design-underground-system","rating":1464.5254961488,"_hash":1788773531,"paid_only":false,"cont_title":"第 182 场周赛","cont_title_slug":"weekly-contest-182"},{"question_id":1361,"title":"验证二叉树","title_slug":"validate-binary-tree-nodes","rating":1464.6895034875,"_hash":124339070,"paid_only":false,"cont_title":"第 177 场周赛","cont_title_slug":"weekly-contest-177"},{"question_id":1414,"title":"和为 K 的最少斐波那契数字数目","title_slug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k","rating":1465.7023558248,"_hash":1463291583,"paid_only":false,"cont_title":"第 24 场双周赛","cont_title_slug":"biweekly-contest-24"},{"question_id":2038,"title":"如果相邻两个颜色均相同则删除当前颜色","title_slug":"remove-colored-pieces-if-both-neighbors-are-the-same-color","rating":1467.7383709213,"_hash":2795952868,"paid_only":false,"cont_title":"第 63 场双周赛","cont_title_slug":"biweekly-contest-63"},{"question_id":2012,"title":"数组美丽值求和","title_slug":"sum-of-beauty-in-the-array","rating":1467.9366439696,"_hash":136239889,"paid_only":false,"cont_title":"第 259 场周赛","cont_title_slug":"weekly-contest-259"},{"question_id":2900,"title":"最长相邻不相等子序列 I","title_slug":"longest-unequal-adjacent-groups-subsequence-i","rating":1468.8739273624,"_hash":3312226061,"paid_only":false,"cont_title":"第 115 场双周赛","cont_title_slug":"biweekly-contest-115"},{"question_id":1093,"title":"大样本统计","title_slug":"statistics-from-a-large-sample","rating":1471.6221713607,"_hash":781431378,"paid_only":false,"cont_title":"第 142 场周赛","cont_title_slug":"weekly-contest-142"},{"question_id":2047,"title":"句子中的有效单词数","title_slug":"number-of-valid-words-in-a-sentence","rating":1471.8964024887,"_hash":3911640069,"paid_only":false,"cont_title":"第 264 场周赛","cont_title_slug":"weekly-contest-264"},{"question_id":2265,"title":"统计值等于子树平均值的节点数","title_slug":"count-nodes-equal-to-average-of-subtree","rating":1472.7864965062,"_hash":2311001320,"paid_only":false,"cont_title":"第 292 场周赛","cont_title_slug":"weekly-contest-292"},{"question_id":897,"title":"递增顺序搜索树","title_slug":"increasing-order-search-tree","rating":1473.2523136772,"_hash":1569116237,"paid_only":false,"cont_title":"第 100 场周赛","cont_title_slug":"weekly-contest-100"},{"question_id":1352,"title":"最后 K 个数的乘积","title_slug":"product-of-the-last-k-numbers","rating":1473.7057465272,"_hash":2948668320,"paid_only":false,"cont_title":"第 176 场周赛","cont_title_slug":"weekly-contest-176"},{"question_id":1328,"title":"破坏回文串","title_slug":"break-a-palindrome","rating":1473.864993045,"_hash":1467367970,"paid_only":false,"cont_title":"第 18 场双周赛","cont_title_slug":"biweekly-contest-18"},{"question_id":984,"title":"不含 AAA 或 BBB 的字符串","title_slug":"string-without-aaa-or-bbb","rating":1474.0150725665,"_hash":3491443766,"paid_only":false,"cont_title":"第 121 场周赛","cont_title_slug":"weekly-contest-121"},{"question_id":2300,"title":"咒语和药水的成功对数","title_slug":"successful-pairs-of-spells-and-potions","rating":1476.9062320302,"_hash":4067072856,"paid_only":false,"cont_title":"第 80 场双周赛","cont_title_slug":"biweekly-contest-80"},{"question_id":2368,"title":"受限条件下可到达节点的数目","title_slug":"reachable-nodes-with-restrictions","rating":1476.9118898539,"_hash":4092227797,"paid_only":false,"cont_title":"第 305 场周赛","cont_title_slug":"weekly-contest-305"},{"question_id":951,"title":"翻转等价二叉树","title_slug":"flip-equivalent-binary-trees","rating":1477.4844514104,"_hash":444680013,"paid_only":false,"cont_title":"第 113 场周赛","cont_title_slug":"weekly-contest-113"},{"question_id":2645,"title":"构造有效字符串的最少插入数","title_slug":"minimum-additions-to-make-valid-string","rating":1477.7669322402,"_hash":690173651,"paid_only":false,"cont_title":"第 341 场周赛","cont_title_slug":"weekly-contest-341"},{"question_id":1390,"title":"四因数","title_slug":"four-divisors","rating":1478.3848028264,"_hash":3989268391,"paid_only":false,"cont_title":"第 181 场周赛","cont_title_slug":"weekly-contest-181"},{"question_id":2909,"title":"元素和最小的山形三元组 II","title_slug":"minimum-sum-of-mountain-triplets-ii","rating":1478.8676835951,"_hash":343052836,"paid_only":false,"cont_title":"第 368 场周赛","cont_title_slug":"weekly-contest-368"},{"question_id":1166,"title":"设计文件系统","title_slug":"design-file-system","rating":1479.0110934646,"_hash":3000728502,"paid_only":false,"cont_title":"第 7 场双周赛","cont_title_slug":"biweekly-contest-7"},{"question_id":1545,"title":"找出第 N 个二进制字符串中的第 K 位","title_slug":"find-kth-bit-in-nth-binary-string","rating":1479.4837595809,"_hash":886158615,"paid_only":false,"cont_title":"第 201 场周赛","cont_title_slug":"weekly-contest-201"},{"question_id":2914,"title":"使二进制字符串变美丽的最少修改次数","title_slug":"minimum-number-of-changes-to-make-binary-string-beautiful","rating":1479.6908339113,"_hash":1033555490,"paid_only":false,"cont_title":"第 116 场双周赛","cont_title_slug":"biweekly-contest-116"},{"question_id":2501,"title":"数组中最长的方波","title_slug":"longest-square-streak-in-an-array","rating":1479.9828219111,"_hash":4224854568,"paid_only":false,"cont_title":"第 323 场周赛","cont_title_slug":"weekly-contest-323"},{"question_id":1087,"title":"花括号展开","title_slug":"brace-expansion","rating":1480.1116248664,"_hash":3506344616,"paid_only":false,"cont_title":"第 2 场双周赛","cont_title_slug":"biweekly-contest-2"},{"question_id":3006,"title":"找出数组中的美丽下标 I","title_slug":"find-beautiful-indices-in-the-given-array-i","rating":1480.1120711991,"_hash":3437839264,"paid_only":false,"cont_title":"第 380 场周赛","cont_title_slug":"weekly-contest-380"},{"question_id":2380,"title":"二进制字符串重新安排顺序需要的时间","title_slug":"time-needed-to-rearrange-a-binary-string","rating":1481.1046340847,"_hash":147891676,"paid_only":false,"cont_title":"第 85 场双周赛","cont_title_slug":"biweekly-contest-85"},{"question_id":1167,"title":"连接木棍的最低费用","title_slug":"minimum-cost-to-connect-sticks","rating":1481.5701319876,"_hash":4211026934,"paid_only":false,"cont_title":"第 7 场双周赛","cont_title_slug":"biweekly-contest-7"},{"question_id":1807,"title":"替换字符串中的括号内容","title_slug":"evaluate-the-bracket-pairs-of-a-string","rating":1481.960807786,"_hash":59428399,"paid_only":false,"cont_title":"第 234 场周赛","cont_title_slug":"weekly-contest-234"},{"question_id":2904,"title":"最短且字典序最小的美丽子字符串","title_slug":"shortest-and-lexicographically-smallest-beautiful-string","rating":1483.3041242255,"_hash":2613979956,"paid_only":false,"cont_title":"第 367 场周赛","cont_title_slug":"weekly-contest-367"},{"question_id":1314,"title":"矩阵区域和","title_slug":"matrix-block-sum","rating":1483.8137189709,"_hash":2353125510,"paid_only":false,"cont_title":"第 17 场双周赛","cont_title_slug":"biweekly-contest-17"},{"question_id":2789,"title":"合并后数组中的最大元素","title_slug":"largest-element-in-an-array-after-merge-operations","rating":1484.8385256564,"_hash":4141047313,"paid_only":false,"cont_title":"第 355 场周赛","cont_title_slug":"weekly-contest-355"},{"question_id":1418,"title":"点菜展示表","title_slug":"display-table-of-food-orders-in-a-restaurant","rating":1485.135401269,"_hash":3975371411,"paid_only":false,"cont_title":"第 185 场周赛","cont_title_slug":"weekly-contest-185"},{"question_id":1190,"title":"反转每对括号间的子串","title_slug":"reverse-substrings-between-each-pair-of-parentheses","rating":1485.6550472186,"_hash":1038307939,"paid_only":false,"cont_title":"第 154 场周赛","cont_title_slug":"weekly-contest-154"},{"question_id":2840,"title":"判断通过操作能否让字符串相等 II","title_slug":"check-if-strings-can-be-made-equal-with-operations-ii","rating":1486.2147876747,"_hash":83229717,"paid_only":false,"cont_title":"第 112 场双周赛","cont_title_slug":"biweekly-contest-112"},{"question_id":1566,"title":"重复至少 K 次且长度为 M 的模式","title_slug":"detect-pattern-of-length-m-repeated-k-or-more-times","rating":1486.4687014051,"_hash":843769556,"paid_only":false,"cont_title":"第 204 场周赛","cont_title_slug":"weekly-contest-204"},{"question_id":1637,"title":"两点之间不包含任何点的最宽垂直区域","title_slug":"widest-vertical-area-between-two-points-containing-no-points","rating":1486.764933431,"_hash":3608687869,"paid_only":false,"cont_title":"第 38 场双周赛","cont_title_slug":"biweekly-contest-38"},{"question_id":1753,"title":"移除石子的最大得分","title_slug":"maximum-score-from-removing-stones","rating":1487.5826663483,"_hash":185620528,"paid_only":false,"cont_title":"第 227 场周赛","cont_title_slug":"weekly-contest-227"},{"question_id":1175,"title":"质数排列","title_slug":"prime-arrangements","rating":1489.0102202162,"_hash":3007102778,"paid_only":false,"cont_title":"第 152 场周赛","cont_title_slug":"weekly-contest-152"},{"question_id":2658,"title":"网格图中鱼的最大数目","title_slug":"maximum-number-of-fish-in-a-grid","rating":1489.7210915287,"_hash":2383092679,"paid_only":false,"cont_title":"第 103 场双周赛","cont_title_slug":"biweekly-contest-103"},{"question_id":1296,"title":"划分数组为连续数字的集合","title_slug":"divide-array-in-sets-of-k-consecutive-numbers","rating":1490.2370387981,"_hash":2249312740,"paid_only":false,"cont_title":"第 168 场周赛","cont_title_slug":"weekly-contest-168"},{"question_id":1759,"title":"统计同质子字符串的数目","title_slug":"count-number-of-homogenous-substrings","rating":1490.8990184504,"_hash":2434134348,"paid_only":false,"cont_title":"第 228 场周赛","cont_title_slug":"weekly-contest-228"},{"question_id":1806,"title":"还原排列的最少操作步数","title_slug":"minimum-number-of-operations-to-reinitialize-a-permutation","rating":1491.4638194905,"_hash":3052741649,"paid_only":false,"cont_title":"第 234 场周赛","cont_title_slug":"weekly-contest-234"},{"question_id":2483,"title":"商店的最少代价","title_slug":"minimum-penalty-for-a-shop","rating":1494.500749598,"_hash":480223586,"paid_only":false,"cont_title":"第 92 场双周赛","cont_title_slug":"biweekly-contest-92"},{"question_id":949,"title":"给定数字能组成的最大时间","title_slug":"largest-time-for-given-digits","rating":1495.3186477678,"_hash":1800599582,"paid_only":false,"cont_title":"第 113 场周赛","cont_title_slug":"weekly-contest-113"},{"question_id":2419,"title":"按位与最大的最长子数组","title_slug":"longest-subarray-with-maximum-bitwise-and","rating":1495.5180147817,"_hash":119361315,"paid_only":false,"cont_title":"第 312 场周赛","cont_title_slug":"weekly-contest-312"},{"question_id":1685,"title":"有序数组中差绝对值之和","title_slug":"sum-of-absolute-differences-in-a-sorted-array","rating":1495.715740828,"_hash":3892578893,"paid_only":false,"cont_title":"第 41 场双周赛","cont_title_slug":"biweekly-contest-41"},{"question_id":2191,"title":"将杂乱无章的数字排序","title_slug":"sort-the-jumbled-numbers","rating":1496.1462748679,"_hash":2695613806,"paid_only":false,"cont_title":"第 73 场双周赛","cont_title_slug":"biweekly-contest-73"},{"question_id":2285,"title":"道路的最大总重要性","title_slug":"maximum-total-importance-of-roads","rating":1496.2502937005,"_hash":3248412457,"paid_only":false,"cont_title":"第 79 场双周赛","cont_title_slug":"biweekly-contest-79"},{"question_id":3011,"title":"判断一个数组是否可以变为有序","title_slug":"find-if-array-can-be-sorted","rating":1496.6441112156,"_hash":1890921841,"paid_only":false,"cont_title":"第 122 场双周赛","cont_title_slug":"biweekly-contest-122"},{"question_id":1208,"title":"尽可能使字符串相等","title_slug":"get-equal-substrings-within-budget","rating":1496.9128643588,"_hash":3812471555,"paid_only":false,"cont_title":"第 156 场周赛","cont_title_slug":"weekly-contest-156"},{"question_id":998,"title":"最大二叉树 II","title_slug":"maximum-binary-tree-ii","rating":1497.8880991093,"_hash":3866325213,"paid_only":false,"cont_title":"第 125 场周赛","cont_title_slug":"weekly-contest-125"},{"question_id":1904,"title":"你完成的完整对局数","title_slug":"the-number-of-full-rounds-you-have-played","rating":1498.1542511841,"_hash":1871665913,"paid_only":false,"cont_title":"第 246 场周赛","cont_title_slug":"weekly-contest-246"},{"question_id":1968,"title":"构造元素不等于两相邻元素平均值的数组","title_slug":"array-with-elements-not-equal-to-average-of-neighbors","rating":1499.3290269267,"_hash":3221222128,"paid_only":false,"cont_title":"第 254 场周赛","cont_title_slug":"weekly-contest-254"},{"question_id":2507,"title":"使用质因数之和替换后可以取到的最小值","title_slug":"smallest-value-after-replacing-with-sum-of-prime-factors","rating":1499.5903720292,"_hash":1529011687,"paid_only":false,"cont_title":"第 324 场周赛","cont_title_slug":"weekly-contest-324"},{"question_id":1525,"title":"字符串的好分割数目","title_slug":"number-of-good-ways-to-split-a-string","rating":1499.7136257352,"_hash":1226888142,"paid_only":false,"cont_title":"第 31 场双周赛","cont_title_slug":"biweekly-contest-31"},{"question_id":915,"title":"分割数组","title_slug":"partition-array-into-disjoint-intervals","rating":1500.8381829812,"_hash":217546662,"paid_only":false,"cont_title":"第 104 场周赛","cont_title_slug":"weekly-contest-104"},{"question_id":1090,"title":"受标签影响的最大值","title_slug":"largest-values-from-labels","rating":1501.1152614679,"_hash":2513980161,"paid_only":false,"cont_title":"第 141 场周赛","cont_title_slug":"weekly-contest-141"},{"question_id":1750,"title":"删除字符串两端相同字符后的最短长度","title_slug":"minimum-length-of-string-after-deleting-similar-ends","rating":1501.6846714598,"_hash":3164365433,"paid_only":false,"cont_title":"第 45 场双周赛","cont_title_slug":"biweekly-contest-45"},{"question_id":2730,"title":"找到最长的半重复子字符串","title_slug":"find-the-longest-semi-repetitive-substring","rating":1501.9080845668,"_hash":4064007490,"paid_only":false,"cont_title":"第 106 场双周赛","cont_title_slug":"biweekly-contest-106"},{"question_id":2708,"title":"一个小组的最大实力值","title_slug":"maximum-strength-of-a-group","rating":1502.2633100489,"_hash":3413400617,"paid_only":false,"cont_title":"第 105 场双周赛","cont_title_slug":"biweekly-contest-105"},{"question_id":2358,"title":"分组的最大数量","title_slug":"maximum-number-of-groups-entering-a-competition","rating":1502.5363677723,"_hash":419099305,"paid_only":false,"cont_title":"第 304 场周赛","cont_title_slug":"weekly-contest-304"},{"question_id":2661,"title":"找出叠涂元素","title_slug":"first-completely-painted-row-or-column","rating":1502.6623568929,"_hash":637661898,"paid_only":false,"cont_title":"第 343 场周赛","cont_title_slug":"weekly-contest-343"},{"question_id":1461,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","title_slug":"check-if-a-string-contains-all-binary-codes-of-size-k","rating":1504.0178888667,"_hash":1013970586,"paid_only":false,"cont_title":"第 27 场双周赛","cont_title_slug":"biweekly-contest-27"},{"question_id":2104,"title":"子数组范围和","title_slug":"sum-of-subarray-ranges","rating":1504.2133321504,"_hash":91788639,"paid_only":false,"cont_title":"第 271 场周赛","cont_title_slug":"weekly-contest-271"},{"question_id":869,"title":"重新排序得到 2 的幂","title_slug":"reordered-power-of-2","rating":1504.8237159326,"_hash":2235555306,"paid_only":false,"cont_title":"第 93 场周赛","cont_title_slug":"weekly-contest-93"},{"question_id":2761,"title":"和等于目标值的质数对","title_slug":"prime-pairs-with-target-sum","rating":1504.9263037499,"_hash":2664015237,"paid_only":false,"cont_title":"第 352 场周赛","cont_title_slug":"weekly-contest-352"},{"question_id":2981,"title":"找出出现至少三次的最长特殊子字符串 I","title_slug":"find-longest-special-substring-that-occurs-thrice-i","rating":1505.3120825678,"_hash":1645223251,"paid_only":false,"cont_title":"第 378 场周赛","cont_title_slug":"weekly-contest-378"},{"question_id":1780,"title":"判断一个数字是否可以表示成三的幂的和","title_slug":"check-if-number-is-a-sum-of-powers-of-three","rating":1505.82499953,"_hash":2201981126,"paid_only":false,"cont_title":"第 47 场双周赛","cont_title_slug":"biweekly-contest-47"},{"question_id":1253,"title":"重构 2 行二进制矩阵","title_slug":"reconstruct-a-2-row-binary-matrix","rating":1505.8669082864,"_hash":1498707721,"paid_only":false,"cont_title":"第 162 场周赛","cont_title_slug":"weekly-contest-162"},{"question_id":1387,"title":"将整数按权重排序","title_slug":"sort-integers-by-the-power-value","rating":1506.8958220609,"_hash":3793928653,"paid_only":false,"cont_title":"第 22 场双周赛","cont_title_slug":"biweekly-contest-22"},{"question_id":2105,"title":"给植物浇水 II","title_slug":"watering-plants-ii","rating":1507.1617507911,"_hash":1947285534,"paid_only":false,"cont_title":"第 271 场周赛","cont_title_slug":"weekly-contest-271"},{"question_id":892,"title":"三维形体的表面积","title_slug":"surface-area-of-3d-shapes","rating":1507.8701119064,"_hash":1063164797,"paid_only":false,"cont_title":"第 99 场周赛","cont_title_slug":"weekly-contest-99"},{"question_id":1496,"title":"判断路径是否相交","title_slug":"path-crossing","rating":1508.099765827,"_hash":3461348977,"paid_only":false,"cont_title":"第 195 场周赛","cont_title_slug":"weekly-contest-195"},{"question_id":1151,"title":"最少交换次数来组合所有的 1","title_slug":"minimum-swaps-to-group-all-1s-together","rating":1508.1169489285,"_hash":324121992,"paid_only":false,"cont_title":"第 6 场双周赛","cont_title_slug":"biweekly-contest-6"},{"question_id":1647,"title":"字符频次唯一的最小删除次数","title_slug":"minimum-deletions-to-make-character-frequencies-unique","rating":1509.5432131875,"_hash":2693685785,"paid_only":false,"cont_title":"第 214 场周赛","cont_title_slug":"weekly-contest-214"},{"question_id":2216,"title":"美化数组的最少删除数","title_slug":"minimum-deletions-to-make-array-beautiful","rating":1509.5562928491,"_hash":705189000,"paid_only":false,"cont_title":"第 286 场周赛","cont_title_slug":"weekly-contest-286"},{"question_id":2671,"title":"频率跟踪器","title_slug":"frequency-tracker","rating":1509.6237874441,"_hash":3589033912,"paid_only":false,"cont_title":"第 344 场周赛","cont_title_slug":"weekly-contest-344"},{"question_id":1110,"title":"删点成林","title_slug":"delete-nodes-and-return-forest","rating":1511.3725353467,"_hash":771122731,"paid_only":false,"cont_title":"第 144 场周赛","cont_title_slug":"weekly-contest-144"},{"question_id":1557,"title":"可以到达所有点的最少点数目","title_slug":"minimum-number-of-vertices-to-reach-all-nodes","rating":1512.3323577063,"_hash":4183393481,"paid_only":false,"cont_title":"第 33 场双周赛","cont_title_slug":"biweekly-contest-33"},{"question_id":1855,"title":"下标对中的最大距离","title_slug":"maximum-distance-between-a-pair-of-values","rating":1514.8181710611,"_hash":4071175900,"paid_only":false,"cont_title":"第 240 场周赛","cont_title_slug":"weekly-contest-240"},{"question_id":2849,"title":"判断能否在给定时间到达单元格","title_slug":"determine-if-a-cell-is-reachable-at-a-given-time","rating":1515.1162664342,"_hash":3371445858,"paid_only":false,"cont_title":"第 362 场周赛","cont_title_slug":"weekly-contest-362"},{"question_id":904,"title":"水果成篮","title_slug":"fruit-into-baskets","rating":1516.4104902196,"_hash":123050212,"paid_only":false,"cont_title":"第 102 场周赛","cont_title_slug":"weekly-contest-102"},{"question_id":2683,"title":"相邻值的按位异或","title_slug":"neighboring-bitwise-xor","rating":1517.8263048447,"_hash":78641139,"paid_only":false,"cont_title":"第 345 场周赛","cont_title_slug":"weekly-contest-345"},{"question_id":1641,"title":"统计字典序元音字符串的数目","title_slug":"count-sorted-vowel-strings","rating":1519.1715594347,"_hash":2576790821,"paid_only":false,"cont_title":"第 213 场周赛","cont_title_slug":"weekly-contest-213"},{"question_id":2865,"title":"美丽塔 I","title_slug":"beautiful-towers-i","rating":1519.2070276362,"_hash":19753391,"paid_only":false,"cont_title":"第 364 场周赛","cont_title_slug":"weekly-contest-364"},{"question_id":2971,"title":"找到最大周长的多边形","title_slug":"find-polygon-with-the-largest-perimeter","rating":1521.1616133347,"_hash":2510517613,"paid_only":false,"cont_title":"第 120 场双周赛","cont_title_slug":"biweekly-contest-120"},{"question_id":1041,"title":"困于环中的机器人","title_slug":"robot-bounded-in-circle","rating":1521.1768537583,"_hash":2777625264,"paid_only":false,"cont_title":"第 136 场周赛","cont_title_slug":"weekly-contest-136"},{"question_id":1763,"title":"最长的美好子字符串","title_slug":"longest-nice-substring","rating":1521.7133617698,"_hash":2102124703,"paid_only":false,"cont_title":"第 46 场双周赛","cont_title_slug":"biweekly-contest-46"},{"question_id":1615,"title":"最大网络秩","title_slug":"maximal-network-rank","rating":1521.9977490324,"_hash":3529094278,"paid_only":false,"cont_title":"第 210 场周赛","cont_title_slug":"weekly-contest-210"},{"question_id":1829,"title":"每个查询的最大异或值","title_slug":"maximum-xor-for-each-query","rating":1523.4113866454,"_hash":246275746,"paid_only":false,"cont_title":"第 50 场双周赛","cont_title_slug":"biweekly-contest-50"},{"question_id":1640,"title":"能否连接形成数组","title_slug":"check-array-formation-through-concatenation","rating":1524.3227469,"_hash":1530442140,"paid_only":false,"cont_title":"第 213 场周赛","cont_title_slug":"weekly-contest-213"},{"question_id":1442,"title":"形成两个异或相等数组的三元组数目","title_slug":"count-triplets-that-can-form-two-arrays-of-equal-xor","rating":1524.5693481538,"_hash":594551983,"paid_only":false,"cont_title":"第 188 场周赛","cont_title_slug":"weekly-contest-188"},{"question_id":2997,"title":"使数组异或和等于 K 的最少操作次数","title_slug":"minimum-number-of-operations-to-make-array-xor-equal-to-k","rating":1524.5856276651,"_hash":1320293684,"paid_only":false,"cont_title":"第 121 场双周赛","cont_title_slug":"biweekly-contest-121"},{"question_id":1272,"title":"删除区间","title_slug":"remove-interval","rating":1524.8218282113,"_hash":760128905,"paid_only":false,"cont_title":"第 14 场双周赛","cont_title_slug":"biweekly-contest-14"},{"question_id":2201,"title":"统计可以提取的工件","title_slug":"count-artifacts-that-can-be-extracted","rating":1525.2146106195,"_hash":1716625654,"paid_only":false,"cont_title":"第 284 场周赛","cont_title_slug":"weekly-contest-284"},{"question_id":2918,"title":"数组的最小相等和","title_slug":"minimum-equal-sum-of-two-arrays-after-replacing-zeros","rating":1526.2429110307,"_hash":2619603225,"paid_only":false,"cont_title":"第 369 场周赛","cont_title_slug":"weekly-contest-369"},{"question_id":1921,"title":"消灭怪物的最大数量","title_slug":"eliminate-maximum-number-of-monsters","rating":1527.6868660176,"_hash":119954396,"paid_only":false,"cont_title":"第 248 场周赛","cont_title_slug":"weekly-contest-248"},{"question_id":1695,"title":"删除子数组的最大得分","title_slug":"maximum-erasure-value","rating":1528.7183829005,"_hash":3972794115,"paid_only":false,"cont_title":"第 220 场周赛","cont_title_slug":"weekly-contest-220"},{"question_id":881,"title":"救生艇","title_slug":"boats-to-save-people","rating":1529.7617243868,"_hash":559582932,"paid_only":false,"cont_title":"第 96 场周赛","cont_title_slug":"weekly-contest-96"},{"question_id":1726,"title":"同积元组","title_slug":"tuple-with-same-product","rating":1530.0343519239,"_hash":3977989551,"paid_only":false,"cont_title":"第 224 场周赛","cont_title_slug":"weekly-contest-224"},{"question_id":1657,"title":"确定两个字符串是否接近","title_slug":"determine-if-two-strings-are-close","rating":1530.4652027753,"_hash":132633492,"paid_only":false,"cont_title":"第 215 场周赛","cont_title_slug":"weekly-contest-215"},{"question_id":1400,"title":"构造 K 个回文字符串","title_slug":"construct-k-palindrome-strings","rating":1530.495439788,"_hash":2205913729,"paid_only":false,"cont_title":"第 23 场双周赛","cont_title_slug":"biweekly-contest-23"},{"question_id":2591,"title":"将钱分给最多的儿童","title_slug":"distribute-money-to-maximum-children","rating":1530.6451141787,"_hash":2074713320,"paid_only":false,"cont_title":"第 100 场双周赛","cont_title_slug":"biweekly-contest-100"},{"question_id":900,"title":"RLE 迭代器","title_slug":"rle-iterator","rating":1532.2539947529,"_hash":2874032831,"paid_only":false,"cont_title":"第 101 场周赛","cont_title_slug":"weekly-contest-101"},{"question_id":2429,"title":"最小异或","title_slug":"minimize-xor","rating":1532.3349133769,"_hash":2645404069,"paid_only":false,"cont_title":"第 313 场周赛","cont_title_slug":"weekly-contest-313"},{"question_id":1930,"title":"长度为 3 的不同回文子序列","title_slug":"unique-length-3-palindromic-subsequences","rating":1533.3376144199,"_hash":2661403855,"paid_only":false,"cont_title":"第 249 场周赛","cont_title_slug":"weekly-contest-249"},{"question_id":2770,"title":"达到末尾下标所需的最大跳跃次数","title_slug":"maximum-number-of-jumps-to-reach-the-last-index","rating":1533.47383662,"_hash":4000844273,"paid_only":false,"cont_title":"第 353 场周赛","cont_title_slug":"weekly-contest-353"},{"question_id":3016,"title":"输入单词需要的最少按键次数 II","title_slug":"minimum-number-of-pushes-to-type-word-ii","rating":1533.5722750742,"_hash":1089101531,"paid_only":false,"cont_title":"第 381 场周赛","cont_title_slug":"weekly-contest-381"},{"question_id":1362,"title":"最接近的因数","title_slug":"closest-divisors","rating":1533.9285875234,"_hash":2721035468,"paid_only":false,"cont_title":"第 177 场周赛","cont_title_slug":"weekly-contest-177"},{"question_id":1797,"title":"设计一个验证系统","title_slug":"design-authentication-manager","rating":1534.0648719302,"_hash":3736820092,"paid_only":false,"cont_title":"第 48 场双周赛","cont_title_slug":"biweekly-contest-48"},{"question_id":865,"title":"具有所有最深节点的最小子树","title_slug":"smallest-subtree-with-all-the-deepest-nodes","rating":1534.325005151,"_hash":3353015937,"paid_only":false,"cont_title":"第 92 场周赛","cont_title_slug":"weekly-contest-92"},{"question_id":2958,"title":"最多 K 个重复元素的最长子数组","title_slug":"length-of-longest-subarray-with-at-most-k-frequency","rating":1535.3680469616,"_hash":614687136,"paid_only":false,"cont_title":"第 119 场双周赛","cont_title_slug":"biweekly-contest-119"},{"question_id":2933,"title":"高访问员工","title_slug":"high-access-employees","rating":1536.5893223179,"_hash":3211790430,"paid_only":false,"cont_title":"第 371 场周赛","cont_title_slug":"weekly-contest-371"},{"question_id":1861,"title":"旋转盒子","title_slug":"rotating-the-box","rating":1536.7018543075,"_hash":3272610079,"paid_only":false,"cont_title":"第 52 场双周赛","cont_title_slug":"biweekly-contest-52"},{"question_id":1023,"title":"驼峰式匹配","title_slug":"camelcase-matching","rating":1537.1387686755,"_hash":875418963,"paid_only":false,"cont_title":"第 131 场周赛","cont_title_slug":"weekly-contest-131"},{"question_id":2178,"title":"拆分成最多数目的正偶数之和","title_slug":"maximum-split-of-positive-even-integers","rating":1538.233149704,"_hash":3655265099,"paid_only":false,"cont_title":"第 72 场双周赛","cont_title_slug":"biweekly-contest-72"},{"question_id":1992,"title":"找到所有的农场组","title_slug":"find-all-groups-of-farmland","rating":1539.2250193318,"_hash":3674750599,"paid_only":false,"cont_title":"第 60 场双周赛","cont_title_slug":"biweekly-contest-60"},{"question_id":2349,"title":"设计数字容器系统","title_slug":"design-a-number-container-system","rating":1540.2351411176,"_hash":2500271603,"paid_only":false,"cont_title":"第 83 场双周赛","cont_title_slug":"biweekly-contest-83"},{"question_id":1382,"title":"将二叉搜索树变平衡","title_slug":"balance-a-binary-search-tree","rating":1540.5750839091,"_hash":1937730923,"paid_only":false,"cont_title":"第 180 场周赛","cont_title_slug":"weekly-contest-180"},{"question_id":1229,"title":"安排会议日程","title_slug":"meeting-scheduler","rating":1541.2260256298,"_hash":3772256778,"paid_only":false,"cont_title":"第 11 场双周赛","cont_title_slug":"biweekly-contest-11"},{"question_id":1007,"title":"行相等的最少多米诺旋转","title_slug":"minimum-domino-rotations-for-equal-row","rating":1541.348438509,"_hash":2150121610,"paid_only":false,"cont_title":"第 127 场周赛","cont_title_slug":"weekly-contest-127"},{"question_id":2575,"title":"找出字符串的可整除数组","title_slug":"find-the-divisibility-array-of-a-string","rating":1541.3741526845,"_hash":2410692850,"paid_only":false,"cont_title":"第 334 场周赛","cont_title_slug":"weekly-contest-334"},{"question_id":1209,"title":"删除字符串中的所有相邻重复项 II","title_slug":"remove-all-adjacent-duplicates-in-string-ii","rating":1541.5405749918,"_hash":1577638784,"paid_only":false,"cont_title":"第 156 场周赛","cont_title_slug":"weekly-contest-156"},{"question_id":1749,"title":"任意子数组和的绝对值的最大值","title_slug":"maximum-absolute-sum-of-any-subarray","rating":1541.6176288991,"_hash":3267047320,"paid_only":false,"cont_title":"第 45 场双周赛","cont_title_slug":"biweekly-contest-45"},{"question_id":986,"title":"区间列表的交集","title_slug":"interval-list-intersections","rating":1541.6944600975,"_hash":3869891296,"paid_only":false,"cont_title":"第 122 场周赛","cont_title_slug":"weekly-contest-122"},{"question_id":1283,"title":"使结果不超过阈值的最小除数","title_slug":"find-the-smallest-divisor-given-a-threshold","rating":1541.7840320661,"_hash":278493845,"paid_only":false,"cont_title":"第 166 场周赛","cont_title_slug":"weekly-contest-166"},{"question_id":2811,"title":"判断是否能拆分数组","title_slug":"check-if-it-is-possible-to-split-array","rating":1543.1204810684,"_hash":335140403,"paid_only":false,"cont_title":"第 357 场周赛","cont_title_slug":"weekly-contest-357"},{"question_id":1233,"title":"删除子文件夹","title_slug":"remove-sub-folders-from-the-filesystem","rating":1544.8261365027,"_hash":4057878205,"paid_only":false,"cont_title":"第 159 场周赛","cont_title_slug":"weekly-contest-159"},{"question_id":1104,"title":"二叉树寻路","title_slug":"path-in-zigzag-labelled-binary-tree","rating":1544.8391626032,"_hash":1959869314,"paid_only":false,"cont_title":"第 143 场周赛","cont_title_slug":"weekly-contest-143"},{"question_id":2841,"title":"几乎唯一子数组的最大和","title_slug":"maximum-sum-of-almost-unique-subarray","rating":1545.9654593951,"_hash":1879020884,"paid_only":false,"cont_title":"第 112 场双周赛","cont_title_slug":"biweekly-contest-112"},{"question_id":954,"title":"二倍数对数组","title_slug":"array-of-doubled-pairs","rating":1547.5714796512,"_hash":3671857466,"paid_only":false,"cont_title":"第 114 场周赛","cont_title_slug":"weekly-contest-114"},{"question_id":1599,"title":"经营摩天轮的最大利润","title_slug":"maximum-profit-of-operating-a-centennial-wheel","rating":1548.0854419238,"_hash":2972412900,"paid_only":false,"cont_title":"第 208 场周赛","cont_title_slug":"weekly-contest-208"},{"question_id":2456,"title":"最流行的视频创作者","title_slug":"most-popular-video-creator","rating":1548.1751146981,"_hash":3143101757,"paid_only":false,"cont_title":"第 317 场周赛","cont_title_slug":"weekly-contest-317"},{"question_id":1329,"title":"将矩阵按对角线排序","title_slug":"sort-the-matrix-diagonally","rating":1548.4678056182,"_hash":1786656286,"paid_only":false,"cont_title":"第 18 场双周赛","cont_title_slug":"biweekly-contest-18"},{"question_id":2527,"title":"查询数组异或美丽值","title_slug":"find-xor-beauty-of-array","rating":1549.945040184,"_hash":1501707049,"paid_only":false,"cont_title":"第 95 场双周赛","cont_title_slug":"biweekly-contest-95"},{"question_id":2780,"title":"合法分割的最小下标","title_slug":"minimum-index-of-a-valid-split","rating":1549.9747683007,"_hash":228115268,"paid_only":false,"cont_title":"第 354 场周赛","cont_title_slug":"weekly-contest-354"},{"question_id":2208,"title":"将数组和减半的最少操作次数","title_slug":"minimum-operations-to-halve-array-sum","rating":1550.0978082682,"_hash":3403473925,"paid_only":false,"cont_title":"第 74 场双周赛","cont_title_slug":"biweekly-contest-74"},{"question_id":2207,"title":"字符串中最多数目的子序列","title_slug":"maximize-number-of-subsequences-in-a-string","rating":1550.4297615307,"_hash":2887492330,"paid_only":false,"cont_title":"第 74 场双周赛","cont_title_slug":"biweekly-contest-74"},{"question_id":2461,"title":"长度为 K 子数组中的最大和","title_slug":"maximum-sum-of-distinct-subarrays-with-length-k","rating":1552.8935571247,"_hash":3738097801,"paid_only":false,"cont_title":"第 318 场周赛","cont_title_slug":"weekly-contest-318"},{"question_id":2131,"title":"连接两字母单词得到的最长回文串","title_slug":"longest-palindrome-by-concatenating-two-letter-words","rating":1556.8824239708,"_hash":2977235574,"paid_only":false,"cont_title":"第 69 场双周赛","cont_title_slug":"biweekly-contest-69"},{"question_id":2007,"title":"从双倍数组中还原原数组","title_slug":"find-original-array-from-doubled-array","rating":1557.017055582,"_hash":1395581223,"paid_only":false,"cont_title":"第 61 场双周赛","cont_title_slug":"biweekly-contest-61"},{"question_id":1243,"title":"数组变换","title_slug":"array-transformation","rating":1558.1421869292,"_hash":2980355580,"paid_only":false,"cont_title":"第 12 场双周赛","cont_title_slug":"biweekly-contest-12"},{"question_id":1101,"title":"彼此熟识的最早时间","title_slug":"the-earliest-moment-when-everyone-become-friends","rating":1558.4971807039,"_hash":234159120,"paid_only":false,"cont_title":"第 3 场双周赛","cont_title_slug":"biweekly-contest-3"},{"question_id":1181,"title":"前后拼接","title_slug":"before-and-after-puzzle","rating":1558.6880035344,"_hash":4191223408,"paid_only":false,"cont_title":"第 8 场双周赛","cont_title_slug":"biweekly-contest-8"},{"question_id":1144,"title":"递减元素使数组呈锯齿状","title_slug":"decrease-elements-to-make-array-zigzag","rating":1558.7188539503,"_hash":109606469,"paid_only":false,"cont_title":"第 148 场周赛","cont_title_slug":"weekly-contest-148"},{"question_id":2310,"title":"个位数字为 K 的整数之和","title_slug":"sum-of-numbers-with-units-digit-k","rating":1558.9522968448,"_hash":3729897578,"paid_only":false,"cont_title":"第 298 场周赛","cont_title_slug":"weekly-contest-298"},{"question_id":2470,"title":"最小公倍数为 K 的子数组数目","title_slug":"number-of-subarrays-with-lcm-equal-to-k","rating":1559.9709348417,"_hash":2715109000,"paid_only":false,"cont_title":"第 319 场周赛","cont_title_slug":"weekly-contest-319"},{"question_id":1376,"title":"通知所有员工所需的时间","title_slug":"time-needed-to-inform-all-employees","rating":1561.0553908973,"_hash":2222019296,"paid_only":false,"cont_title":"第 179 场周赛","cont_title_slug":"weekly-contest-179"},{"question_id":1256,"title":"加密数字","title_slug":"encode-number","rating":1561.2655635205,"_hash":2428818859,"paid_only":false,"cont_title":"第 13 场双周赛","cont_title_slug":"biweekly-contest-13"},{"question_id":2409,"title":"统计共同度过的日子数","title_slug":"count-days-spent-together","rating":1562.0956544608,"_hash":3761575610,"paid_only":false,"cont_title":"第 87 场双周赛","cont_title_slug":"biweekly-contest-87"},{"question_id":856,"title":"括号的分数","title_slug":"score-of-parentheses","rating":1562.7212466716,"_hash":2871847316,"paid_only":false,"cont_title":"第 90 场周赛","cont_title_slug":"weekly-contest-90"},{"question_id":1452,"title":"收藏清单","title_slug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list","rating":1562.9186033202,"_hash":2809882420,"paid_only":false,"cont_title":"第 189 场周赛","cont_title_slug":"weekly-contest-189"},{"question_id":1008,"title":"前序遍历构造二叉搜索树","title_slug":"construct-binary-search-tree-from-preorder-traversal","rating":1562.9802666517,"_hash":4123515556,"paid_only":false,"cont_title":"第 127 场周赛","cont_title_slug":"weekly-contest-127"},{"question_id":2970,"title":"统计移除递增子数组的数目 I","title_slug":"count-the-number-of-incremovable-subarrays-i","rating":1563.2283814548,"_hash":1816814719,"paid_only":false,"cont_title":"第 120 场双周赛","cont_title_slug":"biweekly-contest-120"},{"question_id":846,"title":"一手顺子","title_slug":"hand-of-straights","rating":1565.2483424929,"_hash":2014057820,"paid_only":false,"cont_title":"第 87 场周赛","cont_title_slug":"weekly-contest-87"},{"question_id":2044,"title":"统计按位或能得到最大值的子集数目","title_slug":"count-number-of-maximum-bitwise-or-subsets","rating":1567.6884942977,"_hash":3480413551,"paid_only":false,"cont_title":"第 263 场周赛","cont_title_slug":"weekly-contest-263"},{"question_id":2592,"title":"最大化数组的伟大值","title_slug":"maximize-greatness-of-an-array","rating":1569.1579260438,"_hash":3063296642,"paid_only":false,"cont_title":"第 100 场双周赛","cont_title_slug":"biweekly-contest-100"},{"question_id":1109,"title":"航班预订统计","title_slug":"corporate-flight-bookings","rating":1569.7528744586,"_hash":545869308,"paid_only":false,"cont_title":"第 144 场周赛","cont_title_slug":"weekly-contest-144"},{"question_id":1019,"title":"链表中的下一个更大节点","title_slug":"next-greater-node-in-linked-list","rating":1570.8347522104,"_hash":1872980159,"paid_only":false,"cont_title":"第 130 场周赛","cont_title_slug":"weekly-contest-130"},{"question_id":931,"title":"下降路径最小和","title_slug":"minimum-falling-path-sum","rating":1573.2701790739,"_hash":3874484865,"paid_only":false,"cont_title":"第 108 场周赛","cont_title_slug":"weekly-contest-108"},{"question_id":1268,"title":"搜索推荐系统","title_slug":"search-suggestions-system","rating":1573.4042963622,"_hash":133627469,"paid_only":false,"cont_title":"第 164 场周赛","cont_title_slug":"weekly-contest-164"},{"question_id":1423,"title":"可获得的最大点数","title_slug":"maximum-points-you-can-obtain-from-cards","rating":1573.824807946,"_hash":3552570937,"paid_only":false,"cont_title":"第 186 场周赛","cont_title_slug":"weekly-contest-186"},{"question_id":1578,"title":"使绳子变成彩色的最短时间","title_slug":"minimum-time-to-make-rope-colorful","rating":1574.0392121288,"_hash":3548853356,"paid_only":false,"cont_title":"第 205 场周赛","cont_title_slug":"weekly-contest-205"},{"question_id":981,"title":"基于时间的键值存储","title_slug":"time-based-key-value-store","rating":1574.7542247682,"_hash":2074201652,"paid_only":false,"cont_title":"第 121 场周赛","cont_title_slug":"weekly-contest-121"},{"question_id":1415,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","title_slug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n","rating":1575.6324598387,"_hash":1620228801,"paid_only":false,"cont_title":"第 24 场双周赛","cont_title_slug":"biweekly-contest-24"},{"question_id":2288,"title":"价格减免","title_slug":"apply-discount-to-prices","rating":1577.1141767118,"_hash":1512857430,"paid_only":false,"cont_title":"第 295 场周赛","cont_title_slug":"weekly-contest-295"},{"question_id":1034,"title":"边界着色","title_slug":"coloring-a-border","rating":1578.8503818621,"_hash":345204207,"paid_only":false,"cont_title":"第 134 场周赛","cont_title_slug":"weekly-contest-134"},{"question_id":1743,"title":"从相邻元素对还原数组","title_slug":"restore-the-array-from-adjacent-pairs","rating":1579.2309881035,"_hash":1018399535,"paid_only":false,"cont_title":"第 226 场周赛","cont_title_slug":"weekly-contest-226"},{"question_id":1839,"title":"所有元音按顺序排布的最长子字符串","title_slug":"longest-substring-of-all-vowels-in-order","rating":1580.3620959714,"_hash":3250155411,"paid_only":false,"cont_title":"第 238 场周赛","cont_title_slug":"weekly-contest-238"},{"question_id":2765,"title":"最长交替子数组","title_slug":"longest-alternating-subarray","rating":1580.9748095835,"_hash":4130986647,"paid_only":false,"cont_title":"第 108 场双周赛","cont_title_slug":"biweekly-contest-108"},{"question_id":3021,"title":"Alice 和 Bob 玩鲜花游戏","title_slug":"alice-and-bob-playing-flower-game","rating":1581.4162718925,"_hash":1094471227,"paid_only":false,"cont_title":"第 382 场周赛","cont_title_slug":"weekly-contest-382"},{"question_id":2211,"title":"统计道路上的碰撞次数","title_slug":"count-collisions-on-a-road","rating":1581.4963716166,"_hash":1582953363,"paid_only":false,"cont_title":"第 285 场周赛","cont_title_slug":"weekly-contest-285"},{"question_id":2874,"title":"有序三元组中的最大值 II","title_slug":"maximum-value-of-an-ordered-triplet-ii","rating":1583.212966224,"_hash":3989118459,"paid_only":false,"cont_title":"第 365 场周赛","cont_title_slug":"weekly-contest-365"},{"question_id":2536,"title":"子矩阵元素加 1","title_slug":"increment-submatrices-by-one","rating":1583.3117784523,"_hash":3521973284,"paid_only":false,"cont_title":"第 328 场周赛","cont_title_slug":"weekly-contest-328"},{"question_id":1030,"title":"距离顺序排列矩阵单元格","title_slug":"matrix-cells-in-distance-order","rating":1585.5793143983,"_hash":3321963457,"paid_only":false,"cont_title":"第 133 场周赛","cont_title_slug":"weekly-contest-133"},{"question_id":1764,"title":"通过连接另一个数组的子数组得到一个数组","title_slug":"form-array-by-concatenating-subarrays-of-another-array","rating":1588.3835994255,"_hash":2182388811,"paid_only":false,"cont_title":"第 46 场双周赛","cont_title_slug":"biweekly-contest-46"},{"question_id":2844,"title":"生成特殊数字的最少操作","title_slug":"minimum-operations-to-make-a-special-number","rating":1588.4826339516,"_hash":492673087,"paid_only":false,"cont_title":"第 361 场周赛","cont_title_slug":"weekly-contest-361"},{"question_id":1813,"title":"句子相似性 III","title_slug":"sentence-similarity-iii","rating":1588.9690763997,"_hash":1688453804,"paid_only":false,"cont_title":"第 49 场双周赛","cont_title_slug":"biweekly-contest-49"},{"question_id":877,"title":"石子游戏","title_slug":"stone-game","rating":1590.0463215721,"_hash":3927702135,"paid_only":false,"cont_title":"第 95 场周赛","cont_title_slug":"weekly-contest-95"},{"question_id":893,"title":"特殊等价字符串组","title_slug":"groups-of-special-equivalent-strings","rating":1590.0883962313,"_hash":1402867741,"paid_only":false,"cont_title":"第 99 场周赛","cont_title_slug":"weekly-contest-99"},{"question_id":1664,"title":"生成平衡数组的方案数","title_slug":"ways-to-make-a-fair-array","rating":1590.269030833,"_hash":435507573,"paid_only":false,"cont_title":"第 216 场周赛","cont_title_slug":"weekly-contest-216"},{"question_id":1573,"title":"分割字符串的方案数","title_slug":"number-of-ways-to-split-a-string","rating":1590.547713663,"_hash":3464418220,"paid_only":false,"cont_title":"第 34 场双周赛","cont_title_slug":"biweekly-contest-34"},{"question_id":969,"title":"煎饼排序","title_slug":"pancake-sorting","rating":1590.5791055102,"_hash":1247027569,"paid_only":false,"cont_title":"第 118 场周赛","cont_title_slug":"weekly-contest-118"},{"question_id":1286,"title":"字母组合迭代器","title_slug":"iterator-for-combination","rating":1591.4725328821,"_hash":2534714311,"paid_only":false,"cont_title":"第 15 场双周赛","cont_title_slug":"biweekly-contest-15"},{"question_id":930,"title":"和相同的二元子数组","title_slug":"binary-subarrays-with-sum","rating":1591.5492530876,"_hash":1629689602,"paid_only":false,"cont_title":"第 108 场周赛","cont_title_slug":"weekly-contest-108"},{"question_id":1577,"title":"数的平方等于两数乘积的方法数","title_slug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers","rating":1593.8926580448,"_hash":1260215787,"paid_only":false,"cont_title":"第 205 场周赛","cont_title_slug":"weekly-contest-205"},{"question_id":2476,"title":"二叉搜索树最近节点查询","title_slug":"closest-nodes-queries-in-a-binary-search-tree","rating":1596.9852244916,"_hash":2732657659,"paid_only":false,"cont_title":"第 320 场周赛","cont_title_slug":"weekly-contest-320"},{"question_id":1247,"title":"交换字符使得字符串相同","title_slug":"minimum-swaps-to-make-strings-equal","rating":1597.0215918551,"_hash":3735372403,"paid_only":false,"cont_title":"第 161 场周赛","cont_title_slug":"weekly-contest-161"},{"question_id":1218,"title":"最长定差子序列","title_slug":"longest-arithmetic-subsequence-of-given-difference","rating":1597.1931473887,"_hash":1235853332,"paid_only":false,"cont_title":"第 157 场周赛","cont_title_slug":"weekly-contest-157"},{"question_id":2750,"title":"将数组划分成若干好子数组的方式","title_slug":"ways-to-split-array-into-good-subarrays","rating":1597.5718383661,"_hash":3518502488,"paid_only":false,"cont_title":"第 351 场周赛","cont_title_slug":"weekly-contest-351"},{"question_id":1048,"title":"最长字符串链","title_slug":"longest-string-chain","rating":1599.2720584736,"_hash":2048723677,"paid_only":false,"cont_title":"第 137 场周赛","cont_title_slug":"weekly-contest-137"},{"question_id":1864,"title":"构成交替字符串需要的最小交换次数","title_slug":"minimum-number-of-swaps-to-make-the-binary-string-alternating","rating":1600.5573262373,"_hash":1402633459,"paid_only":false,"cont_title":"第 241 场周赛","cont_title_slug":"weekly-contest-241"},{"question_id":926,"title":"将字符串翻转到单调递增","title_slug":"flip-string-to-monotone-increasing","rating":1601.511760532,"_hash":3457051682,"paid_only":false,"cont_title":"第 107 场周赛","cont_title_slug":"weekly-contest-107"},{"question_id":2249,"title":"统计圆内格点数目","title_slug":"count-lattice-points-inside-a-circle","rating":1602.7242171967,"_hash":2887915717,"paid_only":false,"cont_title":"第 290 场周赛","cont_title_slug":"weekly-contest-290"},{"question_id":2447,"title":"最大公因数等于 K 的子数组数目","title_slug":"number-of-subarrays-with-gcd-equal-to-k","rating":1602.7742849665,"_hash":4162714270,"paid_only":false,"cont_title":"第 316 场周赛","cont_title_slug":"weekly-contest-316"},{"question_id":2316,"title":"统计无向图中无法互相到达点对数","title_slug":"count-unreachable-pairs-of-nodes-in-an-undirected-graph","rating":1604.0695445163,"_hash":3627963576,"paid_only":false,"cont_title":"第 81 场双周赛","cont_title_slug":"biweekly-contest-81"},{"question_id":2424,"title":"最长上传前缀","title_slug":"longest-uploaded-prefix","rating":1604.1602280047,"_hash":718987035,"paid_only":false,"cont_title":"第 88 场双周赛","cont_title_slug":"biweekly-contest-88"},{"question_id":2522,"title":"将字符串分割成值不超过 K 的子字符串","title_slug":"partition-string-into-substrings-with-values-at-most-k","rating":1604.5128423093,"_hash":3561342867,"paid_only":false,"cont_title":"第 326 场周赛","cont_title_slug":"weekly-contest-326"},{"question_id":2546,"title":"执行逐位运算使字符串相等","title_slug":"apply-bitwise-operations-to-make-strings-equal","rating":1604.6299874552,"_hash":1537635707,"paid_only":false,"cont_title":"第 329 场周赛","cont_title_slug":"weekly-contest-329"},{"question_id":1604,"title":"警告一小时内使用相同员工卡大于等于三次的人","title_slug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period","rating":1606.2185826486,"_hash":1756727384,"paid_only":false,"cont_title":"第 36 场双周赛","cont_title_slug":"biweekly-contest-36"},{"question_id":1300,"title":"转变数组后最接近目标值的数组和","title_slug":"sum-of-mutated-array-closest-to-target","rating":1606.9895296459,"_hash":122134919,"paid_only":false,"cont_title":"第 16 场双周赛","cont_title_slug":"biweekly-contest-16"},{"question_id":1123,"title":"最深叶节点的最近公共祖先","title_slug":"lowest-common-ancestor-of-deepest-leaves","rating":1607.0005715974,"_hash":1997275023,"paid_only":false,"cont_title":"第 145 场周赛","cont_title_slug":"weekly-contest-145"},{"question_id":2745,"title":"构造最长的新字符串","title_slug":"construct-the-longest-new-string","rating":1607.4192947808,"_hash":4083216410,"paid_only":false,"cont_title":"第 107 场双周赛","cont_title_slug":"biweekly-contest-107"},{"question_id":2320,"title":"统计放置房子的方式数","title_slug":"count-number-of-ways-to-place-houses","rating":1607.7036437819,"_hash":2375816517,"paid_only":false,"cont_title":"第 299 场周赛","cont_title_slug":"weekly-contest-299"},{"question_id":962,"title":"最大宽度坡","title_slug":"maximum-width-ramp","rating":1607.80608595,"_hash":4064149855,"paid_only":false,"cont_title":"第 116 场周赛","cont_title_slug":"weekly-contest-116"},{"question_id":2567,"title":"修改两个元素的最小分数","title_slug":"minimum-score-by-changing-two-elements","rating":1608.577875807,"_hash":1785562293,"paid_only":false,"cont_title":"第 98 场双周赛","cont_title_slug":"biweekly-contest-98"},{"question_id":2438,"title":"二的幂数组中查询范围内的乘积","title_slug":"range-product-queries-of-powers","rating":1609.7858209851,"_hash":2397274802,"paid_only":false,"cont_title":"第 89 场双周赛","cont_title_slug":"biweekly-contest-89"},{"question_id":1670,"title":"设计前中后队列","title_slug":"design-front-middle-back-queue","rating":1610.1866391145,"_hash":1316461889,"paid_only":false,"cont_title":"第 40 场双周赛","cont_title_slug":"biweekly-contest-40"},{"question_id":1524,"title":"和为奇数的子数组数目","title_slug":"number-of-sub-arrays-with-odd-sum","rating":1610.569398159,"_hash":1757955047,"paid_only":false,"cont_title":"第 31 场双周赛","cont_title_slug":"biweekly-contest-31"},{"question_id":2232,"title":"向表达式添加括号后的最小结果","title_slug":"minimize-result-by-adding-parentheses-to-expression","rating":1611.8434720083,"_hash":989456575,"paid_only":false,"cont_title":"第 288 场周赛","cont_title_slug":"weekly-contest-288"},{"question_id":1277,"title":"统计全为 1 的正方形子矩阵","title_slug":"count-square-submatrices-with-all-ones","rating":1613.0429766636,"_hash":1057920854,"paid_only":false,"cont_title":"第 165 场周赛","cont_title_slug":"weekly-contest-165"},{"question_id":2766,"title":"重新放置石块","title_slug":"relocate-marbles","rating":1613.2485081262,"_hash":2818493377,"paid_only":false,"cont_title":"第 108 场双周赛","cont_title_slug":"biweekly-contest-108"},{"question_id":2145,"title":"统计隐藏数组数目","title_slug":"count-the-hidden-sequences","rating":1614.4877804672,"_hash":2108728330,"paid_only":false,"cont_title":"第 70 场双周赛","cont_title_slug":"biweekly-contest-70"},{"question_id":1020,"title":"飞地的数量","title_slug":"number-of-enclaves","rating":1615.4767730477,"_hash":1185092838,"paid_only":false,"cont_title":"第 130 场周赛","cont_title_slug":"weekly-contest-130"},{"question_id":2241,"title":"设计一个 ATM 机器","title_slug":"design-an-atm-machine","rating":1616.2067360638,"_hash":4007529944,"paid_only":false,"cont_title":"第 76 场双周赛","cont_title_slug":"biweekly-contest-76"},{"question_id":1503,"title":"所有蚂蚁掉下来前的最后一刻","title_slug":"last-moment-before-all-ants-fall-out-of-a-plank","rating":1618.6016480451,"_hash":1365148367,"paid_only":false,"cont_title":"第 196 场周赛","cont_title_slug":"weekly-contest-196"},{"question_id":2541,"title":"使数组中所有元素相等的最小操作数 II","title_slug":"minimum-operations-to-make-array-equal-ii","rating":1619.505461912,"_hash":2719928959,"paid_only":false,"cont_title":"第 96 场双周赛","cont_title_slug":"biweekly-contest-96"},{"question_id":2364,"title":"统计坏数对的数目","title_slug":"count-number-of-bad-pairs","rating":1622.2389577197,"_hash":809508462,"paid_only":false,"cont_title":"第 84 场双周赛","cont_title_slug":"biweekly-contest-84"},{"question_id":2425,"title":"所有数对的异或和","title_slug":"bitwise-xor-of-all-pairings","rating":1622.3970914116,"_hash":3786781582,"paid_only":false,"cont_title":"第 88 场双周赛","cont_title_slug":"biweekly-contest-88"},{"question_id":2365,"title":"任务调度器 II","title_slug":"task-scheduler-ii","rating":1622.7743864401,"_hash":3978152897,"paid_only":false,"cont_title":"第 84 场双周赛","cont_title_slug":"biweekly-contest-84"},{"question_id":2086,"title":"从房屋收集雨水需要的最少水桶数","title_slug":"minimum-number-of-food-buckets-to-feed-the-hamsters","rating":1622.8414025136,"_hash":463765609,"paid_only":false,"cont_title":"第 66 场双周赛","cont_title_slug":"biweekly-contest-66"},{"question_id":1248,"title":"统计「优美子数组」","title_slug":"count-number-of-nice-subarrays","rating":1623.9443250479,"_hash":2868656571,"paid_only":false,"cont_title":"第 161 场周赛","cont_title_slug":"weekly-contest-161"},{"question_id":916,"title":"单词子集","title_slug":"word-subsets","rating":1624.4737611923,"_hash":857697187,"paid_only":false,"cont_title":"第 104 场周赛","cont_title_slug":"weekly-contest-104"},{"question_id":2860,"title":"让所有学生保持开心的分组方法数","title_slug":"happy-students","rating":1625.7172632295,"_hash":3713605524,"paid_only":false,"cont_title":"第 363 场周赛","cont_title_slug":"weekly-contest-363"},{"question_id":2684,"title":"矩阵中移动的最大次数","title_slug":"maximum-number-of-moves-in-a-grid","rating":1625.9636825798,"_hash":1603806327,"paid_only":false,"cont_title":"第 345 场周赛","cont_title_slug":"weekly-contest-345"},{"question_id":1366,"title":"通过投票对团队排名","title_slug":"rank-teams-by-votes","rating":1626.3266982141,"_hash":2939618078,"paid_only":false,"cont_title":"第 178 场周赛","cont_title_slug":"weekly-contest-178"},{"question_id":1182,"title":"与目标颜色间的最短距离","title_slug":"shortest-distance-to-target-color","rating":1626.6740430119,"_hash":3960804215,"paid_only":false,"cont_title":"第 8 场双周赛","cont_title_slug":"biweekly-contest-8"},{"question_id":1332,"title":"删除回文子序列","title_slug":"remove-palindromic-subsequences","rating":1628.5072578803,"_hash":2153157695,"paid_only":false,"cont_title":"第 173 场周赛","cont_title_slug":"weekly-contest-173"},{"question_id":1680,"title":"连接连续二进制数字","title_slug":"concatenation-of-consecutive-binary-numbers","rating":1629.5416832545,"_hash":1734419421,"paid_only":false,"cont_title":"第 218 场周赛","cont_title_slug":"weekly-contest-218"},{"question_id":1540,"title":"K 次操作转变字符串","title_slug":"can-convert-string-in-k-moves","rating":1631.338145683,"_hash":3391560370,"paid_only":false,"cont_title":"第 32 场双周赛","cont_title_slug":"biweekly-contest-32"},{"question_id":2580,"title":"统计将重叠区间合并成组的方案数","title_slug":"count-ways-to-group-overlapping-ranges","rating":1631.5850830561,"_hash":4043601244,"paid_only":false,"cont_title":"第 99 场双周赛","cont_title_slug":"biweekly-contest-99"},{"question_id":1319,"title":"连通网络的操作次数","title_slug":"number-of-operations-to-make-network-connected","rating":1633.1372577433,"_hash":3681976285,"paid_only":false,"cont_title":"第 171 场周赛","cont_title_slug":"weekly-contest-171"},{"question_id":1053,"title":"交换一次的先前排列","title_slug":"previous-permutation-with-one-swap","rating":1633.1789521619,"_hash":3119606051,"paid_only":false,"cont_title":"第 138 场周赛","cont_title_slug":"weekly-contest-138"},{"question_id":1466,"title":"重新规划路线","title_slug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero","rating":1633.6202302555,"_hash":249521607,"paid_only":false,"cont_title":"第 191 场周赛","cont_title_slug":"weekly-contest-191"},{"question_id":2471,"title":"逐层排序二叉树所需的最少操作数目","title_slug":"minimum-number-of-operations-to-sort-a-binary-tree-by-level","rating":1635.1520858279,"_hash":629883391,"paid_only":false,"cont_title":"第 319 场周赛","cont_title_slug":"weekly-contest-319"},{"question_id":1899,"title":"合并若干三元组以形成目标三元组","title_slug":"merge-triplets-to-form-target-triplet","rating":1635.6879273926,"_hash":3990558875,"paid_only":false,"cont_title":"第 245 场周赛","cont_title_slug":"weekly-contest-245"},{"question_id":2384,"title":"最大回文数字","title_slug":"largest-palindromic-number","rating":1636.47322627,"_hash":70049056,"paid_only":false,"cont_title":"第 307 场周赛","cont_title_slug":"weekly-contest-307"},{"question_id":1386,"title":"安排电影院座位","title_slug":"cinema-seat-allocation","rating":1636.6877598712,"_hash":3214600049,"paid_only":false,"cont_title":"第 22 场双周赛","cont_title_slug":"biweekly-contest-22"},{"question_id":2512,"title":"奖励最顶尖的 K 名学生","title_slug":"reward-top-k-students","rating":1636.7472106213,"_hash":1295785983,"paid_only":false,"cont_title":"第 94 场双周赛","cont_title_slug":"biweekly-contest-94"},{"question_id":1558,"title":"得到目标数组的最少函数调用次数","title_slug":"minimum-numbers-of-function-calls-to-make-target-array","rating":1637.0082208814,"_hash":2725160392,"paid_only":false,"cont_title":"第 33 场双周赛","cont_title_slug":"biweekly-contest-33"},{"question_id":990,"title":"等式方程的可满足性","title_slug":"satisfiability-of-equality-equations","rating":1638.0148920643,"_hash":369209811,"paid_only":false,"cont_title":"第 123 场周赛","cont_title_slug":"weekly-contest-123"},{"question_id":838,"title":"推多米诺","title_slug":"push-dominoes","rating":1638.1281256708,"_hash":942356384,"paid_only":false,"cont_title":"第 85 场周赛","cont_title_slug":"weekly-contest-85"},{"question_id":1926,"title":"迷宫中离入口最近的出口","title_slug":"nearest-exit-from-entrance-in-maze","rating":1638.3134093066,"_hash":1229621552,"paid_only":false,"cont_title":"第 56 场双周赛","cont_title_slug":"biweekly-contest-56"},{"question_id":2779,"title":"数组的最大美丽值","title_slug":"maximum-beauty-of-an-array-after-applying-operation","rating":1638.4147703093,"_hash":1463471392,"paid_only":false,"cont_title":"第 354 场周赛","cont_title_slug":"weekly-contest-354"},{"question_id":2344,"title":"使数组可以被整除的最少删除次数","title_slug":"minimum-deletions-to-make-array-divisible","rating":1640.8976042503,"_hash":1620091732,"paid_only":false,"cont_title":"第 302 场周赛","cont_title_slug":"weekly-contest-302"},{"question_id":2187,"title":"完成旅途的最少时间","title_slug":"minimum-time-to-complete-trips","rating":1640.9591585343,"_hash":306595116,"paid_only":false,"cont_title":"第 282 场周赛","cont_title_slug":"weekly-contest-282"},{"question_id":2375,"title":"根据模式串构造最小数字","title_slug":"construct-smallest-number-from-di-string","rating":1641.9424376927,"_hash":2914198967,"paid_only":false,"cont_title":"第 306 场周赛","cont_title_slug":"weekly-contest-306"},{"question_id":2275,"title":"按位与结果大于零的最长组合","title_slug":"largest-combination-with-bitwise-and-greater-than-zero","rating":1642.1446933109,"_hash":1729291424,"paid_only":false,"cont_title":"第 293 场周赛","cont_title_slug":"weekly-contest-293"},{"question_id":2024,"title":"考试的最大困扰度","title_slug":"maximize-the-confusion-of-an-exam","rating":1643.1325351423,"_hash":2651875294,"paid_only":false,"cont_title":"第 62 场双周赛","cont_title_slug":"biweekly-contest-62"},{"question_id":2196,"title":"根据描述创建二叉树","title_slug":"create-binary-tree-from-descriptions","rating":1643.5283095007,"_hash":4088708677,"paid_only":false,"cont_title":"第 283 场周赛","cont_title_slug":"weekly-contest-283"},{"question_id":2226,"title":"每个小孩最多能分到多少糖果","title_slug":"maximum-candies-allocated-to-k-children","rating":1646.1765343383,"_hash":2412340751,"paid_only":false,"cont_title":"第 287 场周赛","cont_title_slug":"weekly-contest-287"},{"question_id":1358,"title":"包含所有三种字符的子字符串数目","title_slug":"number-of-substrings-containing-all-three-characters","rating":1646.1943237127,"_hash":3495355750,"paid_only":false,"cont_title":"第 20 场双周赛","cont_title_slug":"biweekly-contest-20"},{"question_id":1975,"title":"最大方阵和","title_slug":"maximum-matrix-sum","rating":1648.0880791614,"_hash":330899243,"paid_only":false,"cont_title":"第 59 场双周赛","cont_title_slug":"biweekly-contest-59"},{"question_id":870,"title":"优势洗牌","title_slug":"advantage-shuffle","rating":1648.341757882,"_hash":301734990,"paid_only":false,"cont_title":"第 93 场周赛","cont_title_slug":"weekly-contest-93"},{"question_id":2423,"title":"删除字符使频率相同","title_slug":"remove-letter-to-equalize-frequency","rating":1648.3540381514,"_hash":2197356984,"paid_only":false,"cont_title":"第 88 场双周赛","cont_title_slug":"biweekly-contest-88"},{"question_id":2571,"title":"将整数减少到零需要的最少操作数","title_slug":"minimum-operations-to-reduce-an-integer-to-0","rating":1649.2000410344,"_hash":676949389,"paid_only":false,"cont_title":"第 333 场周赛","cont_title_slug":"weekly-contest-333"},{"question_id":2523,"title":"范围内最接近的两个质数","title_slug":"closest-prime-numbers-in-range","rating":1649.7120733311,"_hash":3492742379,"paid_only":false,"cont_title":"第 326 场周赛","cont_title_slug":"weekly-contest-326"},{"question_id":1367,"title":"二叉树中的链表","title_slug":"linked-list-in-binary-tree","rating":1649.9728054796,"_hash":3956966956,"paid_only":false,"cont_title":"第 178 场周赛","cont_title_slug":"weekly-contest-178"},{"question_id":2343,"title":"裁剪数字后查询第 K 小的数字","title_slug":"query-kth-smallest-trimmed-number","rating":1651.569267834,"_hash":3981013694,"paid_only":false,"cont_title":"第 302 场周赛","cont_title_slug":"weekly-contest-302"},{"question_id":1311,"title":"获取你好友已观看的视频","title_slug":"get-watched-videos-by-your-friends","rating":1652.5809810428,"_hash":2521216381,"paid_only":false,"cont_title":"第 170 场周赛","cont_title_slug":"weekly-contest-170"},{"question_id":1509,"title":"三次操作后最大值与最小值的最小差","title_slug":"minimum-difference-between-largest-and-smallest-value-in-three-moves","rating":1653.0356626499,"_hash":929645229,"paid_only":false,"cont_title":"第 30 场双周赛","cont_title_slug":"biweekly-contest-30"},{"question_id":1155,"title":"掷骰子等于目标和的方法数","title_slug":"number-of-dice-rolls-with-target-sum","rating":1653.7337081336,"_hash":1676080206,"paid_only":false,"cont_title":"第 149 场周赛","cont_title_slug":"weekly-contest-149"},{"question_id":1257,"title":"最小公共区域","title_slug":"smallest-common-region","rating":1654.0793660142,"_hash":2731154173,"paid_only":false,"cont_title":"第 13 场双周赛","cont_title_slug":"biweekly-contest-13"},{"question_id":1004,"title":"最大连续1的个数 III","title_slug":"max-consecutive-ones-iii","rating":1655.6433885989,"_hash":296740468,"paid_only":false,"cont_title":"第 126 场周赛","cont_title_slug":"weekly-contest-126"},{"question_id":2222,"title":"选择建筑的方案数","title_slug":"number-of-ways-to-select-buildings","rating":1656.5588918365,"_hash":469490796,"paid_only":false,"cont_title":"第 75 场双周赛","cont_title_slug":"biweekly-contest-75"},{"question_id":1249,"title":"移除无效的括号","title_slug":"minimum-remove-to-make-valid-parentheses","rating":1657.1231739081,"_hash":4242473859,"paid_only":false,"cont_title":"第 161 场周赛","cont_title_slug":"weekly-contest-161"},{"question_id":3015,"title":"按距离统计房屋对数目 I","title_slug":"count-the-number-of-houses-at-a-certain-distance-i","rating":1657.5344546445,"_hash":1097720535,"paid_only":false,"cont_title":"第 381 场周赛","cont_title_slug":"weekly-contest-381"},{"question_id":1583,"title":"统计不开心的朋友","title_slug":"count-unhappy-friends","rating":1658.3305547865,"_hash":743759650,"paid_only":false,"cont_title":"第 206 场周赛","cont_title_slug":"weekly-contest-206"},{"question_id":1091,"title":"二进制矩阵中的最短路径","title_slug":"shortest-path-in-binary-matrix","rating":1658.3474650806,"_hash":1423912379,"paid_only":false,"cont_title":"第 141 场周赛","cont_title_slug":"weekly-contest-141"},{"question_id":2304,"title":"网格中的最小路径代价","title_slug":"minimum-path-cost-in-a-grid","rating":1658.3530344788,"_hash":730943544,"paid_only":false,"cont_title":"第 297 场周赛","cont_title_slug":"weekly-contest-297"},{"question_id":1958,"title":"检查操作是否合法","title_slug":"check-if-move-is-legal","rating":1658.5967147757,"_hash":4231095696,"paid_only":false,"cont_title":"第 58 场双周赛","cont_title_slug":"biweekly-contest-58"},{"question_id":1169,"title":"查询无效交易","title_slug":"invalid-transactions","rating":1658.6836278802,"_hash":3292810974,"paid_only":false,"cont_title":"第 151 场周赛","cont_title_slug":"weekly-contest-151"},{"question_id":1254,"title":"统计封闭岛屿的数目","title_slug":"number-of-closed-islands","rating":1658.7495899767,"_hash":1535345394,"paid_only":false,"cont_title":"第 162 场周赛","cont_title_slug":"weekly-contest-162"},{"question_id":2915,"title":"和为目标值的最长子序列的长度","title_slug":"length-of-the-longest-subsequence-that-sums-to-target","rating":1658.8190087768,"_hash":1032257843,"paid_only":false,"cont_title":"第 116 场双周赛","cont_title_slug":"biweekly-contest-116"},{"question_id":2195,"title":"向数组中追加 K 个整数","title_slug":"append-k-integers-with-minimal-sum","rating":1658.921022733,"_hash":430788454,"paid_only":false,"cont_title":"第 283 场周赛","cont_title_slug":"weekly-contest-283"},{"question_id":3029,"title":"将单词恢复初始状态所需的最短时间 I","title_slug":"minimum-time-to-revert-word-to-initial-state-i","rating":1659.6231386056,"_hash":2654590324,"paid_only":false,"cont_title":"第 383 场周赛","cont_title_slug":"weekly-contest-383"},{"question_id":2170,"title":"使数组变成交替数组的最少操作数","title_slug":"minimum-operations-to-make-the-array-alternating","rating":1662.6673692545,"_hash":884144873,"paid_only":false,"cont_title":"第 280 场周赛","cont_title_slug":"weekly-contest-280"},{"question_id":2550,"title":"猴子碰撞的方法数","title_slug":"count-collisions-of-monkeys-on-a-polygon","rating":1662.7075394144,"_hash":374282350,"paid_only":false,"cont_title":"第 330 场周赛","cont_title_slug":"weekly-contest-330"},{"question_id":863,"title":"二叉树中所有距离为 K 的结点","title_slug":"all-nodes-distance-k-in-binary-tree","rating":1663.1853149056,"_hash":2021376917,"paid_only":false,"cont_title":"第 91 场周赛","cont_title_slug":"weekly-contest-91"},{"question_id":1219,"title":"黄金矿工","title_slug":"path-with-maximum-gold","rating":1663.2612318917,"_hash":2579010831,"paid_only":false,"cont_title":"第 157 场周赛","cont_title_slug":"weekly-contest-157"},{"question_id":2063,"title":"所有子字符串中的元音","title_slug":"vowels-of-all-substrings","rating":1663.3912882908,"_hash":1180161064,"paid_only":false,"cont_title":"第 266 场周赛","cont_title_slug":"weekly-contest-266"},{"question_id":2611,"title":"老鼠和奶酪","title_slug":"mice-and-cheese","rating":1663.456591933,"_hash":3624743731,"paid_only":false,"cont_title":"第 339 场周赛","cont_title_slug":"weekly-contest-339"},{"question_id":1121,"title":"将数组分成几个递增序列","title_slug":"divide-array-into-increasing-sequences","rating":1664.7703749741,"_hash":2894413444,"paid_only":false,"cont_title":"第 4 场双周赛","cont_title_slug":"biweekly-contest-4"},{"question_id":2593,"title":"标记所有元素后数组的分数","title_slug":"find-score-of-an-array-after-marking-all-elements","rating":1665.1885910815,"_hash":3148467486,"paid_only":false,"cont_title":"第 100 场双周赛","cont_title_slug":"biweekly-contest-100"},{"question_id":1620,"title":"网络信号最好的坐标","title_slug":"coordinate-with-maximum-network-quality","rating":1665.24907247,"_hash":1092713458,"paid_only":false,"cont_title":"第 37 场双周赛","cont_title_slug":"biweekly-contest-37"},{"question_id":1162,"title":"地图分析","title_slug":"as-far-from-land-as-possible","rating":1666.346990979,"_hash":744773019,"paid_only":false,"cont_title":"第 150 场周赛","cont_title_slug":"weekly-contest-150"},{"question_id":1738,"title":"找出第 K 大的异或坐标值","title_slug":"find-kth-largest-xor-coordinate-value","rating":1671.4657554194,"_hash":3021563284,"paid_only":false,"cont_title":"第 225 场周赛","cont_title_slug":"weekly-contest-225"},{"question_id":2033,"title":"获取单值网格的最小操作数","title_slug":"minimum-operations-to-make-a-uni-value-grid","rating":1671.9261598,"_hash":684110909,"paid_only":false,"cont_title":"第 262 场周赛","cont_title_slug":"weekly-contest-262"},{"question_id":1438,"title":"绝对差不超过限制的最长连续子数组","title_slug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit","rating":1672.1678031263,"_hash":3188904029,"paid_only":false,"cont_title":"第 187 场周赛","cont_title_slug":"weekly-contest-187"},{"question_id":1215,"title":"步进数","title_slug":"stepping-numbers","rating":1674.5365205597,"_hash":2304874524,"paid_only":false,"cont_title":"第 10 场双周赛","cont_title_slug":"biweekly-contest-10"},{"question_id":1922,"title":"统计好数字的数目","title_slug":"count-good-numbers","rating":1674.7986939472,"_hash":1253336265,"paid_only":false,"cont_title":"第 248 场周赛","cont_title_slug":"weekly-contest-248"},{"question_id":1339,"title":"分裂二叉树的最大乘积","title_slug":"maximum-product-of-splitted-binary-tree","rating":1674.9985842835,"_hash":1257762070,"paid_only":false,"cont_title":"第 174 场周赛","cont_title_slug":"weekly-contest-174"},{"question_id":1870,"title":"准时到达的列车最小时速","title_slug":"minimum-speed-to-arrive-on-time","rating":1675.761234741,"_hash":2612530279,"paid_only":false,"cont_title":"第 242 场周赛","cont_title_slug":"weekly-contest-242"},{"question_id":987,"title":"二叉树的垂序遍历","title_slug":"vertical-order-traversal-of-a-binary-tree","rating":1675.9610355975,"_hash":3791950406,"paid_only":false,"cont_title":"第 122 场周赛","cont_title_slug":"weekly-contest-122"},{"question_id":974,"title":"和可被 K 整除的子数组","title_slug":"subarray-sums-divisible-by-k","rating":1675.989407584,"_hash":1023487571,"paid_only":false,"cont_title":"第 119 场周赛","cont_title_slug":"weekly-contest-119"},{"question_id":2641,"title":"二叉树的堂兄弟节点 II","title_slug":"cousins-in-binary-tree-ii","rating":1676.5007365375,"_hash":2279730191,"paid_only":false,"cont_title":"第 102 场双周赛","cont_title_slug":"biweekly-contest-102"},{"question_id":2943,"title":"最大化网格图中正方形空洞的面积","title_slug":"maximize-area-of-square-hole-in-grid","rating":1677.4559378473,"_hash":967980473,"paid_only":false,"cont_title":"第 118 场双周赛","cont_title_slug":"biweekly-contest-118"},{"question_id":853,"title":"车队","title_slug":"car-fleet","rating":1678.1133886034,"_hash":1478600712,"paid_only":false,"cont_title":"第 89 场周赛","cont_title_slug":"weekly-contest-89"},{"question_id":885,"title":"螺旋矩阵 III","title_slug":"spiral-matrix-iii","rating":1678.3947690537,"_hash":571559842,"paid_only":false,"cont_title":"第 97 场周赛","cont_title_slug":"weekly-contest-97"},{"question_id":2115,"title":"从给定原材料中找到所有可以做出的菜","title_slug":"find-all-possible-recipes-from-given-supplies","rating":1678.5871762113,"_hash":2182831583,"paid_only":false,"cont_title":"第 68 场双周赛","cont_title_slug":"biweekly-contest-68"},{"question_id":2317,"title":"操作后的最大异或和","title_slug":"maximum-xor-after-operations","rating":1678.6241816708,"_hash":1137942707,"paid_only":false,"cont_title":"第 81 场双周赛","cont_title_slug":"biweekly-contest-81"},{"question_id":2698,"title":"求一个整数的惩罚数","title_slug":"find-the-punishment-number-of-an-integer","rating":1678.6245760413,"_hash":2745040429,"paid_only":false,"cont_title":"第 346 场周赛","cont_title_slug":"weekly-contest-346"},{"question_id":1905,"title":"统计子岛屿","title_slug":"count-sub-islands","rating":1678.7231378948,"_hash":986520800,"paid_only":false,"cont_title":"第 246 场周赛","cont_title_slug":"weekly-contest-246"},{"question_id":1402,"title":"做菜顺序","title_slug":"reducing-dishes","rating":1679.2607152001,"_hash":3261672467,"paid_only":false,"cont_title":"第 23 场双周赛","cont_title_slug":"biweekly-contest-23"},{"question_id":2492,"title":"两个城市间路径的最小分数","title_slug":"minimum-score-of-a-path-between-two-cities","rating":1679.5737760149,"_hash":3337273246,"paid_only":false,"cont_title":"第 322 场周赛","cont_title_slug":"weekly-contest-322"},{"question_id":2457,"title":"美丽整数的最小增量","title_slug":"minimum-addition-to-make-integer-beautiful","rating":1680.0815931601,"_hash":2889905668,"paid_only":false,"cont_title":"第 317 场周赛","cont_title_slug":"weekly-contest-317"},{"question_id":2182,"title":"构造限制重复的字符串","title_slug":"construct-string-with-repeat-limit","rating":1680.1353258588,"_hash":1950501535,"paid_only":false,"cont_title":"第 281 场周赛","cont_title_slug":"weekly-contest-281"},{"question_id":1031,"title":"两个非重叠子数组的最大和","title_slug":"maximum-sum-of-two-non-overlapping-subarrays","rating":1680.4852623991,"_hash":3974822873,"paid_only":false,"cont_title":"第 133 场周赛","cont_title_slug":"weekly-contest-133"},{"question_id":1865,"title":"找出和为指定值的下标对","title_slug":"finding-pairs-with-a-certain-sum","rating":1680.82425993,"_hash":1859819274,"paid_only":false,"cont_title":"第 241 场周赛","cont_title_slug":"weekly-contest-241"},{"question_id":2280,"title":"表示一个折线图的最少线段数","title_slug":"minimum-lines-to-represent-a-line-chart","rating":1680.866917849,"_hash":1538966566,"paid_only":false,"cont_title":"第 294 场周赛","cont_title_slug":"weekly-contest-294"},{"question_id":2497,"title":"图中最大星和","title_slug":"maximum-star-sum-of-a-graph","rating":1682.16892078,"_hash":1275579259,"paid_only":false,"cont_title":"第 93 场双周赛","cont_title_slug":"biweekly-contest-93"},{"question_id":1443,"title":"收集树上所有苹果的最少时间","title_slug":"minimum-time-to-collect-all-apples-in-a-tree","rating":1682.8882177724,"_hash":943252793,"paid_only":false,"cont_title":"第 188 场周赛","cont_title_slug":"weekly-contest-188"},{"question_id":2074,"title":"反转偶数长度组的节点","title_slug":"reverse-nodes-in-even-length-groups","rating":1685.3599641299,"_hash":1103286328,"paid_only":false,"cont_title":"第 267 场周赛","cont_title_slug":"weekly-contest-267"},{"question_id":2233,"title":"K 次增加后的最大乘积","title_slug":"maximum-product-after-k-increments","rating":1685.5389350949,"_hash":1255527945,"paid_only":false,"cont_title":"第 288 场周赛","cont_title_slug":"weekly-contest-288"},{"question_id":950,"title":"按递增顺序显示卡牌","title_slug":"reveal-cards-in-increasing-order","rating":1686.4493679523,"_hash":1319672571,"paid_only":false,"cont_title":"第 113 场周赛","cont_title_slug":"weekly-contest-113"},{"question_id":1963,"title":"使字符串平衡的最小交换次数","title_slug":"minimum-number-of-swaps-to-make-the-string-balanced","rating":1688.9209684568,"_hash":1518041298,"paid_only":false,"cont_title":"第 253 场周赛","cont_title_slug":"weekly-contest-253"},{"question_id":1419,"title":"数青蛙","title_slug":"minimum-number-of-frogs-croaking","rating":1689.7569144085,"_hash":1565798166,"paid_only":false,"cont_title":"第 185 场周赛","cont_title_slug":"weekly-contest-185"},{"question_id":935,"title":"骑士拨号器","title_slug":"knight-dialer","rating":1690.1655236843,"_hash":2786534786,"paid_only":false,"cont_title":"第 109 场周赛","cont_title_slug":"weekly-contest-109"},{"question_id":919,"title":"完全二叉树插入器","title_slug":"complete-binary-tree-inserter","rating":1690.9043557462,"_hash":3341470372,"paid_only":false,"cont_title":"第 105 场周赛","cont_title_slug":"weekly-contest-105"},{"question_id":1462,"title":"课程表 IV","title_slug":"course-schedule-iv","rating":1692.5884631801,"_hash":2046402802,"paid_only":false,"cont_title":"第 27 场双周赛","cont_title_slug":"biweekly-contest-27"},{"question_id":2337,"title":"移动片段得到字符串","title_slug":"move-pieces-to-obtain-a-string","rating":1693.4495728383,"_hash":255657392,"paid_only":false,"cont_title":"第 301 场周赛","cont_title_slug":"weekly-contest-301"},{"question_id":2466,"title":"统计构造好字符串的方案数","title_slug":"count-ways-to-build-good-strings","rating":1694.4308657594,"_hash":4245137983,"paid_only":false,"cont_title":"第 91 场双周赛","cont_title_slug":"biweekly-contest-91"},{"question_id":829,"title":"连续整数求和","title_slug":"consecutive-numbers-sum","rating":1694.433951503,"_hash":2377767456,"paid_only":false,"cont_title":"第 83 场周赛","cont_title_slug":"weekly-contest-83"},{"question_id":2420,"title":"找到所有好下标","title_slug":"find-all-good-indices","rating":1695.0815222626,"_hash":3422315602,"paid_only":false,"cont_title":"第 312 场周赛","cont_title_slug":"weekly-contest-312"},{"question_id":1942,"title":"最小未被占据椅子的编号","title_slug":"the-number-of-the-smallest-unoccupied-chair","rating":1695.2832486322,"_hash":2532708840,"paid_only":false,"cont_title":"第 57 场双周赛","cont_title_slug":"biweekly-contest-57"},{"question_id":2588,"title":"统计美丽子数组数目","title_slug":"count-the-number-of-beautiful-subarrays","rating":1696.8895579594,"_hash":3474039417,"paid_only":false,"cont_title":"第 336 场周赛","cont_title_slug":"weekly-contest-336"},{"question_id":1487,"title":"保证文件名唯一","title_slug":"making-file-names-unique","rating":1696.9920075471,"_hash":3554577128,"paid_only":false,"cont_title":"第 194 场周赛","cont_title_slug":"weekly-contest-194"},{"question_id":1289,"title":"下降路径最小和 II","title_slug":"minimum-falling-path-sum-ii","rating":1697.2356875149,"_hash":2588489114,"paid_only":false,"cont_title":"第 15 场双周赛","cont_title_slug":"biweekly-contest-15"},{"question_id":1017,"title":"负二进制转换","title_slug":"convert-to-base-2","rating":1697.8500495479,"_hash":704152903,"paid_only":false,"cont_title":"第 130 场周赛","cont_title_slug":"weekly-contest-130"},{"question_id":2962,"title":"统计最大元素出现至少 K 次的子数组","title_slug":"count-subarrays-where-max-element-appears-at-least-k-times","rating":1700.8505554268,"_hash":1658221095,"paid_only":false,"cont_title":"第 375 场周赛","cont_title_slug":"weekly-contest-375"},{"question_id":2929,"title":"给小朋友们分糖果 II","title_slug":"distribute-candies-among-children-ii","rating":1701.4341867571,"_hash":2228358934,"paid_only":false,"cont_title":"第 117 场双周赛","cont_title_slug":"biweekly-contest-117"},{"question_id":1054,"title":"距离相等的条形码","title_slug":"distant-barcodes","rating":1701.5735371897,"_hash":2024934932,"paid_only":false,"cont_title":"第 138 场周赛","cont_title_slug":"weekly-contest-138"},{"question_id":1774,"title":"最接近目标价格的甜点成本","title_slug":"closest-dessert-cost","rating":1701.7584658834,"_hash":4279348799,"paid_only":false,"cont_title":"第 230 场周赛","cont_title_slug":"weekly-contest-230"},{"question_id":2080,"title":"区间内查询数字的频率","title_slug":"range-frequency-queries","rating":1702.4387527636,"_hash":2460331500,"paid_only":false,"cont_title":"第 268 场周赛","cont_title_slug":"weekly-contest-268"},{"question_id":2100,"title":"适合野炊的日子","title_slug":"find-good-days-to-rob-the-bank","rating":1702.4962514406,"_hash":2252317011,"paid_only":false,"cont_title":"第 67 场双周赛","cont_title_slug":"biweekly-contest-67"},{"question_id":958,"title":"二叉树的完全性检验","title_slug":"check-completeness-of-a-binary-tree","rating":1702.8035923458,"_hash":4172058127,"paid_only":false,"cont_title":"第 115 场周赛","cont_title_slug":"weekly-contest-115"},{"question_id":1947,"title":"最大兼容性评分和","title_slug":"maximum-compatibility-score-sum","rating":1704.360891641,"_hash":889856657,"paid_only":false,"cont_title":"第 251 场周赛","cont_title_slug":"weekly-contest-251"},{"question_id":2672,"title":"有相同颜色的相邻元素数目","title_slug":"number-of-adjacent-elements-with-the-same-color","rating":1705.2545641354,"_hash":1725183127,"paid_only":false,"cont_title":"第 344 场周赛","cont_title_slug":"weekly-contest-344"},{"question_id":3025,"title":"人员站位的方案数 I","title_slug":"find-the-number-of-ways-to-place-people-i","rating":1707.4309979043,"_hash":442815761,"paid_only":false,"cont_title":"第 123 场双周赛","cont_title_slug":"biweekly-contest-123"},{"question_id":2257,"title":"统计网格图中没有被保卫的格子数","title_slug":"count-unguarded-cells-in-the-grid","rating":1708.7056764058,"_hash":2771270445,"paid_only":false,"cont_title":"第 77 场双周赛","cont_title_slug":"biweekly-contest-77"},{"question_id":901,"title":"股票价格跨度","title_slug":"online-stock-span","rating":1708.8735585776,"_hash":613691832,"paid_only":false,"cont_title":"第 101 场周赛","cont_title_slug":"weekly-contest-101"},{"question_id":2944,"title":"购买水果需要的最少金币数","title_slug":"minimum-number-of-coins-for-fruits","rating":1708.9663754668,"_hash":1140950686,"paid_only":false,"cont_title":"第 118 场双周赛","cont_title_slug":"biweekly-contest-118"},{"question_id":1401,"title":"圆和矩形是否有重叠","title_slug":"circle-and-rectangle-overlapping","rating":1708.9983361411,"_hash":1192302071,"paid_only":false,"cont_title":"第 23 场双周赛","cont_title_slug":"biweekly-contest-23"},{"question_id":2140,"title":"解决智力问题","title_slug":"solving-questions-with-brainpower","rating":1709.1054732427,"_hash":3742724136,"paid_only":false,"cont_title":"第 276 场周赛","cont_title_slug":"weekly-contest-276"},{"question_id":979,"title":"在二叉树中分配硬币","title_slug":"distribute-coins-in-binary-tree","rating":1709.1461451873,"_hash":2734248382,"paid_only":false,"cont_title":"第 120 场周赛","cont_title_slug":"weekly-contest-120"},{"question_id":1136,"title":"并行课程","title_slug":"parallel-courses","rating":1710.0787625377,"_hash":1009688921,"paid_only":false,"cont_title":"第 5 场双周赛","cont_title_slug":"biweekly-contest-5"},{"question_id":1567,"title":"乘积为正数的最长子数组长度","title_slug":"maximum-length-of-subarray-with-positive-product","rating":1710.3243520032,"_hash":2678350009,"paid_only":false,"cont_title":"第 204 场周赛","cont_title_slug":"weekly-contest-204"},{"question_id":923,"title":"三数之和的多种可能","title_slug":"3sum-with-multiplicity","rating":1710.9105378431,"_hash":352505600,"paid_only":false,"cont_title":"第 106 场周赛","cont_title_slug":"weekly-contest-106"},{"question_id":1801,"title":"积压订单中的订单总数","title_slug":"number-of-orders-in-the-backlog","rating":1711.1205064321,"_hash":3504355376,"paid_only":false,"cont_title":"第 233 场周赛","cont_title_slug":"weekly-contest-233"},{"question_id":2385,"title":"感染二叉树需要的总时间","title_slug":"amount-of-time-for-binary-tree-to-be-infected","rating":1711.4873176824,"_hash":2321913205,"paid_only":false,"cont_title":"第 307 场周赛","cont_title_slug":"weekly-contest-307"},{"question_id":1042,"title":"不邻接植花","title_slug":"flower-planting-with-no-adjacent","rating":1712.4010133221,"_hash":2386982504,"paid_only":false,"cont_title":"第 136 场周赛","cont_title_slug":"weekly-contest-136"},{"question_id":1372,"title":"二叉树中的最长交错路径","title_slug":"longest-zigzag-path-in-a-binary-tree","rating":1713.2768268466,"_hash":3877013643,"paid_only":false,"cont_title":"第 21 场双周赛","cont_title_slug":"biweekly-contest-21"},{"question_id":2406,"title":"将区间分为最少组数","title_slug":"divide-intervals-into-minimum-number-of-groups","rating":1713.3954468582,"_hash":1620554900,"paid_only":false,"cont_title":"第 310 场周赛","cont_title_slug":"weekly-contest-310"},{"question_id":1781,"title":"所有子字符串美丽值之和","title_slug":"sum-of-beauty-of-all-substrings","rating":1714.6960124182,"_hash":2430259702,"paid_only":false,"cont_title":"第 47 场双周赛","cont_title_slug":"biweekly-contest-47"},{"question_id":2359,"title":"找到离给定两个节点最近的节点","title_slug":"find-closest-node-to-given-two-nodes","rating":1714.992763701,"_hash":1024461884,"paid_only":false,"cont_title":"第 304 场周赛","cont_title_slug":"weekly-contest-304"},{"question_id":2202,"title":"K 次操作后最大化顶端元素","title_slug":"maximize-the-topmost-element-after-k-moves","rating":1716.9721777,"_hash":927068521,"paid_only":false,"cont_title":"第 284 场周赛","cont_title_slug":"weekly-contest-284"},{"question_id":2397,"title":"被列覆盖的最多行数","title_slug":"maximum-rows-covered-by-columns","rating":1718.8256321624,"_hash":1913049602,"paid_only":false,"cont_title":"第 86 场双周赛","cont_title_slug":"biweekly-contest-86"},{"question_id":2017,"title":"网格游戏","title_slug":"grid-game","rating":1718.9772466681,"_hash":3098562302,"paid_only":false,"cont_title":"第 260 场周赛","cont_title_slug":"weekly-contest-260"},{"question_id":1239,"title":"串联字符串的最大长度","title_slug":"maximum-length-of-a-concatenated-string-with-unique-characters","rating":1719.945199874,"_hash":4259911866,"paid_only":false,"cont_title":"第 160 场周赛","cont_title_slug":"weekly-contest-160"},{"question_id":2563,"title":"统计公平数对的数目","title_slug":"count-the-number-of-fair-pairs","rating":1720.7470612766,"_hash":2019191135,"paid_only":false,"cont_title":"第 332 场周赛","cont_title_slug":"weekly-contest-332"},{"question_id":2826,"title":"将三个组排序","title_slug":"sorting-three-groups","rating":1721.1964988483,"_hash":268097121,"paid_only":false,"cont_title":"第 111 场双周赛","cont_title_slug":"biweekly-contest-111"},{"question_id":1197,"title":"进击的骑士","title_slug":"minimum-knight-moves","rating":1722.3088173214,"_hash":3077259720,"paid_only":false,"cont_title":"第 9 场双周赛","cont_title_slug":"biweekly-contest-9"},{"question_id":1359,"title":"有效的快递序列数目","title_slug":"count-all-valid-pickup-and-delivery-options","rating":1722.8129701098,"_hash":3432459628,"paid_only":false,"cont_title":"第 20 场双周赛","cont_title_slug":"biweekly-contest-20"},{"question_id":2070,"title":"每一个查询的最大美丽值","title_slug":"most-beautiful-item-for-each-query","rating":1724.1545485476,"_hash":1066025257,"paid_only":false,"cont_title":"第 65 场双周赛","cont_title_slug":"biweekly-contest-65"},{"question_id":2261,"title":"含最多 K 个可整除元素的子数组","title_slug":"k-divisible-elements-subarrays","rating":1724.394164934,"_hash":2169721379,"paid_only":false,"cont_title":"第 291 场周赛","cont_title_slug":"weekly-contest-291"},{"question_id":2416,"title":"字符串的前缀分数和","title_slug":"sum-of-prefix-scores-of-strings","rating":1725.1995150882,"_hash":2425741756,"paid_only":false,"cont_title":"第 311 场周赛","cont_title_slug":"weekly-contest-311"},{"question_id":1011,"title":"在 D 天内送达包裹的能力","title_slug":"capacity-to-ship-packages-within-d-days","rating":1725.4481937307,"_hash":3609066875,"paid_only":false,"cont_title":"第 128 场周赛","cont_title_slug":"weekly-contest-128"},{"question_id":1220,"title":"统计元音字母序列的数目","title_slug":"count-vowels-permutation","rating":1729.6074000215,"_hash":4278798036,"paid_only":false,"cont_title":"第 157 场周赛","cont_title_slug":"weekly-contest-157"},{"question_id":1014,"title":"最佳观光组合","title_slug":"best-sightseeing-pair","rating":1730.3052054913,"_hash":212376193,"paid_only":false,"cont_title":"第 129 场周赛","cont_title_slug":"weekly-contest-129"},{"question_id":889,"title":"根据前序和后序遍历构造二叉树","title_slug":"construct-binary-tree-from-preorder-and-postorder-traversal","rating":1731.5555445321,"_hash":3152421262,"paid_only":false,"cont_title":"第 98 场周赛","cont_title_slug":"weekly-contest-98"},{"question_id":2786,"title":"访问数组中的位置使分数最大","title_slug":"visit-array-positions-to-maximize-score","rating":1732.5146472785,"_hash":3694289041,"paid_only":false,"cont_title":"第 109 场双周赛","cont_title_slug":"biweekly-contest-109"},{"question_id":1273,"title":"删除树节点","title_slug":"delete-tree-nodes","rating":1732.7813534239,"_hash":333630853,"paid_only":false,"cont_title":"第 14 场双周赛","cont_title_slug":"biweekly-contest-14"},{"question_id":2048,"title":"下一个更大的数值平衡数","title_slug":"next-greater-numerically-balanced-number","rating":1734.0550202798,"_hash":1204660336,"paid_only":false,"cont_title":"第 264 场周赛","cont_title_slug":"weekly-contest-264"},{"question_id":1292,"title":"元素和小于等于阈值的正方形的最大边长","title_slug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold","rating":1734.8208369949,"_hash":2041342956,"paid_only":false,"cont_title":"第 167 场周赛","cont_title_slug":"weekly-contest-167"},{"question_id":2707,"title":"字符串中的额外字符","title_slug":"extra-characters-in-a-string","rating":1735.8505509901,"_hash":1779771436,"paid_only":false,"cont_title":"第 105 场双周赛","cont_title_slug":"biweekly-contest-105"},{"question_id":1814,"title":"统计一个数组中好对子的数目","title_slug":"count-nice-pairs-in-an-array","rating":1737.8431142688,"_hash":1480696010,"paid_only":false,"cont_title":"第 49 场双周赛","cont_title_slug":"biweekly-contest-49"},{"question_id":1593,"title":"拆分字符串使唯一子字符串的数目最大","title_slug":"split-a-string-into-the-max-number-of-unique-substrings","rating":1739.5831401172,"_hash":1236982780,"paid_only":false,"cont_title":"第 207 场周赛","cont_title_slug":"weekly-contest-207"},{"question_id":1079,"title":"活字印刷","title_slug":"letter-tile-possibilities","rating":1740.5014205942,"_hash":3654833214,"paid_only":false,"cont_title":"第 140 场周赛","cont_title_slug":"weekly-contest-140"},{"question_id":3020,"title":"子集中元素的最大数量","title_slug":"find-the-maximum-number-of-elements-in-subset","rating":1741.3694833067,"_hash":3880011182,"paid_only":false,"cont_title":"第 382 场周赛","cont_title_slug":"weekly-contest-382"},{"question_id":1145,"title":"二叉树着色游戏","title_slug":"binary-tree-coloring-game","rating":1741.4527995252,"_hash":110135796,"paid_only":false,"cont_title":"第 148 场周赛","cont_title_slug":"weekly-contest-148"},{"question_id":2087,"title":"网格图中机器人回家的最小代价","title_slug":"minimum-cost-homecoming-of-a-robot-in-a-grid","rating":1743.731976554,"_hash":592826714,"paid_only":false,"cont_title":"第 66 场双周赛","cont_title_slug":"biweekly-contest-66"},{"question_id":1139,"title":"最大的以 1 为边界的正方形","title_slug":"largest-1-bordered-square","rating":1744.0388789755,"_hash":1167299665,"paid_only":false,"cont_title":"第 147 场周赛","cont_title_slug":"weekly-contest-147"},{"question_id":1638,"title":"统计只差一个字符的子串数目","title_slug":"count-substrings-that-differ-by-one-character","rating":1744.7611048301,"_hash":3230369611,"paid_only":false,"cont_title":"第 38 场双周赛","cont_title_slug":"biweekly-contest-38"},{"question_id":2502,"title":"设计内存分配器","title_slug":"design-memory-allocator","rating":1745.5352025872,"_hash":1579629689,"paid_only":false,"cont_title":"第 323 场周赛","cont_title_slug":"weekly-contest-323"},{"question_id":1391,"title":"检查网格中是否存在有效路径","title_slug":"check-if-there-is-a-valid-path-in-a-grid","rating":1745.6490739887,"_hash":650356357,"paid_only":false,"cont_title":"第 181 场周赛","cont_title_slug":"weekly-contest-181"},{"question_id":1530,"title":"好叶子节点对的数量","title_slug":"number-of-good-leaf-nodes-pairs","rating":1745.6580748712,"_hash":909563687,"paid_only":false,"cont_title":"第 199 场周赛","cont_title_slug":"weekly-contest-199"},{"question_id":1024,"title":"视频拼接","title_slug":"video-stitching","rating":1746.135917977,"_hash":2812871030,"paid_only":false,"cont_title":"第 131 场周赛","cont_title_slug":"weekly-contest-131"},{"question_id":1849,"title":"将字符串拆分为递减的连续值","title_slug":"splitting-a-string-into-descending-consecutive-values","rating":1746.8757919578,"_hash":576619521,"paid_only":false,"cont_title":"第 239 场周赛","cont_title_slug":"weekly-contest-239"},{"question_id":1191,"title":"K 次串联后最大子数组之和","title_slug":"k-concatenation-maximum-sum","rating":1747.6755111029,"_hash":65111910,"paid_only":false,"cont_title":"第 154 场周赛","cont_title_slug":"weekly-contest-154"},{"question_id":2171,"title":"拿出最少数目的魔法豆","title_slug":"removing-minimum-number-of-magic-beans","rating":1748.1339100823,"_hash":2260151323,"paid_only":false,"cont_title":"第 280 场周赛","cont_title_slug":"weekly-contest-280"},{"question_id":1297,"title":"子串的最大出现次数","title_slug":"maximum-number-of-occurrences-of-a-substring","rating":1748.1523771585,"_hash":625709572,"paid_only":false,"cont_title":"第 168 场周赛","cont_title_slug":"weekly-contest-168"},{"question_id":2134,"title":"最少交换次数来组合所有的 1 II","title_slug":"minimum-swaps-to-group-all-1s-together-ii","rating":1748.4522689101,"_hash":107547857,"paid_only":false,"cont_title":"第 275 场周赛","cont_title_slug":"weekly-contest-275"},{"question_id":1111,"title":"有效括号的嵌套深度","title_slug":"maximum-nesting-depth-of-two-valid-parentheses-strings","rating":1749.4981778209,"_hash":3619796334,"paid_only":false,"cont_title":"第 144 场周赛","cont_title_slug":"weekly-contest-144"},{"question_id":2871,"title":"将数组分割成最多数目的子数组","title_slug":"split-array-into-maximum-number-of-subarrays","rating":1749.5115037045,"_hash":1204439806,"paid_only":false,"cont_title":"第 114 场双周赛","cont_title_slug":"biweekly-contest-114"},{"question_id":2401,"title":"最长优雅子数组","title_slug":"longest-nice-subarray","rating":1749.5432375672,"_hash":3355469687,"paid_only":false,"cont_title":"第 309 场周赛","cont_title_slug":"weekly-contest-309"},{"question_id":2856,"title":"删除数对后的最小数组长度","title_slug":"minimum-array-length-after-pair-removals","rating":1749.9743684275,"_hash":1304985926,"paid_only":false,"cont_title":"第 113 场双周赛","cont_title_slug":"biweekly-contest-113"},{"question_id":2400,"title":"恰好移动 k 步到达某一位置的方法数目","title_slug":"number-of-ways-to-reach-a-position-after-exactly-k-steps","rating":1751.115625465,"_hash":3867293007,"paid_only":false,"cont_title":"第 309 场周赛","cont_title_slug":"weekly-contest-309"},{"question_id":2166,"title":"设计位集","title_slug":"design-bitset","rating":1751.5101577001,"_hash":2504097527,"paid_only":false,"cont_title":"第 279 场周赛","cont_title_slug":"weekly-contest-279"},{"question_id":939,"title":"最小面积矩形","title_slug":"minimum-area-rectangle","rating":1752.2621077596,"_hash":1965686195,"paid_only":false,"cont_title":"第 110 场周赛","cont_title_slug":"weekly-contest-110"},{"question_id":1135,"title":"最低成本连通所有城市","title_slug":"connecting-cities-with-minimum-cost","rating":1752.9555725796,"_hash":282466705,"paid_only":false,"cont_title":"第 5 场双周赛","cont_title_slug":"biweekly-contest-5"},{"question_id":1216,"title":"验证回文串 III","title_slug":"valid-palindrome-iii","rating":1753.9062487685,"_hash":4136678159,"paid_only":false,"cont_title":"第 10 场双周赛","cont_title_slug":"biweekly-contest-10"},{"question_id":2568,"title":"最小无法得到的或值","title_slug":"minimum-impossible-or","rating":1754.1710323358,"_hash":1363446915,"paid_only":false,"cont_title":"第 98 场双周赛","cont_title_slug":"biweekly-contest-98"},{"question_id":1954,"title":"收集足够苹果的最小花园周长","title_slug":"minimum-garden-perimeter-to-collect-enough-apples","rating":1758.5135073787,"_hash":601450429,"paid_only":false,"cont_title":"第 252 场周赛","cont_title_slug":"weekly-contest-252"},{"question_id":1027,"title":"最长等差数列","title_slug":"longest-arithmetic-subsequence","rating":1758.75255141,"_hash":4193739814,"paid_only":false,"cont_title":"第 132 场周赛","cont_title_slug":"weekly-contest-132"},{"question_id":1541,"title":"平衡括号字符串的最少插入次数","title_slug":"minimum-insertions-to-balance-a-parentheses-string","rating":1759.0197295594,"_hash":268274286,"paid_only":false,"cont_title":"第 32 场双周赛","cont_title_slug":"biweekly-contest-32"},{"question_id":2498,"title":"青蛙过河 II","title_slug":"frog-jump-ii","rating":1759.0470795449,"_hash":2772831251,"paid_only":false,"cont_title":"第 93 场双周赛","cont_title_slug":"biweekly-contest-93"},{"question_id":2075,"title":"解码斜向换位密码","title_slug":"decode-the-slanted-ciphertext","rating":1759.2287478055,"_hash":1997404036,"paid_only":false,"cont_title":"第 267 场周赛","cont_title_slug":"weekly-contest-267"},{"question_id":2121,"title":"相同元素的间隔之和","title_slug":"intervals-between-identical-elements","rating":1760.9131492436,"_hash":3607071844,"paid_only":false,"cont_title":"第 273 场周赛","cont_title_slug":"weekly-contest-273"},{"question_id":2453,"title":"摧毁一系列目标","title_slug":"destroy-sequential-targets","rating":1761.9162628125,"_hash":3946751496,"paid_only":false,"cont_title":"第 90 场双周赛","cont_title_slug":"biweekly-contest-90"},{"question_id":1262,"title":"可被三整除的最大和","title_slug":"greatest-sum-divisible-by-three","rating":1762.0307532652,"_hash":2001540741,"paid_only":false,"cont_title":"第 163 场周赛","cont_title_slug":"weekly-contest-163"},{"question_id":948,"title":"令牌放置","title_slug":"bag-of-tokens","rating":1762.3115124143,"_hash":2688493082,"paid_only":false,"cont_title":"第 112 场周赛","cont_title_slug":"weekly-contest-112"},{"question_id":2462,"title":"雇佣 K 位工人的总代价","title_slug":"total-cost-to-hire-k-workers","rating":1763.6404758359,"_hash":2730930360,"paid_only":false,"cont_title":"第 318 场周赛","cont_title_slug":"weekly-contest-318"},{"question_id":2905,"title":"找出满足差值条件的下标 II","title_slug":"find-indices-with-index-and-value-difference-ii","rating":1763.787679959,"_hash":830799973,"paid_only":false,"cont_title":"第 367 场周赛","cont_title_slug":"weekly-contest-367"},{"question_id":1706,"title":"球会落何处","title_slug":"where-will-the-ball-fall","rating":1764.9170564773,"_hash":4006941957,"paid_only":false,"cont_title":"第 221 场周赛","cont_title_slug":"weekly-contest-221"},{"question_id":875,"title":"爱吃香蕉的珂珂","title_slug":"koko-eating-bananas","rating":1765.5654059263,"_hash":2370285073,"paid_only":false,"cont_title":"第 94 场周赛","cont_title_slug":"weekly-contest-94"},{"question_id":1914,"title":"循环轮转矩阵","title_slug":"cyclically-rotating-a-grid","rating":1766.2506177612,"_hash":1526363744,"paid_only":false,"cont_title":"第 247 场周赛","cont_title_slug":"weekly-contest-247"},{"question_id":1600,"title":"王位继承顺序","title_slug":"throne-inheritance","rating":1768.623896829,"_hash":3383805178,"paid_only":false,"cont_title":"第 208 场周赛","cont_title_slug":"weekly-contest-208"},{"question_id":2718,"title":"查询后矩阵的和","title_slug":"sum-of-matrix-after-queries","rating":1768.9138093037,"_hash":3363685518,"paid_only":false,"cont_title":"第 348 场周赛","cont_title_slug":"weekly-contest-348"},{"question_id":2685,"title":"统计完全连通分量的数量","title_slug":"count-the-number-of-complete-components","rating":1769.4344566771,"_hash":1502620621,"paid_only":false,"cont_title":"第 345 场周赛","cont_title_slug":"weekly-contest-345"},{"question_id":1146,"title":"快照数组","title_slug":"snapshot-array","rating":1770.8924569497,"_hash":4187877981,"paid_only":false,"cont_title":"第 148 场周赛","cont_title_slug":"weekly-contest-148"},{"question_id":2982,"title":"找出出现至少三次的最长特殊子字符串 II","title_slug":"find-longest-special-substring-that-occurs-thrice-ii","rating":1772.9528456848,"_hash":2573075022,"paid_only":false,"cont_title":"第 378 场周赛","cont_title_slug":"weekly-contest-378"},{"question_id":1238,"title":"循环码排列","title_slug":"circular-permutation-in-binary-representation","rating":1774.8764591297,"_hash":1210001971,"paid_only":false,"cont_title":"第 160 场周赛","cont_title_slug":"weekly-contest-160"},{"question_id":2531,"title":"使字符串中不同字符的数目相等","title_slug":"make-number-of-distinct-characters-equal","rating":1775.854606648,"_hash":485006616,"paid_only":false,"cont_title":"第 327 场周赛","cont_title_slug":"weekly-contest-327"},{"question_id":918,"title":"环形子数组的最大和","title_slug":"maximum-sum-circular-subarray","rating":1777.3786570233,"_hash":3263594037,"paid_only":false,"cont_title":"第 105 场周赛","cont_title_slug":"weekly-contest-105"},{"question_id":1824,"title":"最少侧跳次数","title_slug":"minimum-sideway-jumps","rating":1778.4880620629,"_hash":3943793700,"paid_only":false,"cont_title":"第 236 场周赛","cont_title_slug":"weekly-contest-236"},{"question_id":2601,"title":"质数减法运算","title_slug":"prime-subtraction-operation","rating":1779.0712927572,"_hash":1323143155,"paid_only":false,"cont_title":"第 338 场周赛","cont_title_slug":"weekly-contest-338"},{"question_id":1016,"title":"子串能表示从 1 到 N 数字的二进制串","title_slug":"binary-string-with-substrings-representing-1-to-n","rating":1779.3931248179,"_hash":3814673758,"paid_only":false,"cont_title":"第 129 场周赛","cont_title_slug":"weekly-contest-129"},{"question_id":2369,"title":"检查数组是否存在有效划分","title_slug":"check-if-there-is-a-valid-partition-for-the-array","rating":1779.7001728541,"_hash":3555784215,"paid_only":false,"cont_title":"第 305 场周赛","cont_title_slug":"weekly-contest-305"},{"question_id":1129,"title":"颜色交替的最短路径","title_slug":"shortest-path-with-alternating-colors","rating":1779.7534349429,"_hash":3681526411,"paid_only":false,"cont_title":"第 146 场周赛","cont_title_slug":"weekly-contest-146"},{"question_id":1424,"title":"对角线遍历 II","title_slug":"diagonal-traverse-ii","rating":1779.8364613072,"_hash":2316551160,"paid_only":false,"cont_title":"第 186 场周赛","cont_title_slug":"weekly-contest-186"},{"question_id":842,"title":"将数组拆分成斐波那契序列","title_slug":"split-array-into-fibonacci-sequence","rating":1779.9495819318,"_hash":466340061,"paid_only":false,"cont_title":"第 86 场周赛","cont_title_slug":"weekly-contest-86"},{"question_id":1895,"title":"最大的幻方","title_slug":"largest-magic-square","rating":1781.3664141686,"_hash":826909651,"paid_only":false,"cont_title":"第 54 场双周赛","cont_title_slug":"biweekly-contest-54"},{"question_id":2353,"title":"设计食物评分系统","title_slug":"design-a-food-rating-system","rating":1781.8156963676,"_hash":3907541820,"paid_only":false,"cont_title":"第 303 场周赛","cont_title_slug":"weekly-contest-303"},{"question_id":1171,"title":"从链表中删去总和值为零的连续节点","title_slug":"remove-zero-sum-consecutive-nodes-from-linked-list","rating":1782.3312212058,"_hash":1493274091,"paid_only":false,"cont_title":"第 151 场周赛","cont_title_slug":"weekly-contest-151"},{"question_id":1765,"title":"地图中的最高点","title_slug":"map-of-highest-peak","rating":1782.9801784101,"_hash":2722367436,"paid_only":false,"cont_title":"第 46 场双周赛","cont_title_slug":"biweekly-contest-46"},{"question_id":851,"title":"喧闹和富有","title_slug":"loud-and-rich","rating":1783.2337340478,"_hash":3836236370,"paid_only":false,"cont_title":"第 88 场周赛","cont_title_slug":"weekly-contest-88"},{"question_id":894,"title":"所有可能的真二叉树","title_slug":"all-possible-full-binary-trees","rating":1784.2539813582,"_hash":4144023748,"paid_only":false,"cont_title":"第 99 场周赛","cont_title_slug":"weekly-contest-99"},{"question_id":2952,"title":"需要添加的硬币的最小数量","title_slug":"minimum-number-of-coins-to-be-added","rating":1784.3506628869,"_hash":1965849899,"paid_only":false,"cont_title":"第 374 场周赛","cont_title_slug":"weekly-contest-374"},{"question_id":2653,"title":"滑动子数组的美丽值","title_slug":"sliding-subarray-beauty","rating":1785.6006955353,"_hash":3971252642,"paid_only":false,"cont_title":"第 342 场周赛","cont_title_slug":"weekly-contest-342"},{"question_id":1911,"title":"最大子序列交替和","title_slug":"maximum-alternating-subsequence-sum","rating":1785.6872758693,"_hash":1304520805,"paid_only":false,"cont_title":"第 55 场双周赛","cont_title_slug":"biweekly-contest-55"},{"question_id":983,"title":"最低票价","title_slug":"minimum-cost-for-tickets","rating":1786.3121598293,"_hash":1414741845,"paid_only":false,"cont_title":"第 121 场周赛","cont_title_slug":"weekly-contest-121"},{"question_id":971,"title":"翻转二叉树以匹配先序遍历","title_slug":"flip-binary-tree-to-match-preorder-traversal","rating":1786.5491561897,"_hash":16117382,"paid_only":false,"cont_title":"第 118 场周赛","cont_title_slug":"weekly-contest-118"},{"question_id":1312,"title":"让字符串成为回文串的最少插入次数","title_slug":"minimum-insertion-steps-to-make-a-string-palindrome","rating":1786.688543054,"_hash":2220648902,"paid_only":false,"cont_title":"第 170 场周赛","cont_title_slug":"weekly-contest-170"},{"question_id":1510,"title":"石子游戏 IV","title_slug":"stone-game-iv","rating":1786.9268132617,"_hash":2203655753,"paid_only":false,"cont_title":"第 30 场双周赛","cont_title_slug":"biweekly-contest-30"},{"question_id":1497,"title":"检查数组对是否可以被 k 整除","title_slug":"check-if-array-pairs-are-divisible-by-k","rating":1787.2310751136,"_hash":1924690238,"paid_only":false,"cont_title":"第 195 场周赛","cont_title_slug":"weekly-contest-195"},{"question_id":1156,"title":"单字符重复子串的最大长度","title_slug":"swap-for-longest-repeated-character-substring","rating":1787.4514432151,"_hash":2038782260,"paid_only":false,"cont_title":"第 149 场周赛","cont_title_slug":"weekly-contest-149"},{"question_id":2192,"title":"有向无环图中一个节点的所有祖先","title_slug":"all-ancestors-of-a-node-in-a-directed-acyclic-graph","rating":1787.8550568757,"_hash":1095929141,"paid_only":false,"cont_title":"第 73 场双周赛","cont_title_slug":"biweekly-contest-73"},{"question_id":2321,"title":"拼接数组的最大分数","title_slug":"maximum-score-of-spliced-array","rating":1790.5747006625,"_hash":3565117549,"paid_only":false,"cont_title":"第 299 场周赛","cont_title_slug":"weekly-contest-299"},{"question_id":2712,"title":"使所有字符相等的最小成本","title_slug":"minimum-cost-to-make-all-characters-equal","rating":1791.0336923305,"_hash":1186731908,"paid_only":false,"cont_title":"第 347 场周赛","cont_title_slug":"weekly-contest-347"},{"question_id":2771,"title":"构造最长非递减子数组","title_slug":"longest-non-decreasing-subarray-from-two-arrays","rating":1791.5102962397,"_hash":3729777530,"paid_only":false,"cont_title":"第 353 场周赛","cont_title_slug":"weekly-contest-353"},{"question_id":1245,"title":"树的直径","title_slug":"tree-diameter","rating":1792.076794537,"_hash":3817996291,"paid_only":false,"cont_title":"第 12 场双周赛","cont_title_slug":"biweekly-contest-12"},{"question_id":2615,"title":"等值距离和","title_slug":"sum-of-distances","rating":1793.3033536992,"_hash":158335627,"paid_only":false,"cont_title":"第 340 场周赛","cont_title_slug":"weekly-contest-340"},{"question_id":2381,"title":"字母移位 II","title_slug":"shifting-letters-ii","rating":1793.3037316825,"_hash":2012982950,"paid_only":false,"cont_title":"第 85 场双周赛","cont_title_slug":"biweekly-contest-85"},{"question_id":1653,"title":"使字符串平衡的最少删除次数","title_slug":"minimum-deletions-to-make-string-balanced","rating":1793.8027487553,"_hash":2249718139,"paid_only":false,"cont_title":"第 39 场双周赛","cont_title_slug":"biweekly-contest-39"},{"question_id":886,"title":"可能的二分法","title_slug":"possible-bipartition","rating":1794.5827898448,"_hash":860518194,"paid_only":false,"cont_title":"第 97 场周赛","cont_title_slug":"weekly-contest-97"},{"question_id":2998,"title":"使 X 和 Y 相等的最少操作次数","title_slug":"minimum-number-of-operations-to-make-x-and-y-equal","rating":1794.6129370985,"_hash":3024031273,"paid_only":false,"cont_title":"第 121 场双周赛","cont_title_slug":"biweekly-contest-121"},{"question_id":966,"title":"元音拼写检查器","title_slug":"vowel-spellchecker","rating":1795.0422250815,"_hash":3548460508,"paid_only":false,"cont_title":"第 117 场周赛","cont_title_slug":"weekly-contest-117"},{"question_id":3001,"title":"捕获黑皇后需要的最少移动次数","title_slug":"minimum-moves-to-capture-the-queen","rating":1796.5392133092,"_hash":4169935304,"paid_only":false,"cont_title":"第 379 场周赛","cont_title_slug":"weekly-contest-379"},{"question_id":1028,"title":"从先序遍历还原二叉树","title_slug":"recover-a-tree-from-preorder-traversal","rating":1797.4917663632,"_hash":4138934238,"paid_only":false,"cont_title":"第 132 场周赛","cont_title_slug":"weekly-contest-132"},{"question_id":1072,"title":"按列翻转得到最大值等行数","title_slug":"flip-columns-for-maximum-number-of-equal-rows","rating":1797.5851607225,"_hash":1857526630,"paid_only":false,"cont_title":"第 139 场周赛","cont_title_slug":"weekly-contest-139"},{"question_id":1834,"title":"单线程 CPU","title_slug":"single-threaded-cpu","rating":1797.7466000366,"_hash":3429532354,"paid_only":false,"cont_title":"第 237 场周赛","cont_title_slug":"weekly-contest-237"},{"question_id":1711,"title":"大餐计数","title_slug":"count-good-meals","rating":1797.8728515982,"_hash":519326923,"paid_only":false,"cont_title":"第 222 场周赛","cont_title_slug":"weekly-contest-222"},{"question_id":1186,"title":"删除一次得到子数组最大和","title_slug":"maximum-subarray-sum-with-one-deletion","rating":1799.4635458535,"_hash":1742923454,"paid_only":false,"cont_title":"第 153 场周赛","cont_title_slug":"weekly-contest-153"},{"question_id":1673,"title":"找出最具竞争力的子序列","title_slug":"find-the-most-competitive-subsequence","rating":1802.2256875356,"_hash":3057587548,"paid_only":false,"cont_title":"第 217 场周赛","cont_title_slug":"weekly-contest-217"},{"question_id":2934,"title":"最大化数组末位元素的最少操作次数","title_slug":"minimum-operations-to-maximize-last-elements-in-arrays","rating":1802.7875657754,"_hash":3398027261,"paid_only":false,"cont_title":"第 371 场周赛","cont_title_slug":"weekly-contest-371"},{"question_id":1953,"title":"你可以工作的最大周数","title_slug":"maximum-number-of-weeks-for-which-you-can-work","rating":1803.7518552874,"_hash":787047636,"paid_only":false,"cont_title":"第 252 场周赛","cont_title_slug":"weekly-contest-252"},{"question_id":2096,"title":"从二叉树一个节点到另一个节点每一步的方向","title_slug":"step-by-step-directions-from-a-binary-tree-node-to-another","rating":1804.5283324227,"_hash":3304159418,"paid_only":false,"cont_title":"第 270 场周赛","cont_title_slug":"weekly-contest-270"},{"question_id":1080,"title":"根到叶路径上的不足节点","title_slug":"insufficient-nodes-in-root-to-leaf-paths","rating":1804.5783242151,"_hash":547605841,"paid_only":false,"cont_title":"第 140 场周赛","cont_title_slug":"weekly-contest-140"},{"question_id":1035,"title":"不相交的线","title_slug":"uncrossed-lines","rating":1805.5947071171,"_hash":1788564041,"paid_only":false,"cont_title":"第 134 场周赛","cont_title_slug":"weekly-contest-134"},{"question_id":1073,"title":"负二进制数相加","title_slug":"adding-two-negabinary-numbers","rating":1806.5891699944,"_hash":3275619185,"paid_only":false,"cont_title":"第 139 场周赛","cont_title_slug":"weekly-contest-139"},{"question_id":1594,"title":"矩阵的最大非负积","title_slug":"maximum-non-negative-product-in-a-matrix","rating":1807.4618172386,"_hash":1191385639,"paid_only":false,"cont_title":"第 207 场周赛","cont_title_slug":"weekly-contest-207"},{"question_id":2302,"title":"统计得分小于 K 的子数组数目","title_slug":"count-subarrays-with-score-less-than-k","rating":1808.3407696613,"_hash":1464742605,"paid_only":false,"cont_title":"第 80 场双周赛","cont_title_slug":"biweekly-contest-80"},{"question_id":1230,"title":"抛掷硬币","title_slug":"toss-strange-coins","rating":1808.5754920785,"_hash":2912571228,"paid_only":false,"cont_title":"第 11 场双周赛","cont_title_slug":"biweekly-contest-11"},{"question_id":1519,"title":"子树中标签相同的节点数","title_slug":"number-of-nodes-in-the-sub-tree-with-the-same-label","rating":1808.787108831,"_hash":2964689219,"paid_only":false,"cont_title":"第 198 场周赛","cont_title_slug":"weekly-contest-198"},{"question_id":1345,"title":"跳跃游戏 IV","title_slug":"jump-game-iv","rating":1809.8192888474,"_hash":212627710,"paid_only":false,"cont_title":"第 19 场双周赛","cont_title_slug":"biweekly-contest-19"},{"question_id":2642,"title":"设计可以求最短路径的图类","title_slug":"design-graph-with-shortest-path-calculator","rating":1810.6470004623,"_hash":737896329,"paid_only":false,"cont_title":"第 102 场双周赛","cont_title_slug":"biweekly-contest-102"},{"question_id":1284,"title":"转化为全零矩阵的最少反转次数","title_slug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix","rating":1810.7690062079,"_hash":1118571941,"paid_only":false,"cont_title":"第 166 场周赛","cont_title_slug":"weekly-contest-166"},{"question_id":3026,"title":"最大好子数组和","title_slug":"maximum-good-subarray-sum","rating":1816.556997127,"_hash":1621119601,"paid_only":false,"cont_title":"第 123 场双周赛","cont_title_slug":"biweekly-contest-123"},{"question_id":1658,"title":"将 x 减到 0 的最小操作数","title_slug":"minimum-operations-to-reduce-x-to-zero","rating":1817.224026292,"_hash":307769453,"paid_only":false,"cont_title":"第 215 场周赛","cont_title_slug":"weekly-contest-215"},{"question_id":2787,"title":"将一个数字表示成幂的和的方案数","title_slug":"ways-to-express-an-integer-as-sum-of-powers","rating":1817.5282352022,"_hash":2671757819,"paid_only":false,"cont_title":"第 109 场双周赛","cont_title_slug":"biweekly-contest-109"},{"question_id":1792,"title":"最大平均通过率","title_slug":"maximum-average-pass-ratio","rating":1817.9978644712,"_hash":536430705,"paid_only":false,"cont_title":"第 232 场周赛","cont_title_slug":"weekly-contest-232"},{"question_id":861,"title":"翻转矩阵后的得分","title_slug":"score-after-flipping-matrix","rating":1818.0024504436,"_hash":1135090504,"paid_only":false,"cont_title":"第 91 场周赛","cont_title_slug":"weekly-contest-91"},{"question_id":2055,"title":"蜡烛之间的盘子","title_slug":"plates-between-candles","rating":1819.3068421506,"_hash":1199383198,"paid_only":false,"cont_title":"第 64 场双周赛","cont_title_slug":"biweekly-contest-64"},{"question_id":1405,"title":"最长快乐字符串","title_slug":"longest-happy-string","rating":1820.58557644,"_hash":1311726140,"paid_only":false,"cont_title":"第 183 场周赛","cont_title_slug":"weekly-contest-183"},{"question_id":2217,"title":"找到指定长度的回文数","title_slug":"find-palindrome-with-fixed-length","rating":1822.1301265412,"_hash":2265657217,"paid_only":false,"cont_title":"第 286 场周赛","cont_title_slug":"weekly-contest-286"},{"question_id":2931,"title":"购买物品的最大开销","title_slug":"maximum-spending-after-buying-items","rating":1822.3170524016,"_hash":268471907,"paid_only":false,"cont_title":"第 117 场双周赛","cont_title_slug":"biweekly-contest-117"},{"question_id":1363,"title":"形成三的最大倍数","title_slug":"largest-multiple-of-three","rating":1822.9768689716,"_hash":3298734473,"paid_only":false,"cont_title":"第 177 场周赛","cont_title_slug":"weekly-contest-177"},{"question_id":1458,"title":"两个子序列的最大点积","title_slug":"max-dot-product-of-two-subsequences","rating":1823.5831437787,"_hash":4061458273,"paid_only":false,"cont_title":"第 190 场周赛","cont_title_slug":"weekly-contest-190"},{"question_id":1377,"title":"T 秒后青蛙的位置","title_slug":"frog-position-after-t-seconds","rating":1823.8779711373,"_hash":1364762739,"paid_only":false,"cont_title":"第 179 场周赛","cont_title_slug":"weekly-contest-179"},{"question_id":1298,"title":"你能从盒子里获得的最大糖果数","title_slug":"maximum-candies-you-can-get-from-boxes","rating":1824.829446341,"_hash":4040819108,"paid_only":false,"cont_title":"第 168 场周赛","cont_title_slug":"weekly-contest-168"},{"question_id":1835,"title":"所有数对按位与结果的异或和","title_slug":"find-xor-sum-of-all-pairs-bitwise-and","rating":1825.0056908946,"_hash":635111986,"paid_only":false,"cont_title":"第 237 场周赛","cont_title_slug":"weekly-contest-237"},{"question_id":1702,"title":"修改后的最大二进制字符串","title_slug":"maximum-binary-string-after-change","rating":1825.4207082682,"_hash":1632383781,"paid_only":false,"cont_title":"第 42 场双周赛","cont_title_slug":"biweekly-contest-42"},{"question_id":934,"title":"最短的桥","title_slug":"shortest-bridge","rating":1825.770486008,"_hash":4107503015,"paid_only":false,"cont_title":"第 109 场周赛","cont_title_slug":"weekly-contest-109"},{"question_id":1095,"title":"山脉数组中查找目标值","title_slug":"find-in-mountain-array","rating":1827.090740222,"_hash":40615146,"paid_only":false,"cont_title":"第 142 场周赛","cont_title_slug":"weekly-contest-142"},{"question_id":2135,"title":"统计追加字母可以获得的单词数","title_slug":"count-words-obtained-after-adding-a-letter","rating":1828.2700238306,"_hash":1363331011,"paid_only":false,"cont_title":"第 275 场周赛","cont_title_slug":"weekly-contest-275"},{"question_id":1754,"title":"构造字典序最大的合并字符串","title_slug":"largest-merge-of-two-strings","rating":1828.6438563573,"_hash":1951198460,"paid_only":false,"cont_title":"第 227 场周赛","cont_title_slug":"weekly-contest-227"},{"question_id":980,"title":"不同路径 III","title_slug":"unique-paths-iii","rating":1830.3165569278,"_hash":1134359923,"paid_only":false,"cont_title":"第 120 场周赛","cont_title_slug":"weekly-contest-120"},{"question_id":2034,"title":"股票价格波动","title_slug":"stock-price-fluctuation","rating":1831.9395911303,"_hash":1147860078,"paid_only":false,"cont_title":"第 262 场周赛","cont_title_slug":"weekly-contest-262"},{"question_id":3012,"title":"通过操作使数组长度最小","title_slug":"minimize-length-of-array-using-operations","rating":1832.7167755024,"_hash":1466738944,"paid_only":false,"cont_title":"第 122 场双周赛","cont_title_slug":"biweekly-contest-122"},{"question_id":2370,"title":"最长理想子序列","title_slug":"longest-ideal-subsequence","rating":1834.868034709,"_hash":3336959867,"paid_only":false,"cont_title":"第 305 场周赛","cont_title_slug":"weekly-contest-305"},{"question_id":995,"title":"K 连续位的最小翻转次数","title_slug":"minimum-number-of-k-consecutive-bit-flips","rating":1835.4868365659,"_hash":2191726075,"paid_only":false,"cont_title":"第 124 场周赛","cont_title_slug":"weekly-contest-124"},{"question_id":2146,"title":"价格范围内最高排名的 K 样物品","title_slug":"k-highest-ranked-items-within-a-price-range","rating":1836.5345744332,"_hash":3957965518,"paid_only":false,"cont_title":"第 70 场双周赛","cont_title_slug":"biweekly-contest-70"},{"question_id":1316,"title":"不同的循环子字符串","title_slug":"distinct-echo-substrings","rating":1836.536348078,"_hash":2436413676,"paid_only":false,"cont_title":"第 17 场双周赛","cont_title_slug":"biweekly-contest-17"},{"question_id":1559,"title":"二维网格图中探测环","title_slug":"detect-cycles-in-2d-grid","rating":1837.8252904904,"_hash":2216360450,"paid_only":false,"cont_title":"第 33 场双周赛","cont_title_slug":"biweekly-contest-33"},{"question_id":2311,"title":"小于等于 K 的最长二进制子序列","title_slug":"longest-binary-subsequence-less-than-or-equal-to-k","rating":1839.9203623221,"_hash":1903617238,"paid_only":false,"cont_title":"第 298 场周赛","cont_title_slug":"weekly-contest-298"},{"question_id":2332,"title":"坐上公交的最晚时间","title_slug":"the-latest-time-to-catch-a-bus","rating":1840.9122452886,"_hash":572276699,"paid_only":false,"cont_title":"第 82 场双周赛","cont_title_slug":"biweekly-contest-82"},{"question_id":2013,"title":"检测正方形","title_slug":"detect-squares","rating":1841.4067816266,"_hash":2204914887,"paid_only":false,"cont_title":"第 259 场周赛","cont_title_slug":"weekly-contest-259"},{"question_id":2576,"title":"求出最多标记下标","title_slug":"find-the-maximum-number-of-marked-indices","rating":1843.2383664194,"_hash":260479518,"paid_only":false,"cont_title":"第 334 场周赛","cont_title_slug":"weekly-contest-334"},{"question_id":1411,"title":"给 N x 3 网格图涂色的方案数","title_slug":"number-of-ways-to-paint-n-3-grid","rating":1844.6289439644,"_hash":3628711002,"paid_only":false,"cont_title":"第 184 场周赛","cont_title_slug":"weekly-contest-184"},{"question_id":1504,"title":"统计全 1 子矩形","title_slug":"count-submatrices-with-all-ones","rating":1845.0428731248,"_hash":3023068102,"paid_only":false,"cont_title":"第 196 场周赛","cont_title_slug":"weekly-contest-196"},{"question_id":2598,"title":"执行操作后的最大 MEX","title_slug":"smallest-missing-non-negative-integer-after-operations","rating":1845.6611654401,"_hash":2357679638,"paid_only":false,"cont_title":"第 337 场周赛","cont_title_slug":"weekly-contest-337"},{"question_id":874,"title":"模拟行走机器人","title_slug":"walking-robot-simulation","rating":1846.3568350016,"_hash":809566471,"paid_only":false,"cont_title":"第 94 场周赛","cont_title_slug":"weekly-contest-94"},{"question_id":1514,"title":"概率最大的路径","title_slug":"path-with-maximum-probability","rating":1846.4077077642,"_hash":1014740120,"paid_only":false,"cont_title":"第 197 场周赛","cont_title_slug":"weekly-contest-197"},{"question_id":1258,"title":"近义词句子","title_slug":"synonymous-sentences","rating":1847.2077654978,"_hash":3669324904,"paid_only":false,"cont_title":"第 13 场双周赛","cont_title_slug":"biweekly-contest-13"},{"question_id":1177,"title":"构建回文串检测","title_slug":"can-make-palindrome-from-substring","rating":1848.0912848518,"_hash":1583349779,"paid_only":false,"cont_title":"第 152 场周赛","cont_title_slug":"weekly-contest-152"},{"question_id":2059,"title":"转化数字的最小运算数","title_slug":"minimum-operations-to-convert-number","rating":1849.8122180044,"_hash":3590542886,"paid_only":false,"cont_title":"第 265 场周赛","cont_title_slug":"weekly-contest-265"},{"question_id":1775,"title":"通过最少操作次数使数组的和相等","title_slug":"equal-sum-arrays-with-minimum-number-of-operations","rating":1850.4091449367,"_hash":2258141933,"paid_only":false,"cont_title":"第 230 场周赛","cont_title_slug":"weekly-contest-230"},{"question_id":1477,"title":"找两个和为目标值且不重叠的子数组","title_slug":"find-two-non-overlapping-sub-arrays-each-with-target-sum","rating":1850.5506342426,"_hash":1480774126,"paid_only":false,"cont_title":"第 28 场双周赛","cont_title_slug":"biweekly-contest-28"},{"question_id":1152,"title":"用户网站访问行为分析","title_slug":"analyze-user-website-visit-pattern","rating":1850.8490524791,"_hash":2782517328,"paid_only":false,"cont_title":"第 6 场双周赛","cont_title_slug":"biweekly-contest-6"},{"question_id":2830,"title":"销售利润最大化","title_slug":"maximize-the-profit-as-the-salesman","rating":1851.2677996923,"_hash":3503134762,"paid_only":false,"cont_title":"第 359 场周赛","cont_title_slug":"weekly-contest-359"},{"question_id":2162,"title":"设置时间的最少代价","title_slug":"minimum-cost-to-set-cooking-time","rating":1851.7255023016,"_hash":248789391,"paid_only":false,"cont_title":"第 71 场双周赛","cont_title_slug":"biweekly-contest-71"},{"question_id":1301,"title":"最大得分的路径数目","title_slug":"number-of-paths-with-max-score","rating":1853.0880092558,"_hash":4193156158,"paid_only":false,"cont_title":"第 16 场双周赛","cont_title_slug":"biweekly-contest-16"},{"question_id":1269,"title":"停在原地的方案数","title_slug":"number-of-ways-to-stay-in-the-same-place-after-some-steps","rating":1854.0126399812,"_hash":1810947088,"paid_only":false,"cont_title":"第 164 场周赛","cont_title_slug":"weekly-contest-164"},{"question_id":1334,"title":"阈值距离内邻居最少的城市","title_slug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance","rating":1854.9547783559,"_hash":487663609,"paid_only":false,"cont_title":"第 173 场周赛","cont_title_slug":"weekly-contest-173"},{"question_id":1546,"title":"和为目标值且不重叠的非空子数组的最大数目","title_slug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target","rating":1855.377046154,"_hash":2479293617,"paid_only":false,"cont_title":"第 201 场周赛","cont_title_slug":"weekly-contest-201"},{"question_id":1202,"title":"交换字符串中的元素","title_slug":"smallest-string-with-swaps","rating":1855.4479039876,"_hash":13544352,"paid_only":false,"cont_title":"第 155 场周赛","cont_title_slug":"weekly-contest-155"},{"question_id":2800,"title":"包含三个字符串的最短字符串","title_slug":"shortest-string-that-contains-three-strings","rating":1855.561153694,"_hash":2827089777,"paid_only":false,"cont_title":"第 356 场周赛","cont_title_slug":"weekly-contest-356"},{"question_id":3035,"title":"回文字符串的最大数量","title_slug":"maximum-palindromes-after-operations","rating":1856.6336926997,"_hash":2800289700,"paid_only":false,"cont_title":"第 384 场周赛","cont_title_slug":"weekly-contest-384"},{"question_id":2266,"title":"统计打字方案数","title_slug":"count-number-of-texts","rating":1856.8610192187,"_hash":590592305,"paid_only":false,"cont_title":"第 292 场周赛","cont_title_slug":"weekly-contest-292"},{"question_id":1584,"title":"连接所有点的最小费用","title_slug":"min-cost-to-connect-all-points","rating":1857.6431822094,"_hash":3880639230,"paid_only":false,"cont_title":"第 206 场周赛","cont_title_slug":"weekly-contest-206"},{"question_id":1744,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","title_slug":"can-you-eat-your-favorite-candy-on-your-favorite-day","rating":1858.9581916885,"_hash":3529472171,"paid_only":false,"cont_title":"第 226 场周赛","cont_title_slug":"weekly-contest-226"},{"question_id":2301,"title":"替换字符后匹配","title_slug":"match-substring-after-replacement","rating":1860.5166780235,"_hash":2777743854,"paid_only":false,"cont_title":"第 80 场双周赛","cont_title_slug":"biweekly-contest-80"},{"question_id":1996,"title":"游戏中弱角色的数量","title_slug":"the-number-of-weak-characters-in-the-game","rating":1860.742934291,"_hash":1819395589,"paid_only":false,"cont_title":"第 257 场周赛","cont_title_slug":"weekly-contest-257"},{"question_id":1993,"title":"树上的操作","title_slug":"operations-on-tree","rating":1861.4906863586,"_hash":2143044442,"paid_only":false,"cont_title":"第 60 场双周赛","cont_title_slug":"biweekly-contest-60"},{"question_id":1163,"title":"按字典序排在最后的子串","title_slug":"last-substring-in-lexicographical-order","rating":1864.0948676111,"_hash":1053626998,"paid_only":false,"cont_title":"第 150 场周赛","cont_title_slug":"weekly-contest-150"},{"question_id":2767,"title":"将字符串分割为最少的美丽子字符串","title_slug":"partition-string-into-minimum-beautiful-substrings","rating":1864.5644306171,"_hash":4066429992,"paid_only":false,"cont_title":"第 108 场双周赛","cont_title_slug":"biweekly-contest-108"},{"question_id":2039,"title":"网络空闲的时刻","title_slug":"the-time-when-the-network-becomes-idle","rating":1865.3441063734,"_hash":275986604,"paid_only":false,"cont_title":"第 63 场双周赛","cont_title_slug":"biweekly-contest-63"},{"question_id":1340,"title":"跳跃游戏 V","title_slug":"jump-game-v","rating":1866.3014601125,"_hash":3795047313,"paid_only":false,"cont_title":"第 174 场周赛","cont_title_slug":"weekly-contest-174"},{"question_id":1605,"title":"给定行和列的和求可行矩阵","title_slug":"find-valid-matrix-given-row-and-column-sums","rating":1867.8619694847,"_hash":2355594556,"paid_only":false,"cont_title":"第 36 场双周赛","cont_title_slug":"biweekly-contest-36"},{"question_id":1717,"title":"删除子字符串的最大得分","title_slug":"maximum-score-from-removing-substrings","rating":1867.9916069568,"_hash":2035720970,"paid_only":false,"cont_title":"第 43 场双周赛","cont_title_slug":"biweekly-contest-43"},{"question_id":1616,"title":"分割两个字符串得到回文串","title_slug":"split-two-strings-to-make-palindrome","rating":1868.1914861381,"_hash":1651110316,"paid_only":false,"cont_title":"第 210 场周赛","cont_title_slug":"weekly-contest-210"},{"question_id":924,"title":"尽量减少恶意软件的传播","title_slug":"minimize-malware-spread","rating":1868.9146755896,"_hash":28387341,"paid_only":false,"cont_title":"第 106 场周赛","cont_title_slug":"weekly-contest-106"},{"question_id":2212,"title":"射箭比赛中的最大得分","title_slug":"maximum-points-in-an-archery-competition","rating":1868.9864493463,"_hash":2155229246,"paid_only":false,"cont_title":"第 285 场周赛","cont_title_slug":"weekly-contest-285"},{"question_id":2002,"title":"两个回文子序列长度的最大乘积","title_slug":"maximum-product-of-the-length-of-two-palindromic-subsequences","rating":1869.402439128,"_hash":3968538235,"paid_only":false,"cont_title":"第 258 场周赛","cont_title_slug":"weekly-contest-258"},{"question_id":1589,"title":"所有排列中的最大和","title_slug":"maximum-sum-obtained-of-any-permutation","rating":1871.3112059413,"_hash":1702334810,"paid_only":false,"cont_title":"第 35 场双周赛","cont_title_slug":"biweekly-contest-35"},{"question_id":2008,"title":"出租车的最大盈利","title_slug":"maximum-earnings-from-taxi","rating":1871.8245218615,"_hash":2921363389,"paid_only":false,"cont_title":"第 61 场双周赛","cont_title_slug":"biweekly-contest-61"},{"question_id":1526,"title":"形成目标数组的子数组最少增加次数","title_slug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array","rating":1872.0350138774,"_hash":374038880,"paid_only":false,"cont_title":"第 31 场双周赛","cont_title_slug":"biweekly-contest-31"},{"question_id":1001,"title":"网格照明","title_slug":"grid-illumination","rating":1873.0367582475,"_hash":2294942579,"paid_only":false,"cont_title":"第 125 场周赛","cont_title_slug":"weekly-contest-125"},{"question_id":2975,"title":"移除栅栏得到的正方形田地的最大面积","title_slug":"maximum-square-area-by-removing-fences-from-a-field","rating":1873.0424923433,"_hash":3065742618,"paid_only":false,"cont_title":"第 377 场周赛","cont_title_slug":"weekly-contest-377"},{"question_id":1015,"title":"可被 K 整除的最小整数","title_slug":"smallest-integer-divisible-by-k","rating":1874.6468976233,"_hash":1796150705,"paid_only":false,"cont_title":"第 129 场周赛","cont_title_slug":"weekly-contest-129"},{"question_id":2808,"title":"使循环数组所有元素相等的最少秒数","title_slug":"minimum-seconds-to-equalize-a-circular-array","rating":1875.4217845362,"_hash":236837608,"paid_only":false,"cont_title":"第 110 场双周赛","cont_title_slug":"biweekly-contest-110"},{"question_id":1392,"title":"最长快乐前缀","title_slug":"longest-happy-prefix","rating":1876.146019008,"_hash":3616385781,"paid_only":false,"cont_title":"第 181 场周赛","cont_title_slug":"weekly-contest-181"},{"question_id":1838,"title":"最高频元素的频数","title_slug":"frequency-of-the-most-frequent-element","rating":1876.3611046625,"_hash":2806558939,"paid_only":false,"cont_title":"第 238 场周赛","cont_title_slug":"weekly-contest-238"},{"question_id":955,"title":"删列造序 II","title_slug":"delete-columns-to-make-sorted-ii","rating":1876.3854625677,"_hash":2817465096,"paid_only":false,"cont_title":"第 114 场周赛","cont_title_slug":"weekly-contest-114"},{"question_id":1234,"title":"替换子串得到平衡字符串","title_slug":"replace-the-substring-for-balanced-string","rating":1877.8983358307,"_hash":2144998386,"paid_only":false,"cont_title":"第 159 场周赛","cont_title_slug":"weekly-contest-159"},{"question_id":2101,"title":"引爆最多的炸弹","title_slug":"detonate-the-maximum-bombs","rating":1880.0511044074,"_hash":1604381884,"paid_only":false,"cont_title":"第 67 场双周赛","cont_title_slug":"biweekly-contest-67"},{"question_id":1106,"title":"解析布尔表达式","title_slug":"parsing-a-boolean-expression","rating":1880.4226853663,"_hash":253585197,"paid_only":false,"cont_title":"第 143 场周赛","cont_title_slug":"weekly-contest-143"},{"question_id":1536,"title":"排布二进制网格的最少交换次数","title_slug":"minimum-swaps-to-arrange-a-binary-grid","rating":1880.5909929633,"_hash":2214262554,"paid_only":false,"cont_title":"第 200 场周赛","cont_title_slug":"weekly-contest-200"},{"question_id":858,"title":"镜面反射","title_slug":"mirror-reflection","rating":1880.7433591583,"_hash":1432071996,"paid_only":false,"cont_title":"第 90 场周赛","cont_title_slug":"weekly-contest-90"},{"question_id":1255,"title":"得分最高的单词集合","title_slug":"maximum-score-words-formed-by-letters","rating":1881.6810367589,"_hash":2776150092,"paid_only":false,"cont_title":"第 162 场周赛","cont_title_slug":"weekly-contest-162"},{"question_id":2976,"title":"转换字符串的最小成本 I","title_slug":"minimum-cost-to-convert-string-i","rating":1882.0842446557,"_hash":2860849459,"paid_only":false,"cont_title":"第 377 场周赛","cont_title_slug":"weekly-contest-377"},{"question_id":2054,"title":"两个最好的不重叠活动","title_slug":"two-best-non-overlapping-events","rating":1883.3541964032,"_hash":2546467088,"paid_only":false,"cont_title":"第 64 场双周赛","cont_title_slug":"biweekly-contest-64"},{"question_id":1326,"title":"灌溉花园的最少水龙头数目","title_slug":"minimum-number-of-taps-to-open-to-water-a-garden","rating":1885.0178370385,"_hash":701261553,"paid_only":false,"cont_title":"第 172 场周赛","cont_title_slug":"weekly-contest-172"},{"question_id":1066,"title":"校园自行车分配 II","title_slug":"campus-bikes-ii","rating":1885.1051527272,"_hash":729170392,"paid_only":false,"cont_title":"第 1 场双周赛","cont_title_slug":"biweekly-contest-1"},{"question_id":2064,"title":"分配给商店的最多商品的最小值","title_slug":"minimized-maximum-of-products-distributed-to-any-store","rating":1885.9015646531,"_hash":2819110526,"paid_only":false,"cont_title":"第 266 场周赛","cont_title_slug":"weekly-contest-266"},{"question_id":2305,"title":"公平分发饼干","title_slug":"fair-distribution-of-cookies","rating":1886.7040111218,"_hash":3444975876,"paid_only":false,"cont_title":"第 297 场周赛","cont_title_slug":"weekly-contest-297"},{"question_id":2817,"title":"限制条件下元素之间的最小绝对差","title_slug":"minimum-absolute-difference-between-elements-with-constraint","rating":1889.4554322242,"_hash":2701115423,"paid_only":false,"cont_title":"第 358 场周赛","cont_title_slug":"weekly-contest-358"},{"question_id":2537,"title":"统计好子数组的数目","title_slug":"count-the-number-of-good-subarrays","rating":1891.8455273506,"_hash":2668311333,"paid_only":false,"cont_title":"第 328 场周赛","cont_title_slug":"weekly-contest-328"},{"question_id":1722,"title":"执行交换操作后的最小汉明距离","title_slug":"minimize-hamming-distance-after-swap-operations","rating":1892.1600619469,"_hash":3235710031,"paid_only":false,"cont_title":"第 223 场周赛","cont_title_slug":"weekly-contest-223"},{"question_id":2327,"title":"知道秘密的人数","title_slug":"number-of-people-aware-of-a-secret","rating":1893.5143805402,"_hash":1370775302,"paid_only":false,"cont_title":"第 300 场周赛","cont_title_slug":"weekly-contest-300"},{"question_id":3036,"title":"匹配模式数组的子数组数目 II","title_slug":"number-of-subarrays-that-match-a-pattern-ii","rating":1894.5496928891,"_hash":1878147567,"paid_only":false,"cont_title":"第 384 场周赛","cont_title_slug":"weekly-contest-384"},{"question_id":1871,"title":"跳跃游戏 VII","title_slug":"jump-game-vii","rating":1896.1411567598,"_hash":2335538835,"paid_only":false,"cont_title":"第 242 场周赛","cont_title_slug":"weekly-contest-242"},{"question_id":3030,"title":"找出网格的区域平均强度","title_slug":"find-the-grid-of-region-average","rating":1896.4053993495,"_hash":2583029056,"paid_only":false,"cont_title":"第 383 场周赛","cont_title_slug":"weekly-contest-383"},{"question_id":878,"title":"第 N 个神奇数字","title_slug":"nth-magical-number","rating":1896.7975214446,"_hash":2613974860,"paid_only":false,"cont_title":"第 95 场周赛","cont_title_slug":"weekly-contest-95"},{"question_id":2360,"title":"图中的最长环","title_slug":"longest-cycle-in-a-graph","rating":1897.1863301576,"_hash":218781353,"paid_only":false,"cont_title":"第 304 场周赛","cont_title_slug":"weekly-contest-304"},{"question_id":1878,"title":"矩阵中最大的三个菱形和","title_slug":"get-biggest-three-rhombus-sums-in-a-grid","rating":1897.5516652727,"_hash":3647529643,"paid_only":false,"cont_title":"第 53 场双周赛","cont_title_slug":"biweekly-contest-53"},{"question_id":2901,"title":"最长相邻不相等子序列 II","title_slug":"longest-unequal-adjacent-groups-subsequence-ii","rating":1898.8339532179,"_hash":770030188,"paid_only":false,"cont_title":"第 115 场双周赛","cont_title_slug":"biweekly-contest-115"},{"question_id":1665,"title":"完成所有任务的最少初始能量","title_slug":"minimum-initial-energy-to-finish-tasks","rating":1900.8434122725,"_hash":4008128316,"paid_only":false,"cont_title":"第 216 场周赛","cont_title_slug":"weekly-contest-216"},{"question_id":2602,"title":"使数组元素全部相等的最少操作次数","title_slug":"minimum-operations-to-make-all-array-elements-equal","rating":1903.1973989877,"_hash":761999420,"paid_only":false,"cont_title":"第 338 场周赛","cont_title_slug":"weekly-contest-338"},{"question_id":2608,"title":"图中的最短环","title_slug":"shortest-cycle-in-a-graph","rating":1904.2279434479,"_hash":1825399219,"paid_only":false,"cont_title":"第 101 场双周赛","cont_title_slug":"biweekly-contest-101"},{"question_id":1124,"title":"表现良好的最长时间段","title_slug":"longest-well-performing-interval","rating":1908.3866125757,"_hash":2409750542,"paid_only":false,"cont_title":"第 145 场周赛","cont_title_slug":"weekly-contest-145"},{"question_id":991,"title":"坏了的计算器","title_slug":"broken-calculator","rating":1909.4189035523,"_hash":376871815,"paid_only":false,"cont_title":"第 123 场周赛","cont_title_slug":"weekly-contest-123"},{"question_id":2585,"title":"获得分数的方法数","title_slug":"number-of-ways-to-earn-points","rating":1909.5535861652,"_hash":1697537146,"paid_only":false,"cont_title":"第 335 场周赛","cont_title_slug":"weekly-contest-335"},{"question_id":873,"title":"最长的斐波那契子序列的长度","title_slug":"length-of-longest-fibonacci-subsequence","rating":1911.1959516695,"_hash":3865734981,"paid_only":false,"cont_title":"第 94 场周赛","cont_title_slug":"weekly-contest-94"},{"question_id":2049,"title":"统计最高分的节点数目","title_slug":"count-nodes-with-the-highest-score","rating":1911.7063530593,"_hash":3202447407,"paid_only":false,"cont_title":"第 264 场周赛","cont_title_slug":"weekly-contest-264"},{"question_id":2296,"title":"设计一个文本编辑器","title_slug":"design-a-text-editor","rating":1911.8282317986,"_hash":536229655,"paid_only":false,"cont_title":"第 296 场周赛","cont_title_slug":"weekly-contest-296"},{"question_id":1147,"title":"段式回文","title_slug":"longest-chunked-palindrome-decomposition","rating":1912.0829958001,"_hash":1184414922,"paid_only":false,"cont_title":"第 148 场周赛","cont_title_slug":"weekly-contest-148"},{"question_id":2680,"title":"最大或值","title_slug":"maximum-or","rating":1912.1926699881,"_hash":1962061945,"paid_only":false,"cont_title":"第 104 场双周赛","cont_title_slug":"biweekly-contest-104"},{"question_id":1898,"title":"可移除字符的最大数目","title_slug":"maximum-number-of-removable-characters","rating":1912.8440554296,"_hash":1548254728,"paid_only":false,"cont_title":"第 245 场周赛","cont_title_slug":"weekly-contest-245"},{"question_id":1671,"title":"得到山形数组的最少删除次数","title_slug":"minimum-number-of-removals-to-make-mountain-array","rating":1912.8455659711,"_hash":509699848,"paid_only":false,"cont_title":"第 40 场双周赛","cont_title_slug":"biweekly-contest-40"},{"question_id":1373,"title":"二叉搜索子树的最大键值和","title_slug":"maximum-sum-bst-in-binary-tree","rating":1913.6704728453,"_hash":2919642920,"paid_only":false,"cont_title":"第 21 场双周赛","cont_title_slug":"biweekly-contest-21"},{"question_id":2875,"title":"无限数组的最短子数组","title_slug":"minimum-size-subarray-in-infinite-array","rating":1913.930869473,"_hash":3124896474,"paid_only":false,"cont_title":"第 365 场周赛","cont_title_slug":"weekly-contest-365"},{"question_id":2147,"title":"分隔长廊的方案数","title_slug":"number-of-ways-to-divide-a-long-corridor","rating":1914.6717285348,"_hash":4014976365,"paid_only":false,"cont_title":"第 70 场双周赛","cont_title_slug":"biweekly-contest-70"},{"question_id":2594,"title":"修车的最少时间","title_slug":"minimum-time-to-repair-cars","rating":1915.2628132733,"_hash":2422059385,"paid_only":false,"cont_title":"第 100 场双周赛","cont_title_slug":"biweekly-contest-100"},{"question_id":1043,"title":"分隔数组以得到最大和","title_slug":"partition-array-for-maximum-sum","rating":1916.0689858272,"_hash":1916400350,"paid_only":false,"cont_title":"第 136 场周赛","cont_title_slug":"weekly-contest-136"},{"question_id":2673,"title":"使二叉树所有路径值相等的最小代价","title_slug":"make-costs-of-paths-equal-in-a-binary-tree","rating":1917.1049672432,"_hash":1853031865,"paid_only":false,"cont_title":"第 344 场周赛","cont_title_slug":"weekly-contest-344"},{"question_id":2398,"title":"预算内的最多机器人数目","title_slug":"maximum-number-of-robots-within-budget","rating":1917.2145829853,"_hash":1856172895,"paid_only":false,"cont_title":"第 86 场双周赛","cont_title_slug":"biweekly-contest-86"},{"question_id":3002,"title":"移除后集合的最多元素数","title_slug":"maximum-size-of-a-set-after-removals","rating":1917.4314822412,"_hash":3228686257,"paid_only":false,"cont_title":"第 379 场周赛","cont_title_slug":"weekly-contest-379"},{"question_id":2069,"title":"模拟行走机器人 II","title_slug":"walking-robot-simulation-ii","rating":1918.9960035055,"_hash":3967032436,"paid_only":false,"cont_title":"第 65 场双周赛","cont_title_slug":"biweekly-contest-65"},{"question_id":1130,"title":"叶值的最小代价生成树","title_slug":"minimum-cost-tree-from-leaf-values","rating":1919.1749818083,"_hash":2542321733,"paid_only":false,"cont_title":"第 146 场周赛","cont_title_slug":"weekly-contest-146"},{"question_id":1416,"title":"恢复数组","title_slug":"restore-the-array","rating":1919.6391896894,"_hash":3484470279,"paid_only":false,"cont_title":"第 24 场双周赛","cont_title_slug":"biweekly-contest-24"},{"question_id":1552,"title":"两球之间的磁力","title_slug":"magnetic-force-between-two-balls","rating":1919.7433862082,"_hash":1049961856,"paid_only":false,"cont_title":"第 202 场周赛","cont_title_slug":"weekly-contest-202"},{"question_id":2731,"title":"移动机器人","title_slug":"movement-of-robots","rating":1922.9521758079,"_hash":1590024460,"paid_only":false,"cont_title":"第 106 场双周赛","cont_title_slug":"biweekly-contest-106"},{"question_id":1745,"title":"分割回文串 IV","title_slug":"palindrome-partitioning-iv","rating":1924.964639491,"_hash":1796587921,"paid_only":false,"cont_title":"第 226 场周赛","cont_title_slug":"weekly-contest-226"},{"question_id":1727,"title":"重新排列后的最大子矩阵","title_slug":"largest-submatrix-with-rearrangements","rating":1926.7059583253,"_hash":1815395495,"paid_only":false,"cont_title":"第 224 场周赛","cont_title_slug":"weekly-contest-224"},{"question_id":1449,"title":"数位成本和为目标值的最大数字","title_slug":"form-largest-integer-with-digits-that-add-up-to-target","rating":1927.4000816649,"_hash":1490454383,"paid_only":false,"cont_title":"第 26 场双周赛","cont_title_slug":"biweekly-contest-26"},{"question_id":1562,"title":"查找大小为 M 的最新分组","title_slug":"find-latest-group-of-size-m","rating":1928.2304187946,"_hash":239079794,"paid_only":false,"cont_title":"第 203 场周赛","cont_title_slug":"weekly-contest-203"},{"question_id":2654,"title":"使数组所有元素变成 1 的最少操作次数","title_slug":"minimum-number-of-operations-to-make-all-array-elements-equal-to-1","rating":1928.7961204946,"_hash":2113446044,"paid_only":false,"cont_title":"第 342 场周赛","cont_title_slug":"weekly-contest-342"},{"question_id":1802,"title":"有界数组中指定下标处的最大值","title_slug":"maximum-value-at-a-given-index-in-a-bounded-array","rating":1929.3184180196,"_hash":1767826160,"paid_only":false,"cont_title":"第 233 场周赛","cont_title_slug":"weekly-contest-233"},{"question_id":2018,"title":"判断单词是否能放入填字游戏内","title_slug":"check-if-word-can-be-placed-in-crossword","rating":1929.897343316,"_hash":1485423720,"paid_only":false,"cont_title":"第 260 场周赛","cont_title_slug":"weekly-contest-260"},{"question_id":1705,"title":"吃苹果的最大数目","title_slug":"maximum-number-of-eaten-apples","rating":1929.9086934334,"_hash":1687639369,"paid_only":false,"cont_title":"第 221 场周赛","cont_title_slug":"weekly-contest-221"},{"question_id":1798,"title":"你能构造出连续值的最大数目","title_slug":"maximum-number-of-consecutive-values-you-can-make","rating":1931.0849921121,"_hash":2407589215,"paid_only":false,"cont_title":"第 48 场双周赛","cont_title_slug":"biweekly-contest-48"},{"question_id":1574,"title":"删除最短的子数组使剩余数组有序","title_slug":"shortest-subarray-to-be-removed-to-make-array-sorted","rating":1931.7335479582,"_hash":236080983,"paid_only":false,"cont_title":"第 34 场双周赛","cont_title_slug":"biweekly-contest-34"},{"question_id":996,"title":"正方形数组的数目","title_slug":"number-of-squareful-arrays","rating":1932.3730795204,"_hash":448999750,"paid_only":false,"cont_title":"第 124 场周赛","cont_title_slug":"weekly-contest-124"},{"question_id":1964,"title":"找出到每个位置为止最长的有效障碍赛跑路线","title_slug":"find-the-longest-valid-obstacle-course-at-each-position","rating":1933.2169470617,"_hash":2251945224,"paid_only":false,"cont_title":"第 253 场周赛","cont_title_slug":"weekly-contest-253"},{"question_id":1818,"title":"绝对差值和","title_slug":"minimum-absolute-sum-difference","rating":1934.3556201811,"_hash":445102839,"paid_only":false,"cont_title":"第 235 场周赛","cont_title_slug":"weekly-contest-235"},{"question_id":2411,"title":"按位或最大的最小子数组长度","title_slug":"smallest-subarrays-with-maximum-bitwise-or","rating":1938.0586460002,"_hash":1975607113,"paid_only":false,"cont_title":"第 87 场双周赛","cont_title_slug":"biweekly-contest-87"},{"question_id":866,"title":"回文质数","title_slug":"prime-palindrome","rating":1938.2224916289,"_hash":3105635512,"paid_only":false,"cont_title":"第 92 场周赛","cont_title_slug":"weekly-contest-92"},{"question_id":2925,"title":"在树上执行操作以后得到的最大分数","title_slug":"maximum-score-after-applying-operations-on-a-tree","rating":1939.560165526,"_hash":750309798,"paid_only":false,"cont_title":"第 370 场周赛","cont_title_slug":"weekly-contest-370"},{"question_id":1760,"title":"袋子里最少数目的球","title_slug":"minimum-limit-of-balls-in-a-bag","rating":1939.9323330472,"_hash":3825739123,"paid_only":false,"cont_title":"第 228 场周赛","cont_title_slug":"weekly-contest-228"},{"question_id":2762,"title":"不间断子数组","title_slug":"continuous-subarrays","rating":1940.2116985812,"_hash":224630615,"paid_only":false,"cont_title":"第 352 场周赛","cont_title_slug":"weekly-contest-352"},{"question_id":2111,"title":"使数组 K 递增的最少操作次数","title_slug":"minimum-operations-to-make-the-array-k-increasing","rating":1940.6002290953,"_hash":1403965423,"paid_only":false,"cont_title":"第 272 场周赛","cont_title_slug":"weekly-contest-272"},{"question_id":2227,"title":"加密解密字符串","title_slug":"encrypt-and-decrypt-strings","rating":1944.5673996888,"_hash":4089321877,"paid_only":false,"cont_title":"第 287 场周赛","cont_title_slug":"weekly-contest-287"},{"question_id":1482,"title":"制作 m 束花所需的最少天数","title_slug":"minimum-number-of-days-to-make-m-bouquets","rating":1945.5095833982,"_hash":1858278973,"paid_only":false,"cont_title":"第 193 场周赛","cont_title_slug":"weekly-contest-193"},{"question_id":1793,"title":"好子数组的最大分数","title_slug":"maximum-score-of-a-good-subarray","rating":1945.7515607928,"_hash":3184596428,"paid_only":false,"cont_title":"第 232 场周赛","cont_title_slug":"weekly-contest-232"},{"question_id":1631,"title":"最小体力消耗路径","title_slug":"path-with-minimum-effort","rating":1947.5013967785,"_hash":3894947933,"paid_only":false,"cont_title":"第 212 场周赛","cont_title_slug":"weekly-contest-212"},{"question_id":2516,"title":"每种字符至少取 K 个","title_slug":"take-k-of-each-character-from-left-and-right","rating":1947.8832856412,"_hash":2088911620,"paid_only":false,"cont_title":"第 325 场周赛","cont_title_slug":"weekly-contest-325"},{"question_id":2509,"title":"查询树中环的长度","title_slug":"cycle-length-queries-in-a-tree","rating":1948.489500779,"_hash":922086852,"paid_only":false,"cont_title":"第 324 场周赛","cont_title_slug":"weekly-contest-324"},{"question_id":1153,"title":"字符串转化","title_slug":"string-transforms-into-another-string","rating":1949.0920823355,"_hash":120648461,"paid_only":false,"cont_title":"第 6 场双周赛","cont_title_slug":"biweekly-contest-6"},{"question_id":1690,"title":"石子游戏 VII","title_slug":"stone-game-vii","rating":1951.2096212775,"_hash":1168505902,"paid_only":false,"cont_title":"第 219 场周赛","cont_title_slug":"weekly-contest-219"},{"question_id":1259,"title":"不相交的握手","title_slug":"handshakes-that-dont-cross","rating":1951.3509259668,"_hash":108728140,"paid_only":false,"cont_title":"第 13 场双周赛","cont_title_slug":"biweekly-contest-13"},{"question_id":2435,"title":"矩阵中和能被 K 整除的路径","title_slug":"paths-in-matrix-whose-sum-is-divisible-by-k","rating":1951.5918682146,"_hash":3930025215,"paid_only":false,"cont_title":"第 314 场周赛","cont_title_slug":"weekly-contest-314"},{"question_id":1737,"title":"满足三条件之一需改变的最少字符数","title_slug":"change-minimum-characters-to-satisfy-one-of-three-conditions","rating":1952.7073399331,"_hash":3302467434,"paid_only":false,"cont_title":"第 225 场周赛","cont_title_slug":"weekly-contest-225"},{"question_id":2434,"title":"使用机器人打印字典序最小的字符串","title_slug":"using-a-robot-to-print-the-lexicographically-smallest-string","rating":1953.137726744,"_hash":3067908479,"paid_only":false,"cont_title":"第 314 场周赛","cont_title_slug":"weekly-contest-314"},{"question_id":1696,"title":"跳跃游戏 VI","title_slug":"jump-game-vi","rating":1954.2533254344,"_hash":261533544,"paid_only":false,"cont_title":"第 220 场周赛","cont_title_slug":"weekly-contest-220"},{"question_id":1463,"title":"摘樱桃 II","title_slug":"cherry-pickup-ii","rating":1956.7059585934,"_hash":3773526508,"paid_only":false,"cont_title":"第 27 场双周赛","cont_title_slug":"biweekly-contest-27"},{"question_id":2564,"title":"子字符串异或查询","title_slug":"substring-xor-queries","rating":1959.2696201953,"_hash":1709868853,"paid_only":false,"cont_title":"第 332 场周赛","cont_title_slug":"weekly-contest-332"},{"question_id":2392,"title":"给定条件下构造矩阵","title_slug":"build-a-matrix-with-conditions","rating":1960.5517123728,"_hash":700466705,"paid_only":false,"cont_title":"第 308 场周赛","cont_title_slug":"weekly-contest-308"},{"question_id":2350,"title":"不可能得到的最短骰子序列","title_slug":"shortest-impossible-sequence-of-rolls","rating":1960.5763266754,"_hash":3898582486,"paid_only":false,"cont_title":"第 83 场双周赛","cont_title_slug":"biweekly-contest-83"},{"question_id":1537,"title":"最大得分","title_slug":"get-the-maximum-score","rating":1961.4987013156,"_hash":3315363657,"paid_only":false,"cont_title":"第 200 场周赛","cont_title_slug":"weekly-contest-200"},{"question_id":1642,"title":"可以到达的最远建筑","title_slug":"furthest-building-you-can-reach","rating":1962.2005269503,"_hash":1972718658,"paid_only":false,"cont_title":"第 213 场周赛","cont_title_slug":"weekly-contest-213"},{"question_id":2439,"title":"最小化数组中的最大值","title_slug":"minimize-maximum-of-array","rating":1965.1266122355,"_hash":938263064,"paid_only":false,"cont_title":"第 89 场双周赛","cont_title_slug":"biweekly-contest-89"},{"question_id":1969,"title":"数组元素的最小非零乘积","title_slug":"minimum-non-zero-product-of-the-array-elements","rating":1966.7067914206,"_hash":4252220750,"paid_only":false,"cont_title":"第 254 场周赛","cont_title_slug":"weekly-contest-254"},{"question_id":1293,"title":"网格中的最短路径","title_slug":"shortest-path-in-a-grid-with-obstacles-elimination","rating":1967.3284576938,"_hash":3580394792,"paid_only":false,"cont_title":"第 167 场周赛","cont_title_slug":"weekly-contest-167"},{"question_id":2872,"title":"可以被 K 整除连通块的最大数目","title_slug":"maximum-number-of-k-divisible-components","rating":1967.5589835406,"_hash":1584359446,"paid_only":false,"cont_title":"第 114 场双周赛","cont_title_slug":"biweekly-contest-114"},{"question_id":1943,"title":"描述绘画结果","title_slug":"describe-the-painting","rating":1969.2019235672,"_hash":3387998069,"paid_only":false,"cont_title":"第 57 场双周赛","cont_title_slug":"biweekly-contest-57"},{"question_id":835,"title":"图像重叠","title_slug":"image-overlap","rating":1969.9845549158,"_hash":2595882232,"paid_only":false,"cont_title":"第 84 场周赛","cont_title_slug":"weekly-contest-84"},{"question_id":1032,"title":"字符流","title_slug":"stream-of-characters","rating":1970.4608098164,"_hash":1504907424,"paid_only":false,"cont_title":"第 133 场周赛","cont_title_slug":"weekly-contest-133"},{"question_id":1488,"title":"避免洪水泛滥","title_slug":"avoid-flood-in-the-city","rating":1973.7407637067,"_hash":178132881,"paid_only":false,"cont_title":"第 194 场周赛","cont_title_slug":"weekly-contest-194"},{"question_id":907,"title":"子数组的最小值之和","title_slug":"sum-of-subarray-minimums","rating":1975.5726300727,"_hash":2762853048,"paid_only":false,"cont_title":"第 102 场周赛","cont_title_slug":"weekly-contest-102"},{"question_id":2831,"title":"找出最长等值子数组","title_slug":"find-the-longest-equal-subarray","rating":1975.9693382075,"_hash":869865446,"paid_only":false,"cont_title":"第 359 场周赛","cont_title_slug":"weekly-contest-359"},{"question_id":1092,"title":"最短公共超序列","title_slug":"shortest-common-supersequence","rating":1976.7214151234,"_hash":3433602336,"paid_only":false,"cont_title":"第 141 场周赛","cont_title_slug":"weekly-contest-141"},{"question_id":1882,"title":"使用服务器处理任务","title_slug":"process-tasks-using-servers","rating":1979.1112273597,"_hash":3237851921,"paid_only":false,"cont_title":"第 243 场周赛","cont_title_slug":"weekly-contest-243"},{"question_id":1278,"title":"分割回文串 III","title_slug":"palindrome-partitioning-iii","rating":1979.1323403633,"_hash":2471898191,"paid_only":false,"cont_title":"第 165 场周赛","cont_title_slug":"weekly-contest-165"},{"question_id":2151,"title":"基于陈述统计最多好人数","title_slug":"maximum-good-people-based-on-statements","rating":1979.9454101467,"_hash":2347660974,"paid_only":false,"cont_title":"第 277 场周赛","cont_title_slug":"weekly-contest-277"},{"question_id":2861,"title":"最大合金数","title_slug":"maximum-number-of-alloys","rating":1981.3072959787,"_hash":1197966112,"paid_only":false,"cont_title":"第 363 场周赛","cont_title_slug":"weekly-contest-363"},{"question_id":1250,"title":"检查「好数组」","title_slug":"check-if-it-is-a-good-array","rating":1983.2319731313,"_hash":4185904896,"paid_only":false,"cont_title":"第 161 场周赛","cont_title_slug":"weekly-contest-161"},{"question_id":1733,"title":"需要教语言的最少人数","title_slug":"minimum-number-of-people-to-teach","rating":1983.70440706,"_hash":2904534885,"paid_only":false,"cont_title":"第 44 场双周赛","cont_title_slug":"biweekly-contest-44"},{"question_id":2963,"title":"统计好分割方案的数目","title_slug":"count-the-number-of-good-partitions","rating":1984.9685663849,"_hash":3740959852,"paid_only":false,"cont_title":"第 375 场周赛","cont_title_slug":"weekly-contest-375"},{"question_id":940,"title":"不同的子序列 II","title_slug":"distinct-subsequences-ii","rating":1985.2417520906,"_hash":2213463441,"paid_only":false,"cont_title":"第 110 场周赛","cont_title_slug":"weekly-contest-110"},{"question_id":928,"title":"尽量减少恶意软件的传播 II","title_slug":"minimize-malware-spread-ii","rating":1985.2504512337,"_hash":1457368038,"paid_only":false,"cont_title":"第 107 场周赛","cont_title_slug":"weekly-contest-107"},{"question_id":902,"title":"最大为 N 的数字组合","title_slug":"numbers-at-most-n-given-digit-set","rating":1989.5369509422,"_hash":3023386017,"paid_only":false,"cont_title":"第 101 场周赛","cont_title_slug":"weekly-contest-101"},{"question_id":963,"title":"最小面积矩形 II","title_slug":"minimum-area-rectangle-ii","rating":1990.7738526153,"_hash":2631196608,"paid_only":false,"cont_title":"第 116 场周赛","cont_title_slug":"weekly-contest-116"},{"question_id":1625,"title":"执行操作后字典序最小的字符串","title_slug":"lexicographically-smallest-string-after-applying-operations","rating":1992.0032292739,"_hash":3307683900,"paid_only":false,"cont_title":"第 211 场周赛","cont_title_slug":"weekly-contest-211"},{"question_id":927,"title":"三等分","title_slug":"three-equal-parts","rating":1994.3618892548,"_hash":2182253577,"paid_only":false,"cont_title":"第 107 场周赛","cont_title_slug":"weekly-contest-107"},{"question_id":1986,"title":"完成任务的最少工作时间段","title_slug":"minimum-number-of-work-sessions-to-finish-the-tasks","rating":1995.2937073376,"_hash":1113985320,"paid_only":false,"cont_title":"第 256 场周赛","cont_title_slug":"weekly-contest-256"},{"question_id":1274,"title":"矩形内船只的数目","title_slug":"number-of-ships-in-a-rectangle","rating":1997.1824403719,"_hash":474791918,"paid_only":false,"cont_title":"第 14 场双周赛","cont_title_slug":"biweekly-contest-14"},{"question_id":2250,"title":"统计包含每个点的矩形数目","title_slug":"count-number-of-rectangles-containing-each-point","rating":1997.7013718153,"_hash":1075971933,"paid_only":false,"cont_title":"第 290 场周赛","cont_title_slug":"weekly-contest-290"},{"question_id":2488,"title":"统计中位数为 K 的子数组","title_slug":"count-subarrays-with-median-k","rating":1998.889914712,"_hash":2631420913,"paid_only":false,"cont_title":"第 321 场周赛","cont_title_slug":"weekly-contest-321"},{"question_id":911,"title":"在线选举","title_slug":"online-election","rating":2000.8021428612,"_hash":2045578042,"paid_only":false,"cont_title":"第 103 场周赛","cont_title_slug":"weekly-contest-103"},{"question_id":1686,"title":"石子游戏 VI","title_slug":"stone-game-vi","rating":2000.8441804448,"_hash":1954801587,"paid_only":false,"cont_title":"第 41 场双周赛","cont_title_slug":"biweekly-contest-41"},{"question_id":2328,"title":"网格图中递增路径的数目","title_slug":"number-of-increasing-paths-in-a-grid","rating":2001.2074132383,"_hash":2560027362,"paid_only":false,"cont_title":"第 300 场周赛","cont_title_slug":"weekly-contest-300"},{"question_id":2850,"title":"将石头分散到网格图的最少移动次数","title_slug":"minimum-moves-to-spread-stones-over-grid","rating":2001.4515854273,"_hash":3939185799,"paid_only":false,"cont_title":"第 362 场周赛","cont_title_slug":"weekly-contest-362"},{"question_id":2092,"title":"找出知晓秘密的所有专家","title_slug":"find-all-people-with-secret","rating":2003.5794613668,"_hash":340770494,"paid_only":false,"cont_title":"第 269 场周赛","cont_title_slug":"weekly-contest-269"},{"question_id":1927,"title":"求和游戏","title_slug":"sum-game","rating":2004.5346526204,"_hash":1519983797,"paid_only":false,"cont_title":"第 56 场双周赛","cont_title_slug":"biweekly-contest-56"},{"question_id":1761,"title":"一个图中连通三元组的最小度数","title_slug":"minimum-degree-of-a-connected-trio-in-a-graph","rating":2005.2755755378,"_hash":1808561792,"paid_only":false,"cont_title":"第 228 场周赛","cont_title_slug":"weekly-contest-228"},{"question_id":2448,"title":"使数组相等的最小开销","title_slug":"minimum-cost-to-make-array-equal","rating":2005.3737929084,"_hash":1689171801,"paid_only":false,"cont_title":"第 316 场周赛","cont_title_slug":"weekly-contest-316"},{"question_id":1888,"title":"使二进制字符串字符交替的最少反转次数","title_slug":"minimum-number-of-flips-to-make-the-binary-string-alternating","rating":2005.5862669078,"_hash":3565951903,"paid_only":false,"cont_title":"第 244 场周赛","cont_title_slug":"weekly-contest-244"},{"question_id":1223,"title":"掷骰子模拟","title_slug":"dice-roll-simulation","rating":2008.40650791,"_hash":1023816398,"paid_only":false,"cont_title":"第 158 场周赛","cont_title_slug":"weekly-contest-158"},{"question_id":1981,"title":"最小化目标值与所选元素的差","title_slug":"minimize-the-difference-between-target-and-chosen-elements","rating":2009.7322365973,"_hash":3922635563,"paid_only":false,"cont_title":"第 255 场周赛","cont_title_slug":"weekly-contest-255"},{"question_id":880,"title":"索引处的解码字符串","title_slug":"decoded-string-at-index","rating":2010.5524756946,"_hash":3383627644,"paid_only":false,"cont_title":"第 96 场周赛","cont_title_slug":"weekly-contest-96"},{"question_id":2333,"title":"最小差值平方和","title_slug":"minimum-sum-of-squared-difference","rating":2011.0496162515,"_hash":374180471,"paid_only":false,"cont_title":"第 82 场双周赛","cont_title_slug":"biweekly-contest-82"},{"question_id":1102,"title":"得分最高的路径","title_slug":"path-with-maximum-minimum-value","rating":2011.3542735398,"_hash":319427731,"paid_only":false,"cont_title":"第 3 场双周赛","cont_title_slug":"biweekly-contest-3"},{"question_id":2477,"title":"到达首都的最少油耗","title_slug":"minimum-fuel-cost-to-report-to-the-capital","rating":2011.9703133514,"_hash":340860484,"paid_only":false,"cont_title":"第 320 场周赛","cont_title_slug":"weekly-contest-320"},{"question_id":2472,"title":"不重叠回文子字符串的最大数目","title_slug":"maximum-number-of-non-overlapping-palindrome-substrings","rating":2013.4354344791,"_hash":3513036702,"paid_only":false,"cont_title":"第 319 场周赛","cont_title_slug":"weekly-contest-319"},{"question_id":1105,"title":"填充书架","title_slug":"filling-bookcase-shelves","rating":2014.2979320644,"_hash":2099267983,"paid_only":false,"cont_title":"第 143 场周赛","cont_title_slug":"weekly-contest-143"},{"question_id":1354,"title":"多次求和构造目标数组","title_slug":"construct-target-array-with-multiple-sums","rating":2014.7655493665,"_hash":681133837,"paid_only":false,"cont_title":"第 176 场周赛","cont_title_slug":"weekly-contest-176"},{"question_id":1353,"title":"最多可以参加的会议数目","title_slug":"maximum-number-of-events-that-can-be-attended","rating":2015.7291888336,"_hash":2529461898,"paid_only":false,"cont_title":"第 176 场周赛","cont_title_slug":"weekly-contest-176"},{"question_id":3008,"title":"找出数组中的美丽下标 II","title_slug":"find-beautiful-indices-in-the-given-array-ii","rating":2016.2085876254,"_hash":1547023723,"paid_only":false,"cont_title":"第 380 场周赛","cont_title_slug":"weekly-contest-380"},{"question_id":909,"title":"蛇梯棋","title_slug":"snakes-and-ladders","rating":2019.5399647546,"_hash":478874060,"paid_only":false,"cont_title":"第 103 场周赛","cont_title_slug":"weekly-contest-103"},{"question_id":2547,"title":"拆分数组的最小代价","title_slug":"minimum-cost-to-split-an-array","rating":2019.9859462755,"_hash":3573894690,"paid_only":false,"cont_title":"第 329 场周赛","cont_title_slug":"weekly-contest-329"},{"question_id":3027,"title":"人员站位的方案数 II","title_slug":"find-the-number-of-ways-to-place-people-ii","rating":2020.1846215023,"_hash":79432680,"paid_only":false,"cont_title":"第 123 场双周赛","cont_title_slug":"biweekly-contest-123"},{"question_id":2517,"title":"礼盒的最大甜蜜度","title_slug":"maximum-tastiness-of-candy-basket","rating":2020.6775180586,"_hash":337441895,"paid_only":false,"cont_title":"第 325 场周赛","cont_title_slug":"weekly-contest-325"},{"question_id":2741,"title":"特别的排列","title_slug":"special-permutations","rating":2020.7095306378,"_hash":492772626,"paid_only":false,"cont_title":"第 350 场周赛","cont_title_slug":"weekly-contest-350"},{"question_id":2271,"title":"毯子覆盖的最多白色砖块数","title_slug":"maximum-white-tiles-covered-by-a-carpet","rating":2021.7790710467,"_hash":1450266090,"paid_only":false,"cont_title":"第 78 场双周赛","cont_title_slug":"biweekly-contest-78"},{"question_id":2251,"title":"花期内花的数目","title_slug":"number-of-flowers-in-full-bloom","rating":2022.3137128296,"_hash":251006919,"paid_only":false,"cont_title":"第 290 场周赛","cont_title_slug":"weekly-contest-290"},{"question_id":1210,"title":"穿过迷宫的最少移动次数","title_slug":"minimum-moves-to-reach-target-with-rotations","rating":2022.4752963768,"_hash":2716747123,"paid_only":false,"cont_title":"第 156 场周赛","cont_title_slug":"weekly-contest-156"},{"question_id":1235,"title":"规划兼职工作","title_slug":"maximum-profit-in-job-scheduling","rating":2022.8520613737,"_hash":4225343365,"paid_only":false,"cont_title":"第 159 场周赛","cont_title_slug":"weekly-contest-159"},{"question_id":2597,"title":"美丽子集的数目","title_slug":"the-number-of-beautiful-subsets","rating":2023.4303440211,"_hash":1913772288,"paid_only":false,"cont_title":"第 337 场周赛","cont_title_slug":"weekly-contest-337"},{"question_id":1734,"title":"解码异或后的排列","title_slug":"decode-xored-permutation","rating":2024.3797833173,"_hash":2691544887,"paid_only":false,"cont_title":"第 44 场双周赛","cont_title_slug":"biweekly-contest-44"},{"question_id":1067,"title":"范围内的数字计数","title_slug":"digit-count-in-range","rating":2025.1529365814,"_hash":1347652080,"paid_only":false,"cont_title":"第 1 场双周赛","cont_title_slug":"biweekly-contest-1"},{"question_id":1406,"title":"石子游戏 III","title_slug":"stone-game-iii","rating":2026.8957817007,"_hash":3979947991,"paid_only":false,"cont_title":"第 183 场周赛","cont_title_slug":"weekly-contest-183"},{"question_id":1626,"title":"无矛盾的最佳球队","title_slug":"best-team-with-no-conflicts","rating":2027.3839266711,"_hash":205364228,"paid_only":false,"cont_title":"第 211 场周赛","cont_title_slug":"weekly-contest-211"},{"question_id":1320,"title":"二指输入的的最小距离","title_slug":"minimum-distance-to-type-a-word-using-two-fingers","rating":2027.7304121046,"_hash":3992139324,"paid_only":false,"cont_title":"第 171 场周赛","cont_title_slug":"weekly-contest-171"},{"question_id":895,"title":"最大频率栈","title_slug":"maximum-frequency-stack","rating":2027.8772739639,"_hash":4136320759,"paid_only":false,"cont_title":"第 99 场周赛","cont_title_slug":"weekly-contest-99"},{"question_id":1231,"title":"分享巧克力","title_slug":"divide-chocolate","rating":2029.1301557536,"_hash":1053077839,"paid_only":false,"cont_title":"第 11 场双周赛","cont_title_slug":"biweekly-contest-11"},{"question_id":2772,"title":"使数组中的所有元素都等于零","title_slug":"apply-operations-to-make-all-array-elements-equal-to-zero","rating":2029.4024513478,"_hash":1866851323,"paid_only":false,"cont_title":"第 353 场周赛","cont_title_slug":"weekly-contest-353"},{"question_id":2426,"title":"满足不等式的数对数目","title_slug":"number-of-pairs-satisfying-inequality","rating":2030.1021023033,"_hash":1785363546,"paid_only":false,"cont_title":"第 88 场双周赛","cont_title_slug":"biweekly-contest-88"},{"question_id":2919,"title":"使数组变美的最小增量运算数","title_slug":"minimum-increment-operations-to-make-array-beautiful","rating":2030.922770301,"_hash":1420249701,"paid_only":false,"cont_title":"第 369 场周赛","cont_title_slug":"weekly-contest-369"},{"question_id":1425,"title":"带限制的子序列和","title_slug":"constrained-subsequence-sum","rating":2032.4773038683,"_hash":1691609067,"paid_only":false,"cont_title":"第 186 场周赛","cont_title_slug":"weekly-contest-186"},{"question_id":2262,"title":"字符串的总引力","title_slug":"total-appeal-of-a-string","rating":2033.1699277531,"_hash":3802833057,"paid_only":false,"cont_title":"第 291 场周赛","cont_title_slug":"weekly-contest-291"},{"question_id":2136,"title":"全部开花的最早一天","title_slug":"earliest-possible-day-of-full-bloom","rating":2033.4597721985,"_hash":1189152973,"paid_only":false,"cont_title":"第 275 场周赛","cont_title_slug":"weekly-contest-275"},{"question_id":828,"title":"统计子串中的唯一字符","title_slug":"count-unique-characters-of-all-substrings-of-a-given-string","rating":2034.4067304341,"_hash":747763790,"paid_only":false,"cont_title":"第 83 场周赛","cont_title_slug":"weekly-contest-83"},{"question_id":947,"title":"移除最多的同行或同列石头","title_slug":"most-stones-removed-with-same-row-or-column","rating":2034.6759416871,"_hash":728229560,"paid_only":false,"cont_title":"第 112 场周赛","cont_title_slug":"weekly-contest-112"},{"question_id":1335,"title":"工作计划的最低难度","title_slug":"minimum-difficulty-of-a-job-schedule","rating":2034.9420578559,"_hash":271335539,"paid_only":false,"cont_title":"第 173 场周赛","cont_title_slug":"weekly-contest-173"},{"question_id":1140,"title":"石子游戏 II","title_slug":"stone-game-ii","rating":2034.9740902393,"_hash":2086212420,"paid_only":false,"cont_title":"第 147 场周赛","cont_title_slug":"weekly-contest-147"},{"question_id":1348,"title":"推文计数","title_slug":"tweet-counts-per-frequency","rating":2036.7206020719,"_hash":2176047848,"paid_only":false,"cont_title":"第 175 场周赛","cont_title_slug":"weekly-contest-175"},{"question_id":2245,"title":"转角路径的乘积中最多能有几个尾随零","title_slug":"maximum-trailing-zeros-in-a-cornered-path","rating":2036.7410194704,"_hash":2369761961,"paid_only":false,"cont_title":"第 289 场周赛","cont_title_slug":"weekly-contest-289"},{"question_id":2116,"title":"判断一个括号字符串是否有效","title_slug":"check-if-a-parentheses-string-can-be-valid","rating":2037.6527962599,"_hash":495901528,"paid_only":false,"cont_title":"第 68 场双周赛","cont_title_slug":"biweekly-contest-68"},{"question_id":1590,"title":"使数组和能被 P 整除","title_slug":"make-sum-divisible-by-p","rating":2038.8592725467,"_hash":2279246890,"paid_only":false,"cont_title":"第 35 场双周赛","cont_title_slug":"biweekly-contest-35"},{"question_id":1201,"title":"丑数 III","title_slug":"ugly-number-iii","rating":2039.110874689,"_hash":4021161204,"paid_only":false,"cont_title":"第 155 场周赛","cont_title_slug":"weekly-contest-155"},{"question_id":1371,"title":"每个元音包含偶数次的最长子字符串","title_slug":"find-the-longest-substring-containing-vowels-in-even-counts","rating":2040.539289037,"_hash":2810226521,"paid_only":false,"cont_title":"第 21 场双周赛","cont_title_slug":"biweekly-contest-21"},{"question_id":1751,"title":"最多可以参加的会议数目 II","title_slug":"maximum-number-of-events-that-can-be-attended-ii","rating":2040.5621123027,"_hash":1944526967,"paid_only":false,"cont_title":"第 45 场双周赛","cont_title_slug":"biweekly-contest-45"},{"question_id":2551,"title":"将珠子放入背包中","title_slug":"put-marbles-in-bags","rating":2042.4005521254,"_hash":1210688937,"paid_only":false,"cont_title":"第 330 场周赛","cont_title_slug":"weekly-contest-330"},{"question_id":2735,"title":"收集巧克力","title_slug":"collecting-chocolates","rating":2043.1015779104,"_hash":3216210693,"paid_only":false,"cont_title":"第 349 场周赛","cont_title_slug":"weekly-contest-349"},{"question_id":2948,"title":"交换得到字典序最小的数组","title_slug":"make-lexicographically-smallest-array-by-swapping-elements","rating":2047.3919190727,"_hash":4034022024,"paid_only":false,"cont_title":"第 373 场周赛","cont_title_slug":"weekly-contest-373"},{"question_id":1553,"title":"吃掉 N 个橘子的最少天数","title_slug":"minimum-number-of-days-to-eat-n-oranges","rating":2048.0976546787,"_hash":3077217367,"paid_only":false,"cont_title":"第 202 场周赛","cont_title_slug":"weekly-contest-202"},{"question_id":1648,"title":"销售价值减少的颜色球","title_slug":"sell-diminishing-valued-colored-balls","rating":2050.2553211463,"_hash":4033162779,"paid_only":false,"cont_title":"第 214 场周赛","cont_title_slug":"weekly-contest-214"},{"question_id":1224,"title":"最大相等频率","title_slug":"maximum-equal-frequency","rating":2050.715977457,"_hash":3117661899,"paid_only":false,"cont_title":"第 158 场周赛","cont_title_slug":"weekly-contest-158"},{"question_id":1856,"title":"子数组最小乘积的最大值","title_slug":"maximum-subarray-min-product","rating":2051.0879431258,"_hash":209121812,"paid_only":false,"cont_title":"第 240 场周赛","cont_title_slug":"weekly-contest-240"},{"question_id":2467,"title":"树上最大得分和路径","title_slug":"most-profitable-path-in-a-tree","rating":2053.354609292,"_hash":2422423692,"paid_only":false,"cont_title":"第 91 场双周赛","cont_title_slug":"biweekly-contest-91"},{"question_id":839,"title":"相似字符串组","title_slug":"similar-string-groups","rating":2053.7468090497,"_hash":2704310299,"paid_only":false,"cont_title":"第 85 场周赛","cont_title_slug":"weekly-contest-85"},{"question_id":1575,"title":"统计所有可行路径","title_slug":"count-all-possible-routes","rating":2055.0970201875,"_hash":1387834419,"paid_only":false,"cont_title":"第 34 场双周赛","cont_title_slug":"biweekly-contest-34"},{"question_id":2542,"title":"最大子序列的分数","title_slug":"maximum-subsequence-score","rating":2056.2598215101,"_hash":301567212,"paid_only":false,"cont_title":"第 96 场双周赛","cont_title_slug":"biweekly-contest-96"},{"question_id":1473,"title":"粉刷房子 III","title_slug":"paint-house-iii","rating":2056.335494216,"_hash":741778858,"paid_only":false,"cont_title":"第 192 场周赛","cont_title_slug":"weekly-contest-192"},{"question_id":2197,"title":"替换数组中的非互质数","title_slug":"replace-non-coprime-numbers-in-array","rating":2057.4788263111,"_hash":2370755498,"paid_only":false,"cont_title":"第 283 场周赛","cont_title_slug":"weekly-contest-283"},{"question_id":1131,"title":"绝对值表达式的最大值","title_slug":"maximum-of-absolute-value-expression","rating":2059.4040623264,"_hash":1649292854,"paid_only":false,"cont_title":"第 146 场周赛","cont_title_slug":"weekly-contest-146"},{"question_id":2508,"title":"添加边使所有节点度数都为偶数","title_slug":"add-edges-to-make-degrees-of-all-nodes-even","rating":2060.0720834082,"_hash":2337606731,"paid_only":false,"cont_title":"第 324 场周赛","cont_title_slug":"weekly-contest-324"},{"question_id":2681,"title":"英雄的力量","title_slug":"power-of-heroes","rating":2060.0818824378,"_hash":3969212159,"paid_only":false,"cont_title":"第 104 场双周赛","cont_title_slug":"biweekly-contest-104"},{"question_id":2366,"title":"将数组排序的最少替换次数","title_slug":"minimum-replacements-to-sort-the-array","rating":2060.379991517,"_hash":3435556540,"paid_only":false,"cont_title":"第 84 场双周赛","cont_title_slug":"biweekly-contest-84"},{"question_id":2106,"title":"摘水果","title_slug":"maximum-fruits-harvested-after-at-most-k-steps","rating":2062.3601158741,"_hash":3434976181,"paid_only":false,"cont_title":"第 271 场周赛","cont_title_slug":"weekly-contest-271"},{"question_id":2156,"title":"查找给定哈希值的子串","title_slug":"find-substring-with-given-hash-value","rating":2062.9876807625,"_hash":3801430886,"paid_only":false,"cont_title":"第 278 场周赛","cont_title_slug":"weekly-contest-278"},{"question_id":855,"title":"考场就座","title_slug":"exam-room","rating":2067.0643721733,"_hash":362145938,"paid_only":false,"cont_title":"第 89 场周赛","cont_title_slug":"weekly-contest-89"},{"question_id":1770,"title":"执行乘法运算的最大分数","title_slug":"maximum-score-from-performing-multiplication-operations","rating":2068.0043466118,"_hash":3231265233,"paid_only":false,"cont_title":"第 229 场周赛","cont_title_slug":"weekly-contest-229"},{"question_id":1368,"title":"使网格图至少有一条有效路径的最小代价","title_slug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid","rating":2068.806637566,"_hash":2875388393,"paid_only":false,"cont_title":"第 178 场周赛","cont_title_slug":"weekly-contest-178"},{"question_id":1168,"title":"水资源分配优化","title_slug":"optimize-water-distribution-in-a-village","rating":2069.4030284676,"_hash":271664224,"paid_only":false,"cont_title":"第 7 场双周赛","cont_title_slug":"biweekly-contest-7"},{"question_id":2514,"title":"统计同位异构字符串数目","title_slug":"count-anagrams","rating":2069.7848729824,"_hash":2697534725,"paid_only":false,"cont_title":"第 94 场双周赛","cont_title_slug":"biweekly-contest-94"},{"question_id":1808,"title":"好因子的最大数目","title_slug":"maximize-number-of-nice-divisors","rating":2070.2102619334,"_hash":3237331717,"paid_only":false,"cont_title":"第 234 场周赛","cont_title_slug":"weekly-contest-234"},{"question_id":2607,"title":"使子数组元素和相等","title_slug":"make-k-subarray-sums-equal","rating":2071.3208991938,"_hash":1691357385,"paid_only":false,"cont_title":"第 101 场双周赛","cont_title_slug":"biweekly-contest-101"},{"question_id":2866,"title":"美丽塔 II","title_slug":"beautiful-towers-ii","rating":2071.6322841217,"_hash":2692580018,"paid_only":false,"cont_title":"第 364 场周赛","cont_title_slug":"weekly-contest-364"},{"question_id":1799,"title":"N 次操作后的最大分数和","title_slug":"maximize-score-after-n-operations","rating":2072.7264178313,"_hash":1580991625,"paid_only":false,"cont_title":"第 48 场双周赛","cont_title_slug":"biweekly-contest-48"},{"question_id":1850,"title":"邻位交换的最小次数","title_slug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number","rating":2073.0124645606,"_hash":1640158797,"paid_only":false,"cont_title":"第 239 场周赛","cont_title_slug":"weekly-contest-239"},{"question_id":2845,"title":"统计趣味子数组的数目","title_slug":"count-of-interesting-subarrays","rating":2073.048019317,"_hash":3334241084,"paid_only":false,"cont_title":"第 361 场周赛","cont_title_slug":"weekly-contest-361"},{"question_id":871,"title":"最低加油次数","title_slug":"minimum-number-of-refueling-stops","rating":2074.4120526679,"_hash":4182324049,"paid_only":false,"cont_title":"第 93 场周赛","cont_title_slug":"weekly-contest-93"},{"question_id":2906,"title":"构造乘积矩阵","title_slug":"construct-product-matrix","rating":2074.8331146269,"_hash":4290150798,"paid_only":false,"cont_title":"第 367 场周赛","cont_title_slug":"weekly-contest-367"},{"question_id":2354,"title":"优质数对的数目","title_slug":"number-of-excellent-pairs","rating":2075.9046975409,"_hash":3803787289,"paid_only":false,"cont_title":"第 303 场周赛","cont_title_slug":"weekly-contest-303"},{"question_id":2449,"title":"使数组相似的最少操作次数","title_slug":"minimum-number-of-operations-to-make-arrays-similar","rating":2076.0155978787,"_hash":3679518604,"paid_only":false,"cont_title":"第 316 场周赛","cont_title_slug":"weekly-contest-316"},{"question_id":1088,"title":"易混淆数 II","title_slug":"confusing-number-ii","rating":2076.8975497986,"_hash":2950336182,"paid_only":false,"cont_title":"第 2 场双周赛","cont_title_slug":"biweekly-contest-2"},{"question_id":2959,"title":"关闭分部的可行集合数目","title_slug":"number-of-possible-sets-of-closing-branches","rating":2077.4738459704,"_hash":796165027,"paid_only":false,"cont_title":"第 119 场双周赛","cont_title_slug":"biweekly-contest-119"},{"question_id":843,"title":"猜猜这个单词","title_slug":"guess-the-word","rating":2077.5054883516,"_hash":2857979415,"paid_only":false,"cont_title":"第 86 场周赛","cont_title_slug":"weekly-contest-86"},{"question_id":1786,"title":"从第一个节点出发到最后一个节点的受限路径数","title_slug":"number-of-restricted-paths-from-first-to-last-node","rating":2078.5417326415,"_hash":1823999301,"paid_only":false,"cont_title":"第 231 场周赛","cont_title_slug":"weekly-contest-231"},{"question_id":1712,"title":"将数组分成三个子数组的方案数","title_slug":"ways-to-split-array-into-three-subarrays","rating":2078.6986769435,"_hash":1074334353,"paid_only":false,"cont_title":"第 222 场周赛","cont_title_slug":"weekly-contest-222"},{"question_id":975,"title":"奇偶跳","title_slug":"odd-even-jump","rating":2079.1911227043,"_hash":1733046404,"paid_only":false,"cont_title":"第 119 场周赛","cont_title_slug":"weekly-contest-119"},{"question_id":1643,"title":"第 K 条最小指令","title_slug":"kth-smallest-instructions","rating":2079.9846866239,"_hash":2988782714,"paid_only":false,"cont_title":"第 213 场周赛","cont_title_slug":"weekly-contest-213"},{"question_id":1718,"title":"构建字典序最大的可行序列","title_slug":"construct-the-lexicographically-largest-valid-sequence","rating":2080.0425875741,"_hash":3869351459,"paid_only":false,"cont_title":"第 43 场双周赛","cont_title_slug":"biweekly-contest-43"},{"question_id":2555,"title":"两个线段获得的最多奖品","title_slug":"maximize-win-from-two-segments","rating":2080.7845644831,"_hash":149268417,"paid_only":false,"cont_title":"第 97 场双周赛","cont_title_slug":"biweekly-contest-97"},{"question_id":2560,"title":"打家劫舍 IV","title_slug":"house-robber-iv","rating":2081.1880297942,"_hash":1088208610,"paid_only":false,"cont_title":"第 331 场周赛","cont_title_slug":"weekly-contest-331"},{"question_id":1639,"title":"通过给定词典构造目标字符串的方案数","title_slug":"number-of-ways-to-form-a-target-string-given-a-dictionary","rating":2081.6909344021,"_hash":4276174201,"paid_only":false,"cont_title":"第 38 场双周赛","cont_title_slug":"biweekly-contest-38"},{"question_id":2857,"title":"统计距离为 k 的点对","title_slug":"count-pairs-of-points-with-distance-k","rating":2081.698529877,"_hash":1047256075,"paid_only":false,"cont_title":"第 113 场双周赛","cont_title_slug":"biweekly-contest-113"},{"question_id":1847,"title":"最近的房间","title_slug":"closest-room","rating":2081.7518764643,"_hash":1181589124,"paid_only":false,"cont_title":"第 51 场双周赛","cont_title_slug":"biweekly-contest-51"},{"question_id":1494,"title":"并行课程 II","title_slug":"parallel-courses-ii","rating":2081.8087755451,"_hash":2963413938,"paid_only":false,"cont_title":"第 29 场双周赛","cont_title_slug":"biweekly-contest-29"},{"question_id":2050,"title":"并行课程 III","title_slug":"parallel-courses-iii","rating":2084.1404698713,"_hash":3929135553,"paid_only":false,"cont_title":"第 264 场周赛","cont_title_slug":"weekly-contest-264"},{"question_id":2009,"title":"使数组连续的最少操作数","title_slug":"minimum-number-of-operations-to-make-array-continuous","rating":2084.4980206639,"_hash":419814877,"paid_only":false,"cont_title":"第 61 场双周赛","cont_title_slug":"biweekly-contest-61"},{"question_id":2267,"title":"检查是否有合法括号字符串路径","title_slug":"check-if-there-is-a-valid-parentheses-string-path","rating":2084.5752686737,"_hash":1017177635,"paid_only":false,"cont_title":"第 292 场周赛","cont_title_slug":"weekly-contest-292"},{"question_id":1192,"title":"查找集群内的关键连接","title_slug":"critical-connections-in-a-network","rating":2084.6866916045,"_hash":3870941501,"paid_only":false,"cont_title":"第 154 场周赛","cont_title_slug":"weekly-contest-154"},{"question_id":982,"title":"按位与为零的三元组","title_slug":"triples-with-bitwise-and-equal-to-zero","rating":2084.9697035674,"_hash":1019777981,"paid_only":false,"cont_title":"第 121 场周赛","cont_title_slug":"weekly-contest-121"},{"question_id":1563,"title":"石子游戏 V","title_slug":"stone-game-v","rating":2087.2049275667,"_hash":3581728008,"paid_only":false,"cont_title":"第 203 场周赛","cont_title_slug":"weekly-contest-203"},{"question_id":2318,"title":"不同骰子序列的数目","title_slug":"number-of-distinct-roll-sequences","rating":2090.4183788498,"_hash":3973609032,"paid_only":false,"cont_title":"第 81 场双周赛","cont_title_slug":"biweekly-contest-81"},{"question_id":2193,"title":"得到回文串的最少操作次数","title_slug":"minimum-number-of-moves-to-make-palindrome","rating":2090.6800569319,"_hash":4275612953,"paid_only":false,"cont_title":"第 73 场双周赛","cont_title_slug":"biweekly-contest-73"},{"question_id":1383,"title":"最大的团队表现值","title_slug":"maximum-performance-of-a-team","rating":2091.3820373571,"_hash":1997987860,"paid_only":false,"cont_title":"第 180 场周赛","cont_title_slug":"weekly-contest-180"},{"question_id":2751,"title":"机器人碰撞","title_slug":"robot-collisions","rating":2091.6474629767,"_hash":435938591,"paid_only":false,"cont_title":"第 351 场周赛","cont_title_slug":"weekly-contest-351"},{"question_id":2842,"title":"统计一个字符串的 k 子序列美丽值最大的数目","title_slug":"count-k-subsequences-of-a-string-with-maximum-beauty","rating":2091.6580433632,"_hash":1559330514,"paid_only":false,"cont_title":"第 112 场双周赛","cont_title_slug":"biweekly-contest-112"},{"question_id":2412,"title":"完成所有交易的初始最少钱数","title_slug":"minimum-money-required-before-transactions","rating":2092.0222850837,"_hash":2719065978,"paid_only":false,"cont_title":"第 87 场双周赛","cont_title_slug":"biweekly-contest-87"},{"question_id":1049,"title":"最后一块石头的重量 II","title_slug":"last-stone-weight-ii","rating":2092.4861692502,"_hash":305762053,"paid_only":false,"cont_title":"第 137 场周赛","cont_title_slug":"weekly-contest-137"},{"question_id":2444,"title":"统计定界子数组的数目","title_slug":"count-subarrays-with-fixed-bounds","rating":2092.5366031561,"_hash":3820908739,"paid_only":false,"cont_title":"第 315 场周赛","cont_title_slug":"weekly-contest-315"},{"question_id":2402,"title":"会议室 III","title_slug":"meeting-rooms-iii","rating":2092.8943149547,"_hash":910590803,"paid_only":false,"cont_title":"第 309 场周赛","cont_title_slug":"weekly-contest-309"},{"question_id":1976,"title":"到达目的地的方案数","title_slug":"number-of-ways-to-arrive-at-destination","rating":2094.592426537,"_hash":3020603346,"paid_only":false,"cont_title":"第 59 场双周赛","cont_title_slug":"biweekly-contest-59"},{"question_id":899,"title":"有序队列","title_slug":"orderly-queue","rating":2096.6098086765,"_hash":1912276022,"paid_only":false,"cont_title":"第 100 场周赛","cont_title_slug":"weekly-contest-100"},{"question_id":2430,"title":"对字母串可执行的最大删除数","title_slug":"maximum-deletions-on-a-string","rating":2101.867342004,"_hash":670519393,"paid_only":false,"cont_title":"第 313 场周赛","cont_title_slug":"weekly-contest-313"},{"question_id":2088,"title":"统计农场中肥沃金字塔的数目","title_slug":"count-fertile-pyramids-in-a-land","rating":2104.7441214305,"_hash":2070962878,"paid_only":false,"cont_title":"第 66 场双周赛","cont_title_slug":"biweekly-contest-66"},{"question_id":1944,"title":"队列中可以看到的人数","title_slug":"number-of-visible-people-in-a-queue","rating":2104.9526046945,"_hash":3935523633,"paid_only":false,"cont_title":"第 57 场双周赛","cont_title_slug":"biweekly-contest-57"},{"question_id":1937,"title":"扣分后的最大得分","title_slug":"maximum-number-of-points-with-cost","rating":2105.7761215397,"_hash":1687003236,"paid_only":false,"cont_title":"第 250 场周赛","cont_title_slug":"weekly-contest-250"},{"question_id":2209,"title":"用地毯覆盖后的最少白色砖块","title_slug":"minimum-white-tiles-after-covering-with-carpets","rating":2105.8582288624,"_hash":3822669184,"paid_only":false,"cont_title":"第 74 场双周赛","cont_title_slug":"biweekly-contest-74"},{"question_id":1172,"title":"餐盘栈","title_slug":"dinner-plate-stacks","rating":2109.9830154953,"_hash":3376945874,"paid_only":false,"cont_title":"第 151 场周赛","cont_title_slug":"weekly-contest-151"},{"question_id":1483,"title":"树节点的第 K 个祖先","title_slug":"kth-ancestor-of-a-tree-node","rating":2115.0911494487,"_hash":2000679742,"paid_only":false,"cont_title":"第 193 场周赛","cont_title_slug":"weekly-contest-193"},{"question_id":2967,"title":"使数组成为等数数组的最小代价","title_slug":"minimum-cost-to-make-array-equalindromic","rating":2116.3244842355,"_hash":3256507952,"paid_only":false,"cont_title":"第 376 场周赛","cont_title_slug":"weekly-contest-376"},{"question_id":1547,"title":"切棍子的最小成本","title_slug":"minimum-cost-to-cut-a-stick","rating":2116.493528295,"_hash":688063365,"paid_only":false,"cont_title":"第 201 场周赛","cont_title_slug":"weekly-contest-201"},{"question_id":1601,"title":"最多可达成的换楼请求数目","title_slug":"maximum-number-of-achievable-transfer-requests","rating":2118.7923652824,"_hash":2896936333,"paid_only":false,"cont_title":"第 208 场周赛","cont_title_slug":"weekly-contest-208"},{"question_id":2376,"title":"统计特殊整数","title_slug":"count-special-integers","rating":2120.4466386371,"_hash":4197747162,"paid_only":false,"cont_title":"第 306 场周赛","cont_title_slug":"weekly-contest-306"},{"question_id":972,"title":"相等的有理数","title_slug":"equal-rational-numbers","rating":2121.3147151648,"_hash":3639230179,"paid_only":false,"cont_title":"第 118 场周赛","cont_title_slug":"weekly-contest-118"},{"question_id":1970,"title":"你能穿过矩阵的最后一天","title_slug":"last-day-where-you-can-still-cross","rating":2123.5708982185,"_hash":821525251,"paid_only":false,"cont_title":"第 254 场周赛","cont_title_slug":"weekly-contest-254"},{"question_id":1654,"title":"到家的最少跳跃次数","title_slug":"minimum-jumps-to-reach-home","rating":2124.0317207867,"_hash":2681795867,"paid_only":false,"cont_title":"第 39 场双周赛","cont_title_slug":"biweekly-contest-39"},{"question_id":968,"title":"监控二叉树","title_slug":"binary-tree-cameras","rating":2124.1329592058,"_hash":1589710386,"paid_only":false,"cont_title":"第 117 场周赛","cont_title_slug":"weekly-contest-117"},{"question_id":1955,"title":"统计特殊子序列的数目","title_slug":"count-number-of-special-subsequences","rating":2125.3125624762,"_hash":655929637,"paid_only":false,"cont_title":"第 252 场周赛","cont_title_slug":"weekly-contest-252"},{"question_id":2746,"title":"字符串连接删减字母","title_slug":"decremental-string-concatenation","rating":2126.1931814161,"_hash":298215454,"paid_only":false,"cont_title":"第 107 场双周赛","cont_title_slug":"biweekly-contest-107"},{"question_id":2246,"title":"相邻字符不同的最长路径","title_slug":"longest-path-with-different-adjacent-characters","rating":2126.3922279277,"_hash":1523645158,"paid_only":false,"cont_title":"第 289 场周赛","cont_title_slug":"weekly-contest-289"},{"question_id":1444,"title":"切披萨的方案数","title_slug":"number-of-ways-of-cutting-a-pizza","rating":2126.6864346508,"_hash":1744896373,"paid_only":false,"cont_title":"第 188 场周赛","cont_title_slug":"weekly-contest-188"},{"question_id":2939,"title":"最大异或乘积","title_slug":"maximum-xor-product","rating":2127.5100545681,"_hash":173367747,"paid_only":false,"cont_title":"第 372 场周赛","cont_title_slug":"weekly-contest-372"},{"question_id":1039,"title":"多边形三角剖分的最低得分","title_slug":"minimum-score-triangulation-of-polygon","rating":2130.1135718486,"_hash":491083091,"paid_only":false,"cont_title":"第 135 场周赛","cont_title_slug":"weekly-contest-135"},{"question_id":2076,"title":"处理含限制条件的好友请求","title_slug":"process-restricted-friend-requests","rating":2130.9348604091,"_hash":10205408,"paid_only":false,"cont_title":"第 267 场周赛","cont_title_slug":"weekly-contest-267"},{"question_id":1579,"title":"保证图可完全遍历","title_slug":"remove-max-number-of-edges-to-keep-graph-fully-traversable","rating":2131.7917160422,"_hash":3698564207,"paid_only":false,"cont_title":"第 205 场周赛","cont_title_slug":"weekly-contest-205"},{"question_id":2749,"title":"得到整数零需要执行的最少操作数","title_slug":"minimum-operations-to-make-the-integer-zero","rating":2132.06233459,"_hash":2077283915,"paid_only":false,"cont_title":"第 351 场周赛","cont_title_slug":"weekly-contest-351"},{"question_id":2910,"title":"合法分组的最少组数","title_slug":"minimum-number-of-groups-to-create-a-valid-assignment","rating":2132.1944636902,"_hash":1620549524,"paid_only":false,"cont_title":"第 368 场周赛","cont_title_slug":"weekly-contest-368"},{"question_id":898,"title":"子数组按位或操作","title_slug":"bitwise-ors-of-subarrays","rating":2133.1003195919,"_hash":1959774558,"paid_only":false,"cont_title":"第 100 场周赛","cont_title_slug":"weekly-contest-100"},{"question_id":1439,"title":"有序矩阵中的第 k 个最小数组和","title_slug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows","rating":2133.9592509012,"_hash":2634383093,"paid_only":false,"cont_title":"第 187 场周赛","cont_title_slug":"weekly-contest-187"},{"question_id":910,"title":"最小差值 II","title_slug":"smallest-range-ii","rating":2134.5448970405,"_hash":1737160601,"paid_only":false,"cont_title":"第 103 场周赛","cont_title_slug":"weekly-contest-103"},{"question_id":959,"title":"由斜杠划分区域","title_slug":"regions-cut-by-slashes","rating":2135.5738659086,"_hash":244758471,"paid_only":false,"cont_title":"第 115 场周赛","cont_title_slug":"weekly-contest-115"},{"question_id":2382,"title":"删除操作后的最大子段和","title_slug":"maximum-segment-sum-after-removals","rating":2136.3013259524,"_hash":746573214,"paid_only":false,"cont_title":"第 85 场双周赛","cont_title_slug":"biweekly-contest-85"},{"question_id":2290,"title":"到达角落需要移除障碍物的最小数目","title_slug":"minimum-obstacle-removal-to-reach-corner","rating":2137.5633267453,"_hash":4050014828,"paid_only":false,"cont_title":"第 295 场周赛","cont_title_slug":"weekly-contest-295"},{"question_id":906,"title":"超级回文数","title_slug":"super-palindromes","rating":2140.0220703954,"_hash":159231277,"paid_only":false,"cont_title":"第 102 场周赛","cont_title_slug":"weekly-contest-102"},{"question_id":1879,"title":"两个数组最小的异或值之和","title_slug":"minimum-xor-sum-of-two-arrays","rating":2145.183995267,"_hash":3201195359,"paid_only":false,"cont_title":"第 53 场双周赛","cont_title_slug":"biweekly-contest-53"},{"question_id":1906,"title":"查询差绝对值的最小值","title_slug":"minimum-absolute-difference-queries","rating":2146.639581998,"_hash":1980479000,"paid_only":false,"cont_title":"第 246 场周赛","cont_title_slug":"weekly-contest-246"},{"question_id":1610,"title":"可见点的最大数目","title_slug":"maximum-number-of-visible-points","rating":2147.1828941776,"_hash":2493499746,"paid_only":false,"cont_title":"第 209 场周赛","cont_title_slug":"weekly-contest-209"},{"question_id":2972,"title":"统计移除递增子数组的数目 II","title_slug":"count-the-number-of-incremovable-subarrays-ii","rating":2152.8032001597,"_hash":2400947874,"paid_only":false,"cont_title":"第 120 场双周赛","cont_title_slug":"biweekly-contest-120"},{"question_id":2812,"title":"找出最安全路径","title_slug":"find-the-safest-path-in-a-grid","rating":2153.5854429139,"_hash":999091554,"paid_only":false,"cont_title":"第 357 场周赛","cont_title_slug":"weekly-contest-357"},{"question_id":2662,"title":"前往目标的最小代价","title_slug":"minimum-cost-of-a-path-with-special-roads","rating":2153.8943791656,"_hash":1243440018,"paid_only":false,"cont_title":"第 343 场周赛","cont_title_slug":"weekly-contest-343"},{"question_id":2616,"title":"最小化数对的最大差值","title_slug":"minimize-the-maximum-difference-of-pairs","rating":2155.3424932408,"_hash":3806017410,"paid_only":false,"cont_title":"第 340 场周赛","cont_title_slug":"weekly-contest-340"},{"question_id":1515,"title":"服务中心的最佳位置","title_slug":"best-position-for-a-service-centre","rating":2156.9515428364,"_hash":4201921653,"paid_only":false,"cont_title":"第 197 场周赛","cont_title_slug":"weekly-contest-197"},{"question_id":2218,"title":"从栈中取出 K 个硬币的最大面值和","title_slug":"maximum-value-of-k-coins-from-piles","rating":2157.5814371481,"_hash":28373825,"paid_only":false,"cont_title":"第 286 场周赛","cont_title_slug":"weekly-contest-286"},{"question_id":2102,"title":"序列顺序查询","title_slug":"sequentially-ordinal-rank-tracker","rating":2158.7683843245,"_hash":2117244239,"paid_only":false,"cont_title":"第 67 场双周赛","cont_title_slug":"biweekly-contest-67"},{"question_id":2122,"title":"还原原数组","title_slug":"recover-the-original-array","rating":2158.8988728254,"_hash":3102719435,"paid_only":false,"cont_title":"第 273 场周赛","cont_title_slug":"weekly-contest-273"},{"question_id":2584,"title":"分割数组使乘积互质","title_slug":"split-the-array-to-make-coprime-products","rating":2159.4844281244,"_hash":1405611181,"paid_only":false,"cont_title":"第 335 场周赛","cont_title_slug":"weekly-contest-335"},{"question_id":1036,"title":"逃离大迷宫","title_slug":"escape-a-large-maze","rating":2164.8287157213,"_hash":2632738906,"paid_only":false,"cont_title":"第 134 场周赛","cont_title_slug":"weekly-contest-134"},{"question_id":1931,"title":"用三种不同颜色为网格涂色","title_slug":"painting-a-grid-with-three-different-colors","rating":2170.0439693714,"_hash":4290496515,"paid_only":false,"cont_title":"第 249 场周赛","cont_title_slug":"weekly-contest-249"},{"question_id":1862,"title":"向下取整数对和","title_slug":"sum-of-floored-pairs","rating":2170.1079846744,"_hash":2862855056,"paid_only":false,"cont_title":"第 52 场双周赛","cont_title_slug":"biweekly-contest-52"},{"question_id":1691,"title":"堆叠长方体的最大高度","title_slug":"maximum-height-by-stacking-cuboids","rating":2171.716066664,"_hash":1210455736,"paid_only":false,"cont_title":"第 219 场周赛","cont_title_slug":"weekly-contest-219"},{"question_id":2709,"title":"最大公约数遍历","title_slug":"greatest-common-divisor-traversal","rating":2171.9645269732,"_hash":1482300808,"paid_only":false,"cont_title":"第 105 场双周赛","cont_title_slug":"biweekly-contest-105"},{"question_id":2896,"title":"执行操作使两个字符串相等","title_slug":"apply-operations-to-make-two-strings-equal","rating":2172.3890687963,"_hash":1915472102,"paid_only":false,"cont_title":"第 366 场周赛","cont_title_slug":"weekly-contest-366"},{"question_id":2454,"title":"下一个更大元素 IV","title_slug":"next-greater-element-iv","rating":2175.1190473433,"_hash":2368071046,"paid_only":false,"cont_title":"第 90 场双周赛","cont_title_slug":"biweekly-contest-90"},{"question_id":1420,"title":"生成数组","title_slug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons","rating":2175.6850426027,"_hash":4023565195,"paid_only":false,"cont_title":"第 185 场周赛","cont_title_slug":"weekly-contest-185"},{"question_id":2768,"title":"黑格子的数目","title_slug":"number-of-black-blocks","rating":2175.7874705227,"_hash":3375593429,"paid_only":false,"cont_title":"第 108 场双周赛","cont_title_slug":"biweekly-contest-108"},{"question_id":2065,"title":"最大化一张图中的路径价值","title_slug":"maximum-path-quality-of-a-graph","rating":2178.4249114144,"_hash":2027773900,"paid_only":false,"cont_title":"第 266 场周赛","cont_title_slug":"weekly-contest-266"},{"question_id":1912,"title":"设计电影租借系统","title_slug":"design-movie-rental-system","rating":2181.7821188042,"_hash":1272023779,"paid_only":false,"cont_title":"第 55 场双周赛","cont_title_slug":"biweekly-contest-55"},{"question_id":1771,"title":"由子序列构造的最长回文串的长度","title_slug":"maximize-palindrome-length-from-subsequences","rating":2182.054452981,"_hash":653475446,"paid_only":false,"cont_title":"第 229 场周赛","cont_title_slug":"weekly-contest-229"},{"question_id":891,"title":"子序列宽度之和","title_slug":"sum-of-subsequence-widths","rating":2182.6180030785,"_hash":1150623470,"paid_only":false,"cont_title":"第 98 场周赛","cont_title_slug":"weekly-contest-98"},{"question_id":1081,"title":"不同字符的最小子序列","title_slug":"smallest-subsequence-of-distinct-characters","rating":2184.5241011615,"_hash":2695383302,"paid_only":false,"cont_title":"第 140 场周赛","cont_title_slug":"weekly-contest-140"},{"question_id":943,"title":"最短超级串","title_slug":"find-the-shortest-superstring","rating":2185.5444704515,"_hash":1762990534,"paid_only":false,"cont_title":"第 111 场周赛","cont_title_slug":"weekly-contest-111"},{"question_id":1074,"title":"元素和为目标值的子矩阵数量","title_slug":"number-of-submatrices-that-sum-to-target","rating":2189.3802630548,"_hash":1802692575,"paid_only":false,"cont_title":"第 139 场周赛","cont_title_slug":"weekly-contest-139"},{"question_id":1478,"title":"安排邮筒","title_slug":"allocate-mailboxes","rating":2190.1757477854,"_hash":2258623827,"paid_only":false,"cont_title":"第 28 场双周赛","cont_title_slug":"biweekly-contest-28"},{"question_id":2503,"title":"矩阵查询可获得的最大分数","title_slug":"maximum-number-of-points-from-grid-queries","rating":2195.6540241654,"_hash":4062961912,"paid_only":false,"cont_title":"第 323 场周赛","cont_title_slug":"weekly-contest-323"},{"question_id":834,"title":"树中距离之和","title_slug":"sum-of-distances-in-tree","rating":2197.0951445919,"_hash":3424505272,"paid_only":false,"cont_title":"第 84 场周赛","cont_title_slug":"weekly-contest-84"},{"question_id":1621,"title":"大小为 K 的不重叠线段的数目","title_slug":"number-of-sets-of-k-non-overlapping-line-segments","rating":2198.3290662783,"_hash":3081794904,"paid_only":false,"cont_title":"第 37 场双周赛","cont_title_slug":"biweekly-contest-37"},{"question_id":1739,"title":"放置盒子","title_slug":"building-boxes","rating":2198.4642973466,"_hash":3570284045,"paid_only":false,"cont_title":"第 225 场周赛","cont_title_slug":"weekly-contest-225"},{"question_id":847,"title":"访问所有节点的最短路径","title_slug":"shortest-path-visiting-all-nodes","rating":2200.6623666057,"_hash":3527222391,"paid_only":false,"cont_title":"第 87 场周赛","cont_title_slug":"weekly-contest-87"},{"question_id":2045,"title":"到达目的地的第二短时间","title_slug":"second-minimum-time-to-reach-destination","rating":2201.6219336792,"_hash":1896286191,"paid_only":false,"cont_title":"第 263 场周赛","cont_title_slug":"weekly-contest-263"},{"question_id":1453,"title":"圆形靶内的最大飞镖数量","title_slug":"maximum-number-of-darts-inside-of-a-circular-dartboard","rating":2201.8209584221,"_hash":1442274557,"paid_only":false,"cont_title":"第 189 场周赛","cont_title_slug":"weekly-contest-189"},{"question_id":1246,"title":"删除回文子数组","title_slug":"palindrome-removal","rating":2203.1738850937,"_hash":960405407,"paid_only":false,"cont_title":"第 12 场双周赛","cont_title_slug":"biweekly-contest-12"},{"question_id":2781,"title":"最长合法子字符串的长度","title_slug":"length-of-the-longest-valid-substring","rating":2203.5694828019,"_hash":2265344721,"paid_only":false,"cont_title":"第 354 场周赛","cont_title_slug":"weekly-contest-354"},{"question_id":879,"title":"盈利计划","title_slug":"profitable-schemes","rating":2204.3524370174,"_hash":3884874766,"paid_only":false,"cont_title":"第 95 场周赛","cont_title_slug":"weekly-contest-95"},{"question_id":1157,"title":"子数组中占绝大多数的元素","title_slug":"online-majority-element-in-subarray","rating":2205.4304373587,"_hash":4053796951,"paid_only":false,"cont_title":"第 149 场周赛","cont_title_slug":"weekly-contest-149"},{"question_id":2835,"title":"使子序列的和等于目标的最少操作次数","title_slug":"minimum-operations-to-form-subsequence-with-target-sum","rating":2207.4917475411,"_hash":94359620,"paid_only":false,"cont_title":"第 360 场周赛","cont_title_slug":"weekly-contest-360"},{"question_id":1649,"title":"通过指令创建有序数组","title_slug":"create-sorted-array-through-instructions","rating":2207.8565809952,"_hash":552299541,"paid_only":false,"cont_title":"第 214 场周赛","cont_title_slug":"weekly-contest-214"},{"question_id":1568,"title":"使陆地分离的最少天数","title_slug":"minimum-number-of-days-to-disconnect-island","rating":2208.5532172086,"_hash":187940940,"paid_only":false,"cont_title":"第 204 场周赛","cont_title_slug":"weekly-contest-204"},{"question_id":2876,"title":"有向图访问计数","title_slug":"count-visited-nodes-in-a-directed-graph","rating":2209.8785430371,"_hash":385203255,"paid_only":false,"cont_title":"第 365 场周赛","cont_title_slug":"weekly-contest-365"},{"question_id":2081,"title":"k 镜像数字的和","title_slug":"sum-of-k-mirror-numbers","rating":2209.8815936961,"_hash":3707233513,"paid_only":false,"cont_title":"第 268 场周赛","cont_title_slug":"weekly-contest-268"},{"question_id":992,"title":"K 个不同整数的子数组","title_slug":"subarrays-with-k-different-integers","rating":2210.3503183571,"_hash":3123575090,"paid_only":false,"cont_title":"第 123 场周赛","cont_title_slug":"weekly-contest-123"},{"question_id":1889,"title":"装包裹的最小浪费空间","title_slug":"minimum-space-wasted-from-packaging","rating":2214.4798747386,"_hash":988335694,"paid_only":false,"cont_title":"第 244 场周赛","cont_title_slug":"weekly-contest-244"},{"question_id":2025,"title":"分割数组的最多方案数","title_slug":"maximum-number-of-ways-to-partition-an-array","rating":2217.8090802563,"_hash":2513347763,"paid_only":false,"cont_title":"第 62 场双周赛","cont_title_slug":"biweekly-contest-62"},{"question_id":2167,"title":"移除所有载有违禁货物车厢所需的最少时间","title_slug":"minimum-time-to-remove-all-cars-containing-illegal-goods","rating":2219.3465296423,"_hash":2598780139,"paid_only":false,"cont_title":"第 279 场周赛","cont_title_slug":"weekly-contest-279"},{"question_id":2223,"title":"构造字符串的总得分和","title_slug":"sum-of-scores-of-built-strings","rating":2220.0903365738,"_hash":2248507270,"paid_only":false,"cont_title":"第 75 场双周赛","cont_title_slug":"biweekly-contest-75"},{"question_id":2543,"title":"判断一个点是否可以到达","title_slug":"check-if-point-is-reachable","rating":2220.8257124139,"_hash":3766200583,"paid_only":false,"cont_title":"第 96 场双周赛","cont_title_slug":"biweekly-contest-96"},{"question_id":1627,"title":"带阈值的图连通性","title_slug":"graph-connectivity-with-threshold","rating":2221.3538766773,"_hash":3632361978,"paid_only":false,"cont_title":"第 211 场周赛","cont_title_slug":"weekly-contest-211"},{"question_id":1542,"title":"找出最长的超赞子字符串","title_slug":"find-longest-awesome-substring","rating":2221.7336557442,"_hash":2877331205,"paid_only":false,"cont_title":"第 32 场双周赛","cont_title_slug":"biweekly-contest-32"},{"question_id":2561,"title":"重排水果","title_slug":"rearranging-fruits","rating":2221.793185714,"_hash":3549688121,"paid_only":false,"cont_title":"第 331 场周赛","cont_title_slug":"weekly-contest-331"},{"question_id":2276,"title":"统计区间中的整数数目","title_slug":"count-integers-in-intervals","rating":2222.4805422748,"_hash":113811987,"paid_only":false,"cont_title":"第 293 场周赛","cont_title_slug":"weekly-contest-293"},{"question_id":2484,"title":"统计回文子序列数目","title_slug":"count-palindromic-subsequences","rating":2223.1762282199,"_hash":924129852,"paid_only":false,"cont_title":"第 92 场双周赛","cont_title_slug":"biweekly-contest-92"},{"question_id":2163,"title":"删除元素后和的最小差值","title_slug":"minimum-difference-in-sums-after-removal-of-elements","rating":2225.3877535768,"_hash":2967621636,"paid_only":false,"cont_title":"第 71 场双周赛","cont_title_slug":"biweekly-contest-71"},{"question_id":2930,"title":"重新排列后包含指定子字符串的字符串数目","title_slug":"number-of-strings-which-can-be-rearranged-to-contain-substring","rating":2227.3896051956,"_hash":3536253643,"paid_only":false,"cont_title":"第 117 场双周赛","cont_title_slug":"biweekly-contest-117"},{"question_id":2581,"title":"统计可能的树根数目","title_slug":"count-number-of-possible-root-nodes","rating":2228.3454693625,"_hash":3735555259,"paid_only":false,"cont_title":"第 99 场双周赛","cont_title_slug":"biweekly-contest-99"},{"question_id":1012,"title":"至少有 1 位重复的数字","title_slug":"numbers-with-repeated-digits","rating":2230.1673059455,"_hash":3469926498,"paid_only":false,"cont_title":"第 128 场周赛","cont_title_slug":"weekly-contest-128"},{"question_id":1766,"title":"互质树","title_slug":"tree-of-coprimes","rating":2231.8099102949,"_hash":2806136994,"paid_only":false,"cont_title":"第 46 场双周赛","cont_title_slug":"biweekly-contest-46"},{"question_id":1178,"title":"猜字谜","title_slug":"number-of-valid-words-for-each-puzzle","rating":2233.963903408,"_hash":2530621646,"paid_only":false,"cont_title":"第 152 场周赛","cont_title_slug":"weekly-contest-152"},{"question_id":1915,"title":"最美子字符串的数目","title_slug":"number-of-wonderful-substrings","rating":2234.9191877602,"_hash":3315472808,"paid_only":false,"cont_title":"第 247 场周赛","cont_title_slug":"weekly-contest-247"},{"question_id":2528,"title":"最大化城市的最小电量","title_slug":"maximize-the-minimum-powered-city","rating":2235.5784618885,"_hash":530846359,"paid_only":false,"cont_title":"第 95 场双周赛","cont_title_slug":"biweekly-contest-95"},{"question_id":850,"title":"矩形面积 II","title_slug":"rectangle-area-ii","rating":2235.9672341699,"_hash":512758649,"paid_only":false,"cont_title":"第 88 场周赛","cont_title_slug":"weekly-contest-88"},{"question_id":2646,"title":"最小化旅行的价格总和","title_slug":"minimize-the-total-price-of-the-trips","rating":2238.2830745228,"_hash":1058966145,"paid_only":false,"cont_title":"第 341 场周赛","cont_title_slug":"weekly-contest-341"},{"question_id":2732,"title":"找到矩阵中的好子集","title_slug":"find-a-good-subset-of-the-matrix","rating":2239.7101856677,"_hash":96440277,"paid_only":false,"cont_title":"第 106 场双周赛","cont_title_slug":"biweekly-contest-106"},{"question_id":1240,"title":"铺瓷砖","title_slug":"tiling-a-rectangle-with-the-fewest-squares","rating":2241.5199974312,"_hash":2526467539,"paid_only":false,"cont_title":"第 160 场周赛","cont_title_slug":"weekly-contest-160"},{"question_id":2183,"title":"统计可以被 K 整除的下标对数目","title_slug":"count-array-pairs-divisible-by-k","rating":2246.0452639352,"_hash":1351132676,"paid_only":false,"cont_title":"第 281 场周赛","cont_title_slug":"weekly-contest-281"},{"question_id":960,"title":"删列造序 III","title_slug":"delete-columns-to-make-sorted-iii","rating":2246.8671174565,"_hash":3194493363,"paid_only":false,"cont_title":"第 115 场周赛","cont_title_slug":"weekly-contest-115"},{"question_id":1307,"title":"口算难题","title_slug":"verbal-arithmetic-puzzle","rating":2250.0454791316,"_hash":9793507,"paid_only":false,"cont_title":"第 169 场周赛","cont_title_slug":"weekly-contest-169"},{"question_id":1199,"title":"建造街区的最短时间","title_slug":"minimum-time-to-build-blocks","rating":2250.2578740769,"_hash":212930587,"paid_only":false,"cont_title":"第 9 场双周赛","cont_title_slug":"biweekly-contest-9"},{"question_id":1125,"title":"最小的必要团队","title_slug":"smallest-sufficient-team","rating":2250.9318291559,"_hash":537590451,"paid_only":false,"cont_title":"第 145 场周赛","cont_title_slug":"weekly-contest-145"},{"question_id":3007,"title":"价值和小于等于 K 的最大数字","title_slug":"maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k","rating":2258.0069047781,"_hash":1708402068,"paid_only":false,"cont_title":"第 380 场周赛","cont_title_slug":"weekly-contest-380"},{"question_id":864,"title":"获取所有钥匙的最短路径","title_slug":"shortest-path-to-get-all-keys","rating":2258.6371797452,"_hash":3615735813,"paid_only":false,"cont_title":"第 92 场周赛","cont_title_slug":"weekly-contest-92"},{"question_id":857,"title":"雇佣 K 名工人的最低成本","title_slug":"minimum-cost-to-hire-k-workers","rating":2259.6572191969,"_hash":718375766,"paid_only":false,"cont_title":"第 90 场周赛","cont_title_slug":"weekly-contest-90"},{"question_id":1997,"title":"访问完所有房间的第一天","title_slug":"first-day-where-you-have-been-in-all-the-rooms","rating":2260.2799775623,"_hash":3953077425,"paid_only":false,"cont_title":"第 257 场周赛","cont_title_slug":"weekly-contest-257"},{"question_id":2141,"title":"同时运行 N 台电脑的最长时间","title_slug":"maximum-running-time-of-n-computers","rating":2265.2118886972,"_hash":364057867,"paid_only":false,"cont_title":"第 276 场周赛","cont_title_slug":"weekly-contest-276"},{"question_id":952,"title":"按公因数计算最大组件大小","title_slug":"largest-component-size-by-common-factor","rating":2272.1122260637,"_hash":1950962783,"paid_only":false,"cont_title":"第 113 场周赛","cont_title_slug":"weekly-contest-113"},{"question_id":2179,"title":"统计数组中好三元组数目","title_slug":"count-good-triplets-in-an-array","rating":2272.4412003208,"_hash":286585708,"paid_only":false,"cont_title":"第 72 场双周赛","cont_title_slug":"biweekly-contest-72"},{"question_id":1434,"title":"每个人戴不同帽子的方案数","title_slug":"number-of-ways-to-wear-different-hats-to-each-other","rating":2273.2215764545,"_hash":860689371,"paid_only":false,"cont_title":"第 25 场双周赛","cont_title_slug":"biweekly-contest-25"},{"question_id":1606,"title":"找到处理最多请求的服务器","title_slug":"find-servers-that-handled-most-number-of-requests","rating":2275.7337818748,"_hash":3246928465,"paid_only":false,"cont_title":"第 36 场双周赛","cont_title_slug":"biweekly-contest-36"},{"question_id":1498,"title":"满足条件的子序列数目","title_slug":"number-of-subsequences-that-satisfy-the-given-sum-condition","rating":2276.4233585631,"_hash":2057048497,"paid_only":false,"cont_title":"第 195 场周赛","cont_title_slug":"weekly-contest-195"},{"question_id":2973,"title":"树中每个节点放置的金币数目","title_slug":"find-number-of-coins-to-place-in-tree-nodes","rating":2276.9256951751,"_hash":3730047096,"paid_only":false,"cont_title":"第 120 场双周赛","cont_title_slug":"biweekly-contest-120"},{"question_id":2029,"title":"石子游戏 IX","title_slug":"stone-game-ix","rating":2277.3595662538,"_hash":2371431943,"paid_only":false,"cont_title":"第 261 场周赛","cont_title_slug":"weekly-contest-261"},{"question_id":2763,"title":"所有子数组中不平衡数字之和","title_slug":"sum-of-imbalance-numbers-of-all-subarrays","rating":2277.7923804151,"_hash":228551495,"paid_only":false,"cont_title":"第 352 场周赛","cont_title_slug":"weekly-contest-352"},{"question_id":3031,"title":"将单词恢复初始状态所需的最短时间 II","title_slug":"minimum-time-to-revert-word-to-initial-state-ii","rating":2277.9557248587,"_hash":839548071,"paid_only":false,"cont_title":"第 383 场周赛","cont_title_slug":"weekly-contest-383"},{"question_id":2407,"title":"最长递增子序列 II","title_slug":"longest-increasing-subsequence-ii","rating":2280.3143643878,"_hash":1567110694,"paid_only":false,"cont_title":"第 310 场周赛","cont_title_slug":"weekly-contest-310"},{"question_id":2659,"title":"将数组清空","title_slug":"make-array-empty","rating":2281.8816902545,"_hash":2062472427,"paid_only":false,"cont_title":"第 103 场双周赛","cont_title_slug":"biweekly-contest-103"},{"question_id":1723,"title":"完成所有工作的最短时间","title_slug":"find-minimum-time-to-finish-all-jobs","rating":2284.4463940346,"_hash":3104122930,"paid_only":false,"cont_title":"第 223 场周赛","cont_title_slug":"weekly-contest-223"},{"question_id":1851,"title":"包含每个查询的最小区间","title_slug":"minimum-interval-to-include-each-query","rating":2286.1378742318,"_hash":3250523305,"paid_only":false,"cont_title":"第 239 场周赛","cont_title_slug":"weekly-contest-239"},{"question_id":1569,"title":"将子数组重新排序得到同一个二叉搜索树的方案数","title_slug":"number-of-ways-to-reorder-array-to-get-same-bst","rating":2288.2117442123,"_hash":1392708979,"paid_only":false,"cont_title":"第 204 场周赛","cont_title_slug":"weekly-contest-204"},{"question_id":1591,"title":"奇怪的打印机 II","title_slug":"strange-printer-ii","rating":2290.9040038639,"_hash":1646187623,"paid_only":false,"cont_title":"第 35 场双周赛","cont_title_slug":"biweekly-contest-35"},{"question_id":2862,"title":"完全子集的最大元素和","title_slug":"maximum-element-sum-of-a-complete-subset-of-indices","rating":2291.6794536377,"_hash":1459395051,"paid_only":false,"cont_title":"第 363 场周赛","cont_title_slug":"weekly-contest-363"},{"question_id":932,"title":"漂亮数组","title_slug":"beautiful-array","rating":2294.0981174197,"_hash":3554305488,"paid_only":false,"cont_title":"第 108 场周赛","cont_title_slug":"weekly-contest-108"},{"question_id":2858,"title":"可以到达每一个节点的最少边反转次数","title_slug":"minimum-edge-reversals-so-every-node-is-reachable","rating":2294.8289305714,"_hash":2851269000,"paid_only":false,"cont_title":"第 113 场双周赛","cont_title_slug":"biweekly-contest-113"},{"question_id":1263,"title":"推箱子","title_slug":"minimum-moves-to-move-a-box-to-their-target-location","rating":2297.105362516,"_hash":3949953471,"paid_only":false,"cont_title":"第 163 场周赛","cont_title_slug":"weekly-contest-163"},{"question_id":2458,"title":"移除子树后的二叉树高度","title_slug":"height-of-binary-tree-after-subtree-removal-queries","rating":2298.6242048519,"_hash":4116532905,"paid_only":false,"cont_title":"第 317 场周赛","cont_title_slug":"weekly-contest-317"},{"question_id":1697,"title":"检查边长度限制的路径是否存在","title_slug":"checking-existence-of-edge-length-limited-paths","rating":2300.1557840589,"_hash":3837200173,"paid_only":false,"cont_title":"第 220 场周赛","cont_title_slug":"weekly-contest-220"},{"question_id":2897,"title":"对数组执行操作使平方和最大","title_slug":"apply-operations-on-array-to-maximize-sum-of-squares","rating":2301.4069974024,"_hash":1644032538,"paid_only":false,"cont_title":"第 366 场周赛","cont_title_slug":"weekly-contest-366"},{"question_id":2513,"title":"最小化两个数组中的最大值","title_slug":"minimize-the-maximum-of-two-arrays","rating":2302.4005640818,"_hash":1712826586,"paid_only":false,"cont_title":"第 94 场双周赛","cont_title_slug":"biweekly-contest-94"},{"question_id":2242,"title":"节点序列的最大得分","title_slug":"maximum-score-of-a-node-sequence","rating":2304.3094138939,"_hash":949381873,"paid_only":false,"cont_title":"第 76 场双周赛","cont_title_slug":"biweekly-contest-76"},{"question_id":2306,"title":"公司命名","title_slug":"naming-a-company","rating":2305.4498281454,"_hash":3802076349,"paid_only":false,"cont_title":"第 297 场周赛","cont_title_slug":"weekly-contest-297"},{"question_id":862,"title":"和至少为 K 的最短子数组","title_slug":"shortest-subarray-with-sum-at-least-k","rating":2306.8472649456,"_hash":3460806368,"paid_only":false,"cont_title":"第 91 场周赛","cont_title_slug":"weekly-contest-91"},{"question_id":1655,"title":"分配重复整数","title_slug":"distribute-repeating-integers","rating":2307.0161713185,"_hash":145069778,"paid_only":false,"cont_title":"第 39 场双周赛","cont_title_slug":"biweekly-contest-39"},{"question_id":1617,"title":"统计子树中城市之间最大距离","title_slug":"count-subtrees-with-max-distance-between-cities","rating":2308.6545905335,"_hash":540821611,"paid_only":false,"cont_title":"第 210 场周赛","cont_title_slug":"weekly-contest-210"},{"question_id":1959,"title":"K 次调整数组大小浪费的最小总空间","title_slug":"minimum-total-space-wasted-with-k-resizing-operations","rating":2310.3824631335,"_hash":1714015866,"paid_only":false,"cont_title":"第 58 场双周赛","cont_title_slug":"biweekly-contest-58"},{"question_id":1857,"title":"有向图中最大颜色值","title_slug":"largest-color-value-in-a-directed-graph","rating":2312.9919953644,"_hash":1775341601,"paid_only":false,"cont_title":"第 240 场周赛","cont_title_slug":"weekly-contest-240"},{"question_id":2188,"title":"完成比赛的最少时间","title_slug":"minimum-time-to-finish-the-race","rating":2315.0547336936,"_hash":1723985703,"paid_only":false,"cont_title":"第 282 场周赛","cont_title_slug":"weekly-contest-282"},{"question_id":1187,"title":"使数组严格递增","title_slug":"make-array-strictly-increasing","rating":2315.6037017989,"_hash":979526552,"paid_only":false,"cont_title":"第 153 场周赛","cont_title_slug":"weekly-contest-153"},{"question_id":2827,"title":"范围中美丽整数的数目","title_slug":"number-of-beautiful-integers-in-the-range","rating":2324.1192580053,"_hash":219694070,"paid_only":false,"cont_title":"第 111 场双周赛","cont_title_slug":"biweekly-contest-111"},{"question_id":2940,"title":"找到 Alice 和 Bob 可以相遇的建筑","title_slug":"find-building-where-alice-and-bob-can-meet","rating":2327.4743300299,"_hash":2297518953,"paid_only":false,"cont_title":"第 372 场周赛","cont_title_slug":"weekly-contest-372"},{"question_id":882,"title":"细分图中的可到达节点","title_slug":"reachable-nodes-in-subdivided-graph","rating":2328.4294689238,"_hash":2956439807,"paid_only":false,"cont_title":"第 96 场周赛","cont_title_slug":"weekly-contest-96"},{"question_id":1585,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","title_slug":"check-if-string-is-transformable-with-substring-sort-operations","rating":2333.0078041754,"_hash":3631493170,"paid_only":false,"cont_title":"第 206 场周赛","cont_title_slug":"weekly-contest-206"},{"question_id":1866,"title":"恰有 K 根木棍可以看到的排列数目","title_slug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible","rating":2333.0621537307,"_hash":3900992255,"paid_only":false,"cont_title":"第 241 场周赛","cont_title_slug":"weekly-contest-241"},{"question_id":1674,"title":"使数组互补的最少操作次数","title_slug":"minimum-moves-to-make-array-complementary","rating":2333.2401505813,"_hash":3510890976,"paid_only":false,"cont_title":"第 217 场周赛","cont_title_slug":"weekly-contest-217"},{"question_id":1505,"title":"最多 K 次交换相邻数位后得到的最小整数","title_slug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits","rating":2336.5210003185,"_hash":1218347826,"paid_only":false,"cont_title":"第 196 场周赛","cont_title_slug":"weekly-contest-196"},{"question_id":2478,"title":"完美分割的方案数","title_slug":"number-of-beautiful-partitions","rating":2344.3664724791,"_hash":1069956724,"paid_only":false,"cont_title":"第 320 场周赛","cont_title_slug":"weekly-contest-320"},{"question_id":1611,"title":"使整数变为 0 的最少操作次数","title_slug":"minimum-one-bit-operations-to-make-integers-zero","rating":2345.3418191684,"_hash":3744485747,"paid_only":false,"cont_title":"第 209 场周赛","cont_title_slug":"weekly-contest-209"},{"question_id":2258,"title":"逃离火灾","title_slug":"escape-the-spreading-fire","rating":2346.5717839654,"_hash":315307043,"paid_only":false,"cont_title":"第 77 场双周赛","cont_title_slug":"biweekly-contest-77"},{"question_id":1096,"title":"花括号展开 II","title_slug":"brace-expansion-ii","rating":2348.5159376523,"_hash":1730213489,"paid_only":false,"cont_title":"第 142 场周赛","cont_title_slug":"weekly-contest-142"},{"question_id":2935,"title":"找出强数对的最大异或值 II","title_slug":"maximum-strong-pair-xor-ii","rating":2348.7273357105,"_hash":486718067,"paid_only":false,"cont_title":"第 371 场周赛","cont_title_slug":"weekly-contest-371"},{"question_id":837,"title":"新 21 点","title_slug":"new-21-game","rating":2350.0380300939,"_hash":3259259158,"paid_only":false,"cont_title":"第 85 场周赛","cont_title_slug":"weekly-contest-85"},{"question_id":2920,"title":"收集所有金币可获得的最大积分","title_slug":"maximum-points-after-collecting-coins-from-all-nodes","rating":2350.7421492104,"_hash":1381994519,"paid_only":false,"cont_title":"第 369 场周赛","cont_title_slug":"weekly-contest-369"},{"question_id":1713,"title":"得到子序列的最少操作次数","title_slug":"minimum-operations-to-make-a-subsequence","rating":2350.9694374861,"_hash":102575803,"paid_only":false,"cont_title":"第 222 场周赛","cont_title_slug":"weekly-contest-222"},{"question_id":2999,"title":"统计强大整数的数目","title_slug":"count-the-number-of-powerful-integers","rating":2351.2293628792,"_hash":677909483,"paid_only":false,"cont_title":"第 121 场双周赛","cont_title_slug":"biweekly-contest-121"},{"question_id":2719,"title":"统计整数数目","title_slug":"count-of-integers","rating":2354.5411153127,"_hash":942180030,"paid_only":false,"cont_title":"第 348 场周赛","cont_title_slug":"weekly-contest-348"},{"question_id":1467,"title":"两个盒子中球的颜色数相同的概率","title_slug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls","rating":2356.5811122453,"_hash":338661942,"paid_only":false,"cont_title":"第 191 场周赛","cont_title_slug":"weekly-contest-191"},{"question_id":1707,"title":"与数组中元素的最大异或值","title_slug":"maximum-xor-with-an-element-from-array","rating":2358.9669560824,"_hash":2768437968,"paid_only":false,"cont_title":"第 221 场周赛","cont_title_slug":"weekly-contest-221"},{"question_id":1520,"title":"最多的不重叠子字符串","title_slug":"maximum-number-of-non-overlapping-substrings","rating":2362.6480880348,"_hash":2687486440,"paid_only":false,"cont_title":"第 198 场周赛","cont_title_slug":"weekly-contest-198"},{"question_id":2312,"title":"卖木头块","title_slug":"selling-pieces-of-wood","rating":2363.0240184484,"_hash":915449177,"paid_only":false,"cont_title":"第 298 场周赛","cont_title_slug":"weekly-contest-298"},{"question_id":1755,"title":"最接近目标值的子序列和","title_slug":"closest-subsequence-sum","rating":2363.5096568214,"_hash":2473812468,"paid_only":false,"cont_title":"第 227 场周赛","cont_title_slug":"weekly-contest-227"},{"question_id":2203,"title":"得到要求路径的最小带权子图","title_slug":"minimum-weighted-subgraph-with-the-required-paths","rating":2364.3455634374,"_hash":237326824,"paid_only":false,"cont_title":"第 284 场周赛","cont_title_slug":"weekly-contest-284"},{"question_id":2132,"title":"用邮票贴满网格图","title_slug":"stamping-the-grid","rating":2364.3930657709,"_hash":296151509,"paid_only":false,"cont_title":"第 69 场双周赛","cont_title_slug":"biweekly-contest-69"},{"question_id":1183,"title":"矩阵中 1 的最大数量","title_slug":"maximum-number-of-ones","rating":2366.7099607655,"_hash":3675075625,"paid_only":false,"cont_title":"第 8 场双周赛","cont_title_slug":"biweekly-contest-8"},{"question_id":2801,"title":"统计范围内的步进数字数目","title_slug":"count-stepping-numbers-in-range","rating":2367.4705934718,"_hash":3369476122,"paid_only":false,"cont_title":"第 356 场周赛","cont_title_slug":"weekly-contest-356"},{"question_id":2556,"title":"二进制矩阵中翻转最多一次使路径不连通","title_slug":"disconnect-path-in-a-binary-matrix-by-at-most-one-flip","rating":2368.6674771307,"_hash":3118895370,"paid_only":false,"cont_title":"第 97 场双周赛","cont_title_slug":"biweekly-contest-97"},{"question_id":1840,"title":"最高建筑高度","title_slug":"maximum-building-height","rating":2374.1850487395,"_hash":3469541764,"paid_only":false,"cont_title":"第 238 场周赛","cont_title_slug":"weekly-contest-238"},{"question_id":887,"title":"鸡蛋掉落","title_slug":"super-egg-drop","rating":2376.8658923518,"_hash":2610426510,"paid_only":false,"cont_title":"第 97 场周赛","cont_title_slug":"weekly-contest-97"},{"question_id":854,"title":"相似度为 K 的字符串","title_slug":"k-similar-strings","rating":2377.3895801187,"_hash":4154336589,"paid_only":false,"cont_title":"第 89 场周赛","cont_title_slug":"weekly-contest-89"},{"question_id":2589,"title":"完成所有任务的最少时间","title_slug":"minimum-time-to-complete-all-tasks","rating":2380.5983169295,"_hash":1119710280,"paid_only":false,"cont_title":"第 336 场周赛","cont_title_slug":"weekly-contest-336"},{"question_id":2334,"title":"元素值大于变化阈值的子数组","title_slug":"subarray-with-elements-greater-than-varying-threshold","rating":2381.2160234811,"_hash":265213405,"paid_only":false,"cont_title":"第 82 场双周赛","cont_title_slug":"biweekly-contest-82"},{"question_id":956,"title":"最高的广告牌","title_slug":"tallest-billboard","rating":2381.479024858,"_hash":2251334448,"paid_only":false,"cont_title":"第 114 场周赛","cont_title_slug":"weekly-contest-114"},{"question_id":2468,"title":"根据限制分割消息","title_slug":"split-message-based-on-limit","rating":2381.6019709166,"_hash":4257560677,"paid_only":false,"cont_title":"第 91 场双周赛","cont_title_slug":"biweekly-contest-91"},{"question_id":2577,"title":"在网格图中访问一个格子的最少时间","title_slug":"minimum-time-to-visit-a-cell-in-a-grid","rating":2381.625583289,"_hash":2170025879,"paid_only":false,"cont_title":"第 334 场周赛","cont_title_slug":"weekly-contest-334"},{"question_id":1521,"title":"找到最接近目标值的函数值","title_slug":"find-a-value-of-a-mysterious-function-closest-to-target","rating":2383.7724811656,"_hash":3856718514,"paid_only":false,"cont_title":"第 198 场周赛","cont_title_slug":"weekly-contest-198"},{"question_id":1349,"title":"参加考试的最大学生数","title_slug":"maximum-students-taking-exam","rating":2385.8072128533,"_hash":1698302709,"paid_only":false,"cont_title":"第 175 场周赛","cont_title_slug":"weekly-contest-175"},{"question_id":2713,"title":"矩阵中严格递增的单元格数","title_slug":"maximum-strictly-increasing-cells-in-a-matrix","rating":2387.3525635254,"_hash":521886798,"paid_only":false,"cont_title":"第 347 场周赛","cont_title_slug":"weekly-contest-347"},{"question_id":1681,"title":"最小不兼容性","title_slug":"minimum-incompatibility","rating":2389.9634276167,"_hash":2997800679,"paid_only":false,"cont_title":"第 218 场周赛","cont_title_slug":"weekly-contest-218"},{"question_id":2322,"title":"从树中删除边的最小分数","title_slug":"minimum-score-after-removals-on-a-tree","rating":2391.657270733,"_hash":2618637580,"paid_only":false,"cont_title":"第 299 场周赛","cont_title_slug":"weekly-contest-299"},{"question_id":2172,"title":"数组的最大与和","title_slug":"maximum-and-sum-of-array","rating":2392.0799451298,"_hash":284708083,"paid_only":false,"cont_title":"第 280 场周赛","cont_title_slug":"weekly-contest-280"},{"question_id":1825,"title":"求出 MK 平均值","title_slug":"finding-mk-average","rating":2395.8765531206,"_hash":2747291591,"paid_only":false,"cont_title":"第 236 场周赛","cont_title_slug":"weekly-contest-236"},{"question_id":2818,"title":"操作使得分最大","title_slug":"apply-operations-to-maximize-score","rating":2396.6770372863,"_hash":2573211912,"paid_only":false,"cont_title":"第 358 场周赛","cont_title_slug":"weekly-contest-358"},{"question_id":2569,"title":"更新数组后处理求和查询","title_slug":"handling-sum-queries-after-update","rating":2397.8728428256,"_hash":1507332922,"paid_only":false,"cont_title":"第 98 场双周赛","cont_title_slug":"biweekly-contest-98"},{"question_id":2538,"title":"最大价值和与最小价值和的差值","title_slug":"difference-between-maximum-and-minimum-price-sum","rating":2397.9722495587,"_hash":2887872471,"paid_only":false,"cont_title":"第 328 场周赛","cont_title_slug":"weekly-contest-328"},{"question_id":920,"title":"播放列表的数量","title_slug":"number-of-music-playlists","rating":2399.5729141925,"_hash":1165166058,"paid_only":false,"cont_title":"第 105 场周赛","cont_title_slug":"weekly-contest-105"},{"question_id":2747,"title":"统计没有收到请求的服务器数目","title_slug":"count-zero-request-servers","rating":2405.3375364501,"_hash":2240198172,"paid_only":false,"cont_title":"第 107 场双周赛","cont_title_slug":"biweekly-contest-107"},{"question_id":1388,"title":"3n 块披萨","title_slug":"pizza-with-3n-slices","rating":2409.7580728676,"_hash":4187483922,"paid_only":false,"cont_title":"第 22 场双周赛","cont_title_slug":"biweekly-contest-22"},{"question_id":1928,"title":"规定时间内到达终点的最小花费","title_slug":"minimum-cost-to-reach-destination-in-time","rating":2413.3969129689,"_hash":3899529382,"paid_only":false,"cont_title":"第 56 场双周赛","cont_title_slug":"biweekly-contest-56"},{"question_id":2518,"title":"好分区的数目","title_slug":"number-of-great-partitions","rating":2414.6227484407,"_hash":636790914,"paid_only":false,"cont_title":"第 325 场周赛","cont_title_slug":"weekly-contest-325"},{"question_id":2003,"title":"每棵子树内缺失的最小基因值","title_slug":"smallest-missing-genetic-value-in-each-subtree","rating":2415.0089731911,"_hash":4272085250,"paid_only":false,"cont_title":"第 258 场周赛","cont_title_slug":"weekly-contest-258"},{"question_id":2493,"title":"将节点分成尽可能多的组","title_slug":"divide-nodes-into-the-maximum-number-of-groups","rating":2415.2802039252,"_hash":1627181507,"paid_only":false,"cont_title":"第 322 场周赛","cont_title_slug":"weekly-contest-322"},{"question_id":2663,"title":"字典序最小的美丽字符串","title_slug":"lexicographically-smallest-beautiful-string","rating":2415.7434855724,"_hash":178720857,"paid_only":false,"cont_title":"第 343 场周赛","cont_title_slug":"weekly-contest-343"},{"question_id":1203,"title":"项目管理","title_slug":"sort-items-by-groups-respecting-dependencies","rating":2418.5742747632,"_hash":505097820,"paid_only":false,"cont_title":"第 155 场周赛","cont_title_slug":"weekly-contest-155"},{"question_id":2572,"title":"无平方子集计数","title_slug":"count-the-number-of-square-free-subsets","rating":2419.5791089724,"_hash":3483377785,"paid_only":false,"cont_title":"第 333 场周赛","cont_title_slug":"weekly-contest-333"},{"question_id":1987,"title":"不同的好子序列数目","title_slug":"number-of-unique-good-subsequences","rating":2422.3128048015,"_hash":3567330607,"paid_only":false,"cont_title":"第 256 场周赛","cont_title_slug":"weekly-contest-256"},{"question_id":1000,"title":"合并石头的最低成本","title_slug":"minimum-cost-to-merge-stones","rating":2422.5309771173,"_hash":730656427,"paid_only":false,"cont_title":"第 126 场周赛","cont_title_slug":"weekly-contest-126"},{"question_id":2742,"title":"给墙壁刷油漆","title_slug":"painting-the-walls","rating":2424.6761561972,"_hash":3563762803,"paid_only":false,"cont_title":"第 350 场周赛","cont_title_slug":"weekly-contest-350"},{"question_id":2867,"title":"统计树中的合法路径数目","title_slug":"count-valid-paths-in-a-tree","rating":2428.3242593838,"_hash":3532863467,"paid_only":false,"cont_title":"第 364 场周赛","cont_title_slug":"weekly-contest-364"},{"question_id":1044,"title":"最长重复子串","title_slug":"longest-duplicate-substring","rating":2428.7985254341,"_hash":625310591,"paid_only":false,"cont_title":"第 136 场周赛","cont_title_slug":"weekly-contest-136"},{"question_id":1998,"title":"数组的最大公因数排序","title_slug":"gcd-sort-of-an-array","rating":2429.0940568399,"_hash":1642092986,"paid_only":false,"cont_title":"第 257 场周赛","cont_title_slug":"weekly-contest-257"},{"question_id":2565,"title":"最少得分子序列","title_slug":"subsequence-with-the-minimum-score","rating":2432.4146343542,"_hash":782263815,"paid_only":false,"cont_title":"第 332 场周赛","cont_title_slug":"weekly-contest-332"},{"question_id":2552,"title":"统计上升四元组","title_slug":"count-increasing-quadruplets","rating":2432.713399111,"_hash":2579679937,"paid_only":false,"cont_title":"第 330 场周赛","cont_title_slug":"weekly-contest-330"},{"question_id":903,"title":"DI 序列的有效排列","title_slug":"valid-permutations-for-di-sequence","rating":2433.3767704629,"_hash":2519726489,"paid_only":false,"cont_title":"第 101 场周赛","cont_title_slug":"weekly-contest-101"},{"question_id":1872,"title":"石子游戏 VIII","title_slug":"stone-game-viii","rating":2439.7337408636,"_hash":3947635653,"paid_only":false,"cont_title":"第 242 场周赛","cont_title_slug":"weekly-contest-242"},{"question_id":2968,"title":"执行操作使频率分数最大","title_slug":"apply-operations-to-maximize-frequency-score","rating":2444.2791027022,"_hash":1059279895,"paid_only":false,"cont_title":"第 376 场周赛","cont_title_slug":"weekly-contest-376"},{"question_id":2421,"title":"好路径的数目","title_slug":"number-of-good-paths","rating":2444.6660756903,"_hash":2335420481,"paid_only":false,"cont_title":"第 312 场周赛","cont_title_slug":"weekly-contest-312"},{"question_id":2949,"title":"统计美丽子字符串 II","title_slug":"count-beautiful-substrings-ii","rating":2444.7192647604,"_hash":497323702,"paid_only":false,"cont_title":"第 373 场周赛","cont_title_slug":"weekly-contest-373"},{"question_id":2926,"title":"平衡子序列的最大和","title_slug":"maximum-balanced-subsequence-sum","rating":2448.4455464535,"_hash":2375501212,"paid_only":false,"cont_title":"第 370 场周赛","cont_title_slug":"weekly-contest-370"},{"question_id":2127,"title":"参加会议的最多员工数","title_slug":"maximum-employees-to-be-invited-to-a-meeting","rating":2449.1323757838,"_hash":2605448197,"paid_only":false,"cont_title":"第 274 场周赛","cont_title_slug":"weekly-contest-274"},{"question_id":2953,"title":"统计完全子字符串","title_slug":"count-complete-substrings","rating":2449.3352959316,"_hash":3462463455,"paid_only":false,"cont_title":"第 374 场周赛","cont_title_slug":"weekly-contest-374"},{"question_id":2463,"title":"最小移动总距离","title_slug":"minimum-total-distance-traveled","rating":2453.9054896968,"_hash":169260234,"paid_only":false,"cont_title":"第 318 场周赛","cont_title_slug":"weekly-contest-318"},{"question_id":1900,"title":"最佳运动员的比拼回合","title_slug":"the-earliest-and-latest-rounds-where-players-compete","rating":2454.7653333657,"_hash":5115105,"paid_only":false,"cont_title":"第 245 场周赛","cont_title_slug":"weekly-contest-245"},{"question_id":1040,"title":"移动石子直到连续 II","title_slug":"moving-stones-until-consecutive-ii","rating":2455.8244137907,"_hash":2184686055,"paid_only":false,"cont_title":"第 135 场周赛","cont_title_slug":"weekly-contest-135"},{"question_id":1499,"title":"满足不等式的最大值","title_slug":"max-value-of-equation","rating":2456.3900212097,"_hash":446968474,"paid_only":false,"cont_title":"第 195 场周赛","cont_title_slug":"weekly-contest-195"},{"question_id":1782,"title":"统计点对的数目","title_slug":"count-pairs-of-nodes","rating":2457.115574186,"_hash":3015354306,"paid_only":false,"cont_title":"第 47 场双周赛","cont_title_slug":"biweekly-contest-47"},{"question_id":2440,"title":"创建价值相同的连通块","title_slug":"create-components-with-same-value","rating":2460.3152437576,"_hash":2080495144,"paid_only":false,"cont_title":"第 89 场双周赛","cont_title_slug":"biweekly-contest-89"},{"question_id":1994,"title":"好子集的数目","title_slug":"the-number-of-good-subsets","rating":2464.5077611012,"_hash":1844354140,"paid_only":false,"cont_title":"第 60 场双周赛","cont_title_slug":"biweekly-contest-60"},{"question_id":1703,"title":"得到连续 K 个 1 的最少相邻交换次数","title_slug":"minimum-adjacent-swaps-for-k-consecutive-ones","rating":2466.8891773908,"_hash":3562926842,"paid_only":false,"cont_title":"第 42 场双周赛","cont_title_slug":"biweekly-contest-42"},{"question_id":2286,"title":"以组为单位订音乐会的门票","title_slug":"booking-concert-tickets-in-groups","rating":2470.2118194809,"_hash":3907062892,"paid_only":false,"cont_title":"第 79 场双周赛","cont_title_slug":"biweekly-contest-79"},{"question_id":1622,"title":"奇妙序列","title_slug":"fancy-sequence","rating":2476.451764287,"_hash":976252372,"paid_only":false,"cont_title":"第 37 场双周赛","cont_title_slug":"biweekly-contest-37"},{"question_id":2117,"title":"一个区间内所有数乘积的缩写","title_slug":"abbreviating-the-product-of-a-range","rating":2476.7727985927,"_hash":2799632565,"paid_only":false,"cont_title":"第 68 场双周赛","cont_title_slug":"biweekly-contest-68"},{"question_id":1803,"title":"统计异或值在范围内的数对有多少","title_slug":"count-pairs-with-xor-in-a-range","rating":2479.3282985529,"_hash":2711761019,"paid_only":false,"cont_title":"第 233 场周赛","cont_title_slug":"weekly-contest-233"},{"question_id":1330,"title":"翻转子数组得到最大的数组值","title_slug":"reverse-subarray-to-maximize-array-value","rating":2481.7175364169,"_hash":3851133364,"paid_only":false,"cont_title":"第 18 场双周赛","cont_title_slug":"biweekly-contest-18"},{"question_id":2289,"title":"使数组按非递减顺序排列","title_slug":"steps-to-make-array-non-decreasing","rating":2481.8722909195,"_hash":188352287,"paid_only":false,"cont_title":"第 295 场周赛","cont_title_slug":"weekly-contest-295"},{"question_id":1932,"title":"合并多棵二叉搜索树","title_slug":"merge-bsts-to-create-single-bst","rating":2483.9435767299,"_hash":1876544260,"paid_only":false,"cont_title":"第 249 场周赛","cont_title_slug":"weekly-contest-249"},{"question_id":1916,"title":"统计为蚁群构筑房间的不同顺序","title_slug":"count-ways-to-build-rooms-in-an-ant-colony","rating":2486.2339675701,"_hash":2321691552,"paid_only":false,"cont_title":"第 247 场周赛","cont_title_slug":"weekly-contest-247"},{"question_id":2035,"title":"将数组分成两个数组并最小化数组和的差","title_slug":"partition-array-into-two-arrays-to-minimize-sum-difference","rating":2489.6652421066,"_hash":550627195,"paid_only":false,"cont_title":"第 262 场周赛","cont_title_slug":"weekly-contest-262"},{"question_id":2157,"title":"字符串分组","title_slug":"groups-of-strings","rating":2499.3282271507,"_hash":713625410,"paid_only":false,"cont_title":"第 278 场周赛","cont_title_slug":"weekly-contest-278"},{"question_id":1735,"title":"生成乘积数组的方案数","title_slug":"count-ways-to-make-array-with-product","rating":2499.5640490579,"_hash":3183792133,"paid_only":false,"cont_title":"第 44 场双周赛","cont_title_slug":"biweekly-contest-44"},{"question_id":1938,"title":"查询最大基因差","title_slug":"maximum-genetic-difference-query","rating":2502.5176603922,"_hash":2939895760,"paid_only":false,"cont_title":"第 250 场周赛","cont_title_slug":"weekly-contest-250"},{"question_id":2846,"title":"边权重均等查询","title_slug":"minimum-edge-weight-equilibrium-queries-in-a-tree","rating":2507.9960044659,"_hash":2672352527,"paid_only":false,"cont_title":"第 361 场周赛","cont_title_slug":"weekly-contest-361"},{"question_id":2272,"title":"最大波动的子字符串","title_slug":"substring-with-largest-variance","rating":2515.7520586008,"_hash":928331770,"paid_only":false,"cont_title":"第 78 场双周赛","cont_title_slug":"biweekly-contest-78"},{"question_id":2040,"title":"两个有序数组的第 K 小乘积","title_slug":"kth-smallest-product-of-two-sorted-arrays","rating":2517.6829964848,"_hash":4175159080,"paid_only":false,"cont_title":"第 63 场双周赛","cont_title_slug":"biweekly-contest-63"},{"question_id":1632,"title":"矩阵转换后的秩","title_slug":"rank-transform-of-a-matrix","rating":2529.5251086936,"_hash":2488135056,"paid_only":false,"cont_title":"第 212 场周赛","cont_title_slug":"weekly-contest-212"},{"question_id":1776,"title":"车队 II","title_slug":"car-fleet-ii","rating":2530.6905139914,"_hash":1961138257,"paid_only":false,"cont_title":"第 230 场周赛","cont_title_slug":"weekly-contest-230"},{"question_id":1896,"title":"反转表达式值的最少操作次数","title_slug":"minimum-cost-to-change-the-final-value-of-expression","rating":2531.6452775023,"_hash":4239622058,"paid_only":false,"cont_title":"第 54 场双周赛","cont_title_slug":"biweekly-contest-54"},{"question_id":2736,"title":"最大和查询","title_slug":"maximum-sum-queries","rating":2533.2830157959,"_hash":3697179042,"paid_only":false,"cont_title":"第 349 场周赛","cont_title_slug":"weekly-contest-349"},{"question_id":1675,"title":"数组的最小偏移量","title_slug":"minimize-deviation-in-array","rating":2533.3027905062,"_hash":549109709,"paid_only":false,"cont_title":"第 217 场周赛","cont_title_slug":"weekly-contest-217"},{"question_id":1948,"title":"删除系统中的重复文件夹","title_slug":"delete-duplicate-folders-in-system","rating":2533.7796160302,"_hash":2921275572,"paid_only":false,"cont_title":"第 251 场周赛","cont_title_slug":"weekly-contest-251"},{"question_id":1595,"title":"连通两组点的最小成本","title_slug":"minimum-cost-to-connect-two-groups-of-points","rating":2537.7965575726,"_hash":883833496,"paid_only":false,"cont_title":"第 207 场周赛","cont_title_slug":"weekly-contest-207"},{"question_id":1819,"title":"序列中不同最大公约数的数目","title_slug":"number-of-different-subsequences-gcds","rating":2539.863726397,"_hash":2981004463,"paid_only":false,"cont_title":"第 235 场周赛","cont_title_slug":"weekly-contest-235"},{"question_id":3013,"title":"将数组分成最小总代价的子数组 II","title_slug":"divide-an-array-into-subarrays-with-minimum-cost-ii","rating":2540.438150736,"_hash":2049140185,"paid_only":false,"cont_title":"第 122 场双周赛","cont_title_slug":"biweekly-contest-122"},{"question_id":2014,"title":"重复 K 次的最长子序列","title_slug":"longest-subsequence-repeated-k-times","rating":2558.3297484354,"_hash":3061824471,"paid_only":false,"cont_title":"第 259 场周赛","cont_title_slug":"weekly-contest-259"},{"question_id":1815,"title":"得到新鲜甜甜圈的最多组数","title_slug":"maximum-number-of-groups-getting-fresh-donuts","rating":2559.4351004238,"_hash":2135431142,"paid_only":false,"cont_title":"第 49 场双周赛","cont_title_slug":"biweekly-contest-49"},{"question_id":2234,"title":"花园的最大总美丽值","title_slug":"maximum-total-beauty-of-the-gardens","rating":2561.508149216,"_hash":2719330296,"paid_only":false,"cont_title":"第 288 场周赛","cont_title_slug":"weekly-contest-288"},{"question_id":2030,"title":"含特定字母的最小子序列","title_slug":"smallest-k-length-subsequence-with-occurrences-of-a-letter","rating":2561.7794931859,"_hash":266469116,"paid_only":false,"cont_title":"第 261 场周赛","cont_title_slug":"weekly-contest-261"},{"question_id":913,"title":"猫和老鼠","title_slug":"cat-and-mouse","rating":2566.5910742837,"_hash":1811529317,"paid_only":false,"cont_title":"第 104 场周赛","cont_title_slug":"weekly-contest-104"},{"question_id":1489,"title":"找到最小生成树里的关键边和伪关键边","title_slug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree","rating":2571.552028121,"_hash":2415029607,"paid_only":false,"cont_title":"第 194 场周赛","cont_title_slug":"weekly-contest-194"},{"question_id":1531,"title":"压缩字符串 II","title_slug":"string-compression-ii","rating":2575.9570281316,"_hash":2845488076,"paid_only":false,"cont_title":"第 199 场周赛","cont_title_slug":"weekly-contest-199"},{"question_id":2617,"title":"网格图中最少访问的格子数","title_slug":"minimum-number-of-visited-cells-in-a-grid","rating":2581.9961985753,"_hash":267246445,"paid_only":false,"cont_title":"第 340 场周赛","cont_title_slug":"weekly-contest-340"},{"question_id":2813,"title":"子序列最大优雅度","title_slug":"maximum-elegance-of-a-k-length-subsequence","rating":2582.0814855506,"_hash":462875391,"paid_only":false,"cont_title":"第 357 场周赛","cont_title_slug":"weekly-contest-357"},{"question_id":936,"title":"戳印序列","title_slug":"stamping-the-sequence","rating":2583.406911951,"_hash":3709920516,"paid_only":false,"cont_title":"第 109 场周赛","cont_title_slug":"weekly-contest-109"},{"question_id":2019,"title":"解出数学表达式的学生分数","title_slug":"the-score-of-students-solving-math-expression","rating":2583.9006314254,"_hash":1787510201,"paid_only":false,"cont_title":"第 260 场周赛","cont_title_slug":"weekly-contest-260"},{"question_id":1883,"title":"准时抵达会议现场的最小跳过休息次数","title_slug":"minimum-skips-to-arrive-at-meeting-on-time","rating":2587.8725248485,"_hash":557097878,"paid_only":false,"cont_title":"第 243 场周赛","cont_title_slug":"weekly-contest-243"},{"question_id":2532,"title":"过桥的时间","title_slug":"time-to-cross-a-bridge","rating":2588.8752130913,"_hash":1029578709,"paid_only":false,"cont_title":"第 327 场周赛","cont_title_slug":"weekly-contest-327"},{"question_id":964,"title":"表示数字的最少运算符","title_slug":"least-operators-to-express-number","rating":2594.135673452,"_hash":571415893,"paid_only":false,"cont_title":"第 116 场周赛","cont_title_slug":"weekly-contest-116"},{"question_id":2911,"title":"得到 K 个半回文串的最少修改次数","title_slug":"minimum-changes-to-make-k-semi-palindromes","rating":2607.9418744903,"_hash":2481240580,"paid_only":false,"cont_title":"第 368 场周赛","cont_title_slug":"weekly-contest-368"},{"question_id":1687,"title":"从仓库到码头运输箱子","title_slug":"delivering-boxes-from-storage-to-ports","rating":2610.0826855063,"_hash":2436117632,"paid_only":false,"cont_title":"第 41 场双周赛","cont_title_slug":"biweekly-contest-41"},{"question_id":2056,"title":"棋盘上有效移动组合的数目","title_slug":"number-of-valid-move-combinations-on-chessboard","rating":2610.9906730644,"_hash":288912613,"paid_only":false,"cont_title":"第 64 场双周赛","cont_title_slug":"biweekly-contest-64"},{"question_id":2338,"title":"统计理想数组的数目","title_slug":"count-the-number-of-ideal-arrays","rating":2615.1468269481,"_hash":2648057035,"paid_only":false,"cont_title":"第 301 场周赛","cont_title_slug":"weekly-contest-301"},{"question_id":2790,"title":"长度递增组的最大数目","title_slug":"maximum-number-of-groups-with-increasing-length","rating":2619.7016189999,"_hash":2676463244,"paid_only":false,"cont_title":"第 355 场周赛","cont_title_slug":"weekly-contest-355"},{"question_id":1830,"title":"使字符串有序的最少操作次数","title_slug":"minimum-number-of-operations-to-make-string-sorted","rating":2620.4181842249,"_hash":3807487459,"paid_only":false,"cont_title":"第 50 场双周赛","cont_title_slug":"biweekly-contest-50"},{"question_id":2281,"title":"巫师的总力量和","title_slug":"sum-of-total-strength-of-wizards","rating":2621.1208072273,"_hash":3147772108,"paid_only":false,"cont_title":"第 294 场周赛","cont_title_slug":"weekly-contest-294"},{"question_id":2213,"title":"由单个字符重复的最长子字符串","title_slug":"longest-substring-of-one-repeating-character","rating":2628.7957821141,"_hash":96141044,"paid_only":false,"cont_title":"第 285 场周赛","cont_title_slug":"weekly-contest-285"},{"question_id":2499,"title":"让数组不相等的最小总代价","title_slug":"minimum-total-cost-to-make-arrays-unequal","rating":2633.0144045478,"_hash":3756156206,"paid_only":false,"cont_title":"第 93 场双周赛","cont_title_slug":"biweekly-contest-93"},{"question_id":1787,"title":"使所有区间的异或结果为零","title_slug":"make-the-xor-of-all-segments-equal-to-zero","rating":2640.3824813624,"_hash":2908242202,"paid_only":false,"cont_title":"第 231 场周赛","cont_title_slug":"weekly-contest-231"},{"question_id":2954,"title":"统计感冒序列的数目","title_slug":"count-the-number-of-infection-sequences","rating":2644.8498152558,"_hash":3519471521,"paid_only":false,"cont_title":"第 374 场周赛","cont_title_slug":"weekly-contest-374"},{"question_id":2386,"title":"找出数组的第 K 大和","title_slug":"find-the-k-sum-of-an-array","rating":2647.8258771458,"_hash":2945726008,"paid_only":false,"cont_title":"第 307 场周赛","cont_title_slug":"weekly-contest-307"},{"question_id":2071,"title":"你可以安排的最多任务数目","title_slug":"maximum-number-of-tasks-you-can-assign","rating":2648.1748409542,"_hash":1194042995,"paid_only":false,"cont_title":"第 65 场双周赛","cont_title_slug":"biweekly-contest-65"},{"question_id":2097,"title":"合法重新排列数对","title_slug":"valid-arrangement-of-pairs","rating":2650.8996457642,"_hash":459732998,"paid_only":false,"cont_title":"第 270 场周赛","cont_title_slug":"weekly-contest-270"},{"question_id":1659,"title":"最大化网格幸福感","title_slug":"maximize-grid-happiness","rating":2655.2178711909,"_hash":372608626,"paid_only":false,"cont_title":"第 215 场周赛","cont_title_slug":"weekly-contest-215"},{"question_id":1923,"title":"最长公共子路径","title_slug":"longest-common-subpath","rating":2661.0670044656,"_hash":3430988573,"paid_only":false,"cont_title":"第 248 场周赛","cont_title_slug":"weekly-contest-248"},{"question_id":1397,"title":"找到所有好字符串","title_slug":"find-all-good-strings","rating":2666.668150845,"_hash":3549637617,"paid_only":false,"cont_title":"第 182 场周赛","cont_title_slug":"weekly-contest-182"},{"question_id":2791,"title":"树中可以形成回文的路径数","title_slug":"count-paths-that-can-form-a-palindrome-in-a-tree","rating":2677.1682592316,"_hash":3909203570,"paid_only":false,"cont_title":"第 355 场周赛","cont_title_slug":"weekly-contest-355"},{"question_id":2573,"title":"找出对应 LCP 矩阵的字符串","title_slug":"find-the-string-with-lcp","rating":2681.7054310332,"_hash":3461834167,"paid_only":false,"cont_title":"第 333 场周赛","cont_title_slug":"weekly-contest-333"},{"question_id":1960,"title":"两个回文子字符串长度的最大乘积","title_slug":"maximum-product-of-the-length-of-two-palindromic-substrings","rating":2690.5859406179,"_hash":1434911335,"paid_only":false,"cont_title":"第 58 场双周赛","cont_title_slug":"biweekly-contest-58"},{"question_id":2977,"title":"转换字符串的最小成本 II","title_slug":"minimum-cost-to-convert-string-ii","rating":2695.809667046,"_hash":3381061806,"paid_only":false,"cont_title":"第 377 场周赛","cont_title_slug":"weekly-contest-377"},{"question_id":3017,"title":"按距离统计房屋对数目 II","title_slug":"count-the-number-of-houses-at-a-certain-distance-ii","rating":2709.4067070911,"_hash":3187405082,"paid_only":false,"cont_title":"第 381 场周赛","cont_title_slug":"weekly-contest-381"},{"question_id":2603,"title":"收集树中金币","title_slug":"collect-coins-in-a-tree","rating":2711.8717381409,"_hash":2315979719,"paid_only":false,"cont_title":"第 338 场周赛","cont_title_slug":"weekly-contest-338"},{"question_id":2902,"title":"和带限制的子多重集合的数目","title_slug":"count-of-sub-multisets-with-bounded-sum","rating":2758.9704056427,"_hash":2720318685,"paid_only":false,"cont_title":"第 115 场双周赛","cont_title_slug":"biweekly-contest-115"},{"question_id":2836,"title":"在传球游戏中最大化函数值","title_slug":"maximize-value-of-function-in-a-ball-passing-game","rating":2768.8154223451,"_hash":1915862517,"paid_only":false,"cont_title":"第 360 场周赛","cont_title_slug":"weekly-contest-360"},{"question_id":2983,"title":"回文串重新排列查询","title_slug":"palindrome-rearrangement-queries","rating":2779.7855167601,"_hash":4244339093,"paid_only":false,"cont_title":"第 378 场周赛","cont_title_slug":"weekly-contest-378"},{"question_id":2060,"title":"同源字符串检测","title_slug":"check-if-an-original-string-exists-given-two-encoded-strings","rating":2803.7652028979,"_hash":905487995,"paid_only":false,"cont_title":"第 265 场周赛","cont_title_slug":"weekly-contest-265"},{"question_id":2916,"title":"子数组不同元素数目的平方和 II","title_slug":"subarrays-distinct-element-sum-of-squares-ii","rating":2816.0706257586,"_hash":731038573,"paid_only":false,"cont_title":"第 116 场双周赛","cont_title_slug":"biweekly-contest-116"},{"question_id":1977,"title":"划分数字的方案数","title_slug":"number-of-ways-to-separate-numbers","rating":2817.267212602,"_hash":1178924986,"paid_only":false,"cont_title":"第 59 场双周赛","cont_title_slug":"biweekly-contest-59"},{"question_id":2612,"title":"最少翻转操作数","title_slug":"minimum-reverse-operations","rating":2824.4551372454,"_hash":855962181,"paid_only":false,"cont_title":"第 339 场周赛","cont_title_slug":"weekly-contest-339"},{"question_id":1728,"title":"猫和老鼠 II","title_slug":"cat-and-mouse-ii","rating":2849.4841858619,"_hash":59158142,"paid_only":false,"cont_title":"第 224 场周赛","cont_title_slug":"weekly-contest-224"},{"question_id":2851,"title":"字符串转换","title_slug":"string-transformation","rating":2857.6543956169,"_hash":2130827066,"paid_only":false,"cont_title":"第 362 场周赛","cont_title_slug":"weekly-contest-362"},{"question_id":1982,"title":"从子集的和还原数组","title_slug":"find-array-given-subset-sums","rating":2872.0290327119,"_hash":1576603106,"paid_only":false,"cont_title":"第 255 场周赛","cont_title_slug":"weekly-contest-255"},{"question_id":2699,"title":"修改图中的边权","title_slug":"modify-graph-edge-weights","rating":2873.9745576413,"_hash":4247310156,"paid_only":false,"cont_title":"第 346 场周赛","cont_title_slug":"weekly-contest-346"},{"question_id":3022,"title":"给定操作次数内使剩余元素的或值最小","title_slug":"minimize-or-of-remaining-elements-using-operations","rating":2917.8273567322,"_hash":3532176892,"paid_only":false,"cont_title":"第 382 场周赛","cont_title_slug":"weekly-contest-382"},{"question_id":2945,"title":"找到最大非递减数组的长度","title_slug":"find-maximum-non-decreasing-array-length","rating":2943.2173551759,"_hash":1539515792,"paid_only":false,"cont_title":"第 118 场双周赛","cont_title_slug":"biweekly-contest-118"},{"question_id":2809,"title":"使数组和小于等于 x 的最少时间","title_slug":"minimum-time-to-make-array-sum-at-most-x","rating":2978.7961959355,"_hash":224100421,"paid_only":false,"cont_title":"第 110 场双周赛","cont_title_slug":"biweekly-contest-110"},{"question_id":1719,"title":"重构一棵树的方案数","title_slug":"number-of-ways-to-reconstruct-a-tree","rating":3018.4940165727,"_hash":254983687,"paid_only":false,"cont_title":"第 43 场双周赛","cont_title_slug":"biweekly-contest-43"},{"question_id":3003,"title":"执行操作后的最大分割数量","title_slug":"maximize-the-number-of-partitions-after-operations","rating":3039.3003256659,"_hash":834197249,"paid_only":false,"cont_title":"第 379 场周赛","cont_title_slug":"weekly-contest-379"}] +[{"question_id":3044,"title":"出现频率最高的质数","title_slug":"most-frequent-prime","rating":0,"_hash":1829348697,"paid_only":false,"cont_title":"第 385 场周赛","cont_title_slug":"weekly-contest-385"},{"question_id":3038,"title":"相同分数的最大操作数目 I","title_slug":"maximum-number-of-operations-with-the-same-score-i","rating":0,"_hash":787831673,"paid_only":false,"cont_title":"第 124 场双周赛","cont_title_slug":"biweekly-contest-124"},{"question_id":3292,"title":"标记所有下标的最早秒数 I","title_slug":"earliest-second-to-mark-indices-i","rating":0,"_hash":2474207721,"paid_only":false,"cont_title":"第 386 场周赛","cont_title_slug":"weekly-contest-386"},{"question_id":3289,"title":"标记所有下标的最早秒数 II","title_slug":"earliest-second-to-mark-indices-ii","rating":0,"_hash":2820740224,"paid_only":false,"cont_title":"第 386 场周赛","cont_title_slug":"weekly-contest-386"},{"question_id":3042,"title":"统计前后缀下标对 I","title_slug":"count-prefix-and-suffix-pairs-i","rating":0,"_hash":2560538129,"paid_only":false,"cont_title":"第 385 场周赛","cont_title_slug":"weekly-contest-385"},{"question_id":3043,"title":"最长公共前缀的长度","title_slug":"find-the-length-of-the-longest-common-prefix","rating":0,"_hash":3836897087,"paid_only":false,"cont_title":"第 385 场周赛","cont_title_slug":"weekly-contest-385"},{"question_id":3325,"title":"求交集区域内的最大正方形面积","title_slug":"find-the-largest-area-of-square-inside-two-rectangles","rating":0,"_hash":1264664962,"paid_only":false,"cont_title":"第 386 场周赛","cont_title_slug":"weekly-contest-386"},{"question_id":3324,"title":"分割数组","title_slug":"split-the-array","rating":0,"_hash":570608577,"paid_only":false,"cont_title":"第 386 场周赛","cont_title_slug":"weekly-contest-386"},{"question_id":3040,"title":"相同分数的最大操作数目 II","title_slug":"maximum-number-of-operations-with-the-same-score-ii","rating":0,"_hash":4231944752,"paid_only":false,"cont_title":"第 124 场双周赛","cont_title_slug":"biweekly-contest-124"},{"question_id":3039,"title":"进行操作使字符串为空","title_slug":"apply-operations-to-make-string-empty","rating":0,"_hash":1356097871,"paid_only":false,"cont_title":"第 124 场双周赛","cont_title_slug":"biweekly-contest-124"},{"question_id":3045,"title":"统计前后缀下标对 II","title_slug":"count-prefix-and-suffix-pairs-ii","rating":0,"_hash":3118022376,"paid_only":false,"cont_title":"第 385 场周赛","cont_title_slug":"weekly-contest-385"},{"question_id":3041,"title":"修改数组后最大化数组中的连续元素数目","title_slug":"maximize-consecutive-elements-in-an-array-after-modification","rating":0,"_hash":267105112,"paid_only":false,"cont_title":"第 124 场双周赛","cont_title_slug":"biweekly-contest-124"},{"question_id":1108,"title":"IP 地址无效化","title_slug":"defanging-an-ip-address","rating":1084.1319467318,"_hash":1418471367,"paid_only":false,"cont_title":"第 144 场周赛","cont_title_slug":"weekly-contest-144"},{"question_id":1480,"title":"一维数组的动态和","title_slug":"running-sum-of-1d-array","rating":1104.7359028407,"_hash":1062871842,"paid_only":false,"cont_title":"第 193 场周赛","cont_title_slug":"weekly-contest-193"},{"question_id":3028,"title":"边界上的蚂蚁","title_slug":"ant-on-the-boundary","rating":1115.8258444602,"_hash":3048586035,"paid_only":false,"cont_title":"第 383 场周赛","cont_title_slug":"weekly-contest-383"},{"question_id":1394,"title":"找出数组中的幸运数","title_slug":"find-lucky-integer-in-an-array","rating":1118.1080334618,"_hash":3411465392,"paid_only":false,"cont_title":"第 182 场周赛","cont_title_slug":"weekly-contest-182"},{"question_id":1470,"title":"重新排列数组","title_slug":"shuffle-the-array","rating":1120.698183624,"_hash":739255468,"paid_only":false,"cont_title":"第 192 场周赛","cont_title_slug":"weekly-contest-192"},{"question_id":1464,"title":"数组中两元素的最大乘积","title_slug":"maximum-product-of-two-elements-in-an-array","rating":1121.0677596555,"_hash":1656858690,"paid_only":false,"cont_title":"第 191 场周赛","cont_title_slug":"weekly-contest-191"},{"question_id":1455,"title":"检查单词是否为句中其他单词的前缀","title_slug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence","rating":1125.575238274,"_hash":1403314808,"paid_only":false,"cont_title":"第 190 场周赛","cont_title_slug":"weekly-contest-190"},{"question_id":1450,"title":"在既定时间做作业的学生人数","title_slug":"number-of-students-doing-homework-at-a-given-time","rating":1129.3432988996,"_hash":3894678842,"paid_only":false,"cont_title":"第 189 场周赛","cont_title_slug":"weekly-contest-189"},{"question_id":977,"title":"有序数组的平方","title_slug":"squares-of-a-sorted-array","rating":1129.949090232,"_hash":969893325,"paid_only":false,"cont_title":"第 120 场周赛","cont_title_slug":"weekly-contest-120"},{"question_id":1929,"title":"数组串联","title_slug":"concatenation-of-array","rating":1132.6812943289,"_hash":4238290979,"paid_only":false,"cont_title":"第 249 场周赛","cont_title_slug":"weekly-contest-249"},{"question_id":3024,"title":"三角形类型","title_slug":"type-of-triangle","rating":1134.7862697576,"_hash":3778120928,"paid_only":false,"cont_title":"第 123 场双周赛","cont_title_slug":"biweekly-contest-123"},{"question_id":1351,"title":"统计有序矩阵中的负数","title_slug":"count-negative-numbers-in-a-sorted-matrix","rating":1139.4248492279,"_hash":474089455,"paid_only":false,"cont_title":"第 176 场周赛","cont_title_slug":"weekly-contest-176"},{"question_id":1295,"title":"统计位数为偶数的数字","title_slug":"find-numbers-with-even-number-of-digits","rating":1139.6630206282,"_hash":1078494316,"paid_only":false,"cont_title":"第 168 场周赛","cont_title_slug":"weekly-contest-168"},{"question_id":2894,"title":"分类求和并作差","title_slug":"divisible-and-non-divisible-sums-difference","rating":1140.0534541481,"_hash":1782593021,"paid_only":false,"cont_title":"第 366 场周赛","cont_title_slug":"weekly-contest-366"},{"question_id":1281,"title":"整数的各位积和之差","title_slug":"subtract-the-product-and-sum-of-digits-of-an-integer","rating":1141.2363999461,"_hash":1959906977,"paid_only":false,"cont_title":"第 166 场周赛","cont_title_slug":"weekly-contest-166"},{"question_id":2798,"title":"满足目标工作时长的员工数目","title_slug":"number-of-employees-who-met-the-target","rating":1142.0341823205,"_hash":3735817636,"paid_only":false,"cont_title":"第 356 场周赛","cont_title_slug":"weekly-contest-356"},{"question_id":1137,"title":"第 N 个泰波那契数","title_slug":"n-th-tribonacci-number","rating":1142.8650731632,"_hash":651101767,"paid_only":false,"cont_title":"第 147 场周赛","cont_title_slug":"weekly-contest-147"},{"question_id":1913,"title":"两个数对之间的最大乘积差","title_slug":"maximum-product-difference-between-two-pairs","rating":1144.6237559885,"_hash":639622603,"paid_only":false,"cont_title":"第 247 场周赛","cont_title_slug":"weekly-contest-247"},{"question_id":2413,"title":"最小偶倍数","title_slug":"smallest-even-multiple","rating":1144.9508874557,"_hash":3078609754,"paid_only":false,"cont_title":"第 311 场周赛","cont_title_slug":"weekly-contest-311"},{"question_id":2733,"title":"既不是最小值也不是最大值","title_slug":"neither-minimum-nor-maximum","rating":1147.8274860083,"_hash":981386412,"paid_only":false,"cont_title":"第 349 场周赛","cont_title_slug":"weekly-contest-349"},{"question_id":2455,"title":"可被三整除的偶数的平均值","title_slug":"average-value-of-even-numbers-that-are-divisible-by-three","rating":1151.2537511408,"_hash":1001722740,"paid_only":false,"cont_title":"第 317 场周赛","cont_title_slug":"weekly-contest-317"},{"question_id":1290,"title":"二进制链表转整数","title_slug":"convert-binary-number-in-a-linked-list-to-integer","rating":1151.3534799042,"_hash":3681668560,"paid_only":false,"cont_title":"第 167 场周赛","cont_title_slug":"weekly-contest-167"},{"question_id":1460,"title":"通过翻转子数组使两个数组相等","title_slug":"make-two-arrays-equal-by-reversing-subarrays","rating":1151.5250329621,"_hash":2597701503,"paid_only":false,"cont_title":"第 27 场双周赛","cont_title_slug":"biweekly-contest-27"},{"question_id":2778,"title":"特殊元素平方和","title_slug":"sum-of-squares-of-special-elements","rating":1151.9363042898,"_hash":14750873,"paid_only":false,"cont_title":"第 354 场周赛","cont_title_slug":"weekly-contest-354"},{"question_id":2828,"title":"判别首字母缩略词","title_slug":"check-if-a-string-is-an-acronym-of-words","rating":1151.9713084499,"_hash":658738156,"paid_only":false,"cont_title":"第 359 场周赛","cont_title_slug":"weekly-contest-359"},{"question_id":1365,"title":"有多少小于当前数字的数字","title_slug":"how-many-numbers-are-smaller-than-the-current-number","rating":1152.1377893605,"_hash":2310137574,"paid_only":false,"cont_title":"第 178 场周赛","cont_title_slug":"weekly-contest-178"},{"question_id":2089,"title":"找出数组排序后的目标下标","title_slug":"find-target-indices-after-sorting-array","rating":1152.1494742874,"_hash":1915453170,"paid_only":false,"cont_title":"第 269 场周赛","cont_title_slug":"weekly-contest-269"},{"question_id":2469,"title":"温度转换","title_slug":"convert-the-temperature","rating":1153.427255962,"_hash":1614249365,"paid_only":false,"cont_title":"第 319 场周赛","cont_title_slug":"weekly-contest-319"},{"question_id":1502,"title":"判断能否形成等差数列","title_slug":"can-make-arithmetic-progression-from-sequence","rating":1154.828067979,"_hash":2581904260,"paid_only":false,"cont_title":"第 196 场周赛","cont_title_slug":"weekly-contest-196"},{"question_id":2351,"title":"第一个出现两次的字母","title_slug":"first-letter-to-appear-twice","rating":1155.4545579447,"_hash":2515340929,"paid_only":false,"cont_title":"第 303 场周赛","cont_title_slug":"weekly-contest-303"},{"question_id":2903,"title":"找出满足差值条件的下标 I","title_slug":"find-indices-with-index-and-value-difference-i","rating":1157.6407631819,"_hash":1982730574,"paid_only":false,"cont_title":"第 367 场周赛","cont_title_slug":"weekly-contest-367"},{"question_id":1920,"title":"基于排列构建数组","title_slug":"build-array-from-permutation","rating":1160.4439395369,"_hash":1028149095,"paid_only":false,"cont_title":"第 248 场周赛","cont_title_slug":"weekly-contest-248"},{"question_id":1512,"title":"好数对的数目","title_slug":"number-of-good-pairs","rating":1160.8899403409,"_hash":1299928804,"paid_only":false,"cont_title":"第 197 场周赛","cont_title_slug":"weekly-contest-197"},{"question_id":961,"title":"在长度 2N 的数组中找出重复 N 次的元素","title_slug":"n-repeated-element-in-size-2n-array","rating":1161.6227767245,"_hash":1677761084,"paid_only":false,"cont_title":"第 116 场周赛","cont_title_slug":"weekly-contest-116"},{"question_id":2278,"title":"字母在字符串中的百分比","title_slug":"percentage-of-letter-in-string","rating":1161.8236318927,"_hash":2452001178,"paid_only":false,"cont_title":"第 294 场周赛","cont_title_slug":"weekly-contest-294"},{"question_id":1342,"title":"将数字变成 0 的操作次数","title_slug":"number-of-steps-to-reduce-a-number-to-zero","rating":1163.6047095526,"_hash":3773666854,"paid_only":false,"cont_title":"第 19 场双周赛","cont_title_slug":"biweekly-contest-19"},{"question_id":1374,"title":"生成每种字符都是奇数个的字符串","title_slug":"generate-a-string-with-characters-that-have-odd-counts","rating":1164.0227691933,"_hash":4034922554,"paid_only":false,"cont_title":"第 179 场周赛","cont_title_slug":"weekly-contest-179"},{"question_id":2710,"title":"移除字符串中的尾随零","title_slug":"remove-trailing-zeros-from-a-string","rating":1164.5575871589,"_hash":2975776867,"paid_only":false,"cont_title":"第 347 场周赛","cont_title_slug":"weekly-contest-347"},{"question_id":2011,"title":"执行操作后的变量值","title_slug":"final-value-of-variable-after-performing-operations","rating":1165.2135167215,"_hash":170017720,"paid_only":false,"cont_title":"第 259 场周赛","cont_title_slug":"weekly-contest-259"},{"question_id":1446,"title":"连续字符","title_slug":"consecutive-characters","rating":1165.4768151611,"_hash":1368317464,"paid_only":false,"cont_title":"第 26 场双周赛","cont_title_slug":"biweekly-contest-26"},{"question_id":2824,"title":"统计和小于目标的下标对数目","title_slug":"count-pairs-whose-sum-is-less-than-target","rating":1165.8838207286,"_hash":77582966,"paid_only":false,"cont_title":"第 111 场双周赛","cont_title_slug":"biweekly-contest-111"},{"question_id":1768,"title":"交替合并字符串","title_slug":"merge-strings-alternately","rating":1166.5264284193,"_hash":1210757712,"paid_only":false,"cont_title":"第 229 场周赛","cont_title_slug":"weekly-contest-229"},{"question_id":1832,"title":"判断句子是否为全字母句","title_slug":"check-if-the-sentence-is-pangram","rating":1166.78818332,"_hash":2544348147,"paid_only":false,"cont_title":"第 237 场周赛","cont_title_slug":"weekly-contest-237"},{"question_id":2185,"title":"统计包含给定前缀的字符串","title_slug":"counting-words-with-a-given-prefix","rating":1167.1241589729,"_hash":537971944,"paid_only":false,"cont_title":"第 282 场周赛","cont_title_slug":"weekly-contest-282"},{"question_id":1304,"title":"和为零的 N 个不同整数","title_slug":"find-n-unique-integers-sum-up-to-zero","rating":1167.1331831913,"_hash":1460547008,"paid_only":false,"cont_title":"第 169 场周赛","cont_title_slug":"weekly-contest-169"},{"question_id":2441,"title":"与对应负数同时存在的最大正整数","title_slug":"largest-positive-integer-that-exists-with-its-negative","rating":1167.647122501,"_hash":3779169819,"paid_only":false,"cont_title":"第 315 场周赛","cont_title_slug":"weekly-contest-315"},{"question_id":2057,"title":"值相等的最小索引","title_slug":"smallest-index-with-equal-value","rating":1167.8737144048,"_hash":3849697077,"paid_only":false,"cont_title":"第 265 场周赛","cont_title_slug":"weekly-contest-265"},{"question_id":2651,"title":"计算列车到站时间","title_slug":"calculate-delayed-arrival-time","rating":1168.6157473032,"_hash":1602330770,"paid_only":false,"cont_title":"第 342 场周赛","cont_title_slug":"weekly-contest-342"},{"question_id":2960,"title":"统计已测试设备","title_slug":"count-tested-devices-after-test-operations","rating":1169.4209117977,"_hash":2595697191,"paid_only":false,"cont_title":"第 375 场周赛","cont_title_slug":"weekly-contest-375"},{"question_id":2427,"title":"公因子的数目","title_slug":"number-of-common-factors","rating":1172.0548998046,"_hash":1853208613,"paid_only":false,"cont_title":"第 313 场周赛","cont_title_slug":"weekly-contest-313"},{"question_id":1046,"title":"最后一块石头的重量","title_slug":"last-stone-weight","rating":1172.6819789183,"_hash":1420036364,"paid_only":false,"cont_title":"第 137 场周赛","cont_title_slug":"weekly-contest-137"},{"question_id":922,"title":"按奇偶排序数组 II","title_slug":"sort-array-by-parity-ii","rating":1173.505926482,"_hash":3658913842,"paid_only":false,"cont_title":"第 106 场周赛","cont_title_slug":"weekly-contest-106"},{"question_id":2643,"title":"一最多的行","title_slug":"row-with-maximum-ones","rating":1174.3019990918,"_hash":950521557,"paid_only":false,"cont_title":"第 341 场周赛","cont_title_slug":"weekly-contest-341"},{"question_id":1773,"title":"统计匹配检索规则的物品数量","title_slug":"count-items-matching-a-rule","rating":1174.8589329736,"_hash":3589125798,"paid_only":false,"cont_title":"第 230 场周赛","cont_title_slug":"weekly-contest-230"},{"question_id":3019,"title":"按键变更的次数","title_slug":"number-of-changing-keys","rating":1175.5552151972,"_hash":3290623649,"paid_only":false,"cont_title":"第 382 场周赛","cont_title_slug":"weekly-contest-382"},{"question_id":1431,"title":"拥有最多糖果的孩子","title_slug":"kids-with-the-greatest-number-of-candies","rating":1176.4547272896,"_hash":3057194499,"paid_only":false,"cont_title":"第 25 场双周赛","cont_title_slug":"biweekly-contest-25"},{"question_id":965,"title":"单值二叉树","title_slug":"univalued-binary-tree","rating":1177.5660617941,"_hash":472415307,"paid_only":false,"cont_title":"第 117 场周赛","cont_title_slug":"weekly-contest-117"},{"question_id":905,"title":"按奇偶排序数组","title_slug":"sort-array-by-parity","rating":1178.4942541235,"_hash":119654105,"paid_only":false,"cont_title":"第 102 场周赛","cont_title_slug":"weekly-contest-102"},{"question_id":2586,"title":"统计范围内的元音字符串数","title_slug":"count-the-number-of-vowel-strings-in-range","rating":1178.6580069402,"_hash":1405789151,"paid_only":false,"cont_title":"第 336 场周赛","cont_title_slug":"weekly-contest-336"},{"question_id":1287,"title":"有序数组中出现次数超过25%的元素","title_slug":"element-appearing-more-than-25-in-sorted-array","rating":1179.1495967491,"_hash":3348466517,"paid_only":false,"cont_title":"第 15 场双周赛","cont_title_slug":"biweekly-contest-15"},{"question_id":1441,"title":"用栈操作构建数组","title_slug":"build-an-array-with-stack-operations","rating":1180.3543157775,"_hash":1137656154,"paid_only":false,"cont_title":"第 188 场周赛","cont_title_slug":"weekly-contest-188"},{"question_id":3033,"title":"修改矩阵","title_slug":"modify-the-matrix","rating":1180.5927490268,"_hash":545408597,"paid_only":false,"cont_title":"第 384 场周赛","cont_title_slug":"weekly-contest-384"},{"question_id":1486,"title":"数组异或操作","title_slug":"xor-operation-in-an-array","rating":1180.923623906,"_hash":1038100878,"paid_only":false,"cont_title":"第 194 场周赛","cont_title_slug":"weekly-contest-194"},{"question_id":852,"title":"山脉数组的峰顶索引","title_slug":"peak-index-in-a-mountain-array","rating":1181.5839867359,"_hash":2285522737,"paid_only":false,"cont_title":"第 89 场周赛","cont_title_slug":"weekly-contest-89"},{"question_id":1189,"title":"“气球” 的最大数量","title_slug":"maximum-number-of-balloons","rating":1181.9716216714,"_hash":475209872,"paid_only":false,"cont_title":"第 154 场周赛","cont_title_slug":"weekly-contest-154"},{"question_id":2942,"title":"查找包含给定字符的单词","title_slug":"find-words-containing-character","rating":1182.2102562446,"_hash":3830794143,"paid_only":false,"cont_title":"第 118 场双周赛","cont_title_slug":"biweekly-contest-118"},{"question_id":2652,"title":"倍数求和","title_slug":"sum-multiples","rating":1182.3093772964,"_hash":1017096056,"paid_only":false,"cont_title":"第 342 场周赛","cont_title_slug":"weekly-contest-342"},{"question_id":1672,"title":"最富有客户的资产总量","title_slug":"richest-customer-wealth","rating":1182.6489068544,"_hash":1487915794,"paid_only":false,"cont_title":"第 217 场周赛","cont_title_slug":"weekly-contest-217"},{"question_id":2544,"title":"交替数字和","title_slug":"alternating-digit-sum","rating":1184.3385083575,"_hash":833954016,"paid_only":false,"cont_title":"第 329 场周赛","cont_title_slug":"weekly-contest-329"},{"question_id":1979,"title":"找出数组的最大公约数","title_slug":"find-greatest-common-divisor-of-array","rating":1184.4264833435,"_hash":2688612867,"paid_only":false,"cont_title":"第 255 场周赛","cont_title_slug":"weekly-contest-255"},{"question_id":2341,"title":"数组能形成多少数对","title_slug":"maximum-number-of-pairs-in-array","rating":1184.795721284,"_hash":2572867035,"paid_only":false,"cont_title":"第 302 场周赛","cont_title_slug":"weekly-contest-302"},{"question_id":2974,"title":"最小数字游戏","title_slug":"minimum-number-game","rating":1184.8359383057,"_hash":760662992,"paid_only":false,"cont_title":"第 377 场周赛","cont_title_slug":"weekly-contest-377"},{"question_id":2119,"title":"反转两次的数字","title_slug":"a-number-after-a-double-reversal","rating":1187.1344261572,"_hash":1952470548,"paid_only":false,"cont_title":"第 273 场周赛","cont_title_slug":"weekly-contest-273"},{"question_id":1880,"title":"检查某单词是否等于两单词之和","title_slug":"check-if-word-equals-summation-of-two-words","rating":1187.1641565458,"_hash":2621107821,"paid_only":false,"cont_title":"第 243 场周赛","cont_title_slug":"weekly-contest-243"},{"question_id":1122,"title":"数组的相对排序","title_slug":"relative-sort-array","rating":1188.6311093158,"_hash":509756552,"paid_only":false,"cont_title":"第 145 场周赛","cont_title_slug":"weekly-contest-145"},{"question_id":2951,"title":"找出峰值","title_slug":"find-the-peaks","rating":1189.4358388136,"_hash":518714509,"paid_only":false,"cont_title":"第 374 场周赛","cont_title_slug":"weekly-contest-374"},{"question_id":2769,"title":"找出最大的可达成数字","title_slug":"find-the-maximum-achievable-number","rating":1191.3681720998,"_hash":2491402608,"paid_only":false,"cont_title":"第 353 场周赛","cont_title_slug":"weekly-contest-353"},{"question_id":1436,"title":"旅行终点站","title_slug":"destination-city","rating":1192.3167969426,"_hash":3794347985,"paid_only":false,"cont_title":"第 187 场周赛","cont_title_slug":"weekly-contest-187"},{"question_id":2810,"title":"故障键盘","title_slug":"faulty-keyboard","rating":1192.9770230345,"_hash":3177194252,"paid_only":false,"cont_title":"第 357 场周赛","cont_title_slug":"weekly-contest-357"},{"question_id":2418,"title":"按身高排序","title_slug":"sort-the-people","rating":1193.0585534828,"_hash":4022402413,"paid_only":false,"cont_title":"第 312 场周赛","cont_title_slug":"weekly-contest-312"},{"question_id":1528,"title":"重新排列字符串","title_slug":"shuffle-string","rating":1193.1328299324,"_hash":3940769236,"paid_only":false,"cont_title":"第 199 场周赛","cont_title_slug":"weekly-contest-199"},{"question_id":1437,"title":"是否所有 1 都至少相隔 k 个元素","title_slug":"check-if-all-1s-are-at-least-length-k-places-away","rating":1193.2687290573,"_hash":439231056,"paid_only":false,"cont_title":"第 187 场周赛","cont_title_slug":"weekly-contest-187"},{"question_id":1323,"title":"6 和 9 组成的最大数字","title_slug":"maximum-69-number","rating":1193.9819783429,"_hash":2988189921,"paid_only":false,"cont_title":"第 172 场周赛","cont_title_slug":"weekly-contest-172"},{"question_id":1207,"title":"独一无二的出现次数","title_slug":"unique-number-of-occurrences","rating":1195.7512695571,"_hash":3437227213,"paid_only":false,"cont_title":"第 156 场周赛","cont_title_slug":"weekly-contest-156"},{"question_id":2529,"title":"正整数和负整数的最大计数","title_slug":"maximum-count-of-positive-integer-and-negative-integer","rating":1195.9731842298,"_hash":770550829,"paid_only":false,"cont_title":"第 327 场周赛","cont_title_slug":"weekly-contest-327"},{"question_id":985,"title":"查询后的偶数和","title_slug":"sum-of-even-numbers-after-queries","rating":1198.4180401014,"_hash":2841881996,"paid_only":false,"cont_title":"第 122 场周赛","cont_title_slug":"weekly-contest-122"},{"question_id":1200,"title":"最小绝对差","title_slug":"minimum-absolute-difference","rating":1198.5705825982,"_hash":2380816309,"paid_only":false,"cont_title":"第 155 场周赛","cont_title_slug":"weekly-contest-155"},{"question_id":2678,"title":"老人的数目","title_slug":"number-of-senior-citizens","rating":1198.8420836551,"_hash":881741713,"paid_only":false,"cont_title":"第 104 场双周赛","cont_title_slug":"biweekly-contest-104"},{"question_id":1165,"title":"单行键盘","title_slug":"single-row-keyboard","rating":1199.2392672964,"_hash":3054721758,"paid_only":false,"cont_title":"第 7 场双周赛","cont_title_slug":"biweekly-contest-7"},{"question_id":929,"title":"独特的电子邮件地址","title_slug":"unique-email-addresses","rating":1199.2892732505,"_hash":3531395010,"paid_only":false,"cont_title":"第 108 场周赛","cont_title_slug":"weekly-contest-108"},{"question_id":1154,"title":"一年中的第几天","title_slug":"day-of-the-year","rating":1199.4427635582,"_hash":694594451,"paid_only":false,"cont_title":"第 149 场周赛","cont_title_slug":"weekly-contest-149"},{"question_id":2000,"title":"反转单词前缀","title_slug":"reverse-prefix-of-word","rating":1199.4477805501,"_hash":3147357769,"paid_only":false,"cont_title":"第 258 场周赛","cont_title_slug":"weekly-contest-258"},{"question_id":2169,"title":"得到 0 的操作数","title_slug":"count-operations-to-obtain-zero","rating":1199.8592887103,"_hash":3445184694,"paid_only":false,"cont_title":"第 280 场周赛","cont_title_slug":"weekly-contest-280"},{"question_id":2319,"title":"判断矩阵是否是一个 X 矩阵","title_slug":"check-if-matrix-is-x-matrix","rating":1200.9464053417,"_hash":3722557865,"paid_only":false,"cont_title":"第 299 场周赛","cont_title_slug":"weekly-contest-299"},{"question_id":1491,"title":"去掉最低工资和最高工资后的工资平均值","title_slug":"average-salary-excluding-the-minimum-and-maximum-salary","rating":1201.3497763919,"_hash":4253187558,"paid_only":false,"cont_title":"第 29 场双周赛","cont_title_slug":"biweekly-contest-29"},{"question_id":997,"title":"找到小镇的法官","title_slug":"find-the-town-judge","rating":1201.6117337798,"_hash":588772553,"paid_only":false,"cont_title":"第 125 场周赛","cont_title_slug":"weekly-contest-125"},{"question_id":2124,"title":"检查是否所有 A 都在 B 之前","title_slug":"check-if-all-as-appears-before-all-bs","rating":1201.7686271329,"_hash":2946534771,"paid_only":false,"cont_title":"第 274 场周赛","cont_title_slug":"weekly-contest-274"},{"question_id":2148,"title":"元素计数","title_slug":"count-elements-with-strictly-smaller-and-greater-elements","rating":1201.8730954169,"_hash":1449021558,"paid_only":false,"cont_title":"第 277 场周赛","cont_title_slug":"weekly-contest-277"},{"question_id":2367,"title":"算术三元组的数目","title_slug":"number-of-arithmetic-triplets","rating":1203.0737869081,"_hash":2088822497,"paid_only":false,"cont_title":"第 305 场周赛","cont_title_slug":"weekly-contest-305"},{"question_id":1688,"title":"比赛中的配对次数","title_slug":"count-of-matches-in-tournament","rating":1203.1408035909,"_hash":4026864126,"paid_only":false,"cont_title":"第 219 场周赛","cont_title_slug":"weekly-contest-219"},{"question_id":1952,"title":"三除数","title_slug":"three-divisors","rating":1203.7504950404,"_hash":324872429,"paid_only":false,"cont_title":"第 252 场周赛","cont_title_slug":"weekly-contest-252"},{"question_id":1869,"title":"哪种连续子字符串更长","title_slug":"longer-contiguous-segments-of-ones-than-zeros","rating":1204.9864820183,"_hash":4125612782,"paid_only":false,"cont_title":"第 242 场周赛","cont_title_slug":"weekly-contest-242"},{"question_id":1160,"title":"拼写单词","title_slug":"find-words-that-can-be-formed-by-characters","rating":1205.6698455508,"_hash":3021409572,"paid_only":false,"cont_title":"第 150 场周赛","cont_title_slug":"weekly-contest-150"},{"question_id":2574,"title":"左右元素和的差值","title_slug":"left-and-right-sum-differences","rating":1206.0712568518,"_hash":95938088,"paid_only":false,"cont_title":"第 334 场周赛","cont_title_slug":"weekly-contest-334"},{"question_id":1784,"title":"检查二进制字符串字段","title_slug":"check-if-binary-string-has-at-most-one-segment-of-ones","rating":1206.1240971343,"_hash":3988446663,"paid_only":false,"cont_title":"第 231 场周赛","cont_title_slug":"weekly-contest-231"},{"question_id":2595,"title":"奇偶位数","title_slug":"number-of-even-and-odd-bits","rating":1206.5675296817,"_hash":223285376,"paid_only":false,"cont_title":"第 337 场周赛","cont_title_slug":"weekly-contest-337"},{"question_id":2485,"title":"找出中枢整数","title_slug":"find-the-pivot-integer","rating":1207.3151378208,"_hash":2384194086,"paid_only":false,"cont_title":"第 321 场周赛","cont_title_slug":"weekly-contest-321"},{"question_id":1704,"title":"判断字符串的两半是否相似","title_slug":"determine-if-string-halves-are-alike","rating":1207.7224406285,"_hash":611100168,"paid_only":false,"cont_title":"第 221 场周赛","cont_title_slug":"weekly-contest-221"},{"question_id":2215,"title":"找出两数组的不同","title_slug":"find-the-difference-of-two-arrays","rating":1207.748239075,"_hash":1409344146,"paid_only":false,"cont_title":"第 286 场周赛","cont_title_slug":"weekly-contest-286"},{"question_id":2706,"title":"购买两块巧克力","title_slug":"buy-two-chocolates","rating":1207.7491943483,"_hash":2844316244,"paid_only":false,"cont_title":"第 105 场双周赛","cont_title_slug":"biweekly-contest-105"},{"question_id":1380,"title":"矩阵中的幸运数","title_slug":"lucky-numbers-in-a-matrix","rating":1207.7810914125,"_hash":2306188300,"paid_only":false,"cont_title":"第 180 场周赛","cont_title_slug":"weekly-contest-180"},{"question_id":941,"title":"有效的山脉数组","title_slug":"valid-mountain-array","rating":1208.0130656905,"_hash":4212893423,"paid_only":false,"cont_title":"第 111 场周赛","cont_title_slug":"weekly-contest-111"},{"question_id":1389,"title":"按既定顺序创建目标数组","title_slug":"create-target-array-in-the-given-order","rating":1208.0417047337,"_hash":1969742700,"paid_only":false,"cont_title":"第 181 场周赛","cont_title_slug":"weekly-contest-181"},{"question_id":1523,"title":"在区间范围内统计奇数数目","title_slug":"count-odd-numbers-in-an-interval-range","rating":1209.3722198224,"_hash":1294188975,"paid_only":false,"cont_title":"第 31 场双周赛","cont_title_slug":"biweekly-contest-31"},{"question_id":1822,"title":"数组元素积的符号","title_slug":"sign-of-the-product-of-an-array","rating":1209.6571020247,"_hash":428851356,"paid_only":false,"cont_title":"第 236 场周赛","cont_title_slug":"weekly-contest-236"},{"question_id":1413,"title":"逐步求和得到正数的最小值","title_slug":"minimum-value-to-get-positive-step-by-step-sum","rating":1212.2309421538,"_hash":3593932314,"paid_only":false,"cont_title":"第 24 场双周赛","cont_title_slug":"biweekly-contest-24"},{"question_id":1475,"title":"商品折扣后的最终价格","title_slug":"final-prices-with-a-special-discount-in-a-shop","rating":1212.2606422181,"_hash":3670047480,"paid_only":false,"cont_title":"第 28 场双周赛","cont_title_slug":"biweekly-contest-28"},{"question_id":2656,"title":"K 个元素的最大和","title_slug":"maximum-sum-with-exactly-k-elements","rating":1213.4070467355,"_hash":2193040547,"paid_only":false,"cont_title":"第 103 场双周赛","cont_title_slug":"biweekly-contest-103"},{"question_id":973,"title":"最接近原点的 K 个点","title_slug":"k-closest-points-to-origin","rating":1213.8073621345,"_hash":4289106415,"paid_only":false,"cont_title":"第 119 场周赛","cont_title_slug":"weekly-contest-119"},{"question_id":2956,"title":"找到两个数组中的公共元素","title_slug":"find-common-elements-between-two-arrays","rating":1214.542864891,"_hash":1894806233,"paid_only":false,"cont_title":"第 119 场双周赛","cont_title_slug":"biweekly-contest-119"},{"question_id":2806,"title":"取整购买后的账户余额","title_slug":"account-balance-after-rounded-purchase","rating":1214.703724776,"_hash":2948030094,"paid_only":false,"cont_title":"第 110 场双周赛","cont_title_slug":"biweekly-contest-110"},{"question_id":2108,"title":"找出数组中的第一个回文字符串","title_slug":"find-first-palindromic-string-in-the-array","rating":1215.7443346869,"_hash":770308924,"paid_only":false,"cont_title":"第 272 场周赛","cont_title_slug":"weekly-contest-272"},{"question_id":2176,"title":"统计数组中相等且可以被整除的数对","title_slug":"count-equal-and-divisible-pairs-in-an-array","rating":1215.7827321325,"_hash":3400286463,"paid_only":false,"cont_title":"第 72 场双周赛","cont_title_slug":"biweekly-contest-72"},{"question_id":2553,"title":"分割数组中数字的数位","title_slug":"separate-the-digits-in-an-array","rating":1216.612918849,"_hash":1493116499,"paid_only":false,"cont_title":"第 97 场双周赛","cont_title_slug":"biweekly-contest-97"},{"question_id":1848,"title":"到目标元素的最小距离","title_slug":"minimum-distance-to-the-target-element","rating":1216.6376846517,"_hash":933877486,"paid_only":false,"cont_title":"第 239 场周赛","cont_title_slug":"weekly-contest-239"},{"question_id":3005,"title":"最大频率元素计数","title_slug":"count-elements-with-maximum-frequency","rating":1216.9550221615,"_hash":2937149161,"paid_only":false,"cont_title":"第 380 场周赛","cont_title_slug":"weekly-contest-380"},{"question_id":1662,"title":"检查两个字符串数组是否相等","title_slug":"check-if-two-string-arrays-are-equivalent","rating":1217.1184374247,"_hash":340499017,"paid_only":false,"cont_title":"第 216 场周赛","cont_title_slug":"weekly-contest-216"},{"question_id":2859,"title":"计算 K 置位下标对应元素的和","title_slug":"sum-of-values-at-indices-with-k-set-bits","rating":1218.1083231462,"_hash":787489678,"paid_only":false,"cont_title":"第 363 场周赛","cont_title_slug":"weekly-contest-363"},{"question_id":2442,"title":"反转之后不同整数的数目","title_slug":"count-number-of-distinct-integers-after-reverse-operations","rating":1218.9011436003,"_hash":2907477166,"paid_only":false,"cont_title":"第 315 场周赛","cont_title_slug":"weekly-contest-315"},{"question_id":1299,"title":"将每个元素替换为右侧最大元素","title_slug":"replace-elements-with-greatest-element-on-right-side","rating":1219.4252907184,"_hash":4131453232,"paid_only":false,"cont_title":"第 16 场双周赛","cont_title_slug":"biweekly-contest-16"},{"question_id":1221,"title":"分割平衡字符串","title_slug":"split-a-string-in-balanced-strings","rating":1219.5284561367,"_hash":74188793,"paid_only":false,"cont_title":"第 158 场周赛","cont_title_slug":"weekly-contest-158"},{"question_id":1550,"title":"存在连续三个奇数的数组","title_slug":"three-consecutive-odds","rating":1221.6801628274,"_hash":3686317773,"paid_only":false,"cont_title":"第 202 场周赛","cont_title_slug":"weekly-contest-202"},{"question_id":2414,"title":"最长的字母序连续子字符串的长度","title_slug":"length-of-the-longest-alphabetical-continuous-substring","rating":1221.8477681772,"_hash":3354310865,"paid_only":false,"cont_title":"第 311 场周赛","cont_title_slug":"weekly-contest-311"},{"question_id":1678,"title":"设计 Goal 解析器","title_slug":"goal-parser-interpretation","rating":1221.9872943569,"_hash":4227366527,"paid_only":false,"cont_title":"第 218 场周赛","cont_title_slug":"weekly-contest-218"},{"question_id":2535,"title":"数组元素和与数字和的绝对差","title_slug":"difference-between-element-sum-and-digit-sum-of-an-array","rating":1222.2354919459,"_hash":1732202044,"paid_only":false,"cont_title":"第 328 场周赛","cont_title_slug":"weekly-contest-328"},{"question_id":1408,"title":"数组中的字符串匹配","title_slug":"string-matching-in-an-array","rating":1223.3861903833,"_hash":2154696316,"paid_only":false,"cont_title":"第 184 场周赛","cont_title_slug":"weekly-contest-184"},{"question_id":2206,"title":"将数组划分成相等数对","title_slug":"divide-array-into-equal-pairs","rating":1223.406570396,"_hash":523951328,"paid_only":false,"cont_title":"第 74 场双周赛","cont_title_slug":"biweekly-contest-74"},{"question_id":2460,"title":"对数组执行操作","title_slug":"apply-operations-to-an-array","rating":1223.9335618833,"_hash":389978318,"paid_only":false,"cont_title":"第 318 场周赛","cont_title_slug":"weekly-contest-318"},{"question_id":1337,"title":"矩阵中战斗力最弱的 K 行","title_slug":"the-k-weakest-rows-in-a-matrix","rating":1224.7606792444,"_hash":1486913577,"paid_only":false,"cont_title":"第 174 场周赛","cont_title_slug":"weekly-contest-174"},{"question_id":1346,"title":"检查整数及其两倍数是否存在","title_slug":"check-if-n-and-its-double-exist","rating":1225.3601348675,"_hash":174306863,"paid_only":false,"cont_title":"第 175 场周赛","cont_title_slug":"weekly-contest-175"},{"question_id":2357,"title":"使数组中所有元素都等于零","title_slug":"make-array-zero-by-subtracting-equal-amounts","rating":1225.3923012413,"_hash":1650421130,"paid_only":false,"cont_title":"第 304 场周赛","cont_title_slug":"weekly-contest-304"},{"question_id":1133,"title":"最大唯一数","title_slug":"largest-unique-number","rating":1226.2960135431,"_hash":3008054233,"paid_only":false,"cont_title":"第 5 场双周赛","cont_title_slug":"biweekly-contest-5"},{"question_id":1935,"title":"可以输入的最大单词数","title_slug":"maximum-number-of-words-you-can-type","rating":1226.8332278145,"_hash":3926884655,"paid_only":false,"cont_title":"第 250 场周赛","cont_title_slug":"weekly-contest-250"},{"question_id":1118,"title":"一月有多少天","title_slug":"number-of-days-in-a-month","rating":1227.3485530532,"_hash":3564822043,"paid_only":false,"cont_title":"第 4 场双周赛","cont_title_slug":"biweekly-contest-4"},{"question_id":844,"title":"比较含退格的字符串","title_slug":"backspace-string-compare","rating":1227.7906887239,"_hash":941716720,"paid_only":false,"cont_title":"第 87 场周赛","cont_title_slug":"weekly-contest-87"},{"question_id":2729,"title":"判断一个数是否迷人","title_slug":"check-if-the-number-is-fascinating","rating":1227.91037348,"_hash":3509092584,"paid_only":false,"cont_title":"第 106 场双周赛","cont_title_slug":"biweekly-contest-106"},{"question_id":1748,"title":"唯一元素的和","title_slug":"sum-of-unique-elements","rating":1228.4824438011,"_hash":1179475752,"paid_only":false,"cont_title":"第 45 场双周赛","cont_title_slug":"biweekly-contest-45"},{"question_id":917,"title":"仅仅反转字母","title_slug":"reverse-only-letters","rating":1228.630993648,"_hash":2941821802,"paid_only":false,"cont_title":"第 105 场周赛","cont_title_slug":"weekly-contest-105"},{"question_id":1800,"title":"最大升序子数组和","title_slug":"maximum-ascending-subarray-sum","rating":1229.1709574783,"_hash":165157096,"paid_only":false,"cont_title":"第 233 场周赛","cont_title_slug":"weekly-contest-233"},{"question_id":1725,"title":"可以形成最大正方形的矩形数目","title_slug":"number-of-rectangles-that-can-form-the-largest-square","rating":1229.4850365142,"_hash":2365828386,"paid_only":false,"cont_title":"第 224 场周赛","cont_title_slug":"weekly-contest-224"},{"question_id":2848,"title":"与车相交的点","title_slug":"points-that-intersect-with-cars","rating":1229.7575626899,"_hash":1241705093,"paid_only":false,"cont_title":"第 362 场周赛","cont_title_slug":"weekly-contest-362"},{"question_id":1134,"title":"阿姆斯特朗数","title_slug":"armstrong-number","rating":1231.4004525633,"_hash":391342400,"paid_only":false,"cont_title":"第 5 场双周赛","cont_title_slug":"biweekly-contest-5"},{"question_id":876,"title":"链表的中间结点","title_slug":"middle-of-the-linked-list","rating":1231.6157956848,"_hash":2188606245,"paid_only":false,"cont_title":"第 95 场周赛","cont_title_slug":"weekly-contest-95"},{"question_id":1967,"title":"作为子字符串出现在单词中的字符串数目","title_slug":"number-of-strings-that-appear-as-substrings-in-word","rating":1231.8671440198,"_hash":3091785544,"paid_only":false,"cont_title":"第 254 场周赛","cont_title_slug":"weekly-contest-254"},{"question_id":1492,"title":"n 的第 k 个因子","title_slug":"the-kth-factor-of-n","rating":1231.999241335,"_hash":2168825861,"paid_only":false,"cont_title":"第 29 场双周赛","cont_title_slug":"biweekly-contest-29"},{"question_id":1119,"title":"删去字符串中的元音","title_slug":"remove-vowels-from-a-string","rating":1232.8314427996,"_hash":1547394567,"paid_only":false,"cont_title":"第 4 场双周赛","cont_title_slug":"biweekly-contest-4"},{"question_id":2980,"title":"检查按位或是否存在尾随零","title_slug":"check-if-bitwise-or-has-trailing-zeros","rating":1233.5034839998,"_hash":2184297331,"paid_only":false,"cont_title":"第 378 场周赛","cont_title_slug":"weekly-contest-378"},{"question_id":1961,"title":"检查字符串是否为数组前缀","title_slug":"check-if-string-is-a-prefix-of-array","rating":1234.058537565,"_hash":32848909,"paid_only":false,"cont_title":"第 253 场周赛","cont_title_slug":"weekly-contest-253"},{"question_id":1184,"title":"公交站间的距离","title_slug":"distance-between-bus-stops","rating":1234.4144116814,"_hash":1149087220,"paid_only":false,"cont_title":"第 153 场周赛","cont_title_slug":"weekly-contest-153"},{"question_id":1009,"title":"十进制整数的反码","title_slug":"complement-of-base-10-integer","rating":1234.7084656358,"_hash":2765939834,"paid_only":false,"cont_title":"第 128 场周赛","cont_title_slug":"weekly-contest-128"},{"question_id":989,"title":"数组形式的整数加法","title_slug":"add-to-array-form-of-integer","rating":1234.7692637513,"_hash":2582233376,"paid_only":false,"cont_title":"第 123 场周赛","cont_title_slug":"weekly-contest-123"},{"question_id":1385,"title":"两个数组间的距离值","title_slug":"find-the-distance-value-between-two-arrays","rating":1234.8049089605,"_hash":3833659931,"paid_only":false,"cont_title":"第 22 场双周赛","cont_title_slug":"biweekly-contest-22"},{"question_id":1816,"title":"截断句子","title_slug":"truncate-sentence","rating":1235.6114196155,"_hash":1592995979,"paid_only":false,"cont_title":"第 235 场周赛","cont_title_slug":"weekly-contest-235"},{"question_id":2923,"title":"找到冠军 I","title_slug":"find-champion-i","rating":1235.6484230513,"_hash":3876397144,"paid_only":false,"cont_title":"第 370 场周赛","cont_title_slug":"weekly-contest-370"},{"question_id":2154,"title":"将找到的值乘以 2","title_slug":"keep-multiplying-found-values-by-two","rating":1235.8413685224,"_hash":103871786,"paid_only":false,"cont_title":"第 278 场周赛","cont_title_slug":"weekly-contest-278"},{"question_id":2149,"title":"按符号重排数组","title_slug":"rearrange-array-elements-by-sign","rating":1235.9216009709,"_hash":3029042062,"paid_only":false,"cont_title":"第 277 场周赛","cont_title_slug":"weekly-contest-277"},{"question_id":2864,"title":"最大二进制奇数","title_slug":"maximum-odd-binary-number","rating":1237.693464609,"_hash":3521652117,"paid_only":false,"cont_title":"第 364 场周赛","cont_title_slug":"weekly-contest-364"},{"question_id":1422,"title":"分割字符串的最大得分","title_slug":"maximum-score-after-splitting-a-string","rating":1237.7565585875,"_hash":3778856012,"paid_only":false,"cont_title":"第 186 场周赛","cont_title_slug":"weekly-contest-186"},{"question_id":2788,"title":"按分隔符拆分字符串","title_slug":"split-strings-by-separator","rating":1239.1621762681,"_hash":436025572,"paid_only":false,"cont_title":"第 355 场周赛","cont_title_slug":"weekly-contest-355"},{"question_id":2078,"title":"两栋颜色不同且距离最远的房子","title_slug":"two-furthest-houses-with-different-colors","rating":1240.829758176,"_hash":3119137809,"paid_only":false,"cont_title":"第 268 场周赛","cont_title_slug":"weekly-contest-268"},{"question_id":2293,"title":"极大极小游戏","title_slug":"min-max-game","rating":1241.0825147417,"_hash":399050701,"paid_only":false,"cont_title":"第 296 场周赛","cont_title_slug":"weekly-contest-296"},{"question_id":2299,"title":"强密码检验器 II","title_slug":"strong-password-checker-ii","rating":1241.5396695569,"_hash":2569057399,"paid_only":false,"cont_title":"第 80 场双周赛","cont_title_slug":"biweekly-contest-80"},{"question_id":2347,"title":"最好的扑克手牌","title_slug":"best-poker-hand","rating":1241.5645130241,"_hash":3960620247,"paid_only":false,"cont_title":"第 83 场双周赛","cont_title_slug":"biweekly-contest-83"},{"question_id":2605,"title":"从两个数字数组里生成最小数字","title_slug":"form-smallest-number-from-two-digit-arrays","rating":1241.5775825621,"_hash":1927271954,"paid_only":false,"cont_title":"第 101 场双周赛","cont_title_slug":"biweekly-contest-101"},{"question_id":1417,"title":"重新格式化字符串","title_slug":"reformat-the-string","rating":1241.9262857175,"_hash":3440205245,"paid_only":false,"cont_title":"第 185 场周赛","cont_title_slug":"weekly-contest-185"},{"question_id":921,"title":"使括号有效的最少添加","title_slug":"minimum-add-to-make-parentheses-valid","rating":1242.4710735813,"_hash":3288770916,"paid_only":false,"cont_title":"第 106 场周赛","cont_title_slug":"weekly-contest-106"},{"question_id":1941,"title":"检查是否所有字符出现次数相同","title_slug":"check-if-all-characters-have-equal-number-of-occurrences","rating":1242.6172898768,"_hash":2694237057,"paid_only":false,"cont_title":"第 57 场双周赛","cont_title_slug":"biweekly-contest-57"},{"question_id":2309,"title":"兼具大小写的最好英文字母","title_slug":"greatest-english-letter-in-upper-and-lower-case","rating":1242.8939284628,"_hash":1610031866,"paid_only":false,"cont_title":"第 298 场周赛","cont_title_slug":"weekly-contest-298"},{"question_id":2716,"title":"最小化字符串长度","title_slug":"minimize-string-length","rating":1242.9383307344,"_hash":2836390896,"paid_only":false,"cont_title":"第 348 场周赛","cont_title_slug":"weekly-contest-348"},{"question_id":832,"title":"翻转图像","title_slug":"flipping-an-image","rating":1243.1009943284,"_hash":715235362,"paid_only":false,"cont_title":"第 84 场周赛","cont_title_slug":"weekly-contest-84"},{"question_id":2399,"title":"检查相同字母间的距离","title_slug":"check-distances-between-same-letters","rating":1243.6250741657,"_hash":1515775640,"paid_only":false,"cont_title":"第 309 场周赛","cont_title_slug":"weekly-contest-309"},{"question_id":1228,"title":"等差数列中缺失的数字","title_slug":"missing-number-in-arithmetic-progression","rating":1244.317367883,"_hash":1225270682,"paid_only":false,"cont_title":"第 11 场双周赛","cont_title_slug":"biweekly-contest-11"},{"question_id":2965,"title":"找出缺失和重复的数字","title_slug":"find-missing-and-repeated-values","rating":1244.8064626533,"_hash":2875235685,"paid_only":false,"cont_title":"第 376 场周赛","cont_title_slug":"weekly-contest-376"},{"question_id":1099,"title":"小于 K 的两数之和","title_slug":"two-sum-less-than-k","rating":1245.2741257148,"_hash":1002673857,"paid_only":false,"cont_title":"第 3 场双周赛","cont_title_slug":"biweekly-contest-3"},{"question_id":1518,"title":"换水问题","title_slug":"water-bottles","rating":1245.2999833877,"_hash":2655862888,"paid_only":false,"cont_title":"第 198 场周赛","cont_title_slug":"weekly-contest-198"},{"question_id":2016,"title":"增量元素之间的最大差值","title_slug":"maximum-difference-between-increasing-elements","rating":1246.0141927368,"_hash":3044209556,"paid_only":false,"cont_title":"第 260 场周赛","cont_title_slug":"weekly-contest-260"},{"question_id":2481,"title":"分割圆的最少切割次数","title_slug":"minimum-cuts-to-divide-a-circle","rating":1246.0341186297,"_hash":2329981708,"paid_only":false,"cont_title":"第 92 场双周赛","cont_title_slug":"biweekly-contest-92"},{"question_id":2932,"title":"找出强数对的最大异或值 I","title_slug":"maximum-strong-pair-xor-i","rating":1246.3593898992,"_hash":3074518984,"paid_only":false,"cont_title":"第 371 场周赛","cont_title_slug":"weekly-contest-371"},{"question_id":1232,"title":"缀点成线","title_slug":"check-if-it-is-a-straight-line","rating":1247.3198836387,"_hash":4130908576,"paid_only":false,"cont_title":"第 159 场周赛","cont_title_slug":"weekly-contest-159"},{"question_id":1876,"title":"长度为三且各字符不同的子字符串","title_slug":"substrings-of-size-three-with-distinct-characters","rating":1248.7224675206,"_hash":2754546565,"paid_only":false,"cont_title":"第 53 场双周赛","cont_title_slug":"biweekly-contest-53"},{"question_id":1196,"title":"最多可以买到的苹果数量","title_slug":"how-many-apples-can-you-put-into-the-basket","rating":1248.8026990632,"_hash":3037047822,"paid_only":false,"cont_title":"第 9 场双周赛","cont_title_slug":"biweekly-contest-9"},{"question_id":1903,"title":"字符串中的最大奇数","title_slug":"largest-odd-number-in-string","rating":1248.8547072235,"_hash":946660529,"paid_only":false,"cont_title":"第 246 场周赛","cont_title_slug":"weekly-contest-246"},{"question_id":2279,"title":"装满石头的背包的最大数量","title_slug":"maximum-bags-with-full-capacity-of-rocks","rating":1249.2572200035,"_hash":2055099648,"paid_only":false,"cont_title":"第 294 场周赛","cont_title_slug":"weekly-contest-294"},{"question_id":2540,"title":"最小公共值","title_slug":"minimum-common-value","rating":1249.7515196656,"_hash":2913358439,"paid_only":false,"cont_title":"第 96 场双周赛","cont_title_slug":"biweekly-contest-96"},{"question_id":3000,"title":"对角线最长的矩形的面积","title_slug":"maximum-area-of-longest-diagonal-rectangle","rating":1249.7770522505,"_hash":1069078430,"paid_only":false,"cont_title":"第 379 场周赛","cont_title_slug":"weekly-contest-379"},{"question_id":2395,"title":"和相等的子数组","title_slug":"find-subarrays-with-equal-sum","rating":1249.8425270142,"_hash":2578600625,"paid_only":false,"cont_title":"第 86 场双周赛","cont_title_slug":"biweekly-contest-86"},{"question_id":1161,"title":"最大层内元素和","title_slug":"maximum-level-sum-of-a-binary-tree","rating":1249.9086403595,"_hash":1692861209,"paid_only":false,"cont_title":"第 150 场周赛","cont_title_slug":"weekly-contest-150"},{"question_id":1150,"title":"检查一个数是否在数组中占绝大多数","title_slug":"check-if-a-number-is-majority-element-in-a-sorted-array","rating":1249.9947800752,"_hash":1627868267,"paid_only":false,"cont_title":"第 6 场双周赛","cont_title_slug":"biweekly-contest-6"},{"question_id":2465,"title":"不同的平均值数目","title_slug":"number-of-distinct-averages","rating":1250.0975318308,"_hash":2621480860,"paid_only":false,"cont_title":"第 91 场双周赛","cont_title_slug":"biweekly-contest-91"},{"question_id":2315,"title":"统计星号","title_slug":"count-asterisks","rating":1250.8974254752,"_hash":963523596,"paid_only":false,"cont_title":"第 81 场双周赛","cont_title_slug":"biweekly-contest-81"},{"question_id":830,"title":"较大分组的位置","title_slug":"positions-of-large-groups","rating":1251.822378691,"_hash":836765096,"paid_only":false,"cont_title":"第 83 场周赛","cont_title_slug":"weekly-contest-83"},{"question_id":1833,"title":"雪糕的最大数量","title_slug":"maximum-ice-cream-bars","rating":1252.7479413966,"_hash":3346548045,"paid_only":false,"cont_title":"第 237 场周赛","cont_title_slug":"weekly-contest-237"},{"question_id":2164,"title":"对奇偶下标分别排序","title_slug":"sort-even-and-odd-indices-independently","rating":1252.8406166148,"_hash":618419204,"paid_only":false,"cont_title":"第 279 场周赛","cont_title_slug":"weekly-contest-279"},{"question_id":2186,"title":"制造字母异位词的最小步骤数 II","title_slug":"minimum-number-of-steps-to-make-two-strings-anagram-ii","rating":1253.1107481745,"_hash":1067400091,"paid_only":false,"cont_title":"第 282 场周赛","cont_title_slug":"weekly-contest-282"},{"question_id":2194,"title":"Excel 表中某个范围内的单元格","title_slug":"cells-in-a-range-on-an-excel-sheet","rating":1253.1463945043,"_hash":1475483634,"paid_only":false,"cont_title":"第 283 场周赛","cont_title_slug":"weekly-contest-283"},{"question_id":2283,"title":"判断一个数的数字计数是否等于数位的值","title_slug":"check-if-number-has-equal-digit-count-and-digit-value","rating":1253.4847783954,"_hash":84450131,"paid_only":false,"cont_title":"第 79 场双周赛","cont_title_slug":"biweekly-contest-79"},{"question_id":2908,"title":"元素和最小的山形三元组 I","title_slug":"minimum-sum-of-mountain-triplets-i","rating":1253.5161450678,"_hash":1377831845,"paid_only":false,"cont_title":"第 368 场周赛","cont_title_slug":"weekly-contest-368"},{"question_id":1945,"title":"字符串转化后的各位数字之和","title_slug":"sum-of-digits-of-string-after-convert","rating":1254.8626139269,"_hash":199553622,"paid_only":false,"cont_title":"第 251 场周赛","cont_title_slug":"weekly-contest-251"},{"question_id":2475,"title":"数组中不等三元组的数目","title_slug":"number-of-unequal-triplets-in-array","rating":1255.5461825223,"_hash":1497402060,"paid_only":false,"cont_title":"第 320 场周赛","cont_title_slug":"weekly-contest-320"},{"question_id":1037,"title":"有效的回旋镖","title_slug":"valid-boomerang","rating":1255.9002796024,"_hash":2272805308,"paid_only":false,"cont_title":"第 135 场周赛","cont_title_slug":"weekly-contest-135"},{"question_id":2239,"title":"找到最接近 0 的数字","title_slug":"find-closest-number-to-zero","rating":1256.0514740971,"_hash":334656901,"paid_only":false,"cont_title":"第 76 场双周赛","cont_title_slug":"biweekly-contest-76"},{"question_id":1085,"title":"最小元素各数位之和","title_slug":"sum-of-digits-in-the-minimum-number","rating":1256.4891142083,"_hash":800569224,"paid_only":false,"cont_title":"第 2 场双周赛","cont_title_slug":"biweekly-contest-2"},{"question_id":1732,"title":"找到最高海拔","title_slug":"find-the-highest-altitude","rating":1256.6807087287,"_hash":445458274,"paid_only":false,"cont_title":"第 44 场双周赛","cont_title_slug":"biweekly-contest-44"},{"question_id":2180,"title":"统计各位数字之和为偶数的整数个数","title_slug":"count-integers-with-even-digit-sum","rating":1257.1166915286,"_hash":267587420,"paid_only":false,"cont_title":"第 281 场周赛","cont_title_slug":"weekly-contest-281"},{"question_id":2177,"title":"找到和为给定整数的三个连续整数","title_slug":"find-three-consecutive-integers-that-sum-to-a-given-number","rating":1257.1556875655,"_hash":177009894,"paid_only":false,"cont_title":"第 72 场双周赛","cont_title_slug":"biweekly-contest-72"},{"question_id":2042,"title":"检查句子中的数字是否递增","title_slug":"check-if-numbers-are-ascending-in-a-sentence","rating":1257.264923599,"_hash":335486990,"paid_only":false,"cont_title":"第 263 场周赛","cont_title_slug":"weekly-contest-263"},{"question_id":2114,"title":"句子中的最多单词数","title_slug":"maximum-number-of-words-found-in-sentences","rating":1257.323514611,"_hash":3609197847,"paid_only":false,"cont_title":"第 68 场双周赛","cont_title_slug":"biweekly-contest-68"},{"question_id":1309,"title":"解码字母到整数映射","title_slug":"decrypt-string-from-alphabet-to-integer-mapping","rating":1257.679633165,"_hash":504472069,"paid_only":false,"cont_title":"第 170 场周赛","cont_title_slug":"weekly-contest-170"},{"question_id":1356,"title":"根据数字二进制下 1 的数目排序","title_slug":"sort-integers-by-the-number-of-1-bits","rating":1257.7082143289,"_hash":3189584402,"paid_only":false,"cont_title":"第 20 场双周赛","cont_title_slug":"biweekly-contest-20"},{"question_id":2103,"title":"环和杆","title_slug":"rings-and-rods","rating":1257.7670945029,"_hash":2821965653,"paid_only":false,"cont_title":"第 271 场周赛","cont_title_slug":"weekly-contest-271"},{"question_id":2644,"title":"找出可整除性得分最大的整数","title_slug":"find-the-maximum-divisibility-score","rating":1257.8344655358,"_hash":1766481102,"paid_only":false,"cont_title":"第 341 场周赛","cont_title_slug":"weekly-contest-341"},{"question_id":896,"title":"单调数列","title_slug":"monotonic-array","rating":1258.6719675401,"_hash":161597751,"paid_only":false,"cont_title":"第 100 场周赛","cont_title_slug":"weekly-contest-100"},{"question_id":867,"title":"转置矩阵","title_slug":"transpose-matrix","rating":1258.8401788462,"_hash":638561610,"paid_only":false,"cont_title":"第 92 场周赛","cont_title_slug":"weekly-contest-92"},{"question_id":1213,"title":"三个有序数组的交集","title_slug":"intersection-of-three-sorted-arrays","rating":1259.1979660519,"_hash":1167766424,"paid_only":false,"cont_title":"第 10 场双周赛","cont_title_slug":"biweekly-contest-10"},{"question_id":2404,"title":"出现最频繁的偶数元素","title_slug":"most-frequent-even-element","rating":1259.3406231708,"_hash":484484283,"paid_only":false,"cont_title":"第 310 场周赛","cont_title_slug":"weekly-contest-310"},{"question_id":884,"title":"两句话中的不常见单词","title_slug":"uncommon-words-from-two-sentences","rating":1259.409726189,"_hash":4093059486,"paid_only":false,"cont_title":"第 97 场周赛","cont_title_slug":"weekly-contest-97"},{"question_id":1779,"title":"找到最近的有相同 X 或 Y 坐标的点","title_slug":"find-nearest-point-that-has-the-same-x-or-y-coordinate","rating":1259.5707438932,"_hash":2844126076,"paid_only":false,"cont_title":"第 47 场双周赛","cont_title_slug":"biweekly-contest-47"},{"question_id":2562,"title":"找出数组的串联值","title_slug":"find-the-array-concatenation-value","rating":1259.949137745,"_hash":2036642817,"paid_only":false,"cont_title":"第 332 场周赛","cont_title_slug":"weekly-contest-332"},{"question_id":1305,"title":"两棵二叉搜索树中的所有元素","title_slug":"all-elements-in-two-binary-search-trees","rating":1260.1755576607,"_hash":3750933244,"paid_only":false,"cont_title":"第 169 场周赛","cont_title_slug":"weekly-contest-169"},{"question_id":2520,"title":"统计能整除数字的位数","title_slug":"count-the-digits-that-divide-a-number","rating":1260.8697515006,"_hash":2323533689,"paid_only":false,"cont_title":"第 326 场周赛","cont_title_slug":"weekly-contest-326"},{"question_id":2255,"title":"统计是给定字符串前缀的字符串数目","title_slug":"count-prefixes-of-a-given-string","rating":1260.870208308,"_hash":255204169,"paid_only":false,"cont_title":"第 77 场双周赛","cont_title_slug":"biweekly-contest-77"},{"question_id":2144,"title":"打折购买糖果的最小开销","title_slug":"minimum-cost-of-buying-candies-with-discount","rating":1260.9112824221,"_hash":1962595835,"paid_only":false,"cont_title":"第 70 场双周赛","cont_title_slug":"biweekly-contest-70"},{"question_id":2739,"title":"总行驶距离","title_slug":"total-distance-traveled","rating":1262.100652797,"_hash":2051273831,"paid_only":false,"cont_title":"第 350 场周赛","cont_title_slug":"weekly-contest-350"},{"question_id":1089,"title":"复写零","title_slug":"duplicate-zeros","rating":1262.5890311992,"_hash":1350925428,"paid_only":false,"cont_title":"第 141 场周赛","cont_title_slug":"weekly-contest-141"},{"question_id":2490,"title":"回环句","title_slug":"circular-sentence","rating":1262.938740364,"_hash":3558781406,"paid_only":false,"cont_title":"第 322 场周赛","cont_title_slug":"weekly-contest-322"},{"question_id":1456,"title":"定长子串中元音的最大数目","title_slug":"maximum-number-of-vowels-in-a-substring-of-given-length","rating":1263.2728668041,"_hash":3013367275,"paid_only":false,"cont_title":"第 190 场周赛","cont_title_slug":"weekly-contest-190"},{"question_id":2133,"title":"检查是否每一行每一列都包含全部整数","title_slug":"check-if-every-row-and-column-contains-all-numbers","rating":1264.2868345638,"_hash":3243872254,"paid_only":false,"cont_title":"第 275 场周赛","cont_title_slug":"weekly-contest-275"},{"question_id":2248,"title":"多个数组求交集","title_slug":"intersection-of-multiple-arrays","rating":1264.4778916192,"_hash":305518406,"paid_only":false,"cont_title":"第 290 场周赛","cont_title_slug":"weekly-contest-290"},{"question_id":1736,"title":"替换隐藏数字得到的最晚时间","title_slug":"latest-time-by-replacing-hidden-digits","rating":1264.4836883082,"_hash":4210364548,"paid_only":false,"cont_title":"第 225 场周赛","cont_title_slug":"weekly-contest-225"},{"question_id":2549,"title":"统计桌面上的不同数字","title_slug":"count-distinct-numbers-on-board","rating":1265.8320564115,"_hash":3023056451,"paid_only":false,"cont_title":"第 330 场周赛","cont_title_slug":"weekly-contest-330"},{"question_id":2200,"title":"找出数组中的所有 K 近邻下标","title_slug":"find-all-k-distant-indices-in-an-array","rating":1266.341468955,"_hash":2550811240,"paid_only":false,"cont_title":"第 284 场周赛","cont_title_slug":"weekly-contest-284"},{"question_id":2785,"title":"将字符串中的元音字母排序","title_slug":"sort-vowels-in-a-string","rating":1266.5014127879,"_hash":1174559962,"paid_only":false,"cont_title":"第 109 场双周赛","cont_title_slug":"biweekly-contest-109"},{"question_id":2670,"title":"找出不同元素数目差数组","title_slug":"find-the-distinct-difference-array","rating":1266.5231114343,"_hash":752241853,"paid_only":false,"cont_title":"第 344 场周赛","cont_title_slug":"weekly-contest-344"},{"question_id":2432,"title":"处理用时最长的那个任务的员工","title_slug":"the-employee-that-worked-on-the-longest-task","rating":1266.7001363197,"_hash":4113058721,"paid_only":false,"cont_title":"第 314 场周赛","cont_title_slug":"weekly-contest-314"},{"question_id":1282,"title":"用户分组","title_slug":"group-the-people-given-the-group-size-they-belong-to","rating":1267.223591366,"_hash":1393055239,"paid_only":false,"cont_title":"第 166 场周赛","cont_title_slug":"weekly-contest-166"},{"question_id":2325,"title":"解密消息","title_slug":"decode-the-message","rating":1268.0287696194,"_hash":280396343,"paid_only":false,"cont_title":"第 300 场周赛","cont_title_slug":"weekly-contest-300"},{"question_id":1447,"title":"最简分数","title_slug":"simplified-fractions","rating":1268.5768566953,"_hash":2797831681,"paid_only":false,"cont_title":"第 26 场双周赛","cont_title_slug":"biweekly-contest-26"},{"question_id":2032,"title":"至少在两个数组中出现的值","title_slug":"two-out-of-three","rating":1269.7567553523,"_hash":983129619,"paid_only":false,"cont_title":"第 262 场周赛","cont_title_slug":"weekly-contest-262"},{"question_id":2843,"title":"统计对称整数的数目","title_slug":"count-symmetric-integers","rating":1269.8118442786,"_hash":2681170798,"paid_only":false,"cont_title":"第 361 场周赛","cont_title_slug":"weekly-contest-361"},{"question_id":2873,"title":"有序三元组中的最大值 I","title_slug":"maximum-value-of-an-ordered-triplet-i","rating":1270.0775640451,"_hash":2386809488,"paid_only":false,"cont_title":"第 365 场周赛","cont_title_slug":"weekly-contest-365"},{"question_id":2363,"title":"合并相似的物品","title_slug":"merge-similar-items","rating":1270.6712381632,"_hash":556825118,"paid_only":false,"cont_title":"第 84 场双周赛","cont_title_slug":"biweekly-contest-84"},{"question_id":925,"title":"长按键入","title_slug":"long-pressed-name","rating":1271.3313760514,"_hash":101859828,"paid_only":false,"cont_title":"第 107 场周赛","cont_title_slug":"weekly-contest-107"},{"question_id":1556,"title":"千位分隔数","title_slug":"thousand-separator","rating":1271.3776510163,"_hash":1619143061,"paid_only":false,"cont_title":"第 33 场双周赛","cont_title_slug":"biweekly-contest-33"},{"question_id":2006,"title":"差的绝对值为 K 的数对数目","title_slug":"count-number-of-pairs-with-absolute-difference-k","rating":1271.7726574892,"_hash":911506733,"paid_only":false,"cont_title":"第 61 场双周赛","cont_title_slug":"biweekly-contest-61"},{"question_id":2869,"title":"收集元素的最少操作次数","title_slug":"minimum-operations-to-collect-elements","rating":1272.3340330895,"_hash":615729621,"paid_only":false,"cont_title":"第 114 场双周赛","cont_title_slug":"biweekly-contest-114"},{"question_id":2138,"title":"将字符串拆分为若干长度为 k 的组","title_slug":"divide-a-string-into-groups-of-size-k","rating":1273.046473797,"_hash":3830405744,"paid_only":false,"cont_title":"第 276 场周赛","cont_title_slug":"weekly-contest-276"},{"question_id":2068,"title":"检查两个字符串是否几乎相等","title_slug":"check-whether-two-strings-are-almost-equivalent","rating":1273.0588534723,"_hash":2469022748,"paid_only":false,"cont_title":"第 65 场双周赛","cont_title_slug":"biweekly-contest-65"},{"question_id":1005,"title":"K 次取反后最大化的数组和","title_slug":"maximize-sum-of-array-after-k-negations","rating":1274.6742564805,"_hash":3607948747,"paid_only":false,"cont_title":"第 127 场周赛","cont_title_slug":"weekly-contest-127"},{"question_id":1078,"title":"Bigram 分词","title_slug":"occurrences-after-bigram","rating":1274.7596170193,"_hash":2962478235,"paid_only":false,"cont_title":"第 140 场周赛","cont_title_slug":"weekly-contest-140"},{"question_id":2129,"title":"将标题首字母大写","title_slug":"capitalize-the-title","rating":1274.881752217,"_hash":4156461194,"paid_only":false,"cont_title":"第 69 场双周赛","cont_title_slug":"biweekly-contest-69"},{"question_id":2150,"title":"找出数组中的所有孤独数字","title_slug":"find-all-lonely-numbers-in-the-array","rating":1275.6108152653,"_hash":3672640831,"paid_only":false,"cont_title":"第 277 场周赛","cont_title_slug":"weekly-contest-277"},{"question_id":2558,"title":"从数量最多的堆取走礼物","title_slug":"take-gifts-from-the-richest-pile","rating":1276.7817742915,"_hash":1520385101,"paid_only":false,"cont_title":"第 331 场周赛","cont_title_slug":"weekly-contest-331"},{"question_id":1317,"title":"将整数转换为两个无零整数的和","title_slug":"convert-integer-to-the-sum-of-two-no-zero-integers","rating":1277.8260125315,"_hash":1863065807,"paid_only":false,"cont_title":"第 171 场周赛","cont_title_slug":"weekly-contest-171"},{"question_id":1742,"title":"盒子中小球的最大数量","title_slug":"maximum-number-of-balls-in-a-box","rating":1277.9987709491,"_hash":9262188,"paid_only":false,"cont_title":"第 226 场周赛","cont_title_slug":"weekly-contest-226"},{"question_id":2582,"title":"递枕头","title_slug":"pass-the-pillow","rating":1278.0092842613,"_hash":233297408,"paid_only":false,"cont_title":"第 335 场周赛","cont_title_slug":"weekly-contest-335"},{"question_id":2807,"title":"在链表中插入最大公约数","title_slug":"insert-greatest-common-divisors-in-linked-list","rating":1279.0301521682,"_hash":4225876243,"paid_only":false,"cont_title":"第 110 场双周赛","cont_title_slug":"biweekly-contest-110"},{"question_id":1534,"title":"统计好三元组","title_slug":"count-good-triplets","rating":1279.3383966145,"_hash":1278665216,"paid_only":false,"cont_title":"第 200 场周赛","cont_title_slug":"weekly-contest-200"},{"question_id":1002,"title":"查找共用字符","title_slug":"find-common-characters","rating":1279.7669712099,"_hash":1907819963,"paid_only":false,"cont_title":"第 126 场周赛","cont_title_slug":"weekly-contest-126"},{"question_id":2269,"title":"找到一个数字的 K 美丽值","title_slug":"find-the-k-beauty-of-a-number","rating":1279.7894769956,"_hash":2811209697,"paid_only":false,"cont_title":"第 78 场双周赛","cont_title_slug":"biweekly-contest-78"},{"question_id":2125,"title":"银行中的激光束数量","title_slug":"number-of-laser-beams-in-a-bank","rating":1280.2203734882,"_hash":1290173910,"paid_only":false,"cont_title":"第 274 场周赛","cont_title_slug":"weekly-contest-274"},{"question_id":1572,"title":"矩阵对角线元素的和","title_slug":"matrix-diagonal-sum","rating":1280.2941647587,"_hash":197546078,"paid_only":false,"cont_title":"第 34 场双周赛","cont_title_slug":"biweekly-contest-34"},{"question_id":2570,"title":"合并两个二维数组 - 求和法","title_slug":"merge-two-2d-arrays-by-summing-values","rating":1281.0889272532,"_hash":1168254316,"paid_only":false,"cont_title":"第 333 场周赛","cont_title_slug":"weekly-contest-333"},{"question_id":1624,"title":"两个相同字符之间的最长子字符串","title_slug":"largest-substring-between-two-equal-characters","rating":1281.9771427903,"_hash":2249355269,"paid_only":false,"cont_title":"第 211 场周赛","cont_title_slug":"weekly-contest-211"},{"question_id":2220,"title":"转换数字的最少位翻转次数","title_slug":"minimum-bit-flips-to-convert-number","rating":1282.1502428906,"_hash":3126153106,"paid_only":false,"cont_title":"第 75 场双周赛","cont_title_slug":"biweekly-contest-75"},{"question_id":2696,"title":"删除子串后的字符串最小长度","title_slug":"minimum-string-length-after-removing-substrings","rating":1282.3870247003,"_hash":4006408746,"paid_only":false,"cont_title":"第 346 场周赛","cont_title_slug":"weekly-contest-346"},{"question_id":1837,"title":"K 进制表示下的各位数字总和","title_slug":"sum-of-digits-in-base-k","rating":1282.4111853142,"_hash":2970227389,"paid_only":false,"cont_title":"第 238 场周赛","cont_title_slug":"weekly-contest-238"},{"question_id":2639,"title":"查询网格图中每一列的宽度","title_slug":"find-the-width-of-columns-of-a-grid","rating":1282.5186784876,"_hash":2007370712,"paid_only":false,"cont_title":"第 102 场双周赛","cont_title_slug":"biweekly-contest-102"},{"question_id":1252,"title":"奇数值单元格的数目","title_slug":"cells-with-odd-values-in-a-matrix","rating":1283.4980318021,"_hash":4235563666,"paid_only":false,"cont_title":"第 162 场周赛","cont_title_slug":"weekly-contest-162"},{"question_id":1507,"title":"转变日期格式","title_slug":"reformat-date","rating":1283.51021448,"_hash":143031678,"paid_only":false,"cont_title":"第 30 场双周赛","cont_title_slug":"biweekly-contest-30"},{"question_id":2303,"title":"计算应缴税款总额","title_slug":"calculate-amount-paid-in-taxes","rating":1283.6412252736,"_hash":4065089853,"paid_only":false,"cont_title":"第 297 场周赛","cont_title_slug":"weekly-contest-297"},{"question_id":1481,"title":"不同整数的最少数目","title_slug":"least-number-of-unique-integers-after-k-removals","rating":1284.3625733813,"_hash":970766553,"paid_only":false,"cont_title":"第 193 场周赛","cont_title_slug":"weekly-contest-193"},{"question_id":1720,"title":"解码异或后的数组","title_slug":"decode-xored-array","rating":1284.4514662456,"_hash":1123666202,"paid_only":false,"cont_title":"第 223 场周赛","cont_title_slug":"weekly-contest-223"},{"question_id":2839,"title":"判断通过操作能否让字符串相等 I","title_slug":"check-if-strings-can-be-made-equal-with-operations-i","rating":1285.1547123119,"_hash":1303459038,"paid_only":false,"cont_title":"第 112 场双周赛","cont_title_slug":"biweekly-contest-112"},{"question_id":860,"title":"柠檬水找零","title_slug":"lemonade-change","rating":1285.7282180721,"_hash":487789523,"paid_only":false,"cont_title":"第 91 场周赛","cont_title_slug":"weekly-contest-91"},{"question_id":1381,"title":"设计一个支持增量操作的栈","title_slug":"design-a-stack-with-increment-operation","rating":1285.9726675488,"_hash":3915832963,"paid_only":false,"cont_title":"第 180 场周赛","cont_title_slug":"weekly-contest-180"},{"question_id":1047,"title":"删除字符串中的所有相邻重复项","title_slug":"remove-all-adjacent-duplicates-in-string","rating":1286.3167937403,"_hash":2941915891,"paid_only":false,"cont_title":"第 137 场周赛","cont_title_slug":"weekly-contest-137"},{"question_id":2352,"title":"相等行列对","title_slug":"equal-row-and-column-pairs","rating":1286.3841359213,"_hash":80255331,"paid_only":false,"cont_title":"第 303 场周赛","cont_title_slug":"weekly-contest-303"},{"question_id":1791,"title":"找出星型图的中心节点","title_slug":"find-center-of-star-graph","rating":1286.7934718934,"_hash":2043678372,"paid_only":false,"cont_title":"第 232 场周赛","cont_title_slug":"weekly-contest-232"},{"question_id":1103,"title":"分糖果 II","title_slug":"distribute-candies-to-people","rating":1287.1053917452,"_hash":4294197536,"paid_only":false,"cont_title":"第 143 场周赛","cont_title_slug":"weekly-contest-143"},{"question_id":872,"title":"叶子相似的树","title_slug":"leaf-similar-trees","rating":1287.8970301681,"_hash":1479673533,"paid_only":false,"cont_title":"第 94 场周赛","cont_title_slug":"weekly-contest-94"},{"question_id":993,"title":"二叉树的堂兄弟节点","title_slug":"cousins-in-binary-tree","rating":1287.9002757199,"_hash":1715714434,"paid_only":false,"cont_title":"第 124 场周赛","cont_title_slug":"weekly-contest-124"},{"question_id":1403,"title":"非递增顺序的最小子序列","title_slug":"minimum-subsequence-in-non-increasing-order","rating":1288.1970048184,"_hash":3066842082,"paid_only":false,"cont_title":"第 183 场周赛","cont_title_slug":"weekly-contest-183"},{"question_id":1684,"title":"统计一致字符串的数目","title_slug":"count-the-number-of-consistent-strings","rating":1288.5621697906,"_hash":859530118,"paid_only":false,"cont_title":"第 41 场双周赛","cont_title_slug":"biweekly-contest-41"},{"question_id":2190,"title":"数组中紧跟 key 之后出现最频繁的数字","title_slug":"most-frequent-number-following-key-in-an-array","rating":1289.1912178611,"_hash":3999582587,"paid_only":false,"cont_title":"第 73 场双周赛","cont_title_slug":"biweekly-contest-73"},{"question_id":2428,"title":"沙漏的最大总和","title_slug":"maximum-sum-of-an-hourglass","rating":1289.945159062,"_hash":3528330030,"paid_only":false,"cont_title":"第 313 场周赛","cont_title_slug":"weekly-contest-313"},{"question_id":1859,"title":"将句子排序","title_slug":"sorting-the-sentence","rating":1290.0361853035,"_hash":1139062797,"paid_only":false,"cont_title":"第 52 场双周赛","cont_title_slug":"biweekly-contest-52"},{"question_id":3010,"title":"将数组分成最小总代价的子数组 I","title_slug":"divide-an-array-into-subarrays-with-minimum-cost-i","rating":1291.744935731,"_hash":1471696394,"paid_only":false,"cont_title":"第 122 场双周赛","cont_title_slug":"biweekly-contest-122"},{"question_id":2496,"title":"数组中字符串的最大值","title_slug":"maximum-value-of-a-string-in-an-array","rating":1292.8993325204,"_hash":3800630907,"paid_only":false,"cont_title":"第 93 场双周赛","cont_title_slug":"biweekly-contest-93"},{"question_id":1551,"title":"使数组中所有元素相等的最小操作数","title_slug":"minimum-operations-to-make-array-equal","rating":1293.4904281819,"_hash":3168618130,"paid_only":false,"cont_title":"第 202 场周赛","cont_title_slug":"weekly-contest-202"},{"question_id":2545,"title":"根据第 K 场考试的分数排序","title_slug":"sort-the-students-by-their-kth-score","rating":1294.0257382852,"_hash":2697040026,"paid_only":false,"cont_title":"第 329 场周赛","cont_title_slug":"weekly-contest-329"},{"question_id":2833,"title":"距离原点最远的点","title_slug":"furthest-point-from-origin","rating":1294.2819324126,"_hash":1908656857,"paid_only":false,"cont_title":"第 360 场周赛","cont_title_slug":"weekly-contest-360"},{"question_id":1716,"title":"计算力扣银行的钱","title_slug":"calculate-money-in-leetcode-bank","rating":1294.5297034757,"_hash":1482821287,"paid_only":false,"cont_title":"第 43 场双周赛","cont_title_slug":"biweekly-contest-43"},{"question_id":2273,"title":"移除字母异位词后的结果数组","title_slug":"find-resultant-array-after-removing-anagrams","rating":1294.5800368625,"_hash":3731391427,"paid_only":false,"cont_title":"第 293 场周赛","cont_title_slug":"weekly-contest-293"},{"question_id":1769,"title":"移动所有球到每个盒子所需的最小操作数","title_slug":"minimum-number-of-operations-to-move-all-balls-to-each-box","rating":1294.7724244077,"_hash":1900062857,"paid_only":false,"cont_title":"第 229 场周赛","cont_title_slug":"weekly-contest-229"},{"question_id":2815,"title":"数组中的最大数对和","title_slug":"max-pair-sum-in-an-array","rating":1295.0947625986,"_hash":3182582646,"paid_only":false,"cont_title":"第 358 场周赛","cont_title_slug":"weekly-contest-358"},{"question_id":1539,"title":"第 k 个缺失的正整数","title_slug":"kth-missing-positive-number","rating":1295.4970938463,"_hash":3184774485,"paid_only":false,"cont_title":"第 32 场双周赛","cont_title_slug":"biweekly-contest-32"},{"question_id":2717,"title":"半有序排列","title_slug":"semi-ordered-permutation","rating":1295.75504698,"_hash":1009976390,"paid_only":false,"cont_title":"第 348 场周赛","cont_title_slug":"weekly-contest-348"},{"question_id":2224,"title":"转化时间需要的最少操作数","title_slug":"minimum-number-of-operations-to-convert-time","rating":1295.8868965907,"_hash":1749795074,"paid_only":false,"cont_title":"第 287 场周赛","cont_title_slug":"weekly-contest-287"},{"question_id":1598,"title":"文件夹操作日志搜集器","title_slug":"crawler-log-folder","rating":1297.3006230632,"_hash":3772660335,"paid_only":false,"cont_title":"第 208 场周赛","cont_title_slug":"weekly-contest-208"},{"question_id":2913,"title":"子数组不同元素数目的平方和 I","title_slug":"subarrays-distinct-element-sum-of-squares-i","rating":1297.4179875409,"_hash":87115414,"paid_only":false,"cont_title":"第 116 场双周赛","cont_title_slug":"biweekly-contest-116"},{"question_id":908,"title":"最小差值 I","title_slug":"smallest-range-i","rating":1298.5921473119,"_hash":690261450,"paid_only":false,"cont_title":"第 103 场周赛","cont_title_slug":"weekly-contest-103"},{"question_id":953,"title":"验证外星语词典","title_slug":"verifying-an-alien-dictionary","rating":1299.6035132992,"_hash":3996759401,"paid_only":false,"cont_title":"第 114 场周赛","cont_title_slug":"weekly-contest-114"},{"question_id":2287,"title":"重排字符形成目标字符串","title_slug":"rearrange-characters-to-make-target-string","rating":1299.8393735643,"_hash":4027356240,"paid_only":false,"cont_title":"第 295 场周赛","cont_title_slug":"weekly-contest-295"},{"question_id":1790,"title":"仅执行一次字符串交换能否使两个字符串相等","title_slug":"check-if-one-string-swap-can-make-strings-equal","rating":1300.8009461582,"_hash":3412927472,"paid_only":false,"cont_title":"第 232 场周赛","cont_title_slug":"weekly-contest-232"},{"question_id":1844,"title":"将所有数字用字符替换","title_slug":"replace-all-digits-with-characters","rating":1300.9041426403,"_hash":315817700,"paid_only":false,"cont_title":"第 51 场双周赛","cont_title_slug":"biweekly-contest-51"},{"question_id":2748,"title":"美丽下标对的数目","title_slug":"number-of-beautiful-pairs","rating":1301.1576743638,"_hash":1182547848,"paid_only":false,"cont_title":"第 351 场周赛","cont_title_slug":"weekly-contest-351"},{"question_id":1877,"title":"数组中最大数对和的最小值","title_slug":"minimize-maximum-pair-sum-in-array","rating":1301.381757401,"_hash":1670099365,"paid_only":false,"cont_title":"第 53 场双周赛","cont_title_slug":"biweekly-contest-53"},{"question_id":1646,"title":"获取生成数组中的最大值","title_slug":"get-maximum-in-generated-array","rating":1301.4027057843,"_hash":3899459924,"paid_only":false,"cont_title":"第 214 场周赛","cont_title_slug":"weekly-contest-214"},{"question_id":2525,"title":"根据规则将箱子分类","title_slug":"categorize-box-according-to-criteria","rating":1301.4167433184,"_hash":1751494517,"paid_only":false,"cont_title":"第 95 场双周赛","cont_title_slug":"biweekly-contest-95"},{"question_id":2740,"title":"找出分区值","title_slug":"find-the-value-of-the-partition","rating":1301.9276849391,"_hash":1010937559,"paid_only":false,"cont_title":"第 350 场周赛","cont_title_slug":"weekly-contest-350"},{"question_id":2243,"title":"计算字符串的数字和","title_slug":"calculate-digit-sum-of-a-string","rating":1301.9432665133,"_hash":1615798591,"paid_only":false,"cont_title":"第 289 场周赛","cont_title_slug":"weekly-contest-289"},{"question_id":1991,"title":"找到数组的中间位置","title_slug":"find-the-middle-index-in-array","rating":1302.6469071738,"_hash":919200929,"paid_only":false,"cont_title":"第 60 场双周赛","cont_title_slug":"biweekly-contest-60"},{"question_id":1266,"title":"访问所有点的最小时间","title_slug":"minimum-time-visiting-all-points","rating":1302.7005460171,"_hash":2480987547,"paid_only":false,"cont_title":"第 164 场周赛","cont_title_slug":"weekly-contest-164"},{"question_id":1051,"title":"高度检查器","title_slug":"height-checker","rating":1303.0179795942,"_hash":479546084,"paid_only":false,"cont_title":"第 138 场周赛","cont_title_slug":"weekly-contest-138"},{"question_id":1338,"title":"数组大小减半","title_slug":"reduce-array-size-to-the-half","rating":1303.022570497,"_hash":1706598413,"paid_only":false,"cont_title":"第 174 场周赛","cont_title_slug":"weekly-contest-174"},{"question_id":2331,"title":"计算布尔二叉树的值","title_slug":"evaluate-boolean-binary-tree","rating":1303.5594588137,"_hash":586474794,"paid_only":false,"cont_title":"第 82 场双周赛","cont_title_slug":"biweekly-contest-82"},{"question_id":2697,"title":"字典序最小回文串","title_slug":"lexicographically-smallest-palindrome","rating":1303.7347742929,"_hash":3386255965,"paid_only":false,"cont_title":"第 346 场周赛","cont_title_slug":"weekly-contest-346"},{"question_id":2657,"title":"找到两个数组的前缀公共数组","title_slug":"find-the-prefix-common-array-of-two-arrays","rating":1304.1180812515,"_hash":917808097,"paid_only":false,"cont_title":"第 103 场双周赛","cont_title_slug":"biweekly-contest-103"},{"question_id":1984,"title":"学生分数的最小差值","title_slug":"minimum-difference-between-highest-and-lowest-of-k-scores","rating":1306.2821637677,"_hash":3183288856,"paid_only":false,"cont_title":"第 256 场周赛","cont_title_slug":"weekly-contest-256"},{"question_id":868,"title":"二进制间距","title_slug":"binary-gap","rating":1307.2991245272,"_hash":3658316549,"paid_only":false,"cont_title":"第 93 场周赛","cont_title_slug":"weekly-contest-93"},{"question_id":2022,"title":"将一维数组转变成二维数组","title_slug":"convert-1d-array-into-2d-array","rating":1307.3265298181,"_hash":289054660,"paid_only":false,"cont_title":"第 62 场双周赛","cont_title_slug":"biweekly-contest-62"},{"question_id":1893,"title":"检查是否区域内所有整数都被覆盖","title_slug":"check-if-all-the-integers-in-a-range-are-covered","rating":1307.3797385769,"_hash":457953007,"paid_only":false,"cont_title":"第 54 场双周赛","cont_title_slug":"biweekly-contest-54"},{"question_id":2085,"title":"统计出现过一次的公共字符串","title_slug":"count-common-words-with-one-occurrence","rating":1307.4608905199,"_hash":709012070,"paid_only":false,"cont_title":"第 66 场双周赛","cont_title_slug":"biweekly-contest-66"},{"question_id":1064,"title":"不动点","title_slug":"fixed-point","rating":1307.9800903088,"_hash":3920925170,"paid_only":false,"cont_title":"第 1 场双周赛","cont_title_slug":"biweekly-contest-1"},{"question_id":2264,"title":"字符串中最大的 3 位相同数字","title_slug":"largest-3-same-digit-number-in-string","rating":1308.948547975,"_hash":1507774284,"paid_only":false,"cont_title":"第 292 场周赛","cont_title_slug":"weekly-contest-292"},{"question_id":2342,"title":"数位和相等数对的最大和","title_slug":"max-sum-of-a-pair-with-equal-sum-of-digits","rating":1308.9617729374,"_hash":2147986859,"paid_only":false,"cont_title":"第 302 场周赛","cont_title_slug":"weekly-contest-302"},{"question_id":1897,"title":"重新分配字符使所有字符串都相等","title_slug":"redistribute-characters-to-make-all-strings-equal","rating":1309.1422268153,"_hash":1093275153,"paid_only":false,"cont_title":"第 245 场周赛","cont_title_slug":"weekly-contest-245"},{"question_id":1451,"title":"重新排列句子中的单词","title_slug":"rearrange-words-in-a-sentence","rating":1309.3113721825,"_hash":440206256,"paid_only":false,"cont_title":"第 189 场周赛","cont_title_slug":"weekly-contest-189"},{"question_id":2500,"title":"删除每行中的最大值","title_slug":"delete-greatest-value-in-each-row","rating":1309.7266159448,"_hash":1037331293,"paid_only":false,"cont_title":"第 323 场周赛","cont_title_slug":"weekly-contest-323"},{"question_id":1710,"title":"卡车上的最大单元数","title_slug":"maximum-units-on-a-truck","rating":1309.8100518373,"_hash":1405988519,"paid_only":false,"cont_title":"第 222 场周赛","cont_title_slug":"weekly-contest-222"},{"question_id":2058,"title":"找出临界点之间的最小和最大距离","title_slug":"find-the-minimum-and-maximum-number-of-nodes-between-critical-points","rating":1310.9129840277,"_hash":4024970253,"paid_only":false,"cont_title":"第 265 场周赛","cont_title_slug":"weekly-contest-265"},{"question_id":1021,"title":"删除最外层的括号","title_slug":"remove-outermost-parentheses","rating":1311.3495317884,"_hash":908082157,"paid_only":false,"cont_title":"第 131 场周赛","cont_title_slug":"weekly-contest-131"},{"question_id":2160,"title":"拆分数位后四位数字的最小和","title_slug":"minimum-sum-of-four-digit-number-after-splitting-digits","rating":1314.2912238536,"_hash":3696757985,"paid_only":false,"cont_title":"第 71 场双周赛","cont_title_slug":"biweekly-contest-71"},{"question_id":2640,"title":"一个数组所有前缀的分数","title_slug":"find-the-score-of-all-prefixes-of-an-array","rating":1314.3600610974,"_hash":1931269506,"paid_only":false,"cont_title":"第 102 场双周赛","cont_title_slug":"biweekly-contest-102"},{"question_id":1827,"title":"最少操作使数组递增","title_slug":"minimum-operations-to-make-the-array-increasing","rating":1314.8600143277,"_hash":191620507,"paid_only":false,"cont_title":"第 50 场双周赛","cont_title_slug":"biweekly-contest-50"},{"question_id":2109,"title":"向字符串添加空格","title_slug":"adding-spaces-to-a-string","rating":1315.1890809249,"_hash":807897834,"paid_only":false,"cont_title":"第 272 场周赛","cont_title_slug":"weekly-contest-272"},{"question_id":1629,"title":"按键持续时间最长的键","title_slug":"slowest-key","rating":1315.3715333947,"_hash":1481976566,"paid_only":false,"cont_title":"第 212 场周赛","cont_title_slug":"weekly-contest-212"},{"question_id":1180,"title":"统计只含单一字母的子串","title_slug":"count-substrings-with-only-one-distinct-letter","rating":1315.4085759361,"_hash":2844666696,"paid_only":false,"cont_title":"第 8 场双周赛","cont_title_slug":"biweekly-contest-8"},{"question_id":2348,"title":"全 0 子数组的数目","title_slug":"number-of-zero-filled-subarrays","rating":1315.8569286597,"_hash":1385231803,"paid_only":false,"cont_title":"第 83 场双周赛","cont_title_slug":"biweekly-contest-83"},{"question_id":2225,"title":"找出输掉零场或一场比赛的玩家","title_slug":"find-players-with-zero-or-one-losses","rating":1316.2046992429,"_hash":1737726232,"paid_only":false,"cont_title":"第 287 场周赛","cont_title_slug":"weekly-contest-287"},{"question_id":1343,"title":"大小为 K 且平均值大于等于阈值的子数组数目","title_slug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold","rating":1317.1729927899,"_hash":1376431756,"paid_only":false,"cont_title":"第 19 场双周赛","cont_title_slug":"biweekly-contest-19"},{"question_id":2221,"title":"数组的三角和","title_slug":"find-triangular-sum-of-an-array","rating":1317.2976846981,"_hash":1783870964,"paid_only":false,"cont_title":"第 75 场双周赛","cont_title_slug":"biweekly-contest-75"},{"question_id":1313,"title":"解压缩编码列表","title_slug":"decompress-run-length-encoded-list","rating":1317.4638832497,"_hash":2109320577,"paid_only":false,"cont_title":"第 17 场双周赛","cont_title_slug":"biweekly-contest-17"},{"question_id":2130,"title":"链表最大孪生和","title_slug":"maximum-twin-sum-of-a-linked-list","rating":1317.9207508583,"_hash":2161204569,"paid_only":false,"cont_title":"第 69 场双周赛","cont_title_slug":"biweekly-contest-69"},{"question_id":999,"title":"可以被一步捕获的棋子数","title_slug":"available-captures-for-rook","rating":1317.9521104466,"_hash":2274658324,"paid_only":false,"cont_title":"第 125 场周赛","cont_title_slug":"weekly-contest-125"},{"question_id":2079,"title":"给植物浇水","title_slug":"watering-plants","rating":1320.6485731562,"_hash":93344773,"paid_only":false,"cont_title":"第 268 场周赛","cont_title_slug":"weekly-contest-268"},{"question_id":1582,"title":"二进制矩阵中的特殊位置","title_slug":"special-positions-in-a-binary-matrix","rating":1321.2748903388,"_hash":3877437521,"paid_only":false,"cont_title":"第 206 场周赛","cont_title_slug":"weekly-contest-206"},{"question_id":1694,"title":"重新格式化电话号码","title_slug":"reformat-phone-number","rating":1321.9346201204,"_hash":117165936,"paid_only":false,"cont_title":"第 220 场周赛","cont_title_slug":"weekly-contest-220"},{"question_id":2446,"title":"判断两个事件是否存在冲突","title_slug":"determine-if-two-events-have-conflict","rating":1322.3886921778,"_hash":735587531,"paid_only":false,"cont_title":"第 316 场周赛","cont_title_slug":"weekly-contest-316"},{"question_id":1936,"title":"新增的最少台阶数","title_slug":"add-minimum-number-of-rungs","rating":1322.5926536743,"_hash":1249919767,"paid_only":false,"cont_title":"第 250 场周赛","cont_title_slug":"weekly-contest-250"},{"question_id":1614,"title":"括号的最大嵌套深度","title_slug":"maximum-nesting-depth-of-the-parentheses","rating":1322.8302750313,"_hash":2312427727,"paid_only":false,"cont_title":"第 210 场周赛","cont_title_slug":"weekly-contest-210"},{"question_id":2491,"title":"划分技能点相等的团队","title_slug":"divide-players-into-teams-of-equal-skill","rating":1323.1893756783,"_hash":3978864326,"paid_only":false,"cont_title":"第 322 场周赛","cont_title_slug":"weekly-contest-322"},{"question_id":1925,"title":"统计平方和三元组的数目","title_slug":"count-square-sum-triples","rating":1323.8236471852,"_hash":1728101846,"paid_only":false,"cont_title":"第 56 场双周赛","cont_title_slug":"biweekly-contest-56"},{"question_id":2660,"title":"保龄球游戏的获胜者","title_slug":"determine-the-winner-of-a-bowling-game","rating":1324.1714505166,"_hash":2355716390,"paid_only":false,"cont_title":"第 343 场周赛","cont_title_slug":"weekly-contest-343"},{"question_id":1603,"title":"设计停车系统","title_slug":"design-parking-system","rating":1324.1757200103,"_hash":2754272500,"paid_only":false,"cont_title":"第 36 场双周赛","cont_title_slug":"biweekly-contest-36"},{"question_id":3014,"title":"输入单词需要的最少按键次数 I","title_slug":"minimum-number-of-pushes-to-type-word-i","rating":1324.2140587436,"_hash":3012401904,"paid_only":false,"cont_title":"第 381 场周赛","cont_title_slug":"weekly-contest-381"},{"question_id":2095,"title":"删除链表的中间节点","title_slug":"delete-the-middle-node-of-a-linked-list","rating":1324.3520304377,"_hash":2982198446,"paid_only":false,"cont_title":"第 270 场周赛","cont_title_slug":"weekly-contest-270"},{"question_id":1752,"title":"检查数组是否经排序和轮转得到","title_slug":"check-if-array-is-sorted-and-rotated","rating":1324.5320836804,"_hash":2521310070,"paid_only":false,"cont_title":"第 227 场周赛","cont_title_slug":"weekly-contest-227"},{"question_id":1344,"title":"时钟指针的夹角","title_slug":"angle-between-hands-of-a-clock","rating":1324.5696223867,"_hash":41269413,"paid_only":false,"cont_title":"第 19 场双周赛","cont_title_slug":"biweekly-contest-19"},{"question_id":2073,"title":"买票需要的时间","title_slug":"time-needed-to-buy-tickets","rating":1325.3607218257,"_hash":1430651253,"paid_only":false,"cont_title":"第 267 场周赛","cont_title_slug":"weekly-contest-267"},{"question_id":1476,"title":"子矩形查询","title_slug":"subrectangle-queries","rating":1326.4047670018,"_hash":3615903863,"paid_only":false,"cont_title":"第 28 场双周赛","cont_title_slug":"biweekly-contest-28"},{"question_id":1086,"title":"前五科的均分","title_slug":"high-five","rating":1327.0282989915,"_hash":2018971200,"paid_only":false,"cont_title":"第 2 场双周赛","cont_title_slug":"biweekly-contest-2"},{"question_id":1812,"title":"判断国际象棋棋盘中一个格子的颜色","title_slug":"determine-color-of-a-chessboard-square","rating":1328.513147726,"_hash":3006434957,"paid_only":false,"cont_title":"第 49 场双周赛","cont_title_slug":"biweekly-contest-49"},{"question_id":2396,"title":"严格回文的数字","title_slug":"strictly-palindromic-number","rating":1328.5499677186,"_hash":111167904,"paid_only":false,"cont_title":"第 86 场双周赛","cont_title_slug":"biweekly-contest-86"},{"question_id":1324,"title":"竖直打印单词","title_slug":"print-words-vertically","rating":1328.7281033317,"_hash":2666352866,"paid_only":false,"cont_title":"第 172 场周赛","cont_title_slug":"weekly-contest-172"},{"question_id":1347,"title":"制造字母异位词的最小步骤数","title_slug":"minimum-number-of-steps-to-make-two-strings-anagram","rating":1330.918577828,"_hash":4265155310,"paid_only":false,"cont_title":"第 175 场周赛","cont_title_slug":"weekly-contest-175"},{"question_id":2373,"title":"矩阵中的局部最大值","title_slug":"largest-local-values-in-a-matrix","rating":1331.3935128035,"_hash":3553057842,"paid_only":false,"cont_title":"第 306 场周赛","cont_title_slug":"weekly-contest-306"},{"question_id":2259,"title":"移除指定数字得到的最大结果","title_slug":"remove-digit-from-number-to-maximize-result","rating":1331.5287857686,"_hash":670957801,"paid_only":false,"cont_title":"第 291 场周赛","cont_title_slug":"weekly-contest-291"},{"question_id":1471,"title":"数组中的 k 个最强值","title_slug":"the-k-strongest-values-in-an-array","rating":1332.4653491345,"_hash":1337689329,"paid_only":false,"cont_title":"第 192 场周赛","cont_title_slug":"weekly-contest-192"},{"question_id":2274,"title":"不含特殊楼层的最大连续楼层数","title_slug":"maximum-consecutive-floors-without-special-floors","rating":1332.6187879411,"_hash":3382549811,"paid_only":false,"cont_title":"第 293 场周赛","cont_title_slug":"weekly-contest-293"},{"question_id":1128,"title":"等价多米诺骨牌对的数量","title_slug":"number-of-equivalent-domino-pairs","rating":1332.622596763,"_hash":2262588000,"paid_only":false,"cont_title":"第 146 场周赛","cont_title_slug":"weekly-contest-146"},{"question_id":2679,"title":"矩阵中的和","title_slug":"sum-in-a-matrix","rating":1333.0179956774,"_hash":846898736,"paid_only":false,"cont_title":"第 104 场双周赛","cont_title_slug":"biweekly-contest-104"},{"question_id":2181,"title":"合并零之间的节点","title_slug":"merge-nodes-in-between-zeros","rating":1333.192050397,"_hash":1770113758,"paid_only":false,"cont_title":"第 281 场周赛","cont_title_slug":"weekly-contest-281"},{"question_id":2554,"title":"从一个范围内选择最多整数 I","title_slug":"maximum-number-of-integers-to-choose-from-a-range-i","rating":1333.2008827592,"_hash":220667062,"paid_only":false,"cont_title":"第 97 场双周赛","cont_title_slug":"biweekly-contest-97"},{"question_id":1805,"title":"字符串中不同整数的数目","title_slug":"number-of-different-integers-in-a-string","rating":1333.3138174157,"_hash":1970717834,"paid_only":false,"cont_title":"第 234 场周赛","cont_title_slug":"weekly-contest-234"},{"question_id":2270,"title":"分割数组的方案数","title_slug":"number-of-ways-to-split-array","rating":1334.0516779626,"_hash":3778209816,"paid_only":false,"cont_title":"第 78 场双周赛","cont_title_slug":"biweekly-contest-78"},{"question_id":888,"title":"公平的糖果交换","title_slug":"fair-candy-swap","rating":1334.0564009231,"_hash":1232284801,"paid_only":false,"cont_title":"第 98 场周赛","cont_title_slug":"weekly-contest-98"},{"question_id":2126,"title":"摧毁小行星","title_slug":"destroying-asteroids","rating":1334.5708444649,"_hash":2247018180,"paid_only":false,"cont_title":"第 274 场周赛","cont_title_slug":"weekly-contest-274"},{"question_id":1409,"title":"查询带键的排列","title_slug":"queries-on-a-permutation-with-key","rating":1334.5718985411,"_hash":1238400837,"paid_only":false,"cont_title":"第 184 场周赛","cont_title_slug":"weekly-contest-184"},{"question_id":938,"title":"二叉搜索树的范围和","title_slug":"range-sum-of-bst","rating":1335.0295688697,"_hash":2572143666,"paid_only":false,"cont_title":"第 110 场周赛","cont_title_slug":"weekly-contest-110"},{"question_id":2506,"title":"统计相似字符串对的数目","title_slug":"count-pairs-of-similar-strings","rating":1335.4613368501,"_hash":3891355877,"paid_only":false,"cont_title":"第 324 场周赛","cont_title_slug":"weekly-contest-324"},{"question_id":2587,"title":"重排数组以得到最大前缀分数","title_slug":"rearrange-array-to-maximize-prefix-score","rating":1336.7830451625,"_hash":922160489,"paid_only":false,"cont_title":"第 336 场周赛","cont_title_slug":"weekly-contest-336"},{"question_id":1275,"title":"找出井字棋的获胜者","title_slug":"find-winner-on-a-tic-tac-toe-game","rating":1336.9494482313,"_hash":2404871340,"paid_only":false,"cont_title":"第 165 场周赛","cont_title_slug":"weekly-contest-165"},{"question_id":1260,"title":"二维网格迁移","title_slug":"shift-2d-grid","rating":1337.3722299775,"_hash":2949409019,"paid_only":false,"cont_title":"第 163 场周赛","cont_title_slug":"weekly-contest-163"},{"question_id":2161,"title":"根据给定数字划分数组","title_slug":"partition-array-according-to-given-pivot","rating":1337.6115578703,"_hash":290394387,"paid_only":false,"cont_title":"第 71 场双周赛","cont_title_slug":"biweekly-contest-71"},{"question_id":933,"title":"最近的请求次数","title_slug":"number-of-recent-calls","rating":1337.8472367494,"_hash":181840890,"paid_only":false,"cont_title":"第 109 场周赛","cont_title_slug":"weekly-contest-109"},{"question_id":970,"title":"强整数","title_slug":"powerful-integers","rating":1338.8322315568,"_hash":3883411103,"paid_only":false,"cont_title":"第 118 场周赛","cont_title_slug":"weekly-contest-118"},{"question_id":976,"title":"三角形的最大周长","title_slug":"largest-perimeter-triangle","rating":1340.5559417151,"_hash":1665689312,"paid_only":false,"cont_title":"第 119 场周赛","cont_title_slug":"weekly-contest-119"},{"question_id":1399,"title":"统计最大组的数目","title_slug":"count-largest-group","rating":1341.0476642293,"_hash":1417435719,"paid_only":false,"cont_title":"第 23 场双周赛","cont_title_slug":"biweekly-contest-23"},{"question_id":859,"title":"亲密字符串","title_slug":"buddy-strings","rating":1341.2659819842,"_hash":2442045936,"paid_only":false,"cont_title":"第 90 场周赛","cont_title_slug":"weekly-contest-90"},{"question_id":2023,"title":"连接后等于目标字符串的字符串对","title_slug":"number-of-pairs-of-strings-with-concatenation-equal-to-target","rating":1341.3713970313,"_hash":4234423090,"paid_only":false,"cont_title":"第 62 场双周赛","cont_title_slug":"biweekly-contest-62"},{"question_id":1796,"title":"字符串中第二大的数字","title_slug":"second-largest-digit-in-a-string","rating":1341.8397242604,"_hash":750727980,"paid_only":false,"cont_title":"第 48 场双周赛","cont_title_slug":"biweekly-contest-48"},{"question_id":1395,"title":"统计作战单位数","title_slug":"count-number-of-teams","rating":1343.628913055,"_hash":824074855,"paid_only":false,"cont_title":"第 182 场周赛","cont_title_slug":"weekly-contest-182"},{"question_id":1544,"title":"整理字符串","title_slug":"make-the-string-great","rating":1344.226133202,"_hash":3183111073,"paid_only":false,"cont_title":"第 201 场周赛","cont_title_slug":"weekly-contest-201"},{"question_id":1679,"title":"K 和数对的最大数目","title_slug":"max-number-of-k-sum-pairs","rating":1345.737168609,"_hash":31900963,"paid_only":false,"cont_title":"第 218 场周赛","cont_title_slug":"weekly-contest-218"},{"question_id":2027,"title":"转换字符串的最少操作次数","title_slug":"minimum-moves-to-convert-string","rating":1346.3556309143,"_hash":1180837306,"paid_only":false,"cont_title":"第 261 场周赛","cont_title_slug":"weekly-contest-261"},{"question_id":2284,"title":"最多单词数的发件人","title_slug":"sender-with-largest-word-count","rating":1346.9594471871,"_hash":2321482871,"paid_only":false,"cont_title":"第 79 场双周赛","cont_title_slug":"biweekly-contest-79"},{"question_id":2829,"title":"k-avoiding 数组的最小总和","title_slug":"determine-the-minimum-sum-of-a-k-avoiding-array","rating":1347.2146542772,"_hash":1173419903,"paid_only":false,"cont_title":"第 359 场周赛","cont_title_slug":"weekly-contest-359"},{"question_id":2937,"title":"使三个字符串相等","title_slug":"make-three-strings-equal","rating":1347.5885281778,"_hash":2629528696,"paid_only":false,"cont_title":"第 372 场周赛","cont_title_slug":"weekly-contest-372"},{"question_id":2390,"title":"从字符串中移除星号","title_slug":"removing-stars-from-a-string","rating":1347.8521638635,"_hash":917372483,"paid_only":false,"cont_title":"第 308 场周赛","cont_title_slug":"weekly-contest-308"},{"question_id":1029,"title":"两地调度","title_slug":"two-city-scheduling","rating":1348.0079390256,"_hash":3535624008,"paid_only":false,"cont_title":"第 133 场周赛","cont_title_slug":"weekly-contest-133"},{"question_id":2609,"title":"最长平衡子字符串","title_slug":"find-the-longest-balanced-substring-of-a-binary-string","rating":1348.577010609,"_hash":1922249884,"paid_only":false,"cont_title":"第 339 场周赛","cont_title_slug":"weekly-contest-339"},{"question_id":1100,"title":"长度为 K 的无重复字符子串","title_slug":"find-k-length-substrings-with-no-repeated-characters","rating":1348.670191438,"_hash":3246372293,"paid_only":false,"cont_title":"第 3 场双周赛","cont_title_slug":"biweekly-contest-3"},{"question_id":2578,"title":"最小和分割","title_slug":"split-with-minimum-sum","rating":1350.5883729249,"_hash":1850921957,"paid_only":false,"cont_title":"第 99 场双周赛","cont_title_slug":"biweekly-contest-99"},{"question_id":2053,"title":"数组中第 K 个独一无二的字符串","title_slug":"kth-distinct-string-in-an-array","rating":1350.6048768377,"_hash":1322023785,"paid_only":false,"cont_title":"第 64 场双周赛","cont_title_slug":"biweekly-contest-64"},{"question_id":1513,"title":"仅含 1 的子串数","title_slug":"number-of-substrings-with-only-1s","rating":1351.4184681108,"_hash":2562103296,"paid_only":false,"cont_title":"第 197 场周赛","cont_title_slug":"weekly-contest-197"},{"question_id":2895,"title":"最小处理时间","title_slug":"minimum-processing-time","rating":1351.6909336495,"_hash":2835500769,"paid_only":false,"cont_title":"第 366 场周赛","cont_title_slug":"weekly-contest-366"},{"question_id":1995,"title":"统计特殊四元组","title_slug":"count-special-quadruplets","rating":1352.1791099256,"_hash":3750650671,"paid_only":false,"cont_title":"第 257 场周赛","cont_title_slug":"weekly-contest-257"},{"question_id":848,"title":"字母移位","title_slug":"shifting-letters","rating":1352.7250049956,"_hash":3410974541,"paid_only":false,"cont_title":"第 88 场周赛","cont_title_slug":"weekly-contest-88"},{"question_id":1758,"title":"生成交替二进制字符串的最少操作数","title_slug":"minimum-changes-to-make-alternating-binary-string","rating":1353.629677812,"_hash":877809104,"paid_only":false,"cont_title":"第 228 场周赛","cont_title_slug":"weekly-contest-228"},{"question_id":1244,"title":"力扣排行榜","title_slug":"design-a-leaderboard","rating":1354.1247827015,"_hash":2386103127,"paid_only":false,"cont_title":"第 12 场双周赛","cont_title_slug":"biweekly-contest-12"},{"question_id":2210,"title":"统计数组中峰和谷的数量","title_slug":"count-hills-and-valleys-in-an-array","rating":1354.5231125217,"_hash":2390584088,"paid_only":false,"cont_title":"第 285 场周赛","cont_title_slug":"weekly-contest-285"},{"question_id":1689,"title":"十-二进制数的最少数目","title_slug":"partitioning-into-minimum-number-of-deci-binary-numbers","rating":1355.3825442341,"_hash":2829216648,"paid_only":false,"cont_title":"第 219 场周赛","cont_title_slug":"weekly-contest-219"},{"question_id":2405,"title":"子字符串的最优划分","title_slug":"optimal-partition-of-string","rating":1355.3956434989,"_hash":569962978,"paid_only":false,"cont_title":"第 310 场周赛","cont_title_slug":"weekly-contest-310"},{"question_id":1894,"title":"找到需要补充粉笔的学生编号","title_slug":"find-the-student-that-will-replace-the-chalk","rating":1355.5386161215,"_hash":3347724858,"paid_only":false,"cont_title":"第 54 场双周赛","cont_title_slug":"biweekly-contest-54"},{"question_id":1331,"title":"数组序号转换","title_slug":"rank-transform-of-an-array","rating":1355.9817184778,"_hash":1713279396,"paid_only":false,"cont_title":"第 18 场双周赛","cont_title_slug":"biweekly-contest-18"},{"question_id":2043,"title":"简易银行系统","title_slug":"simple-bank-system","rating":1356.1920189231,"_hash":693474678,"paid_only":false,"cont_title":"第 263 场周赛","cont_title_slug":"weekly-contest-263"},{"question_id":2579,"title":"统计染色格子数","title_slug":"count-total-number-of-colored-cells","rating":1356.4450869217,"_hash":1180349312,"paid_only":false,"cont_title":"第 99 场双周赛","cont_title_slug":"biweekly-contest-99"},{"question_id":2037,"title":"使每位学生都有座位的最少移动次数","title_slug":"minimum-number-of-moves-to-seat-everyone","rating":1356.6925765299,"_hash":468110,"paid_only":false,"cont_title":"第 63 场双周赛","cont_title_slug":"biweekly-contest-63"},{"question_id":1957,"title":"删除字符使字符串变好","title_slug":"delete-characters-to-make-fancy-string","rating":1357.6553050616,"_hash":3153125580,"paid_only":false,"cont_title":"第 58 场双周赛","cont_title_slug":"biweekly-contest-58"},{"question_id":2090,"title":"半径为 k 的子数组平均值","title_slug":"k-radius-subarray-averages","rating":1358.152613403,"_hash":210217684,"paid_only":false,"cont_title":"第 269 场周赛","cont_title_slug":"weekly-contest-269"},{"question_id":2379,"title":"得到 K 个黑块的最少涂色次数","title_slug":"minimum-recolors-to-get-k-consecutive-black-blocks","rating":1360.0511262593,"_hash":2333659184,"paid_only":false,"cont_title":"第 85 场双周赛","cont_title_slug":"biweekly-contest-85"},{"question_id":1448,"title":"统计二叉树中好节点的数目","title_slug":"count-good-nodes-in-binary-tree","rating":1360.2184128413,"_hash":169616499,"paid_only":false,"cont_title":"第 26 场双周赛","cont_title_slug":"biweekly-contest-26"},{"question_id":1817,"title":"查找用户活跃分钟数","title_slug":"finding-the-users-active-minutes","rating":1360.3005775112,"_hash":3137406326,"paid_only":false,"cont_title":"第 235 场周赛","cont_title_slug":"weekly-contest-235"},{"question_id":2335,"title":"装满杯子需要的最短总时长","title_slug":"minimum-amount-of-time-to-fill-cups","rating":1360.421258727,"_hash":2855675520,"paid_only":false,"cont_title":"第 301 场周赛","cont_title_slug":"weekly-contest-301"},{"question_id":2165,"title":"重排数字的最小值","title_slug":"smallest-value-of-the-rearranged-number","rating":1361.5824742947,"_hash":2369389100,"paid_only":false,"cont_title":"第 279 场周赛","cont_title_slug":"weekly-contest-279"},{"question_id":1980,"title":"找出不同的二进制字符串","title_slug":"find-unique-binary-string","rating":1361.6459603518,"_hash":333667858,"paid_only":false,"cont_title":"第 255 场周赛","cont_title_slug":"weekly-contest-255"},{"question_id":1120,"title":"子树的最大平均值","title_slug":"maximum-average-subtree","rating":1361.8801013336,"_hash":1060291152,"paid_only":false,"cont_title":"第 4 场双周赛","cont_title_slug":"biweekly-contest-4"},{"question_id":1592,"title":"重新排列单词间的空格","title_slug":"rearrange-spaces-between-words","rating":1362.6613797387,"_hash":3611656717,"paid_only":false,"cont_title":"第 207 场周赛","cont_title_slug":"weekly-contest-207"},{"question_id":2486,"title":"追加字符以获得子序列","title_slug":"append-characters-to-string-to-make-subsequence","rating":1362.7144100401,"_hash":282802217,"paid_only":false,"cont_title":"第 321 场周赛","cont_title_slug":"weekly-contest-321"},{"question_id":1974,"title":"使用特殊打字机键入单词的最少时间","title_slug":"minimum-time-to-type-word-using-special-typewriter","rating":1364.154859918,"_hash":3014957498,"paid_only":false,"cont_title":"第 59 场双周赛","cont_title_slug":"biweekly-contest-59"},{"question_id":2260,"title":"必须拿起的最小连续卡牌数","title_slug":"minimum-consecutive-cards-to-pick-up","rating":1364.6787168645,"_hash":2520941920,"paid_only":false,"cont_title":"第 291 场周赛","cont_title_slug":"weekly-contest-291"},{"question_id":2231,"title":"按奇偶性交换后的最大数字","title_slug":"largest-number-after-digit-swaps-by-parity","rating":1365.2269076492,"_hash":2192706389,"paid_only":false,"cont_title":"第 288 场周赛","cont_title_slug":"weekly-contest-288"},{"question_id":2433,"title":"找出前缀异或的原始数组","title_slug":"find-the-original-array-of-prefix-xor","rating":1366.6789652398,"_hash":883396381,"paid_only":false,"cont_title":"第 314 场周赛","cont_title_slug":"weekly-contest-314"},{"question_id":2515,"title":"到目标字符串的最短距离","title_slug":"shortest-distance-to-target-string-in-a-circular-array","rating":1367.0197235097,"_hash":1200771569,"paid_only":false,"cont_title":"第 325 场周赛","cont_title_slug":"weekly-contest-325"},{"question_id":1576,"title":"替换所有的问号","title_slug":"replace-all-s-to-avoid-consecutive-repeating-characters","rating":1368.0043517215,"_hash":4233152869,"paid_only":false,"cont_title":"第 205 场周赛","cont_title_slug":"weekly-contest-205"},{"question_id":1370,"title":"上升下降字符串","title_slug":"increasing-decreasing-string","rating":1369.0053354603,"_hash":2860419980,"paid_only":false,"cont_title":"第 21 场双周赛","cont_title_slug":"biweekly-contest-21"},{"question_id":1608,"title":"特殊数组的特征值","title_slug":"special-array-with-x-elements-greater-than-or-equal-x","rating":1369.614440152,"_hash":2737402297,"paid_only":false,"cont_title":"第 209 场周赛","cont_title_slug":"weekly-contest-209"},{"question_id":1854,"title":"人口最多的年份","title_slug":"maximum-population-year","rating":1370.4186698287,"_hash":214508087,"paid_only":false,"cont_title":"第 240 场周赛","cont_title_slug":"weekly-contest-240"},{"question_id":914,"title":"卡牌分组","title_slug":"x-of-a-kind-in-a-deck-of-cards","rating":1370.6144908238,"_hash":3334808342,"paid_only":false,"cont_title":"第 104 场周赛","cont_title_slug":"weekly-contest-104"},{"question_id":2244,"title":"完成所有任务需要的最少轮数","title_slug":"minimum-rounds-to-complete-all-tasks","rating":1371.8092952004,"_hash":2786999216,"paid_only":false,"cont_title":"第 289 场周赛","cont_title_slug":"weekly-contest-289"},{"question_id":1863,"title":"找出所有子集的异或总和再求和","title_slug":"sum-of-all-subset-xor-totals","rating":1372.1152262488,"_hash":3681131795,"paid_only":false,"cont_title":"第 241 场周赛","cont_title_slug":"weekly-contest-241"},{"question_id":2899,"title":"上一个遍历的整数","title_slug":"last-visited-integers","rating":1372.4759842416,"_hash":3735818622,"paid_only":false,"cont_title":"第 115 场双周赛","cont_title_slug":"biweekly-contest-115"},{"question_id":2482,"title":"行和列中一和零的差值","title_slug":"difference-between-ones-and-zeros-in-row-and-column","rating":1372.5139179378,"_hash":61296851,"paid_only":false,"cont_title":"第 92 场双周赛","cont_title_slug":"biweekly-contest-92"},{"question_id":1291,"title":"顺次数","title_slug":"sequential-digits","rating":1373.8113453501,"_hash":1231737979,"paid_only":false,"cont_title":"第 167 场周赛","cont_title_slug":"weekly-contest-167"},{"question_id":2610,"title":"转换二维数组","title_slug":"convert-an-array-into-a-2d-array-with-conditions","rating":1373.8916796083,"_hash":974534416,"paid_only":false,"cont_title":"第 339 场周赛","cont_title_slug":"weekly-contest-339"},{"question_id":2583,"title":"二叉树中的第 K 大层和","title_slug":"kth-largest-sum-in-a-binary-tree","rating":1374.3527967199,"_hash":3851205548,"paid_only":false,"cont_title":"第 335 场周赛","cont_title_slug":"weekly-contest-335"},{"question_id":1619,"title":"删除某些元素后的数组均值","title_slug":"mean-of-array-after-removing-some-elements","rating":1374.3549007913,"_hash":882246184,"paid_only":false,"cont_title":"第 37 场双周赛","cont_title_slug":"biweekly-contest-37"},{"question_id":1267,"title":"统计参与通信的服务器","title_slug":"count-servers-that-communicate","rating":1374.574900311,"_hash":4169811109,"paid_only":false,"cont_title":"第 164 场周赛","cont_title_slug":"weekly-contest-164"},{"question_id":1038,"title":"从二叉搜索树到更大和树","title_slug":"binary-search-tree-to-greater-sum-tree","rating":1374.6755455786,"_hash":3738671880,"paid_only":false,"cont_title":"第 135 场周赛","cont_title_slug":"weekly-contest-135"},{"question_id":1288,"title":"删除被覆盖区间","title_slug":"remove-covered-intervals","rating":1375.0234414965,"_hash":4078794209,"paid_only":false,"cont_title":"第 15 场双周赛","cont_title_slug":"biweekly-contest-15"},{"question_id":2336,"title":"无限集中的最小数字","title_slug":"smallest-number-in-infinite-set","rating":1375.0376362104,"_hash":1742391300,"paid_only":false,"cont_title":"第 301 场周赛","cont_title_slug":"weekly-contest-301"},{"question_id":2614,"title":"对角线上的质数","title_slug":"prime-in-diagonal","rating":1375.4261931199,"_hash":3158353268,"paid_only":false,"cont_title":"第 340 场周赛","cont_title_slug":"weekly-contest-340"},{"question_id":2443,"title":"反转之后的数字和","title_slug":"sum-of-number-and-its-reverse","rating":1376.0047008182,"_hash":3835566276,"paid_only":false,"cont_title":"第 315 场周赛","cont_title_slug":"weekly-contest-315"},{"question_id":2784,"title":"检查数组是否是好的","title_slug":"check-if-array-is-good","rating":1376.2376633804,"_hash":4062228386,"paid_only":false,"cont_title":"第 109 场双周赛","cont_title_slug":"biweekly-contest-109"},{"question_id":1018,"title":"可被 5 整除的二进制前缀","title_slug":"binary-prefix-divisible-by-5","rating":1376.4549624575,"_hash":303821987,"paid_only":false,"cont_title":"第 130 场周赛","cont_title_slug":"weekly-contest-130"},{"question_id":1010,"title":"总持续时间可被 60 整除的歌曲","title_slug":"pairs-of-songs-with-total-durations-divisible-by-60","rating":1377.1913915125,"_hash":2310396,"paid_only":false,"cont_title":"第 128 场周赛","cont_title_slug":"weekly-contest-128"},{"question_id":1013,"title":"将数组分成和相等的三个部分","title_slug":"partition-array-into-three-parts-with-equal-sum","rating":1378.7570411077,"_hash":733560660,"paid_only":false,"cont_title":"第 129 场周赛","cont_title_slug":"weekly-contest-129"},{"question_id":2855,"title":"使数组成为递增数组的最少右移次数","title_slug":"minimum-right-shifts-to-sort-the-array","rating":1379.3426970242,"_hash":3501115477,"paid_only":false,"cont_title":"第 113 场双周赛","cont_title_slug":"biweekly-contest-113"},{"question_id":2120,"title":"执行所有后缀指令","title_slug":"execution-of-all-suffix-instructions-staying-in-a-grid","rating":1379.8787648129,"_hash":1526976016,"paid_only":false,"cont_title":"第 273 场周赛","cont_title_slug":"weekly-contest-273"},{"question_id":1828,"title":"统计一个圆中点的数目","title_slug":"queries-on-number-of-points-inside-a-circle","rating":1380.0192844155,"_hash":3128004049,"paid_only":false,"cont_title":"第 50 场双周赛","cont_title_slug":"biweekly-contest-50"},{"question_id":2410,"title":"运动员和训练师的最大匹配数","title_slug":"maximum-matching-of-players-with-trainers","rating":1381.0888968455,"_hash":3736843920,"paid_only":false,"cont_title":"第 87 场双周赛","cont_title_slug":"biweekly-contest-87"},{"question_id":1881,"title":"插入后的最大值","title_slug":"maximum-value-after-insertion","rating":1381.2168789318,"_hash":288305998,"paid_only":false,"cont_title":"第 243 场周赛","cont_title_slug":"weekly-contest-243"},{"question_id":1185,"title":"一周中的第几天","title_slug":"day-of-the-week","rating":1382.4809893713,"_hash":3920920642,"paid_only":false,"cont_title":"第 153 场周赛","cont_title_slug":"weekly-contest-153"},{"question_id":2682,"title":"找出转圈游戏输家","title_slug":"find-the-losers-of-the-circular-game","rating":1382.6941570342,"_hash":183030256,"paid_only":false,"cont_title":"第 345 场周赛","cont_title_slug":"weekly-contest-345"},{"question_id":849,"title":"到最近的人的最大距离","title_slug":"maximize-distance-to-closest-person","rating":1382.7178688716,"_hash":3370131507,"paid_only":false,"cont_title":"第 88 场周赛","cont_title_slug":"weekly-contest-88"},{"question_id":1318,"title":"或运算的最小翻转次数","title_slug":"minimum-flips-to-make-a-or-b-equal-to-c","rating":1382.760607823,"_hash":623247221,"paid_only":false,"cont_title":"第 171 场周赛","cont_title_slug":"weekly-contest-171"},{"question_id":3034,"title":"匹配模式数组的子数组数目 I","title_slug":"number-of-subarrays-that-match-a-pattern-i","rating":1383.775103528,"_hash":3386206172,"paid_only":false,"cont_title":"第 384 场周赛","cont_title_slug":"weekly-contest-384"},{"question_id":2091,"title":"从数组中移除最大值和最小值","title_slug":"removing-minimum-and-maximum-from-array","rating":1384.0226911434,"_hash":4155641815,"paid_only":false,"cont_title":"第 269 场周赛","cont_title_slug":"weekly-contest-269"},{"question_id":1271,"title":"十六进制魔术数字","title_slug":"hexspeak","rating":1384.4078082338,"_hash":3813216196,"paid_only":false,"cont_title":"第 14 场双周赛","cont_title_slug":"biweekly-contest-14"},{"question_id":2530,"title":"执行 K 次操作后的最大分数","title_slug":"maximal-score-after-applying-k-operations","rating":1386.1200017827,"_hash":2626303746,"paid_only":false,"cont_title":"第 327 场周赛","cont_title_slug":"weekly-contest-327"},{"question_id":1276,"title":"不浪费原料的汉堡制作方案","title_slug":"number-of-burgers-with-no-waste-of-ingredients","rating":1386.3256313989,"_hash":178669910,"paid_only":false,"cont_title":"第 165 场周赛","cont_title_slug":"weekly-contest-165"},{"question_id":1721,"title":"交换链表中的节点","title_slug":"swapping-nodes-in-a-linked-list","rating":1386.9203620297,"_hash":4028967949,"paid_only":false,"cont_title":"第 223 场周赛","cont_title_slug":"weekly-contest-223"},{"question_id":1860,"title":"增长的内存泄露","title_slug":"incremental-memory-leak","rating":1387.2941868867,"_hash":4283669919,"paid_only":false,"cont_title":"第 52 场双周赛","cont_title_slug":"biweekly-contest-52"},{"question_id":937,"title":"重新排列日志文件","title_slug":"reorder-data-in-log-files","rating":1387.3672639293,"_hash":3738917436,"paid_only":false,"cont_title":"第 110 场周赛","cont_title_slug":"weekly-contest-110"},{"question_id":2389,"title":"和有限的最长子序列","title_slug":"longest-subsequence-with-limited-sum","rating":1387.7347071166,"_hash":2775344327,"paid_only":false,"cont_title":"第 308 场周赛","cont_title_slug":"weekly-contest-308"},{"question_id":1302,"title":"层数最深叶子节点的和","title_slug":"deepest-leaves-sum","rating":1387.9431104106,"_hash":2146548018,"paid_only":false,"cont_title":"第 16 场双周赛","cont_title_slug":"biweekly-contest-16"},{"question_id":2917,"title":"找出数组中的 K-or 值","title_slug":"find-the-k-or-of-an-array","rating":1388.5363323598,"_hash":894912724,"paid_only":false,"cont_title":"第 369 场周赛","cont_title_slug":"weekly-contest-369"},{"question_id":1214,"title":"查找两棵二叉搜索树之和","title_slug":"two-sum-bsts","rating":1389.0328392117,"_hash":1043390792,"paid_only":false,"cont_title":"第 10 场双周赛","cont_title_slug":"biweekly-contest-10"},{"question_id":1065,"title":"字符串的索引对","title_slug":"index-pairs-of-a-string","rating":1389.331169471,"_hash":2464323261,"paid_only":false,"cont_title":"第 1 场双周赛","cont_title_slug":"biweekly-contest-1"},{"question_id":2155,"title":"分组得分最高的所有下标","title_slug":"all-divisions-with-the-highest-score-of-a-binary-array","rating":1390.5023027273,"_hash":1507011086,"paid_only":false,"cont_title":"第 278 场周赛","cont_title_slug":"weekly-contest-278"},{"question_id":1222,"title":"可以攻击国王的皇后","title_slug":"queens-that-can-attack-the-king","rating":1391.7243180131,"_hash":665333196,"paid_only":false,"cont_title":"第 158 场周赛","cont_title_slug":"weekly-contest-158"},{"question_id":957,"title":"N 天后的牢房","title_slug":"prison-cells-after-n-days","rating":1392.0853311911,"_hash":572178714,"paid_only":false,"cont_title":"第 115 场周赛","cont_title_slug":"weekly-contest-115"},{"question_id":2870,"title":"使数组为空的最少操作次数","title_slug":"minimum-number-of-operations-to-make-array-empty","rating":1392.3629194433,"_hash":2657502607,"paid_only":false,"cont_title":"第 114 场双周赛","cont_title_slug":"biweekly-contest-114"},{"question_id":1529,"title":"最少的后缀翻转次数","title_slug":"minimum-suffix-flips","rating":1392.6601629182,"_hash":2324786150,"paid_only":false,"cont_title":"第 199 场周赛","cont_title_slug":"weekly-contest-199"},{"question_id":2928,"title":"给小朋友们分糖果 I","title_slug":"distribute-candies-among-children-i","rating":1393.3604603199,"_hash":4137220667,"paid_only":false,"cont_title":"第 117 场双周赛","cont_title_slug":"biweekly-contest-117"},{"question_id":978,"title":"最长湍流子数组","title_slug":"longest-turbulent-subarray","rating":1393.4123491817,"_hash":3588035361,"paid_only":false,"cont_title":"第 120 场周赛","cont_title_slug":"weekly-contest-120"},{"question_id":2816,"title":"翻倍以链表形式表示的数字","title_slug":"double-a-number-represented-as-a-linked-list","rating":1393.7857353048,"_hash":1168558024,"paid_only":false,"cont_title":"第 358 场周赛","cont_title_slug":"weekly-contest-358"},{"question_id":2256,"title":"最小平均差","title_slug":"minimum-average-difference","rating":1394.9149882274,"_hash":4108118731,"paid_only":false,"cont_title":"第 77 场双周赛","cont_title_slug":"biweekly-contest-77"},{"question_id":1668,"title":"最大重复子字符串","title_slug":"maximum-repeating-substring","rating":1395.5132479177,"_hash":1257680587,"paid_only":false,"cont_title":"第 40 场双周赛","cont_title_slug":"biweekly-contest-40"},{"question_id":2966,"title":"划分数组并满足最大差限制","title_slug":"divide-array-into-arrays-with-max-difference","rating":1395.9639246414,"_hash":2398941022,"paid_only":false,"cont_title":"第 376 场周赛","cont_title_slug":"weekly-contest-376"},{"question_id":2566,"title":"替换一个数字后的最大差值","title_slug":"maximum-difference-by-remapping-a-digit","rating":1396.1044458638,"_hash":2204380301,"paid_only":false,"cont_title":"第 98 场双周赛","cont_title_slug":"biweekly-contest-98"},{"question_id":944,"title":"删列造序","title_slug":"delete-columns-to-make-sorted","rating":1396.4853538164,"_hash":3612858843,"paid_only":false,"cont_title":"第 111 场周赛","cont_title_slug":"weekly-contest-111"},{"question_id":1306,"title":"跳跃游戏 III","title_slug":"jump-game-iii","rating":1396.5448074496,"_hash":1787879890,"paid_only":false,"cont_title":"第 169 场周赛","cont_title_slug":"weekly-contest-169"},{"question_id":1404,"title":"将二进制表示减到 1 的步骤数","title_slug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one","rating":1396.5990609759,"_hash":1438800814,"paid_only":false,"cont_title":"第 183 场周赛","cont_title_slug":"weekly-contest-183"},{"question_id":1176,"title":"健身计划评估","title_slug":"diet-plan-performance","rating":1397.7743198793,"_hash":97873302,"paid_only":false,"cont_title":"第 152 场周赛","cont_title_slug":"weekly-contest-152"},{"question_id":1071,"title":"字符串的最大公因子","title_slug":"greatest-common-divisor-of-strings","rating":1397.8875115008,"_hash":3816685448,"paid_only":false,"cont_title":"第 139 场周赛","cont_title_slug":"weekly-contest-139"},{"question_id":2799,"title":"统计完全子数组的数目","title_slug":"count-complete-subarrays-in-an-array","rating":1397.9519549403,"_hash":1784527717,"paid_only":false,"cont_title":"第 356 场周赛","cont_title_slug":"weekly-contest-356"},{"question_id":2240,"title":"买钢笔和铅笔的方案数","title_slug":"number-of-ways-to-buy-pens-and-pencils","rating":1399.8468905274,"_hash":534082096,"paid_only":false,"cont_title":"第 76 场双周赛","cont_title_slug":"biweekly-contest-76"},{"question_id":1198,"title":"找出所有行中最小公共元素","title_slug":"find-smallest-common-element-in-all-rows","rating":1401.2246983038,"_hash":2199036891,"paid_only":false,"cont_title":"第 9 场双周赛","cont_title_slug":"biweekly-contest-9"},{"question_id":1508,"title":"子数组和排序后的区间和","title_slug":"range-sum-of-sorted-subarray-sums","rating":1402.0863615706,"_hash":1762249323,"paid_only":false,"cont_title":"第 30 场双周赛","cont_title_slug":"biweekly-contest-30"},{"question_id":1700,"title":"无法吃午餐的学生数量","title_slug":"number-of-students-unable-to-eat-lunch","rating":1404.1839222,"_hash":2553352145,"paid_only":false,"cont_title":"第 42 场双周赛","cont_title_slug":"biweekly-contest-42"},{"question_id":1237,"title":"找出给定方程的正整数解","title_slug":"find-positive-integer-solution-for-a-given-equation","rating":1404.7016862187,"_hash":3484001100,"paid_only":false,"cont_title":"第 160 场周赛","cont_title_slug":"weekly-contest-160"},{"question_id":1457,"title":"二叉树中的伪回文路径","title_slug":"pseudo-palindromic-paths-in-a-binary-tree","rating":1405.0021415178,"_hash":3010901510,"paid_only":false,"cont_title":"第 190 场周赛","cont_title_slug":"weekly-contest-190"},{"question_id":2734,"title":"执行子串操作后的字典序最小字符串","title_slug":"lexicographically-smallest-string-after-substring-operation","rating":1405.123188264,"_hash":3092398094,"paid_only":false,"cont_title":"第 349 场周赛","cont_title_slug":"weekly-contest-349"},{"question_id":1410,"title":"HTML 实体解析器","title_slug":"html-entity-parser","rating":1405.4005354401,"_hash":1452093256,"paid_only":false,"cont_title":"第 184 场周赛","cont_title_slug":"weekly-contest-184"},{"question_id":1561,"title":"你可以获得的最大硬币数目","title_slug":"maximum-number-of-coins-you-can-get","rating":1405.5786892723,"_hash":2336939814,"paid_only":false,"cont_title":"第 203 场周赛","cont_title_slug":"weekly-contest-203"},{"question_id":2996,"title":"大于等于顺序前缀和的最小缺失整数","title_slug":"smallest-missing-integer-greater-than-sequential-prefix-sum","rating":1405.7482709086,"_hash":2694109670,"paid_only":false,"cont_title":"第 121 场双周赛","cont_title_slug":"biweekly-contest-121"},{"question_id":2946,"title":"循环移位后的矩阵相似检查","title_slug":"matrix-similarity-after-cyclic-shifts","rating":1405.8442434352,"_hash":2937224937,"paid_only":false,"cont_title":"第 373 场周赛","cont_title_slug":"weekly-contest-373"},{"question_id":2744,"title":"最大字符串配对数目","title_slug":"find-maximum-number-of-string-pairs","rating":1405.8938478338,"_hash":3156996757,"paid_only":false,"cont_title":"第 107 场双周赛","cont_title_slug":"biweekly-contest-107"},{"question_id":2451,"title":"差值数组不同的字符串","title_slug":"odd-string-difference","rating":1406.1279714442,"_hash":1571048900,"paid_only":false,"cont_title":"第 90 场双周赛","cont_title_slug":"biweekly-contest-90"},{"question_id":1886,"title":"判断矩阵经轮转后是否一致","title_slug":"determine-whether-matrix-can-be-obtained-by-rotation","rating":1407.0629410799,"_hash":3698071341,"paid_only":false,"cont_title":"第 244 场周赛","cont_title_slug":"weekly-contest-244"},{"question_id":1325,"title":"删除给定值的叶子节点","title_slug":"delete-leaves-with-a-given-value","rating":1407.1322366299,"_hash":1098465458,"paid_only":false,"cont_title":"第 172 场周赛","cont_title_slug":"weekly-contest-172"},{"question_id":1217,"title":"玩筹码","title_slug":"minimum-cost-to-move-chips-to-the-same-position","rating":1407.5442381391,"_hash":2503951076,"paid_only":false,"cont_title":"第 157 场周赛","cont_title_slug":"weekly-contest-157"},{"question_id":1006,"title":"笨阶乘","title_slug":"clumsy-factorial","rating":1407.9870845299,"_hash":3282812734,"paid_only":false,"cont_title":"第 127 场周赛","cont_title_slug":"weekly-contest-127"},{"question_id":2110,"title":"股票平滑下跌阶段的数目","title_slug":"number-of-smooth-descent-periods-of-a-stock","rating":1408.427592417,"_hash":4159210402,"paid_only":false,"cont_title":"第 272 场周赛","cont_title_slug":"weekly-contest-272"},{"question_id":1588,"title":"所有奇数长度子数组的和","title_slug":"sum-of-all-odd-length-subarrays","rating":1408.7923640745,"_hash":1846293530,"paid_only":false,"cont_title":"第 35 场双周赛","cont_title_slug":"biweekly-contest-35"},{"question_id":2834,"title":"找出美丽数组的最小和","title_slug":"find-the-minimum-possible-sum-of-a-beautiful-array","rating":1409.2288385791,"_hash":4261327361,"paid_only":false,"cont_title":"第 360 场周赛","cont_title_slug":"weekly-contest-360"},{"question_id":1138,"title":"字母板上的路径","title_slug":"alphabet-board-path","rating":1410.5239927267,"_hash":638264577,"paid_only":false,"cont_title":"第 147 场周赛","cont_title_slug":"weekly-contest-147"},{"question_id":841,"title":"钥匙和房间","title_slug":"keys-and-rooms","rating":1412.2790156634,"_hash":1361459100,"paid_only":false,"cont_title":"第 86 场周赛","cont_title_slug":"weekly-contest-86"},{"question_id":1823,"title":"找出游戏的获胜者","title_slug":"find-the-winner-of-the-circular-game","rating":1412.3053230205,"_hash":2586044711,"paid_only":false,"cont_title":"第 236 场周赛","cont_title_slug":"weekly-contest-236"},{"question_id":2521,"title":"数组乘积中的不同质因数数目","title_slug":"distinct-prime-factors-of-product-of-array","rating":1413.0376809608,"_hash":3036702868,"paid_only":false,"cont_title":"第 326 场周赛","cont_title_slug":"weekly-contest-326"},{"question_id":2383,"title":"赢得比赛需要的最少训练时长","title_slug":"minimum-hours-of-training-to-win-a-competition","rating":1413.4238697034,"_hash":1542173395,"paid_only":false,"cont_title":"第 307 场周赛","cont_title_slug":"weekly-contest-307"},{"question_id":1985,"title":"找出数组中的第 K 大整数","title_slug":"find-the-kth-largest-integer-in-the-array","rating":1414.4351202231,"_hash":3550553048,"paid_only":false,"cont_title":"第 256 场周赛","cont_title_slug":"weekly-contest-256"},{"question_id":890,"title":"查找和替换模式","title_slug":"find-and-replace-pattern","rating":1414.4918812526,"_hash":3073583780,"paid_only":false,"cont_title":"第 98 场周赛","cont_title_slug":"weekly-contest-98"},{"question_id":2825,"title":"循环增长使字符串子序列等于另一个字符串","title_slug":"make-string-a-subsequence-using-cyclic-increments","rating":1414.6100987673,"_hash":1449546891,"paid_only":false,"cont_title":"第 111 场双周赛","cont_title_slug":"biweekly-contest-111"},{"question_id":2294,"title":"划分数组使最大差为 K","title_slug":"partition-array-such-that-maximum-difference-is-k","rating":1416.4124723866,"_hash":3430688223,"paid_only":false,"cont_title":"第 296 场周赛","cont_title_slug":"weekly-contest-296"},{"question_id":1652,"title":"拆炸弹","title_slug":"defuse-the-bomb","rating":1416.8961009909,"_hash":3839572104,"paid_only":false,"cont_title":"第 39 场双周赛","cont_title_slug":"biweekly-contest-39"},{"question_id":2139,"title":"得到目标值的最少行动次数","title_slug":"minimum-moves-to-reach-target-score","rating":1417.3934930077,"_hash":2135327933,"paid_only":false,"cont_title":"第 276 场周赛","cont_title_slug":"weekly-contest-276"},{"question_id":1052,"title":"爱生气的书店老板","title_slug":"grumpy-bookstore-owner","rating":1418.1401949854,"_hash":3953245616,"paid_only":false,"cont_title":"第 138 场周赛","cont_title_slug":"weekly-contest-138"},{"question_id":1962,"title":"移除石子使总数最小","title_slug":"remove-stones-to-minimize-the-total","rating":1418.6847740057,"_hash":1331620430,"paid_only":false,"cont_title":"第 253 场周赛","cont_title_slug":"weekly-contest-253"},{"question_id":1656,"title":"设计有序流","title_slug":"design-an-ordered-stream","rating":1418.8205349928,"_hash":2422080240,"paid_only":false,"cont_title":"第 215 场周赛","cont_title_slug":"weekly-contest-215"},{"question_id":2374,"title":"边积分最高的节点","title_slug":"node-with-highest-edge-score","rating":1418.9758090724,"_hash":1078280786,"paid_only":false,"cont_title":"第 306 场周赛","cont_title_slug":"weekly-contest-306"},{"question_id":2760,"title":"最长奇偶子数组","title_slug":"longest-even-odd-subarray-with-threshold","rating":1420.3698647434,"_hash":2817202669,"paid_only":false,"cont_title":"第 352 场周赛","cont_title_slug":"weekly-contest-352"},{"question_id":1033,"title":"移动石子直到连续","title_slug":"moving-stones-until-consecutive","rating":1421.2624065513,"_hash":1049390106,"paid_only":false,"cont_title":"第 134 场周赛","cont_title_slug":"weekly-contest-134"},{"question_id":1360,"title":"日期之间隔几天","title_slug":"number-of-days-between-two-dates","rating":1421.6541140049,"_hash":686429748,"paid_only":false,"cont_title":"第 177 场周赛","cont_title_slug":"weekly-contest-177"},{"question_id":2326,"title":"螺旋矩阵 IV","title_slug":"spiral-matrix-iv","rating":1421.7251191403,"_hash":1599758478,"paid_only":false,"cont_title":"第 300 场周赛","cont_title_slug":"weekly-contest-300"},{"question_id":1630,"title":"等差子数组","title_slug":"arithmetic-subarrays","rating":1421.9944676861,"_hash":3454110996,"paid_only":false,"cont_title":"第 212 场周赛","cont_title_slug":"weekly-contest-212"},{"question_id":2606,"title":"找到最大开销的子字符串","title_slug":"find-the-substring-with-maximum-cost","rating":1422.3308967485,"_hash":1474617560,"paid_only":false,"cont_title":"第 101 场双周赛","cont_title_slug":"biweekly-contest-101"},{"question_id":2938,"title":"区分黑球与白球","title_slug":"separate-black-and-white-balls","rating":1422.7125559974,"_hash":1063658457,"paid_only":false,"cont_title":"第 372 场周赛","cont_title_slug":"weekly-contest-372"},{"question_id":1493,"title":"删掉一个元素以后全为 1 的最长子数组","title_slug":"longest-subarray-of-1s-after-deleting-one-element","rating":1423.0355763093,"_hash":3989735780,"paid_only":false,"cont_title":"第 29 场双周赛","cont_title_slug":"biweekly-contest-29"},{"question_id":1333,"title":"餐厅过滤器","title_slug":"filter-restaurants-by-vegan-friendly-price-and-distance","rating":1423.1058649921,"_hash":3693635252,"paid_only":false,"cont_title":"第 173 场周赛","cont_title_slug":"weekly-contest-173"},{"question_id":883,"title":"三维形体投影面积","title_slug":"projection-area-of-3d-shapes","rating":1425.3981616639,"_hash":4256716489,"paid_only":false,"cont_title":"第 96 场周赛","cont_title_slug":"weekly-contest-96"},{"question_id":840,"title":"矩阵中的幻方","title_slug":"magic-squares-in-grid","rating":1425.9672522649,"_hash":3456273150,"paid_only":false,"cont_title":"第 86 场周赛","cont_title_slug":"weekly-contest-86"},{"question_id":1003,"title":"检查替换后的词是否有效","title_slug":"check-if-word-is-valid-after-substitutions","rating":1426.7144554733,"_hash":2965139328,"paid_only":false,"cont_title":"第 126 场周赛","cont_title_slug":"weekly-contest-126"},{"question_id":1432,"title":"改变一个整数能得到的最大差值","title_slug":"max-difference-you-can-get-from-changing-an-integer","rating":1426.7384112327,"_hash":4162693857,"paid_only":false,"cont_title":"第 25 场双周赛","cont_title_slug":"biweekly-contest-25"},{"question_id":1315,"title":"祖父节点值为偶数的节点和","title_slug":"sum-of-nodes-with-even-valued-grandparent","rating":1426.948379305,"_hash":1075948935,"paid_only":false,"cont_title":"第 17 场双周赛","cont_title_slug":"biweekly-contest-17"},{"question_id":2437,"title":"有效时间的数目","title_slug":"number-of-valid-clock-times","rating":1426.9800910361,"_hash":4095621901,"paid_only":false,"cont_title":"第 89 场双周赛","cont_title_slug":"biweekly-contest-89"},{"question_id":1887,"title":"使数组元素相等的减少操作次数","title_slug":"reduction-operations-to-make-the-array-elements-equal","rating":1427.7906804882,"_hash":869195845,"paid_only":false,"cont_title":"第 244 场周赛","cont_title_slug":"weekly-contest-244"},{"question_id":1669,"title":"合并两个链表","title_slug":"merge-in-between-linked-lists","rating":1428.1443796872,"_hash":235206650,"paid_only":false,"cont_title":"第 40 场双周赛","cont_title_slug":"biweekly-contest-40"},{"question_id":1845,"title":"座位预约管理系统","title_slug":"seat-reservation-manager","rating":1428.6729861424,"_hash":3281498525,"paid_only":false,"cont_title":"第 51 场双周赛","cont_title_slug":"biweekly-contest-51"},{"question_id":2711,"title":"对角线上不同值的数量差","title_slug":"difference-of-number-of-distinct-values-on-diagonals","rating":1428.7246677159,"_hash":3754993583,"paid_only":false,"cont_title":"第 347 场周赛","cont_title_slug":"weekly-contest-347"},{"question_id":988,"title":"从叶结点开始的最小字符串","title_slug":"smallest-string-starting-from-leaf","rating":1429.1878389249,"_hash":1210196211,"paid_only":false,"cont_title":"第 122 场周赛","cont_title_slug":"weekly-contest-122"},{"question_id":1357,"title":"每隔 n 个顾客打折","title_slug":"apply-discount-every-n-orders","rating":1429.6349292399,"_hash":920111034,"paid_only":false,"cont_title":"第 20 场双周赛","cont_title_slug":"biweekly-contest-20"},{"question_id":2957,"title":"消除相邻近似相等字符","title_slug":"remove-adjacent-almost-equal-characters","rating":1429.9599761889,"_hash":2774491833,"paid_only":false,"cont_title":"第 119 场双周赛","cont_title_slug":"biweekly-contest-119"},{"question_id":2924,"title":"找到冠军 II","title_slug":"find-champion-ii","rating":1430.3094955812,"_hash":3936988451,"paid_only":false,"cont_title":"第 370 场周赛","cont_title_slug":"weekly-contest-370"},{"question_id":1636,"title":"按照频率将数组升序排序","title_slug":"sort-array-by-increasing-frequency","rating":1430.3429533629,"_hash":2735293288,"paid_only":false,"cont_title":"第 38 场双周赛","cont_title_slug":"biweekly-contest-38"},{"question_id":2415,"title":"反转二叉树的奇数层","title_slug":"reverse-odd-levels-of-binary-tree","rating":1431.0523656241,"_hash":1420390570,"paid_only":false,"cont_title":"第 311 场周赛","cont_title_slug":"weekly-contest-311"},{"question_id":1170,"title":"比较字符串最小字母出现频次","title_slug":"compare-strings-by-frequency-of-the-smallest-character","rating":1431.6864980883,"_hash":168963992,"paid_only":false,"cont_title":"第 151 场周赛","cont_title_slug":"weekly-contest-151"},{"question_id":1785,"title":"构成特定和需要添加的最少元素","title_slug":"minimum-elements-to-add-to-form-a-given-sum","rating":1432.0967926378,"_hash":3102780834,"paid_only":false,"cont_title":"第 231 场周赛","cont_title_slug":"weekly-contest-231"},{"question_id":994,"title":"腐烂的橘子","title_slug":"rotting-oranges","rating":1432.9051050881,"_hash":782747152,"paid_only":false,"cont_title":"第 124 场周赛","cont_title_slug":"weekly-contest-124"},{"question_id":967,"title":"连续差相同的数字","title_slug":"numbers-with-same-consecutive-differences","rating":1432.9593207076,"_hash":2436753495,"paid_only":false,"cont_title":"第 117 场周赛","cont_title_slug":"weekly-contest-117"},{"question_id":1535,"title":"找出数组游戏的赢家","title_slug":"find-the-winner-of-an-array-game","rating":1433.0795554833,"_hash":3951026299,"paid_only":false,"cont_title":"第 200 场周赛","cont_title_slug":"weekly-contest-200"},{"question_id":2600,"title":"K 件物品的最大和","title_slug":"k-items-with-the-maximum-sum","rating":1434.2392062372,"_hash":829222445,"paid_only":false,"cont_title":"第 338 场周赛","cont_title_slug":"weekly-contest-338"},{"question_id":2559,"title":"统计范围内的元音字符串数","title_slug":"count-vowel-strings-in-ranges","rating":1435.0179887342,"_hash":945629510,"paid_only":false,"cont_title":"第 331 场周赛","cont_title_slug":"weekly-contest-331"},{"question_id":1025,"title":"除数博弈","title_slug":"divisor-game","rating":1435.3564963722,"_hash":2669738738,"paid_only":false,"cont_title":"第 132 场周赛","cont_title_slug":"weekly-contest-132"},{"question_id":2001,"title":"可互换矩形的组数","title_slug":"number-of-pairs-of-interchangeable-rectangles","rating":1435.9559888935,"_hash":2330317080,"paid_only":false,"cont_title":"第 258 场周赛","cont_title_slug":"weekly-contest-258"},{"question_id":1433,"title":"检查一个字符串是否可以打破另一个字符串","title_slug":"check-if-a-string-can-break-another-string","rating":1436.1125054038,"_hash":2646645546,"paid_only":false,"cont_title":"第 25 场双周赛","cont_title_slug":"biweekly-contest-25"},{"question_id":1701,"title":"平均等待时间","title_slug":"average-waiting-time","rating":1436.3892315914,"_hash":2259000228,"paid_only":false,"cont_title":"第 42 场双周赛","cont_title_slug":"biweekly-contest-42"},{"question_id":845,"title":"数组中的最长山脉","title_slug":"longest-mountain-in-array","rating":1436.5343999134,"_hash":401508981,"paid_only":false,"cont_title":"第 87 场周赛","cont_title_slug":"weekly-contest-87"},{"question_id":1609,"title":"奇偶树","title_slug":"even-odd-tree","rating":1438.223135905,"_hash":3144113364,"paid_only":false,"cont_title":"第 209 场周赛","cont_title_slug":"weekly-contest-209"},{"question_id":1375,"title":"二进制字符串前缀一致的次数","title_slug":"number-of-times-binary-string-is-prefix-aligned","rating":1438.8988489545,"_hash":1637468390,"paid_only":false,"cont_title":"第 179 场周赛","cont_title_slug":"weekly-contest-179"},{"question_id":1261,"title":"在受污染的二叉树中查找元素","title_slug":"find-elements-in-a-contaminated-binary-tree","rating":1439.5656079032,"_hash":1643291393,"paid_only":false,"cont_title":"第 163 场周赛","cont_title_slug":"weekly-contest-163"},{"question_id":1094,"title":"拼车","title_slug":"car-pooling","rating":1441.4290319373,"_hash":1187211206,"paid_only":false,"cont_title":"第 142 场周赛","cont_title_slug":"weekly-contest-142"},{"question_id":836,"title":"矩形重叠","title_slug":"rectangle-overlap","rating":1442.9468304752,"_hash":4086617748,"paid_only":false,"cont_title":"第 85 场周赛","cont_title_slug":"weekly-contest-85"},{"question_id":1560,"title":"圆形赛道上经过次数最多的扇区","title_slug":"most-visited-sector-in-a-circular-track","rating":1443.2353621969,"_hash":2434964692,"paid_only":false,"cont_title":"第 203 场周赛","cont_title_slug":"weekly-contest-203"},{"question_id":942,"title":"增减字符串匹配","title_slug":"di-string-match","rating":1444.2068009303,"_hash":2792312732,"paid_only":false,"cont_title":"第 111 场周赛","cont_title_slug":"weekly-contest-111"},{"question_id":2526,"title":"找到数据流中的连续整数","title_slug":"find-consecutive-integers-from-a-data-stream","rating":1444.3218903725,"_hash":778347498,"paid_only":false,"cont_title":"第 95 场双周赛","cont_title_slug":"biweekly-contest-95"},{"question_id":1465,"title":"切割后面积最大的蛋糕","title_slug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts","rating":1444.6098846511,"_hash":4281929868,"paid_only":false,"cont_title":"第 191 场周赛","cont_title_slug":"weekly-contest-191"},{"question_id":2028,"title":"找出缺失的观测数据","title_slug":"find-missing-observations","rating":1444.6795731919,"_hash":1541316145,"paid_only":false,"cont_title":"第 261 场周赛","cont_title_slug":"weekly-contest-261"},{"question_id":2295,"title":"替换数组中的元素","title_slug":"replace-elements-in-an-array","rating":1445.1422945604,"_hash":4058134239,"paid_only":false,"cont_title":"第 296 场周赛","cont_title_slug":"weekly-contest-296"},{"question_id":1946,"title":"子字符串突变后可能得到的最大整数","title_slug":"largest-number-after-mutating-substring","rating":1445.3734269673,"_hash":1102749976,"paid_only":false,"cont_title":"第 251 场周赛","cont_title_slug":"weekly-contest-251"},{"question_id":1026,"title":"节点与其祖先之间的最大差值","title_slug":"maximum-difference-between-node-and-ancestor","rating":1446.4280778775,"_hash":2850260537,"paid_only":false,"cont_title":"第 132 场周赛","cont_title_slug":"weekly-contest-132"},{"question_id":2099,"title":"找到和最大的长度为 K 的子序列","title_slug":"find-subsequence-of-length-k-with-the-largest-sum","rating":1447.0268321102,"_hash":3254374161,"paid_only":false,"cont_title":"第 67 场双周赛","cont_title_slug":"biweekly-contest-67"},{"question_id":945,"title":"使数组唯一的最小增量","title_slug":"minimum-increment-to-make-array-unique","rating":1448.1207963663,"_hash":2617837584,"paid_only":false,"cont_title":"第 112 场周赛","cont_title_slug":"weekly-contest-112"},{"question_id":2596,"title":"检查骑士巡视方案","title_slug":"check-knight-tour-configuration","rating":1448.1865030721,"_hash":4101129191,"paid_only":false,"cont_title":"第 337 场周赛","cont_title_slug":"weekly-contest-337"},{"question_id":2511,"title":"最多可以摧毁的敌人城堡数目","title_slug":"maximum-enemy-forts-that-can-be-captured","rating":1450.0534545623,"_hash":3250902571,"paid_only":false,"cont_title":"第 94 场双周赛","cont_title_slug":"biweekly-contest-94"},{"question_id":831,"title":"隐藏个人信息","title_slug":"masking-personal-information","rating":1450.5787293419,"_hash":3572615577,"paid_only":false,"cont_title":"第 83 场周赛","cont_title_slug":"weekly-contest-83"},{"question_id":2961,"title":"双模幂运算","title_slug":"double-modular-exponentiation","rating":1450.6986543984,"_hash":1122946813,"paid_only":false,"cont_title":"第 375 场周赛","cont_title_slug":"weekly-contest-375"},{"question_id":2947,"title":"统计美丽子字符串 I","title_slug":"count-beautiful-substrings-i","rating":1450.8514438667,"_hash":1299365979,"paid_only":false,"cont_title":"第 373 场周赛","cont_title_slug":"weekly-contest-373"},{"question_id":1472,"title":"设计浏览器历史记录","title_slug":"design-browser-history","rating":1453.7818053022,"_hash":791863919,"paid_only":false,"cont_title":"第 192 场周赛","cont_title_slug":"weekly-contest-192"},{"question_id":1846,"title":"减小和重新排列数组后的最大元素","title_slug":"maximum-element-after-decreasing-and-rearranging","rating":1454.3901912166,"_hash":2606916888,"paid_only":false,"cont_title":"第 51 场双周赛","cont_title_slug":"biweekly-contest-51"},{"question_id":2487,"title":"从链表中移除节点","title_slug":"remove-nodes-from-linked-list","rating":1454.5942017003,"_hash":3911303073,"paid_only":false,"cont_title":"第 321 场周赛","cont_title_slug":"weekly-contest-321"},{"question_id":2094,"title":"找出 3 位偶数","title_slug":"finding-3-digit-even-numbers","rating":1454.7459647138,"_hash":3789355498,"paid_only":false,"cont_title":"第 270 场周赛","cont_title_slug":"weekly-contest-270"},{"question_id":2391,"title":"收集垃圾的最少总时间","title_slug":"minimum-amount-of-time-to-collect-garbage","rating":1455.8516200241,"_hash":2833491097,"paid_only":false,"cont_title":"第 308 场周赛","cont_title_slug":"weekly-contest-308"},{"question_id":2062,"title":"统计字符串中的元音子字符串","title_slug":"count-vowel-substrings-of-a-string","rating":1458.356493039,"_hash":3871311053,"paid_only":false,"cont_title":"第 266 场周赛","cont_title_slug":"weekly-contest-266"},{"question_id":2452,"title":"距离字典两次编辑以内的单词","title_slug":"words-within-two-edits-of-dictionary","rating":1459.7513584849,"_hash":1616359180,"paid_only":false,"cont_title":"第 90 场双周赛","cont_title_slug":"biweekly-contest-90"},{"question_id":1310,"title":"子数组异或查询","title_slug":"xor-queries-of-a-subarray","rating":1459.8208951847,"_hash":3663334475,"paid_only":false,"cont_title":"第 170 场周赛","cont_title_slug":"weekly-contest-170"},{"question_id":1663,"title":"具有给定数值的最小字符串","title_slug":"smallest-string-with-a-given-numeric-value","rating":1460.5903088359,"_hash":438417277,"paid_only":false,"cont_title":"第 216 场周赛","cont_title_slug":"weekly-contest-216"},{"question_id":1910,"title":"删除一个字符串中所有出现的给定子字符串","title_slug":"remove-all-occurrences-of-a-substring","rating":1460.9105672071,"_hash":2348993490,"paid_only":false,"cont_title":"第 55 场双周赛","cont_title_slug":"biweekly-contest-55"},{"question_id":833,"title":"字符串中的查找与替换","title_slug":"find-and-replace-in-string","rating":1460.9610936441,"_hash":286069565,"paid_only":false,"cont_title":"第 84 场周赛","cont_title_slug":"weekly-contest-84"},{"question_id":1909,"title":"删除一个元素使数组严格递增","title_slug":"remove-one-element-to-make-the-array-strictly-increasing","rating":1461.2892510067,"_hash":3077002187,"paid_only":false,"cont_title":"第 55 场双周赛","cont_title_slug":"biweekly-contest-55"},{"question_id":946,"title":"验证栈序列","title_slug":"validate-stack-sequences","rating":1461.9157715206,"_hash":403672441,"paid_only":false,"cont_title":"第 112 场周赛","cont_title_slug":"weekly-contest-112"},{"question_id":1022,"title":"从根到叶的二进制数之和","title_slug":"sum-of-root-to-leaf-binary-numbers","rating":1462.4423844498,"_hash":3615890317,"paid_only":false,"cont_title":"第 131 场周赛","cont_title_slug":"weekly-contest-131"},{"question_id":1396,"title":"设计地铁系统","title_slug":"design-underground-system","rating":1464.5254961488,"_hash":1788773531,"paid_only":false,"cont_title":"第 182 场周赛","cont_title_slug":"weekly-contest-182"},{"question_id":1361,"title":"验证二叉树","title_slug":"validate-binary-tree-nodes","rating":1464.6895034875,"_hash":124339070,"paid_only":false,"cont_title":"第 177 场周赛","cont_title_slug":"weekly-contest-177"},{"question_id":1414,"title":"和为 K 的最少斐波那契数字数目","title_slug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k","rating":1465.7023558248,"_hash":1463291583,"paid_only":false,"cont_title":"第 24 场双周赛","cont_title_slug":"biweekly-contest-24"},{"question_id":2038,"title":"如果相邻两个颜色均相同则删除当前颜色","title_slug":"remove-colored-pieces-if-both-neighbors-are-the-same-color","rating":1467.7383709213,"_hash":2795952868,"paid_only":false,"cont_title":"第 63 场双周赛","cont_title_slug":"biweekly-contest-63"},{"question_id":2012,"title":"数组美丽值求和","title_slug":"sum-of-beauty-in-the-array","rating":1467.9366439696,"_hash":136239889,"paid_only":false,"cont_title":"第 259 场周赛","cont_title_slug":"weekly-contest-259"},{"question_id":2900,"title":"最长相邻不相等子序列 I","title_slug":"longest-unequal-adjacent-groups-subsequence-i","rating":1468.8739273624,"_hash":3312226061,"paid_only":false,"cont_title":"第 115 场双周赛","cont_title_slug":"biweekly-contest-115"},{"question_id":1093,"title":"大样本统计","title_slug":"statistics-from-a-large-sample","rating":1471.6221713607,"_hash":781431378,"paid_only":false,"cont_title":"第 142 场周赛","cont_title_slug":"weekly-contest-142"},{"question_id":2047,"title":"句子中的有效单词数","title_slug":"number-of-valid-words-in-a-sentence","rating":1471.8964024887,"_hash":3911640069,"paid_only":false,"cont_title":"第 264 场周赛","cont_title_slug":"weekly-contest-264"},{"question_id":2265,"title":"统计值等于子树平均值的节点数","title_slug":"count-nodes-equal-to-average-of-subtree","rating":1472.7864965062,"_hash":2311001320,"paid_only":false,"cont_title":"第 292 场周赛","cont_title_slug":"weekly-contest-292"},{"question_id":897,"title":"递增顺序搜索树","title_slug":"increasing-order-search-tree","rating":1473.2523136772,"_hash":1569116237,"paid_only":false,"cont_title":"第 100 场周赛","cont_title_slug":"weekly-contest-100"},{"question_id":1352,"title":"最后 K 个数的乘积","title_slug":"product-of-the-last-k-numbers","rating":1473.7057465272,"_hash":2948668320,"paid_only":false,"cont_title":"第 176 场周赛","cont_title_slug":"weekly-contest-176"},{"question_id":1328,"title":"破坏回文串","title_slug":"break-a-palindrome","rating":1473.864993045,"_hash":1467367970,"paid_only":false,"cont_title":"第 18 场双周赛","cont_title_slug":"biweekly-contest-18"},{"question_id":984,"title":"不含 AAA 或 BBB 的字符串","title_slug":"string-without-aaa-or-bbb","rating":1474.0150725665,"_hash":3491443766,"paid_only":false,"cont_title":"第 121 场周赛","cont_title_slug":"weekly-contest-121"},{"question_id":2300,"title":"咒语和药水的成功对数","title_slug":"successful-pairs-of-spells-and-potions","rating":1476.9062320302,"_hash":4067072856,"paid_only":false,"cont_title":"第 80 场双周赛","cont_title_slug":"biweekly-contest-80"},{"question_id":2368,"title":"受限条件下可到达节点的数目","title_slug":"reachable-nodes-with-restrictions","rating":1476.9118898539,"_hash":4092227797,"paid_only":false,"cont_title":"第 305 场周赛","cont_title_slug":"weekly-contest-305"},{"question_id":951,"title":"翻转等价二叉树","title_slug":"flip-equivalent-binary-trees","rating":1477.4844514104,"_hash":444680013,"paid_only":false,"cont_title":"第 113 场周赛","cont_title_slug":"weekly-contest-113"},{"question_id":2645,"title":"构造有效字符串的最少插入数","title_slug":"minimum-additions-to-make-valid-string","rating":1477.7669322402,"_hash":690173651,"paid_only":false,"cont_title":"第 341 场周赛","cont_title_slug":"weekly-contest-341"},{"question_id":1390,"title":"四因数","title_slug":"four-divisors","rating":1478.3848028264,"_hash":3989268391,"paid_only":false,"cont_title":"第 181 场周赛","cont_title_slug":"weekly-contest-181"},{"question_id":2909,"title":"元素和最小的山形三元组 II","title_slug":"minimum-sum-of-mountain-triplets-ii","rating":1478.8676835951,"_hash":343052836,"paid_only":false,"cont_title":"第 368 场周赛","cont_title_slug":"weekly-contest-368"},{"question_id":1166,"title":"设计文件系统","title_slug":"design-file-system","rating":1479.0110934646,"_hash":3000728502,"paid_only":false,"cont_title":"第 7 场双周赛","cont_title_slug":"biweekly-contest-7"},{"question_id":1545,"title":"找出第 N 个二进制字符串中的第 K 位","title_slug":"find-kth-bit-in-nth-binary-string","rating":1479.4837595809,"_hash":886158615,"paid_only":false,"cont_title":"第 201 场周赛","cont_title_slug":"weekly-contest-201"},{"question_id":2914,"title":"使二进制字符串变美丽的最少修改次数","title_slug":"minimum-number-of-changes-to-make-binary-string-beautiful","rating":1479.6908339113,"_hash":1033555490,"paid_only":false,"cont_title":"第 116 场双周赛","cont_title_slug":"biweekly-contest-116"},{"question_id":2501,"title":"数组中最长的方波","title_slug":"longest-square-streak-in-an-array","rating":1479.9828219111,"_hash":4224854568,"paid_only":false,"cont_title":"第 323 场周赛","cont_title_slug":"weekly-contest-323"},{"question_id":1087,"title":"花括号展开","title_slug":"brace-expansion","rating":1480.1116248664,"_hash":3506344616,"paid_only":false,"cont_title":"第 2 场双周赛","cont_title_slug":"biweekly-contest-2"},{"question_id":3006,"title":"找出数组中的美丽下标 I","title_slug":"find-beautiful-indices-in-the-given-array-i","rating":1480.1120711991,"_hash":3437839264,"paid_only":false,"cont_title":"第 380 场周赛","cont_title_slug":"weekly-contest-380"},{"question_id":2380,"title":"二进制字符串重新安排顺序需要的时间","title_slug":"time-needed-to-rearrange-a-binary-string","rating":1481.1046340847,"_hash":147891676,"paid_only":false,"cont_title":"第 85 场双周赛","cont_title_slug":"biweekly-contest-85"},{"question_id":1167,"title":"连接木棍的最低费用","title_slug":"minimum-cost-to-connect-sticks","rating":1481.5701319876,"_hash":4211026934,"paid_only":false,"cont_title":"第 7 场双周赛","cont_title_slug":"biweekly-contest-7"},{"question_id":1807,"title":"替换字符串中的括号内容","title_slug":"evaluate-the-bracket-pairs-of-a-string","rating":1481.960807786,"_hash":59428399,"paid_only":false,"cont_title":"第 234 场周赛","cont_title_slug":"weekly-contest-234"},{"question_id":2904,"title":"最短且字典序最小的美丽子字符串","title_slug":"shortest-and-lexicographically-smallest-beautiful-string","rating":1483.3041242255,"_hash":2613979956,"paid_only":false,"cont_title":"第 367 场周赛","cont_title_slug":"weekly-contest-367"},{"question_id":1314,"title":"矩阵区域和","title_slug":"matrix-block-sum","rating":1483.8137189709,"_hash":2353125510,"paid_only":false,"cont_title":"第 17 场双周赛","cont_title_slug":"biweekly-contest-17"},{"question_id":2789,"title":"合并后数组中的最大元素","title_slug":"largest-element-in-an-array-after-merge-operations","rating":1484.8385256564,"_hash":4141047313,"paid_only":false,"cont_title":"第 355 场周赛","cont_title_slug":"weekly-contest-355"},{"question_id":1418,"title":"点菜展示表","title_slug":"display-table-of-food-orders-in-a-restaurant","rating":1485.135401269,"_hash":3975371411,"paid_only":false,"cont_title":"第 185 场周赛","cont_title_slug":"weekly-contest-185"},{"question_id":1190,"title":"反转每对括号间的子串","title_slug":"reverse-substrings-between-each-pair-of-parentheses","rating":1485.6550472186,"_hash":1038307939,"paid_only":false,"cont_title":"第 154 场周赛","cont_title_slug":"weekly-contest-154"},{"question_id":2840,"title":"判断通过操作能否让字符串相等 II","title_slug":"check-if-strings-can-be-made-equal-with-operations-ii","rating":1486.2147876747,"_hash":83229717,"paid_only":false,"cont_title":"第 112 场双周赛","cont_title_slug":"biweekly-contest-112"},{"question_id":1566,"title":"重复至少 K 次且长度为 M 的模式","title_slug":"detect-pattern-of-length-m-repeated-k-or-more-times","rating":1486.4687014051,"_hash":843769556,"paid_only":false,"cont_title":"第 204 场周赛","cont_title_slug":"weekly-contest-204"},{"question_id":1637,"title":"两点之间不包含任何点的最宽垂直区域","title_slug":"widest-vertical-area-between-two-points-containing-no-points","rating":1486.764933431,"_hash":3608687869,"paid_only":false,"cont_title":"第 38 场双周赛","cont_title_slug":"biweekly-contest-38"},{"question_id":1753,"title":"移除石子的最大得分","title_slug":"maximum-score-from-removing-stones","rating":1487.5826663483,"_hash":185620528,"paid_only":false,"cont_title":"第 227 场周赛","cont_title_slug":"weekly-contest-227"},{"question_id":1175,"title":"质数排列","title_slug":"prime-arrangements","rating":1489.0102202162,"_hash":3007102778,"paid_only":false,"cont_title":"第 152 场周赛","cont_title_slug":"weekly-contest-152"},{"question_id":2658,"title":"网格图中鱼的最大数目","title_slug":"maximum-number-of-fish-in-a-grid","rating":1489.7210915287,"_hash":2383092679,"paid_only":false,"cont_title":"第 103 场双周赛","cont_title_slug":"biweekly-contest-103"},{"question_id":1296,"title":"划分数组为连续数字的集合","title_slug":"divide-array-in-sets-of-k-consecutive-numbers","rating":1490.2370387981,"_hash":2249312740,"paid_only":false,"cont_title":"第 168 场周赛","cont_title_slug":"weekly-contest-168"},{"question_id":1759,"title":"统计同质子字符串的数目","title_slug":"count-number-of-homogenous-substrings","rating":1490.8990184504,"_hash":2434134348,"paid_only":false,"cont_title":"第 228 场周赛","cont_title_slug":"weekly-contest-228"},{"question_id":1806,"title":"还原排列的最少操作步数","title_slug":"minimum-number-of-operations-to-reinitialize-a-permutation","rating":1491.4638194905,"_hash":3052741649,"paid_only":false,"cont_title":"第 234 场周赛","cont_title_slug":"weekly-contest-234"},{"question_id":2483,"title":"商店的最少代价","title_slug":"minimum-penalty-for-a-shop","rating":1494.500749598,"_hash":480223586,"paid_only":false,"cont_title":"第 92 场双周赛","cont_title_slug":"biweekly-contest-92"},{"question_id":949,"title":"给定数字能组成的最大时间","title_slug":"largest-time-for-given-digits","rating":1495.3186477678,"_hash":1800599582,"paid_only":false,"cont_title":"第 113 场周赛","cont_title_slug":"weekly-contest-113"},{"question_id":2419,"title":"按位与最大的最长子数组","title_slug":"longest-subarray-with-maximum-bitwise-and","rating":1495.5180147817,"_hash":119361315,"paid_only":false,"cont_title":"第 312 场周赛","cont_title_slug":"weekly-contest-312"},{"question_id":1685,"title":"有序数组中差绝对值之和","title_slug":"sum-of-absolute-differences-in-a-sorted-array","rating":1495.715740828,"_hash":3892578893,"paid_only":false,"cont_title":"第 41 场双周赛","cont_title_slug":"biweekly-contest-41"},{"question_id":2191,"title":"将杂乱无章的数字排序","title_slug":"sort-the-jumbled-numbers","rating":1496.1462748679,"_hash":2695613806,"paid_only":false,"cont_title":"第 73 场双周赛","cont_title_slug":"biweekly-contest-73"},{"question_id":2285,"title":"道路的最大总重要性","title_slug":"maximum-total-importance-of-roads","rating":1496.2502937005,"_hash":3248412457,"paid_only":false,"cont_title":"第 79 场双周赛","cont_title_slug":"biweekly-contest-79"},{"question_id":3011,"title":"判断一个数组是否可以变为有序","title_slug":"find-if-array-can-be-sorted","rating":1496.6441112156,"_hash":1890921841,"paid_only":false,"cont_title":"第 122 场双周赛","cont_title_slug":"biweekly-contest-122"},{"question_id":1208,"title":"尽可能使字符串相等","title_slug":"get-equal-substrings-within-budget","rating":1496.9128643588,"_hash":3812471555,"paid_only":false,"cont_title":"第 156 场周赛","cont_title_slug":"weekly-contest-156"},{"question_id":998,"title":"最大二叉树 II","title_slug":"maximum-binary-tree-ii","rating":1497.8880991093,"_hash":3866325213,"paid_only":false,"cont_title":"第 125 场周赛","cont_title_slug":"weekly-contest-125"},{"question_id":1904,"title":"你完成的完整对局数","title_slug":"the-number-of-full-rounds-you-have-played","rating":1498.1542511841,"_hash":1871665913,"paid_only":false,"cont_title":"第 246 场周赛","cont_title_slug":"weekly-contest-246"},{"question_id":1968,"title":"构造元素不等于两相邻元素平均值的数组","title_slug":"array-with-elements-not-equal-to-average-of-neighbors","rating":1499.3290269267,"_hash":3221222128,"paid_only":false,"cont_title":"第 254 场周赛","cont_title_slug":"weekly-contest-254"},{"question_id":2507,"title":"使用质因数之和替换后可以取到的最小值","title_slug":"smallest-value-after-replacing-with-sum-of-prime-factors","rating":1499.5903720292,"_hash":1529011687,"paid_only":false,"cont_title":"第 324 场周赛","cont_title_slug":"weekly-contest-324"},{"question_id":1525,"title":"字符串的好分割数目","title_slug":"number-of-good-ways-to-split-a-string","rating":1499.7136257352,"_hash":1226888142,"paid_only":false,"cont_title":"第 31 场双周赛","cont_title_slug":"biweekly-contest-31"},{"question_id":915,"title":"分割数组","title_slug":"partition-array-into-disjoint-intervals","rating":1500.8381829812,"_hash":217546662,"paid_only":false,"cont_title":"第 104 场周赛","cont_title_slug":"weekly-contest-104"},{"question_id":1090,"title":"受标签影响的最大值","title_slug":"largest-values-from-labels","rating":1501.1152614679,"_hash":2513980161,"paid_only":false,"cont_title":"第 141 场周赛","cont_title_slug":"weekly-contest-141"},{"question_id":1750,"title":"删除字符串两端相同字符后的最短长度","title_slug":"minimum-length-of-string-after-deleting-similar-ends","rating":1501.6846714598,"_hash":3164365433,"paid_only":false,"cont_title":"第 45 场双周赛","cont_title_slug":"biweekly-contest-45"},{"question_id":2730,"title":"找到最长的半重复子字符串","title_slug":"find-the-longest-semi-repetitive-substring","rating":1501.9080845668,"_hash":4064007490,"paid_only":false,"cont_title":"第 106 场双周赛","cont_title_slug":"biweekly-contest-106"},{"question_id":2708,"title":"一个小组的最大实力值","title_slug":"maximum-strength-of-a-group","rating":1502.2633100489,"_hash":3413400617,"paid_only":false,"cont_title":"第 105 场双周赛","cont_title_slug":"biweekly-contest-105"},{"question_id":2358,"title":"分组的最大数量","title_slug":"maximum-number-of-groups-entering-a-competition","rating":1502.5363677723,"_hash":419099305,"paid_only":false,"cont_title":"第 304 场周赛","cont_title_slug":"weekly-contest-304"},{"question_id":2661,"title":"找出叠涂元素","title_slug":"first-completely-painted-row-or-column","rating":1502.6623568929,"_hash":637661898,"paid_only":false,"cont_title":"第 343 场周赛","cont_title_slug":"weekly-contest-343"},{"question_id":1461,"title":"检查一个字符串是否包含所有长度为 K 的二进制子串","title_slug":"check-if-a-string-contains-all-binary-codes-of-size-k","rating":1504.0178888667,"_hash":1013970586,"paid_only":false,"cont_title":"第 27 场双周赛","cont_title_slug":"biweekly-contest-27"},{"question_id":2104,"title":"子数组范围和","title_slug":"sum-of-subarray-ranges","rating":1504.2133321504,"_hash":91788639,"paid_only":false,"cont_title":"第 271 场周赛","cont_title_slug":"weekly-contest-271"},{"question_id":869,"title":"重新排序得到 2 的幂","title_slug":"reordered-power-of-2","rating":1504.8237159326,"_hash":2235555306,"paid_only":false,"cont_title":"第 93 场周赛","cont_title_slug":"weekly-contest-93"},{"question_id":2761,"title":"和等于目标值的质数对","title_slug":"prime-pairs-with-target-sum","rating":1504.9263037499,"_hash":2664015237,"paid_only":false,"cont_title":"第 352 场周赛","cont_title_slug":"weekly-contest-352"},{"question_id":2981,"title":"找出出现至少三次的最长特殊子字符串 I","title_slug":"find-longest-special-substring-that-occurs-thrice-i","rating":1505.3120825678,"_hash":1645223251,"paid_only":false,"cont_title":"第 378 场周赛","cont_title_slug":"weekly-contest-378"},{"question_id":1780,"title":"判断一个数字是否可以表示成三的幂的和","title_slug":"check-if-number-is-a-sum-of-powers-of-three","rating":1505.82499953,"_hash":2201981126,"paid_only":false,"cont_title":"第 47 场双周赛","cont_title_slug":"biweekly-contest-47"},{"question_id":1253,"title":"重构 2 行二进制矩阵","title_slug":"reconstruct-a-2-row-binary-matrix","rating":1505.8669082864,"_hash":1498707721,"paid_only":false,"cont_title":"第 162 场周赛","cont_title_slug":"weekly-contest-162"},{"question_id":1387,"title":"将整数按权重排序","title_slug":"sort-integers-by-the-power-value","rating":1506.8958220609,"_hash":3793928653,"paid_only":false,"cont_title":"第 22 场双周赛","cont_title_slug":"biweekly-contest-22"},{"question_id":2105,"title":"给植物浇水 II","title_slug":"watering-plants-ii","rating":1507.1617507911,"_hash":1947285534,"paid_only":false,"cont_title":"第 271 场周赛","cont_title_slug":"weekly-contest-271"},{"question_id":892,"title":"三维形体的表面积","title_slug":"surface-area-of-3d-shapes","rating":1507.8701119064,"_hash":1063164797,"paid_only":false,"cont_title":"第 99 场周赛","cont_title_slug":"weekly-contest-99"},{"question_id":1496,"title":"判断路径是否相交","title_slug":"path-crossing","rating":1508.099765827,"_hash":3461348977,"paid_only":false,"cont_title":"第 195 场周赛","cont_title_slug":"weekly-contest-195"},{"question_id":1151,"title":"最少交换次数来组合所有的 1","title_slug":"minimum-swaps-to-group-all-1s-together","rating":1508.1169489285,"_hash":324121992,"paid_only":false,"cont_title":"第 6 场双周赛","cont_title_slug":"biweekly-contest-6"},{"question_id":1647,"title":"字符频次唯一的最小删除次数","title_slug":"minimum-deletions-to-make-character-frequencies-unique","rating":1509.5432131875,"_hash":2693685785,"paid_only":false,"cont_title":"第 214 场周赛","cont_title_slug":"weekly-contest-214"},{"question_id":2216,"title":"美化数组的最少删除数","title_slug":"minimum-deletions-to-make-array-beautiful","rating":1509.5562928491,"_hash":705189000,"paid_only":false,"cont_title":"第 286 场周赛","cont_title_slug":"weekly-contest-286"},{"question_id":2671,"title":"频率跟踪器","title_slug":"frequency-tracker","rating":1509.6237874441,"_hash":3589033912,"paid_only":false,"cont_title":"第 344 场周赛","cont_title_slug":"weekly-contest-344"},{"question_id":1110,"title":"删点成林","title_slug":"delete-nodes-and-return-forest","rating":1511.3725353467,"_hash":771122731,"paid_only":false,"cont_title":"第 144 场周赛","cont_title_slug":"weekly-contest-144"},{"question_id":1557,"title":"可以到达所有点的最少点数目","title_slug":"minimum-number-of-vertices-to-reach-all-nodes","rating":1512.3323577063,"_hash":4183393481,"paid_only":false,"cont_title":"第 33 场双周赛","cont_title_slug":"biweekly-contest-33"},{"question_id":1855,"title":"下标对中的最大距离","title_slug":"maximum-distance-between-a-pair-of-values","rating":1514.8181710611,"_hash":4071175900,"paid_only":false,"cont_title":"第 240 场周赛","cont_title_slug":"weekly-contest-240"},{"question_id":2849,"title":"判断能否在给定时间到达单元格","title_slug":"determine-if-a-cell-is-reachable-at-a-given-time","rating":1515.1162664342,"_hash":3371445858,"paid_only":false,"cont_title":"第 362 场周赛","cont_title_slug":"weekly-contest-362"},{"question_id":904,"title":"水果成篮","title_slug":"fruit-into-baskets","rating":1516.4104902196,"_hash":123050212,"paid_only":false,"cont_title":"第 102 场周赛","cont_title_slug":"weekly-contest-102"},{"question_id":2683,"title":"相邻值的按位异或","title_slug":"neighboring-bitwise-xor","rating":1517.8263048447,"_hash":78641139,"paid_only":false,"cont_title":"第 345 场周赛","cont_title_slug":"weekly-contest-345"},{"question_id":1641,"title":"统计字典序元音字符串的数目","title_slug":"count-sorted-vowel-strings","rating":1519.1715594347,"_hash":2576790821,"paid_only":false,"cont_title":"第 213 场周赛","cont_title_slug":"weekly-contest-213"},{"question_id":2865,"title":"美丽塔 I","title_slug":"beautiful-towers-i","rating":1519.2070276362,"_hash":19753391,"paid_only":false,"cont_title":"第 364 场周赛","cont_title_slug":"weekly-contest-364"},{"question_id":2971,"title":"找到最大周长的多边形","title_slug":"find-polygon-with-the-largest-perimeter","rating":1521.1616133347,"_hash":2510517613,"paid_only":false,"cont_title":"第 120 场双周赛","cont_title_slug":"biweekly-contest-120"},{"question_id":1041,"title":"困于环中的机器人","title_slug":"robot-bounded-in-circle","rating":1521.1768537583,"_hash":2777625264,"paid_only":false,"cont_title":"第 136 场周赛","cont_title_slug":"weekly-contest-136"},{"question_id":1763,"title":"最长的美好子字符串","title_slug":"longest-nice-substring","rating":1521.7133617698,"_hash":2102124703,"paid_only":false,"cont_title":"第 46 场双周赛","cont_title_slug":"biweekly-contest-46"},{"question_id":1615,"title":"最大网络秩","title_slug":"maximal-network-rank","rating":1521.9977490324,"_hash":3529094278,"paid_only":false,"cont_title":"第 210 场周赛","cont_title_slug":"weekly-contest-210"},{"question_id":1829,"title":"每个查询的最大异或值","title_slug":"maximum-xor-for-each-query","rating":1523.4113866454,"_hash":246275746,"paid_only":false,"cont_title":"第 50 场双周赛","cont_title_slug":"biweekly-contest-50"},{"question_id":1640,"title":"能否连接形成数组","title_slug":"check-array-formation-through-concatenation","rating":1524.3227469,"_hash":1530442140,"paid_only":false,"cont_title":"第 213 场周赛","cont_title_slug":"weekly-contest-213"},{"question_id":1442,"title":"形成两个异或相等数组的三元组数目","title_slug":"count-triplets-that-can-form-two-arrays-of-equal-xor","rating":1524.5693481538,"_hash":594551983,"paid_only":false,"cont_title":"第 188 场周赛","cont_title_slug":"weekly-contest-188"},{"question_id":2997,"title":"使数组异或和等于 K 的最少操作次数","title_slug":"minimum-number-of-operations-to-make-array-xor-equal-to-k","rating":1524.5856276651,"_hash":1320293684,"paid_only":false,"cont_title":"第 121 场双周赛","cont_title_slug":"biweekly-contest-121"},{"question_id":1272,"title":"删除区间","title_slug":"remove-interval","rating":1524.8218282113,"_hash":760128905,"paid_only":false,"cont_title":"第 14 场双周赛","cont_title_slug":"biweekly-contest-14"},{"question_id":2201,"title":"统计可以提取的工件","title_slug":"count-artifacts-that-can-be-extracted","rating":1525.2146106195,"_hash":1716625654,"paid_only":false,"cont_title":"第 284 场周赛","cont_title_slug":"weekly-contest-284"},{"question_id":2918,"title":"数组的最小相等和","title_slug":"minimum-equal-sum-of-two-arrays-after-replacing-zeros","rating":1526.2429110307,"_hash":2619603225,"paid_only":false,"cont_title":"第 369 场周赛","cont_title_slug":"weekly-contest-369"},{"question_id":1921,"title":"消灭怪物的最大数量","title_slug":"eliminate-maximum-number-of-monsters","rating":1527.6868660176,"_hash":119954396,"paid_only":false,"cont_title":"第 248 场周赛","cont_title_slug":"weekly-contest-248"},{"question_id":1695,"title":"删除子数组的最大得分","title_slug":"maximum-erasure-value","rating":1528.7183829005,"_hash":3972794115,"paid_only":false,"cont_title":"第 220 场周赛","cont_title_slug":"weekly-contest-220"},{"question_id":881,"title":"救生艇","title_slug":"boats-to-save-people","rating":1529.7617243868,"_hash":559582932,"paid_only":false,"cont_title":"第 96 场周赛","cont_title_slug":"weekly-contest-96"},{"question_id":1726,"title":"同积元组","title_slug":"tuple-with-same-product","rating":1530.0343519239,"_hash":3977989551,"paid_only":false,"cont_title":"第 224 场周赛","cont_title_slug":"weekly-contest-224"},{"question_id":1657,"title":"确定两个字符串是否接近","title_slug":"determine-if-two-strings-are-close","rating":1530.4652027753,"_hash":132633492,"paid_only":false,"cont_title":"第 215 场周赛","cont_title_slug":"weekly-contest-215"},{"question_id":1400,"title":"构造 K 个回文字符串","title_slug":"construct-k-palindrome-strings","rating":1530.495439788,"_hash":2205913729,"paid_only":false,"cont_title":"第 23 场双周赛","cont_title_slug":"biweekly-contest-23"},{"question_id":2591,"title":"将钱分给最多的儿童","title_slug":"distribute-money-to-maximum-children","rating":1530.6451141787,"_hash":2074713320,"paid_only":false,"cont_title":"第 100 场双周赛","cont_title_slug":"biweekly-contest-100"},{"question_id":900,"title":"RLE 迭代器","title_slug":"rle-iterator","rating":1532.2539947529,"_hash":2874032831,"paid_only":false,"cont_title":"第 101 场周赛","cont_title_slug":"weekly-contest-101"},{"question_id":2429,"title":"最小异或","title_slug":"minimize-xor","rating":1532.3349133769,"_hash":2645404069,"paid_only":false,"cont_title":"第 313 场周赛","cont_title_slug":"weekly-contest-313"},{"question_id":1930,"title":"长度为 3 的不同回文子序列","title_slug":"unique-length-3-palindromic-subsequences","rating":1533.3376144199,"_hash":2661403855,"paid_only":false,"cont_title":"第 249 场周赛","cont_title_slug":"weekly-contest-249"},{"question_id":2770,"title":"达到末尾下标所需的最大跳跃次数","title_slug":"maximum-number-of-jumps-to-reach-the-last-index","rating":1533.47383662,"_hash":4000844273,"paid_only":false,"cont_title":"第 353 场周赛","cont_title_slug":"weekly-contest-353"},{"question_id":3016,"title":"输入单词需要的最少按键次数 II","title_slug":"minimum-number-of-pushes-to-type-word-ii","rating":1533.5722750742,"_hash":1089101531,"paid_only":false,"cont_title":"第 381 场周赛","cont_title_slug":"weekly-contest-381"},{"question_id":1362,"title":"最接近的因数","title_slug":"closest-divisors","rating":1533.9285875234,"_hash":2721035468,"paid_only":false,"cont_title":"第 177 场周赛","cont_title_slug":"weekly-contest-177"},{"question_id":1797,"title":"设计一个验证系统","title_slug":"design-authentication-manager","rating":1534.0648719302,"_hash":3736820092,"paid_only":false,"cont_title":"第 48 场双周赛","cont_title_slug":"biweekly-contest-48"},{"question_id":865,"title":"具有所有最深节点的最小子树","title_slug":"smallest-subtree-with-all-the-deepest-nodes","rating":1534.325005151,"_hash":3353015937,"paid_only":false,"cont_title":"第 92 场周赛","cont_title_slug":"weekly-contest-92"},{"question_id":2958,"title":"最多 K 个重复元素的最长子数组","title_slug":"length-of-longest-subarray-with-at-most-k-frequency","rating":1535.3680469616,"_hash":614687136,"paid_only":false,"cont_title":"第 119 场双周赛","cont_title_slug":"biweekly-contest-119"},{"question_id":2933,"title":"高访问员工","title_slug":"high-access-employees","rating":1536.5893223179,"_hash":3211790430,"paid_only":false,"cont_title":"第 371 场周赛","cont_title_slug":"weekly-contest-371"},{"question_id":1861,"title":"旋转盒子","title_slug":"rotating-the-box","rating":1536.7018543075,"_hash":3272610079,"paid_only":false,"cont_title":"第 52 场双周赛","cont_title_slug":"biweekly-contest-52"},{"question_id":1023,"title":"驼峰式匹配","title_slug":"camelcase-matching","rating":1537.1387686755,"_hash":875418963,"paid_only":false,"cont_title":"第 131 场周赛","cont_title_slug":"weekly-contest-131"},{"question_id":2178,"title":"拆分成最多数目的正偶数之和","title_slug":"maximum-split-of-positive-even-integers","rating":1538.233149704,"_hash":3655265099,"paid_only":false,"cont_title":"第 72 场双周赛","cont_title_slug":"biweekly-contest-72"},{"question_id":1992,"title":"找到所有的农场组","title_slug":"find-all-groups-of-farmland","rating":1539.2250193318,"_hash":3674750599,"paid_only":false,"cont_title":"第 60 场双周赛","cont_title_slug":"biweekly-contest-60"},{"question_id":2349,"title":"设计数字容器系统","title_slug":"design-a-number-container-system","rating":1540.2351411176,"_hash":2500271603,"paid_only":false,"cont_title":"第 83 场双周赛","cont_title_slug":"biweekly-contest-83"},{"question_id":1382,"title":"将二叉搜索树变平衡","title_slug":"balance-a-binary-search-tree","rating":1540.5750839091,"_hash":1937730923,"paid_only":false,"cont_title":"第 180 场周赛","cont_title_slug":"weekly-contest-180"},{"question_id":1229,"title":"安排会议日程","title_slug":"meeting-scheduler","rating":1541.2260256298,"_hash":3772256778,"paid_only":false,"cont_title":"第 11 场双周赛","cont_title_slug":"biweekly-contest-11"},{"question_id":1007,"title":"行相等的最少多米诺旋转","title_slug":"minimum-domino-rotations-for-equal-row","rating":1541.348438509,"_hash":2150121610,"paid_only":false,"cont_title":"第 127 场周赛","cont_title_slug":"weekly-contest-127"},{"question_id":2575,"title":"找出字符串的可整除数组","title_slug":"find-the-divisibility-array-of-a-string","rating":1541.3741526845,"_hash":2410692850,"paid_only":false,"cont_title":"第 334 场周赛","cont_title_slug":"weekly-contest-334"},{"question_id":1209,"title":"删除字符串中的所有相邻重复项 II","title_slug":"remove-all-adjacent-duplicates-in-string-ii","rating":1541.5405749918,"_hash":1577638784,"paid_only":false,"cont_title":"第 156 场周赛","cont_title_slug":"weekly-contest-156"},{"question_id":1749,"title":"任意子数组和的绝对值的最大值","title_slug":"maximum-absolute-sum-of-any-subarray","rating":1541.6176288991,"_hash":3267047320,"paid_only":false,"cont_title":"第 45 场双周赛","cont_title_slug":"biweekly-contest-45"},{"question_id":986,"title":"区间列表的交集","title_slug":"interval-list-intersections","rating":1541.6944600975,"_hash":3869891296,"paid_only":false,"cont_title":"第 122 场周赛","cont_title_slug":"weekly-contest-122"},{"question_id":1283,"title":"使结果不超过阈值的最小除数","title_slug":"find-the-smallest-divisor-given-a-threshold","rating":1541.7840320661,"_hash":278493845,"paid_only":false,"cont_title":"第 166 场周赛","cont_title_slug":"weekly-contest-166"},{"question_id":2811,"title":"判断是否能拆分数组","title_slug":"check-if-it-is-possible-to-split-array","rating":1543.1204810684,"_hash":335140403,"paid_only":false,"cont_title":"第 357 场周赛","cont_title_slug":"weekly-contest-357"},{"question_id":1233,"title":"删除子文件夹","title_slug":"remove-sub-folders-from-the-filesystem","rating":1544.8261365027,"_hash":4057878205,"paid_only":false,"cont_title":"第 159 场周赛","cont_title_slug":"weekly-contest-159"},{"question_id":1104,"title":"二叉树寻路","title_slug":"path-in-zigzag-labelled-binary-tree","rating":1544.8391626032,"_hash":1959869314,"paid_only":false,"cont_title":"第 143 场周赛","cont_title_slug":"weekly-contest-143"},{"question_id":2841,"title":"几乎唯一子数组的最大和","title_slug":"maximum-sum-of-almost-unique-subarray","rating":1545.9654593951,"_hash":1879020884,"paid_only":false,"cont_title":"第 112 场双周赛","cont_title_slug":"biweekly-contest-112"},{"question_id":954,"title":"二倍数对数组","title_slug":"array-of-doubled-pairs","rating":1547.5714796512,"_hash":3671857466,"paid_only":false,"cont_title":"第 114 场周赛","cont_title_slug":"weekly-contest-114"},{"question_id":1599,"title":"经营摩天轮的最大利润","title_slug":"maximum-profit-of-operating-a-centennial-wheel","rating":1548.0854419238,"_hash":2972412900,"paid_only":false,"cont_title":"第 208 场周赛","cont_title_slug":"weekly-contest-208"},{"question_id":2456,"title":"最流行的视频创作者","title_slug":"most-popular-video-creator","rating":1548.1751146981,"_hash":3143101757,"paid_only":false,"cont_title":"第 317 场周赛","cont_title_slug":"weekly-contest-317"},{"question_id":1329,"title":"将矩阵按对角线排序","title_slug":"sort-the-matrix-diagonally","rating":1548.4678056182,"_hash":1786656286,"paid_only":false,"cont_title":"第 18 场双周赛","cont_title_slug":"biweekly-contest-18"},{"question_id":2527,"title":"查询数组异或美丽值","title_slug":"find-xor-beauty-of-array","rating":1549.945040184,"_hash":1501707049,"paid_only":false,"cont_title":"第 95 场双周赛","cont_title_slug":"biweekly-contest-95"},{"question_id":2780,"title":"合法分割的最小下标","title_slug":"minimum-index-of-a-valid-split","rating":1549.9747683007,"_hash":228115268,"paid_only":false,"cont_title":"第 354 场周赛","cont_title_slug":"weekly-contest-354"},{"question_id":2208,"title":"将数组和减半的最少操作次数","title_slug":"minimum-operations-to-halve-array-sum","rating":1550.0978082682,"_hash":3403473925,"paid_only":false,"cont_title":"第 74 场双周赛","cont_title_slug":"biweekly-contest-74"},{"question_id":2207,"title":"字符串中最多数目的子序列","title_slug":"maximize-number-of-subsequences-in-a-string","rating":1550.4297615307,"_hash":2887492330,"paid_only":false,"cont_title":"第 74 场双周赛","cont_title_slug":"biweekly-contest-74"},{"question_id":2461,"title":"长度为 K 子数组中的最大和","title_slug":"maximum-sum-of-distinct-subarrays-with-length-k","rating":1552.8935571247,"_hash":3738097801,"paid_only":false,"cont_title":"第 318 场周赛","cont_title_slug":"weekly-contest-318"},{"question_id":2131,"title":"连接两字母单词得到的最长回文串","title_slug":"longest-palindrome-by-concatenating-two-letter-words","rating":1556.8824239708,"_hash":2977235574,"paid_only":false,"cont_title":"第 69 场双周赛","cont_title_slug":"biweekly-contest-69"},{"question_id":2007,"title":"从双倍数组中还原原数组","title_slug":"find-original-array-from-doubled-array","rating":1557.017055582,"_hash":1395581223,"paid_only":false,"cont_title":"第 61 场双周赛","cont_title_slug":"biweekly-contest-61"},{"question_id":1243,"title":"数组变换","title_slug":"array-transformation","rating":1558.1421869292,"_hash":2980355580,"paid_only":false,"cont_title":"第 12 场双周赛","cont_title_slug":"biweekly-contest-12"},{"question_id":1101,"title":"彼此熟识的最早时间","title_slug":"the-earliest-moment-when-everyone-become-friends","rating":1558.4971807039,"_hash":234159120,"paid_only":false,"cont_title":"第 3 场双周赛","cont_title_slug":"biweekly-contest-3"},{"question_id":1181,"title":"前后拼接","title_slug":"before-and-after-puzzle","rating":1558.6880035344,"_hash":4191223408,"paid_only":false,"cont_title":"第 8 场双周赛","cont_title_slug":"biweekly-contest-8"},{"question_id":1144,"title":"递减元素使数组呈锯齿状","title_slug":"decrease-elements-to-make-array-zigzag","rating":1558.7188539503,"_hash":109606469,"paid_only":false,"cont_title":"第 148 场周赛","cont_title_slug":"weekly-contest-148"},{"question_id":2310,"title":"个位数字为 K 的整数之和","title_slug":"sum-of-numbers-with-units-digit-k","rating":1558.9522968448,"_hash":3729897578,"paid_only":false,"cont_title":"第 298 场周赛","cont_title_slug":"weekly-contest-298"},{"question_id":2470,"title":"最小公倍数为 K 的子数组数目","title_slug":"number-of-subarrays-with-lcm-equal-to-k","rating":1559.9709348417,"_hash":2715109000,"paid_only":false,"cont_title":"第 319 场周赛","cont_title_slug":"weekly-contest-319"},{"question_id":1376,"title":"通知所有员工所需的时间","title_slug":"time-needed-to-inform-all-employees","rating":1561.0553908973,"_hash":2222019296,"paid_only":false,"cont_title":"第 179 场周赛","cont_title_slug":"weekly-contest-179"},{"question_id":1256,"title":"加密数字","title_slug":"encode-number","rating":1561.2655635205,"_hash":2428818859,"paid_only":false,"cont_title":"第 13 场双周赛","cont_title_slug":"biweekly-contest-13"},{"question_id":2409,"title":"统计共同度过的日子数","title_slug":"count-days-spent-together","rating":1562.0956544608,"_hash":3761575610,"paid_only":false,"cont_title":"第 87 场双周赛","cont_title_slug":"biweekly-contest-87"},{"question_id":856,"title":"括号的分数","title_slug":"score-of-parentheses","rating":1562.7212466716,"_hash":2871847316,"paid_only":false,"cont_title":"第 90 场周赛","cont_title_slug":"weekly-contest-90"},{"question_id":1452,"title":"收藏清单","title_slug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list","rating":1562.9186033202,"_hash":2809882420,"paid_only":false,"cont_title":"第 189 场周赛","cont_title_slug":"weekly-contest-189"},{"question_id":1008,"title":"前序遍历构造二叉搜索树","title_slug":"construct-binary-search-tree-from-preorder-traversal","rating":1562.9802666517,"_hash":4123515556,"paid_only":false,"cont_title":"第 127 场周赛","cont_title_slug":"weekly-contest-127"},{"question_id":2970,"title":"统计移除递增子数组的数目 I","title_slug":"count-the-number-of-incremovable-subarrays-i","rating":1563.2283814548,"_hash":1816814719,"paid_only":false,"cont_title":"第 120 场双周赛","cont_title_slug":"biweekly-contest-120"},{"question_id":846,"title":"一手顺子","title_slug":"hand-of-straights","rating":1565.2483424929,"_hash":2014057820,"paid_only":false,"cont_title":"第 87 场周赛","cont_title_slug":"weekly-contest-87"},{"question_id":2044,"title":"统计按位或能得到最大值的子集数目","title_slug":"count-number-of-maximum-bitwise-or-subsets","rating":1567.6884942977,"_hash":3480413551,"paid_only":false,"cont_title":"第 263 场周赛","cont_title_slug":"weekly-contest-263"},{"question_id":2592,"title":"最大化数组的伟大值","title_slug":"maximize-greatness-of-an-array","rating":1569.1579260438,"_hash":3063296642,"paid_only":false,"cont_title":"第 100 场双周赛","cont_title_slug":"biweekly-contest-100"},{"question_id":1109,"title":"航班预订统计","title_slug":"corporate-flight-bookings","rating":1569.7528744586,"_hash":545869308,"paid_only":false,"cont_title":"第 144 场周赛","cont_title_slug":"weekly-contest-144"},{"question_id":1019,"title":"链表中的下一个更大节点","title_slug":"next-greater-node-in-linked-list","rating":1570.8347522104,"_hash":1872980159,"paid_only":false,"cont_title":"第 130 场周赛","cont_title_slug":"weekly-contest-130"},{"question_id":931,"title":"下降路径最小和","title_slug":"minimum-falling-path-sum","rating":1573.2701790739,"_hash":3874484865,"paid_only":false,"cont_title":"第 108 场周赛","cont_title_slug":"weekly-contest-108"},{"question_id":1268,"title":"搜索推荐系统","title_slug":"search-suggestions-system","rating":1573.4042963622,"_hash":133627469,"paid_only":false,"cont_title":"第 164 场周赛","cont_title_slug":"weekly-contest-164"},{"question_id":1423,"title":"可获得的最大点数","title_slug":"maximum-points-you-can-obtain-from-cards","rating":1573.824807946,"_hash":3552570937,"paid_only":false,"cont_title":"第 186 场周赛","cont_title_slug":"weekly-contest-186"},{"question_id":1578,"title":"使绳子变成彩色的最短时间","title_slug":"minimum-time-to-make-rope-colorful","rating":1574.0392121288,"_hash":3548853356,"paid_only":false,"cont_title":"第 205 场周赛","cont_title_slug":"weekly-contest-205"},{"question_id":981,"title":"基于时间的键值存储","title_slug":"time-based-key-value-store","rating":1574.7542247682,"_hash":2074201652,"paid_only":false,"cont_title":"第 121 场周赛","cont_title_slug":"weekly-contest-121"},{"question_id":1415,"title":"长度为 n 的开心字符串中字典序第 k 小的字符串","title_slug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n","rating":1575.6324598387,"_hash":1620228801,"paid_only":false,"cont_title":"第 24 场双周赛","cont_title_slug":"biweekly-contest-24"},{"question_id":2288,"title":"价格减免","title_slug":"apply-discount-to-prices","rating":1577.1141767118,"_hash":1512857430,"paid_only":false,"cont_title":"第 295 场周赛","cont_title_slug":"weekly-contest-295"},{"question_id":1034,"title":"边界着色","title_slug":"coloring-a-border","rating":1578.8503818621,"_hash":345204207,"paid_only":false,"cont_title":"第 134 场周赛","cont_title_slug":"weekly-contest-134"},{"question_id":1743,"title":"从相邻元素对还原数组","title_slug":"restore-the-array-from-adjacent-pairs","rating":1579.2309881035,"_hash":1018399535,"paid_only":false,"cont_title":"第 226 场周赛","cont_title_slug":"weekly-contest-226"},{"question_id":1839,"title":"所有元音按顺序排布的最长子字符串","title_slug":"longest-substring-of-all-vowels-in-order","rating":1580.3620959714,"_hash":3250155411,"paid_only":false,"cont_title":"第 238 场周赛","cont_title_slug":"weekly-contest-238"},{"question_id":2765,"title":"最长交替子数组","title_slug":"longest-alternating-subarray","rating":1580.9748095835,"_hash":4130986647,"paid_only":false,"cont_title":"第 108 场双周赛","cont_title_slug":"biweekly-contest-108"},{"question_id":3021,"title":"Alice 和 Bob 玩鲜花游戏","title_slug":"alice-and-bob-playing-flower-game","rating":1581.4162718925,"_hash":1094471227,"paid_only":false,"cont_title":"第 382 场周赛","cont_title_slug":"weekly-contest-382"},{"question_id":2211,"title":"统计道路上的碰撞次数","title_slug":"count-collisions-on-a-road","rating":1581.4963716166,"_hash":1582953363,"paid_only":false,"cont_title":"第 285 场周赛","cont_title_slug":"weekly-contest-285"},{"question_id":2874,"title":"有序三元组中的最大值 II","title_slug":"maximum-value-of-an-ordered-triplet-ii","rating":1583.212966224,"_hash":3989118459,"paid_only":false,"cont_title":"第 365 场周赛","cont_title_slug":"weekly-contest-365"},{"question_id":2536,"title":"子矩阵元素加 1","title_slug":"increment-submatrices-by-one","rating":1583.3117784523,"_hash":3521973284,"paid_only":false,"cont_title":"第 328 场周赛","cont_title_slug":"weekly-contest-328"},{"question_id":1030,"title":"距离顺序排列矩阵单元格","title_slug":"matrix-cells-in-distance-order","rating":1585.5793143983,"_hash":3321963457,"paid_only":false,"cont_title":"第 133 场周赛","cont_title_slug":"weekly-contest-133"},{"question_id":1764,"title":"通过连接另一个数组的子数组得到一个数组","title_slug":"form-array-by-concatenating-subarrays-of-another-array","rating":1588.3835994255,"_hash":2182388811,"paid_only":false,"cont_title":"第 46 场双周赛","cont_title_slug":"biweekly-contest-46"},{"question_id":2844,"title":"生成特殊数字的最少操作","title_slug":"minimum-operations-to-make-a-special-number","rating":1588.4826339516,"_hash":492673087,"paid_only":false,"cont_title":"第 361 场周赛","cont_title_slug":"weekly-contest-361"},{"question_id":1813,"title":"句子相似性 III","title_slug":"sentence-similarity-iii","rating":1588.9690763997,"_hash":1688453804,"paid_only":false,"cont_title":"第 49 场双周赛","cont_title_slug":"biweekly-contest-49"},{"question_id":877,"title":"石子游戏","title_slug":"stone-game","rating":1590.0463215721,"_hash":3927702135,"paid_only":false,"cont_title":"第 95 场周赛","cont_title_slug":"weekly-contest-95"},{"question_id":893,"title":"特殊等价字符串组","title_slug":"groups-of-special-equivalent-strings","rating":1590.0883962313,"_hash":1402867741,"paid_only":false,"cont_title":"第 99 场周赛","cont_title_slug":"weekly-contest-99"},{"question_id":1664,"title":"生成平衡数组的方案数","title_slug":"ways-to-make-a-fair-array","rating":1590.269030833,"_hash":435507573,"paid_only":false,"cont_title":"第 216 场周赛","cont_title_slug":"weekly-contest-216"},{"question_id":1573,"title":"分割字符串的方案数","title_slug":"number-of-ways-to-split-a-string","rating":1590.547713663,"_hash":3464418220,"paid_only":false,"cont_title":"第 34 场双周赛","cont_title_slug":"biweekly-contest-34"},{"question_id":969,"title":"煎饼排序","title_slug":"pancake-sorting","rating":1590.5791055102,"_hash":1247027569,"paid_only":false,"cont_title":"第 118 场周赛","cont_title_slug":"weekly-contest-118"},{"question_id":1286,"title":"字母组合迭代器","title_slug":"iterator-for-combination","rating":1591.4725328821,"_hash":2534714311,"paid_only":false,"cont_title":"第 15 场双周赛","cont_title_slug":"biweekly-contest-15"},{"question_id":930,"title":"和相同的二元子数组","title_slug":"binary-subarrays-with-sum","rating":1591.5492530876,"_hash":1629689602,"paid_only":false,"cont_title":"第 108 场周赛","cont_title_slug":"weekly-contest-108"},{"question_id":1577,"title":"数的平方等于两数乘积的方法数","title_slug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers","rating":1593.8926580448,"_hash":1260215787,"paid_only":false,"cont_title":"第 205 场周赛","cont_title_slug":"weekly-contest-205"},{"question_id":2476,"title":"二叉搜索树最近节点查询","title_slug":"closest-nodes-queries-in-a-binary-search-tree","rating":1596.9852244916,"_hash":2732657659,"paid_only":false,"cont_title":"第 320 场周赛","cont_title_slug":"weekly-contest-320"},{"question_id":1247,"title":"交换字符使得字符串相同","title_slug":"minimum-swaps-to-make-strings-equal","rating":1597.0215918551,"_hash":3735372403,"paid_only":false,"cont_title":"第 161 场周赛","cont_title_slug":"weekly-contest-161"},{"question_id":1218,"title":"最长定差子序列","title_slug":"longest-arithmetic-subsequence-of-given-difference","rating":1597.1931473887,"_hash":1235853332,"paid_only":false,"cont_title":"第 157 场周赛","cont_title_slug":"weekly-contest-157"},{"question_id":2750,"title":"将数组划分成若干好子数组的方式","title_slug":"ways-to-split-array-into-good-subarrays","rating":1597.5718383661,"_hash":3518502488,"paid_only":false,"cont_title":"第 351 场周赛","cont_title_slug":"weekly-contest-351"},{"question_id":1048,"title":"最长字符串链","title_slug":"longest-string-chain","rating":1599.2720584736,"_hash":2048723677,"paid_only":false,"cont_title":"第 137 场周赛","cont_title_slug":"weekly-contest-137"},{"question_id":1864,"title":"构成交替字符串需要的最小交换次数","title_slug":"minimum-number-of-swaps-to-make-the-binary-string-alternating","rating":1600.5573262373,"_hash":1402633459,"paid_only":false,"cont_title":"第 241 场周赛","cont_title_slug":"weekly-contest-241"},{"question_id":926,"title":"将字符串翻转到单调递增","title_slug":"flip-string-to-monotone-increasing","rating":1601.511760532,"_hash":3457051682,"paid_only":false,"cont_title":"第 107 场周赛","cont_title_slug":"weekly-contest-107"},{"question_id":2249,"title":"统计圆内格点数目","title_slug":"count-lattice-points-inside-a-circle","rating":1602.7242171967,"_hash":2887915717,"paid_only":false,"cont_title":"第 290 场周赛","cont_title_slug":"weekly-contest-290"},{"question_id":2447,"title":"最大公因数等于 K 的子数组数目","title_slug":"number-of-subarrays-with-gcd-equal-to-k","rating":1602.7742849665,"_hash":4162714270,"paid_only":false,"cont_title":"第 316 场周赛","cont_title_slug":"weekly-contest-316"},{"question_id":2316,"title":"统计无向图中无法互相到达点对数","title_slug":"count-unreachable-pairs-of-nodes-in-an-undirected-graph","rating":1604.0695445163,"_hash":3627963576,"paid_only":false,"cont_title":"第 81 场双周赛","cont_title_slug":"biweekly-contest-81"},{"question_id":2424,"title":"最长上传前缀","title_slug":"longest-uploaded-prefix","rating":1604.1602280047,"_hash":718987035,"paid_only":false,"cont_title":"第 88 场双周赛","cont_title_slug":"biweekly-contest-88"},{"question_id":2522,"title":"将字符串分割成值不超过 K 的子字符串","title_slug":"partition-string-into-substrings-with-values-at-most-k","rating":1604.5128423093,"_hash":3561342867,"paid_only":false,"cont_title":"第 326 场周赛","cont_title_slug":"weekly-contest-326"},{"question_id":2546,"title":"执行逐位运算使字符串相等","title_slug":"apply-bitwise-operations-to-make-strings-equal","rating":1604.6299874552,"_hash":1537635707,"paid_only":false,"cont_title":"第 329 场周赛","cont_title_slug":"weekly-contest-329"},{"question_id":1604,"title":"警告一小时内使用相同员工卡大于等于三次的人","title_slug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period","rating":1606.2185826486,"_hash":1756727384,"paid_only":false,"cont_title":"第 36 场双周赛","cont_title_slug":"biweekly-contest-36"},{"question_id":1300,"title":"转变数组后最接近目标值的数组和","title_slug":"sum-of-mutated-array-closest-to-target","rating":1606.9895296459,"_hash":122134919,"paid_only":false,"cont_title":"第 16 场双周赛","cont_title_slug":"biweekly-contest-16"},{"question_id":1123,"title":"最深叶节点的最近公共祖先","title_slug":"lowest-common-ancestor-of-deepest-leaves","rating":1607.0005715974,"_hash":1997275023,"paid_only":false,"cont_title":"第 145 场周赛","cont_title_slug":"weekly-contest-145"},{"question_id":2745,"title":"构造最长的新字符串","title_slug":"construct-the-longest-new-string","rating":1607.4192947808,"_hash":4083216410,"paid_only":false,"cont_title":"第 107 场双周赛","cont_title_slug":"biweekly-contest-107"},{"question_id":2320,"title":"统计放置房子的方式数","title_slug":"count-number-of-ways-to-place-houses","rating":1607.7036437819,"_hash":2375816517,"paid_only":false,"cont_title":"第 299 场周赛","cont_title_slug":"weekly-contest-299"},{"question_id":962,"title":"最大宽度坡","title_slug":"maximum-width-ramp","rating":1607.80608595,"_hash":4064149855,"paid_only":false,"cont_title":"第 116 场周赛","cont_title_slug":"weekly-contest-116"},{"question_id":2567,"title":"修改两个元素的最小分数","title_slug":"minimum-score-by-changing-two-elements","rating":1608.577875807,"_hash":1785562293,"paid_only":false,"cont_title":"第 98 场双周赛","cont_title_slug":"biweekly-contest-98"},{"question_id":2438,"title":"二的幂数组中查询范围内的乘积","title_slug":"range-product-queries-of-powers","rating":1609.7858209851,"_hash":2397274802,"paid_only":false,"cont_title":"第 89 场双周赛","cont_title_slug":"biweekly-contest-89"},{"question_id":1670,"title":"设计前中后队列","title_slug":"design-front-middle-back-queue","rating":1610.1866391145,"_hash":1316461889,"paid_only":false,"cont_title":"第 40 场双周赛","cont_title_slug":"biweekly-contest-40"},{"question_id":1524,"title":"和为奇数的子数组数目","title_slug":"number-of-sub-arrays-with-odd-sum","rating":1610.569398159,"_hash":1757955047,"paid_only":false,"cont_title":"第 31 场双周赛","cont_title_slug":"biweekly-contest-31"},{"question_id":2232,"title":"向表达式添加括号后的最小结果","title_slug":"minimize-result-by-adding-parentheses-to-expression","rating":1611.8434720083,"_hash":989456575,"paid_only":false,"cont_title":"第 288 场周赛","cont_title_slug":"weekly-contest-288"},{"question_id":1277,"title":"统计全为 1 的正方形子矩阵","title_slug":"count-square-submatrices-with-all-ones","rating":1613.0429766636,"_hash":1057920854,"paid_only":false,"cont_title":"第 165 场周赛","cont_title_slug":"weekly-contest-165"},{"question_id":2766,"title":"重新放置石块","title_slug":"relocate-marbles","rating":1613.2485081262,"_hash":2818493377,"paid_only":false,"cont_title":"第 108 场双周赛","cont_title_slug":"biweekly-contest-108"},{"question_id":2145,"title":"统计隐藏数组数目","title_slug":"count-the-hidden-sequences","rating":1614.4877804672,"_hash":2108728330,"paid_only":false,"cont_title":"第 70 场双周赛","cont_title_slug":"biweekly-contest-70"},{"question_id":1020,"title":"飞地的数量","title_slug":"number-of-enclaves","rating":1615.4767730477,"_hash":1185092838,"paid_only":false,"cont_title":"第 130 场周赛","cont_title_slug":"weekly-contest-130"},{"question_id":2241,"title":"设计一个 ATM 机器","title_slug":"design-an-atm-machine","rating":1616.2067360638,"_hash":4007529944,"paid_only":false,"cont_title":"第 76 场双周赛","cont_title_slug":"biweekly-contest-76"},{"question_id":1503,"title":"所有蚂蚁掉下来前的最后一刻","title_slug":"last-moment-before-all-ants-fall-out-of-a-plank","rating":1618.6016480451,"_hash":1365148367,"paid_only":false,"cont_title":"第 196 场周赛","cont_title_slug":"weekly-contest-196"},{"question_id":2541,"title":"使数组中所有元素相等的最小操作数 II","title_slug":"minimum-operations-to-make-array-equal-ii","rating":1619.505461912,"_hash":2719928959,"paid_only":false,"cont_title":"第 96 场双周赛","cont_title_slug":"biweekly-contest-96"},{"question_id":2364,"title":"统计坏数对的数目","title_slug":"count-number-of-bad-pairs","rating":1622.2389577197,"_hash":809508462,"paid_only":false,"cont_title":"第 84 场双周赛","cont_title_slug":"biweekly-contest-84"},{"question_id":2425,"title":"所有数对的异或和","title_slug":"bitwise-xor-of-all-pairings","rating":1622.3970914116,"_hash":3786781582,"paid_only":false,"cont_title":"第 88 场双周赛","cont_title_slug":"biweekly-contest-88"},{"question_id":2365,"title":"任务调度器 II","title_slug":"task-scheduler-ii","rating":1622.7743864401,"_hash":3978152897,"paid_only":false,"cont_title":"第 84 场双周赛","cont_title_slug":"biweekly-contest-84"},{"question_id":2086,"title":"从房屋收集雨水需要的最少水桶数","title_slug":"minimum-number-of-food-buckets-to-feed-the-hamsters","rating":1622.8414025136,"_hash":463765609,"paid_only":false,"cont_title":"第 66 场双周赛","cont_title_slug":"biweekly-contest-66"},{"question_id":1248,"title":"统计「优美子数组」","title_slug":"count-number-of-nice-subarrays","rating":1623.9443250479,"_hash":2868656571,"paid_only":false,"cont_title":"第 161 场周赛","cont_title_slug":"weekly-contest-161"},{"question_id":916,"title":"单词子集","title_slug":"word-subsets","rating":1624.4737611923,"_hash":857697187,"paid_only":false,"cont_title":"第 104 场周赛","cont_title_slug":"weekly-contest-104"},{"question_id":2860,"title":"让所有学生保持开心的分组方法数","title_slug":"happy-students","rating":1625.7172632295,"_hash":3713605524,"paid_only":false,"cont_title":"第 363 场周赛","cont_title_slug":"weekly-contest-363"},{"question_id":2684,"title":"矩阵中移动的最大次数","title_slug":"maximum-number-of-moves-in-a-grid","rating":1625.9636825798,"_hash":1603806327,"paid_only":false,"cont_title":"第 345 场周赛","cont_title_slug":"weekly-contest-345"},{"question_id":1366,"title":"通过投票对团队排名","title_slug":"rank-teams-by-votes","rating":1626.3266982141,"_hash":2939618078,"paid_only":false,"cont_title":"第 178 场周赛","cont_title_slug":"weekly-contest-178"},{"question_id":1182,"title":"与目标颜色间的最短距离","title_slug":"shortest-distance-to-target-color","rating":1626.6740430119,"_hash":3960804215,"paid_only":false,"cont_title":"第 8 场双周赛","cont_title_slug":"biweekly-contest-8"},{"question_id":1332,"title":"删除回文子序列","title_slug":"remove-palindromic-subsequences","rating":1628.5072578803,"_hash":2153157695,"paid_only":false,"cont_title":"第 173 场周赛","cont_title_slug":"weekly-contest-173"},{"question_id":1680,"title":"连接连续二进制数字","title_slug":"concatenation-of-consecutive-binary-numbers","rating":1629.5416832545,"_hash":1734419421,"paid_only":false,"cont_title":"第 218 场周赛","cont_title_slug":"weekly-contest-218"},{"question_id":1540,"title":"K 次操作转变字符串","title_slug":"can-convert-string-in-k-moves","rating":1631.338145683,"_hash":3391560370,"paid_only":false,"cont_title":"第 32 场双周赛","cont_title_slug":"biweekly-contest-32"},{"question_id":2580,"title":"统计将重叠区间合并成组的方案数","title_slug":"count-ways-to-group-overlapping-ranges","rating":1631.5850830561,"_hash":4043601244,"paid_only":false,"cont_title":"第 99 场双周赛","cont_title_slug":"biweekly-contest-99"},{"question_id":1319,"title":"连通网络的操作次数","title_slug":"number-of-operations-to-make-network-connected","rating":1633.1372577433,"_hash":3681976285,"paid_only":false,"cont_title":"第 171 场周赛","cont_title_slug":"weekly-contest-171"},{"question_id":1053,"title":"交换一次的先前排列","title_slug":"previous-permutation-with-one-swap","rating":1633.1789521619,"_hash":3119606051,"paid_only":false,"cont_title":"第 138 场周赛","cont_title_slug":"weekly-contest-138"},{"question_id":1466,"title":"重新规划路线","title_slug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero","rating":1633.6202302555,"_hash":249521607,"paid_only":false,"cont_title":"第 191 场周赛","cont_title_slug":"weekly-contest-191"},{"question_id":2471,"title":"逐层排序二叉树所需的最少操作数目","title_slug":"minimum-number-of-operations-to-sort-a-binary-tree-by-level","rating":1635.1520858279,"_hash":629883391,"paid_only":false,"cont_title":"第 319 场周赛","cont_title_slug":"weekly-contest-319"},{"question_id":1899,"title":"合并若干三元组以形成目标三元组","title_slug":"merge-triplets-to-form-target-triplet","rating":1635.6879273926,"_hash":3990558875,"paid_only":false,"cont_title":"第 245 场周赛","cont_title_slug":"weekly-contest-245"},{"question_id":2384,"title":"最大回文数字","title_slug":"largest-palindromic-number","rating":1636.47322627,"_hash":70049056,"paid_only":false,"cont_title":"第 307 场周赛","cont_title_slug":"weekly-contest-307"},{"question_id":1386,"title":"安排电影院座位","title_slug":"cinema-seat-allocation","rating":1636.6877598712,"_hash":3214600049,"paid_only":false,"cont_title":"第 22 场双周赛","cont_title_slug":"biweekly-contest-22"},{"question_id":2512,"title":"奖励最顶尖的 K 名学生","title_slug":"reward-top-k-students","rating":1636.7472106213,"_hash":1295785983,"paid_only":false,"cont_title":"第 94 场双周赛","cont_title_slug":"biweekly-contest-94"},{"question_id":1558,"title":"得到目标数组的最少函数调用次数","title_slug":"minimum-numbers-of-function-calls-to-make-target-array","rating":1637.0082208814,"_hash":2725160392,"paid_only":false,"cont_title":"第 33 场双周赛","cont_title_slug":"biweekly-contest-33"},{"question_id":990,"title":"等式方程的可满足性","title_slug":"satisfiability-of-equality-equations","rating":1638.0148920643,"_hash":369209811,"paid_only":false,"cont_title":"第 123 场周赛","cont_title_slug":"weekly-contest-123"},{"question_id":838,"title":"推多米诺","title_slug":"push-dominoes","rating":1638.1281256708,"_hash":942356384,"paid_only":false,"cont_title":"第 85 场周赛","cont_title_slug":"weekly-contest-85"},{"question_id":1926,"title":"迷宫中离入口最近的出口","title_slug":"nearest-exit-from-entrance-in-maze","rating":1638.3134093066,"_hash":1229621552,"paid_only":false,"cont_title":"第 56 场双周赛","cont_title_slug":"biweekly-contest-56"},{"question_id":2779,"title":"数组的最大美丽值","title_slug":"maximum-beauty-of-an-array-after-applying-operation","rating":1638.4147703093,"_hash":1463471392,"paid_only":false,"cont_title":"第 354 场周赛","cont_title_slug":"weekly-contest-354"},{"question_id":2344,"title":"使数组可以被整除的最少删除次数","title_slug":"minimum-deletions-to-make-array-divisible","rating":1640.8976042503,"_hash":1620091732,"paid_only":false,"cont_title":"第 302 场周赛","cont_title_slug":"weekly-contest-302"},{"question_id":2187,"title":"完成旅途的最少时间","title_slug":"minimum-time-to-complete-trips","rating":1640.9591585343,"_hash":306595116,"paid_only":false,"cont_title":"第 282 场周赛","cont_title_slug":"weekly-contest-282"},{"question_id":2375,"title":"根据模式串构造最小数字","title_slug":"construct-smallest-number-from-di-string","rating":1641.9424376927,"_hash":2914198967,"paid_only":false,"cont_title":"第 306 场周赛","cont_title_slug":"weekly-contest-306"},{"question_id":2275,"title":"按位与结果大于零的最长组合","title_slug":"largest-combination-with-bitwise-and-greater-than-zero","rating":1642.1446933109,"_hash":1729291424,"paid_only":false,"cont_title":"第 293 场周赛","cont_title_slug":"weekly-contest-293"},{"question_id":2024,"title":"考试的最大困扰度","title_slug":"maximize-the-confusion-of-an-exam","rating":1643.1325351423,"_hash":2651875294,"paid_only":false,"cont_title":"第 62 场双周赛","cont_title_slug":"biweekly-contest-62"},{"question_id":2196,"title":"根据描述创建二叉树","title_slug":"create-binary-tree-from-descriptions","rating":1643.5283095007,"_hash":4088708677,"paid_only":false,"cont_title":"第 283 场周赛","cont_title_slug":"weekly-contest-283"},{"question_id":2226,"title":"每个小孩最多能分到多少糖果","title_slug":"maximum-candies-allocated-to-k-children","rating":1646.1765343383,"_hash":2412340751,"paid_only":false,"cont_title":"第 287 场周赛","cont_title_slug":"weekly-contest-287"},{"question_id":1358,"title":"包含所有三种字符的子字符串数目","title_slug":"number-of-substrings-containing-all-three-characters","rating":1646.1943237127,"_hash":3495355750,"paid_only":false,"cont_title":"第 20 场双周赛","cont_title_slug":"biweekly-contest-20"},{"question_id":1975,"title":"最大方阵和","title_slug":"maximum-matrix-sum","rating":1648.0880791614,"_hash":330899243,"paid_only":false,"cont_title":"第 59 场双周赛","cont_title_slug":"biweekly-contest-59"},{"question_id":870,"title":"优势洗牌","title_slug":"advantage-shuffle","rating":1648.341757882,"_hash":301734990,"paid_only":false,"cont_title":"第 93 场周赛","cont_title_slug":"weekly-contest-93"},{"question_id":2423,"title":"删除字符使频率相同","title_slug":"remove-letter-to-equalize-frequency","rating":1648.3540381514,"_hash":2197356984,"paid_only":false,"cont_title":"第 88 场双周赛","cont_title_slug":"biweekly-contest-88"},{"question_id":2571,"title":"将整数减少到零需要的最少操作数","title_slug":"minimum-operations-to-reduce-an-integer-to-0","rating":1649.2000410344,"_hash":676949389,"paid_only":false,"cont_title":"第 333 场周赛","cont_title_slug":"weekly-contest-333"},{"question_id":2523,"title":"范围内最接近的两个质数","title_slug":"closest-prime-numbers-in-range","rating":1649.7120733311,"_hash":3492742379,"paid_only":false,"cont_title":"第 326 场周赛","cont_title_slug":"weekly-contest-326"},{"question_id":1367,"title":"二叉树中的链表","title_slug":"linked-list-in-binary-tree","rating":1649.9728054796,"_hash":3956966956,"paid_only":false,"cont_title":"第 178 场周赛","cont_title_slug":"weekly-contest-178"},{"question_id":2343,"title":"裁剪数字后查询第 K 小的数字","title_slug":"query-kth-smallest-trimmed-number","rating":1651.569267834,"_hash":3981013694,"paid_only":false,"cont_title":"第 302 场周赛","cont_title_slug":"weekly-contest-302"},{"question_id":1311,"title":"获取你好友已观看的视频","title_slug":"get-watched-videos-by-your-friends","rating":1652.5809810428,"_hash":2521216381,"paid_only":false,"cont_title":"第 170 场周赛","cont_title_slug":"weekly-contest-170"},{"question_id":1509,"title":"三次操作后最大值与最小值的最小差","title_slug":"minimum-difference-between-largest-and-smallest-value-in-three-moves","rating":1653.0356626499,"_hash":929645229,"paid_only":false,"cont_title":"第 30 场双周赛","cont_title_slug":"biweekly-contest-30"},{"question_id":1155,"title":"掷骰子等于目标和的方法数","title_slug":"number-of-dice-rolls-with-target-sum","rating":1653.7337081336,"_hash":1676080206,"paid_only":false,"cont_title":"第 149 场周赛","cont_title_slug":"weekly-contest-149"},{"question_id":1257,"title":"最小公共区域","title_slug":"smallest-common-region","rating":1654.0793660142,"_hash":2731154173,"paid_only":false,"cont_title":"第 13 场双周赛","cont_title_slug":"biweekly-contest-13"},{"question_id":1004,"title":"最大连续1的个数 III","title_slug":"max-consecutive-ones-iii","rating":1655.6433885989,"_hash":296740468,"paid_only":false,"cont_title":"第 126 场周赛","cont_title_slug":"weekly-contest-126"},{"question_id":2222,"title":"选择建筑的方案数","title_slug":"number-of-ways-to-select-buildings","rating":1656.5588918365,"_hash":469490796,"paid_only":false,"cont_title":"第 75 场双周赛","cont_title_slug":"biweekly-contest-75"},{"question_id":1249,"title":"移除无效的括号","title_slug":"minimum-remove-to-make-valid-parentheses","rating":1657.1231739081,"_hash":4242473859,"paid_only":false,"cont_title":"第 161 场周赛","cont_title_slug":"weekly-contest-161"},{"question_id":3015,"title":"按距离统计房屋对数目 I","title_slug":"count-the-number-of-houses-at-a-certain-distance-i","rating":1657.5344546445,"_hash":1097720535,"paid_only":false,"cont_title":"第 381 场周赛","cont_title_slug":"weekly-contest-381"},{"question_id":1583,"title":"统计不开心的朋友","title_slug":"count-unhappy-friends","rating":1658.3305547865,"_hash":743759650,"paid_only":false,"cont_title":"第 206 场周赛","cont_title_slug":"weekly-contest-206"},{"question_id":1091,"title":"二进制矩阵中的最短路径","title_slug":"shortest-path-in-binary-matrix","rating":1658.3474650806,"_hash":1423912379,"paid_only":false,"cont_title":"第 141 场周赛","cont_title_slug":"weekly-contest-141"},{"question_id":2304,"title":"网格中的最小路径代价","title_slug":"minimum-path-cost-in-a-grid","rating":1658.3530344788,"_hash":730943544,"paid_only":false,"cont_title":"第 297 场周赛","cont_title_slug":"weekly-contest-297"},{"question_id":1958,"title":"检查操作是否合法","title_slug":"check-if-move-is-legal","rating":1658.5967147757,"_hash":4231095696,"paid_only":false,"cont_title":"第 58 场双周赛","cont_title_slug":"biweekly-contest-58"},{"question_id":1169,"title":"查询无效交易","title_slug":"invalid-transactions","rating":1658.6836278802,"_hash":3292810974,"paid_only":false,"cont_title":"第 151 场周赛","cont_title_slug":"weekly-contest-151"},{"question_id":1254,"title":"统计封闭岛屿的数目","title_slug":"number-of-closed-islands","rating":1658.7495899767,"_hash":1535345394,"paid_only":false,"cont_title":"第 162 场周赛","cont_title_slug":"weekly-contest-162"},{"question_id":2915,"title":"和为目标值的最长子序列的长度","title_slug":"length-of-the-longest-subsequence-that-sums-to-target","rating":1658.8190087768,"_hash":1032257843,"paid_only":false,"cont_title":"第 116 场双周赛","cont_title_slug":"biweekly-contest-116"},{"question_id":2195,"title":"向数组中追加 K 个整数","title_slug":"append-k-integers-with-minimal-sum","rating":1658.921022733,"_hash":430788454,"paid_only":false,"cont_title":"第 283 场周赛","cont_title_slug":"weekly-contest-283"},{"question_id":3029,"title":"将单词恢复初始状态所需的最短时间 I","title_slug":"minimum-time-to-revert-word-to-initial-state-i","rating":1659.6231386056,"_hash":2654590324,"paid_only":false,"cont_title":"第 383 场周赛","cont_title_slug":"weekly-contest-383"},{"question_id":2170,"title":"使数组变成交替数组的最少操作数","title_slug":"minimum-operations-to-make-the-array-alternating","rating":1662.6673692545,"_hash":884144873,"paid_only":false,"cont_title":"第 280 场周赛","cont_title_slug":"weekly-contest-280"},{"question_id":2550,"title":"猴子碰撞的方法数","title_slug":"count-collisions-of-monkeys-on-a-polygon","rating":1662.7075394144,"_hash":374282350,"paid_only":false,"cont_title":"第 330 场周赛","cont_title_slug":"weekly-contest-330"},{"question_id":863,"title":"二叉树中所有距离为 K 的结点","title_slug":"all-nodes-distance-k-in-binary-tree","rating":1663.1853149056,"_hash":2021376917,"paid_only":false,"cont_title":"第 91 场周赛","cont_title_slug":"weekly-contest-91"},{"question_id":1219,"title":"黄金矿工","title_slug":"path-with-maximum-gold","rating":1663.2612318917,"_hash":2579010831,"paid_only":false,"cont_title":"第 157 场周赛","cont_title_slug":"weekly-contest-157"},{"question_id":2063,"title":"所有子字符串中的元音","title_slug":"vowels-of-all-substrings","rating":1663.3912882908,"_hash":1180161064,"paid_only":false,"cont_title":"第 266 场周赛","cont_title_slug":"weekly-contest-266"},{"question_id":2611,"title":"老鼠和奶酪","title_slug":"mice-and-cheese","rating":1663.456591933,"_hash":3624743731,"paid_only":false,"cont_title":"第 339 场周赛","cont_title_slug":"weekly-contest-339"},{"question_id":1121,"title":"将数组分成几个递增序列","title_slug":"divide-array-into-increasing-sequences","rating":1664.7703749741,"_hash":2894413444,"paid_only":false,"cont_title":"第 4 场双周赛","cont_title_slug":"biweekly-contest-4"},{"question_id":2593,"title":"标记所有元素后数组的分数","title_slug":"find-score-of-an-array-after-marking-all-elements","rating":1665.1885910815,"_hash":3148467486,"paid_only":false,"cont_title":"第 100 场双周赛","cont_title_slug":"biweekly-contest-100"},{"question_id":1620,"title":"网络信号最好的坐标","title_slug":"coordinate-with-maximum-network-quality","rating":1665.24907247,"_hash":1092713458,"paid_only":false,"cont_title":"第 37 场双周赛","cont_title_slug":"biweekly-contest-37"},{"question_id":1162,"title":"地图分析","title_slug":"as-far-from-land-as-possible","rating":1666.346990979,"_hash":744773019,"paid_only":false,"cont_title":"第 150 场周赛","cont_title_slug":"weekly-contest-150"},{"question_id":1738,"title":"找出第 K 大的异或坐标值","title_slug":"find-kth-largest-xor-coordinate-value","rating":1671.4657554194,"_hash":3021563284,"paid_only":false,"cont_title":"第 225 场周赛","cont_title_slug":"weekly-contest-225"},{"question_id":2033,"title":"获取单值网格的最小操作数","title_slug":"minimum-operations-to-make-a-uni-value-grid","rating":1671.9261598,"_hash":684110909,"paid_only":false,"cont_title":"第 262 场周赛","cont_title_slug":"weekly-contest-262"},{"question_id":1438,"title":"绝对差不超过限制的最长连续子数组","title_slug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit","rating":1672.1678031263,"_hash":3188904029,"paid_only":false,"cont_title":"第 187 场周赛","cont_title_slug":"weekly-contest-187"},{"question_id":1215,"title":"步进数","title_slug":"stepping-numbers","rating":1674.5365205597,"_hash":2304874524,"paid_only":false,"cont_title":"第 10 场双周赛","cont_title_slug":"biweekly-contest-10"},{"question_id":1922,"title":"统计好数字的数目","title_slug":"count-good-numbers","rating":1674.7986939472,"_hash":1253336265,"paid_only":false,"cont_title":"第 248 场周赛","cont_title_slug":"weekly-contest-248"},{"question_id":1339,"title":"分裂二叉树的最大乘积","title_slug":"maximum-product-of-splitted-binary-tree","rating":1674.9985842835,"_hash":1257762070,"paid_only":false,"cont_title":"第 174 场周赛","cont_title_slug":"weekly-contest-174"},{"question_id":1870,"title":"准时到达的列车最小时速","title_slug":"minimum-speed-to-arrive-on-time","rating":1675.761234741,"_hash":2612530279,"paid_only":false,"cont_title":"第 242 场周赛","cont_title_slug":"weekly-contest-242"},{"question_id":987,"title":"二叉树的垂序遍历","title_slug":"vertical-order-traversal-of-a-binary-tree","rating":1675.9610355975,"_hash":3791950406,"paid_only":false,"cont_title":"第 122 场周赛","cont_title_slug":"weekly-contest-122"},{"question_id":974,"title":"和可被 K 整除的子数组","title_slug":"subarray-sums-divisible-by-k","rating":1675.989407584,"_hash":1023487571,"paid_only":false,"cont_title":"第 119 场周赛","cont_title_slug":"weekly-contest-119"},{"question_id":2641,"title":"二叉树的堂兄弟节点 II","title_slug":"cousins-in-binary-tree-ii","rating":1676.5007365375,"_hash":2279730191,"paid_only":false,"cont_title":"第 102 场双周赛","cont_title_slug":"biweekly-contest-102"},{"question_id":2943,"title":"最大化网格图中正方形空洞的面积","title_slug":"maximize-area-of-square-hole-in-grid","rating":1677.4559378473,"_hash":967980473,"paid_only":false,"cont_title":"第 118 场双周赛","cont_title_slug":"biweekly-contest-118"},{"question_id":853,"title":"车队","title_slug":"car-fleet","rating":1678.1133886034,"_hash":1478600712,"paid_only":false,"cont_title":"第 89 场周赛","cont_title_slug":"weekly-contest-89"},{"question_id":885,"title":"螺旋矩阵 III","title_slug":"spiral-matrix-iii","rating":1678.3947690537,"_hash":571559842,"paid_only":false,"cont_title":"第 97 场周赛","cont_title_slug":"weekly-contest-97"},{"question_id":2115,"title":"从给定原材料中找到所有可以做出的菜","title_slug":"find-all-possible-recipes-from-given-supplies","rating":1678.5871762113,"_hash":2182831583,"paid_only":false,"cont_title":"第 68 场双周赛","cont_title_slug":"biweekly-contest-68"},{"question_id":2317,"title":"操作后的最大异或和","title_slug":"maximum-xor-after-operations","rating":1678.6241816708,"_hash":1137942707,"paid_only":false,"cont_title":"第 81 场双周赛","cont_title_slug":"biweekly-contest-81"},{"question_id":2698,"title":"求一个整数的惩罚数","title_slug":"find-the-punishment-number-of-an-integer","rating":1678.6245760413,"_hash":2745040429,"paid_only":false,"cont_title":"第 346 场周赛","cont_title_slug":"weekly-contest-346"},{"question_id":1905,"title":"统计子岛屿","title_slug":"count-sub-islands","rating":1678.7231378948,"_hash":986520800,"paid_only":false,"cont_title":"第 246 场周赛","cont_title_slug":"weekly-contest-246"},{"question_id":1402,"title":"做菜顺序","title_slug":"reducing-dishes","rating":1679.2607152001,"_hash":3261672467,"paid_only":false,"cont_title":"第 23 场双周赛","cont_title_slug":"biweekly-contest-23"},{"question_id":2492,"title":"两个城市间路径的最小分数","title_slug":"minimum-score-of-a-path-between-two-cities","rating":1679.5737760149,"_hash":3337273246,"paid_only":false,"cont_title":"第 322 场周赛","cont_title_slug":"weekly-contest-322"},{"question_id":2457,"title":"美丽整数的最小增量","title_slug":"minimum-addition-to-make-integer-beautiful","rating":1680.0815931601,"_hash":2889905668,"paid_only":false,"cont_title":"第 317 场周赛","cont_title_slug":"weekly-contest-317"},{"question_id":2182,"title":"构造限制重复的字符串","title_slug":"construct-string-with-repeat-limit","rating":1680.1353258588,"_hash":1950501535,"paid_only":false,"cont_title":"第 281 场周赛","cont_title_slug":"weekly-contest-281"},{"question_id":1031,"title":"两个非重叠子数组的最大和","title_slug":"maximum-sum-of-two-non-overlapping-subarrays","rating":1680.4852623991,"_hash":3974822873,"paid_only":false,"cont_title":"第 133 场周赛","cont_title_slug":"weekly-contest-133"},{"question_id":1865,"title":"找出和为指定值的下标对","title_slug":"finding-pairs-with-a-certain-sum","rating":1680.82425993,"_hash":1859819274,"paid_only":false,"cont_title":"第 241 场周赛","cont_title_slug":"weekly-contest-241"},{"question_id":2280,"title":"表示一个折线图的最少线段数","title_slug":"minimum-lines-to-represent-a-line-chart","rating":1680.866917849,"_hash":1538966566,"paid_only":false,"cont_title":"第 294 场周赛","cont_title_slug":"weekly-contest-294"},{"question_id":2497,"title":"图中最大星和","title_slug":"maximum-star-sum-of-a-graph","rating":1682.16892078,"_hash":1275579259,"paid_only":false,"cont_title":"第 93 场双周赛","cont_title_slug":"biweekly-contest-93"},{"question_id":1443,"title":"收集树上所有苹果的最少时间","title_slug":"minimum-time-to-collect-all-apples-in-a-tree","rating":1682.8882177724,"_hash":943252793,"paid_only":false,"cont_title":"第 188 场周赛","cont_title_slug":"weekly-contest-188"},{"question_id":2074,"title":"反转偶数长度组的节点","title_slug":"reverse-nodes-in-even-length-groups","rating":1685.3599641299,"_hash":1103286328,"paid_only":false,"cont_title":"第 267 场周赛","cont_title_slug":"weekly-contest-267"},{"question_id":2233,"title":"K 次增加后的最大乘积","title_slug":"maximum-product-after-k-increments","rating":1685.5389350949,"_hash":1255527945,"paid_only":false,"cont_title":"第 288 场周赛","cont_title_slug":"weekly-contest-288"},{"question_id":950,"title":"按递增顺序显示卡牌","title_slug":"reveal-cards-in-increasing-order","rating":1686.4493679523,"_hash":1319672571,"paid_only":false,"cont_title":"第 113 场周赛","cont_title_slug":"weekly-contest-113"},{"question_id":1963,"title":"使字符串平衡的最小交换次数","title_slug":"minimum-number-of-swaps-to-make-the-string-balanced","rating":1688.9209684568,"_hash":1518041298,"paid_only":false,"cont_title":"第 253 场周赛","cont_title_slug":"weekly-contest-253"},{"question_id":1419,"title":"数青蛙","title_slug":"minimum-number-of-frogs-croaking","rating":1689.7569144085,"_hash":1565798166,"paid_only":false,"cont_title":"第 185 场周赛","cont_title_slug":"weekly-contest-185"},{"question_id":935,"title":"骑士拨号器","title_slug":"knight-dialer","rating":1690.1655236843,"_hash":2786534786,"paid_only":false,"cont_title":"第 109 场周赛","cont_title_slug":"weekly-contest-109"},{"question_id":919,"title":"完全二叉树插入器","title_slug":"complete-binary-tree-inserter","rating":1690.9043557462,"_hash":3341470372,"paid_only":false,"cont_title":"第 105 场周赛","cont_title_slug":"weekly-contest-105"},{"question_id":1462,"title":"课程表 IV","title_slug":"course-schedule-iv","rating":1692.5884631801,"_hash":2046402802,"paid_only":false,"cont_title":"第 27 场双周赛","cont_title_slug":"biweekly-contest-27"},{"question_id":2337,"title":"移动片段得到字符串","title_slug":"move-pieces-to-obtain-a-string","rating":1693.4495728383,"_hash":255657392,"paid_only":false,"cont_title":"第 301 场周赛","cont_title_slug":"weekly-contest-301"},{"question_id":2466,"title":"统计构造好字符串的方案数","title_slug":"count-ways-to-build-good-strings","rating":1694.4308657594,"_hash":4245137983,"paid_only":false,"cont_title":"第 91 场双周赛","cont_title_slug":"biweekly-contest-91"},{"question_id":829,"title":"连续整数求和","title_slug":"consecutive-numbers-sum","rating":1694.433951503,"_hash":2377767456,"paid_only":false,"cont_title":"第 83 场周赛","cont_title_slug":"weekly-contest-83"},{"question_id":2420,"title":"找到所有好下标","title_slug":"find-all-good-indices","rating":1695.0815222626,"_hash":3422315602,"paid_only":false,"cont_title":"第 312 场周赛","cont_title_slug":"weekly-contest-312"},{"question_id":1942,"title":"最小未被占据椅子的编号","title_slug":"the-number-of-the-smallest-unoccupied-chair","rating":1695.2832486322,"_hash":2532708840,"paid_only":false,"cont_title":"第 57 场双周赛","cont_title_slug":"biweekly-contest-57"},{"question_id":2588,"title":"统计美丽子数组数目","title_slug":"count-the-number-of-beautiful-subarrays","rating":1696.8895579594,"_hash":3474039417,"paid_only":false,"cont_title":"第 336 场周赛","cont_title_slug":"weekly-contest-336"},{"question_id":1487,"title":"保证文件名唯一","title_slug":"making-file-names-unique","rating":1696.9920075471,"_hash":3554577128,"paid_only":false,"cont_title":"第 194 场周赛","cont_title_slug":"weekly-contest-194"},{"question_id":1289,"title":"下降路径最小和 II","title_slug":"minimum-falling-path-sum-ii","rating":1697.2356875149,"_hash":2588489114,"paid_only":false,"cont_title":"第 15 场双周赛","cont_title_slug":"biweekly-contest-15"},{"question_id":1017,"title":"负二进制转换","title_slug":"convert-to-base-2","rating":1697.8500495479,"_hash":704152903,"paid_only":false,"cont_title":"第 130 场周赛","cont_title_slug":"weekly-contest-130"},{"question_id":2962,"title":"统计最大元素出现至少 K 次的子数组","title_slug":"count-subarrays-where-max-element-appears-at-least-k-times","rating":1700.8505554268,"_hash":1658221095,"paid_only":false,"cont_title":"第 375 场周赛","cont_title_slug":"weekly-contest-375"},{"question_id":2929,"title":"给小朋友们分糖果 II","title_slug":"distribute-candies-among-children-ii","rating":1701.4341867571,"_hash":2228358934,"paid_only":false,"cont_title":"第 117 场双周赛","cont_title_slug":"biweekly-contest-117"},{"question_id":1054,"title":"距离相等的条形码","title_slug":"distant-barcodes","rating":1701.5735371897,"_hash":2024934932,"paid_only":false,"cont_title":"第 138 场周赛","cont_title_slug":"weekly-contest-138"},{"question_id":1774,"title":"最接近目标价格的甜点成本","title_slug":"closest-dessert-cost","rating":1701.7584658834,"_hash":4279348799,"paid_only":false,"cont_title":"第 230 场周赛","cont_title_slug":"weekly-contest-230"},{"question_id":2080,"title":"区间内查询数字的频率","title_slug":"range-frequency-queries","rating":1702.4387527636,"_hash":2460331500,"paid_only":false,"cont_title":"第 268 场周赛","cont_title_slug":"weekly-contest-268"},{"question_id":2100,"title":"适合野炊的日子","title_slug":"find-good-days-to-rob-the-bank","rating":1702.4962514406,"_hash":2252317011,"paid_only":false,"cont_title":"第 67 场双周赛","cont_title_slug":"biweekly-contest-67"},{"question_id":958,"title":"二叉树的完全性检验","title_slug":"check-completeness-of-a-binary-tree","rating":1702.8035923458,"_hash":4172058127,"paid_only":false,"cont_title":"第 115 场周赛","cont_title_slug":"weekly-contest-115"},{"question_id":1947,"title":"最大兼容性评分和","title_slug":"maximum-compatibility-score-sum","rating":1704.360891641,"_hash":889856657,"paid_only":false,"cont_title":"第 251 场周赛","cont_title_slug":"weekly-contest-251"},{"question_id":2672,"title":"有相同颜色的相邻元素数目","title_slug":"number-of-adjacent-elements-with-the-same-color","rating":1705.2545641354,"_hash":1725183127,"paid_only":false,"cont_title":"第 344 场周赛","cont_title_slug":"weekly-contest-344"},{"question_id":3025,"title":"人员站位的方案数 I","title_slug":"find-the-number-of-ways-to-place-people-i","rating":1707.4309979043,"_hash":442815761,"paid_only":false,"cont_title":"第 123 场双周赛","cont_title_slug":"biweekly-contest-123"},{"question_id":2257,"title":"统计网格图中没有被保卫的格子数","title_slug":"count-unguarded-cells-in-the-grid","rating":1708.7056764058,"_hash":2771270445,"paid_only":false,"cont_title":"第 77 场双周赛","cont_title_slug":"biweekly-contest-77"},{"question_id":901,"title":"股票价格跨度","title_slug":"online-stock-span","rating":1708.8735585776,"_hash":613691832,"paid_only":false,"cont_title":"第 101 场周赛","cont_title_slug":"weekly-contest-101"},{"question_id":2944,"title":"购买水果需要的最少金币数","title_slug":"minimum-number-of-coins-for-fruits","rating":1708.9663754668,"_hash":1140950686,"paid_only":false,"cont_title":"第 118 场双周赛","cont_title_slug":"biweekly-contest-118"},{"question_id":1401,"title":"圆和矩形是否有重叠","title_slug":"circle-and-rectangle-overlapping","rating":1708.9983361411,"_hash":1192302071,"paid_only":false,"cont_title":"第 23 场双周赛","cont_title_slug":"biweekly-contest-23"},{"question_id":2140,"title":"解决智力问题","title_slug":"solving-questions-with-brainpower","rating":1709.1054732427,"_hash":3742724136,"paid_only":false,"cont_title":"第 276 场周赛","cont_title_slug":"weekly-contest-276"},{"question_id":979,"title":"在二叉树中分配硬币","title_slug":"distribute-coins-in-binary-tree","rating":1709.1461451873,"_hash":2734248382,"paid_only":false,"cont_title":"第 120 场周赛","cont_title_slug":"weekly-contest-120"},{"question_id":1136,"title":"并行课程","title_slug":"parallel-courses","rating":1710.0787625377,"_hash":1009688921,"paid_only":false,"cont_title":"第 5 场双周赛","cont_title_slug":"biweekly-contest-5"},{"question_id":1567,"title":"乘积为正数的最长子数组长度","title_slug":"maximum-length-of-subarray-with-positive-product","rating":1710.3243520032,"_hash":2678350009,"paid_only":false,"cont_title":"第 204 场周赛","cont_title_slug":"weekly-contest-204"},{"question_id":923,"title":"三数之和的多种可能","title_slug":"3sum-with-multiplicity","rating":1710.9105378431,"_hash":352505600,"paid_only":false,"cont_title":"第 106 场周赛","cont_title_slug":"weekly-contest-106"},{"question_id":1801,"title":"积压订单中的订单总数","title_slug":"number-of-orders-in-the-backlog","rating":1711.1205064321,"_hash":3504355376,"paid_only":false,"cont_title":"第 233 场周赛","cont_title_slug":"weekly-contest-233"},{"question_id":2385,"title":"感染二叉树需要的总时间","title_slug":"amount-of-time-for-binary-tree-to-be-infected","rating":1711.4873176824,"_hash":2321913205,"paid_only":false,"cont_title":"第 307 场周赛","cont_title_slug":"weekly-contest-307"},{"question_id":1042,"title":"不邻接植花","title_slug":"flower-planting-with-no-adjacent","rating":1712.4010133221,"_hash":2386982504,"paid_only":false,"cont_title":"第 136 场周赛","cont_title_slug":"weekly-contest-136"},{"question_id":1372,"title":"二叉树中的最长交错路径","title_slug":"longest-zigzag-path-in-a-binary-tree","rating":1713.2768268466,"_hash":3877013643,"paid_only":false,"cont_title":"第 21 场双周赛","cont_title_slug":"biweekly-contest-21"},{"question_id":2406,"title":"将区间分为最少组数","title_slug":"divide-intervals-into-minimum-number-of-groups","rating":1713.3954468582,"_hash":1620554900,"paid_only":false,"cont_title":"第 310 场周赛","cont_title_slug":"weekly-contest-310"},{"question_id":1781,"title":"所有子字符串美丽值之和","title_slug":"sum-of-beauty-of-all-substrings","rating":1714.6960124182,"_hash":2430259702,"paid_only":false,"cont_title":"第 47 场双周赛","cont_title_slug":"biweekly-contest-47"},{"question_id":2359,"title":"找到离给定两个节点最近的节点","title_slug":"find-closest-node-to-given-two-nodes","rating":1714.992763701,"_hash":1024461884,"paid_only":false,"cont_title":"第 304 场周赛","cont_title_slug":"weekly-contest-304"},{"question_id":2202,"title":"K 次操作后最大化顶端元素","title_slug":"maximize-the-topmost-element-after-k-moves","rating":1716.9721777,"_hash":927068521,"paid_only":false,"cont_title":"第 284 场周赛","cont_title_slug":"weekly-contest-284"},{"question_id":2397,"title":"被列覆盖的最多行数","title_slug":"maximum-rows-covered-by-columns","rating":1718.8256321624,"_hash":1913049602,"paid_only":false,"cont_title":"第 86 场双周赛","cont_title_slug":"biweekly-contest-86"},{"question_id":2017,"title":"网格游戏","title_slug":"grid-game","rating":1718.9772466681,"_hash":3098562302,"paid_only":false,"cont_title":"第 260 场周赛","cont_title_slug":"weekly-contest-260"},{"question_id":1239,"title":"串联字符串的最大长度","title_slug":"maximum-length-of-a-concatenated-string-with-unique-characters","rating":1719.945199874,"_hash":4259911866,"paid_only":false,"cont_title":"第 160 场周赛","cont_title_slug":"weekly-contest-160"},{"question_id":2563,"title":"统计公平数对的数目","title_slug":"count-the-number-of-fair-pairs","rating":1720.7470612766,"_hash":2019191135,"paid_only":false,"cont_title":"第 332 场周赛","cont_title_slug":"weekly-contest-332"},{"question_id":2826,"title":"将三个组排序","title_slug":"sorting-three-groups","rating":1721.1964988483,"_hash":268097121,"paid_only":false,"cont_title":"第 111 场双周赛","cont_title_slug":"biweekly-contest-111"},{"question_id":1197,"title":"进击的骑士","title_slug":"minimum-knight-moves","rating":1722.3088173214,"_hash":3077259720,"paid_only":false,"cont_title":"第 9 场双周赛","cont_title_slug":"biweekly-contest-9"},{"question_id":1359,"title":"有效的快递序列数目","title_slug":"count-all-valid-pickup-and-delivery-options","rating":1722.8129701098,"_hash":3432459628,"paid_only":false,"cont_title":"第 20 场双周赛","cont_title_slug":"biweekly-contest-20"},{"question_id":2070,"title":"每一个查询的最大美丽值","title_slug":"most-beautiful-item-for-each-query","rating":1724.1545485476,"_hash":1066025257,"paid_only":false,"cont_title":"第 65 场双周赛","cont_title_slug":"biweekly-contest-65"},{"question_id":2261,"title":"含最多 K 个可整除元素的子数组","title_slug":"k-divisible-elements-subarrays","rating":1724.394164934,"_hash":2169721379,"paid_only":false,"cont_title":"第 291 场周赛","cont_title_slug":"weekly-contest-291"},{"question_id":2416,"title":"字符串的前缀分数和","title_slug":"sum-of-prefix-scores-of-strings","rating":1725.1995150882,"_hash":2425741756,"paid_only":false,"cont_title":"第 311 场周赛","cont_title_slug":"weekly-contest-311"},{"question_id":1011,"title":"在 D 天内送达包裹的能力","title_slug":"capacity-to-ship-packages-within-d-days","rating":1725.4481937307,"_hash":3609066875,"paid_only":false,"cont_title":"第 128 场周赛","cont_title_slug":"weekly-contest-128"},{"question_id":1220,"title":"统计元音字母序列的数目","title_slug":"count-vowels-permutation","rating":1729.6074000215,"_hash":4278798036,"paid_only":false,"cont_title":"第 157 场周赛","cont_title_slug":"weekly-contest-157"},{"question_id":1014,"title":"最佳观光组合","title_slug":"best-sightseeing-pair","rating":1730.3052054913,"_hash":212376193,"paid_only":false,"cont_title":"第 129 场周赛","cont_title_slug":"weekly-contest-129"},{"question_id":889,"title":"根据前序和后序遍历构造二叉树","title_slug":"construct-binary-tree-from-preorder-and-postorder-traversal","rating":1731.5555445321,"_hash":3152421262,"paid_only":false,"cont_title":"第 98 场周赛","cont_title_slug":"weekly-contest-98"},{"question_id":2786,"title":"访问数组中的位置使分数最大","title_slug":"visit-array-positions-to-maximize-score","rating":1732.5146472785,"_hash":3694289041,"paid_only":false,"cont_title":"第 109 场双周赛","cont_title_slug":"biweekly-contest-109"},{"question_id":1273,"title":"删除树节点","title_slug":"delete-tree-nodes","rating":1732.7813534239,"_hash":333630853,"paid_only":false,"cont_title":"第 14 场双周赛","cont_title_slug":"biweekly-contest-14"},{"question_id":2048,"title":"下一个更大的数值平衡数","title_slug":"next-greater-numerically-balanced-number","rating":1734.0550202798,"_hash":1204660336,"paid_only":false,"cont_title":"第 264 场周赛","cont_title_slug":"weekly-contest-264"},{"question_id":1292,"title":"元素和小于等于阈值的正方形的最大边长","title_slug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold","rating":1734.8208369949,"_hash":2041342956,"paid_only":false,"cont_title":"第 167 场周赛","cont_title_slug":"weekly-contest-167"},{"question_id":2707,"title":"字符串中的额外字符","title_slug":"extra-characters-in-a-string","rating":1735.8505509901,"_hash":1779771436,"paid_only":false,"cont_title":"第 105 场双周赛","cont_title_slug":"biweekly-contest-105"},{"question_id":1814,"title":"统计一个数组中好对子的数目","title_slug":"count-nice-pairs-in-an-array","rating":1737.8431142688,"_hash":1480696010,"paid_only":false,"cont_title":"第 49 场双周赛","cont_title_slug":"biweekly-contest-49"},{"question_id":1593,"title":"拆分字符串使唯一子字符串的数目最大","title_slug":"split-a-string-into-the-max-number-of-unique-substrings","rating":1739.5831401172,"_hash":1236982780,"paid_only":false,"cont_title":"第 207 场周赛","cont_title_slug":"weekly-contest-207"},{"question_id":1079,"title":"活字印刷","title_slug":"letter-tile-possibilities","rating":1740.5014205942,"_hash":3654833214,"paid_only":false,"cont_title":"第 140 场周赛","cont_title_slug":"weekly-contest-140"},{"question_id":3020,"title":"子集中元素的最大数量","title_slug":"find-the-maximum-number-of-elements-in-subset","rating":1741.3694833067,"_hash":3880011182,"paid_only":false,"cont_title":"第 382 场周赛","cont_title_slug":"weekly-contest-382"},{"question_id":1145,"title":"二叉树着色游戏","title_slug":"binary-tree-coloring-game","rating":1741.4527995252,"_hash":110135796,"paid_only":false,"cont_title":"第 148 场周赛","cont_title_slug":"weekly-contest-148"},{"question_id":2087,"title":"网格图中机器人回家的最小代价","title_slug":"minimum-cost-homecoming-of-a-robot-in-a-grid","rating":1743.731976554,"_hash":592826714,"paid_only":false,"cont_title":"第 66 场双周赛","cont_title_slug":"biweekly-contest-66"},{"question_id":1139,"title":"最大的以 1 为边界的正方形","title_slug":"largest-1-bordered-square","rating":1744.0388789755,"_hash":1167299665,"paid_only":false,"cont_title":"第 147 场周赛","cont_title_slug":"weekly-contest-147"},{"question_id":1638,"title":"统计只差一个字符的子串数目","title_slug":"count-substrings-that-differ-by-one-character","rating":1744.7611048301,"_hash":3230369611,"paid_only":false,"cont_title":"第 38 场双周赛","cont_title_slug":"biweekly-contest-38"},{"question_id":2502,"title":"设计内存分配器","title_slug":"design-memory-allocator","rating":1745.5352025872,"_hash":1579629689,"paid_only":false,"cont_title":"第 323 场周赛","cont_title_slug":"weekly-contest-323"},{"question_id":1391,"title":"检查网格中是否存在有效路径","title_slug":"check-if-there-is-a-valid-path-in-a-grid","rating":1745.6490739887,"_hash":650356357,"paid_only":false,"cont_title":"第 181 场周赛","cont_title_slug":"weekly-contest-181"},{"question_id":1530,"title":"好叶子节点对的数量","title_slug":"number-of-good-leaf-nodes-pairs","rating":1745.6580748712,"_hash":909563687,"paid_only":false,"cont_title":"第 199 场周赛","cont_title_slug":"weekly-contest-199"},{"question_id":1024,"title":"视频拼接","title_slug":"video-stitching","rating":1746.135917977,"_hash":2812871030,"paid_only":false,"cont_title":"第 131 场周赛","cont_title_slug":"weekly-contest-131"},{"question_id":1849,"title":"将字符串拆分为递减的连续值","title_slug":"splitting-a-string-into-descending-consecutive-values","rating":1746.8757919578,"_hash":576619521,"paid_only":false,"cont_title":"第 239 场周赛","cont_title_slug":"weekly-contest-239"},{"question_id":1191,"title":"K 次串联后最大子数组之和","title_slug":"k-concatenation-maximum-sum","rating":1747.6755111029,"_hash":65111910,"paid_only":false,"cont_title":"第 154 场周赛","cont_title_slug":"weekly-contest-154"},{"question_id":2171,"title":"拿出最少数目的魔法豆","title_slug":"removing-minimum-number-of-magic-beans","rating":1748.1339100823,"_hash":2260151323,"paid_only":false,"cont_title":"第 280 场周赛","cont_title_slug":"weekly-contest-280"},{"question_id":1297,"title":"子串的最大出现次数","title_slug":"maximum-number-of-occurrences-of-a-substring","rating":1748.1523771585,"_hash":625709572,"paid_only":false,"cont_title":"第 168 场周赛","cont_title_slug":"weekly-contest-168"},{"question_id":2134,"title":"最少交换次数来组合所有的 1 II","title_slug":"minimum-swaps-to-group-all-1s-together-ii","rating":1748.4522689101,"_hash":107547857,"paid_only":false,"cont_title":"第 275 场周赛","cont_title_slug":"weekly-contest-275"},{"question_id":1111,"title":"有效括号的嵌套深度","title_slug":"maximum-nesting-depth-of-two-valid-parentheses-strings","rating":1749.4981778209,"_hash":3619796334,"paid_only":false,"cont_title":"第 144 场周赛","cont_title_slug":"weekly-contest-144"},{"question_id":2871,"title":"将数组分割成最多数目的子数组","title_slug":"split-array-into-maximum-number-of-subarrays","rating":1749.5115037045,"_hash":1204439806,"paid_only":false,"cont_title":"第 114 场双周赛","cont_title_slug":"biweekly-contest-114"},{"question_id":2401,"title":"最长优雅子数组","title_slug":"longest-nice-subarray","rating":1749.5432375672,"_hash":3355469687,"paid_only":false,"cont_title":"第 309 场周赛","cont_title_slug":"weekly-contest-309"},{"question_id":2856,"title":"删除数对后的最小数组长度","title_slug":"minimum-array-length-after-pair-removals","rating":1749.9743684275,"_hash":1304985926,"paid_only":false,"cont_title":"第 113 场双周赛","cont_title_slug":"biweekly-contest-113"},{"question_id":2400,"title":"恰好移动 k 步到达某一位置的方法数目","title_slug":"number-of-ways-to-reach-a-position-after-exactly-k-steps","rating":1751.115625465,"_hash":3867293007,"paid_only":false,"cont_title":"第 309 场周赛","cont_title_slug":"weekly-contest-309"},{"question_id":2166,"title":"设计位集","title_slug":"design-bitset","rating":1751.5101577001,"_hash":2504097527,"paid_only":false,"cont_title":"第 279 场周赛","cont_title_slug":"weekly-contest-279"},{"question_id":939,"title":"最小面积矩形","title_slug":"minimum-area-rectangle","rating":1752.2621077596,"_hash":1965686195,"paid_only":false,"cont_title":"第 110 场周赛","cont_title_slug":"weekly-contest-110"},{"question_id":1135,"title":"最低成本连通所有城市","title_slug":"connecting-cities-with-minimum-cost","rating":1752.9555725796,"_hash":282466705,"paid_only":false,"cont_title":"第 5 场双周赛","cont_title_slug":"biweekly-contest-5"},{"question_id":1216,"title":"验证回文串 III","title_slug":"valid-palindrome-iii","rating":1753.9062487685,"_hash":4136678159,"paid_only":false,"cont_title":"第 10 场双周赛","cont_title_slug":"biweekly-contest-10"},{"question_id":2568,"title":"最小无法得到的或值","title_slug":"minimum-impossible-or","rating":1754.1710323358,"_hash":1363446915,"paid_only":false,"cont_title":"第 98 场双周赛","cont_title_slug":"biweekly-contest-98"},{"question_id":1954,"title":"收集足够苹果的最小花园周长","title_slug":"minimum-garden-perimeter-to-collect-enough-apples","rating":1758.5135073787,"_hash":601450429,"paid_only":false,"cont_title":"第 252 场周赛","cont_title_slug":"weekly-contest-252"},{"question_id":1027,"title":"最长等差数列","title_slug":"longest-arithmetic-subsequence","rating":1758.75255141,"_hash":4193739814,"paid_only":false,"cont_title":"第 132 场周赛","cont_title_slug":"weekly-contest-132"},{"question_id":1541,"title":"平衡括号字符串的最少插入次数","title_slug":"minimum-insertions-to-balance-a-parentheses-string","rating":1759.0197295594,"_hash":268274286,"paid_only":false,"cont_title":"第 32 场双周赛","cont_title_slug":"biweekly-contest-32"},{"question_id":2498,"title":"青蛙过河 II","title_slug":"frog-jump-ii","rating":1759.0470795449,"_hash":2772831251,"paid_only":false,"cont_title":"第 93 场双周赛","cont_title_slug":"biweekly-contest-93"},{"question_id":2075,"title":"解码斜向换位密码","title_slug":"decode-the-slanted-ciphertext","rating":1759.2287478055,"_hash":1997404036,"paid_only":false,"cont_title":"第 267 场周赛","cont_title_slug":"weekly-contest-267"},{"question_id":2121,"title":"相同元素的间隔之和","title_slug":"intervals-between-identical-elements","rating":1760.9131492436,"_hash":3607071844,"paid_only":false,"cont_title":"第 273 场周赛","cont_title_slug":"weekly-contest-273"},{"question_id":2453,"title":"摧毁一系列目标","title_slug":"destroy-sequential-targets","rating":1761.9162628125,"_hash":3946751496,"paid_only":false,"cont_title":"第 90 场双周赛","cont_title_slug":"biweekly-contest-90"},{"question_id":1262,"title":"可被三整除的最大和","title_slug":"greatest-sum-divisible-by-three","rating":1762.0307532652,"_hash":2001540741,"paid_only":false,"cont_title":"第 163 场周赛","cont_title_slug":"weekly-contest-163"},{"question_id":948,"title":"令牌放置","title_slug":"bag-of-tokens","rating":1762.3115124143,"_hash":2688493082,"paid_only":false,"cont_title":"第 112 场周赛","cont_title_slug":"weekly-contest-112"},{"question_id":2462,"title":"雇佣 K 位工人的总代价","title_slug":"total-cost-to-hire-k-workers","rating":1763.6404758359,"_hash":2730930360,"paid_only":false,"cont_title":"第 318 场周赛","cont_title_slug":"weekly-contest-318"},{"question_id":2905,"title":"找出满足差值条件的下标 II","title_slug":"find-indices-with-index-and-value-difference-ii","rating":1763.787679959,"_hash":830799973,"paid_only":false,"cont_title":"第 367 场周赛","cont_title_slug":"weekly-contest-367"},{"question_id":1706,"title":"球会落何处","title_slug":"where-will-the-ball-fall","rating":1764.9170564773,"_hash":4006941957,"paid_only":false,"cont_title":"第 221 场周赛","cont_title_slug":"weekly-contest-221"},{"question_id":875,"title":"爱吃香蕉的珂珂","title_slug":"koko-eating-bananas","rating":1765.5654059263,"_hash":2370285073,"paid_only":false,"cont_title":"第 94 场周赛","cont_title_slug":"weekly-contest-94"},{"question_id":1914,"title":"循环轮转矩阵","title_slug":"cyclically-rotating-a-grid","rating":1766.2506177612,"_hash":1526363744,"paid_only":false,"cont_title":"第 247 场周赛","cont_title_slug":"weekly-contest-247"},{"question_id":1600,"title":"王位继承顺序","title_slug":"throne-inheritance","rating":1768.623896829,"_hash":3383805178,"paid_only":false,"cont_title":"第 208 场周赛","cont_title_slug":"weekly-contest-208"},{"question_id":2718,"title":"查询后矩阵的和","title_slug":"sum-of-matrix-after-queries","rating":1768.9138093037,"_hash":3363685518,"paid_only":false,"cont_title":"第 348 场周赛","cont_title_slug":"weekly-contest-348"},{"question_id":2685,"title":"统计完全连通分量的数量","title_slug":"count-the-number-of-complete-components","rating":1769.4344566771,"_hash":1502620621,"paid_only":false,"cont_title":"第 345 场周赛","cont_title_slug":"weekly-contest-345"},{"question_id":1146,"title":"快照数组","title_slug":"snapshot-array","rating":1770.8924569497,"_hash":4187877981,"paid_only":false,"cont_title":"第 148 场周赛","cont_title_slug":"weekly-contest-148"},{"question_id":2982,"title":"找出出现至少三次的最长特殊子字符串 II","title_slug":"find-longest-special-substring-that-occurs-thrice-ii","rating":1772.9528456848,"_hash":2573075022,"paid_only":false,"cont_title":"第 378 场周赛","cont_title_slug":"weekly-contest-378"},{"question_id":1238,"title":"循环码排列","title_slug":"circular-permutation-in-binary-representation","rating":1774.8764591297,"_hash":1210001971,"paid_only":false,"cont_title":"第 160 场周赛","cont_title_slug":"weekly-contest-160"},{"question_id":2531,"title":"使字符串中不同字符的数目相等","title_slug":"make-number-of-distinct-characters-equal","rating":1775.854606648,"_hash":485006616,"paid_only":false,"cont_title":"第 327 场周赛","cont_title_slug":"weekly-contest-327"},{"question_id":918,"title":"环形子数组的最大和","title_slug":"maximum-sum-circular-subarray","rating":1777.3786570233,"_hash":3263594037,"paid_only":false,"cont_title":"第 105 场周赛","cont_title_slug":"weekly-contest-105"},{"question_id":1824,"title":"最少侧跳次数","title_slug":"minimum-sideway-jumps","rating":1778.4880620629,"_hash":3943793700,"paid_only":false,"cont_title":"第 236 场周赛","cont_title_slug":"weekly-contest-236"},{"question_id":2601,"title":"质数减法运算","title_slug":"prime-subtraction-operation","rating":1779.0712927572,"_hash":1323143155,"paid_only":false,"cont_title":"第 338 场周赛","cont_title_slug":"weekly-contest-338"},{"question_id":1016,"title":"子串能表示从 1 到 N 数字的二进制串","title_slug":"binary-string-with-substrings-representing-1-to-n","rating":1779.3931248179,"_hash":3814673758,"paid_only":false,"cont_title":"第 129 场周赛","cont_title_slug":"weekly-contest-129"},{"question_id":2369,"title":"检查数组是否存在有效划分","title_slug":"check-if-there-is-a-valid-partition-for-the-array","rating":1779.7001728541,"_hash":3555784215,"paid_only":false,"cont_title":"第 305 场周赛","cont_title_slug":"weekly-contest-305"},{"question_id":1129,"title":"颜色交替的最短路径","title_slug":"shortest-path-with-alternating-colors","rating":1779.7534349429,"_hash":3681526411,"paid_only":false,"cont_title":"第 146 场周赛","cont_title_slug":"weekly-contest-146"},{"question_id":1424,"title":"对角线遍历 II","title_slug":"diagonal-traverse-ii","rating":1779.8364613072,"_hash":2316551160,"paid_only":false,"cont_title":"第 186 场周赛","cont_title_slug":"weekly-contest-186"},{"question_id":842,"title":"将数组拆分成斐波那契序列","title_slug":"split-array-into-fibonacci-sequence","rating":1779.9495819318,"_hash":466340061,"paid_only":false,"cont_title":"第 86 场周赛","cont_title_slug":"weekly-contest-86"},{"question_id":1895,"title":"最大的幻方","title_slug":"largest-magic-square","rating":1781.3664141686,"_hash":826909651,"paid_only":false,"cont_title":"第 54 场双周赛","cont_title_slug":"biweekly-contest-54"},{"question_id":2353,"title":"设计食物评分系统","title_slug":"design-a-food-rating-system","rating":1781.8156963676,"_hash":3907541820,"paid_only":false,"cont_title":"第 303 场周赛","cont_title_slug":"weekly-contest-303"},{"question_id":1171,"title":"从链表中删去总和值为零的连续节点","title_slug":"remove-zero-sum-consecutive-nodes-from-linked-list","rating":1782.3312212058,"_hash":1493274091,"paid_only":false,"cont_title":"第 151 场周赛","cont_title_slug":"weekly-contest-151"},{"question_id":1765,"title":"地图中的最高点","title_slug":"map-of-highest-peak","rating":1782.9801784101,"_hash":2722367436,"paid_only":false,"cont_title":"第 46 场双周赛","cont_title_slug":"biweekly-contest-46"},{"question_id":851,"title":"喧闹和富有","title_slug":"loud-and-rich","rating":1783.2337340478,"_hash":3836236370,"paid_only":false,"cont_title":"第 88 场周赛","cont_title_slug":"weekly-contest-88"},{"question_id":894,"title":"所有可能的真二叉树","title_slug":"all-possible-full-binary-trees","rating":1784.2539813582,"_hash":4144023748,"paid_only":false,"cont_title":"第 99 场周赛","cont_title_slug":"weekly-contest-99"},{"question_id":2952,"title":"需要添加的硬币的最小数量","title_slug":"minimum-number-of-coins-to-be-added","rating":1784.3506628869,"_hash":1965849899,"paid_only":false,"cont_title":"第 374 场周赛","cont_title_slug":"weekly-contest-374"},{"question_id":2653,"title":"滑动子数组的美丽值","title_slug":"sliding-subarray-beauty","rating":1785.6006955353,"_hash":3971252642,"paid_only":false,"cont_title":"第 342 场周赛","cont_title_slug":"weekly-contest-342"},{"question_id":1911,"title":"最大子序列交替和","title_slug":"maximum-alternating-subsequence-sum","rating":1785.6872758693,"_hash":1304520805,"paid_only":false,"cont_title":"第 55 场双周赛","cont_title_slug":"biweekly-contest-55"},{"question_id":983,"title":"最低票价","title_slug":"minimum-cost-for-tickets","rating":1786.3121598293,"_hash":1414741845,"paid_only":false,"cont_title":"第 121 场周赛","cont_title_slug":"weekly-contest-121"},{"question_id":971,"title":"翻转二叉树以匹配先序遍历","title_slug":"flip-binary-tree-to-match-preorder-traversal","rating":1786.5491561897,"_hash":16117382,"paid_only":false,"cont_title":"第 118 场周赛","cont_title_slug":"weekly-contest-118"},{"question_id":1312,"title":"让字符串成为回文串的最少插入次数","title_slug":"minimum-insertion-steps-to-make-a-string-palindrome","rating":1786.688543054,"_hash":2220648902,"paid_only":false,"cont_title":"第 170 场周赛","cont_title_slug":"weekly-contest-170"},{"question_id":1510,"title":"石子游戏 IV","title_slug":"stone-game-iv","rating":1786.9268132617,"_hash":2203655753,"paid_only":false,"cont_title":"第 30 场双周赛","cont_title_slug":"biweekly-contest-30"},{"question_id":1497,"title":"检查数组对是否可以被 k 整除","title_slug":"check-if-array-pairs-are-divisible-by-k","rating":1787.2310751136,"_hash":1924690238,"paid_only":false,"cont_title":"第 195 场周赛","cont_title_slug":"weekly-contest-195"},{"question_id":1156,"title":"单字符重复子串的最大长度","title_slug":"swap-for-longest-repeated-character-substring","rating":1787.4514432151,"_hash":2038782260,"paid_only":false,"cont_title":"第 149 场周赛","cont_title_slug":"weekly-contest-149"},{"question_id":2192,"title":"有向无环图中一个节点的所有祖先","title_slug":"all-ancestors-of-a-node-in-a-directed-acyclic-graph","rating":1787.8550568757,"_hash":1095929141,"paid_only":false,"cont_title":"第 73 场双周赛","cont_title_slug":"biweekly-contest-73"},{"question_id":2321,"title":"拼接数组的最大分数","title_slug":"maximum-score-of-spliced-array","rating":1790.5747006625,"_hash":3565117549,"paid_only":false,"cont_title":"第 299 场周赛","cont_title_slug":"weekly-contest-299"},{"question_id":2712,"title":"使所有字符相等的最小成本","title_slug":"minimum-cost-to-make-all-characters-equal","rating":1791.0336923305,"_hash":1186731908,"paid_only":false,"cont_title":"第 347 场周赛","cont_title_slug":"weekly-contest-347"},{"question_id":2771,"title":"构造最长非递减子数组","title_slug":"longest-non-decreasing-subarray-from-two-arrays","rating":1791.5102962397,"_hash":3729777530,"paid_only":false,"cont_title":"第 353 场周赛","cont_title_slug":"weekly-contest-353"},{"question_id":1245,"title":"树的直径","title_slug":"tree-diameter","rating":1792.076794537,"_hash":3817996291,"paid_only":false,"cont_title":"第 12 场双周赛","cont_title_slug":"biweekly-contest-12"},{"question_id":2615,"title":"等值距离和","title_slug":"sum-of-distances","rating":1793.3033536992,"_hash":158335627,"paid_only":false,"cont_title":"第 340 场周赛","cont_title_slug":"weekly-contest-340"},{"question_id":2381,"title":"字母移位 II","title_slug":"shifting-letters-ii","rating":1793.3037316825,"_hash":2012982950,"paid_only":false,"cont_title":"第 85 场双周赛","cont_title_slug":"biweekly-contest-85"},{"question_id":1653,"title":"使字符串平衡的最少删除次数","title_slug":"minimum-deletions-to-make-string-balanced","rating":1793.8027487553,"_hash":2249718139,"paid_only":false,"cont_title":"第 39 场双周赛","cont_title_slug":"biweekly-contest-39"},{"question_id":886,"title":"可能的二分法","title_slug":"possible-bipartition","rating":1794.5827898448,"_hash":860518194,"paid_only":false,"cont_title":"第 97 场周赛","cont_title_slug":"weekly-contest-97"},{"question_id":2998,"title":"使 X 和 Y 相等的最少操作次数","title_slug":"minimum-number-of-operations-to-make-x-and-y-equal","rating":1794.6129370985,"_hash":3024031273,"paid_only":false,"cont_title":"第 121 场双周赛","cont_title_slug":"biweekly-contest-121"},{"question_id":966,"title":"元音拼写检查器","title_slug":"vowel-spellchecker","rating":1795.0422250815,"_hash":3548460508,"paid_only":false,"cont_title":"第 117 场周赛","cont_title_slug":"weekly-contest-117"},{"question_id":3001,"title":"捕获黑皇后需要的最少移动次数","title_slug":"minimum-moves-to-capture-the-queen","rating":1796.5392133092,"_hash":4169935304,"paid_only":false,"cont_title":"第 379 场周赛","cont_title_slug":"weekly-contest-379"},{"question_id":1028,"title":"从先序遍历还原二叉树","title_slug":"recover-a-tree-from-preorder-traversal","rating":1797.4917663632,"_hash":4138934238,"paid_only":false,"cont_title":"第 132 场周赛","cont_title_slug":"weekly-contest-132"},{"question_id":1072,"title":"按列翻转得到最大值等行数","title_slug":"flip-columns-for-maximum-number-of-equal-rows","rating":1797.5851607225,"_hash":1857526630,"paid_only":false,"cont_title":"第 139 场周赛","cont_title_slug":"weekly-contest-139"},{"question_id":1834,"title":"单线程 CPU","title_slug":"single-threaded-cpu","rating":1797.7466000366,"_hash":3429532354,"paid_only":false,"cont_title":"第 237 场周赛","cont_title_slug":"weekly-contest-237"},{"question_id":1711,"title":"大餐计数","title_slug":"count-good-meals","rating":1797.8728515982,"_hash":519326923,"paid_only":false,"cont_title":"第 222 场周赛","cont_title_slug":"weekly-contest-222"},{"question_id":1186,"title":"删除一次得到子数组最大和","title_slug":"maximum-subarray-sum-with-one-deletion","rating":1799.4635458535,"_hash":1742923454,"paid_only":false,"cont_title":"第 153 场周赛","cont_title_slug":"weekly-contest-153"},{"question_id":1673,"title":"找出最具竞争力的子序列","title_slug":"find-the-most-competitive-subsequence","rating":1802.2256875356,"_hash":3057587548,"paid_only":false,"cont_title":"第 217 场周赛","cont_title_slug":"weekly-contest-217"},{"question_id":2934,"title":"最大化数组末位元素的最少操作次数","title_slug":"minimum-operations-to-maximize-last-elements-in-arrays","rating":1802.7875657754,"_hash":3398027261,"paid_only":false,"cont_title":"第 371 场周赛","cont_title_slug":"weekly-contest-371"},{"question_id":1953,"title":"你可以工作的最大周数","title_slug":"maximum-number-of-weeks-for-which-you-can-work","rating":1803.7518552874,"_hash":787047636,"paid_only":false,"cont_title":"第 252 场周赛","cont_title_slug":"weekly-contest-252"},{"question_id":2096,"title":"从二叉树一个节点到另一个节点每一步的方向","title_slug":"step-by-step-directions-from-a-binary-tree-node-to-another","rating":1804.5283324227,"_hash":3304159418,"paid_only":false,"cont_title":"第 270 场周赛","cont_title_slug":"weekly-contest-270"},{"question_id":1080,"title":"根到叶路径上的不足节点","title_slug":"insufficient-nodes-in-root-to-leaf-paths","rating":1804.5783242151,"_hash":547605841,"paid_only":false,"cont_title":"第 140 场周赛","cont_title_slug":"weekly-contest-140"},{"question_id":1035,"title":"不相交的线","title_slug":"uncrossed-lines","rating":1805.5947071171,"_hash":1788564041,"paid_only":false,"cont_title":"第 134 场周赛","cont_title_slug":"weekly-contest-134"},{"question_id":1073,"title":"负二进制数相加","title_slug":"adding-two-negabinary-numbers","rating":1806.5891699944,"_hash":3275619185,"paid_only":false,"cont_title":"第 139 场周赛","cont_title_slug":"weekly-contest-139"},{"question_id":1594,"title":"矩阵的最大非负积","title_slug":"maximum-non-negative-product-in-a-matrix","rating":1807.4618172386,"_hash":1191385639,"paid_only":false,"cont_title":"第 207 场周赛","cont_title_slug":"weekly-contest-207"},{"question_id":2302,"title":"统计得分小于 K 的子数组数目","title_slug":"count-subarrays-with-score-less-than-k","rating":1808.3407696613,"_hash":1464742605,"paid_only":false,"cont_title":"第 80 场双周赛","cont_title_slug":"biweekly-contest-80"},{"question_id":1230,"title":"抛掷硬币","title_slug":"toss-strange-coins","rating":1808.5754920785,"_hash":2912571228,"paid_only":false,"cont_title":"第 11 场双周赛","cont_title_slug":"biweekly-contest-11"},{"question_id":1519,"title":"子树中标签相同的节点数","title_slug":"number-of-nodes-in-the-sub-tree-with-the-same-label","rating":1808.787108831,"_hash":2964689219,"paid_only":false,"cont_title":"第 198 场周赛","cont_title_slug":"weekly-contest-198"},{"question_id":1345,"title":"跳跃游戏 IV","title_slug":"jump-game-iv","rating":1809.8192888474,"_hash":212627710,"paid_only":false,"cont_title":"第 19 场双周赛","cont_title_slug":"biweekly-contest-19"},{"question_id":2642,"title":"设计可以求最短路径的图类","title_slug":"design-graph-with-shortest-path-calculator","rating":1810.6470004623,"_hash":737896329,"paid_only":false,"cont_title":"第 102 场双周赛","cont_title_slug":"biweekly-contest-102"},{"question_id":1284,"title":"转化为全零矩阵的最少反转次数","title_slug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix","rating":1810.7690062079,"_hash":1118571941,"paid_only":false,"cont_title":"第 166 场周赛","cont_title_slug":"weekly-contest-166"},{"question_id":3026,"title":"最大好子数组和","title_slug":"maximum-good-subarray-sum","rating":1816.556997127,"_hash":1621119601,"paid_only":false,"cont_title":"第 123 场双周赛","cont_title_slug":"biweekly-contest-123"},{"question_id":1658,"title":"将 x 减到 0 的最小操作数","title_slug":"minimum-operations-to-reduce-x-to-zero","rating":1817.224026292,"_hash":307769453,"paid_only":false,"cont_title":"第 215 场周赛","cont_title_slug":"weekly-contest-215"},{"question_id":2787,"title":"将一个数字表示成幂的和的方案数","title_slug":"ways-to-express-an-integer-as-sum-of-powers","rating":1817.5282352022,"_hash":2671757819,"paid_only":false,"cont_title":"第 109 场双周赛","cont_title_slug":"biweekly-contest-109"},{"question_id":1792,"title":"最大平均通过率","title_slug":"maximum-average-pass-ratio","rating":1817.9978644712,"_hash":536430705,"paid_only":false,"cont_title":"第 232 场周赛","cont_title_slug":"weekly-contest-232"},{"question_id":861,"title":"翻转矩阵后的得分","title_slug":"score-after-flipping-matrix","rating":1818.0024504436,"_hash":1135090504,"paid_only":false,"cont_title":"第 91 场周赛","cont_title_slug":"weekly-contest-91"},{"question_id":2055,"title":"蜡烛之间的盘子","title_slug":"plates-between-candles","rating":1819.3068421506,"_hash":1199383198,"paid_only":false,"cont_title":"第 64 场双周赛","cont_title_slug":"biweekly-contest-64"},{"question_id":1405,"title":"最长快乐字符串","title_slug":"longest-happy-string","rating":1820.58557644,"_hash":1311726140,"paid_only":false,"cont_title":"第 183 场周赛","cont_title_slug":"weekly-contest-183"},{"question_id":2217,"title":"找到指定长度的回文数","title_slug":"find-palindrome-with-fixed-length","rating":1822.1301265412,"_hash":2265657217,"paid_only":false,"cont_title":"第 286 场周赛","cont_title_slug":"weekly-contest-286"},{"question_id":2931,"title":"购买物品的最大开销","title_slug":"maximum-spending-after-buying-items","rating":1822.3170524016,"_hash":268471907,"paid_only":false,"cont_title":"第 117 场双周赛","cont_title_slug":"biweekly-contest-117"},{"question_id":1363,"title":"形成三的最大倍数","title_slug":"largest-multiple-of-three","rating":1822.9768689716,"_hash":3298734473,"paid_only":false,"cont_title":"第 177 场周赛","cont_title_slug":"weekly-contest-177"},{"question_id":1458,"title":"两个子序列的最大点积","title_slug":"max-dot-product-of-two-subsequences","rating":1823.5831437787,"_hash":4061458273,"paid_only":false,"cont_title":"第 190 场周赛","cont_title_slug":"weekly-contest-190"},{"question_id":1377,"title":"T 秒后青蛙的位置","title_slug":"frog-position-after-t-seconds","rating":1823.8779711373,"_hash":1364762739,"paid_only":false,"cont_title":"第 179 场周赛","cont_title_slug":"weekly-contest-179"},{"question_id":1298,"title":"你能从盒子里获得的最大糖果数","title_slug":"maximum-candies-you-can-get-from-boxes","rating":1824.829446341,"_hash":4040819108,"paid_only":false,"cont_title":"第 168 场周赛","cont_title_slug":"weekly-contest-168"},{"question_id":1835,"title":"所有数对按位与结果的异或和","title_slug":"find-xor-sum-of-all-pairs-bitwise-and","rating":1825.0056908946,"_hash":635111986,"paid_only":false,"cont_title":"第 237 场周赛","cont_title_slug":"weekly-contest-237"},{"question_id":1702,"title":"修改后的最大二进制字符串","title_slug":"maximum-binary-string-after-change","rating":1825.4207082682,"_hash":1632383781,"paid_only":false,"cont_title":"第 42 场双周赛","cont_title_slug":"biweekly-contest-42"},{"question_id":934,"title":"最短的桥","title_slug":"shortest-bridge","rating":1825.770486008,"_hash":4107503015,"paid_only":false,"cont_title":"第 109 场周赛","cont_title_slug":"weekly-contest-109"},{"question_id":1095,"title":"山脉数组中查找目标值","title_slug":"find-in-mountain-array","rating":1827.090740222,"_hash":40615146,"paid_only":false,"cont_title":"第 142 场周赛","cont_title_slug":"weekly-contest-142"},{"question_id":2135,"title":"统计追加字母可以获得的单词数","title_slug":"count-words-obtained-after-adding-a-letter","rating":1828.2700238306,"_hash":1363331011,"paid_only":false,"cont_title":"第 275 场周赛","cont_title_slug":"weekly-contest-275"},{"question_id":1754,"title":"构造字典序最大的合并字符串","title_slug":"largest-merge-of-two-strings","rating":1828.6438563573,"_hash":1951198460,"paid_only":false,"cont_title":"第 227 场周赛","cont_title_slug":"weekly-contest-227"},{"question_id":980,"title":"不同路径 III","title_slug":"unique-paths-iii","rating":1830.3165569278,"_hash":1134359923,"paid_only":false,"cont_title":"第 120 场周赛","cont_title_slug":"weekly-contest-120"},{"question_id":2034,"title":"股票价格波动","title_slug":"stock-price-fluctuation","rating":1831.9395911303,"_hash":1147860078,"paid_only":false,"cont_title":"第 262 场周赛","cont_title_slug":"weekly-contest-262"},{"question_id":3012,"title":"通过操作使数组长度最小","title_slug":"minimize-length-of-array-using-operations","rating":1832.7167755024,"_hash":1466738944,"paid_only":false,"cont_title":"第 122 场双周赛","cont_title_slug":"biweekly-contest-122"},{"question_id":2370,"title":"最长理想子序列","title_slug":"longest-ideal-subsequence","rating":1834.868034709,"_hash":3336959867,"paid_only":false,"cont_title":"第 305 场周赛","cont_title_slug":"weekly-contest-305"},{"question_id":995,"title":"K 连续位的最小翻转次数","title_slug":"minimum-number-of-k-consecutive-bit-flips","rating":1835.4868365659,"_hash":2191726075,"paid_only":false,"cont_title":"第 124 场周赛","cont_title_slug":"weekly-contest-124"},{"question_id":2146,"title":"价格范围内最高排名的 K 样物品","title_slug":"k-highest-ranked-items-within-a-price-range","rating":1836.5345744332,"_hash":3957965518,"paid_only":false,"cont_title":"第 70 场双周赛","cont_title_slug":"biweekly-contest-70"},{"question_id":1316,"title":"不同的循环子字符串","title_slug":"distinct-echo-substrings","rating":1836.536348078,"_hash":2436413676,"paid_only":false,"cont_title":"第 17 场双周赛","cont_title_slug":"biweekly-contest-17"},{"question_id":1559,"title":"二维网格图中探测环","title_slug":"detect-cycles-in-2d-grid","rating":1837.8252904904,"_hash":2216360450,"paid_only":false,"cont_title":"第 33 场双周赛","cont_title_slug":"biweekly-contest-33"},{"question_id":2311,"title":"小于等于 K 的最长二进制子序列","title_slug":"longest-binary-subsequence-less-than-or-equal-to-k","rating":1839.9203623221,"_hash":1903617238,"paid_only":false,"cont_title":"第 298 场周赛","cont_title_slug":"weekly-contest-298"},{"question_id":2332,"title":"坐上公交的最晚时间","title_slug":"the-latest-time-to-catch-a-bus","rating":1840.9122452886,"_hash":572276699,"paid_only":false,"cont_title":"第 82 场双周赛","cont_title_slug":"biweekly-contest-82"},{"question_id":2013,"title":"检测正方形","title_slug":"detect-squares","rating":1841.4067816266,"_hash":2204914887,"paid_only":false,"cont_title":"第 259 场周赛","cont_title_slug":"weekly-contest-259"},{"question_id":2576,"title":"求出最多标记下标","title_slug":"find-the-maximum-number-of-marked-indices","rating":1843.2383664194,"_hash":260479518,"paid_only":false,"cont_title":"第 334 场周赛","cont_title_slug":"weekly-contest-334"},{"question_id":1411,"title":"给 N x 3 网格图涂色的方案数","title_slug":"number-of-ways-to-paint-n-3-grid","rating":1844.6289439644,"_hash":3628711002,"paid_only":false,"cont_title":"第 184 场周赛","cont_title_slug":"weekly-contest-184"},{"question_id":1504,"title":"统计全 1 子矩形","title_slug":"count-submatrices-with-all-ones","rating":1845.0428731248,"_hash":3023068102,"paid_only":false,"cont_title":"第 196 场周赛","cont_title_slug":"weekly-contest-196"},{"question_id":2598,"title":"执行操作后的最大 MEX","title_slug":"smallest-missing-non-negative-integer-after-operations","rating":1845.6611654401,"_hash":2357679638,"paid_only":false,"cont_title":"第 337 场周赛","cont_title_slug":"weekly-contest-337"},{"question_id":874,"title":"模拟行走机器人","title_slug":"walking-robot-simulation","rating":1846.3568350016,"_hash":809566471,"paid_only":false,"cont_title":"第 94 场周赛","cont_title_slug":"weekly-contest-94"},{"question_id":1514,"title":"概率最大的路径","title_slug":"path-with-maximum-probability","rating":1846.4077077642,"_hash":1014740120,"paid_only":false,"cont_title":"第 197 场周赛","cont_title_slug":"weekly-contest-197"},{"question_id":1258,"title":"近义词句子","title_slug":"synonymous-sentences","rating":1847.2077654978,"_hash":3669324904,"paid_only":false,"cont_title":"第 13 场双周赛","cont_title_slug":"biweekly-contest-13"},{"question_id":1177,"title":"构建回文串检测","title_slug":"can-make-palindrome-from-substring","rating":1848.0912848518,"_hash":1583349779,"paid_only":false,"cont_title":"第 152 场周赛","cont_title_slug":"weekly-contest-152"},{"question_id":2059,"title":"转化数字的最小运算数","title_slug":"minimum-operations-to-convert-number","rating":1849.8122180044,"_hash":3590542886,"paid_only":false,"cont_title":"第 265 场周赛","cont_title_slug":"weekly-contest-265"},{"question_id":1775,"title":"通过最少操作次数使数组的和相等","title_slug":"equal-sum-arrays-with-minimum-number-of-operations","rating":1850.4091449367,"_hash":2258141933,"paid_only":false,"cont_title":"第 230 场周赛","cont_title_slug":"weekly-contest-230"},{"question_id":1477,"title":"找两个和为目标值且不重叠的子数组","title_slug":"find-two-non-overlapping-sub-arrays-each-with-target-sum","rating":1850.5506342426,"_hash":1480774126,"paid_only":false,"cont_title":"第 28 场双周赛","cont_title_slug":"biweekly-contest-28"},{"question_id":1152,"title":"用户网站访问行为分析","title_slug":"analyze-user-website-visit-pattern","rating":1850.8490524791,"_hash":2782517328,"paid_only":false,"cont_title":"第 6 场双周赛","cont_title_slug":"biweekly-contest-6"},{"question_id":2830,"title":"销售利润最大化","title_slug":"maximize-the-profit-as-the-salesman","rating":1851.2677996923,"_hash":3503134762,"paid_only":false,"cont_title":"第 359 场周赛","cont_title_slug":"weekly-contest-359"},{"question_id":2162,"title":"设置时间的最少代价","title_slug":"minimum-cost-to-set-cooking-time","rating":1851.7255023016,"_hash":248789391,"paid_only":false,"cont_title":"第 71 场双周赛","cont_title_slug":"biweekly-contest-71"},{"question_id":1301,"title":"最大得分的路径数目","title_slug":"number-of-paths-with-max-score","rating":1853.0880092558,"_hash":4193156158,"paid_only":false,"cont_title":"第 16 场双周赛","cont_title_slug":"biweekly-contest-16"},{"question_id":1269,"title":"停在原地的方案数","title_slug":"number-of-ways-to-stay-in-the-same-place-after-some-steps","rating":1854.0126399812,"_hash":1810947088,"paid_only":false,"cont_title":"第 164 场周赛","cont_title_slug":"weekly-contest-164"},{"question_id":1334,"title":"阈值距离内邻居最少的城市","title_slug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance","rating":1854.9547783559,"_hash":487663609,"paid_only":false,"cont_title":"第 173 场周赛","cont_title_slug":"weekly-contest-173"},{"question_id":1546,"title":"和为目标值且不重叠的非空子数组的最大数目","title_slug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target","rating":1855.377046154,"_hash":2479293617,"paid_only":false,"cont_title":"第 201 场周赛","cont_title_slug":"weekly-contest-201"},{"question_id":1202,"title":"交换字符串中的元素","title_slug":"smallest-string-with-swaps","rating":1855.4479039876,"_hash":13544352,"paid_only":false,"cont_title":"第 155 场周赛","cont_title_slug":"weekly-contest-155"},{"question_id":2800,"title":"包含三个字符串的最短字符串","title_slug":"shortest-string-that-contains-three-strings","rating":1855.561153694,"_hash":2827089777,"paid_only":false,"cont_title":"第 356 场周赛","cont_title_slug":"weekly-contest-356"},{"question_id":3035,"title":"回文字符串的最大数量","title_slug":"maximum-palindromes-after-operations","rating":1856.6336926997,"_hash":2800289700,"paid_only":false,"cont_title":"第 384 场周赛","cont_title_slug":"weekly-contest-384"},{"question_id":2266,"title":"统计打字方案数","title_slug":"count-number-of-texts","rating":1856.8610192187,"_hash":590592305,"paid_only":false,"cont_title":"第 292 场周赛","cont_title_slug":"weekly-contest-292"},{"question_id":1584,"title":"连接所有点的最小费用","title_slug":"min-cost-to-connect-all-points","rating":1857.6431822094,"_hash":3880639230,"paid_only":false,"cont_title":"第 206 场周赛","cont_title_slug":"weekly-contest-206"},{"question_id":1744,"title":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","title_slug":"can-you-eat-your-favorite-candy-on-your-favorite-day","rating":1858.9581916885,"_hash":3529472171,"paid_only":false,"cont_title":"第 226 场周赛","cont_title_slug":"weekly-contest-226"},{"question_id":2301,"title":"替换字符后匹配","title_slug":"match-substring-after-replacement","rating":1860.5166780235,"_hash":2777743854,"paid_only":false,"cont_title":"第 80 场双周赛","cont_title_slug":"biweekly-contest-80"},{"question_id":1996,"title":"游戏中弱角色的数量","title_slug":"the-number-of-weak-characters-in-the-game","rating":1860.742934291,"_hash":1819395589,"paid_only":false,"cont_title":"第 257 场周赛","cont_title_slug":"weekly-contest-257"},{"question_id":1993,"title":"树上的操作","title_slug":"operations-on-tree","rating":1861.4906863586,"_hash":2143044442,"paid_only":false,"cont_title":"第 60 场双周赛","cont_title_slug":"biweekly-contest-60"},{"question_id":1163,"title":"按字典序排在最后的子串","title_slug":"last-substring-in-lexicographical-order","rating":1864.0948676111,"_hash":1053626998,"paid_only":false,"cont_title":"第 150 场周赛","cont_title_slug":"weekly-contest-150"},{"question_id":2767,"title":"将字符串分割为最少的美丽子字符串","title_slug":"partition-string-into-minimum-beautiful-substrings","rating":1864.5644306171,"_hash":4066429992,"paid_only":false,"cont_title":"第 108 场双周赛","cont_title_slug":"biweekly-contest-108"},{"question_id":2039,"title":"网络空闲的时刻","title_slug":"the-time-when-the-network-becomes-idle","rating":1865.3441063734,"_hash":275986604,"paid_only":false,"cont_title":"第 63 场双周赛","cont_title_slug":"biweekly-contest-63"},{"question_id":1340,"title":"跳跃游戏 V","title_slug":"jump-game-v","rating":1866.3014601125,"_hash":3795047313,"paid_only":false,"cont_title":"第 174 场周赛","cont_title_slug":"weekly-contest-174"},{"question_id":1605,"title":"给定行和列的和求可行矩阵","title_slug":"find-valid-matrix-given-row-and-column-sums","rating":1867.8619694847,"_hash":2355594556,"paid_only":false,"cont_title":"第 36 场双周赛","cont_title_slug":"biweekly-contest-36"},{"question_id":1717,"title":"删除子字符串的最大得分","title_slug":"maximum-score-from-removing-substrings","rating":1867.9916069568,"_hash":2035720970,"paid_only":false,"cont_title":"第 43 场双周赛","cont_title_slug":"biweekly-contest-43"},{"question_id":1616,"title":"分割两个字符串得到回文串","title_slug":"split-two-strings-to-make-palindrome","rating":1868.1914861381,"_hash":1651110316,"paid_only":false,"cont_title":"第 210 场周赛","cont_title_slug":"weekly-contest-210"},{"question_id":924,"title":"尽量减少恶意软件的传播","title_slug":"minimize-malware-spread","rating":1868.9146755896,"_hash":28387341,"paid_only":false,"cont_title":"第 106 场周赛","cont_title_slug":"weekly-contest-106"},{"question_id":2212,"title":"射箭比赛中的最大得分","title_slug":"maximum-points-in-an-archery-competition","rating":1868.9864493463,"_hash":2155229246,"paid_only":false,"cont_title":"第 285 场周赛","cont_title_slug":"weekly-contest-285"},{"question_id":2002,"title":"两个回文子序列长度的最大乘积","title_slug":"maximum-product-of-the-length-of-two-palindromic-subsequences","rating":1869.402439128,"_hash":3968538235,"paid_only":false,"cont_title":"第 258 场周赛","cont_title_slug":"weekly-contest-258"},{"question_id":1589,"title":"所有排列中的最大和","title_slug":"maximum-sum-obtained-of-any-permutation","rating":1871.3112059413,"_hash":1702334810,"paid_only":false,"cont_title":"第 35 场双周赛","cont_title_slug":"biweekly-contest-35"},{"question_id":2008,"title":"出租车的最大盈利","title_slug":"maximum-earnings-from-taxi","rating":1871.8245218615,"_hash":2921363389,"paid_only":false,"cont_title":"第 61 场双周赛","cont_title_slug":"biweekly-contest-61"},{"question_id":1526,"title":"形成目标数组的子数组最少增加次数","title_slug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array","rating":1872.0350138774,"_hash":374038880,"paid_only":false,"cont_title":"第 31 场双周赛","cont_title_slug":"biweekly-contest-31"},{"question_id":1001,"title":"网格照明","title_slug":"grid-illumination","rating":1873.0367582475,"_hash":2294942579,"paid_only":false,"cont_title":"第 125 场周赛","cont_title_slug":"weekly-contest-125"},{"question_id":2975,"title":"移除栅栏得到的正方形田地的最大面积","title_slug":"maximum-square-area-by-removing-fences-from-a-field","rating":1873.0424923433,"_hash":3065742618,"paid_only":false,"cont_title":"第 377 场周赛","cont_title_slug":"weekly-contest-377"},{"question_id":1015,"title":"可被 K 整除的最小整数","title_slug":"smallest-integer-divisible-by-k","rating":1874.6468976233,"_hash":1796150705,"paid_only":false,"cont_title":"第 129 场周赛","cont_title_slug":"weekly-contest-129"},{"question_id":2808,"title":"使循环数组所有元素相等的最少秒数","title_slug":"minimum-seconds-to-equalize-a-circular-array","rating":1875.4217845362,"_hash":236837608,"paid_only":false,"cont_title":"第 110 场双周赛","cont_title_slug":"biweekly-contest-110"},{"question_id":1392,"title":"最长快乐前缀","title_slug":"longest-happy-prefix","rating":1876.146019008,"_hash":3616385781,"paid_only":false,"cont_title":"第 181 场周赛","cont_title_slug":"weekly-contest-181"},{"question_id":1838,"title":"最高频元素的频数","title_slug":"frequency-of-the-most-frequent-element","rating":1876.3611046625,"_hash":2806558939,"paid_only":false,"cont_title":"第 238 场周赛","cont_title_slug":"weekly-contest-238"},{"question_id":955,"title":"删列造序 II","title_slug":"delete-columns-to-make-sorted-ii","rating":1876.3854625677,"_hash":2817465096,"paid_only":false,"cont_title":"第 114 场周赛","cont_title_slug":"weekly-contest-114"},{"question_id":1234,"title":"替换子串得到平衡字符串","title_slug":"replace-the-substring-for-balanced-string","rating":1877.8983358307,"_hash":2144998386,"paid_only":false,"cont_title":"第 159 场周赛","cont_title_slug":"weekly-contest-159"},{"question_id":2101,"title":"引爆最多的炸弹","title_slug":"detonate-the-maximum-bombs","rating":1880.0511044074,"_hash":1604381884,"paid_only":false,"cont_title":"第 67 场双周赛","cont_title_slug":"biweekly-contest-67"},{"question_id":1106,"title":"解析布尔表达式","title_slug":"parsing-a-boolean-expression","rating":1880.4226853663,"_hash":253585197,"paid_only":false,"cont_title":"第 143 场周赛","cont_title_slug":"weekly-contest-143"},{"question_id":1536,"title":"排布二进制网格的最少交换次数","title_slug":"minimum-swaps-to-arrange-a-binary-grid","rating":1880.5909929633,"_hash":2214262554,"paid_only":false,"cont_title":"第 200 场周赛","cont_title_slug":"weekly-contest-200"},{"question_id":858,"title":"镜面反射","title_slug":"mirror-reflection","rating":1880.7433591583,"_hash":1432071996,"paid_only":false,"cont_title":"第 90 场周赛","cont_title_slug":"weekly-contest-90"},{"question_id":1255,"title":"得分最高的单词集合","title_slug":"maximum-score-words-formed-by-letters","rating":1881.6810367589,"_hash":2776150092,"paid_only":false,"cont_title":"第 162 场周赛","cont_title_slug":"weekly-contest-162"},{"question_id":2976,"title":"转换字符串的最小成本 I","title_slug":"minimum-cost-to-convert-string-i","rating":1882.0842446557,"_hash":2860849459,"paid_only":false,"cont_title":"第 377 场周赛","cont_title_slug":"weekly-contest-377"},{"question_id":2054,"title":"两个最好的不重叠活动","title_slug":"two-best-non-overlapping-events","rating":1883.3541964032,"_hash":2546467088,"paid_only":false,"cont_title":"第 64 场双周赛","cont_title_slug":"biweekly-contest-64"},{"question_id":1326,"title":"灌溉花园的最少水龙头数目","title_slug":"minimum-number-of-taps-to-open-to-water-a-garden","rating":1885.0178370385,"_hash":701261553,"paid_only":false,"cont_title":"第 172 场周赛","cont_title_slug":"weekly-contest-172"},{"question_id":1066,"title":"校园自行车分配 II","title_slug":"campus-bikes-ii","rating":1885.1051527272,"_hash":729170392,"paid_only":false,"cont_title":"第 1 场双周赛","cont_title_slug":"biweekly-contest-1"},{"question_id":2064,"title":"分配给商店的最多商品的最小值","title_slug":"minimized-maximum-of-products-distributed-to-any-store","rating":1885.9015646531,"_hash":2819110526,"paid_only":false,"cont_title":"第 266 场周赛","cont_title_slug":"weekly-contest-266"},{"question_id":2305,"title":"公平分发饼干","title_slug":"fair-distribution-of-cookies","rating":1886.7040111218,"_hash":3444975876,"paid_only":false,"cont_title":"第 297 场周赛","cont_title_slug":"weekly-contest-297"},{"question_id":2817,"title":"限制条件下元素之间的最小绝对差","title_slug":"minimum-absolute-difference-between-elements-with-constraint","rating":1889.4554322242,"_hash":2701115423,"paid_only":false,"cont_title":"第 358 场周赛","cont_title_slug":"weekly-contest-358"},{"question_id":2537,"title":"统计好子数组的数目","title_slug":"count-the-number-of-good-subarrays","rating":1891.8455273506,"_hash":2668311333,"paid_only":false,"cont_title":"第 328 场周赛","cont_title_slug":"weekly-contest-328"},{"question_id":1722,"title":"执行交换操作后的最小汉明距离","title_slug":"minimize-hamming-distance-after-swap-operations","rating":1892.1600619469,"_hash":3235710031,"paid_only":false,"cont_title":"第 223 场周赛","cont_title_slug":"weekly-contest-223"},{"question_id":2327,"title":"知道秘密的人数","title_slug":"number-of-people-aware-of-a-secret","rating":1893.5143805402,"_hash":1370775302,"paid_only":false,"cont_title":"第 300 场周赛","cont_title_slug":"weekly-contest-300"},{"question_id":3036,"title":"匹配模式数组的子数组数目 II","title_slug":"number-of-subarrays-that-match-a-pattern-ii","rating":1894.5496928891,"_hash":1878147567,"paid_only":false,"cont_title":"第 384 场周赛","cont_title_slug":"weekly-contest-384"},{"question_id":1871,"title":"跳跃游戏 VII","title_slug":"jump-game-vii","rating":1896.1411567598,"_hash":2335538835,"paid_only":false,"cont_title":"第 242 场周赛","cont_title_slug":"weekly-contest-242"},{"question_id":3030,"title":"找出网格的区域平均强度","title_slug":"find-the-grid-of-region-average","rating":1896.4053993495,"_hash":2583029056,"paid_only":false,"cont_title":"第 383 场周赛","cont_title_slug":"weekly-contest-383"},{"question_id":878,"title":"第 N 个神奇数字","title_slug":"nth-magical-number","rating":1896.7975214446,"_hash":2613974860,"paid_only":false,"cont_title":"第 95 场周赛","cont_title_slug":"weekly-contest-95"},{"question_id":2360,"title":"图中的最长环","title_slug":"longest-cycle-in-a-graph","rating":1897.1863301576,"_hash":218781353,"paid_only":false,"cont_title":"第 304 场周赛","cont_title_slug":"weekly-contest-304"},{"question_id":1878,"title":"矩阵中最大的三个菱形和","title_slug":"get-biggest-three-rhombus-sums-in-a-grid","rating":1897.5516652727,"_hash":3647529643,"paid_only":false,"cont_title":"第 53 场双周赛","cont_title_slug":"biweekly-contest-53"},{"question_id":2901,"title":"最长相邻不相等子序列 II","title_slug":"longest-unequal-adjacent-groups-subsequence-ii","rating":1898.8339532179,"_hash":770030188,"paid_only":false,"cont_title":"第 115 场双周赛","cont_title_slug":"biweekly-contest-115"},{"question_id":1665,"title":"完成所有任务的最少初始能量","title_slug":"minimum-initial-energy-to-finish-tasks","rating":1900.8434122725,"_hash":4008128316,"paid_only":false,"cont_title":"第 216 场周赛","cont_title_slug":"weekly-contest-216"},{"question_id":2602,"title":"使数组元素全部相等的最少操作次数","title_slug":"minimum-operations-to-make-all-array-elements-equal","rating":1903.1973989877,"_hash":761999420,"paid_only":false,"cont_title":"第 338 场周赛","cont_title_slug":"weekly-contest-338"},{"question_id":2608,"title":"图中的最短环","title_slug":"shortest-cycle-in-a-graph","rating":1904.2279434479,"_hash":1825399219,"paid_only":false,"cont_title":"第 101 场双周赛","cont_title_slug":"biweekly-contest-101"},{"question_id":1124,"title":"表现良好的最长时间段","title_slug":"longest-well-performing-interval","rating":1908.3866125757,"_hash":2409750542,"paid_only":false,"cont_title":"第 145 场周赛","cont_title_slug":"weekly-contest-145"},{"question_id":991,"title":"坏了的计算器","title_slug":"broken-calculator","rating":1909.4189035523,"_hash":376871815,"paid_only":false,"cont_title":"第 123 场周赛","cont_title_slug":"weekly-contest-123"},{"question_id":2585,"title":"获得分数的方法数","title_slug":"number-of-ways-to-earn-points","rating":1909.5535861652,"_hash":1697537146,"paid_only":false,"cont_title":"第 335 场周赛","cont_title_slug":"weekly-contest-335"},{"question_id":873,"title":"最长的斐波那契子序列的长度","title_slug":"length-of-longest-fibonacci-subsequence","rating":1911.1959516695,"_hash":3865734981,"paid_only":false,"cont_title":"第 94 场周赛","cont_title_slug":"weekly-contest-94"},{"question_id":2049,"title":"统计最高分的节点数目","title_slug":"count-nodes-with-the-highest-score","rating":1911.7063530593,"_hash":3202447407,"paid_only":false,"cont_title":"第 264 场周赛","cont_title_slug":"weekly-contest-264"},{"question_id":2296,"title":"设计一个文本编辑器","title_slug":"design-a-text-editor","rating":1911.8282317986,"_hash":536229655,"paid_only":false,"cont_title":"第 296 场周赛","cont_title_slug":"weekly-contest-296"},{"question_id":1147,"title":"段式回文","title_slug":"longest-chunked-palindrome-decomposition","rating":1912.0829958001,"_hash":1184414922,"paid_only":false,"cont_title":"第 148 场周赛","cont_title_slug":"weekly-contest-148"},{"question_id":2680,"title":"最大或值","title_slug":"maximum-or","rating":1912.1926699881,"_hash":1962061945,"paid_only":false,"cont_title":"第 104 场双周赛","cont_title_slug":"biweekly-contest-104"},{"question_id":1898,"title":"可移除字符的最大数目","title_slug":"maximum-number-of-removable-characters","rating":1912.8440554296,"_hash":1548254728,"paid_only":false,"cont_title":"第 245 场周赛","cont_title_slug":"weekly-contest-245"},{"question_id":1671,"title":"得到山形数组的最少删除次数","title_slug":"minimum-number-of-removals-to-make-mountain-array","rating":1912.8455659711,"_hash":509699848,"paid_only":false,"cont_title":"第 40 场双周赛","cont_title_slug":"biweekly-contest-40"},{"question_id":1373,"title":"二叉搜索子树的最大键值和","title_slug":"maximum-sum-bst-in-binary-tree","rating":1913.6704728453,"_hash":2919642920,"paid_only":false,"cont_title":"第 21 场双周赛","cont_title_slug":"biweekly-contest-21"},{"question_id":2875,"title":"无限数组的最短子数组","title_slug":"minimum-size-subarray-in-infinite-array","rating":1913.930869473,"_hash":3124896474,"paid_only":false,"cont_title":"第 365 场周赛","cont_title_slug":"weekly-contest-365"},{"question_id":2147,"title":"分隔长廊的方案数","title_slug":"number-of-ways-to-divide-a-long-corridor","rating":1914.6717285348,"_hash":4014976365,"paid_only":false,"cont_title":"第 70 场双周赛","cont_title_slug":"biweekly-contest-70"},{"question_id":2594,"title":"修车的最少时间","title_slug":"minimum-time-to-repair-cars","rating":1915.2628132733,"_hash":2422059385,"paid_only":false,"cont_title":"第 100 场双周赛","cont_title_slug":"biweekly-contest-100"},{"question_id":1043,"title":"分隔数组以得到最大和","title_slug":"partition-array-for-maximum-sum","rating":1916.0689858272,"_hash":1916400350,"paid_only":false,"cont_title":"第 136 场周赛","cont_title_slug":"weekly-contest-136"},{"question_id":2673,"title":"使二叉树所有路径值相等的最小代价","title_slug":"make-costs-of-paths-equal-in-a-binary-tree","rating":1917.1049672432,"_hash":1853031865,"paid_only":false,"cont_title":"第 344 场周赛","cont_title_slug":"weekly-contest-344"},{"question_id":2398,"title":"预算内的最多机器人数目","title_slug":"maximum-number-of-robots-within-budget","rating":1917.2145829853,"_hash":1856172895,"paid_only":false,"cont_title":"第 86 场双周赛","cont_title_slug":"biweekly-contest-86"},{"question_id":3002,"title":"移除后集合的最多元素数","title_slug":"maximum-size-of-a-set-after-removals","rating":1917.4314822412,"_hash":3228686257,"paid_only":false,"cont_title":"第 379 场周赛","cont_title_slug":"weekly-contest-379"},{"question_id":2069,"title":"模拟行走机器人 II","title_slug":"walking-robot-simulation-ii","rating":1918.9960035055,"_hash":3967032436,"paid_only":false,"cont_title":"第 65 场双周赛","cont_title_slug":"biweekly-contest-65"},{"question_id":1130,"title":"叶值的最小代价生成树","title_slug":"minimum-cost-tree-from-leaf-values","rating":1919.1749818083,"_hash":2542321733,"paid_only":false,"cont_title":"第 146 场周赛","cont_title_slug":"weekly-contest-146"},{"question_id":1416,"title":"恢复数组","title_slug":"restore-the-array","rating":1919.6391896894,"_hash":3484470279,"paid_only":false,"cont_title":"第 24 场双周赛","cont_title_slug":"biweekly-contest-24"},{"question_id":1552,"title":"两球之间的磁力","title_slug":"magnetic-force-between-two-balls","rating":1919.7433862082,"_hash":1049961856,"paid_only":false,"cont_title":"第 202 场周赛","cont_title_slug":"weekly-contest-202"},{"question_id":2731,"title":"移动机器人","title_slug":"movement-of-robots","rating":1922.9521758079,"_hash":1590024460,"paid_only":false,"cont_title":"第 106 场双周赛","cont_title_slug":"biweekly-contest-106"},{"question_id":1745,"title":"分割回文串 IV","title_slug":"palindrome-partitioning-iv","rating":1924.964639491,"_hash":1796587921,"paid_only":false,"cont_title":"第 226 场周赛","cont_title_slug":"weekly-contest-226"},{"question_id":1727,"title":"重新排列后的最大子矩阵","title_slug":"largest-submatrix-with-rearrangements","rating":1926.7059583253,"_hash":1815395495,"paid_only":false,"cont_title":"第 224 场周赛","cont_title_slug":"weekly-contest-224"},{"question_id":1449,"title":"数位成本和为目标值的最大数字","title_slug":"form-largest-integer-with-digits-that-add-up-to-target","rating":1927.4000816649,"_hash":1490454383,"paid_only":false,"cont_title":"第 26 场双周赛","cont_title_slug":"biweekly-contest-26"},{"question_id":1562,"title":"查找大小为 M 的最新分组","title_slug":"find-latest-group-of-size-m","rating":1928.2304187946,"_hash":239079794,"paid_only":false,"cont_title":"第 203 场周赛","cont_title_slug":"weekly-contest-203"},{"question_id":2654,"title":"使数组所有元素变成 1 的最少操作次数","title_slug":"minimum-number-of-operations-to-make-all-array-elements-equal-to-1","rating":1928.7961204946,"_hash":2113446044,"paid_only":false,"cont_title":"第 342 场周赛","cont_title_slug":"weekly-contest-342"},{"question_id":1802,"title":"有界数组中指定下标处的最大值","title_slug":"maximum-value-at-a-given-index-in-a-bounded-array","rating":1929.3184180196,"_hash":1767826160,"paid_only":false,"cont_title":"第 233 场周赛","cont_title_slug":"weekly-contest-233"},{"question_id":2018,"title":"判断单词是否能放入填字游戏内","title_slug":"check-if-word-can-be-placed-in-crossword","rating":1929.897343316,"_hash":1485423720,"paid_only":false,"cont_title":"第 260 场周赛","cont_title_slug":"weekly-contest-260"},{"question_id":1705,"title":"吃苹果的最大数目","title_slug":"maximum-number-of-eaten-apples","rating":1929.9086934334,"_hash":1687639369,"paid_only":false,"cont_title":"第 221 场周赛","cont_title_slug":"weekly-contest-221"},{"question_id":1798,"title":"你能构造出连续值的最大数目","title_slug":"maximum-number-of-consecutive-values-you-can-make","rating":1931.0849921121,"_hash":2407589215,"paid_only":false,"cont_title":"第 48 场双周赛","cont_title_slug":"biweekly-contest-48"},{"question_id":1574,"title":"删除最短的子数组使剩余数组有序","title_slug":"shortest-subarray-to-be-removed-to-make-array-sorted","rating":1931.7335479582,"_hash":236080983,"paid_only":false,"cont_title":"第 34 场双周赛","cont_title_slug":"biweekly-contest-34"},{"question_id":996,"title":"正方形数组的数目","title_slug":"number-of-squareful-arrays","rating":1932.3730795204,"_hash":448999750,"paid_only":false,"cont_title":"第 124 场周赛","cont_title_slug":"weekly-contest-124"},{"question_id":1964,"title":"找出到每个位置为止最长的有效障碍赛跑路线","title_slug":"find-the-longest-valid-obstacle-course-at-each-position","rating":1933.2169470617,"_hash":2251945224,"paid_only":false,"cont_title":"第 253 场周赛","cont_title_slug":"weekly-contest-253"},{"question_id":1818,"title":"绝对差值和","title_slug":"minimum-absolute-sum-difference","rating":1934.3556201811,"_hash":445102839,"paid_only":false,"cont_title":"第 235 场周赛","cont_title_slug":"weekly-contest-235"},{"question_id":2411,"title":"按位或最大的最小子数组长度","title_slug":"smallest-subarrays-with-maximum-bitwise-or","rating":1938.0586460002,"_hash":1975607113,"paid_only":false,"cont_title":"第 87 场双周赛","cont_title_slug":"biweekly-contest-87"},{"question_id":866,"title":"回文质数","title_slug":"prime-palindrome","rating":1938.2224916289,"_hash":3105635512,"paid_only":false,"cont_title":"第 92 场周赛","cont_title_slug":"weekly-contest-92"},{"question_id":2925,"title":"在树上执行操作以后得到的最大分数","title_slug":"maximum-score-after-applying-operations-on-a-tree","rating":1939.560165526,"_hash":750309798,"paid_only":false,"cont_title":"第 370 场周赛","cont_title_slug":"weekly-contest-370"},{"question_id":1760,"title":"袋子里最少数目的球","title_slug":"minimum-limit-of-balls-in-a-bag","rating":1939.9323330472,"_hash":3825739123,"paid_only":false,"cont_title":"第 228 场周赛","cont_title_slug":"weekly-contest-228"},{"question_id":2762,"title":"不间断子数组","title_slug":"continuous-subarrays","rating":1940.2116985812,"_hash":224630615,"paid_only":false,"cont_title":"第 352 场周赛","cont_title_slug":"weekly-contest-352"},{"question_id":2111,"title":"使数组 K 递增的最少操作次数","title_slug":"minimum-operations-to-make-the-array-k-increasing","rating":1940.6002290953,"_hash":1403965423,"paid_only":false,"cont_title":"第 272 场周赛","cont_title_slug":"weekly-contest-272"},{"question_id":2227,"title":"加密解密字符串","title_slug":"encrypt-and-decrypt-strings","rating":1944.5673996888,"_hash":4089321877,"paid_only":false,"cont_title":"第 287 场周赛","cont_title_slug":"weekly-contest-287"},{"question_id":1482,"title":"制作 m 束花所需的最少天数","title_slug":"minimum-number-of-days-to-make-m-bouquets","rating":1945.5095833982,"_hash":1858278973,"paid_only":false,"cont_title":"第 193 场周赛","cont_title_slug":"weekly-contest-193"},{"question_id":1793,"title":"好子数组的最大分数","title_slug":"maximum-score-of-a-good-subarray","rating":1945.7515607928,"_hash":3184596428,"paid_only":false,"cont_title":"第 232 场周赛","cont_title_slug":"weekly-contest-232"},{"question_id":1631,"title":"最小体力消耗路径","title_slug":"path-with-minimum-effort","rating":1947.5013967785,"_hash":3894947933,"paid_only":false,"cont_title":"第 212 场周赛","cont_title_slug":"weekly-contest-212"},{"question_id":2516,"title":"每种字符至少取 K 个","title_slug":"take-k-of-each-character-from-left-and-right","rating":1947.8832856412,"_hash":2088911620,"paid_only":false,"cont_title":"第 325 场周赛","cont_title_slug":"weekly-contest-325"},{"question_id":2509,"title":"查询树中环的长度","title_slug":"cycle-length-queries-in-a-tree","rating":1948.489500779,"_hash":922086852,"paid_only":false,"cont_title":"第 324 场周赛","cont_title_slug":"weekly-contest-324"},{"question_id":1153,"title":"字符串转化","title_slug":"string-transforms-into-another-string","rating":1949.0920823355,"_hash":120648461,"paid_only":false,"cont_title":"第 6 场双周赛","cont_title_slug":"biweekly-contest-6"},{"question_id":1690,"title":"石子游戏 VII","title_slug":"stone-game-vii","rating":1951.2096212775,"_hash":1168505902,"paid_only":false,"cont_title":"第 219 场周赛","cont_title_slug":"weekly-contest-219"},{"question_id":1259,"title":"不相交的握手","title_slug":"handshakes-that-dont-cross","rating":1951.3509259668,"_hash":108728140,"paid_only":false,"cont_title":"第 13 场双周赛","cont_title_slug":"biweekly-contest-13"},{"question_id":2435,"title":"矩阵中和能被 K 整除的路径","title_slug":"paths-in-matrix-whose-sum-is-divisible-by-k","rating":1951.5918682146,"_hash":3930025215,"paid_only":false,"cont_title":"第 314 场周赛","cont_title_slug":"weekly-contest-314"},{"question_id":1737,"title":"满足三条件之一需改变的最少字符数","title_slug":"change-minimum-characters-to-satisfy-one-of-three-conditions","rating":1952.7073399331,"_hash":3302467434,"paid_only":false,"cont_title":"第 225 场周赛","cont_title_slug":"weekly-contest-225"},{"question_id":2434,"title":"使用机器人打印字典序最小的字符串","title_slug":"using-a-robot-to-print-the-lexicographically-smallest-string","rating":1953.137726744,"_hash":3067908479,"paid_only":false,"cont_title":"第 314 场周赛","cont_title_slug":"weekly-contest-314"},{"question_id":1696,"title":"跳跃游戏 VI","title_slug":"jump-game-vi","rating":1954.2533254344,"_hash":261533544,"paid_only":false,"cont_title":"第 220 场周赛","cont_title_slug":"weekly-contest-220"},{"question_id":1463,"title":"摘樱桃 II","title_slug":"cherry-pickup-ii","rating":1956.7059585934,"_hash":3773526508,"paid_only":false,"cont_title":"第 27 场双周赛","cont_title_slug":"biweekly-contest-27"},{"question_id":2564,"title":"子字符串异或查询","title_slug":"substring-xor-queries","rating":1959.2696201953,"_hash":1709868853,"paid_only":false,"cont_title":"第 332 场周赛","cont_title_slug":"weekly-contest-332"},{"question_id":2392,"title":"给定条件下构造矩阵","title_slug":"build-a-matrix-with-conditions","rating":1960.5517123728,"_hash":700466705,"paid_only":false,"cont_title":"第 308 场周赛","cont_title_slug":"weekly-contest-308"},{"question_id":2350,"title":"不可能得到的最短骰子序列","title_slug":"shortest-impossible-sequence-of-rolls","rating":1960.5763266754,"_hash":3898582486,"paid_only":false,"cont_title":"第 83 场双周赛","cont_title_slug":"biweekly-contest-83"},{"question_id":1537,"title":"最大得分","title_slug":"get-the-maximum-score","rating":1961.4987013156,"_hash":3315363657,"paid_only":false,"cont_title":"第 200 场周赛","cont_title_slug":"weekly-contest-200"},{"question_id":1642,"title":"可以到达的最远建筑","title_slug":"furthest-building-you-can-reach","rating":1962.2005269503,"_hash":1972718658,"paid_only":false,"cont_title":"第 213 场周赛","cont_title_slug":"weekly-contest-213"},{"question_id":2439,"title":"最小化数组中的最大值","title_slug":"minimize-maximum-of-array","rating":1965.1266122355,"_hash":938263064,"paid_only":false,"cont_title":"第 89 场双周赛","cont_title_slug":"biweekly-contest-89"},{"question_id":1969,"title":"数组元素的最小非零乘积","title_slug":"minimum-non-zero-product-of-the-array-elements","rating":1966.7067914206,"_hash":4252220750,"paid_only":false,"cont_title":"第 254 场周赛","cont_title_slug":"weekly-contest-254"},{"question_id":1293,"title":"网格中的最短路径","title_slug":"shortest-path-in-a-grid-with-obstacles-elimination","rating":1967.3284576938,"_hash":3580394792,"paid_only":false,"cont_title":"第 167 场周赛","cont_title_slug":"weekly-contest-167"},{"question_id":2872,"title":"可以被 K 整除连通块的最大数目","title_slug":"maximum-number-of-k-divisible-components","rating":1967.5589835406,"_hash":1584359446,"paid_only":false,"cont_title":"第 114 场双周赛","cont_title_slug":"biweekly-contest-114"},{"question_id":1943,"title":"描述绘画结果","title_slug":"describe-the-painting","rating":1969.2019235672,"_hash":3387998069,"paid_only":false,"cont_title":"第 57 场双周赛","cont_title_slug":"biweekly-contest-57"},{"question_id":835,"title":"图像重叠","title_slug":"image-overlap","rating":1969.9845549158,"_hash":2595882232,"paid_only":false,"cont_title":"第 84 场周赛","cont_title_slug":"weekly-contest-84"},{"question_id":1032,"title":"字符流","title_slug":"stream-of-characters","rating":1970.4608098164,"_hash":1504907424,"paid_only":false,"cont_title":"第 133 场周赛","cont_title_slug":"weekly-contest-133"},{"question_id":1488,"title":"避免洪水泛滥","title_slug":"avoid-flood-in-the-city","rating":1973.7407637067,"_hash":178132881,"paid_only":false,"cont_title":"第 194 场周赛","cont_title_slug":"weekly-contest-194"},{"question_id":907,"title":"子数组的最小值之和","title_slug":"sum-of-subarray-minimums","rating":1975.5726300727,"_hash":2762853048,"paid_only":false,"cont_title":"第 102 场周赛","cont_title_slug":"weekly-contest-102"},{"question_id":2831,"title":"找出最长等值子数组","title_slug":"find-the-longest-equal-subarray","rating":1975.9693382075,"_hash":869865446,"paid_only":false,"cont_title":"第 359 场周赛","cont_title_slug":"weekly-contest-359"},{"question_id":1092,"title":"最短公共超序列","title_slug":"shortest-common-supersequence","rating":1976.7214151234,"_hash":3433602336,"paid_only":false,"cont_title":"第 141 场周赛","cont_title_slug":"weekly-contest-141"},{"question_id":1882,"title":"使用服务器处理任务","title_slug":"process-tasks-using-servers","rating":1979.1112273597,"_hash":3237851921,"paid_only":false,"cont_title":"第 243 场周赛","cont_title_slug":"weekly-contest-243"},{"question_id":1278,"title":"分割回文串 III","title_slug":"palindrome-partitioning-iii","rating":1979.1323403633,"_hash":2471898191,"paid_only":false,"cont_title":"第 165 场周赛","cont_title_slug":"weekly-contest-165"},{"question_id":2151,"title":"基于陈述统计最多好人数","title_slug":"maximum-good-people-based-on-statements","rating":1979.9454101467,"_hash":2347660974,"paid_only":false,"cont_title":"第 277 场周赛","cont_title_slug":"weekly-contest-277"},{"question_id":2861,"title":"最大合金数","title_slug":"maximum-number-of-alloys","rating":1981.3072959787,"_hash":1197966112,"paid_only":false,"cont_title":"第 363 场周赛","cont_title_slug":"weekly-contest-363"},{"question_id":1250,"title":"检查「好数组」","title_slug":"check-if-it-is-a-good-array","rating":1983.2319731313,"_hash":4185904896,"paid_only":false,"cont_title":"第 161 场周赛","cont_title_slug":"weekly-contest-161"},{"question_id":1733,"title":"需要教语言的最少人数","title_slug":"minimum-number-of-people-to-teach","rating":1983.70440706,"_hash":2904534885,"paid_only":false,"cont_title":"第 44 场双周赛","cont_title_slug":"biweekly-contest-44"},{"question_id":2963,"title":"统计好分割方案的数目","title_slug":"count-the-number-of-good-partitions","rating":1984.9685663849,"_hash":3740959852,"paid_only":false,"cont_title":"第 375 场周赛","cont_title_slug":"weekly-contest-375"},{"question_id":940,"title":"不同的子序列 II","title_slug":"distinct-subsequences-ii","rating":1985.2417520906,"_hash":2213463441,"paid_only":false,"cont_title":"第 110 场周赛","cont_title_slug":"weekly-contest-110"},{"question_id":928,"title":"尽量减少恶意软件的传播 II","title_slug":"minimize-malware-spread-ii","rating":1985.2504512337,"_hash":1457368038,"paid_only":false,"cont_title":"第 107 场周赛","cont_title_slug":"weekly-contest-107"},{"question_id":902,"title":"最大为 N 的数字组合","title_slug":"numbers-at-most-n-given-digit-set","rating":1989.5369509422,"_hash":3023386017,"paid_only":false,"cont_title":"第 101 场周赛","cont_title_slug":"weekly-contest-101"},{"question_id":963,"title":"最小面积矩形 II","title_slug":"minimum-area-rectangle-ii","rating":1990.7738526153,"_hash":2631196608,"paid_only":false,"cont_title":"第 116 场周赛","cont_title_slug":"weekly-contest-116"},{"question_id":1625,"title":"执行操作后字典序最小的字符串","title_slug":"lexicographically-smallest-string-after-applying-operations","rating":1992.0032292739,"_hash":3307683900,"paid_only":false,"cont_title":"第 211 场周赛","cont_title_slug":"weekly-contest-211"},{"question_id":927,"title":"三等分","title_slug":"three-equal-parts","rating":1994.3618892548,"_hash":2182253577,"paid_only":false,"cont_title":"第 107 场周赛","cont_title_slug":"weekly-contest-107"},{"question_id":1986,"title":"完成任务的最少工作时间段","title_slug":"minimum-number-of-work-sessions-to-finish-the-tasks","rating":1995.2937073376,"_hash":1113985320,"paid_only":false,"cont_title":"第 256 场周赛","cont_title_slug":"weekly-contest-256"},{"question_id":1274,"title":"矩形内船只的数目","title_slug":"number-of-ships-in-a-rectangle","rating":1997.1824403719,"_hash":474791918,"paid_only":false,"cont_title":"第 14 场双周赛","cont_title_slug":"biweekly-contest-14"},{"question_id":2250,"title":"统计包含每个点的矩形数目","title_slug":"count-number-of-rectangles-containing-each-point","rating":1997.7013718153,"_hash":1075971933,"paid_only":false,"cont_title":"第 290 场周赛","cont_title_slug":"weekly-contest-290"},{"question_id":2488,"title":"统计中位数为 K 的子数组","title_slug":"count-subarrays-with-median-k","rating":1998.889914712,"_hash":2631420913,"paid_only":false,"cont_title":"第 321 场周赛","cont_title_slug":"weekly-contest-321"},{"question_id":911,"title":"在线选举","title_slug":"online-election","rating":2000.8021428612,"_hash":2045578042,"paid_only":false,"cont_title":"第 103 场周赛","cont_title_slug":"weekly-contest-103"},{"question_id":1686,"title":"石子游戏 VI","title_slug":"stone-game-vi","rating":2000.8441804448,"_hash":1954801587,"paid_only":false,"cont_title":"第 41 场双周赛","cont_title_slug":"biweekly-contest-41"},{"question_id":2328,"title":"网格图中递增路径的数目","title_slug":"number-of-increasing-paths-in-a-grid","rating":2001.2074132383,"_hash":2560027362,"paid_only":false,"cont_title":"第 300 场周赛","cont_title_slug":"weekly-contest-300"},{"question_id":2850,"title":"将石头分散到网格图的最少移动次数","title_slug":"minimum-moves-to-spread-stones-over-grid","rating":2001.4515854273,"_hash":3939185799,"paid_only":false,"cont_title":"第 362 场周赛","cont_title_slug":"weekly-contest-362"},{"question_id":2092,"title":"找出知晓秘密的所有专家","title_slug":"find-all-people-with-secret","rating":2003.5794613668,"_hash":340770494,"paid_only":false,"cont_title":"第 269 场周赛","cont_title_slug":"weekly-contest-269"},{"question_id":1927,"title":"求和游戏","title_slug":"sum-game","rating":2004.5346526204,"_hash":1519983797,"paid_only":false,"cont_title":"第 56 场双周赛","cont_title_slug":"biweekly-contest-56"},{"question_id":1761,"title":"一个图中连通三元组的最小度数","title_slug":"minimum-degree-of-a-connected-trio-in-a-graph","rating":2005.2755755378,"_hash":1808561792,"paid_only":false,"cont_title":"第 228 场周赛","cont_title_slug":"weekly-contest-228"},{"question_id":2448,"title":"使数组相等的最小开销","title_slug":"minimum-cost-to-make-array-equal","rating":2005.3737929084,"_hash":1689171801,"paid_only":false,"cont_title":"第 316 场周赛","cont_title_slug":"weekly-contest-316"},{"question_id":1888,"title":"使二进制字符串字符交替的最少反转次数","title_slug":"minimum-number-of-flips-to-make-the-binary-string-alternating","rating":2005.5862669078,"_hash":3565951903,"paid_only":false,"cont_title":"第 244 场周赛","cont_title_slug":"weekly-contest-244"},{"question_id":1223,"title":"掷骰子模拟","title_slug":"dice-roll-simulation","rating":2008.40650791,"_hash":1023816398,"paid_only":false,"cont_title":"第 158 场周赛","cont_title_slug":"weekly-contest-158"},{"question_id":1981,"title":"最小化目标值与所选元素的差","title_slug":"minimize-the-difference-between-target-and-chosen-elements","rating":2009.7322365973,"_hash":3922635563,"paid_only":false,"cont_title":"第 255 场周赛","cont_title_slug":"weekly-contest-255"},{"question_id":880,"title":"索引处的解码字符串","title_slug":"decoded-string-at-index","rating":2010.5524756946,"_hash":3383627644,"paid_only":false,"cont_title":"第 96 场周赛","cont_title_slug":"weekly-contest-96"},{"question_id":2333,"title":"最小差值平方和","title_slug":"minimum-sum-of-squared-difference","rating":2011.0496162515,"_hash":374180471,"paid_only":false,"cont_title":"第 82 场双周赛","cont_title_slug":"biweekly-contest-82"},{"question_id":1102,"title":"得分最高的路径","title_slug":"path-with-maximum-minimum-value","rating":2011.3542735398,"_hash":319427731,"paid_only":false,"cont_title":"第 3 场双周赛","cont_title_slug":"biweekly-contest-3"},{"question_id":2477,"title":"到达首都的最少油耗","title_slug":"minimum-fuel-cost-to-report-to-the-capital","rating":2011.9703133514,"_hash":340860484,"paid_only":false,"cont_title":"第 320 场周赛","cont_title_slug":"weekly-contest-320"},{"question_id":2472,"title":"不重叠回文子字符串的最大数目","title_slug":"maximum-number-of-non-overlapping-palindrome-substrings","rating":2013.4354344791,"_hash":3513036702,"paid_only":false,"cont_title":"第 319 场周赛","cont_title_slug":"weekly-contest-319"},{"question_id":1105,"title":"填充书架","title_slug":"filling-bookcase-shelves","rating":2014.2979320644,"_hash":2099267983,"paid_only":false,"cont_title":"第 143 场周赛","cont_title_slug":"weekly-contest-143"},{"question_id":1354,"title":"多次求和构造目标数组","title_slug":"construct-target-array-with-multiple-sums","rating":2014.7655493665,"_hash":681133837,"paid_only":false,"cont_title":"第 176 场周赛","cont_title_slug":"weekly-contest-176"},{"question_id":1353,"title":"最多可以参加的会议数目","title_slug":"maximum-number-of-events-that-can-be-attended","rating":2015.7291888336,"_hash":2529461898,"paid_only":false,"cont_title":"第 176 场周赛","cont_title_slug":"weekly-contest-176"},{"question_id":3008,"title":"找出数组中的美丽下标 II","title_slug":"find-beautiful-indices-in-the-given-array-ii","rating":2016.2085876254,"_hash":1547023723,"paid_only":false,"cont_title":"第 380 场周赛","cont_title_slug":"weekly-contest-380"},{"question_id":909,"title":"蛇梯棋","title_slug":"snakes-and-ladders","rating":2019.5399647546,"_hash":478874060,"paid_only":false,"cont_title":"第 103 场周赛","cont_title_slug":"weekly-contest-103"},{"question_id":2547,"title":"拆分数组的最小代价","title_slug":"minimum-cost-to-split-an-array","rating":2019.9859462755,"_hash":3573894690,"paid_only":false,"cont_title":"第 329 场周赛","cont_title_slug":"weekly-contest-329"},{"question_id":3027,"title":"人员站位的方案数 II","title_slug":"find-the-number-of-ways-to-place-people-ii","rating":2020.1846215023,"_hash":79432680,"paid_only":false,"cont_title":"第 123 场双周赛","cont_title_slug":"biweekly-contest-123"},{"question_id":2517,"title":"礼盒的最大甜蜜度","title_slug":"maximum-tastiness-of-candy-basket","rating":2020.6775180586,"_hash":337441895,"paid_only":false,"cont_title":"第 325 场周赛","cont_title_slug":"weekly-contest-325"},{"question_id":2741,"title":"特别的排列","title_slug":"special-permutations","rating":2020.7095306378,"_hash":492772626,"paid_only":false,"cont_title":"第 350 场周赛","cont_title_slug":"weekly-contest-350"},{"question_id":2271,"title":"毯子覆盖的最多白色砖块数","title_slug":"maximum-white-tiles-covered-by-a-carpet","rating":2021.7790710467,"_hash":1450266090,"paid_only":false,"cont_title":"第 78 场双周赛","cont_title_slug":"biweekly-contest-78"},{"question_id":2251,"title":"花期内花的数目","title_slug":"number-of-flowers-in-full-bloom","rating":2022.3137128296,"_hash":251006919,"paid_only":false,"cont_title":"第 290 场周赛","cont_title_slug":"weekly-contest-290"},{"question_id":1210,"title":"穿过迷宫的最少移动次数","title_slug":"minimum-moves-to-reach-target-with-rotations","rating":2022.4752963768,"_hash":2716747123,"paid_only":false,"cont_title":"第 156 场周赛","cont_title_slug":"weekly-contest-156"},{"question_id":1235,"title":"规划兼职工作","title_slug":"maximum-profit-in-job-scheduling","rating":2022.8520613737,"_hash":4225343365,"paid_only":false,"cont_title":"第 159 场周赛","cont_title_slug":"weekly-contest-159"},{"question_id":2597,"title":"美丽子集的数目","title_slug":"the-number-of-beautiful-subsets","rating":2023.4303440211,"_hash":1913772288,"paid_only":false,"cont_title":"第 337 场周赛","cont_title_slug":"weekly-contest-337"},{"question_id":1734,"title":"解码异或后的排列","title_slug":"decode-xored-permutation","rating":2024.3797833173,"_hash":2691544887,"paid_only":false,"cont_title":"第 44 场双周赛","cont_title_slug":"biweekly-contest-44"},{"question_id":1067,"title":"范围内的数字计数","title_slug":"digit-count-in-range","rating":2025.1529365814,"_hash":1347652080,"paid_only":false,"cont_title":"第 1 场双周赛","cont_title_slug":"biweekly-contest-1"},{"question_id":1406,"title":"石子游戏 III","title_slug":"stone-game-iii","rating":2026.8957817007,"_hash":3979947991,"paid_only":false,"cont_title":"第 183 场周赛","cont_title_slug":"weekly-contest-183"},{"question_id":1626,"title":"无矛盾的最佳球队","title_slug":"best-team-with-no-conflicts","rating":2027.3839266711,"_hash":205364228,"paid_only":false,"cont_title":"第 211 场周赛","cont_title_slug":"weekly-contest-211"},{"question_id":1320,"title":"二指输入的的最小距离","title_slug":"minimum-distance-to-type-a-word-using-two-fingers","rating":2027.7304121046,"_hash":3992139324,"paid_only":false,"cont_title":"第 171 场周赛","cont_title_slug":"weekly-contest-171"},{"question_id":895,"title":"最大频率栈","title_slug":"maximum-frequency-stack","rating":2027.8772739639,"_hash":4136320759,"paid_only":false,"cont_title":"第 99 场周赛","cont_title_slug":"weekly-contest-99"},{"question_id":1231,"title":"分享巧克力","title_slug":"divide-chocolate","rating":2029.1301557536,"_hash":1053077839,"paid_only":false,"cont_title":"第 11 场双周赛","cont_title_slug":"biweekly-contest-11"},{"question_id":2772,"title":"使数组中的所有元素都等于零","title_slug":"apply-operations-to-make-all-array-elements-equal-to-zero","rating":2029.4024513478,"_hash":1866851323,"paid_only":false,"cont_title":"第 353 场周赛","cont_title_slug":"weekly-contest-353"},{"question_id":2426,"title":"满足不等式的数对数目","title_slug":"number-of-pairs-satisfying-inequality","rating":2030.1021023033,"_hash":1785363546,"paid_only":false,"cont_title":"第 88 场双周赛","cont_title_slug":"biweekly-contest-88"},{"question_id":2919,"title":"使数组变美的最小增量运算数","title_slug":"minimum-increment-operations-to-make-array-beautiful","rating":2030.922770301,"_hash":1420249701,"paid_only":false,"cont_title":"第 369 场周赛","cont_title_slug":"weekly-contest-369"},{"question_id":1425,"title":"带限制的子序列和","title_slug":"constrained-subsequence-sum","rating":2032.4773038683,"_hash":1691609067,"paid_only":false,"cont_title":"第 186 场周赛","cont_title_slug":"weekly-contest-186"},{"question_id":2262,"title":"字符串的总引力","title_slug":"total-appeal-of-a-string","rating":2033.1699277531,"_hash":3802833057,"paid_only":false,"cont_title":"第 291 场周赛","cont_title_slug":"weekly-contest-291"},{"question_id":2136,"title":"全部开花的最早一天","title_slug":"earliest-possible-day-of-full-bloom","rating":2033.4597721985,"_hash":1189152973,"paid_only":false,"cont_title":"第 275 场周赛","cont_title_slug":"weekly-contest-275"},{"question_id":828,"title":"统计子串中的唯一字符","title_slug":"count-unique-characters-of-all-substrings-of-a-given-string","rating":2034.4067304341,"_hash":747763790,"paid_only":false,"cont_title":"第 83 场周赛","cont_title_slug":"weekly-contest-83"},{"question_id":947,"title":"移除最多的同行或同列石头","title_slug":"most-stones-removed-with-same-row-or-column","rating":2034.6759416871,"_hash":728229560,"paid_only":false,"cont_title":"第 112 场周赛","cont_title_slug":"weekly-contest-112"},{"question_id":1335,"title":"工作计划的最低难度","title_slug":"minimum-difficulty-of-a-job-schedule","rating":2034.9420578559,"_hash":271335539,"paid_only":false,"cont_title":"第 173 场周赛","cont_title_slug":"weekly-contest-173"},{"question_id":1140,"title":"石子游戏 II","title_slug":"stone-game-ii","rating":2034.9740902393,"_hash":2086212420,"paid_only":false,"cont_title":"第 147 场周赛","cont_title_slug":"weekly-contest-147"},{"question_id":1348,"title":"推文计数","title_slug":"tweet-counts-per-frequency","rating":2036.7206020719,"_hash":2176047848,"paid_only":false,"cont_title":"第 175 场周赛","cont_title_slug":"weekly-contest-175"},{"question_id":2245,"title":"转角路径的乘积中最多能有几个尾随零","title_slug":"maximum-trailing-zeros-in-a-cornered-path","rating":2036.7410194704,"_hash":2369761961,"paid_only":false,"cont_title":"第 289 场周赛","cont_title_slug":"weekly-contest-289"},{"question_id":2116,"title":"判断一个括号字符串是否有效","title_slug":"check-if-a-parentheses-string-can-be-valid","rating":2037.6527962599,"_hash":495901528,"paid_only":false,"cont_title":"第 68 场双周赛","cont_title_slug":"biweekly-contest-68"},{"question_id":1590,"title":"使数组和能被 P 整除","title_slug":"make-sum-divisible-by-p","rating":2038.8592725467,"_hash":2279246890,"paid_only":false,"cont_title":"第 35 场双周赛","cont_title_slug":"biweekly-contest-35"},{"question_id":1201,"title":"丑数 III","title_slug":"ugly-number-iii","rating":2039.110874689,"_hash":4021161204,"paid_only":false,"cont_title":"第 155 场周赛","cont_title_slug":"weekly-contest-155"},{"question_id":1371,"title":"每个元音包含偶数次的最长子字符串","title_slug":"find-the-longest-substring-containing-vowels-in-even-counts","rating":2040.539289037,"_hash":2810226521,"paid_only":false,"cont_title":"第 21 场双周赛","cont_title_slug":"biweekly-contest-21"},{"question_id":1751,"title":"最多可以参加的会议数目 II","title_slug":"maximum-number-of-events-that-can-be-attended-ii","rating":2040.5621123027,"_hash":1944526967,"paid_only":false,"cont_title":"第 45 场双周赛","cont_title_slug":"biweekly-contest-45"},{"question_id":2551,"title":"将珠子放入背包中","title_slug":"put-marbles-in-bags","rating":2042.4005521254,"_hash":1210688937,"paid_only":false,"cont_title":"第 330 场周赛","cont_title_slug":"weekly-contest-330"},{"question_id":2735,"title":"收集巧克力","title_slug":"collecting-chocolates","rating":2043.1015779104,"_hash":3216210693,"paid_only":false,"cont_title":"第 349 场周赛","cont_title_slug":"weekly-contest-349"},{"question_id":2948,"title":"交换得到字典序最小的数组","title_slug":"make-lexicographically-smallest-array-by-swapping-elements","rating":2047.3919190727,"_hash":4034022024,"paid_only":false,"cont_title":"第 373 场周赛","cont_title_slug":"weekly-contest-373"},{"question_id":1553,"title":"吃掉 N 个橘子的最少天数","title_slug":"minimum-number-of-days-to-eat-n-oranges","rating":2048.0976546787,"_hash":3077217367,"paid_only":false,"cont_title":"第 202 场周赛","cont_title_slug":"weekly-contest-202"},{"question_id":1648,"title":"销售价值减少的颜色球","title_slug":"sell-diminishing-valued-colored-balls","rating":2050.2553211463,"_hash":4033162779,"paid_only":false,"cont_title":"第 214 场周赛","cont_title_slug":"weekly-contest-214"},{"question_id":1224,"title":"最大相等频率","title_slug":"maximum-equal-frequency","rating":2050.715977457,"_hash":3117661899,"paid_only":false,"cont_title":"第 158 场周赛","cont_title_slug":"weekly-contest-158"},{"question_id":1856,"title":"子数组最小乘积的最大值","title_slug":"maximum-subarray-min-product","rating":2051.0879431258,"_hash":209121812,"paid_only":false,"cont_title":"第 240 场周赛","cont_title_slug":"weekly-contest-240"},{"question_id":2467,"title":"树上最大得分和路径","title_slug":"most-profitable-path-in-a-tree","rating":2053.354609292,"_hash":2422423692,"paid_only":false,"cont_title":"第 91 场双周赛","cont_title_slug":"biweekly-contest-91"},{"question_id":839,"title":"相似字符串组","title_slug":"similar-string-groups","rating":2053.7468090497,"_hash":2704310299,"paid_only":false,"cont_title":"第 85 场周赛","cont_title_slug":"weekly-contest-85"},{"question_id":1575,"title":"统计所有可行路径","title_slug":"count-all-possible-routes","rating":2055.0970201875,"_hash":1387834419,"paid_only":false,"cont_title":"第 34 场双周赛","cont_title_slug":"biweekly-contest-34"},{"question_id":2542,"title":"最大子序列的分数","title_slug":"maximum-subsequence-score","rating":2056.2598215101,"_hash":301567212,"paid_only":false,"cont_title":"第 96 场双周赛","cont_title_slug":"biweekly-contest-96"},{"question_id":1473,"title":"粉刷房子 III","title_slug":"paint-house-iii","rating":2056.335494216,"_hash":741778858,"paid_only":false,"cont_title":"第 192 场周赛","cont_title_slug":"weekly-contest-192"},{"question_id":2197,"title":"替换数组中的非互质数","title_slug":"replace-non-coprime-numbers-in-array","rating":2057.4788263111,"_hash":2370755498,"paid_only":false,"cont_title":"第 283 场周赛","cont_title_slug":"weekly-contest-283"},{"question_id":1131,"title":"绝对值表达式的最大值","title_slug":"maximum-of-absolute-value-expression","rating":2059.4040623264,"_hash":1649292854,"paid_only":false,"cont_title":"第 146 场周赛","cont_title_slug":"weekly-contest-146"},{"question_id":2508,"title":"添加边使所有节点度数都为偶数","title_slug":"add-edges-to-make-degrees-of-all-nodes-even","rating":2060.0720834082,"_hash":2337606731,"paid_only":false,"cont_title":"第 324 场周赛","cont_title_slug":"weekly-contest-324"},{"question_id":2681,"title":"英雄的力量","title_slug":"power-of-heroes","rating":2060.0818824378,"_hash":3969212159,"paid_only":false,"cont_title":"第 104 场双周赛","cont_title_slug":"biweekly-contest-104"},{"question_id":2366,"title":"将数组排序的最少替换次数","title_slug":"minimum-replacements-to-sort-the-array","rating":2060.379991517,"_hash":3435556540,"paid_only":false,"cont_title":"第 84 场双周赛","cont_title_slug":"biweekly-contest-84"},{"question_id":2106,"title":"摘水果","title_slug":"maximum-fruits-harvested-after-at-most-k-steps","rating":2062.3601158741,"_hash":3434976181,"paid_only":false,"cont_title":"第 271 场周赛","cont_title_slug":"weekly-contest-271"},{"question_id":2156,"title":"查找给定哈希值的子串","title_slug":"find-substring-with-given-hash-value","rating":2062.9876807625,"_hash":3801430886,"paid_only":false,"cont_title":"第 278 场周赛","cont_title_slug":"weekly-contest-278"},{"question_id":855,"title":"考场就座","title_slug":"exam-room","rating":2067.0643721733,"_hash":362145938,"paid_only":false,"cont_title":"第 89 场周赛","cont_title_slug":"weekly-contest-89"},{"question_id":1770,"title":"执行乘法运算的最大分数","title_slug":"maximum-score-from-performing-multiplication-operations","rating":2068.0043466118,"_hash":3231265233,"paid_only":false,"cont_title":"第 229 场周赛","cont_title_slug":"weekly-contest-229"},{"question_id":1368,"title":"使网格图至少有一条有效路径的最小代价","title_slug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid","rating":2068.806637566,"_hash":2875388393,"paid_only":false,"cont_title":"第 178 场周赛","cont_title_slug":"weekly-contest-178"},{"question_id":1168,"title":"水资源分配优化","title_slug":"optimize-water-distribution-in-a-village","rating":2069.4030284676,"_hash":271664224,"paid_only":false,"cont_title":"第 7 场双周赛","cont_title_slug":"biweekly-contest-7"},{"question_id":2514,"title":"统计同位异构字符串数目","title_slug":"count-anagrams","rating":2069.7848729824,"_hash":2697534725,"paid_only":false,"cont_title":"第 94 场双周赛","cont_title_slug":"biweekly-contest-94"},{"question_id":1808,"title":"好因子的最大数目","title_slug":"maximize-number-of-nice-divisors","rating":2070.2102619334,"_hash":3237331717,"paid_only":false,"cont_title":"第 234 场周赛","cont_title_slug":"weekly-contest-234"},{"question_id":2607,"title":"使子数组元素和相等","title_slug":"make-k-subarray-sums-equal","rating":2071.3208991938,"_hash":1691357385,"paid_only":false,"cont_title":"第 101 场双周赛","cont_title_slug":"biweekly-contest-101"},{"question_id":2866,"title":"美丽塔 II","title_slug":"beautiful-towers-ii","rating":2071.6322841217,"_hash":2692580018,"paid_only":false,"cont_title":"第 364 场周赛","cont_title_slug":"weekly-contest-364"},{"question_id":1799,"title":"N 次操作后的最大分数和","title_slug":"maximize-score-after-n-operations","rating":2072.7264178313,"_hash":1580991625,"paid_only":false,"cont_title":"第 48 场双周赛","cont_title_slug":"biweekly-contest-48"},{"question_id":1850,"title":"邻位交换的最小次数","title_slug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number","rating":2073.0124645606,"_hash":1640158797,"paid_only":false,"cont_title":"第 239 场周赛","cont_title_slug":"weekly-contest-239"},{"question_id":2845,"title":"统计趣味子数组的数目","title_slug":"count-of-interesting-subarrays","rating":2073.048019317,"_hash":3334241084,"paid_only":false,"cont_title":"第 361 场周赛","cont_title_slug":"weekly-contest-361"},{"question_id":871,"title":"最低加油次数","title_slug":"minimum-number-of-refueling-stops","rating":2074.4120526679,"_hash":4182324049,"paid_only":false,"cont_title":"第 93 场周赛","cont_title_slug":"weekly-contest-93"},{"question_id":2906,"title":"构造乘积矩阵","title_slug":"construct-product-matrix","rating":2074.8331146269,"_hash":4290150798,"paid_only":false,"cont_title":"第 367 场周赛","cont_title_slug":"weekly-contest-367"},{"question_id":2354,"title":"优质数对的数目","title_slug":"number-of-excellent-pairs","rating":2075.9046975409,"_hash":3803787289,"paid_only":false,"cont_title":"第 303 场周赛","cont_title_slug":"weekly-contest-303"},{"question_id":2449,"title":"使数组相似的最少操作次数","title_slug":"minimum-number-of-operations-to-make-arrays-similar","rating":2076.0155978787,"_hash":3679518604,"paid_only":false,"cont_title":"第 316 场周赛","cont_title_slug":"weekly-contest-316"},{"question_id":1088,"title":"易混淆数 II","title_slug":"confusing-number-ii","rating":2076.8975497986,"_hash":2950336182,"paid_only":false,"cont_title":"第 2 场双周赛","cont_title_slug":"biweekly-contest-2"},{"question_id":2959,"title":"关闭分部的可行集合数目","title_slug":"number-of-possible-sets-of-closing-branches","rating":2077.4738459704,"_hash":796165027,"paid_only":false,"cont_title":"第 119 场双周赛","cont_title_slug":"biweekly-contest-119"},{"question_id":843,"title":"猜猜这个单词","title_slug":"guess-the-word","rating":2077.5054883516,"_hash":2857979415,"paid_only":false,"cont_title":"第 86 场周赛","cont_title_slug":"weekly-contest-86"},{"question_id":1786,"title":"从第一个节点出发到最后一个节点的受限路径数","title_slug":"number-of-restricted-paths-from-first-to-last-node","rating":2078.5417326415,"_hash":1823999301,"paid_only":false,"cont_title":"第 231 场周赛","cont_title_slug":"weekly-contest-231"},{"question_id":1712,"title":"将数组分成三个子数组的方案数","title_slug":"ways-to-split-array-into-three-subarrays","rating":2078.6986769435,"_hash":1074334353,"paid_only":false,"cont_title":"第 222 场周赛","cont_title_slug":"weekly-contest-222"},{"question_id":975,"title":"奇偶跳","title_slug":"odd-even-jump","rating":2079.1911227043,"_hash":1733046404,"paid_only":false,"cont_title":"第 119 场周赛","cont_title_slug":"weekly-contest-119"},{"question_id":1643,"title":"第 K 条最小指令","title_slug":"kth-smallest-instructions","rating":2079.9846866239,"_hash":2988782714,"paid_only":false,"cont_title":"第 213 场周赛","cont_title_slug":"weekly-contest-213"},{"question_id":1718,"title":"构建字典序最大的可行序列","title_slug":"construct-the-lexicographically-largest-valid-sequence","rating":2080.0425875741,"_hash":3869351459,"paid_only":false,"cont_title":"第 43 场双周赛","cont_title_slug":"biweekly-contest-43"},{"question_id":2555,"title":"两个线段获得的最多奖品","title_slug":"maximize-win-from-two-segments","rating":2080.7845644831,"_hash":149268417,"paid_only":false,"cont_title":"第 97 场双周赛","cont_title_slug":"biweekly-contest-97"},{"question_id":2560,"title":"打家劫舍 IV","title_slug":"house-robber-iv","rating":2081.1880297942,"_hash":1088208610,"paid_only":false,"cont_title":"第 331 场周赛","cont_title_slug":"weekly-contest-331"},{"question_id":1639,"title":"通过给定词典构造目标字符串的方案数","title_slug":"number-of-ways-to-form-a-target-string-given-a-dictionary","rating":2081.6909344021,"_hash":4276174201,"paid_only":false,"cont_title":"第 38 场双周赛","cont_title_slug":"biweekly-contest-38"},{"question_id":2857,"title":"统计距离为 k 的点对","title_slug":"count-pairs-of-points-with-distance-k","rating":2081.698529877,"_hash":1047256075,"paid_only":false,"cont_title":"第 113 场双周赛","cont_title_slug":"biweekly-contest-113"},{"question_id":1847,"title":"最近的房间","title_slug":"closest-room","rating":2081.7518764643,"_hash":1181589124,"paid_only":false,"cont_title":"第 51 场双周赛","cont_title_slug":"biweekly-contest-51"},{"question_id":1494,"title":"并行课程 II","title_slug":"parallel-courses-ii","rating":2081.8087755451,"_hash":2963413938,"paid_only":false,"cont_title":"第 29 场双周赛","cont_title_slug":"biweekly-contest-29"},{"question_id":2050,"title":"并行课程 III","title_slug":"parallel-courses-iii","rating":2084.1404698713,"_hash":3929135553,"paid_only":false,"cont_title":"第 264 场周赛","cont_title_slug":"weekly-contest-264"},{"question_id":2009,"title":"使数组连续的最少操作数","title_slug":"minimum-number-of-operations-to-make-array-continuous","rating":2084.4980206639,"_hash":419814877,"paid_only":false,"cont_title":"第 61 场双周赛","cont_title_slug":"biweekly-contest-61"},{"question_id":2267,"title":"检查是否有合法括号字符串路径","title_slug":"check-if-there-is-a-valid-parentheses-string-path","rating":2084.5752686737,"_hash":1017177635,"paid_only":false,"cont_title":"第 292 场周赛","cont_title_slug":"weekly-contest-292"},{"question_id":1192,"title":"查找集群内的关键连接","title_slug":"critical-connections-in-a-network","rating":2084.6866916045,"_hash":3870941501,"paid_only":false,"cont_title":"第 154 场周赛","cont_title_slug":"weekly-contest-154"},{"question_id":982,"title":"按位与为零的三元组","title_slug":"triples-with-bitwise-and-equal-to-zero","rating":2084.9697035674,"_hash":1019777981,"paid_only":false,"cont_title":"第 121 场周赛","cont_title_slug":"weekly-contest-121"},{"question_id":1563,"title":"石子游戏 V","title_slug":"stone-game-v","rating":2087.2049275667,"_hash":3581728008,"paid_only":false,"cont_title":"第 203 场周赛","cont_title_slug":"weekly-contest-203"},{"question_id":2318,"title":"不同骰子序列的数目","title_slug":"number-of-distinct-roll-sequences","rating":2090.4183788498,"_hash":3973609032,"paid_only":false,"cont_title":"第 81 场双周赛","cont_title_slug":"biweekly-contest-81"},{"question_id":2193,"title":"得到回文串的最少操作次数","title_slug":"minimum-number-of-moves-to-make-palindrome","rating":2090.6800569319,"_hash":4275612953,"paid_only":false,"cont_title":"第 73 场双周赛","cont_title_slug":"biweekly-contest-73"},{"question_id":1383,"title":"最大的团队表现值","title_slug":"maximum-performance-of-a-team","rating":2091.3820373571,"_hash":1997987860,"paid_only":false,"cont_title":"第 180 场周赛","cont_title_slug":"weekly-contest-180"},{"question_id":2751,"title":"机器人碰撞","title_slug":"robot-collisions","rating":2091.6474629767,"_hash":435938591,"paid_only":false,"cont_title":"第 351 场周赛","cont_title_slug":"weekly-contest-351"},{"question_id":2842,"title":"统计一个字符串的 k 子序列美丽值最大的数目","title_slug":"count-k-subsequences-of-a-string-with-maximum-beauty","rating":2091.6580433632,"_hash":1559330514,"paid_only":false,"cont_title":"第 112 场双周赛","cont_title_slug":"biweekly-contest-112"},{"question_id":2412,"title":"完成所有交易的初始最少钱数","title_slug":"minimum-money-required-before-transactions","rating":2092.0222850837,"_hash":2719065978,"paid_only":false,"cont_title":"第 87 场双周赛","cont_title_slug":"biweekly-contest-87"},{"question_id":1049,"title":"最后一块石头的重量 II","title_slug":"last-stone-weight-ii","rating":2092.4861692502,"_hash":305762053,"paid_only":false,"cont_title":"第 137 场周赛","cont_title_slug":"weekly-contest-137"},{"question_id":2444,"title":"统计定界子数组的数目","title_slug":"count-subarrays-with-fixed-bounds","rating":2092.5366031561,"_hash":3820908739,"paid_only":false,"cont_title":"第 315 场周赛","cont_title_slug":"weekly-contest-315"},{"question_id":2402,"title":"会议室 III","title_slug":"meeting-rooms-iii","rating":2092.8943149547,"_hash":910590803,"paid_only":false,"cont_title":"第 309 场周赛","cont_title_slug":"weekly-contest-309"},{"question_id":1976,"title":"到达目的地的方案数","title_slug":"number-of-ways-to-arrive-at-destination","rating":2094.592426537,"_hash":3020603346,"paid_only":false,"cont_title":"第 59 场双周赛","cont_title_slug":"biweekly-contest-59"},{"question_id":899,"title":"有序队列","title_slug":"orderly-queue","rating":2096.6098086765,"_hash":1912276022,"paid_only":false,"cont_title":"第 100 场周赛","cont_title_slug":"weekly-contest-100"},{"question_id":2430,"title":"对字母串可执行的最大删除数","title_slug":"maximum-deletions-on-a-string","rating":2101.867342004,"_hash":670519393,"paid_only":false,"cont_title":"第 313 场周赛","cont_title_slug":"weekly-contest-313"},{"question_id":2088,"title":"统计农场中肥沃金字塔的数目","title_slug":"count-fertile-pyramids-in-a-land","rating":2104.7441214305,"_hash":2070962878,"paid_only":false,"cont_title":"第 66 场双周赛","cont_title_slug":"biweekly-contest-66"},{"question_id":1944,"title":"队列中可以看到的人数","title_slug":"number-of-visible-people-in-a-queue","rating":2104.9526046945,"_hash":3935523633,"paid_only":false,"cont_title":"第 57 场双周赛","cont_title_slug":"biweekly-contest-57"},{"question_id":1937,"title":"扣分后的最大得分","title_slug":"maximum-number-of-points-with-cost","rating":2105.7761215397,"_hash":1687003236,"paid_only":false,"cont_title":"第 250 场周赛","cont_title_slug":"weekly-contest-250"},{"question_id":2209,"title":"用地毯覆盖后的最少白色砖块","title_slug":"minimum-white-tiles-after-covering-with-carpets","rating":2105.8582288624,"_hash":3822669184,"paid_only":false,"cont_title":"第 74 场双周赛","cont_title_slug":"biweekly-contest-74"},{"question_id":1172,"title":"餐盘栈","title_slug":"dinner-plate-stacks","rating":2109.9830154953,"_hash":3376945874,"paid_only":false,"cont_title":"第 151 场周赛","cont_title_slug":"weekly-contest-151"},{"question_id":1483,"title":"树节点的第 K 个祖先","title_slug":"kth-ancestor-of-a-tree-node","rating":2115.0911494487,"_hash":2000679742,"paid_only":false,"cont_title":"第 193 场周赛","cont_title_slug":"weekly-contest-193"},{"question_id":2967,"title":"使数组成为等数数组的最小代价","title_slug":"minimum-cost-to-make-array-equalindromic","rating":2116.3244842355,"_hash":3256507952,"paid_only":false,"cont_title":"第 376 场周赛","cont_title_slug":"weekly-contest-376"},{"question_id":1547,"title":"切棍子的最小成本","title_slug":"minimum-cost-to-cut-a-stick","rating":2116.493528295,"_hash":688063365,"paid_only":false,"cont_title":"第 201 场周赛","cont_title_slug":"weekly-contest-201"},{"question_id":1601,"title":"最多可达成的换楼请求数目","title_slug":"maximum-number-of-achievable-transfer-requests","rating":2118.7923652824,"_hash":2896936333,"paid_only":false,"cont_title":"第 208 场周赛","cont_title_slug":"weekly-contest-208"},{"question_id":2376,"title":"统计特殊整数","title_slug":"count-special-integers","rating":2120.4466386371,"_hash":4197747162,"paid_only":false,"cont_title":"第 306 场周赛","cont_title_slug":"weekly-contest-306"},{"question_id":972,"title":"相等的有理数","title_slug":"equal-rational-numbers","rating":2121.3147151648,"_hash":3639230179,"paid_only":false,"cont_title":"第 118 场周赛","cont_title_slug":"weekly-contest-118"},{"question_id":1970,"title":"你能穿过矩阵的最后一天","title_slug":"last-day-where-you-can-still-cross","rating":2123.5708982185,"_hash":821525251,"paid_only":false,"cont_title":"第 254 场周赛","cont_title_slug":"weekly-contest-254"},{"question_id":1654,"title":"到家的最少跳跃次数","title_slug":"minimum-jumps-to-reach-home","rating":2124.0317207867,"_hash":2681795867,"paid_only":false,"cont_title":"第 39 场双周赛","cont_title_slug":"biweekly-contest-39"},{"question_id":968,"title":"监控二叉树","title_slug":"binary-tree-cameras","rating":2124.1329592058,"_hash":1589710386,"paid_only":false,"cont_title":"第 117 场周赛","cont_title_slug":"weekly-contest-117"},{"question_id":1955,"title":"统计特殊子序列的数目","title_slug":"count-number-of-special-subsequences","rating":2125.3125624762,"_hash":655929637,"paid_only":false,"cont_title":"第 252 场周赛","cont_title_slug":"weekly-contest-252"},{"question_id":2746,"title":"字符串连接删减字母","title_slug":"decremental-string-concatenation","rating":2126.1931814161,"_hash":298215454,"paid_only":false,"cont_title":"第 107 场双周赛","cont_title_slug":"biweekly-contest-107"},{"question_id":2246,"title":"相邻字符不同的最长路径","title_slug":"longest-path-with-different-adjacent-characters","rating":2126.3922279277,"_hash":1523645158,"paid_only":false,"cont_title":"第 289 场周赛","cont_title_slug":"weekly-contest-289"},{"question_id":1444,"title":"切披萨的方案数","title_slug":"number-of-ways-of-cutting-a-pizza","rating":2126.6864346508,"_hash":1744896373,"paid_only":false,"cont_title":"第 188 场周赛","cont_title_slug":"weekly-contest-188"},{"question_id":2939,"title":"最大异或乘积","title_slug":"maximum-xor-product","rating":2127.5100545681,"_hash":173367747,"paid_only":false,"cont_title":"第 372 场周赛","cont_title_slug":"weekly-contest-372"},{"question_id":1039,"title":"多边形三角剖分的最低得分","title_slug":"minimum-score-triangulation-of-polygon","rating":2130.1135718486,"_hash":491083091,"paid_only":false,"cont_title":"第 135 场周赛","cont_title_slug":"weekly-contest-135"},{"question_id":2076,"title":"处理含限制条件的好友请求","title_slug":"process-restricted-friend-requests","rating":2130.9348604091,"_hash":10205408,"paid_only":false,"cont_title":"第 267 场周赛","cont_title_slug":"weekly-contest-267"},{"question_id":1579,"title":"保证图可完全遍历","title_slug":"remove-max-number-of-edges-to-keep-graph-fully-traversable","rating":2131.7917160422,"_hash":3698564207,"paid_only":false,"cont_title":"第 205 场周赛","cont_title_slug":"weekly-contest-205"},{"question_id":2749,"title":"得到整数零需要执行的最少操作数","title_slug":"minimum-operations-to-make-the-integer-zero","rating":2132.06233459,"_hash":2077283915,"paid_only":false,"cont_title":"第 351 场周赛","cont_title_slug":"weekly-contest-351"},{"question_id":2910,"title":"合法分组的最少组数","title_slug":"minimum-number-of-groups-to-create-a-valid-assignment","rating":2132.1944636902,"_hash":1620549524,"paid_only":false,"cont_title":"第 368 场周赛","cont_title_slug":"weekly-contest-368"},{"question_id":898,"title":"子数组按位或操作","title_slug":"bitwise-ors-of-subarrays","rating":2133.1003195919,"_hash":1959774558,"paid_only":false,"cont_title":"第 100 场周赛","cont_title_slug":"weekly-contest-100"},{"question_id":1439,"title":"有序矩阵中的第 k 个最小数组和","title_slug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows","rating":2133.9592509012,"_hash":2634383093,"paid_only":false,"cont_title":"第 187 场周赛","cont_title_slug":"weekly-contest-187"},{"question_id":910,"title":"最小差值 II","title_slug":"smallest-range-ii","rating":2134.5448970405,"_hash":1737160601,"paid_only":false,"cont_title":"第 103 场周赛","cont_title_slug":"weekly-contest-103"},{"question_id":959,"title":"由斜杠划分区域","title_slug":"regions-cut-by-slashes","rating":2135.5738659086,"_hash":244758471,"paid_only":false,"cont_title":"第 115 场周赛","cont_title_slug":"weekly-contest-115"},{"question_id":2382,"title":"删除操作后的最大子段和","title_slug":"maximum-segment-sum-after-removals","rating":2136.3013259524,"_hash":746573214,"paid_only":false,"cont_title":"第 85 场双周赛","cont_title_slug":"biweekly-contest-85"},{"question_id":2290,"title":"到达角落需要移除障碍物的最小数目","title_slug":"minimum-obstacle-removal-to-reach-corner","rating":2137.5633267453,"_hash":4050014828,"paid_only":false,"cont_title":"第 295 场周赛","cont_title_slug":"weekly-contest-295"},{"question_id":906,"title":"超级回文数","title_slug":"super-palindromes","rating":2140.0220703954,"_hash":159231277,"paid_only":false,"cont_title":"第 102 场周赛","cont_title_slug":"weekly-contest-102"},{"question_id":1879,"title":"两个数组最小的异或值之和","title_slug":"minimum-xor-sum-of-two-arrays","rating":2145.183995267,"_hash":3201195359,"paid_only":false,"cont_title":"第 53 场双周赛","cont_title_slug":"biweekly-contest-53"},{"question_id":1906,"title":"查询差绝对值的最小值","title_slug":"minimum-absolute-difference-queries","rating":2146.639581998,"_hash":1980479000,"paid_only":false,"cont_title":"第 246 场周赛","cont_title_slug":"weekly-contest-246"},{"question_id":1610,"title":"可见点的最大数目","title_slug":"maximum-number-of-visible-points","rating":2147.1828941776,"_hash":2493499746,"paid_only":false,"cont_title":"第 209 场周赛","cont_title_slug":"weekly-contest-209"},{"question_id":2972,"title":"统计移除递增子数组的数目 II","title_slug":"count-the-number-of-incremovable-subarrays-ii","rating":2152.8032001597,"_hash":2400947874,"paid_only":false,"cont_title":"第 120 场双周赛","cont_title_slug":"biweekly-contest-120"},{"question_id":2812,"title":"找出最安全路径","title_slug":"find-the-safest-path-in-a-grid","rating":2153.5854429139,"_hash":999091554,"paid_only":false,"cont_title":"第 357 场周赛","cont_title_slug":"weekly-contest-357"},{"question_id":2662,"title":"前往目标的最小代价","title_slug":"minimum-cost-of-a-path-with-special-roads","rating":2153.8943791656,"_hash":1243440018,"paid_only":false,"cont_title":"第 343 场周赛","cont_title_slug":"weekly-contest-343"},{"question_id":2616,"title":"最小化数对的最大差值","title_slug":"minimize-the-maximum-difference-of-pairs","rating":2155.3424932408,"_hash":3806017410,"paid_only":false,"cont_title":"第 340 场周赛","cont_title_slug":"weekly-contest-340"},{"question_id":1515,"title":"服务中心的最佳位置","title_slug":"best-position-for-a-service-centre","rating":2156.9515428364,"_hash":4201921653,"paid_only":false,"cont_title":"第 197 场周赛","cont_title_slug":"weekly-contest-197"},{"question_id":2218,"title":"从栈中取出 K 个硬币的最大面值和","title_slug":"maximum-value-of-k-coins-from-piles","rating":2157.5814371481,"_hash":28373825,"paid_only":false,"cont_title":"第 286 场周赛","cont_title_slug":"weekly-contest-286"},{"question_id":2102,"title":"序列顺序查询","title_slug":"sequentially-ordinal-rank-tracker","rating":2158.7683843245,"_hash":2117244239,"paid_only":false,"cont_title":"第 67 场双周赛","cont_title_slug":"biweekly-contest-67"},{"question_id":2122,"title":"还原原数组","title_slug":"recover-the-original-array","rating":2158.8988728254,"_hash":3102719435,"paid_only":false,"cont_title":"第 273 场周赛","cont_title_slug":"weekly-contest-273"},{"question_id":2584,"title":"分割数组使乘积互质","title_slug":"split-the-array-to-make-coprime-products","rating":2159.4844281244,"_hash":1405611181,"paid_only":false,"cont_title":"第 335 场周赛","cont_title_slug":"weekly-contest-335"},{"question_id":1036,"title":"逃离大迷宫","title_slug":"escape-a-large-maze","rating":2164.8287157213,"_hash":2632738906,"paid_only":false,"cont_title":"第 134 场周赛","cont_title_slug":"weekly-contest-134"},{"question_id":1931,"title":"用三种不同颜色为网格涂色","title_slug":"painting-a-grid-with-three-different-colors","rating":2170.0439693714,"_hash":4290496515,"paid_only":false,"cont_title":"第 249 场周赛","cont_title_slug":"weekly-contest-249"},{"question_id":1862,"title":"向下取整数对和","title_slug":"sum-of-floored-pairs","rating":2170.1079846744,"_hash":2862855056,"paid_only":false,"cont_title":"第 52 场双周赛","cont_title_slug":"biweekly-contest-52"},{"question_id":1691,"title":"堆叠长方体的最大高度","title_slug":"maximum-height-by-stacking-cuboids","rating":2171.716066664,"_hash":1210455736,"paid_only":false,"cont_title":"第 219 场周赛","cont_title_slug":"weekly-contest-219"},{"question_id":2709,"title":"最大公约数遍历","title_slug":"greatest-common-divisor-traversal","rating":2171.9645269732,"_hash":1482300808,"paid_only":false,"cont_title":"第 105 场双周赛","cont_title_slug":"biweekly-contest-105"},{"question_id":2896,"title":"执行操作使两个字符串相等","title_slug":"apply-operations-to-make-two-strings-equal","rating":2172.3890687963,"_hash":1915472102,"paid_only":false,"cont_title":"第 366 场周赛","cont_title_slug":"weekly-contest-366"},{"question_id":2454,"title":"下一个更大元素 IV","title_slug":"next-greater-element-iv","rating":2175.1190473433,"_hash":2368071046,"paid_only":false,"cont_title":"第 90 场双周赛","cont_title_slug":"biweekly-contest-90"},{"question_id":1420,"title":"生成数组","title_slug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons","rating":2175.6850426027,"_hash":4023565195,"paid_only":false,"cont_title":"第 185 场周赛","cont_title_slug":"weekly-contest-185"},{"question_id":2768,"title":"黑格子的数目","title_slug":"number-of-black-blocks","rating":2175.7874705227,"_hash":3375593429,"paid_only":false,"cont_title":"第 108 场双周赛","cont_title_slug":"biweekly-contest-108"},{"question_id":2065,"title":"最大化一张图中的路径价值","title_slug":"maximum-path-quality-of-a-graph","rating":2178.4249114144,"_hash":2027773900,"paid_only":false,"cont_title":"第 266 场周赛","cont_title_slug":"weekly-contest-266"},{"question_id":1912,"title":"设计电影租借系统","title_slug":"design-movie-rental-system","rating":2181.7821188042,"_hash":1272023779,"paid_only":false,"cont_title":"第 55 场双周赛","cont_title_slug":"biweekly-contest-55"},{"question_id":1771,"title":"由子序列构造的最长回文串的长度","title_slug":"maximize-palindrome-length-from-subsequences","rating":2182.054452981,"_hash":653475446,"paid_only":false,"cont_title":"第 229 场周赛","cont_title_slug":"weekly-contest-229"},{"question_id":891,"title":"子序列宽度之和","title_slug":"sum-of-subsequence-widths","rating":2182.6180030785,"_hash":1150623470,"paid_only":false,"cont_title":"第 98 场周赛","cont_title_slug":"weekly-contest-98"},{"question_id":1081,"title":"不同字符的最小子序列","title_slug":"smallest-subsequence-of-distinct-characters","rating":2184.5241011615,"_hash":2695383302,"paid_only":false,"cont_title":"第 140 场周赛","cont_title_slug":"weekly-contest-140"},{"question_id":943,"title":"最短超级串","title_slug":"find-the-shortest-superstring","rating":2185.5444704515,"_hash":1762990534,"paid_only":false,"cont_title":"第 111 场周赛","cont_title_slug":"weekly-contest-111"},{"question_id":1074,"title":"元素和为目标值的子矩阵数量","title_slug":"number-of-submatrices-that-sum-to-target","rating":2189.3802630548,"_hash":1802692575,"paid_only":false,"cont_title":"第 139 场周赛","cont_title_slug":"weekly-contest-139"},{"question_id":1478,"title":"安排邮筒","title_slug":"allocate-mailboxes","rating":2190.1757477854,"_hash":2258623827,"paid_only":false,"cont_title":"第 28 场双周赛","cont_title_slug":"biweekly-contest-28"},{"question_id":2503,"title":"矩阵查询可获得的最大分数","title_slug":"maximum-number-of-points-from-grid-queries","rating":2195.6540241654,"_hash":4062961912,"paid_only":false,"cont_title":"第 323 场周赛","cont_title_slug":"weekly-contest-323"},{"question_id":834,"title":"树中距离之和","title_slug":"sum-of-distances-in-tree","rating":2197.0951445919,"_hash":3424505272,"paid_only":false,"cont_title":"第 84 场周赛","cont_title_slug":"weekly-contest-84"},{"question_id":1621,"title":"大小为 K 的不重叠线段的数目","title_slug":"number-of-sets-of-k-non-overlapping-line-segments","rating":2198.3290662783,"_hash":3081794904,"paid_only":false,"cont_title":"第 37 场双周赛","cont_title_slug":"biweekly-contest-37"},{"question_id":1739,"title":"放置盒子","title_slug":"building-boxes","rating":2198.4642973466,"_hash":3570284045,"paid_only":false,"cont_title":"第 225 场周赛","cont_title_slug":"weekly-contest-225"},{"question_id":847,"title":"访问所有节点的最短路径","title_slug":"shortest-path-visiting-all-nodes","rating":2200.6623666057,"_hash":3527222391,"paid_only":false,"cont_title":"第 87 场周赛","cont_title_slug":"weekly-contest-87"},{"question_id":2045,"title":"到达目的地的第二短时间","title_slug":"second-minimum-time-to-reach-destination","rating":2201.6219336792,"_hash":1896286191,"paid_only":false,"cont_title":"第 263 场周赛","cont_title_slug":"weekly-contest-263"},{"question_id":1453,"title":"圆形靶内的最大飞镖数量","title_slug":"maximum-number-of-darts-inside-of-a-circular-dartboard","rating":2201.8209584221,"_hash":1442274557,"paid_only":false,"cont_title":"第 189 场周赛","cont_title_slug":"weekly-contest-189"},{"question_id":1246,"title":"删除回文子数组","title_slug":"palindrome-removal","rating":2203.1738850937,"_hash":960405407,"paid_only":false,"cont_title":"第 12 场双周赛","cont_title_slug":"biweekly-contest-12"},{"question_id":2781,"title":"最长合法子字符串的长度","title_slug":"length-of-the-longest-valid-substring","rating":2203.5694828019,"_hash":2265344721,"paid_only":false,"cont_title":"第 354 场周赛","cont_title_slug":"weekly-contest-354"},{"question_id":879,"title":"盈利计划","title_slug":"profitable-schemes","rating":2204.3524370174,"_hash":3884874766,"paid_only":false,"cont_title":"第 95 场周赛","cont_title_slug":"weekly-contest-95"},{"question_id":1157,"title":"子数组中占绝大多数的元素","title_slug":"online-majority-element-in-subarray","rating":2205.4304373587,"_hash":4053796951,"paid_only":false,"cont_title":"第 149 场周赛","cont_title_slug":"weekly-contest-149"},{"question_id":2835,"title":"使子序列的和等于目标的最少操作次数","title_slug":"minimum-operations-to-form-subsequence-with-target-sum","rating":2207.4917475411,"_hash":94359620,"paid_only":false,"cont_title":"第 360 场周赛","cont_title_slug":"weekly-contest-360"},{"question_id":1649,"title":"通过指令创建有序数组","title_slug":"create-sorted-array-through-instructions","rating":2207.8565809952,"_hash":552299541,"paid_only":false,"cont_title":"第 214 场周赛","cont_title_slug":"weekly-contest-214"},{"question_id":1568,"title":"使陆地分离的最少天数","title_slug":"minimum-number-of-days-to-disconnect-island","rating":2208.5532172086,"_hash":187940940,"paid_only":false,"cont_title":"第 204 场周赛","cont_title_slug":"weekly-contest-204"},{"question_id":2876,"title":"有向图访问计数","title_slug":"count-visited-nodes-in-a-directed-graph","rating":2209.8785430371,"_hash":385203255,"paid_only":false,"cont_title":"第 365 场周赛","cont_title_slug":"weekly-contest-365"},{"question_id":2081,"title":"k 镜像数字的和","title_slug":"sum-of-k-mirror-numbers","rating":2209.8815936961,"_hash":3707233513,"paid_only":false,"cont_title":"第 268 场周赛","cont_title_slug":"weekly-contest-268"},{"question_id":992,"title":"K 个不同整数的子数组","title_slug":"subarrays-with-k-different-integers","rating":2210.3503183571,"_hash":3123575090,"paid_only":false,"cont_title":"第 123 场周赛","cont_title_slug":"weekly-contest-123"},{"question_id":1889,"title":"装包裹的最小浪费空间","title_slug":"minimum-space-wasted-from-packaging","rating":2214.4798747386,"_hash":988335694,"paid_only":false,"cont_title":"第 244 场周赛","cont_title_slug":"weekly-contest-244"},{"question_id":2025,"title":"分割数组的最多方案数","title_slug":"maximum-number-of-ways-to-partition-an-array","rating":2217.8090802563,"_hash":2513347763,"paid_only":false,"cont_title":"第 62 场双周赛","cont_title_slug":"biweekly-contest-62"},{"question_id":2167,"title":"移除所有载有违禁货物车厢所需的最少时间","title_slug":"minimum-time-to-remove-all-cars-containing-illegal-goods","rating":2219.3465296423,"_hash":2598780139,"paid_only":false,"cont_title":"第 279 场周赛","cont_title_slug":"weekly-contest-279"},{"question_id":2223,"title":"构造字符串的总得分和","title_slug":"sum-of-scores-of-built-strings","rating":2220.0903365738,"_hash":2248507270,"paid_only":false,"cont_title":"第 75 场双周赛","cont_title_slug":"biweekly-contest-75"},{"question_id":2543,"title":"判断一个点是否可以到达","title_slug":"check-if-point-is-reachable","rating":2220.8257124139,"_hash":3766200583,"paid_only":false,"cont_title":"第 96 场双周赛","cont_title_slug":"biweekly-contest-96"},{"question_id":1627,"title":"带阈值的图连通性","title_slug":"graph-connectivity-with-threshold","rating":2221.3538766773,"_hash":3632361978,"paid_only":false,"cont_title":"第 211 场周赛","cont_title_slug":"weekly-contest-211"},{"question_id":1542,"title":"找出最长的超赞子字符串","title_slug":"find-longest-awesome-substring","rating":2221.7336557442,"_hash":2877331205,"paid_only":false,"cont_title":"第 32 场双周赛","cont_title_slug":"biweekly-contest-32"},{"question_id":2561,"title":"重排水果","title_slug":"rearranging-fruits","rating":2221.793185714,"_hash":3549688121,"paid_only":false,"cont_title":"第 331 场周赛","cont_title_slug":"weekly-contest-331"},{"question_id":2276,"title":"统计区间中的整数数目","title_slug":"count-integers-in-intervals","rating":2222.4805422748,"_hash":113811987,"paid_only":false,"cont_title":"第 293 场周赛","cont_title_slug":"weekly-contest-293"},{"question_id":2484,"title":"统计回文子序列数目","title_slug":"count-palindromic-subsequences","rating":2223.1762282199,"_hash":924129852,"paid_only":false,"cont_title":"第 92 场双周赛","cont_title_slug":"biweekly-contest-92"},{"question_id":2163,"title":"删除元素后和的最小差值","title_slug":"minimum-difference-in-sums-after-removal-of-elements","rating":2225.3877535768,"_hash":2967621636,"paid_only":false,"cont_title":"第 71 场双周赛","cont_title_slug":"biweekly-contest-71"},{"question_id":2930,"title":"重新排列后包含指定子字符串的字符串数目","title_slug":"number-of-strings-which-can-be-rearranged-to-contain-substring","rating":2227.3896051956,"_hash":3536253643,"paid_only":false,"cont_title":"第 117 场双周赛","cont_title_slug":"biweekly-contest-117"},{"question_id":2581,"title":"统计可能的树根数目","title_slug":"count-number-of-possible-root-nodes","rating":2228.3454693625,"_hash":3735555259,"paid_only":false,"cont_title":"第 99 场双周赛","cont_title_slug":"biweekly-contest-99"},{"question_id":1012,"title":"至少有 1 位重复的数字","title_slug":"numbers-with-repeated-digits","rating":2230.1673059455,"_hash":3469926498,"paid_only":false,"cont_title":"第 128 场周赛","cont_title_slug":"weekly-contest-128"},{"question_id":1766,"title":"互质树","title_slug":"tree-of-coprimes","rating":2231.8099102949,"_hash":2806136994,"paid_only":false,"cont_title":"第 46 场双周赛","cont_title_slug":"biweekly-contest-46"},{"question_id":1178,"title":"猜字谜","title_slug":"number-of-valid-words-for-each-puzzle","rating":2233.963903408,"_hash":2530621646,"paid_only":false,"cont_title":"第 152 场周赛","cont_title_slug":"weekly-contest-152"},{"question_id":1915,"title":"最美子字符串的数目","title_slug":"number-of-wonderful-substrings","rating":2234.9191877602,"_hash":3315472808,"paid_only":false,"cont_title":"第 247 场周赛","cont_title_slug":"weekly-contest-247"},{"question_id":2528,"title":"最大化城市的最小电量","title_slug":"maximize-the-minimum-powered-city","rating":2235.5784618885,"_hash":530846359,"paid_only":false,"cont_title":"第 95 场双周赛","cont_title_slug":"biweekly-contest-95"},{"question_id":850,"title":"矩形面积 II","title_slug":"rectangle-area-ii","rating":2235.9672341699,"_hash":512758649,"paid_only":false,"cont_title":"第 88 场周赛","cont_title_slug":"weekly-contest-88"},{"question_id":2646,"title":"最小化旅行的价格总和","title_slug":"minimize-the-total-price-of-the-trips","rating":2238.2830745228,"_hash":1058966145,"paid_only":false,"cont_title":"第 341 场周赛","cont_title_slug":"weekly-contest-341"},{"question_id":2732,"title":"找到矩阵中的好子集","title_slug":"find-a-good-subset-of-the-matrix","rating":2239.7101856677,"_hash":96440277,"paid_only":false,"cont_title":"第 106 场双周赛","cont_title_slug":"biweekly-contest-106"},{"question_id":1240,"title":"铺瓷砖","title_slug":"tiling-a-rectangle-with-the-fewest-squares","rating":2241.5199974312,"_hash":2526467539,"paid_only":false,"cont_title":"第 160 场周赛","cont_title_slug":"weekly-contest-160"},{"question_id":2183,"title":"统计可以被 K 整除的下标对数目","title_slug":"count-array-pairs-divisible-by-k","rating":2246.0452639352,"_hash":1351132676,"paid_only":false,"cont_title":"第 281 场周赛","cont_title_slug":"weekly-contest-281"},{"question_id":960,"title":"删列造序 III","title_slug":"delete-columns-to-make-sorted-iii","rating":2246.8671174565,"_hash":3194493363,"paid_only":false,"cont_title":"第 115 场周赛","cont_title_slug":"weekly-contest-115"},{"question_id":1307,"title":"口算难题","title_slug":"verbal-arithmetic-puzzle","rating":2250.0454791316,"_hash":9793507,"paid_only":false,"cont_title":"第 169 场周赛","cont_title_slug":"weekly-contest-169"},{"question_id":1199,"title":"建造街区的最短时间","title_slug":"minimum-time-to-build-blocks","rating":2250.2578740769,"_hash":212930587,"paid_only":false,"cont_title":"第 9 场双周赛","cont_title_slug":"biweekly-contest-9"},{"question_id":1125,"title":"最小的必要团队","title_slug":"smallest-sufficient-team","rating":2250.9318291559,"_hash":537590451,"paid_only":false,"cont_title":"第 145 场周赛","cont_title_slug":"weekly-contest-145"},{"question_id":3007,"title":"价值和小于等于 K 的最大数字","title_slug":"maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k","rating":2258.0069047781,"_hash":1708402068,"paid_only":false,"cont_title":"第 380 场周赛","cont_title_slug":"weekly-contest-380"},{"question_id":864,"title":"获取所有钥匙的最短路径","title_slug":"shortest-path-to-get-all-keys","rating":2258.6371797452,"_hash":3615735813,"paid_only":false,"cont_title":"第 92 场周赛","cont_title_slug":"weekly-contest-92"},{"question_id":857,"title":"雇佣 K 名工人的最低成本","title_slug":"minimum-cost-to-hire-k-workers","rating":2259.6572191969,"_hash":718375766,"paid_only":false,"cont_title":"第 90 场周赛","cont_title_slug":"weekly-contest-90"},{"question_id":1997,"title":"访问完所有房间的第一天","title_slug":"first-day-where-you-have-been-in-all-the-rooms","rating":2260.2799775623,"_hash":3953077425,"paid_only":false,"cont_title":"第 257 场周赛","cont_title_slug":"weekly-contest-257"},{"question_id":2141,"title":"同时运行 N 台电脑的最长时间","title_slug":"maximum-running-time-of-n-computers","rating":2265.2118886972,"_hash":364057867,"paid_only":false,"cont_title":"第 276 场周赛","cont_title_slug":"weekly-contest-276"},{"question_id":952,"title":"按公因数计算最大组件大小","title_slug":"largest-component-size-by-common-factor","rating":2272.1122260637,"_hash":1950962783,"paid_only":false,"cont_title":"第 113 场周赛","cont_title_slug":"weekly-contest-113"},{"question_id":2179,"title":"统计数组中好三元组数目","title_slug":"count-good-triplets-in-an-array","rating":2272.4412003208,"_hash":286585708,"paid_only":false,"cont_title":"第 72 场双周赛","cont_title_slug":"biweekly-contest-72"},{"question_id":1434,"title":"每个人戴不同帽子的方案数","title_slug":"number-of-ways-to-wear-different-hats-to-each-other","rating":2273.2215764545,"_hash":860689371,"paid_only":false,"cont_title":"第 25 场双周赛","cont_title_slug":"biweekly-contest-25"},{"question_id":1606,"title":"找到处理最多请求的服务器","title_slug":"find-servers-that-handled-most-number-of-requests","rating":2275.7337818748,"_hash":3246928465,"paid_only":false,"cont_title":"第 36 场双周赛","cont_title_slug":"biweekly-contest-36"},{"question_id":1498,"title":"满足条件的子序列数目","title_slug":"number-of-subsequences-that-satisfy-the-given-sum-condition","rating":2276.4233585631,"_hash":2057048497,"paid_only":false,"cont_title":"第 195 场周赛","cont_title_slug":"weekly-contest-195"},{"question_id":2973,"title":"树中每个节点放置的金币数目","title_slug":"find-number-of-coins-to-place-in-tree-nodes","rating":2276.9256951751,"_hash":3730047096,"paid_only":false,"cont_title":"第 120 场双周赛","cont_title_slug":"biweekly-contest-120"},{"question_id":2029,"title":"石子游戏 IX","title_slug":"stone-game-ix","rating":2277.3595662538,"_hash":2371431943,"paid_only":false,"cont_title":"第 261 场周赛","cont_title_slug":"weekly-contest-261"},{"question_id":2763,"title":"所有子数组中不平衡数字之和","title_slug":"sum-of-imbalance-numbers-of-all-subarrays","rating":2277.7923804151,"_hash":228551495,"paid_only":false,"cont_title":"第 352 场周赛","cont_title_slug":"weekly-contest-352"},{"question_id":3031,"title":"将单词恢复初始状态所需的最短时间 II","title_slug":"minimum-time-to-revert-word-to-initial-state-ii","rating":2277.9557248587,"_hash":839548071,"paid_only":false,"cont_title":"第 383 场周赛","cont_title_slug":"weekly-contest-383"},{"question_id":2407,"title":"最长递增子序列 II","title_slug":"longest-increasing-subsequence-ii","rating":2280.3143643878,"_hash":1567110694,"paid_only":false,"cont_title":"第 310 场周赛","cont_title_slug":"weekly-contest-310"},{"question_id":2659,"title":"将数组清空","title_slug":"make-array-empty","rating":2281.8816902545,"_hash":2062472427,"paid_only":false,"cont_title":"第 103 场双周赛","cont_title_slug":"biweekly-contest-103"},{"question_id":1723,"title":"完成所有工作的最短时间","title_slug":"find-minimum-time-to-finish-all-jobs","rating":2284.4463940346,"_hash":3104122930,"paid_only":false,"cont_title":"第 223 场周赛","cont_title_slug":"weekly-contest-223"},{"question_id":1851,"title":"包含每个查询的最小区间","title_slug":"minimum-interval-to-include-each-query","rating":2286.1378742318,"_hash":3250523305,"paid_only":false,"cont_title":"第 239 场周赛","cont_title_slug":"weekly-contest-239"},{"question_id":1569,"title":"将子数组重新排序得到同一个二叉搜索树的方案数","title_slug":"number-of-ways-to-reorder-array-to-get-same-bst","rating":2288.2117442123,"_hash":1392708979,"paid_only":false,"cont_title":"第 204 场周赛","cont_title_slug":"weekly-contest-204"},{"question_id":1591,"title":"奇怪的打印机 II","title_slug":"strange-printer-ii","rating":2290.9040038639,"_hash":1646187623,"paid_only":false,"cont_title":"第 35 场双周赛","cont_title_slug":"biweekly-contest-35"},{"question_id":2862,"title":"完全子集的最大元素和","title_slug":"maximum-element-sum-of-a-complete-subset-of-indices","rating":2291.6794536377,"_hash":1459395051,"paid_only":false,"cont_title":"第 363 场周赛","cont_title_slug":"weekly-contest-363"},{"question_id":932,"title":"漂亮数组","title_slug":"beautiful-array","rating":2294.0981174197,"_hash":3554305488,"paid_only":false,"cont_title":"第 108 场周赛","cont_title_slug":"weekly-contest-108"},{"question_id":2858,"title":"可以到达每一个节点的最少边反转次数","title_slug":"minimum-edge-reversals-so-every-node-is-reachable","rating":2294.8289305714,"_hash":2851269000,"paid_only":false,"cont_title":"第 113 场双周赛","cont_title_slug":"biweekly-contest-113"},{"question_id":1263,"title":"推箱子","title_slug":"minimum-moves-to-move-a-box-to-their-target-location","rating":2297.105362516,"_hash":3949953471,"paid_only":false,"cont_title":"第 163 场周赛","cont_title_slug":"weekly-contest-163"},{"question_id":2458,"title":"移除子树后的二叉树高度","title_slug":"height-of-binary-tree-after-subtree-removal-queries","rating":2298.6242048519,"_hash":4116532905,"paid_only":false,"cont_title":"第 317 场周赛","cont_title_slug":"weekly-contest-317"},{"question_id":1697,"title":"检查边长度限制的路径是否存在","title_slug":"checking-existence-of-edge-length-limited-paths","rating":2300.1557840589,"_hash":3837200173,"paid_only":false,"cont_title":"第 220 场周赛","cont_title_slug":"weekly-contest-220"},{"question_id":2897,"title":"对数组执行操作使平方和最大","title_slug":"apply-operations-on-array-to-maximize-sum-of-squares","rating":2301.4069974024,"_hash":1644032538,"paid_only":false,"cont_title":"第 366 场周赛","cont_title_slug":"weekly-contest-366"},{"question_id":2513,"title":"最小化两个数组中的最大值","title_slug":"minimize-the-maximum-of-two-arrays","rating":2302.4005640818,"_hash":1712826586,"paid_only":false,"cont_title":"第 94 场双周赛","cont_title_slug":"biweekly-contest-94"},{"question_id":2242,"title":"节点序列的最大得分","title_slug":"maximum-score-of-a-node-sequence","rating":2304.3094138939,"_hash":949381873,"paid_only":false,"cont_title":"第 76 场双周赛","cont_title_slug":"biweekly-contest-76"},{"question_id":2306,"title":"公司命名","title_slug":"naming-a-company","rating":2305.4498281454,"_hash":3802076349,"paid_only":false,"cont_title":"第 297 场周赛","cont_title_slug":"weekly-contest-297"},{"question_id":862,"title":"和至少为 K 的最短子数组","title_slug":"shortest-subarray-with-sum-at-least-k","rating":2306.8472649456,"_hash":3460806368,"paid_only":false,"cont_title":"第 91 场周赛","cont_title_slug":"weekly-contest-91"},{"question_id":1655,"title":"分配重复整数","title_slug":"distribute-repeating-integers","rating":2307.0161713185,"_hash":145069778,"paid_only":false,"cont_title":"第 39 场双周赛","cont_title_slug":"biweekly-contest-39"},{"question_id":1617,"title":"统计子树中城市之间最大距离","title_slug":"count-subtrees-with-max-distance-between-cities","rating":2308.6545905335,"_hash":540821611,"paid_only":false,"cont_title":"第 210 场周赛","cont_title_slug":"weekly-contest-210"},{"question_id":1959,"title":"K 次调整数组大小浪费的最小总空间","title_slug":"minimum-total-space-wasted-with-k-resizing-operations","rating":2310.3824631335,"_hash":1714015866,"paid_only":false,"cont_title":"第 58 场双周赛","cont_title_slug":"biweekly-contest-58"},{"question_id":1857,"title":"有向图中最大颜色值","title_slug":"largest-color-value-in-a-directed-graph","rating":2312.9919953644,"_hash":1775341601,"paid_only":false,"cont_title":"第 240 场周赛","cont_title_slug":"weekly-contest-240"},{"question_id":2188,"title":"完成比赛的最少时间","title_slug":"minimum-time-to-finish-the-race","rating":2315.0547336936,"_hash":1723985703,"paid_only":false,"cont_title":"第 282 场周赛","cont_title_slug":"weekly-contest-282"},{"question_id":1187,"title":"使数组严格递增","title_slug":"make-array-strictly-increasing","rating":2315.6037017989,"_hash":979526552,"paid_only":false,"cont_title":"第 153 场周赛","cont_title_slug":"weekly-contest-153"},{"question_id":2827,"title":"范围中美丽整数的数目","title_slug":"number-of-beautiful-integers-in-the-range","rating":2324.1192580053,"_hash":219694070,"paid_only":false,"cont_title":"第 111 场双周赛","cont_title_slug":"biweekly-contest-111"},{"question_id":2940,"title":"找到 Alice 和 Bob 可以相遇的建筑","title_slug":"find-building-where-alice-and-bob-can-meet","rating":2327.4743300299,"_hash":2297518953,"paid_only":false,"cont_title":"第 372 场周赛","cont_title_slug":"weekly-contest-372"},{"question_id":882,"title":"细分图中的可到达节点","title_slug":"reachable-nodes-in-subdivided-graph","rating":2328.4294689238,"_hash":2956439807,"paid_only":false,"cont_title":"第 96 场周赛","cont_title_slug":"weekly-contest-96"},{"question_id":1585,"title":"检查字符串是否可以通过排序子字符串得到另一个字符串","title_slug":"check-if-string-is-transformable-with-substring-sort-operations","rating":2333.0078041754,"_hash":3631493170,"paid_only":false,"cont_title":"第 206 场周赛","cont_title_slug":"weekly-contest-206"},{"question_id":1866,"title":"恰有 K 根木棍可以看到的排列数目","title_slug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible","rating":2333.0621537307,"_hash":3900992255,"paid_only":false,"cont_title":"第 241 场周赛","cont_title_slug":"weekly-contest-241"},{"question_id":1674,"title":"使数组互补的最少操作次数","title_slug":"minimum-moves-to-make-array-complementary","rating":2333.2401505813,"_hash":3510890976,"paid_only":false,"cont_title":"第 217 场周赛","cont_title_slug":"weekly-contest-217"},{"question_id":1505,"title":"最多 K 次交换相邻数位后得到的最小整数","title_slug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits","rating":2336.5210003185,"_hash":1218347826,"paid_only":false,"cont_title":"第 196 场周赛","cont_title_slug":"weekly-contest-196"},{"question_id":2478,"title":"完美分割的方案数","title_slug":"number-of-beautiful-partitions","rating":2344.3664724791,"_hash":1069956724,"paid_only":false,"cont_title":"第 320 场周赛","cont_title_slug":"weekly-contest-320"},{"question_id":1611,"title":"使整数变为 0 的最少操作次数","title_slug":"minimum-one-bit-operations-to-make-integers-zero","rating":2345.3418191684,"_hash":3744485747,"paid_only":false,"cont_title":"第 209 场周赛","cont_title_slug":"weekly-contest-209"},{"question_id":2258,"title":"逃离火灾","title_slug":"escape-the-spreading-fire","rating":2346.5717839654,"_hash":315307043,"paid_only":false,"cont_title":"第 77 场双周赛","cont_title_slug":"biweekly-contest-77"},{"question_id":1096,"title":"花括号展开 II","title_slug":"brace-expansion-ii","rating":2348.5159376523,"_hash":1730213489,"paid_only":false,"cont_title":"第 142 场周赛","cont_title_slug":"weekly-contest-142"},{"question_id":2935,"title":"找出强数对的最大异或值 II","title_slug":"maximum-strong-pair-xor-ii","rating":2348.7273357105,"_hash":486718067,"paid_only":false,"cont_title":"第 371 场周赛","cont_title_slug":"weekly-contest-371"},{"question_id":837,"title":"新 21 点","title_slug":"new-21-game","rating":2350.0380300939,"_hash":3259259158,"paid_only":false,"cont_title":"第 85 场周赛","cont_title_slug":"weekly-contest-85"},{"question_id":2920,"title":"收集所有金币可获得的最大积分","title_slug":"maximum-points-after-collecting-coins-from-all-nodes","rating":2350.7421492104,"_hash":1381994519,"paid_only":false,"cont_title":"第 369 场周赛","cont_title_slug":"weekly-contest-369"},{"question_id":1713,"title":"得到子序列的最少操作次数","title_slug":"minimum-operations-to-make-a-subsequence","rating":2350.9694374861,"_hash":102575803,"paid_only":false,"cont_title":"第 222 场周赛","cont_title_slug":"weekly-contest-222"},{"question_id":2999,"title":"统计强大整数的数目","title_slug":"count-the-number-of-powerful-integers","rating":2351.2293628792,"_hash":677909483,"paid_only":false,"cont_title":"第 121 场双周赛","cont_title_slug":"biweekly-contest-121"},{"question_id":2719,"title":"统计整数数目","title_slug":"count-of-integers","rating":2354.5411153127,"_hash":942180030,"paid_only":false,"cont_title":"第 348 场周赛","cont_title_slug":"weekly-contest-348"},{"question_id":1467,"title":"两个盒子中球的颜色数相同的概率","title_slug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls","rating":2356.5811122453,"_hash":338661942,"paid_only":false,"cont_title":"第 191 场周赛","cont_title_slug":"weekly-contest-191"},{"question_id":1707,"title":"与数组中元素的最大异或值","title_slug":"maximum-xor-with-an-element-from-array","rating":2358.9669560824,"_hash":2768437968,"paid_only":false,"cont_title":"第 221 场周赛","cont_title_slug":"weekly-contest-221"},{"question_id":1520,"title":"最多的不重叠子字符串","title_slug":"maximum-number-of-non-overlapping-substrings","rating":2362.6480880348,"_hash":2687486440,"paid_only":false,"cont_title":"第 198 场周赛","cont_title_slug":"weekly-contest-198"},{"question_id":2312,"title":"卖木头块","title_slug":"selling-pieces-of-wood","rating":2363.0240184484,"_hash":915449177,"paid_only":false,"cont_title":"第 298 场周赛","cont_title_slug":"weekly-contest-298"},{"question_id":1755,"title":"最接近目标值的子序列和","title_slug":"closest-subsequence-sum","rating":2363.5096568214,"_hash":2473812468,"paid_only":false,"cont_title":"第 227 场周赛","cont_title_slug":"weekly-contest-227"},{"question_id":2203,"title":"得到要求路径的最小带权子图","title_slug":"minimum-weighted-subgraph-with-the-required-paths","rating":2364.3455634374,"_hash":237326824,"paid_only":false,"cont_title":"第 284 场周赛","cont_title_slug":"weekly-contest-284"},{"question_id":2132,"title":"用邮票贴满网格图","title_slug":"stamping-the-grid","rating":2364.3930657709,"_hash":296151509,"paid_only":false,"cont_title":"第 69 场双周赛","cont_title_slug":"biweekly-contest-69"},{"question_id":1183,"title":"矩阵中 1 的最大数量","title_slug":"maximum-number-of-ones","rating":2366.7099607655,"_hash":3675075625,"paid_only":false,"cont_title":"第 8 场双周赛","cont_title_slug":"biweekly-contest-8"},{"question_id":2801,"title":"统计范围内的步进数字数目","title_slug":"count-stepping-numbers-in-range","rating":2367.4705934718,"_hash":3369476122,"paid_only":false,"cont_title":"第 356 场周赛","cont_title_slug":"weekly-contest-356"},{"question_id":2556,"title":"二进制矩阵中翻转最多一次使路径不连通","title_slug":"disconnect-path-in-a-binary-matrix-by-at-most-one-flip","rating":2368.6674771307,"_hash":3118895370,"paid_only":false,"cont_title":"第 97 场双周赛","cont_title_slug":"biweekly-contest-97"},{"question_id":1840,"title":"最高建筑高度","title_slug":"maximum-building-height","rating":2374.1850487395,"_hash":3469541764,"paid_only":false,"cont_title":"第 238 场周赛","cont_title_slug":"weekly-contest-238"},{"question_id":887,"title":"鸡蛋掉落","title_slug":"super-egg-drop","rating":2376.8658923518,"_hash":2610426510,"paid_only":false,"cont_title":"第 97 场周赛","cont_title_slug":"weekly-contest-97"},{"question_id":854,"title":"相似度为 K 的字符串","title_slug":"k-similar-strings","rating":2377.3895801187,"_hash":4154336589,"paid_only":false,"cont_title":"第 89 场周赛","cont_title_slug":"weekly-contest-89"},{"question_id":2589,"title":"完成所有任务的最少时间","title_slug":"minimum-time-to-complete-all-tasks","rating":2380.5983169295,"_hash":1119710280,"paid_only":false,"cont_title":"第 336 场周赛","cont_title_slug":"weekly-contest-336"},{"question_id":2334,"title":"元素值大于变化阈值的子数组","title_slug":"subarray-with-elements-greater-than-varying-threshold","rating":2381.2160234811,"_hash":265213405,"paid_only":false,"cont_title":"第 82 场双周赛","cont_title_slug":"biweekly-contest-82"},{"question_id":956,"title":"最高的广告牌","title_slug":"tallest-billboard","rating":2381.479024858,"_hash":2251334448,"paid_only":false,"cont_title":"第 114 场周赛","cont_title_slug":"weekly-contest-114"},{"question_id":2468,"title":"根据限制分割消息","title_slug":"split-message-based-on-limit","rating":2381.6019709166,"_hash":4257560677,"paid_only":false,"cont_title":"第 91 场双周赛","cont_title_slug":"biweekly-contest-91"},{"question_id":2577,"title":"在网格图中访问一个格子的最少时间","title_slug":"minimum-time-to-visit-a-cell-in-a-grid","rating":2381.625583289,"_hash":2170025879,"paid_only":false,"cont_title":"第 334 场周赛","cont_title_slug":"weekly-contest-334"},{"question_id":1521,"title":"找到最接近目标值的函数值","title_slug":"find-a-value-of-a-mysterious-function-closest-to-target","rating":2383.7724811656,"_hash":3856718514,"paid_only":false,"cont_title":"第 198 场周赛","cont_title_slug":"weekly-contest-198"},{"question_id":1349,"title":"参加考试的最大学生数","title_slug":"maximum-students-taking-exam","rating":2385.8072128533,"_hash":1698302709,"paid_only":false,"cont_title":"第 175 场周赛","cont_title_slug":"weekly-contest-175"},{"question_id":2713,"title":"矩阵中严格递增的单元格数","title_slug":"maximum-strictly-increasing-cells-in-a-matrix","rating":2387.3525635254,"_hash":521886798,"paid_only":false,"cont_title":"第 347 场周赛","cont_title_slug":"weekly-contest-347"},{"question_id":1681,"title":"最小不兼容性","title_slug":"minimum-incompatibility","rating":2389.9634276167,"_hash":2997800679,"paid_only":false,"cont_title":"第 218 场周赛","cont_title_slug":"weekly-contest-218"},{"question_id":2322,"title":"从树中删除边的最小分数","title_slug":"minimum-score-after-removals-on-a-tree","rating":2391.657270733,"_hash":2618637580,"paid_only":false,"cont_title":"第 299 场周赛","cont_title_slug":"weekly-contest-299"},{"question_id":2172,"title":"数组的最大与和","title_slug":"maximum-and-sum-of-array","rating":2392.0799451298,"_hash":284708083,"paid_only":false,"cont_title":"第 280 场周赛","cont_title_slug":"weekly-contest-280"},{"question_id":1825,"title":"求出 MK 平均值","title_slug":"finding-mk-average","rating":2395.8765531206,"_hash":2747291591,"paid_only":false,"cont_title":"第 236 场周赛","cont_title_slug":"weekly-contest-236"},{"question_id":2818,"title":"操作使得分最大","title_slug":"apply-operations-to-maximize-score","rating":2396.6770372863,"_hash":2573211912,"paid_only":false,"cont_title":"第 358 场周赛","cont_title_slug":"weekly-contest-358"},{"question_id":2569,"title":"更新数组后处理求和查询","title_slug":"handling-sum-queries-after-update","rating":2397.8728428256,"_hash":1507332922,"paid_only":false,"cont_title":"第 98 场双周赛","cont_title_slug":"biweekly-contest-98"},{"question_id":2538,"title":"最大价值和与最小价值和的差值","title_slug":"difference-between-maximum-and-minimum-price-sum","rating":2397.9722495587,"_hash":2887872471,"paid_only":false,"cont_title":"第 328 场周赛","cont_title_slug":"weekly-contest-328"},{"question_id":920,"title":"播放列表的数量","title_slug":"number-of-music-playlists","rating":2399.5729141925,"_hash":1165166058,"paid_only":false,"cont_title":"第 105 场周赛","cont_title_slug":"weekly-contest-105"},{"question_id":2747,"title":"统计没有收到请求的服务器数目","title_slug":"count-zero-request-servers","rating":2405.3375364501,"_hash":2240198172,"paid_only":false,"cont_title":"第 107 场双周赛","cont_title_slug":"biweekly-contest-107"},{"question_id":1388,"title":"3n 块披萨","title_slug":"pizza-with-3n-slices","rating":2409.7580728676,"_hash":4187483922,"paid_only":false,"cont_title":"第 22 场双周赛","cont_title_slug":"biweekly-contest-22"},{"question_id":1928,"title":"规定时间内到达终点的最小花费","title_slug":"minimum-cost-to-reach-destination-in-time","rating":2413.3969129689,"_hash":3899529382,"paid_only":false,"cont_title":"第 56 场双周赛","cont_title_slug":"biweekly-contest-56"},{"question_id":2518,"title":"好分区的数目","title_slug":"number-of-great-partitions","rating":2414.6227484407,"_hash":636790914,"paid_only":false,"cont_title":"第 325 场周赛","cont_title_slug":"weekly-contest-325"},{"question_id":2003,"title":"每棵子树内缺失的最小基因值","title_slug":"smallest-missing-genetic-value-in-each-subtree","rating":2415.0089731911,"_hash":4272085250,"paid_only":false,"cont_title":"第 258 场周赛","cont_title_slug":"weekly-contest-258"},{"question_id":2493,"title":"将节点分成尽可能多的组","title_slug":"divide-nodes-into-the-maximum-number-of-groups","rating":2415.2802039252,"_hash":1627181507,"paid_only":false,"cont_title":"第 322 场周赛","cont_title_slug":"weekly-contest-322"},{"question_id":2663,"title":"字典序最小的美丽字符串","title_slug":"lexicographically-smallest-beautiful-string","rating":2415.7434855724,"_hash":178720857,"paid_only":false,"cont_title":"第 343 场周赛","cont_title_slug":"weekly-contest-343"},{"question_id":1203,"title":"项目管理","title_slug":"sort-items-by-groups-respecting-dependencies","rating":2418.5742747632,"_hash":505097820,"paid_only":false,"cont_title":"第 155 场周赛","cont_title_slug":"weekly-contest-155"},{"question_id":2572,"title":"无平方子集计数","title_slug":"count-the-number-of-square-free-subsets","rating":2419.5791089724,"_hash":3483377785,"paid_only":false,"cont_title":"第 333 场周赛","cont_title_slug":"weekly-contest-333"},{"question_id":1987,"title":"不同的好子序列数目","title_slug":"number-of-unique-good-subsequences","rating":2422.3128048015,"_hash":3567330607,"paid_only":false,"cont_title":"第 256 场周赛","cont_title_slug":"weekly-contest-256"},{"question_id":1000,"title":"合并石头的最低成本","title_slug":"minimum-cost-to-merge-stones","rating":2422.5309771173,"_hash":730656427,"paid_only":false,"cont_title":"第 126 场周赛","cont_title_slug":"weekly-contest-126"},{"question_id":2742,"title":"给墙壁刷油漆","title_slug":"painting-the-walls","rating":2424.6761561972,"_hash":3563762803,"paid_only":false,"cont_title":"第 350 场周赛","cont_title_slug":"weekly-contest-350"},{"question_id":2867,"title":"统计树中的合法路径数目","title_slug":"count-valid-paths-in-a-tree","rating":2428.3242593838,"_hash":3532863467,"paid_only":false,"cont_title":"第 364 场周赛","cont_title_slug":"weekly-contest-364"},{"question_id":1044,"title":"最长重复子串","title_slug":"longest-duplicate-substring","rating":2428.7985254341,"_hash":625310591,"paid_only":false,"cont_title":"第 136 场周赛","cont_title_slug":"weekly-contest-136"},{"question_id":1998,"title":"数组的最大公因数排序","title_slug":"gcd-sort-of-an-array","rating":2429.0940568399,"_hash":1642092986,"paid_only":false,"cont_title":"第 257 场周赛","cont_title_slug":"weekly-contest-257"},{"question_id":2565,"title":"最少得分子序列","title_slug":"subsequence-with-the-minimum-score","rating":2432.4146343542,"_hash":782263815,"paid_only":false,"cont_title":"第 332 场周赛","cont_title_slug":"weekly-contest-332"},{"question_id":2552,"title":"统计上升四元组","title_slug":"count-increasing-quadruplets","rating":2432.713399111,"_hash":2579679937,"paid_only":false,"cont_title":"第 330 场周赛","cont_title_slug":"weekly-contest-330"},{"question_id":903,"title":"DI 序列的有效排列","title_slug":"valid-permutations-for-di-sequence","rating":2433.3767704629,"_hash":2519726489,"paid_only":false,"cont_title":"第 101 场周赛","cont_title_slug":"weekly-contest-101"},{"question_id":1872,"title":"石子游戏 VIII","title_slug":"stone-game-viii","rating":2439.7337408636,"_hash":3947635653,"paid_only":false,"cont_title":"第 242 场周赛","cont_title_slug":"weekly-contest-242"},{"question_id":2968,"title":"执行操作使频率分数最大","title_slug":"apply-operations-to-maximize-frequency-score","rating":2444.2791027022,"_hash":1059279895,"paid_only":false,"cont_title":"第 376 场周赛","cont_title_slug":"weekly-contest-376"},{"question_id":2421,"title":"好路径的数目","title_slug":"number-of-good-paths","rating":2444.6660756903,"_hash":2335420481,"paid_only":false,"cont_title":"第 312 场周赛","cont_title_slug":"weekly-contest-312"},{"question_id":2949,"title":"统计美丽子字符串 II","title_slug":"count-beautiful-substrings-ii","rating":2444.7192647604,"_hash":497323702,"paid_only":false,"cont_title":"第 373 场周赛","cont_title_slug":"weekly-contest-373"},{"question_id":2926,"title":"平衡子序列的最大和","title_slug":"maximum-balanced-subsequence-sum","rating":2448.4455464535,"_hash":2375501212,"paid_only":false,"cont_title":"第 370 场周赛","cont_title_slug":"weekly-contest-370"},{"question_id":2127,"title":"参加会议的最多员工数","title_slug":"maximum-employees-to-be-invited-to-a-meeting","rating":2449.1323757838,"_hash":2605448197,"paid_only":false,"cont_title":"第 274 场周赛","cont_title_slug":"weekly-contest-274"},{"question_id":2953,"title":"统计完全子字符串","title_slug":"count-complete-substrings","rating":2449.3352959316,"_hash":3462463455,"paid_only":false,"cont_title":"第 374 场周赛","cont_title_slug":"weekly-contest-374"},{"question_id":2463,"title":"最小移动总距离","title_slug":"minimum-total-distance-traveled","rating":2453.9054896968,"_hash":169260234,"paid_only":false,"cont_title":"第 318 场周赛","cont_title_slug":"weekly-contest-318"},{"question_id":1900,"title":"最佳运动员的比拼回合","title_slug":"the-earliest-and-latest-rounds-where-players-compete","rating":2454.7653333657,"_hash":5115105,"paid_only":false,"cont_title":"第 245 场周赛","cont_title_slug":"weekly-contest-245"},{"question_id":1040,"title":"移动石子直到连续 II","title_slug":"moving-stones-until-consecutive-ii","rating":2455.8244137907,"_hash":2184686055,"paid_only":false,"cont_title":"第 135 场周赛","cont_title_slug":"weekly-contest-135"},{"question_id":1499,"title":"满足不等式的最大值","title_slug":"max-value-of-equation","rating":2456.3900212097,"_hash":446968474,"paid_only":false,"cont_title":"第 195 场周赛","cont_title_slug":"weekly-contest-195"},{"question_id":1782,"title":"统计点对的数目","title_slug":"count-pairs-of-nodes","rating":2457.115574186,"_hash":3015354306,"paid_only":false,"cont_title":"第 47 场双周赛","cont_title_slug":"biweekly-contest-47"},{"question_id":2440,"title":"创建价值相同的连通块","title_slug":"create-components-with-same-value","rating":2460.3152437576,"_hash":2080495144,"paid_only":false,"cont_title":"第 89 场双周赛","cont_title_slug":"biweekly-contest-89"},{"question_id":1994,"title":"好子集的数目","title_slug":"the-number-of-good-subsets","rating":2464.5077611012,"_hash":1844354140,"paid_only":false,"cont_title":"第 60 场双周赛","cont_title_slug":"biweekly-contest-60"},{"question_id":1703,"title":"得到连续 K 个 1 的最少相邻交换次数","title_slug":"minimum-adjacent-swaps-for-k-consecutive-ones","rating":2466.8891773908,"_hash":3562926842,"paid_only":false,"cont_title":"第 42 场双周赛","cont_title_slug":"biweekly-contest-42"},{"question_id":2286,"title":"以组为单位订音乐会的门票","title_slug":"booking-concert-tickets-in-groups","rating":2470.2118194809,"_hash":3907062892,"paid_only":false,"cont_title":"第 79 场双周赛","cont_title_slug":"biweekly-contest-79"},{"question_id":1622,"title":"奇妙序列","title_slug":"fancy-sequence","rating":2476.451764287,"_hash":976252372,"paid_only":false,"cont_title":"第 37 场双周赛","cont_title_slug":"biweekly-contest-37"},{"question_id":2117,"title":"一个区间内所有数乘积的缩写","title_slug":"abbreviating-the-product-of-a-range","rating":2476.7727985927,"_hash":2799632565,"paid_only":false,"cont_title":"第 68 场双周赛","cont_title_slug":"biweekly-contest-68"},{"question_id":1803,"title":"统计异或值在范围内的数对有多少","title_slug":"count-pairs-with-xor-in-a-range","rating":2479.3282985529,"_hash":2711761019,"paid_only":false,"cont_title":"第 233 场周赛","cont_title_slug":"weekly-contest-233"},{"question_id":1330,"title":"翻转子数组得到最大的数组值","title_slug":"reverse-subarray-to-maximize-array-value","rating":2481.7175364169,"_hash":3851133364,"paid_only":false,"cont_title":"第 18 场双周赛","cont_title_slug":"biweekly-contest-18"},{"question_id":2289,"title":"使数组按非递减顺序排列","title_slug":"steps-to-make-array-non-decreasing","rating":2481.8722909195,"_hash":188352287,"paid_only":false,"cont_title":"第 295 场周赛","cont_title_slug":"weekly-contest-295"},{"question_id":1932,"title":"合并多棵二叉搜索树","title_slug":"merge-bsts-to-create-single-bst","rating":2483.9435767299,"_hash":1876544260,"paid_only":false,"cont_title":"第 249 场周赛","cont_title_slug":"weekly-contest-249"},{"question_id":1916,"title":"统计为蚁群构筑房间的不同顺序","title_slug":"count-ways-to-build-rooms-in-an-ant-colony","rating":2486.2339675701,"_hash":2321691552,"paid_only":false,"cont_title":"第 247 场周赛","cont_title_slug":"weekly-contest-247"},{"question_id":2035,"title":"将数组分成两个数组并最小化数组和的差","title_slug":"partition-array-into-two-arrays-to-minimize-sum-difference","rating":2489.6652421066,"_hash":550627195,"paid_only":false,"cont_title":"第 262 场周赛","cont_title_slug":"weekly-contest-262"},{"question_id":2157,"title":"字符串分组","title_slug":"groups-of-strings","rating":2499.3282271507,"_hash":713625410,"paid_only":false,"cont_title":"第 278 场周赛","cont_title_slug":"weekly-contest-278"},{"question_id":1735,"title":"生成乘积数组的方案数","title_slug":"count-ways-to-make-array-with-product","rating":2499.5640490579,"_hash":3183792133,"paid_only":false,"cont_title":"第 44 场双周赛","cont_title_slug":"biweekly-contest-44"},{"question_id":1938,"title":"查询最大基因差","title_slug":"maximum-genetic-difference-query","rating":2502.5176603922,"_hash":2939895760,"paid_only":false,"cont_title":"第 250 场周赛","cont_title_slug":"weekly-contest-250"},{"question_id":2846,"title":"边权重均等查询","title_slug":"minimum-edge-weight-equilibrium-queries-in-a-tree","rating":2507.9960044659,"_hash":2672352527,"paid_only":false,"cont_title":"第 361 场周赛","cont_title_slug":"weekly-contest-361"},{"question_id":2272,"title":"最大波动的子字符串","title_slug":"substring-with-largest-variance","rating":2515.7520586008,"_hash":928331770,"paid_only":false,"cont_title":"第 78 场双周赛","cont_title_slug":"biweekly-contest-78"},{"question_id":2040,"title":"两个有序数组的第 K 小乘积","title_slug":"kth-smallest-product-of-two-sorted-arrays","rating":2517.6829964848,"_hash":4175159080,"paid_only":false,"cont_title":"第 63 场双周赛","cont_title_slug":"biweekly-contest-63"},{"question_id":1632,"title":"矩阵转换后的秩","title_slug":"rank-transform-of-a-matrix","rating":2529.5251086936,"_hash":2488135056,"paid_only":false,"cont_title":"第 212 场周赛","cont_title_slug":"weekly-contest-212"},{"question_id":1776,"title":"车队 II","title_slug":"car-fleet-ii","rating":2530.6905139914,"_hash":1961138257,"paid_only":false,"cont_title":"第 230 场周赛","cont_title_slug":"weekly-contest-230"},{"question_id":1896,"title":"反转表达式值的最少操作次数","title_slug":"minimum-cost-to-change-the-final-value-of-expression","rating":2531.6452775023,"_hash":4239622058,"paid_only":false,"cont_title":"第 54 场双周赛","cont_title_slug":"biweekly-contest-54"},{"question_id":2736,"title":"最大和查询","title_slug":"maximum-sum-queries","rating":2533.2830157959,"_hash":3697179042,"paid_only":false,"cont_title":"第 349 场周赛","cont_title_slug":"weekly-contest-349"},{"question_id":1675,"title":"数组的最小偏移量","title_slug":"minimize-deviation-in-array","rating":2533.3027905062,"_hash":549109709,"paid_only":false,"cont_title":"第 217 场周赛","cont_title_slug":"weekly-contest-217"},{"question_id":1948,"title":"删除系统中的重复文件夹","title_slug":"delete-duplicate-folders-in-system","rating":2533.7796160302,"_hash":2921275572,"paid_only":false,"cont_title":"第 251 场周赛","cont_title_slug":"weekly-contest-251"},{"question_id":1595,"title":"连通两组点的最小成本","title_slug":"minimum-cost-to-connect-two-groups-of-points","rating":2537.7965575726,"_hash":883833496,"paid_only":false,"cont_title":"第 207 场周赛","cont_title_slug":"weekly-contest-207"},{"question_id":1819,"title":"序列中不同最大公约数的数目","title_slug":"number-of-different-subsequences-gcds","rating":2539.863726397,"_hash":2981004463,"paid_only":false,"cont_title":"第 235 场周赛","cont_title_slug":"weekly-contest-235"},{"question_id":3013,"title":"将数组分成最小总代价的子数组 II","title_slug":"divide-an-array-into-subarrays-with-minimum-cost-ii","rating":2540.438150736,"_hash":2049140185,"paid_only":false,"cont_title":"第 122 场双周赛","cont_title_slug":"biweekly-contest-122"},{"question_id":2014,"title":"重复 K 次的最长子序列","title_slug":"longest-subsequence-repeated-k-times","rating":2558.3297484354,"_hash":3061824471,"paid_only":false,"cont_title":"第 259 场周赛","cont_title_slug":"weekly-contest-259"},{"question_id":1815,"title":"得到新鲜甜甜圈的最多组数","title_slug":"maximum-number-of-groups-getting-fresh-donuts","rating":2559.4351004238,"_hash":2135431142,"paid_only":false,"cont_title":"第 49 场双周赛","cont_title_slug":"biweekly-contest-49"},{"question_id":2234,"title":"花园的最大总美丽值","title_slug":"maximum-total-beauty-of-the-gardens","rating":2561.508149216,"_hash":2719330296,"paid_only":false,"cont_title":"第 288 场周赛","cont_title_slug":"weekly-contest-288"},{"question_id":2030,"title":"含特定字母的最小子序列","title_slug":"smallest-k-length-subsequence-with-occurrences-of-a-letter","rating":2561.7794931859,"_hash":266469116,"paid_only":false,"cont_title":"第 261 场周赛","cont_title_slug":"weekly-contest-261"},{"question_id":913,"title":"猫和老鼠","title_slug":"cat-and-mouse","rating":2566.5910742837,"_hash":1811529317,"paid_only":false,"cont_title":"第 104 场周赛","cont_title_slug":"weekly-contest-104"},{"question_id":1489,"title":"找到最小生成树里的关键边和伪关键边","title_slug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree","rating":2571.552028121,"_hash":2415029607,"paid_only":false,"cont_title":"第 194 场周赛","cont_title_slug":"weekly-contest-194"},{"question_id":1531,"title":"压缩字符串 II","title_slug":"string-compression-ii","rating":2575.9570281316,"_hash":2845488076,"paid_only":false,"cont_title":"第 199 场周赛","cont_title_slug":"weekly-contest-199"},{"question_id":2617,"title":"网格图中最少访问的格子数","title_slug":"minimum-number-of-visited-cells-in-a-grid","rating":2581.9961985753,"_hash":267246445,"paid_only":false,"cont_title":"第 340 场周赛","cont_title_slug":"weekly-contest-340"},{"question_id":2813,"title":"子序列最大优雅度","title_slug":"maximum-elegance-of-a-k-length-subsequence","rating":2582.0814855506,"_hash":462875391,"paid_only":false,"cont_title":"第 357 场周赛","cont_title_slug":"weekly-contest-357"},{"question_id":936,"title":"戳印序列","title_slug":"stamping-the-sequence","rating":2583.406911951,"_hash":3709920516,"paid_only":false,"cont_title":"第 109 场周赛","cont_title_slug":"weekly-contest-109"},{"question_id":2019,"title":"解出数学表达式的学生分数","title_slug":"the-score-of-students-solving-math-expression","rating":2583.9006314254,"_hash":1787510201,"paid_only":false,"cont_title":"第 260 场周赛","cont_title_slug":"weekly-contest-260"},{"question_id":1883,"title":"准时抵达会议现场的最小跳过休息次数","title_slug":"minimum-skips-to-arrive-at-meeting-on-time","rating":2587.8725248485,"_hash":557097878,"paid_only":false,"cont_title":"第 243 场周赛","cont_title_slug":"weekly-contest-243"},{"question_id":2532,"title":"过桥的时间","title_slug":"time-to-cross-a-bridge","rating":2588.8752130913,"_hash":1029578709,"paid_only":false,"cont_title":"第 327 场周赛","cont_title_slug":"weekly-contest-327"},{"question_id":964,"title":"表示数字的最少运算符","title_slug":"least-operators-to-express-number","rating":2594.135673452,"_hash":571415893,"paid_only":false,"cont_title":"第 116 场周赛","cont_title_slug":"weekly-contest-116"},{"question_id":2911,"title":"得到 K 个半回文串的最少修改次数","title_slug":"minimum-changes-to-make-k-semi-palindromes","rating":2607.9418744903,"_hash":2481240580,"paid_only":false,"cont_title":"第 368 场周赛","cont_title_slug":"weekly-contest-368"},{"question_id":1687,"title":"从仓库到码头运输箱子","title_slug":"delivering-boxes-from-storage-to-ports","rating":2610.0826855063,"_hash":2436117632,"paid_only":false,"cont_title":"第 41 场双周赛","cont_title_slug":"biweekly-contest-41"},{"question_id":2056,"title":"棋盘上有效移动组合的数目","title_slug":"number-of-valid-move-combinations-on-chessboard","rating":2610.9906730644,"_hash":288912613,"paid_only":false,"cont_title":"第 64 场双周赛","cont_title_slug":"biweekly-contest-64"},{"question_id":2338,"title":"统计理想数组的数目","title_slug":"count-the-number-of-ideal-arrays","rating":2615.1468269481,"_hash":2648057035,"paid_only":false,"cont_title":"第 301 场周赛","cont_title_slug":"weekly-contest-301"},{"question_id":2790,"title":"长度递增组的最大数目","title_slug":"maximum-number-of-groups-with-increasing-length","rating":2619.7016189999,"_hash":2676463244,"paid_only":false,"cont_title":"第 355 场周赛","cont_title_slug":"weekly-contest-355"},{"question_id":1830,"title":"使字符串有序的最少操作次数","title_slug":"minimum-number-of-operations-to-make-string-sorted","rating":2620.4181842249,"_hash":3807487459,"paid_only":false,"cont_title":"第 50 场双周赛","cont_title_slug":"biweekly-contest-50"},{"question_id":2281,"title":"巫师的总力量和","title_slug":"sum-of-total-strength-of-wizards","rating":2621.1208072273,"_hash":3147772108,"paid_only":false,"cont_title":"第 294 场周赛","cont_title_slug":"weekly-contest-294"},{"question_id":2213,"title":"由单个字符重复的最长子字符串","title_slug":"longest-substring-of-one-repeating-character","rating":2628.7957821141,"_hash":96141044,"paid_only":false,"cont_title":"第 285 场周赛","cont_title_slug":"weekly-contest-285"},{"question_id":2499,"title":"让数组不相等的最小总代价","title_slug":"minimum-total-cost-to-make-arrays-unequal","rating":2633.0144045478,"_hash":3756156206,"paid_only":false,"cont_title":"第 93 场双周赛","cont_title_slug":"biweekly-contest-93"},{"question_id":1787,"title":"使所有区间的异或结果为零","title_slug":"make-the-xor-of-all-segments-equal-to-zero","rating":2640.3824813624,"_hash":2908242202,"paid_only":false,"cont_title":"第 231 场周赛","cont_title_slug":"weekly-contest-231"},{"question_id":2954,"title":"统计感冒序列的数目","title_slug":"count-the-number-of-infection-sequences","rating":2644.8498152558,"_hash":3519471521,"paid_only":false,"cont_title":"第 374 场周赛","cont_title_slug":"weekly-contest-374"},{"question_id":2386,"title":"找出数组的第 K 大和","title_slug":"find-the-k-sum-of-an-array","rating":2647.8258771458,"_hash":2945726008,"paid_only":false,"cont_title":"第 307 场周赛","cont_title_slug":"weekly-contest-307"},{"question_id":2071,"title":"你可以安排的最多任务数目","title_slug":"maximum-number-of-tasks-you-can-assign","rating":2648.1748409542,"_hash":1194042995,"paid_only":false,"cont_title":"第 65 场双周赛","cont_title_slug":"biweekly-contest-65"},{"question_id":2097,"title":"合法重新排列数对","title_slug":"valid-arrangement-of-pairs","rating":2650.8996457642,"_hash":459732998,"paid_only":false,"cont_title":"第 270 场周赛","cont_title_slug":"weekly-contest-270"},{"question_id":1659,"title":"最大化网格幸福感","title_slug":"maximize-grid-happiness","rating":2655.2178711909,"_hash":372608626,"paid_only":false,"cont_title":"第 215 场周赛","cont_title_slug":"weekly-contest-215"},{"question_id":1923,"title":"最长公共子路径","title_slug":"longest-common-subpath","rating":2661.0670044656,"_hash":3430988573,"paid_only":false,"cont_title":"第 248 场周赛","cont_title_slug":"weekly-contest-248"},{"question_id":1397,"title":"找到所有好字符串","title_slug":"find-all-good-strings","rating":2666.668150845,"_hash":3549637617,"paid_only":false,"cont_title":"第 182 场周赛","cont_title_slug":"weekly-contest-182"},{"question_id":2791,"title":"树中可以形成回文的路径数","title_slug":"count-paths-that-can-form-a-palindrome-in-a-tree","rating":2677.1682592316,"_hash":3909203570,"paid_only":false,"cont_title":"第 355 场周赛","cont_title_slug":"weekly-contest-355"},{"question_id":2573,"title":"找出对应 LCP 矩阵的字符串","title_slug":"find-the-string-with-lcp","rating":2681.7054310332,"_hash":3461834167,"paid_only":false,"cont_title":"第 333 场周赛","cont_title_slug":"weekly-contest-333"},{"question_id":1960,"title":"两个回文子字符串长度的最大乘积","title_slug":"maximum-product-of-the-length-of-two-palindromic-substrings","rating":2690.5859406179,"_hash":1434911335,"paid_only":false,"cont_title":"第 58 场双周赛","cont_title_slug":"biweekly-contest-58"},{"question_id":2977,"title":"转换字符串的最小成本 II","title_slug":"minimum-cost-to-convert-string-ii","rating":2695.809667046,"_hash":3381061806,"paid_only":false,"cont_title":"第 377 场周赛","cont_title_slug":"weekly-contest-377"},{"question_id":3017,"title":"按距离统计房屋对数目 II","title_slug":"count-the-number-of-houses-at-a-certain-distance-ii","rating":2709.4067070911,"_hash":3187405082,"paid_only":false,"cont_title":"第 381 场周赛","cont_title_slug":"weekly-contest-381"},{"question_id":2603,"title":"收集树中金币","title_slug":"collect-coins-in-a-tree","rating":2711.8717381409,"_hash":2315979719,"paid_only":false,"cont_title":"第 338 场周赛","cont_title_slug":"weekly-contest-338"},{"question_id":2902,"title":"和带限制的子多重集合的数目","title_slug":"count-of-sub-multisets-with-bounded-sum","rating":2758.9704056427,"_hash":2720318685,"paid_only":false,"cont_title":"第 115 场双周赛","cont_title_slug":"biweekly-contest-115"},{"question_id":2836,"title":"在传球游戏中最大化函数值","title_slug":"maximize-value-of-function-in-a-ball-passing-game","rating":2768.8154223451,"_hash":1915862517,"paid_only":false,"cont_title":"第 360 场周赛","cont_title_slug":"weekly-contest-360"},{"question_id":2983,"title":"回文串重新排列查询","title_slug":"palindrome-rearrangement-queries","rating":2779.7855167601,"_hash":4244339093,"paid_only":false,"cont_title":"第 378 场周赛","cont_title_slug":"weekly-contest-378"},{"question_id":2060,"title":"同源字符串检测","title_slug":"check-if-an-original-string-exists-given-two-encoded-strings","rating":2803.7652028979,"_hash":905487995,"paid_only":false,"cont_title":"第 265 场周赛","cont_title_slug":"weekly-contest-265"},{"question_id":2916,"title":"子数组不同元素数目的平方和 II","title_slug":"subarrays-distinct-element-sum-of-squares-ii","rating":2816.0706257586,"_hash":731038573,"paid_only":false,"cont_title":"第 116 场双周赛","cont_title_slug":"biweekly-contest-116"},{"question_id":1977,"title":"划分数字的方案数","title_slug":"number-of-ways-to-separate-numbers","rating":2817.267212602,"_hash":1178924986,"paid_only":false,"cont_title":"第 59 场双周赛","cont_title_slug":"biweekly-contest-59"},{"question_id":2612,"title":"最少翻转操作数","title_slug":"minimum-reverse-operations","rating":2824.4551372454,"_hash":855962181,"paid_only":false,"cont_title":"第 339 场周赛","cont_title_slug":"weekly-contest-339"},{"question_id":1728,"title":"猫和老鼠 II","title_slug":"cat-and-mouse-ii","rating":2849.4841858619,"_hash":59158142,"paid_only":false,"cont_title":"第 224 场周赛","cont_title_slug":"weekly-contest-224"},{"question_id":2851,"title":"字符串转换","title_slug":"string-transformation","rating":2857.6543956169,"_hash":2130827066,"paid_only":false,"cont_title":"第 362 场周赛","cont_title_slug":"weekly-contest-362"},{"question_id":1982,"title":"从子集的和还原数组","title_slug":"find-array-given-subset-sums","rating":2872.0290327119,"_hash":1576603106,"paid_only":false,"cont_title":"第 255 场周赛","cont_title_slug":"weekly-contest-255"},{"question_id":2699,"title":"修改图中的边权","title_slug":"modify-graph-edge-weights","rating":2873.9745576413,"_hash":4247310156,"paid_only":false,"cont_title":"第 346 场周赛","cont_title_slug":"weekly-contest-346"},{"question_id":3022,"title":"给定操作次数内使剩余元素的或值最小","title_slug":"minimize-or-of-remaining-elements-using-operations","rating":2917.8273567322,"_hash":3532176892,"paid_only":false,"cont_title":"第 382 场周赛","cont_title_slug":"weekly-contest-382"},{"question_id":2945,"title":"找到最大非递减数组的长度","title_slug":"find-maximum-non-decreasing-array-length","rating":2943.2173551759,"_hash":1539515792,"paid_only":false,"cont_title":"第 118 场双周赛","cont_title_slug":"biweekly-contest-118"},{"question_id":2809,"title":"使数组和小于等于 x 的最少时间","title_slug":"minimum-time-to-make-array-sum-at-most-x","rating":2978.7961959355,"_hash":224100421,"paid_only":false,"cont_title":"第 110 场双周赛","cont_title_slug":"biweekly-contest-110"},{"question_id":1719,"title":"重构一棵树的方案数","title_slug":"number-of-ways-to-reconstruct-a-tree","rating":3018.4940165727,"_hash":254983687,"paid_only":false,"cont_title":"第 43 场双周赛","cont_title_slug":"biweekly-contest-43"},{"question_id":3003,"title":"执行操作后的最大分割数量","title_slug":"maximize-the-number-of-partitions-after-operations","rating":3039.3003256659,"_hash":834197249,"paid_only":false,"cont_title":"第 379 场周赛","cont_title_slug":"weekly-contest-379"}]