diff --git a/public/localData.json b/public/localData.json
new file mode 100644
index 0000000..641f72d
--- /dev/null
+++ b/public/localData.json
@@ -0,0 +1 @@
+[{"Rating":3018.4940165727,"ID":1719,"Title":"Number Of Ways To Reconstruct A Tree","TitleZH":"重构一棵树的方案数","TitleSlug":"number-of-ways-to-reconstruct-a-tree","ContestSlug":"biweekly-contest-43","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 43","ContestID_zh":"第 43 场双周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Graph","slug":"graph"}]},{"Rating":2872.0290327119,"ID":1982,"Title":"Find Array Given Subset Sums","TitleZH":"从子集的和还原数组","TitleSlug":"find-array-given-subset-sums","ContestSlug":"weekly-contest-255","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 255","ContestID_zh":"第 255 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Divide and Conquer","slug":"divide-and-conquer"}]},{"Rating":2863.1378294349,"ID":770,"Title":"Basic Calculator IV","TitleZH":"基本计算器 IV","TitleSlug":"basic-calculator-iv","ContestSlug":"weekly-contest-68","ProblemIndex":"Q5","ContestID_en":"Weekly Contest 68","ContestID_zh":"第 68 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Math","slug":"math"},{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"},{"name":"Recursion","slug":"recursion"}]},{"Rating":2849.4841858619,"ID":1728,"Title":"Cat and Mouse II","TitleZH":"猫和老鼠 II","TitleSlug":"cat-and-mouse-ii","ContestSlug":"weekly-contest-224","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 224","ContestID_zh":"第 224 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Graph","slug":"graph"},{"name":"Topological Sort","slug":"topological-sort"},{"name":"Memoization","slug":"memoization"},{"name":"Matrix","slug":"matrix"},{"name":"Game Theory","slug":"game-theory"}]},{"Rating":2817.267212602,"ID":1977,"Title":"Number of Ways to Separate Numbers","TitleZH":"划分数字的方案数","TitleSlug":"number-of-ways-to-separate-numbers","ContestSlug":"biweekly-contest-59","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 59","ContestID_zh":"第 59 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Suffix Array","slug":"suffix-array"}]},{"Rating":2803.7652028979,"ID":2060,"Title":"Check if an Original String Exists Given Two Encoded Strings","TitleZH":"同源字符串检测","TitleSlug":"check-if-an-original-string-exists-given-two-encoded-strings","ContestSlug":"weekly-contest-265","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 265","ContestID_zh":"第 265 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2765.2533837781,"ID":803,"Title":"Bricks Falling When Hit","TitleZH":"打砖块","TitleSlug":"bricks-falling-when-hit","ContestSlug":"weekly-contest-76","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 76","ContestID_zh":"第 76 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Union Find","slug":"union-find"},{"name":"Matrix","slug":"matrix"}]},{"Rating":2690.5859406179,"ID":1960,"Title":"Maximum Product of the Length of Two Palindromic Substrings","TitleZH":"两个回文子字符串长度的最大乘积","TitleSlug":"maximum-product-of-the-length-of-two-palindromic-substrings","ContestSlug":"biweekly-contest-58","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 58","ContestID_zh":"第 58 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Rolling Hash","slug":"rolling-hash"},{"name":"Hash Function","slug":"hash-function"}]},{"Rating":2666.668150845,"ID":1397,"Title":"Find All Good Strings","TitleZH":"找到所有好字符串","TitleSlug":"find-all-good-strings","ContestSlug":"weekly-contest-182","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 182","ContestID_zh":"第 182 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"String Matching","slug":"string-matching"}]},{"Rating":2661.0670044656,"ID":1923,"Title":"Longest Common Subpath","TitleZH":"最长公共子路径","TitleSlug":"longest-common-subpath","ContestSlug":"weekly-contest-248","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 248","ContestID_zh":"第 248 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Rolling Hash","slug":"rolling-hash"},{"name":"Suffix Array","slug":"suffix-array"},{"name":"Hash Function","slug":"hash-function"}]},{"Rating":2655.2178711909,"ID":1659,"Title":"Maximize Grid Happiness","TitleZH":"最大化网格幸福感","TitleSlug":"maximize-grid-happiness","ContestSlug":"weekly-contest-215","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 215","ContestID_zh":"第 215 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Memoization","slug":"memoization"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":2650.8996457642,"ID":2097,"Title":"Valid Arrangement of Pairs","TitleZH":"合法重新排列数对","TitleSlug":"valid-arrangement-of-pairs","ContestSlug":"weekly-contest-270","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 270","ContestID_zh":"第 270 场周赛","topicTags":[{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Graph","slug":"graph"},{"name":"Eulerian Circuit","slug":"eulerian-circuit"}]},{"Rating":2648.1748409542,"ID":2071,"Title":"Maximum Number of Tasks You Can Assign","TitleZH":"你可以安排的最多任务数目","TitleSlug":"maximum-number-of-tasks-you-can-assign","ContestSlug":"biweekly-contest-65","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 65","ContestID_zh":"第 65 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Greedy","slug":"greedy"},{"name":"Queue","slug":"queue"},{"name":"Sorting","slug":"sorting"},{"name":"Monotonic Queue","slug":"monotonic-queue"}]},{"Rating":2647.8258771458,"ID":2386,"Title":"Find the K-Sum of an Array","TitleZH":"找出数组的第 K 大和","TitleSlug":"find-the-k-sum-of-an-array","ContestSlug":"weekly-contest-307","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 307","ContestID_zh":"第 307 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":2640.3824813624,"ID":1787,"Title":"Make the XOR of All Segments Equal to Zero","TitleZH":"使所有区间的异或结果为零","TitleSlug":"make-the-xor-of-all-segments-equal-to-zero","ContestSlug":"weekly-contest-231","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 231","ContestID_zh":"第 231 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":2633.0144045478,"ID":2499,"Title":"Minimum Total Cost to Make Arrays Unequal","TitleZH":"让数组不相等的最小总代价","TitleSlug":"minimum-total-cost-to-make-arrays-unequal","ContestSlug":"biweekly-contest-93","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 93","ContestID_zh":"第 93 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Greedy","slug":"greedy"},{"name":"Counting","slug":"counting"}]},{"Rating":2628.7957821141,"ID":2213,"Title":"Longest Substring of One Repeating Character","TitleZH":"由单个字符重复的最长子字符串","TitleSlug":"longest-substring-of-one-repeating-character","ContestSlug":"weekly-contest-285","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 285","ContestID_zh":"第 285 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Segment Tree","slug":"segment-tree"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":2621.1208072273,"ID":2281,"Title":"Sum of Total Strength of Wizards","TitleZH":"巫师的总力量和","TitleSlug":"sum-of-total-strength-of-wizards","ContestSlug":"weekly-contest-294","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 294","ContestID_zh":"第 294 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Stack","slug":"stack"},{"name":"Monotonic Stack","slug":"monotonic-stack"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":2620.4181842249,"ID":1830,"Title":"Minimum Number of Operations to Make String Sorted","TitleZH":"使字符串有序的最少操作次数","TitleSlug":"minimum-number-of-operations-to-make-string-sorted","ContestSlug":"biweekly-contest-50","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 50","ContestID_zh":"第 50 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"},{"name":"Combinatorics","slug":"combinatorics"}]},{"Rating":2615.1468269481,"ID":2338,"Title":"Count the Number of Ideal Arrays","TitleZH":"统计理想数组的数目","TitleSlug":"count-the-number-of-ideal-arrays","ContestSlug":"weekly-contest-301","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 301","ContestID_zh":"第 301 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Combinatorics","slug":"combinatorics"},{"name":"Number Theory","slug":"number-theory"}]},{"Rating":2610.9906730644,"ID":2056,"Title":"Number of Valid Move Combinations On Chessboard","TitleZH":"棋盘上有效移动组合的数目","TitleSlug":"number-of-valid-move-combinations-on-chessboard","ContestSlug":"biweekly-contest-64","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 64","ContestID_zh":"第 64 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Backtracking","slug":"backtracking"},{"name":"Simulation","slug":"simulation"}]},{"Rating":2610.0826855063,"ID":1687,"Title":"Delivering Boxes from Storage to Ports","TitleZH":"从仓库到码头运输箱子","TitleSlug":"delivering-boxes-from-storage-to-ports","ContestSlug":"biweekly-contest-41","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 41","ContestID_zh":"第 41 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Segment Tree","slug":"segment-tree"},{"name":"Queue","slug":"queue"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Monotonic Queue","slug":"monotonic-queue"}]},{"Rating":2594.135673452,"ID":964,"Title":"Least Operators to Express Number","TitleZH":"表示数字的最少运算符","TitleSlug":"least-operators-to-express-number","ContestSlug":"weekly-contest-116","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 116","ContestID_zh":"第 116 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2587.8725248485,"ID":1883,"Title":"Minimum Skips to Arrive at Meeting On Time","TitleZH":"准时抵达会议现场的最小跳过休息次数","TitleSlug":"minimum-skips-to-arrive-at-meeting-on-time","ContestSlug":"weekly-contest-243","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 243","ContestID_zh":"第 243 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2583.9006314254,"ID":2019,"Title":"The Score of Students Solving Math Expression","TitleZH":"解出数学表达式的学生分数","TitleSlug":"the-score-of-students-solving-math-expression","ContestSlug":"weekly-contest-260","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 260","ContestID_zh":"第 260 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Stack","slug":"stack"},{"name":"Memoization","slug":"memoization"}]},{"Rating":2583.406911951,"ID":936,"Title":"Stamping The Sequence","TitleZH":"戳印序列","TitleSlug":"stamping-the-sequence","ContestSlug":"weekly-contest-109","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 109","ContestID_zh":"第 109 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"},{"name":"Greedy","slug":"greedy"},{"name":"Queue","slug":"queue"}]},{"Rating":2575.9570281316,"ID":1531,"Title":"String Compression II","TitleZH":"压缩字符串 II","TitleSlug":"string-compression-ii","ContestSlug":"weekly-contest-199","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 199","ContestID_zh":"第 199 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2571.552028121,"ID":1489,"Title":"Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree","TitleZH":"找到最小生成树里的关键边和伪关键边","TitleSlug":"find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree","ContestSlug":"weekly-contest-194","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 194","ContestID_zh":"第 194 场周赛","topicTags":[{"name":"Union Find","slug":"union-find"},{"name":"Graph","slug":"graph"},{"name":"Sorting","slug":"sorting"},{"name":"Minimum Spanning Tree","slug":"minimum-spanning-tree"},{"name":"Strongly Connected Component","slug":"strongly-connected-component"}]},{"Rating":2566.5910742837,"ID":913,"Title":"Cat and Mouse","TitleZH":"猫和老鼠","TitleSlug":"cat-and-mouse","ContestSlug":"weekly-contest-104","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 104","ContestID_zh":"第 104 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Graph","slug":"graph"},{"name":"Topological Sort","slug":"topological-sort"},{"name":"Memoization","slug":"memoization"},{"name":"Game Theory","slug":"game-theory"}]},{"Rating":2561.7794931859,"ID":2030,"Title":"Smallest K-Length Subsequence With Occurrences of a Letter","TitleZH":"含特定字母的最小子序列","TitleSlug":"smallest-k-length-subsequence-with-occurrences-of-a-letter","ContestSlug":"weekly-contest-261","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 261","ContestID_zh":"第 261 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"},{"name":"Greedy","slug":"greedy"},{"name":"Monotonic Stack","slug":"monotonic-stack"}]},{"Rating":2561.508149216,"ID":2234,"Title":"Maximum Total Beauty of the Gardens","TitleZH":"花园的最大总美丽值","TitleSlug":"maximum-total-beauty-of-the-gardens","ContestSlug":"weekly-contest-288","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 288","ContestID_zh":"第 288 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Binary Search","slug":"binary-search"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":2559.4351004238,"ID":1815,"Title":"Maximum Number of Groups Getting Fresh Donuts","TitleZH":"得到新鲜甜甜圈的最多组数","TitleSlug":"maximum-number-of-groups-getting-fresh-donuts","ContestSlug":"biweekly-contest-49","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 49","ContestID_zh":"第 49 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Memoization","slug":"memoization"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":2558.3297484354,"ID":2014,"Title":"Longest Subsequence Repeated k Times","TitleZH":"重复 K 次的最长子序列","TitleSlug":"longest-subsequence-repeated-k-times","ContestSlug":"weekly-contest-259","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 259","ContestID_zh":"第 259 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Backtracking","slug":"backtracking"},{"name":"Greedy","slug":"greedy"},{"name":"Counting","slug":"counting"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":2539.863726397,"ID":1819,"Title":"Number of Different Subsequences GCDs","TitleZH":"序列中不同最大公约数的数目","TitleSlug":"number-of-different-subsequences-gcds","ContestSlug":"weekly-contest-235","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 235","ContestID_zh":"第 235 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Counting","slug":"counting"},{"name":"Number Theory","slug":"number-theory"}]},{"Rating":2537.7965575726,"ID":1595,"Title":"Minimum Cost to Connect Two Groups of Points","TitleZH":"连通两组点的最小成本","TitleSlug":"minimum-cost-to-connect-two-groups-of-points","ContestSlug":"weekly-contest-207","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 207","ContestID_zh":"第 207 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Matrix","slug":"matrix"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":2533.7796160302,"ID":1948,"Title":"Delete Duplicate Folders in System","TitleZH":"删除系统中的重复文件夹","TitleSlug":"delete-duplicate-folders-in-system","ContestSlug":"weekly-contest-251","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 251","ContestID_zh":"第 251 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Trie","slug":"trie"},{"name":"Hash Function","slug":"hash-function"}]},{"Rating":2533.3027905062,"ID":1675,"Title":"Minimize Deviation in Array","TitleZH":"数组的最小偏移量","TitleSlug":"minimize-deviation-in-array","ContestSlug":"weekly-contest-217","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 217","ContestID_zh":"第 217 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":2531.6452775023,"ID":1896,"Title":"Minimum Cost to Change the Final Value of Expression","TitleZH":"反转表达式值的最少操作次数","TitleSlug":"minimum-cost-to-change-the-final-value-of-expression","ContestSlug":"biweekly-contest-54","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 54","ContestID_zh":"第 54 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Stack","slug":"stack"}]},{"Rating":2530.6905139914,"ID":1776,"Title":"Car Fleet II","TitleZH":"车队 II","TitleSlug":"car-fleet-ii","ContestSlug":"weekly-contest-230","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 230","ContestID_zh":"第 230 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Stack","slug":"stack"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Monotonic Stack","slug":"monotonic-stack"}]},{"Rating":2529.5251086936,"ID":1632,"Title":"Rank Transform of a Matrix","TitleZH":"矩阵转换后的秩","TitleSlug":"rank-transform-of-a-matrix","ContestSlug":"weekly-contest-212","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 212","ContestID_zh":"第 212 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Union Find","slug":"union-find"},{"name":"Graph","slug":"graph"},{"name":"Topological Sort","slug":"topological-sort"},{"name":"Matrix","slug":"matrix"}]},{"Rating":2517.6829964848,"ID":2040,"Title":"Kth Smallest Product of Two Sorted Arrays","TitleZH":"两个有序数组的第 K 小乘积","TitleSlug":"kth-smallest-product-of-two-sorted-arrays","ContestSlug":"biweekly-contest-63","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 63","ContestID_zh":"第 63 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":2515.7520586008,"ID":2272,"Title":"Substring With Largest Variance","TitleZH":"最大波动的子字符串","TitleSlug":"substring-with-largest-variance","ContestSlug":"biweekly-contest-78","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 78","ContestID_zh":"第 78 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2502.5176603922,"ID":1938,"Title":"Maximum Genetic Difference Query","TitleZH":"查询最大基因差","TitleSlug":"maximum-genetic-difference-query","ContestSlug":"weekly-contest-250","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 250","ContestID_zh":"第 250 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Trie","slug":"trie"}]},{"Rating":2499.5640490579,"ID":1735,"Title":"Count Ways to Make Array With Product","TitleZH":"生成乘积数组的方案数","TitleSlug":"count-ways-to-make-array-with-product","ContestSlug":"biweekly-contest-44","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 44","ContestID_zh":"第 44 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Combinatorics","slug":"combinatorics"},{"name":"Number Theory","slug":"number-theory"}]},{"Rating":2499.3282271507,"ID":2157,"Title":"Groups of Strings","TitleZH":"字符串分组","TitleSlug":"groups-of-strings","ContestSlug":"weekly-contest-278","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 278","ContestID_zh":"第 278 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Union Find","slug":"union-find"}]},{"Rating":2489.6652421066,"ID":2035,"Title":"Partition Array Into Two Arrays to Minimize Sum Difference","TitleZH":"将数组分成两个数组并最小化数组和的差","TitleSlug":"partition-array-into-two-arrays-to-minimize-sum-difference","ContestSlug":"weekly-contest-262","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 262","ContestID_zh":"第 262 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Binary Search","slug":"binary-search"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Ordered Set","slug":"ordered-set"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":2486.2339675701,"ID":1916,"Title":"Count Ways to Build Rooms in an Ant Colony","TitleZH":"统计为蚁群构筑房间的不同顺序","TitleSlug":"count-ways-to-build-rooms-in-an-ant-colony","ContestSlug":"weekly-contest-247","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 247","ContestID_zh":"第 247 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Tree","slug":"tree"},{"name":"Graph","slug":"graph"},{"name":"Topological Sort","slug":"topological-sort"},{"name":"Combinatorics","slug":"combinatorics"}]},{"Rating":2483.9435767299,"ID":1932,"Title":"Merge BSTs to Create Single BST","TitleZH":"合并多棵二叉搜索树","TitleSlug":"merge-bsts-to-create-single-bst","ContestSlug":"weekly-contest-249","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 249","ContestID_zh":"第 249 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Binary Search","slug":"binary-search"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":2481.8722909195,"ID":2289,"Title":"Steps to Make Array Non-decreasing","TitleZH":"使数组按非递减顺序排列","TitleSlug":"steps-to-make-array-non-decreasing","ContestSlug":"weekly-contest-295","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 295","ContestID_zh":"第 295 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Linked List","slug":"linked-list"},{"name":"Stack","slug":"stack"},{"name":"Monotonic Stack","slug":"monotonic-stack"}]},{"Rating":2481.7175364169,"ID":1330,"Title":"Reverse Subarray To Maximize Array Value","TitleZH":"翻转子数组得到最大的数组值","TitleSlug":"reverse-subarray-to-maximize-array-value","ContestSlug":"biweekly-contest-18","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 18","ContestID_zh":"第 18 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Greedy","slug":"greedy"}]},{"Rating":2479.3282985529,"ID":1803,"Title":"Count Pairs With XOR in a Range","TitleZH":"统计异或值在范围内的数对有多少","TitleSlug":"count-pairs-with-xor-in-a-range","ContestSlug":"weekly-contest-233","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 233","ContestID_zh":"第 233 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Trie","slug":"trie"}]},{"Rating":2476.7727985927,"ID":2117,"Title":"Abbreviating the Product of a Range","TitleZH":"一个区间内所有数乘积的缩写","TitleSlug":"abbreviating-the-product-of-a-range","ContestSlug":"biweekly-contest-68","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 68","ContestID_zh":"第 68 场双周赛","topicTags":[{"name":"Math","slug":"math"}]},{"Rating":2476.451764287,"ID":1622,"Title":"Fancy Sequence","TitleZH":"奇妙序列","TitleSlug":"fancy-sequence","ContestSlug":"biweekly-contest-37","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 37","ContestID_zh":"第 37 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Design","slug":"design"},{"name":"Segment Tree","slug":"segment-tree"}]},{"Rating":2470.2118194809,"ID":2286,"Title":"Booking Concert Tickets in Groups","TitleZH":"以组为单位订音乐会的门票","TitleSlug":"booking-concert-tickets-in-groups","ContestSlug":"biweekly-contest-79","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 79","ContestID_zh":"第 79 场双周赛","topicTags":[{"name":"Binary Search","slug":"binary-search"},{"name":"Design","slug":"design"},{"name":"Binary Indexed Tree","slug":"binary-indexed-tree"},{"name":"Segment Tree","slug":"segment-tree"}]},{"Rating":2466.8891773908,"ID":1703,"Title":"Minimum Adjacent Swaps for K Consecutive Ones","TitleZH":"得到连续 K 个 1 的最少相邻交换次数","TitleSlug":"minimum-adjacent-swaps-for-k-consecutive-ones","ContestSlug":"biweekly-contest-42","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 42","ContestID_zh":"第 42 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":2464.5077611012,"ID":1994,"Title":"The Number of Good Subsets","TitleZH":"好子集的数目","TitleSlug":"the-number-of-good-subsets","ContestSlug":"biweekly-contest-60","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 60","ContestID_zh":"第 60 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":2460.3152437576,"ID":2440,"Title":"Create Components With Same Value","TitleZH":"创建价值相同的连通块","TitleSlug":"create-components-with-same-value","ContestSlug":"biweekly-contest-89","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 89","ContestID_zh":"第 89 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":2457.115574186,"ID":1782,"Title":"Count Pairs Of Nodes","TitleZH":"统计点对的数目","TitleSlug":"count-pairs-of-nodes","ContestSlug":"biweekly-contest-47","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 47","ContestID_zh":"第 47 场双周赛","topicTags":[{"name":"Two Pointers","slug":"two-pointers"},{"name":"Binary Search","slug":"binary-search"},{"name":"Graph","slug":"graph"}]},{"Rating":2456.3900212097,"ID":1499,"Title":"Max Value of Equation","TitleZH":"满足不等式的最大值","TitleSlug":"max-value-of-equation","ContestSlug":"weekly-contest-195","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 195","ContestID_zh":"第 195 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Queue","slug":"queue"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Monotonic Queue","slug":"monotonic-queue"}]},{"Rating":2455.8244137907,"ID":1040,"Title":"Moving Stones Until Consecutive II","TitleZH":"移动石子直到连续 II","TitleSlug":"moving-stones-until-consecutive-ii","ContestSlug":"weekly-contest-135","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 135","ContestID_zh":"第 135 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Sorting","slug":"sorting"}]},{"Rating":2454.7653333657,"ID":1900,"Title":"The Earliest and Latest Rounds Where Players Compete","TitleZH":"最佳运动员的比拼回合","TitleSlug":"the-earliest-and-latest-rounds-where-players-compete","ContestSlug":"weekly-contest-245","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 245","ContestID_zh":"第 245 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Memoization","slug":"memoization"}]},{"Rating":2453.9054896968,"ID":2463,"Title":"Minimum Total Distance Traveled","TitleZH":"最小移动总距离","TitleSlug":"minimum-total-distance-traveled","ContestSlug":"weekly-contest-318","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 318","ContestID_zh":"第 318 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Sorting","slug":"sorting"}]},{"Rating":2449.1323757838,"ID":2127,"Title":"Maximum Employees to Be Invited to a Meeting","TitleZH":"参加会议的最多员工数","TitleSlug":"maximum-employees-to-be-invited-to-a-meeting","ContestSlug":"weekly-contest-274","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 274","ContestID_zh":"第 274 场周赛","topicTags":[{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Graph","slug":"graph"},{"name":"Topological Sort","slug":"topological-sort"}]},{"Rating":2444.6660756903,"ID":2421,"Title":"Number of Good Paths","TitleZH":"好路径的数目","TitleSlug":"number-of-good-paths","ContestSlug":"weekly-contest-312","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 312","ContestID_zh":"第 312 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Tree","slug":"tree"},{"name":"Union Find","slug":"union-find"},{"name":"Graph","slug":"graph"}]},{"Rating":2439.7337408636,"ID":1872,"Title":"Stone Game VIII","TitleZH":"石子游戏 VIII","TitleSlug":"stone-game-viii","ContestSlug":"weekly-contest-242","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 242","ContestID_zh":"第 242 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Prefix Sum","slug":"prefix-sum"},{"name":"Game Theory","slug":"game-theory"}]},{"Rating":2433.3767704629,"ID":903,"Title":"Valid Permutations for DI Sequence","TitleZH":"DI 序列的有效排列","TitleSlug":"valid-permutations-for-di-sequence","ContestSlug":"weekly-contest-101","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 101","ContestID_zh":"第 101 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2429.6705422448,"ID":782,"Title":"Transform to Chessboard","TitleZH":"变为棋盘","TitleSlug":"transform-to-chessboard","ContestSlug":"weekly-contest-71","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 71","ContestID_zh":"第 71 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Matrix","slug":"matrix"}]},{"Rating":2429.0940568399,"ID":1998,"Title":"GCD Sort of an Array","TitleZH":"数组的最大公因数排序","TitleSlug":"gcd-sort-of-an-array","ContestSlug":"weekly-contest-257","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 257","ContestID_zh":"第 257 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Union Find","slug":"union-find"},{"name":"Sorting","slug":"sorting"}]},{"Rating":2428.7985254341,"ID":1044,"Title":"Longest Duplicate Substring","TitleZH":"最长重复子串","TitleSlug":"longest-duplicate-substring","ContestSlug":"weekly-contest-136","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 136","ContestID_zh":"第 136 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Rolling Hash","slug":"rolling-hash"},{"name":"Suffix Array","slug":"suffix-array"},{"name":"Hash Function","slug":"hash-function"}]},{"Rating":2422.5309771173,"ID":1000,"Title":"Minimum Cost to Merge Stones","TitleZH":"合并石头的最低成本","TitleSlug":"minimum-cost-to-merge-stones","ContestSlug":"weekly-contest-126","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 126","ContestID_zh":"第 126 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2422.3128048015,"ID":1987,"Title":"Number of Unique Good Subsequences","TitleZH":"不同的好子序列数目","TitleSlug":"number-of-unique-good-subsequences","ContestSlug":"weekly-contest-256","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 256","ContestID_zh":"第 256 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2418.5742747632,"ID":1203,"Title":"Sort Items by Groups Respecting Dependencies","TitleZH":"项目管理","TitleSlug":"sort-items-by-groups-respecting-dependencies","ContestSlug":"weekly-contest-155","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 155","ContestID_zh":"第 155 场周赛","topicTags":[{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"},{"name":"Topological Sort","slug":"topological-sort"}]},{"Rating":2415.2802039252,"ID":2493,"Title":"Divide Nodes Into the Maximum Number of Groups","TitleZH":"将节点分成尽可能多的组","TitleSlug":"divide-nodes-into-the-maximum-number-of-groups","ContestSlug":"weekly-contest-322","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 322","ContestID_zh":"第 322 场周赛","topicTags":[{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Graph","slug":"graph"}]},{"Rating":2415.0089731911,"ID":2003,"Title":"Smallest Missing Genetic Value in Each Subtree","TitleZH":"每棵子树内缺失的最小基因值","TitleSlug":"smallest-missing-genetic-value-in-each-subtree","ContestSlug":"weekly-contest-258","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 258","ContestID_zh":"第 258 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Union Find","slug":"union-find"}]},{"Rating":2414.6227484407,"ID":2518,"Title":"Number of Great Partitions","TitleZH":"好分区的数目","TitleSlug":"number-of-great-partitions","ContestSlug":"weekly-contest-325","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 325","ContestID_zh":"第 325 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2413.3969129689,"ID":1928,"Title":"Minimum Cost to Reach Destination in Time","TitleZH":"规定时间内到达终点的最小花费","TitleSlug":"minimum-cost-to-reach-destination-in-time","ContestSlug":"biweekly-contest-56","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 56","ContestID_zh":"第 56 场双周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Graph","slug":"graph"}]},{"Rating":2409.7580728676,"ID":1388,"Title":"Pizza With 3n Slices","TitleZH":"3n 块披萨","TitleSlug":"pizza-with-3n-slices","ContestSlug":"biweekly-contest-22","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 22","ContestID_zh":"第 22 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Greedy","slug":"greedy"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":2399.5729141925,"ID":920,"Title":"Number of Music Playlists","TitleZH":"播放列表的数量","TitleSlug":"number-of-music-playlists","ContestSlug":"weekly-contest-105","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 105","ContestID_zh":"第 105 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Combinatorics","slug":"combinatorics"}]},{"Rating":2396.6267778669,"ID":808,"Title":"Soup Servings","TitleZH":"分汤","TitleSlug":"soup-servings","ContestSlug":"weekly-contest-78","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 78","ContestID_zh":"第 78 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Probability and Statistics","slug":"probability-and-statistics"}]},{"Rating":2395.8765531206,"ID":1825,"Title":"Finding MK Average","TitleZH":"求出 MK 平均值","TitleSlug":"finding-mk-average","ContestSlug":"weekly-contest-236","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 236","ContestID_zh":"第 236 场周赛","topicTags":[{"name":"Design","slug":"design"},{"name":"Queue","slug":"queue"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Data Stream","slug":"data-stream"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":2392.0799451298,"ID":2172,"Title":"Maximum AND Sum of Array","TitleZH":"数组的最大与和","TitleSlug":"maximum-and-sum-of-array","ContestSlug":"weekly-contest-280","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 280","ContestID_zh":"第 280 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":2391.8086687918,"ID":818,"Title":"Race Car","TitleZH":"赛车","TitleSlug":"race-car","ContestSlug":"weekly-contest-80","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 80","ContestID_zh":"第 80 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2391.657270733,"ID":2322,"Title":"Minimum Score After Removals on a Tree","TitleZH":"从树中删除边的最小分数","TitleSlug":"minimum-score-after-removals-on-a-tree","ContestSlug":"weekly-contest-299","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 299","ContestID_zh":"第 299 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"}]},{"Rating":2389.9634276167,"ID":1681,"Title":"Minimum Incompatibility","TitleZH":"最小不兼容性","TitleSlug":"minimum-incompatibility","ContestSlug":"weekly-contest-218","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 218","ContestID_zh":"第 218 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":2385.8072128533,"ID":1349,"Title":"Maximum Students Taking Exam","TitleZH":"参加考试的最大学生数","TitleSlug":"maximum-students-taking-exam","ContestSlug":"weekly-contest-175","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 175","ContestID_zh":"第 175 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Matrix","slug":"matrix"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":2383.7724811656,"ID":1521,"Title":"Find a Value of a Mysterious Function Closest to Target","TitleZH":"找到最接近目标值的函数值","TitleSlug":"find-a-value-of-a-mysterious-function-closest-to-target","ContestSlug":"weekly-contest-198","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 198","ContestID_zh":"第 198 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Segment Tree","slug":"segment-tree"}]},{"Rating":2381.6019709166,"ID":2468,"Title":"Split Message Based on Limit","TitleZH":"根据限制分割消息","TitleSlug":"split-message-based-on-limit","ContestSlug":"biweekly-contest-91","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 91","ContestID_zh":"第 91 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":2381.479024858,"ID":956,"Title":"Tallest Billboard","TitleZH":"最高的广告牌","TitleSlug":"tallest-billboard","ContestSlug":"weekly-contest-114","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 114","ContestID_zh":"第 114 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2381.2160234811,"ID":2334,"Title":"Subarray With Elements Greater Than Varying Threshold","TitleZH":"元素值大于变化阈值的子数组","TitleSlug":"subarray-with-elements-greater-than-varying-threshold","ContestSlug":"biweekly-contest-82","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 82","ContestID_zh":"第 82 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Stack","slug":"stack"},{"name":"Union Find","slug":"union-find"},{"name":"Monotonic Stack","slug":"monotonic-stack"}]},{"Rating":2378.6234112504,"ID":757,"Title":"Set Intersection Size At Least Two","TitleZH":"设置交集大小至少为2","TitleSlug":"set-intersection-size-at-least-two","ContestSlug":"weekly-contest-65","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 65","ContestID_zh":"第 65 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":2377.3895801187,"ID":854,"Title":"K-Similar Strings","TitleZH":"相似度为 K 的字符串","TitleSlug":"k-similar-strings","ContestSlug":"weekly-contest-89","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 89","ContestID_zh":"第 89 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Breadth-First Search","slug":"breadth-first-search"}]},{"Rating":2376.8658923518,"ID":887,"Title":"Super Egg Drop","TitleZH":"鸡蛋掉落","TitleSlug":"super-egg-drop","ContestSlug":"weekly-contest-97","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 97","ContestID_zh":"第 97 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Binary Search","slug":"binary-search"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2374.1850487395,"ID":1840,"Title":"Maximum Building Height","TitleZH":"最高建筑高度","TitleSlug":"maximum-building-height","ContestSlug":"weekly-contest-238","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 238","ContestID_zh":"第 238 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"}]},{"Rating":2366.7099607655,"ID":1183,"Title":"Maximum Number of Ones","TitleZH":"矩阵中 1 的最大数量","TitleSlug":"maximum-number-of-ones","ContestSlug":"biweekly-contest-8","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 8","ContestID_zh":"第 8 场双周赛","topicTags":[{"name":"Greedy","slug":"greedy"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":2364.3930657709,"ID":2132,"Title":"Stamping the Grid","TitleZH":"用邮票贴满网格图","TitleSlug":"stamping-the-grid","ContestSlug":"biweekly-contest-69","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 69","ContestID_zh":"第 69 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Matrix","slug":"matrix"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":2364.3455634374,"ID":2203,"Title":"Minimum Weighted Subgraph With the Required Paths","TitleZH":"得到要求路径的最小带权子图","TitleSlug":"minimum-weighted-subgraph-with-the-required-paths","ContestSlug":"weekly-contest-284","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 284","ContestID_zh":"第 284 场周赛","topicTags":[{"name":"Graph","slug":"graph"},{"name":"Shortest Path","slug":"shortest-path"}]},{"Rating":2363.5096568214,"ID":1755,"Title":"Closest Subsequence Sum","TitleZH":"最接近目标值的子序列和","TitleSlug":"closest-subsequence-sum","ContestSlug":"weekly-contest-227","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 227","ContestID_zh":"第 227 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":2363.0240184484,"ID":2312,"Title":"Selling Pieces of Wood","TitleZH":"卖木头块","TitleSlug":"selling-pieces-of-wood","ContestSlug":"weekly-contest-298","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 298","ContestID_zh":"第 298 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Memoization","slug":"memoization"}]},{"Rating":2362.6480880348,"ID":1520,"Title":"Maximum Number of Non-Overlapping Substrings","TitleZH":"最多的不重叠子字符串","TitleSlug":"maximum-number-of-non-overlapping-substrings","ContestSlug":"weekly-contest-198","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 198","ContestID_zh":"第 198 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":2358.9669560824,"ID":1707,"Title":"Maximum XOR With an Element From Array","TitleZH":"与数组中元素的最大异或值","TitleSlug":"maximum-xor-with-an-element-from-array","ContestSlug":"weekly-contest-221","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 221","ContestID_zh":"第 221 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Trie","slug":"trie"}]},{"Rating":2356.5811122453,"ID":1467,"Title":"Probability of a Two Boxes Having The Same Number of Distinct Balls","TitleZH":"两个盒子中球的颜色数相同的概率","TitleSlug":"probability-of-a-two-boxes-having-the-same-number-of-distinct-balls","ContestSlug":"weekly-contest-191","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 191","ContestID_zh":"第 191 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Backtracking","slug":"backtracking"},{"name":"Combinatorics","slug":"combinatorics"},{"name":"Probability and Statistics","slug":"probability-and-statistics"}]},{"Rating":2350.9694374861,"ID":1713,"Title":"Minimum Operations to Make a Subsequence","TitleZH":"得到子序列的最少操作次数","TitleSlug":"minimum-operations-to-make-a-subsequence","ContestSlug":"weekly-contest-222","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 222","ContestID_zh":"第 222 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Binary Search","slug":"binary-search"},{"name":"Greedy","slug":"greedy"}]},{"Rating":2350.0380300939,"ID":837,"Title":"New 21 Game","TitleZH":"新21点","TitleSlug":"new-21-game","ContestSlug":"weekly-contest-85","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 85","ContestID_zh":"第 85 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Probability and Statistics","slug":"probability-and-statistics"}]},{"Rating":2348.5159376523,"ID":1096,"Title":"Brace Expansion II","TitleZH":"花括号展开 II","TitleSlug":"brace-expansion-ii","ContestSlug":"weekly-contest-142","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 142","ContestID_zh":"第 142 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Backtracking","slug":"backtracking"},{"name":"Stack","slug":"stack"},{"name":"Breadth-First Search","slug":"breadth-first-search"}]},{"Rating":2346.5717839654,"ID":2258,"Title":"Escape the Spreading Fire","TitleZH":"逃离火灾","TitleSlug":"escape-the-spreading-fire","ContestSlug":"biweekly-contest-77","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 77","ContestID_zh":"第 77 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Matrix","slug":"matrix"}]},{"Rating":2345.3418191684,"ID":1611,"Title":"Minimum One Bit Operations to Make Integers Zero","TitleZH":"使整数变为 0 的最少操作次数","TitleSlug":"minimum-one-bit-operations-to-make-integers-zero","ContestSlug":"weekly-contest-209","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 209","ContestID_zh":"第 209 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Memoization","slug":"memoization"}]},{"Rating":2344.3664724791,"ID":2478,"Title":"Number of Beautiful Partitions","TitleZH":"完美分割的方案数","TitleSlug":"number-of-beautiful-partitions","ContestSlug":"weekly-contest-320","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 320","ContestID_zh":"第 320 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2341.4506355884,"ID":810,"Title":"Chalkboard XOR Game","TitleZH":"黑板异或游戏","TitleSlug":"chalkboard-xor-game","ContestSlug":"weekly-contest-78","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 78","ContestID_zh":"第 78 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Brainteaser","slug":"brainteaser"},{"name":"Game Theory","slug":"game-theory"}]},{"Rating":2336.5210003185,"ID":1505,"Title":"Minimum Possible Integer After at Most K Adjacent Swaps On Digits","TitleZH":"最多 K 次交换相邻数位后得到的最小整数","TitleSlug":"minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits","ContestSlug":"weekly-contest-196","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 196","ContestID_zh":"第 196 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"},{"name":"Binary Indexed Tree","slug":"binary-indexed-tree"},{"name":"Segment Tree","slug":"segment-tree"}]},{"Rating":2333.2401505813,"ID":1674,"Title":"Minimum Moves to Make Array Complementary","TitleZH":"使数组互补的最少操作次数","TitleSlug":"minimum-moves-to-make-array-complementary","ContestSlug":"weekly-contest-217","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 217","ContestID_zh":"第 217 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":2333.0621537307,"ID":1866,"Title":"Number of Ways to Rearrange Sticks With K Sticks Visible","TitleZH":"恰有 K 根木棍可以看到的排列数目","TitleSlug":"number-of-ways-to-rearrange-sticks-with-k-sticks-visible","ContestSlug":"weekly-contest-241","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 241","ContestID_zh":"第 241 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Combinatorics","slug":"combinatorics"}]},{"Rating":2333.0078041754,"ID":1585,"Title":"Check If String Is Transformable With Substring Sort Operations","TitleZH":"检查字符串是否可以通过排序子字符串得到另一个字符串","TitleSlug":"check-if-string-is-transformable-with-substring-sort-operations","ContestSlug":"weekly-contest-206","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 206","ContestID_zh":"第 206 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":2328.4294689238,"ID":882,"Title":"Reachable Nodes In Subdivided Graph","TitleZH":"细分图中的可到达结点","TitleSlug":"reachable-nodes-in-subdivided-graph","ContestSlug":"weekly-contest-96","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 96","ContestID_zh":"第 96 场周赛","topicTags":[{"name":"Graph","slug":"graph"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Shortest Path","slug":"shortest-path"}]},{"Rating":2315.6037017989,"ID":1187,"Title":"Make Array Strictly Increasing","TitleZH":"使数组严格递增","TitleSlug":"make-array-strictly-increasing","ContestSlug":"weekly-contest-153","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 153","ContestID_zh":"第 153 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2315.0547336936,"ID":2188,"Title":"Minimum Time to Finish the Race","TitleZH":"完成比赛的最少时间","TitleSlug":"minimum-time-to-finish-the-race","ContestSlug":"weekly-contest-282","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 282","ContestID_zh":"第 282 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2312.9919953644,"ID":1857,"Title":"Largest Color Value in a Directed Graph","TitleZH":"有向图中最大颜色值","TitleSlug":"largest-color-value-in-a-directed-graph","ContestSlug":"weekly-contest-240","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 240","ContestID_zh":"第 240 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Graph","slug":"graph"},{"name":"Topological Sort","slug":"topological-sort"},{"name":"Memoization","slug":"memoization"},{"name":"Counting","slug":"counting"}]},{"Rating":2310.3824631335,"ID":1959,"Title":"Minimum Total Space Wasted With K Resizing Operations","TitleZH":"K 次调整数组大小浪费的最小总空间","TitleSlug":"minimum-total-space-wasted-with-k-resizing-operations","ContestSlug":"biweekly-contest-58","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 58","ContestID_zh":"第 58 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2308.6545905335,"ID":1617,"Title":"Count Subtrees With Max Distance Between Cities","TitleZH":"统计子树中城市之间最大距离","TitleSlug":"count-subtrees-with-max-distance-between-cities","ContestSlug":"weekly-contest-210","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 210","ContestID_zh":"第 210 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Tree","slug":"tree"},{"name":"Enumeration","slug":"enumeration"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":2307.0161713185,"ID":1655,"Title":"Distribute Repeating Integers","TitleZH":"分配重复整数","TitleSlug":"distribute-repeating-integers","ContestSlug":"biweekly-contest-39","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 39","ContestID_zh":"第 39 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Backtracking","slug":"backtracking"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":2306.8472649456,"ID":862,"Title":"Shortest Subarray with Sum at Least K","TitleZH":"和至少为 K 的最短子数组","TitleSlug":"shortest-subarray-with-sum-at-least-k","ContestSlug":"weekly-contest-91","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 91","ContestID_zh":"第 91 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Queue","slug":"queue"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Prefix Sum","slug":"prefix-sum"},{"name":"Monotonic Queue","slug":"monotonic-queue"}]},{"Rating":2305.4498281454,"ID":2306,"Title":"Naming a Company","TitleZH":"公司命名","TitleSlug":"naming-a-company","ContestSlug":"weekly-contest-297","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 297","ContestID_zh":"第 297 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":2304.3094138939,"ID":2242,"Title":"Maximum Score of a Node Sequence","TitleZH":"节点序列的最大得分","TitleSlug":"maximum-score-of-a-node-sequence","ContestSlug":"biweekly-contest-76","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 76","ContestID_zh":"第 76 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Graph","slug":"graph"},{"name":"Sorting","slug":"sorting"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":2302.4005640818,"ID":2513,"Title":"Minimize the Maximum of Two Arrays","TitleZH":"最小化两个数组中的最大值","TitleSlug":"minimize-the-maximum-of-two-arrays","ContestSlug":"biweekly-contest-94","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 94","ContestID_zh":"第 94 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Binary Search","slug":"binary-search"},{"name":"Number Theory","slug":"number-theory"}]},{"Rating":2300.1557840589,"ID":1697,"Title":"Checking Existence of Edge Length Limited Paths","TitleZH":"检查边长度限制的路径是否存在","TitleSlug":"checking-existence-of-edge-length-limited-paths","ContestSlug":"weekly-contest-220","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 220","ContestID_zh":"第 220 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Union Find","slug":"union-find"},{"name":"Graph","slug":"graph"},{"name":"Sorting","slug":"sorting"}]},{"Rating":2298.6242048519,"ID":2458,"Title":"Height of Binary Tree After Subtree Removal Queries","TitleZH":"移除子树后的二叉树高度","TitleSlug":"height-of-binary-tree-after-subtree-removal-queries","ContestSlug":"weekly-contest-317","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 317","ContestID_zh":"第 317 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":2297.105362516,"ID":1263,"Title":"Minimum Moves to Move a Box to Their Target Location","TitleZH":"推箱子","TitleSlug":"minimum-moves-to-move-a-box-to-their-target-location","ContestSlug":"weekly-contest-163","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 163","ContestID_zh":"第 163 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Matrix","slug":"matrix"}]},{"Rating":2294.0981174197,"ID":932,"Title":"Beautiful Array","TitleZH":"漂亮数组","TitleSlug":"beautiful-array","ContestSlug":"weekly-contest-108","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 108","ContestID_zh":"第 108 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Divide and Conquer","slug":"divide-and-conquer"}]},{"Rating":2292.1434666805,"ID":761,"Title":"Special Binary String","TitleZH":"特殊的二进制序列","TitleSlug":"special-binary-string","ContestSlug":"weekly-contest-66","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 66","ContestID_zh":"第 66 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Recursion","slug":"recursion"}]},{"Rating":2290.9040038639,"ID":1591,"Title":"Strange Printer II","TitleZH":"奇怪的打印机 II","TitleSlug":"strange-printer-ii","ContestSlug":"biweekly-contest-35","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 35","ContestID_zh":"第 35 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Graph","slug":"graph"},{"name":"Topological Sort","slug":"topological-sort"},{"name":"Matrix","slug":"matrix"}]},{"Rating":2288.2117442123,"ID":1569,"Title":"Number of Ways to Reorder Array to Get Same BST","TitleZH":"将子数组重新排序得到同一个二叉查找树的方案数","TitleSlug":"number-of-ways-to-reorder-array-to-get-same-bst","ContestSlug":"weekly-contest-204","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 204","ContestID_zh":"第 204 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Divide and Conquer","slug":"divide-and-conquer"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Tree","slug":"tree"},{"name":"Union Find","slug":"union-find"},{"name":"Binary Search Tree","slug":"binary-search-tree"},{"name":"Memoization","slug":"memoization"},{"name":"Combinatorics","slug":"combinatorics"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":2286.1378742318,"ID":1851,"Title":"Minimum Interval to Include Each Query","TitleZH":"包含每个查询的最小区间","TitleSlug":"minimum-interval-to-include-each-query","ContestSlug":"weekly-contest-239","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 239","ContestID_zh":"第 239 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Line Sweep","slug":"line-sweep"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":2284.4463940346,"ID":1723,"Title":"Find Minimum Time to Finish All Jobs","TitleZH":"完成所有工作的最短时间","TitleSlug":"find-minimum-time-to-finish-all-jobs","ContestSlug":"weekly-contest-223","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 223","ContestID_zh":"第 223 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Backtracking","slug":"backtracking"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":2280.3143643878,"ID":2407,"Title":"Longest Increasing Subsequence II","TitleZH":"最长递增子序列 II","TitleSlug":"longest-increasing-subsequence-ii","ContestSlug":"weekly-contest-310","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 310","ContestID_zh":"第 310 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Divide and Conquer","slug":"divide-and-conquer"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Binary Indexed Tree","slug":"binary-indexed-tree"},{"name":"Segment Tree","slug":"segment-tree"},{"name":"Queue","slug":"queue"},{"name":"Monotonic Queue","slug":"monotonic-queue"}]},{"Rating":2277.3595662538,"ID":2029,"Title":"Stone Game IX","TitleZH":"石子游戏 IX","TitleSlug":"stone-game-ix","ContestSlug":"weekly-contest-261","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 261","ContestID_zh":"第 261 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Greedy","slug":"greedy"},{"name":"Counting","slug":"counting"},{"name":"Game Theory","slug":"game-theory"}]},{"Rating":2277.0238076464,"ID":749,"Title":"Contain Virus","TitleZH":"隔离病毒","TitleSlug":"contain-virus","ContestSlug":"weekly-contest-63","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 63","ContestID_zh":"第 63 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Matrix","slug":"matrix"},{"name":"Simulation","slug":"simulation"}]},{"Rating":2276.4233585631,"ID":1498,"Title":"Number of Subsequences That Satisfy the Given Sum Condition","TitleZH":"满足条件的子序列数目","TitleSlug":"number-of-subsequences-that-satisfy-the-given-sum-condition","ContestSlug":"weekly-contest-195","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 195","ContestID_zh":"第 195 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sorting","slug":"sorting"}]},{"Rating":2275.7337818748,"ID":1606,"Title":"Find Servers That Handled Most Number of Requests","TitleZH":"找到处理最多请求的服务器","TitleSlug":"find-servers-that-handled-most-number-of-requests","ContestSlug":"biweekly-contest-36","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 36","ContestID_zh":"第 36 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":2273.7910625337,"ID":753,"Title":"Cracking the Safe","TitleZH":"破解保险箱","TitleSlug":"cracking-the-safe","ContestSlug":"weekly-contest-64","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 64","ContestID_zh":"第 64 场周赛","topicTags":[{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Graph","slug":"graph"},{"name":"Eulerian Circuit","slug":"eulerian-circuit"}]},{"Rating":2273.2215764545,"ID":1434,"Title":"Number of Ways to Wear Different Hats to Each Other","TitleZH":"每个人戴不同帽子的方案数","TitleSlug":"number-of-ways-to-wear-different-hats-to-each-other","ContestSlug":"biweekly-contest-25","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 25","ContestID_zh":"第 25 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":2272.4412003208,"ID":2179,"Title":"Count Good Triplets in an Array","TitleZH":"统计数组中好三元组数目","TitleSlug":"count-good-triplets-in-an-array","ContestSlug":"biweekly-contest-72","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 72","ContestID_zh":"第 72 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Divide and Conquer","slug":"divide-and-conquer"},{"name":"Binary Indexed Tree","slug":"binary-indexed-tree"},{"name":"Segment Tree","slug":"segment-tree"},{"name":"Merge Sort","slug":"merge-sort"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":2272.1122260637,"ID":952,"Title":"Largest Component Size by Common Factor","TitleZH":"按公因数计算最大组件大小","TitleSlug":"largest-component-size-by-common-factor","ContestSlug":"weekly-contest-113","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 113","ContestID_zh":"第 113 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Union Find","slug":"union-find"}]},{"Rating":2265.2118886972,"ID":2141,"Title":"Maximum Running Time of N Computers","TitleZH":"同时运行 N 台电脑的最长时间","TitleSlug":"maximum-running-time-of-n-computers","ContestSlug":"weekly-contest-276","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 276","ContestID_zh":"第 276 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":2260.2799775623,"ID":1997,"Title":"First Day Where You Have Been in All the Rooms","TitleZH":"访问完所有房间的第一天","TitleSlug":"first-day-where-you-have-been-in-all-the-rooms","ContestSlug":"weekly-contest-257","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 257","ContestID_zh":"第 257 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2259.6572191969,"ID":857,"Title":"Minimum Cost to Hire K Workers","TitleZH":"雇佣 K 名工人的最低成本","TitleSlug":"minimum-cost-to-hire-k-workers","ContestSlug":"weekly-contest-90","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 90","ContestID_zh":"第 90 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":2258.6371797452,"ID":864,"Title":"Shortest Path to Get All Keys","TitleZH":"获取所有钥匙的最短路径","TitleSlug":"shortest-path-to-get-all-keys","ContestSlug":"weekly-contest-92","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 92","ContestID_zh":"第 92 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Matrix","slug":"matrix"}]},{"Rating":2250.9318291559,"ID":1125,"Title":"Smallest Sufficient Team","TitleZH":"最小的必要团队","TitleSlug":"smallest-sufficient-team","ContestSlug":"weekly-contest-145","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 145","ContestID_zh":"第 145 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":2250.2578740769,"ID":1199,"Title":"Minimum Time to Build Blocks","TitleZH":"建造街区的最短时间","TitleSlug":"minimum-time-to-build-blocks","ContestSlug":"biweekly-contest-9","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 9","ContestID_zh":"第 9 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Greedy","slug":"greedy"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":2250.0454791316,"ID":1307,"Title":"Verbal Arithmetic Puzzle","TitleZH":"口算难题","TitleSlug":"verbal-arithmetic-puzzle","ContestSlug":"weekly-contest-169","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 169","ContestID_zh":"第 169 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"String","slug":"string"},{"name":"Backtracking","slug":"backtracking"}]},{"Rating":2246.8671174565,"ID":960,"Title":"Delete Columns to Make Sorted III","TitleZH":"删列造序 III","TitleSlug":"delete-columns-to-make-sorted-iii","ContestSlug":"weekly-contest-115","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 115","ContestID_zh":"第 115 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2246.0452639352,"ID":2183,"Title":"Count Array Pairs Divisible by K","TitleZH":"统计可以被 K 整除的下标对数目","TitleSlug":"count-array-pairs-divisible-by-k","ContestSlug":"weekly-contest-281","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 281","ContestID_zh":"第 281 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Number Theory","slug":"number-theory"}]},{"Rating":2241.5199974312,"ID":1240,"Title":"Tiling a Rectangle with the Fewest Squares","TitleZH":"铺瓷砖","TitleSlug":"tiling-a-rectangle-with-the-fewest-squares","ContestSlug":"weekly-contest-160","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 160","ContestID_zh":"第 160 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Backtracking","slug":"backtracking"}]},{"Rating":2235.9672341699,"ID":850,"Title":"Rectangle Area II","TitleZH":"矩形面积 II","TitleSlug":"rectangle-area-ii","ContestSlug":"weekly-contest-88","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 88","ContestID_zh":"第 88 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Segment Tree","slug":"segment-tree"},{"name":"Line Sweep","slug":"line-sweep"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":2234.9191877602,"ID":1915,"Title":"Number of Wonderful Substrings","TitleZH":"最美子字符串的数目","TitleSlug":"number-of-wonderful-substrings","ContestSlug":"weekly-contest-247","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 247","ContestID_zh":"第 247 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":2233.963903408,"ID":1178,"Title":"Number of Valid Words for Each Puzzle","TitleZH":"猜字谜","TitleSlug":"number-of-valid-words-for-each-puzzle","ContestSlug":"weekly-contest-152","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 152","ContestID_zh":"第 152 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Trie","slug":"trie"}]},{"Rating":2231.8099102949,"ID":1766,"Title":"Tree of Coprimes","TitleZH":"互质树","TitleSlug":"tree-of-coprimes","ContestSlug":"biweekly-contest-46","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 46","ContestID_zh":"第 46 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"}]},{"Rating":2230.1673059455,"ID":1012,"Title":"Numbers With Repeated Digits","TitleZH":"至少有 1 位重复的数字","TitleSlug":"numbers-with-repeated-digits","ContestSlug":"weekly-contest-128","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 128","ContestID_zh":"第 128 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2225.3877535768,"ID":2163,"Title":"Minimum Difference in Sums After Removal of Elements","TitleZH":"删除元素后和的最小差值","TitleSlug":"minimum-difference-in-sums-after-removal-of-elements","ContestSlug":"biweekly-contest-71","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 71","ContestID_zh":"第 71 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":2223.1762282199,"ID":2484,"Title":"Count Palindromic Subsequences","TitleZH":"统计回文子序列数目","TitleSlug":"count-palindromic-subsequences","ContestSlug":"biweekly-contest-92","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 92","ContestID_zh":"第 92 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2222.4805422748,"ID":2276,"Title":"Count Integers in Intervals","TitleZH":"统计区间中的整数数目","TitleSlug":"count-integers-in-intervals","ContestSlug":"weekly-contest-293","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 293","ContestID_zh":"第 293 场周赛","topicTags":[{"name":"Design","slug":"design"},{"name":"Segment Tree","slug":"segment-tree"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":2221.7336557442,"ID":1542,"Title":"Find Longest Awesome Substring","TitleZH":"找出最长的超赞子字符串","TitleSlug":"find-longest-awesome-substring","ContestSlug":"biweekly-contest-32","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 32","ContestID_zh":"第 32 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":2221.3538766773,"ID":1627,"Title":"Graph Connectivity With Threshold","TitleZH":"带阈值的图连通性","TitleSlug":"graph-connectivity-with-threshold","ContestSlug":"weekly-contest-211","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 211","ContestID_zh":"第 211 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Union Find","slug":"union-find"}]},{"Rating":2220.0903365738,"ID":2223,"Title":"Sum of Scores of Built Strings","TitleZH":"构造字符串的总得分和","TitleSlug":"sum-of-scores-of-built-strings","ContestSlug":"biweekly-contest-75","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 75","ContestID_zh":"第 75 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Binary Search","slug":"binary-search"},{"name":"Rolling Hash","slug":"rolling-hash"},{"name":"Suffix Array","slug":"suffix-array"},{"name":"String Matching","slug":"string-matching"},{"name":"Hash Function","slug":"hash-function"}]},{"Rating":2219.3465296423,"ID":2167,"Title":"Minimum Time to Remove All Cars Containing Illegal Goods","TitleZH":"移除所有载有违禁货物车厢所需的最少时间","TitleSlug":"minimum-time-to-remove-all-cars-containing-illegal-goods","ContestSlug":"weekly-contest-279","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 279","ContestID_zh":"第 279 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2217.8090802563,"ID":2025,"Title":"Maximum Number of Ways to Partition an Array","TitleZH":"分割数组的最多方案数","TitleSlug":"maximum-number-of-ways-to-partition-an-array","ContestSlug":"biweekly-contest-62","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 62","ContestID_zh":"第 62 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Counting","slug":"counting"},{"name":"Enumeration","slug":"enumeration"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":2214.4798747386,"ID":1889,"Title":"Minimum Space Wasted From Packaging","TitleZH":"装包裹的最小浪费空间","TitleSlug":"minimum-space-wasted-from-packaging","ContestSlug":"weekly-contest-244","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 244","ContestID_zh":"第 244 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sorting","slug":"sorting"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":2210.3503183571,"ID":992,"Title":"Subarrays with K Different Integers","TitleZH":"K 个不同整数的子数组","TitleSlug":"subarrays-with-k-different-integers","ContestSlug":"weekly-contest-123","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 123","ContestID_zh":"第 123 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Counting","slug":"counting"}]},{"Rating":2209.8815936961,"ID":2081,"Title":"Sum of k-Mirror Numbers","TitleZH":"k 镜像数字的和","TitleSlug":"sum-of-k-mirror-numbers","ContestSlug":"weekly-contest-268","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 268","ContestID_zh":"第 268 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":2208.5532172086,"ID":1568,"Title":"Minimum Number of Days to Disconnect Island","TitleZH":"使陆地分离的最少天数","TitleSlug":"minimum-number-of-days-to-disconnect-island","ContestSlug":"weekly-contest-204","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 204","ContestID_zh":"第 204 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Matrix","slug":"matrix"},{"name":"Strongly Connected Component","slug":"strongly-connected-component"}]},{"Rating":2207.8565809952,"ID":1649,"Title":"Create Sorted Array through Instructions","TitleZH":"通过指令创建有序数组","TitleSlug":"create-sorted-array-through-instructions","ContestSlug":"weekly-contest-214","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 214","ContestID_zh":"第 214 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Divide and Conquer","slug":"divide-and-conquer"},{"name":"Binary Indexed Tree","slug":"binary-indexed-tree"},{"name":"Segment Tree","slug":"segment-tree"},{"name":"Merge Sort","slug":"merge-sort"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":2205.4304373587,"ID":1157,"Title":"Online Majority Element In Subarray","TitleZH":"子数组中占绝大多数的元素","TitleSlug":"online-majority-element-in-subarray","ContestSlug":"weekly-contest-149","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 149","ContestID_zh":"第 149 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Design","slug":"design"},{"name":"Binary Indexed Tree","slug":"binary-indexed-tree"},{"name":"Segment Tree","slug":"segment-tree"}]},{"Rating":2204.3524370174,"ID":879,"Title":"Profitable Schemes","TitleZH":"盈利计划","TitleSlug":"profitable-schemes","ContestSlug":"weekly-contest-95","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 95","ContestID_zh":"第 95 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2203.1738850937,"ID":1246,"Title":"Palindrome Removal","TitleZH":"删除回文子数组","TitleSlug":"palindrome-removal","ContestSlug":"biweekly-contest-12","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 12","ContestID_zh":"第 12 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2201.8209584221,"ID":1453,"Title":"Maximum Number of Darts Inside of a Circular Dartboard","TitleZH":"圆形靶内的最大飞镖数量","TitleSlug":"maximum-number-of-darts-inside-of-a-circular-dartboard","ContestSlug":"weekly-contest-189","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 189","ContestID_zh":"第 189 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Geometry","slug":"geometry"}]},{"Rating":2201.6219336792,"ID":2045,"Title":"Second Minimum Time to Reach Destination","TitleZH":"到达目的地的第二短时间","TitleSlug":"second-minimum-time-to-reach-destination","ContestSlug":"weekly-contest-263","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 263","ContestID_zh":"第 263 场周赛","topicTags":[{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"},{"name":"Shortest Path","slug":"shortest-path"}]},{"Rating":2200.6623666057,"ID":847,"Title":"Shortest Path Visiting All Nodes","TitleZH":"访问所有节点的最短路径","TitleSlug":"shortest-path-visiting-all-nodes","ContestSlug":"weekly-contest-87","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 87","ContestID_zh":"第 87 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":2198.4642973466,"ID":1739,"Title":"Building Boxes","TitleZH":"放置盒子","TitleSlug":"building-boxes","ContestSlug":"weekly-contest-225","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 225","ContestID_zh":"第 225 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Binary Search","slug":"binary-search"},{"name":"Greedy","slug":"greedy"}]},{"Rating":2198.3290662783,"ID":1621,"Title":"Number of Sets of K Non-Overlapping Line Segments","TitleZH":"大小为 K 的不重叠线段的数目","TitleSlug":"number-of-sets-of-k-non-overlapping-line-segments","ContestSlug":"biweekly-contest-37","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 37","ContestID_zh":"第 37 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2197.0951445919,"ID":834,"Title":"Sum of Distances in Tree","TitleZH":"树中距离之和","TitleSlug":"sum-of-distances-in-tree","ContestSlug":"weekly-contest-84","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 84","ContestID_zh":"第 84 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Graph","slug":"graph"}]},{"Rating":2195.6540241654,"ID":2503,"Title":"Maximum Number of Points From Grid Queries","TitleZH":"矩阵查询可获得的最大分数","TitleSlug":"maximum-number-of-points-from-grid-queries","ContestSlug":"weekly-contest-323","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 323","ContestID_zh":"第 323 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":2190.1757477854,"ID":1478,"Title":"Allocate Mailboxes","TitleZH":"安排邮筒","TitleSlug":"allocate-mailboxes","ContestSlug":"biweekly-contest-28","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 28","ContestID_zh":"第 28 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Sorting","slug":"sorting"}]},{"Rating":2189.3802630548,"ID":1074,"Title":"Number of Submatrices That Sum to Target","TitleZH":"元素和为目标值的子矩阵数量","TitleSlug":"number-of-submatrices-that-sum-to-target","ContestSlug":"weekly-contest-139","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 139","ContestID_zh":"第 139 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Matrix","slug":"matrix"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":2185.5444704515,"ID":943,"Title":"Find the Shortest Superstring","TitleZH":"最短超级串","TitleSlug":"find-the-shortest-superstring","ContestSlug":"weekly-contest-111","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 111","ContestID_zh":"第 111 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":2184.5241011615,"ID":1081,"Title":"Smallest Subsequence of Distinct Characters","TitleZH":"不同字符的最小子序列","TitleSlug":"smallest-subsequence-of-distinct-characters","ContestSlug":"weekly-contest-140","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 140","ContestID_zh":"第 140 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"},{"name":"Greedy","slug":"greedy"},{"name":"Monotonic Stack","slug":"monotonic-stack"}]},{"Rating":2182.6180030785,"ID":891,"Title":"Sum of Subsequence Widths","TitleZH":"子序列宽度之和","TitleSlug":"sum-of-subsequence-widths","ContestSlug":"weekly-contest-98","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 98","ContestID_zh":"第 98 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Sorting","slug":"sorting"}]},{"Rating":2182.054452981,"ID":1771,"Title":"Maximize Palindrome Length From Subsequences","TitleZH":"由子序列构造的最长回文串的长度","TitleSlug":"maximize-palindrome-length-from-subsequences","ContestSlug":"weekly-contest-229","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 229","ContestID_zh":"第 229 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2181.7821188042,"ID":1912,"Title":"Design Movie Rental System","TitleZH":"设计电影租借系统","TitleSlug":"design-movie-rental-system","ContestSlug":"biweekly-contest-55","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 55","ContestID_zh":"第 55 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Design","slug":"design"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":2178.4249114144,"ID":2065,"Title":"Maximum Path Quality of a Graph","TitleZH":"最大化一张图中的路径价值","TitleSlug":"maximum-path-quality-of-a-graph","ContestSlug":"weekly-contest-266","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 266","ContestID_zh":"第 266 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Backtracking","slug":"backtracking"},{"name":"Graph","slug":"graph"}]},{"Rating":2175.6850426027,"ID":1420,"Title":"Build Array Where You Can Find The Maximum Exactly K Comparisons","TitleZH":"生成数组","TitleSlug":"build-array-where-you-can-find-the-maximum-exactly-k-comparisons","ContestSlug":"weekly-contest-185","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 185","ContestID_zh":"第 185 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2175.1190473433,"ID":2454,"Title":"Next Greater Element IV","TitleZH":"下一个更大元素 IV","TitleSlug":"next-greater-element-iv","ContestSlug":"biweekly-contest-90","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 90","ContestID_zh":"第 90 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Stack","slug":"stack"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Monotonic Stack","slug":"monotonic-stack"}]},{"Rating":2171.716066664,"ID":1691,"Title":"Maximum Height by Stacking Cuboids ","TitleZH":"堆叠长方体的最大高度","TitleSlug":"maximum-height-by-stacking-cuboids","ContestSlug":"weekly-contest-219","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 219","ContestID_zh":"第 219 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Sorting","slug":"sorting"}]},{"Rating":2170.1079846744,"ID":1862,"Title":"Sum of Floored Pairs","TitleZH":"向下取整数对和","TitleSlug":"sum-of-floored-pairs","ContestSlug":"biweekly-contest-52","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 52","ContestID_zh":"第 52 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Binary Search","slug":"binary-search"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":2170.0439693714,"ID":1931,"Title":"Painting a Grid With Three Different Colors","TitleZH":"用三种不同颜色为网格涂色","TitleSlug":"painting-a-grid-with-three-different-colors","ContestSlug":"weekly-contest-249","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 249","ContestID_zh":"第 249 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2168.7531235448,"ID":786,"Title":"K-th Smallest Prime Fraction","TitleZH":"第 K 个最小的素数分数","TitleSlug":"k-th-smallest-prime-fraction","ContestSlug":"weekly-contest-72","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 72","ContestID_zh":"第 72 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":2164.8287157213,"ID":1036,"Title":"Escape a Large Maze","TitleZH":"逃离大迷宫","TitleSlug":"escape-a-large-maze","ContestSlug":"weekly-contest-134","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 134","ContestID_zh":"第 134 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"}]},{"Rating":2158.8988728254,"ID":2122,"Title":"Recover the Original Array","TitleZH":"还原原数组","TitleSlug":"recover-the-original-array","ContestSlug":"weekly-contest-273","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 273","ContestID_zh":"第 273 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Sorting","slug":"sorting"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":2158.7683843245,"ID":2102,"Title":"Sequentially Ordinal Rank Tracker","TitleZH":"序列顺序查询","TitleSlug":"sequentially-ordinal-rank-tracker","ContestSlug":"biweekly-contest-67","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 67","ContestID_zh":"第 67 场双周赛","topicTags":[{"name":"Design","slug":"design"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Data Stream","slug":"data-stream"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":2157.5814371481,"ID":2218,"Title":"Maximum Value of K Coins From Piles","TitleZH":"从栈中取出 K 个硬币的最大面值和","TitleSlug":"maximum-value-of-k-coins-from-piles","ContestSlug":"weekly-contest-286","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 286","ContestID_zh":"第 286 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":2156.9515428364,"ID":1515,"Title":"Best Position for a Service Centre","TitleZH":"服务中心的最佳位置","TitleSlug":"best-position-for-a-service-centre","ContestSlug":"weekly-contest-197","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 197","ContestID_zh":"第 197 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Geometry","slug":"geometry"},{"name":"Randomized","slug":"randomized"}]},{"Rating":2147.1828941776,"ID":1610,"Title":"Maximum Number of Visible Points","TitleZH":"可见点的最大数目","TitleSlug":"maximum-number-of-visible-points","ContestSlug":"weekly-contest-209","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 209","ContestID_zh":"第 209 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Geometry","slug":"geometry"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Sorting","slug":"sorting"}]},{"Rating":2146.639581998,"ID":1906,"Title":"Minimum Absolute Difference Queries","TitleZH":"查询差绝对值的最小值","TitleSlug":"minimum-absolute-difference-queries","ContestSlug":"weekly-contest-246","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 246","ContestID_zh":"第 246 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"}]},{"Rating":2145.183995267,"ID":1879,"Title":"Minimum XOR Sum of Two Arrays","TitleZH":"两个数组最小的异或值之和","TitleSlug":"minimum-xor-sum-of-two-arrays","ContestSlug":"biweekly-contest-53","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 53","ContestID_zh":"第 53 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":2140.0220703954,"ID":906,"Title":"Super Palindromes","TitleZH":"超级回文数","TitleSlug":"super-palindromes","ContestSlug":"weekly-contest-102","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 102","ContestID_zh":"第 102 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":2137.5633267453,"ID":2290,"Title":"Minimum Obstacle Removal to Reach Corner","TitleZH":"到达角落需要移除障碍物的最小数目","TitleSlug":"minimum-obstacle-removal-to-reach-corner","ContestSlug":"weekly-contest-295","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 295","ContestID_zh":"第 295 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Matrix","slug":"matrix"},{"name":"Shortest Path","slug":"shortest-path"}]},{"Rating":2136.3013259524,"ID":2382,"Title":"Maximum Segment Sum After Removals","TitleZH":"删除操作后的最大子段和","TitleSlug":"maximum-segment-sum-after-removals","ContestSlug":"biweekly-contest-85","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 85","ContestID_zh":"第 85 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Union Find","slug":"union-find"},{"name":"Prefix Sum","slug":"prefix-sum"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":2135.5738659086,"ID":959,"Title":"Regions Cut By Slashes","TitleZH":"由斜杠划分区域","TitleSlug":"regions-cut-by-slashes","ContestSlug":"weekly-contest-115","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 115","ContestID_zh":"第 115 场周赛","topicTags":[{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Graph","slug":"graph"}]},{"Rating":2134.5448970405,"ID":910,"Title":"Smallest Range II","TitleZH":"最小差值 II","TitleSlug":"smallest-range-ii","ContestSlug":"weekly-contest-103","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 103","ContestID_zh":"第 103 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":2133.9592509012,"ID":1439,"Title":"Find the Kth Smallest Sum of a Matrix With Sorted Rows","TitleZH":"有序矩阵中的第 k 个最小数组和","TitleSlug":"find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows","ContestSlug":"weekly-contest-187","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 187","ContestID_zh":"第 187 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Matrix","slug":"matrix"}]},{"Rating":2133.1003195919,"ID":898,"Title":"Bitwise ORs of Subarrays","TitleZH":"子数组按位或操作","TitleSlug":"bitwise-ors-of-subarrays","ContestSlug":"weekly-contest-100","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 100","ContestID_zh":"第 100 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":2131.7917160422,"ID":1579,"Title":"Remove Max Number of Edges to Keep Graph Fully Traversable","TitleZH":"保证图可完全遍历","TitleSlug":"remove-max-number-of-edges-to-keep-graph-fully-traversable","ContestSlug":"weekly-contest-205","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 205","ContestID_zh":"第 205 场周赛","topicTags":[{"name":"Union Find","slug":"union-find"},{"name":"Graph","slug":"graph"}]},{"Rating":2130.9348604091,"ID":2076,"Title":"Process Restricted Friend Requests","TitleZH":"处理含限制条件的好友请求","TitleSlug":"process-restricted-friend-requests","ContestSlug":"weekly-contest-267","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 267","ContestID_zh":"第 267 场周赛","topicTags":[{"name":"Union Find","slug":"union-find"},{"name":"Graph","slug":"graph"}]},{"Rating":2130.1135718486,"ID":1039,"Title":"Minimum Score Triangulation of Polygon","TitleZH":"多边形三角剖分的最低得分","TitleSlug":"minimum-score-triangulation-of-polygon","ContestSlug":"weekly-contest-135","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 135","ContestID_zh":"第 135 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2129.7051442916,"ID":798,"Title":"Smallest Rotation with Highest Score","TitleZH":"得分最高的最小轮调","TitleSlug":"smallest-rotation-with-highest-score","ContestSlug":"weekly-contest-75","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 75","ContestID_zh":"第 75 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":2126.6864346508,"ID":1444,"Title":"Number of Ways of Cutting a Pizza","TitleZH":"切披萨的方案数","TitleSlug":"number-of-ways-of-cutting-a-pizza","ContestSlug":"weekly-contest-188","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 188","ContestID_zh":"第 188 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Memoization","slug":"memoization"},{"name":"Matrix","slug":"matrix"}]},{"Rating":2126.3922279277,"ID":2246,"Title":"Longest Path With Different Adjacent Characters","TitleZH":"相邻字符不同的最长路径","TitleSlug":"longest-path-with-different-adjacent-characters","ContestSlug":"weekly-contest-289","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 289","ContestID_zh":"第 289 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Graph","slug":"graph"},{"name":"Topological Sort","slug":"topological-sort"}]},{"Rating":2125.3125624762,"ID":1955,"Title":"Count Number of Special Subsequences","TitleZH":"统计特殊子序列的数目","TitleSlug":"count-number-of-special-subsequences","ContestSlug":"weekly-contest-252","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 252","ContestID_zh":"第 252 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2124.1329592058,"ID":968,"Title":"Binary Tree Cameras","TitleZH":"监控二叉树","TitleSlug":"binary-tree-cameras","ContestSlug":"weekly-contest-117","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 117","ContestID_zh":"第 117 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":2124.0317207867,"ID":1654,"Title":"Minimum Jumps to Reach Home","TitleZH":"到家的最少跳跃次数","TitleSlug":"minimum-jumps-to-reach-home","ContestSlug":"biweekly-contest-39","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 39","ContestID_zh":"第 39 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Breadth-First Search","slug":"breadth-first-search"}]},{"Rating":2123.5708982185,"ID":1970,"Title":"Last Day Where You Can Still Cross","TitleZH":"你能穿过矩阵的最后一天","TitleSlug":"last-day-where-you-can-still-cross","ContestSlug":"weekly-contest-254","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 254","ContestID_zh":"第 254 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Matrix","slug":"matrix"}]},{"Rating":2121.3147151648,"ID":972,"Title":"Equal Rational Numbers","TitleZH":"相等的有理数","TitleSlug":"equal-rational-numbers","ContestSlug":"weekly-contest-118","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 118","ContestID_zh":"第 118 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"}]},{"Rating":2120.4466386371,"ID":2376,"Title":"Count Special Integers","TitleZH":"统计特殊整数","TitleSlug":"count-special-integers","ContestSlug":"weekly-contest-306","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 306","ContestID_zh":"第 306 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2118.7923652824,"ID":1601,"Title":"Maximum Number of Achievable Transfer Requests","TitleZH":"最多可达成的换楼请求数目","TitleSlug":"maximum-number-of-achievable-transfer-requests","ContestSlug":"weekly-contest-208","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 208","ContestID_zh":"第 208 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Backtracking","slug":"backtracking"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":2116.493528295,"ID":1547,"Title":"Minimum Cost to Cut a Stick","TitleZH":"切棍子的最小成本","TitleSlug":"minimum-cost-to-cut-a-stick","ContestSlug":"weekly-contest-201","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 201","ContestID_zh":"第 201 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2115.0911494487,"ID":1483,"Title":"Kth Ancestor of a Tree Node","TitleZH":"树节点的第 K 个祖先","TitleSlug":"kth-ancestor-of-a-tree-node","ContestSlug":"weekly-contest-193","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 193","ContestID_zh":"第 193 场周赛","topicTags":[{"name":"Binary Search","slug":"binary-search"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Design","slug":"design"}]},{"Rating":2109.9830154953,"ID":1172,"Title":"Dinner Plate Stacks","TitleZH":"餐盘栈","TitleSlug":"dinner-plate-stacks","ContestSlug":"weekly-contest-151","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 151","ContestID_zh":"第 151 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Stack","slug":"stack"},{"name":"Design","slug":"design"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":2105.8582288624,"ID":2209,"Title":"Minimum White Tiles After Covering With Carpets","TitleZH":"用地毯覆盖后的最少白色砖块","TitleSlug":"minimum-white-tiles-after-covering-with-carpets","ContestSlug":"biweekly-contest-74","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 74","ContestID_zh":"第 74 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":2105.7761215397,"ID":1937,"Title":"Maximum Number of Points with Cost","TitleZH":"扣分后的最大得分","TitleSlug":"maximum-number-of-points-with-cost","ContestSlug":"weekly-contest-250","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 250","ContestID_zh":"第 250 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2104.9526046945,"ID":1944,"Title":"Number of Visible People in a Queue","TitleZH":"队列中可以看到的人数","TitleSlug":"number-of-visible-people-in-a-queue","ContestSlug":"biweekly-contest-57","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 57","ContestID_zh":"第 57 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Stack","slug":"stack"},{"name":"Monotonic Stack","slug":"monotonic-stack"}]},{"Rating":2104.7441214305,"ID":2088,"Title":"Count Fertile Pyramids in a Land","TitleZH":"统计农场中肥沃金字塔的数目","TitleSlug":"count-fertile-pyramids-in-a-land","ContestSlug":"biweekly-contest-66","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 66","ContestID_zh":"第 66 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Matrix","slug":"matrix"}]},{"Rating":2101.867342004,"ID":2430,"Title":"Maximum Deletions on a String","TitleZH":"对字母串可执行的最大删除数","TitleSlug":"maximum-deletions-on-a-string","ContestSlug":"weekly-contest-313","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 313","ContestID_zh":"第 313 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Rolling Hash","slug":"rolling-hash"},{"name":"String Matching","slug":"string-matching"},{"name":"Hash Function","slug":"hash-function"}]},{"Rating":2100.3248877105,"ID":793,"Title":"Preimage Size of Factorial Zeroes Function","TitleZH":"阶乘函数后 K 个零","TitleSlug":"preimage-size-of-factorial-zeroes-function","ContestSlug":"weekly-contest-74","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 74","ContestID_zh":"第 74 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":2096.6201393558,"ID":778,"Title":"Swim in Rising Water","TitleZH":"水位上升的泳池中游泳","TitleSlug":"swim-in-rising-water","ContestSlug":"weekly-contest-70","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 70","ContestID_zh":"第 70 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Matrix","slug":"matrix"}]},{"Rating":2096.6098086765,"ID":899,"Title":"Orderly Queue","TitleZH":"有序队列","TitleSlug":"orderly-queue","ContestSlug":"weekly-contest-100","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 100","ContestID_zh":"第 100 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"},{"name":"Sorting","slug":"sorting"}]},{"Rating":2094.592426537,"ID":1976,"Title":"Number of Ways to Arrive at Destination","TitleZH":"到达目的地的方案数","TitleSlug":"number-of-ways-to-arrive-at-destination","ContestSlug":"biweekly-contest-59","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 59","ContestID_zh":"第 59 场双周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Graph","slug":"graph"},{"name":"Topological Sort","slug":"topological-sort"},{"name":"Shortest Path","slug":"shortest-path"}]},{"Rating":2092.8943149547,"ID":2402,"Title":"Meeting Rooms III","TitleZH":"会议室 III","TitleSlug":"meeting-rooms-iii","ContestSlug":"weekly-contest-309","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 309","ContestID_zh":"第 309 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":2092.5366031561,"ID":2444,"Title":"Count Subarrays With Fixed Bounds","TitleZH":"统计定界子数组的数目","TitleSlug":"count-subarrays-with-fixed-bounds","ContestSlug":"weekly-contest-315","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 315","ContestID_zh":"第 315 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Queue","slug":"queue"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Monotonic Queue","slug":"monotonic-queue"}]},{"Rating":2092.4861692502,"ID":1049,"Title":"Last Stone Weight II","TitleZH":"最后一块石头的重量 II","TitleSlug":"last-stone-weight-ii","ContestSlug":"weekly-contest-137","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 137","ContestID_zh":"第 137 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2092.0222850837,"ID":2412,"Title":"Minimum Money Required Before Transactions","TitleZH":"完成所有交易的初始最少钱数","TitleSlug":"minimum-money-required-before-transactions","ContestSlug":"biweekly-contest-87","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 87","ContestID_zh":"第 87 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":2091.3820373571,"ID":1383,"Title":"Maximum Performance of a Team","TitleZH":"最大的团队表现值","TitleSlug":"maximum-performance-of-a-team","ContestSlug":"weekly-contest-180","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 180","ContestID_zh":"第 180 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":2090.6800569319,"ID":2193,"Title":"Minimum Number of Moves to Make Palindrome","TitleZH":"得到回文串的最少操作次数","TitleSlug":"minimum-number-of-moves-to-make-palindrome","ContestSlug":"biweekly-contest-73","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 73","ContestID_zh":"第 73 场双周赛","topicTags":[{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"},{"name":"Binary Indexed Tree","slug":"binary-indexed-tree"}]},{"Rating":2090.4183788498,"ID":2318,"Title":"Number of Distinct Roll Sequences","TitleZH":"不同骰子序列的数目","TitleSlug":"number-of-distinct-roll-sequences","ContestSlug":"biweekly-contest-81","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 81","ContestID_zh":"第 81 场双周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Memoization","slug":"memoization"}]},{"Rating":2087.2049275667,"ID":1563,"Title":"Stone Game V","TitleZH":"石子游戏 V","TitleSlug":"stone-game-v","ContestSlug":"weekly-contest-203","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 203","ContestID_zh":"第 203 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Game Theory","slug":"game-theory"}]},{"Rating":2084.9697035674,"ID":982,"Title":"Triples with Bitwise AND Equal To Zero","TitleZH":"按位与为零的三元组","TitleSlug":"triples-with-bitwise-and-equal-to-zero","ContestSlug":"weekly-contest-121","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 121","ContestID_zh":"第 121 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":2084.6866916045,"ID":1192,"Title":"Critical Connections in a Network","TitleZH":"查找集群内的「关键连接」","TitleSlug":"critical-connections-in-a-network","ContestSlug":"weekly-contest-154","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 154","ContestID_zh":"第 154 场周赛","topicTags":[{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Graph","slug":"graph"},{"name":"Biconnected Component","slug":"biconnected-component"}]},{"Rating":2084.5752686737,"ID":2267,"Title":"Check if There Is a Valid Parentheses String Path","TitleZH":"检查是否有合法括号字符串路径","TitleSlug":"check-if-there-is-a-valid-parentheses-string-path","ContestSlug":"weekly-contest-292","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 292","ContestID_zh":"第 292 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Matrix","slug":"matrix"}]},{"Rating":2084.4980206639,"ID":2009,"Title":"Minimum Number of Operations to Make Array Continuous","TitleZH":"使数组连续的最少操作数","TitleSlug":"minimum-number-of-operations-to-make-array-continuous","ContestSlug":"biweekly-contest-61","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 61","ContestID_zh":"第 61 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":2084.2010769193,"ID":774,"Title":"Minimize Max Distance to Gas Station","TitleZH":"最小化去加油站的最大距离","TitleSlug":"minimize-max-distance-to-gas-station","ContestSlug":"weekly-contest-69","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 69","ContestID_zh":"第 69 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":2084.1404698713,"ID":2050,"Title":"Parallel Courses III","TitleZH":"并行课程 III","TitleSlug":"parallel-courses-iii","ContestSlug":"weekly-contest-264","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 264","ContestID_zh":"第 264 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Graph","slug":"graph"},{"name":"Topological Sort","slug":"topological-sort"}]},{"Rating":2081.8087755451,"ID":1494,"Title":"Parallel Courses II","TitleZH":"并行课程 II","TitleSlug":"parallel-courses-ii","ContestSlug":"biweekly-contest-29","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 29","ContestID_zh":"第 29 场双周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Graph","slug":"graph"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":2081.7518764643,"ID":1847,"Title":"Closest Room","TitleZH":"最近的房间","TitleSlug":"closest-room","ContestSlug":"biweekly-contest-51","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 51","ContestID_zh":"第 51 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sorting","slug":"sorting"}]},{"Rating":2081.6909344021,"ID":1639,"Title":"Number of Ways to Form a Target String Given a Dictionary","TitleZH":"通过给定词典构造目标字符串的方案数","TitleSlug":"number-of-ways-to-form-a-target-string-given-a-dictionary","ContestSlug":"biweekly-contest-38","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 38","ContestID_zh":"第 38 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2080.0425875741,"ID":1718,"Title":"Construct the Lexicographically Largest Valid Sequence","TitleZH":"构建字典序最大的可行序列","TitleSlug":"construct-the-lexicographically-largest-valid-sequence","ContestSlug":"biweekly-contest-43","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 43","ContestID_zh":"第 43 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Backtracking","slug":"backtracking"}]},{"Rating":2079.9846866239,"ID":1643,"Title":"Kth Smallest Instructions","TitleZH":"第 K 条最小指令","TitleSlug":"kth-smallest-instructions","ContestSlug":"weekly-contest-213","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 213","ContestID_zh":"第 213 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Combinatorics","slug":"combinatorics"}]},{"Rating":2079.1911227043,"ID":975,"Title":"Odd Even Jump","TitleZH":"奇偶跳","TitleSlug":"odd-even-jump","ContestSlug":"weekly-contest-119","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 119","ContestID_zh":"第 119 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Stack","slug":"stack"},{"name":"Monotonic Stack","slug":"monotonic-stack"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":2078.6986769435,"ID":1712,"Title":"Ways to Split Array Into Three Subarrays","TitleZH":"将数组分成三个子数组的方案数","TitleSlug":"ways-to-split-array-into-three-subarrays","ContestSlug":"weekly-contest-222","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 222","ContestID_zh":"第 222 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Binary Search","slug":"binary-search"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":2078.5417326415,"ID":1786,"Title":"Number of Restricted Paths From First to Last Node","TitleZH":"从第一个节点出发到最后一个节点的受限路径数","TitleSlug":"number-of-restricted-paths-from-first-to-last-node","ContestSlug":"weekly-contest-231","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 231","ContestID_zh":"第 231 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Graph","slug":"graph"},{"name":"Topological Sort","slug":"topological-sort"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Shortest Path","slug":"shortest-path"}]},{"Rating":2077.5054883516,"ID":843,"Title":"Guess the Word","TitleZH":"猜猜这个单词","TitleSlug":"guess-the-word","ContestSlug":"weekly-contest-86","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 86","ContestID_zh":"第 86 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"String","slug":"string"},{"name":"Interactive","slug":"interactive"},{"name":"Game Theory","slug":"game-theory"}]},{"Rating":2076.8975497986,"ID":1088,"Title":"Confusing Number II","TitleZH":"易混淆数 II","TitleSlug":"confusing-number-ii","ContestSlug":"biweekly-contest-2","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 2","ContestID_zh":"第 2 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Backtracking","slug":"backtracking"}]},{"Rating":2076.0155978787,"ID":2449,"Title":"Minimum Number of Operations to Make Arrays Similar","TitleZH":"使数组相似的最少操作次数","TitleSlug":"minimum-number-of-operations-to-make-arrays-similar","ContestSlug":"weekly-contest-316","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 316","ContestID_zh":"第 316 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":2075.9046975409,"ID":2354,"Title":"Number of Excellent Pairs","TitleZH":"优质数对的数目","TitleSlug":"number-of-excellent-pairs","ContestSlug":"weekly-contest-303","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 303","ContestID_zh":"第 303 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Binary Search","slug":"binary-search"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":2074.4120526679,"ID":871,"Title":"Minimum Number of Refueling Stops","TitleZH":"最低加油次数","TitleSlug":"minimum-number-of-refueling-stops","ContestSlug":"weekly-contest-93","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 93","ContestID_zh":"第 93 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Greedy","slug":"greedy"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":2073.0124645606,"ID":1850,"Title":"Minimum Adjacent Swaps to Reach the Kth Smallest Number","TitleZH":"邻位交换的最小次数","TitleSlug":"minimum-adjacent-swaps-to-reach-the-kth-smallest-number","ContestSlug":"weekly-contest-239","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 239","ContestID_zh":"第 239 场周赛","topicTags":[{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":2072.7264178313,"ID":1799,"Title":"Maximize Score After N Operations","TitleZH":"N 次操作后的最大分数和","TitleSlug":"maximize-score-after-n-operations","ContestSlug":"biweekly-contest-48","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 48","ContestID_zh":"第 48 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Backtracking","slug":"backtracking"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Number Theory","slug":"number-theory"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":2070.2102619334,"ID":1808,"Title":"Maximize Number of Nice Divisors","TitleZH":"好因子的最大数目","TitleSlug":"maximize-number-of-nice-divisors","ContestSlug":"weekly-contest-234","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 234","ContestID_zh":"第 234 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Recursion","slug":"recursion"}]},{"Rating":2069.7848729824,"ID":2514,"Title":"Count Anagrams","TitleZH":"统计同位异构字符串数目","TitleSlug":"count-anagrams","ContestSlug":"biweekly-contest-94","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 94","ContestID_zh":"第 94 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Math","slug":"math"},{"name":"String","slug":"string"},{"name":"Combinatorics","slug":"combinatorics"},{"name":"Counting","slug":"counting"}]},{"Rating":2069.4030284676,"ID":1168,"Title":"Optimize Water Distribution in a Village","TitleZH":"水资源分配优化","TitleSlug":"optimize-water-distribution-in-a-village","ContestSlug":"biweekly-contest-7","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 7","ContestID_zh":"第 7 场双周赛","topicTags":[{"name":"Union Find","slug":"union-find"},{"name":"Graph","slug":"graph"},{"name":"Minimum Spanning Tree","slug":"minimum-spanning-tree"}]},{"Rating":2068.806637566,"ID":1368,"Title":"Minimum Cost to Make at Least One Valid Path in a Grid","TitleZH":"使网格图至少有一条有效路径的最小代价","TitleSlug":"minimum-cost-to-make-at-least-one-valid-path-in-a-grid","ContestSlug":"weekly-contest-178","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 178","ContestID_zh":"第 178 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Matrix","slug":"matrix"},{"name":"Shortest Path","slug":"shortest-path"}]},{"Rating":2068.0043466118,"ID":1770,"Title":"Maximum Score from Performing Multiplication Operations","TitleZH":"执行乘法运算的最大分数","TitleSlug":"maximum-score-from-performing-multiplication-operations","ContestSlug":"weekly-contest-229","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 229","ContestID_zh":"第 229 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2067.0643721733,"ID":855,"Title":"Exam Room","TitleZH":"考场就座","TitleSlug":"exam-room","ContestSlug":"weekly-contest-89","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 89","ContestID_zh":"第 89 场周赛","topicTags":[{"name":"Design","slug":"design"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":2066.0972575597,"ID":801,"Title":"Minimum Swaps To Make Sequences Increasing","TitleZH":"使序列递增的最小交换次数","TitleSlug":"minimum-swaps-to-make-sequences-increasing","ContestSlug":"weekly-contest-76","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 76","ContestID_zh":"第 76 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2062.9876807625,"ID":2156,"Title":"Find Substring With Given Hash Value","TitleZH":"查找给定哈希值的子串","TitleSlug":"find-substring-with-given-hash-value","ContestSlug":"weekly-contest-278","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 278","ContestID_zh":"第 278 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Rolling Hash","slug":"rolling-hash"},{"name":"Hash Function","slug":"hash-function"}]},{"Rating":2062.3601158741,"ID":2106,"Title":"Maximum Fruits Harvested After at Most K Steps","TitleZH":"摘水果","TitleSlug":"maximum-fruits-harvested-after-at-most-k-steps","ContestSlug":"weekly-contest-271","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 271","ContestID_zh":"第 271 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":2060.379991517,"ID":2366,"Title":"Minimum Replacements to Sort the Array","TitleZH":"将数组排序的最少替换次数","TitleSlug":"minimum-replacements-to-sort-the-array","ContestSlug":"biweekly-contest-84","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 84","ContestID_zh":"第 84 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Greedy","slug":"greedy"}]},{"Rating":2060.0720834082,"ID":2508,"Title":"Add Edges to Make Degrees of All Nodes Even","TitleZH":"添加边使所有节点度数都为偶数","TitleSlug":"add-edges-to-make-degrees-of-all-nodes-even","ContestSlug":"weekly-contest-324","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 324","ContestID_zh":"第 324 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Graph","slug":"graph"}]},{"Rating":2059.4040623264,"ID":1131,"Title":"Maximum of Absolute Value Expression","TitleZH":"绝对值表达式的最大值","TitleSlug":"maximum-of-absolute-value-expression","ContestSlug":"weekly-contest-146","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 146","ContestID_zh":"第 146 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"}]},{"Rating":2057.4788263111,"ID":2197,"Title":"Replace Non-Coprime Numbers in Array","TitleZH":"替换数组中的非互质数","TitleSlug":"replace-non-coprime-numbers-in-array","ContestSlug":"weekly-contest-283","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 283","ContestID_zh":"第 283 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Stack","slug":"stack"},{"name":"Number Theory","slug":"number-theory"}]},{"Rating":2056.335494216,"ID":1473,"Title":"Paint House III","TitleZH":"粉刷房子 III","TitleSlug":"paint-house-iii","ContestSlug":"weekly-contest-192","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 192","ContestID_zh":"第 192 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2055.0970201875,"ID":1575,"Title":"Count All Possible Routes","TitleZH":"统计所有可行路径","TitleSlug":"count-all-possible-routes","ContestSlug":"biweekly-contest-34","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 34","ContestID_zh":"第 34 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Memoization","slug":"memoization"}]},{"Rating":2053.7468090497,"ID":839,"Title":"Similar String Groups","TitleZH":"相似字符串组","TitleSlug":"similar-string-groups","ContestSlug":"weekly-contest-85","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 85","ContestID_zh":"第 85 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"}]},{"Rating":2053.354609292,"ID":2467,"Title":"Most Profitable Path in a Tree","TitleZH":"树上最大得分和路径","TitleSlug":"most-profitable-path-in-a-tree","ContestSlug":"biweekly-contest-91","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 91","ContestID_zh":"第 91 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"}]},{"Rating":2051.0879431258,"ID":1856,"Title":"Maximum Subarray Min-Product","TitleZH":"子数组最小乘积的最大值","TitleSlug":"maximum-subarray-min-product","ContestSlug":"weekly-contest-240","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 240","ContestID_zh":"第 240 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Stack","slug":"stack"},{"name":"Monotonic Stack","slug":"monotonic-stack"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":2050.715977457,"ID":1224,"Title":"Maximum Equal Frequency","TitleZH":"最大相等频率","TitleSlug":"maximum-equal-frequency","ContestSlug":"weekly-contest-158","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 158","ContestID_zh":"第 158 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"}]},{"Rating":2050.2553211463,"ID":1648,"Title":"Sell Diminishing-Valued Colored Balls","TitleZH":"销售价值减少的颜色球","TitleSlug":"sell-diminishing-valued-colored-balls","ContestSlug":"weekly-contest-214","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 214","ContestID_zh":"第 214 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Binary Search","slug":"binary-search"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":2048.0976546787,"ID":1553,"Title":"Minimum Number of Days to Eat N Oranges","TitleZH":"吃掉 N 个橘子的最少天数","TitleSlug":"minimum-number-of-days-to-eat-n-oranges","ContestSlug":"weekly-contest-202","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 202","ContestID_zh":"第 202 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Memoization","slug":"memoization"}]},{"Rating":2040.5621123027,"ID":1751,"Title":"Maximum Number of Events That Can Be Attended II","TitleZH":"最多可以参加的会议数目 II","TitleSlug":"maximum-number-of-events-that-can-be-attended-ii","ContestSlug":"biweekly-contest-45","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 45","ContestID_zh":"第 45 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2040.539289037,"ID":1371,"Title":"Find the Longest Substring Containing Vowels in Even Counts","TitleZH":"每个元音包含偶数次的最长子字符串","TitleSlug":"find-the-longest-substring-containing-vowels-in-even-counts","ContestSlug":"biweekly-contest-21","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 21","ContestID_zh":"第 21 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":2039.110874689,"ID":1201,"Title":"Ugly Number III","TitleZH":"丑数 III","TitleSlug":"ugly-number-iii","ContestSlug":"weekly-contest-155","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 155","ContestID_zh":"第 155 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Binary Search","slug":"binary-search"},{"name":"Number Theory","slug":"number-theory"}]},{"Rating":2038.8592725467,"ID":1590,"Title":"Make Sum Divisible by P","TitleZH":"使数组和能被 P 整除","TitleSlug":"make-sum-divisible-by-p","ContestSlug":"biweekly-contest-35","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 35","ContestID_zh":"第 35 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":2037.6527962599,"ID":2116,"Title":"Check if a Parentheses String Can Be Valid","TitleZH":"判断一个括号字符串是否有效","TitleSlug":"check-if-a-parentheses-string-can-be-valid","ContestSlug":"biweekly-contest-68","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 68","ContestID_zh":"第 68 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"},{"name":"Greedy","slug":"greedy"}]},{"Rating":2036.7410194704,"ID":2245,"Title":"Maximum Trailing Zeros in a Cornered Path","TitleZH":"转角路径的乘积中最多能有几个尾随零","TitleSlug":"maximum-trailing-zeros-in-a-cornered-path","ContestSlug":"weekly-contest-289","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 289","ContestID_zh":"第 289 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":2036.7206020719,"ID":1348,"Title":"Tweet Counts Per Frequency","TitleZH":"推文计数","TitleSlug":"tweet-counts-per-frequency","ContestSlug":"weekly-contest-175","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 175","ContestID_zh":"第 175 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Binary Search","slug":"binary-search"},{"name":"Design","slug":"design"},{"name":"Sorting","slug":"sorting"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":2034.9740902393,"ID":1140,"Title":"Stone Game II","TitleZH":"石子游戏 II","TitleSlug":"stone-game-ii","ContestSlug":"weekly-contest-147","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 147","ContestID_zh":"第 147 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Game Theory","slug":"game-theory"}]},{"Rating":2034.9420578559,"ID":1335,"Title":"Minimum Difficulty of a Job Schedule","TitleZH":"工作计划的最低难度","TitleSlug":"minimum-difficulty-of-a-job-schedule","ContestSlug":"weekly-contest-173","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 173","ContestID_zh":"第 173 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2034.6759416871,"ID":947,"Title":"Most Stones Removed with Same Row or Column","TitleZH":"移除最多的同行或同列石头","TitleSlug":"most-stones-removed-with-same-row-or-column","ContestSlug":"weekly-contest-112","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 112","ContestID_zh":"第 112 场周赛","topicTags":[{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Graph","slug":"graph"}]},{"Rating":2034.4067304341,"ID":828,"Title":"Count Unique Characters of All Substrings of a Given String","TitleZH":"统计子串中的唯一字符","TitleSlug":"count-unique-characters-of-all-substrings-of-a-given-string","ContestSlug":"weekly-contest-83","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 83","ContestID_zh":"第 83 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2033.4597721985,"ID":2136,"Title":"Earliest Possible Day of Full Bloom","TitleZH":"全部开花的最早一天","TitleSlug":"earliest-possible-day-of-full-bloom","ContestSlug":"weekly-contest-275","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 275","ContestID_zh":"第 275 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":2033.1699277531,"ID":2262,"Title":"Total Appeal of A String","TitleZH":"字符串的总引力","TitleSlug":"total-appeal-of-a-string","ContestSlug":"weekly-contest-291","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 291","ContestID_zh":"第 291 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2032.4773038683,"ID":1425,"Title":"Constrained Subsequence Sum","TitleZH":"带限制的子序列和","TitleSlug":"constrained-subsequence-sum","ContestSlug":"weekly-contest-186","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 186","ContestID_zh":"第 186 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Queue","slug":"queue"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Monotonic Queue","slug":"monotonic-queue"}]},{"Rating":2030.1021023033,"ID":2426,"Title":"Number of Pairs Satisfying Inequality","TitleZH":"满足不等式的数对数目","TitleSlug":"number-of-pairs-satisfying-inequality","ContestSlug":"biweekly-contest-88","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 88","ContestID_zh":"第 88 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Divide and Conquer","slug":"divide-and-conquer"},{"name":"Binary Indexed Tree","slug":"binary-indexed-tree"},{"name":"Segment Tree","slug":"segment-tree"},{"name":"Merge Sort","slug":"merge-sort"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":2029.1301557536,"ID":1231,"Title":"Divide Chocolate","TitleZH":"分享巧克力","TitleSlug":"divide-chocolate","ContestSlug":"biweekly-contest-11","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 11","ContestID_zh":"第 11 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":2027.8772739639,"ID":895,"Title":"Maximum Frequency Stack","TitleZH":"最大频率栈","TitleSlug":"maximum-frequency-stack","ContestSlug":"weekly-contest-99","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 99","ContestID_zh":"第 99 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Stack","slug":"stack"},{"name":"Design","slug":"design"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":2027.7304121046,"ID":1320,"Title":"Minimum Distance to Type a Word Using Two Fingers","TitleZH":"二指输入的的最小距离","TitleSlug":"minimum-distance-to-type-a-word-using-two-fingers","ContestSlug":"weekly-contest-171","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 171","ContestID_zh":"第 171 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2027.3839266711,"ID":1626,"Title":"Best Team With No Conflicts","TitleZH":"无矛盾的最佳球队","TitleSlug":"best-team-with-no-conflicts","ContestSlug":"weekly-contest-211","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 211","ContestID_zh":"第 211 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Sorting","slug":"sorting"}]},{"Rating":2026.8957817007,"ID":1406,"Title":"Stone Game III","TitleZH":"石子游戏 III","TitleSlug":"stone-game-iii","ContestSlug":"weekly-contest-183","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 183","ContestID_zh":"第 183 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Game Theory","slug":"game-theory"}]},{"Rating":2025.1529365814,"ID":1067,"Title":"Digit Count in Range","TitleZH":"范围内的数字计数","TitleSlug":"digit-count-in-range","ContestSlug":"biweekly-contest-1","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 1","ContestID_zh":"第 1 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2025.0377429311,"ID":751,"Title":"IP to CIDR","TitleZH":"IP 到 CIDR","TitleSlug":"ip-to-cidr","ContestSlug":"weekly-contest-64","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 64","ContestID_zh":"第 64 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":2024.3797833173,"ID":1734,"Title":"Decode XORed Permutation","TitleZH":"解码异或后的排列","TitleSlug":"decode-xored-permutation","ContestSlug":"biweekly-contest-44","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 44","ContestID_zh":"第 44 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":2022.8520613737,"ID":1235,"Title":"Maximum Profit in Job Scheduling","TitleZH":"规划兼职工作","TitleSlug":"maximum-profit-in-job-scheduling","ContestSlug":"weekly-contest-159","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 159","ContestID_zh":"第 159 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Sorting","slug":"sorting"}]},{"Rating":2022.4752963768,"ID":1210,"Title":"Minimum Moves to Reach Target with Rotations","TitleZH":"穿过迷宫的最少移动次数","TitleSlug":"minimum-moves-to-reach-target-with-rotations","ContestSlug":"weekly-contest-156","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 156","ContestID_zh":"第 156 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Matrix","slug":"matrix"}]},{"Rating":2022.3137128296,"ID":2251,"Title":"Number of Flowers in Full Bloom","TitleZH":"花期内花的数目","TitleSlug":"number-of-flowers-in-full-bloom","ContestSlug":"weekly-contest-290","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 290","ContestID_zh":"第 290 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sorting","slug":"sorting"},{"name":"Prefix Sum","slug":"prefix-sum"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":2021.7790710467,"ID":2271,"Title":"Maximum White Tiles Covered by a Carpet","TitleZH":"毯子覆盖的最多白色砖块数","TitleSlug":"maximum-white-tiles-covered-by-a-carpet","ContestSlug":"biweekly-contest-78","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 78","ContestID_zh":"第 78 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":2020.6775180586,"ID":2517,"Title":"Maximum Tastiness of Candy Basket","TitleZH":"礼盒的最大甜蜜度","TitleSlug":"maximum-tastiness-of-candy-basket","ContestSlug":"weekly-contest-325","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 325","ContestID_zh":"第 325 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sorting","slug":"sorting"}]},{"Rating":2019.5399647546,"ID":909,"Title":"Snakes and Ladders","TitleZH":"蛇梯棋","TitleSlug":"snakes-and-ladders","ContestSlug":"weekly-contest-103","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 103","ContestID_zh":"第 103 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Matrix","slug":"matrix"}]},{"Rating":2015.7291888336,"ID":1353,"Title":"Maximum Number of Events That Can Be Attended","TitleZH":"最多可以参加的会议数目","TitleSlug":"maximum-number-of-events-that-can-be-attended","ContestSlug":"weekly-contest-176","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 176","ContestID_zh":"第 176 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":2014.7655493665,"ID":1354,"Title":"Construct Target Array With Multiple Sums","TitleZH":"多次求和构造目标数组","TitleSlug":"construct-target-array-with-multiple-sums","ContestSlug":"weekly-contest-176","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 176","ContestID_zh":"第 176 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":2014.2979320644,"ID":1105,"Title":"Filling Bookcase Shelves","TitleZH":"填充书架","TitleSlug":"filling-bookcase-shelves","ContestSlug":"weekly-contest-143","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 143","ContestID_zh":"第 143 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2013.4354344791,"ID":2472,"Title":"Maximum Number of Non-overlapping Palindrome Substrings","TitleZH":"不重叠回文子字符串的最大数目","TitleSlug":"maximum-number-of-non-overlapping-palindrome-substrings","ContestSlug":"weekly-contest-319","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 319","ContestID_zh":"第 319 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2011.9703133514,"ID":2477,"Title":"Minimum Fuel Cost to Report to the Capital","TitleZH":"到达首都的最少油耗","TitleSlug":"minimum-fuel-cost-to-report-to-the-capital","ContestSlug":"weekly-contest-320","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 320","ContestID_zh":"第 320 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"}]},{"Rating":2011.3542735398,"ID":1102,"Title":"Path With Maximum Minimum Value","TitleZH":"得分最高的路径","TitleSlug":"path-with-maximum-minimum-value","ContestSlug":"biweekly-contest-3","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 3","ContestID_zh":"第 3 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Matrix","slug":"matrix"}]},{"Rating":2011.0496162515,"ID":2333,"Title":"Minimum Sum of Squared Difference","TitleZH":"最小差值平方和","TitleSlug":"minimum-sum-of-squared-difference","ContestSlug":"biweekly-contest-82","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 82","ContestID_zh":"第 82 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":2010.5524756946,"ID":880,"Title":"Decoded String at Index","TitleZH":"索引处的解码字符串","TitleSlug":"decoded-string-at-index","ContestSlug":"weekly-contest-96","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 96","ContestID_zh":"第 96 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"}]},{"Rating":2009.7322365973,"ID":1981,"Title":"Minimize the Difference Between Target and Chosen Elements","TitleZH":"最小化目标值与所选元素的差","TitleSlug":"minimize-the-difference-between-target-and-chosen-elements","ContestSlug":"weekly-contest-255","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 255","ContestID_zh":"第 255 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Matrix","slug":"matrix"}]},{"Rating":2008.40650791,"ID":1223,"Title":"Dice Roll Simulation","TitleZH":"掷骰子模拟","TitleSlug":"dice-roll-simulation","ContestSlug":"weekly-contest-158","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 158","ContestID_zh":"第 158 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":2005.5862669078,"ID":1888,"Title":"Minimum Number of Flips to Make the Binary String Alternating","TitleZH":"使二进制字符串字符交替的最少反转次数","TitleSlug":"minimum-number-of-flips-to-make-the-binary-string-alternating","ContestSlug":"weekly-contest-244","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 244","ContestID_zh":"第 244 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Greedy","slug":"greedy"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":2005.3737929084,"ID":2448,"Title":"Minimum Cost to Make Array Equal","TitleZH":"使数组相等的最小开销","TitleSlug":"minimum-cost-to-make-array-equal","ContestSlug":"weekly-contest-316","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 316","ContestID_zh":"第 316 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":2005.2755755378,"ID":1761,"Title":"Minimum Degree of a Connected Trio in a Graph","TitleZH":"一个图中连通三元组的最小度数","TitleSlug":"minimum-degree-of-a-connected-trio-in-a-graph","ContestSlug":"weekly-contest-228","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 228","ContestID_zh":"第 228 场周赛","topicTags":[{"name":"Graph","slug":"graph"}]},{"Rating":2004.5346526204,"ID":1927,"Title":"Sum Game","TitleZH":"求和游戏","TitleSlug":"sum-game","ContestSlug":"biweekly-contest-56","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 56","ContestID_zh":"第 56 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Greedy","slug":"greedy"},{"name":"Game Theory","slug":"game-theory"}]},{"Rating":2003.5794613668,"ID":2092,"Title":"Find All People With Secret","TitleZH":"找出知晓秘密的所有专家","TitleSlug":"find-all-people-with-secret","ContestSlug":"weekly-contest-269","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 269","ContestID_zh":"第 269 场周赛","topicTags":[{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Graph","slug":"graph"},{"name":"Sorting","slug":"sorting"}]},{"Rating":2001.2074132383,"ID":2328,"Title":"Number of Increasing Paths in a Grid","TitleZH":"网格图中递增路径的数目","TitleSlug":"number-of-increasing-paths-in-a-grid","ContestSlug":"weekly-contest-300","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 300","ContestID_zh":"第 300 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"},{"name":"Topological Sort","slug":"topological-sort"},{"name":"Memoization","slug":"memoization"},{"name":"Matrix","slug":"matrix"}]},{"Rating":2000.8441804448,"ID":1686,"Title":"Stone Game VI","TitleZH":"石子游戏 VI","TitleSlug":"stone-game-vi","ContestSlug":"biweekly-contest-41","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 41","ContestID_zh":"第 41 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Game Theory","slug":"game-theory"}]},{"Rating":2000.8021428612,"ID":911,"Title":"Online Election","TitleZH":"在线选举","TitleSlug":"online-election","ContestSlug":"weekly-contest-103","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 103","ContestID_zh":"第 103 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Binary Search","slug":"binary-search"},{"name":"Design","slug":"design"}]},{"Rating":1999.1208076854,"ID":765,"Title":"Couples Holding Hands","TitleZH":"情侣牵手","TitleSlug":"couples-holding-hands","ContestSlug":"weekly-contest-67","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 67","ContestID_zh":"第 67 场周赛","topicTags":[{"name":"Greedy","slug":"greedy"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Graph","slug":"graph"}]},{"Rating":1998.889914712,"ID":2488,"Title":"Count Subarrays With Median K","TitleZH":"统计中位数为 K 的子数组","TitleSlug":"count-subarrays-with-median-k","ContestSlug":"weekly-contest-321","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 321","ContestID_zh":"第 321 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1997.7013718153,"ID":2250,"Title":"Count Number of Rectangles Containing Each Point","TitleZH":"统计包含每个点的矩形数目","TitleSlug":"count-number-of-rectangles-containing-each-point","ContestSlug":"weekly-contest-290","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 290","ContestID_zh":"第 290 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Binary Indexed Tree","slug":"binary-indexed-tree"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1997.1824403719,"ID":1274,"Title":"Number of Ships in a Rectangle","TitleZH":"矩形内船只的数目","TitleSlug":"number-of-ships-in-a-rectangle","ContestSlug":"biweekly-contest-14","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 14","ContestID_zh":"第 14 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Divide and Conquer","slug":"divide-and-conquer"},{"name":"Interactive","slug":"interactive"}]},{"Rating":1995.2937073376,"ID":1986,"Title":"Minimum Number of Work Sessions to Finish the Tasks","TitleZH":"完成任务的最少工作时间段","TitleSlug":"minimum-number-of-work-sessions-to-finish-the-tasks","ContestSlug":"weekly-contest-256","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 256","ContestID_zh":"第 256 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Backtracking","slug":"backtracking"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":1994.3618892548,"ID":927,"Title":"Three Equal Parts","TitleZH":"三等分","TitleSlug":"three-equal-parts","ContestSlug":"weekly-contest-107","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 107","ContestID_zh":"第 107 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"}]},{"Rating":1992.0032292739,"ID":1625,"Title":"Lexicographically Smallest String After Applying Operations","TitleZH":"执行操作后字典序最小的字符串","TitleSlug":"lexicographically-smallest-string-after-applying-operations","ContestSlug":"weekly-contest-211","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 211","ContestID_zh":"第 211 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Breadth-First Search","slug":"breadth-first-search"}]},{"Rating":1990.7738526153,"ID":963,"Title":"Minimum Area Rectangle II","TitleZH":"最小面积矩形 II","TitleSlug":"minimum-area-rectangle-ii","ContestSlug":"weekly-contest-116","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 116","ContestID_zh":"第 116 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Geometry","slug":"geometry"}]},{"Rating":1990.2800994214,"ID":756,"Title":"Pyramid Transition Matrix","TitleZH":"金字塔转换矩阵","TitleSlug":"pyramid-transition-matrix","ContestSlug":"weekly-contest-65","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 65","ContestID_zh":"第 65 场周赛","topicTags":[{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"}]},{"Rating":1989.5369509422,"ID":902,"Title":"Numbers At Most N Given Digit Set","TitleZH":"最大为 N 的数字组合","TitleSlug":"numbers-at-most-n-given-digit-set","ContestSlug":"weekly-contest-101","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 101","ContestID_zh":"第 101 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"String","slug":"string"},{"name":"Binary Search","slug":"binary-search"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1985.2504512337,"ID":928,"Title":"Minimize Malware Spread II","TitleZH":"尽量减少恶意软件的传播 II","TitleSlug":"minimize-malware-spread-ii","ContestSlug":"weekly-contest-107","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 107","ContestID_zh":"第 107 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1985.2417520906,"ID":940,"Title":"Distinct Subsequences II","TitleZH":"不同的子序列 II","TitleSlug":"distinct-subsequences-ii","ContestSlug":"weekly-contest-110","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 110","ContestID_zh":"第 110 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1983.70440706,"ID":1733,"Title":"Minimum Number of People to Teach","TitleZH":"需要教语言的最少人数","TitleSlug":"minimum-number-of-people-to-teach","ContestSlug":"biweekly-contest-44","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 44","ContestID_zh":"第 44 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1983.2319731313,"ID":1250,"Title":"Check If It Is a Good Array","TitleZH":"检查「好数组」","TitleSlug":"check-if-it-is-a-good-array","ContestSlug":"weekly-contest-161","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 161","ContestID_zh":"第 161 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Number Theory","slug":"number-theory"}]},{"Rating":1982.5085994817,"ID":805,"Title":"Split Array With Same Average","TitleZH":"数组的均值分割","TitleSlug":"split-array-with-same-average","ContestSlug":"weekly-contest-77","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 77","ContestID_zh":"第 77 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":1979.9454101467,"ID":2151,"Title":"Maximum Good People Based on Statements","TitleZH":"基于陈述统计最多好人数","TitleSlug":"maximum-good-people-based-on-statements","ContestSlug":"weekly-contest-277","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 277","ContestID_zh":"第 277 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Backtracking","slug":"backtracking"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1979.1323403633,"ID":1278,"Title":"Palindrome Partitioning III","TitleZH":"分割回文串 III","TitleSlug":"palindrome-partitioning-iii","ContestSlug":"weekly-contest-165","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 165","ContestID_zh":"第 165 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1979.1112273597,"ID":1882,"Title":"Process Tasks Using Servers","TitleZH":"使用服务器处理任务","TitleSlug":"process-tasks-using-servers","ContestSlug":"weekly-contest-243","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 243","ContestID_zh":"第 243 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1976.7214151234,"ID":1092,"Title":"Shortest Common Supersequence ","TitleZH":"最短公共超序列","TitleSlug":"shortest-common-supersequence","ContestSlug":"weekly-contest-141","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 141","ContestID_zh":"第 141 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1975.5726300727,"ID":907,"Title":"Sum of Subarray Minimums","TitleZH":"子数组的最小值之和","TitleSlug":"sum-of-subarray-minimums","ContestSlug":"weekly-contest-102","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 102","ContestID_zh":"第 102 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Stack","slug":"stack"},{"name":"Monotonic Stack","slug":"monotonic-stack"}]},{"Rating":1973.7407637067,"ID":1488,"Title":"Avoid Flood in The City","TitleZH":"避免洪水泛滥","TitleSlug":"avoid-flood-in-the-city","ContestSlug":"weekly-contest-194","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 194","ContestID_zh":"第 194 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Binary Search","slug":"binary-search"},{"name":"Greedy","slug":"greedy"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1970.4608098164,"ID":1032,"Title":"Stream of Characters","TitleZH":"字符流","TitleSlug":"stream-of-characters","ContestSlug":"weekly-contest-133","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 133","ContestID_zh":"第 133 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Design","slug":"design"},{"name":"Trie","slug":"trie"},{"name":"Data Stream","slug":"data-stream"}]},{"Rating":1969.9845549158,"ID":835,"Title":"Image Overlap","TitleZH":"图像重叠","TitleSlug":"image-overlap","ContestSlug":"weekly-contest-84","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 84","ContestID_zh":"第 84 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1969.2019235672,"ID":1943,"Title":"Describe the Painting","TitleZH":"描述绘画结果","TitleSlug":"describe-the-painting","ContestSlug":"biweekly-contest-57","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 57","ContestID_zh":"第 57 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1967.3284576938,"ID":1293,"Title":"Shortest Path in a Grid with Obstacles Elimination","TitleZH":"网格中的最短路径","TitleSlug":"shortest-path-in-a-grid-with-obstacles-elimination","ContestSlug":"weekly-contest-167","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 167","ContestID_zh":"第 167 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1966.7067914206,"ID":1969,"Title":"Minimum Non-Zero Product of the Array Elements","TitleZH":"数组元素的最小非零乘积","TitleSlug":"minimum-non-zero-product-of-the-array-elements","ContestSlug":"weekly-contest-254","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 254","ContestID_zh":"第 254 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Greedy","slug":"greedy"},{"name":"Recursion","slug":"recursion"}]},{"Rating":1965.1266122355,"ID":2439,"Title":"Minimize Maximum of Array","TitleZH":"最小化数组中的最大值","TitleSlug":"minimize-maximum-of-array","ContestSlug":"biweekly-contest-89","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 89","ContestID_zh":"第 89 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Greedy","slug":"greedy"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1964.3793590858,"ID":815,"Title":"Bus Routes","TitleZH":"公交路线","TitleSlug":"bus-routes","ContestSlug":"weekly-contest-79","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 79","ContestID_zh":"第 79 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Breadth-First Search","slug":"breadth-first-search"}]},{"Rating":1962.3314335449,"ID":802,"Title":"Find Eventual Safe States","TitleZH":"找到最终的安全状态","TitleSlug":"find-eventual-safe-states","ContestSlug":"weekly-contest-76","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 76","ContestID_zh":"第 76 场周赛","topicTags":[{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"},{"name":"Topological Sort","slug":"topological-sort"}]},{"Rating":1962.2005269503,"ID":1642,"Title":"Furthest Building You Can Reach","TitleZH":"可以到达的最远建筑","TitleSlug":"furthest-building-you-can-reach","ContestSlug":"weekly-contest-213","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 213","ContestID_zh":"第 213 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1961.4987013156,"ID":1537,"Title":"Get the Maximum Score","TitleZH":"最大得分","TitleSlug":"get-the-maximum-score","ContestSlug":"weekly-contest-200","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 200","ContestID_zh":"第 200 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1960.5763266754,"ID":2350,"Title":"Shortest Impossible Sequence of Rolls","TitleZH":"不可能得到的最短骰子序列","TitleSlug":"shortest-impossible-sequence-of-rolls","ContestSlug":"biweekly-contest-83","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 83","ContestID_zh":"第 83 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1960.5517123728,"ID":2392,"Title":"Build a Matrix With Conditions","TitleZH":"给定条件下构造矩阵","TitleSlug":"build-a-matrix-with-conditions","ContestSlug":"weekly-contest-308","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 308","ContestID_zh":"第 308 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Graph","slug":"graph"},{"name":"Topological Sort","slug":"topological-sort"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1956.7059585934,"ID":1463,"Title":"Cherry Pickup II","TitleZH":"摘樱桃 II","TitleSlug":"cherry-pickup-ii","ContestSlug":"biweekly-contest-27","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 27","ContestID_zh":"第 27 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1954.2533254344,"ID":1696,"Title":"Jump Game VI","TitleZH":"跳跃游戏 VI","TitleSlug":"jump-game-vi","ContestSlug":"weekly-contest-220","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 220","ContestID_zh":"第 220 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Queue","slug":"queue"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Monotonic Queue","slug":"monotonic-queue"}]},{"Rating":1953.137726744,"ID":2434,"Title":"Using a Robot to Print the Lexicographically Smallest String","TitleZH":"使用机器人打印字典序最小的字符串","TitleSlug":"using-a-robot-to-print-the-lexicographically-smallest-string","ContestSlug":"weekly-contest-314","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 314","ContestID_zh":"第 314 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1952.7073399331,"ID":1737,"Title":"Change Minimum Characters to Satisfy One of Three Conditions","TitleZH":"满足三条件之一需改变的最少字符数","TitleSlug":"change-minimum-characters-to-satisfy-one-of-three-conditions","ContestSlug":"weekly-contest-225","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 225","ContestID_zh":"第 225 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Counting","slug":"counting"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1951.5918682146,"ID":2435,"Title":"Paths in Matrix Whose Sum Is Divisible by K","TitleZH":"矩阵中和能被 K 整除的路径","TitleSlug":"paths-in-matrix-whose-sum-is-divisible-by-k","ContestSlug":"weekly-contest-314","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 314","ContestID_zh":"第 314 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1951.3509259668,"ID":1259,"Title":"Handshakes That Don't Cross","TitleZH":"不相交的握手","TitleSlug":"handshakes-that-dont-cross","ContestSlug":"biweekly-contest-13","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 13","ContestID_zh":"第 13 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1951.2096212775,"ID":1690,"Title":"Stone Game VII","TitleZH":"石子游戏 VII","TitleSlug":"stone-game-vii","ContestSlug":"weekly-contest-219","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 219","ContestID_zh":"第 219 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Game Theory","slug":"game-theory"}]},{"Rating":1949.0920823355,"ID":1153,"Title":"String Transforms Into Another String","TitleZH":"字符串转化","TitleSlug":"string-transforms-into-another-string","ContestSlug":"biweekly-contest-6","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 6","ContestID_zh":"第 6 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1948.489500779,"ID":2509,"Title":"Cycle Length Queries in a Tree","TitleZH":"查询树中环的长度","TitleSlug":"cycle-length-queries-in-a-tree","ContestSlug":"weekly-contest-324","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 324","ContestID_zh":"第 324 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1947.8832856412,"ID":2516,"Title":"Take K of Each Character From Left and Right","TitleZH":"每种字符至少取 K 个","TitleSlug":"take-k-of-each-character-from-left-and-right","ContestSlug":"weekly-contest-325","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 325","ContestID_zh":"第 325 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1947.5013967785,"ID":1631,"Title":"Path With Minimum Effort","TitleZH":"最小体力消耗路径","TitleSlug":"path-with-minimum-effort","ContestSlug":"weekly-contest-212","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 212","ContestID_zh":"第 212 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1945.7515607928,"ID":1793,"Title":"Maximum Score of a Good Subarray","TitleZH":"好子数组的最大分数","TitleSlug":"maximum-score-of-a-good-subarray","ContestSlug":"weekly-contest-232","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 232","ContestID_zh":"第 232 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Binary Search","slug":"binary-search"},{"name":"Stack","slug":"stack"},{"name":"Monotonic Stack","slug":"monotonic-stack"}]},{"Rating":1945.5095833982,"ID":1482,"Title":"Minimum Number of Days to Make m Bouquets","TitleZH":"制作 m 束花所需的最少天数","TitleSlug":"minimum-number-of-days-to-make-m-bouquets","ContestSlug":"weekly-contest-193","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 193","ContestID_zh":"第 193 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":1944.5673996888,"ID":2227,"Title":"Encrypt and Decrypt Strings","TitleZH":"加密解密字符串","TitleSlug":"encrypt-and-decrypt-strings","ContestSlug":"weekly-contest-287","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 287","ContestID_zh":"第 287 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Design","slug":"design"},{"name":"Trie","slug":"trie"}]},{"Rating":1940.6002290953,"ID":2111,"Title":"Minimum Operations to Make the Array K-Increasing","TitleZH":"使数组 K 递增的最少操作次数","TitleSlug":"minimum-operations-to-make-the-array-k-increasing","ContestSlug":"weekly-contest-272","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 272","ContestID_zh":"第 272 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":1939.9323330472,"ID":1760,"Title":"Minimum Limit of Balls in a Bag","TitleZH":"袋子里最少数目的球","TitleSlug":"minimum-limit-of-balls-in-a-bag","ContestSlug":"weekly-contest-228","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 228","ContestID_zh":"第 228 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":1938.6883365596,"ID":777,"Title":"Swap Adjacent in LR String","TitleZH":"在LR字符串中交换相邻字符","TitleSlug":"swap-adjacent-in-lr-string","ContestSlug":"weekly-contest-70","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 70","ContestID_zh":"第 70 场周赛","topicTags":[{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"}]},{"Rating":1938.2224916289,"ID":866,"Title":"Prime Palindrome","TitleZH":"回文素数","TitleSlug":"prime-palindrome","ContestSlug":"weekly-contest-92","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 92","ContestID_zh":"第 92 场周赛","topicTags":[{"name":"Math","slug":"math"}]},{"Rating":1938.0586460002,"ID":2411,"Title":"Smallest Subarrays With Maximum Bitwise OR","TitleZH":"按位或最大的最小子数组长度","TitleSlug":"smallest-subarrays-with-maximum-bitwise-or","ContestSlug":"biweekly-contest-87","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 87","ContestID_zh":"第 87 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1936.6613414859,"ID":813,"Title":"Largest Sum of Averages","TitleZH":"最大平均值和的分组","TitleSlug":"largest-sum-of-averages","ContestSlug":"weekly-contest-79","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 79","ContestID_zh":"第 79 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1934.3556201811,"ID":1818,"Title":"Minimum Absolute Sum Difference","TitleZH":"绝对差值和","TitleSlug":"minimum-absolute-sum-difference","ContestSlug":"weekly-contest-235","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 235","ContestID_zh":"第 235 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sorting","slug":"sorting"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":1933.9571917853,"ID":827,"Title":"Making A Large Island","TitleZH":"最大人工岛","TitleSlug":"making-a-large-island","ContestSlug":"weekly-contest-82","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 82","ContestID_zh":"第 82 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1933.2169470617,"ID":1964,"Title":"Find the Longest Valid Obstacle Course at Each Position","TitleZH":"找出到每个位置为止最长的有效障碍赛跑路线","TitleSlug":"find-the-longest-valid-obstacle-course-at-each-position","ContestSlug":"weekly-contest-253","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 253","ContestID_zh":"第 253 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Binary Indexed Tree","slug":"binary-indexed-tree"}]},{"Rating":1932.3730795204,"ID":996,"Title":"Number of Squareful Arrays","TitleZH":"正方形数组的数目","TitleSlug":"number-of-squareful-arrays","ContestSlug":"weekly-contest-124","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 124","ContestID_zh":"第 124 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Backtracking","slug":"backtracking"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":1931.7335479582,"ID":1574,"Title":"Shortest Subarray to be Removed to Make Array Sorted","TitleZH":"删除最短的子数组使剩余数组有序","TitleSlug":"shortest-subarray-to-be-removed-to-make-array-sorted","ContestSlug":"biweekly-contest-34","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 34","ContestID_zh":"第 34 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Binary Search","slug":"binary-search"},{"name":"Stack","slug":"stack"},{"name":"Monotonic Stack","slug":"monotonic-stack"}]},{"Rating":1931.0849921121,"ID":1798,"Title":"Maximum Number of Consecutive Values You Can Make","TitleZH":"你能构造出连续值的最大数目","TitleSlug":"maximum-number-of-consecutive-values-you-can-make","ContestSlug":"biweekly-contest-48","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 48","ContestID_zh":"第 48 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1929.9086934334,"ID":1705,"Title":"Maximum Number of Eaten Apples","TitleZH":"吃苹果的最大数目","TitleSlug":"maximum-number-of-eaten-apples","ContestSlug":"weekly-contest-221","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 221","ContestID_zh":"第 221 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1929.897343316,"ID":2018,"Title":"Check if Word Can Be Placed In Crossword","TitleZH":"判断单词是否能放入填字游戏内","TitleSlug":"check-if-word-can-be-placed-in-crossword","ContestSlug":"weekly-contest-260","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 260","ContestID_zh":"第 260 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1929.3184180196,"ID":1802,"Title":"Maximum Value at a Given Index in a Bounded Array","TitleZH":"有界数组中指定下标处的最大值","TitleSlug":"maximum-value-at-a-given-index-in-a-bounded-array","ContestSlug":"weekly-contest-233","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 233","ContestID_zh":"第 233 场周赛","topicTags":[{"name":"Binary Search","slug":"binary-search"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1928.2304187946,"ID":1562,"Title":"Find Latest Group of Size M","TitleZH":"查找大小为 M 的最新分组","TitleSlug":"find-latest-group-of-size-m","ContestSlug":"weekly-contest-203","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 203","ContestID_zh":"第 203 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1927.4000816649,"ID":1449,"Title":"Form Largest Integer With Digits That Add up to Target","TitleZH":"数位成本和为目标值的最大数字","TitleSlug":"form-largest-integer-with-digits-that-add-up-to-target","ContestSlug":"biweekly-contest-26","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 26","ContestID_zh":"第 26 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1926.7059583253,"ID":1727,"Title":"Largest Submatrix With Rearrangements","TitleZH":"重新排列后的最大子矩阵","TitleSlug":"largest-submatrix-with-rearrangements","ContestSlug":"weekly-contest-224","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 224","ContestID_zh":"第 224 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1924.964639491,"ID":1745,"Title":"Palindrome Partitioning IV","TitleZH":"回文串分割 IV","TitleSlug":"palindrome-partitioning-iv","ContestSlug":"weekly-contest-226","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 226","ContestID_zh":"第 226 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1919.7433862082,"ID":1552,"Title":"Magnetic Force Between Two Balls","TitleZH":"两球之间的磁力","TitleSlug":"magnetic-force-between-two-balls","ContestSlug":"weekly-contest-202","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 202","ContestID_zh":"第 202 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1919.6391896894,"ID":1416,"Title":"Restore The Array","TitleZH":"恢复数组","TitleSlug":"restore-the-array","ContestSlug":"biweekly-contest-24","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 24","ContestID_zh":"第 24 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1919.1749818083,"ID":1130,"Title":"Minimum Cost Tree From Leaf Values","TitleZH":"叶值的最小代价生成树","TitleSlug":"minimum-cost-tree-from-leaf-values","ContestSlug":"weekly-contest-146","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 146","ContestID_zh":"第 146 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Stack","slug":"stack"},{"name":"Greedy","slug":"greedy"},{"name":"Monotonic Stack","slug":"monotonic-stack"}]},{"Rating":1918.9960035055,"ID":2069,"Title":"Walking Robot Simulation II","TitleZH":"模拟行走机器人 II","TitleSlug":"walking-robot-simulation-ii","ContestSlug":"biweekly-contest-65","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 65","ContestID_zh":"第 65 场双周赛","topicTags":[{"name":"Design","slug":"design"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1917.2145829853,"ID":2398,"Title":"Maximum Number of Robots Within Budget","TitleZH":"预算内的最多机器人数目","TitleSlug":"maximum-number-of-robots-within-budget","ContestSlug":"biweekly-contest-86","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 86","ContestID_zh":"第 86 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Queue","slug":"queue"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1916.0689858272,"ID":1043,"Title":"Partition Array for Maximum Sum","TitleZH":"分隔数组以得到最大和","TitleSlug":"partition-array-for-maximum-sum","ContestSlug":"weekly-contest-136","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 136","ContestID_zh":"第 136 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1914.6717285348,"ID":2147,"Title":"Number of Ways to Divide a Long Corridor","TitleZH":"分隔长廊的方案数","TitleSlug":"number-of-ways-to-divide-a-long-corridor","ContestSlug":"biweekly-contest-70","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 70","ContestID_zh":"第 70 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1913.6704728453,"ID":1373,"Title":"Maximum Sum BST in Binary Tree","TitleZH":"二叉搜索子树的最大键值和","TitleSlug":"maximum-sum-bst-in-binary-tree","ContestSlug":"biweekly-contest-21","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 21","ContestID_zh":"第 21 场双周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Search Tree","slug":"binary-search-tree"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1912.8455659711,"ID":1671,"Title":"Minimum Number of Removals to Make Mountain Array","TitleZH":"得到山形数组的最少删除次数","TitleSlug":"minimum-number-of-removals-to-make-mountain-array","ContestSlug":"biweekly-contest-40","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 40","ContestID_zh":"第 40 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1912.8440554296,"ID":1898,"Title":"Maximum Number of Removable Characters","TitleZH":"可移除字符的最大数目","TitleSlug":"maximum-number-of-removable-characters","ContestSlug":"weekly-contest-245","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 245","ContestID_zh":"第 245 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":1912.0829958001,"ID":1147,"Title":"Longest Chunked Palindrome Decomposition","TitleZH":"段式回文","TitleSlug":"longest-chunked-palindrome-decomposition","ContestSlug":"weekly-contest-148","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 148","ContestID_zh":"第 148 场周赛","topicTags":[{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Greedy","slug":"greedy"},{"name":"Rolling Hash","slug":"rolling-hash"},{"name":"Hash Function","slug":"hash-function"}]},{"Rating":1911.8282317986,"ID":2296,"Title":"Design a Text Editor","TitleZH":"设计一个文本编辑器","TitleSlug":"design-a-text-editor","ContestSlug":"weekly-contest-296","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 296","ContestID_zh":"第 296 场周赛","topicTags":[{"name":"Linked List","slug":"linked-list"},{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"},{"name":"Design","slug":"design"},{"name":"Simulation","slug":"simulation"},{"name":"Doubly-Linked List","slug":"doubly-linked-list"}]},{"Rating":1911.7063530593,"ID":2049,"Title":"Count Nodes With the Highest Score","TitleZH":"统计最高分的节点数目","TitleSlug":"count-nodes-with-the-highest-score","ContestSlug":"weekly-contest-264","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 264","ContestID_zh":"第 264 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1911.1959516695,"ID":873,"Title":"Length of Longest Fibonacci Subsequence","TitleZH":"最长的斐波那契子序列的长度","TitleSlug":"length-of-longest-fibonacci-subsequence","ContestSlug":"weekly-contest-94","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 94","ContestID_zh":"第 94 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1909.4189035523,"ID":991,"Title":"Broken Calculator","TitleZH":"坏了的计算器","TitleSlug":"broken-calculator","ContestSlug":"weekly-contest-123","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 123","ContestID_zh":"第 123 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1908.3866125757,"ID":1124,"Title":"Longest Well-Performing Interval","TitleZH":"表现良好的最长时间段","TitleSlug":"longest-well-performing-interval","ContestSlug":"weekly-contest-145","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 145","ContestID_zh":"第 145 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Stack","slug":"stack"},{"name":"Monotonic Stack","slug":"monotonic-stack"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1900.8434122725,"ID":1665,"Title":"Minimum Initial Energy to Finish Tasks","TitleZH":"完成所有任务的最少初始能量","TitleSlug":"minimum-initial-energy-to-finish-tasks","ContestSlug":"weekly-contest-216","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 216","ContestID_zh":"第 216 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1899.6213866649,"ID":823,"Title":"Binary Trees With Factors","TitleZH":"带因子的二叉树","TitleSlug":"binary-trees-with-factors","ContestSlug":"weekly-contest-81","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 81","ContestID_zh":"第 81 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1897.5516652727,"ID":1878,"Title":"Get Biggest Three Rhombus Sums in a Grid","TitleZH":"矩阵中最大的三个菱形和","TitleSlug":"get-biggest-three-rhombus-sums-in-a-grid","ContestSlug":"biweekly-contest-53","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 53","ContestID_zh":"第 53 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Matrix","slug":"matrix"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1897.3309169423,"ID":780,"Title":"Reaching Points","TitleZH":"到达终点","TitleSlug":"reaching-points","ContestSlug":"weekly-contest-71","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 71","ContestID_zh":"第 71 场周赛","topicTags":[{"name":"Math","slug":"math"}]},{"Rating":1897.1863301576,"ID":2360,"Title":"Longest Cycle in a Graph","TitleZH":"图中的最长环","TitleSlug":"longest-cycle-in-a-graph","ContestSlug":"weekly-contest-304","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 304","ContestID_zh":"第 304 场周赛","topicTags":[{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Graph","slug":"graph"},{"name":"Topological Sort","slug":"topological-sort"}]},{"Rating":1896.7975214446,"ID":878,"Title":"Nth Magical Number","TitleZH":"第 N 个神奇数字","TitleSlug":"nth-magical-number","ContestSlug":"weekly-contest-95","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 95","ContestID_zh":"第 95 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":1896.1411567598,"ID":1871,"Title":"Jump Game VII","TitleZH":"跳跃游戏 VII","TitleSlug":"jump-game-vii","ContestSlug":"weekly-contest-242","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 242","ContestID_zh":"第 242 场周赛","topicTags":[{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1893.5143805402,"ID":2327,"Title":"Number of People Aware of a Secret","TitleZH":"知道秘密的人数","TitleSlug":"number-of-people-aware-of-a-secret","ContestSlug":"weekly-contest-300","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 300","ContestID_zh":"第 300 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Queue","slug":"queue"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1892.1600619469,"ID":1722,"Title":"Minimize Hamming Distance After Swap Operations","TitleZH":"执行交换操作后的最小汉明距离","TitleSlug":"minimize-hamming-distance-after-swap-operations","ContestSlug":"weekly-contest-223","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 223","ContestID_zh":"第 223 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Union Find","slug":"union-find"}]},{"Rating":1886.7040111218,"ID":2305,"Title":"Fair Distribution of Cookies","TitleZH":"公平分发饼干","TitleSlug":"fair-distribution-of-cookies","ContestSlug":"weekly-contest-297","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 297","ContestID_zh":"第 297 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Backtracking","slug":"backtracking"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":1885.9015646531,"ID":2064,"Title":"Minimized Maximum of Products Distributed to Any Store","TitleZH":"分配给商店的最多商品的最小值","TitleSlug":"minimized-maximum-of-products-distributed-to-any-store","ContestSlug":"weekly-contest-266","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 266","ContestID_zh":"第 266 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":1885.1051527272,"ID":1066,"Title":"Campus Bikes II","TitleZH":"校园自行车分配 II","TitleSlug":"campus-bikes-ii","ContestSlug":"biweekly-contest-1","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 1","ContestID_zh":"第 1 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Backtracking","slug":"backtracking"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":1885.0178370385,"ID":1326,"Title":"Minimum Number of Taps to Open to Water a Garden","TitleZH":"灌溉花园的最少水龙头数目","TitleSlug":"minimum-number-of-taps-to-open-to-water-a-garden","ContestSlug":"weekly-contest-172","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 172","ContestID_zh":"第 172 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1883.3541964032,"ID":2054,"Title":"Two Best Non-Overlapping Events","TitleZH":"两个最好的不重叠活动","TitleSlug":"two-best-non-overlapping-events","ContestSlug":"biweekly-contest-64","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 64","ContestID_zh":"第 64 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1881.6810367589,"ID":1255,"Title":"Maximum Score Words Formed by Letters","TitleZH":"得分最高的单词集合","TitleSlug":"maximum-score-words-formed-by-letters","ContestSlug":"weekly-contest-162","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 162","ContestID_zh":"第 162 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Backtracking","slug":"backtracking"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":1880.7433591583,"ID":858,"Title":"Mirror Reflection","TitleZH":"镜面反射","TitleSlug":"mirror-reflection","ContestSlug":"weekly-contest-90","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 90","ContestID_zh":"第 90 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Geometry","slug":"geometry"}]},{"Rating":1880.5909929633,"ID":1536,"Title":"Minimum Swaps to Arrange a Binary Grid","TitleZH":"排布二进制网格的最少交换次数","TitleSlug":"minimum-swaps-to-arrange-a-binary-grid","ContestSlug":"weekly-contest-200","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 200","ContestID_zh":"第 200 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1880.4226853663,"ID":1106,"Title":"Parsing A Boolean Expression","TitleZH":"解析布尔表达式","TitleSlug":"parsing-a-boolean-expression","ContestSlug":"weekly-contest-143","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 143","ContestID_zh":"第 143 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"},{"name":"Recursion","slug":"recursion"}]},{"Rating":1880.3261182293,"ID":754,"Title":"Reach a Number","TitleZH":"到达终点数字","TitleSlug":"reach-a-number","ContestSlug":"weekly-contest-65","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 65","ContestID_zh":"第 65 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":1880.0511044074,"ID":2101,"Title":"Detonate the Maximum Bombs","TitleZH":"引爆最多的炸弹","TitleSlug":"detonate-the-maximum-bombs","ContestSlug":"biweekly-contest-67","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 67","ContestID_zh":"第 67 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"},{"name":"Geometry","slug":"geometry"}]},{"Rating":1877.8983358307,"ID":1234,"Title":"Replace the Substring for Balanced String","TitleZH":"替换子串得到平衡字符串","TitleSlug":"replace-the-substring-for-balanced-string","ContestSlug":"weekly-contest-159","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 159","ContestID_zh":"第 159 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1877.5624603804,"ID":752,"Title":"Open the Lock","TitleZH":"打开转盘锁","TitleSlug":"open-the-lock","ContestSlug":"weekly-contest-64","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 64","ContestID_zh":"第 64 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Breadth-First Search","slug":"breadth-first-search"}]},{"Rating":1876.3854625677,"ID":955,"Title":"Delete Columns to Make Sorted II","TitleZH":"删列造序 II","TitleSlug":"delete-columns-to-make-sorted-ii","ContestSlug":"weekly-contest-114","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 114","ContestID_zh":"第 114 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1876.3611046625,"ID":1838,"Title":"Frequency of the Most Frequent Element","TitleZH":"最高频元素的频数","TitleSlug":"frequency-of-the-most-frequent-element","ContestSlug":"weekly-contest-238","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 238","ContestID_zh":"第 238 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Greedy","slug":"greedy"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Sorting","slug":"sorting"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1876.146019008,"ID":1392,"Title":"Longest Happy Prefix","TitleZH":"最长快乐前缀","TitleSlug":"longest-happy-prefix","ContestSlug":"weekly-contest-181","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 181","ContestID_zh":"第 181 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Rolling Hash","slug":"rolling-hash"},{"name":"String Matching","slug":"string-matching"},{"name":"Hash Function","slug":"hash-function"}]},{"Rating":1874.6468976233,"ID":1015,"Title":"Smallest Integer Divisible by K","TitleZH":"可被 K 整除的最小整数","TitleSlug":"smallest-integer-divisible-by-k","ContestSlug":"weekly-contest-129","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 129","ContestID_zh":"第 129 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Math","slug":"math"}]},{"Rating":1873.0367582475,"ID":1001,"Title":"Grid Illumination","TitleZH":"网格照明","TitleSlug":"grid-illumination","ContestSlug":"weekly-contest-125","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 125","ContestID_zh":"第 125 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"}]},{"Rating":1872.0350138774,"ID":1526,"Title":"Minimum Number of Increments on Subarrays to Form a Target Array","TitleZH":"形成目标数组的子数组最少增加次数","TitleSlug":"minimum-number-of-increments-on-subarrays-to-form-a-target-array","ContestSlug":"biweekly-contest-31","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 31","ContestID_zh":"第 31 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Stack","slug":"stack"},{"name":"Greedy","slug":"greedy"},{"name":"Monotonic Stack","slug":"monotonic-stack"}]},{"Rating":1871.8245218615,"ID":2008,"Title":"Maximum Earnings From Taxi","TitleZH":"出租车的最大盈利","TitleSlug":"maximum-earnings-from-taxi","ContestSlug":"biweekly-contest-61","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 61","ContestID_zh":"第 61 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1871.3112059413,"ID":1589,"Title":"Maximum Sum Obtained of Any Permutation","TitleZH":"所有排列中的最大和","TitleSlug":"maximum-sum-obtained-of-any-permutation","ContestSlug":"biweekly-contest-35","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 35","ContestID_zh":"第 35 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1869.402439128,"ID":2002,"Title":"Maximum Product of the Length of Two Palindromic Subsequences","TitleZH":"两个回文子序列长度的最大乘积","TitleSlug":"maximum-product-of-the-length-of-two-palindromic-subsequences","ContestSlug":"weekly-contest-258","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 258","ContestID_zh":"第 258 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Backtracking","slug":"backtracking"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":1868.9864493463,"ID":2212,"Title":"Maximum Points in an Archery Competition","TitleZH":"射箭比赛中的最大得分","TitleSlug":"maximum-points-in-an-archery-competition","ContestSlug":"weekly-contest-285","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 285","ContestID_zh":"第 285 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Recursion","slug":"recursion"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1868.9146755896,"ID":924,"Title":"Minimize Malware Spread","TitleZH":"尽量减少恶意软件的传播","TitleSlug":"minimize-malware-spread","ContestSlug":"weekly-contest-106","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 106","ContestID_zh":"第 106 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1868.1914861381,"ID":1616,"Title":"Split Two Strings to Make Palindrome","TitleZH":"分割两个字符串得到回文串","TitleSlug":"split-two-strings-to-make-palindrome","ContestSlug":"weekly-contest-210","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 210","ContestID_zh":"第 210 场周赛","topicTags":[{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"}]},{"Rating":1867.9916069568,"ID":1717,"Title":"Maximum Score From Removing Substrings","TitleZH":"删除子字符串的最大得分","TitleSlug":"maximum-score-from-removing-substrings","ContestSlug":"biweekly-contest-43","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 43","ContestID_zh":"第 43 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1867.8619694847,"ID":1605,"Title":"Find Valid Matrix Given Row and Column Sums","TitleZH":"给定行和列的和求可行矩阵","TitleSlug":"find-valid-matrix-given-row-and-column-sums","ContestSlug":"biweekly-contest-36","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 36","ContestID_zh":"第 36 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1866.3014601125,"ID":1340,"Title":"Jump Game V","TitleZH":"跳跃游戏 V","TitleSlug":"jump-game-v","ContestSlug":"weekly-contest-174","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 174","ContestID_zh":"第 174 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1865.3441063734,"ID":2039,"Title":"The Time When the Network Becomes Idle","TitleZH":"网络空闲的时刻","TitleSlug":"the-time-when-the-network-becomes-idle","ContestSlug":"biweekly-contest-63","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 63","ContestID_zh":"第 63 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"}]},{"Rating":1864.0948676111,"ID":1163,"Title":"Last Substring in Lexicographical Order","TitleZH":"按字典序排在最后的子串","TitleSlug":"last-substring-in-lexicographical-order","ContestSlug":"weekly-contest-150","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 150","ContestID_zh":"第 150 场周赛","topicTags":[{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"}]},{"Rating":1861.4906863586,"ID":1993,"Title":"Operations on Tree","TitleZH":"树上的操作","TitleSlug":"operations-on-tree","ContestSlug":"biweekly-contest-60","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 60","ContestID_zh":"第 60 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Design","slug":"design"}]},{"Rating":1860.742934291,"ID":1996,"Title":"The Number of Weak Characters in the Game","TitleZH":"游戏中弱角色的数量","TitleSlug":"the-number-of-weak-characters-in-the-game","ContestSlug":"weekly-contest-257","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 257","ContestID_zh":"第 257 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Stack","slug":"stack"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"},{"name":"Monotonic Stack","slug":"monotonic-stack"}]},{"Rating":1860.5166780235,"ID":2301,"Title":"Match Substring After Replacement","TitleZH":"替换字符后匹配","TitleSlug":"match-substring-after-replacement","ContestSlug":"biweekly-contest-80","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 80","ContestID_zh":"第 80 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"String Matching","slug":"string-matching"}]},{"Rating":1858.9581916885,"ID":1744,"Title":"Can You Eat Your Favorite Candy on Your Favorite Day?","TitleZH":"你能在你最喜欢的那天吃到你最喜欢的糖果吗？","TitleSlug":"can-you-eat-your-favorite-candy-on-your-favorite-day","ContestSlug":"weekly-contest-226","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 226","ContestID_zh":"第 226 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1857.6431822094,"ID":1584,"Title":"Min Cost to Connect All Points","TitleZH":"连接所有点的最小费用","TitleSlug":"min-cost-to-connect-all-points","ContestSlug":"weekly-contest-206","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 206","ContestID_zh":"第 206 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Union Find","slug":"union-find"},{"name":"Graph","slug":"graph"},{"name":"Minimum Spanning Tree","slug":"minimum-spanning-tree"}]},{"Rating":1856.8610192187,"ID":2266,"Title":"Count Number of Texts","TitleZH":"统计打字方案数","TitleSlug":"count-number-of-texts","ContestSlug":"weekly-contest-292","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 292","ContestID_zh":"第 292 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Math","slug":"math"},{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1855.5957296285,"ID":799,"Title":"Champagne Tower","TitleZH":"香槟塔","TitleSlug":"champagne-tower","ContestSlug":"weekly-contest-75","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 75","ContestID_zh":"第 75 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1855.4479039876,"ID":1202,"Title":"Smallest String With Swaps","TitleZH":"交换字符串中的元素","TitleSlug":"smallest-string-with-swaps","ContestSlug":"weekly-contest-155","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 155","ContestID_zh":"第 155 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"}]},{"Rating":1855.377046154,"ID":1546,"Title":"Maximum Number of Non-Overlapping Subarrays With Sum Equals Target","TitleZH":"和为目标值的最大数目不重叠非空子数组数目","TitleSlug":"maximum-number-of-non-overlapping-subarrays-with-sum-equals-target","ContestSlug":"weekly-contest-201","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 201","ContestID_zh":"第 201 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Greedy","slug":"greedy"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1854.9547783559,"ID":1334,"Title":"Find the City With the Smallest Number of Neighbors at a Threshold Distance","TitleZH":"阈值距离内邻居最少的城市","TitleSlug":"find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance","ContestSlug":"weekly-contest-173","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 173","ContestID_zh":"第 173 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Graph","slug":"graph"},{"name":"Shortest Path","slug":"shortest-path"}]},{"Rating":1854.0126399812,"ID":1269,"Title":"Number of Ways to Stay in the Same Place After Some Steps","TitleZH":"停在原地的方案数","TitleSlug":"number-of-ways-to-stay-in-the-same-place-after-some-steps","ContestSlug":"weekly-contest-164","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 164","ContestID_zh":"第 164 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1853.0880092558,"ID":1301,"Title":"Number of Paths with Max Score","TitleZH":"最大得分的路径数目","TitleSlug":"number-of-paths-with-max-score","ContestSlug":"biweekly-contest-16","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 16","ContestID_zh":"第 16 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1851.7255023016,"ID":2162,"Title":"Minimum Cost to Set Cooking Time","TitleZH":"设置时间的最少代价","TitleSlug":"minimum-cost-to-set-cooking-time","ContestSlug":"biweekly-contest-71","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 71","ContestID_zh":"第 71 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1850.8490524791,"ID":1152,"Title":"Analyze User Website Visit Pattern","TitleZH":"用户网站访问行为分析","TitleSlug":"analyze-user-website-visit-pattern","ContestSlug":"biweekly-contest-6","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 6","ContestID_zh":"第 6 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1850.5506342426,"ID":1477,"Title":"Find Two Non-overlapping Sub-arrays Each With Target Sum","TitleZH":"找两个和为目标值且不重叠的子数组","TitleSlug":"find-two-non-overlapping-sub-arrays-each-with-target-sum","ContestSlug":"biweekly-contest-28","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 28","ContestID_zh":"第 28 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Binary Search","slug":"binary-search"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1850.4091449367,"ID":1775,"Title":"Equal Sum Arrays With Minimum Number of Operations","TitleZH":"通过最少操作次数使数组的和相等","TitleSlug":"equal-sum-arrays-with-minimum-number-of-operations","ContestSlug":"weekly-contest-230","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 230","ContestID_zh":"第 230 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Greedy","slug":"greedy"},{"name":"Counting","slug":"counting"}]},{"Rating":1849.8122180044,"ID":2059,"Title":"Minimum Operations to Convert Number","TitleZH":"转化数字的最小运算数","TitleSlug":"minimum-operations-to-convert-number","ContestSlug":"weekly-contest-265","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 265","ContestID_zh":"第 265 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Breadth-First Search","slug":"breadth-first-search"}]},{"Rating":1848.0912848518,"ID":1177,"Title":"Can Make Palindrome from Substring","TitleZH":"构建回文串检测","TitleSlug":"can-make-palindrome-from-substring","ContestSlug":"weekly-contest-152","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 152","ContestID_zh":"第 152 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1847.2077654978,"ID":1258,"Title":"Synonymous Sentences","TitleZH":"近义词句子","TitleSlug":"synonymous-sentences","ContestSlug":"biweekly-contest-13","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 13","ContestID_zh":"第 13 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Backtracking","slug":"backtracking"},{"name":"Union Find","slug":"union-find"}]},{"Rating":1846.4077077642,"ID":1514,"Title":"Path with Maximum Probability","TitleZH":"概率最大的路径","TitleSlug":"path-with-maximum-probability","ContestSlug":"weekly-contest-197","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 197","ContestID_zh":"第 197 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Graph","slug":"graph"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Shortest Path","slug":"shortest-path"}]},{"Rating":1846.3568350016,"ID":874,"Title":"Walking Robot Simulation","TitleZH":"模拟行走机器人","TitleSlug":"walking-robot-simulation","ContestSlug":"weekly-contest-94","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 94","ContestID_zh":"第 94 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1845.0428731248,"ID":1504,"Title":"Count Submatrices With All Ones","TitleZH":"统计全 1 子矩形","TitleSlug":"count-submatrices-with-all-ones","ContestSlug":"weekly-contest-196","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 196","ContestID_zh":"第 196 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Stack","slug":"stack"},{"name":"Matrix","slug":"matrix"},{"name":"Monotonic Stack","slug":"monotonic-stack"}]},{"Rating":1844.6289439644,"ID":1411,"Title":"Number of Ways to Paint N × 3 Grid","TitleZH":"给 N x 3 网格图涂色的方案数","TitleSlug":"number-of-ways-to-paint-n-3-grid","ContestSlug":"weekly-contest-184","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 184","ContestID_zh":"第 184 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1841.4067816266,"ID":2013,"Title":"Detect Squares","TitleZH":"检测正方形","TitleSlug":"detect-squares","ContestSlug":"weekly-contest-259","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 259","ContestID_zh":"第 259 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Design","slug":"design"},{"name":"Counting","slug":"counting"}]},{"Rating":1840.9122452886,"ID":2332,"Title":"The Latest Time to Catch a Bus","TitleZH":"坐上公交的最晚时间","TitleSlug":"the-latest-time-to-catch-a-bus","ContestSlug":"biweekly-contest-82","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 82","ContestID_zh":"第 82 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1839.9203623221,"ID":2311,"Title":"Longest Binary Subsequence Less Than or Equal to K","TitleZH":"小于等于 K 的最长二进制子序列","TitleSlug":"longest-binary-subsequence-less-than-or-equal-to-k","ContestSlug":"weekly-contest-298","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 298","ContestID_zh":"第 298 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Greedy","slug":"greedy"},{"name":"Memoization","slug":"memoization"}]},{"Rating":1837.8252904904,"ID":1559,"Title":"Detect Cycles in 2D Grid","TitleZH":"二维网格图中探测环","TitleSlug":"detect-cycles-in-2d-grid","ContestSlug":"biweekly-contest-33","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 33","ContestID_zh":"第 33 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1836.536348078,"ID":1316,"Title":"Distinct Echo Substrings","TitleZH":"不同的循环子字符串","TitleSlug":"distinct-echo-substrings","ContestSlug":"biweekly-contest-17","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 17","ContestID_zh":"第 17 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Trie","slug":"trie"},{"name":"Rolling Hash","slug":"rolling-hash"},{"name":"Hash Function","slug":"hash-function"}]},{"Rating":1836.5345744332,"ID":2146,"Title":"K Highest Ranked Items Within a Price Range","TitleZH":"价格范围内最高排名的 K 样物品","TitleSlug":"k-highest-ranked-items-within-a-price-range","ContestSlug":"biweekly-contest-70","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 70","ContestID_zh":"第 70 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1835.4868365659,"ID":995,"Title":"Minimum Number of K Consecutive Bit Flips","TitleZH":"K 连续位的最小翻转次数","TitleSlug":"minimum-number-of-k-consecutive-bit-flips","ContestSlug":"weekly-contest-124","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 124","ContestID_zh":"第 124 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Queue","slug":"queue"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1834.868034709,"ID":2370,"Title":"Longest Ideal Subsequence","TitleZH":"最长理想子序列","TitleSlug":"longest-ideal-subsequence","ContestSlug":"weekly-contest-305","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 305","ContestID_zh":"第 305 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1832.2280384591,"ID":755,"Title":"Pour Water","TitleZH":"倒水","TitleSlug":"pour-water","ContestSlug":"weekly-contest-65","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 65","ContestID_zh":"第 65 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1831.9395911303,"ID":2034,"Title":"Stock Price Fluctuation ","TitleZH":"股票价格波动","TitleSlug":"stock-price-fluctuation","ContestSlug":"weekly-contest-262","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 262","ContestID_zh":"第 262 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Design","slug":"design"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Data Stream","slug":"data-stream"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":1830.3165569278,"ID":980,"Title":"Unique Paths III","TitleZH":"不同路径 III","TitleSlug":"unique-paths-iii","ContestSlug":"weekly-contest-120","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 120","ContestID_zh":"第 120 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Backtracking","slug":"backtracking"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1830.1493771696,"ID":790,"Title":"Domino and Tromino Tiling","TitleZH":"多米诺和托米诺平铺","TitleSlug":"domino-and-tromino-tiling","ContestSlug":"weekly-contest-73","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 73","ContestID_zh":"第 73 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1828.6438563573,"ID":1754,"Title":"Largest Merge Of Two Strings","TitleZH":"构造字典序最大的合并字符串","TitleSlug":"largest-merge-of-two-strings","ContestSlug":"weekly-contest-227","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 227","ContestID_zh":"第 227 场周赛","topicTags":[{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1828.2700238306,"ID":2135,"Title":"Count Words Obtained After Adding a Letter","TitleZH":"统计追加字母可以获得的单词数","TitleSlug":"count-words-obtained-after-adding-a-letter","ContestSlug":"weekly-contest-275","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 275","ContestID_zh":"第 275 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1827.090740222,"ID":1095,"Title":"Find in Mountain Array","TitleZH":"山脉数组中查找目标值","TitleSlug":"find-in-mountain-array","ContestSlug":"weekly-contest-142","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 142","ContestID_zh":"第 142 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Interactive","slug":"interactive"}]},{"Rating":1825.770486008,"ID":934,"Title":"Shortest Bridge","TitleZH":"最短的桥","TitleSlug":"shortest-bridge","ContestSlug":"weekly-contest-109","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 109","ContestID_zh":"第 109 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1825.4207082682,"ID":1702,"Title":"Maximum Binary String After Change","TitleZH":"修改后的最大二进制字符串","TitleSlug":"maximum-binary-string-after-change","ContestSlug":"biweekly-contest-42","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 42","ContestID_zh":"第 42 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1825.0056908946,"ID":1835,"Title":"Find XOR Sum of All Pairs Bitwise AND","TitleZH":"所有数对按位与结果的异或和","TitleSlug":"find-xor-sum-of-all-pairs-bitwise-and","ContestSlug":"weekly-contest-237","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 237","ContestID_zh":"第 237 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":1824.829446341,"ID":1298,"Title":"Maximum Candies You Can Get from Boxes","TitleZH":"你能从盒子里获得的最大糖果数","TitleSlug":"maximum-candies-you-can-get-from-boxes","ContestSlug":"weekly-contest-168","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 168","ContestID_zh":"第 168 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"}]},{"Rating":1823.8779711373,"ID":1377,"Title":"Frog Position After T Seconds","TitleZH":"T 秒后青蛙的位置","TitleSlug":"frog-position-after-t-seconds","ContestSlug":"weekly-contest-179","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 179","ContestID_zh":"第 179 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"}]},{"Rating":1823.5831437787,"ID":1458,"Title":"Max Dot Product of Two Subsequences","TitleZH":"两个子序列的最大点积","TitleSlug":"max-dot-product-of-two-subsequences","ContestSlug":"weekly-contest-190","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 190","ContestID_zh":"第 190 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1822.9768689716,"ID":1363,"Title":"Largest Multiple of Three","TitleZH":"形成三的最大倍数","TitleSlug":"largest-multiple-of-three","ContestSlug":"weekly-contest-177","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 177","ContestID_zh":"第 177 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1822.1301265412,"ID":2217,"Title":"Find Palindrome With Fixed Length","TitleZH":"找到指定长度的回文数","TitleSlug":"find-palindrome-with-fixed-length","ContestSlug":"weekly-contest-286","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 286","ContestID_zh":"第 286 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"}]},{"Rating":1820.58557644,"ID":1405,"Title":"Longest Happy String","TitleZH":"最长快乐字符串","TitleSlug":"longest-happy-string","ContestSlug":"weekly-contest-183","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 183","ContestID_zh":"第 183 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1819.3068421506,"ID":2055,"Title":"Plates Between Candles","TitleZH":"蜡烛之间的盘子","TitleSlug":"plates-between-candles","ContestSlug":"biweekly-contest-64","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 64","ContestID_zh":"第 64 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Binary Search","slug":"binary-search"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1818.0024504436,"ID":861,"Title":"Score After Flipping Matrix","TitleZH":"翻转矩阵后的得分","TitleSlug":"score-after-flipping-matrix","ContestSlug":"weekly-contest-91","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 91","ContestID_zh":"第 91 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1817.9978644712,"ID":1792,"Title":"Maximum Average Pass Ratio","TitleZH":"最大平均通过率","TitleSlug":"maximum-average-pass-ratio","ContestSlug":"weekly-contest-232","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 232","ContestID_zh":"第 232 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1817.224026292,"ID":1658,"Title":"Minimum Operations to Reduce X to Zero","TitleZH":"将 x 减到 0 的最小操作数","TitleSlug":"minimum-operations-to-reduce-x-to-zero","ContestSlug":"weekly-contest-215","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 215","ContestID_zh":"第 215 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1817.0597073686,"ID":795,"Title":"Number of Subarrays with Bounded Maximum","TitleZH":"区间子数组个数","TitleSlug":"number-of-subarrays-with-bounded-maximum","ContestSlug":"weekly-contest-74","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 74","ContestID_zh":"第 74 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"}]},{"Rating":1815.1286459024,"ID":773,"Title":"Sliding Puzzle","TitleZH":"滑动谜题","TitleSlug":"sliding-puzzle","ContestSlug":"weekly-contest-69","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 69","ContestID_zh":"第 69 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1810.7690062079,"ID":1284,"Title":"Minimum Number of Flips to Convert Binary Matrix to Zero Matrix","TitleZH":"转化为全零矩阵的最少反转次数","TitleSlug":"minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix","ContestSlug":"weekly-contest-166","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 166","ContestID_zh":"第 166 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1809.8192888474,"ID":1345,"Title":"Jump Game IV","TitleZH":"跳跃游戏 IV","TitleSlug":"jump-game-iv","ContestSlug":"biweekly-contest-19","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 19","ContestID_zh":"第 19 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Breadth-First Search","slug":"breadth-first-search"}]},{"Rating":1809.5579156134,"ID":776,"Title":"Split BST","TitleZH":"拆分二叉搜索树","TitleSlug":"split-bst","ContestSlug":"weekly-contest-70","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 70","ContestID_zh":"第 70 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Binary Search Tree","slug":"binary-search-tree"},{"name":"Recursion","slug":"recursion"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1808.787108831,"ID":1519,"Title":"Number of Nodes in the Sub-Tree With the Same Label","TitleZH":"子树中标签相同的节点数","TitleSlug":"number-of-nodes-in-the-sub-tree-with-the-same-label","ContestSlug":"weekly-contest-198","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 198","ContestID_zh":"第 198 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Counting","slug":"counting"}]},{"Rating":1808.5754920785,"ID":1230,"Title":"Toss Strange Coins","TitleZH":"抛掷硬币","TitleSlug":"toss-strange-coins","ContestSlug":"biweekly-contest-11","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 11","ContestID_zh":"第 11 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Probability and Statistics","slug":"probability-and-statistics"}]},{"Rating":1808.3407696613,"ID":2302,"Title":"Count Subarrays With Score Less Than K","TitleZH":"统计得分小于 K 的子数组数目","TitleSlug":"count-subarrays-with-score-less-than-k","ContestSlug":"biweekly-contest-80","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 80","ContestID_zh":"第 80 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1807.4618172386,"ID":1594,"Title":"Maximum Non Negative Product in a Matrix","TitleZH":"矩阵的最大非负积","TitleSlug":"maximum-non-negative-product-in-a-matrix","ContestSlug":"weekly-contest-207","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 207","ContestID_zh":"第 207 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1806.5891699944,"ID":1073,"Title":"Adding Two Negabinary Numbers","TitleZH":"负二进制数相加","TitleSlug":"adding-two-negabinary-numbers","ContestSlug":"weekly-contest-139","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 139","ContestID_zh":"第 139 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"}]},{"Rating":1805.5947071171,"ID":1035,"Title":"Uncrossed Lines","TitleZH":"不相交的线","TitleSlug":"uncrossed-lines","ContestSlug":"weekly-contest-134","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 134","ContestID_zh":"第 134 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1804.5783242151,"ID":1080,"Title":"Insufficient Nodes in Root to Leaf Paths","TitleZH":"根到叶路径上的不足节点","TitleSlug":"insufficient-nodes-in-root-to-leaf-paths","ContestSlug":"weekly-contest-140","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 140","ContestID_zh":"第 140 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1804.5283324227,"ID":2096,"Title":"Step-By-Step Directions From a Binary Tree Node to Another","TitleZH":"从二叉树一个节点到另一个节点每一步的方向","TitleSlug":"step-by-step-directions-from-a-binary-tree-node-to-another","ContestSlug":"weekly-contest-270","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 270","ContestID_zh":"第 270 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1803.7518552874,"ID":1953,"Title":"Maximum Number of Weeks for Which You Can Work","TitleZH":"你可以工作的最大周数","TitleSlug":"maximum-number-of-weeks-for-which-you-can-work","ContestSlug":"weekly-contest-252","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 252","ContestID_zh":"第 252 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1802.2256875356,"ID":1673,"Title":"Find the Most Competitive Subsequence","TitleZH":"找出最具竞争力的子序列","TitleSlug":"find-the-most-competitive-subsequence","ContestSlug":"weekly-contest-217","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 217","ContestID_zh":"第 217 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Stack","slug":"stack"},{"name":"Greedy","slug":"greedy"},{"name":"Monotonic Stack","slug":"monotonic-stack"}]},{"Rating":1799.4635458535,"ID":1186,"Title":"Maximum Subarray Sum with One Deletion","TitleZH":"删除一次得到子数组最大和","TitleSlug":"maximum-subarray-sum-with-one-deletion","ContestSlug":"weekly-contest-153","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 153","ContestID_zh":"第 153 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1797.8728515982,"ID":1711,"Title":"Count Good Meals","TitleZH":"大餐计数","TitleSlug":"count-good-meals","ContestSlug":"weekly-contest-222","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 222","ContestID_zh":"第 222 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"}]},{"Rating":1797.7466000366,"ID":1834,"Title":"Single-Threaded CPU","TitleZH":"单线程 CPU","TitleSlug":"single-threaded-cpu","ContestSlug":"weekly-contest-237","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 237","ContestID_zh":"第 237 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1797.5851607225,"ID":1072,"Title":"Flip Columns For Maximum Number of Equal Rows","TitleZH":"按列翻转得到最大值等行数","TitleSlug":"flip-columns-for-maximum-number-of-equal-rows","ContestSlug":"weekly-contest-139","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 139","ContestID_zh":"第 139 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1797.4917663632,"ID":1028,"Title":"Recover a Tree From Preorder Traversal","TitleZH":"从先序遍历还原二叉树","TitleSlug":"recover-a-tree-from-preorder-traversal","ContestSlug":"weekly-contest-132","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 132","ContestID_zh":"第 132 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1795.0422250815,"ID":966,"Title":"Vowel Spellchecker","TitleZH":"元音拼写检查器","TitleSlug":"vowel-spellchecker","ContestSlug":"weekly-contest-117","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 117","ContestID_zh":"第 117 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1794.5827898448,"ID":886,"Title":"Possible Bipartition","TitleZH":"可能的二分法","TitleSlug":"possible-bipartition","ContestSlug":"weekly-contest-97","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 97","ContestID_zh":"第 97 场周赛","topicTags":[{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Graph","slug":"graph"}]},{"Rating":1793.8027487553,"ID":1653,"Title":"Minimum Deletions to Make String Balanced","TitleZH":"使字符串平衡的最少删除次数","TitleSlug":"minimum-deletions-to-make-string-balanced","ContestSlug":"biweekly-contest-39","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 39","ContestID_zh":"第 39 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Stack","slug":"stack"}]},{"Rating":1793.3037316825,"ID":2381,"Title":"Shifting Letters II","TitleZH":"字母移位 II","TitleSlug":"shifting-letters-ii","ContestSlug":"biweekly-contest-85","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 85","ContestID_zh":"第 85 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1792.076794537,"ID":1245,"Title":"Tree Diameter","TitleZH":"树的直径","TitleSlug":"tree-diameter","ContestSlug":"biweekly-contest-12","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 12","ContestID_zh":"第 12 场双周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"},{"name":"Topological Sort","slug":"topological-sort"}]},{"Rating":1790.5747006625,"ID":2321,"Title":"Maximum Score Of Spliced Array","TitleZH":"拼接数组的最大分数","TitleSlug":"maximum-score-of-spliced-array","ContestSlug":"weekly-contest-299","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 299","ContestID_zh":"第 299 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1787.8550568757,"ID":2192,"Title":"All Ancestors of a Node in a Directed Acyclic Graph","TitleZH":"有向无环图中一个节点的所有祖先","TitleSlug":"all-ancestors-of-a-node-in-a-directed-acyclic-graph","ContestSlug":"biweekly-contest-73","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 73","ContestID_zh":"第 73 场双周赛","topicTags":[{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"},{"name":"Topological Sort","slug":"topological-sort"}]},{"Rating":1787.6346864268,"ID":768,"Title":"Max Chunks To Make Sorted II","TitleZH":"最多能完成排序的块 II","TitleSlug":"max-chunks-to-make-sorted-ii","ContestSlug":"weekly-contest-68","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 68","ContestID_zh":"第 68 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Stack","slug":"stack"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"},{"name":"Monotonic Stack","slug":"monotonic-stack"}]},{"Rating":1787.4514432151,"ID":1156,"Title":"Swap For Longest Repeated Character Substring","TitleZH":"单字符重复子串的最大长度","TitleSlug":"swap-for-longest-repeated-character-substring","ContestSlug":"weekly-contest-149","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 149","ContestID_zh":"第 149 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1787.2310751136,"ID":1497,"Title":"Check If Array Pairs Are Divisible by k","TitleZH":"检查数组对是否可以被 k 整除","TitleSlug":"check-if-array-pairs-are-divisible-by-k","ContestSlug":"weekly-contest-195","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 195","ContestID_zh":"第 195 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Counting","slug":"counting"}]},{"Rating":1786.9268132617,"ID":1510,"Title":"Stone Game IV","TitleZH":"石子游戏 IV","TitleSlug":"stone-game-iv","ContestSlug":"biweekly-contest-30","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 30","ContestID_zh":"第 30 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Game Theory","slug":"game-theory"}]},{"Rating":1786.688543054,"ID":1312,"Title":"Minimum Insertion Steps to Make a String Palindrome","TitleZH":"让字符串成为回文串的最少插入次数","TitleSlug":"minimum-insertion-steps-to-make-a-string-palindrome","ContestSlug":"weekly-contest-170","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 170","ContestID_zh":"第 170 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1786.5491561897,"ID":971,"Title":"Flip Binary Tree To Match Preorder Traversal","TitleZH":"翻转二叉树以匹配先序遍历","TitleSlug":"flip-binary-tree-to-match-preorder-traversal","ContestSlug":"weekly-contest-118","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 118","ContestID_zh":"第 118 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1786.4753467293,"ID":787,"Title":"Cheapest Flights Within K Stops","TitleZH":"K 站中转内最便宜的航班","TitleSlug":"cheapest-flights-within-k-stops","ContestSlug":"weekly-contest-72","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 72","ContestID_zh":"第 72 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Shortest Path","slug":"shortest-path"}]},{"Rating":1786.3121598293,"ID":983,"Title":"Minimum Cost For Tickets","TitleZH":"最低票价","TitleSlug":"minimum-cost-for-tickets","ContestSlug":"weekly-contest-121","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 121","ContestID_zh":"第 121 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1785.6872758693,"ID":1911,"Title":"Maximum Alternating Subsequence Sum","TitleZH":"最大子序列交替和","TitleSlug":"maximum-alternating-subsequence-sum","ContestSlug":"biweekly-contest-55","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 55","ContestID_zh":"第 55 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1784.2539813582,"ID":894,"Title":"All Possible Full Binary Trees","TitleZH":"所有可能的满二叉树","TitleSlug":"all-possible-full-binary-trees","ContestSlug":"weekly-contest-99","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 99","ContestID_zh":"第 99 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Tree","slug":"tree"},{"name":"Recursion","slug":"recursion"},{"name":"Memoization","slug":"memoization"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1783.2337340478,"ID":851,"Title":"Loud and Rich","TitleZH":"喧闹和富有","TitleSlug":"loud-and-rich","ContestSlug":"weekly-contest-88","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 88","ContestID_zh":"第 88 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Graph","slug":"graph"},{"name":"Topological Sort","slug":"topological-sort"}]},{"Rating":1782.9801784101,"ID":1765,"Title":"Map of Highest Peak","TitleZH":"地图中的最高点","TitleSlug":"map-of-highest-peak","ContestSlug":"biweekly-contest-46","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 46","ContestID_zh":"第 46 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1782.3312212058,"ID":1171,"Title":"Remove Zero Sum Consecutive Nodes from Linked List","TitleZH":"从链表中删去总和值为零的连续节点","TitleSlug":"remove-zero-sum-consecutive-nodes-from-linked-list","ContestSlug":"weekly-contest-151","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 151","ContestID_zh":"第 151 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Linked List","slug":"linked-list"}]},{"Rating":1781.8156963676,"ID":2353,"Title":"Design a Food Rating System","TitleZH":"设计食物评分系统","TitleSlug":"design-a-food-rating-system","ContestSlug":"weekly-contest-303","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 303","ContestID_zh":"第 303 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Design","slug":"design"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":1781.3664141686,"ID":1895,"Title":"Largest Magic Square","TitleZH":"最大的幻方","TitleSlug":"largest-magic-square","ContestSlug":"biweekly-contest-54","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 54","ContestID_zh":"第 54 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1779.9495819318,"ID":842,"Title":"Split Array into Fibonacci Sequence","TitleZH":"将数组拆分成斐波那契序列","TitleSlug":"split-array-into-fibonacci-sequence","ContestSlug":"weekly-contest-86","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 86","ContestID_zh":"第 86 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Backtracking","slug":"backtracking"}]},{"Rating":1779.8364613072,"ID":1424,"Title":"Diagonal Traverse II","TitleZH":"对角线遍历 II","TitleSlug":"diagonal-traverse-ii","ContestSlug":"weekly-contest-186","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 186","ContestID_zh":"第 186 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1779.7534349429,"ID":1129,"Title":"Shortest Path with Alternating Colors","TitleZH":"颜色交替的最短路径","TitleSlug":"shortest-path-with-alternating-colors","ContestSlug":"weekly-contest-146","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 146","ContestID_zh":"第 146 场周赛","topicTags":[{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"}]},{"Rating":1779.7001728541,"ID":2369,"Title":"Check if There is a Valid Partition For The Array","TitleZH":"检查数组是否存在有效划分","TitleSlug":"check-if-there-is-a-valid-partition-for-the-array","ContestSlug":"weekly-contest-305","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 305","ContestID_zh":"第 305 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1779.3931248179,"ID":1016,"Title":"Binary String With Substrings Representing 1 To N","TitleZH":"子串能表示从 1 到 N 数字的二进制串","TitleSlug":"binary-string-with-substrings-representing-1-to-n","ContestSlug":"weekly-contest-129","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 129","ContestID_zh":"第 129 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1778.4880620629,"ID":1824,"Title":"Minimum Sideway Jumps","TitleZH":"最少侧跳次数","TitleSlug":"minimum-sideway-jumps","ContestSlug":"weekly-contest-236","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 236","ContestID_zh":"第 236 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1777.3786570233,"ID":918,"Title":"Maximum Sum Circular Subarray","TitleZH":"环形子数组的最大和","TitleSlug":"maximum-sum-circular-subarray","ContestSlug":"weekly-contest-105","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 105","ContestID_zh":"第 105 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Divide and Conquer","slug":"divide-and-conquer"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Queue","slug":"queue"},{"name":"Monotonic Queue","slug":"monotonic-queue"}]},{"Rating":1774.8764591297,"ID":1238,"Title":"Circular Permutation in Binary Representation","TitleZH":"循环码排列","TitleSlug":"circular-permutation-in-binary-representation","ContestSlug":"weekly-contest-160","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 160","ContestID_zh":"第 160 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Backtracking","slug":"backtracking"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":1770.8924569497,"ID":1146,"Title":"Snapshot Array","TitleZH":"快照数组","TitleSlug":"snapshot-array","ContestSlug":"weekly-contest-148","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 148","ContestID_zh":"第 148 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Binary Search","slug":"binary-search"},{"name":"Design","slug":"design"}]},{"Rating":1768.623896829,"ID":1600,"Title":"Throne Inheritance","TitleZH":"皇位继承顺序","TitleSlug":"throne-inheritance","ContestSlug":"weekly-contest-208","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 208","ContestID_zh":"第 208 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Design","slug":"design"}]},{"Rating":1766.2506177612,"ID":1914,"Title":"Cyclically Rotating a Grid","TitleZH":"循环轮转矩阵","TitleSlug":"cyclically-rotating-a-grid","ContestSlug":"weekly-contest-247","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 247","ContestID_zh":"第 247 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1765.5654059263,"ID":875,"Title":"Koko Eating Bananas","TitleZH":"爱吃香蕉的珂珂","TitleSlug":"koko-eating-bananas","ContestSlug":"weekly-contest-94","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 94","ContestID_zh":"第 94 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":1764.9170564773,"ID":1706,"Title":"Where Will the Ball Fall","TitleZH":"球会落何处","TitleSlug":"where-will-the-ball-fall","ContestSlug":"weekly-contest-221","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 221","ContestID_zh":"第 221 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Matrix","slug":"matrix"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1763.6404758359,"ID":2462,"Title":"Total Cost to Hire K Workers","TitleZH":"雇佣 K 位工人的总代价","TitleSlug":"total-cost-to-hire-k-workers","ContestSlug":"weekly-contest-318","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 318","ContestID_zh":"第 318 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1762.3115124143,"ID":948,"Title":"Bag of Tokens","TitleZH":"令牌放置","TitleSlug":"bag-of-tokens","ContestSlug":"weekly-contest-112","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 112","ContestID_zh":"第 112 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1762.0307532652,"ID":1262,"Title":"Greatest Sum Divisible by Three","TitleZH":"可被三整除的最大和","TitleSlug":"greatest-sum-divisible-by-three","ContestSlug":"weekly-contest-163","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 163","ContestID_zh":"第 163 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1761.9162628125,"ID":2453,"Title":"Destroy Sequential Targets","TitleZH":"摧毁一系列目标","TitleSlug":"destroy-sequential-targets","ContestSlug":"biweekly-contest-90","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 90","ContestID_zh":"第 90 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Counting","slug":"counting"}]},{"Rating":1760.9131492436,"ID":2121,"Title":"Intervals Between Identical Elements","TitleZH":"相同元素的间隔之和","TitleSlug":"intervals-between-identical-elements","ContestSlug":"weekly-contest-273","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 273","ContestID_zh":"第 273 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1759.2287478055,"ID":2075,"Title":"Decode the Slanted Ciphertext","TitleZH":"解码斜向换位密码","TitleSlug":"decode-the-slanted-ciphertext","ContestSlug":"weekly-contest-267","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 267","ContestID_zh":"第 267 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1759.0470795449,"ID":2498,"Title":"Frog Jump II","TitleZH":"青蛙过河 II","TitleSlug":"frog-jump-ii","ContestSlug":"biweekly-contest-93","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 93","ContestID_zh":"第 93 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1759.0197295594,"ID":1541,"Title":"Minimum Insertions to Balance a Parentheses String","TitleZH":"平衡括号字符串的最少插入次数","TitleSlug":"minimum-insertions-to-balance-a-parentheses-string","ContestSlug":"biweekly-contest-32","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 32","ContestID_zh":"第 32 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1758.75255141,"ID":1027,"Title":"Longest Arithmetic Subsequence","TitleZH":"最长等差数列","TitleSlug":"longest-arithmetic-subsequence","ContestSlug":"weekly-contest-132","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 132","ContestID_zh":"第 132 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Binary Search","slug":"binary-search"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1758.5135073787,"ID":1954,"Title":"Minimum Garden Perimeter to Collect Enough Apples","TitleZH":"收集足够苹果的最小花园周长","TitleSlug":"minimum-garden-perimeter-to-collect-enough-apples","ContestSlug":"weekly-contest-252","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 252","ContestID_zh":"第 252 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":1753.9062487685,"ID":1216,"Title":"Valid Palindrome III","TitleZH":"验证回文字符串 III","TitleSlug":"valid-palindrome-iii","ContestSlug":"biweekly-contest-10","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 10","ContestID_zh":"第 10 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1753.4775753993,"ID":764,"Title":"Largest Plus Sign","TitleZH":"最大加号标志","TitleSlug":"largest-plus-sign","ContestSlug":"weekly-contest-67","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 67","ContestID_zh":"第 67 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1752.9555725796,"ID":1135,"Title":"Connecting Cities With Minimum Cost","TitleZH":"最低成本联通所有城市","TitleSlug":"connecting-cities-with-minimum-cost","ContestSlug":"biweekly-contest-5","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 5","ContestID_zh":"第 5 场双周赛","topicTags":[{"name":"Union Find","slug":"union-find"},{"name":"Graph","slug":"graph"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Minimum Spanning Tree","slug":"minimum-spanning-tree"}]},{"Rating":1752.2621077596,"ID":939,"Title":"Minimum Area Rectangle","TitleZH":"最小面积矩形","TitleSlug":"minimum-area-rectangle","ContestSlug":"weekly-contest-110","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 110","ContestID_zh":"第 110 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Math","slug":"math"},{"name":"Geometry","slug":"geometry"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1751.5101577001,"ID":2166,"Title":"Design Bitset","TitleZH":"设计位集","TitleSlug":"design-bitset","ContestSlug":"weekly-contest-279","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 279","ContestID_zh":"第 279 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Design","slug":"design"}]},{"Rating":1751.115625465,"ID":2400,"Title":"Number of Ways to Reach a Position After Exactly k Steps","TitleZH":"恰好移动 k 步到达某一位置的方法数目","TitleSlug":"number-of-ways-to-reach-a-position-after-exactly-k-steps","ContestSlug":"weekly-contest-309","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 309","ContestID_zh":"第 309 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Combinatorics","slug":"combinatorics"}]},{"Rating":1749.5432375672,"ID":2401,"Title":"Longest Nice Subarray","TitleZH":"最长优雅子数组","TitleSlug":"longest-nice-subarray","ContestSlug":"weekly-contest-309","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 309","ContestID_zh":"第 309 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1749.4981778209,"ID":1111,"Title":"Maximum Nesting Depth of Two Valid Parentheses Strings","TitleZH":"有效括号的嵌套深度","TitleSlug":"maximum-nesting-depth-of-two-valid-parentheses-strings","ContestSlug":"weekly-contest-144","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 144","ContestID_zh":"第 144 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"}]},{"Rating":1748.4522689101,"ID":2134,"Title":"Minimum Swaps to Group All 1's Together II","TitleZH":"最少交换次数来组合所有的 1 II","TitleSlug":"minimum-swaps-to-group-all-1s-together-ii","ContestSlug":"weekly-contest-275","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 275","ContestID_zh":"第 275 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1748.1523771585,"ID":1297,"Title":"Maximum Number of Occurrences of a Substring","TitleZH":"子串的最大出现次数","TitleSlug":"maximum-number-of-occurrences-of-a-substring","ContestSlug":"weekly-contest-168","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 168","ContestID_zh":"第 168 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1748.1339100823,"ID":2171,"Title":"Removing Minimum Number of Magic Beans","TitleZH":"拿出最少数目的魔法豆","TitleSlug":"removing-minimum-number-of-magic-beans","ContestSlug":"weekly-contest-280","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 280","ContestID_zh":"第 280 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1747.6755111029,"ID":1191,"Title":"K-Concatenation Maximum Sum","TitleZH":"K 次串联后最大子数组之和","TitleSlug":"k-concatenation-maximum-sum","ContestSlug":"weekly-contest-154","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 154","ContestID_zh":"第 154 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1746.8757919578,"ID":1849,"Title":"Splitting a String Into Descending Consecutive Values","TitleZH":"将字符串拆分为递减的连续值","TitleSlug":"splitting-a-string-into-descending-consecutive-values","ContestSlug":"weekly-contest-239","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 239","ContestID_zh":"第 239 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Backtracking","slug":"backtracking"}]},{"Rating":1746.135917977,"ID":1024,"Title":"Video Stitching","TitleZH":"视频拼接","TitleSlug":"video-stitching","ContestSlug":"weekly-contest-131","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 131","ContestID_zh":"第 131 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1745.6580748712,"ID":1530,"Title":"Number of Good Leaf Nodes Pairs","TitleZH":"好叶子节点对的数量","TitleSlug":"number-of-good-leaf-nodes-pairs","ContestSlug":"weekly-contest-199","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 199","ContestID_zh":"第 199 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1745.6490739887,"ID":1391,"Title":"Check if There is a Valid Path in a Grid","TitleZH":"检查网格中是否存在有效路径","TitleSlug":"check-if-there-is-a-valid-path-in-a-grid","ContestSlug":"weekly-contest-181","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 181","ContestID_zh":"第 181 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1745.5352025872,"ID":2502,"Title":"Design Memory Allocator","TitleZH":"设计内存分配器","TitleSlug":"design-memory-allocator","ContestSlug":"weekly-contest-323","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 323","ContestID_zh":"第 323 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Design","slug":"design"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1744.7611048301,"ID":1638,"Title":"Count Substrings That Differ by One Character","TitleZH":"统计只差一个字符的子串数目","TitleSlug":"count-substrings-that-differ-by-one-character","ContestSlug":"biweekly-contest-38","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 38","ContestID_zh":"第 38 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1744.0388789755,"ID":1139,"Title":"Largest 1-Bordered Square","TitleZH":"最大的以 1 为边界的正方形","TitleSlug":"largest-1-bordered-square","ContestSlug":"weekly-contest-147","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 147","ContestID_zh":"第 147 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1743.731976554,"ID":2087,"Title":"Minimum Cost Homecoming of a Robot in a Grid","TitleZH":"网格图中机器人回家的最小代价","TitleSlug":"minimum-cost-homecoming-of-a-robot-in-a-grid","ContestSlug":"biweekly-contest-66","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 66","ContestID_zh":"第 66 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1741.4527995252,"ID":1145,"Title":"Binary Tree Coloring Game","TitleZH":"二叉树着色游戏","TitleSlug":"binary-tree-coloring-game","ContestSlug":"weekly-contest-148","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 148","ContestID_zh":"第 148 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1740.5014205942,"ID":1079,"Title":"Letter Tile Possibilities","TitleZH":"活字印刷","TitleSlug":"letter-tile-possibilities","ContestSlug":"weekly-contest-140","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 140","ContestID_zh":"第 140 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Backtracking","slug":"backtracking"},{"name":"Counting","slug":"counting"}]},{"Rating":1739.5831401172,"ID":1593,"Title":"Split a String Into the Max Number of Unique Substrings","TitleZH":"拆分字符串使唯一子字符串的数目最大","TitleSlug":"split-a-string-into-the-max-number-of-unique-substrings","ContestSlug":"weekly-contest-207","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 207","ContestID_zh":"第 207 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Backtracking","slug":"backtracking"}]},{"Rating":1737.8431142688,"ID":1814,"Title":"Count Nice Pairs in an Array","TitleZH":"统计一个数组中好对子的数目","TitleSlug":"count-nice-pairs-in-an-array","ContestSlug":"biweekly-contest-49","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 49","ContestID_zh":"第 49 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Math","slug":"math"},{"name":"Counting","slug":"counting"}]},{"Rating":1734.8208369949,"ID":1292,"Title":"Maximum Side Length of a Square with Sum Less than or Equal to Threshold","TitleZH":"元素和小于等于阈值的正方形的最大边长","TitleSlug":"maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold","ContestSlug":"weekly-contest-167","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 167","ContestID_zh":"第 167 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Matrix","slug":"matrix"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1734.0550202798,"ID":2048,"Title":"Next Greater Numerically Balanced Number","TitleZH":"下一个更大的数值平衡数","TitleSlug":"next-greater-numerically-balanced-number","ContestSlug":"weekly-contest-264","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 264","ContestID_zh":"第 264 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Backtracking","slug":"backtracking"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1732.7813534239,"ID":1273,"Title":"Delete Tree Nodes","TitleZH":"删除树节点","TitleSlug":"delete-tree-nodes","ContestSlug":"biweekly-contest-14","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 14","ContestID_zh":"第 14 场双周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"}]},{"Rating":1731.5555445321,"ID":889,"Title":"Construct Binary Tree from Preorder and Postorder Traversal","TitleZH":"根据前序和后序遍历构造二叉树","TitleSlug":"construct-binary-tree-from-preorder-and-postorder-traversal","ContestSlug":"weekly-contest-98","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 98","ContestID_zh":"第 98 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Divide and Conquer","slug":"divide-and-conquer"},{"name":"Tree","slug":"tree"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1730.3052054913,"ID":1014,"Title":"Best Sightseeing Pair","TitleZH":"最佳观光组合","TitleSlug":"best-sightseeing-pair","ContestSlug":"weekly-contest-129","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 129","ContestID_zh":"第 129 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1729.6074000215,"ID":1220,"Title":"Count Vowels Permutation","TitleZH":"统计元音字母序列的数目","TitleSlug":"count-vowels-permutation","ContestSlug":"weekly-contest-157","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 157","ContestID_zh":"第 157 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1725.4481937307,"ID":1011,"Title":"Capacity To Ship Packages Within D Days","TitleZH":"在 D 天内送达包裹的能力","TitleSlug":"capacity-to-ship-packages-within-d-days","ContestSlug":"weekly-contest-128","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 128","ContestID_zh":"第 128 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":1725.1995150882,"ID":2416,"Title":"Sum of Prefix Scores of Strings","TitleZH":"字符串的前缀分数和","TitleSlug":"sum-of-prefix-scores-of-strings","ContestSlug":"weekly-contest-311","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 311","ContestID_zh":"第 311 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Trie","slug":"trie"},{"name":"Counting","slug":"counting"}]},{"Rating":1724.394164934,"ID":2261,"Title":"K Divisible Elements Subarrays","TitleZH":"含最多 K 个可整除元素的子数组","TitleSlug":"k-divisible-elements-subarrays","ContestSlug":"weekly-contest-291","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 291","ContestID_zh":"第 291 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Trie","slug":"trie"},{"name":"Rolling Hash","slug":"rolling-hash"},{"name":"Hash Function","slug":"hash-function"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1724.1545485476,"ID":2070,"Title":"Most Beautiful Item for Each Query","TitleZH":"每一个查询的最大美丽值","TitleSlug":"most-beautiful-item-for-each-query","ContestSlug":"biweekly-contest-65","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 65","ContestID_zh":"第 65 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1722.8129701098,"ID":1359,"Title":"Count All Valid Pickup and Delivery Options","TitleZH":"有效的快递序列数目","TitleSlug":"count-all-valid-pickup-and-delivery-options","ContestSlug":"biweekly-contest-20","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 20","ContestID_zh":"第 20 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Combinatorics","slug":"combinatorics"}]},{"Rating":1722.3088173214,"ID":1197,"Title":"Minimum Knight Moves","TitleZH":"进击的骑士","TitleSlug":"minimum-knight-moves","ContestSlug":"biweekly-contest-9","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 9","ContestID_zh":"第 9 场双周赛","topicTags":[{"name":"Breadth-First Search","slug":"breadth-first-search"}]},{"Rating":1719.945199874,"ID":1239,"Title":"Maximum Length of a Concatenated String with Unique Characters","TitleZH":"串联字符串的最大长度","TitleSlug":"maximum-length-of-a-concatenated-string-with-unique-characters","ContestSlug":"weekly-contest-160","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 160","ContestID_zh":"第 160 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Backtracking","slug":"backtracking"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":1718.9772466681,"ID":2017,"Title":"Grid Game","TitleZH":"网格游戏","TitleSlug":"grid-game","ContestSlug":"weekly-contest-260","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 260","ContestID_zh":"第 260 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1718.8256321624,"ID":2397,"Title":"Maximum Rows Covered by Columns","TitleZH":"被列覆盖的最多行数","TitleSlug":"maximum-rows-covered-by-columns","ContestSlug":"biweekly-contest-86","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 86","ContestID_zh":"第 86 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Backtracking","slug":"backtracking"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Matrix","slug":"matrix"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1716.9721777,"ID":2202,"Title":"Maximize the Topmost Element After K Moves","TitleZH":"K 次操作后最大化顶端元素","TitleSlug":"maximize-the-topmost-element-after-k-moves","ContestSlug":"weekly-contest-284","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 284","ContestID_zh":"第 284 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1714.992763701,"ID":2359,"Title":"Find Closest Node to Given Two Nodes","TitleZH":"找到离给定两个节点最近的节点","TitleSlug":"find-closest-node-to-given-two-nodes","ContestSlug":"weekly-contest-304","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 304","ContestID_zh":"第 304 场周赛","topicTags":[{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Graph","slug":"graph"}]},{"Rating":1714.6960124182,"ID":1781,"Title":"Sum of Beauty of All Substrings","TitleZH":"所有子字符串美丽值之和","TitleSlug":"sum-of-beauty-of-all-substrings","ContestSlug":"biweekly-contest-47","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 47","ContestID_zh":"第 47 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Counting","slug":"counting"}]},{"Rating":1713.3954468582,"ID":2406,"Title":"Divide Intervals Into Minimum Number of Groups","TitleZH":"将区间分为最少组数","TitleSlug":"divide-intervals-into-minimum-number-of-groups","ContestSlug":"weekly-contest-310","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 310","ContestID_zh":"第 310 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1713.2768268466,"ID":1372,"Title":"Longest ZigZag Path in a Binary Tree","TitleZH":"二叉树中的最长交错路径","TitleSlug":"longest-zigzag-path-in-a-binary-tree","ContestSlug":"biweekly-contest-21","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 21","ContestID_zh":"第 21 场双周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1712.4010133221,"ID":1042,"Title":"Flower Planting With No Adjacent","TitleZH":"不邻接植花","TitleSlug":"flower-planting-with-no-adjacent","ContestSlug":"weekly-contest-136","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 136","ContestID_zh":"第 136 场周赛","topicTags":[{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"}]},{"Rating":1711.4873176824,"ID":2385,"Title":"Amount of Time for Binary Tree to Be Infected","TitleZH":"感染二叉树需要的总时间","TitleSlug":"amount-of-time-for-binary-tree-to-be-infected","ContestSlug":"weekly-contest-307","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 307","ContestID_zh":"第 307 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1711.1205064321,"ID":1801,"Title":"Number of Orders in the Backlog","TitleZH":"积压订单中的订单总数","TitleSlug":"number-of-orders-in-the-backlog","ContestSlug":"weekly-contest-233","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 233","ContestID_zh":"第 233 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1710.9105378431,"ID":923,"Title":"3Sum With Multiplicity","TitleZH":"三数之和的多种可能","TitleSlug":"3sum-with-multiplicity","ContestSlug":"weekly-contest-106","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 106","ContestID_zh":"第 106 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Sorting","slug":"sorting"},{"name":"Counting","slug":"counting"}]},{"Rating":1710.3243520032,"ID":1567,"Title":"Maximum Length of Subarray With Positive Product","TitleZH":"乘积为正数的最长子数组长度","TitleSlug":"maximum-length-of-subarray-with-positive-product","ContestSlug":"weekly-contest-204","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 204","ContestID_zh":"第 204 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1710.1120861153,"ID":759,"Title":"Employee Free Time","TitleZH":"员工空闲时间","TitleSlug":"employee-free-time","ContestSlug":"weekly-contest-66","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 66","ContestID_zh":"第 66 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1710.0787625377,"ID":1136,"Title":"Parallel Courses","TitleZH":"平行课程","TitleSlug":"parallel-courses","ContestSlug":"biweekly-contest-5","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 5","ContestID_zh":"第 5 场双周赛","topicTags":[{"name":"Graph","slug":"graph"},{"name":"Topological Sort","slug":"topological-sort"}]},{"Rating":1709.1461451873,"ID":979,"Title":"Distribute Coins in Binary Tree","TitleZH":"在二叉树中分配硬币","TitleSlug":"distribute-coins-in-binary-tree","ContestSlug":"weekly-contest-120","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 120","ContestID_zh":"第 120 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1709.1054732427,"ID":2140,"Title":"Solving Questions With Brainpower","TitleZH":"解决智力问题","TitleSlug":"solving-questions-with-brainpower","ContestSlug":"weekly-contest-276","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 276","ContestID_zh":"第 276 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1708.9983361411,"ID":1401,"Title":"Circle and Rectangle Overlapping","TitleZH":"圆和矩形是否有重叠","TitleSlug":"circle-and-rectangle-overlapping","ContestSlug":"biweekly-contest-23","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 23","ContestID_zh":"第 23 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Geometry","slug":"geometry"}]},{"Rating":1708.8735585776,"ID":901,"Title":"Online Stock Span","TitleZH":"股票价格跨度","TitleSlug":"online-stock-span","ContestSlug":"weekly-contest-101","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 101","ContestID_zh":"第 101 场周赛","topicTags":[{"name":"Stack","slug":"stack"},{"name":"Design","slug":"design"},{"name":"Monotonic Stack","slug":"monotonic-stack"},{"name":"Data Stream","slug":"data-stream"}]},{"Rating":1708.812923679,"ID":826,"Title":"Most Profit Assigning Work","TitleZH":"安排工作以达到最大收益","TitleSlug":"most-profit-assigning-work","ContestSlug":"weekly-contest-82","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 82","ContestID_zh":"第 82 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Binary Search","slug":"binary-search"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1708.7056764058,"ID":2257,"Title":"Count Unguarded Cells in the Grid","TitleZH":"统计网格图中没有被保卫的格子数","TitleSlug":"count-unguarded-cells-in-the-grid","ContestSlug":"biweekly-contest-77","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 77","ContestID_zh":"第 77 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1707.8992927609,"ID":816,"Title":"Ambiguous Coordinates","TitleZH":"模糊坐标","TitleSlug":"ambiguous-coordinates","ContestSlug":"weekly-contest-80","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 80","ContestID_zh":"第 80 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Backtracking","slug":"backtracking"}]},{"Rating":1704.360891641,"ID":1947,"Title":"Maximum Compatibility Score Sum","TitleZH":"最大兼容性评分和","TitleSlug":"maximum-compatibility-score-sum","ContestSlug":"weekly-contest-251","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 251","ContestID_zh":"第 251 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Backtracking","slug":"backtracking"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Bitmask","slug":"bitmask"}]},{"Rating":1702.8035923458,"ID":958,"Title":"Check Completeness of a Binary Tree","TitleZH":"二叉树的完全性检验","TitleSlug":"check-completeness-of-a-binary-tree","ContestSlug":"weekly-contest-115","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 115","ContestID_zh":"第 115 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1702.4962514406,"ID":2100,"Title":"Find Good Days to Rob the Bank","TitleZH":"适合打劫银行的日子","TitleSlug":"find-good-days-to-rob-the-bank","ContestSlug":"biweekly-contest-67","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 67","ContestID_zh":"第 67 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1702.4387527636,"ID":2080,"Title":"Range Frequency Queries","TitleZH":"区间内查询数字的频率","TitleSlug":"range-frequency-queries","ContestSlug":"weekly-contest-268","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 268","ContestID_zh":"第 268 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Binary Search","slug":"binary-search"},{"name":"Design","slug":"design"},{"name":"Segment Tree","slug":"segment-tree"}]},{"Rating":1701.7584658834,"ID":1774,"Title":"Closest Dessert Cost","TitleZH":"最接近目标价格的甜点成本","TitleSlug":"closest-dessert-cost","ContestSlug":"weekly-contest-230","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 230","ContestID_zh":"第 230 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Backtracking","slug":"backtracking"}]},{"Rating":1701.5735371897,"ID":1054,"Title":"Distant Barcodes","TitleZH":"距离相等的条形码","TitleSlug":"distant-barcodes","ContestSlug":"weekly-contest-138","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 138","ContestID_zh":"第 138 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Counting","slug":"counting"}]},{"Rating":1697.8500495479,"ID":1017,"Title":"Convert to Base -2","TitleZH":"负二进制转换","TitleSlug":"convert-to-base-2","ContestSlug":"weekly-contest-130","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 130","ContestID_zh":"第 130 场周赛","topicTags":[{"name":"Math","slug":"math"}]},{"Rating":1697.2356875149,"ID":1289,"Title":"Minimum Falling Path Sum II","TitleZH":"下降路径最小和  II","TitleSlug":"minimum-falling-path-sum-ii","ContestSlug":"biweekly-contest-15","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 15","ContestID_zh":"第 15 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1697.0187705319,"ID":825,"Title":"Friends Of Appropriate Ages","TitleZH":"适龄的朋友","TitleSlug":"friends-of-appropriate-ages","ContestSlug":"weekly-contest-82","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 82","ContestID_zh":"第 82 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1696.9920075471,"ID":1487,"Title":"Making File Names Unique","TitleZH":"保证文件名唯一","TitleSlug":"making-file-names-unique","ContestSlug":"weekly-contest-194","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 194","ContestID_zh":"第 194 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1695.3076664977,"ID":792,"Title":"Number of Matching Subsequences","TitleZH":"匹配子序列的单词数","TitleSlug":"number-of-matching-subsequences","ContestSlug":"weekly-contest-74","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 74","ContestID_zh":"第 74 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Trie","slug":"trie"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1695.2832486322,"ID":1942,"Title":"The Number of the Smallest Unoccupied Chair","TitleZH":"最小未被占据椅子的编号","TitleSlug":"the-number-of-the-smallest-unoccupied-chair","ContestSlug":"biweekly-contest-57","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 57","ContestID_zh":"第 57 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":1695.0815222626,"ID":2420,"Title":"Find All Good Indices","TitleZH":"找到所有好下标","TitleSlug":"find-all-good-indices","ContestSlug":"weekly-contest-312","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 312","ContestID_zh":"第 312 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1694.433951503,"ID":829,"Title":"Consecutive Numbers Sum","TitleZH":"连续整数求和","TitleSlug":"consecutive-numbers-sum","ContestSlug":"weekly-contest-83","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 83","ContestID_zh":"第 83 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1694.4308657594,"ID":2466,"Title":"Count Ways To Build Good Strings","TitleZH":"统计构造好字符串的方案数","TitleSlug":"count-ways-to-build-good-strings","ContestSlug":"biweekly-contest-91","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 91","ContestID_zh":"第 91 场双周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1693.4495728383,"ID":2337,"Title":"Move Pieces to Obtain a String","TitleZH":"移动片段得到字符串","TitleSlug":"move-pieces-to-obtain-a-string","ContestSlug":"weekly-contest-301","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 301","ContestID_zh":"第 301 场周赛","topicTags":[{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"}]},{"Rating":1692.5884631801,"ID":1462,"Title":"Course Schedule IV","TitleZH":"课程表 IV","TitleSlug":"course-schedule-iv","ContestSlug":"biweekly-contest-27","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 27","ContestID_zh":"第 27 场双周赛","topicTags":[{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"},{"name":"Topological Sort","slug":"topological-sort"}]},{"Rating":1690.9043557462,"ID":919,"Title":"Complete Binary Tree Inserter","TitleZH":"完全二叉树插入器","TitleSlug":"complete-binary-tree-inserter","ContestSlug":"weekly-contest-105","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 105","ContestID_zh":"第 105 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Design","slug":"design"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1690.1655236843,"ID":935,"Title":"Knight Dialer","TitleZH":"骑士拨号器","TitleSlug":"knight-dialer","ContestSlug":"weekly-contest-109","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 109","ContestID_zh":"第 109 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1689.7569144085,"ID":1419,"Title":"Minimum Number of Frogs Croaking","TitleZH":"数青蛙","TitleSlug":"minimum-number-of-frogs-croaking","ContestSlug":"weekly-contest-185","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 185","ContestID_zh":"第 185 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Counting","slug":"counting"}]},{"Rating":1688.9209684568,"ID":1963,"Title":"Minimum Number of Swaps to Make the String Balanced","TitleZH":"使字符串平衡的最小交换次数","TitleSlug":"minimum-number-of-swaps-to-make-the-string-balanced","ContestSlug":"weekly-contest-253","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 253","ContestID_zh":"第 253 场周赛","topicTags":[{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1686.4493679523,"ID":950,"Title":"Reveal Cards In Increasing Order","TitleZH":"按递增顺序显示卡牌","TitleSlug":"reveal-cards-in-increasing-order","ContestSlug":"weekly-contest-113","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 113","ContestID_zh":"第 113 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Queue","slug":"queue"},{"name":"Sorting","slug":"sorting"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1685.5389350949,"ID":2233,"Title":"Maximum Product After K Increments","TitleZH":"K 次增加后的最大乘积","TitleSlug":"maximum-product-after-k-increments","ContestSlug":"weekly-contest-288","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 288","ContestID_zh":"第 288 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1685.3599641299,"ID":2074,"Title":"Reverse Nodes in Even Length Groups","TitleZH":"反转偶数长度组的节点","TitleSlug":"reverse-nodes-in-even-length-groups","ContestSlug":"weekly-contest-267","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 267","ContestID_zh":"第 267 场周赛","topicTags":[{"name":"Linked List","slug":"linked-list"}]},{"Rating":1682.8882177724,"ID":1443,"Title":"Minimum Time to Collect All Apples in a Tree","TitleZH":"收集树上所有苹果的最少时间","TitleSlug":"minimum-time-to-collect-all-apples-in-a-tree","ContestSlug":"weekly-contest-188","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 188","ContestID_zh":"第 188 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"}]},{"Rating":1682.16892078,"ID":2497,"Title":"Maximum Star Sum of a Graph","TitleZH":"图中最大星和","TitleSlug":"maximum-star-sum-of-a-graph","ContestSlug":"biweekly-contest-93","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 93","ContestID_zh":"第 93 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Graph","slug":"graph"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1681.3263732456,"ID":767,"Title":"Reorganize String","TitleZH":"重构字符串","TitleSlug":"reorganize-string","ContestSlug":"weekly-contest-68","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 68","ContestID_zh":"第 68 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Counting","slug":"counting"}]},{"Rating":1680.866917849,"ID":2280,"Title":"Minimum Lines to Represent a Line Chart","TitleZH":"表示一个折线图的最少线段数","TitleSlug":"minimum-lines-to-represent-a-line-chart","ContestSlug":"weekly-contest-294","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 294","ContestID_zh":"第 294 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Geometry","slug":"geometry"},{"name":"Sorting","slug":"sorting"},{"name":"Number Theory","slug":"number-theory"}]},{"Rating":1680.82425993,"ID":1865,"Title":"Finding Pairs With a Certain Sum","TitleZH":"找出和为指定值的下标对","TitleSlug":"finding-pairs-with-a-certain-sum","ContestSlug":"weekly-contest-241","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 241","ContestID_zh":"第 241 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Design","slug":"design"}]},{"Rating":1680.4852623991,"ID":1031,"Title":"Maximum Sum of Two Non-Overlapping Subarrays","TitleZH":"两个非重叠子数组的最大和","TitleSlug":"maximum-sum-of-two-non-overlapping-subarrays","ContestSlug":"weekly-contest-133","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 133","ContestID_zh":"第 133 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1680.1353258588,"ID":2182,"Title":"Construct String With Repeat Limit","TitleZH":"构造限制重复的字符串","TitleSlug":"construct-string-with-repeat-limit","ContestSlug":"weekly-contest-281","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 281","ContestID_zh":"第 281 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Counting","slug":"counting"}]},{"Rating":1680.0815931601,"ID":2457,"Title":"Minimum Addition to Make Integer Beautiful","TitleZH":"美丽整数的最小增量","TitleSlug":"minimum-addition-to-make-integer-beautiful","ContestSlug":"weekly-contest-317","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 317","ContestID_zh":"第 317 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1679.5737760149,"ID":2492,"Title":"Minimum Score of a Path Between Two Cities","TitleZH":"两个城市间路径的最小分数","TitleSlug":"minimum-score-of-a-path-between-two-cities","ContestSlug":"weekly-contest-322","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 322","ContestID_zh":"第 322 场周赛","topicTags":[{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Graph","slug":"graph"}]},{"Rating":1679.2607152001,"ID":1402,"Title":"Reducing Dishes","TitleZH":"做菜顺序","TitleSlug":"reducing-dishes","ContestSlug":"biweekly-contest-23","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 23","ContestID_zh":"第 23 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1678.7231378948,"ID":1905,"Title":"Count Sub Islands","TitleZH":"统计子岛屿","TitleSlug":"count-sub-islands","ContestSlug":"weekly-contest-246","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 246","ContestID_zh":"第 246 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1678.6241816708,"ID":2317,"Title":"Maximum XOR After Operations ","TitleZH":"操作后的最大异或和","TitleSlug":"maximum-xor-after-operations","ContestSlug":"biweekly-contest-81","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 81","ContestID_zh":"第 81 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":1678.5871762113,"ID":2115,"Title":"Find All Possible Recipes from Given Supplies","TitleZH":"从给定原材料中找到所有可以做出的菜","TitleSlug":"find-all-possible-recipes-from-given-supplies","ContestSlug":"biweekly-contest-68","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 68","ContestID_zh":"第 68 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Graph","slug":"graph"},{"name":"Topological Sort","slug":"topological-sort"}]},{"Rating":1678.3947690537,"ID":885,"Title":"Spiral Matrix III","TitleZH":"螺旋矩阵 III","TitleSlug":"spiral-matrix-iii","ContestSlug":"weekly-contest-97","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 97","ContestID_zh":"第 97 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1678.1133886034,"ID":853,"Title":"Car Fleet","TitleZH":"车队","TitleSlug":"car-fleet","ContestSlug":"weekly-contest-89","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 89","ContestID_zh":"第 89 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Stack","slug":"stack"},{"name":"Sorting","slug":"sorting"},{"name":"Monotonic Stack","slug":"monotonic-stack"}]},{"Rating":1675.989407584,"ID":974,"Title":"Subarray Sums Divisible by K","TitleZH":"和可被 K 整除的子数组","TitleSlug":"subarray-sums-divisible-by-k","ContestSlug":"weekly-contest-119","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 119","ContestID_zh":"第 119 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1675.9610355975,"ID":987,"Title":"Vertical Order Traversal of a Binary Tree","TitleZH":"二叉树的垂序遍历","TitleSlug":"vertical-order-traversal-of-a-binary-tree","ContestSlug":"weekly-contest-122","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 122","ContestID_zh":"第 122 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1675.761234741,"ID":1870,"Title":"Minimum Speed to Arrive on Time","TitleZH":"准时到达的列车最小时速","TitleSlug":"minimum-speed-to-arrive-on-time","ContestSlug":"weekly-contest-242","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 242","ContestID_zh":"第 242 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":1674.9985842835,"ID":1339,"Title":"Maximum Product of Splitted Binary Tree","TitleZH":"分裂二叉树的最大乘积","TitleSlug":"maximum-product-of-splitted-binary-tree","ContestSlug":"weekly-contest-174","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 174","ContestID_zh":"第 174 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1674.7986939472,"ID":1922,"Title":"Count Good Numbers","TitleZH":"统计好数字的数目","TitleSlug":"count-good-numbers","ContestSlug":"weekly-contest-248","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 248","ContestID_zh":"第 248 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Recursion","slug":"recursion"}]},{"Rating":1674.5365205597,"ID":1215,"Title":"Stepping Numbers","TitleZH":"步进数","TitleSlug":"stepping-numbers","ContestSlug":"biweekly-contest-10","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 10","ContestID_zh":"第 10 场双周赛","topicTags":[{"name":"Backtracking","slug":"backtracking"},{"name":"Breadth-First Search","slug":"breadth-first-search"}]},{"Rating":1672.1678031263,"ID":1438,"Title":"Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit","TitleZH":"绝对差不超过限制的最长连续子数组","TitleSlug":"longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit","ContestSlug":"weekly-contest-187","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 187","ContestID_zh":"第 187 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Queue","slug":"queue"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Ordered Set","slug":"ordered-set"},{"name":"Monotonic Queue","slug":"monotonic-queue"}]},{"Rating":1671.9261598,"ID":2033,"Title":"Minimum Operations to Make a Uni-Value Grid","TitleZH":"获取单值网格的最小操作数","TitleSlug":"minimum-operations-to-make-a-uni-value-grid","ContestSlug":"weekly-contest-262","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 262","ContestID_zh":"第 262 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Sorting","slug":"sorting"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1671.4657554194,"ID":1738,"Title":"Find Kth Largest XOR Coordinate Value","TitleZH":"找出第 K 大的异或坐标值","TitleSlug":"find-kth-largest-xor-coordinate-value","ContestSlug":"weekly-contest-225","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 225","ContestID_zh":"第 225 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Divide and Conquer","slug":"divide-and-conquer"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Matrix","slug":"matrix"},{"name":"Prefix Sum","slug":"prefix-sum"},{"name":"Quickselect","slug":"quickselect"}]},{"Rating":1666.346990979,"ID":1162,"Title":"As Far from Land as Possible","TitleZH":"地图分析","TitleSlug":"as-far-from-land-as-possible","ContestSlug":"weekly-contest-150","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 150","ContestID_zh":"第 150 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1665.24907247,"ID":1620,"Title":"Coordinate With Maximum Network Quality","TitleZH":"网络信号最好的坐标","TitleSlug":"coordinate-with-maximum-network-quality","ContestSlug":"biweekly-contest-37","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 37","ContestID_zh":"第 37 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1664.7703749741,"ID":1121,"Title":"Divide Array Into Increasing Sequences","TitleZH":"将数组分成几个递增序列","TitleSlug":"divide-array-into-increasing-sequences","ContestSlug":"biweekly-contest-4","ProblemIndex":"Q4","ContestID_en":"Biweekly Contest 4","ContestID_zh":"第 4 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1663.3912882908,"ID":2063,"Title":"Vowels of All Substrings","TitleZH":"所有子字符串中的元音","TitleSlug":"vowels-of-all-substrings","ContestSlug":"weekly-contest-266","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 266","ContestID_zh":"第 266 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Combinatorics","slug":"combinatorics"}]},{"Rating":1663.2612318917,"ID":1219,"Title":"Path with Maximum Gold","TitleZH":"黄金矿工","TitleSlug":"path-with-maximum-gold","ContestSlug":"weekly-contest-157","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 157","ContestID_zh":"第 157 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Backtracking","slug":"backtracking"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1663.1853149056,"ID":863,"Title":"All Nodes Distance K in Binary Tree","TitleZH":"二叉树中所有距离为 K 的结点","TitleSlug":"all-nodes-distance-k-in-binary-tree","ContestSlug":"weekly-contest-91","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 91","ContestID_zh":"第 91 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1662.6673692545,"ID":2170,"Title":"Minimum Operations to Make the Array Alternating","TitleZH":"使数组变成交替数组的最少操作数","TitleSlug":"minimum-operations-to-make-the-array-alternating","ContestSlug":"weekly-contest-280","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 280","ContestID_zh":"第 280 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Greedy","slug":"greedy"},{"name":"Counting","slug":"counting"}]},{"Rating":1658.921022733,"ID":2195,"Title":"Append K Integers With Minimal Sum","TitleZH":"向数组中追加 K 个整数","TitleSlug":"append-k-integers-with-minimal-sum","ContestSlug":"weekly-contest-283","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 283","ContestID_zh":"第 283 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1658.7495899767,"ID":1254,"Title":"Number of Closed Islands","TitleZH":"统计封闭岛屿的数目","TitleSlug":"number-of-closed-islands","ContestSlug":"weekly-contest-162","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 162","ContestID_zh":"第 162 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1658.6836278802,"ID":1169,"Title":"Invalid Transactions","TitleZH":"查询无效交易","TitleSlug":"invalid-transactions","ContestSlug":"weekly-contest-151","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 151","ContestID_zh":"第 151 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1658.5967147757,"ID":1958,"Title":"Check if Move is Legal","TitleZH":"检查操作是否合法","TitleSlug":"check-if-move-is-legal","ContestSlug":"biweekly-contest-58","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 58","ContestID_zh":"第 58 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1658.3530344788,"ID":2304,"Title":"Minimum Path Cost in a Grid","TitleZH":"网格中的最小路径代价","TitleSlug":"minimum-path-cost-in-a-grid","ContestSlug":"weekly-contest-297","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 297","ContestID_zh":"第 297 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1658.3474650806,"ID":1091,"Title":"Shortest Path in Binary Matrix","TitleZH":"二进制矩阵中的最短路径","TitleSlug":"shortest-path-in-binary-matrix","ContestSlug":"weekly-contest-141","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 141","ContestID_zh":"第 141 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1658.3305547865,"ID":1583,"Title":"Count Unhappy Friends","TitleZH":"统计不开心的朋友","TitleSlug":"count-unhappy-friends","ContestSlug":"weekly-contest-206","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 206","ContestID_zh":"第 206 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1657.1231739081,"ID":1249,"Title":"Minimum Remove to Make Valid Parentheses","TitleZH":"移除无效的括号","TitleSlug":"minimum-remove-to-make-valid-parentheses","ContestSlug":"weekly-contest-161","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 161","ContestID_zh":"第 161 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"}]},{"Rating":1656.5588918365,"ID":2222,"Title":"Number of Ways to Select Buildings","TitleZH":"选择建筑的方案数","TitleSlug":"number-of-ways-to-select-buildings","ContestSlug":"biweekly-contest-75","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 75","ContestID_zh":"第 75 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1655.6433885989,"ID":1004,"Title":"Max Consecutive Ones III","TitleZH":"最大连续1的个数 III","TitleSlug":"max-consecutive-ones-iii","ContestSlug":"weekly-contest-126","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 126","ContestID_zh":"第 126 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1654.0793660142,"ID":1257,"Title":"Smallest Common Region","TitleZH":"最小公共区域","TitleSlug":"smallest-common-region","ContestSlug":"biweekly-contest-13","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 13","ContestID_zh":"第 13 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"}]},{"Rating":1653.7337081336,"ID":1155,"Title":"Number of Dice Rolls With Target Sum","TitleZH":"掷骰子的N种方法","TitleSlug":"number-of-dice-rolls-with-target-sum","ContestSlug":"weekly-contest-149","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 149","ContestID_zh":"第 149 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1653.0356626499,"ID":1509,"Title":"Minimum Difference Between Largest and Smallest Value in Three Moves","TitleZH":"三次操作后最大值与最小值的最小差","TitleSlug":"minimum-difference-between-largest-and-smallest-value-in-three-moves","ContestSlug":"biweekly-contest-30","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 30","ContestID_zh":"第 30 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1652.5809810428,"ID":1311,"Title":"Get Watched Videos by Your Friends","TitleZH":"获取你好友已观看的视频","TitleSlug":"get-watched-videos-by-your-friends","ContestSlug":"weekly-contest-170","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 170","ContestID_zh":"第 170 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1651.5845871727,"ID":750,"Title":"Number Of Corner Rectangles","TitleZH":"角矩形的数量","TitleSlug":"number-of-corner-rectangles","ContestSlug":"weekly-contest-63","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 63","ContestID_zh":"第 63 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1651.569267834,"ID":2343,"Title":"Query Kth Smallest Trimmed Number","TitleZH":"裁剪数字后查询第 K 小的数字","TitleSlug":"query-kth-smallest-trimmed-number","ContestSlug":"weekly-contest-302","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 302","ContestID_zh":"第 302 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Divide and Conquer","slug":"divide-and-conquer"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Radix Sort","slug":"radix-sort"},{"name":"Quickselect","slug":"quickselect"}]},{"Rating":1649.9728054796,"ID":1367,"Title":"Linked List in Binary Tree","TitleZH":"二叉树中的列表","TitleSlug":"linked-list-in-binary-tree","ContestSlug":"weekly-contest-178","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 178","ContestID_zh":"第 178 场周赛","topicTags":[{"name":"Linked List","slug":"linked-list"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1649.7120733311,"ID":2523,"Title":"Closest Prime Numbers in Range","TitleZH":"范围内最接近的两个质数","TitleSlug":"closest-prime-numbers-in-range","ContestSlug":"weekly-contest-326","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 326","ContestID_zh":"第 326 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Number Theory","slug":"number-theory"}]},{"Rating":1648.3540381514,"ID":2423,"Title":"Remove Letter To Equalize Frequency","TitleZH":"删除字符使频率相同","TitleSlug":"remove-letter-to-equalize-frequency","ContestSlug":"biweekly-contest-88","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 88","ContestID_zh":"第 88 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Counting","slug":"counting"}]},{"Rating":1648.341757882,"ID":870,"Title":"Advantage Shuffle","TitleZH":"优势洗牌","TitleSlug":"advantage-shuffle","ContestSlug":"weekly-contest-93","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 93","ContestID_zh":"第 93 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1648.0880791614,"ID":1975,"Title":"Maximum Matrix Sum","TitleZH":"最大方阵和","TitleSlug":"maximum-matrix-sum","ContestSlug":"biweekly-contest-59","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 59","ContestID_zh":"第 59 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1646.1943237127,"ID":1358,"Title":"Number of Substrings Containing All Three Characters","TitleZH":"包含所有三种字符的子字符串数目","TitleSlug":"number-of-substrings-containing-all-three-characters","ContestSlug":"biweekly-contest-20","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 20","ContestID_zh":"第 20 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1646.1765343383,"ID":2226,"Title":"Maximum Candies Allocated to K Children","TitleZH":"每个小孩最多能分到多少糖果","TitleSlug":"maximum-candies-allocated-to-k-children","ContestSlug":"weekly-contest-287","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 287","ContestID_zh":"第 287 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":1643.5283095007,"ID":2196,"Title":"Create Binary Tree From Descriptions","TitleZH":"根据描述创建二叉树","TitleSlug":"create-binary-tree-from-descriptions","ContestSlug":"weekly-contest-283","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 283","ContestID_zh":"第 283 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1643.1325351423,"ID":2024,"Title":"Maximize the Confusion of an Exam","TitleZH":"考试的最大困扰度","TitleSlug":"maximize-the-confusion-of-an-exam","ContestSlug":"biweekly-contest-62","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 62","ContestID_zh":"第 62 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1642.1446933109,"ID":2275,"Title":"Largest Combination With Bitwise AND Greater Than Zero","TitleZH":"按位与结果大于零的最长组合","TitleSlug":"largest-combination-with-bitwise-and-greater-than-zero","ContestSlug":"weekly-contest-293","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 293","ContestID_zh":"第 293 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Counting","slug":"counting"}]},{"Rating":1641.9424376927,"ID":2375,"Title":"Construct Smallest Number From DI String","TitleZH":"根据模式串构造最小数字","TitleSlug":"construct-smallest-number-from-di-string","ContestSlug":"weekly-contest-306","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 306","ContestID_zh":"第 306 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Backtracking","slug":"backtracking"},{"name":"Stack","slug":"stack"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1640.9591585343,"ID":2187,"Title":"Minimum Time to Complete Trips","TitleZH":"完成旅途的最少时间","TitleSlug":"minimum-time-to-complete-trips","ContestSlug":"weekly-contest-282","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 282","ContestID_zh":"第 282 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":1640.8976042503,"ID":2344,"Title":"Minimum Deletions to Make Array Divisible","TitleZH":"使数组可以被整除的最少删除次数","TitleSlug":"minimum-deletions-to-make-array-divisible","ContestSlug":"weekly-contest-302","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 302","ContestID_zh":"第 302 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Number Theory","slug":"number-theory"}]},{"Rating":1638.3134093066,"ID":1926,"Title":"Nearest Exit from Entrance in Maze","TitleZH":"迷宫中离入口最近的出口","TitleSlug":"nearest-exit-from-entrance-in-maze","ContestSlug":"biweekly-contest-56","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 56","ContestID_zh":"第 56 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1638.1281256708,"ID":838,"Title":"Push Dominoes","TitleZH":"推多米诺","TitleSlug":"push-dominoes","ContestSlug":"weekly-contest-85","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 85","ContestID_zh":"第 85 场周赛","topicTags":[{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1638.0148920643,"ID":990,"Title":"Satisfiability of Equality Equations","TitleZH":"等式方程的可满足性","TitleSlug":"satisfiability-of-equality-equations","ContestSlug":"weekly-contest-123","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 123","ContestID_zh":"第 123 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Union Find","slug":"union-find"},{"name":"Graph","slug":"graph"}]},{"Rating":1637.0082208814,"ID":1558,"Title":"Minimum Numbers of Function Calls to Make Target Array","TitleZH":"得到目标数组的最少函数调用次数","TitleSlug":"minimum-numbers-of-function-calls-to-make-target-array","ContestSlug":"biweekly-contest-33","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 33","ContestID_zh":"第 33 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":1636.7472106213,"ID":2512,"Title":"Reward Top K Students","TitleZH":"奖励最顶尖的 K 名学生","TitleSlug":"reward-top-k-students","ContestSlug":"biweekly-contest-94","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 94","ContestID_zh":"第 94 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1636.6877598712,"ID":1386,"Title":"Cinema Seat Allocation","TitleZH":"安排电影院座位","TitleSlug":"cinema-seat-allocation","ContestSlug":"biweekly-contest-22","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 22","ContestID_zh":"第 22 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Greedy","slug":"greedy"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":1636.47322627,"ID":2384,"Title":"Largest Palindromic Number","TitleZH":"最大回文数字","TitleSlug":"largest-palindromic-number","ContestSlug":"weekly-contest-307","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 307","ContestID_zh":"第 307 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1635.6879273926,"ID":1899,"Title":"Merge Triplets to Form Target Triplet","TitleZH":"合并若干三元组以形成目标三元组","TitleSlug":"merge-triplets-to-form-target-triplet","ContestSlug":"weekly-contest-245","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 245","ContestID_zh":"第 245 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1635.1520858279,"ID":2471,"Title":"Minimum Number of Operations to Sort a Binary Tree by Level","TitleZH":"逐层排序二叉树所需的最少操作数目","TitleSlug":"minimum-number-of-operations-to-sort-a-binary-tree-by-level","ContestSlug":"weekly-contest-319","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 319","ContestID_zh":"第 319 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1633.6202302555,"ID":1466,"Title":"Reorder Routes to Make All Paths Lead to the City Zero","TitleZH":"重新规划路线","TitleSlug":"reorder-routes-to-make-all-paths-lead-to-the-city-zero","ContestSlug":"weekly-contest-191","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 191","ContestID_zh":"第 191 场周赛","topicTags":[{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"}]},{"Rating":1633.1789521619,"ID":1053,"Title":"Previous Permutation With One Swap","TitleZH":"交换一次的先前排列","TitleSlug":"previous-permutation-with-one-swap","ContestSlug":"weekly-contest-138","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 138","ContestID_zh":"第 138 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1633.1372577433,"ID":1319,"Title":"Number of Operations to Make Network Connected","TitleZH":"连通网络的操作次数","TitleSlug":"number-of-operations-to-make-network-connected","ContestSlug":"weekly-contest-171","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 171","ContestID_zh":"第 171 场周赛","topicTags":[{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Graph","slug":"graph"}]},{"Rating":1632.0191837349,"ID":820,"Title":"Short Encoding of Words","TitleZH":"单词的压缩编码","TitleSlug":"short-encoding-of-words","ContestSlug":"weekly-contest-81","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 81","ContestID_zh":"第 81 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Trie","slug":"trie"}]},{"Rating":1631.338145683,"ID":1540,"Title":"Can Convert String in K Moves","TitleZH":"K 次操作转变字符串","TitleSlug":"can-convert-string-in-k-moves","ContestSlug":"biweekly-contest-32","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 32","ContestID_zh":"第 32 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1629.5416832545,"ID":1680,"Title":"Concatenation of Consecutive Binary Numbers","TitleZH":"连接连续二进制数字","TitleSlug":"concatenation-of-consecutive-binary-numbers","ContestSlug":"weekly-contest-218","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 218","ContestID_zh":"第 218 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1628.5072578803,"ID":1332,"Title":"Remove Palindromic Subsequences","TitleZH":"删除回文子序列","TitleSlug":"remove-palindromic-subsequences","ContestSlug":"weekly-contest-173","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 173","ContestID_zh":"第 173 场周赛","topicTags":[{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"}]},{"Rating":1626.6740430119,"ID":1182,"Title":"Shortest Distance to Target Color","TitleZH":"与目标颜色间的最短距离","TitleSlug":"shortest-distance-to-target-color","ContestSlug":"biweekly-contest-8","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 8","ContestID_zh":"第 8 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1626.3266982141,"ID":1366,"Title":"Rank Teams by Votes","TitleZH":"通过投票对团队排名","TitleSlug":"rank-teams-by-votes","ContestSlug":"weekly-contest-178","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 178","ContestID_zh":"第 178 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Sorting","slug":"sorting"},{"name":"Counting","slug":"counting"}]},{"Rating":1624.9775945043,"ID":785,"Title":"Is Graph Bipartite?","TitleZH":"判断二分图","TitleSlug":"is-graph-bipartite","ContestSlug":"weekly-contest-72","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 72","ContestID_zh":"第 72 场周赛","topicTags":[{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Graph","slug":"graph"}]},{"Rating":1624.4737611923,"ID":916,"Title":"Word Subsets","TitleZH":"单词子集","TitleSlug":"word-subsets","ContestSlug":"weekly-contest-104","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 104","ContestID_zh":"第 104 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1623.9443250479,"ID":1248,"Title":"Count Number of Nice Subarrays","TitleZH":"统计「优美子数组」","TitleSlug":"count-number-of-nice-subarrays","ContestSlug":"weekly-contest-161","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 161","ContestID_zh":"第 161 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Math","slug":"math"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1622.8414025136,"ID":2086,"Title":"Minimum Number of Buckets Required to Collect Rainwater from Houses","TitleZH":"从房屋收集雨水需要的最少水桶数","TitleSlug":"minimum-number-of-food-buckets-to-feed-the-hamsters","ContestSlug":"biweekly-contest-66","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 66","ContestID_zh":"第 66 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1622.7743864401,"ID":2365,"Title":"Task Scheduler II","TitleZH":"任务调度器 II","TitleSlug":"task-scheduler-ii","ContestSlug":"biweekly-contest-84","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 84","ContestID_zh":"第 84 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1622.3970914116,"ID":2425,"Title":"Bitwise XOR of All Pairings","TitleZH":"所有数对的异或和","TitleSlug":"bitwise-xor-of-all-pairings","ContestSlug":"biweekly-contest-88","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 88","ContestID_zh":"第 88 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Brainteaser","slug":"brainteaser"}]},{"Rating":1622.2389577197,"ID":2364,"Title":"Count Number of Bad Pairs","TitleZH":"统计坏数对的数目","TitleSlug":"count-number-of-bad-pairs","ContestSlug":"biweekly-contest-84","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 84","ContestID_zh":"第 84 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"}]},{"Rating":1618.6016480451,"ID":1503,"Title":"Last Moment Before All Ants Fall Out of a Plank","TitleZH":"所有蚂蚁掉下来前的最后一刻","TitleSlug":"last-moment-before-all-ants-fall-out-of-a-plank","ContestSlug":"weekly-contest-196","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 196","ContestID_zh":"第 196 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Brainteaser","slug":"brainteaser"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1616.2067360638,"ID":2241,"Title":"Design an ATM Machine","TitleZH":"设计一个 ATM 机器","TitleSlug":"design-an-atm-machine","ContestSlug":"biweekly-contest-76","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 76","ContestID_zh":"第 76 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Design","slug":"design"}]},{"Rating":1615.4767730477,"ID":1020,"Title":"Number of Enclaves","TitleZH":"飞地的数量","TitleSlug":"number-of-enclaves","ContestSlug":"weekly-contest-130","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 130","ContestID_zh":"第 130 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1614.4877804672,"ID":2145,"Title":"Count the Hidden Sequences","TitleZH":"统计隐藏数组数目","TitleSlug":"count-the-hidden-sequences","ContestSlug":"biweekly-contest-70","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 70","ContestID_zh":"第 70 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1613.0429766636,"ID":1277,"Title":"Count Square Submatrices with All Ones","TitleZH":"统计全为 1 的正方形子矩阵","TitleSlug":"count-square-submatrices-with-all-ones","ContestSlug":"weekly-contest-165","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 165","ContestID_zh":"第 165 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1611.8434720083,"ID":2232,"Title":"Minimize Result by Adding Parentheses to Expression","TitleZH":"向表达式添加括号后的最小结果","TitleSlug":"minimize-result-by-adding-parentheses-to-expression","ContestSlug":"weekly-contest-288","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 288","ContestID_zh":"第 288 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1611.7621820686,"ID":789,"Title":"Escape The Ghosts","TitleZH":"逃脱阻碍者","TitleSlug":"escape-the-ghosts","ContestSlug":"weekly-contest-73","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 73","ContestID_zh":"第 73 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"}]},{"Rating":1610.569398159,"ID":1524,"Title":"Number of Sub-arrays With Odd Sum","TitleZH":"和为奇数的子数组数目","TitleSlug":"number-of-sub-arrays-with-odd-sum","ContestSlug":"biweekly-contest-31","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 31","ContestID_zh":"第 31 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1610.1866391145,"ID":1670,"Title":"Design Front Middle Back Queue","TitleZH":"设计前中后队列","TitleSlug":"design-front-middle-back-queue","ContestSlug":"biweekly-contest-40","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 40","ContestID_zh":"第 40 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Linked List","slug":"linked-list"},{"name":"Design","slug":"design"},{"name":"Queue","slug":"queue"},{"name":"Data Stream","slug":"data-stream"}]},{"Rating":1609.7858209851,"ID":2438,"Title":"Range Product Queries of Powers","TitleZH":"二的幂数组中查询范围内的乘积","TitleSlug":"range-product-queries-of-powers","ContestSlug":"biweekly-contest-89","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 89","ContestID_zh":"第 89 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1607.80608595,"ID":962,"Title":"Maximum Width Ramp","TitleZH":"最大宽度坡","TitleSlug":"maximum-width-ramp","ContestSlug":"weekly-contest-116","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 116","ContestID_zh":"第 116 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Stack","slug":"stack"},{"name":"Monotonic Stack","slug":"monotonic-stack"}]},{"Rating":1607.7036437819,"ID":2320,"Title":"Count Number of Ways to Place Houses","TitleZH":"统计放置房子的方式数","TitleSlug":"count-number-of-ways-to-place-houses","ContestSlug":"weekly-contest-299","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 299","ContestID_zh":"第 299 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1607.0005715974,"ID":1123,"Title":"Lowest Common Ancestor of Deepest Leaves","TitleZH":"最深叶节点的最近公共祖先","TitleSlug":"lowest-common-ancestor-of-deepest-leaves","ContestSlug":"weekly-contest-145","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 145","ContestID_zh":"第 145 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1606.9895296459,"ID":1300,"Title":"Sum of Mutated Array Closest to Target","TitleZH":"转变数组后最接近目标值的数组和","TitleSlug":"sum-of-mutated-array-closest-to-target","ContestSlug":"biweekly-contest-16","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 16","ContestID_zh":"第 16 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1606.2185826486,"ID":1604,"Title":"Alert Using Same Key-Card Three or More Times in a One Hour Period","TitleZH":"警告一小时内使用相同员工卡大于等于三次的人","TitleSlug":"alert-using-same-key-card-three-or-more-times-in-a-one-hour-period","ContestSlug":"biweekly-contest-36","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 36","ContestID_zh":"第 36 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1604.9737380545,"ID":809,"Title":"Expressive Words","TitleZH":"情感丰富的文字","TitleSlug":"expressive-words","ContestSlug":"weekly-contest-78","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 78","ContestID_zh":"第 78 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"}]},{"Rating":1604.5128423093,"ID":2522,"Title":"Partition String Into Substrings With Values at Most K","TitleZH":"将字符串分割成值不超过 K 的子字符串","TitleSlug":"partition-string-into-substrings-with-values-at-most-k","ContestSlug":"weekly-contest-326","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 326","ContestID_zh":"第 326 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1604.1602280047,"ID":2424,"Title":"Longest Uploaded Prefix","TitleZH":"最长上传前缀","TitleSlug":"longest-uploaded-prefix","ContestSlug":"biweekly-contest-88","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 88","ContestID_zh":"第 88 场双周赛","topicTags":[{"name":"Binary Search","slug":"binary-search"},{"name":"Union Find","slug":"union-find"},{"name":"Design","slug":"design"},{"name":"Binary Indexed Tree","slug":"binary-indexed-tree"},{"name":"Segment Tree","slug":"segment-tree"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":1604.0695445163,"ID":2316,"Title":"Count Unreachable Pairs of Nodes in an Undirected Graph","TitleZH":"统计无向图中无法互相到达点对数","TitleSlug":"count-unreachable-pairs-of-nodes-in-an-undirected-graph","ContestSlug":"biweekly-contest-81","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 81","ContestID_zh":"第 81 场双周赛","topicTags":[{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Graph","slug":"graph"}]},{"Rating":1602.7742849665,"ID":2447,"Title":"Number of Subarrays With GCD Equal to K","TitleZH":"最大公因数等于 K 的子数组数目","TitleSlug":"number-of-subarrays-with-gcd-equal-to-k","ContestSlug":"weekly-contest-316","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 316","ContestID_zh":"第 316 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Number Theory","slug":"number-theory"}]},{"Rating":1602.7242171967,"ID":2249,"Title":"Count Lattice Points Inside a Circle","TitleZH":"统计圆内格点数目","TitleSlug":"count-lattice-points-inside-a-circle","ContestSlug":"weekly-contest-290","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 290","ContestID_zh":"第 290 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Math","slug":"math"},{"name":"Geometry","slug":"geometry"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1601.511760532,"ID":926,"Title":"Flip String to Monotone Increasing","TitleZH":"将字符串翻转到单调递增","TitleSlug":"flip-string-to-monotone-increasing","ContestSlug":"weekly-contest-107","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 107","ContestID_zh":"第 107 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1600.5573262373,"ID":1864,"Title":"Minimum Number of Swaps to Make the Binary String Alternating","TitleZH":"构成交替字符串需要的最小交换次数","TitleSlug":"minimum-number-of-swaps-to-make-the-binary-string-alternating","ContestSlug":"weekly-contest-241","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 241","ContestID_zh":"第 241 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1599.2720584736,"ID":1048,"Title":"Longest String Chain","TitleZH":"最长字符串链","TitleSlug":"longest-string-chain","ContestSlug":"weekly-contest-137","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 137","ContestID_zh":"第 137 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1597.1931473887,"ID":1218,"Title":"Longest Arithmetic Subsequence of Given Difference","TitleZH":"最长定差子序列","TitleSlug":"longest-arithmetic-subsequence-of-given-difference","ContestSlug":"weekly-contest-157","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 157","ContestID_zh":"第 157 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1597.0215918551,"ID":1247,"Title":"Minimum Swaps to Make Strings Equal","TitleZH":"交换字符使得字符串相同","TitleSlug":"minimum-swaps-to-make-strings-equal","ContestSlug":"weekly-contest-161","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 161","ContestID_zh":"第 161 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1596.9852244916,"ID":2476,"Title":"Closest Nodes Queries in a Binary Search Tree","TitleZH":"二叉搜索树最近节点查询","TitleSlug":"closest-nodes-queries-in-a-binary-search-tree","ContestSlug":"weekly-contest-320","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 320","ContestID_zh":"第 320 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1594.2563236049,"ID":822,"Title":"Card Flipping Game","TitleZH":"翻转卡片游戏","TitleSlug":"card-flipping-game","ContestSlug":"weekly-contest-81","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 81","ContestID_zh":"第 81 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"}]},{"Rating":1593.8926580448,"ID":1577,"Title":"Number of Ways Where Square of Number Is Equal to Product of Two Numbers","TitleZH":"数的平方等于两数乘积的方法数","TitleSlug":"number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers","ContestSlug":"weekly-contest-205","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 205","ContestID_zh":"第 205 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Math","slug":"math"},{"name":"Two Pointers","slug":"two-pointers"}]},{"Rating":1591.5492530876,"ID":930,"Title":"Binary Subarrays With Sum","TitleZH":"和相同的二元子数组","TitleSlug":"binary-subarrays-with-sum","ContestSlug":"weekly-contest-108","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 108","ContestID_zh":"第 108 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1591.4725328821,"ID":1286,"Title":"Iterator for Combination","TitleZH":"字母组合迭代器","TitleSlug":"iterator-for-combination","ContestSlug":"biweekly-contest-15","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 15","ContestID_zh":"第 15 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Backtracking","slug":"backtracking"},{"name":"Design","slug":"design"},{"name":"Iterator","slug":"iterator"}]},{"Rating":1590.5791055102,"ID":969,"Title":"Pancake Sorting","TitleZH":"煎饼排序","TitleSlug":"pancake-sorting","ContestSlug":"weekly-contest-118","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 118","ContestID_zh":"第 118 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1590.547713663,"ID":1573,"Title":"Number of Ways to Split a String","TitleZH":"分割字符串的方案数","TitleSlug":"number-of-ways-to-split-a-string","ContestSlug":"biweekly-contest-34","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 34","ContestID_zh":"第 34 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"}]},{"Rating":1590.269030833,"ID":1664,"Title":"Ways to Make a Fair Array","TitleZH":"生成平衡数组的方案数","TitleSlug":"ways-to-make-a-fair-array","ContestSlug":"weekly-contest-216","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 216","ContestID_zh":"第 216 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1590.0883962313,"ID":893,"Title":"Groups of Special-Equivalent Strings","TitleZH":"特殊等价字符串组","TitleSlug":"groups-of-special-equivalent-strings","ContestSlug":"weekly-contest-99","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 99","ContestID_zh":"第 99 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1590.0463215721,"ID":877,"Title":"Stone Game","TitleZH":"石子游戏","TitleSlug":"stone-game","ContestSlug":"weekly-contest-95","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 95","ContestID_zh":"第 95 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Game Theory","slug":"game-theory"}]},{"Rating":1588.9690763997,"ID":1813,"Title":"Sentence Similarity III","TitleZH":"句子相似性 III","TitleSlug":"sentence-similarity-iii","ContestSlug":"biweekly-contest-49","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 49","ContestID_zh":"第 49 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"}]},{"Rating":1588.3835994255,"ID":1764,"Title":"Form Array by Concatenating Subarrays of Another Array","TitleZH":"通过连接另一个数组的子数组得到一个数组","TitleSlug":"form-array-by-concatenating-subarrays-of-another-array","ContestSlug":"biweekly-contest-46","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 46","ContestID_zh":"第 46 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"String Matching","slug":"string-matching"}]},{"Rating":1585.5793143983,"ID":1030,"Title":"Matrix Cells in Distance Order","TitleZH":"距离顺序排列矩阵单元格","TitleSlug":"matrix-cells-in-distance-order","ContestSlug":"weekly-contest-133","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 133","ContestID_zh":"第 133 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Geometry","slug":"geometry"},{"name":"Sorting","slug":"sorting"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1581.4963716166,"ID":2211,"Title":"Count Collisions on a Road","TitleZH":"统计道路上的碰撞次数","TitleSlug":"count-collisions-on-a-road","ContestSlug":"weekly-contest-285","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 285","ContestID_zh":"第 285 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"}]},{"Rating":1580.3620959714,"ID":1839,"Title":"Longest Substring Of All Vowels in Order","TitleZH":"所有元音按顺序排布的最长子字符串","TitleSlug":"longest-substring-of-all-vowels-in-order","ContestSlug":"weekly-contest-238","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 238","ContestID_zh":"第 238 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1579.2309881035,"ID":1743,"Title":"Restore the Array From Adjacent Pairs","TitleZH":"从相邻元素对还原数组","TitleSlug":"restore-the-array-from-adjacent-pairs","ContestSlug":"weekly-contest-226","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 226","ContestID_zh":"第 226 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"}]},{"Rating":1578.8503818621,"ID":1034,"Title":"Coloring A Border","TitleZH":"边框着色","TitleSlug":"coloring-a-border","ContestSlug":"weekly-contest-134","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 134","ContestID_zh":"第 134 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1577.1141767118,"ID":2288,"Title":"Apply Discount to Prices","TitleZH":"价格减免","TitleSlug":"apply-discount-to-prices","ContestSlug":"weekly-contest-295","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 295","ContestID_zh":"第 295 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1575.6324598387,"ID":1415,"Title":"The k-th Lexicographical String of All Happy Strings of Length n","TitleZH":"长度为 n 的开心字符串中字典序第 k 小的字符串","TitleSlug":"the-k-th-lexicographical-string-of-all-happy-strings-of-length-n","ContestSlug":"biweekly-contest-24","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 24","ContestID_zh":"第 24 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Backtracking","slug":"backtracking"}]},{"Rating":1574.7542247682,"ID":981,"Title":"Time Based Key-Value Store","TitleZH":"基于时间的键值存储","TitleSlug":"time-based-key-value-store","ContestSlug":"weekly-contest-121","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 121","ContestID_zh":"第 121 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Binary Search","slug":"binary-search"},{"name":"Design","slug":"design"}]},{"Rating":1574.0392121288,"ID":1578,"Title":"Minimum Deletion Cost to Avoid Repeating Letters","TitleZH":"避免重复字母的最小删除成本","TitleSlug":"minimum-time-to-make-rope-colorful","ContestSlug":"weekly-contest-205","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 205","ContestID_zh":"第 205 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1573.824807946,"ID":1423,"Title":"Maximum Points You Can Obtain from Cards","TitleZH":"可获得的最大点数","TitleSlug":"maximum-points-you-can-obtain-from-cards","ContestSlug":"weekly-contest-186","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 186","ContestID_zh":"第 186 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1573.4042963622,"ID":1268,"Title":"Search Suggestions System","TitleZH":"搜索推荐系统","TitleSlug":"search-suggestions-system","ContestSlug":"weekly-contest-164","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 164","ContestID_zh":"第 164 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Trie","slug":"trie"}]},{"Rating":1573.2701790739,"ID":931,"Title":"Minimum Falling Path Sum","TitleZH":"下降路径最小和","TitleSlug":"minimum-falling-path-sum","ContestSlug":"weekly-contest-108","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 108","ContestID_zh":"第 108 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1571.1721048101,"ID":779,"Title":"K-th Symbol in Grammar","TitleZH":"第K个语法符号","TitleSlug":"k-th-symbol-in-grammar","ContestSlug":"weekly-contest-70","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 70","ContestID_zh":"第 70 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Recursion","slug":"recursion"}]},{"Rating":1570.8347522104,"ID":1019,"Title":"Next Greater Node In Linked List","TitleZH":"链表中的下一个更大节点","TitleSlug":"next-greater-node-in-linked-list","ContestSlug":"weekly-contest-130","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 130","ContestID_zh":"第 130 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Linked List","slug":"linked-list"},{"name":"Stack","slug":"stack"},{"name":"Monotonic Stack","slug":"monotonic-stack"}]},{"Rating":1569.7528744586,"ID":1109,"Title":"Corporate Flight Bookings","TitleZH":"航班预订统计","TitleSlug":"corporate-flight-bookings","ContestSlug":"weekly-contest-144","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 144","ContestID_zh":"第 144 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1567.6884942977,"ID":2044,"Title":"Count Number of Maximum Bitwise-OR Subsets","TitleZH":"统计按位或能得到最大值的子集数目","TitleSlug":"count-number-of-maximum-bitwise-or-subsets","ContestSlug":"weekly-contest-263","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 263","ContestID_zh":"第 263 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Backtracking","slug":"backtracking"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":1566.2526716951,"ID":769,"Title":"Max Chunks To Make Sorted","TitleZH":"最多能完成排序的块","TitleSlug":"max-chunks-to-make-sorted","ContestSlug":"weekly-contest-68","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 68","ContestID_zh":"第 68 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Stack","slug":"stack"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"},{"name":"Monotonic Stack","slug":"monotonic-stack"}]},{"Rating":1565.2483424929,"ID":846,"Title":"Hand of Straights","TitleZH":"一手顺子","TitleSlug":"hand-of-straights","ContestSlug":"weekly-contest-87","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 87","ContestID_zh":"第 87 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1563.9451046163,"ID":800,"Title":"Similar RGB Color","TitleZH":"相似 RGB 颜色","TitleSlug":"similar-rgb-color","ContestSlug":"weekly-contest-76","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 76","ContestID_zh":"第 76 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1562.9802666517,"ID":1008,"Title":"Construct Binary Search Tree from Preorder Traversal","TitleZH":"前序遍历构造二叉搜索树","TitleSlug":"construct-binary-search-tree-from-preorder-traversal","ContestSlug":"weekly-contest-127","ProblemIndex":"Q4","ContestID_en":"Weekly Contest 127","ContestID_zh":"第 127 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Stack","slug":"stack"},{"name":"Tree","slug":"tree"},{"name":"Binary Search Tree","slug":"binary-search-tree"},{"name":"Monotonic Stack","slug":"monotonic-stack"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1562.9186033202,"ID":1452,"Title":"People Whose List of Favorite Companies Is Not a Subset of Another List","TitleZH":"收藏清单","TitleSlug":"people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list","ContestSlug":"weekly-contest-189","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 189","ContestID_zh":"第 189 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1562.7212466716,"ID":856,"Title":"Score of Parentheses","TitleZH":"括号的分数","TitleSlug":"score-of-parentheses","ContestSlug":"weekly-contest-90","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 90","ContestID_zh":"第 90 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"}]},{"Rating":1562.0956544608,"ID":2409,"Title":"Count Days Spent Together","TitleZH":"统计共同度过的日子数","TitleSlug":"count-days-spent-together","ContestSlug":"biweekly-contest-87","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 87","ContestID_zh":"第 87 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"}]},{"Rating":1561.2655635205,"ID":1256,"Title":"Encode Number","TitleZH":"加密数字","TitleSlug":"encode-number","ContestSlug":"biweekly-contest-13","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 13","ContestID_zh":"第 13 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":1561.0553908973,"ID":1376,"Title":"Time Needed to Inform All Employees","TitleZH":"通知所有员工所需的时间","TitleSlug":"time-needed-to-inform-all-employees","ContestSlug":"weekly-contest-179","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 179","ContestID_zh":"第 179 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"}]},{"Rating":1559.9709348417,"ID":2470,"Title":"Number of Subarrays With LCM Equal to K","TitleZH":"最小公倍数为 K 的子数组数目","TitleSlug":"number-of-subarrays-with-lcm-equal-to-k","ContestSlug":"weekly-contest-319","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 319","ContestID_zh":"第 319 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Number Theory","slug":"number-theory"}]},{"Rating":1558.9522968448,"ID":2310,"Title":"Sum of Numbers With Units Digit K","TitleZH":"个位数字为 K 的整数之和","TitleSlug":"sum-of-numbers-with-units-digit-k","ContestSlug":"weekly-contest-298","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 298","ContestID_zh":"第 298 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Greedy","slug":"greedy"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1558.7188539503,"ID":1144,"Title":"Decrease Elements To Make Array Zigzag","TitleZH":"递减元素使数组呈锯齿状","TitleSlug":"decrease-elements-to-make-array-zigzag","ContestSlug":"weekly-contest-148","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 148","ContestID_zh":"第 148 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1558.6880035344,"ID":1181,"Title":"Before and After Puzzle","TitleZH":"前后拼接","TitleSlug":"before-and-after-puzzle","ContestSlug":"biweekly-contest-8","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 8","ContestID_zh":"第 8 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1558.4971807039,"ID":1101,"Title":"The Earliest Moment When Everyone Become Friends","TitleZH":"彼此熟识的最早时间","TitleSlug":"the-earliest-moment-when-everyone-become-friends","ContestSlug":"biweekly-contest-3","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 3","ContestID_zh":"第 3 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Union Find","slug":"union-find"}]},{"Rating":1558.1421869292,"ID":1243,"Title":"Array Transformation","TitleZH":"数组变换","TitleSlug":"array-transformation","ContestSlug":"biweekly-contest-12","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 12","ContestID_zh":"第 12 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1557.017055582,"ID":2007,"Title":"Find Original Array From Doubled Array","TitleZH":"从双倍数组中还原原数组","TitleSlug":"find-original-array-from-doubled-array","ContestSlug":"biweekly-contest-61","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 61","ContestID_zh":"第 61 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1556.8824239708,"ID":2131,"Title":"Longest Palindrome by Concatenating Two Letter Words","TitleZH":"连接两字母单词得到的最长回文串","TitleSlug":"longest-palindrome-by-concatenating-two-letter-words","ContestSlug":"biweekly-contest-69","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 69","ContestID_zh":"第 69 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"},{"name":"Counting","slug":"counting"}]},{"Rating":1552.8935571247,"ID":2461,"Title":"Maximum Sum of Distinct Subarrays With Length K","TitleZH":"长度为 K 子数组中的最大和","TitleSlug":"maximum-sum-of-distinct-subarrays-with-length-k","ContestSlug":"weekly-contest-318","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 318","ContestID_zh":"第 318 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1550.4297615307,"ID":2207,"Title":"Maximize Number of Subsequences in a String","TitleZH":"字符串中最多数目的子字符串","TitleSlug":"maximize-number-of-subsequences-in-a-string","ContestSlug":"biweekly-contest-74","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 74","ContestID_zh":"第 74 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1550.0978082682,"ID":2208,"Title":"Minimum Operations to Halve Array Sum","TitleZH":"将数组和减半的最少操作次数","TitleSlug":"minimum-operations-to-halve-array-sum","ContestSlug":"biweekly-contest-74","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 74","ContestID_zh":"第 74 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1548.4678056182,"ID":1329,"Title":"Sort the Matrix Diagonally","TitleZH":"将矩阵按对角线排序","TitleSlug":"sort-the-matrix-diagonally","ContestSlug":"biweekly-contest-18","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 18","ContestID_zh":"第 18 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1548.1751146981,"ID":2456,"Title":"Most Popular Video Creator","TitleZH":"最流行的视频创作者","TitleSlug":"most-popular-video-creator","ContestSlug":"weekly-contest-317","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 317","ContestID_zh":"第 317 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1548.0854419238,"ID":1599,"Title":"Maximum Profit of Operating a Centennial Wheel","TitleZH":"经营摩天轮的最大利润","TitleSlug":"maximum-profit-of-operating-a-centennial-wheel","ContestSlug":"weekly-contest-208","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 208","ContestID_zh":"第 208 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1547.5714796512,"ID":954,"Title":"Array of Doubled Pairs","TitleZH":"二倍数对数组","TitleSlug":"array-of-doubled-pairs","ContestSlug":"weekly-contest-114","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 114","ContestID_zh":"第 114 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1547.0385279086,"ID":758,"Title":"Bold Words in String","TitleZH":"字符串中的加粗单词","TitleSlug":"bold-words-in-string","ContestSlug":"weekly-contest-66","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 66","ContestID_zh":"第 66 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Trie","slug":"trie"},{"name":"String Matching","slug":"string-matching"}]},{"Rating":1544.8391626032,"ID":1104,"Title":"Path In Zigzag Labelled Binary Tree","TitleZH":"二叉树寻路","TitleSlug":"path-in-zigzag-labelled-binary-tree","ContestSlug":"weekly-contest-143","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 143","ContestID_zh":"第 143 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Tree","slug":"tree"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1544.8261365027,"ID":1233,"Title":"Remove Sub-Folders from the Filesystem","TitleZH":"删除子文件夹","TitleSlug":"remove-sub-folders-from-the-filesystem","ContestSlug":"weekly-contest-159","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 159","ContestID_zh":"第 159 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Trie","slug":"trie"}]},{"Rating":1544.6371526659,"ID":794,"Title":"Valid Tic-Tac-Toe State","TitleZH":"有效的井字游戏","TitleSlug":"valid-tic-tac-toe-state","ContestSlug":"weekly-contest-74","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 74","ContestID_zh":"第 74 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"}]},{"Rating":1542.5630367445,"ID":812,"Title":"Largest Triangle Area","TitleZH":"最大三角形面积","TitleSlug":"largest-triangle-area","ContestSlug":"weekly-contest-79","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 79","ContestID_zh":"第 79 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Geometry","slug":"geometry"}]},{"Rating":1541.7840320661,"ID":1283,"Title":"Find the Smallest Divisor Given a Threshold","TitleZH":"使结果不超过阈值的最小除数","TitleSlug":"find-the-smallest-divisor-given-a-threshold","ContestSlug":"weekly-contest-166","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 166","ContestID_zh":"第 166 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":1541.6944600975,"ID":986,"Title":"Interval List Intersections","TitleZH":"区间列表的交集","TitleSlug":"interval-list-intersections","ContestSlug":"weekly-contest-122","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 122","ContestID_zh":"第 122 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"}]},{"Rating":1541.6176288991,"ID":1749,"Title":"Maximum Absolute Sum of Any Subarray","TitleZH":"任意子数组和的绝对值的最大值","TitleSlug":"maximum-absolute-sum-of-any-subarray","ContestSlug":"biweekly-contest-45","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 45","ContestID_zh":"第 45 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1541.5405749918,"ID":1209,"Title":"Remove All Adjacent Duplicates in String II","TitleZH":"删除字符串中的所有相邻重复项 II","TitleSlug":"remove-all-adjacent-duplicates-in-string-ii","ContestSlug":"weekly-contest-156","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 156","ContestID_zh":"第 156 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"}]},{"Rating":1541.348438509,"ID":1007,"Title":"Minimum Domino Rotations For Equal Row","TitleZH":"行相等的最少多米诺旋转","TitleSlug":"minimum-domino-rotations-for-equal-row","ContestSlug":"weekly-contest-127","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 127","ContestID_zh":"第 127 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1541.2260256298,"ID":1229,"Title":"Meeting Scheduler","TitleZH":"安排会议日程","TitleSlug":"meeting-scheduler","ContestSlug":"biweekly-contest-11","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 11","ContestID_zh":"第 11 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1540.5750839091,"ID":1382,"Title":"Balance a Binary Search Tree","TitleZH":"将二叉搜索树变平衡","TitleSlug":"balance-a-binary-search-tree","ContestSlug":"weekly-contest-180","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 180","ContestID_zh":"第 180 场周赛","topicTags":[{"name":"Divide and Conquer","slug":"divide-and-conquer"},{"name":"Greedy","slug":"greedy"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Search Tree","slug":"binary-search-tree"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1540.2351411176,"ID":2349,"Title":"Design a Number Container System","TitleZH":"设计数字容器系统","TitleSlug":"design-a-number-container-system","ContestSlug":"biweekly-contest-83","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 83","ContestID_zh":"第 83 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Design","slug":"design"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":1539.2250193318,"ID":1992,"Title":"Find All Groups of Farmland","TitleZH":"找到所有的农场组","TitleSlug":"find-all-groups-of-farmland","ContestSlug":"biweekly-contest-60","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 60","ContestID_zh":"第 60 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1538.233149704,"ID":2178,"Title":"Maximum Split of Positive Even Integers","TitleZH":"拆分成最多数目的偶整数之和","TitleSlug":"maximum-split-of-positive-even-integers","ContestSlug":"biweekly-contest-72","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 72","ContestID_zh":"第 72 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Backtracking","slug":"backtracking"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1537.1387686755,"ID":1023,"Title":"Camelcase Matching","TitleZH":"驼峰式匹配","TitleSlug":"camelcase-matching","ContestSlug":"weekly-contest-131","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 131","ContestID_zh":"第 131 场周赛","topicTags":[{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"},{"name":"Trie","slug":"trie"},{"name":"String Matching","slug":"string-matching"}]},{"Rating":1536.7018543075,"ID":1861,"Title":"Rotating the Box","TitleZH":"旋转盒子","TitleSlug":"rotating-the-box","ContestSlug":"biweekly-contest-52","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 52","ContestID_zh":"第 52 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1534.325005151,"ID":865,"Title":"Smallest Subtree with all the Deepest Nodes","TitleZH":"具有所有最深节点的最小子树","TitleSlug":"smallest-subtree-with-all-the-deepest-nodes","ContestSlug":"weekly-contest-92","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 92","ContestID_zh":"第 92 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1534.0648719302,"ID":1797,"Title":"Design Authentication Manager","TitleZH":"设计一个验证系统","TitleSlug":"design-authentication-manager","ContestSlug":"biweekly-contest-48","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 48","ContestID_zh":"第 48 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Design","slug":"design"}]},{"Rating":1533.9285875234,"ID":1362,"Title":"Closest Divisors","TitleZH":"最接近的因数","TitleSlug":"closest-divisors","ContestSlug":"weekly-contest-177","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 177","ContestID_zh":"第 177 场周赛","topicTags":[{"name":"Math","slug":"math"}]},{"Rating":1533.3376144199,"ID":1930,"Title":"Unique Length-3 Palindromic Subsequences","TitleZH":"长度为 3 的不同回文子序列","TitleSlug":"unique-length-3-palindromic-subsequences","ContestSlug":"weekly-contest-249","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 249","ContestID_zh":"第 249 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1532.3349133769,"ID":2429,"Title":"Minimize XOR","TitleZH":"最小 XOR","TitleSlug":"minimize-xor","ContestSlug":"weekly-contest-313","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 313","ContestID_zh":"第 313 场周赛","topicTags":[{"name":"Greedy","slug":"greedy"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":1532.2539947529,"ID":900,"Title":"RLE Iterator","TitleZH":"RLE 迭代器","TitleSlug":"rle-iterator","ContestSlug":"weekly-contest-101","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 101","ContestID_zh":"第 101 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Design","slug":"design"},{"name":"Counting","slug":"counting"},{"name":"Iterator","slug":"iterator"}]},{"Rating":1530.495439788,"ID":1400,"Title":"Construct K Palindrome Strings","TitleZH":"构造 K 个回文字符串","TitleSlug":"construct-k-palindrome-strings","ContestSlug":"biweekly-contest-23","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 23","ContestID_zh":"第 23 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"},{"name":"Counting","slug":"counting"}]},{"Rating":1530.4652027753,"ID":1657,"Title":"Determine if Two Strings Are Close","TitleZH":"确定两个字符串是否接近","TitleSlug":"determine-if-two-strings-are-close","ContestSlug":"weekly-contest-215","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 215","ContestID_zh":"第 215 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1530.0343519239,"ID":1726,"Title":"Tuple with Same Product","TitleZH":"同积元组","TitleSlug":"tuple-with-same-product","ContestSlug":"weekly-contest-224","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 224","ContestID_zh":"第 224 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"}]},{"Rating":1529.7617243868,"ID":881,"Title":"Boats to Save People","TitleZH":"救生艇","TitleSlug":"boats-to-save-people","ContestSlug":"weekly-contest-96","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 96","ContestID_zh":"第 96 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1528.7183829005,"ID":1695,"Title":"Maximum Erasure Value","TitleZH":"删除子数组的最大得分","TitleSlug":"maximum-erasure-value","ContestSlug":"weekly-contest-220","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 220","ContestID_zh":"第 220 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1527.6868660176,"ID":1921,"Title":"Eliminate Maximum Number of Monsters","TitleZH":"消灭怪物的最大数量","TitleSlug":"eliminate-maximum-number-of-monsters","ContestSlug":"weekly-contest-248","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 248","ContestID_zh":"第 248 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1525.2146106195,"ID":2201,"Title":"Count Artifacts That Can Be Extracted","TitleZH":"统计可以提取的工件","TitleSlug":"count-artifacts-that-can-be-extracted","ContestSlug":"weekly-contest-284","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 284","ContestID_zh":"第 284 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1524.8218282113,"ID":1272,"Title":"Remove Interval","TitleZH":"删除区间","TitleSlug":"remove-interval","ContestSlug":"biweekly-contest-14","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 14","ContestID_zh":"第 14 场双周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1524.5693481538,"ID":1442,"Title":"Count Triplets That Can Form Two Arrays of Equal XOR","TitleZH":"形成两个异或相等数组的三元组数目","TitleSlug":"count-triplets-that-can-form-two-arrays-of-equal-xor","ContestSlug":"weekly-contest-188","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 188","ContestID_zh":"第 188 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Math","slug":"math"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1524.3227469,"ID":1640,"Title":"Check Array Formation Through Concatenation","TitleZH":"能否连接形成数组","TitleSlug":"check-array-formation-through-concatenation","ContestSlug":"weekly-contest-213","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 213","ContestID_zh":"第 213 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"}]},{"Rating":1523.4113866454,"ID":1829,"Title":"Maximum XOR for Each Query","TitleZH":"每个查询的最大异或值","TitleSlug":"maximum-xor-for-each-query","ContestSlug":"biweekly-contest-50","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 50","ContestID_zh":"第 50 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1521.9977490324,"ID":1615,"Title":"Maximal Network Rank","TitleZH":"最大网络秩","TitleSlug":"maximal-network-rank","ContestSlug":"weekly-contest-210","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 210","ContestID_zh":"第 210 场周赛","topicTags":[{"name":"Graph","slug":"graph"}]},{"Rating":1521.7133617698,"ID":1763,"Title":"Longest Nice Substring","TitleZH":"最长的美好子字符串","TitleSlug":"longest-nice-substring","ContestSlug":"biweekly-contest-46","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 46","ContestID_zh":"第 46 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Divide and Conquer","slug":"divide-and-conquer"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1521.1768537583,"ID":1041,"Title":"Robot Bounded In Circle","TitleZH":"困于环中的机器人","TitleSlug":"robot-bounded-in-circle","ContestSlug":"weekly-contest-136","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 136","ContestID_zh":"第 136 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1519.1715594347,"ID":1641,"Title":"Count Sorted Vowel Strings","TitleZH":"统计字典序元音字符串的数目","TitleSlug":"count-sorted-vowel-strings","ContestSlug":"weekly-contest-213","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 213","ContestID_zh":"第 213 场周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1516.8229485853,"ID":775,"Title":"Global and Local Inversions","TitleZH":"全局倒置与局部倒置","TitleSlug":"global-and-local-inversions","ContestSlug":"weekly-contest-69","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 69","ContestID_zh":"第 69 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"}]},{"Rating":1516.4104902196,"ID":904,"Title":"Fruit Into Baskets","TitleZH":"水果成篮","TitleSlug":"fruit-into-baskets","ContestSlug":"weekly-contest-102","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 102","ContestID_zh":"第 102 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1514.8181710611,"ID":1855,"Title":"Maximum Distance Between a Pair of Values","TitleZH":"下标对中的最大距离","TitleSlug":"maximum-distance-between-a-pair-of-values","ContestSlug":"weekly-contest-240","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 240","ContestID_zh":"第 240 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Binary Search","slug":"binary-search"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1512.3323577063,"ID":1557,"Title":"Minimum Number of Vertices to Reach All Nodes","TitleZH":"可以到达所有点的最少点数目","TitleSlug":"minimum-number-of-vertices-to-reach-all-nodes","ContestSlug":"biweekly-contest-33","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 33","ContestID_zh":"第 33 场双周赛","topicTags":[{"name":"Graph","slug":"graph"}]},{"Rating":1511.3725353467,"ID":1110,"Title":"Delete Nodes And Return Forest","TitleZH":"删点成林","TitleSlug":"delete-nodes-and-return-forest","ContestSlug":"weekly-contest-144","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 144","ContestID_zh":"第 144 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1509.5562928491,"ID":2216,"Title":"Minimum Deletions to Make Array Beautiful","TitleZH":"美化数组的最少删除数","TitleSlug":"minimum-deletions-to-make-array-beautiful","ContestSlug":"weekly-contest-286","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 286","ContestID_zh":"第 286 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Stack","slug":"stack"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1509.5432131875,"ID":1647,"Title":"Minimum Deletions to Make Character Frequencies Unique","TitleZH":"字符频次唯一的最小删除次数","TitleSlug":"minimum-deletions-to-make-character-frequencies-unique","ContestSlug":"weekly-contest-214","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 214","ContestID_zh":"第 214 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1508.1169489285,"ID":1151,"Title":"Minimum Swaps to Group All 1's Together","TitleZH":"最少交换次数来组合所有的 1","TitleSlug":"minimum-swaps-to-group-all-1s-together","ContestSlug":"biweekly-contest-6","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 6","ContestID_zh":"第 6 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1508.099765827,"ID":1496,"Title":"Path Crossing","TitleZH":"判断路径是否相交","TitleSlug":"path-crossing","ContestSlug":"weekly-contest-195","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 195","ContestID_zh":"第 195 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1507.8701119064,"ID":892,"Title":"Surface Area of 3D Shapes","TitleZH":"三维形体的表面积","TitleSlug":"surface-area-of-3d-shapes","ContestSlug":"weekly-contest-99","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 99","ContestID_zh":"第 99 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Geometry","slug":"geometry"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1507.1617507911,"ID":2105,"Title":"Watering Plants II","TitleZH":"给植物浇水 II","TitleSlug":"watering-plants-ii","ContestSlug":"weekly-contest-271","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 271","ContestID_zh":"第 271 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1506.8958220609,"ID":1387,"Title":"Sort Integers by The Power Value","TitleZH":"将整数按权重排序","TitleSlug":"sort-integers-by-the-power-value","ContestSlug":"biweekly-contest-22","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 22","ContestID_zh":"第 22 场双周赛","topicTags":[{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Memoization","slug":"memoization"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1505.8669082864,"ID":1253,"Title":"Reconstruct a 2-Row Binary Matrix","TitleZH":"重构 2 行二进制矩阵","TitleSlug":"reconstruct-a-2-row-binary-matrix","ContestSlug":"weekly-contest-162","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 162","ContestID_zh":"第 162 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1505.82499953,"ID":1780,"Title":"Check if Number is a Sum of Powers of Three","TitleZH":"判断一个数字是否可以表示成三的幂的和","TitleSlug":"check-if-number-is-a-sum-of-powers-of-three","ContestSlug":"biweekly-contest-47","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 47","ContestID_zh":"第 47 场双周赛","topicTags":[{"name":"Math","slug":"math"}]},{"Rating":1504.8237159326,"ID":869,"Title":"Reordered Power of 2","TitleZH":"重新排序得到 2 的幂","TitleSlug":"reordered-power-of-2","ContestSlug":"weekly-contest-93","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 93","ContestID_zh":"第 93 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Sorting","slug":"sorting"},{"name":"Counting","slug":"counting"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1504.2133321504,"ID":2104,"Title":"Sum of Subarray Ranges","TitleZH":"子数组范围和","TitleSlug":"sum-of-subarray-ranges","ContestSlug":"weekly-contest-271","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 271","ContestID_zh":"第 271 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Stack","slug":"stack"},{"name":"Monotonic Stack","slug":"monotonic-stack"}]},{"Rating":1504.0178888667,"ID":1461,"Title":"Check If a String Contains All Binary Codes of Size K","TitleZH":"检查一个字符串是否包含所有长度为 K 的二进制子串","TitleSlug":"check-if-a-string-contains-all-binary-codes-of-size-k","ContestSlug":"biweekly-contest-27","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 27","ContestID_zh":"第 27 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Rolling Hash","slug":"rolling-hash"},{"name":"Hash Function","slug":"hash-function"}]},{"Rating":1502.5363677723,"ID":2358,"Title":"Maximum Number of Groups Entering a Competition","TitleZH":"分组的最大数量","TitleSlug":"maximum-number-of-groups-entering-a-competition","ContestSlug":"weekly-contest-304","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 304","ContestID_zh":"第 304 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Binary Search","slug":"binary-search"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1501.6846714598,"ID":1750,"Title":"Minimum Length of String After Deleting Similar Ends","TitleZH":"删除字符串两端相同字符后的最短长度","TitleSlug":"minimum-length-of-string-after-deleting-similar-ends","ContestSlug":"biweekly-contest-45","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 45","ContestID_zh":"第 45 场双周赛","topicTags":[{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"}]},{"Rating":1501.1152614679,"ID":1090,"Title":"Largest Values From Labels","TitleZH":"受标签影响的最大值","TitleSlug":"largest-values-from-labels","ContestSlug":"weekly-contest-141","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 141","ContestID_zh":"第 141 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"},{"name":"Counting","slug":"counting"}]},{"Rating":1500.8381829812,"ID":915,"Title":"Partition Array into Disjoint Intervals","TitleZH":"分割数组","TitleSlug":"partition-array-into-disjoint-intervals","ContestSlug":"weekly-contest-104","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 104","ContestID_zh":"第 104 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1499.7136257352,"ID":1525,"Title":"Number of Good Ways to Split a String","TitleZH":"字符串的好分割数目","TitleSlug":"number-of-good-ways-to-split-a-string","ContestSlug":"biweekly-contest-31","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 31","ContestID_zh":"第 31 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":1499.5903720292,"ID":2507,"Title":"Smallest Value After Replacing With Sum of Prime Factors","TitleZH":"使用质因数之和替换后可以取到的最小值","TitleSlug":"smallest-value-after-replacing-with-sum-of-prime-factors","ContestSlug":"weekly-contest-324","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 324","ContestID_zh":"第 324 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Number Theory","slug":"number-theory"}]},{"Rating":1499.3290269267,"ID":1968,"Title":"Array With Elements Not Equal to Average of Neighbors","TitleZH":"构造元素不等于两相邻元素平均值的数组","TitleSlug":"array-with-elements-not-equal-to-average-of-neighbors","ContestSlug":"weekly-contest-254","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 254","ContestID_zh":"第 254 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1498.1542511841,"ID":1904,"Title":"The Number of Full Rounds You Have Played","TitleZH":"你完成的完整对局数","TitleSlug":"the-number-of-full-rounds-you-have-played","ContestSlug":"weekly-contest-246","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 246","ContestID_zh":"第 246 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"}]},{"Rating":1497.8880991093,"ID":998,"Title":"Maximum Binary Tree II","TitleZH":"最大二叉树 II","TitleSlug":"maximum-binary-tree-ii","ContestSlug":"weekly-contest-125","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 125","ContestID_zh":"第 125 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1496.9128643588,"ID":1208,"Title":"Get Equal Substrings Within Budget","TitleZH":"尽可能使字符串相等","TitleSlug":"get-equal-substrings-within-budget","ContestSlug":"weekly-contest-156","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 156","ContestID_zh":"第 156 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1496.2502937005,"ID":2285,"Title":"Maximum Total Importance of Roads","TitleZH":"道路的最大总重要性","TitleSlug":"maximum-total-importance-of-roads","ContestSlug":"biweekly-contest-79","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 79","ContestID_zh":"第 79 场双周赛","topicTags":[{"name":"Greedy","slug":"greedy"},{"name":"Graph","slug":"graph"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1496.1462748679,"ID":2191,"Title":"Sort the Jumbled Numbers","TitleZH":"将杂乱无章的数字排序","TitleSlug":"sort-the-jumbled-numbers","ContestSlug":"biweekly-contest-73","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 73","ContestID_zh":"第 73 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1495.715740828,"ID":1685,"Title":"Sum of Absolute Differences in a Sorted Array","TitleZH":"有序数组中差绝对值之和","TitleSlug":"sum-of-absolute-differences-in-a-sorted-array","ContestSlug":"biweekly-contest-41","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 41","ContestID_zh":"第 41 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1495.5180147817,"ID":2419,"Title":"Longest Subarray With Maximum Bitwise AND","TitleZH":"按位与最大的最长子数组","TitleSlug":"longest-subarray-with-maximum-bitwise-and","ContestSlug":"weekly-contest-312","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 312","ContestID_zh":"第 312 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Brainteaser","slug":"brainteaser"}]},{"Rating":1495.3186477678,"ID":949,"Title":"Largest Time for Given Digits","TitleZH":"给定数字能组成的最大时间","TitleSlug":"largest-time-for-given-digits","ContestSlug":"weekly-contest-113","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 113","ContestID_zh":"第 113 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1494.500749598,"ID":2483,"Title":"Minimum Penalty for a Shop","TitleZH":"商店的最少代价","TitleSlug":"minimum-penalty-for-a-shop","ContestSlug":"biweekly-contest-92","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 92","ContestID_zh":"第 92 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1491.4638194905,"ID":1806,"Title":"Minimum Number of Operations to Reinitialize a Permutation","TitleZH":"还原排列的最少操作步数","TitleSlug":"minimum-number-of-operations-to-reinitialize-a-permutation","ContestSlug":"weekly-contest-234","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 234","ContestID_zh":"第 234 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1490.8990184504,"ID":1759,"Title":"Count Number of Homogenous Substrings","TitleZH":"统计同构子字符串的数目","TitleSlug":"count-number-of-homogenous-substrings","ContestSlug":"weekly-contest-228","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 228","ContestID_zh":"第 228 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"}]},{"Rating":1490.2370387981,"ID":1296,"Title":"Divide Array in Sets of K Consecutive Numbers","TitleZH":"划分数组为连续数字的集合","TitleSlug":"divide-array-in-sets-of-k-consecutive-numbers","ContestSlug":"weekly-contest-168","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 168","ContestID_zh":"第 168 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1489.0102202162,"ID":1175,"Title":"Prime Arrangements","TitleZH":"质数排列","TitleSlug":"prime-arrangements","ContestSlug":"weekly-contest-152","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 152","ContestID_zh":"第 152 场周赛","topicTags":[{"name":"Math","slug":"math"}]},{"Rating":1487.5826663483,"ID":1753,"Title":"Maximum Score From Removing Stones","TitleZH":"移除石子的最大得分","TitleSlug":"maximum-score-from-removing-stones","ContestSlug":"weekly-contest-227","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 227","ContestID_zh":"第 227 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Greedy","slug":"greedy"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1486.764933431,"ID":1637,"Title":"Widest Vertical Area Between Two Points Containing No Points","TitleZH":"两点之间不包含任何点的最宽垂直面积","TitleSlug":"widest-vertical-area-between-two-points-containing-no-points","ContestSlug":"biweekly-contest-38","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 38","ContestID_zh":"第 38 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1486.4687014051,"ID":1566,"Title":"Detect Pattern of Length M Repeated K or More Times","TitleZH":"重复至少 K 次且长度为 M 的模式","TitleSlug":"detect-pattern-of-length-m-repeated-k-or-more-times","ContestSlug":"weekly-contest-204","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 204","ContestID_zh":"第 204 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1485.6550472186,"ID":1190,"Title":"Reverse Substrings Between Each Pair of Parentheses","TitleZH":"反转每对括号间的子串","TitleSlug":"reverse-substrings-between-each-pair-of-parentheses","ContestSlug":"weekly-contest-154","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 154","ContestID_zh":"第 154 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"}]},{"Rating":1485.135401269,"ID":1418,"Title":"Display Table of Food Orders in a Restaurant","TitleZH":"点菜展示表","TitleSlug":"display-table-of-food-orders-in-a-restaurant","ContestSlug":"weekly-contest-185","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 185","ContestID_zh":"第 185 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Sorting","slug":"sorting"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":1483.8137189709,"ID":1314,"Title":"Matrix Block Sum","TitleZH":"矩阵区域和","TitleSlug":"matrix-block-sum","ContestSlug":"biweekly-contest-17","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 17","ContestID_zh":"第 17 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1481.960807786,"ID":1807,"Title":"Evaluate the Bracket Pairs of a String","TitleZH":"替换字符串中的括号内容","TitleSlug":"evaluate-the-bracket-pairs-of-a-string","ContestSlug":"weekly-contest-234","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 234","ContestID_zh":"第 234 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1481.5701319876,"ID":1167,"Title":"Minimum Cost to Connect Sticks","TitleZH":"连接棒材的最低费用","TitleSlug":"minimum-cost-to-connect-sticks","ContestSlug":"biweekly-contest-7","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 7","ContestID_zh":"第 7 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1481.1046340847,"ID":2380,"Title":"Time Needed to Rearrange a Binary String","TitleZH":"二进制字符串重新安排顺序需要的时间","TitleSlug":"time-needed-to-rearrange-a-binary-string","ContestSlug":"biweekly-contest-85","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 85","ContestID_zh":"第 85 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1480.1116248664,"ID":1087,"Title":"Brace Expansion","TitleZH":"花括号展开","TitleSlug":"brace-expansion","ContestSlug":"biweekly-contest-2","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 2","ContestID_zh":"第 2 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Backtracking","slug":"backtracking"},{"name":"Breadth-First Search","slug":"breadth-first-search"}]},{"Rating":1479.9828219111,"ID":2501,"Title":"Longest Square Streak in an Array","TitleZH":"数组中最长的方波","TitleSlug":"longest-square-streak-in-an-array","ContestSlug":"weekly-contest-323","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 323","ContestID_zh":"第 323 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Binary Search","slug":"binary-search"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1479.4837595809,"ID":1545,"Title":"Find Kth Bit in Nth Binary String","TitleZH":"找出第 N 个二进制字符串中的第 K 位","TitleSlug":"find-kth-bit-in-nth-binary-string","ContestSlug":"weekly-contest-201","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 201","ContestID_zh":"第 201 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Recursion","slug":"recursion"}]},{"Rating":1479.0110934646,"ID":1166,"Title":"Design File System","TitleZH":"设计文件系统","TitleSlug":"design-file-system","ContestSlug":"biweekly-contest-7","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 7","ContestID_zh":"第 7 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Design","slug":"design"},{"name":"Trie","slug":"trie"}]},{"Rating":1478.3848028264,"ID":1390,"Title":"Four Divisors","TitleZH":"四因数","TitleSlug":"four-divisors","ContestSlug":"weekly-contest-181","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 181","ContestID_zh":"第 181 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"}]},{"Rating":1477.4844514104,"ID":951,"Title":"Flip Equivalent Binary Trees","TitleZH":"翻转等价二叉树","TitleSlug":"flip-equivalent-binary-trees","ContestSlug":"weekly-contest-113","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 113","ContestID_zh":"第 113 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1476.9118898539,"ID":2368,"Title":"Reachable Nodes With Restrictions","TitleZH":"受限条件下可到达节点的数目","TitleSlug":"reachable-nodes-with-restrictions","ContestSlug":"weekly-contest-305","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 305","ContestID_zh":"第 305 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"}]},{"Rating":1476.9062320302,"ID":2300,"Title":"Successful Pairs of Spells and Potions","TitleZH":"咒语和药水的成功对数","TitleSlug":"successful-pairs-of-spells-and-potions","ContestSlug":"biweekly-contest-80","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 80","ContestID_zh":"第 80 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1474.0150725665,"ID":984,"Title":"String Without AAA or BBB","TitleZH":"不含 AAA 或 BBB 的字符串","TitleSlug":"string-without-aaa-or-bbb","ContestSlug":"weekly-contest-121","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 121","ContestID_zh":"第 121 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1473.864993045,"ID":1328,"Title":"Break a Palindrome","TitleZH":"破坏回文串","TitleSlug":"break-a-palindrome","ContestSlug":"biweekly-contest-18","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 18","ContestID_zh":"第 18 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1473.7057465272,"ID":1352,"Title":"Product of the Last K Numbers","TitleZH":"最后 K 个数的乘积","TitleSlug":"product-of-the-last-k-numbers","ContestSlug":"weekly-contest-176","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 176","ContestID_zh":"第 176 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Design","slug":"design"},{"name":"Queue","slug":"queue"},{"name":"Data Stream","slug":"data-stream"}]},{"Rating":1473.2523136772,"ID":897,"Title":"Increasing Order Search Tree","TitleZH":"递增顺序查找树","TitleSlug":"increasing-order-search-tree","ContestSlug":"weekly-contest-100","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 100","ContestID_zh":"第 100 场周赛","topicTags":[{"name":"Stack","slug":"stack"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Search Tree","slug":"binary-search-tree"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1472.7864965062,"ID":2265,"Title":"Count Nodes Equal to Average of Subtree","TitleZH":"统计值等于子树平均值的节点数","TitleSlug":"count-nodes-equal-to-average-of-subtree","ContestSlug":"weekly-contest-292","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 292","ContestID_zh":"第 292 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1471.8964024887,"ID":2047,"Title":"Number of Valid Words in a Sentence","TitleZH":"句子中的有效单词数","TitleSlug":"number-of-valid-words-in-a-sentence","ContestSlug":"weekly-contest-264","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 264","ContestID_zh":"第 264 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1471.6221713607,"ID":1093,"Title":"Statistics from a Large Sample","TitleZH":"大样本统计","TitleSlug":"statistics-from-a-large-sample","ContestSlug":"weekly-contest-142","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 142","ContestID_zh":"第 142 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Probability and Statistics","slug":"probability-and-statistics"}]},{"Rating":1467.9366439696,"ID":2012,"Title":"Sum of Beauty in the Array","TitleZH":"数组美丽值求和","TitleSlug":"sum-of-beauty-in-the-array","ContestSlug":"weekly-contest-259","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 259","ContestID_zh":"第 259 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1467.7383709213,"ID":2038,"Title":"Remove Colored Pieces if Both Neighbors are the Same Color","TitleZH":"如果相邻两个颜色均相同则删除当前颜色","TitleSlug":"remove-colored-pieces-if-both-neighbors-are-the-same-color","ContestSlug":"biweekly-contest-63","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 63","ContestID_zh":"第 63 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"},{"name":"Game Theory","slug":"game-theory"}]},{"Rating":1465.7023558248,"ID":1414,"Title":"Find the Minimum Number of Fibonacci Numbers Whose Sum Is K","TitleZH":"和为 K 的最少斐波那契数字数目","TitleSlug":"find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k","ContestSlug":"biweekly-contest-24","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 24","ContestID_zh":"第 24 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1464.6895034875,"ID":1361,"Title":"Validate Binary Tree Nodes","TitleZH":"验证二叉树","TitleSlug":"validate-binary-tree-nodes","ContestSlug":"weekly-contest-177","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 177","ContestID_zh":"第 177 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Graph","slug":"graph"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1464.5254961488,"ID":1396,"Title":"Design Underground System","TitleZH":"设计地铁系统","TitleSlug":"design-underground-system","ContestSlug":"weekly-contest-182","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 182","ContestID_zh":"第 182 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Design","slug":"design"}]},{"Rating":1462.4423844498,"ID":1022,"Title":"Sum of Root To Leaf Binary Numbers","TitleZH":"从根到叶的二进制数之和","TitleSlug":"sum-of-root-to-leaf-binary-numbers","ContestSlug":"weekly-contest-131","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 131","ContestID_zh":"第 131 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1461.9157715206,"ID":946,"Title":"Validate Stack Sequences","TitleZH":"验证栈序列","TitleSlug":"validate-stack-sequences","ContestSlug":"weekly-contest-112","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 112","ContestID_zh":"第 112 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Stack","slug":"stack"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1461.2892510067,"ID":1909,"Title":"Remove One Element to Make the Array Strictly Increasing","TitleZH":"删除一个元素使数组严格递增","TitleSlug":"remove-one-element-to-make-the-array-strictly-increasing","ContestSlug":"biweekly-contest-55","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 55","ContestID_zh":"第 55 场双周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1460.9610936441,"ID":833,"Title":"Find And Replace in String","TitleZH":"字符串中的查找与替换","TitleSlug":"find-and-replace-in-string","ContestSlug":"weekly-contest-84","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 84","ContestID_zh":"第 84 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1460.9105672071,"ID":1910,"Title":"Remove All Occurrences of a Substring","TitleZH":"删除一个字符串中所有出现的给定子字符串","TitleSlug":"remove-all-occurrences-of-a-substring","ContestSlug":"biweekly-contest-55","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 55","ContestID_zh":"第 55 场双周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1460.5903088359,"ID":1663,"Title":"Smallest String With A Given Numeric Value","TitleZH":"具有给定数值的最小字符串","TitleSlug":"smallest-string-with-a-given-numeric-value","ContestSlug":"weekly-contest-216","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 216","ContestID_zh":"第 216 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1459.8208951847,"ID":1310,"Title":"XOR Queries of a Subarray","TitleZH":"子数组异或查询","TitleSlug":"xor-queries-of-a-subarray","ContestSlug":"weekly-contest-170","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 170","ContestID_zh":"第 170 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1459.7513584849,"ID":2452,"Title":"Words Within Two Edits of Dictionary","TitleZH":"距离字典两次编辑以内的单词","TitleSlug":"words-within-two-edits-of-dictionary","ContestSlug":"biweekly-contest-90","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 90","ContestID_zh":"第 90 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"}]},{"Rating":1458.356493039,"ID":2062,"Title":"Count Vowel Substrings of a String","TitleZH":"统计字符串中的元音子字符串","TitleSlug":"count-vowel-substrings-of-a-string","ContestSlug":"weekly-contest-266","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 266","ContestID_zh":"第 266 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1455.8516200241,"ID":2391,"Title":"Minimum Amount of Time to Collect Garbage","TitleZH":"收集垃圾的最少总时间","TitleSlug":"minimum-amount-of-time-to-collect-garbage","ContestSlug":"weekly-contest-308","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 308","ContestID_zh":"第 308 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1454.7459647138,"ID":2094,"Title":"Finding 3-Digit Even Numbers","TitleZH":"找出 3 位偶数","TitleSlug":"finding-3-digit-even-numbers","ContestSlug":"weekly-contest-270","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 270","ContestID_zh":"第 270 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Sorting","slug":"sorting"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1454.5942017003,"ID":2487,"Title":"Remove Nodes From Linked List","TitleZH":"从链表中移除节点","TitleSlug":"remove-nodes-from-linked-list","ContestSlug":"weekly-contest-321","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 321","ContestID_zh":"第 321 场周赛","topicTags":[{"name":"Linked List","slug":"linked-list"},{"name":"Stack","slug":"stack"},{"name":"Recursion","slug":"recursion"},{"name":"Monotonic Stack","slug":"monotonic-stack"}]},{"Rating":1454.3901912166,"ID":1846,"Title":"Maximum Element After Decreasing and Rearranging","TitleZH":"减小和重新排列数组后的最大元素","TitleSlug":"maximum-element-after-decreasing-and-rearranging","ContestSlug":"biweekly-contest-51","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 51","ContestID_zh":"第 51 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1453.7818053022,"ID":1472,"Title":"Design Browser History","TitleZH":"设计浏览器历史记录","TitleSlug":"design-browser-history","ContestSlug":"weekly-contest-192","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 192","ContestID_zh":"第 192 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Linked List","slug":"linked-list"},{"name":"Stack","slug":"stack"},{"name":"Design","slug":"design"},{"name":"Doubly-Linked List","slug":"doubly-linked-list"},{"name":"Data Stream","slug":"data-stream"}]},{"Rating":1453.1833769825,"ID":781,"Title":"Rabbits in Forest","TitleZH":"森林中的兔子","TitleSlug":"rabbits-in-forest","ContestSlug":"weekly-contest-71","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 71","ContestID_zh":"第 71 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Math","slug":"math"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1450.5787293419,"ID":831,"Title":"Masking Personal Information","TitleZH":"隐藏个人信息","TitleSlug":"masking-personal-information","ContestSlug":"weekly-contest-83","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 83","ContestID_zh":"第 83 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1450.0534545623,"ID":2511,"Title":"Maximum Enemy Forts That Can Be Captured","TitleZH":"最多可以摧毁的敌人城堡数目","TitleSlug":"maximum-enemy-forts-that-can-be-captured","ContestSlug":"biweekly-contest-94","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 94","ContestID_zh":"第 94 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"}]},{"Rating":1448.1207963663,"ID":945,"Title":"Minimum Increment to Make Array Unique","TitleZH":"使数组唯一的最小增量","TitleSlug":"minimum-increment-to-make-array-unique","ContestSlug":"weekly-contest-112","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 112","ContestID_zh":"第 112 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"},{"name":"Counting","slug":"counting"}]},{"Rating":1447.0268321102,"ID":2099,"Title":"Find Subsequence of Length K With the Largest Sum","TitleZH":"找到和最大的长度为 K 的子序列","TitleSlug":"find-subsequence-of-length-k-with-the-largest-sum","ContestSlug":"biweekly-contest-67","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 67","ContestID_zh":"第 67 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1446.4280778775,"ID":1026,"Title":"Maximum Difference Between Node and Ancestor","TitleZH":"节点与其祖先之间的最大差值","TitleSlug":"maximum-difference-between-node-and-ancestor","ContestSlug":"weekly-contest-132","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 132","ContestID_zh":"第 132 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1445.3734269673,"ID":1946,"Title":"Largest Number After Mutating Substring","TitleZH":"子字符串突变后可能得到的最大整数","TitleSlug":"largest-number-after-mutating-substring","ContestSlug":"weekly-contest-251","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 251","ContestID_zh":"第 251 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1445.1422945604,"ID":2295,"Title":"Replace Elements in an Array","TitleZH":"替换数组中的元素","TitleSlug":"replace-elements-in-an-array","ContestSlug":"weekly-contest-296","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 296","ContestID_zh":"第 296 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1444.6795731919,"ID":2028,"Title":"Find Missing Observations","TitleZH":"找出缺失的观测数据","TitleSlug":"find-missing-observations","ContestSlug":"weekly-contest-261","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 261","ContestID_zh":"第 261 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1444.6098846511,"ID":1465,"Title":"Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts","TitleZH":"切割后面积最大的蛋糕","TitleSlug":"maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts","ContestSlug":"weekly-contest-191","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 191","ContestID_zh":"第 191 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1444.2068009303,"ID":942,"Title":"DI String Match","TitleZH":"增减字符串匹配","TitleSlug":"di-string-match","ContestSlug":"weekly-contest-111","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 111","ContestID_zh":"第 111 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1443.2353621969,"ID":1560,"Title":"Most Visited Sector in  a Circular Track","TitleZH":"圆形赛道上经过次数最多的扇区","TitleSlug":"most-visited-sector-in-a-circular-track","ContestSlug":"weekly-contest-203","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 203","ContestID_zh":"第 203 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1443.0697629277,"ID":763,"Title":"Partition Labels","TitleZH":"划分字母区间","TitleSlug":"partition-labels","ContestSlug":"weekly-contest-67","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 67","ContestID_zh":"第 67 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1442.9468304752,"ID":836,"Title":"Rectangle Overlap","TitleZH":"矩形重叠","TitleSlug":"rectangle-overlap","ContestSlug":"weekly-contest-85","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 85","ContestID_zh":"第 85 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Geometry","slug":"geometry"}]},{"Rating":1441.4290319373,"ID":1094,"Title":"Car Pooling","TitleZH":"拼车","TitleSlug":"car-pooling","ContestSlug":"weekly-contest-142","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 142","ContestID_zh":"第 142 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Simulation","slug":"simulation"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1439.5656079032,"ID":1261,"Title":"Find Elements in a Contaminated Binary Tree","TitleZH":"在受污染的二叉树中查找元素","TitleSlug":"find-elements-in-a-contaminated-binary-tree","ContestSlug":"weekly-contest-163","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 163","ContestID_zh":"第 163 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Design","slug":"design"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1438.8988489545,"ID":1375,"Title":"Bulb Switcher III","TitleZH":"灯泡开关 III","TitleSlug":"number-of-times-binary-string-is-prefix-aligned","ContestSlug":"weekly-contest-179","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 179","ContestID_zh":"第 179 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1438.223135905,"ID":1609,"Title":"Even Odd Tree","TitleZH":"奇偶树","TitleSlug":"even-odd-tree","ContestSlug":"weekly-contest-209","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 209","ContestID_zh":"第 209 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1436.5343999134,"ID":845,"Title":"Longest Mountain in Array","TitleZH":"数组中的最长山脉","TitleSlug":"longest-mountain-in-array","ContestSlug":"weekly-contest-87","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 87","ContestID_zh":"第 87 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1436.3892315914,"ID":1701,"Title":"Average Waiting Time","TitleZH":"平均等待时间","TitleSlug":"average-waiting-time","ContestSlug":"biweekly-contest-42","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 42","ContestID_zh":"第 42 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1436.1125054038,"ID":1433,"Title":"Check If a String Can Break Another String","TitleZH":"检查一个字符串是否可以打破另一个字符串","TitleSlug":"check-if-a-string-can-break-another-string","ContestSlug":"biweekly-contest-25","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 25","ContestID_zh":"第 25 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1435.9559888935,"ID":2001,"Title":"Number of Pairs of Interchangeable Rectangles","TitleZH":"可互换矩形的组数","TitleSlug":"number-of-pairs-of-interchangeable-rectangles","ContestSlug":"weekly-contest-258","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 258","ContestID_zh":"第 258 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Math","slug":"math"},{"name":"Counting","slug":"counting"},{"name":"Number Theory","slug":"number-theory"}]},{"Rating":1435.3564963722,"ID":1025,"Title":"Divisor Game","TitleZH":"除数博弈","TitleSlug":"divisor-game","ContestSlug":"weekly-contest-132","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 132","ContestID_zh":"第 132 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Brainteaser","slug":"brainteaser"},{"name":"Game Theory","slug":"game-theory"}]},{"Rating":1433.0795554833,"ID":1535,"Title":"Find the Winner of an Array Game","TitleZH":"找出数组游戏的赢家","TitleSlug":"find-the-winner-of-an-array-game","ContestSlug":"weekly-contest-200","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 200","ContestID_zh":"第 200 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1432.9593207076,"ID":967,"Title":"Numbers With Same Consecutive Differences","TitleZH":"连续差相同的数字","TitleSlug":"numbers-with-same-consecutive-differences","ContestSlug":"weekly-contest-117","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 117","ContestID_zh":"第 117 场周赛","topicTags":[{"name":"Backtracking","slug":"backtracking"},{"name":"Breadth-First Search","slug":"breadth-first-search"}]},{"Rating":1432.9051050881,"ID":994,"Title":"Rotting Oranges","TitleZH":"腐烂的橘子","TitleSlug":"rotting-oranges","ContestSlug":"weekly-contest-124","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 124","ContestID_zh":"第 124 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1432.0967926378,"ID":1785,"Title":"Minimum Elements to Add to Form a Given Sum","TitleZH":"构成特定和需要添加的最少元素","TitleSlug":"minimum-elements-to-add-to-form-a-given-sum","ContestSlug":"weekly-contest-231","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 231","ContestID_zh":"第 231 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1431.6864980883,"ID":1170,"Title":"Compare Strings by Frequency of the Smallest Character","TitleZH":"比较字符串最小字母出现频次","TitleSlug":"compare-strings-by-frequency-of-the-smallest-character","ContestSlug":"weekly-contest-151","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 151","ContestID_zh":"第 151 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1431.0523656241,"ID":2415,"Title":"Reverse Odd Levels of Binary Tree","TitleZH":"反转二叉树的奇数层","TitleSlug":"reverse-odd-levels-of-binary-tree","ContestSlug":"weekly-contest-311","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 311","ContestID_zh":"第 311 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1430.3429533629,"ID":1636,"Title":"Sort Array by Increasing Frequency","TitleZH":"按照频率将数组升序排序","TitleSlug":"sort-array-by-increasing-frequency","ContestSlug":"biweekly-contest-38","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 38","ContestID_zh":"第 38 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1429.6349292399,"ID":1357,"Title":"Apply Discount Every n Orders","TitleZH":"每隔 n 个顾客打折","TitleSlug":"apply-discount-every-n-orders","ContestSlug":"biweekly-contest-20","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 20","ContestID_zh":"第 20 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Design","slug":"design"}]},{"Rating":1429.1878389249,"ID":988,"Title":"Smallest String Starting From Leaf","TitleZH":"从叶结点开始的最小字符串","TitleSlug":"smallest-string-starting-from-leaf","ContestSlug":"weekly-contest-122","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 122","ContestID_zh":"第 122 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1428.712905903,"ID":817,"Title":"Linked List Components","TitleZH":"链表组件","TitleSlug":"linked-list-components","ContestSlug":"weekly-contest-80","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 80","ContestID_zh":"第 80 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Linked List","slug":"linked-list"}]},{"Rating":1428.6729861424,"ID":1845,"Title":"Seat Reservation Manager","TitleZH":"座位预约管理系统","TitleSlug":"seat-reservation-manager","ContestSlug":"biweekly-contest-51","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 51","ContestID_zh":"第 51 场双周赛","topicTags":[{"name":"Design","slug":"design"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1428.1443796872,"ID":1669,"Title":"Merge In Between Linked Lists","TitleZH":"合并两个链表","TitleSlug":"merge-in-between-linked-lists","ContestSlug":"biweekly-contest-40","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 40","ContestID_zh":"第 40 场双周赛","topicTags":[{"name":"Linked List","slug":"linked-list"}]},{"Rating":1427.7906804882,"ID":1887,"Title":"Reduction Operations to Make the Array Elements Equal","TitleZH":"使数组元素相等的减少操作次数","TitleSlug":"reduction-operations-to-make-the-array-elements-equal","ContestSlug":"weekly-contest-244","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 244","ContestID_zh":"第 244 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1426.9800910361,"ID":2437,"Title":"Number of Valid Clock Times","TitleZH":"有效时间的数目","TitleSlug":"number-of-valid-clock-times","ContestSlug":"biweekly-contest-89","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 89","ContestID_zh":"第 89 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1426.948379305,"ID":1315,"Title":"Sum of Nodes with Even-Valued Grandparent","TitleZH":"祖父节点值为偶数的节点和","TitleSlug":"sum-of-nodes-with-even-valued-grandparent","ContestSlug":"biweekly-contest-17","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 17","ContestID_zh":"第 17 场双周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1426.7384112327,"ID":1432,"Title":"Max Difference You Can Get From Changing an Integer","TitleZH":"改变一个整数能得到的最大差值","TitleSlug":"max-difference-you-can-get-from-changing-an-integer","ContestSlug":"biweekly-contest-25","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 25","ContestID_zh":"第 25 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1426.7144554733,"ID":1003,"Title":"Check If Word Is Valid After Substitutions","TitleZH":"检查替换后的词是否有效","TitleSlug":"check-if-word-is-valid-after-substitutions","ContestSlug":"weekly-contest-126","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 126","ContestID_zh":"第 126 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"}]},{"Rating":1425.9672522649,"ID":840,"Title":"Magic Squares In Grid","TitleZH":"矩阵中的幻方","TitleSlug":"magic-squares-in-grid","ContestSlug":"weekly-contest-86","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 86","ContestID_zh":"第 86 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1425.3981616639,"ID":883,"Title":"Projection Area of 3D Shapes","TitleZH":"三维形体投影面积","TitleSlug":"projection-area-of-3d-shapes","ContestSlug":"weekly-contest-96","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 96","ContestID_zh":"第 96 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Geometry","slug":"geometry"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1423.5501543781,"ID":791,"Title":"Custom Sort String","TitleZH":"自定义字符串排序","TitleSlug":"custom-sort-string","ContestSlug":"weekly-contest-73","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 73","ContestID_zh":"第 73 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1423.1058649921,"ID":1333,"Title":"Filter Restaurants by Vegan-Friendly, Price and Distance","TitleZH":"餐厅过滤器","TitleSlug":"filter-restaurants-by-vegan-friendly-price-and-distance","ContestSlug":"weekly-contest-173","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 173","ContestID_zh":"第 173 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1423.0355763093,"ID":1493,"Title":"Longest Subarray of 1's After Deleting One Element","TitleZH":"删掉一个元素以后全为 1 的最长子数组","TitleSlug":"longest-subarray-of-1s-after-deleting-one-element","ContestSlug":"biweekly-contest-29","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 29","ContestID_zh":"第 29 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1421.9944676861,"ID":1630,"Title":"Arithmetic Subarrays","TitleZH":"等差子数组","TitleSlug":"arithmetic-subarrays","ContestSlug":"weekly-contest-212","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 212","ContestID_zh":"第 212 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1421.7251191403,"ID":2326,"Title":"Spiral Matrix IV","TitleZH":"螺旋矩阵 IV","TitleSlug":"spiral-matrix-iv","ContestSlug":"weekly-contest-300","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 300","ContestID_zh":"第 300 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Linked List","slug":"linked-list"},{"name":"Matrix","slug":"matrix"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1421.6541140049,"ID":1360,"Title":"Number of Days Between Two Dates","TitleZH":"日期之间隔几天","TitleSlug":"number-of-days-between-two-dates","ContestSlug":"weekly-contest-177","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 177","ContestID_zh":"第 177 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"}]},{"Rating":1421.2624065513,"ID":1033,"Title":"Moving Stones Until Consecutive","TitleZH":"移动石子直到连续","TitleSlug":"moving-stones-until-consecutive","ContestSlug":"weekly-contest-134","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 134","ContestID_zh":"第 134 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Brainteaser","slug":"brainteaser"}]},{"Rating":1418.9758090724,"ID":2374,"Title":"Node With Highest Edge Score","TitleZH":"边积分最高的节点","TitleSlug":"node-with-highest-edge-score","ContestSlug":"weekly-contest-306","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 306","ContestID_zh":"第 306 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Graph","slug":"graph"}]},{"Rating":1418.8205349928,"ID":1656,"Title":"Design an Ordered Stream","TitleZH":"设计有序流","TitleSlug":"design-an-ordered-stream","ContestSlug":"weekly-contest-215","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 215","ContestID_zh":"第 215 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Design","slug":"design"},{"name":"Data Stream","slug":"data-stream"}]},{"Rating":1418.6847740057,"ID":1962,"Title":"Remove Stones to Minimize the Total","TitleZH":"移除石子使总数最小","TitleSlug":"remove-stones-to-minimize-the-total","ContestSlug":"weekly-contest-253","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 253","ContestID_zh":"第 253 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1418.1401949854,"ID":1052,"Title":"Grumpy Bookstore Owner","TitleZH":"爱生气的书店老板","TitleSlug":"grumpy-bookstore-owner","ContestSlug":"weekly-contest-138","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 138","ContestID_zh":"第 138 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1417.3934930077,"ID":2139,"Title":"Minimum Moves to Reach Target Score","TitleZH":"得到目标值的最少行动次数","TitleSlug":"minimum-moves-to-reach-target-score","ContestSlug":"weekly-contest-276","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 276","ContestID_zh":"第 276 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1416.8961009909,"ID":1652,"Title":"Defuse the Bomb","TitleZH":"拆炸弹","TitleSlug":"defuse-the-bomb","ContestSlug":"biweekly-contest-39","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 39","ContestID_zh":"第 39 场双周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1416.4124723866,"ID":2294,"Title":"Partition Array Such That Maximum Difference Is K","TitleZH":"划分数组使最大差为 K","TitleSlug":"partition-array-such-that-maximum-difference-is-k","ContestSlug":"weekly-contest-296","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 296","ContestID_zh":"第 296 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1414.4918812526,"ID":890,"Title":"Find and Replace Pattern","TitleZH":"查找和替换模式","TitleSlug":"find-and-replace-pattern","ContestSlug":"weekly-contest-98","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 98","ContestID_zh":"第 98 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1414.4351202231,"ID":1985,"Title":"Find the Kth Largest Integer in the Array","TitleZH":"找出数组中的第 K 大整数","TitleSlug":"find-the-kth-largest-integer-in-the-array","ContestSlug":"weekly-contest-256","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 256","ContestID_zh":"第 256 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Divide and Conquer","slug":"divide-and-conquer"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Quickselect","slug":"quickselect"}]},{"Rating":1413.4238697034,"ID":2383,"Title":"Minimum Hours of Training to Win a Competition","TitleZH":"赢得比赛需要的最少训练时长","TitleSlug":"minimum-hours-of-training-to-win-a-competition","ContestSlug":"weekly-contest-307","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 307","ContestID_zh":"第 307 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1413.0376809608,"ID":2521,"Title":"Distinct Prime Factors of Product of Array","TitleZH":"数组乘积中的不同质因数数目","TitleSlug":"distinct-prime-factors-of-product-of-array","ContestSlug":"weekly-contest-326","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 326","ContestID_zh":"第 326 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Math","slug":"math"},{"name":"Number Theory","slug":"number-theory"}]},{"Rating":1412.3053230205,"ID":1823,"Title":"Find the Winner of the Circular Game","TitleZH":"找出游戏的获胜者","TitleSlug":"find-the-winner-of-the-circular-game","ContestSlug":"weekly-contest-236","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 236","ContestID_zh":"第 236 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Recursion","slug":"recursion"},{"name":"Queue","slug":"queue"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1412.2790156634,"ID":841,"Title":"Keys and Rooms","TitleZH":"钥匙和房间","TitleSlug":"keys-and-rooms","ContestSlug":"weekly-contest-86","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 86","ContestID_zh":"第 86 场周赛","topicTags":[{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"}]},{"Rating":1410.5239927267,"ID":1138,"Title":"Alphabet Board Path","TitleZH":"字母板上的路径","TitleSlug":"alphabet-board-path","ContestSlug":"weekly-contest-147","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 147","ContestID_zh":"第 147 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1408.7923640745,"ID":1588,"Title":"Sum of All Odd Length Subarrays","TitleZH":"所有奇数长度子数组的和","TitleSlug":"sum-of-all-odd-length-subarrays","ContestSlug":"biweekly-contest-35","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 35","ContestID_zh":"第 35 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1408.427592417,"ID":2110,"Title":"Number of Smooth Descent Periods of a Stock","TitleZH":"股票平滑下跌阶段的数目","TitleSlug":"number-of-smooth-descent-periods-of-a-stock","ContestSlug":"weekly-contest-272","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 272","ContestID_zh":"第 272 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1407.9870845299,"ID":1006,"Title":"Clumsy Factorial","TitleZH":"笨阶乘","TitleSlug":"clumsy-factorial","ContestSlug":"weekly-contest-127","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 127","ContestID_zh":"第 127 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Stack","slug":"stack"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1407.5442381391,"ID":1217,"Title":"Minimum Cost to Move Chips to The Same Position","TitleZH":"玩筹码","TitleSlug":"minimum-cost-to-move-chips-to-the-same-position","ContestSlug":"weekly-contest-157","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 157","ContestID_zh":"第 157 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1407.1322366299,"ID":1325,"Title":"Delete Leaves With a Given Value","TitleZH":"删除给定值的叶子节点","TitleSlug":"delete-leaves-with-a-given-value","ContestSlug":"weekly-contest-172","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 172","ContestID_zh":"第 172 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1407.0629410799,"ID":1886,"Title":"Determine Whether Matrix Can Be Obtained By Rotation","TitleZH":"判断矩阵经轮转后是否一致","TitleSlug":"determine-whether-matrix-can-be-obtained-by-rotation","ContestSlug":"weekly-contest-244","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 244","ContestID_zh":"第 244 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1406.1279714442,"ID":2451,"Title":"Odd String Difference","TitleZH":"差值数组不同的字符串","TitleSlug":"odd-string-difference","ContestSlug":"biweekly-contest-90","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 90","ContestID_zh":"第 90 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Math","slug":"math"},{"name":"String","slug":"string"}]},{"Rating":1405.5786892723,"ID":1561,"Title":"Maximum Number of Coins You Can Get","TitleZH":"你可以获得的最大硬币数目","TitleSlug":"maximum-number-of-coins-you-can-get","ContestSlug":"weekly-contest-203","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 203","ContestID_zh":"第 203 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"},{"name":"Game Theory","slug":"game-theory"}]},{"Rating":1405.4005354401,"ID":1410,"Title":"HTML Entity Parser","TitleZH":"HTML 实体解析器","TitleSlug":"html-entity-parser","ContestSlug":"weekly-contest-184","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 184","ContestID_zh":"第 184 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1405.0021415178,"ID":1457,"Title":"Pseudo-Palindromic Paths in a Binary Tree","TitleZH":"二叉树中的伪回文路径","TitleSlug":"pseudo-palindromic-paths-in-a-binary-tree","ContestSlug":"weekly-contest-190","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 190","ContestID_zh":"第 190 场周赛","topicTags":[{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1404.7016862187,"ID":1237,"Title":"Find Positive Integer Solution for a Given Equation","TitleZH":"找出给定方程的正整数解","TitleSlug":"find-positive-integer-solution-for-a-given-equation","ContestSlug":"weekly-contest-160","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 160","ContestID_zh":"第 160 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Binary Search","slug":"binary-search"},{"name":"Interactive","slug":"interactive"}]},{"Rating":1404.1839222,"ID":1700,"Title":"Number of Students Unable to Eat Lunch","TitleZH":"无法吃午餐的学生数量","TitleSlug":"number-of-students-unable-to-eat-lunch","ContestSlug":"biweekly-contest-42","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 42","ContestID_zh":"第 42 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Stack","slug":"stack"},{"name":"Queue","slug":"queue"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1402.0863615706,"ID":1508,"Title":"Range Sum of Sorted Subarray Sums","TitleZH":"子数组和排序后的区间和","TitleSlug":"range-sum-of-sorted-subarray-sums","ContestSlug":"biweekly-contest-30","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 30","ContestID_zh":"第 30 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1401.2246983038,"ID":1198,"Title":"Find Smallest Common Element in All Rows","TitleZH":"找出所有行中最小公共元素","TitleSlug":"find-smallest-common-element-in-all-rows","ContestSlug":"biweekly-contest-9","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 9","ContestID_zh":"第 9 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Binary Search","slug":"binary-search"},{"name":"Matrix","slug":"matrix"},{"name":"Counting","slug":"counting"}]},{"Rating":1399.8468905274,"ID":2240,"Title":"Number of Ways to Buy Pens and Pencils","TitleZH":"买钢笔和铅笔的方案数","TitleSlug":"number-of-ways-to-buy-pens-and-pencils","ContestSlug":"biweekly-contest-76","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 76","ContestID_zh":"第 76 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1397.8875115008,"ID":1071,"Title":"Greatest Common Divisor of Strings","TitleZH":"字符串的最大公因子","TitleSlug":"greatest-common-divisor-of-strings","ContestSlug":"weekly-contest-139","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 139","ContestID_zh":"第 139 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"}]},{"Rating":1397.7743198793,"ID":1176,"Title":"Diet Plan Performance","TitleZH":"健身计划评估","TitleSlug":"diet-plan-performance","ContestSlug":"weekly-contest-152","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 152","ContestID_zh":"第 152 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1396.8422030812,"ID":788,"Title":"Rotated Digits","TitleZH":"旋转数字","TitleSlug":"rotated-digits","ContestSlug":"weekly-contest-73","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 73","ContestID_zh":"第 73 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1396.5990609759,"ID":1404,"Title":"Number of Steps to Reduce a Number in Binary Representation to One","TitleZH":"将二进制表示减到 1 的步骤数","TitleSlug":"number-of-steps-to-reduce-a-number-in-binary-representation-to-one","ContestSlug":"weekly-contest-183","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 183","ContestID_zh":"第 183 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":1396.5448074496,"ID":1306,"Title":"Jump Game III","TitleZH":"跳跃游戏 III","TitleSlug":"jump-game-iii","ContestSlug":"weekly-contest-169","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 169","ContestID_zh":"第 169 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"}]},{"Rating":1396.4853538164,"ID":944,"Title":"Delete Columns to Make Sorted","TitleZH":"删列造序","TitleSlug":"delete-columns-to-make-sorted","ContestSlug":"weekly-contest-111","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 111","ContestID_zh":"第 111 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"}]},{"Rating":1395.5132479177,"ID":1668,"Title":"Maximum Repeating Substring","TitleZH":"最大重复子字符串","TitleSlug":"maximum-repeating-substring","ContestSlug":"biweekly-contest-40","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 40","ContestID_zh":"第 40 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"String Matching","slug":"string-matching"}]},{"Rating":1394.9149882274,"ID":2256,"Title":"Minimum Average Difference","TitleZH":"最小平均差","TitleSlug":"minimum-average-difference","ContestSlug":"biweekly-contest-77","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 77","ContestID_zh":"第 77 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1393.4123491817,"ID":978,"Title":"Longest Turbulent Subarray","TitleZH":"最长湍流子数组","TitleSlug":"longest-turbulent-subarray","ContestSlug":"weekly-contest-120","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 120","ContestID_zh":"第 120 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1392.6601629182,"ID":1529,"Title":"Bulb Switcher IV","TitleZH":"灯泡开关 IV","TitleSlug":"minimum-suffix-flips","ContestSlug":"weekly-contest-199","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 199","ContestID_zh":"第 199 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1392.0853311911,"ID":957,"Title":"Prison Cells After N Days","TitleZH":"N 天后的牢房","TitleSlug":"prison-cells-after-n-days","ContestSlug":"weekly-contest-115","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 115","ContestID_zh":"第 115 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Math","slug":"math"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":1391.7243180131,"ID":1222,"Title":"Queens That Can Attack the King","TitleZH":"可以攻击国王的皇后","TitleSlug":"queens-that-can-attack-the-king","ContestSlug":"weekly-contest-158","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 158","ContestID_zh":"第 158 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1390.5023027273,"ID":2155,"Title":"All Divisions With the Highest Score of a Binary Array","TitleZH":"分组得分最高的所有下标","TitleSlug":"all-divisions-with-the-highest-score-of-a-binary-array","ContestSlug":"weekly-contest-278","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 278","ContestID_zh":"第 278 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1389.331169471,"ID":1065,"Title":"Index Pairs of a String","TitleZH":"字符串的索引对","TitleSlug":"index-pairs-of-a-string","ContestSlug":"biweekly-contest-1","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 1","ContestID_zh":"第 1 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Trie","slug":"trie"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1389.0328392117,"ID":1214,"Title":"Two Sum BSTs","TitleZH":"查找两棵二叉搜索树之和","TitleSlug":"two-sum-bsts","ContestSlug":"biweekly-contest-10","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 10","ContestID_zh":"第 10 场双周赛","topicTags":[{"name":"Two Pointers","slug":"two-pointers"},{"name":"Binary Search","slug":"binary-search"},{"name":"Stack","slug":"stack"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Search Tree","slug":"binary-search-tree"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1387.9431104106,"ID":1302,"Title":"Deepest Leaves Sum","TitleZH":"层数最深叶子节点的和","TitleSlug":"deepest-leaves-sum","ContestSlug":"biweekly-contest-16","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 16","ContestID_zh":"第 16 场双周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1387.7347071166,"ID":2389,"Title":"Longest Subsequence With Limited Sum","TitleZH":"和有限的最长子序列","TitleSlug":"longest-subsequence-with-limited-sum","ContestSlug":"weekly-contest-308","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 308","ContestID_zh":"第 308 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1387.3672639293,"ID":937,"Title":"Reorder Data in Log Files","TitleZH":"重新排列日志文件","TitleSlug":"reorder-data-in-log-files","ContestSlug":"weekly-contest-110","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 110","ContestID_zh":"第 110 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1387.2941868867,"ID":1860,"Title":"Incremental Memory Leak","TitleZH":"增长的内存泄露","TitleSlug":"incremental-memory-leak","ContestSlug":"biweekly-contest-52","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 52","ContestID_zh":"第 52 场双周赛","topicTags":[{"name":"Simulation","slug":"simulation"}]},{"Rating":1386.9203620297,"ID":1721,"Title":"Swapping Nodes in a Linked List","TitleZH":"交换链表中的节点","TitleSlug":"swapping-nodes-in-a-linked-list","ContestSlug":"weekly-contest-223","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 223","ContestID_zh":"第 223 场周赛","topicTags":[{"name":"Linked List","slug":"linked-list"},{"name":"Two Pointers","slug":"two-pointers"}]},{"Rating":1386.3256313989,"ID":1276,"Title":"Number of Burgers with No Waste of Ingredients","TitleZH":"不浪费原料的汉堡制作方案","TitleSlug":"number-of-burgers-with-no-waste-of-ingredients","ContestSlug":"weekly-contest-165","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 165","ContestID_zh":"第 165 场周赛","topicTags":[{"name":"Math","slug":"math"}]},{"Rating":1384.4078082338,"ID":1271,"Title":"Hexspeak","TitleZH":"十六进制魔术数字","TitleSlug":"hexspeak","ContestSlug":"biweekly-contest-14","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 14","ContestID_zh":"第 14 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"}]},{"Rating":1384.0226911434,"ID":2091,"Title":"Removing Minimum and Maximum From Array","TitleZH":"从数组中移除最大值和最小值","TitleSlug":"removing-minimum-and-maximum-from-array","ContestSlug":"weekly-contest-269","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 269","ContestID_zh":"第 269 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1383.4424411643,"ID":762,"Title":"Prime Number of Set Bits in Binary Representation","TitleZH":"二进制表示中质数个计算置位","TitleSlug":"prime-number-of-set-bits-in-binary-representation","ContestSlug":"weekly-contest-67","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 67","ContestID_zh":"第 67 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":1382.760607823,"ID":1318,"Title":"Minimum Flips to Make a OR b Equal to c","TitleZH":"或运算的最小翻转次数","TitleSlug":"minimum-flips-to-make-a-or-b-equal-to-c","ContestSlug":"weekly-contest-171","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 171","ContestID_zh":"第 171 场周赛","topicTags":[{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":1382.7178688716,"ID":849,"Title":"Maximize Distance to Closest Person","TitleZH":"到最近的人的最大距离","TitleSlug":"maximize-distance-to-closest-person","ContestSlug":"weekly-contest-88","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 88","ContestID_zh":"第 88 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1382.5129151601,"ID":797,"Title":"All Paths From Source to Target","TitleZH":"所有可能的路径","TitleSlug":"all-paths-from-source-to-target","ContestSlug":"weekly-contest-75","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 75","ContestID_zh":"第 75 场周赛","topicTags":[{"name":"Backtracking","slug":"backtracking"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Graph","slug":"graph"}]},{"Rating":1382.4809893713,"ID":1185,"Title":"Day of the Week","TitleZH":"一周中的第几天","TitleSlug":"day-of-the-week","ContestSlug":"weekly-contest-153","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 153","ContestID_zh":"第 153 场周赛","topicTags":[{"name":"Math","slug":"math"}]},{"Rating":1381.2168789318,"ID":1881,"Title":"Maximum Value after Insertion","TitleZH":"插入后的最大值","TitleSlug":"maximum-value-after-insertion","ContestSlug":"weekly-contest-243","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 243","ContestID_zh":"第 243 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1381.0888968455,"ID":2410,"Title":"Maximum Matching of Players With Trainers","TitleZH":"运动员和训练师的最大匹配数","TitleSlug":"maximum-matching-of-players-with-trainers","ContestSlug":"biweekly-contest-87","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 87","ContestID_zh":"第 87 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1380.1541980647,"ID":814,"Title":"Binary Tree Pruning","TitleZH":"二叉树剪枝","TitleSlug":"binary-tree-pruning","ContestSlug":"weekly-contest-79","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 79","ContestID_zh":"第 79 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1380.0192844155,"ID":1828,"Title":"Queries on Number of Points Inside a Circle","TitleZH":"统计一个圆中点的数目","TitleSlug":"queries-on-number-of-points-inside-a-circle","ContestSlug":"biweekly-contest-50","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 50","ContestID_zh":"第 50 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Geometry","slug":"geometry"}]},{"Rating":1379.8787648129,"ID":2120,"Title":"Execution of All Suffix Instructions Staying in a Grid","TitleZH":"执行所有后缀指令","TitleSlug":"execution-of-all-suffix-instructions-staying-in-a-grid","ContestSlug":"weekly-contest-273","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 273","ContestID_zh":"第 273 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1378.7570411077,"ID":1013,"Title":"Partition Array Into Three Parts With Equal Sum","TitleZH":"将数组分成和相等的三个部分","TitleSlug":"partition-array-into-three-parts-with-equal-sum","ContestSlug":"weekly-contest-129","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 129","ContestID_zh":"第 129 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1377.6120218199,"ID":811,"Title":"Subdomain Visit Count","TitleZH":"子域名访问计数","TitleSlug":"subdomain-visit-count","ContestSlug":"weekly-contest-78","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 78","ContestID_zh":"第 78 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Counting","slug":"counting"}]},{"Rating":1377.1913915125,"ID":1010,"Title":"Pairs of Songs With Total Durations Divisible by 60","TitleZH":"总持续时间可被 60 整除的歌曲","TitleSlug":"pairs-of-songs-with-total-durations-divisible-by-60","ContestSlug":"weekly-contest-128","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 128","ContestID_zh":"第 128 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Counting","slug":"counting"}]},{"Rating":1376.4549624575,"ID":1018,"Title":"Binary Prefix Divisible By 5","TitleZH":"可被 5 整除的二进制前缀","TitleSlug":"binary-prefix-divisible-by-5","ContestSlug":"weekly-contest-130","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 130","ContestID_zh":"第 130 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1376.2600892096,"ID":807,"Title":"Max Increase to Keep City Skyline","TitleZH":"保持城市天际线","TitleSlug":"max-increase-to-keep-city-skyline","ContestSlug":"weekly-contest-77","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 77","ContestID_zh":"第 77 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1376.0047008182,"ID":2443,"Title":"Sum of Number and Its Reverse","TitleZH":"反转之后的数字和","TitleSlug":"sum-of-number-and-its-reverse","ContestSlug":"weekly-contest-315","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 315","ContestID_zh":"第 315 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1375.0376362104,"ID":2336,"Title":"Smallest Number in Infinite Set","TitleZH":"无限集中的最小数字","TitleSlug":"smallest-number-in-infinite-set","ContestSlug":"weekly-contest-301","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 301","ContestID_zh":"第 301 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Design","slug":"design"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1375.0234414965,"ID":1288,"Title":"Remove Covered Intervals","TitleZH":"删除被覆盖区间","TitleSlug":"remove-covered-intervals","ContestSlug":"biweekly-contest-15","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 15","ContestID_zh":"第 15 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1374.6755455786,"ID":1038,"Title":"Binary Search Tree to Greater Sum Tree","TitleZH":"把二叉搜索树转换为累加树","TitleSlug":"binary-search-tree-to-greater-sum-tree","ContestSlug":"weekly-contest-135","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 135","ContestID_zh":"第 135 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Search Tree","slug":"binary-search-tree"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1374.574900311,"ID":1267,"Title":"Count Servers that Communicate","TitleZH":"统计参与通信的服务器","TitleSlug":"count-servers-that-communicate","ContestSlug":"weekly-contest-164","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 164","ContestID_zh":"第 164 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Union Find","slug":"union-find"},{"name":"Matrix","slug":"matrix"},{"name":"Counting","slug":"counting"}]},{"Rating":1374.3549007913,"ID":1619,"Title":"Mean of Array After Removing Some Elements","TitleZH":"删除某些元素后的数组均值","TitleSlug":"mean-of-array-after-removing-some-elements","ContestSlug":"biweekly-contest-37","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 37","ContestID_zh":"第 37 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1373.8113453501,"ID":1291,"Title":"Sequential Digits","TitleZH":"顺次数","TitleSlug":"sequential-digits","ContestSlug":"weekly-contest-167","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 167","ContestID_zh":"第 167 场周赛","topicTags":[{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1372.7398808669,"ID":748,"Title":"Shortest Completing Word","TitleZH":"最短补全词","TitleSlug":"shortest-completing-word","ContestSlug":"weekly-contest-63","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 63","ContestID_zh":"第 63 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1372.5139179378,"ID":2482,"Title":"Difference Between Ones and Zeros in Row and Column","TitleZH":"行和列中一和零的差值","TitleSlug":"difference-between-ones-and-zeros-in-row-and-column","ContestSlug":"biweekly-contest-92","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 92","ContestID_zh":"第 92 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1372.1152262488,"ID":1863,"Title":"Sum of All Subset XOR Totals","TitleZH":"找出所有子集的异或总和再求和","TitleSlug":"sum-of-all-subset-xor-totals","ContestSlug":"weekly-contest-241","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 241","ContestID_zh":"第 241 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Backtracking","slug":"backtracking"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Combinatorics","slug":"combinatorics"}]},{"Rating":1371.8092952004,"ID":2244,"Title":"Minimum Rounds to Complete All Tasks","TitleZH":"完成所有任务需要的最少轮数","TitleSlug":"minimum-rounds-to-complete-all-tasks","ContestSlug":"weekly-contest-289","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 289","ContestID_zh":"第 289 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Greedy","slug":"greedy"},{"name":"Counting","slug":"counting"}]},{"Rating":1370.6144908238,"ID":914,"Title":"X of a Kind in a Deck of Cards","TitleZH":"卡牌分组","TitleSlug":"x-of-a-kind-in-a-deck-of-cards","ContestSlug":"weekly-contest-104","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 104","ContestID_zh":"第 104 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Math","slug":"math"},{"name":"Counting","slug":"counting"},{"name":"Number Theory","slug":"number-theory"}]},{"Rating":1370.4186698287,"ID":1854,"Title":"Maximum Population Year","TitleZH":"人口最多的年份","TitleSlug":"maximum-population-year","ContestSlug":"weekly-contest-240","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 240","ContestID_zh":"第 240 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Counting","slug":"counting"}]},{"Rating":1369.614440152,"ID":1608,"Title":"Special Array With X Elements Greater Than or Equal X","TitleZH":"特殊数组的特征值","TitleSlug":"special-array-with-x-elements-greater-than-or-equal-x","ContestSlug":"weekly-contest-209","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 209","ContestID_zh":"第 209 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1369.0053354603,"ID":1370,"Title":"Increasing Decreasing String","TitleZH":"上升下降字符串","TitleSlug":"increasing-decreasing-string","ContestSlug":"biweekly-contest-21","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 21","ContestID_zh":"第 21 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Counting","slug":"counting"}]},{"Rating":1368.0043517215,"ID":1576,"Title":"Replace All ?'s to Avoid Consecutive Repeating Characters","TitleZH":"替换所有的问号","TitleSlug":"replace-all-s-to-avoid-consecutive-repeating-characters","ContestSlug":"weekly-contest-205","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 205","ContestID_zh":"第 205 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1367.0197235097,"ID":2515,"Title":"Shortest Distance to Target String in a Circular Array","TitleZH":"到目标字符串的最短距离","TitleSlug":"shortest-distance-to-target-string-in-a-circular-array","ContestSlug":"weekly-contest-325","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 325","ContestID_zh":"第 325 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"}]},{"Rating":1366.6789652398,"ID":2433,"Title":"Find The Original Array of Prefix Xor","TitleZH":"找出前缀异或的原始数组","TitleSlug":"find-the-original-array-of-prefix-xor","ContestSlug":"weekly-contest-314","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 314","ContestID_zh":"第 314 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":1365.2269076492,"ID":2231,"Title":"Largest Number After Digit Swaps by Parity","TitleZH":"按奇偶性交换后的最大数字","TitleSlug":"largest-number-after-digit-swaps-by-parity","ContestSlug":"weekly-contest-288","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 288","ContestID_zh":"第 288 场周赛","topicTags":[{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1364.6787168645,"ID":2260,"Title":"Minimum Consecutive Cards to Pick Up","TitleZH":"必须拿起的最小连续卡牌数","TitleSlug":"minimum-consecutive-cards-to-pick-up","ContestSlug":"weekly-contest-291","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 291","ContestID_zh":"第 291 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1364.154859918,"ID":1974,"Title":"Minimum Time to Type Word Using Special Typewriter","TitleZH":"使用特殊打字机键入单词的最少时间","TitleSlug":"minimum-time-to-type-word-using-special-typewriter","ContestSlug":"biweekly-contest-59","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 59","ContestID_zh":"第 59 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1362.7144100401,"ID":2486,"Title":"Append Characters to String to Make Subsequence","TitleZH":"追加字符以获得子序列","TitleSlug":"append-characters-to-string-to-make-subsequence","ContestSlug":"weekly-contest-321","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 321","ContestID_zh":"第 321 场周赛","topicTags":[{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1362.6613797387,"ID":1592,"Title":"Rearrange Spaces Between Words","TitleZH":"重新排列单词间的空格","TitleSlug":"rearrange-spaces-between-words","ContestSlug":"weekly-contest-207","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 207","ContestID_zh":"第 207 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1361.8801013336,"ID":1120,"Title":"Maximum Average Subtree","TitleZH":"子树的最大平均值","TitleSlug":"maximum-average-subtree","ContestSlug":"biweekly-contest-4","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 4","ContestID_zh":"第 4 场双周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1361.6459603518,"ID":1980,"Title":"Find Unique Binary String","TitleZH":"找出不同的二进制字符串","TitleSlug":"find-unique-binary-string","ContestSlug":"weekly-contest-255","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 255","ContestID_zh":"第 255 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Backtracking","slug":"backtracking"}]},{"Rating":1361.5824742947,"ID":2165,"Title":"Smallest Value of the Rearranged Number","TitleZH":"重排数字的最小值","TitleSlug":"smallest-value-of-the-rearranged-number","ContestSlug":"weekly-contest-279","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 279","ContestID_zh":"第 279 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1360.421258727,"ID":2335,"Title":"Minimum Amount of Time to Fill Cups","TitleZH":"装满杯子需要的最短总时长","TitleSlug":"minimum-amount-of-time-to-fill-cups","ContestSlug":"weekly-contest-301","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 301","ContestID_zh":"第 301 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1360.3005775112,"ID":1817,"Title":"Finding the Users Active Minutes","TitleZH":"查找用户活跃分钟数","TitleSlug":"finding-the-users-active-minutes","ContestSlug":"weekly-contest-235","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 235","ContestID_zh":"第 235 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"}]},{"Rating":1360.2184128413,"ID":1448,"Title":"Count Good Nodes in Binary Tree","TitleZH":"统计二叉树中好节点的数目","TitleSlug":"count-good-nodes-in-binary-tree","ContestSlug":"biweekly-contest-26","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 26","ContestID_zh":"第 26 场双周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1360.0511262593,"ID":2379,"Title":"Minimum Recolors to Get K Consecutive Black Blocks","TitleZH":"得到 K 个黑块的最少涂色次数","TitleSlug":"minimum-recolors-to-get-k-consecutive-black-blocks","ContestSlug":"biweekly-contest-85","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 85","ContestID_zh":"第 85 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1358.3561730566,"ID":746,"Title":"Min Cost Climbing Stairs","TitleZH":"使用最小花费爬楼梯","TitleSlug":"min-cost-climbing-stairs","ContestSlug":"weekly-contest-63","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 63","ContestID_zh":"第 63 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"}]},{"Rating":1358.152613403,"ID":2090,"Title":"K Radius Subarray Averages","TitleZH":"半径为 k 的子数组平均值","TitleSlug":"k-radius-subarray-averages","ContestSlug":"weekly-contest-269","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 269","ContestID_zh":"第 269 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1357.6553050616,"ID":1957,"Title":"Delete Characters to Make Fancy String","TitleZH":"删除字符使字符串变好","TitleSlug":"delete-characters-to-make-fancy-string","ContestSlug":"biweekly-contest-58","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 58","ContestID_zh":"第 58 场双周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1356.6925765299,"ID":2037,"Title":"Minimum Number of Moves to Seat Everyone","TitleZH":"使每位学生都有座位的最少移动次数","TitleSlug":"minimum-number-of-moves-to-seat-everyone","ContestSlug":"biweekly-contest-63","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 63","ContestID_zh":"第 63 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1356.1920189231,"ID":2043,"Title":"Simple Bank System","TitleZH":"简易银行系统","TitleSlug":"simple-bank-system","ContestSlug":"weekly-contest-263","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 263","ContestID_zh":"第 263 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Design","slug":"design"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1355.9817184778,"ID":1331,"Title":"Rank Transform of an Array","TitleZH":"数组序号转换","TitleSlug":"rank-transform-of-an-array","ContestSlug":"biweekly-contest-18","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 18","ContestID_zh":"第 18 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1355.5386161215,"ID":1894,"Title":"Find the Student that Will Replace the Chalk","TitleZH":"找到需要补充粉笔的学生编号","TitleSlug":"find-the-student-that-will-replace-the-chalk","ContestSlug":"biweekly-contest-54","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 54","ContestID_zh":"第 54 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Simulation","slug":"simulation"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1355.3956434989,"ID":2405,"Title":"Optimal Partition of String","TitleZH":"子字符串的最优划分","TitleSlug":"optimal-partition-of-string","ContestSlug":"weekly-contest-310","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 310","ContestID_zh":"第 310 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1355.3825442341,"ID":1689,"Title":"Partitioning Into Minimum Number Of Deci-Binary Numbers","TitleZH":"十-二进制数的最少数目","TitleSlug":"partitioning-into-minimum-number-of-deci-binary-numbers","ContestSlug":"weekly-contest-219","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 219","ContestID_zh":"第 219 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1354.5231125217,"ID":2210,"Title":"Count Hills and Valleys in an Array","TitleZH":"统计数组中峰和谷的数量","TitleSlug":"count-hills-and-valleys-in-an-array","ContestSlug":"weekly-contest-285","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 285","ContestID_zh":"第 285 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1354.1247827015,"ID":1244,"Title":"Design A Leaderboard","TitleZH":"力扣排行榜","TitleSlug":"design-a-leaderboard","ContestSlug":"biweekly-contest-12","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 12","ContestID_zh":"第 12 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Design","slug":"design"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1353.629677812,"ID":1758,"Title":"Minimum Changes To Make Alternating Binary String","TitleZH":"生成交替二进制字符串的最少操作数","TitleSlug":"minimum-changes-to-make-alternating-binary-string","ContestSlug":"weekly-contest-228","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 228","ContestID_zh":"第 228 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1352.7250049956,"ID":848,"Title":"Shifting Letters","TitleZH":"字母移位","TitleSlug":"shifting-letters","ContestSlug":"weekly-contest-88","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 88","ContestID_zh":"第 88 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"}]},{"Rating":1352.1791099256,"ID":1995,"Title":"Count Special Quadruplets","TitleZH":"统计特殊四元组","TitleSlug":"count-special-quadruplets","ContestSlug":"weekly-contest-257","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 257","ContestID_zh":"第 257 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1351.4184681108,"ID":1513,"Title":"Number of Substrings With Only 1s","TitleZH":"仅含 1 的子串数","TitleSlug":"number-of-substrings-with-only-1s","ContestSlug":"weekly-contest-197","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 197","ContestID_zh":"第 197 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"}]},{"Rating":1350.6048768377,"ID":2053,"Title":"Kth Distinct String in an Array","TitleZH":"数组中第 K 个独一无二的字符串","TitleSlug":"kth-distinct-string-in-an-array","ContestSlug":"biweekly-contest-64","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 64","ContestID_zh":"第 64 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Counting","slug":"counting"}]},{"Rating":1348.670191438,"ID":1100,"Title":"Find K-Length Substrings With No Repeated Characters","TitleZH":"长度为 K 的无重复字符子串","TitleSlug":"find-k-length-substrings-with-no-repeated-characters","ContestSlug":"biweekly-contest-3","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 3","ContestID_zh":"第 3 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1348.0079390256,"ID":1029,"Title":"Two City Scheduling","TitleZH":"两地调度","TitleSlug":"two-city-scheduling","ContestSlug":"weekly-contest-133","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 133","ContestID_zh":"第 133 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1347.8521638635,"ID":2390,"Title":"Removing Stars From a String","TitleZH":"从字符串中移除星号","TitleSlug":"removing-stars-from-a-string","ContestSlug":"weekly-contest-308","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 308","ContestID_zh":"第 308 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1346.9594471871,"ID":2284,"Title":"Sender With Largest Word Count","TitleZH":"最多单词数的发件人","TitleSlug":"sender-with-largest-word-count","ContestSlug":"biweekly-contest-79","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 79","ContestID_zh":"第 79 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Counting","slug":"counting"}]},{"Rating":1346.3556309143,"ID":2027,"Title":"Minimum Moves to Convert String","TitleZH":"转换字符串的最少操作次数","TitleSlug":"minimum-moves-to-convert-string","ContestSlug":"weekly-contest-261","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 261","ContestID_zh":"第 261 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1345.737168609,"ID":1679,"Title":"Max Number of K-Sum Pairs","TitleZH":"K 和数对的最大数目","TitleSlug":"max-number-of-k-sum-pairs","ContestSlug":"weekly-contest-218","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 218","ContestID_zh":"第 218 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1344.226133202,"ID":1544,"Title":"Make The String Great","TitleZH":"整理字符串","TitleSlug":"make-the-string-great","ContestSlug":"weekly-contest-201","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 201","ContestID_zh":"第 201 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"}]},{"Rating":1343.628913055,"ID":1395,"Title":"Count Number of Teams","TitleZH":"统计作战单位数","TitleSlug":"count-number-of-teams","ContestSlug":"weekly-contest-182","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 182","ContestID_zh":"第 182 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Binary Indexed Tree","slug":"binary-indexed-tree"}]},{"Rating":1341.8397242604,"ID":1796,"Title":"Second Largest Digit in a String","TitleZH":"字符串中第二大的数字","TitleSlug":"second-largest-digit-in-a-string","ContestSlug":"biweekly-contest-48","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 48","ContestID_zh":"第 48 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1341.5076441361,"ID":784,"Title":"Letter Case Permutation","TitleZH":"字母大小写全排列","TitleSlug":"letter-case-permutation","ContestSlug":"weekly-contest-72","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 72","ContestID_zh":"第 72 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Backtracking","slug":"backtracking"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":1341.3713970313,"ID":2023,"Title":"Number of Pairs of Strings With Concatenation Equal to Target","TitleZH":"连接后等于目标字符串的字符串对","TitleSlug":"number-of-pairs-of-strings-with-concatenation-equal-to-target","ContestSlug":"biweekly-contest-62","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 62","ContestID_zh":"第 62 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"}]},{"Rating":1341.2659819842,"ID":859,"Title":"Buddy Strings","TitleZH":"亲密字符串","TitleSlug":"buddy-strings","ContestSlug":"weekly-contest-90","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 90","ContestID_zh":"第 90 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1341.0476642293,"ID":1399,"Title":"Count Largest Group","TitleZH":"统计最大组的数目","TitleSlug":"count-largest-group","ContestSlug":"biweekly-contest-23","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 23","ContestID_zh":"第 23 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Math","slug":"math"}]},{"Rating":1340.5559417151,"ID":976,"Title":"Largest Perimeter Triangle","TitleZH":"三角形的最大周长","TitleSlug":"largest-perimeter-triangle","ContestSlug":"weekly-contest-119","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 119","ContestID_zh":"第 119 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1338.8322315568,"ID":970,"Title":"Powerful Integers","TitleZH":"强整数","TitleSlug":"powerful-integers","ContestSlug":"weekly-contest-118","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 118","ContestID_zh":"第 118 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Math","slug":"math"}]},{"Rating":1337.8472367494,"ID":933,"Title":"Number of Recent Calls","TitleZH":"最近的请求次数","TitleSlug":"number-of-recent-calls","ContestSlug":"weekly-contest-109","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 109","ContestID_zh":"第 109 场周赛","topicTags":[{"name":"Design","slug":"design"},{"name":"Queue","slug":"queue"},{"name":"Data Stream","slug":"data-stream"}]},{"Rating":1337.6115578703,"ID":2161,"Title":"Partition Array According to Given Pivot","TitleZH":"根据给定数字划分数组","TitleSlug":"partition-array-according-to-given-pivot","ContestSlug":"biweekly-contest-71","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 71","ContestID_zh":"第 71 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1337.3722299775,"ID":1260,"Title":"Shift 2D Grid","TitleZH":"二维网格迁移","TitleSlug":"shift-2d-grid","ContestSlug":"weekly-contest-163","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 163","ContestID_zh":"第 163 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1336.9494482313,"ID":1275,"Title":"Find Winner on a Tic Tac Toe Game","TitleZH":"找出井字棋的获胜者","TitleSlug":"find-winner-on-a-tic-tac-toe-game","ContestSlug":"weekly-contest-165","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 165","ContestID_zh":"第 165 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Matrix","slug":"matrix"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1335.4613368501,"ID":2506,"Title":"Count Pairs Of Similar Strings","TitleZH":"统计相似字符串对的数目","TitleSlug":"count-pairs-of-similar-strings","ContestSlug":"weekly-contest-324","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 324","ContestID_zh":"第 324 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1335.0295688697,"ID":938,"Title":"Range Sum of BST","TitleZH":"二叉搜索树的范围和","TitleSlug":"range-sum-of-bst","ContestSlug":"weekly-contest-110","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 110","ContestID_zh":"第 110 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Search Tree","slug":"binary-search-tree"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1334.5718985411,"ID":1409,"Title":"Queries on a Permutation With Key","TitleZH":"查询带键的排列","TitleSlug":"queries-on-a-permutation-with-key","ContestSlug":"weekly-contest-184","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 184","ContestID_zh":"第 184 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Indexed Tree","slug":"binary-indexed-tree"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1334.5708444649,"ID":2126,"Title":"Destroying Asteroids","TitleZH":"摧毁小行星","TitleSlug":"destroying-asteroids","ContestSlug":"weekly-contest-274","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 274","ContestID_zh":"第 274 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1334.0564009231,"ID":888,"Title":"Fair Candy Swap","TitleZH":"公平的糖果棒交换","TitleSlug":"fair-candy-swap","ContestSlug":"weekly-contest-98","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 98","ContestID_zh":"第 98 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1334.0516779626,"ID":2270,"Title":"Number of Ways to Split Array","TitleZH":"分割数组的方案数","TitleSlug":"number-of-ways-to-split-array","ContestSlug":"biweekly-contest-78","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 78","ContestID_zh":"第 78 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1333.3138174157,"ID":1805,"Title":"Number of Different Integers in a String","TitleZH":"字符串中不同整数的数目","TitleSlug":"number-of-different-integers-in-a-string","ContestSlug":"weekly-contest-234","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 234","ContestID_zh":"第 234 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1333.192050397,"ID":2181,"Title":"Merge Nodes in Between Zeros","TitleZH":"合并零之间的节点","TitleSlug":"merge-nodes-in-between-zeros","ContestSlug":"weekly-contest-281","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 281","ContestID_zh":"第 281 场周赛","topicTags":[{"name":"Linked List","slug":"linked-list"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1332.622596763,"ID":1128,"Title":"Number of Equivalent Domino Pairs","TitleZH":"等价多米诺骨牌对的数量","TitleSlug":"number-of-equivalent-domino-pairs","ContestSlug":"weekly-contest-146","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 146","ContestID_zh":"第 146 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Counting","slug":"counting"}]},{"Rating":1332.6187879411,"ID":2274,"Title":"Maximum Consecutive Floors Without Special Floors","TitleZH":"不含特殊楼层的最大连续楼层数","TitleSlug":"maximum-consecutive-floors-without-special-floors","ContestSlug":"weekly-contest-293","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 293","ContestID_zh":"第 293 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1332.4653491345,"ID":1471,"Title":"The k Strongest Values in an Array","TitleZH":"数组中的 k 个最强值","TitleSlug":"the-k-strongest-values-in-an-array","ContestSlug":"weekly-contest-192","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 192","ContestID_zh":"第 192 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1331.5287857686,"ID":2259,"Title":"Remove Digit From Number to Maximize Result","TitleZH":"移除指定数字得到的最大结果","TitleSlug":"remove-digit-from-number-to-maximize-result","ContestSlug":"weekly-contest-291","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 291","ContestID_zh":"第 291 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1331.3935128035,"ID":2373,"Title":"Largest Local Values in a Matrix","TitleZH":"矩阵中的局部最大值","TitleSlug":"largest-local-values-in-a-matrix","ContestSlug":"weekly-contest-306","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 306","ContestID_zh":"第 306 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1330.918577828,"ID":1347,"Title":"Minimum Number of Steps to Make Two Strings Anagram","TitleZH":"制造字母异位词的最小步骤数","TitleSlug":"minimum-number-of-steps-to-make-two-strings-anagram","ContestSlug":"weekly-contest-175","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 175","ContestID_zh":"第 175 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Counting","slug":"counting"}]},{"Rating":1328.7281033317,"ID":1324,"Title":"Print Words Vertically","TitleZH":"竖直打印单词","TitleSlug":"print-words-vertically","ContestSlug":"weekly-contest-172","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 172","ContestID_zh":"第 172 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1328.5499677186,"ID":2396,"Title":"Strictly Palindromic Number","TitleZH":"严格回文的数字","TitleSlug":"strictly-palindromic-number","ContestSlug":"biweekly-contest-86","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 86","ContestID_zh":"第 86 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Brainteaser","slug":"brainteaser"}]},{"Rating":1328.513147726,"ID":1812,"Title":"Determine Color of a Chessboard Square","TitleZH":"判断国际象棋棋盘中一个格子的颜色","TitleSlug":"determine-color-of-a-chessboard-square","ContestSlug":"biweekly-contest-49","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 49","ContestID_zh":"第 49 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"}]},{"Rating":1327.0282989915,"ID":1086,"Title":"High Five","TitleZH":"前五科的均分","TitleSlug":"high-five","ContestSlug":"biweekly-contest-2","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 2","ContestID_zh":"第 2 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1326.4047670018,"ID":1476,"Title":"Subrectangle Queries","TitleZH":"子矩形查询","TitleSlug":"subrectangle-queries","ContestSlug":"biweekly-contest-28","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 28","ContestID_zh":"第 28 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Design","slug":"design"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1325.3607218257,"ID":2073,"Title":"Time Needed to Buy Tickets","TitleZH":"买票需要的时间","TitleSlug":"time-needed-to-buy-tickets","ContestSlug":"weekly-contest-267","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 267","ContestID_zh":"第 267 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Queue","slug":"queue"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1324.5696223867,"ID":1344,"Title":"Angle Between Hands of a Clock","TitleZH":"时钟指针的夹角","TitleSlug":"angle-between-hands-of-a-clock","ContestSlug":"biweekly-contest-19","ProblemIndex":"Q3","ContestID_en":"Biweekly Contest 19","ContestID_zh":"第 19 场双周赛","topicTags":[{"name":"Math","slug":"math"}]},{"Rating":1324.5320836804,"ID":1752,"Title":"Check if Array Is Sorted and Rotated","TitleZH":"检查数组是否经排序和轮转得到","TitleSlug":"check-if-array-is-sorted-and-rotated","ContestSlug":"weekly-contest-227","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 227","ContestID_zh":"第 227 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1324.3520304377,"ID":2095,"Title":"Delete the Middle Node of a Linked List","TitleZH":"删除链表的中间节点","TitleSlug":"delete-the-middle-node-of-a-linked-list","ContestSlug":"weekly-contest-270","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 270","ContestID_zh":"第 270 场周赛","topicTags":[{"name":"Linked List","slug":"linked-list"},{"name":"Two Pointers","slug":"two-pointers"}]},{"Rating":1324.1757200103,"ID":1603,"Title":"Design Parking System","TitleZH":"设计停车系统","TitleSlug":"design-parking-system","ContestSlug":"biweekly-contest-36","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 36","ContestID_zh":"第 36 场双周赛","topicTags":[{"name":"Design","slug":"design"},{"name":"Simulation","slug":"simulation"},{"name":"Counting","slug":"counting"}]},{"Rating":1323.8236471852,"ID":1925,"Title":"Count Square Sum Triples","TitleZH":"统计平方和三元组的数目","TitleSlug":"count-square-sum-triples","ContestSlug":"biweekly-contest-56","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 56","ContestID_zh":"第 56 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1323.1893756783,"ID":2491,"Title":"Divide Players Into Teams of Equal Skill","TitleZH":"划分技能点相等的团队","TitleSlug":"divide-players-into-teams-of-equal-skill","ContestSlug":"weekly-contest-322","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 322","ContestID_zh":"第 322 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1322.8302750313,"ID":1614,"Title":"Maximum Nesting Depth of the Parentheses","TitleZH":"括号的最大嵌套深度","TitleSlug":"maximum-nesting-depth-of-the-parentheses","ContestSlug":"weekly-contest-210","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 210","ContestID_zh":"第 210 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"}]},{"Rating":1322.5926536743,"ID":1936,"Title":"Add Minimum Number of Rungs","TitleZH":"新增的最少台阶数","TitleSlug":"add-minimum-number-of-rungs","ContestSlug":"weekly-contest-250","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 250","ContestID_zh":"第 250 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1322.3886921778,"ID":2446,"Title":"Determine if Two Events Have Conflict","TitleZH":"判断两个事件是否存在冲突","TitleSlug":"determine-if-two-events-have-conflict","ContestSlug":"weekly-contest-316","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 316","ContestID_zh":"第 316 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"}]},{"Rating":1321.9346201204,"ID":1694,"Title":"Reformat Phone Number","TitleZH":"重新格式化电话号码","TitleSlug":"reformat-phone-number","ContestSlug":"weekly-contest-220","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 220","ContestID_zh":"第 220 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1321.2748903388,"ID":1582,"Title":"Special Positions in a Binary Matrix","TitleZH":"二进制矩阵中的特殊位置","TitleSlug":"special-positions-in-a-binary-matrix","ContestSlug":"weekly-contest-206","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 206","ContestID_zh":"第 206 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1320.6485731562,"ID":2079,"Title":"Watering Plants","TitleZH":"给植物浇水","TitleSlug":"watering-plants","ContestSlug":"weekly-contest-268","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 268","ContestID_zh":"第 268 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1317.9521104466,"ID":999,"Title":"Available Captures for Rook","TitleZH":"可以被一步捕获的棋子数","TitleSlug":"available-captures-for-rook","ContestSlug":"weekly-contest-125","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 125","ContestID_zh":"第 125 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1317.9207508583,"ID":2130,"Title":"Maximum Twin Sum of a Linked List","TitleZH":"链表最大孪生和","TitleSlug":"maximum-twin-sum-of-a-linked-list","ContestSlug":"biweekly-contest-69","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 69","ContestID_zh":"第 69 场双周赛","topicTags":[{"name":"Linked List","slug":"linked-list"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Stack","slug":"stack"}]},{"Rating":1317.4638832497,"ID":1313,"Title":"Decompress Run-Length Encoded List","TitleZH":"解压缩编码列表","TitleSlug":"decompress-run-length-encoded-list","ContestSlug":"biweekly-contest-17","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 17","ContestID_zh":"第 17 场双周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1317.2976846981,"ID":2221,"Title":"Find Triangular Sum of an Array","TitleZH":"数组的三角和","TitleSlug":"find-triangular-sum-of-an-array","ContestSlug":"biweekly-contest-75","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 75","ContestID_zh":"第 75 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Simulation","slug":"simulation"},{"name":"Combinatorics","slug":"combinatorics"}]},{"Rating":1317.1729927899,"ID":1343,"Title":"Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold","TitleZH":"大小为 K 且平均值大于等于阈值的子数组数目","TitleSlug":"number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold","ContestSlug":"biweekly-contest-19","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 19","ContestID_zh":"第 19 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1316.2046992429,"ID":2225,"Title":"Find Players With Zero or One Losses","TitleZH":"找出输掉零场或一场比赛的玩家","TitleSlug":"find-players-with-zero-or-one-losses","ContestSlug":"weekly-contest-287","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 287","ContestID_zh":"第 287 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Sorting","slug":"sorting"},{"name":"Counting","slug":"counting"}]},{"Rating":1315.8569286597,"ID":2348,"Title":"Number of Zero-Filled Subarrays","TitleZH":"全 0 子数组的数目","TitleSlug":"number-of-zero-filled-subarrays","ContestSlug":"biweekly-contest-83","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 83","ContestID_zh":"第 83 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"}]},{"Rating":1315.4085759361,"ID":1180,"Title":"Count Substrings with Only One Distinct Letter","TitleZH":"统计只含单一字母的子串","TitleSlug":"count-substrings-with-only-one-distinct-letter","ContestSlug":"biweekly-contest-8","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 8","ContestID_zh":"第 8 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"}]},{"Rating":1315.3715333947,"ID":1629,"Title":"Slowest Key","TitleZH":"按键持续时间最长的键","TitleSlug":"slowest-key","ContestSlug":"weekly-contest-212","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 212","ContestID_zh":"第 212 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"}]},{"Rating":1315.1890809249,"ID":2109,"Title":"Adding Spaces to a String","TitleZH":"向字符串添加空格","TitleSlug":"adding-spaces-to-a-string","ContestSlug":"weekly-contest-272","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 272","ContestID_zh":"第 272 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1314.8600143277,"ID":1827,"Title":"Minimum Operations to Make the Array Increasing","TitleZH":"最少操作使数组递增","TitleSlug":"minimum-operations-to-make-the-array-increasing","ContestSlug":"biweekly-contest-50","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 50","ContestID_zh":"第 50 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1314.2912238536,"ID":2160,"Title":"Minimum Sum of Four Digit Number After Splitting Digits","TitleZH":"拆分数位后四位数字的最小和","TitleSlug":"minimum-sum-of-four-digit-number-after-splitting-digits","ContestSlug":"biweekly-contest-71","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 71","ContestID_zh":"第 71 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1311.3495317884,"ID":1021,"Title":"Remove Outermost Parentheses","TitleZH":"删除最外层的括号","TitleSlug":"remove-outermost-parentheses","ContestSlug":"weekly-contest-131","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 131","ContestID_zh":"第 131 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"}]},{"Rating":1310.9129840277,"ID":2058,"Title":"Find the Minimum and Maximum Number of Nodes Between Critical Points","TitleZH":"找出临界点之间的最小和最大距离","TitleSlug":"find-the-minimum-and-maximum-number-of-nodes-between-critical-points","ContestSlug":"weekly-contest-265","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 265","ContestID_zh":"第 265 场周赛","topicTags":[{"name":"Linked List","slug":"linked-list"}]},{"Rating":1309.8100518373,"ID":1710,"Title":"Maximum Units on a Truck","TitleZH":"卡车上的最大单元数","TitleSlug":"maximum-units-on-a-truck","ContestSlug":"weekly-contest-222","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 222","ContestID_zh":"第 222 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1309.7266159448,"ID":2500,"Title":"Delete Greatest Value in Each Row","TitleZH":"删除每行中的最大值","TitleSlug":"delete-greatest-value-in-each-row","ContestSlug":"weekly-contest-323","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 323","ContestID_zh":"第 323 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1309.3113721825,"ID":1451,"Title":"Rearrange Words in a Sentence","TitleZH":"重新排列句子中的单词","TitleSlug":"rearrange-words-in-a-sentence","ContestSlug":"weekly-contest-189","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 189","ContestID_zh":"第 189 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1309.1422268153,"ID":1897,"Title":"Redistribute Characters to Make All Strings Equal","TitleZH":"重新分配字符使所有字符串都相等","TitleSlug":"redistribute-characters-to-make-all-strings-equal","ContestSlug":"weekly-contest-245","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 245","ContestID_zh":"第 245 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Counting","slug":"counting"}]},{"Rating":1308.9617729374,"ID":2342,"Title":"Max Sum of a Pair With Equal Sum of Digits","TitleZH":"数位和相等数对的最大和","TitleSlug":"max-sum-of-a-pair-with-equal-sum-of-digits","ContestSlug":"weekly-contest-302","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 302","ContestID_zh":"第 302 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1308.948547975,"ID":2264,"Title":"Largest 3-Same-Digit Number in String","TitleZH":"字符串中最大的 3 位相同数字","TitleSlug":"largest-3-same-digit-number-in-string","ContestSlug":"weekly-contest-292","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 292","ContestID_zh":"第 292 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1307.9800903088,"ID":1064,"Title":"Fixed Point","TitleZH":"不动点","TitleSlug":"fixed-point","ContestSlug":"biweekly-contest-1","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 1","ContestID_zh":"第 1 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":1307.5663523368,"ID":804,"Title":"Unique Morse Code Words","TitleZH":"唯一摩尔斯密码词","TitleSlug":"unique-morse-code-words","ContestSlug":"weekly-contest-77","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 77","ContestID_zh":"第 77 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1307.4608905199,"ID":2085,"Title":"Count Common Words With One Occurrence","TitleZH":"统计出现过一次的公共字符串","TitleSlug":"count-common-words-with-one-occurrence","ContestSlug":"biweekly-contest-66","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 66","ContestID_zh":"第 66 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Counting","slug":"counting"}]},{"Rating":1307.3797385769,"ID":1893,"Title":"Check if All the Integers in a Range Are Covered","TitleZH":"检查是否区域内所有整数都被覆盖","TitleSlug":"check-if-all-the-integers-in-a-range-are-covered","ContestSlug":"biweekly-contest-54","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 54","ContestID_zh":"第 54 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1307.3265298181,"ID":2022,"Title":"Convert 1D Array Into 2D Array","TitleZH":"将一维数组转变成二维数组","TitleSlug":"convert-1d-array-into-2d-array","ContestSlug":"biweekly-contest-62","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 62","ContestID_zh":"第 62 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1307.2991245272,"ID":868,"Title":"Binary Gap","TitleZH":"二进制间距","TitleSlug":"binary-gap","ContestSlug":"weekly-contest-93","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 93","ContestID_zh":"第 93 场周赛","topicTags":[{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":1306.2821637677,"ID":1984,"Title":"Minimum Difference Between Highest and Lowest of K Scores","TitleZH":"学生分数的最小差值","TitleSlug":"minimum-difference-between-highest-and-lowest-of-k-scores","ContestSlug":"weekly-contest-256","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 256","ContestID_zh":"第 256 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1303.5594588137,"ID":2331,"Title":"Evaluate Boolean Binary Tree","TitleZH":"计算布尔二叉树的值","TitleSlug":"evaluate-boolean-binary-tree","ContestSlug":"biweekly-contest-82","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 82","ContestID_zh":"第 82 场双周赛","topicTags":[{"name":"Binary Search","slug":"binary-search"},{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"}]},{"Rating":1303.3201984827,"ID":783,"Title":"Minimum Distance Between BST Nodes","TitleZH":"二叉搜索树节点最小距离","TitleSlug":"minimum-distance-between-bst-nodes","ContestSlug":"weekly-contest-71","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 71","ContestID_zh":"第 71 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Binary Search Tree","slug":"binary-search-tree"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1303.022570497,"ID":1338,"Title":"Reduce Array Size to The Half","TitleZH":"数组大小减半","TitleSlug":"reduce-array-size-to-the-half","ContestSlug":"weekly-contest-174","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 174","ContestID_zh":"第 174 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1303.0179795942,"ID":1051,"Title":"Height Checker","TitleZH":"高度检查器","TitleSlug":"height-checker","ContestSlug":"weekly-contest-138","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 138","ContestID_zh":"第 138 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"},{"name":"Counting Sort","slug":"counting-sort"}]},{"Rating":1302.7005460171,"ID":1266,"Title":"Minimum Time Visiting All Points","TitleZH":"访问所有点的最小时间","TitleSlug":"minimum-time-visiting-all-points","ContestSlug":"weekly-contest-164","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 164","ContestID_zh":"第 164 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Geometry","slug":"geometry"}]},{"Rating":1302.6469071738,"ID":1991,"Title":"Find the Middle Index in Array","TitleZH":"找到数组的中间位置","TitleSlug":"find-the-middle-index-in-array","ContestSlug":"biweekly-contest-60","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 60","ContestID_zh":"第 60 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1301.9432665133,"ID":2243,"Title":"Calculate Digit Sum of a String","TitleZH":"计算字符串的数字和","TitleSlug":"calculate-digit-sum-of-a-string","ContestSlug":"weekly-contest-289","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 289","ContestID_zh":"第 289 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1301.4117757184,"ID":806,"Title":"Number of Lines To Write String","TitleZH":"写字符串需要的行数","TitleSlug":"number-of-lines-to-write-string","ContestSlug":"weekly-contest-77","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 77","ContestID_zh":"第 77 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"}]},{"Rating":1301.4027057843,"ID":1646,"Title":"Get Maximum in Generated Array","TitleZH":"获取生成数组中的最大值","TitleSlug":"get-maximum-in-generated-array","ContestSlug":"weekly-contest-214","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 214","ContestID_zh":"第 214 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1301.381757401,"ID":1877,"Title":"Minimize Maximum Pair Sum in Array","TitleZH":"数组中最大数对和的最小值","TitleSlug":"minimize-maximum-pair-sum-in-array","ContestSlug":"biweekly-contest-53","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 53","ContestID_zh":"第 53 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1300.9041426403,"ID":1844,"Title":"Replace All Digits with Characters","TitleZH":"将所有数字用字符替换","TitleSlug":"replace-all-digits-with-characters","ContestSlug":"biweekly-contest-51","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 51","ContestID_zh":"第 51 场双周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1300.8009461582,"ID":1790,"Title":"Check if One String Swap Can Make Strings Equal","TitleZH":"仅执行一次字符串交换能否使两个字符串相等","TitleSlug":"check-if-one-string-swap-can-make-strings-equal","ContestSlug":"weekly-contest-232","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 232","ContestID_zh":"第 232 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Counting","slug":"counting"}]},{"Rating":1299.8393735643,"ID":2287,"Title":"Rearrange Characters to Make Target String","TitleZH":"重排字符形成目标字符串","TitleSlug":"rearrange-characters-to-make-target-string","ContestSlug":"weekly-contest-295","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 295","ContestID_zh":"第 295 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Counting","slug":"counting"}]},{"Rating":1299.6035132992,"ID":953,"Title":"Verifying an Alien Dictionary","TitleZH":"验证外星语词典","TitleSlug":"verifying-an-alien-dictionary","ContestSlug":"weekly-contest-114","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 114","ContestID_zh":"第 114 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1298.5921473119,"ID":908,"Title":"Smallest Range I","TitleZH":"最小差值 I","TitleSlug":"smallest-range-i","ContestSlug":"weekly-contest-103","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 103","ContestID_zh":"第 103 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"}]},{"Rating":1297.5338328524,"ID":819,"Title":"Most Common Word","TitleZH":"最常见的单词","TitleSlug":"most-common-word","ContestSlug":"weekly-contest-80","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 80","ContestID_zh":"第 80 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Counting","slug":"counting"}]},{"Rating":1297.3006230632,"ID":1598,"Title":"Crawler Log Folder","TitleZH":"文件夹操作日志搜集器","TitleSlug":"crawler-log-folder","ContestSlug":"weekly-contest-208","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 208","ContestID_zh":"第 208 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"}]},{"Rating":1295.8868965907,"ID":2224,"Title":"Minimum Number of Operations to Convert Time","TitleZH":"转化时间需要的最少操作数","TitleSlug":"minimum-number-of-operations-to-convert-time","ContestSlug":"weekly-contest-287","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 287","ContestID_zh":"第 287 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1295.4970938463,"ID":1539,"Title":"Kth Missing Positive Number","TitleZH":"第 k 个缺失的正整数","TitleSlug":"kth-missing-positive-number","ContestSlug":"biweekly-contest-32","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 32","ContestID_zh":"第 32 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":1294.7724244077,"ID":1769,"Title":"Minimum Number of Operations to Move All Balls to Each Box","TitleZH":"移动所有球到每个盒子所需的最小操作数","TitleSlug":"minimum-number-of-operations-to-move-all-balls-to-each-box","ContestSlug":"weekly-contest-229","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 229","ContestID_zh":"第 229 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"}]},{"Rating":1294.5800368625,"ID":2273,"Title":"Find Resultant Array After Removing Anagrams","TitleZH":"移除字母异位词后的结果数组","TitleSlug":"find-resultant-array-after-removing-anagrams","ContestSlug":"weekly-contest-293","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 293","ContestID_zh":"第 293 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1294.5297034757,"ID":1716,"Title":"Calculate Money in Leetcode Bank","TitleZH":"计算力扣银行的钱","TitleSlug":"calculate-money-in-leetcode-bank","ContestSlug":"biweekly-contest-43","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 43","ContestID_zh":"第 43 场双周赛","topicTags":[{"name":"Math","slug":"math"}]},{"Rating":1293.4904281819,"ID":1551,"Title":"Minimum Operations to Make Array Equal","TitleZH":"使数组中所有元素相等的最小操作数","TitleSlug":"minimum-operations-to-make-array-equal","ContestSlug":"weekly-contest-202","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 202","ContestID_zh":"第 202 场周赛","topicTags":[{"name":"Math","slug":"math"}]},{"Rating":1292.8993325204,"ID":2496,"Title":"Maximum Value of a String in an Array","TitleZH":"数组中字符串的最大值","TitleSlug":"maximum-value-of-a-string-in-an-array","ContestSlug":"biweekly-contest-93","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 93","ContestID_zh":"第 93 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"}]},{"Rating":1290.0361853035,"ID":1859,"Title":"Sorting the Sentence","TitleZH":"将句子排序","TitleSlug":"sorting-the-sentence","ContestSlug":"biweekly-contest-52","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 52","ContestID_zh":"第 52 场双周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1289.945159062,"ID":2428,"Title":"Maximum Sum of an Hourglass","TitleZH":"沙漏的最大总和","TitleSlug":"maximum-sum-of-an-hourglass","ContestSlug":"weekly-contest-313","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 313","ContestID_zh":"第 313 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1289.1912178611,"ID":2190,"Title":"Most Frequent Number Following Key In an Array","TitleZH":"数组中紧跟 key 之后出现最频繁的数字","TitleSlug":"most-frequent-number-following-key-in-an-array","ContestSlug":"biweekly-contest-73","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 73","ContestID_zh":"第 73 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Counting","slug":"counting"}]},{"Rating":1288.5621697906,"ID":1684,"Title":"Count the Number of Consistent Strings","TitleZH":"统计一致字符串的数目","TitleSlug":"count-the-number-of-consistent-strings","ContestSlug":"biweekly-contest-41","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 41","ContestID_zh":"第 41 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":1288.1970048184,"ID":1403,"Title":"Minimum Subsequence in Non-Increasing Order","TitleZH":"非递增顺序的最小子序列","TitleSlug":"minimum-subsequence-in-non-increasing-order","ContestSlug":"weekly-contest-183","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 183","ContestID_zh":"第 183 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1287.9002757199,"ID":993,"Title":"Cousins in Binary Tree","TitleZH":"二叉树的堂兄弟节点","TitleSlug":"cousins-in-binary-tree","ContestSlug":"weekly-contest-124","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 124","ContestID_zh":"第 124 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1287.8970301681,"ID":872,"Title":"Leaf-Similar Trees","TitleZH":"叶子相似的树","TitleSlug":"leaf-similar-trees","ContestSlug":"weekly-contest-94","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 94","ContestID_zh":"第 94 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1287.1053917452,"ID":1103,"Title":"Distribute Candies to People","TitleZH":"分糖果 II","TitleSlug":"distribute-candies-to-people","ContestSlug":"weekly-contest-143","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 143","ContestID_zh":"第 143 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1286.7934718934,"ID":1791,"Title":"Find Center of Star Graph","TitleZH":"找出星型图的中心节点","TitleSlug":"find-center-of-star-graph","ContestSlug":"weekly-contest-232","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 232","ContestID_zh":"第 232 场周赛","topicTags":[{"name":"Graph","slug":"graph"}]},{"Rating":1286.3841359213,"ID":2352,"Title":"Equal Row and Column Pairs","TitleZH":"相等行列对","TitleSlug":"equal-row-and-column-pairs","ContestSlug":"weekly-contest-303","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 303","ContestID_zh":"第 303 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Matrix","slug":"matrix"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1286.3167937403,"ID":1047,"Title":"Remove All Adjacent Duplicates In String","TitleZH":"删除字符串中的所有相邻重复项","TitleSlug":"remove-all-adjacent-duplicates-in-string","ContestSlug":"weekly-contest-137","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 137","ContestID_zh":"第 137 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"}]},{"Rating":1285.9726675488,"ID":1381,"Title":"Design a Stack With Increment Operation","TitleZH":"设计一个支持增量操作的栈","TitleSlug":"design-a-stack-with-increment-operation","ContestSlug":"weekly-contest-180","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 180","ContestID_zh":"第 180 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Stack","slug":"stack"},{"name":"Design","slug":"design"}]},{"Rating":1285.7282180721,"ID":860,"Title":"Lemonade Change","TitleZH":"柠檬水找零","TitleSlug":"lemonade-change","ContestSlug":"weekly-contest-91","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 91","ContestID_zh":"第 91 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1284.4514662456,"ID":1720,"Title":"Decode XORed Array","TitleZH":"解码异或后的数组","TitleSlug":"decode-xored-array","ContestSlug":"weekly-contest-223","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 223","ContestID_zh":"第 223 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":1284.3625733813,"ID":1481,"Title":"Least Number of Unique Integers after K Removals","TitleZH":"不同整数的最少数目","TitleSlug":"least-number-of-unique-integers-after-k-removals","ContestSlug":"weekly-contest-193","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 193","ContestID_zh":"第 193 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"},{"name":"Counting","slug":"counting"}]},{"Rating":1283.6412252736,"ID":2303,"Title":"Calculate Amount Paid in Taxes","TitleZH":"计算应缴税款总额","TitleSlug":"calculate-amount-paid-in-taxes","ContestSlug":"weekly-contest-297","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 297","ContestID_zh":"第 297 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1283.51021448,"ID":1507,"Title":"Reformat Date","TitleZH":"转变日期格式","TitleSlug":"reformat-date","ContestSlug":"biweekly-contest-30","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 30","ContestID_zh":"第 30 场双周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1283.4980318021,"ID":1252,"Title":"Cells with Odd Values in a Matrix","TitleZH":"奇数值单元格的数目","TitleSlug":"cells-with-odd-values-in-a-matrix","ContestSlug":"weekly-contest-162","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 162","ContestID_zh":"第 162 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1282.4111853142,"ID":1837,"Title":"Sum of Digits in Base K","TitleZH":"K 进制表示下的各位数字总和","TitleSlug":"sum-of-digits-in-base-k","ContestSlug":"weekly-contest-238","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 238","ContestID_zh":"第 238 场周赛","topicTags":[{"name":"Math","slug":"math"}]},{"Rating":1282.1502428906,"ID":2220,"Title":"Minimum Bit Flips to Convert Number","TitleZH":"转换数字的最少位翻转次数","TitleSlug":"minimum-bit-flips-to-convert-number","ContestSlug":"biweekly-contest-75","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 75","ContestID_zh":"第 75 场双周赛","topicTags":[{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":1281.9771427903,"ID":1624,"Title":"Largest Substring Between Two Equal Characters","TitleZH":"两个相同字符之间的最长子字符串","TitleSlug":"largest-substring-between-two-equal-characters","ContestSlug":"weekly-contest-211","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 211","ContestID_zh":"第 211 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1280.2941647587,"ID":1572,"Title":"Matrix Diagonal Sum","TitleZH":"矩阵对角线元素的和","TitleSlug":"matrix-diagonal-sum","ContestSlug":"biweekly-contest-34","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 34","ContestID_zh":"第 34 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1280.2203734882,"ID":2125,"Title":"Number of Laser Beams in a Bank","TitleZH":"银行中的激光束数量","TitleSlug":"number-of-laser-beams-in-a-bank","ContestSlug":"weekly-contest-274","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 274","ContestID_zh":"第 274 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"String","slug":"string"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1279.7894769956,"ID":2269,"Title":"Find the K-Beauty of a Number","TitleZH":"找到一个数字的 K 美丽值","TitleSlug":"find-the-k-beauty-of-a-number","ContestSlug":"biweekly-contest-78","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 78","ContestID_zh":"第 78 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1279.7669712099,"ID":1002,"Title":"Find Common Characters","TitleZH":"查找常用字符","TitleSlug":"find-common-characters","ContestSlug":"weekly-contest-126","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 126","ContestID_zh":"第 126 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1279.3383966145,"ID":1534,"Title":"Count Good Triplets","TitleZH":"统计好三元组","TitleSlug":"count-good-triplets","ContestSlug":"weekly-contest-200","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 200","ContestID_zh":"第 200 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1277.9987709491,"ID":1742,"Title":"Maximum Number of Balls in a Box","TitleZH":"盒子中小球的最大数量","TitleSlug":"maximum-number-of-balls-in-a-box","ContestSlug":"weekly-contest-226","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 226","ContestID_zh":"第 226 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"Math","slug":"math"},{"name":"Counting","slug":"counting"}]},{"Rating":1277.8260125315,"ID":1317,"Title":"Convert Integer to the Sum of Two No-Zero Integers","TitleZH":"将整数转换为两个无零整数的和","TitleSlug":"convert-integer-to-the-sum-of-two-no-zero-integers","ContestSlug":"weekly-contest-171","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 171","ContestID_zh":"第 171 场周赛","topicTags":[{"name":"Math","slug":"math"}]},{"Rating":1275.6108152653,"ID":2150,"Title":"Find All Lonely Numbers in the Array","TitleZH":"找出数组中的所有孤独数字","TitleSlug":"find-all-lonely-numbers-in-the-array","ContestSlug":"weekly-contest-277","ProblemIndex":"Q3","ContestID_en":"Weekly Contest 277","ContestID_zh":"第 277 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Counting","slug":"counting"}]},{"Rating":1274.881752217,"ID":2129,"Title":"Capitalize the Title","TitleZH":"将标题首字母大写","TitleSlug":"capitalize-the-title","ContestSlug":"biweekly-contest-69","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 69","ContestID_zh":"第 69 场双周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1274.7596170193,"ID":1078,"Title":"Occurrences After Bigram","TitleZH":"Bigram 分词","TitleSlug":"occurrences-after-bigram","ContestSlug":"weekly-contest-140","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 140","ContestID_zh":"第 140 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1274.6742564805,"ID":1005,"Title":"Maximize Sum Of Array After K Negations","TitleZH":"K 次取反后最大化的数组和","TitleSlug":"maximize-sum-of-array-after-k-negations","ContestSlug":"weekly-contest-127","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 127","ContestID_zh":"第 127 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1273.0588534723,"ID":2068,"Title":"Check Whether Two Strings are Almost Equivalent","TitleZH":"检查两个字符串是否几乎相等","TitleSlug":"check-whether-two-strings-are-almost-equivalent","ContestSlug":"biweekly-contest-65","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 65","ContestID_zh":"第 65 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Counting","slug":"counting"}]},{"Rating":1273.046473797,"ID":2138,"Title":"Divide a String Into Groups of Size k","TitleZH":"将字符串拆分为若干长度为 k 的组","TitleSlug":"divide-a-string-into-groups-of-size-k","ContestSlug":"weekly-contest-276","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 276","ContestID_zh":"第 276 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1271.7726574892,"ID":2006,"Title":"Count Number of Pairs With Absolute Difference K","TitleZH":"差的绝对值为 K 的数对数目","TitleSlug":"count-number-of-pairs-with-absolute-difference-k","ContestSlug":"biweekly-contest-61","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 61","ContestID_zh":"第 61 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Counting","slug":"counting"}]},{"Rating":1271.7055549365,"ID":824,"Title":"Goat Latin","TitleZH":"山羊拉丁文","TitleSlug":"goat-latin","ContestSlug":"weekly-contest-82","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 82","ContestID_zh":"第 82 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1271.3776510163,"ID":1556,"Title":"Thousand Separator","TitleZH":"千位分隔数","TitleSlug":"thousand-separator","ContestSlug":"biweekly-contest-33","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 33","ContestID_zh":"第 33 场双周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1271.3313760514,"ID":925,"Title":"Long Pressed Name","TitleZH":"长按键入","TitleSlug":"long-pressed-name","ContestSlug":"weekly-contest-107","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 107","ContestID_zh":"第 107 场周赛","topicTags":[{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"}]},{"Rating":1270.6712381632,"ID":2363,"Title":"Merge Similar Items","TitleZH":"合并相似的物品","TitleSlug":"merge-similar-items","ContestSlug":"biweekly-contest-84","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 84","ContestID_zh":"第 84 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Sorting","slug":"sorting"},{"name":"Ordered Set","slug":"ordered-set"}]},{"Rating":1269.7567553523,"ID":2032,"Title":"Two Out of Three","TitleZH":"至少在两个数组中出现的值","TitleSlug":"two-out-of-three","ContestSlug":"weekly-contest-262","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 262","ContestID_zh":"第 262 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"}]},{"Rating":1268.5768566953,"ID":1447,"Title":"Simplified Fractions","TitleZH":"最简分数","TitleSlug":"simplified-fractions","ContestSlug":"biweekly-contest-26","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 26","ContestID_zh":"第 26 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"},{"name":"Number Theory","slug":"number-theory"}]},{"Rating":1268.0287696194,"ID":2325,"Title":"Decode the Message","TitleZH":"解密消息","TitleSlug":"decode-the-message","ContestSlug":"weekly-contest-300","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 300","ContestID_zh":"第 300 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1267.223591366,"ID":1282,"Title":"Group the People Given the Group Size They Belong To","TitleZH":"用户分组","TitleSlug":"group-the-people-given-the-group-size-they-belong-to","ContestSlug":"weekly-contest-166","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 166","ContestID_zh":"第 166 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"}]},{"Rating":1266.7001363197,"ID":2432,"Title":"The Employee That Worked on the Longest Task","TitleZH":"处理用时最长的那个任务的员工","TitleSlug":"the-employee-that-worked-on-the-longest-task","ContestSlug":"weekly-contest-314","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 314","ContestID_zh":"第 314 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1266.341468955,"ID":2200,"Title":"Find All K-Distant Indices in an Array","TitleZH":"找出数组中的所有 K 近邻下标","TitleSlug":"find-all-k-distant-indices-in-an-array","ContestSlug":"weekly-contest-284","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 284","ContestID_zh":"第 284 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1266.3368046515,"ID":821,"Title":"Shortest Distance to a Character","TitleZH":"字符的最短距离","TitleSlug":"shortest-distance-to-a-character","ContestSlug":"weekly-contest-81","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 81","ContestID_zh":"第 81 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"}]},{"Rating":1264.4836883082,"ID":1736,"Title":"Latest Time by Replacing Hidden Digits","TitleZH":"替换隐藏数字得到的最晚时间","TitleSlug":"latest-time-by-replacing-hidden-digits","ContestSlug":"weekly-contest-225","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 225","ContestID_zh":"第 225 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1264.4778916192,"ID":2248,"Title":"Intersection of Multiple Arrays","TitleZH":"多个数组求交集","TitleSlug":"intersection-of-multiple-arrays","ContestSlug":"weekly-contest-290","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 290","ContestID_zh":"第 290 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Counting","slug":"counting"}]},{"Rating":1264.2868345638,"ID":2133,"Title":"Check if Every Row and Column Contains All Numbers","TitleZH":"检查是否每一行每一列都包含全部整数","TitleSlug":"check-if-every-row-and-column-contains-all-numbers","ContestSlug":"weekly-contest-275","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 275","ContestID_zh":"第 275 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1263.2728668041,"ID":1456,"Title":"Maximum Number of Vowels in a Substring of Given Length","TitleZH":"定长子串中元音的最大数目","TitleSlug":"maximum-number-of-vowels-in-a-substring-of-given-length","ContestSlug":"weekly-contest-190","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 190","ContestID_zh":"第 190 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Sliding Window","slug":"sliding-window"}]},{"Rating":1262.938740364,"ID":2490,"Title":"Circular Sentence","TitleZH":"回环句","TitleSlug":"circular-sentence","ContestSlug":"weekly-contest-322","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 322","ContestID_zh":"第 322 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1262.5890311992,"ID":1089,"Title":"Duplicate Zeros","TitleZH":"复写零","TitleSlug":"duplicate-zeros","ContestSlug":"weekly-contest-141","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 141","ContestID_zh":"第 141 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"}]},{"Rating":1260.9112824221,"ID":2144,"Title":"Minimum Cost of Buying Candies With Discount","TitleZH":"打折购买糖果的最小开销","TitleSlug":"minimum-cost-of-buying-candies-with-discount","ContestSlug":"biweekly-contest-70","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 70","ContestID_zh":"第 70 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1260.870208308,"ID":2255,"Title":"Count Prefixes of a Given String","TitleZH":"统计是给定字符串前缀的字符串数目","TitleSlug":"count-prefixes-of-a-given-string","ContestSlug":"biweekly-contest-77","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 77","ContestID_zh":"第 77 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"}]},{"Rating":1260.8697515006,"ID":2520,"Title":"Count the Digits That Divide a Number","TitleZH":"统计能整除数字的位数","TitleSlug":"count-the-digits-that-divide-a-number","ContestSlug":"weekly-contest-326","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 326","ContestID_zh":"第 326 场周赛","topicTags":[{"name":"Math","slug":"math"}]},{"Rating":1260.1755576607,"ID":1305,"Title":"All Elements in Two Binary Search Trees","TitleZH":"两棵二叉搜索树中的所有元素","TitleSlug":"all-elements-in-two-binary-search-trees","ContestSlug":"weekly-contest-169","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 169","ContestID_zh":"第 169 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Binary Search Tree","slug":"binary-search-tree"},{"name":"Sorting","slug":"sorting"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1259.5707438932,"ID":1779,"Title":"Find Nearest Point That Has the Same X or Y Coordinate","TitleZH":"找到最近的有相同 X 或 Y 坐标的点","TitleSlug":"find-nearest-point-that-has-the-same-x-or-y-coordinate","ContestSlug":"biweekly-contest-47","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 47","ContestID_zh":"第 47 场双周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1259.409726189,"ID":884,"Title":"Uncommon Words from Two Sentences","TitleZH":"两句话中的不常见单词","TitleSlug":"uncommon-words-from-two-sentences","ContestSlug":"weekly-contest-97","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 97","ContestID_zh":"第 97 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1259.3406231708,"ID":2404,"Title":"Most Frequent Even Element","TitleZH":"出现最频繁的偶数元素","TitleSlug":"most-frequent-even-element","ContestSlug":"weekly-contest-310","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 310","ContestID_zh":"第 310 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Counting","slug":"counting"}]},{"Rating":1259.1979660519,"ID":1213,"Title":"Intersection of Three Sorted Arrays","TitleZH":"三个有序数组的交集","TitleSlug":"intersection-of-three-sorted-arrays","ContestSlug":"biweekly-contest-10","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 10","ContestID_zh":"第 10 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Binary Search","slug":"binary-search"},{"name":"Counting","slug":"counting"}]},{"Rating":1258.8401788462,"ID":867,"Title":"Transpose Matrix","TitleZH":"转置矩阵","TitleSlug":"transpose-matrix","ContestSlug":"weekly-contest-92","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 92","ContestID_zh":"第 92 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1258.6719675401,"ID":896,"Title":"Monotonic Array","TitleZH":"单调数列","TitleSlug":"monotonic-array","ContestSlug":"weekly-contest-100","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 100","ContestID_zh":"第 100 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1257.7670945029,"ID":2103,"Title":"Rings and Rods","TitleZH":"环和杆","TitleSlug":"rings-and-rods","ContestSlug":"weekly-contest-271","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 271","ContestID_zh":"第 271 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1257.7082143289,"ID":1356,"Title":"Sort Integers by The Number of 1 Bits","TitleZH":"根据数字二进制下 1 的数目排序","TitleSlug":"sort-integers-by-the-number-of-1-bits","ContestSlug":"biweekly-contest-20","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 20","ContestID_zh":"第 20 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Sorting","slug":"sorting"},{"name":"Counting","slug":"counting"}]},{"Rating":1257.679633165,"ID":1309,"Title":"Decrypt String from Alphabet to Integer Mapping","TitleZH":"解码字母到整数映射","TitleSlug":"decrypt-string-from-alphabet-to-integer-mapping","ContestSlug":"weekly-contest-170","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 170","ContestID_zh":"第 170 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1257.323514611,"ID":2114,"Title":"Maximum Number of Words Found in Sentences","TitleZH":"句子中的最多单词数","TitleSlug":"maximum-number-of-words-found-in-sentences","ContestSlug":"biweekly-contest-68","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 68","ContestID_zh":"第 68 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"}]},{"Rating":1257.264923599,"ID":2042,"Title":"Check if Numbers Are Ascending in a Sentence","TitleZH":"检查句子中的数字是否递增","TitleSlug":"check-if-numbers-are-ascending-in-a-sentence","ContestSlug":"weekly-contest-263","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 263","ContestID_zh":"第 263 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1257.1556875655,"ID":2177,"Title":"Find Three Consecutive Integers That Sum to a Given Number","TitleZH":"找到和为给定整数的三个连续整数","TitleSlug":"find-three-consecutive-integers-that-sum-to-a-given-number","ContestSlug":"biweekly-contest-72","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 72","ContestID_zh":"第 72 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1257.1166915286,"ID":2180,"Title":"Count Integers With Even Digit Sum","TitleZH":"统计各位数字之和为偶数的整数个数","TitleSlug":"count-integers-with-even-digit-sum","ContestSlug":"weekly-contest-281","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 281","ContestID_zh":"第 281 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1256.6807087287,"ID":1732,"Title":"Find the Highest Altitude","TitleZH":"找到最高海拔","TitleSlug":"find-the-highest-altitude","ContestSlug":"biweekly-contest-44","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 44","ContestID_zh":"第 44 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1256.4891142083,"ID":1085,"Title":"Sum of Digits in the Minimum Number","TitleZH":"最小元素各数位之和","TitleSlug":"sum-of-digits-in-the-minimum-number","ContestSlug":"biweekly-contest-2","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 2","ContestID_zh":"第 2 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"}]},{"Rating":1256.0514740971,"ID":2239,"Title":"Find Closest Number to Zero","TitleZH":"找到最接近 0 的数字","TitleSlug":"find-closest-number-to-zero","ContestSlug":"biweekly-contest-76","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 76","ContestID_zh":"第 76 场双周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1255.9002796024,"ID":1037,"Title":"Valid Boomerang","TitleZH":"有效的回旋镖","TitleSlug":"valid-boomerang","ContestSlug":"weekly-contest-135","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 135","ContestID_zh":"第 135 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Geometry","slug":"geometry"}]},{"Rating":1255.5461825223,"ID":2475,"Title":"Number of Unequal Triplets in Array","TitleZH":"数组中不等三元组的数目","TitleSlug":"number-of-unequal-triplets-in-array","ContestSlug":"weekly-contest-320","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 320","ContestID_zh":"第 320 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"}]},{"Rating":1254.8626139269,"ID":1945,"Title":"Sum of Digits of String After Convert","TitleZH":"字符串转化后的各位数字之和","TitleSlug":"sum-of-digits-of-string-after-convert","ContestSlug":"weekly-contest-251","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 251","ContestID_zh":"第 251 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1253.4847783954,"ID":2283,"Title":"Check if Number Has Equal Digit Count and Digit Value","TitleZH":"判断一个数的数字计数是否等于数位的值","TitleSlug":"check-if-number-has-equal-digit-count-and-digit-value","ContestSlug":"biweekly-contest-79","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 79","ContestID_zh":"第 79 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Counting","slug":"counting"}]},{"Rating":1253.1463945043,"ID":2194,"Title":"Cells in a Range on an Excel Sheet","TitleZH":"Excel 表中某个范围内的单元格","TitleSlug":"cells-in-a-range-on-an-excel-sheet","ContestSlug":"weekly-contest-283","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 283","ContestID_zh":"第 283 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1253.1107481745,"ID":2186,"Title":"Minimum Number of Steps to Make Two Strings Anagram II","TitleZH":"使两字符串互为字母异位词的最少步骤数","TitleSlug":"minimum-number-of-steps-to-make-two-strings-anagram-ii","ContestSlug":"weekly-contest-282","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 282","ContestID_zh":"第 282 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Counting","slug":"counting"}]},{"Rating":1252.8406166148,"ID":2164,"Title":"Sort Even and Odd Indices Independently","TitleZH":"对奇偶下标分别排序","TitleSlug":"sort-even-and-odd-indices-independently","ContestSlug":"weekly-contest-279","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 279","ContestID_zh":"第 279 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1252.7479413966,"ID":1833,"Title":"Maximum Ice Cream Bars","TitleZH":"雪糕的最大数量","TitleSlug":"maximum-ice-cream-bars","ContestSlug":"weekly-contest-237","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 237","ContestID_zh":"第 237 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1251.822378691,"ID":830,"Title":"Positions of Large Groups","TitleZH":"较大分组的位置","TitleSlug":"positions-of-large-groups","ContestSlug":"weekly-contest-83","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 83","ContestID_zh":"第 83 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1250.8974254752,"ID":2315,"Title":"Count Asterisks","TitleZH":"统计星号","TitleSlug":"count-asterisks","ContestSlug":"biweekly-contest-81","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 81","ContestID_zh":"第 81 场双周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1250.0975318308,"ID":2465,"Title":"Number of Distinct Averages","TitleZH":"不同的平均值数目","TitleSlug":"number-of-distinct-averages","ContestSlug":"biweekly-contest-91","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 91","ContestID_zh":"第 91 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1249.9947800752,"ID":1150,"Title":"Check If a Number Is Majority Element in a Sorted Array","TitleZH":"检查一个数是否在数组中占绝大多数","TitleSlug":"check-if-a-number-is-majority-element-in-a-sorted-array","ContestSlug":"biweekly-contest-6","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 6","ContestID_zh":"第 6 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":1249.9086403595,"ID":1161,"Title":"Maximum Level Sum of a Binary Tree","TitleZH":"最大层内元素和","TitleSlug":"maximum-level-sum-of-a-binary-tree","ContestSlug":"weekly-contest-150","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 150","ContestID_zh":"第 150 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1249.8425270142,"ID":2395,"Title":"Find Subarrays With Equal Sum","TitleZH":"和相等的子数组","TitleSlug":"find-subarrays-with-equal-sum","ContestSlug":"biweekly-contest-86","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 86","ContestID_zh":"第 86 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"}]},{"Rating":1249.4294341104,"ID":766,"Title":"Toeplitz Matrix","TitleZH":"托普利茨矩阵","TitleSlug":"toeplitz-matrix","ContestSlug":"weekly-contest-68","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 68","ContestID_zh":"第 68 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1249.2572200035,"ID":2279,"Title":"Maximum Bags With Full Capacity of Rocks","TitleZH":"装满石头的背包的最大数量","TitleSlug":"maximum-bags-with-full-capacity-of-rocks","ContestSlug":"weekly-contest-294","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 294","ContestID_zh":"第 294 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1248.8547072235,"ID":1903,"Title":"Largest Odd Number in String","TitleZH":"字符串中的最大奇数","TitleSlug":"largest-odd-number-in-string","ContestSlug":"weekly-contest-246","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 246","ContestID_zh":"第 246 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1248.8026990632,"ID":1196,"Title":"How Many Apples Can You Put into the Basket","TitleZH":"最多可以买到的苹果数量","TitleSlug":"how-many-apples-can-you-put-into-the-basket","ContestSlug":"biweekly-contest-9","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 9","ContestID_zh":"第 9 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1248.7224675206,"ID":1876,"Title":"Substrings of Size Three with Distinct Characters","TitleZH":"长度为三且各字符不同的子字符串","TitleSlug":"substrings-of-size-three-with-distinct-characters","ContestSlug":"biweekly-contest-53","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 53","ContestID_zh":"第 53 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Sliding Window","slug":"sliding-window"},{"name":"Counting","slug":"counting"}]},{"Rating":1247.3198836387,"ID":1232,"Title":"Check If It Is a Straight Line","TitleZH":"缀点成线","TitleSlug":"check-if-it-is-a-straight-line","ContestSlug":"weekly-contest-159","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 159","ContestID_zh":"第 159 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Geometry","slug":"geometry"}]},{"Rating":1246.0341186297,"ID":2481,"Title":"Minimum Cuts to Divide a Circle","TitleZH":"分割圆的最少切割次数","TitleSlug":"minimum-cuts-to-divide-a-circle","ContestSlug":"biweekly-contest-92","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 92","ContestID_zh":"第 92 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Geometry","slug":"geometry"}]},{"Rating":1246.0141927368,"ID":2016,"Title":"Maximum Difference Between Increasing Elements","TitleZH":"增量元素之间的最大差值","TitleSlug":"maximum-difference-between-increasing-elements","ContestSlug":"weekly-contest-260","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 260","ContestID_zh":"第 260 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1245.2999833877,"ID":1518,"Title":"Water Bottles","TitleZH":"换酒问题","TitleSlug":"water-bottles","ContestSlug":"weekly-contest-198","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 198","ContestID_zh":"第 198 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1245.2741257148,"ID":1099,"Title":"Two Sum Less Than K","TitleZH":"小于 K 的两数之和","TitleSlug":"two-sum-less-than-k","ContestSlug":"biweekly-contest-3","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 3","ContestID_zh":"第 3 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1244.317367883,"ID":1228,"Title":"Missing Number In Arithmetic Progression","TitleZH":"等差数列中缺失的数字","TitleSlug":"missing-number-in-arithmetic-progression","ContestSlug":"biweekly-contest-11","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 11","ContestID_zh":"第 11 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"}]},{"Rating":1243.6250741657,"ID":2399,"Title":"Check Distances Between Same Letters","TitleZH":"检查相同字母间的距离","TitleSlug":"check-distances-between-same-letters","ContestSlug":"weekly-contest-309","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 309","ContestID_zh":"第 309 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1243.1009943284,"ID":832,"Title":"Flipping an Image","TitleZH":"翻转图像","TitleSlug":"flipping-an-image","ContestSlug":"weekly-contest-84","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 84","ContestID_zh":"第 84 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Matrix","slug":"matrix"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1242.8939284628,"ID":2309,"Title":"Greatest English Letter in Upper and Lower Case","TitleZH":"兼具大小写的最好英文字母","TitleSlug":"greatest-english-letter-in-upper-and-lower-case","ContestSlug":"weekly-contest-298","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 298","ContestID_zh":"第 298 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1242.6172898768,"ID":1941,"Title":"Check if All Characters Have Equal Number of Occurrences","TitleZH":"检查是否所有字符出现次数相同","TitleSlug":"check-if-all-characters-have-equal-number-of-occurrences","ContestSlug":"biweekly-contest-57","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 57","ContestID_zh":"第 57 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Counting","slug":"counting"}]},{"Rating":1242.4710735813,"ID":921,"Title":"Minimum Add to Make Parentheses Valid","TitleZH":"使括号有效的最少添加","TitleSlug":"minimum-add-to-make-parentheses-valid","ContestSlug":"weekly-contest-106","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 106","ContestID_zh":"第 106 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1241.9262857175,"ID":1417,"Title":"Reformat The String","TitleZH":"重新格式化字符串","TitleSlug":"reformat-the-string","ContestSlug":"weekly-contest-185","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 185","ContestID_zh":"第 185 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1241.5645130241,"ID":2347,"Title":"Best Poker Hand","TitleZH":"最好的扑克手牌","TitleSlug":"best-poker-hand","ContestSlug":"biweekly-contest-83","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 83","ContestID_zh":"第 83 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Counting","slug":"counting"}]},{"Rating":1241.5396695569,"ID":2299,"Title":"Strong Password Checker II","TitleZH":"强密码检验器 II","TitleSlug":"strong-password-checker-ii","ContestSlug":"biweekly-contest-80","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 80","ContestID_zh":"第 80 场双周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1241.0825147417,"ID":2293,"Title":"Min Max Game","TitleZH":"极大极小游戏","TitleSlug":"min-max-game","ContestSlug":"weekly-contest-296","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 296","ContestID_zh":"第 296 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1240.829758176,"ID":2078,"Title":"Two Furthest Houses With Different Colors","TitleZH":"两栋颜色不同且距离最远的房子","TitleSlug":"two-furthest-houses-with-different-colors","ContestSlug":"weekly-contest-268","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 268","ContestID_zh":"第 268 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1237.7565585875,"ID":1422,"Title":"Maximum Score After Splitting a String","TitleZH":"分割字符串的最大得分","TitleSlug":"maximum-score-after-splitting-a-string","ContestSlug":"weekly-contest-186","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 186","ContestID_zh":"第 186 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1235.9216009709,"ID":2149,"Title":"Rearrange Array Elements by Sign","TitleZH":"按符号重排数组","TitleSlug":"rearrange-array-elements-by-sign","ContestSlug":"weekly-contest-277","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 277","ContestID_zh":"第 277 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1235.8413685224,"ID":2154,"Title":"Keep Multiplying Found Values by Two","TitleZH":"将找到的值乘以 2","TitleSlug":"keep-multiplying-found-values-by-two","ContestSlug":"weekly-contest-278","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 278","ContestID_zh":"第 278 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Sorting","slug":"sorting"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1235.6114196155,"ID":1816,"Title":"Truncate Sentence","TitleZH":"截断句子","TitleSlug":"truncate-sentence","ContestSlug":"weekly-contest-235","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 235","ContestID_zh":"第 235 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"}]},{"Rating":1234.8049089605,"ID":1385,"Title":"Find the Distance Value Between Two Arrays","TitleZH":"两个数组间的距离值","TitleSlug":"find-the-distance-value-between-two-arrays","ContestSlug":"biweekly-contest-22","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 22","ContestID_zh":"第 22 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1234.7692637513,"ID":989,"Title":"Add to Array-Form of Integer","TitleZH":"数组形式的整数加法","TitleSlug":"add-to-array-form-of-integer","ContestSlug":"weekly-contest-123","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 123","ContestID_zh":"第 123 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"}]},{"Rating":1234.7084656358,"ID":1009,"Title":"Complement of Base 10 Integer","TitleZH":"十进制整数的反码","TitleSlug":"complement-of-base-10-integer","ContestSlug":"weekly-contest-128","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 128","ContestID_zh":"第 128 场周赛","topicTags":[{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":1234.4144116814,"ID":1184,"Title":"Distance Between Bus Stops","TitleZH":"公交站间的距离","TitleSlug":"distance-between-bus-stops","ContestSlug":"weekly-contest-153","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 153","ContestID_zh":"第 153 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1234.058537565,"ID":1961,"Title":"Check If String Is a Prefix of Array","TitleZH":"检查字符串是否为数组前缀","TitleSlug":"check-if-string-is-a-prefix-of-array","ContestSlug":"weekly-contest-253","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 253","ContestID_zh":"第 253 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"}]},{"Rating":1232.8314427996,"ID":1119,"Title":"Remove Vowels from a String","TitleZH":"删去字符串中的元音","TitleSlug":"remove-vowels-from-a-string","ContestSlug":"biweekly-contest-4","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 4","ContestID_zh":"第 4 场双周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1231.999241335,"ID":1492,"Title":"The kth Factor of n","TitleZH":"n 的第 k 个因子","TitleSlug":"the-kth-factor-of-n","ContestSlug":"biweekly-contest-29","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 29","ContestID_zh":"第 29 场双周赛","topicTags":[{"name":"Math","slug":"math"}]},{"Rating":1231.8671440198,"ID":1967,"Title":"Number of Strings That Appear as Substrings in Word","TitleZH":"作为子字符串出现在单词中的字符串数目","TitleSlug":"number-of-strings-that-appear-as-substrings-in-word","ContestSlug":"weekly-contest-254","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 254","ContestID_zh":"第 254 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1231.6157956848,"ID":876,"Title":"Middle of the Linked List","TitleZH":"链表的中间结点","TitleSlug":"middle-of-the-linked-list","ContestSlug":"weekly-contest-95","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 95","ContestID_zh":"第 95 场周赛","topicTags":[{"name":"Linked List","slug":"linked-list"},{"name":"Two Pointers","slug":"two-pointers"}]},{"Rating":1231.4004525633,"ID":1134,"Title":"Armstrong Number","TitleZH":"阿姆斯特朗数","TitleSlug":"armstrong-number","ContestSlug":"biweekly-contest-5","ProblemIndex":"Q2","ContestID_en":"Biweekly Contest 5","ContestID_zh":"第 5 场双周赛","topicTags":[{"name":"Math","slug":"math"}]},{"Rating":1229.4850365142,"ID":1725,"Title":"Number Of Rectangles That Can Form The Largest Square","TitleZH":"可以形成最大正方形的矩形数目","TitleSlug":"number-of-rectangles-that-can-form-the-largest-square","ContestSlug":"weekly-contest-224","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 224","ContestID_zh":"第 224 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1229.1709574783,"ID":1800,"Title":"Maximum Ascending Subarray Sum","TitleZH":"最大升序子数组和","TitleSlug":"maximum-ascending-subarray-sum","ContestSlug":"weekly-contest-233","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 233","ContestID_zh":"第 233 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1228.630993648,"ID":917,"Title":"Reverse Only Letters","TitleZH":"仅仅反转字母","TitleSlug":"reverse-only-letters","ContestSlug":"weekly-contest-105","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 105","ContestID_zh":"第 105 场周赛","topicTags":[{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"}]},{"Rating":1228.4824438011,"ID":1748,"Title":"Sum of Unique Elements","TitleZH":"唯一元素的和","TitleSlug":"sum-of-unique-elements","ContestSlug":"biweekly-contest-45","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 45","ContestID_zh":"第 45 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Counting","slug":"counting"}]},{"Rating":1227.7906887239,"ID":844,"Title":"Backspace String Compare","TitleZH":"比较含退格的字符串","TitleSlug":"backspace-string-compare","ContestSlug":"weekly-contest-87","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 87","ContestID_zh":"第 87 场周赛","topicTags":[{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"},{"name":"Stack","slug":"stack"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1227.3485530532,"ID":1118,"Title":"Number of Days in a Month","TitleZH":"一月有多少天","TitleSlug":"number-of-days-in-a-month","ContestSlug":"biweekly-contest-4","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 4","ContestID_zh":"第 4 场双周赛","topicTags":[{"name":"Math","slug":"math"}]},{"Rating":1226.8332278145,"ID":1935,"Title":"Maximum Number of Words You Can Type","TitleZH":"可以输入的最大单词数","TitleSlug":"maximum-number-of-words-you-can-type","ContestSlug":"weekly-contest-250","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 250","ContestID_zh":"第 250 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1226.2960135431,"ID":1133,"Title":"Largest Unique Number","TitleZH":"最大唯一数","TitleSlug":"largest-unique-number","ContestSlug":"biweekly-contest-5","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 5","ContestID_zh":"第 5 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1225.3923012413,"ID":2357,"Title":"Make Array Zero by Subtracting Equal Amounts","TitleZH":"使数组中所有元素都等于零","TitleSlug":"make-array-zero-by-subtracting-equal-amounts","ContestSlug":"weekly-contest-304","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 304","ContestID_zh":"第 304 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1225.3601348675,"ID":1346,"Title":"Check If N and Its Double Exist","TitleZH":"检查整数及其两倍数是否存在","TitleSlug":"check-if-n-and-its-double-exist","ContestSlug":"weekly-contest-175","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 175","ContestID_zh":"第 175 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1224.7606792444,"ID":1337,"Title":"The K Weakest Rows in a Matrix","TitleZH":"矩阵中战斗力最弱的 K 行","TitleSlug":"the-k-weakest-rows-in-a-matrix","ContestSlug":"weekly-contest-174","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 174","ContestID_zh":"第 174 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1223.9335618833,"ID":2460,"Title":"Apply Operations to an Array","TitleZH":"对数组执行操作","TitleSlug":"apply-operations-to-an-array","ContestSlug":"weekly-contest-318","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 318","ContestID_zh":"第 318 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1223.406570396,"ID":2206,"Title":"Divide Array Into Equal Pairs","TitleZH":"将数组划分成相等数对","TitleSlug":"divide-array-into-equal-pairs","ContestSlug":"biweekly-contest-74","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 74","ContestID_zh":"第 74 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Bit Manipulation","slug":"bit-manipulation"},{"name":"Counting","slug":"counting"}]},{"Rating":1223.3861903833,"ID":1408,"Title":"String Matching in an Array","TitleZH":"数组中的字符串匹配","TitleSlug":"string-matching-in-an-array","ContestSlug":"weekly-contest-184","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 184","ContestID_zh":"第 184 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"String Matching","slug":"string-matching"}]},{"Rating":1221.9872943569,"ID":1678,"Title":"Goal Parser Interpretation","TitleZH":"设计 Goal 解析器","TitleSlug":"goal-parser-interpretation","ContestSlug":"weekly-contest-218","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 218","ContestID_zh":"第 218 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1221.8477681772,"ID":2414,"Title":"Length of the Longest Alphabetical Continuous Substring","TitleZH":"最长的字母序连续子字符串的长度","TitleSlug":"length-of-the-longest-alphabetical-continuous-substring","ContestSlug":"weekly-contest-311","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 311","ContestID_zh":"第 311 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1221.6801628274,"ID":1550,"Title":"Three Consecutive Odds","TitleZH":"存在连续三个奇数的数组","TitleSlug":"three-consecutive-odds","ContestSlug":"weekly-contest-202","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 202","ContestID_zh":"第 202 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1219.5284561367,"ID":1221,"Title":"Split a String in Balanced Strings","TitleZH":"分割平衡字符串","TitleSlug":"split-a-string-in-balanced-strings","ContestSlug":"weekly-contest-158","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 158","ContestID_zh":"第 158 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Greedy","slug":"greedy"},{"name":"Counting","slug":"counting"}]},{"Rating":1219.4252907184,"ID":1299,"Title":"Replace Elements with Greatest Element on Right Side","TitleZH":"将每个元素替换为右侧最大元素","TitleSlug":"replace-elements-with-greatest-element-on-right-side","ContestSlug":"biweekly-contest-16","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 16","ContestID_zh":"第 16 场双周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1218.9011436003,"ID":2442,"Title":"Count Number of Distinct Integers After Reverse Operations","TitleZH":"反转之后不同整数的数目","TitleSlug":"count-number-of-distinct-integers-after-reverse-operations","ContestSlug":"weekly-contest-315","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 315","ContestID_zh":"第 315 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Math","slug":"math"}]},{"Rating":1217.1184374247,"ID":1662,"Title":"Check If Two String Arrays are Equivalent","TitleZH":"检查两个字符串数组是否相等","TitleSlug":"check-if-two-string-arrays-are-equivalent","ContestSlug":"weekly-contest-216","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 216","ContestID_zh":"第 216 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"}]},{"Rating":1216.6376846517,"ID":1848,"Title":"Minimum Distance to the Target Element","TitleZH":"到目标元素的最小距离","TitleSlug":"minimum-distance-to-the-target-element","ContestSlug":"weekly-contest-239","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 239","ContestID_zh":"第 239 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1215.7827321325,"ID":2176,"Title":"Count Equal and Divisible Pairs in an Array","TitleZH":"统计数组中相等且可以被整除的数对","TitleSlug":"count-equal-and-divisible-pairs-in-an-array","ContestSlug":"biweekly-contest-72","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 72","ContestID_zh":"第 72 场双周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1215.7443346869,"ID":2108,"Title":"Find First Palindromic String in the Array","TitleZH":"找出数组中的第一个回文字符串","TitleSlug":"find-first-palindromic-string-in-the-array","ContestSlug":"weekly-contest-272","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 272","ContestID_zh":"第 272 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"}]},{"Rating":1213.8073621345,"ID":973,"Title":"K Closest Points to Origin","TitleZH":"最接近原点的 K 个点","TitleSlug":"k-closest-points-to-origin","ContestSlug":"weekly-contest-119","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 119","ContestID_zh":"第 119 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Divide and Conquer","slug":"divide-and-conquer"},{"name":"Geometry","slug":"geometry"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"},{"name":"Quickselect","slug":"quickselect"}]},{"Rating":1212.2606422181,"ID":1475,"Title":"Final Prices With a Special Discount in a Shop","TitleZH":"商品折扣后的最终价格","TitleSlug":"final-prices-with-a-special-discount-in-a-shop","ContestSlug":"biweekly-contest-28","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 28","ContestID_zh":"第 28 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Stack","slug":"stack"},{"name":"Monotonic Stack","slug":"monotonic-stack"}]},{"Rating":1212.2309421538,"ID":1413,"Title":"Minimum Value to Get Positive Step by Step Sum","TitleZH":"逐步求和得到正数的最小值","TitleSlug":"minimum-value-to-get-positive-step-by-step-sum","ContestSlug":"biweekly-contest-24","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 24","ContestID_zh":"第 24 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1209.6571020247,"ID":1822,"Title":"Sign of the Product of an Array","TitleZH":"数组元素积的符号","TitleSlug":"sign-of-the-product-of-an-array","ContestSlug":"weekly-contest-236","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 236","ContestID_zh":"第 236 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"}]},{"Rating":1209.3722198224,"ID":1523,"Title":"Count Odd Numbers in an Interval Range","TitleZH":"在区间范围内统计奇数数目","TitleSlug":"count-odd-numbers-in-an-interval-range","ContestSlug":"biweekly-contest-31","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 31","ContestID_zh":"第 31 场双周赛","topicTags":[{"name":"Math","slug":"math"}]},{"Rating":1208.0417047337,"ID":1389,"Title":"Create Target Array in the Given Order","TitleZH":"按既定顺序创建目标数组","TitleSlug":"create-target-array-in-the-given-order","ContestSlug":"weekly-contest-181","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 181","ContestID_zh":"第 181 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1208.0130656905,"ID":941,"Title":"Valid Mountain Array","TitleZH":"有效的山脉数组","TitleSlug":"valid-mountain-array","ContestSlug":"weekly-contest-111","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 111","ContestID_zh":"第 111 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1207.7810914125,"ID":1380,"Title":"Lucky Numbers in a Matrix","TitleZH":"矩阵中的幸运数","TitleSlug":"lucky-numbers-in-a-matrix","ContestSlug":"weekly-contest-180","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 180","ContestID_zh":"第 180 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1207.748239075,"ID":2215,"Title":"Find the Difference of Two Arrays","TitleZH":"找出两数组的不同","TitleSlug":"find-the-difference-of-two-arrays","ContestSlug":"weekly-contest-286","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 286","ContestID_zh":"第 286 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"}]},{"Rating":1207.7224406285,"ID":1704,"Title":"Determine if String Halves Are Alike","TitleZH":"判断字符串的两半是否相似","TitleSlug":"determine-if-string-halves-are-alike","ContestSlug":"weekly-contest-221","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 221","ContestID_zh":"第 221 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"Counting","slug":"counting"}]},{"Rating":1207.3151378208,"ID":2485,"Title":"Find the Pivot Integer","TitleZH":"找出中枢整数","TitleSlug":"find-the-pivot-integer","ContestSlug":"weekly-contest-321","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 321","ContestID_zh":"第 321 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1206.1240971343,"ID":1784,"Title":"Check if Binary String Has at Most One Segment of Ones","TitleZH":"检查二进制字符串字段","TitleSlug":"check-if-binary-string-has-at-most-one-segment-of-ones","ContestSlug":"weekly-contest-231","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 231","ContestID_zh":"第 231 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1205.6698455508,"ID":1160,"Title":"Find Words That Can Be Formed by Characters","TitleZH":"拼写单词","TitleSlug":"find-words-that-can-be-formed-by-characters","ContestSlug":"weekly-contest-150","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 150","ContestID_zh":"第 150 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1204.9864820183,"ID":1869,"Title":"Longer Contiguous Segments of Ones than Zeros","TitleZH":"哪种连续子字符串更长","TitleSlug":"longer-contiguous-segments-of-ones-than-zeros","ContestSlug":"weekly-contest-242","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 242","ContestID_zh":"第 242 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1203.7504950404,"ID":1952,"Title":"Three Divisors","TitleZH":"三除数","TitleSlug":"three-divisors","ContestSlug":"weekly-contest-252","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 252","ContestID_zh":"第 252 场周赛","topicTags":[{"name":"Math","slug":"math"}]},{"Rating":1203.1408035909,"ID":1688,"Title":"Count of Matches in Tournament","TitleZH":"比赛中的配对次数","TitleSlug":"count-of-matches-in-tournament","ContestSlug":"weekly-contest-219","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 219","ContestID_zh":"第 219 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1203.0737869081,"ID":2367,"Title":"Number of Arithmetic Triplets","TitleZH":"算术三元组的数目","TitleSlug":"number-of-arithmetic-triplets","ContestSlug":"weekly-contest-305","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 305","ContestID_zh":"第 305 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Enumeration","slug":"enumeration"}]},{"Rating":1201.8730954169,"ID":2148,"Title":"Count Elements With Strictly Smaller and Greater Elements ","TitleZH":"元素计数","TitleSlug":"count-elements-with-strictly-smaller-and-greater-elements","ContestSlug":"weekly-contest-277","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 277","ContestID_zh":"第 277 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1201.7686271329,"ID":2124,"Title":"Check if All A's Appears Before All B's","TitleZH":"检查是否所有 A 都在 B 之前","TitleSlug":"check-if-all-as-appears-before-all-bs","ContestSlug":"weekly-contest-274","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 274","ContestID_zh":"第 274 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1201.6117337798,"ID":997,"Title":"Find the Town Judge","TitleZH":"找到小镇的法官","TitleSlug":"find-the-town-judge","ContestSlug":"weekly-contest-125","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 125","ContestID_zh":"第 125 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Graph","slug":"graph"}]},{"Rating":1201.3497763919,"ID":1491,"Title":"Average Salary Excluding the Minimum and Maximum Salary","TitleZH":"去掉最低工资和最高工资后的工资平均值","TitleSlug":"average-salary-excluding-the-minimum-and-maximum-salary","ContestSlug":"biweekly-contest-29","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 29","ContestID_zh":"第 29 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1200.9464053417,"ID":2319,"Title":"Check if Matrix Is X-Matrix","TitleZH":"判断矩阵是否是一个 X 矩阵","TitleSlug":"check-if-matrix-is-x-matrix","ContestSlug":"weekly-contest-299","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 299","ContestID_zh":"第 299 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1199.8592887103,"ID":2169,"Title":"Count Operations to Obtain Zero","TitleZH":"得到 0 的操作数","TitleSlug":"count-operations-to-obtain-zero","ContestSlug":"weekly-contest-280","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 280","ContestID_zh":"第 280 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1199.4477805501,"ID":2000,"Title":"Reverse Prefix of Word","TitleZH":"反转单词前缀","TitleSlug":"reverse-prefix-of-word","ContestSlug":"weekly-contest-258","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 258","ContestID_zh":"第 258 场周赛","topicTags":[{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"}]},{"Rating":1199.4427635582,"ID":1154,"Title":"Day of the Year","TitleZH":"一年中的第几天","TitleSlug":"day-of-the-year","ContestSlug":"weekly-contest-149","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 149","ContestID_zh":"第 149 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"String","slug":"string"}]},{"Rating":1199.2892732505,"ID":929,"Title":"Unique Email Addresses","TitleZH":"独特的电子邮件地址","TitleSlug":"unique-email-addresses","ContestSlug":"weekly-contest-108","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 108","ContestID_zh":"第 108 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1199.2392672964,"ID":1165,"Title":"Single-Row Keyboard","TitleZH":"单行键盘","TitleSlug":"single-row-keyboard","ContestSlug":"biweekly-contest-7","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 7","ContestID_zh":"第 7 场双周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1198.5705825982,"ID":1200,"Title":"Minimum Absolute Difference","TitleZH":"最小绝对差","TitleSlug":"minimum-absolute-difference","ContestSlug":"weekly-contest-155","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 155","ContestID_zh":"第 155 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1198.4180401014,"ID":985,"Title":"Sum of Even Numbers After Queries","TitleZH":"查询后的偶数和","TitleSlug":"sum-of-even-numbers-after-queries","ContestSlug":"weekly-contest-122","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 122","ContestID_zh":"第 122 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1195.7512695571,"ID":1207,"Title":"Unique Number of Occurrences","TitleZH":"独一无二的出现次数","TitleSlug":"unique-number-of-occurrences","ContestSlug":"weekly-contest-156","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 156","ContestID_zh":"第 156 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"}]},{"Rating":1193.9819783429,"ID":1323,"Title":"Maximum 69 Number","TitleZH":"6 和 9 组成的最大数字","TitleSlug":"maximum-69-number","ContestSlug":"weekly-contest-172","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 172","ContestID_zh":"第 172 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Greedy","slug":"greedy"}]},{"Rating":1193.2687290573,"ID":1437,"Title":"Check If All 1's Are at Least Length K Places Away","TitleZH":"是否所有 1 都至少相隔 k 个元素","TitleSlug":"check-if-all-1s-are-at-least-length-k-places-away","ContestSlug":"weekly-contest-187","ProblemIndex":"Q2","ContestID_en":"Weekly Contest 187","ContestID_zh":"第 187 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1193.1328299324,"ID":1528,"Title":"Shuffle String","TitleZH":"重新排列字符串","TitleSlug":"shuffle-string","ContestSlug":"weekly-contest-199","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 199","ContestID_zh":"第 199 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"}]},{"Rating":1193.0585534828,"ID":2418,"Title":"Sort the People","TitleZH":"按身高排序","TitleSlug":"sort-the-people","ContestSlug":"weekly-contest-312","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 312","ContestID_zh":"第 312 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1192.3167969426,"ID":1436,"Title":"Destination City","TitleZH":"旅行终点站","TitleSlug":"destination-city","ContestSlug":"weekly-contest-187","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 187","ContestID_zh":"第 187 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1188.6470369782,"ID":747,"Title":"Largest Number At Least Twice of Others","TitleZH":"至少是其他数字两倍的最大数","TitleSlug":"largest-number-at-least-twice-of-others","ContestSlug":"weekly-contest-64","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 64","ContestID_zh":"第 64 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1188.6311093158,"ID":1122,"Title":"Relative Sort Array","TitleZH":"数组的相对排序","TitleSlug":"relative-sort-array","ContestSlug":"weekly-contest-145","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 145","ContestID_zh":"第 145 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Sorting","slug":"sorting"},{"name":"Counting Sort","slug":"counting-sort"}]},{"Rating":1187.1641565458,"ID":1880,"Title":"Check if Word Equals Summation of Two Words","TitleZH":"检查某单词是否等于两单词之和","TitleSlug":"check-if-word-equals-summation-of-two-words","ContestSlug":"weekly-contest-243","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 243","ContestID_zh":"第 243 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1187.1344261572,"ID":2119,"Title":"A Number After a Double Reversal","TitleZH":"反转两次的数字","TitleSlug":"a-number-after-a-double-reversal","ContestSlug":"weekly-contest-273","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 273","ContestID_zh":"第 273 场周赛","topicTags":[{"name":"Math","slug":"math"}]},{"Rating":1184.795721284,"ID":2341,"Title":"Maximum Number of Pairs in Array","TitleZH":"数组能形成多少数对","TitleSlug":"maximum-number-of-pairs-in-array","ContestSlug":"weekly-contest-302","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 302","ContestID_zh":"第 302 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Counting","slug":"counting"}]},{"Rating":1184.4264833435,"ID":1979,"Title":"Find Greatest Common Divisor of Array","TitleZH":"找出数组的最大公约数","TitleSlug":"find-greatest-common-divisor-of-array","ContestSlug":"weekly-contest-255","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 255","ContestID_zh":"第 255 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"},{"name":"Number Theory","slug":"number-theory"}]},{"Rating":1182.6489068544,"ID":1672,"Title":"Richest Customer Wealth","TitleZH":"最富有客户的资产总量","TitleSlug":"richest-customer-wealth","ContestSlug":"weekly-contest-217","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 217","ContestID_zh":"第 217 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1181.9716216714,"ID":1189,"Title":"Maximum Number of Balloons","TitleZH":"“气球” 的最大数量","TitleSlug":"maximum-number-of-balloons","ContestSlug":"weekly-contest-154","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 154","ContestID_zh":"第 154 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Counting","slug":"counting"}]},{"Rating":1181.5839867359,"ID":852,"Title":"Peak Index in a Mountain Array","TitleZH":"山脉数组的峰顶索引","TitleSlug":"peak-index-in-a-mountain-array","ContestSlug":"weekly-contest-89","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 89","ContestID_zh":"第 89 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"}]},{"Rating":1180.923623906,"ID":1486,"Title":"XOR Operation in an Array","TitleZH":"数组异或操作","TitleSlug":"xor-operation-in-an-array","ContestSlug":"weekly-contest-194","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 194","ContestID_zh":"第 194 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":1180.3543157775,"ID":1441,"Title":"Build an Array With Stack Operations","TitleZH":"用栈操作构建数组","TitleSlug":"build-an-array-with-stack-operations","ContestSlug":"weekly-contest-188","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 188","ContestID_zh":"第 188 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Stack","slug":"stack"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1179.1495967491,"ID":1287,"Title":"Element Appearing More Than 25% In Sorted Array","TitleZH":"有序数组中出现次数超过25%的元素","TitleSlug":"element-appearing-more-than-25-in-sorted-array","ContestSlug":"biweekly-contest-15","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 15","ContestID_zh":"第 15 场双周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1178.4942541235,"ID":905,"Title":"Sort Array By Parity","TitleZH":"按奇偶排序数组","TitleSlug":"sort-array-by-parity","ContestSlug":"weekly-contest-102","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 102","ContestID_zh":"第 102 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1177.5660617941,"ID":965,"Title":"Univalued Binary Tree","TitleZH":"单值二叉树","TitleSlug":"univalued-binary-tree","ContestSlug":"weekly-contest-117","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 117","ContestID_zh":"第 117 场周赛","topicTags":[{"name":"Tree","slug":"tree"},{"name":"Depth-First Search","slug":"depth-first-search"},{"name":"Breadth-First Search","slug":"breadth-first-search"},{"name":"Binary Tree","slug":"binary-tree"}]},{"Rating":1176.4547272896,"ID":1431,"Title":"Kids With the Greatest Number of Candies","TitleZH":"拥有最多糖果的孩子","TitleSlug":"kids-with-the-greatest-number-of-candies","ContestSlug":"biweekly-contest-25","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 25","ContestID_zh":"第 25 场双周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1174.8589329736,"ID":1773,"Title":"Count Items Matching a Rule","TitleZH":"统计匹配检索规则的物品数量","TitleSlug":"count-items-matching-a-rule","ContestSlug":"weekly-contest-230","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 230","ContestID_zh":"第 230 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"}]},{"Rating":1173.505926482,"ID":922,"Title":"Sort Array By Parity II","TitleZH":"按奇偶排序数组 II","TitleSlug":"sort-array-by-parity-ii","ContestSlug":"weekly-contest-106","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 106","ContestID_zh":"第 106 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1172.6819789183,"ID":1046,"Title":"Last Stone Weight","TitleZH":"最后一块石头的重量","TitleSlug":"last-stone-weight","ContestSlug":"weekly-contest-137","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 137","ContestID_zh":"第 137 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1172.5106645463,"ID":760,"Title":"Find Anagram Mappings","TitleZH":"找出变位映射","TitleSlug":"find-anagram-mappings","ContestSlug":"weekly-contest-66","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 66","ContestID_zh":"第 66 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"}]},{"Rating":1172.0548998046,"ID":2427,"Title":"Number of Common Factors","TitleZH":"公因子的数目","TitleSlug":"number-of-common-factors","ContestSlug":"weekly-contest-313","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 313","ContestID_zh":"第 313 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Enumeration","slug":"enumeration"},{"name":"Number Theory","slug":"number-theory"}]},{"Rating":1167.8737144048,"ID":2057,"Title":"Smallest Index With Equal Value","TitleZH":"值相等的最小索引","TitleSlug":"smallest-index-with-equal-value","ContestSlug":"weekly-contest-265","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 265","ContestID_zh":"第 265 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1167.647122501,"ID":2441,"Title":"Largest Positive Integer That Exists With Its Negative","TitleZH":"与对应负数同时存在的最大正整数","TitleSlug":"largest-positive-integer-that-exists-with-its-negative","ContestSlug":"weekly-contest-315","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 315","ContestID_zh":"第 315 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"}]},{"Rating":1167.1331831913,"ID":1304,"Title":"Find N Unique Integers Sum up to Zero","TitleZH":"和为零的N个唯一整数","TitleSlug":"find-n-unique-integers-sum-up-to-zero","ContestSlug":"weekly-contest-169","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 169","ContestID_zh":"第 169 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"}]},{"Rating":1167.1241589729,"ID":2185,"Title":"Counting Words With a Given Prefix","TitleZH":"统计包含给定前缀的字符串","TitleSlug":"counting-words-with-a-given-prefix","ContestSlug":"weekly-contest-282","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 282","ContestID_zh":"第 282 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"}]},{"Rating":1167.0749837258,"ID":796,"Title":"Rotate String","TitleZH":"旋转字符串","TitleSlug":"rotate-string","ContestSlug":"weekly-contest-75","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 75","ContestID_zh":"第 75 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"String Matching","slug":"string-matching"}]},{"Rating":1166.78818332,"ID":1832,"Title":"Check if the Sentence Is Pangram","TitleZH":"判断句子是否为全字母句","TitleSlug":"check-if-the-sentence-is-pangram","ContestSlug":"weekly-contest-237","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 237","ContestID_zh":"第 237 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1166.5264284193,"ID":1768,"Title":"Merge Strings Alternately","TitleZH":"交替合并字符串","TitleSlug":"merge-strings-alternately","ContestSlug":"weekly-contest-229","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 229","ContestID_zh":"第 229 场周赛","topicTags":[{"name":"Two Pointers","slug":"two-pointers"},{"name":"String","slug":"string"}]},{"Rating":1165.4768151611,"ID":1446,"Title":"Consecutive Characters","TitleZH":"连续字符","TitleSlug":"consecutive-characters","ContestSlug":"biweekly-contest-26","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 26","ContestID_zh":"第 26 场双周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1165.2135167215,"ID":2011,"Title":"Final Value of Variable After Performing Operations","TitleZH":"执行操作后的变量值","TitleSlug":"final-value-of-variable-after-performing-operations","ContestSlug":"weekly-contest-259","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 259","ContestID_zh":"第 259 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"String","slug":"string"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1164.8182315157,"ID":771,"Title":"Jewels and Stones","TitleZH":"宝石与石头","TitleSlug":"jewels-and-stones","ContestSlug":"weekly-contest-69","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 69","ContestID_zh":"第 69 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"}]},{"Rating":1164.0227691933,"ID":1374,"Title":"Generate a String With Characters That Have Odd Counts","TitleZH":"生成每种字符都是奇数个的字符串","TitleSlug":"generate-a-string-with-characters-that-have-odd-counts","ContestSlug":"weekly-contest-179","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 179","ContestID_zh":"第 179 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1163.6047095526,"ID":1342,"Title":"Number of Steps to Reduce a Number to Zero","TitleZH":"将数字变成 0 的操作次数","TitleSlug":"number-of-steps-to-reduce-a-number-to-zero","ContestSlug":"biweekly-contest-19","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 19","ContestID_zh":"第 19 场双周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Bit Manipulation","slug":"bit-manipulation"}]},{"Rating":1161.8236318927,"ID":2278,"Title":"Percentage of Letter in String","TitleZH":"字母在字符串中的百分比","TitleSlug":"percentage-of-letter-in-string","ContestSlug":"weekly-contest-294","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 294","ContestID_zh":"第 294 场周赛","topicTags":[{"name":"String","slug":"string"}]},{"Rating":1161.6227767245,"ID":961,"Title":"N-Repeated Element in Size 2N Array","TitleZH":"重复 N 次的元素","TitleSlug":"n-repeated-element-in-size-2n-array","ContestSlug":"weekly-contest-116","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 116","ContestID_zh":"第 116 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"}]},{"Rating":1160.8899403409,"ID":1512,"Title":"Number of Good Pairs","TitleZH":"好数对的数目","TitleSlug":"number-of-good-pairs","ContestSlug":"weekly-contest-197","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 197","ContestID_zh":"第 197 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Math","slug":"math"},{"name":"Counting","slug":"counting"}]},{"Rating":1160.4439395369,"ID":1920,"Title":"Build Array from Permutation","TitleZH":"基于排列构建数组","TitleSlug":"build-array-from-permutation","ContestSlug":"weekly-contest-248","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 248","ContestID_zh":"第 248 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Simulation","slug":"simulation"}]},{"Rating":1155.4545579447,"ID":2351,"Title":"First Letter to Appear Twice","TitleZH":"第一个出现两次的字母","TitleSlug":"first-letter-to-appear-twice","ContestSlug":"weekly-contest-303","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 303","ContestID_zh":"第 303 场周赛","topicTags":[{"name":"Hash Table","slug":"hash-table"},{"name":"String","slug":"string"},{"name":"Counting","slug":"counting"}]},{"Rating":1154.828067979,"ID":1502,"Title":"Can Make Arithmetic Progression From Sequence","TitleZH":"判断能否形成等差数列","TitleSlug":"can-make-arithmetic-progression-from-sequence","ContestSlug":"weekly-contest-196","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 196","ContestID_zh":"第 196 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1153.427255962,"ID":2469,"Title":"Convert the Temperature","TitleZH":"温度转换","TitleSlug":"convert-the-temperature","ContestSlug":"weekly-contest-319","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 319","ContestID_zh":"第 319 场周赛","topicTags":[{"name":"Math","slug":"math"}]},{"Rating":1152.1494742874,"ID":2089,"Title":"Find Target Indices After Sorting Array","TitleZH":"找出数组排序后的目标下标","TitleSlug":"find-target-indices-after-sorting-array","ContestSlug":"weekly-contest-269","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 269","ContestID_zh":"第 269 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1152.1377893605,"ID":1365,"Title":"How Many Numbers Are Smaller Than the Current Number","TitleZH":"有多少小于当前数字的数字","TitleSlug":"how-many-numbers-are-smaller-than-the-current-number","ContestSlug":"weekly-contest-178","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 178","ContestID_zh":"第 178 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Sorting","slug":"sorting"},{"name":"Counting","slug":"counting"}]},{"Rating":1151.5250329621,"ID":1460,"Title":"Make Two Arrays Equal by Reversing Sub-arrays","TitleZH":"通过翻转子数组使两个数组相等","TitleSlug":"make-two-arrays-equal-by-reversing-subarrays","ContestSlug":"biweekly-contest-27","ProblemIndex":"Q1","ContestID_en":"Biweekly Contest 27","ContestID_zh":"第 27 场双周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1151.3534799042,"ID":1290,"Title":"Convert Binary Number in a Linked List to Integer","TitleZH":"二进制链表转整数","TitleSlug":"convert-binary-number-in-a-linked-list-to-integer","ContestSlug":"weekly-contest-167","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 167","ContestID_zh":"第 167 场周赛","topicTags":[{"name":"Linked List","slug":"linked-list"},{"name":"Math","slug":"math"}]},{"Rating":1151.2537511408,"ID":2455,"Title":"Average Value of Even Numbers That Are Divisible by Three","TitleZH":"可被三整除的偶数的平均值","TitleSlug":"average-value-of-even-numbers-that-are-divisible-by-three","ContestSlug":"weekly-contest-317","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 317","ContestID_zh":"第 317 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Math","slug":"math"}]},{"Rating":1144.9508874557,"ID":2413,"Title":"Smallest Even Multiple","TitleZH":"最小偶倍数","TitleSlug":"smallest-even-multiple","ContestSlug":"weekly-contest-311","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 311","ContestID_zh":"第 311 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Number Theory","slug":"number-theory"}]},{"Rating":1144.6237559885,"ID":1913,"Title":"Maximum Product Difference Between Two Pairs","TitleZH":"两个数对之间的最大乘积差","TitleSlug":"maximum-product-difference-between-two-pairs","ContestSlug":"weekly-contest-247","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 247","ContestID_zh":"第 247 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1142.8650731632,"ID":1137,"Title":"N-th Tribonacci Number","TitleZH":"第 N 个泰波那契数","TitleSlug":"n-th-tribonacci-number","ContestSlug":"weekly-contest-147","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 147","ContestID_zh":"第 147 场周赛","topicTags":[{"name":"Math","slug":"math"},{"name":"Dynamic Programming","slug":"dynamic-programming"},{"name":"Memoization","slug":"memoization"}]},{"Rating":1141.2363999461,"ID":1281,"Title":"Subtract the Product and Sum of Digits of an Integer","TitleZH":"整数的各位积和之差","TitleSlug":"subtract-the-product-and-sum-of-digits-of-an-integer","ContestSlug":"weekly-contest-166","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 166","ContestID_zh":"第 166 场周赛","topicTags":[{"name":"Math","slug":"math"}]},{"Rating":1139.6630206282,"ID":1295,"Title":"Find Numbers with Even Number of Digits","TitleZH":"统计位数为偶数的数字","TitleSlug":"find-numbers-with-even-number-of-digits","ContestSlug":"weekly-contest-168","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 168","ContestID_zh":"第 168 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1139.4248492279,"ID":1351,"Title":"Count Negative Numbers in a Sorted Matrix","TitleZH":"统计有序矩阵中的负数","TitleSlug":"count-negative-numbers-in-a-sorted-matrix","ContestSlug":"weekly-contest-176","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 176","ContestID_zh":"第 176 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Binary Search","slug":"binary-search"},{"name":"Matrix","slug":"matrix"}]},{"Rating":1132.6812943289,"ID":1929,"Title":"Concatenation of Array","TitleZH":"数组串联","TitleSlug":"concatenation-of-array","ContestSlug":"weekly-contest-249","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 249","ContestID_zh":"第 249 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1129.949090232,"ID":977,"Title":"Squares of a Sorted Array","TitleZH":"有序数组的平方","TitleSlug":"squares-of-a-sorted-array","ContestSlug":"weekly-contest-120","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 120","ContestID_zh":"第 120 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Two Pointers","slug":"two-pointers"},{"name":"Sorting","slug":"sorting"}]},{"Rating":1129.3432988996,"ID":1450,"Title":"Number of Students Doing Homework at a Given Time","TitleZH":"在既定时间做作业的学生人数","TitleSlug":"number-of-students-doing-homework-at-a-given-time","ContestSlug":"weekly-contest-189","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 189","ContestID_zh":"第 189 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1125.575238274,"ID":1455,"Title":"Check If a Word Occurs As a Prefix of Any Word in a Sentence","TitleZH":"检查单词是否为句中其他单词的前缀","TitleSlug":"check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence","ContestSlug":"weekly-contest-190","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 190","ContestID_zh":"第 190 场周赛","topicTags":[{"name":"String","slug":"string"},{"name":"String Matching","slug":"string-matching"}]},{"Rating":1121.0677596555,"ID":1464,"Title":"Maximum Product of Two Elements in an Array","TitleZH":"数组中两元素的最大乘积","TitleSlug":"maximum-product-of-two-elements-in-an-array","ContestSlug":"weekly-contest-191","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 191","ContestID_zh":"第 191 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Sorting","slug":"sorting"},{"name":"Heap (Priority Queue)","slug":"heap-priority-queue"}]},{"Rating":1120.698183624,"ID":1470,"Title":"Shuffle the Array","TitleZH":"重新排列数组","TitleSlug":"shuffle-the-array","ContestSlug":"weekly-contest-192","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 192","ContestID_zh":"第 192 场周赛","topicTags":[{"name":"Array","slug":"array"}]},{"Rating":1118.1080334618,"ID":1394,"Title":"Find Lucky Integer in an Array","TitleZH":"找出数组中的幸运数","TitleSlug":"find-lucky-integer-in-an-array","ContestSlug":"weekly-contest-182","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 182","ContestID_zh":"第 182 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Hash Table","slug":"hash-table"},{"name":"Counting","slug":"counting"}]},{"Rating":1104.7359028407,"ID":1480,"Title":"Running Sum of 1d Array","TitleZH":"一维数组的动态和","TitleSlug":"running-sum-of-1d-array","ContestSlug":"weekly-contest-193","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 193","ContestID_zh":"第 193 场周赛","topicTags":[{"name":"Array","slug":"array"},{"name":"Prefix Sum","slug":"prefix-sum"}]},{"Rating":1084.1319467318,"ID":1108,"Title":"Defanging an IP Address","TitleZH":"IP 地址无效化","TitleSlug":"defanging-an-ip-address","ContestSlug":"weekly-contest-144","ProblemIndex":"Q1","ContestID_en":"Weekly Contest 144","ContestID_zh":"第 144 场周赛","topicTags":[{"name":"String","slug":"string"}]}]
\ No newline at end of file
diff --git a/retrieveTopicTag.js b/retrieveTopicTag.js
new file mode 100644
index 0000000..c309311
--- /dev/null
+++ b/retrieveTopicTag.js
@@ -0,0 +1,29 @@
+const data = require("./data.json");
+const axios = require("axios");
+const fs = require("fs");
+
+const delay = async (ms = 1000) => new Promise((r) => setTimeout(r, ms));
+(async function () {
+  console.log("START");
+  let delayTime = 0; // 延時請求，防止對方 server 出現 code 429 (請求過於頻繁)
+  const result = await Promise.all(
+    data.map(async (datum, i) => {
+      delayTime += 1000;
+      await delay(delayTime);
+      const res = await axios.post("https://leetcode.com/graphql/", {
+        query:
+          "\n    query singleQuestionTopicTags($titleSlug: String!) {\n  question(titleSlug: $titleSlug) {\n    topicTags {\n      name\n      slug\n    }\n  }\n}\n    ",
+        variables: {
+          titleSlug: datum.TitleSlug,
+        },
+      });
+      const topicTags = res?.data?.data?.question?.topicTags || [];
+      console.log(`Finished ${i + 1} request`);
+      return { ...datum, topicTags };
+    })
+  );
+  fs.writeFile("/public/localData.json", JSON.stringify(result), function (err) {
+    if (err) return console.log(err);
+    console.log("DONE");
+  });
+})();
diff --git a/src/locale/en.ts b/src/locale/en.ts
index d4af355..9ffc858 100644
--- a/src/locale/en.ts
+++ b/src/locale/en.ts
@@ -5,6 +5,7 @@ export default {
   placeholder: "type a keyword",
   contestNumber: "Contest number",
   ratingInterval: "Rating interval",
+  topicTags: "Topic Tags",
   asc: "Asc",
   desc: "Desc",
   query: "Query",
diff --git a/src/locale/zh.ts b/src/locale/zh.ts
index a7b6b4e..2158112 100644
--- a/src/locale/zh.ts
+++ b/src/locale/zh.ts
@@ -5,6 +5,7 @@ export default {
   placeholder: "输入关键词",
   contestNumber: "竞赛编号",
   ratingInterval: "分数区间",
+  topicTags: "題目分類",
   asc: "升序",
   desc: "降序",
   query: "查询",
diff --git a/src/views/ProblemRating.vue b/src/views/ProblemRating.vue
index f373ec4..df87b5f 100644
--- a/src/views/ProblemRating.vue
+++ b/src/views/ProblemRating.vue
@@ -75,6 +75,15 @@
         @sort-change="sortChange"
       >
         <el-table-column prop="ID" label="ID" width="180" sortable="custom" />
+        <el-table-column prop="topicTags" :label="$t('topicTags')" width="300">
+          <template #default="{ row: { topicTags } }">
+            <template v-for="topicTag in topicTags" :key="topicTag.slug">
+              <label class="topicTag">
+                {{ topicTag.name }}
+              </label>
+            </template>
+          </template>
+        </el-table-column>
         <el-table-column :label="$t('problemName')">
           <template #default="scope">
             <el-link
@@ -129,7 +138,7 @@ import axios, { AxiosResponse } from "axios";
 import { ElMessage } from "element-plus";
 import { useI18n } from "vue-i18n";
 
-const url = "./data.json";
+const url = "./localData.json";
 
 interface Problem {
   ContestID_en: string;
@@ -145,6 +154,7 @@ interface Problem {
   ProblemHrefEN: string | null;
   ContestHrefEN: string | null;
   ContestHrefZH: string | null;
+  topicTags: string[];
 }
 interface SortInfo {
   prop: "Rating" | "ID";
@@ -304,4 +314,11 @@ function reset() {
   display: flex;
   justify-content: right;
 }
+
+.topicTag {
+  margin-right: 8px;
+  padding: 4px;
+  border-radius: 4px;
+  background-color: blanchedalmond;
+}
 </style>
diff --git a/vue.config.js b/vue.config.js
index bd72894..0156a87 100644
--- a/vue.config.js
+++ b/vue.config.js
@@ -9,6 +9,10 @@ module.exports = defineConfig({
         target: "https://zerotrac.github.io/leetcode_problem_rating",
         secure: false,
       },
+      "/localData.json": {
+        target: "/",
+        secure: false,
+      },
     },
   },
   chainWebpack(config) {