contest.json

[{"contest":{"id":1152,"title":"第 434 场周赛","title_slug":"weekly-contest-434","start_time":1737858600,"is_ee_exam_contest":null},"questions":[{"question_id":3432,"title":"统计元素和差值为偶数的分区方案","title_slug":"count-partitions-with-even-sum-difference","rating":0,"_hash":281585212,"paid_only":false},{"question_id":3433,"title":"统计用户被提及情况","title_slug":"count-mentions-per-user","rating":0,"_hash":4219923222,"paid_only":false},{"question_id":3434,"title":"子数组操作后的最大频率","title_slug":"maximum-frequency-after-subarray-operation","rating":0,"_hash":4235966747,"paid_only":false},{"question_id":3435,"title":"最短公共超序列的字母出现频率","title_slug":"frequencies-of-shortest-supersequences","rating":0,"_hash":944823250,"paid_only":false}],"company":{}},{"contest":{"id":1148,"title":"第 433 场周赛","title_slug":"weekly-contest-433","start_time":1737253800,"is_ee_exam_contest":null},"questions":[{"question_id":3427,"title":"变长子数组求和","title_slug":"sum-of-variable-length-subarrays","rating":0,"_hash":3909931013,"paid_only":false},{"question_id":3428,"title":"最多 K 个元素的子序列的最值之和","title_slug":"maximum-and-minimum-sums-of-at-most-size-k-subsequences","rating":0,"_hash":1135110740,"paid_only":false},{"question_id":3429,"title":"粉刷房子 IV","title_slug":"paint-house-iv","rating":0,"_hash":1403996934,"paid_only":false},{"question_id":3430,"title":"最多 K 个元素的子数组的最值之和","title_slug":"maximum-and-minimum-sums-of-at-most-size-k-subarrays","rating":0,"_hash":2305284156,"paid_only":false}],"company":{}},{"contest":{"id":1145,"title":"第 148 场双周赛","title_slug":"biweekly-contest-148","start_time":1737210600,"is_ee_exam_contest":null},"questions":[{"question_id":3423,"title":"循环数组中相邻元素的最大差值","title_slug":"maximum-difference-between-adjacent-elements-in-a-circular-array","rating":0,"_hash":3945853279,"paid_only":false},{"question_id":3424,"title":"将数组变相同的最小代价","title_slug":"minimum-cost-to-make-arrays-identical","rating":0,"_hash":2400573035,"paid_only":false},{"question_id":3425,"title":"最长特殊路径","title_slug":"longest-special-path","rating":0,"_hash":3424790249,"paid_only":false},{"question_id":3426,"title":"所有安放棋子方案的曼哈顿距离","title_slug":"manhattan-distances-of-all-arrangements-of-pieces","rating":0,"_hash":3196196118,"paid_only":false}],"company":{}},{"contest":{"id":1146,"title":"第 432 场周赛","title_slug":"weekly-contest-432","start_time":1736649000,"is_ee_exam_contest":null},"questions":[{"question_id":3417,"title":"跳过交替单元格的之字形遍历","title_slug":"zigzag-grid-traversal-with-skip","rating":0,"_hash":91077186,"paid_only":false},{"question_id":3418,"title":"机器人可以获得的最大金币数","title_slug":"maximum-amount-of-money-robot-can-earn","rating":0,"_hash":596873746,"paid_only":false},{"question_id":3419,"title":"图的最大边权的最小值","title_slug":"minimize-the-maximum-edge-weight-of-graph","rating":0,"_hash":2564830848,"paid_only":false},{"question_id":3420,"title":"统计 K 次操作以内得到非递减子数组的数目","title_slug":"count-non-decreasing-subarrays-after-k-operations","rating":0,"_hash":2389378277,"paid_only":false}],"company":{}},{"contest":{"id":1142,"title":"第 431 场周赛","title_slug":"weekly-contest-431","start_time":1736044200,"is_ee_exam_contest":null},"questions":[{"question_id":3411,"title":"最长乘积等价子数组","title_slug":"maximum-subarray-with-equal-products","rating":0,"_hash":2027231954,"paid_only":false},{"question_id":3412,"title":"计算字符串的镜像分数","title_slug":"find-mirror-score-of-a-string","rating":0,"_hash":1471370743,"paid_only":false},{"question_id":3413,"title":"收集连续 K 个袋子可以获得的最多硬币数量","title_slug":"maximum-coins-from-k-consecutive-bags","rating":0,"_hash":4196353378,"paid_only":false},{"question_id":3414,"title":"不重叠区间的最大得分","title_slug":"maximum-score-of-non-overlapping-intervals","rating":0,"_hash":609729687,"paid_only":false}],"company":{}},{"contest":{"id":1139,"title":"第 147 场双周赛","title_slug":"biweekly-contest-147","start_time":1736001000,"is_ee_exam_contest":null},"questions":[{"question_id":3407,"title":"子字符串匹配模式","title_slug":"substring-matching-pattern","rating":0,"_hash":3403786295,"paid_only":false},{"question_id":3408,"title":"设计任务管理器","title_slug":"design-task-manager","rating":0,"_hash":3300045145,"paid_only":false},{"question_id":3409,"title":"最长相邻绝对差递减子序列","title_slug":"longest-subsequence-with-decreasing-adjacent-difference","rating":0,"_hash":3887787545,"paid_only":false},{"question_id":3410,"title":"删除所有值为某个元素后的最大子数组和","title_slug":"maximize-subarray-sum-after-removing-all-occurrences-of-one-element","rating":0,"_hash":2080936805,"paid_only":false}],"company":{}},{"contest":{"id":1140,"title":"第 430 场周赛","title_slug":"weekly-contest-430","start_time":1735439400,"is_ee_exam_contest":null},"questions":[{"question_id":3402,"title":"使每一列严格递增的最少操作次数","title_slug":"minimum-operations-to-make-columns-strictly-increasing","rating":0,"_hash":1393630906,"paid_only":false},{"question_id":3403,"title":"从盒子中找出字典序最大的字符串 I","title_slug":"find-the-lexicographically-largest-string-from-the-box-i","rating":0,"_hash":2150422197,"paid_only":false},{"question_id":3404,"title":"统计特殊子序列的数目","title_slug":"count-special-subsequences","rating":0,"_hash":3181264345,"paid_only":false},{"question_id":3405,"title":"统计恰好有 K 个相等相邻元素的数组数目","title_slug":"count-the-number-of-arrays-with-k-matching-adjacent-elements","rating":0,"_hash":1075645283,"paid_only":false}],"company":{}},{"contest":{"id":1136,"title":"第 429 场周赛","title_slug":"weekly-contest-429","start_time":1734834600,"is_ee_exam_contest":null},"questions":[{"question_id":3396,"title":"使数组元素互不相同所需的最少操作次数","title_slug":"minimum-number-of-operations-to-make-elements-in-array-distinct","rating":1299.4449680864,"_hash":521195968,"paid_only":false},{"question_id":3397,"title":"执行操作后不同元素的最大数量","title_slug":"maximum-number-of-distinct-elements-after-operations","rating":1687.0611664517,"_hash":954183738,"paid_only":false},{"question_id":3398,"title":"字符相同的最短子字符串 I","title_slug":"smallest-substring-with-identical-characters-i","rating":2301.2455211629,"_hash":873695168,"paid_only":false},{"question_id":3399,"title":"字符相同的最短子字符串 II","title_slug":"smallest-substring-with-identical-characters-ii","rating":2375.9062896615,"_hash":2747174667,"paid_only":false}],"company":{}},{"contest":{"id":1133,"title":"第 146 场双周赛","title_slug":"biweekly-contest-146","start_time":1734791400,"is_ee_exam_contest":null},"questions":[{"question_id":3392,"title":"统计符合条件长度为 3 的子数组数目","title_slug":"count-subarrays-of-length-three-with-a-condition","rating":1200.6837984436,"_hash":2705181774,"paid_only":false},{"question_id":3393,"title":"统计异或值为给定值的路径数目","title_slug":"count-paths-with-the-given-xor-value","rating":1573.0069130568,"_hash":435953898,"paid_only":false},{"question_id":3394,"title":"判断网格图能否被切割成块","title_slug":"check-if-grid-can-be-cut-into-sections","rating":1916.1432350156,"_hash":2878429250,"paid_only":false},{"question_id":3395,"title":"唯一中间众数子序列 I","title_slug":"subsequences-with-a-unique-middle-mode-i","rating":2799.5363565342,"_hash":463325834,"paid_only":false}],"company":{}},{"contest":{"id":1134,"title":"第 428 场周赛","title_slug":"weekly-contest-428","start_time":1734229800,"is_ee_exam_contest":null},"questions":[{"question_id":3386,"title":"按下时间最长的按钮","title_slug":"button-with-longest-push-time","rating":1255.5192903192,"_hash":3954889728,"paid_only":false},{"question_id":3387,"title":"两天自由外汇交易后的最大货币数","title_slug":"maximize-amount-after-two-days-of-conversions","rating":1787.5923894417,"_hash":2631293312,"paid_only":false},{"question_id":3388,"title":"统计数组中的美丽分割","title_slug":"count-beautiful-splits-in-an-array","rating":2364.6818184488,"_hash":3183500752,"paid_only":false},{"question_id":3389,"title":"使字符频率相等的最少操作次数","title_slug":"minimum-operations-to-make-character-frequencies-equal","rating":2940.1641355626,"_hash":3386988607,"paid_only":false}],"company":{}},{"contest":{"id":1130,"title":"第 427 场周赛","title_slug":"weekly-contest-427","start_time":1733625000,"is_ee_exam_contest":null},"questions":[{"question_id":3379,"title":"转换数组","title_slug":"transformed-array","rating":1256.5677464981,"_hash":2279929782,"paid_only":false},{"question_id":3380,"title":"用点构造面积最大的矩形 I","title_slug":"maximum-area-rectangle-with-point-constraints-i","rating":1743.1262455202,"_hash":2942541212,"paid_only":false},{"question_id":3381,"title":"长度可被 K 整除的子数组的最大元素和","title_slug":"maximum-subarray-sum-with-length-divisible-by-k","rating":1943.095489145,"_hash":3205841609,"paid_only":false},{"question_id":3382,"title":"用点构造面积最大的矩形 II","title_slug":"maximum-area-rectangle-with-point-constraints-ii","rating":2722.8634460016,"_hash":248621231,"paid_only":false}],"company":{}},{"contest":{"id":1127,"title":"第 145 场双周赛","title_slug":"biweekly-contest-145","start_time":1733581800,"is_ee_exam_contest":null},"questions":[{"question_id":3375,"title":"使数组的值全部为 K 的最少操作次数","title_slug":"minimum-operations-to-make-array-values-equal-to-k","rating":1382.8392346741,"_hash":503085937,"paid_only":false},{"question_id":3376,"title":"破解锁的最少时间 I","title_slug":"minimum-time-to-break-locks-i","rating":1793.2112436729,"_hash":4106580850,"paid_only":false},{"question_id":3377,"title":"使两个整数相等的数位操作","title_slug":"digit-operations-to-make-two-integers-equal","rating":2186.3802199168,"_hash":2017163784,"paid_only":false},{"question_id":3378,"title":"统计最小公倍数图中的连通块数目","title_slug":"count-connected-components-in-lcm-graph","rating":2532.0192714689,"_hash":3697748387,"paid_only":false}],"company":{}},{"contest":{"id":1128,"title":"第 426 场周赛","title_slug":"weekly-contest-426","start_time":1733020200,"is_ee_exam_contest":null},"questions":[{"question_id":3370,"title":"仅含置位位的最小整数","title_slug":"smallest-number-with-all-set-bits","rating":1198.5574489527,"_hash":1624103581,"paid_only":false},{"question_id":3371,"title":"识别数组中的最大异常值","title_slug":"identify-the-largest-outlier-in-an-array","rating":1643.7450467383,"_hash":3911016235,"paid_only":false},{"question_id":3372,"title":"连接两棵树后最大目标节点数目 I","title_slug":"maximize-the-number-of-target-nodes-after-connecting-trees-i","rating":1926.7598451706,"_hash":1624720421,"paid_only":false},{"question_id":3373,"title":"连接两棵树后最大目标节点数目 II","title_slug":"maximize-the-number-of-target-nodes-after-connecting-trees-ii","rating":2161.6248796745,"_hash":3202384804,"paid_only":false}],"company":{}},{"contest":{"id":1123,"title":"第 425 场周赛","title_slug":"weekly-contest-425","start_time":1732415400,"is_ee_exam_contest":null},"questions":[{"question_id":3364,"title":"最小正和子数组","title_slug":"minimum-positive-sum-subarray","rating":1300.5576941005,"_hash":2691919813,"paid_only":false},{"question_id":3365,"title":"重排子字符串以形成目标字符串","title_slug":"rearrange-k-substrings-to-form-target-string","rating":1513.5126466994,"_hash":3237466584,"paid_only":false},{"question_id":3366,"title":"最小数组和","title_slug":"minimum-array-sum","rating":2040.219381217,"_hash":1959369889,"paid_only":false},{"question_id":3367,"title":"移除边之后的权重最大和","title_slug":"maximize-sum-of-weights-after-edge-removals","rating":2601.7404336762,"_hash":3582633550,"paid_only":false}],"company":{}},{"contest":{"id":1120,"title":"第 144 场双周赛","title_slug":"biweekly-contest-144","start_time":1732372200,"is_ee_exam_contest":null},"questions":[{"question_id":3360,"title":"移除石头游戏","title_slug":"stone-removal-game","rating":1267.4622869026,"_hash":3311542692,"paid_only":false},{"question_id":3361,"title":"两个字符串的切换距离","title_slug":"shift-distance-between-two-strings","rating":1553.2232121523,"_hash":682789828,"paid_only":false},{"question_id":3362,"title":"零数组变换 III","title_slug":"zero-array-transformation-iii","rating":2423.8553548566,"_hash":2187678883,"paid_only":false},{"question_id":3363,"title":"最多可收集的水果数目","title_slug":"find-the-maximum-number-of-fruits-collected","rating":2404.2535453982,"_hash":2217156371,"paid_only":false}],"company":{}},{"contest":{"id":1121,"title":"第 424 场周赛","title_slug":"weekly-contest-424","start_time":1731810600,"is_ee_exam_contest":null},"questions":[{"question_id":3354,"title":"使数组元素等于零","title_slug":"make-array-elements-equal-to-zero","rating":1397.2898626243,"_hash":2953959029,"paid_only":false},{"question_id":3355,"title":"零数组变换 I","title_slug":"zero-array-transformation-i","rating":1591.445677589,"_hash":2242408609,"paid_only":false},{"question_id":3356,"title":"零数组变换 II","title_slug":"zero-array-transformation-ii","rating":1913.4834168162,"_hash":808028888,"paid_only":false},{"question_id":3357,"title":"最小化相邻元素的最大差值","title_slug":"minimize-the-maximum-adjacent-element-difference","rating":3077.2342981036,"_hash":3046553948,"paid_only":false}],"company":{}},{"contest":{"id":1117,"title":"第 423 场周赛","title_slug":"weekly-contest-423","start_time":1731205800,"is_ee_exam_contest":null},"questions":[{"question_id":3349,"title":"检测相邻递增子数组 I","title_slug":"adjacent-increasing-subarrays-detection-i","rating":1298.9260674713,"_hash":481195548,"paid_only":false},{"question_id":3350,"title":"检测相邻递增子数组 II","title_slug":"adjacent-increasing-subarrays-detection-ii","rating":1600.0334724549,"_hash":2611247663,"paid_only":false},{"question_id":3351,"title":"好子序列的元素之和","title_slug":"sum-of-good-subsequences","rating":2085.8172663766,"_hash":3550480443,"paid_only":false},{"question_id":3352,"title":"统计小于 N 的 K 可约简整数","title_slug":"count-k-reducible-numbers-less-than-n","rating":2450.5982290839,"_hash":1326660276,"paid_only":false}],"company":{}},{"contest":{"id":1112,"title":"第 143 场双周赛","title_slug":"biweekly-contest-143","start_time":1731162600,"is_ee_exam_contest":null},"questions":[{"question_id":3345,"title":"最小可整除数位乘积 I","title_slug":"smallest-divisible-digit-product-i","rating":1235.1249313742,"_hash":2551573550,"paid_only":false},{"question_id":3346,"title":"执行操作后元素的最高频率 I","title_slug":"maximum-frequency-of-an-element-after-performing-operations-i","rating":1864.9340894153,"_hash":5481425,"paid_only":false},{"question_id":3347,"title":"执行操作后元素的最高频率 II","title_slug":"maximum-frequency-of-an-element-after-performing-operations-ii","rating":2155.599241516,"_hash":1001044648,"paid_only":false},{"question_id":3348,"title":"最小可整除数位乘积 II","title_slug":"smallest-divisible-digit-product-ii","rating":3101.4829146106,"_hash":2978149317,"paid_only":false}],"company":{}},{"contest":{"id":1113,"title":"第 422 场周赛","title_slug":"weekly-contest-422","start_time":1730601000,"is_ee_exam_contest":null},"questions":[{"question_id":3340,"title":"检查平衡字符串","title_slug":"check-balanced-string","rating":1190.6856174464,"_hash":51404240,"paid_only":false},{"question_id":3341,"title":"到达最后一个房间的最少时间 I","title_slug":"find-minimum-time-to-reach-last-room-i","rating":1721.4793821913,"_hash":2206919454,"paid_only":false},{"question_id":3342,"title":"到达最后一个房间的最少时间 II","title_slug":"find-minimum-time-to-reach-last-room-ii","rating":1861.7421056879,"_hash":2326834261,"paid_only":false},{"question_id":3343,"title":"统计平衡排列的数目","title_slug":"count-number-of-balanced-permutations","rating":2614.911779573,"_hash":1424761559,"paid_only":false}],"company":{}},{"contest":{"id":1109,"title":"第 421 场周赛","title_slug":"weekly-contest-421","start_time":1729996200,"is_ee_exam_contest":null},"questions":[{"question_id":3334,"title":"数组的最大因子得分","title_slug":"find-the-maximum-factor-score-of-array","rating":1518.7783368146,"_hash":1446453156,"paid_only":false},{"question_id":3335,"title":"字符串转换后的长度 I","title_slug":"total-characters-in-string-after-transformations-i","rating":1806.1438396853,"_hash":572380060,"paid_only":false},{"question_id":3336,"title":"最大公约数相等的子序列数量","title_slug":"find-the-number-of-subsequences-with-equal-gcd","rating":2402.5406421988,"_hash":1666325640,"paid_only":false},{"question_id":3337,"title":"字符串转换后的长度 II","title_slug":"total-characters-in-string-after-transformations-ii","rating":2411.8113388167,"_hash":2851383983,"paid_only":false}],"company":{}},{"contest":{"id":1106,"title":"第 142 场双周赛","title_slug":"biweekly-contest-142","start_time":1729953000,"is_ee_exam_contest":null},"questions":[{"question_id":3330,"title":"找到初始输入字符串 I","title_slug":"find-the-original-typed-string-i","rating":1338.2680180575,"_hash":3298301147,"paid_only":false},{"question_id":3331,"title":"修改后子树的大小","title_slug":"find-subtree-sizes-after-changes","rating":2045.9921455749,"_hash":1220911265,"paid_only":false},{"question_id":3332,"title":"旅客可以得到的最多点数","title_slug":"maximum-points-tourist-can-earn","rating":1827.6996661361,"_hash":3498655740,"paid_only":false},{"question_id":3333,"title":"找到初始输入字符串 II","title_slug":"find-the-original-typed-string-ii","rating":2628.6330409039,"_hash":761828406,"paid_only":false}],"company":{}},{"contest":{"id":1107,"title":"第 420 场周赛","title_slug":"weekly-contest-420","start_time":1729391400,"is_ee_exam_contest":null},"questions":[{"question_id":3324,"title":"出现在屏幕上的字符串序列","title_slug":"find-the-sequence-of-strings-appeared-on-the-screen","rating":1293.5035781966,"_hash":861684021,"paid_only":false},{"question_id":3325,"title":"字符至少出现 K 次的子字符串 I","title_slug":"count-substrings-with-k-frequency-characters-i","rating":1454.5936466211,"_hash":4203841846,"paid_only":false},{"question_id":3326,"title":"使数组非递减的最少除法操作次数","title_slug":"minimum-division-operations-to-make-array-non-decreasing","rating":1864.4526192193,"_hash":4094909033,"paid_only":false},{"question_id":3327,"title":"判断 DFS 字符串是否是回文串","title_slug":"check-if-dfs-strings-are-palindromes","rating":2454.1900261902,"_hash":2143004010,"paid_only":false}],"company":{}},{"contest":{"id":1103,"title":"第 419 场周赛","title_slug":"weekly-contest-419","start_time":1728786600,"is_ee_exam_contest":null},"questions":[{"question_id":3318,"title":"计算子数组的 x-sum I","title_slug":"find-x-sum-of-all-k-long-subarrays-i","rating":1457.5078616972,"_hash":2871847619,"paid_only":false},{"question_id":3319,"title":"第 K 大的完美二叉子树的大小","title_slug":"k-th-largest-perfect-subtree-size-in-binary-tree","rating":1603.252304506,"_hash":2518305336,"paid_only":false},{"question_id":3320,"title":"统计能获胜的出招序列数","title_slug":"count-the-number-of-winning-sequences","rating":2153.126336475,"_hash":421154156,"paid_only":false},{"question_id":3321,"title":"计算子数组的 x-sum II","title_slug":"find-x-sum-of-all-k-long-subarrays-ii","rating":2598.4563109814,"_hash":565537182,"paid_only":false}],"company":{}},{"contest":{"id":1099,"title":"第 141 场双周赛","title_slug":"biweekly-contest-141","start_time":1728743400,"is_ee_exam_contest":null},"questions":[{"question_id":3314,"title":"构造最小位运算数组 I","title_slug":"construct-the-minimum-bitwise-array-i","rating":1378.7136417759,"_hash":2778009161,"paid_only":false},{"question_id":3315,"title":"构造最小位运算数组 II","title_slug":"construct-the-minimum-bitwise-array-ii","rating":1714.7182832168,"_hash":3383049312,"paid_only":false},{"question_id":3316,"title":"从原字符串里进行删除操作的最多次数","title_slug":"find-maximum-removals-from-source-string","rating":2062.2592219188,"_hash":204096400,"paid_only":false},{"question_id":3317,"title":"安排活动的方案数","title_slug":"find-the-number-of-possible-ways-for-an-event","rating":2413.5302827563,"_hash":2475042726,"paid_only":false}],"company":{}},{"contest":{"id":1100,"title":"第 418 场周赛","title_slug":"weekly-contest-418","start_time":1728181800,"is_ee_exam_contest":null},"questions":[{"question_id":3309,"title":"连接二进制表示可形成的最大数值","title_slug":"maximum-possible-number-by-binary-concatenation","rating":1363.7443380057,"_hash":1214838150,"paid_only":false},{"question_id":3310,"title":"移除可疑的方法","title_slug":"remove-methods-from-project","rating":1710.5210499321,"_hash":3882331297,"paid_only":false},{"question_id":3311,"title":"构造符合图结构的二维矩阵","title_slug":"construct-2d-grid-matching-graph-layout","rating":2664.2117701776,"_hash":1612588856,"paid_only":false},{"question_id":3312,"title":"查询排序后的最大公约数","title_slug":"sorted-gcd-pair-queries","rating":2532.6258688719,"_hash":1397267615,"paid_only":false}],"company":{}},{"contest":{"id":1096,"title":"第 417 场周赛","title_slug":"weekly-contest-417","start_time":1727577000,"is_ee_exam_contest":null},"questions":[{"question_id":3304,"title":"找出第 K 个字符 I","title_slug":"find-the-k-th-character-in-string-game-i","rating":1288.7807259285,"_hash":1320300270,"paid_only":false},{"question_id":3305,"title":"元音辅音字符串计数 I","title_slug":"count-of-substrings-containing-every-vowel-and-k-consonants-i","rating":1563.6891989425,"_hash":2959731361,"paid_only":false},{"question_id":3306,"title":"元音辅音字符串计数 II","title_slug":"count-of-substrings-containing-every-vowel-and-k-consonants-ii","rating":2200.2757106638,"_hash":2126289112,"paid_only":false},{"question_id":3307,"title":"找出第 K 个字符 II","title_slug":"find-the-k-th-character-in-string-game-ii","rating":2232.067965725,"_hash":1769946757,"paid_only":false}],"company":{}},{"contest":{"id":1093,"title":"第 140 场双周赛","title_slug":"biweekly-contest-140","start_time":1727533800,"is_ee_exam_contest":null},"questions":[{"question_id":3300,"title":"替换为数位和以后的最小元素","title_slug":"minimum-element-after-replacement-with-digit-sum","rating":1181.1856499253,"_hash":1619056017,"paid_only":false},{"question_id":3301,"title":"高度互不相同的最大塔高和","title_slug":"maximize-the-total-height-of-unique-towers","rating":1448.2251797153,"_hash":621830233,"paid_only":false},{"question_id":3302,"title":"字典序最小的合法序列","title_slug":"find-the-lexicographically-smallest-valid-sequence","rating":2473.6778280303,"_hash":1226463396,"paid_only":false},{"question_id":3303,"title":"第一个几乎相等子字符串的下标","title_slug":"find-the-occurrence-of-first-almost-equal-substring","rating":2509.3686325754,"_hash":290020167,"paid_only":false}],"company":{}},{"contest":{"id":1094,"title":"第 416 场周赛","title_slug":"weekly-contest-416","start_time":1726972200,"is_ee_exam_contest":null},"questions":[{"question_id":3295,"title":"举报垃圾信息","title_slug":"report-spam-message","rating":1198.9144299059,"_hash":2343991669,"paid_only":false},{"question_id":3296,"title":"移山所需的最少秒数","title_slug":"minimum-number-of-seconds-to-make-mountain-height-zero","rating":1694.7320914942,"_hash":1443356361,"paid_only":false},{"question_id":3297,"title":"统计重新排列后包含另一个字符串的子字符串数目 I","title_slug":"count-substrings-that-can-be-rearranged-to-contain-a-string-i","rating":1847.3433772442,"_hash":1208663611,"paid_only":false},{"question_id":3298,"title":"统计重新排列后包含另一个字符串的子字符串数目 II","title_slug":"count-substrings-that-can-be-rearranged-to-contain-a-string-ii","rating":1909.4931160071,"_hash":3135871766,"paid_only":false}],"company":{}},{"contest":{"id":1090,"title":"第 415 场周赛","title_slug":"weekly-contest-415","start_time":1726367400,"is_ee_exam_contest":null},"questions":[{"question_id":3289,"title":"数字小镇中的捣蛋鬼","title_slug":"the-two-sneaky-numbers-of-digitville","rating":1163.7681706816,"_hash":3664046692,"paid_only":false},{"question_id":3290,"title":"最高乘法得分","title_slug":"maximum-multiplication-score","rating":1692.2074174336,"_hash":1497131225,"paid_only":false},{"question_id":3291,"title":"形成目标字符串需要的最少字符串数 I","title_slug":"minimum-number-of-valid-strings-to-form-target-i","rating":2081.7120215224,"_hash":3863168480,"paid_only":false},{"question_id":3292,"title":"形成目标字符串需要的最少字符串数 II","title_slug":"minimum-number-of-valid-strings-to-form-target-ii","rating":2661.736901362,"_hash":82212523,"paid_only":false}],"company":{}},{"contest":{"id":1087,"title":"第 139 场双周赛","title_slug":"biweekly-contest-139","start_time":1726324200,"is_ee_exam_contest":null},"questions":[{"question_id":3285,"title":"找到稳定山的下标","title_slug":"find-indices-of-stable-mountains","rating":1166.1536951597,"_hash":984992569,"paid_only":false},{"question_id":3286,"title":"穿越网格图的安全路径","title_slug":"find-a-safe-walk-through-a-grid","rating":1607.8207466026,"_hash":1681188465,"paid_only":false},{"question_id":3287,"title":"求出数组中最大序列值","title_slug":"find-the-maximum-sequence-value-of-array","rating":2545.108406046,"_hash":3171415635,"paid_only":false},{"question_id":3288,"title":"最长上升路径的长度","title_slug":"length-of-the-longest-increasing-path","rating":2449.5767504741,"_hash":3561910576,"paid_only":false}],"company":{}},{"contest":{"id":1088,"title":"第 414 场周赛","title_slug":"weekly-contest-414","start_time":1725762600,"is_ee_exam_contest":null},"questions":[{"question_id":3280,"title":"将日期转换为二进制表示","title_slug":"convert-date-to-binary","rating":1205.6588098967,"_hash":3144364071,"paid_only":false},{"question_id":3281,"title":"范围内整数的最大得分","title_slug":"maximize-score-of-numbers-in-ranges","rating":1768.0010478389,"_hash":774656328,"paid_only":false},{"question_id":3282,"title":"到达数组末尾的最大得分","title_slug":"reach-end-of-array-with-max-score","rating":1771.7317932329,"_hash":1672605445,"paid_only":false},{"question_id":3283,"title":"吃掉所有兵需要的最多移动次数","title_slug":"maximum-number-of-moves-to-kill-all-pawns","rating":2473.2589317118,"_hash":3621430231,"paid_only":false}],"company":{}},{"contest":{"id":1084,"title":"第 413 场周赛","title_slug":"weekly-contest-413","start_time":1725157800,"is_ee_exam_contest":null},"questions":[{"question_id":3274,"title":"检查棋盘方格颜色是否相同","title_slug":"check-if-two-chessboard-squares-have-the-same-color","rating":1162.3856045908,"_hash":299641734,"paid_only":false},{"question_id":3275,"title":"第 K 近障碍物查询","title_slug":"k-th-nearest-obstacle-queries","rating":1419.6326908404,"_hash":580668681,"paid_only":false},{"question_id":3276,"title":"选择矩阵中单元格的最大得分","title_slug":"select-cells-in-grid-with-maximum-score","rating":2402.6213260468,"_hash":4232240065,"paid_only":false},{"question_id":3277,"title":"查询子数组最大异或值","title_slug":"maximum-xor-score-subarray-queries","rating":2692.6778614397,"_hash":1228344675,"paid_only":false}],"company":{}},{"contest":{"id":1081,"title":"第 138 场双周赛","title_slug":"biweekly-contest-138","start_time":1725114600,"is_ee_exam_contest":null},"questions":[{"question_id":3270,"title":"求出数字答案","title_slug":"find-the-key-of-the-numbers","rating":1205.202753772,"_hash":3072211417,"paid_only":false},{"question_id":3271,"title":"哈希分割字符串","title_slug":"hash-divided-string","rating":1292.7322849355,"_hash":531296651,"paid_only":false},{"question_id":3272,"title":"统计好整数的数目","title_slug":"find-the-count-of-good-integers","rating":2382.24900347,"_hash":891188438,"paid_only":false},{"question_id":3273,"title":"对 Bob 造成的最少伤害","title_slug":"minimum-amount-of-damage-dealt-to-bob","rating":2012.8694334235,"_hash":673976991,"paid_only":false}],"company":{}},{"contest":{"id":1082,"title":"第 412 场周赛","title_slug":"weekly-contest-412","start_time":1724553000,"is_ee_exam_contest":null},"questions":[{"question_id":3264,"title":"K 次乘运算后的最终数组 I","title_slug":"final-array-state-after-k-multiplication-operations-i","rating":1177.5447304844,"_hash":1122648320,"paid_only":false},{"question_id":3265,"title":"统计近似相等数对 I","title_slug":"count-almost-equal-pairs-i","rating":1661.0318170415,"_hash":1511177670,"paid_only":false},{"question_id":3266,"title":"K 次乘运算后的最终数组 II","title_slug":"final-array-state-after-k-multiplication-operations-ii","rating":2508.6766880695,"_hash":3217356875,"paid_only":false},{"question_id":3267,"title":"统计近似相等数对 II","title_slug":"count-almost-equal-pairs-ii","rating":2545.1080433595,"_hash":2055248509,"paid_only":false}],"company":{}},{"contest":{"id":1077,"title":"第 411 场周赛","title_slug":"weekly-contest-411","start_time":1723948200,"is_ee_exam_contest":null},"questions":[{"question_id":3258,"title":"统计满足 K 约束的子字符串数量 I","title_slug":"count-substrings-that-satisfy-k-constraint-i","rating":1258.2038096998,"_hash":2472583707,"paid_only":false},{"question_id":3259,"title":"超级饮料的最大强化能量","title_slug":"maximum-energy-boost-from-two-drinks","rating":1483.544502742,"_hash":798880070,"paid_only":false},{"question_id":3260,"title":"找出最大的 N 位 K 回文数","title_slug":"find-the-largest-palindrome-divisible-by-k","rating":2370.3848537389,"_hash":2655301597,"paid_only":false},{"question_id":3261,"title":"统计满足 K 约束的子字符串数量 II","title_slug":"count-substrings-that-satisfy-k-constraint-ii","rating":2658.9223715182,"_hash":1931458934,"paid_only":false}],"company":{}},{"contest":{"id":1074,"title":"第 137 场双周赛","title_slug":"biweekly-contest-137","start_time":1723905000,"is_ee_exam_contest":null},"questions":[{"question_id":3254,"title":"长度为 K 的子数组的能量值 I","title_slug":"find-the-power-of-k-size-subarrays-i","rating":1266.5261210323,"_hash":66259183,"paid_only":false},{"question_id":3255,"title":"长度为 K 的子数组的能量值 II","title_slug":"find-the-power-of-k-size-subarrays-ii","rating":1595.0583171953,"_hash":3180751602,"paid_only":false},{"question_id":3256,"title":"放三个车的价值之和最大 I","title_slug":"maximum-value-sum-by-placing-three-rooks-i","rating":2262.2295067249,"_hash":3255865490,"paid_only":false},{"question_id":3257,"title":"放三个车的价值之和最大 II","title_slug":"maximum-value-sum-by-placing-three-rooks-ii","rating":2553.2367142614,"_hash":2064923425,"paid_only":false}],"company":{}},{"contest":{"id":1075,"title":"第 410 场周赛","title_slug":"weekly-contest-410","start_time":1723343400,"is_ee_exam_contest":null},"questions":[{"question_id":3248,"title":"矩阵中的蛇","title_slug":"snake-in-matrix","rating":1171.7635387886,"_hash":1030440153,"paid_only":false},{"question_id":3249,"title":"统计好节点的数目","title_slug":"count-the-number-of-good-nodes","rating":1565.8040286471,"_hash":3924272496,"paid_only":false},{"question_id":3250,"title":"单调数组对的数目 I","title_slug":"find-the-count-of-monotonic-pairs-i","rating":1897.7992384398,"_hash":2509368835,"paid_only":false},{"question_id":3251,"title":"单调数组对的数目 II","title_slug":"find-the-count-of-monotonic-pairs-ii","rating":2323.1267940801,"_hash":3736752350,"paid_only":false}],"company":{}},{"contest":{"id":1071,"title":"第 409 场周赛","title_slug":"weekly-contest-409","start_time":1722738600,"is_ee_exam_contest":null},"questions":[{"question_id":3242,"title":"设计相邻元素求和服务","title_slug":"design-neighbor-sum-service","rating":1334.3626351798,"_hash":1023373760,"paid_only":false},{"question_id":3243,"title":"新增道路查询后的最短距离 I","title_slug":"shortest-distance-after-road-addition-queries-i","rating":1567.8396535313,"_hash":1246884577,"paid_only":false},{"question_id":3244,"title":"新增道路查询后的最短距离 II","title_slug":"shortest-distance-after-road-addition-queries-ii","rating":2270.2002503611,"_hash":2264976408,"paid_only":false},{"question_id":3245,"title":"交替组 III","title_slug":"alternating-groups-iii","rating":3112.0402038423,"_hash":712041817,"paid_only":false}],"company":{}},{"contest":{"id":1068,"title":"第 136 场双周赛","title_slug":"biweekly-contest-136","start_time":1722695400,"is_ee_exam_contest":null},"questions":[{"question_id":3238,"title":"求出胜利玩家的数目","title_slug":"find-the-number-of-winning-players","rating":1285.0458261992,"_hash":1478713962,"paid_only":false},{"question_id":3239,"title":"最少翻转次数使二进制矩阵回文 I","title_slug":"minimum-number-of-flips-to-make-binary-grid-palindromic-i","rating":1387.9091459557,"_hash":3402727043,"paid_only":false},{"question_id":3240,"title":"最少翻转次数使二进制矩阵回文 II","title_slug":"minimum-number-of-flips-to-make-binary-grid-palindromic-ii","rating":2080.068446463,"_hash":835373662,"paid_only":false},{"question_id":3241,"title":"标记所有节点需要的时间","title_slug":"time-taken-to-mark-all-nodes","rating":2521.5876597895,"_hash":2860397652,"paid_only":false}],"company":{}},{"contest":{"id":1069,"title":"第 408 场周赛","title_slug":"weekly-contest-408","start_time":1722133800,"is_ee_exam_contest":null},"questions":[{"question_id":3232,"title":"判断是否可以赢得数字游戏","title_slug":"find-if-digit-game-can-be-won","rating":1163.3636455472,"_hash":2314150455,"paid_only":false},{"question_id":3233,"title":"统计不是特殊数字的数字数量","title_slug":"find-the-count-of-numbers-which-are-not-special","rating":1509.4385872781,"_hash":4142042258,"paid_only":false},{"question_id":3234,"title":"统计 1 显著的字符串的数量","title_slug":"count-the-number-of-substrings-with-dominant-ones","rating":2556.9955924939,"_hash":252415095,"paid_only":false},{"question_id":3235,"title":"判断矩形的两个角落是否可达","title_slug":"check-if-the-rectangle-corner-is-reachable","rating":3773.7596150919,"_hash":3943360384,"paid_only":false}],"company":{}},{"contest":{"id":1064,"title":"第 407 场周赛","title_slug":"weekly-contest-407","start_time":1721529000,"is_ee_exam_contest":null},"questions":[{"question_id":3226,"title":"使两个整数相等的位更改次数","title_slug":"number-of-bit-changes-to-make-two-integers-equal","rating":1247.3575940876,"_hash":3953684893,"paid_only":false},{"question_id":3227,"title":"字符串元音游戏","title_slug":"vowels-game-in-a-string","rating":1451.8103068349,"_hash":3947360912,"paid_only":false},{"question_id":3228,"title":"将 1 移动到末尾的最大操作次数","title_slug":"maximum-number-of-operations-to-move-ones-to-the-end","rating":1593.301573479,"_hash":104127764,"paid_only":false},{"question_id":3229,"title":"使数组等于目标数组所需的最少操作次数","title_slug":"minimum-operations-to-make-array-equal-to-target","rating":2066.5575759467,"_hash":690663974,"paid_only":false}],"company":{}},{"contest":{"id":1061,"title":"第 135 场双周赛","title_slug":"biweekly-contest-135","start_time":1721485800,"is_ee_exam_contest":null},"questions":[{"question_id":3222,"title":"求出硬币游戏的赢家","title_slug":"find-the-winning-player-in-coin-game","rating":1269.9581395809,"_hash":2114435640,"paid_only":false},{"question_id":3223,"title":"操作后字符串的最短长度","title_slug":"minimum-length-of-string-after-operations","rating":1445.1047404573,"_hash":3028585234,"paid_only":false},{"question_id":3224,"title":"使差值相等的最少数组改动次数","title_slug":"minimum-array-changes-to-make-differences-equal","rating":1996.0986736442,"_hash":2533391392,"paid_only":false},{"question_id":3225,"title":"网格图操作后的最大分数","title_slug":"maximum-score-from-grid-operations","rating":3027.8558407399,"_hash":3772552769,"paid_only":false}],"company":{}},{"contest":{"id":1062,"title":"第 406 场周赛","title_slug":"weekly-contest-406","start_time":1720924200,"is_ee_exam_contest":null},"questions":[{"question_id":3216,"title":"交换后字典序最小的字符串","title_slug":"lexicographically-smallest-string-after-a-swap","rating":1242.8232032062,"_hash":1888341714,"paid_only":false},{"question_id":3217,"title":"从链表中移除在数组中存在的节点","title_slug":"delete-nodes-from-linked-list-present-in-array","rating":1341.7231008143,"_hash":2772213506,"paid_only":false},{"question_id":3218,"title":"切蛋糕的最小总开销 I","title_slug":"minimum-cost-for-cutting-cake-i","rating":1654.4744489884,"_hash":80248261,"paid_only":false},{"question_id":3219,"title":"切蛋糕的最小总开销 II","title_slug":"minimum-cost-for-cutting-cake-ii","rating":1789.3681547685,"_hash":865981892,"paid_only":false}],"company":{}},{"contest":{"id":1058,"title":"第 405 场周赛","title_slug":"weekly-contest-405","start_time":1720319400,"is_ee_exam_contest":null},"questions":[{"question_id":3210,"title":"找出加密后的字符串","title_slug":"find-the-encrypted-string","rating":1179.1610012133,"_hash":4187317885,"paid_only":false},{"question_id":3211,"title":"生成不含相邻零的二进制字符串","title_slug":"generate-binary-strings-without-adjacent-zeros","rating":1352.5455214631,"_hash":2183639073,"paid_only":false},{"question_id":3212,"title":"统计 X 和 Y 频数相等的子矩阵数量","title_slug":"count-submatrices-with-equal-frequency-of-x-and-y","rating":1672.7732068421,"_hash":1724760277,"paid_only":false},{"question_id":3213,"title":"最小代价构造字符串","title_slug":"construct-string-with-minimum-cost","rating":2170.7313528632,"_hash":1422256680,"paid_only":false}],"company":{}},{"contest":{"id":1055,"title":"第 134 场双周赛","title_slug":"biweekly-contest-134","start_time":1720276200,"is_ee_exam_contest":null},"questions":[{"question_id":3206,"title":"交替组 I","title_slug":"alternating-groups-i","rating":1223.7257942998,"_hash":1228962791,"paid_only":false},{"question_id":3207,"title":"与敌人战斗后的最大分数","title_slug":"maximum-points-after-enemy-battles","rating":1591.3005653292,"_hash":981414139,"paid_only":false},{"question_id":3208,"title":"交替组 II","title_slug":"alternating-groups-ii","rating":1721.6759703215,"_hash":3733094538,"paid_only":false},{"question_id":3209,"title":"子数组按位与值为 K 的数目","title_slug":"number-of-subarrays-with-and-value-of-k","rating":2050.4096030445,"_hash":2805365424,"paid_only":false}],"company":{}},{"contest":{"id":1056,"title":"第 404 场周赛","title_slug":"weekly-contest-404","start_time":1719714600,"is_ee_exam_contest":null},"questions":[{"question_id":3200,"title":"三角形的最大高度","title_slug":"maximum-height-of-a-triangle","rating":1451.1091190361,"_hash":3021491132,"paid_only":false},{"question_id":3201,"title":"找出有效子序列的最大长度 I","title_slug":"find-the-maximum-length-of-valid-subsequence-i","rating":1663.7602365518,"_hash":1334276879,"paid_only":false},{"question_id":3202,"title":"找出有效子序列的最大长度 II","title_slug":"find-the-maximum-length-of-valid-subsequence-ii","rating":1973.9543553342,"_hash":2553981330,"paid_only":false},{"question_id":3203,"title":"合并两棵树后的最小直径","title_slug":"find-minimum-diameter-after-merging-two-trees","rating":2266.0997671519,"_hash":3867272115,"paid_only":false}],"company":{}},{"contest":{"id":1052,"title":"第 403 场周赛","title_slug":"weekly-contest-403","start_time":1719109800,"is_ee_exam_contest":null},"questions":[{"question_id":3194,"title":"最小元素和最大元素的最小平均值","title_slug":"minimum-average-of-smallest-and-largest-elements","rating":1194.6311789734,"_hash":665073746,"paid_only":false},{"question_id":3195,"title":"包含所有 1 的最小矩形面积 I","title_slug":"find-the-minimum-area-to-cover-all-ones-i","rating":1348.4963445871,"_hash":3703862287,"paid_only":false},{"question_id":3196,"title":"最大化子数组的总成本","title_slug":"maximize-total-cost-of-alternating-subarrays","rating":1846.7401375892,"_hash":2531548897,"paid_only":false},{"question_id":3197,"title":"包含所有 1 的最小矩形面积 II","title_slug":"find-the-minimum-area-to-cover-all-ones-ii","rating":2540.7699757179,"_hash":4014161042,"paid_only":false}],"company":{}},{"contest":{"id":1048,"title":"第 133 场双周赛","title_slug":"biweekly-contest-133","start_time":1719066600,"is_ee_exam_contest":null},"questions":[{"question_id":3190,"title":"使所有元素都可以被 3 整除的最少操作数","title_slug":"find-minimum-operations-to-make-all-elements-divisible-by-three","rating":1139.54127323,"_hash":3520038,"paid_only":false},{"question_id":3191,"title":"使二进制数组全部等于 1 的最少操作次数 I","title_slug":"minimum-operations-to-make-binary-array-elements-equal-to-one-i","rating":1311.979717243,"_hash":2020441423,"paid_only":false},{"question_id":3192,"title":"使二进制数组全部等于 1 的最少操作次数 II","title_slug":"minimum-operations-to-make-binary-array-elements-equal-to-one-ii","rating":1432.7805314078,"_hash":3126592210,"paid_only":false},{"question_id":3193,"title":"统计逆序对的数目","title_slug":"count-the-number-of-inversions","rating":2266.3248398876,"_hash":379207663,"paid_only":false}],"company":{}},{"contest":{"id":1049,"title":"第 402 场周赛","title_slug":"weekly-contest-402","start_time":1718505000,"is_ee_exam_contest":null},"questions":[{"question_id":3184,"title":"构成整天的下标对数目 I","title_slug":"count-pairs-that-form-a-complete-day-i","rating":1149.5496338421,"_hash":2292184298,"paid_only":false},{"question_id":3185,"title":"构成整天的下标对数目 II","title_slug":"count-pairs-that-form-a-complete-day-ii","rating":1385.2857255388,"_hash":2530077241,"paid_only":false},{"question_id":3186,"title":"施咒的最大总伤害","title_slug":"maximum-total-damage-with-spell-casting","rating":1840.513952935,"_hash":2275965484,"paid_only":false},{"question_id":3187,"title":"数组中的峰值","title_slug":"peaks-in-array","rating":2154.4458036869,"_hash":2731497205,"paid_only":false}],"company":{}},{"contest":{"id":1045,"title":"第 401 场周赛","title_slug":"weekly-contest-401","start_time":1717900200,"is_ee_exam_contest":null},"questions":[{"question_id":3178,"title":"找出 K 秒后拿着球的孩子","title_slug":"find-the-child-who-has-the-ball-after-k-seconds","rating":1255.54117313,"_hash":3798704818,"paid_only":false},{"question_id":3179,"title":"K 秒后第 N 个元素的值","title_slug":"find-the-n-th-value-after-k-seconds","rating":1369.0113807552,"_hash":2972995261,"paid_only":false},{"question_id":3180,"title":"执行操作可获得的最大总奖励 I","title_slug":"maximum-total-reward-using-operations-i","rating":1848.5480405143,"_hash":3173954782,"paid_only":false},{"question_id":3181,"title":"执行操作可获得的最大总奖励 II","title_slug":"maximum-total-reward-using-operations-ii","rating":2688.2456356434,"_hash":2273737749,"paid_only":false}],"company":{}},{"contest":{"id":1042,"title":"第 132 场双周赛","title_slug":"biweekly-contest-132","start_time":1717857000,"is_ee_exam_contest":null},"questions":[{"question_id":3174,"title":"清除数字","title_slug":"clear-digits","rating":1255.1762583835,"_hash":3259865655,"paid_only":false},{"question_id":3175,"title":"找到连续赢 K 场比赛的第一位玩家","title_slug":"find-the-first-player-to-win-k-games-in-a-row","rating":1488.4453801606,"_hash":3899194165,"paid_only":false},{"question_id":3176,"title":"求出最长好子序列 I","title_slug":"find-the-maximum-length-of-a-good-subsequence-i","rating":1849.0388401196,"_hash":2795532152,"paid_only":false},{"question_id":3177,"title":"求出最长好子序列 II","title_slug":"find-the-maximum-length-of-a-good-subsequence-ii","rating":2364.8208393306,"_hash":1603196867,"paid_only":false}],"company":{}},{"contest":{"id":1043,"title":"第 400 场周赛","title_slug":"weekly-contest-400","start_time":1717295400,"is_ee_exam_contest":null},"questions":[{"question_id":3168,"title":"候诊室中的最少椅子数","title_slug":"minimum-number-of-chairs-in-a-waiting-room","rating":1211.0565182538,"_hash":1981187092,"paid_only":false},{"question_id":3169,"title":"无需开会的工作日","title_slug":"count-days-without-meetings","rating":1483.48867803,"_hash":2274108214,"paid_only":false},{"question_id":3170,"title":"删除星号以后字典序最小的字符串","title_slug":"lexicographically-minimum-string-after-removing-stars","rating":1772.4702293335,"_hash":213498201,"paid_only":false},{"question_id":3436,"title":"找到按位与最接近 K 的子数组","title_slug":"find-subarray-with-bitwise-and-closest-to-k","rating":0,"_hash":3113891209,"paid_only":false}],"company":{}},{"contest":{"id":1038,"title":"第 399 场周赛","title_slug":"weekly-contest-399","start_time":1716690600,"is_ee_exam_contest":null},"questions":[{"question_id":3162,"title":"优质数对的总数 I","title_slug":"find-the-number-of-good-pairs-i","rating":1168.746288824,"_hash":3257848596,"paid_only":false},{"question_id":3163,"title":"压缩字符串 III","title_slug":"string-compression-iii","rating":1311.9656823665,"_hash":2743651519,"paid_only":false},{"question_id":3164,"title":"优质数对的总数 II","title_slug":"find-the-number-of-good-pairs-ii","rating":1777.2275836051,"_hash":750185927,"paid_only":false},{"question_id":3165,"title":"不包含相邻元素的子序列的最大和","title_slug":"maximum-sum-of-subsequence-with-non-adjacent-elements","rating":2697.6486586982,"_hash":1135309895,"paid_only":false}],"company":{}},{"contest":{"id":1035,"title":"第 131 场双周赛","title_slug":"biweekly-contest-131","start_time":1716647400,"is_ee_exam_contest":null},"questions":[{"question_id":3158,"title":"求出出现两次数字的 XOR 值","title_slug":"find-the-xor-of-numbers-which-appear-twice","rating":1172.0410939015,"_hash":1088716696,"paid_only":false},{"question_id":3159,"title":"查询数组中元素的出现位置","title_slug":"find-occurrences-of-an-element-in-an-array","rating":1262.9248376352,"_hash":3139027594,"paid_only":false},{"question_id":3160,"title":"所有球里面不同颜色的数目","title_slug":"find-the-number-of-distinct-colors-among-the-balls","rating":1517.259649092,"_hash":228423398,"paid_only":false},{"question_id":3161,"title":"物块放置查询","title_slug":"block-placement-queries","rating":2513.0284514744,"_hash":3170294025,"paid_only":false}],"company":{}},{"contest":{"id":1036,"title":"第 398 场周赛","title_slug":"weekly-contest-398","start_time":1716085800,"is_ee_exam_contest":null},"questions":[{"question_id":3151,"title":"特殊数组 I","title_slug":"special-array-i","rating":1152.9389808366,"_hash":3173198374,"paid_only":false},{"question_id":3152,"title":"特殊数组 II","title_slug":"special-array-ii","rating":1523.2643084719,"_hash":224107101,"paid_only":false},{"question_id":3153,"title":"所有数对中数位不同之和","title_slug":"sum-of-digit-differences-of-all-pairs","rating":1645.0308414414,"_hash":4026268957,"paid_only":false},{"question_id":3154,"title":"到达第 K 级台阶的方案数","title_slug":"find-number-of-ways-to-reach-the-k-th-stair","rating":2071.3282145398,"_hash":3900244772,"paid_only":false}],"company":{}},{"contest":{"id":1032,"title":"第 397 场周赛","title_slug":"weekly-contest-397","start_time":1715481000,"is_ee_exam_contest":null},"questions":[{"question_id":3146,"title":"两个字符串的排列差","title_slug":"permutation-difference-between-two-strings","rating":1152.4483983485,"_hash":2915418272,"paid_only":false},{"question_id":3147,"title":"从魔法师身上吸取的最大能量","title_slug":"taking-maximum-energy-from-the-mystic-dungeon","rating":1460.3224820858,"_hash":4269527719,"paid_only":false},{"question_id":3148,"title":"矩阵中的最大得分","title_slug":"maximum-difference-score-in-a-grid","rating":1819.6800324413,"_hash":117742897,"paid_only":false},{"question_id":3149,"title":"找出分数最低的排列","title_slug":"find-the-minimum-cost-array-permutation","rating":2641.6067035188,"_hash":2773816020,"paid_only":false}],"company":{}},{"contest":{"id":1029,"title":"第 130 场双周赛","title_slug":"biweekly-contest-130","start_time":1715437800,"is_ee_exam_contest":null},"questions":[{"question_id":3142,"title":"判断矩阵是否满足条件","title_slug":"check-if-grid-satisfies-conditions","rating":1303.0117274575,"_hash":3280306733,"paid_only":false},{"question_id":3143,"title":"正方形中的最多点数","title_slug":"maximum-points-inside-the-square","rating":1696.9464414997,"_hash":104229456,"paid_only":false},{"question_id":3144,"title":"分割字符频率相等的最少子字符串","title_slug":"minimum-substring-partition-of-equal-character-frequency","rating":1917.2052894619,"_hash":4140722548,"paid_only":false},{"question_id":3145,"title":"大数组元素的乘积","title_slug":"find-products-of-elements-of-big-array","rating":2859.2593177291,"_hash":2752410718,"paid_only":false}],"company":{}},{"contest":{"id":1030,"title":"第 396 场周赛","title_slug":"weekly-contest-396","start_time":1714876200,"is_ee_exam_contest":null},"questions":[{"question_id":3136,"title":"有效单词","title_slug":"valid-word","rating":1249.6592240732,"_hash":1347754524,"paid_only":false},{"question_id":3137,"title":"K 周期字符串需要的最少操作次数","title_slug":"minimum-number-of-operations-to-make-word-k-periodic","rating":1491.2092519226,"_hash":908754472,"paid_only":false},{"question_id":3138,"title":"同位字符串连接的最小长度","title_slug":"minimum-length-of-anagram-concatenation","rating":1979.493040606,"_hash":2333960573,"paid_only":false},{"question_id":3139,"title":"使数组中所有元素相等的最小开销","title_slug":"minimum-cost-to-equalize-array","rating":2666.1303987257,"_hash":2439538852,"paid_only":false}],"company":{}},{"contest":{"id":1026,"title":"第 395 场周赛","title_slug":"weekly-contest-395","start_time":1714271400,"is_ee_exam_contest":null},"questions":[{"question_id":3131,"title":"找出与数组相加的整数 I","title_slug":"find-the-integer-added-to-array-i","rating":1160.5949372306,"_hash":1589214264,"paid_only":false},{"question_id":3132,"title":"找出与数组相加的整数 II","title_slug":"find-the-integer-added-to-array-ii","rating":1620.1553565725,"_hash":1862185859,"paid_only":false},{"question_id":3133,"title":"数组最后一个元素的最小值","title_slug":"minimum-array-end","rating":1934.7806230835,"_hash":2969133931,"paid_only":false},{"question_id":3134,"title":"找出唯一性数组的中位数","title_slug":"find-the-median-of-the-uniqueness-array","rating":2451.1558771446,"_hash":1730741094,"paid_only":false}],"company":{}},{"contest":{"id":1023,"title":"第 129 场双周赛","title_slug":"biweekly-contest-129","start_time":1714228200,"is_ee_exam_contest":null},"questions":[{"question_id":3127,"title":"构造相同颜色的正方形","title_slug":"make-a-square-with-the-same-color","rating":1337.7302269037,"_hash":2963967463,"paid_only":false},{"question_id":3128,"title":"直角三角形","title_slug":"right-triangles","rating":1540.8447688369,"_hash":2835663805,"paid_only":false},{"question_id":3129,"title":"找出所有稳定的二进制数组 I","title_slug":"find-all-possible-stable-binary-arrays-i","rating":2200.1171591946,"_hash":2497475845,"paid_only":false},{"question_id":3130,"title":"找出所有稳定的二进制数组 II","title_slug":"find-all-possible-stable-binary-arrays-ii","rating":2824.7020346271,"_hash":3272399108,"paid_only":false}],"company":{}},{"contest":{"id":1024,"title":"第 394 场周赛","title_slug":"weekly-contest-394","start_time":1713666600,"is_ee_exam_contest":null},"questions":[{"question_id":3120,"title":"统计特殊字母的数量 I","title_slug":"count-the-number-of-special-characters-i","rating":1205.8589709613,"_hash":3814383801,"paid_only":false},{"question_id":3121,"title":"统计特殊字母的数量 II","title_slug":"count-the-number-of-special-characters-ii","rating":1411.6120545314,"_hash":3088050032,"paid_only":false},{"question_id":3122,"title":"使矩阵满足条件的最少操作次数","title_slug":"minimum-number-of-operations-to-satisfy-conditions","rating":1904.5020747926,"_hash":2577479947,"paid_only":false},{"question_id":3123,"title":"最短路径中的边","title_slug":"find-edges-in-shortest-paths","rating":2093.0316157073,"_hash":2194463865,"paid_only":false}],"company":{}},{"contest":{"id":1020,"title":"第 393 场周赛","title_slug":"weekly-contest-393","start_time":1713061800,"is_ee_exam_contest":null},"questions":[{"question_id":3114,"title":"替换字符可以得到的最晚时间","title_slug":"latest-time-you-can-obtain-after-replacing-characters","rating":1290.8522792868,"_hash":2938801707,"paid_only":false},{"question_id":3115,"title":"素数的最大距离","title_slug":"maximum-prime-difference","rating":1294.4633357092,"_hash":2320848921,"paid_only":false},{"question_id":3116,"title":"单面值组合的第 K 小金额","title_slug":"kth-smallest-amount-with-single-denomination-combination","rating":2387.9289198649,"_hash":1178346715,"paid_only":false},{"question_id":3117,"title":"划分数组得到最小的值之和","title_slug":"minimum-sum-of-values-by-dividing-array","rating":2735.0909781144,"_hash":3653596441,"paid_only":false}],"company":{}},{"contest":{"id":1017,"title":"第 128 场双周赛","title_slug":"biweekly-contest-128","start_time":1713018600,"is_ee_exam_contest":null},"questions":[{"question_id":3110,"title":"字符串的分数","title_slug":"score-of-a-string","rating":1152.2642983255,"_hash":3175813423,"paid_only":false},{"question_id":3111,"title":"覆盖所有点的最少矩形数目","title_slug":"minimum-rectangles-to-cover-points","rating":1401.2732392084,"_hash":703684528,"paid_only":false},{"question_id":3112,"title":"访问消失节点的最少时间","title_slug":"minimum-time-to-visit-disappearing-nodes","rating":1756.963553993,"_hash":4196899779,"paid_only":false},{"question_id":3113,"title":"边界元素是最大值的子数组数目","title_slug":"find-the-number-of-subarrays-where-boundary-elements-are-maximum","rating":2046.2618466463,"_hash":3593287294,"paid_only":false}],"company":{}},{"contest":{"id":1018,"title":"第 392 场周赛","title_slug":"weekly-contest-392","start_time":1712457000,"is_ee_exam_contest":null},"questions":[{"question_id":3105,"title":"最长的严格递增或递减子数组","title_slug":"longest-strictly-increasing-or-strictly-decreasing-subarray","rating":1217.0003384199,"_hash":4223638137,"paid_only":false},{"question_id":3106,"title":"满足距离约束且字典序最小的字符串","title_slug":"lexicographically-smallest-string-after-operations-with-constraint","rating":1515.4316202561,"_hash":1356002392,"paid_only":false},{"question_id":3107,"title":"使数组中位数等于 K 的最少操作数","title_slug":"minimum-operations-to-make-median-of-array-equal-to-k","rating":1604.9805572557,"_hash":2383892623,"paid_only":false},{"question_id":3108,"title":"带权图里旅途的最小代价","title_slug":"minimum-cost-walk-in-weighted-graph","rating":2108.5054318055,"_hash":4095235940,"paid_only":false}],"company":{}},{"contest":{"id":1014,"title":"第 391 场周赛","title_slug":"weekly-contest-391","start_time":1711852200,"is_ee_exam_contest":null},"questions":[{"question_id":3099,"title":"哈沙德数","title_slug":"harshad-number","rating":1100.5332505219,"_hash":1025735228,"paid_only":false},{"question_id":3100,"title":"换水问题 II","title_slug":"water-bottles-ii","rating":1366.2964979576,"_hash":2892466353,"paid_only":false},{"question_id":3101,"title":"交替子数组计数","title_slug":"count-alternating-subarrays","rating":1404.9707095328,"_hash":4293349857,"paid_only":false},{"question_id":3102,"title":"最小化曼哈顿距离","title_slug":"minimize-manhattan-distances","rating":2215.7283064325,"_hash":2447980941,"paid_only":false}],"company":{}},{"contest":{"id":1010,"title":"第 127 场双周赛","title_slug":"biweekly-contest-127","start_time":1711809000,"is_ee_exam_contest":null},"questions":[{"question_id":3095,"title":"或值至少 K 的最短子数组 I","title_slug":"shortest-subarray-with-or-at-least-k-i","rating":1368.6653311461,"_hash":2743345166,"paid_only":false},{"question_id":3096,"title":"得到更多分数的最少关卡数目","title_slug":"minimum-levels-to-gain-more-points","rating":1500.9381282198,"_hash":63406553,"paid_only":false},{"question_id":3097,"title":"或值至少为 K 的最短子数组 II","title_slug":"shortest-subarray-with-or-at-least-k-ii","rating":1891.4136735248,"_hash":3489595941,"paid_only":false},{"question_id":3098,"title":"求出所有子序列的能量和","title_slug":"find-the-sum-of-subsequence-powers","rating":2552.505777081,"_hash":3215925667,"paid_only":false}],"company":{}},{"contest":{"id":1011,"title":"第 390 场周赛","title_slug":"weekly-contest-390","start_time":1711247400,"is_ee_exam_contest":null},"questions":[{"question_id":3090,"title":"每个字符最多出现两次的最长子字符串","title_slug":"maximum-length-substring-with-two-occurrences","rating":1329.4732452623,"_hash":570536729,"paid_only":false},{"question_id":3091,"title":"执行操作使数据元素之和大于等于 K","title_slug":"apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k","rating":1521.7402232638,"_hash":3843809465,"paid_only":false},{"question_id":3092,"title":"最高频率的 ID","title_slug":"most-frequent-ids","rating":1793.1160019698,"_hash":51814756,"paid_only":false},{"question_id":3093,"title":"最长公共后缀查询","title_slug":"longest-common-suffix-queries","rating":2118.3732356694,"_hash":1039944072,"paid_only":false}],"company":{}},{"contest":{"id":1006,"title":"第 389 场周赛","title_slug":"weekly-contest-389","start_time":1710642600,"is_ee_exam_contest":null},"questions":[{"question_id":3083,"title":"字符串及其反转中是否存在同一子字符串","title_slug":"existence-of-a-substring-in-a-string-and-its-reverse","rating":1173.0485559374,"_hash":798792187,"paid_only":false},{"question_id":3084,"title":"统计以给定字符开头和结尾的子字符串总数","title_slug":"count-substrings-starting-and-ending-with-given-character","rating":1323.7856529722,"_hash":159107023,"paid_only":false},{"question_id":3085,"title":"成为 K 特殊字符串需要删除的最少字符数","title_slug":"minimum-deletions-to-make-string-k-special","rating":1764.7072848367,"_hash":772464458,"paid_only":false},{"question_id":3086,"title":"拾起 K 个 1 需要的最少行动次数","title_slug":"minimum-moves-to-pick-k-ones","rating":2672.7613091907,"_hash":2801609382,"paid_only":false}],"company":{}},{"contest":{"id":1003,"title":"第 126 场双周赛","title_slug":"biweekly-contest-126","start_time":1710599400,"is_ee_exam_contest":null},"questions":[{"question_id":3079,"title":"求出加密整数的和","title_slug":"find-the-sum-of-encrypted-integers","rating":1190.626520458,"_hash":1575987031,"paid_only":false},{"question_id":3080,"title":"执行操作标记数组中的元素","title_slug":"mark-elements-on-array-by-performing-queries","rating":1607.9038975431,"_hash":366420703,"paid_only":false},{"question_id":3081,"title":"替换字符串中的问号使分数最小","title_slug":"replace-question-marks-in-string-to-minimize-its-value","rating":1904.6714229335,"_hash":2019963761,"paid_only":false},{"question_id":3082,"title":"求出所有子序列的能量和","title_slug":"find-the-sum-of-the-power-of-all-subsequences","rating":2241.6583403983,"_hash":2080371217,"paid_only":false}],"company":{}},{"contest":{"id":1004,"title":"第 388 场周赛","title_slug":"weekly-contest-388","start_time":1710037800,"is_ee_exam_contest":null},"questions":[{"question_id":3074,"title":"重新分装苹果","title_slug":"apple-redistribution-into-boxes","rating":1197.5462481787,"_hash":1658372650,"paid_only":false},{"question_id":3075,"title":"幸福值最大化的选择方案","title_slug":"maximize-happiness-of-selected-children","rating":1325.805380292,"_hash":287835109,"paid_only":false},{"question_id":3076,"title":"数组中的最短非公共子字符串","title_slug":"shortest-uncommon-substring-in-an-array","rating":1635.1802054842,"_hash":313237078,"paid_only":false},{"question_id":3077,"title":"K 个不相交子数组的最大能量值","title_slug":"maximum-strength-of-k-disjoint-subarrays","rating":2556.5072256577,"_hash":2227480345,"paid_only":false}],"company":{}},{"contest":{"id":1000,"title":"第 387 场周赛","title_slug":"weekly-contest-387","start_time":1709433000,"is_ee_exam_contest":null},"questions":[{"question_id":3069,"title":"将元素分配到两个数组中 I","title_slug":"distribute-elements-into-two-arrays-i","rating":1203.7972421795,"_hash":3184466605,"paid_only":false},{"question_id":3070,"title":"元素和小于等于 k 的子矩阵的数目","title_slug":"count-submatrices-with-top-left-element-and-sum-less-than-k","rating":1498.6899053656,"_hash":1744001939,"paid_only":false},{"question_id":3071,"title":"在矩阵上写出字母 Y 所需的最少操作次数","title_slug":"minimum-operations-to-write-the-letter-y-on-a-grid","rating":1689.7833547546,"_hash":2471176904,"paid_only":false},{"question_id":3072,"title":"将元素分配到两个数组中 II","title_slug":"distribute-elements-into-two-arrays-ii","rating":2052.8622720512,"_hash":2433163916,"paid_only":false}],"company":{}},{"contest":{"id":997,"title":"第 125 场双周赛","title_slug":"biweekly-contest-125","start_time":1709389800,"is_ee_exam_contest":null},"questions":[{"question_id":3065,"title":"超过阈值的最少操作数 I","title_slug":"minimum-operations-to-exceed-threshold-value-i","rating":1149.7692944931,"_hash":2551717889,"paid_only":false},{"question_id":3066,"title":"超过阈值的最少操作数 II","title_slug":"minimum-operations-to-exceed-threshold-value-ii","rating":1399.5303229631,"_hash":3589997496,"paid_only":false},{"question_id":3067,"title":"在带权树网络中统计可连接服务器对数目","title_slug":"count-pairs-of-connectable-servers-in-a-weighted-tree-network","rating":1908.9411092109,"_hash":3271683304,"paid_only":false},{"question_id":3068,"title":"最大节点价值之和","title_slug":"find-the-maximum-sum-of-node-values","rating":2267.7081680968,"_hash":3427874469,"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":3046,"title":"分割数组","title_slug":"split-the-array","rating":1212.2079075334,"_hash":570608577,"paid_only":false},{"question_id":3047,"title":"求交集区域内的最大正方形面积","title_slug":"find-the-largest-area-of-square-inside-two-rectangles","rating":1601.7402292728,"_hash":1264664962,"paid_only":false},{"question_id":3048,"title":"标记所有下标的最早秒数 I","title_slug":"earliest-second-to-mark-indices-i","rating":2262.5641910108,"_hash":2474207721,"paid_only":false},{"question_id":3049,"title":"标记所有下标的最早秒数 II","title_slug":"earliest-second-to-mark-indices-ii","rating":3111.1274320356,"_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":1214.2480880984,"_hash":2560538129,"paid_only":false},{"question_id":3043,"title":"最长公共前缀的长度","title_slug":"find-the-length-of-the-longest-common-prefix","rating":1688.6445178061,"_hash":3836897087,"paid_only":false},{"question_id":3044,"title":"出现频率最高的质数","title_slug":"most-frequent-prime","rating":1737.2065180671,"_hash":1829348697,"paid_only":false},{"question_id":3045,"title":"统计前后缀下标对 II","title_slug":"count-prefix-and-suffix-pairs-ii","rating":2327.5726642605,"_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":1201.781034405,"_hash":787831673,"paid_only":false},{"question_id":3039,"title":"进行操作使字符串为空","title_slug":"apply-operations-to-make-string-empty","rating":1423.5195903975,"_hash":1356097871,"paid_only":false},{"question_id":3040,"title":"相同分数的最大操作数目 II","title_slug":"maximum-number-of-operations-with-the-same-score-ii","rating":1708.7149486078,"_hash":4231944752,"paid_only":false},{"question_id":3041,"title":"修改数组后最大化数组中的连续元素数目","title_slug":"maximize-consecutive-elements-in-an-array-after-modification","rating":2231.1942136357,"_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":{}}]