From ed5c92e00ebd10ac1e35bbf6372f8cd6134d938b Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E7=A8=8B=E5=BA=8F=E5=91=98=E5=B0=8F=E5=A2=A8?= <2291200076@qq.com> Date: Fri, 22 Mar 2024 16:17:08 +0800 Subject: [PATCH] update --- leetcode-cn/origin-data.json | 18770 ++++++++-------- .../[no content]find-trending-hashtags.json | 56 + ...o content]make-string-anti-palindrome.json | 49 + ...ch-alphanumerical-pattern-in-matrix-i.json | 73 + ...tent]maximum-increasing-triplet-value.json | 65 + .../apple-redistribution-into-boxes.json | 183 + ...le-servers-in-a-weighted-tree-network.json | 183 + ...-top-left-element-and-sum-less-than-k.json | 180 + ...rting-and-ending-with-given-character.json | 184 + ...distribute-elements-into-two-arrays-i.json | 176 + ...istribute-elements-into-two-arrays-ii.json | 189 + ...substring-in-a-string-and-its-reverse.json | 177 + .../find-the-maximum-sum-of-node-values.json | 203 + .../find-the-sum-of-encrypted-integers.json | 176 + ...-sum-of-the-power-of-all-subsequences.json | 178 + ...ements-on-array-by-performing-queries.json | 195 + ...ximize-happiness-of-selected-children.json | 184 + ...imum-strength-of-k-disjoint-subarrays.json | 186 + ...um-deletions-to-make-string-k-special.json | 197 + .../minimum-moves-to-pick-k-ones.json | 190 + ...perations-to-exceed-threshold-value-i.json | 170 + ...erations-to-exceed-threshold-value-ii.json | 183 + ...tions-to-write-the-letter-y-on-a-grid.json | 186 + ...marks-in-string-to-minimize-its-value.json | 203 + ...ortest-uncommon-substring-in-an-array.json | 189 + ...量值 [maximum-strength-of-k-disjoint-subarrays].html | 47 + ...matrices-with-top-left-element-and-sum-less-than-k].html | 32 + ...airs-of-connectable-servers-in-a-weighted-tree-network].html | 52 + ... [minimum-operations-to-write-the-letter-y-on-a-grid].html | 50 + ... [existence-of-a-substring-in-a-string-and-its-reverse].html | 44 + ...组中 I [distribute-elements-into-two-arrays-i].html | 46 + ...中 II [distribute-elements-into-two-arrays-ii].html | 61 + ...方案 [maximize-happiness-of-selected-children].html | 51 + ...字符数 [minimum-deletions-to-make-string-k-special].html | 49 + ... [mark-elements-on-array-by-performing-queries].html | 57 + ...最少行动次数 [minimum-moves-to-pick-k-ones].html | 60 + ...符串 [shortest-uncommon-substring-in-an-array].html | 45 + ...ace-question-marks-in-string-to-minimize-its-value].html | 61 + ...之和 [find-the-maximum-sum-of-node-values].html | 67 + ...的和 [find-the-sum-of-encrypted-integers].html | 34 + ... [find-the-sum-of-the-power-of-all-subsequences].html | 71 + ...unt-substrings-starting-and-ending-with-given-character].html | 32 + ...minimum-operations-to-exceed-threshold-value-i].html | 45 + ...inimum-operations-to-exceed-threshold-value-ii].html | 49 + ...装苹果 [apple-redistribution-into-boxes].html | 37 + ...nglish) [maximum-strength-of-k-disjoint-subarrays].html | 45 + ...matrices-with-top-left-element-and-sum-less-than-k].html | 30 + ...airs-of-connectable-servers-in-a-weighted-tree-network].html | 46 + ...) [minimum-operations-to-write-the-letter-y-on-a-grid].html | 47 + ... [existence-of-a-substring-in-a-string-and-its-reverse].html | 42 + ...English) [distribute-elements-into-two-arrays-i].html | 44 + ...nglish) [distribute-elements-into-two-arrays-ii].html | 59 + ...glish) [maximize-happiness-of-selected-children].html | 49 + ...(English) [minimum-deletions-to-make-string-k-special].html | 47 + ...h) [mark-elements-on-array-by-performing-queries].html | 55 + ...动次数(English) [minimum-moves-to-pick-k-ones].html | 58 + ...English) [shortest-uncommon-substring-in-an-array].html | 43 + ...ace-question-marks-in-string-to-minimize-its-value].html | 59 + ...nglish) [find-the-maximum-sum-of-node-values].html | 59 + ...English) [find-the-sum-of-encrypted-integers].html | 32 + ... [find-the-sum-of-the-power-of-all-subsequences].html | 69 + ...unt-substrings-starting-and-ending-with-given-character].html | 30 + ...minimum-operations-to-exceed-threshold-value-i].html | 43 + ...inimum-operations-to-exceed-threshold-value-ii].html | 47 + ...(English) [apple-redistribution-into-boxes].html | 35 + 65 files changed, 15521 insertions(+), 9133 deletions(-) create mode 100644 leetcode-cn/originData/[no content]find-trending-hashtags.json create mode 100644 leetcode-cn/originData/[no content]make-string-anti-palindrome.json create mode 100644 leetcode-cn/originData/[no content]match-alphanumerical-pattern-in-matrix-i.json create mode 100644 leetcode-cn/originData/[no content]maximum-increasing-triplet-value.json create mode 100644 leetcode-cn/originData/apple-redistribution-into-boxes.json create mode 100644 leetcode-cn/originData/count-pairs-of-connectable-servers-in-a-weighted-tree-network.json create mode 100644 leetcode-cn/originData/count-submatrices-with-top-left-element-and-sum-less-than-k.json create mode 100644 leetcode-cn/originData/count-substrings-starting-and-ending-with-given-character.json create mode 100644 leetcode-cn/originData/distribute-elements-into-two-arrays-i.json create mode 100644 leetcode-cn/originData/distribute-elements-into-two-arrays-ii.json create mode 100644 leetcode-cn/originData/existence-of-a-substring-in-a-string-and-its-reverse.json create mode 100644 leetcode-cn/originData/find-the-maximum-sum-of-node-values.json create mode 100644 leetcode-cn/originData/find-the-sum-of-encrypted-integers.json create mode 100644 leetcode-cn/originData/find-the-sum-of-the-power-of-all-subsequences.json create mode 100644 leetcode-cn/originData/mark-elements-on-array-by-performing-queries.json create mode 100644 leetcode-cn/originData/maximize-happiness-of-selected-children.json create mode 100644 leetcode-cn/originData/maximum-strength-of-k-disjoint-subarrays.json create mode 100644 leetcode-cn/originData/minimum-deletions-to-make-string-k-special.json create mode 100644 leetcode-cn/originData/minimum-moves-to-pick-k-ones.json create mode 100644 leetcode-cn/originData/minimum-operations-to-exceed-threshold-value-i.json create mode 100644 leetcode-cn/originData/minimum-operations-to-exceed-threshold-value-ii.json create mode 100644 leetcode-cn/originData/minimum-operations-to-write-the-letter-y-on-a-grid.json create mode 100644 leetcode-cn/originData/replace-question-marks-in-string-to-minimize-its-value.json create mode 100644 leetcode-cn/originData/shortest-uncommon-substring-in-an-array.json create mode 100644 leetcode-cn/problem (Chinese)/K 个不相交子数组的最大能量值 [maximum-strength-of-k-disjoint-subarrays].html create mode 100644 leetcode-cn/problem (Chinese)/元素和小于等于 k 的子矩阵的数目 [count-submatrices-with-top-left-element-and-sum-less-than-k].html create mode 100644 leetcode-cn/problem (Chinese)/在带权树网络中统计可连接服务器对数目 [count-pairs-of-connectable-servers-in-a-weighted-tree-network].html create mode 100644 leetcode-cn/problem (Chinese)/在矩阵上写出字母 Y 所需的最少操作次数 [minimum-operations-to-write-the-letter-y-on-a-grid].html create mode 100644 leetcode-cn/problem (Chinese)/字符串及其反转中是否存在同一子字符串 [existence-of-a-substring-in-a-string-and-its-reverse].html create mode 100644 leetcode-cn/problem (Chinese)/将元素分配到两个数组中 I [distribute-elements-into-two-arrays-i].html create mode 100644 leetcode-cn/problem (Chinese)/将元素分配到两个数组中 II [distribute-elements-into-two-arrays-ii].html create mode 100644 leetcode-cn/problem (Chinese)/幸福值最大化的选择方案 [maximize-happiness-of-selected-children].html create mode 100644 leetcode-cn/problem (Chinese)/成为 K 特殊字符串需要删除的最少字符数 [minimum-deletions-to-make-string-k-special].html create mode 100644 leetcode-cn/problem (Chinese)/执行操作标记数组中的元素 [mark-elements-on-array-by-performing-queries].html create mode 100644 leetcode-cn/problem (Chinese)/拾起 K 个 1 需要的最少行动次数 [minimum-moves-to-pick-k-ones].html create mode 100644 leetcode-cn/problem (Chinese)/数组中的最短非公共子字符串 [shortest-uncommon-substring-in-an-array].html create mode 100644 leetcode-cn/problem (Chinese)/替换字符串中的问号使分数最小 [replace-question-marks-in-string-to-minimize-its-value].html create mode 100644 leetcode-cn/problem (Chinese)/最大节点价值之和 [find-the-maximum-sum-of-node-values].html create mode 100644 leetcode-cn/problem (Chinese)/求出加密整数的和 [find-the-sum-of-encrypted-integers].html create mode 100644 leetcode-cn/problem (Chinese)/求出所有子序列的能量和 [find-the-sum-of-the-power-of-all-subsequences].html create mode 100644 leetcode-cn/problem (Chinese)/统计以给定字符开头和结尾的子字符串总数 [count-substrings-starting-and-ending-with-given-character].html create mode 100644 leetcode-cn/problem (Chinese)/超过阈值的最少操作数 I [minimum-operations-to-exceed-threshold-value-i].html create mode 100644 leetcode-cn/problem (Chinese)/超过阈值的最少操作数 II [minimum-operations-to-exceed-threshold-value-ii].html create mode 100644 leetcode-cn/problem (Chinese)/重新分装苹果 [apple-redistribution-into-boxes].html create mode 100644 leetcode-cn/problem (English)/K 个不相交子数组的最大能量值(English) [maximum-strength-of-k-disjoint-subarrays].html create mode 100644 leetcode-cn/problem (English)/元素和小于等于 k 的子矩阵的数目(English) [count-submatrices-with-top-left-element-and-sum-less-than-k].html create mode 100644 leetcode-cn/problem (English)/在带权树网络中统计可连接服务器对数目(English) [count-pairs-of-connectable-servers-in-a-weighted-tree-network].html create mode 100644 leetcode-cn/problem (English)/在矩阵上写出字母 Y 所需的最少操作次数(English) [minimum-operations-to-write-the-letter-y-on-a-grid].html create mode 100644 leetcode-cn/problem (English)/字符串及其反转中是否存在同一子字符串(English) [existence-of-a-substring-in-a-string-and-its-reverse].html create mode 100644 leetcode-cn/problem (English)/将元素分配到两个数组中 I(English) [distribute-elements-into-two-arrays-i].html create mode 100644 leetcode-cn/problem (English)/将元素分配到两个数组中 II(English) [distribute-elements-into-two-arrays-ii].html create mode 100644 leetcode-cn/problem (English)/幸福值最大化的选择方案(English) [maximize-happiness-of-selected-children].html create mode 100644 leetcode-cn/problem (English)/成为 K 特殊字符串需要删除的最少字符数(English) [minimum-deletions-to-make-string-k-special].html create mode 100644 leetcode-cn/problem (English)/执行操作标记数组中的元素(English) [mark-elements-on-array-by-performing-queries].html create mode 100644 leetcode-cn/problem (English)/拾起 K 个 1 需要的最少行动次数(English) [minimum-moves-to-pick-k-ones].html create mode 100644 leetcode-cn/problem (English)/数组中的最短非公共子字符串(English) [shortest-uncommon-substring-in-an-array].html create mode 100644 leetcode-cn/problem (English)/替换字符串中的问号使分数最小(English) [replace-question-marks-in-string-to-minimize-its-value].html create mode 100644 leetcode-cn/problem (English)/最大节点价值之和(English) [find-the-maximum-sum-of-node-values].html create mode 100644 leetcode-cn/problem (English)/求出加密整数的和(English) [find-the-sum-of-encrypted-integers].html create mode 100644 leetcode-cn/problem (English)/求出所有子序列的能量和(English) [find-the-sum-of-the-power-of-all-subsequences].html create mode 100644 leetcode-cn/problem (English)/统计以给定字符开头和结尾的子字符串总数(English) [count-substrings-starting-and-ending-with-given-character].html create mode 100644 leetcode-cn/problem (English)/超过阈值的最少操作数 I(English) [minimum-operations-to-exceed-threshold-value-i].html create mode 100644 leetcode-cn/problem (English)/超过阈值的最少操作数 II(English) [minimum-operations-to-exceed-threshold-value-ii].html create mode 100644 leetcode-cn/problem (English)/重新分装苹果(English) [apple-redistribution-into-boxes].html diff --git a/leetcode-cn/origin-data.json b/leetcode-cn/origin-data.json index bc0aff21..1843b146 100644 --- a/leetcode-cn/origin-data.json +++ b/leetcode-cn/origin-data.json @@ -1,7 +1,7 @@ { "user_name": "", "num_solved": 0, - "num_total": 3452, + "num_total": 3476, "ac_easy": 0, "ac_medium": 0, "ac_hard": 0, @@ -12,8 +12,8 @@ "question__title": "万灵之树", "question__title_slug": "cnHoX6", "question__hide": false, - "total_acs": 390, - "total_submitted": 2116, + "total_acs": 397, + "total_submitted": 2147, "total_column_articles": 7, "frontend_question_id": "LCP 82", "is_new_question": false @@ -33,8 +33,8 @@ "question__title": "与非的谜题", "question__title_slug": "ryfUiz", "question__hide": false, - "total_acs": 691, - "total_submitted": 1407, + "total_acs": 741, + "total_submitted": 1468, "total_column_articles": 15, "frontend_question_id": "LCP 81", "is_new_question": false @@ -54,8 +54,8 @@ "question__title": "生物进化录", "question__title_slug": "qoQAMX", "question__hide": false, - "total_acs": 1044, - "total_submitted": 1972, + "total_acs": 1057, + "total_submitted": 1993, "total_column_articles": 14, "frontend_question_id": "LCP 80", "is_new_question": false @@ -75,8 +75,8 @@ "question__title": "提取咒文", "question__title_slug": "kjpLFZ", "question__hide": false, - "total_acs": 1693, - "total_submitted": 5656, + "total_acs": 1708, + "total_submitted": 5699, "total_column_articles": 18, "frontend_question_id": "LCP 79", "is_new_question": false @@ -96,8 +96,8 @@ "question__title": "城墙防线", "question__title_slug": "Nsibyl", "question__hide": false, - "total_acs": 1653, - "total_submitted": 3565, + "total_acs": 1669, + "total_submitted": 3600, "total_column_articles": 24, "frontend_question_id": "LCP 78", "is_new_question": false @@ -117,8 +117,8 @@ "question__title": "符文储备", "question__title_slug": "W2ZX4X", "question__hide": false, - "total_acs": 3209, - "total_submitted": 4683, + "total_acs": 3288, + "total_submitted": 4783, "total_column_articles": 37, "frontend_question_id": "LCP 77", "is_new_question": false @@ -138,8 +138,8 @@ "question__title": "魔法棋盘", "question__title_slug": "1ybDKD", "question__hide": false, - "total_acs": 778, - "total_submitted": 2049, + "total_acs": 782, + "total_submitted": 2055, "total_column_articles": 12, "frontend_question_id": "LCP 76", "is_new_question": false @@ -159,8 +159,8 @@ "question__title": "传送卷轴", "question__title_slug": "rdmXM7", "question__hide": false, - "total_acs": 966, - "total_submitted": 2534, + "total_acs": 969, + "total_submitted": 2549, "total_column_articles": 15, "frontend_question_id": "LCP 75", "is_new_question": false @@ -180,8 +180,8 @@ "question__title": "最强祝福力场", "question__title_slug": "xepqZ5", "question__hide": false, - "total_acs": 2423, - "total_submitted": 7848, + "total_acs": 2475, + "total_submitted": 7946, "total_column_articles": 38, "frontend_question_id": "LCP 74", "is_new_question": false @@ -201,8 +201,8 @@ "question__title": "探险营地", "question__title_slug": "0Zeoeg", "question__hide": false, - "total_acs": 3395, - "total_submitted": 7311, + "total_acs": 3436, + "total_submitted": 7377, "total_column_articles": 27, "frontend_question_id": "LCP 73", "is_new_question": false @@ -222,8 +222,8 @@ "question__title": "补给马车", "question__title_slug": "hqCnmP", "question__hide": false, - "total_acs": 4417, - "total_submitted": 6555, + "total_acs": 4508, + "total_submitted": 6676, "total_column_articles": 47, "frontend_question_id": "LCP 72", "is_new_question": false @@ -243,8 +243,8 @@ "question__title": "集水器", "question__title_slug": "kskhHQ", "question__hide": false, - "total_acs": 668, - "total_submitted": 1171, + "total_acs": 673, + "total_submitted": 1179, "total_column_articles": 11, "frontend_question_id": "LCP 71", "is_new_question": false @@ -264,8 +264,8 @@ "question__title": "沙地治理", "question__title_slug": "XxZZjK", "question__hide": false, - "total_acs": 717, - "total_submitted": 2405, + "total_acs": 721, + "total_submitted": 2411, "total_column_articles": 17, "frontend_question_id": "LCP 70", "is_new_question": false @@ -285,8 +285,8 @@ "question__title": "Hello LeetCode!", "question__title_slug": "rMeRt2", "question__hide": false, - "total_acs": 1512, - "total_submitted": 4123, + "total_acs": 1518, + "total_submitted": 4132, "total_column_articles": 25, "frontend_question_id": "LCP 69", "is_new_question": false @@ -306,9 +306,9 @@ "question__title": "美观的花束", "question__title_slug": "1GxJYY", "question__hide": false, - "total_acs": 3690, - "total_submitted": 7040, - "total_column_articles": 53, + "total_acs": 3734, + "total_submitted": 7118, + "total_column_articles": 54, "frontend_question_id": "LCP 68", "is_new_question": false }, @@ -327,9 +327,9 @@ "question__title": "装饰树", "question__title_slug": "KnLfVT", "question__hide": false, - "total_acs": 6721, - "total_submitted": 7724, - "total_column_articles": 101, + "total_acs": 6879, + "total_submitted": 7934, + "total_column_articles": 102, "frontend_question_id": "LCP 67", "is_new_question": false }, @@ -348,9 +348,9 @@ "question__title": "最小展台数量", "question__title_slug": "600YaG", "question__hide": false, - "total_acs": 6537, - "total_submitted": 8436, - "total_column_articles": 100, + "total_acs": 6644, + "total_submitted": 8587, + "total_column_articles": 103, "frontend_question_id": "LCP 66", "is_new_question": false }, @@ -369,8 +369,8 @@ "question__title": "弹珠游戏", "question__title_slug": "EXvqDp", "question__hide": false, - "total_acs": 4368, - "total_submitted": 15815, + "total_acs": 4388, + "total_submitted": 15846, "total_column_articles": 125, "frontend_question_id": "LCP 63", "is_new_question": false @@ -390,9 +390,9 @@ "question__title": "二叉树灯饰", "question__title_slug": "U7WvvU", "question__hide": false, - "total_acs": 2375, - "total_submitted": 6295, - "total_column_articles": 54, + "total_acs": 2411, + "total_submitted": 6363, + "total_column_articles": 55, "frontend_question_id": "LCP 64", "is_new_question": false }, @@ -411,8 +411,8 @@ "question__title": "舒适的湿度", "question__title_slug": "3aqs1c", "question__hide": false, - "total_acs": 1140, - "total_submitted": 2414, + "total_acs": 1156, + "total_submitted": 2432, "total_column_articles": 18, "frontend_question_id": "LCP 65", "is_new_question": false @@ -432,8 +432,8 @@ "question__title": "交通枢纽", "question__title_slug": "D9PW8w", "question__hide": false, - "total_acs": 6526, - "total_submitted": 10370, + "total_acs": 6572, + "total_submitted": 10428, "total_column_articles": 78, "frontend_question_id": "LCP 62", "is_new_question": false @@ -453,9 +453,9 @@ "question__title": "气温变化趋势", "question__title_slug": "6CE719", "question__hide": false, - "total_acs": 8487, - "total_submitted": 13754, - "total_column_articles": 93, + "total_acs": 8558, + "total_submitted": 13877, + "total_column_articles": 94, "frontend_question_id": "LCP 61", "is_new_question": false }, @@ -474,9 +474,9 @@ "question__title": "积木拼接", "question__title_slug": "De4qBB", "question__hide": false, - "total_acs": 486, - "total_submitted": 1327, - "total_column_articles": 19, + "total_acs": 496, + "total_submitted": 1338, + "total_column_articles": 20, "frontend_question_id": "LCP 58", "is_new_question": false }, @@ -495,8 +495,8 @@ "question__title": "力扣泡泡龙", "question__title_slug": "WInSav", "question__hide": false, - "total_acs": 1080, - "total_submitted": 4988, + "total_acs": 1085, + "total_submitted": 5000, "total_column_articles": 28, "frontend_question_id": "LCP 60", "is_new_question": false @@ -516,8 +516,8 @@ "question__title": "搭桥过河", "question__title_slug": "NfY1m5", "question__hide": false, - "total_acs": 402, - "total_submitted": 1141, + "total_acs": 409, + "total_submitted": 1158, "total_column_articles": 10, "frontend_question_id": "LCP 59", "is_new_question": false @@ -537,8 +537,8 @@ "question__title": "打地鼠", "question__title_slug": "ZbAuEH", "question__hide": false, - "total_acs": 2241, - "total_submitted": 7984, + "total_acs": 2250, + "total_submitted": 8001, "total_column_articles": 49, "frontend_question_id": "LCP 57", "is_new_question": false @@ -558,8 +558,8 @@ "question__title": "信物传送", "question__title_slug": "6UEx57", "question__hide": false, - "total_acs": 2925, - "total_submitted": 6489, + "total_acs": 2965, + "total_submitted": 6559, "total_column_articles": 80, "frontend_question_id": "LCP 56", "is_new_question": false @@ -579,9 +579,9 @@ "question__title": "采集果实", "question__title_slug": "PTXy4P", "question__hide": false, - "total_acs": 6293, - "total_submitted": 8530, - "total_column_articles": 82, + "total_acs": 6376, + "total_submitted": 8654, + "total_column_articles": 85, "frontend_question_id": "LCP 55", "is_new_question": false }, @@ -600,8 +600,8 @@ "question__title": "夺回据点", "question__title_slug": "s5kipK", "question__hide": false, - "total_acs": 787, - "total_submitted": 1719, + "total_acs": 793, + "total_submitted": 1728, "total_column_articles": 13, "frontend_question_id": "LCP 54", "is_new_question": false @@ -621,8 +621,8 @@ "question__title": "守护太空城", "question__title_slug": "EJvmW4", "question__hide": false, - "total_acs": 1121, - "total_submitted": 2410, + "total_acs": 1131, + "total_submitted": 2425, "total_column_articles": 20, "frontend_question_id": "LCP 53", "is_new_question": false @@ -642,8 +642,8 @@ "question__title": "二叉搜索树染色", "question__title_slug": "QO5KpG", "question__hide": false, - "total_acs": 4697, - "total_submitted": 15694, + "total_acs": 4745, + "total_submitted": 15809, "total_column_articles": 102, "frontend_question_id": "LCP 52", "is_new_question": false @@ -663,9 +663,9 @@ "question__title": "烹饪料理", "question__title_slug": "UEcfPD", "question__hide": false, - "total_acs": 6220, - "total_submitted": 12823, - "total_column_articles": 134, + "total_acs": 6402, + "total_submitted": 13141, + "total_column_articles": 141, "frontend_question_id": "LCP 51", "is_new_question": false }, @@ -684,8 +684,8 @@ "question__title": "宝石补给", "question__title_slug": "WHnhjV", "question__hide": false, - "total_acs": 32982, - "total_submitted": 43826, + "total_acs": 33069, + "total_submitted": 43937, "total_column_articles": 184, "frontend_question_id": "LCP 50", "is_new_question": false @@ -705,9 +705,9 @@ "question__title": "自行车炫技赛场", "question__title_slug": "kplEvH", "question__hide": false, - "total_acs": 2957, - "total_submitted": 9711, - "total_column_articles": 62, + "total_acs": 2988, + "total_submitted": 9773, + "total_column_articles": 64, "frontend_question_id": "LCP 45", "is_new_question": false }, @@ -726,8 +726,8 @@ "question__title": "无限棋局", "question__title_slug": "fsa7oZ", "question__hide": false, - "total_acs": 1045, - "total_submitted": 3757, + "total_acs": 1052, + "total_submitted": 3809, "total_column_articles": 17, "frontend_question_id": "LCP 48", "is_new_question": false @@ -747,9 +747,9 @@ "question__title": "志愿者调配", "question__title_slug": "05ZEDJ", "question__hide": false, - "total_acs": 2081, - "total_submitted": 4227, - "total_column_articles": 46, + "total_acs": 2103, + "total_submitted": 4254, + "total_column_articles": 47, "frontend_question_id": "LCP 46", "is_new_question": false }, @@ -768,8 +768,8 @@ "question__title": "玩具套圈", "question__title_slug": "vFjcfV", "question__hide": false, - "total_acs": 2771, - "total_submitted": 9569, + "total_acs": 2775, + "total_submitted": 9587, "total_column_articles": 50, "frontend_question_id": "LCP 42", "is_new_question": false @@ -789,8 +789,8 @@ "question__title": "黑白翻转棋", "question__title_slug": "fHi6rV", "question__hide": false, - "total_acs": 11962, - "total_submitted": 17467, + "total_acs": 11996, + "total_submitted": 17574, "total_column_articles": 147, "frontend_question_id": "LCP 41", "is_new_question": false @@ -810,8 +810,8 @@ "question__title": "无人机方阵", "question__title_slug": "0jQkd0", "question__hide": false, - "total_acs": 9827, - "total_submitted": 17620, + "total_acs": 9920, + "total_submitted": 17804, "total_column_articles": 102, "frontend_question_id": "LCP 39", "is_new_question": false @@ -831,9 +831,9 @@ "question__title": "心算挑战", "question__title_slug": "uOAnQW", "question__hide": false, - "total_acs": 10299, - "total_submitted": 32334, - "total_column_articles": 197, + "total_acs": 10482, + "total_submitted": 32937, + "total_column_articles": 199, "frontend_question_id": "LCP 40", "is_new_question": false }, @@ -852,8 +852,8 @@ "question__title": "十字路口的交通", "question__title_slug": "Y1VbOX", "question__hide": false, - "total_acs": 1356, - "total_submitted": 2613, + "total_acs": 1366, + "total_submitted": 2628, "total_column_articles": 31, "frontend_question_id": "LCP 43", "is_new_question": false @@ -873,9 +873,9 @@ "question__title": "开幕式焰火", "question__title_slug": "sZ59z6", "question__hide": false, - "total_acs": 16821, - "total_submitted": 21465, - "total_column_articles": 246, + "total_acs": 17123, + "total_submitted": 21879, + "total_column_articles": 248, "frontend_question_id": "LCP 44", "is_new_question": false }, @@ -894,8 +894,8 @@ "question__title": "入场安检", "question__title_slug": "oPs9Bm", "question__hide": false, - "total_acs": 1901, - "total_submitted": 4149, + "total_acs": 1910, + "total_submitted": 4158, "total_column_articles": 35, "frontend_question_id": "LCP 47", "is_new_question": false @@ -915,8 +915,8 @@ "question__title": "环形闯关游戏", "question__title_slug": "K8GULz", "question__hide": false, - "total_acs": 1337, - "total_submitted": 3294, + "total_acs": 1345, + "total_submitted": 3305, "total_column_articles": 22, "frontend_question_id": "LCP 49", "is_new_question": false @@ -936,9 +936,9 @@ "question__title": "省份数量", "question__title_slug": "bLyHh0", "question__hide": false, - "total_acs": 25755, - "total_submitted": 38438, - "total_column_articles": 238, + "total_acs": 26161, + "total_submitted": 39063, + "total_column_articles": 241, "frontend_question_id": "LCR 116", "is_new_question": false }, @@ -957,9 +957,9 @@ "question__title": "不同路径", "question__title_slug": "2AoeFn", "question__hide": false, - "total_acs": 24837, - "total_submitted": 32787, - "total_column_articles": 236, + "total_acs": 25360, + "total_submitted": 33516, + "total_column_articles": 238, "frontend_question_id": "LCR 098", "is_new_question": false }, @@ -978,9 +978,9 @@ "question__title": "组合", "question__title_slug": "uUsW3B", "question__hide": false, - "total_acs": 33490, - "total_submitted": 40695, - "total_column_articles": 227, + "total_acs": 34159, + "total_submitted": 41524, + "total_column_articles": 229, "frontend_question_id": "LCR 080", "is_new_question": false }, @@ -999,9 +999,9 @@ "question__title": "子集", "question__title_slug": "TVdhkn", "question__hide": false, - "total_acs": 36198, - "total_submitted": 42740, - "total_column_articles": 337, + "total_acs": 36857, + "total_submitted": 43517, + "total_column_articles": 341, "frontend_question_id": "LCR 079", "is_new_question": false }, @@ -1020,9 +1020,9 @@ "question__title": "合并 K 个升序链表", "question__title_slug": "vvXgSW", "question__hide": false, - "total_acs": 36349, - "total_submitted": 56255, - "total_column_articles": 304, + "total_acs": 37210, + "total_submitted": 57585, + "total_column_articles": 308, "frontend_question_id": "LCR 078", "is_new_question": false }, @@ -1041,9 +1041,9 @@ "question__title": "排序链表", "question__title_slug": "7WHec2", "question__hide": false, - "total_acs": 45096, - "total_submitted": 72952, - "total_column_articles": 404, + "total_acs": 46021, + "total_submitted": 74568, + "total_column_articles": 408, "frontend_question_id": "LCR 077", "is_new_question": false }, @@ -1062,9 +1062,9 @@ "question__title": "数组中的第 K 个最大元素", "question__title_slug": "xx4gT2", "question__hide": false, - "total_acs": 55422, - "total_submitted": 84284, - "total_column_articles": 338, + "total_acs": 56698, + "total_submitted": 86369, + "total_column_articles": 343, "frontend_question_id": "LCR 076", "is_new_question": false }, @@ -1083,9 +1083,9 @@ "question__title": "数组的相对排序", "question__title_slug": "0H97ZC", "question__hide": false, - "total_acs": 30415, - "total_submitted": 43760, - "total_column_articles": 374, + "total_acs": 30776, + "total_submitted": 44367, + "total_column_articles": 371, "frontend_question_id": "LCR 075", "is_new_question": false }, @@ -1104,9 +1104,9 @@ "question__title": "合并区间", "question__title_slug": "SsGoHC", "question__hide": false, - "total_acs": 33690, - "total_submitted": 60087, - "total_column_articles": 275, + "total_acs": 34340, + "total_submitted": 61276, + "total_column_articles": 279, "frontend_question_id": "LCR 074", "is_new_question": false }, @@ -1125,9 +1125,9 @@ "question__title": "爱吃香蕉的狒狒", "question__title_slug": "nZZqjQ", "question__hide": false, - "total_acs": 26240, - "total_submitted": 49099, - "total_column_articles": 200, + "total_acs": 26539, + "total_submitted": 49694, + "total_column_articles": 201, "frontend_question_id": "LCR 073", "is_new_question": false }, @@ -1146,9 +1146,9 @@ "question__title": "x 的平方根", "question__title_slug": "jJ0w9p", "question__hide": false, - "total_acs": 42691, - "total_submitted": 99205, - "total_column_articles": 272, + "total_acs": 43275, + "total_submitted": 100723, + "total_column_articles": 274, "frontend_question_id": "LCR 072", "is_new_question": false }, @@ -1167,8 +1167,8 @@ "question__title": "按权重随机选择", "question__title_slug": "cuyjEf", "question__hide": false, - "total_acs": 18394, - "total_submitted": 36705, + "total_acs": 18538, + "total_submitted": 36961, "total_column_articles": 117, "frontend_question_id": "LCR 071", "is_new_question": false @@ -1188,9 +1188,9 @@ "question__title": "有序数组中的单一元素", "question__title_slug": "skFtm2", "question__hide": false, - "total_acs": 34174, - "total_submitted": 56022, - "total_column_articles": 297, + "total_acs": 34603, + "total_submitted": 56811, + "total_column_articles": 298, "frontend_question_id": "LCR 070", "is_new_question": false }, @@ -1209,9 +1209,9 @@ "question__title": "山脉数组的峰顶索引", "question__title_slug": "B1IidL", "question__hide": false, - "total_acs": 71233, - "total_submitted": 100631, - "total_column_articles": 639, + "total_acs": 71828, + "total_submitted": 101506, + "total_column_articles": 638, "frontend_question_id": "LCR 069", "is_new_question": false }, @@ -1230,9 +1230,9 @@ "question__title": "搜索插入位置", "question__title_slug": "N6YdxV", "question__hide": false, - "total_acs": 35940, - "total_submitted": 74020, - "total_column_articles": 296, + "total_acs": 36461, + "total_submitted": 75213, + "total_column_articles": 301, "frontend_question_id": "LCR 068", "is_new_question": false }, @@ -1251,9 +1251,9 @@ "question__title": "数组中两个数的最大异或值", "question__title_slug": "ms70jA", "question__hide": false, - "total_acs": 16089, - "total_submitted": 24569, - "total_column_articles": 161, + "total_acs": 16247, + "total_submitted": 24805, + "total_column_articles": 163, "frontend_question_id": "LCR 067", "is_new_question": false }, @@ -1272,9 +1272,9 @@ "question__title": " 键值映射", "question__title_slug": "z1R5dt", "question__hide": false, - "total_acs": 17699, - "total_submitted": 27492, - "total_column_articles": 242, + "total_acs": 17829, + "total_submitted": 27685, + "total_column_articles": 244, "frontend_question_id": "LCR 066", "is_new_question": false }, @@ -1293,9 +1293,9 @@ "question__title": "单词的压缩编码", "question__title_slug": "iSwD2y", "question__hide": false, - "total_acs": 17989, - "total_submitted": 28487, - "total_column_articles": 183, + "total_acs": 18139, + "total_submitted": 28737, + "total_column_articles": 185, "frontend_question_id": "LCR 065", "is_new_question": false }, @@ -1314,8 +1314,8 @@ "question__title": "实现一个魔法字典", "question__title_slug": "US1pGT", "question__hide": false, - "total_acs": 17701, - "total_submitted": 28946, + "total_acs": 17826, + "total_submitted": 29148, "total_column_articles": 180, "frontend_question_id": "LCR 064", "is_new_question": false @@ -1335,8 +1335,8 @@ "question__title": "单词替换", "question__title_slug": "UhWRSj", "question__hide": false, - "total_acs": 22570, - "total_submitted": 31750, + "total_acs": 22773, + "total_submitted": 32042, "total_column_articles": 275, "frontend_question_id": "LCR 063", "is_new_question": false @@ -1356,8 +1356,8 @@ "question__title": "查找和最小的 K 对数字", "question__title_slug": "qn8gGX", "question__hide": false, - "total_acs": 22699, - "total_submitted": 42732, + "total_acs": 22861, + "total_submitted": 43064, "total_column_articles": 198, "frontend_question_id": "LCR 061", "is_new_question": false @@ -1377,9 +1377,9 @@ "question__title": "实现 Trie (前缀树)", "question__title_slug": "QC3q1f", "question__hide": false, - "total_acs": 26202, - "total_submitted": 34788, - "total_column_articles": 220, + "total_acs": 26523, + "total_submitted": 35220, + "total_column_articles": 222, "frontend_question_id": "LCR 062", "is_new_question": false }, @@ -1398,9 +1398,9 @@ "question__title": "前 K 个高频元素", "question__title_slug": "g5c51o", "question__hide": false, - "total_acs": 30359, - "total_submitted": 44521, - "total_column_articles": 293, + "total_acs": 30844, + "total_submitted": 45324, + "total_column_articles": 296, "frontend_question_id": "LCR 060", "is_new_question": false }, @@ -1419,8 +1419,8 @@ "question__title": "数据流中的第 K 大元素", "question__title_slug": "jBjn9C", "question__hide": false, - "total_acs": 26727, - "total_submitted": 42825, + "total_acs": 27030, + "total_submitted": 43307, "total_column_articles": 214, "frontend_question_id": "LCR 059", "is_new_question": false @@ -1440,9 +1440,9 @@ "question__title": "我的日程安排表 I", "question__title_slug": "fi9suh", "question__hide": false, - "total_acs": 20778, - "total_submitted": 33983, - "total_column_articles": 185, + "total_acs": 20925, + "total_submitted": 34216, + "total_column_articles": 186, "frontend_question_id": "LCR 058", "is_new_question": false }, @@ -1461,8 +1461,8 @@ "question__title": "存在重复元素 III", "question__title_slug": "7WqeDu", "question__hide": false, - "total_acs": 22417, - "total_submitted": 64901, + "total_acs": 22595, + "total_submitted": 65543, "total_column_articles": 154, "frontend_question_id": "LCR 057", "is_new_question": false @@ -1482,9 +1482,9 @@ "question__title": "最长连续序列", "question__title_slug": "WhsWhI", "question__hide": false, - "total_acs": 30638, - "total_submitted": 62898, - "total_column_articles": 262, + "total_acs": 31287, + "total_submitted": 64443, + "total_column_articles": 267, "frontend_question_id": "LCR 119", "is_new_question": false }, @@ -1503,9 +1503,9 @@ "question__title": "两数之和 IV - 输入二叉搜索树", "question__title_slug": "opLdQZ", "question__hide": false, - "total_acs": 34966, - "total_submitted": 47551, - "total_column_articles": 332, + "total_acs": 35277, + "total_submitted": 47971, + "total_column_articles": 331, "frontend_question_id": "LCR 056", "is_new_question": false }, @@ -1524,8 +1524,8 @@ "question__title": "冗余连接", "question__title_slug": "7LpjUW", "question__hide": false, - "total_acs": 13202, - "total_submitted": 19044, + "total_acs": 13386, + "total_submitted": 19276, "total_column_articles": 137, "frontend_question_id": "LCR 118", "is_new_question": false @@ -1545,8 +1545,8 @@ "question__title": "相似字符串组", "question__title_slug": "H6lPxb", "question__hide": false, - "total_acs": 10961, - "total_submitted": 17700, + "total_acs": 11059, + "total_submitted": 17871, "total_column_articles": 105, "frontend_question_id": "LCR 117", "is_new_question": false @@ -1566,9 +1566,9 @@ "question__title": "二叉搜索树迭代器", "question__title_slug": "kTOapQ", "question__hide": false, - "total_acs": 23826, - "total_submitted": 27995, - "total_column_articles": 212, + "total_acs": 24023, + "total_submitted": 28232, + "total_column_articles": 213, "frontend_question_id": "LCR 055", "is_new_question": false }, @@ -1587,8 +1587,8 @@ "question__title": "把二叉搜索树转换为累加树", "question__title_slug": "w6cpku", "question__hide": false, - "total_acs": 29648, - "total_submitted": 34672, + "total_acs": 29947, + "total_submitted": 35034, "total_column_articles": 301, "frontend_question_id": "LCR 054", "is_new_question": false @@ -1608,9 +1608,9 @@ "question__title": "序列重建", "question__title_slug": "ur2n8P", "question__hide": false, - "total_acs": 26734, - "total_submitted": 52087, - "total_column_articles": 291, + "total_acs": 26843, + "total_submitted": 52263, + "total_column_articles": 292, "frontend_question_id": "LCR 115", "is_new_question": false }, @@ -1629,9 +1629,9 @@ "question__title": "二叉搜索树中的中序后继", "question__title_slug": "P5rCT8", "question__hide": false, - "total_acs": 36168, - "total_submitted": 57428, - "total_column_articles": 302, + "total_acs": 36524, + "total_submitted": 58011, + "total_column_articles": 304, "frontend_question_id": "LCR 053", "is_new_question": false }, @@ -1650,8 +1650,8 @@ "question__title": "火星词典", "question__title_slug": "Jf1JuT", "question__hide": false, - "total_acs": 22879, - "total_submitted": 44801, + "total_acs": 23035, + "total_submitted": 45167, "total_column_articles": 223, "frontend_question_id": "LCR 114", "is_new_question": false @@ -1671,9 +1671,9 @@ "question__title": "递增顺序搜索树", "question__title_slug": "NYBBNL", "question__hide": false, - "total_acs": 34677, - "total_submitted": 47266, - "total_column_articles": 301, + "total_acs": 35078, + "total_submitted": 47853, + "total_column_articles": 307, "frontend_question_id": "LCR 052", "is_new_question": false }, @@ -1692,8 +1692,8 @@ "question__title": "课程表 II", "question__title_slug": "QA2IGt", "question__hide": false, - "total_acs": 17492, - "total_submitted": 30979, + "total_acs": 17769, + "total_submitted": 31467, "total_column_articles": 166, "frontend_question_id": "LCR 113", "is_new_question": false @@ -1713,9 +1713,9 @@ "question__title": "二叉树中的最大路径和", "question__title_slug": "jC7MId", "question__hide": false, - "total_acs": 23823, - "total_submitted": 48860, - "total_column_articles": 178, + "total_acs": 24314, + "total_submitted": 49913, + "total_column_articles": 180, "frontend_question_id": "LCR 051", "is_new_question": false }, @@ -1734,9 +1734,9 @@ "question__title": "矩阵中的最长递增路径", "question__title_slug": "fpTFWP", "question__hide": false, - "total_acs": 15945, - "total_submitted": 27665, - "total_column_articles": 141, + "total_acs": 16132, + "total_submitted": 27985, + "total_column_articles": 142, "frontend_question_id": "LCR 112", "is_new_question": false }, @@ -1755,8 +1755,8 @@ "question__title": "路径总和 III", "question__title_slug": "6eUYwP", "question__hide": false, - "total_acs": 29442, - "total_submitted": 58898, + "total_acs": 29738, + "total_submitted": 59719, "total_column_articles": 233, "frontend_question_id": "LCR 050", "is_new_question": false @@ -1776,9 +1776,9 @@ "question__title": "求根节点到叶节点数字之和", "question__title_slug": "3Etpl5", "question__hide": false, - "total_acs": 33738, - "total_submitted": 45778, - "total_column_articles": 309, + "total_acs": 34112, + "total_submitted": 46261, + "total_column_articles": 310, "frontend_question_id": "LCR 049", "is_new_question": false }, @@ -1797,8 +1797,8 @@ "question__title": "除法求值", "question__title_slug": "vlzXQL", "question__hide": false, - "total_acs": 10370, - "total_submitted": 16092, + "total_acs": 10446, + "total_submitted": 16199, "total_column_articles": 124, "frontend_question_id": "LCR 111", "is_new_question": false @@ -1818,8 +1818,8 @@ "question__title": "二叉树的序列化与反序列化", "question__title_slug": "h54YBf", "question__hide": false, - "total_acs": 24265, - "total_submitted": 36281, + "total_acs": 24448, + "total_submitted": 36539, "total_column_articles": 198, "frontend_question_id": "LCR 048", "is_new_question": false @@ -1839,9 +1839,9 @@ "question__title": "所有可能的路径", "question__title_slug": "bP4bmD", "question__hide": false, - "total_acs": 21786, - "total_submitted": 26935, - "total_column_articles": 229, + "total_acs": 22059, + "total_submitted": 27264, + "total_column_articles": 230, "frontend_question_id": "LCR 110", "is_new_question": false }, @@ -1860,8 +1860,8 @@ "question__title": "打开转盘锁", "question__title_slug": "zlDJc7", "question__hide": false, - "total_acs": 16098, - "total_submitted": 28208, + "total_acs": 16238, + "total_submitted": 28519, "total_column_articles": 139, "frontend_question_id": "LCR 109", "is_new_question": false @@ -1881,9 +1881,9 @@ "question__title": "二叉树剪枝", "question__title_slug": "pOCWxh", "question__hide": false, - "total_acs": 34224, - "total_submitted": 50359, - "total_column_articles": 366, + "total_acs": 34699, + "total_submitted": 51126, + "total_column_articles": 370, "frontend_question_id": "LCR 047", "is_new_question": false }, @@ -1902,8 +1902,8 @@ "question__title": "单词接龙", "question__title_slug": "om3reC", "question__hide": false, - "total_acs": 12192, - "total_submitted": 20742, + "total_acs": 12304, + "total_submitted": 20914, "total_column_articles": 96, "frontend_question_id": "LCR 108", "is_new_question": false @@ -1923,9 +1923,9 @@ "question__title": "二叉树的右视图", "question__title_slug": "WNC0Lk", "question__hide": false, - "total_acs": 31603, - "total_submitted": 45100, - "total_column_articles": 368, + "total_acs": 31977, + "total_submitted": 45699, + "total_column_articles": 370, "frontend_question_id": "LCR 046", "is_new_question": false }, @@ -1944,8 +1944,8 @@ "question__title": "找树左下角的值", "question__title_slug": "LwUNpT", "question__hide": false, - "total_acs": 34954, - "total_submitted": 44290, + "total_acs": 35265, + "total_submitted": 44707, "total_column_articles": 365, "frontend_question_id": "LCR 045", "is_new_question": false @@ -1965,9 +1965,9 @@ "question__title": "在每个树行中找最大值", "question__title_slug": "hPov7L", "question__hide": false, - "total_acs": 34373, - "total_submitted": 53261, - "total_column_articles": 324, + "total_acs": 34676, + "total_submitted": 53672, + "total_column_articles": 325, "frontend_question_id": "LCR 044", "is_new_question": false }, @@ -1986,9 +1986,9 @@ "question__title": "01 矩阵", "question__title_slug": "2bCMpM", "question__hide": false, - "total_acs": 16955, - "total_submitted": 33664, - "total_column_articles": 126, + "total_acs": 17156, + "total_submitted": 34042, + "total_column_articles": 128, "frontend_question_id": "LCR 107", "is_new_question": false }, @@ -2007,8 +2007,8 @@ "question__title": "完全二叉树插入器", "question__title_slug": "NaqhDT", "question__hide": false, - "total_acs": 24985, - "total_submitted": 39879, + "total_acs": 25154, + "total_submitted": 40120, "total_column_articles": 277, "frontend_question_id": "LCR 043", "is_new_question": false @@ -2028,8 +2028,8 @@ "question__title": "判断二分图", "question__title_slug": "vEAB3K", "question__hide": false, - "total_acs": 18329, - "total_submitted": 33137, + "total_acs": 18561, + "total_submitted": 33482, "total_column_articles": 156, "frontend_question_id": "LCR 106", "is_new_question": false @@ -2049,8 +2049,8 @@ "question__title": "最近的请求次数", "question__title_slug": "H8086Q", "question__hide": false, - "total_acs": 30716, - "total_submitted": 37586, + "total_acs": 31010, + "total_submitted": 37939, "total_column_articles": 235, "frontend_question_id": "LCR 042", "is_new_question": false @@ -2070,9 +2070,9 @@ "question__title": "数据流中的移动平均值", "question__title_slug": "qIsx9U", "question__hide": false, - "total_acs": 62020, - "total_submitted": 80126, - "total_column_articles": 502, + "total_acs": 62497, + "total_submitted": 80748, + "total_column_articles": 500, "frontend_question_id": "LCR 041", "is_new_question": false }, @@ -2091,9 +2091,9 @@ "question__title": "岛屿的最大面积", "question__title_slug": "ZL6zAn", "question__hide": false, - "total_acs": 34940, - "total_submitted": 50645, - "total_column_articles": 323, + "total_acs": 35593, + "total_submitted": 51720, + "total_column_articles": 326, "frontend_question_id": "LCR 105", "is_new_question": false }, @@ -2112,8 +2112,8 @@ "question__title": "组合总和 Ⅳ", "question__title_slug": "D0F0SV", "question__hide": false, - "total_acs": 16855, - "total_submitted": 29663, + "total_acs": 17100, + "total_submitted": 30178, "total_column_articles": 122, "frontend_question_id": "LCR 104", "is_new_question": false @@ -2133,9 +2133,9 @@ "question__title": "零钱兑换", "question__title_slug": "gaM7Ch", "question__hide": false, - "total_acs": 34784, - "total_submitted": 67100, - "total_column_articles": 209, + "total_acs": 35489, + "total_submitted": 68267, + "total_column_articles": 210, "frontend_question_id": "LCR 103", "is_new_question": false }, @@ -2154,9 +2154,9 @@ "question__title": "目标和", "question__title_slug": "YaVDxD", "question__hide": false, - "total_acs": 23894, - "total_submitted": 42292, - "total_column_articles": 152, + "total_acs": 24350, + "total_submitted": 43167, + "total_column_articles": 153, "frontend_question_id": "LCR 102", "is_new_question": false }, @@ -2175,8 +2175,8 @@ "question__title": "分割等和子集", "question__title_slug": "NUPfPr", "question__hide": false, - "total_acs": 29278, - "total_submitted": 59780, + "total_acs": 29737, + "total_submitted": 60812, "total_column_articles": 184, "frontend_question_id": "LCR 101", "is_new_question": false @@ -2196,9 +2196,9 @@ "question__title": "三角形最小路径和", "question__title_slug": "IlPe0q", "question__hide": false, - "total_acs": 24160, - "total_submitted": 32658, - "total_column_articles": 234, + "total_acs": 24505, + "total_submitted": 33182, + "total_column_articles": 235, "frontend_question_id": "LCR 100", "is_new_question": false }, @@ -2217,9 +2217,9 @@ "question__title": "最小路径和", "question__title_slug": "0i0mDW", "question__hide": false, - "total_acs": 29340, - "total_submitted": 40281, - "total_column_articles": 251, + "total_acs": 29922, + "total_submitted": 41232, + "total_column_articles": 254, "frontend_question_id": "LCR 099", "is_new_question": false }, @@ -2238,9 +2238,9 @@ "question__title": "最大矩形", "question__title_slug": "PLYXKQ", "question__hide": false, - "total_acs": 19502, - "total_submitted": 33334, - "total_column_articles": 204, + "total_acs": 19697, + "total_submitted": 33666, + "total_column_articles": 207, "frontend_question_id": "LCR 040", "is_new_question": false }, @@ -2259,8 +2259,8 @@ "question__title": "柱状图中最大的矩形", "question__title_slug": "0ynMMM", "question__hide": false, - "total_acs": 29438, - "total_submitted": 58491, + "total_acs": 29782, + "total_submitted": 59358, "total_column_articles": 222, "frontend_question_id": "LCR 039", "is_new_question": false @@ -2280,9 +2280,9 @@ "question__title": "每日温度", "question__title_slug": "iIQa4I", "question__hide": false, - "total_acs": 43247, - "total_submitted": 57208, - "total_column_articles": 360, + "total_acs": 43762, + "total_submitted": 57874, + "total_column_articles": 361, "frontend_question_id": "LCR 038", "is_new_question": false }, @@ -2301,9 +2301,9 @@ "question__title": "行星碰撞", "question__title_slug": "XagZNi", "question__hide": false, - "total_acs": 33435, - "total_submitted": 73805, - "total_column_articles": 353, + "total_acs": 33730, + "total_submitted": 74360, + "total_column_articles": 354, "frontend_question_id": "LCR 037", "is_new_question": false }, @@ -2322,8 +2322,8 @@ "question__title": "不同的子序列", "question__title_slug": "21dk04", "question__hide": false, - "total_acs": 16850, - "total_submitted": 30548, + "total_acs": 17064, + "total_submitted": 30964, "total_column_articles": 131, "frontend_question_id": "LCR 097", "is_new_question": false @@ -2343,9 +2343,9 @@ "question__title": "逆波兰表达式求值", "question__title_slug": "8Zf90G", "question__hide": false, - "total_acs": 32748, - "total_submitted": 59772, - "total_column_articles": 314, + "total_acs": 33200, + "total_submitted": 60651, + "total_column_articles": 315, "frontend_question_id": "LCR 036", "is_new_question": false }, @@ -2364,8 +2364,8 @@ "question__title": "最小时间差", "question__title_slug": "569nqc", "question__hide": false, - "total_acs": 32409, - "total_submitted": 49056, + "total_acs": 32649, + "total_submitted": 49457, "total_column_articles": 228, "frontend_question_id": "LCR 035", "is_new_question": false @@ -2385,8 +2385,8 @@ "question__title": "交错字符串", "question__title_slug": "IY6buf", "question__hide": false, - "total_acs": 18433, - "total_submitted": 38521, + "total_acs": 18610, + "total_submitted": 38908, "total_column_articles": 133, "frontend_question_id": "LCR 096", "is_new_question": false @@ -2406,9 +2406,9 @@ "question__title": "验证外星语词典", "question__title_slug": "lwyVBB", "question__hide": false, - "total_acs": 27474, - "total_submitted": 49017, - "total_column_articles": 323, + "total_acs": 27650, + "total_submitted": 49280, + "total_column_articles": 324, "frontend_question_id": "LCR 034", "is_new_question": false }, @@ -2427,9 +2427,9 @@ "question__title": "字母异位词分组", "question__title_slug": "sfvd7V", "question__hide": false, - "total_acs": 32475, - "total_submitted": 43437, - "total_column_articles": 246, + "total_acs": 32771, + "total_submitted": 43860, + "total_column_articles": 248, "frontend_question_id": "LCR 033", "is_new_question": false }, @@ -2448,9 +2448,9 @@ "question__title": "最长公共子序列", "question__title_slug": "qJnOS7", "question__hide": false, - "total_acs": 52339, - "total_submitted": 80520, - "total_column_articles": 299, + "total_acs": 53601, + "total_submitted": 82604, + "total_column_articles": 300, "frontend_question_id": "LCR 095", "is_new_question": false }, @@ -2469,9 +2469,9 @@ "question__title": "有效的字母异位词", "question__title_slug": "dKk3P7", "question__hide": false, - "total_acs": 38694, - "total_submitted": 65895, - "total_column_articles": 305, + "total_acs": 39180, + "total_submitted": 66910, + "total_column_articles": 309, "frontend_question_id": "LCR 032", "is_new_question": false }, @@ -2490,9 +2490,9 @@ "question__title": "分割回文串 II", "question__title_slug": "omKAoA", "question__hide": false, - "total_acs": 16163, - "total_submitted": 28394, - "total_column_articles": 115, + "total_acs": 16310, + "total_submitted": 28688, + "total_column_articles": 116, "frontend_question_id": "LCR 094", "is_new_question": false }, @@ -2511,9 +2511,9 @@ "question__title": "最长的斐波那契子序列的长度", "question__title_slug": "Q91FMA", "question__hide": false, - "total_acs": 22444, - "total_submitted": 38989, - "total_column_articles": 148, + "total_acs": 22677, + "total_submitted": 39461, + "total_column_articles": 149, "frontend_question_id": "LCR 093", "is_new_question": false }, @@ -2532,9 +2532,9 @@ "question__title": "LRU 缓存", "question__title_slug": "OrIXps", "question__hide": false, - "total_acs": 30596, - "total_submitted": 55148, - "total_column_articles": 286, + "total_acs": 31045, + "total_submitted": 56053, + "total_column_articles": 287, "frontend_question_id": "LCR 031", "is_new_question": false }, @@ -2553,9 +2553,9 @@ "question__title": "将字符串翻转到单调递增", "question__title_slug": "cyJERH", "question__hide": false, - "total_acs": 23723, - "total_submitted": 34824, - "total_column_articles": 262, + "total_acs": 23989, + "total_submitted": 35261, + "total_column_articles": 265, "frontend_question_id": "LCR 092", "is_new_question": false }, @@ -2574,9 +2574,9 @@ "question__title": "粉刷房子", "question__title_slug": "JEj789", "question__hide": false, - "total_acs": 50657, - "total_submitted": 65592, - "total_column_articles": 584, + "total_acs": 51230, + "total_submitted": 66461, + "total_column_articles": 587, "frontend_question_id": "LCR 091", "is_new_question": false }, @@ -2595,8 +2595,8 @@ "question__title": "O(1) 时间插入、删除和获取随机元素", "question__title_slug": "FortPu", "question__hide": false, - "total_acs": 27610, - "total_submitted": 51174, + "total_acs": 27837, + "total_submitted": 51577, "total_column_articles": 182, "frontend_question_id": "LCR 030", "is_new_question": false @@ -2616,9 +2616,9 @@ "question__title": "打家劫舍 II", "question__title_slug": "PzWKhm", "question__hide": false, - "total_acs": 23742, - "total_submitted": 49267, - "total_column_articles": 187, + "total_acs": 24388, + "total_submitted": 50823, + "total_column_articles": 190, "frontend_question_id": "LCR 090", "is_new_question": false }, @@ -2637,9 +2637,9 @@ "question__title": "循环有序列表的插入", "question__title_slug": "4ueAj6", "question__hide": false, - "total_acs": 48746, - "total_submitted": 146176, - "total_column_articles": 647, + "total_acs": 48955, + "total_submitted": 146741, + "total_column_articles": 644, "frontend_question_id": "LCR 029", "is_new_question": false }, @@ -2658,8 +2658,8 @@ "question__title": "扁平化多级双向链表", "question__title_slug": "Qv1Da2", "question__hide": false, - "total_acs": 28207, - "total_submitted": 46826, + "total_acs": 28384, + "total_submitted": 47123, "total_column_articles": 364, "frontend_question_id": "LCR 028", "is_new_question": false @@ -2679,9 +2679,9 @@ "question__title": "回文链表", "question__title_slug": "aMhZSa", "question__hide": false, - "total_acs": 73263, - "total_submitted": 121325, - "total_column_articles": 568, + "total_acs": 74625, + "total_submitted": 123681, + "total_column_articles": 576, "frontend_question_id": "LCR 027", "is_new_question": false }, @@ -2700,9 +2700,9 @@ "question__title": "重排链表", "question__title_slug": "LGjMqU", "question__hide": false, - "total_acs": 48212, - "total_submitted": 73634, - "total_column_articles": 414, + "total_acs": 48876, + "total_submitted": 74802, + "total_column_articles": 419, "frontend_question_id": "LCR 026", "is_new_question": false }, @@ -2721,9 +2721,9 @@ "question__title": "两数相加 II", "question__title_slug": "lMSNwu", "question__hide": false, - "total_acs": 43388, - "total_submitted": 74522, - "total_column_articles": 433, + "total_acs": 43774, + "total_submitted": 75272, + "total_column_articles": 435, "frontend_question_id": "LCR 025", "is_new_question": false }, @@ -2742,9 +2742,9 @@ "question__title": "反转链表", "question__title_slug": "UHnkqh", "question__hide": false, - "total_acs": 125144, - "total_submitted": 166901, - "total_column_articles": 697, + "total_acs": 129148, + "total_submitted": 172013, + "total_column_articles": 711, "frontend_question_id": "LCR 024", "is_new_question": false }, @@ -2763,9 +2763,9 @@ "question__title": "相交链表", "question__title_slug": "3u1WK4", "question__hide": false, - "total_acs": 55170, - "total_submitted": 80273, - "total_column_articles": 347, + "total_acs": 56487, + "total_submitted": 82373, + "total_column_articles": 356, "frontend_question_id": "LCR 023", "is_new_question": false }, @@ -2784,9 +2784,9 @@ "question__title": "环形链表 II", "question__title_slug": "c32eOV", "question__hide": false, - "total_acs": 65631, - "total_submitted": 117813, - "total_column_articles": 410, + "total_acs": 66695, + "total_submitted": 119728, + "total_column_articles": 414, "frontend_question_id": "LCR 022", "is_new_question": false }, @@ -2805,9 +2805,9 @@ "question__title": "删除链表的倒数第 N 个结点", "question__title_slug": "SLwz0R", "question__hide": false, - "total_acs": 61149, - "total_submitted": 111140, - "total_column_articles": 523, + "total_acs": 62172, + "total_submitted": 112781, + "total_column_articles": 528, "frontend_question_id": "LCR 021", "is_new_question": false }, @@ -2826,9 +2826,9 @@ "question__title": "回文子串", "question__title_slug": "a7VOhD", "question__hide": false, - "total_acs": 43470, - "total_submitted": 61059, - "total_column_articles": 336, + "total_acs": 44140, + "total_submitted": 62051, + "total_column_articles": 340, "frontend_question_id": "LCR 020", "is_new_question": false }, @@ -2847,9 +2847,9 @@ "question__title": "验证回文串 II", "question__title_slug": "RQku0D", "question__hide": false, - "total_acs": 41985, - "total_submitted": 92513, - "total_column_articles": 380, + "total_acs": 42344, + "total_submitted": 93403, + "total_column_articles": 381, "frontend_question_id": "LCR 019", "is_new_question": false }, @@ -2868,8 +2868,8 @@ "question__title": "验证回文串", "question__title_slug": "XltzEq", "question__hide": false, - "total_acs": 49420, - "total_submitted": 96105, + "total_acs": 50049, + "total_submitted": 97411, "total_column_articles": 396, "frontend_question_id": "LCR 018", "is_new_question": false @@ -2889,9 +2889,9 @@ "question__title": "最小覆盖子串", "question__title_slug": "M1oyTv", "question__hide": false, - "total_acs": 35542, - "total_submitted": 69763, - "total_column_articles": 331, + "total_acs": 35951, + "total_submitted": 70593, + "total_column_articles": 334, "frontend_question_id": "LCR 017", "is_new_question": false }, @@ -2910,9 +2910,9 @@ "question__title": "无重复字符的最长子串", "question__title_slug": "wtcaE1", "question__hide": false, - "total_acs": 59687, - "total_submitted": 125225, - "total_column_articles": 516, + "total_acs": 61311, + "total_submitted": 128942, + "total_column_articles": 524, "frontend_question_id": "LCR 016", "is_new_question": false }, @@ -2931,8 +2931,8 @@ "question__title": "找到字符串中所有字母异位词", "question__title_slug": "VabMRr", "question__hide": false, - "total_acs": 38877, - "total_submitted": 63367, + "total_acs": 39291, + "total_submitted": 64105, "total_column_articles": 321, "frontend_question_id": "LCR 015", "is_new_question": false @@ -2952,8 +2952,8 @@ "question__title": "字符串的排列", "question__title_slug": "MPnaiL", "question__hide": false, - "total_acs": 48484, - "total_submitted": 94405, + "total_acs": 48934, + "total_submitted": 95304, "total_column_articles": 363, "frontend_question_id": "LCR 014", "is_new_question": false @@ -2973,9 +2973,9 @@ "question__title": "二维区域和检索 - 矩阵不可变", "question__title_slug": "O4NDxx", "question__hide": false, - "total_acs": 38299, - "total_submitted": 55565, - "total_column_articles": 318, + "total_acs": 38674, + "total_submitted": 56092, + "total_column_articles": 319, "frontend_question_id": "LCR 013", "is_new_question": false }, @@ -2994,9 +2994,9 @@ "question__title": "寻找数组的中心下标", "question__title_slug": "tvdfij", "question__hide": false, - "total_acs": 50397, - "total_submitted": 74764, - "total_column_articles": 448, + "total_acs": 50886, + "total_submitted": 75437, + "total_column_articles": 446, "frontend_question_id": "LCR 012", "is_new_question": false }, @@ -3015,9 +3015,9 @@ "question__title": "连续数组", "question__title_slug": "A1NYOS", "question__hide": false, - "total_acs": 43841, - "total_submitted": 79936, - "total_column_articles": 362, + "total_acs": 44228, + "total_submitted": 80649, + "total_column_articles": 365, "frontend_question_id": "LCR 011", "is_new_question": false }, @@ -3036,8 +3036,8 @@ "question__title": "和为 K 的子数组", "question__title_slug": "QTMn0o", "question__hide": false, - "total_acs": 59488, - "total_submitted": 137901, + "total_acs": 60269, + "total_submitted": 139605, "total_column_articles": 401, "frontend_question_id": "LCR 010", "is_new_question": false @@ -3057,9 +3057,9 @@ "question__title": "打家劫舍", "question__title_slug": "Gu0c2T", "question__hide": false, - "total_acs": 34654, - "total_submitted": 57948, - "total_column_articles": 245, + "total_acs": 35738, + "total_submitted": 60022, + "total_column_articles": 248, "frontend_question_id": "LCR 089", "is_new_question": false }, @@ -3078,8 +3078,8 @@ "question__title": "乘积小于 K 的子数组", "question__title_slug": "ZVAVXX", "question__hide": false, - "total_acs": 52127, - "total_submitted": 98171, + "total_acs": 52539, + "total_submitted": 98933, "total_column_articles": 406, "frontend_question_id": "LCR 009", "is_new_question": false @@ -3099,9 +3099,9 @@ "question__title": "使用最小花费爬楼梯", "question__title_slug": "GzCJIP", "question__hide": false, - "total_acs": 44607, - "total_submitted": 62384, - "total_column_articles": 344, + "total_acs": 45658, + "total_submitted": 63938, + "total_column_articles": 347, "frontend_question_id": "LCR 088", "is_new_question": false }, @@ -3120,9 +3120,9 @@ "question__title": "长度最小的子数组", "question__title_slug": "2VG8Kg", "question__hide": false, - "total_acs": 64705, - "total_submitted": 128798, - "total_column_articles": 498, + "total_acs": 65622, + "total_submitted": 130506, + "total_column_articles": 501, "frontend_question_id": "LCR 008", "is_new_question": false }, @@ -3141,9 +3141,9 @@ "question__title": "复原 IP 地址", "question__title_slug": "0on3uN", "question__hide": false, - "total_acs": 24508, - "total_submitted": 38528, - "total_column_articles": 234, + "total_acs": 24776, + "total_submitted": 38961, + "total_column_articles": 235, "frontend_question_id": "LCR 087", "is_new_question": false }, @@ -3162,9 +3162,9 @@ "question__title": "分割回文串", "question__title_slug": "M99OJA", "question__hide": false, - "total_acs": 24014, - "total_submitted": 31941, - "total_column_articles": 185, + "total_acs": 24395, + "total_submitted": 32460, + "total_column_articles": 186, "frontend_question_id": "LCR 086", "is_new_question": false }, @@ -3183,9 +3183,9 @@ "question__title": "三数之和", "question__title_slug": "1fGaJU", "question__hide": false, - "total_acs": 62984, - "total_submitted": 144965, - "total_column_articles": 400, + "total_acs": 63989, + "total_submitted": 147399, + "total_column_articles": 403, "frontend_question_id": "LCR 007", "is_new_question": false }, @@ -3204,9 +3204,9 @@ "question__title": "括号生成", "question__title_slug": "IDBivT", "question__hide": false, - "total_acs": 32869, - "total_submitted": 38907, - "total_column_articles": 307, + "total_acs": 33339, + "total_submitted": 39498, + "total_column_articles": 309, "frontend_question_id": "LCR 085", "is_new_question": false }, @@ -3225,8 +3225,8 @@ "question__title": "两数之和 II - 输入有序数组", "question__title_slug": "kLl5u1", "question__hide": false, - "total_acs": 70476, - "total_submitted": 104868, + "total_acs": 71144, + "total_submitted": 105896, "total_column_articles": 527, "frontend_question_id": "LCR 006", "is_new_question": false @@ -3246,8 +3246,8 @@ "question__title": "最大单词长度乘积", "question__title_slug": "aseY1I", "question__hide": false, - "total_acs": 55662, - "total_submitted": 78211, + "total_acs": 55944, + "total_submitted": 78612, "total_column_articles": 434, "frontend_question_id": "LCR 005", "is_new_question": false @@ -3267,9 +3267,9 @@ "question__title": "全排列 II ", "question__title_slug": "7p8L0Z", "question__hide": false, - "total_acs": 28660, - "total_submitted": 41480, - "total_column_articles": 225, + "total_acs": 29245, + "total_submitted": 42439, + "total_column_articles": 227, "frontend_question_id": "LCR 084", "is_new_question": false }, @@ -3288,9 +3288,9 @@ "question__title": "全排列", "question__title_slug": "VvJkup", "question__hide": false, - "total_acs": 36383, - "total_submitted": 43282, - "total_column_articles": 324, + "total_acs": 37458, + "total_submitted": 44638, + "total_column_articles": 327, "frontend_question_id": "LCR 083", "is_new_question": false }, @@ -3309,8 +3309,8 @@ "question__title": "只出现一次的数字 II", "question__title_slug": "WGki4K", "question__hide": false, - "total_acs": 69068, - "total_submitted": 97581, + "total_acs": 69561, + "total_submitted": 98253, "total_column_articles": 501, "frontend_question_id": "LCR 004", "is_new_question": false @@ -3330,9 +3330,9 @@ "question__title": "组合总和 II", "question__title_slug": "4sjJUc", "question__hide": false, - "total_acs": 27979, - "total_submitted": 42593, - "total_column_articles": 221, + "total_acs": 28405, + "total_submitted": 43219, + "total_column_articles": 225, "frontend_question_id": "LCR 082", "is_new_question": false }, @@ -3351,8 +3351,8 @@ "question__title": "二进制求和", "question__title_slug": "JFETK5", "question__hide": false, - "total_acs": 62284, - "total_submitted": 115905, + "total_acs": 62791, + "total_submitted": 116955, "total_column_articles": 610, "frontend_question_id": "LCR 002", "is_new_question": false @@ -3372,9 +3372,9 @@ "question__title": "比特位计数", "question__title_slug": "w3tCBm", "question__hide": false, - "total_acs": 79803, - "total_submitted": 102115, - "total_column_articles": 645, + "total_acs": 80469, + "total_submitted": 102999, + "total_column_articles": 644, "frontend_question_id": "LCR 003", "is_new_question": false }, @@ -3393,9 +3393,9 @@ "question__title": "组合总和", "question__title_slug": "Ygoe9J", "question__hide": false, - "total_acs": 32905, - "total_submitted": 41046, - "total_column_articles": 262, + "total_acs": 33462, + "total_submitted": 41810, + "total_column_articles": 266, "frontend_question_id": "LCR 081", "is_new_question": false }, @@ -3414,9 +3414,9 @@ "question__title": "两数相除", "question__title_slug": "xoh6Oh", "question__hide": false, - "total_acs": 66340, - "total_submitted": 313534, - "total_column_articles": 540, + "total_acs": 66713, + "total_submitted": 315284, + "total_column_articles": 542, "frontend_question_id": "LCR 001", "is_new_question": false }, @@ -3435,8 +3435,8 @@ "question__title": "主题空间", "question__title_slug": "YesdPw", "question__hide": false, - "total_acs": 4116, - "total_submitted": 9982, + "total_acs": 4163, + "total_submitted": 10099, "total_column_articles": 109, "frontend_question_id": "LCS 03", "is_new_question": false @@ -3456,9 +3456,9 @@ "question__title": "完成一半题目", "question__title_slug": "WqXACV", "question__hide": false, - "total_acs": 10701, - "total_submitted": 16581, - "total_column_articles": 200, + "total_acs": 10853, + "total_submitted": 16821, + "total_column_articles": 201, "frontend_question_id": "LCS 02", "is_new_question": false }, @@ -3477,9 +3477,9 @@ "question__title": "下载插件", "question__title_slug": "Ju9Xwi", "question__hide": false, - "total_acs": 15667, - "total_submitted": 29161, - "total_column_articles": 298, + "total_acs": 15932, + "total_submitted": 29713, + "total_column_articles": 301, "frontend_question_id": "LCS 01", "is_new_question": false }, @@ -3498,9 +3498,9 @@ "question__title": "魔塔游戏", "question__title_slug": "p0NxJO", "question__hide": false, - "total_acs": 24220, - "total_submitted": 52539, - "total_column_articles": 246, + "total_acs": 24411, + "total_submitted": 52944, + "total_column_articles": 244, "frontend_question_id": "LCP 30", "is_new_question": false }, @@ -3519,8 +3519,8 @@ "question__title": "守卫城堡", "question__title_slug": "7rLGCR", "question__hide": false, - "total_acs": 1199, - "total_submitted": 2127, + "total_acs": 1204, + "total_submitted": 2133, "total_column_articles": 20, "frontend_question_id": "LCP 38", "is_new_question": false @@ -3540,8 +3540,8 @@ "question__title": "最多牌组数", "question__title_slug": "Up5XYM", "question__hide": false, - "total_acs": 1799, - "total_submitted": 5243, + "total_acs": 1821, + "total_submitted": 5293, "total_column_articles": 26, "frontend_question_id": "LCP 36", "is_new_question": false @@ -3561,9 +3561,9 @@ "question__title": "蓄水", "question__title_slug": "o8SXZn", "question__hide": false, - "total_acs": 21686, - "total_submitted": 62180, - "total_column_articles": 202, + "total_acs": 21784, + "total_submitted": 62491, + "total_column_articles": 203, "frontend_question_id": "LCP 33", "is_new_question": false }, @@ -3582,8 +3582,8 @@ "question__title": "电动车游城市", "question__title_slug": "DFPeFJ", "question__hide": false, - "total_acs": 3242, - "total_submitted": 6629, + "total_acs": 3312, + "total_submitted": 6732, "total_column_articles": 45, "frontend_question_id": "LCP 35", "is_new_question": false @@ -3603,8 +3603,8 @@ "question__title": "批量处理任务", "question__title_slug": "t3fKg1", "question__hide": false, - "total_acs": 2477, - "total_submitted": 5893, + "total_acs": 2496, + "total_submitted": 5939, "total_column_articles": 33, "frontend_question_id": "LCP 32", "is_new_question": false @@ -3624,8 +3624,8 @@ "question__title": "变换的迷宫", "question__title_slug": "Db3wC1", "question__hide": false, - "total_acs": 3034, - "total_submitted": 10136, + "total_acs": 3043, + "total_submitted": 10179, "total_column_articles": 41, "frontend_question_id": "LCP 31", "is_new_question": false @@ -3645,8 +3645,8 @@ "question__title": "乐团站位", "question__title_slug": "SNJvJP", "question__hide": false, - "total_acs": 8529, - "total_submitted": 40073, + "total_acs": 8550, + "total_submitted": 40220, "total_column_articles": 172, "frontend_question_id": "LCP 29", "is_new_question": false @@ -3666,9 +3666,9 @@ "question__title": "采购方案", "question__title_slug": "4xy4Wx", "question__hide": false, - "total_acs": 20221, - "total_submitted": 62659, - "total_column_articles": 302, + "total_acs": 20343, + "total_submitted": 62982, + "total_column_articles": 304, "frontend_question_id": "LCP 28", "is_new_question": false }, @@ -3687,8 +3687,8 @@ "question__title": "黑盒光线反射", "question__title_slug": "IQvJ9i", "question__hide": false, - "total_acs": 1746, - "total_submitted": 5000, + "total_acs": 1752, + "total_submitted": 5007, "total_column_articles": 33, "frontend_question_id": "LCP 27", "is_new_question": false @@ -3708,9 +3708,9 @@ "question__title": "早餐组合", "question__title_slug": "2vYnGI", "question__hide": false, - "total_acs": 27482, - "total_submitted": 89478, - "total_column_articles": 370, + "total_acs": 27671, + "total_submitted": 90009, + "total_column_articles": 369, "frontend_question_id": "LCP 18", "is_new_question": false }, @@ -3729,9 +3729,9 @@ "question__title": "黑白方格画", "question__title_slug": "ccw6C7", "question__hide": false, - "total_acs": 12044, - "total_submitted": 34102, - "total_column_articles": 227, + "total_acs": 12099, + "total_submitted": 34253, + "total_column_articles": 228, "frontend_question_id": "LCP 22", "is_new_question": false }, @@ -3750,8 +3750,8 @@ "question__title": "速算机器人", "question__title_slug": "nGK0Fy", "question__hide": false, - "total_acs": 36004, - "total_submitted": 44991, + "total_acs": 36346, + "total_submitted": 45428, "total_column_articles": 380, "frontend_question_id": "LCP 17", "is_new_question": false @@ -3771,8 +3771,8 @@ "question__title": "古董键盘", "question__title_slug": "Uh984O", "question__hide": false, - "total_acs": 2140, - "total_submitted": 5600, + "total_acs": 2150, + "total_submitted": 5621, "total_column_articles": 36, "frontend_question_id": "LCP 25", "is_new_question": false @@ -3792,8 +3792,8 @@ "question__title": "追逐游戏", "question__title_slug": "Za25hA", "question__hide": false, - "total_acs": 1664, - "total_submitted": 4242, + "total_acs": 1675, + "total_submitted": 4264, "total_column_articles": 35, "frontend_question_id": "LCP 21", "is_new_question": false @@ -3813,9 +3813,9 @@ "question__title": "快速公交", "question__title_slug": "meChtZ", "question__hide": false, - "total_acs": 2785, - "total_submitted": 7624, - "total_column_articles": 40, + "total_acs": 2796, + "total_submitted": 7639, + "total_column_articles": 41, "frontend_question_id": "LCP 20", "is_new_question": false }, @@ -3834,8 +3834,8 @@ "question__title": "导航装置", "question__title_slug": "hSRGyL", "question__hide": false, - "total_acs": 1144, - "total_submitted": 3089, + "total_acs": 1149, + "total_submitted": 3097, "total_column_articles": 25, "frontend_question_id": "LCP 26", "is_new_question": false @@ -3855,9 +3855,9 @@ "question__title": "数字游戏", "question__title_slug": "5TxKeK", "question__hide": false, - "total_acs": 10337, - "total_submitted": 17535, - "total_column_articles": 69, + "total_acs": 10466, + "total_submitted": 17764, + "total_column_articles": 70, "frontend_question_id": "LCP 24", "is_new_question": false }, @@ -3876,9 +3876,9 @@ "question__title": "秋叶收藏集", "question__title_slug": "UlBDOe", "question__hide": false, - "total_acs": 22487, - "total_submitted": 43423, - "total_column_articles": 236, + "total_acs": 22546, + "total_submitted": 43554, + "total_column_articles": 238, "frontend_question_id": "LCP 19", "is_new_question": false }, @@ -3897,8 +3897,8 @@ "question__title": "寻宝", "question__title_slug": "xun-bao", "question__hide": false, - "total_acs": 10443, - "total_submitted": 17602, + "total_acs": 10454, + "total_submitted": 17620, "total_column_articles": 102, "frontend_question_id": "LCP 13", "is_new_question": false @@ -3918,8 +3918,8 @@ "question__title": "最小矩形面积", "question__title_slug": "zui-xiao-ju-xing-mian-ji", "question__hide": false, - "total_acs": 1807, - "total_submitted": 7226, + "total_acs": 1816, + "total_submitted": 7271, "total_column_articles": 27, "frontend_question_id": "LCP 37", "is_new_question": false @@ -3939,8 +3939,8 @@ "question__title": "最小跳跃次数", "question__title_slug": "zui-xiao-tiao-yue-ci-shu", "question__hide": false, - "total_acs": 11467, - "total_submitted": 35779, + "total_acs": 11538, + "total_submitted": 35959, "total_column_articles": 139, "frontend_question_id": "LCP 09", "is_new_question": false @@ -3960,9 +3960,9 @@ "question__title": "二叉树染色", "question__title_slug": "er-cha-shu-ran-se-UGC", "question__hide": false, - "total_acs": 6261, - "total_submitted": 10967, - "total_column_articles": 115, + "total_acs": 6354, + "total_submitted": 11112, + "total_column_articles": 116, "frontend_question_id": "LCP 34", "is_new_question": false }, @@ -3981,8 +3981,8 @@ "question__title": "游乐园的迷宫", "question__title_slug": "you-le-yuan-de-mi-gong", "question__hide": false, - "total_acs": 1548, - "total_submitted": 2462, + "total_acs": 1556, + "total_submitted": 2474, "total_column_articles": 30, "frontend_question_id": "LCP 15", "is_new_question": false @@ -4002,9 +4002,9 @@ "question__title": "小张刷题计划", "question__title_slug": "xiao-zhang-shua-ti-ji-hua", "question__hide": false, - "total_acs": 11794, - "total_submitted": 26960, - "total_column_articles": 160, + "total_acs": 11879, + "total_submitted": 27142, + "total_column_articles": 161, "frontend_question_id": "LCP 12", "is_new_question": false }, @@ -4023,9 +4023,9 @@ "question__title": "期望个数统计", "question__title_slug": "qi-wang-ge-shu-tong-ji", "question__hide": false, - "total_acs": 11006, - "total_submitted": 15112, - "total_column_articles": 103, + "total_acs": 11092, + "total_submitted": 15244, + "total_column_articles": 104, "frontend_question_id": "LCP 11", "is_new_question": false }, @@ -4044,8 +4044,8 @@ "question__title": "游乐园的游览计划", "question__title_slug": "you-le-yuan-de-you-lan-ji-hua", "question__hide": false, - "total_acs": 1228, - "total_submitted": 3425, + "total_acs": 1241, + "total_submitted": 3451, "total_column_articles": 23, "frontend_question_id": "LCP 16", "is_new_question": false @@ -4065,9 +4065,9 @@ "question__title": "传递信息", "question__title_slug": "chuan-di-xin-xi", "question__hide": false, - "total_acs": 57798, - "total_submitted": 76821, - "total_column_articles": 656, + "total_acs": 58238, + "total_submitted": 77426, + "total_column_articles": 655, "frontend_question_id": "LCP 07", "is_new_question": false }, @@ -4086,8 +4086,8 @@ "question__title": "二叉树任务调度", "question__title_slug": "er-cha-shu-ren-wu-diao-du", "question__hide": false, - "total_acs": 3276, - "total_submitted": 5262, + "total_acs": 3297, + "total_submitted": 5289, "total_column_articles": 56, "frontend_question_id": "LCP 10", "is_new_question": false @@ -4107,8 +4107,8 @@ "question__title": "切分数组", "question__title_slug": "qie-fen-shu-zu", "question__hide": false, - "total_acs": 4266, - "total_submitted": 17490, + "total_acs": 4306, + "total_submitted": 17582, "total_column_articles": 61, "frontend_question_id": "LCP 14", "is_new_question": false @@ -4128,8 +4128,8 @@ "question__title": "魔术排列", "question__title_slug": "er94lq", "question__hide": false, - "total_acs": 4054, - "total_submitted": 10826, + "total_acs": 4072, + "total_submitted": 10864, "total_column_articles": 69, "frontend_question_id": "LCP 23", "is_new_question": false @@ -4149,9 +4149,9 @@ "question__title": "剧情触发时间", "question__title_slug": "ju-qing-hong-fa-shi-jian", "question__hide": false, - "total_acs": 7823, - "total_submitted": 23307, - "total_column_articles": 135, + "total_acs": 7849, + "total_submitted": 23378, + "total_column_articles": 136, "frontend_question_id": "LCP 08", "is_new_question": false }, @@ -4170,9 +4170,9 @@ "question__title": "拿硬币", "question__title_slug": "na-ying-bi", "question__hide": false, - "total_acs": 93928, - "total_submitted": 110407, - "total_column_articles": 1065, + "total_acs": 94699, + "total_submitted": 111365, + "total_column_articles": 1066, "frontend_question_id": "LCP 06", "is_new_question": false }, @@ -4191,8 +4191,8 @@ "question__title": "Sparse Similarity LCCI", "question__title_slug": "sparse-similarity-lcci", "question__hide": false, - "total_acs": 6583, - "total_submitted": 18385, + "total_acs": 6640, + "total_submitted": 18530, "total_column_articles": 92, "frontend_question_id": "面试题 17.26", "is_new_question": false @@ -4212,8 +4212,8 @@ "question__title": "Langtons Ant LCCI", "question__title_slug": "langtons-ant-lcci", "question__hide": false, - "total_acs": 5187, - "total_submitted": 8892, + "total_acs": 5225, + "total_submitted": 8965, "total_column_articles": 89, "frontend_question_id": "面试题 16.22", "is_new_question": false @@ -4233,8 +4233,8 @@ "question__title": "Word Rectangle LCCI", "question__title_slug": "word-rectangle-lcci", "question__hide": false, - "total_acs": 3485, - "total_submitted": 6943, + "total_acs": 3520, + "total_submitted": 7001, "total_column_articles": 60, "frontend_question_id": "面试题 17.25", "is_new_question": false @@ -4254,9 +4254,9 @@ "question__title": "Sum Swap LCCI", "question__title_slug": "sum-swap-lcci", "question__hide": false, - "total_acs": 17114, - "total_submitted": 35681, - "total_column_articles": 279, + "total_acs": 17260, + "total_submitted": 35967, + "total_column_articles": 281, "frontend_question_id": "面试题 16.21", "is_new_question": false }, @@ -4275,8 +4275,8 @@ "question__title": "T9 LCCI", "question__title_slug": "t9-lcci", "question__hide": false, - "total_acs": 15786, - "total_submitted": 22223, + "total_acs": 15872, + "total_submitted": 22371, "total_column_articles": 267, "frontend_question_id": "面试题 16.20", "is_new_question": false @@ -4296,9 +4296,9 @@ "question__title": "Max Submatrix LCCI", "question__title_slug": "max-submatrix-lcci", "question__hide": false, - "total_acs": 24955, - "total_submitted": 46649, - "total_column_articles": 205, + "total_acs": 25202, + "total_submitted": 47075, + "total_column_articles": 206, "frontend_question_id": "面试题 17.24", "is_new_question": false }, @@ -4317,8 +4317,8 @@ "question__title": "Max Black Square LCCI", "question__title_slug": "max-black-square-lcci", "question__hide": false, - "total_acs": 8925, - "total_submitted": 23430, + "total_acs": 8987, + "total_submitted": 23608, "total_column_articles": 154, "frontend_question_id": "面试题 17.23", "is_new_question": false @@ -4338,9 +4338,9 @@ "question__title": "Missing Two LCCI", "question__title_slug": "missing-two-lcci", "question__hide": false, - "total_acs": 41926, - "total_submitted": 69513, - "total_column_articles": 591, + "total_acs": 42160, + "total_submitted": 69944, + "total_column_articles": 593, "frontend_question_id": "面试题 17.19", "is_new_question": false }, @@ -4359,9 +4359,9 @@ "question__title": "Shortest Supersequence LCCI", "question__title_slug": "shortest-supersequence-lcci", "question__hide": false, - "total_acs": 15366, - "total_submitted": 34552, - "total_column_articles": 178, + "total_acs": 15515, + "total_submitted": 34860, + "total_column_articles": 179, "frontend_question_id": "面试题 17.18", "is_new_question": false }, @@ -4380,9 +4380,9 @@ "question__title": "Pairs With Sum LCCI", "question__title_slug": "pairs-with-sum-lcci", "question__hide": false, - "total_acs": 18957, - "total_submitted": 39232, - "total_column_articles": 260, + "total_acs": 19078, + "total_submitted": 39499, + "total_column_articles": 261, "frontend_question_id": "面试题 16.24", "is_new_question": false }, @@ -4401,9 +4401,9 @@ "question__title": "Rank from Stream LCCI", "question__title_slug": "rank-from-stream-lcci", "question__hide": false, - "total_acs": 10590, - "total_submitted": 17022, - "total_column_articles": 155, + "total_acs": 10693, + "total_submitted": 17184, + "total_column_articles": 156, "frontend_question_id": "面试题 10.10", "is_new_question": false }, @@ -4422,9 +4422,9 @@ "question__title": "Group Anagrams LCCI", "question__title_slug": "group-anagrams-lcci", "question__hide": false, - "total_acs": 43187, - "total_submitted": 58032, - "total_column_articles": 492, + "total_acs": 43310, + "total_submitted": 58190, + "total_column_articles": 489, "frontend_question_id": "面试题 10.02", "is_new_question": false }, @@ -4443,9 +4443,9 @@ "question__title": "Find Closest LCCI", "question__title_slug": "find-closest-lcci", "question__hide": false, - "total_acs": 51889, - "total_submitted": 71048, - "total_column_articles": 673, + "total_acs": 52018, + "total_submitted": 71227, + "total_column_articles": 670, "frontend_question_id": "面试题 17.11", "is_new_question": false }, @@ -4464,9 +4464,9 @@ "question__title": "Find Majority Element LCCI", "question__title_slug": "find-majority-element-lcci", "question__hide": false, - "total_acs": 79731, - "total_submitted": 142301, - "total_column_articles": 1066, + "total_acs": 79932, + "total_submitted": 142680, + "total_column_articles": 1063, "frontend_question_id": "面试题 17.10", "is_new_question": false }, @@ -4485,9 +4485,9 @@ "question__title": "Get Kth Magic Number LCCI", "question__title_slug": "get-kth-magic-number-lcci", "question__hide": false, - "total_acs": 48753, - "total_submitted": 87288, - "total_column_articles": 432, + "total_acs": 48896, + "total_submitted": 87658, + "total_column_articles": 433, "frontend_question_id": "面试题 17.09", "is_new_question": false }, @@ -4506,8 +4506,8 @@ "question__title": "Circus Tower LCCI", "question__title_slug": "circus-tower-lcci", "question__hide": false, - "total_acs": 13748, - "total_submitted": 48289, + "total_acs": 13858, + "total_submitted": 48685, "total_column_articles": 172, "frontend_question_id": "面试题 17.08", "is_new_question": false @@ -4527,8 +4527,8 @@ "question__title": "Baby Names LCCI", "question__title_slug": "baby-names-lcci", "question__hide": false, - "total_acs": 13571, - "total_submitted": 32443, + "total_acs": 13648, + "total_submitted": 32588, "total_column_articles": 296, "frontend_question_id": "面试题 17.07", "is_new_question": false @@ -4548,8 +4548,8 @@ "question__title": "Number Of 2s In Range LCCI", "question__title_slug": "number-of-2s-in-range-lcci", "question__hide": false, - "total_acs": 11754, - "total_submitted": 23157, + "total_acs": 11887, + "total_submitted": 23476, "total_column_articles": 201, "frontend_question_id": "面试题 17.06", "is_new_question": false @@ -4569,9 +4569,9 @@ "question__title": "Find Longest Subarray LCCI", "question__title_slug": "find-longest-subarray-lcci", "question__hide": false, - "total_acs": 31958, - "total_submitted": 67261, - "total_column_articles": 289, + "total_acs": 32076, + "total_submitted": 67521, + "total_column_articles": 290, "frontend_question_id": "面试题 17.05", "is_new_question": false }, @@ -4590,9 +4590,9 @@ "question__title": "Missing Number LCCI", "question__title_slug": "missing-number-lcci", "question__hide": false, - "total_acs": 60614, - "total_submitted": 103939, - "total_column_articles": 783, + "total_acs": 61508, + "total_submitted": 105472, + "total_column_articles": 785, "frontend_question_id": "面试题 17.04", "is_new_question": false }, @@ -4611,9 +4611,9 @@ "question__title": "Boolean Evaluation LCCI", "question__title_slug": "boolean-evaluation-lcci", "question__hide": false, - "total_acs": 8983, - "total_submitted": 17330, - "total_column_articles": 123, + "total_acs": 9069, + "total_submitted": 17517, + "total_column_articles": 124, "frontend_question_id": "面试题 08.14", "is_new_question": false }, @@ -4632,9 +4632,9 @@ "question__title": "Word Transformer LCCI", "question__title_slug": "word-transformer-lcci", "question__hide": false, - "total_acs": 15429, - "total_submitted": 38225, - "total_column_articles": 213, + "total_acs": 15498, + "total_submitted": 38419, + "total_column_articles": 215, "frontend_question_id": "面试题 17.22", "is_new_question": false }, @@ -4653,9 +4653,9 @@ "question__title": "Volume of Histogram LCCI", "question__title_slug": "volume-of-histogram-lcci", "question__hide": false, - "total_acs": 51813, - "total_submitted": 81382, - "total_column_articles": 595, + "total_acs": 51899, + "total_submitted": 81514, + "total_column_articles": 593, "frontend_question_id": "面试题 17.21", "is_new_question": false }, @@ -4674,8 +4674,8 @@ "question__title": "Continuous Median LCCI", "question__title_slug": "continuous-median-lcci", "question__hide": false, - "total_acs": 7444, - "total_submitted": 12694, + "total_acs": 7490, + "total_submitted": 12766, "total_column_articles": 114, "frontend_question_id": "面试题 17.20", "is_new_question": false @@ -4695,9 +4695,9 @@ "question__title": "Calculator LCCI", "question__title_slug": "calculator-lcci", "question__hide": false, - "total_acs": 26376, - "total_submitted": 66273, - "total_column_articles": 298, + "total_acs": 26598, + "total_submitted": 66889, + "total_column_articles": 300, "frontend_question_id": "面试题 16.26", "is_new_question": false }, @@ -4716,9 +4716,9 @@ "question__title": "LRU Cache LCCI", "question__title_slug": "lru-cache-lcci", "question__hide": false, - "total_acs": 50498, - "total_submitted": 90744, - "total_column_articles": 367, + "total_acs": 51074, + "total_submitted": 91841, + "total_column_articles": 372, "frontend_question_id": "面试题 16.25", "is_new_question": false }, @@ -4737,8 +4737,8 @@ "question__title": "Add Without Plus LCCI", "question__title_slug": "add-without-plus-lcci", "question__hide": false, - "total_acs": 26368, - "total_submitted": 41510, + "total_acs": 26735, + "total_submitted": 42001, "total_column_articles": 265, "frontend_question_id": "面试题 17.01", "is_new_question": false @@ -4758,9 +4758,9 @@ "question__title": "Multi Search LCCI", "question__title_slug": "multi-search-lcci", "question__hide": false, - "total_acs": 14282, - "total_submitted": 32019, - "total_column_articles": 264, + "total_acs": 14357, + "total_submitted": 32213, + "total_column_articles": 266, "frontend_question_id": "面试题 17.17", "is_new_question": false }, @@ -4779,9 +4779,9 @@ "question__title": "The Masseuse LCCI", "question__title_slug": "the-masseuse-lcci", "question__hide": false, - "total_acs": 82502, - "total_submitted": 160776, - "total_column_articles": 1348, + "total_acs": 83146, + "total_submitted": 161980, + "total_column_articles": 1354, "frontend_question_id": "面试题 17.16", "is_new_question": false }, @@ -4800,8 +4800,8 @@ "question__title": "Longest Word LCCI", "question__title_slug": "longest-word-lcci", "question__hide": false, - "total_acs": 12614, - "total_submitted": 30955, + "total_acs": 12709, + "total_submitted": 31181, "total_column_articles": 194, "frontend_question_id": "面试题 17.15", "is_new_question": false @@ -4821,9 +4821,9 @@ "question__title": "Smallest K LCCI", "question__title_slug": "smallest-k-lcci", "question__hide": false, - "total_acs": 109561, - "total_submitted": 188185, - "total_column_articles": 956, + "total_acs": 110786, + "total_submitted": 190646, + "total_column_articles": 958, "frontend_question_id": "面试题 17.14", "is_new_question": false }, @@ -4842,9 +4842,9 @@ "question__title": "Re-Space LCCI", "question__title_slug": "re-space-lcci", "question__hide": false, - "total_acs": 29746, - "total_submitted": 53773, - "total_column_articles": 312, + "total_acs": 29838, + "total_submitted": 53980, + "total_column_articles": 313, "frontend_question_id": "面试题 17.13", "is_new_question": false }, @@ -4863,9 +4863,9 @@ "question__title": "BiNode LCCI", "question__title_slug": "binode-lcci", "question__hide": false, - "total_acs": 33229, - "total_submitted": 51987, - "total_column_articles": 411, + "total_acs": 33456, + "total_submitted": 52338, + "total_column_articles": 409, "frontend_question_id": "面试题 17.12", "is_new_question": false }, @@ -4884,8 +4884,8 @@ "question__title": "English Int LCCI", "question__title_slug": "english-int-lcci", "question__hide": false, - "total_acs": 4409, - "total_submitted": 11233, + "total_acs": 4440, + "total_submitted": 11313, "total_column_articles": 82, "frontend_question_id": "面试题 16.08", "is_new_question": false @@ -4905,9 +4905,9 @@ "question__title": "Factorial Zeros LCCI", "question__title_slug": "factorial-zeros-lcci", "question__hide": false, - "total_acs": 19644, - "total_submitted": 46124, - "total_column_articles": 195, + "total_acs": 19857, + "total_submitted": 46788, + "total_column_articles": 196, "frontend_question_id": "面试题 16.05", "is_new_question": false }, @@ -4926,9 +4926,9 @@ "question__title": "Sorted Matrix Search LCCI", "question__title_slug": "sorted-matrix-search-lcci", "question__hide": false, - "total_acs": 22620, - "total_submitted": 50787, - "total_column_articles": 239, + "total_acs": 22800, + "total_submitted": 51215, + "total_column_articles": 240, "frontend_question_id": "面试题 10.09", "is_new_question": false }, @@ -4947,9 +4947,9 @@ "question__title": "Hanota LCCI", "question__title_slug": "hanota-lcci", "question__hide": false, - "total_acs": 49632, - "total_submitted": 77032, - "total_column_articles": 457, + "total_acs": 50677, + "total_submitted": 78746, + "total_column_articles": 458, "frontend_question_id": "面试题 08.06", "is_new_question": false }, @@ -4968,8 +4968,8 @@ "question__title": "Peaks and Valleys LCCI", "question__title_slug": "peaks-and-valleys-lcci", "question__hide": false, - "total_acs": 15602, - "total_submitted": 23474, + "total_acs": 15726, + "total_submitted": 23655, "total_column_articles": 180, "frontend_question_id": "面试题 10.11", "is_new_question": false @@ -4989,8 +4989,8 @@ "question__title": "Sorted Merge LCCI", "question__title_slug": "sorted-merge-lcci", "question__hide": false, - "total_acs": 81602, - "total_submitted": 145425, + "total_acs": 82135, + "total_submitted": 146316, "total_column_articles": 2572, "frontend_question_id": "面试题 10.01", "is_new_question": false @@ -5010,9 +5010,9 @@ "question__title": "Robot in a Grid LCCI", "question__title_slug": "robot-in-a-grid-lcci", "question__hide": false, - "total_acs": 23512, - "total_submitted": 65249, - "total_column_articles": 331, + "total_acs": 23688, + "total_submitted": 65795, + "total_column_articles": 334, "frontend_question_id": "面试题 08.02", "is_new_question": false }, @@ -5031,9 +5031,9 @@ "question__title": "BST Sequences LCCI", "question__title_slug": "bst-sequences-lcci", "question__hide": false, - "total_acs": 12125, - "total_submitted": 24738, - "total_column_articles": 169, + "total_acs": 12231, + "total_submitted": 24937, + "total_column_articles": 170, "frontend_question_id": "面试题 04.09", "is_new_question": false }, @@ -5052,9 +5052,9 @@ "question__title": "Paths with Sum LCCI", "question__title_slug": "paths-with-sum-lcci", "question__hide": false, - "total_acs": 31690, - "total_submitted": 64522, - "total_column_articles": 368, + "total_acs": 31916, + "total_submitted": 64967, + "total_column_articles": 370, "frontend_question_id": "面试题 04.12", "is_new_question": false }, @@ -5073,8 +5073,8 @@ "question__title": "Partition List LCCI", "question__title_slug": "partition-list-lcci", "question__hide": false, - "total_acs": 48598, - "total_submitted": 80742, + "total_acs": 49138, + "total_submitted": 81790, "total_column_articles": 605, "frontend_question_id": "面试题 02.04", "is_new_question": false @@ -5094,9 +5094,9 @@ "question__title": "Kth Node From End of List LCCI", "question__title_slug": "kth-node-from-end-of-list-lcci", "question__hide": false, - "total_acs": 99848, - "total_submitted": 128590, - "total_column_articles": 1287, + "total_acs": 101457, + "total_submitted": 130749, + "total_column_articles": 1302, "frontend_question_id": "面试题 02.02", "is_new_question": false }, @@ -5115,9 +5115,9 @@ "question__title": "One Away LCCI", "question__title_slug": "one-away-lcci", "question__hide": false, - "total_acs": 92909, - "total_submitted": 266093, - "total_column_articles": 1367, + "total_acs": 93423, + "total_submitted": 267891, + "total_column_articles": 1370, "frontend_question_id": "面试题 01.05", "is_new_question": false }, @@ -5136,9 +5136,9 @@ "question__title": "Pond Sizes LCCI", "question__title_slug": "pond-sizes-lcci", "question__hide": false, - "total_acs": 41159, - "total_submitted": 62057, - "total_column_articles": 608, + "total_acs": 41403, + "total_submitted": 62433, + "total_column_articles": 610, "frontend_question_id": "面试题 16.19", "is_new_question": false }, @@ -5157,9 +5157,9 @@ "question__title": "Pattern Matching LCCI", "question__title_slug": "pattern-matching-lcci", "question__hide": false, - "total_acs": 18640, - "total_submitted": 54909, - "total_column_articles": 353, + "total_acs": 18713, + "total_submitted": 55107, + "total_column_articles": 354, "frontend_question_id": "面试题 16.18", "is_new_question": false }, @@ -5178,9 +5178,9 @@ "question__title": "Contiguous Sequence LCCI", "question__title_slug": "contiguous-sequence-lcci", "question__hide": false, - "total_acs": 51819, - "total_submitted": 88435, - "total_column_articles": 535, + "total_acs": 52217, + "total_submitted": 89224, + "total_column_articles": 534, "frontend_question_id": "面试题 16.17", "is_new_question": false }, @@ -5199,9 +5199,9 @@ "question__title": "Sub Sort LCCI", "question__title_slug": "sub-sort-lcci", "question__hide": false, - "total_acs": 27973, - "total_submitted": 60098, - "total_column_articles": 339, + "total_acs": 28144, + "total_submitted": 60487, + "total_column_articles": 340, "frontend_question_id": "面试题 16.16", "is_new_question": false }, @@ -5220,9 +5220,9 @@ "question__title": "Master Mind LCCI", "question__title_slug": "master-mind-lcci", "question__hide": false, - "total_acs": 17992, - "total_submitted": 40039, - "total_column_articles": 361, + "total_acs": 18134, + "total_submitted": 40342, + "total_column_articles": 362, "frontend_question_id": "面试题 16.15", "is_new_question": false }, @@ -5241,8 +5241,8 @@ "question__title": "Best Line LCCI", "question__title_slug": "best-line-lcci", "question__hide": false, - "total_acs": 6700, - "total_submitted": 12071, + "total_acs": 6740, + "total_submitted": 12152, "total_column_articles": 89, "frontend_question_id": "面试题 16.14", "is_new_question": false @@ -5262,8 +5262,8 @@ "question__title": "Bisect Squares LCCI", "question__title_slug": "bisect-squares-lcci", "question__hide": false, - "total_acs": 4021, - "total_submitted": 9097, + "total_acs": 4050, + "total_submitted": 9183, "total_column_articles": 87, "frontend_question_id": "面试题 16.13", "is_new_question": false @@ -5283,9 +5283,9 @@ "question__title": "Diving Board LCCI", "question__title_slug": "diving-board-lcci", "question__hide": false, - "total_acs": 61467, - "total_submitted": 140278, - "total_column_articles": 684, + "total_acs": 61673, + "total_submitted": 140751, + "total_column_articles": 682, "frontend_question_id": "面试题 16.11", "is_new_question": false }, @@ -5304,9 +5304,9 @@ "question__title": "Living People LCCI", "question__title_slug": "living-people-lcci", "question__hide": false, - "total_acs": 18169, - "total_submitted": 27303, - "total_column_articles": 278, + "total_acs": 18280, + "total_submitted": 27509, + "total_column_articles": 279, "frontend_question_id": "面试题 16.10", "is_new_question": false }, @@ -5325,8 +5325,8 @@ "question__title": "Operations LCCI", "question__title_slug": "operations-lcci", "question__hide": false, - "total_acs": 4432, - "total_submitted": 7816, + "total_acs": 4474, + "total_submitted": 7877, "total_column_articles": 62, "frontend_question_id": "面试题 16.09", "is_new_question": false @@ -5346,9 +5346,9 @@ "question__title": "Maximum LCCI", "question__title_slug": "maximum-lcci", "question__hide": false, - "total_acs": 38535, - "total_submitted": 51572, - "total_column_articles": 464, + "total_acs": 39002, + "total_submitted": 52154, + "total_column_articles": 461, "frontend_question_id": "面试题 16.07", "is_new_question": false }, @@ -5367,9 +5367,9 @@ "question__title": "Permutation II LCCI", "question__title_slug": "permutation-ii-lcci", "question__hide": false, - "total_acs": 34418, - "total_submitted": 49606, - "total_column_articles": 389, + "total_acs": 34858, + "total_submitted": 50234, + "total_column_articles": 392, "frontend_question_id": "面试题 08.08", "is_new_question": false }, @@ -5388,9 +5388,9 @@ "question__title": "寻找二叉树的最近公共祖先", "question__title_slug": "er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof", "question__hide": false, - "total_acs": 231107, - "total_submitted": 329722, - "total_column_articles": 1178, + "total_acs": 232202, + "total_submitted": 331404, + "total_column_articles": 1177, "frontend_question_id": "LCR 194", "is_new_question": false }, @@ -5409,9 +5409,9 @@ "question__title": "求二叉搜索树的最近公共祖先", "question__title_slug": "er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof", "question__hide": false, - "total_acs": 238158, - "total_submitted": 344962, - "total_column_articles": 1171, + "total_acs": 239064, + "total_submitted": 346307, + "total_column_articles": 1170, "frontend_question_id": "LCR 193", "is_new_question": false }, @@ -5430,8 +5430,8 @@ "question__title": "设计机械累加器", "question__title_slug": "qiu-12n-lcof", "question__hide": false, - "total_acs": 255857, - "total_submitted": 298621, + "total_acs": 256727, + "total_submitted": 299652, "total_column_articles": 1850, "frontend_question_id": "LCR 189", "is_new_question": false @@ -5451,9 +5451,9 @@ "question__title": "买卖芯片的最佳时机", "question__title_slug": "gu-piao-de-zui-da-li-run-lcof", "question__hide": false, - "total_acs": 287886, - "total_submitted": 459450, - "total_column_articles": 1680, + "total_acs": 288555, + "total_submitted": 460635, + "total_column_articles": 1678, "frontend_question_id": "LCR 188", "is_new_question": false }, @@ -5472,9 +5472,9 @@ "question__title": "破冰游戏", "question__title_slug": "yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof", "question__hide": false, - "total_acs": 204183, - "total_submitted": 313667, - "total_column_articles": 1140, + "total_acs": 205048, + "total_submitted": 315081, + "total_column_articles": 1139, "frontend_question_id": "LCR 187", "is_new_question": false }, @@ -5493,9 +5493,9 @@ "question__title": "判断是否为平衡二叉树", "question__title_slug": "ping-heng-er-cha-shu-lcof", "question__hide": false, - "total_acs": 269857, - "total_submitted": 453567, - "total_column_articles": 1544, + "total_acs": 270950, + "total_submitted": 455449, + "total_column_articles": 1546, "frontend_question_id": "LCR 176", "is_new_question": false }, @@ -5514,8 +5514,8 @@ "question__title": "文物朝代判断", "question__title_slug": "bu-ke-pai-zhong-de-shun-zi-lcof", "question__hide": false, - "total_acs": 229314, - "total_submitted": 508575, + "total_acs": 229980, + "total_submitted": 510238, "total_column_articles": 1813, "frontend_question_id": "LCR 186", "is_new_question": false @@ -5535,8 +5535,8 @@ "question__title": "把字符串转换成整数 (atoi)", "question__title_slug": "ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof", "question__hide": false, - "total_acs": 151785, - "total_submitted": 545907, + "total_acs": 152653, + "total_submitted": 550511, "total_column_articles": 1100, "frontend_question_id": "LCR 192", "is_new_question": false @@ -5556,9 +5556,9 @@ "question__title": "统计结果概率", "question__title_slug": "nge-tou-zi-de-dian-shu-lcof", "question__hide": false, - "total_acs": 133704, - "total_submitted": 232746, - "total_column_articles": 1037, + "total_acs": 134137, + "total_submitted": 233356, + "total_column_articles": 1034, "frontend_question_id": "LCR 185", "is_new_question": false }, @@ -5577,9 +5577,9 @@ "question__title": "按规则计算统计结果", "question__title_slug": "gou-jian-cheng-ji-shu-zu-lcof", "question__hide": false, - "total_acs": 158144, - "total_submitted": 274665, - "total_column_articles": 1003, + "total_acs": 158807, + "total_submitted": 276313, + "total_column_articles": 1000, "frontend_question_id": "LCR 191", "is_new_question": false }, @@ -5598,8 +5598,8 @@ "question__title": "设计自助结算系统", "question__title_slug": "dui-lie-de-zui-da-zhi-lcof", "question__hide": false, - "total_acs": 180782, - "total_submitted": 379379, + "total_acs": 181321, + "total_submitted": 380475, "total_column_articles": 1507, "frontend_question_id": "LCR 184", "is_new_question": false @@ -5619,9 +5619,9 @@ "question__title": "望远镜中最高的海拔", "question__title_slug": "hua-dong-chuang-kou-de-zui-da-zhi-lcof", "question__hide": false, - "total_acs": 240449, - "total_submitted": 538683, - "total_column_articles": 1804, + "total_acs": 241035, + "total_submitted": 540061, + "total_column_articles": 1803, "frontend_question_id": "LCR 183", "is_new_question": false }, @@ -5640,9 +5640,9 @@ "question__title": "加密运算", "question__title_slug": "bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof", "question__hide": false, - "total_acs": 153836, - "total_submitted": 255428, - "total_column_articles": 874, + "total_acs": 154401, + "total_submitted": 256125, + "total_column_articles": 872, "frontend_question_id": "LCR 190", "is_new_question": false }, @@ -5661,9 +5661,9 @@ "question__title": "丑数", "question__title_slug": "chou-shu-lcof", "question__hide": false, - "total_acs": 175882, - "total_submitted": 273401, - "total_column_articles": 909, + "total_acs": 176417, + "total_submitted": 274356, + "total_column_articles": 906, "frontend_question_id": "LCR 168", "is_new_question": false }, @@ -5682,9 +5682,9 @@ "question__title": "寻找二叉搜索树中的目标节点", "question__title_slug": "er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof", "question__hide": false, - "total_acs": 321775, - "total_submitted": 421550, - "total_column_articles": 1952, + "total_acs": 322976, + "total_submitted": 423113, + "total_column_articles": 1954, "frontend_question_id": "LCR 174", "is_new_question": false }, @@ -5703,9 +5703,9 @@ "question__title": "招式拆解 I", "question__title_slug": "zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 319986, - "total_submitted": 695812, - "total_column_articles": 1909, + "total_acs": 320673, + "total_submitted": 697284, + "total_column_articles": 1911, "frontend_question_id": "LCR 167", "is_new_question": false }, @@ -5724,9 +5724,9 @@ "question__title": "点名", "question__title_slug": "que-shi-de-shu-zi-lcof", "question__hide": false, - "total_acs": 370688, - "total_submitted": 827266, - "total_column_articles": 2617, + "total_acs": 371895, + "total_submitted": 830086, + "total_column_articles": 2624, "frontend_question_id": "LCR 173", "is_new_question": false }, @@ -5745,9 +5745,9 @@ "question__title": "动态口令", "question__title_slug": "zuo-xuan-zhuan-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 532722, - "total_submitted": 623636, - "total_column_articles": 3409, + "total_acs": 534222, + "total_submitted": 625454, + "total_column_articles": 3416, "frontend_question_id": "LCR 182", "is_new_question": false }, @@ -5766,9 +5766,9 @@ "question__title": "统计目标成绩的出现次数", "question__title_slug": "zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof", "question__hide": false, - "total_acs": 406973, - "total_submitted": 772933, - "total_column_articles": 2714, + "total_acs": 408005, + "total_submitted": 774973, + "total_column_articles": 2717, "frontend_question_id": "LCR 172", "is_new_question": false }, @@ -5787,9 +5787,9 @@ "question__title": "字符串中的单词反转", "question__title_slug": "fan-zhuan-dan-ci-shun-xu-lcof", "question__hide": false, - "total_acs": 274383, - "total_submitted": 612434, - "total_column_articles": 1730, + "total_acs": 275473, + "total_submitted": 614662, + "total_column_articles": 1732, "frontend_question_id": "LCR 181", "is_new_question": false }, @@ -5808,9 +5808,9 @@ "question__title": "珠宝的最高价值", "question__title_slug": "li-wu-de-zui-da-jie-zhi-lcof", "question__hide": false, - "total_acs": 286685, - "total_submitted": 414250, - "total_column_articles": 1966, + "total_acs": 287567, + "total_submitted": 415515, + "total_column_articles": 1969, "frontend_question_id": "LCR 166", "is_new_question": false }, @@ -5829,9 +5829,9 @@ "question__title": "训练计划 V", "question__title_slug": "liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof", "question__hide": false, - "total_acs": 336702, - "total_submitted": 514853, - "total_column_articles": 1655, + "total_acs": 337816, + "total_submitted": 516650, + "total_column_articles": 1656, "frontend_question_id": "LCR 171", "is_new_question": false }, @@ -5850,9 +5850,9 @@ "question__title": "解密数字", "question__title_slug": "ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 262941, - "total_submitted": 515375, - "total_column_articles": 2401, + "total_acs": 263566, + "total_submitted": 516604, + "total_column_articles": 2400, "frontend_question_id": "LCR 165", "is_new_question": false }, @@ -5871,8 +5871,8 @@ "question__title": "文件组合", "question__title_slug": "he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof", "question__hide": false, - "total_acs": 254499, - "total_submitted": 358627, + "total_acs": 255356, + "total_submitted": 360374, "total_column_articles": 2523, "frontend_question_id": "LCR 180", "is_new_question": false @@ -5892,9 +5892,9 @@ "question__title": "破解闯关密码", "question__title_slug": "ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof", "question__hide": false, - "total_acs": 238840, - "total_submitted": 436432, - "total_column_articles": 1528, + "total_acs": 239602, + "total_submitted": 437788, + "total_column_articles": 1526, "frontend_question_id": "LCR 164", "is_new_question": false }, @@ -5913,9 +5913,9 @@ "question__title": "查找总价格为目标值的两个商品", "question__title_slug": "he-wei-sde-liang-ge-shu-zi-lcof", "question__hide": false, - "total_acs": 289997, - "total_submitted": 427803, - "total_column_articles": 1531, + "total_acs": 291034, + "total_submitted": 429355, + "total_column_articles": 1532, "frontend_question_id": "LCR 179", "is_new_question": false }, @@ -5934,9 +5934,9 @@ "question__title": "训练计划 VI", "question__title_slug": "shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof", "question__hide": false, - "total_acs": 177430, - "total_submitted": 220230, - "total_column_articles": 1134, + "total_acs": 177837, + "total_submitted": 220724, + "total_column_articles": 1131, "frontend_question_id": "LCR 178", "is_new_question": false }, @@ -5955,9 +5955,9 @@ "question__title": "撞色搭配", "question__title_slug": "shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof", "question__hide": false, - "total_acs": 212396, - "total_submitted": 309110, - "total_column_articles": 1610, + "total_acs": 212827, + "total_submitted": 309736, + "total_column_articles": 1609, "frontend_question_id": "LCR 177", "is_new_question": false }, @@ -5976,9 +5976,9 @@ "question__title": "计算二叉树的深度", "question__title_slug": "er-cha-shu-de-shen-du-lcof", "question__hide": false, - "total_acs": 329813, - "total_submitted": 415743, - "total_column_articles": 1932, + "total_acs": 331418, + "total_submitted": 417900, + "total_column_articles": 1937, "frontend_question_id": "LCR 175", "is_new_question": false }, @@ -5997,9 +5997,9 @@ "question__title": "交易逆序对的总数", "question__title_slug": "shu-zu-zhong-de-ni-xu-dui-lcof", "question__hide": false, - "total_acs": 215578, - "total_submitted": 434733, - "total_column_articles": 1549, + "total_acs": 217357, + "total_submitted": 438295, + "total_column_articles": 1555, "frontend_question_id": "LCR 170", "is_new_question": false }, @@ -6018,9 +6018,9 @@ "question__title": "二叉树中和为目标值的路径", "question__title_slug": "er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof", "question__hide": false, - "total_acs": 279078, - "total_submitted": 472053, - "total_column_articles": 1570, + "total_acs": 280069, + "total_submitted": 473668, + "total_column_articles": 1572, "frontend_question_id": "LCR 153", "is_new_question": false }, @@ -6039,9 +6039,9 @@ "question__title": "招式拆解 II", "question__title_slug": "di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof", "question__hide": false, - "total_acs": 338360, - "total_submitted": 547625, - "total_column_articles": 1894, + "total_acs": 339085, + "total_submitted": 548769, + "total_column_articles": 1892, "frontend_question_id": "LCR 169", "is_new_question": false }, @@ -6060,8 +6060,8 @@ "question__title": "验证二叉搜索树的后序遍历序列", "question__title_slug": "er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof", "question__hide": false, - "total_acs": 235590, - "total_submitted": 413318, + "total_acs": 236392, + "total_submitted": 414837, "total_column_articles": 1720, "frontend_question_id": "LCR 152", "is_new_question": false @@ -6081,9 +6081,9 @@ "question__title": "彩灯装饰记录 III", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof", "question__hide": false, - "total_acs": 271953, - "total_submitted": 468115, - "total_column_articles": 2195, + "total_acs": 272657, + "total_submitted": 469332, + "total_column_articles": 2193, "frontend_question_id": "LCR 151", "is_new_question": false }, @@ -6102,9 +6102,9 @@ "question__title": "找到第 k 位数字", "question__title_slug": "shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof", "question__hide": false, - "total_acs": 112397, - "total_submitted": 260899, - "total_column_articles": 825, + "total_acs": 112683, + "total_submitted": 261587, + "total_column_articles": 823, "frontend_question_id": "LCR 163", "is_new_question": false }, @@ -6123,9 +6123,9 @@ "question__title": "彩灯装饰记录 II", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof", "question__hide": false, - "total_acs": 293781, - "total_submitted": 427230, - "total_column_articles": 1970, + "total_acs": 294408, + "total_submitted": 428198, + "total_column_articles": 1968, "frontend_question_id": "LCR 150", "is_new_question": false }, @@ -6144,9 +6144,9 @@ "question__title": "彩灯装饰记录 I", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-lcof", "question__hide": false, - "total_acs": 298704, - "total_submitted": 474103, - "total_column_articles": 1770, + "total_acs": 299452, + "total_submitted": 475348, + "total_column_articles": 1768, "frontend_question_id": "LCR 149", "is_new_question": false }, @@ -6165,9 +6165,9 @@ "question__title": "库存管理 II", "question__title_slug": "shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof", "question__hide": false, - "total_acs": 319198, - "total_submitted": 456649, - "total_column_articles": 1639, + "total_acs": 320011, + "total_submitted": 457904, + "total_column_articles": 1637, "frontend_question_id": "LCR 158", "is_new_question": false }, @@ -6186,9 +6186,9 @@ "question__title": "数字 1 的个数", "question__title_slug": "1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof", "question__hide": false, - "total_acs": 94207, - "total_submitted": 186709, - "total_column_articles": 818, + "total_acs": 94517, + "total_submitted": 187377, + "total_column_articles": 817, "frontend_question_id": "LCR 162", "is_new_question": false }, @@ -6207,8 +6207,8 @@ "question__title": "套餐内商品的排列顺序", "question__title_slug": "zi-fu-chuan-de-pai-lie-lcof", "question__hide": false, - "total_acs": 287176, - "total_submitted": 500508, + "total_acs": 287899, + "total_submitted": 501905, "total_column_articles": 1683, "frontend_question_id": "LCR 157", "is_new_question": false @@ -6228,9 +6228,9 @@ "question__title": "序列化与反序列化二叉树", "question__title_slug": "xu-lie-hua-er-cha-shu-lcof", "question__hide": false, - "total_acs": 144117, - "total_submitted": 251722, - "total_column_articles": 902, + "total_acs": 144593, + "total_submitted": 252552, + "total_column_articles": 900, "frontend_question_id": "LCR 156", "is_new_question": false }, @@ -6249,9 +6249,9 @@ "question__title": "验证图书取出顺序", "question__title_slug": "zhan-de-ya-ru-dan-chu-xu-lie-lcof", "question__hide": false, - "total_acs": 232905, - "total_submitted": 381333, - "total_column_articles": 1609, + "total_acs": 233624, + "total_submitted": 382557, + "total_column_articles": 1608, "frontend_question_id": "LCR 148", "is_new_question": false }, @@ -6270,9 +6270,9 @@ "question__title": "将二叉搜索树转化为排序的双向链表", "question__title_slug": "er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof", "question__hide": false, - "total_acs": 229265, - "total_submitted": 353104, - "total_column_articles": 1713, + "total_acs": 230318, + "total_submitted": 354519, + "total_column_articles": 1717, "frontend_question_id": "LCR 155", "is_new_question": false }, @@ -6291,9 +6291,9 @@ "question__title": "连续天数的最高销售额", "question__title_slug": "lian-xu-zi-shu-zu-de-zui-da-he-lcof", "question__hide": false, - "total_acs": 427317, - "total_submitted": 711070, - "total_column_articles": 2370, + "total_acs": 428538, + "total_submitted": 713386, + "total_column_articles": 2372, "frontend_question_id": "LCR 161", "is_new_question": false }, @@ -6312,9 +6312,9 @@ "question__title": "数据流中的中位数", "question__title_slug": "shu-ju-liu-zhong-de-zhong-wei-shu-lcof", "question__hide": false, - "total_acs": 143973, - "total_submitted": 247652, - "total_column_articles": 916, + "total_acs": 144523, + "total_submitted": 248672, + "total_column_articles": 914, "frontend_question_id": "LCR 160", "is_new_question": false }, @@ -6333,9 +6333,9 @@ "question__title": "最小栈", "question__title_slug": "bao-han-minhan-shu-de-zhan-lcof", "question__hide": false, - "total_acs": 371386, - "total_submitted": 672047, - "total_column_articles": 2099, + "total_acs": 372345, + "total_submitted": 673733, + "total_column_articles": 2101, "frontend_question_id": "LCR 147", "is_new_question": false }, @@ -6354,9 +6354,9 @@ "question__title": "库存管理 III", "question__title_slug": "zui-xiao-de-kge-shu-lcof", "question__hide": false, - "total_acs": 462336, - "total_submitted": 800556, - "total_column_articles": 2624, + "total_acs": 463783, + "total_submitted": 803214, + "total_column_articles": 2627, "frontend_question_id": "LCR 159", "is_new_question": false }, @@ -6375,9 +6375,9 @@ "question__title": "随机链表的复制", "question__title_slug": "fu-za-lian-biao-de-fu-zhi-lcof", "question__hide": false, - "total_acs": 304969, - "total_submitted": 426894, - "total_column_articles": 1877, + "total_acs": 305857, + "total_submitted": 428192, + "total_column_articles": 1879, "frontend_question_id": "LCR 154", "is_new_question": false }, @@ -6396,9 +6396,9 @@ "question__title": "删除链表的节点", "question__title_slug": "shan-chu-lian-biao-de-jie-dian-lcof", "question__hide": false, - "total_acs": 390286, - "total_submitted": 656710, - "total_column_articles": 2429, + "total_acs": 392347, + "total_submitted": 660656, + "total_column_articles": 2432, "frontend_question_id": "LCR 136", "is_new_question": false }, @@ -6417,8 +6417,8 @@ "question__title": "训练计划 III", "question__title_slug": "fan-zhuan-lian-biao-lcof", "question__hide": false, - "total_acs": 603707, - "total_submitted": 815177, + "total_acs": 605263, + "total_submitted": 817171, "total_column_articles": 3059, "frontend_question_id": "LCR 141", "is_new_question": false @@ -6438,9 +6438,9 @@ "question__title": "模糊搜索验证", "question__title_slug": "zheng-ze-biao-da-shi-pi-pei-lcof", "question__hide": false, - "total_acs": 127720, - "total_submitted": 334082, - "total_column_articles": 742, + "total_acs": 128020, + "total_submitted": 334876, + "total_column_articles": 740, "frontend_question_id": "LCR 137", "is_new_question": false }, @@ -6459,9 +6459,9 @@ "question__title": "报数", "question__title_slug": "da-yin-cong-1dao-zui-da-de-nwei-shu-lcof", "question__hide": false, - "total_acs": 273012, - "total_submitted": 351956, - "total_column_articles": 1637, + "total_acs": 273739, + "total_submitted": 352828, + "total_column_articles": 1635, "frontend_question_id": "LCR 135", "is_new_question": false }, @@ -6480,9 +6480,9 @@ "question__title": "Pow(x, n)", "question__title_slug": "shu-zhi-de-zheng-shu-ci-fang-lcof", "question__hide": false, - "total_acs": 250874, - "total_submitted": 716341, - "total_column_articles": 1320, + "total_acs": 251521, + "total_submitted": 717728, + "total_column_articles": 1318, "frontend_question_id": "LCR 134", "is_new_question": false }, @@ -6501,9 +6501,9 @@ "question__title": "训练计划 II", "question__title_slug": "lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof", "question__hide": false, - "total_acs": 500553, - "total_submitted": 628684, - "total_column_articles": 3749, + "total_acs": 503052, + "total_submitted": 632201, + "total_column_articles": 3755, "frontend_question_id": "LCR 140", "is_new_question": false }, @@ -6522,8 +6522,8 @@ "question__title": "螺旋遍历二维数组", "question__title_slug": "shun-shi-zhen-da-yin-ju-zhen-lcof", "question__hide": false, - "total_acs": 280966, - "total_submitted": 658837, + "total_acs": 282643, + "total_submitted": 664560, "total_column_articles": 2317, "frontend_question_id": "LCR 146", "is_new_question": false @@ -6543,9 +6543,9 @@ "question__title": "位 1 的个数", "question__title_slug": "er-jin-zhi-zhong-1de-ge-shu-lcof", "question__hide": false, - "total_acs": 349357, - "total_submitted": 460061, - "total_column_articles": 1887, + "total_acs": 350358, + "total_submitted": 461269, + "total_column_articles": 1886, "frontend_question_id": "LCR 133", "is_new_question": false }, @@ -6564,9 +6564,9 @@ "question__title": "训练计划 I", "question__title_slug": "diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof", "question__hide": false, - "total_acs": 402201, - "total_submitted": 619041, - "total_column_articles": 2753, + "total_acs": 403569, + "total_submitted": 621119, + "total_column_articles": 2752, "frontend_question_id": "LCR 139", "is_new_question": false }, @@ -6585,9 +6585,9 @@ "question__title": "有效数字", "question__title_slug": "biao-shi-shu-zhi-de-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 157041, - "total_submitted": 632615, - "total_column_articles": 1659, + "total_acs": 157431, + "total_submitted": 634375, + "total_column_articles": 1662, "frontend_question_id": "LCR 138", "is_new_question": false }, @@ -6606,9 +6606,9 @@ "question__title": "判断对称二叉树", "question__title_slug": "dui-cheng-de-er-cha-shu-lcof", "question__hide": false, - "total_acs": 312613, - "total_submitted": 542089, - "total_column_articles": 1932, + "total_acs": 313778, + "total_submitted": 544273, + "total_column_articles": 1937, "frontend_question_id": "LCR 145", "is_new_question": false }, @@ -6627,9 +6627,9 @@ "question__title": "翻转二叉树", "question__title_slug": "er-cha-shu-de-jing-xiang-lcof", "question__hide": false, - "total_acs": 382147, - "total_submitted": 480560, - "total_column_articles": 2307, + "total_acs": 383858, + "total_submitted": 482873, + "total_column_articles": 2309, "frontend_question_id": "LCR 144", "is_new_question": false }, @@ -6648,9 +6648,9 @@ "question__title": "子结构判断", "question__title_slug": "shu-de-zi-jie-gou-lcof", "question__hide": false, - "total_acs": 327279, - "total_submitted": 706249, - "total_column_articles": 2163, + "total_acs": 328602, + "total_submitted": 709177, + "total_column_articles": 2169, "frontend_question_id": "LCR 143", "is_new_question": false }, @@ -6669,8 +6669,8 @@ "question__title": "训练计划 IV", "question__title_slug": "he-bing-liang-ge-pai-xu-de-lian-biao-lcof", "question__hide": false, - "total_acs": 383868, - "total_submitted": 534528, + "total_acs": 385268, + "total_submitted": 536505, "total_column_articles": 2003, "frontend_question_id": "LCR 142", "is_new_question": false @@ -6690,9 +6690,9 @@ "question__title": "砍竹子 II", "question__title_slug": "jian-sheng-zi-ii-lcof", "question__hide": false, - "total_acs": 157867, - "total_submitted": 503538, - "total_column_articles": 799, + "total_acs": 158308, + "total_submitted": 505015, + "total_column_articles": 797, "frontend_question_id": "LCR 132", "is_new_question": false }, @@ -6711,9 +6711,9 @@ "question__title": "砍竹子 I", "question__title_slug": "jian-sheng-zi-lcof", "question__hide": false, - "total_acs": 302560, - "total_submitted": 527075, - "total_column_articles": 2078, + "total_acs": 303395, + "total_submitted": 528543, + "total_column_articles": 2083, "frontend_question_id": "LCR 131", "is_new_question": false }, @@ -6732,9 +6732,9 @@ "question__title": "推理二叉树", "question__title_slug": "zhong-jian-er-cha-shu-lcof", "question__hide": false, - "total_acs": 351330, - "total_submitted": 501204, - "total_column_articles": 2220, + "total_acs": 352118, + "total_submitted": 502423, + "total_column_articles": 2222, "frontend_question_id": "LCR 124", "is_new_question": false }, @@ -6753,8 +6753,8 @@ "question__title": "图书整理 I", "question__title_slug": "cong-wei-dao-tou-da-yin-lian-biao-lcof", "question__hide": false, - "total_acs": 670302, - "total_submitted": 906232, + "total_acs": 672512, + "total_submitted": 909391, "total_column_articles": 3779, "frontend_question_id": "LCR 123", "is_new_question": false @@ -6774,8 +6774,8 @@ "question__title": "衣橱整理", "question__title_slug": "ji-qi-ren-de-yun-dong-fan-wei-lcof", "question__hide": false, - "total_acs": 333938, - "total_submitted": 623786, + "total_acs": 334606, + "total_submitted": 625123, "total_column_articles": 2620, "frontend_question_id": "LCR 130", "is_new_question": false @@ -6795,9 +6795,9 @@ "question__title": "路径加密", "question__title_slug": "ti-huan-kong-ge-lcof", "question__hide": false, - "total_acs": 741205, - "total_submitted": 991171, - "total_column_articles": 3714, + "total_acs": 742695, + "total_submitted": 993023, + "total_column_articles": 3719, "frontend_question_id": "LCR 122", "is_new_question": false }, @@ -6816,9 +6816,9 @@ "question__title": "字母迷宫", "question__title_slug": "ju-zhen-zhong-de-lu-jing-lcof", "question__hide": false, - "total_acs": 353797, - "total_submitted": 774524, - "total_column_articles": 1908, + "total_acs": 354494, + "total_submitted": 776147, + "total_column_articles": 1907, "frontend_question_id": "LCR 129", "is_new_question": false }, @@ -6837,9 +6837,9 @@ "question__title": "库存管理 I", "question__title_slug": "xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof", "question__hide": false, - "total_acs": 511441, - "total_submitted": 1032257, - "total_column_articles": 2665, + "total_acs": 512459, + "total_submitted": 1034213, + "total_column_articles": 2662, "frontend_question_id": "LCR 128", "is_new_question": false }, @@ -6858,8 +6858,8 @@ "question__title": "跳跃训练", "question__title_slug": "qing-wa-tiao-tai-jie-wen-ti-lcof", "question__hide": false, - "total_acs": 402316, - "total_submitted": 884030, + "total_acs": 403740, + "total_submitted": 888238, "total_column_articles": 2121, "frontend_question_id": "LCR 127", "is_new_question": false @@ -6879,9 +6879,9 @@ "question__title": "寻找目标值 - 二维数组", "question__title_slug": "er-wei-shu-zu-zhong-de-cha-zhao-lcof", "question__hide": false, - "total_acs": 541727, - "total_submitted": 1371611, - "total_column_articles": 3609, + "total_acs": 542948, + "total_submitted": 1374655, + "total_column_articles": 3610, "frontend_question_id": "LCR 121", "is_new_question": false }, @@ -6900,9 +6900,9 @@ "question__title": "寻找文件副本", "question__title_slug": "shu-zu-zhong-zhong-fu-de-shu-zi-lcof", "question__hide": false, - "total_acs": 789036, - "total_submitted": 1179443, - "total_column_articles": 4486, + "total_acs": 790825, + "total_submitted": 1182072, + "total_column_articles": 4489, "frontend_question_id": "LCR 120", "is_new_question": false }, @@ -6921,9 +6921,9 @@ "question__title": "斐波那契数", "question__title_slug": "fei-bo-na-qi-shu-lie-lcof", "question__hide": false, - "total_acs": 518237, - "total_submitted": 1449459, - "total_column_articles": 2907, + "total_acs": 520342, + "total_submitted": 1456332, + "total_column_articles": 2915, "frontend_question_id": "LCR 126", "is_new_question": false }, @@ -6942,9 +6942,9 @@ "question__title": "图书整理 II", "question__title_slug": "yong-liang-ge-zhan-shi-xian-dui-lie-lcof", "question__hide": false, - "total_acs": 594427, - "total_submitted": 845131, - "total_column_articles": 3073, + "total_acs": 595494, + "total_submitted": 846603, + "total_column_articles": 3074, "frontend_question_id": "LCR 125", "is_new_question": false }, @@ -6963,9 +6963,9 @@ "question__title": "Smallest Difference LCCI", "question__title_slug": "smallest-difference-lcci", "question__hide": false, - "total_acs": 23945, - "total_submitted": 56145, - "total_column_articles": 303, + "total_acs": 24117, + "total_submitted": 56639, + "total_column_articles": 304, "frontend_question_id": "面试题 16.06", "is_new_question": false }, @@ -6984,9 +6984,9 @@ "question__title": "Tic-Tac-Toe LCCI", "question__title_slug": "tic-tac-toe-lcci", "question__hide": false, - "total_acs": 12576, - "total_submitted": 26515, - "total_column_articles": 227, + "total_acs": 12669, + "total_submitted": 26713, + "total_column_articles": 229, "frontend_question_id": "面试题 16.04", "is_new_question": false }, @@ -7005,9 +7005,9 @@ "question__title": "Intersection LCCI", "question__title_slug": "intersection-lcci", "question__hide": false, - "total_acs": 11541, - "total_submitted": 26154, - "total_column_articles": 257, + "total_acs": 11567, + "total_submitted": 26217, + "total_column_articles": 258, "frontend_question_id": "面试题 16.03", "is_new_question": false }, @@ -7026,8 +7026,8 @@ "question__title": "Words Frequency LCCI", "question__title_slug": "words-frequency-lcci", "question__hide": false, - "total_acs": 25349, - "total_submitted": 32973, + "total_acs": 25509, + "total_submitted": 33159, "total_column_articles": 290, "frontend_question_id": "面试题 16.02", "is_new_question": false @@ -7047,9 +7047,9 @@ "question__title": "Swap Numbers LCCI", "question__title_slug": "swap-numbers-lcci", "question__hide": false, - "total_acs": 42657, - "total_submitted": 52696, - "total_column_articles": 580, + "total_acs": 43157, + "total_submitted": 53416, + "total_column_articles": 579, "frontend_question_id": "面试题 16.01", "is_new_question": false }, @@ -7068,8 +7068,8 @@ "question__title": "Sparse Array Search LCCI", "question__title_slug": "sparse-array-search-lcci", "question__hide": false, - "total_acs": 32711, - "total_submitted": 57403, + "total_acs": 32958, + "total_submitted": 57840, "total_column_articles": 386, "frontend_question_id": "面试题 10.05", "is_new_question": false @@ -7089,9 +7089,9 @@ "question__title": "Permutation I LCCI", "question__title_slug": "permutation-i-lcci", "question__hide": false, - "total_acs": 34817, - "total_submitted": 42937, - "total_column_articles": 481, + "total_acs": 35131, + "total_submitted": 43328, + "total_column_articles": 480, "frontend_question_id": "面试题 08.07", "is_new_question": false }, @@ -7110,9 +7110,9 @@ "question__title": "Magic Index LCCI", "question__title_slug": "magic-index-lcci", "question__hide": false, - "total_acs": 64316, - "total_submitted": 95520, - "total_column_articles": 499, + "total_acs": 64560, + "total_submitted": 95856, + "total_column_articles": 496, "frontend_question_id": "面试题 08.03", "is_new_question": false }, @@ -7131,9 +7131,9 @@ "question__title": "Eight Queens LCCI", "question__title_slug": "eight-queens-lcci", "question__hide": false, - "total_acs": 30937, - "total_submitted": 40411, - "total_column_articles": 439, + "total_acs": 31162, + "total_submitted": 40720, + "total_column_articles": 441, "frontend_question_id": "面试题 08.12", "is_new_question": false }, @@ -7152,9 +7152,9 @@ "question__title": "Search Rotate Array LCCI", "question__title_slug": "search-rotate-array-lcci", "question__hide": false, - "total_acs": 28610, - "total_submitted": 74817, - "total_column_articles": 316, + "total_acs": 28971, + "total_submitted": 75875, + "total_column_articles": 315, "frontend_question_id": "面试题 10.03", "is_new_question": false }, @@ -7173,9 +7173,9 @@ "question__title": "Coin LCCI", "question__title_slug": "coin-lcci", "question__hide": false, - "total_acs": 45718, - "total_submitted": 92014, - "total_column_articles": 389, + "total_acs": 45951, + "total_submitted": 92533, + "total_column_articles": 390, "frontend_question_id": "面试题 08.11", "is_new_question": false }, @@ -7194,9 +7194,9 @@ "question__title": "Reverse Bits LCCI", "question__title_slug": "reverse-bits-lcci", "question__hide": false, - "total_acs": 23896, - "total_submitted": 63460, - "total_column_articles": 379, + "total_acs": 24209, + "total_submitted": 64269, + "total_column_articles": 382, "frontend_question_id": "面试题 05.03", "is_new_question": false }, @@ -7215,9 +7215,9 @@ "question__title": "Check SubTree LCCI", "question__title_slug": "check-subtree-lcci", "question__hide": false, - "total_acs": 29051, - "total_submitted": 44291, - "total_column_articles": 391, + "total_acs": 29313, + "total_submitted": 44825, + "total_column_articles": 392, "frontend_question_id": "面试题 04.10", "is_new_question": false }, @@ -7236,8 +7236,8 @@ "question__title": "Animal Shelter LCCI", "question__title_slug": "animal-shelter-lcci", "question__hide": false, - "total_acs": 20956, - "total_submitted": 36027, + "total_acs": 21127, + "total_submitted": 36309, "total_column_articles": 276, "frontend_question_id": "面试题 03.06", "is_new_question": false @@ -7257,9 +7257,9 @@ "question__title": "Binary Number to String LCCI", "question__title_slug": "binary-number-to-string-lcci", "question__hide": false, - "total_acs": 38774, - "total_submitted": 50512, - "total_column_articles": 429, + "total_acs": 38946, + "total_submitted": 50752, + "total_column_articles": 430, "frontend_question_id": "面试题 05.02", "is_new_question": false }, @@ -7278,8 +7278,8 @@ "question__title": "Pile Box LCCI", "question__title_slug": "pile-box-lcci", "question__hide": false, - "total_acs": 13193, - "total_submitted": 25768, + "total_acs": 13316, + "total_submitted": 26057, "total_column_articles": 138, "frontend_question_id": "面试题 08.13", "is_new_question": false @@ -7299,9 +7299,9 @@ "question__title": "Color Fill LCCI", "question__title_slug": "color-fill-lcci", "question__hide": false, - "total_acs": 24766, - "total_submitted": 44267, - "total_column_articles": 351, + "total_acs": 24968, + "total_submitted": 44665, + "total_column_articles": 353, "frontend_question_id": "面试题 08.10", "is_new_question": false }, @@ -7320,9 +7320,9 @@ "question__title": "Bracket LCCI", "question__title_slug": "bracket-lcci", "question__hide": false, - "total_acs": 35328, - "total_submitted": 42962, - "total_column_articles": 515, + "total_acs": 35564, + "total_submitted": 43244, + "total_column_articles": 517, "frontend_question_id": "面试题 08.09", "is_new_question": false }, @@ -7341,9 +7341,9 @@ "question__title": "Recursive Mulitply LCCI", "question__title_slug": "recursive-mulitply-lcci", "question__hide": false, - "total_acs": 51435, - "total_submitted": 78518, - "total_column_articles": 803, + "total_acs": 52299, + "total_submitted": 80028, + "total_column_articles": 805, "frontend_question_id": "面试题 08.05", "is_new_question": false }, @@ -7362,9 +7362,9 @@ "question__title": "Power Set LCCI", "question__title_slug": "power-set-lcci", "question__hide": false, - "total_acs": 33539, - "total_submitted": 40888, - "total_column_articles": 472, + "total_acs": 33770, + "total_submitted": 41179, + "total_column_articles": 470, "frontend_question_id": "面试题 08.04", "is_new_question": false }, @@ -7383,9 +7383,9 @@ "question__title": "Three Steps Problem LCCI", "question__title_slug": "three-steps-problem-lcci", "question__hide": false, - "total_acs": 69896, - "total_submitted": 191091, - "total_column_articles": 700, + "total_acs": 70743, + "total_submitted": 193792, + "total_column_articles": 702, "frontend_question_id": "面试题 08.01", "is_new_question": false }, @@ -7404,8 +7404,8 @@ "question__title": "Draw Line LCCI", "question__title_slug": "draw-line-lcci", "question__hide": false, - "total_acs": 7374, - "total_submitted": 13809, + "total_acs": 7433, + "total_submitted": 13909, "total_column_articles": 143, "frontend_question_id": "面试题 05.08", "is_new_question": false @@ -7425,9 +7425,9 @@ "question__title": "Stack of Plates LCCI", "question__title_slug": "stack-of-plates-lcci", "question__hide": false, - "total_acs": 17442, - "total_submitted": 45274, - "total_column_articles": 215, + "total_acs": 17609, + "total_submitted": 45670, + "total_column_articles": 216, "frontend_question_id": "面试题 03.03", "is_new_question": false }, @@ -7446,9 +7446,9 @@ "question__title": "Sum Lists LCCI", "question__title_slug": "sum-lists-lcci", "question__hide": false, - "total_acs": 68904, - "total_submitted": 147366, - "total_column_articles": 784, + "total_acs": 69526, + "total_submitted": 148787, + "total_column_articles": 787, "frontend_question_id": "面试题 02.05", "is_new_question": false }, @@ -7467,9 +7467,9 @@ "question__title": "Delete Middle Node LCCI", "question__title_slug": "delete-middle-node-lcci", "question__hide": false, - "total_acs": 100022, - "total_submitted": 116533, - "total_column_articles": 889, + "total_acs": 100757, + "total_submitted": 117375, + "total_column_articles": 890, "frontend_question_id": "面试题 02.03", "is_new_question": false }, @@ -7488,9 +7488,9 @@ "question__title": "Zero Matrix LCCI", "question__title_slug": "zero-matrix-lcci", "question__hide": false, - "total_acs": 125469, - "total_submitted": 197825, - "total_column_articles": 1037, + "total_acs": 126616, + "total_submitted": 199869, + "total_column_articles": 1040, "frontend_question_id": "面试题 01.08", "is_new_question": false }, @@ -7509,9 +7509,9 @@ "question__title": "Rotate Matrix LCCI", "question__title_slug": "rotate-matrix-lcci", "question__hide": false, - "total_acs": 124962, - "total_submitted": 172580, - "total_column_articles": 1266, + "total_acs": 126327, + "total_submitted": 174627, + "total_column_articles": 1267, "frontend_question_id": "面试题 01.07", "is_new_question": false }, @@ -7530,9 +7530,9 @@ "question__title": "Palindrome Permutation LCCI", "question__title_slug": "palindrome-permutation-lcci", "question__hide": false, - "total_acs": 74041, - "total_submitted": 138990, - "total_column_articles": 1205, + "total_acs": 74694, + "total_submitted": 140281, + "total_column_articles": 1207, "frontend_question_id": "面试题 01.04", "is_new_question": false }, @@ -7551,9 +7551,9 @@ "question__title": "Closed Number LCCI", "question__title_slug": "closed-number-lcci", "question__hide": false, - "total_acs": 9767, - "total_submitted": 27684, - "total_column_articles": 213, + "total_acs": 9881, + "total_submitted": 28002, + "total_column_articles": 214, "frontend_question_id": "面试题 05.04", "is_new_question": false }, @@ -7572,9 +7572,9 @@ "question__title": "Exchange LCCI", "question__title_slug": "exchange-lcci", "question__hide": false, - "total_acs": 20088, - "total_submitted": 28312, - "total_column_articles": 309, + "total_acs": 20304, + "total_submitted": 28612, + "total_column_articles": 312, "frontend_question_id": "面试题 05.07", "is_new_question": false }, @@ -7593,8 +7593,8 @@ "question__title": "Convert Integer LCCI", "question__title_slug": "convert-integer-lcci", "question__hide": false, - "total_acs": 23021, - "total_submitted": 45061, + "total_acs": 23243, + "total_submitted": 45470, "total_column_articles": 348, "frontend_question_id": "面试题 05.06", "is_new_question": false @@ -7614,9 +7614,9 @@ "question__title": "Insert Into Bits LCCI", "question__title_slug": "insert-into-bits-lcci", "question__hide": false, - "total_acs": 18682, - "total_submitted": 36133, - "total_column_articles": 314, + "total_acs": 18930, + "total_submitted": 36586, + "total_column_articles": 317, "frontend_question_id": "面试题 05.01", "is_new_question": false }, @@ -7635,8 +7635,8 @@ "question__title": "First Common Ancestor LCCI", "question__title_slug": "first-common-ancestor-lcci", "question__hide": false, - "total_acs": 29872, - "total_submitted": 41777, + "total_acs": 30070, + "total_submitted": 42043, "total_column_articles": 283, "frontend_question_id": "面试题 04.08", "is_new_question": false @@ -7656,8 +7656,8 @@ "question__title": "Successor LCCI", "question__title_slug": "successor-lcci", "question__hide": false, - "total_acs": 67852, - "total_submitted": 108476, + "total_acs": 68113, + "total_submitted": 108914, "total_column_articles": 682, "frontend_question_id": "面试题 04.06", "is_new_question": false @@ -7677,9 +7677,9 @@ "question__title": "Legal Binary Search Tree LCCI", "question__title_slug": "legal-binary-search-tree-lcci", "question__hide": false, - "total_acs": 41532, - "total_submitted": 115928, - "total_column_articles": 464, + "total_acs": 41800, + "total_submitted": 116611, + "total_column_articles": 461, "frontend_question_id": "面试题 04.05", "is_new_question": false }, @@ -7698,9 +7698,9 @@ "question__title": "Check Balance LCCI", "question__title_slug": "check-balance-lcci", "question__hide": false, - "total_acs": 48183, - "total_submitted": 80446, - "total_column_articles": 483, + "total_acs": 48474, + "total_submitted": 80928, + "total_column_articles": 484, "frontend_question_id": "面试题 04.04", "is_new_question": false }, @@ -7719,9 +7719,9 @@ "question__title": "List of Depth LCCI", "question__title_slug": "list-of-depth-lcci", "question__hide": false, - "total_acs": 37393, - "total_submitted": 46308, - "total_column_articles": 747, + "total_acs": 37598, + "total_submitted": 46568, + "total_column_articles": 748, "frontend_question_id": "面试题 04.03", "is_new_question": false }, @@ -7740,9 +7740,9 @@ "question__title": "Minimum Height Tree LCCI", "question__title_slug": "minimum-height-tree-lcci", "question__hide": false, - "total_acs": 51043, - "total_submitted": 64613, - "total_column_articles": 585, + "total_acs": 51410, + "total_submitted": 65048, + "total_column_articles": 582, "frontend_question_id": "面试题 04.02", "is_new_question": false }, @@ -7761,9 +7761,9 @@ "question__title": "Sort of Stacks LCCI", "question__title_slug": "sort-of-stacks-lcci", "question__hide": false, - "total_acs": 29006, - "total_submitted": 54168, - "total_column_articles": 362, + "total_acs": 29253, + "total_submitted": 54683, + "total_column_articles": 361, "frontend_question_id": "面试题 03.05", "is_new_question": false }, @@ -7782,9 +7782,9 @@ "question__title": "Three in One LCCI", "question__title_slug": "three-in-one-lcci", "question__hide": false, - "total_acs": 22819, - "total_submitted": 42607, - "total_column_articles": 307, + "total_acs": 23036, + "total_submitted": 43003, + "total_column_articles": 308, "frontend_question_id": "面试题 03.01", "is_new_question": false }, @@ -7803,8 +7803,8 @@ "question__title": "Route Between Nodes LCCI ", "question__title_slug": "route-between-nodes-lcci", "question__hide": false, - "total_acs": 33185, - "total_submitted": 62587, + "total_acs": 33465, + "total_submitted": 63173, "total_column_articles": 410, "frontend_question_id": "面试题 04.01", "is_new_question": false @@ -7824,9 +7824,9 @@ "question__title": "Implement Queue using Stacks LCCI", "question__title_slug": "implement-queue-using-stacks-lcci", "question__hide": false, - "total_acs": 36757, - "total_submitted": 51278, - "total_column_articles": 451, + "total_acs": 37094, + "total_submitted": 51754, + "total_column_articles": 448, "frontend_question_id": "面试题 03.04", "is_new_question": false }, @@ -7845,9 +7845,9 @@ "question__title": "Min Stack LCCI", "question__title_slug": "min-stack-lcci", "question__hide": false, - "total_acs": 42649, - "total_submitted": 68453, - "total_column_articles": 426, + "total_acs": 42986, + "total_submitted": 68960, + "total_column_articles": 423, "frontend_question_id": "面试题 03.02", "is_new_question": false }, @@ -7866,9 +7866,9 @@ "question__title": "Linked List Cycle LCCI", "question__title_slug": "linked-list-cycle-lcci", "question__hide": false, - "total_acs": 45820, - "total_submitted": 82254, - "total_column_articles": 429, + "total_acs": 46158, + "total_submitted": 82766, + "total_column_articles": 427, "frontend_question_id": "面试题 02.08", "is_new_question": false }, @@ -7887,9 +7887,9 @@ "question__title": "Intersection of Two Linked Lists LCCI", "question__title_slug": "intersection-of-two-linked-lists-lcci", "question__hide": false, - "total_acs": 216603, - "total_submitted": 326174, - "total_column_articles": 1348, + "total_acs": 224512, + "total_submitted": 338399, + "total_column_articles": 1382, "frontend_question_id": "面试题 02.07", "is_new_question": false }, @@ -7908,9 +7908,9 @@ "question__title": "Palindrome Linked List LCCI", "question__title_slug": "palindrome-linked-list-lcci", "question__hide": false, - "total_acs": 66507, - "total_submitted": 135797, - "total_column_articles": 714, + "total_acs": 67155, + "total_submitted": 137108, + "total_column_articles": 718, "frontend_question_id": "面试题 02.06", "is_new_question": false }, @@ -7929,9 +7929,9 @@ "question__title": "Remove Duplicate Node LCCI", "question__title_slug": "remove-duplicate-node-lcci", "question__hide": false, - "total_acs": 98074, - "total_submitted": 147843, - "total_column_articles": 921, + "total_acs": 98997, + "total_submitted": 149218, + "total_column_articles": 924, "frontend_question_id": "面试题 02.01", "is_new_question": false }, @@ -7950,9 +7950,9 @@ "question__title": "String Rotation LCCI", "question__title_slug": "string-rotation-lcci", "question__hide": false, - "total_acs": 90625, - "total_submitted": 168483, - "total_column_articles": 873, + "total_acs": 91130, + "total_submitted": 169455, + "total_column_articles": 871, "frontend_question_id": "面试题 01.09", "is_new_question": false }, @@ -7971,8 +7971,8 @@ "question__title": "Compress String LCCI", "question__title_slug": "compress-string-lcci", "question__hide": false, - "total_acs": 115371, - "total_submitted": 251384, + "total_acs": 116323, + "total_submitted": 253700, "total_column_articles": 1517, "frontend_question_id": "面试题 01.06", "is_new_question": false @@ -7992,8 +7992,8 @@ "question__title": "String to URL LCCI", "question__title_slug": "string-to-url-lcci", "question__hide": false, - "total_acs": 82363, - "total_submitted": 143517, + "total_acs": 83037, + "total_submitted": 144545, "total_column_articles": 776, "frontend_question_id": "面试题 01.03", "is_new_question": false @@ -8013,9 +8013,9 @@ "question__title": "Check Permutation LCCI", "question__title_slug": "check-permutation-lcci", "question__hide": false, - "total_acs": 135834, - "total_submitted": 207260, - "total_column_articles": 1930, + "total_acs": 136736, + "total_submitted": 208618, + "total_column_articles": 1933, "frontend_question_id": "面试题 01.02", "is_new_question": false }, @@ -8034,9 +8034,9 @@ "question__title": "Is Unique LCCI", "question__title_slug": "is-unique-lcci", "question__hide": false, - "total_acs": 165875, - "total_submitted": 233436, - "total_column_articles": 2306, + "total_acs": 167324, + "total_submitted": 235443, + "total_column_articles": 2308, "frontend_question_id": "面试题 01.01", "is_new_question": false }, @@ -8055,9 +8055,9 @@ "question__title": "Guess Numbers", "question__title_slug": "guess-numbers", "question__hide": false, - "total_acs": 104498, - "total_submitted": 123650, - "total_column_articles": 845, + "total_acs": 105188, + "total_submitted": 124477, + "total_column_articles": 849, "frontend_question_id": "LCP 01", "is_new_question": false }, @@ -8076,9 +8076,9 @@ "question__title": "Programmable Robot", "question__title_slug": "programmable-robot", "question__hide": false, - "total_acs": 16370, - "total_submitted": 69816, - "total_column_articles": 250, + "total_acs": 16456, + "total_submitted": 70130, + "total_column_articles": 254, "frontend_question_id": "LCP 03", "is_new_question": false }, @@ -8097,8 +8097,8 @@ "question__title": "Coin Bonus", "question__title_slug": "coin-bonus", "question__hide": false, - "total_acs": 3245, - "total_submitted": 14304, + "total_acs": 3263, + "total_submitted": 14350, "total_column_articles": 72, "frontend_question_id": "LCP 05", "is_new_question": false @@ -8118,8 +8118,8 @@ "question__title": "Broken Board Dominoes", "question__title_slug": "broken-board-dominoes", "question__hide": false, - "total_acs": 4465, - "total_submitted": 10733, + "total_acs": 4516, + "total_submitted": 10824, "total_column_articles": 95, "frontend_question_id": "LCP 04", "is_new_question": false @@ -8139,9 +8139,9 @@ "question__title": "Deep Dark Fraction", "question__title_slug": "deep-dark-fraction", "question__hide": false, - "total_acs": 21038, - "total_submitted": 29943, - "total_column_articles": 346, + "total_acs": 21164, + "total_submitted": 30156, + "total_column_articles": 347, "frontend_question_id": "LCP 02", "is_new_question": false }, @@ -8154,17 +8154,101 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 3393, + "question__title": "Make String Anti-palindrome", + "question__title_slug": "make-string-anti-palindrome", + "question__hide": false, + "total_acs": 160, + "total_submitted": 181, + "total_column_articles": 2, + "frontend_question_id": "3088", + "is_new_question": true + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3392, + "question__title": "Find Trending Hashtags", + "question__title_slug": "find-trending-hashtags", + "question__hide": false, + "total_acs": 31, + "total_submitted": 63, + "total_column_articles": 1, + "frontend_question_id": "3087", + "is_new_question": true + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3385, + "question__title": "Match Alphanumerical Pattern in Matrix I", + "question__title_slug": "match-alphanumerical-pattern-in-matrix-i", + "question__hide": false, + "total_acs": 31, + "total_submitted": 39, + "total_column_articles": 1, + "frontend_question_id": "3078", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3378, + "question__title": "Maximum Increasing Triplet Value", + "question__title_slug": "maximum-increasing-triplet-value", + "question__hide": false, + "total_acs": 63, + "total_submitted": 93, + "total_column_articles": 5, + "frontend_question_id": "3073", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 3370, "question__title": "Guess the Number Using Bitwise Questions I", "question__title_slug": "guess-the-number-using-bitwise-questions-i", "question__hide": false, - "total_acs": 16, - "total_submitted": 16, - "total_column_articles": 1, + "total_acs": 45, + "total_submitted": 50, + "total_column_articles": 2, "frontend_question_id": "3064", - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -8181,11 +8265,11 @@ "question__title": "Calculate Trapping Rain Water", "question__title_slug": "calculate-trapping-rain-water", "question__hide": false, - "total_acs": 8, - "total_submitted": 8, - "total_column_articles": 1, + "total_acs": 42, + "total_submitted": 64, + "total_column_articles": 2, "frontend_question_id": "3061", - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -8202,11 +8286,11 @@ "question__title": "Winner of the Linked List Game", "question__title_slug": "winner-of-the-linked-list-game", "question__hide": false, - "total_acs": 16, - "total_submitted": 19, - "total_column_articles": 3, + "total_acs": 99, + "total_submitted": 119, + "total_column_articles": 7, "frontend_question_id": "3062", - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -8217,17 +8301,38 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 3367, + "question__title": "Find the Sum of Encrypted Integers", + "question__title_slug": "find-the-sum-of-encrypted-integers", + "question__hide": false, + "total_acs": 3560, + "total_submitted": 4391, + "total_column_articles": 25, + "frontend_question_id": "3079", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 3366, "question__title": "User Activities within Time Bounds", "question__title_slug": "user-activities-within-time-bounds", "question__hide": false, - "total_acs": 10, - "total_submitted": 32, - "total_column_articles": 0, - "frontend_question_id": "100261", - "is_new_question": true + "total_acs": 52, + "total_submitted": 150, + "total_column_articles": 2, + "frontend_question_id": "3060", + "is_new_question": false }, "status": null, "difficulty": { @@ -8244,11 +8349,11 @@ "question__title": "Find All Unique Email Domains", "question__title_slug": "find-all-unique-email-domains", "question__hide": false, - "total_acs": 40, - "total_submitted": 60, - "total_column_articles": 3, - "frontend_question_id": "100260", - "is_new_question": true + "total_acs": 90, + "total_submitted": 149, + "total_column_articles": 4, + "frontend_question_id": "3059", + "is_new_question": false }, "status": null, "difficulty": { @@ -8261,20 +8366,41 @@ }, { "stat": { - "question_id": 3359, - "question__title": "Linked List Frequency", - "question__title_slug": "linked-list-frequency", + "question_id": 3360, + "question__title": "Minimum Deletions to Make String K-Special", + "question__title_slug": "minimum-deletions-to-make-string-k-special", "question__hide": false, - "total_acs": 15, - "total_submitted": 22, - "total_column_articles": 2, - "frontend_question_id": "3063", - "is_new_question": true + "total_acs": 4427, + "total_submitted": 10819, + "total_column_articles": 62, + "frontend_question_id": "3085", + "is_new_question": false }, "status": null, "difficulty": { "level": 2 }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3359, + "question__title": "Linked List Frequency", + "question__title_slug": "linked-list-frequency", + "question__hide": false, + "total_acs": 116, + "total_submitted": 148, + "total_column_articles": 5, + "frontend_question_id": "3063", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, "paid_only": true, "is_favor": false, "frequency": 0, @@ -8286,10 +8412,10 @@ "question__title": "Friends With No Mutual Friends", "question__title_slug": "friends-with-no-mutual-friends", "question__hide": false, - "total_acs": 17, - "total_submitted": 39, - "total_column_articles": 2, - "frontend_question_id": "100253", + "total_acs": 50, + "total_submitted": 124, + "total_column_articles": 3, + "frontend_question_id": "3058", "is_new_question": false }, "status": null, @@ -8307,10 +8433,10 @@ "question__title": "Employees Project Allocation", "question__title_slug": "employees-project-allocation", "question__hide": false, - "total_acs": 8, - "total_submitted": 14, - "total_column_articles": 1, - "frontend_question_id": "100252", + "total_acs": 50, + "total_submitted": 83, + "total_column_articles": 2, + "frontend_question_id": "3057", "is_new_question": false }, "status": null, @@ -8322,14 +8448,77 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 3356, + "question__title": "Shortest Uncommon Substring in an Array", + "question__title_slug": "shortest-uncommon-substring-in-an-array", + "question__hide": false, + "total_acs": 4726, + "total_submitted": 9732, + "total_column_articles": 41, + "frontend_question_id": "3076", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3354, + "question__title": "Replace Question Marks in String to Minimize Its Value", + "question__title_slug": "replace-question-marks-in-string-to-minimize-its-value", + "question__hide": false, + "total_acs": 2092, + "total_submitted": 6214, + "total_column_articles": 40, + "frontend_question_id": "3081", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3353, + "question__title": "Existence of a Substring in a String and Its Reverse", + "question__title_slug": "existence-of-a-substring-in-a-string-and-its-reverse", + "question__hide": false, + "total_acs": 5814, + "total_submitted": 8149, + "total_column_articles": 42, + "frontend_question_id": "3083", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 3352, "question__title": "Find Pattern in Infinite Stream II", "question__title_slug": "find-pattern-in-infinite-stream-ii", "question__hide": false, - "total_acs": 39, - "total_submitted": 58, + "total_acs": 44, + "total_submitted": 65, "total_column_articles": 3, "frontend_question_id": "3037", "is_new_question": false @@ -8343,15 +8532,99 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 3351, + "question__title": "Maximize Happiness of Selected Children", + "question__title_slug": "maximize-happiness-of-selected-children", + "question__hide": false, + "total_acs": 6021, + "total_submitted": 12540, + "total_column_articles": 38, + "frontend_question_id": "3075", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3350, + "question__title": "Distribute Elements Into Two Arrays II", + "question__title_slug": "distribute-elements-into-two-arrays-ii", + "question__hide": false, + "total_acs": 3039, + "total_submitted": 8167, + "total_column_articles": 47, + "frontend_question_id": "3072", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3347, + "question__title": "Distribute Elements Into Two Arrays I", + "question__title_slug": "distribute-elements-into-two-arrays-i", + "question__hide": false, + "total_acs": 5684, + "total_submitted": 6763, + "total_column_articles": 27, + "frontend_question_id": "3069", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3345, + "question__title": "Find the Sum of the Power of All Subsequences", + "question__title_slug": "find-the-sum-of-the-power-of-all-subsequences", + "question__hide": false, + "total_acs": 1530, + "total_submitted": 3192, + "total_column_articles": 22, + "frontend_question_id": "3082", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 3343, "question__title": "Count Numbers With Unique Digits II", "question__title_slug": "count-numbers-with-unique-digits-ii", "question__hide": false, - "total_acs": 130, - "total_submitted": 144, - "total_column_articles": 5, + "total_acs": 173, + "total_submitted": 194, + "total_column_articles": 6, "frontend_question_id": "3032", "is_new_question": false }, @@ -8370,10 +8643,10 @@ "question__title": "Snaps Analysis", "question__title_slug": "snaps-analysis", "question__hide": false, - "total_acs": 20, - "total_submitted": 47, - "total_column_articles": 1, - "frontend_question_id": "100239", + "total_acs": 65, + "total_submitted": 109, + "total_column_articles": 2, + "frontend_question_id": "3056", "is_new_question": false }, "status": null, @@ -8391,10 +8664,10 @@ "question__title": "Top Percentile Fraud", "question__title_slug": "top-percentile-fraud", "question__hide": false, - "total_acs": 12, - "total_submitted": 20, - "total_column_articles": 1, - "frontend_question_id": "100238", + "total_acs": 64, + "total_submitted": 99, + "total_column_articles": 2, + "frontend_question_id": "3055", "is_new_question": false }, "status": null, @@ -8406,14 +8679,98 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 3338, + "question__title": "Count Submatrices with Top-Left Element and Sum Less Than k", + "question__title_slug": "count-submatrices-with-top-left-element-and-sum-less-than-k", + "question__hide": false, + "total_acs": 5052, + "total_submitted": 8139, + "total_column_articles": 45, + "frontend_question_id": "3070", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3337, + "question__title": "Count Substrings Starting and Ending with Given Character", + "question__title_slug": "count-substrings-starting-and-ending-with-given-character", + "question__hide": false, + "total_acs": 5458, + "total_submitted": 10359, + "total_column_articles": 41, + "frontend_question_id": "3084", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3335, + "question__title": "Minimum Operations to Write the Letter Y on a Grid", + "question__title_slug": "minimum-operations-to-write-the-letter-y-on-a-grid", + "question__hide": false, + "total_acs": 4069, + "total_submitted": 5993, + "total_column_articles": 36, + "frontend_question_id": "3071", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3334, + "question__title": "Apple Redistribution into Boxes", + "question__title_slug": "apple-redistribution-into-boxes", + "question__hide": false, + "total_acs": 6310, + "total_submitted": 8259, + "total_column_articles": 44, + "frontend_question_id": "3074", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 3333, "question__title": "Find Pattern in Infinite Stream I", "question__title_slug": "find-pattern-in-infinite-stream-i", "question__hide": false, - "total_acs": 58, - "total_submitted": 102, + "total_acs": 69, + "total_submitted": 123, "total_column_articles": 4, "frontend_question_id": "3023", "is_new_question": false @@ -8427,15 +8784,57 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 3332, + "question__title": "Minimum Operations to Exceed Threshold Value II", + "question__title_slug": "minimum-operations-to-exceed-threshold-value-ii", + "question__hide": false, + "total_acs": 3326, + "total_submitted": 9602, + "total_column_articles": 23, + "frontend_question_id": "3066", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3331, + "question__title": "Minimum Operations to Exceed Threshold Value I", + "question__title_slug": "minimum-operations-to-exceed-threshold-value-i", + "question__hide": false, + "total_acs": 4374, + "total_submitted": 4786, + "total_column_articles": 30, + "frontend_question_id": "3065", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 3330, "question__title": "Modify the Matrix", "question__title_slug": "modify-the-matrix", "question__hide": false, - "total_acs": 3088, - "total_submitted": 3961, - "total_column_articles": 16, + "total_acs": 3460, + "total_submitted": 4439, + "total_column_articles": 19, "frontend_question_id": "3033", "is_new_question": false }, @@ -8454,9 +8853,9 @@ "question__title": "Find the Length of the Longest Common Prefix", "question__title_slug": "find-the-length-of-the-longest-common-prefix", "question__hide": false, - "total_acs": 3228, - "total_submitted": 8359, - "total_column_articles": 41, + "total_acs": 3515, + "total_submitted": 8902, + "total_column_articles": 43, "frontend_question_id": "3043", "is_new_question": false }, @@ -8469,15 +8868,57 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 3327, + "question__title": "Minimum Moves to Pick K Ones", + "question__title_slug": "minimum-moves-to-pick-k-ones", + "question__hide": false, + "total_acs": 1179, + "total_submitted": 4835, + "total_column_articles": 18, + "frontend_question_id": "3086", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3326, + "question__title": "Count Pairs of Connectable Servers in a Weighted Tree Network", + "question__title_slug": "count-pairs-of-connectable-servers-in-a-weighted-tree-network", + "question__hide": false, + "total_acs": 2100, + "total_submitted": 3325, + "total_column_articles": 24, + "frontend_question_id": "3067", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 3325, "question__title": "Find the Largest Area of Square Inside Two Rectangles", "question__title_slug": "find-the-largest-area-of-square-inside-two-rectangles", "question__hide": false, - "total_acs": 2948, - "total_submitted": 6946, - "total_column_articles": 28, + "total_acs": 3436, + "total_submitted": 7872, + "total_column_articles": 30, "frontend_question_id": "3047", "is_new_question": false }, @@ -8496,9 +8937,9 @@ "question__title": "Split the Array", "question__title_slug": "split-the-array", "question__hide": false, - "total_acs": 4097, - "total_submitted": 5613, - "total_column_articles": 33, + "total_acs": 4943, + "total_submitted": 6815, + "total_column_articles": 41, "frontend_question_id": "3046", "is_new_question": false }, @@ -8517,8 +8958,8 @@ "question__title": "Maximum Number of Removal Queries That Can Be Processed I", "question__title_slug": "maximum-number-of-removal-queries-that-can-be-processed-i", "question__hide": false, - "total_acs": 229, - "total_submitted": 275, + "total_acs": 238, + "total_submitted": 313, "total_column_articles": 2, "frontend_question_id": "3018", "is_new_question": false @@ -8538,9 +8979,9 @@ "question__title": "Type of Triangle", "question__title_slug": "type-of-triangle", "question__hide": false, - "total_acs": 2993, - "total_submitted": 5299, - "total_column_articles": 29, + "total_acs": 3330, + "total_submitted": 5957, + "total_column_articles": 30, "frontend_question_id": "3024", "is_new_question": false }, @@ -8559,9 +9000,9 @@ "question__title": "Maximum Number of Operations With the Same Score I", "question__title_slug": "maximum-number-of-operations-with-the-same-score-i", "question__hide": false, - "total_acs": 2583, - "total_submitted": 3898, - "total_column_articles": 19, + "total_acs": 2973, + "total_submitted": 4478, + "total_column_articles": 22, "frontend_question_id": "3038", "is_new_question": false }, @@ -8580,8 +9021,8 @@ "question__title": "Maximum Number of Operations With the Same Score II", "question__title_slug": "maximum-number-of-operations-with-the-same-score-ii", "question__hide": false, - "total_acs": 2391, - "total_submitted": 7043, + "total_acs": 2618, + "total_submitted": 7636, "total_column_articles": 31, "frontend_question_id": "3040", "is_new_question": false @@ -8601,9 +9042,9 @@ "question__title": "Maximum Palindromes After Operations", "question__title_slug": "maximum-palindromes-after-operations", "question__hide": false, - "total_acs": 2493, - "total_submitted": 4564, - "total_column_articles": 21, + "total_acs": 2676, + "total_submitted": 4879, + "total_column_articles": 25, "frontend_question_id": "3035", "is_new_question": false }, @@ -8622,9 +9063,9 @@ "question__title": "Maximum Number of Intersections on the Chart", "question__title_slug": "maximum-number-of-intersections-on-the-chart", "question__hide": false, - "total_acs": 170, - "total_submitted": 235, - "total_column_articles": 2, + "total_acs": 190, + "total_submitted": 277, + "total_column_articles": 4, "frontend_question_id": "3009", "is_new_question": false }, @@ -8643,9 +9084,9 @@ "question__title": "Most Frequent Prime", "question__title_slug": "most-frequent-prime", "question__hide": false, - "total_acs": 2721, - "total_submitted": 5327, - "total_column_articles": 22, + "total_acs": 2966, + "total_submitted": 5764, + "total_column_articles": 23, "frontend_question_id": "3044", "is_new_question": false }, @@ -8658,15 +9099,36 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 3313, + "question__title": "Maximum Strength of K Disjoint Subarrays", + "question__title_slug": "maximum-strength-of-k-disjoint-subarrays", + "question__hide": false, + "total_acs": 2176, + "total_submitted": 5219, + "total_column_articles": 26, + "frontend_question_id": "3077", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 3312, "question__title": "Number of Changing Keys", "question__title_slug": "number-of-changing-keys", "question__hide": false, - "total_acs": 5042, - "total_submitted": 6065, - "total_column_articles": 40, + "total_acs": 5360, + "total_submitted": 6453, + "total_column_articles": 41, "frontend_question_id": "3019", "is_new_question": false }, @@ -8685,9 +9147,9 @@ "question__title": "Ant on the Boundary", "question__title_slug": "ant-on-the-boundary", "question__hide": false, - "total_acs": 4788, - "total_submitted": 5517, - "total_column_articles": 33, + "total_acs": 5516, + "total_submitted": 6459, + "total_column_articles": 41, "frontend_question_id": "3028", "is_new_question": false }, @@ -8706,9 +9168,9 @@ "question__title": "Count the Number of Houses at a Certain Distance II", "question__title_slug": "count-the-number-of-houses-at-a-certain-distance-ii", "question__hide": false, - "total_acs": 1503, - "total_submitted": 4850, - "total_column_articles": 34, + "total_acs": 1590, + "total_submitted": 5070, + "total_column_articles": 36, "frontend_question_id": "3017", "is_new_question": false }, @@ -8727,9 +9189,9 @@ "question__title": "Count Prefix and Suffix Pairs I", "question__title_slug": "count-prefix-and-suffix-pairs-i", "question__hide": false, - "total_acs": 3974, - "total_submitted": 5605, - "total_column_articles": 25, + "total_acs": 4338, + "total_submitted": 6105, + "total_column_articles": 30, "frontend_question_id": "3042", "is_new_question": false }, @@ -8748,9 +9210,9 @@ "question__title": "Apply Operations to Make String Empty", "question__title_slug": "apply-operations-to-make-string-empty", "question__hide": false, - "total_acs": 2639, - "total_submitted": 4080, - "total_column_articles": 28, + "total_acs": 2929, + "total_submitted": 4501, + "total_column_articles": 32, "frontend_question_id": "3039", "is_new_question": false }, @@ -8763,15 +9225,57 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 3307, + "question__title": "Find the Maximum Sum of Node Values", + "question__title_slug": "find-the-maximum-sum-of-node-values", + "question__hide": false, + "total_acs": 1670, + "total_submitted": 3182, + "total_column_articles": 23, + "frontend_question_id": "3068", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 3306, + "question__title": "Mark Elements on Array by Performing Queries", + "question__title_slug": "mark-elements-on-array-by-performing-queries", + "question__hide": false, + "total_acs": 2678, + "total_submitted": 5676, + "total_column_articles": 31, + "frontend_question_id": "3080", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 3305, "question__title": "Count Prefix and Suffix Pairs II", "question__title_slug": "count-prefix-and-suffix-pairs-ii", "question__hide": false, - "total_acs": 2799, - "total_submitted": 8461, - "total_column_articles": 36, + "total_acs": 3090, + "total_submitted": 9093, + "total_column_articles": 37, "frontend_question_id": "3045", "is_new_question": false }, @@ -8790,8 +9294,8 @@ "question__title": "Maximum Subtree of the Same Color", "question__title_slug": "maximum-subtree-of-the-same-color", "question__hide": false, - "total_acs": 79, - "total_submitted": 98, + "total_acs": 90, + "total_submitted": 111, "total_column_articles": 3, "frontend_question_id": "3004", "is_new_question": false @@ -8811,8 +9315,8 @@ "question__title": "Find Beautiful Indices in the Given Array II", "question__title_slug": "find-beautiful-indices-in-the-given-array-ii", "question__hide": false, - "total_acs": 3028, - "total_submitted": 10442, + "total_acs": 3093, + "total_submitted": 10604, "total_column_articles": 46, "frontend_question_id": "3008", "is_new_question": false @@ -8832,8 +9336,8 @@ "question__title": "Viewers Turned Streamers", "question__title_slug": "viewers-turned-streamers", "question__hide": false, - "total_acs": 120, - "total_submitted": 281, + "total_acs": 157, + "total_submitted": 385, "total_column_articles": 10, "frontend_question_id": "2995", "is_new_question": false @@ -8853,8 +9357,8 @@ "question__title": "Friday Purchases II ", "question__title_slug": "friday-purchases-ii", "question__hide": false, - "total_acs": 115, - "total_submitted": 159, + "total_acs": 154, + "total_submitted": 230, "total_column_articles": 8, "frontend_question_id": "2994", "is_new_question": false @@ -8874,9 +9378,9 @@ "question__title": "Friday Purchases I", "question__title_slug": "friday-purchases-i", "question__hide": false, - "total_acs": 134, - "total_submitted": 180, - "total_column_articles": 6, + "total_acs": 192, + "total_submitted": 249, + "total_column_articles": 7, "frontend_question_id": "2993", "is_new_question": false }, @@ -8895,8 +9399,8 @@ "question__title": "Find the Maximum Number of Elements in Subset", "question__title_slug": "find-the-maximum-number-of-elements-in-subset", "question__hide": false, - "total_acs": 4557, - "total_submitted": 16179, + "total_acs": 4685, + "total_submitted": 16563, "total_column_articles": 54, "frontend_question_id": "3020", "is_new_question": false @@ -8916,9 +9420,9 @@ "question__title": "Maximize Consecutive Elements in an Array After Modification", "question__title_slug": "maximize-consecutive-elements-in-an-array-after-modification", "question__hide": false, - "total_acs": 2038, - "total_submitted": 4485, - "total_column_articles": 26, + "total_acs": 2227, + "total_submitted": 4850, + "total_column_articles": 27, "frontend_question_id": "3041", "is_new_question": false }, @@ -8937,8 +9441,8 @@ "question__title": "Minimum Time to Revert Word to Initial State I", "question__title_slug": "minimum-time-to-revert-word-to-initial-state-i", "question__hide": false, - "total_acs": 3234, - "total_submitted": 7012, + "total_acs": 3386, + "total_submitted": 7316, "total_column_articles": 23, "frontend_question_id": "3029", "is_new_question": false @@ -8958,9 +9462,9 @@ "question__title": "Minimum Time to Revert Word to Initial State II", "question__title_slug": "minimum-time-to-revert-word-to-initial-state-ii", "question__hide": false, - "total_acs": 3133, - "total_submitted": 7970, - "total_column_articles": 46, + "total_acs": 3334, + "total_submitted": 8468, + "total_column_articles": 48, "frontend_question_id": "3031", "is_new_question": false }, @@ -8979,8 +9483,8 @@ "question__title": "Number of Self-Divisible Permutations", "question__title_slug": "number-of-self-divisible-permutations", "question__hide": false, - "total_acs": 89, - "total_submitted": 131, + "total_acs": 106, + "total_submitted": 154, "total_column_articles": 5, "frontend_question_id": "2992", "is_new_question": false @@ -9000,9 +9504,9 @@ "question__title": "Earliest Second to Mark Indices I", "question__title_slug": "earliest-second-to-mark-indices-i", "question__hide": false, - "total_acs": 1962, - "total_submitted": 4280, - "total_column_articles": 22, + "total_acs": 2359, + "total_submitted": 4997, + "total_column_articles": 25, "frontend_question_id": "3048", "is_new_question": false }, @@ -9021,8 +9525,8 @@ "question__title": "Find if Array Can Be Sorted", "question__title_slug": "find-if-array-can-be-sorted", "question__hide": false, - "total_acs": 3050, - "total_submitted": 5949, + "total_acs": 3172, + "total_submitted": 6143, "total_column_articles": 41, "frontend_question_id": "3011", "is_new_question": false @@ -9042,9 +9546,9 @@ "question__title": "Number of Subarrays That Match a Pattern II", "question__title_slug": "number-of-subarrays-that-match-a-pattern-ii", "question__hide": false, - "total_acs": 2288, - "total_submitted": 4727, - "total_column_articles": 24, + "total_acs": 2503, + "total_submitted": 5168, + "total_column_articles": 25, "frontend_question_id": "3036", "is_new_question": false }, @@ -9063,9 +9567,9 @@ "question__title": "Earliest Second to Mark Indices II", "question__title_slug": "earliest-second-to-mark-indices-ii", "question__hide": false, - "total_acs": 833, - "total_submitted": 2956, - "total_column_articles": 9, + "total_acs": 1156, + "total_submitted": 3837, + "total_column_articles": 12, "frontend_question_id": "3049", "is_new_question": false }, @@ -9084,8 +9588,8 @@ "question__title": "Top Three Wineries ", "question__title_slug": "top-three-wineries", "question__hide": false, - "total_acs": 119, - "total_submitted": 213, + "total_acs": 156, + "total_submitted": 299, "total_column_articles": 10, "frontend_question_id": "2991", "is_new_question": false @@ -9105,8 +9609,8 @@ "question__title": "Loan Types", "question__title_slug": "loan-types", "question__hide": false, - "total_acs": 155, - "total_submitted": 298, + "total_acs": 225, + "total_submitted": 413, "total_column_articles": 8, "frontend_question_id": "2990", "is_new_question": false @@ -9126,8 +9630,8 @@ "question__title": "Class Performance", "question__title_slug": "class-performance", "question__hide": false, - "total_acs": 184, - "total_submitted": 224, + "total_acs": 264, + "total_submitted": 315, "total_column_articles": 8, "frontend_question_id": "2989", "is_new_question": false @@ -9147,8 +9651,8 @@ "question__title": "Manager of the Largest Department", "question__title_slug": "manager-of-the-largest-department", "question__hide": false, - "total_acs": 144, - "total_submitted": 205, + "total_acs": 213, + "total_submitted": 308, "total_column_articles": 15, "frontend_question_id": "2988", "is_new_question": false @@ -9168,9 +9672,9 @@ "question__title": "Find Expensive Cities", "question__title_slug": "find-expensive-cities", "question__hide": false, - "total_acs": 162, - "total_submitted": 222, - "total_column_articles": 7, + "total_acs": 232, + "total_submitted": 305, + "total_column_articles": 8, "frontend_question_id": "2987", "is_new_question": false }, @@ -9189,9 +9693,9 @@ "question__title": "Find Third Transaction", "question__title_slug": "find-third-transaction", "question__hide": false, - "total_acs": 164, - "total_submitted": 317, - "total_column_articles": 6, + "total_acs": 218, + "total_submitted": 439, + "total_column_articles": 7, "frontend_question_id": "2986", "is_new_question": false }, @@ -9210,8 +9714,8 @@ "question__title": "Calculate Compressed Mean", "question__title_slug": "calculate-compressed-mean", "question__hide": false, - "total_acs": 163, - "total_submitted": 196, + "total_acs": 241, + "total_submitted": 284, "total_column_articles": 5, "frontend_question_id": "2985", "is_new_question": false @@ -9231,8 +9735,8 @@ "question__title": "Find Peak Calling Hours for Each City", "question__title_slug": "find-peak-calling-hours-for-each-city", "question__hide": false, - "total_acs": 139, - "total_submitted": 275, + "total_acs": 191, + "total_submitted": 373, "total_column_articles": 7, "frontend_question_id": "2984", "is_new_question": false @@ -9252,9 +9756,9 @@ "question__title": "Alice and Bob Playing Flower Game", "question__title_slug": "alice-and-bob-playing-flower-game", "question__hide": false, - "total_acs": 3713, - "total_submitted": 6791, - "total_column_articles": 28, + "total_acs": 3833, + "total_submitted": 7002, + "total_column_articles": 30, "frontend_question_id": "3021", "is_new_question": false }, @@ -9273,9 +9777,9 @@ "question__title": "Find the Number of Ways to Place People I", "question__title_slug": "find-the-number-of-ways-to-place-people-i", "question__hide": false, - "total_acs": 2142, - "total_submitted": 4113, - "total_column_articles": 15, + "total_acs": 2224, + "total_submitted": 4238, + "total_column_articles": 16, "frontend_question_id": "3025", "is_new_question": false }, @@ -9294,9 +9798,9 @@ "question__title": "Find the Number of Ways to Place People II", "question__title_slug": "find-the-number-of-ways-to-place-people-ii", "question__hide": false, - "total_acs": 2265, - "total_submitted": 4420, - "total_column_articles": 21, + "total_acs": 2411, + "total_submitted": 4633, + "total_column_articles": 24, "frontend_question_id": "3027", "is_new_question": false }, @@ -9315,9 +9819,9 @@ "question__title": "Minimum Number of Pushes to Type Word II", "question__title_slug": "minimum-number-of-pushes-to-type-word-ii", "question__hide": false, - "total_acs": 4358, - "total_submitted": 5632, - "total_column_articles": 39, + "total_acs": 4722, + "total_submitted": 6111, + "total_column_articles": 42, "frontend_question_id": "3016", "is_new_question": false }, @@ -9336,9 +9840,9 @@ "question__title": "Minimum Number of Pushes to Type Word I", "question__title_slug": "minimum-number-of-pushes-to-type-word-i", "question__hide": false, - "total_acs": 5655, - "total_submitted": 8014, - "total_column_articles": 47, + "total_acs": 6353, + "total_submitted": 9010, + "total_column_articles": 52, "frontend_question_id": "3014", "is_new_question": false }, @@ -9357,8 +9861,8 @@ "question__title": "Most Expensive Item That Can Not Be Bought", "question__title_slug": "most-expensive-item-that-can-not-be-bought", "question__hide": false, - "total_acs": 120, - "total_submitted": 137, + "total_acs": 138, + "total_submitted": 157, "total_column_articles": 6, "frontend_question_id": "2979", "is_new_question": false @@ -9378,8 +9882,8 @@ "question__title": "Find the Grid of Region Average", "question__title_slug": "find-the-grid-of-region-average", "question__hide": false, - "total_acs": 2215, - "total_submitted": 4478, + "total_acs": 2302, + "total_submitted": 4667, "total_column_articles": 25, "frontend_question_id": "3030", "is_new_question": false @@ -9399,9 +9903,9 @@ "question__title": "Count the Number of Houses at a Certain Distance I", "question__title_slug": "count-the-number-of-houses-at-a-certain-distance-i", "question__hide": false, - "total_acs": 3254, - "total_submitted": 6981, - "total_column_articles": 38, + "total_acs": 3431, + "total_submitted": 7378, + "total_column_articles": 39, "frontend_question_id": "3015", "is_new_question": false }, @@ -9420,8 +9924,8 @@ "question__title": "Minimum Moves to Capture The Queen", "question__title_slug": "minimum-moves-to-capture-the-queen", "question__hide": false, - "total_acs": 3639, - "total_submitted": 16258, + "total_acs": 3708, + "total_submitted": 16437, "total_column_articles": 55, "frontend_question_id": "3001", "is_new_question": false @@ -9441,9 +9945,9 @@ "question__title": "Number of Subarrays That Match a Pattern I", "question__title_slug": "number-of-subarrays-that-match-a-pattern-i", "question__hide": false, - "total_acs": 2563, - "total_submitted": 3300, - "total_column_articles": 8, + "total_acs": 2766, + "total_submitted": 3582, + "total_column_articles": 9, "frontend_question_id": "3034", "is_new_question": false }, @@ -9462,9 +9966,9 @@ "question__title": "Minimum Number of Coins for Fruits II", "question__title_slug": "minimum-number-of-coins-for-fruits-ii", "question__hide": false, - "total_acs": 82, - "total_submitted": 109, - "total_column_articles": 2, + "total_acs": 91, + "total_submitted": 118, + "total_column_articles": 3, "frontend_question_id": "2969", "is_new_question": false }, @@ -9483,9 +9987,9 @@ "question__title": "Find Longest Special Substring That Occurs Thrice I", "question__title_slug": "find-longest-special-substring-that-occurs-thrice-i", "question__hide": false, - "total_acs": 3717, - "total_submitted": 7668, - "total_column_articles": 32, + "total_acs": 3798, + "total_submitted": 7802, + "total_column_articles": 34, "frontend_question_id": "2981", "is_new_question": false }, @@ -9504,8 +10008,8 @@ "question__title": "Find Longest Special Substring That Occurs Thrice II", "question__title_slug": "find-longest-special-substring-that-occurs-thrice-ii", "question__hide": false, - "total_acs": 4048, - "total_submitted": 10410, + "total_acs": 4099, + "total_submitted": 10545, "total_column_articles": 68, "frontend_question_id": "2982", "is_new_question": false @@ -9525,9 +10029,9 @@ "question__title": "Maximum Good Subarray Sum", "question__title_slug": "maximum-good-subarray-sum", "question__hide": false, - "total_acs": 2330, - "total_submitted": 9924, - "total_column_articles": 31, + "total_acs": 2502, + "total_submitted": 10404, + "total_column_articles": 32, "frontend_question_id": "3026", "is_new_question": false }, @@ -9546,9 +10050,9 @@ "question__title": "Divide an Array Into Subarrays With Minimum Cost I", "question__title_slug": "divide-an-array-into-subarrays-with-minimum-cost-i", "question__hide": false, - "total_acs": 3408, - "total_submitted": 4661, - "total_column_articles": 31, + "total_acs": 3635, + "total_submitted": 4940, + "total_column_articles": 33, "frontend_question_id": "3010", "is_new_question": false }, @@ -9567,9 +10071,9 @@ "question__title": "Find Polygon With the Largest Perimeter", "question__title_slug": "find-polygon-with-the-largest-perimeter", "question__hide": false, - "total_acs": 3115, - "total_submitted": 4520, - "total_column_articles": 33, + "total_acs": 3233, + "total_submitted": 4686, + "total_column_articles": 36, "frontend_question_id": "2971", "is_new_question": false }, @@ -9588,9 +10092,9 @@ "question__title": "Minimize OR of Remaining Elements Using Operations", "question__title_slug": "minimize-or-of-remaining-elements-using-operations", "question__hide": false, - "total_acs": 1246, - "total_submitted": 2395, - "total_column_articles": 11, + "total_acs": 1363, + "total_submitted": 2559, + "total_column_articles": 13, "frontend_question_id": "3022", "is_new_question": false }, @@ -9609,9 +10113,9 @@ "question__title": "Divide an Array Into Subarrays With Minimum Cost II", "question__title_slug": "divide-an-array-into-subarrays-with-minimum-cost-ii", "question__hide": false, - "total_acs": 1562, - "total_submitted": 3688, - "total_column_articles": 31, + "total_acs": 1671, + "total_submitted": 3883, + "total_column_articles": 32, "frontend_question_id": "3013", "is_new_question": false }, @@ -9630,10 +10134,10 @@ "question__title": "Binary Tree Nodes", "question__title_slug": "binary-tree-nodes", "question__hide": false, - "total_acs": 23, - "total_submitted": 30, - "total_column_articles": 1, - "frontend_question_id": "100177", + "total_acs": 79, + "total_submitted": 103, + "total_column_articles": 2, + "frontend_question_id": "3054", "is_new_question": false }, "status": null, @@ -9651,10 +10155,10 @@ "question__title": "Classifying Triangles by Lengths", "question__title_slug": "classifying-triangles-by-lengths", "question__hide": false, - "total_acs": 37, - "total_submitted": 48, - "total_column_articles": 2, - "frontend_question_id": "100176", + "total_acs": 99, + "total_submitted": 146, + "total_column_articles": 3, + "frontend_question_id": "3053", "is_new_question": false }, "status": null, @@ -9672,10 +10176,10 @@ "question__title": "Maximize Items", "question__title_slug": "maximize-items", "question__hide": false, - "total_acs": 13, - "total_submitted": 15, + "total_acs": 48, + "total_submitted": 82, "total_column_articles": 1, - "frontend_question_id": "100175", + "frontend_question_id": "3052", "is_new_question": false }, "status": null, @@ -9693,10 +10197,10 @@ "question__title": "Find Candidates for Data Scientist Position", "question__title_slug": "find-candidates-for-data-scientist-position", "question__hide": false, - "total_acs": 54, - "total_submitted": 70, + "total_acs": 132, + "total_submitted": 179, "total_column_articles": 3, - "frontend_question_id": "100174", + "frontend_question_id": "3051", "is_new_question": false }, "status": null, @@ -9714,10 +10218,10 @@ "question__title": "Pizza Toppings Cost Analysis", "question__title_slug": "pizza-toppings-cost-analysis", "question__hide": false, - "total_acs": 30, - "total_submitted": 42, + "total_acs": 76, + "total_submitted": 120, "total_column_articles": 2, - "frontend_question_id": "100173", + "frontend_question_id": "3050", "is_new_question": false }, "status": null, @@ -9735,8 +10239,8 @@ "question__title": "Number of Divisible Triplet Sums", "question__title_slug": "number-of-divisible-triplet-sums", "question__hide": false, - "total_acs": 150, - "total_submitted": 185, + "total_acs": 160, + "total_submitted": 204, "total_column_articles": 6, "frontend_question_id": "2964", "is_new_question": false @@ -9756,8 +10260,8 @@ "question__title": "Symmetric Coordinates", "question__title_slug": "symmetric-coordinates", "question__hide": false, - "total_acs": 156, - "total_submitted": 326, + "total_acs": 204, + "total_submitted": 462, "total_column_articles": 5, "frontend_question_id": "2978", "is_new_question": false @@ -9777,9 +10281,9 @@ "question__title": "Count the Number of Incremovable Subarrays I", "question__title_slug": "count-the-number-of-incremovable-subarrays-i", "question__hide": false, - "total_acs": 2608, - "total_submitted": 4330, - "total_column_articles": 28, + "total_acs": 2715, + "total_submitted": 4487, + "total_column_articles": 30, "frontend_question_id": "2970", "is_new_question": false }, @@ -9798,8 +10302,8 @@ "question__title": "Maximum Area of Longest Diagonal Rectangle", "question__title_slug": "maximum-area-of-longest-diagonal-rectangle", "question__hide": false, - "total_acs": 5046, - "total_submitted": 11556, + "total_acs": 5207, + "total_submitted": 11853, "total_column_articles": 34, "frontend_question_id": "3000", "is_new_question": false @@ -9819,8 +10323,8 @@ "question__title": "Maximum Square Area by Removing Fences From a Field", "question__title_slug": "maximum-square-area-by-removing-fences-from-a-field", "question__hide": false, - "total_acs": 4761, - "total_submitted": 16003, + "total_acs": 4801, + "total_submitted": 16128, "total_column_articles": 45, "frontend_question_id": "2975", "is_new_question": false @@ -9840,9 +10344,9 @@ "question__title": "Minimum Number of Operations to Make Array XOR Equal to K", "question__title_slug": "minimum-number-of-operations-to-make-array-xor-equal-to-k", "question__hide": false, - "total_acs": 2732, - "total_submitted": 3262, - "total_column_articles": 25, + "total_acs": 2852, + "total_submitted": 3389, + "total_column_articles": 26, "frontend_question_id": "2997", "is_new_question": false }, @@ -9861,8 +10365,8 @@ "question__title": "Count the Number of Incremovable Subarrays II", "question__title_slug": "count-the-number-of-incremovable-subarrays-ii", "question__hide": false, - "total_acs": 2120, - "total_submitted": 4016, + "total_acs": 2186, + "total_submitted": 4134, "total_column_articles": 34, "frontend_question_id": "2972", "is_new_question": false @@ -9882,8 +10386,8 @@ "question__title": "Number of Same-End Substrings", "question__title_slug": "number-of-same-end-substrings", "question__hide": false, - "total_acs": 141, - "total_submitted": 167, + "total_acs": 150, + "total_submitted": 178, "total_column_articles": 5, "frontend_question_id": "2955", "is_new_question": false @@ -9903,8 +10407,8 @@ "question__title": "Check if Bitwise OR Has Trailing Zeros", "question__title_slug": "check-if-bitwise-or-has-trailing-zeros", "question__hide": false, - "total_acs": 4662, - "total_submitted": 6164, + "total_acs": 4879, + "total_submitted": 6434, "total_column_articles": 34, "frontend_question_id": "2980", "is_new_question": false @@ -9924,9 +10428,9 @@ "question__title": "Find Beautiful Indices in the Given Array I", "question__title_slug": "find-beautiful-indices-in-the-given-array-i", "question__hide": false, - "total_acs": 4347, - "total_submitted": 10029, - "total_column_articles": 26, + "total_acs": 4446, + "total_submitted": 10201, + "total_column_articles": 27, "frontend_question_id": "3006", "is_new_question": false }, @@ -9945,9 +10449,9 @@ "question__title": "Minimize Length of Array Using Operations", "question__title_slug": "minimize-length-of-array-using-operations", "question__hide": false, - "total_acs": 2035, - "total_submitted": 6296, - "total_column_articles": 22, + "total_acs": 2115, + "total_submitted": 6454, + "total_column_articles": 23, "frontend_question_id": "3012", "is_new_question": false }, @@ -9966,9 +10470,9 @@ "question__title": "Count the Number of Powerful Integers", "question__title_slug": "count-the-number-of-powerful-integers", "question__hide": false, - "total_acs": 1931, - "total_submitted": 4961, - "total_column_articles": 37, + "total_acs": 1986, + "total_submitted": 5076, + "total_column_articles": 38, "frontend_question_id": "2999", "is_new_question": false }, @@ -9987,9 +10491,9 @@ "question__title": "Count Elements With Maximum Frequency", "question__title_slug": "count-elements-with-maximum-frequency", "question__hide": false, - "total_acs": 5803, - "total_submitted": 7423, - "total_column_articles": 41, + "total_acs": 6184, + "total_submitted": 7912, + "total_column_articles": 43, "frontend_question_id": "3005", "is_new_question": false }, @@ -10008,8 +10512,8 @@ "question__title": "Divide Array Into Arrays With Max Difference", "question__title_slug": "divide-array-into-arrays-with-max-difference", "question__hide": false, - "total_acs": 4911, - "total_submitted": 7360, + "total_acs": 5003, + "total_submitted": 7474, "total_column_articles": 37, "frontend_question_id": "2966", "is_new_question": false @@ -10029,8 +10533,8 @@ "question__title": "Maximum Number That Sum of the Prices Is Less Than or Equal to K", "question__title_slug": "maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k", "question__hide": false, - "total_acs": 2852, - "total_submitted": 6767, + "total_acs": 2956, + "total_submitted": 7019, "total_column_articles": 42, "frontend_question_id": "3007", "is_new_question": false @@ -10050,9 +10554,9 @@ "question__title": "Minimum Number of Operations to Make X and Y Equal", "question__title_slug": "minimum-number-of-operations-to-make-x-and-y-equal", "question__hide": false, - "total_acs": 2835, - "total_submitted": 6086, - "total_column_articles": 27, + "total_acs": 2969, + "total_submitted": 6351, + "total_column_articles": 29, "frontend_question_id": "2998", "is_new_question": false }, @@ -10071,8 +10575,8 @@ "question__title": "Minimum Cost to Convert String II", "question__title_slug": "minimum-cost-to-convert-string-ii", "question__hide": false, - "total_acs": 2093, - "total_submitted": 7207, + "total_acs": 2147, + "total_submitted": 7364, "total_column_articles": 22, "frontend_question_id": "2977", "is_new_question": false @@ -10092,8 +10596,8 @@ "question__title": "Number of Divisible Substrings", "question__title_slug": "number-of-divisible-substrings", "question__hide": false, - "total_acs": 185, - "total_submitted": 215, + "total_acs": 201, + "total_submitted": 233, "total_column_articles": 6, "frontend_question_id": "2950", "is_new_question": false @@ -10113,9 +10617,9 @@ "question__title": "Smallest Missing Integer Greater Than Sequential Prefix Sum", "question__title_slug": "smallest-missing-integer-greater-than-sequential-prefix-sum", "question__hide": false, - "total_acs": 3080, - "total_submitted": 8408, - "total_column_articles": 23, + "total_acs": 3286, + "total_submitted": 8936, + "total_column_articles": 25, "frontend_question_id": "2996", "is_new_question": false }, @@ -10134,8 +10638,8 @@ "question__title": "Minimum Cost to Convert String I", "question__title_slug": "minimum-cost-to-convert-string-i", "question__hide": false, - "total_acs": 3131, - "total_submitted": 6909, + "total_acs": 3244, + "total_submitted": 7129, "total_column_articles": 35, "frontend_question_id": "2976", "is_new_question": false @@ -10155,8 +10659,8 @@ "question__title": "Double Modular Exponentiation", "question__title_slug": "double-modular-exponentiation", "question__hide": false, - "total_acs": 4696, - "total_submitted": 9876, + "total_acs": 4815, + "total_submitted": 10077, "total_column_articles": 36, "frontend_question_id": "2961", "is_new_question": false @@ -10176,9 +10680,9 @@ "question__title": "Maximize the Number of Partitions After Operations", "question__title_slug": "maximize-the-number-of-partitions-after-operations", "question__hide": false, - "total_acs": 1355, - "total_submitted": 4347, - "total_column_articles": 23, + "total_acs": 1421, + "total_submitted": 4488, + "total_column_articles": 24, "frontend_question_id": "3003", "is_new_question": false }, @@ -10197,8 +10701,8 @@ "question__title": "Maximum GCD-Sum of a Subarray", "question__title_slug": "maximum-gcd-sum-of-a-subarray", "question__hide": false, - "total_acs": 239, - "total_submitted": 307, + "total_acs": 248, + "total_submitted": 326, "total_column_articles": 3, "frontend_question_id": "2941", "is_new_question": false @@ -10218,8 +10722,8 @@ "question__title": "Minimum Number of Coins to be Added", "question__title_slug": "minimum-number-of-coins-to-be-added", "question__hide": false, - "total_acs": 4266, - "total_submitted": 8461, + "total_acs": 4311, + "total_submitted": 8534, "total_column_articles": 58, "frontend_question_id": "2952", "is_new_question": false @@ -10239,9 +10743,9 @@ "question__title": "Remove Adjacent Almost-Equal Characters", "question__title_slug": "remove-adjacent-almost-equal-characters", "question__hide": false, - "total_acs": 3385, - "total_submitted": 5792, - "total_column_articles": 36, + "total_acs": 3480, + "total_submitted": 5920, + "total_column_articles": 37, "frontend_question_id": "2957", "is_new_question": false }, @@ -10260,8 +10764,8 @@ "question__title": "Minimum Cost to Make Array Equalindromic", "question__title_slug": "minimum-cost-to-make-array-equalindromic", "question__hide": false, - "total_acs": 3795, - "total_submitted": 16580, + "total_acs": 3882, + "total_submitted": 16758, "total_column_articles": 58, "frontend_question_id": "2967", "is_new_question": false @@ -10281,9 +10785,9 @@ "question__title": "Maximum Size of a Set After Removals", "question__title_slug": "maximum-size-of-a-set-after-removals", "question__hide": false, - "total_acs": 3756, - "total_submitted": 8152, - "total_column_articles": 53, + "total_acs": 3840, + "total_submitted": 8287, + "total_column_articles": 54, "frontend_question_id": "3002", "is_new_question": false }, @@ -10302,9 +10806,9 @@ "question__title": "Find Missing and Repeated Values", "question__title_slug": "find-missing-and-repeated-values", "question__hide": false, - "total_acs": 5523, - "total_submitted": 6958, - "total_column_articles": 59, + "total_acs": 5745, + "total_submitted": 7211, + "total_column_articles": 62, "frontend_question_id": "2965", "is_new_question": false }, @@ -10323,9 +10827,9 @@ "question__title": "Minimum Number Game", "question__title_slug": "minimum-number-game", "question__hide": false, - "total_acs": 6672, - "total_submitted": 7689, - "total_column_articles": 60, + "total_acs": 7196, + "total_submitted": 8343, + "total_column_articles": 65, "frontend_question_id": "2974", "is_new_question": false }, @@ -10344,9 +10848,9 @@ "question__title": "Length of Longest Subarray With at Most K Frequency", "question__title_slug": "length-of-longest-subarray-with-at-most-k-frequency", "question__hide": false, - "total_acs": 3619, - "total_submitted": 7526, - "total_column_articles": 33, + "total_acs": 3962, + "total_submitted": 8084, + "total_column_articles": 37, "frontend_question_id": "2958", "is_new_question": false }, @@ -10365,8 +10869,8 @@ "question__title": "Count the Number of Infection Sequences", "question__title_slug": "count-the-number-of-infection-sequences", "question__hide": false, - "total_acs": 1381, - "total_submitted": 3472, + "total_acs": 1410, + "total_submitted": 3535, "total_column_articles": 19, "frontend_question_id": "2954", "is_new_question": false @@ -10386,9 +10890,9 @@ "question__title": "Count Complete Substrings", "question__title_slug": "count-complete-substrings", "question__hide": false, - "total_acs": 3554, - "total_submitted": 10425, - "total_column_articles": 42, + "total_acs": 3646, + "total_submitted": 10604, + "total_column_articles": 43, "frontend_question_id": "2953", "is_new_question": false }, @@ -10407,9 +10911,9 @@ "question__title": "Number of Equal Numbers Blocks", "question__title_slug": "number-of-equal-numbers-blocks", "question__hide": false, - "total_acs": 165, - "total_submitted": 221, - "total_column_articles": 7, + "total_acs": 172, + "total_submitted": 231, + "total_column_articles": 8, "frontend_question_id": "2936", "is_new_question": false }, @@ -10428,9 +10932,9 @@ "question__title": "Find the Peaks", "question__title_slug": "find-the-peaks", "question__hide": false, - "total_acs": 6762, - "total_submitted": 8575, - "total_column_articles": 33, + "total_acs": 7026, + "total_submitted": 8904, + "total_column_articles": 35, "frontend_question_id": "2951", "is_new_question": false }, @@ -10449,9 +10953,9 @@ "question__title": "Count Tested Devices After Test Operations", "question__title_slug": "count-tested-devices-after-test-operations", "question__hide": false, - "total_acs": 6108, - "total_submitted": 7266, - "total_column_articles": 52, + "total_acs": 6331, + "total_submitted": 7557, + "total_column_articles": 53, "frontend_question_id": "2960", "is_new_question": false }, @@ -10470,9 +10974,9 @@ "question__title": "Make Lexicographically Smallest Array by Swapping Elements", "question__title_slug": "make-lexicographically-smallest-array-by-swapping-elements", "question__hide": false, - "total_acs": 3337, - "total_submitted": 7536, - "total_column_articles": 43, + "total_acs": 3392, + "total_submitted": 7646, + "total_column_articles": 44, "frontend_question_id": "2948", "is_new_question": false }, @@ -10491,9 +10995,9 @@ "question__title": "Find Number of Coins to Place in Tree Nodes", "question__title_slug": "find-number-of-coins-to-place-in-tree-nodes", "question__hide": false, - "total_acs": 1795, - "total_submitted": 3819, - "total_column_articles": 25, + "total_acs": 1856, + "total_submitted": 4006, + "total_column_articles": 26, "frontend_question_id": "2973", "is_new_question": false }, @@ -10512,8 +11016,8 @@ "question__title": "Number of Possible Sets of Closing Branches", "question__title_slug": "number-of-possible-sets-of-closing-branches", "question__hide": false, - "total_acs": 2189, - "total_submitted": 3724, + "total_acs": 2251, + "total_submitted": 3822, "total_column_articles": 32, "frontend_question_id": "2959", "is_new_question": false @@ -10533,8 +11037,8 @@ "question__title": "Distribute Candies Among Children III", "question__title_slug": "distribute-candies-among-children-iii", "question__hide": false, - "total_acs": 87, - "total_submitted": 140, + "total_acs": 93, + "total_submitted": 153, "total_column_articles": 3, "frontend_question_id": "2927", "is_new_question": false @@ -10554,9 +11058,9 @@ "question__title": "Matrix Similarity After Cyclic Shifts", "question__title_slug": "matrix-similarity-after-cyclic-shifts", "question__hide": false, - "total_acs": 5438, - "total_submitted": 8852, - "total_column_articles": 40, + "total_acs": 5591, + "total_submitted": 9070, + "total_column_articles": 42, "frontend_question_id": "2946", "is_new_question": false }, @@ -10575,8 +11079,8 @@ "question__title": "Maximize Area of Square Hole in Grid", "question__title_slug": "maximize-area-of-square-hole-in-grid", "question__hide": false, - "total_acs": 2747, - "total_submitted": 7122, + "total_acs": 2800, + "total_submitted": 7233, "total_column_articles": 24, "frontend_question_id": "2943", "is_new_question": false @@ -10596,9 +11100,9 @@ "question__title": "Count Subarrays Where Max Element Appears at Least K Times", "question__title_slug": "count-subarrays-where-max-element-appears-at-least-k-times", "question__hide": false, - "total_acs": 5422, - "total_submitted": 11368, - "total_column_articles": 71, + "total_acs": 5756, + "total_submitted": 11965, + "total_column_articles": 73, "frontend_question_id": "2962", "is_new_question": false }, @@ -10617,8 +11121,8 @@ "question__title": "Count the Number of Good Partitions", "question__title_slug": "count-the-number-of-good-partitions", "question__hide": false, - "total_acs": 3489, - "total_submitted": 6935, + "total_acs": 3543, + "total_submitted": 7029, "total_column_articles": 52, "frontend_question_id": "2963", "is_new_question": false @@ -10638,8 +11142,8 @@ "question__title": "Find Maximum Non-decreasing Array Length", "question__title_slug": "find-maximum-non-decreasing-array-length", "question__hide": false, - "total_acs": 1118, - "total_submitted": 4351, + "total_acs": 1147, + "total_submitted": 4442, "total_column_articles": 17, "frontend_question_id": "2945", "is_new_question": false @@ -10659,8 +11163,8 @@ "question__title": "Count Beautiful Substrings I", "question__title_slug": "count-beautiful-substrings-i", "question__hide": false, - "total_acs": 4268, - "total_submitted": 7285, + "total_acs": 4323, + "total_submitted": 7358, "total_column_articles": 30, "frontend_question_id": "2947", "is_new_question": false @@ -10680,9 +11184,9 @@ "question__title": "Minimum Number of Coins for Fruits", "question__title_slug": "minimum-number-of-coins-for-fruits", "question__hide": false, - "total_acs": 3931, - "total_submitted": 6514, - "total_column_articles": 47, + "total_acs": 4101, + "total_submitted": 6828, + "total_column_articles": 48, "frontend_question_id": "2944", "is_new_question": false }, @@ -10701,8 +11205,8 @@ "question__title": "Count Beautiful Substrings II", "question__title_slug": "count-beautiful-substrings-ii", "question__hide": false, - "total_acs": 2138, - "total_submitted": 6562, + "total_acs": 2233, + "total_submitted": 6800, "total_column_articles": 28, "frontend_question_id": "2949", "is_new_question": false @@ -10722,8 +11226,8 @@ "question__title": "Make Three Strings Equal", "question__title_slug": "make-three-strings-equal", "question__hide": false, - "total_acs": 6100, - "total_submitted": 13153, + "total_acs": 6247, + "total_submitted": 13433, "total_column_articles": 58, "frontend_question_id": "2937", "is_new_question": false @@ -10743,9 +11247,9 @@ "question__title": "Find Common Elements Between Two Arrays", "question__title_slug": "find-common-elements-between-two-arrays", "question__hide": false, - "total_acs": 3937, - "total_submitted": 4911, - "total_column_articles": 36, + "total_acs": 4155, + "total_submitted": 5190, + "total_column_articles": 40, "frontend_question_id": "2956", "is_new_question": false }, @@ -10764,9 +11268,9 @@ "question__title": "Market Analysis III", "question__title_slug": "market-analysis-iii", "question__hide": false, - "total_acs": 231, - "total_submitted": 638, - "total_column_articles": 4, + "total_acs": 275, + "total_submitted": 843, + "total_column_articles": 5, "frontend_question_id": "2922", "is_new_question": false }, @@ -10785,8 +11289,8 @@ "question__title": "Maximum Profitable Triplets With Increasing Prices II", "question__title_slug": "maximum-profitable-triplets-with-increasing-prices-ii", "question__hide": false, - "total_acs": 127, - "total_submitted": 179, + "total_acs": 137, + "total_submitted": 195, "total_column_articles": 6, "frontend_question_id": "2921", "is_new_question": false @@ -10806,9 +11310,9 @@ "question__title": "Palindrome Rearrangement Queries", "question__title_slug": "palindrome-rearrangement-queries", "question__hide": false, - "total_acs": 1290, - "total_submitted": 4137, - "total_column_articles": 22, + "total_acs": 1328, + "total_submitted": 4224, + "total_column_articles": 21, "frontend_question_id": "2983", "is_new_question": false }, @@ -10827,9 +11331,9 @@ "question__title": "High-Access Employees", "question__title_slug": "high-access-employees", "question__hide": false, - "total_acs": 4923, - "total_submitted": 9878, - "total_column_articles": 43, + "total_acs": 4978, + "total_submitted": 9978, + "total_column_articles": 46, "frontend_question_id": "2933", "is_new_question": false }, @@ -10848,9 +11352,9 @@ "question__title": "Distribute Candies Among Children II", "question__title_slug": "distribute-candies-among-children-ii", "question__hide": false, - "total_acs": 2926, - "total_submitted": 7856, - "total_column_articles": 47, + "total_acs": 3019, + "total_submitted": 8084, + "total_column_articles": 48, "frontend_question_id": "2929", "is_new_question": false }, @@ -10869,8 +11373,8 @@ "question__title": "Number of Strings Which Can Be Rearranged to Contain Substring", "question__title_slug": "number-of-strings-which-can-be-rearranged-to-contain-substring", "question__hide": false, - "total_acs": 1952, - "total_submitted": 3130, + "total_acs": 1994, + "total_submitted": 3196, "total_column_articles": 28, "frontend_question_id": "2930", "is_new_question": false @@ -10890,9 +11394,9 @@ "question__title": "Distribute Candies Among Children I", "question__title_slug": "distribute-candies-among-children-i", "question__hide": false, - "total_acs": 3738, - "total_submitted": 5019, - "total_column_articles": 22, + "total_acs": 3905, + "total_submitted": 5257, + "total_column_articles": 23, "frontend_question_id": "2928", "is_new_question": false }, @@ -10911,8 +11415,8 @@ "question__title": "Number of Ways to Reach Destination in the Grid", "question__title_slug": "number-of-ways-to-reach-destination-in-the-grid", "question__hide": false, - "total_acs": 125, - "total_submitted": 162, + "total_acs": 129, + "total_submitted": 172, "total_column_articles": 5, "frontend_question_id": "2912", "is_new_question": false @@ -10932,9 +11436,9 @@ "question__title": "Maximum Strong Pair XOR II", "question__title_slug": "maximum-strong-pair-xor-ii", "question__hide": false, - "total_acs": 3602, - "total_submitted": 9268, - "total_column_articles": 32, + "total_acs": 3678, + "total_submitted": 9390, + "total_column_articles": 34, "frontend_question_id": "2935", "is_new_question": false }, @@ -10953,8 +11457,8 @@ "question__title": "Apply Operations to Maximize Frequency Score", "question__title_slug": "apply-operations-to-maximize-frequency-score", "question__hide": false, - "total_acs": 2291, - "total_submitted": 4789, + "total_acs": 2363, + "total_submitted": 4902, "total_column_articles": 22, "frontend_question_id": "2968", "is_new_question": false @@ -10974,8 +11478,8 @@ "question__title": "Separate Black and White Balls", "question__title_slug": "separate-black-and-white-balls", "question__hide": false, - "total_acs": 5834, - "total_submitted": 10805, + "total_acs": 5946, + "total_submitted": 10962, "total_column_articles": 67, "frontend_question_id": "2938", "is_new_question": false @@ -10995,9 +11499,9 @@ "question__title": "Find Words Containing Character", "question__title_slug": "find-words-containing-character", "question__hide": false, - "total_acs": 5641, - "total_submitted": 6416, - "total_column_articles": 40, + "total_acs": 6200, + "total_submitted": 7099, + "total_column_articles": 43, "frontend_question_id": "2942", "is_new_question": false }, @@ -11016,9 +11520,9 @@ "question__title": "Maximum Strong Pair XOR I", "question__title_slug": "maximum-strong-pair-xor-i", "question__hide": false, - "total_acs": 5623, - "total_submitted": 7465, - "total_column_articles": 21, + "total_acs": 5804, + "total_submitted": 7717, + "total_column_articles": 23, "frontend_question_id": "2932", "is_new_question": false }, @@ -11037,9 +11541,9 @@ "question__title": "Maximum Xor Product", "question__title_slug": "maximum-xor-product", "question__hide": false, - "total_acs": 3478, - "total_submitted": 11445, - "total_column_articles": 42, + "total_acs": 3543, + "total_submitted": 11583, + "total_column_articles": 43, "frontend_question_id": "2939", "is_new_question": false }, @@ -11058,9 +11562,9 @@ "question__title": "Maximum Score After Applying Operations on a Tree", "question__title_slug": "maximum-score-after-applying-operations-on-a-tree", "question__hide": false, - "total_acs": 4006, - "total_submitted": 8447, - "total_column_articles": 54, + "total_acs": 4087, + "total_submitted": 8592, + "total_column_articles": 56, "frontend_question_id": "2925", "is_new_question": false }, @@ -11079,8 +11583,8 @@ "question__title": "Minimum Operations to Maximize Last Elements in Arrays", "question__title_slug": "minimum-operations-to-maximize-last-elements-in-arrays", "question__hide": false, - "total_acs": 4078, - "total_submitted": 8632, + "total_acs": 4142, + "total_submitted": 8732, "total_column_articles": 45, "frontend_question_id": "2934", "is_new_question": false @@ -11100,9 +11604,9 @@ "question__title": "Find Champion II", "question__title_slug": "find-champion-ii", "question__hide": false, - "total_acs": 5597, - "total_submitted": 9898, - "total_column_articles": 52, + "total_acs": 5700, + "total_submitted": 10040, + "total_column_articles": 53, "frontend_question_id": "2924", "is_new_question": false }, @@ -11121,9 +11625,9 @@ "question__title": "Find Champion I", "question__title_slug": "find-champion-i", "question__hide": false, - "total_acs": 6520, - "total_submitted": 8569, - "total_column_articles": 59, + "total_acs": 6710, + "total_submitted": 8816, + "total_column_articles": 60, "frontend_question_id": "2923", "is_new_question": false }, @@ -11142,8 +11646,8 @@ "question__title": "Maximum Profitable Triplets With Increasing Prices I", "question__title_slug": "maximum-profitable-triplets-with-increasing-prices-i", "question__hide": false, - "total_acs": 257, - "total_submitted": 387, + "total_acs": 266, + "total_submitted": 405, "total_column_articles": 12, "frontend_question_id": "2907", "is_new_question": false @@ -11163,8 +11667,8 @@ "question__title": "Minimum Sum of Mountain Triplets II", "question__title_slug": "minimum-sum-of-mountain-triplets-ii", "question__hide": false, - "total_acs": 6604, - "total_submitted": 12904, + "total_acs": 6734, + "total_submitted": 13157, "total_column_articles": 65, "frontend_question_id": "2909", "is_new_question": false @@ -11184,9 +11688,9 @@ "question__title": "Maximum Balanced Subsequence Sum", "question__title_slug": "maximum-balanced-subsequence-sum", "question__hide": false, - "total_acs": 2811, - "total_submitted": 7348, - "total_column_articles": 38, + "total_acs": 2865, + "total_submitted": 7477, + "total_column_articles": 40, "frontend_question_id": "2926", "is_new_question": false }, @@ -11205,9 +11709,9 @@ "question__title": "Find the K-or of an Array", "question__title_slug": "find-the-k-or-of-an-array", "question__hide": false, - "total_acs": 5857, - "total_submitted": 8214, - "total_column_articles": 36, + "total_acs": 25431, + "total_submitted": 31780, + "total_column_articles": 109, "frontend_question_id": "2917", "is_new_question": false }, @@ -11226,8 +11730,8 @@ "question__title": "Maximum Linear Stock Score", "question__title_slug": "maximum-linear-stock-score", "question__hide": false, - "total_acs": 112, - "total_submitted": 159, + "total_acs": 128, + "total_submitted": 177, "total_column_articles": 7, "frontend_question_id": "2898", "is_new_question": false @@ -11247,9 +11751,9 @@ "question__title": "Find Building Where Alice and Bob Can Meet", "question__title_slug": "find-building-where-alice-and-bob-can-meet", "question__hide": false, - "total_acs": 3149, - "total_submitted": 6750, - "total_column_articles": 56, + "total_acs": 3202, + "total_submitted": 6859, + "total_column_articles": 59, "frontend_question_id": "2940", "is_new_question": false }, @@ -11268,8 +11772,8 @@ "question__title": "Maximum Points After Collecting Coins From All Nodes", "question__title_slug": "maximum-points-after-collecting-coins-from-all-nodes", "question__hide": false, - "total_acs": 2871, - "total_submitted": 6806, + "total_acs": 2924, + "total_submitted": 6932, "total_column_articles": 26, "frontend_question_id": "2920", "is_new_question": false @@ -11289,9 +11793,9 @@ "question__title": "Minimum Increment Operations to Make Array Beautiful", "question__title_slug": "minimum-increment-operations-to-make-array-beautiful", "question__hide": false, - "total_acs": 4358, - "total_submitted": 11002, - "total_column_articles": 51, + "total_acs": 4458, + "total_submitted": 11223, + "total_column_articles": 55, "frontend_question_id": "2919", "is_new_question": false }, @@ -11310,8 +11814,8 @@ "question__title": "Minimizing Array After Replacing Pairs With Their Product", "question__title_slug": "minimizing-array-after-replacing-pairs-with-their-product", "question__hide": false, - "total_acs": 127, - "total_submitted": 257, + "total_acs": 131, + "total_submitted": 267, "total_column_articles": 3, "frontend_question_id": "2892", "is_new_question": false @@ -11331,8 +11835,8 @@ "question__title": "Minimum Sum of Mountain Triplets I", "question__title_slug": "minimum-sum-of-mountain-triplets-i", "question__hide": false, - "total_acs": 7264, - "total_submitted": 10939, + "total_acs": 7420, + "total_submitted": 11139, "total_column_articles": 49, "frontend_question_id": "2908", "is_new_question": false @@ -11352,9 +11856,9 @@ "question__title": "Minimum Number of Changes to Make Binary String Beautiful", "question__title_slug": "minimum-number-of-changes-to-make-binary-string-beautiful", "question__hide": false, - "total_acs": 3352, - "total_submitted": 4464, - "total_column_articles": 36, + "total_acs": 3428, + "total_submitted": 4559, + "total_column_articles": 37, "frontend_question_id": "2914", "is_new_question": false }, @@ -11373,9 +11877,9 @@ "question__title": "The Wording Game", "question__title_slug": "the-wording-game", "question__hide": false, - "total_acs": 95, - "total_submitted": 171, - "total_column_articles": 3, + "total_acs": 100, + "total_submitted": 184, + "total_column_articles": 4, "frontend_question_id": "2868", "is_new_question": false }, @@ -11394,9 +11898,9 @@ "question__title": "Divisible and Non-divisible Sums Difference", "question__title_slug": "divisible-and-non-divisible-sums-difference", "question__hide": false, - "total_acs": 7829, - "total_submitted": 8964, - "total_column_articles": 47, + "total_acs": 8286, + "total_submitted": 9487, + "total_column_articles": 54, "frontend_question_id": "2894", "is_new_question": false }, @@ -11415,9 +11919,9 @@ "question__title": "Minimum Equal Sum of Two Arrays After Replacing Zeros", "question__title_slug": "minimum-equal-sum-of-two-arrays-after-replacing-zeros", "question__hide": false, - "total_acs": 5588, - "total_submitted": 15666, - "total_column_articles": 62, + "total_acs": 5786, + "total_submitted": 16070, + "total_column_articles": 67, "frontend_question_id": "2918", "is_new_question": false }, @@ -11436,8 +11940,8 @@ "question__title": "Find Indices With Index and Value Difference II", "question__title_slug": "find-indices-with-index-and-value-difference-ii", "question__hide": false, - "total_acs": 4978, - "total_submitted": 12953, + "total_acs": 5060, + "total_submitted": 13123, "total_column_articles": 44, "frontend_question_id": "2905", "is_new_question": false @@ -11457,9 +11961,9 @@ "question__title": "Minimum Number of Groups to Create a Valid Assignment", "question__title_slug": "minimum-number-of-groups-to-create-a-valid-assignment", "question__hide": false, - "total_acs": 4966, - "total_submitted": 16703, - "total_column_articles": 63, + "total_acs": 5027, + "total_submitted": 16863, + "total_column_articles": 64, "frontend_question_id": "2910", "is_new_question": false }, @@ -11478,8 +11982,8 @@ "question__title": "Find Indices With Index and Value Difference I", "question__title_slug": "find-indices-with-index-and-value-difference-i", "question__hide": false, - "total_acs": 6851, - "total_submitted": 9803, + "total_acs": 7048, + "total_submitted": 10088, "total_column_articles": 40, "frontend_question_id": "2903", "is_new_question": false @@ -11499,9 +12003,9 @@ "question__title": "Last Visited Integers", "question__title_slug": "last-visited-integers", "question__hide": false, - "total_acs": 3814, - "total_submitted": 5385, - "total_column_articles": 37, + "total_acs": 3904, + "total_submitted": 5528, + "total_column_articles": 39, "frontend_question_id": "2899", "is_new_question": false }, @@ -11520,9 +12024,9 @@ "question__title": "Subarrays Distinct Element Sum of Squares I", "question__title_slug": "subarrays-distinct-element-sum-of-squares-i", "question__hide": false, - "total_acs": 3632, - "total_submitted": 4547, - "total_column_articles": 25, + "total_acs": 3735, + "total_submitted": 4678, + "total_column_articles": 27, "frontend_question_id": "2913", "is_new_question": false }, @@ -11541,9 +12045,9 @@ "question__title": "Calculate Orders Within Each Interval", "question__title_slug": "calculate-orders-within-each-interval", "question__hide": false, - "total_acs": 376, - "total_submitted": 513, - "total_column_articles": 8, + "total_acs": 429, + "total_submitted": 596, + "total_column_articles": 9, "frontend_question_id": "2893", "is_new_question": false }, @@ -11562,8 +12066,8 @@ "question__title": "Maximum Length of Semi-Decreasing Subarrays", "question__title_slug": "maximum-length-of-semi-decreasing-subarrays", "question__hide": false, - "total_acs": 262, - "total_submitted": 359, + "total_acs": 296, + "total_submitted": 408, "total_column_articles": 14, "frontend_question_id": "2863", "is_new_question": false @@ -11583,8 +12087,8 @@ "question__title": "Rolling Average Steps", "question__title_slug": "rolling-average-steps", "question__hide": false, - "total_acs": 348, - "total_submitted": 532, + "total_acs": 398, + "total_submitted": 634, "total_column_articles": 11, "frontend_question_id": "2854", "is_new_question": false @@ -11604,8 +12108,8 @@ "question__title": "Highest Salaries Difference", "question__title_slug": "highest-salaries-difference", "question__hide": false, - "total_acs": 445, - "total_submitted": 623, + "total_acs": 504, + "total_submitted": 719, "total_column_articles": 12, "frontend_question_id": "2853", "is_new_question": false @@ -11625,9 +12129,9 @@ "question__title": "Maximum Value of an Ordered Triplet I", "question__title_slug": "maximum-value-of-an-ordered-triplet-i", "question__hide": false, - "total_acs": 5541, - "total_submitted": 10169, - "total_column_articles": 24, + "total_acs": 5692, + "total_submitted": 10469, + "total_column_articles": 26, "frontend_question_id": "2873", "is_new_question": false }, @@ -11646,9 +12150,9 @@ "question__title": "Apply Operations on Array to Maximize Sum of Squares", "question__title_slug": "apply-operations-on-array-to-maximize-sum-of-squares", "question__hide": false, - "total_acs": 2398, - "total_submitted": 4185, - "total_column_articles": 26, + "total_acs": 2447, + "total_submitted": 4258, + "total_column_articles": 27, "frontend_question_id": "2897", "is_new_question": false }, @@ -11667,8 +12171,8 @@ "question__title": "Maximum Value of an Ordered Triplet II", "question__title_slug": "maximum-value-of-an-ordered-triplet-ii", "question__hide": false, - "total_acs": 5196, - "total_submitted": 10954, + "total_acs": 5290, + "total_submitted": 11125, "total_column_articles": 39, "frontend_question_id": "2874", "is_new_question": false @@ -11688,9 +12192,9 @@ "question__title": "Minimum Processing Time", "question__title_slug": "minimum-processing-time", "question__hide": false, - "total_acs": 5382, - "total_submitted": 6975, - "total_column_articles": 38, + "total_acs": 5494, + "total_submitted": 7138, + "total_column_articles": 39, "frontend_question_id": "2895", "is_new_question": false }, @@ -11709,9 +12213,9 @@ "question__title": "Shortest and Lexicographically Smallest Beautiful String", "question__title_slug": "shortest-and-lexicographically-smallest-beautiful-string", "question__hide": false, - "total_acs": 6079, - "total_submitted": 15200, - "total_column_articles": 55, + "total_acs": 6171, + "total_submitted": 15380, + "total_column_articles": 57, "frontend_question_id": "2904", "is_new_question": false }, @@ -11730,8 +12234,8 @@ "question__title": "Sum of Remoteness of All Cells", "question__title_slug": "sum-of-remoteness-of-all-cells", "question__hide": false, - "total_acs": 125, - "total_submitted": 185, + "total_acs": 135, + "total_submitted": 199, "total_column_articles": 7, "frontend_question_id": "2852", "is_new_question": false @@ -11751,9 +12255,9 @@ "question__title": "Longest Unequal Adjacent Groups Subsequence I", "question__title_slug": "longest-unequal-adjacent-groups-subsequence-i", "question__hide": false, - "total_acs": 3534, - "total_submitted": 4809, - "total_column_articles": 32, + "total_acs": 3847, + "total_submitted": 5431, + "total_column_articles": 35, "frontend_question_id": "2900", "is_new_question": false }, @@ -11772,8 +12276,8 @@ "question__title": "Longest Unequal Adjacent Groups Subsequence II", "question__title_slug": "longest-unequal-adjacent-groups-subsequence-ii", "question__hide": false, - "total_acs": 2759, - "total_submitted": 7174, + "total_acs": 2814, + "total_submitted": 7288, "total_column_articles": 28, "frontend_question_id": "2901", "is_new_question": false @@ -11793,9 +12297,9 @@ "question__title": "Minimum Size Subarray in Infinite Array", "question__title_slug": "minimum-size-subarray-in-infinite-array", "question__hide": false, - "total_acs": 4302, - "total_submitted": 12452, - "total_column_articles": 40, + "total_acs": 4404, + "total_submitted": 12717, + "total_column_articles": 41, "frontend_question_id": "2875", "is_new_question": false }, @@ -11814,8 +12318,8 @@ "question__title": "Count Visited Nodes in a Directed Graph", "question__title_slug": "count-visited-nodes-in-a-directed-graph", "question__hide": false, - "total_acs": 3069, - "total_submitted": 6498, + "total_acs": 3130, + "total_submitted": 6658, "total_column_articles": 40, "frontend_question_id": "2876", "is_new_question": false @@ -11835,8 +12339,8 @@ "question__title": "Subarrays Distinct Element Sum of Squares II", "question__title_slug": "subarrays-distinct-element-sum-of-squares-ii", "question__hide": false, - "total_acs": 1724, - "total_submitted": 4541, + "total_acs": 1755, + "total_submitted": 4598, "total_column_articles": 24, "frontend_question_id": "2916", "is_new_question": false @@ -11856,9 +12360,9 @@ "question__title": "Beautiful Towers I", "question__title_slug": "beautiful-towers-i", "question__hide": false, - "total_acs": 22514, - "total_submitted": 37582, - "total_column_articles": 147, + "total_acs": 22751, + "total_submitted": 38018, + "total_column_articles": 148, "frontend_question_id": "2865", "is_new_question": false }, @@ -11877,8 +12381,8 @@ "question__title": "Beautiful Towers II", "question__title_slug": "beautiful-towers-ii", "question__hide": false, - "total_acs": 16869, - "total_submitted": 36366, + "total_acs": 17006, + "total_submitted": 36638, "total_column_articles": 134, "frontend_question_id": "2866", "is_new_question": false @@ -11898,9 +12402,9 @@ "question__title": "Count Valid Paths in a Tree", "question__title_slug": "count-valid-paths-in-a-tree", "question__hide": false, - "total_acs": 12868, - "total_submitted": 25787, - "total_column_articles": 94, + "total_acs": 13232, + "total_submitted": 26625, + "total_column_articles": 96, "frontend_question_id": "2867", "is_new_question": false }, @@ -11919,8 +12423,8 @@ "question__title": "Smallest Number With Given Digit Product", "question__title_slug": "smallest-number-with-given-digit-product", "question__hide": false, - "total_acs": 176, - "total_submitted": 349, + "total_acs": 186, + "total_submitted": 375, "total_column_articles": 4, "frontend_question_id": "2847", "is_new_question": false @@ -11940,8 +12444,8 @@ "question__title": "Maximum Spending After Buying Items", "question__title_slug": "maximum-spending-after-buying-items", "question__hide": false, - "total_acs": 2244, - "total_submitted": 3272, + "total_acs": 2299, + "total_submitted": 3341, "total_column_articles": 29, "frontend_question_id": "2931", "is_new_question": false @@ -11961,9 +12465,9 @@ "question__title": "Length of the Longest Subsequence That Sums to Target", "question__title_slug": "length-of-the-longest-subsequence-that-sums-to-target", "question__hide": false, - "total_acs": 4486, - "total_submitted": 10931, - "total_column_articles": 35, + "total_acs": 4987, + "total_submitted": 11863, + "total_column_articles": 37, "frontend_question_id": "2915", "is_new_question": false }, @@ -11982,8 +12486,8 @@ "question__title": "Minimum Edge Reversals So Every Node Is Reachable", "question__title_slug": "minimum-edge-reversals-so-every-node-is-reachable", "question__hide": false, - "total_acs": 1980, - "total_submitted": 2854, + "total_acs": 2047, + "total_submitted": 2950, "total_column_articles": 31, "frontend_question_id": "2858", "is_new_question": false @@ -12003,8 +12507,8 @@ "question__title": "Happy Students", "question__title_slug": "happy-students", "question__hide": false, - "total_acs": 5955, - "total_submitted": 10651, + "total_acs": 6045, + "total_submitted": 10784, "total_column_articles": 55, "frontend_question_id": "2860", "is_new_question": false @@ -12024,8 +12528,8 @@ "question__title": "Maximum Coins Heroes Can Collect", "question__title_slug": "maximum-coins-heroes-can-collect", "question__hide": false, - "total_acs": 112, - "total_submitted": 149, + "total_acs": 115, + "total_submitted": 153, "total_column_articles": 8, "frontend_question_id": "2838", "is_new_question": false @@ -12045,8 +12549,8 @@ "question__title": "Total Traveled Distance", "question__title_slug": "total-traveled-distance", "question__hide": false, - "total_acs": 421, - "total_submitted": 608, + "total_acs": 470, + "total_submitted": 687, "total_column_articles": 10, "frontend_question_id": "2837", "is_new_question": false @@ -12066,9 +12570,9 @@ "question__title": "Maximum Number of Alloys", "question__title_slug": "maximum-number-of-alloys", "question__hide": false, - "total_acs": 16472, - "total_submitted": 34890, - "total_column_articles": 118, + "total_acs": 16716, + "total_submitted": 35388, + "total_column_articles": 121, "frontend_question_id": "2861", "is_new_question": false }, @@ -12087,9 +12591,9 @@ "question__title": "Minimum Number of Operations to Make Array Empty", "question__title_slug": "minimum-number-of-operations-to-make-array-empty", "question__hide": false, - "total_acs": 4104, - "total_submitted": 6337, - "total_column_articles": 32, + "total_acs": 4277, + "total_submitted": 6598, + "total_column_articles": 33, "frontend_question_id": "2870", "is_new_question": false }, @@ -12108,9 +12612,9 @@ "question__title": "Sum of Values at Indices With K Set Bits", "question__title_slug": "sum-of-values-at-indices-with-k-set-bits", "question__hide": false, - "total_acs": 28457, - "total_submitted": 32903, - "total_column_articles": 241, + "total_acs": 28881, + "total_submitted": 33417, + "total_column_articles": 244, "frontend_question_id": "2859", "is_new_question": false }, @@ -12129,8 +12633,8 @@ "question__title": "Minimum Moves to Spread Stones Over Grid", "question__title_slug": "minimum-moves-to-spread-stones-over-grid", "question__hide": false, - "total_acs": 4599, - "total_submitted": 10883, + "total_acs": 4724, + "total_submitted": 11107, "total_column_articles": 60, "frontend_question_id": "2850", "is_new_question": false @@ -12150,8 +12654,8 @@ "question__title": "Count of Sub-Multisets With Bounded Sum", "question__title_slug": "count-of-sub-multisets-with-bounded-sum", "question__hide": false, - "total_acs": 1790, - "total_submitted": 5807, + "total_acs": 1824, + "total_submitted": 5867, "total_column_articles": 16, "frontend_question_id": "2902", "is_new_question": false @@ -12171,8 +12675,8 @@ "question__title": "Maximal Range That Each Element Is Maximum in It", "question__title_slug": "maximal-range-that-each-element-is-maximum-in-it", "question__hide": false, - "total_acs": 189, - "total_submitted": 256, + "total_acs": 205, + "total_submitted": 272, "total_column_articles": 8, "frontend_question_id": "2832", "is_new_question": false @@ -12192,8 +12696,8 @@ "question__title": "Minimum Array Length After Pair Removals", "question__title_slug": "minimum-array-length-after-pair-removals", "question__hide": false, - "total_acs": 3566, - "total_submitted": 13266, + "total_acs": 3652, + "total_submitted": 13452, "total_column_articles": 45, "frontend_question_id": "2856", "is_new_question": false @@ -12213,9 +12717,9 @@ "question__title": "Split Array Into Maximum Number of Subarrays", "question__title_slug": "split-array-into-maximum-number-of-subarrays", "question__hide": false, - "total_acs": 2961, - "total_submitted": 5938, - "total_column_articles": 32, + "total_acs": 3091, + "total_submitted": 6137, + "total_column_articles": 35, "frontend_question_id": "2871", "is_new_question": false }, @@ -12234,9 +12738,9 @@ "question__title": "Minimum Edge Weight Equilibrium Queries in a Tree", "question__title_slug": "minimum-edge-weight-equilibrium-queries-in-a-tree", "question__hide": false, - "total_acs": 10191, - "total_submitted": 16580, - "total_column_articles": 78, + "total_acs": 10248, + "total_submitted": 16682, + "total_column_articles": 79, "frontend_question_id": "2846", "is_new_question": false }, @@ -12255,8 +12759,8 @@ "question__title": "Election Results", "question__title_slug": "election-results", "question__hide": false, - "total_acs": 378, - "total_submitted": 760, + "total_acs": 427, + "total_submitted": 839, "total_column_articles": 11, "frontend_question_id": "2820", "is_new_question": false @@ -12276,8 +12780,8 @@ "question__title": "Minimum Relative Loss After Buying Chocolates", "question__title_slug": "minimum-relative-loss-after-buying-chocolates", "question__hide": false, - "total_acs": 412, - "total_submitted": 668, + "total_acs": 423, + "total_submitted": 683, "total_column_articles": 11, "frontend_question_id": "2819", "is_new_question": false @@ -12297,9 +12801,9 @@ "question__title": "Get the Size of a DataFrame", "question__title_slug": "get-the-size-of-a-dataframe", "question__hide": false, - "total_acs": 2862, - "total_submitted": 3353, - "total_column_articles": 9, + "total_acs": 3124, + "total_submitted": 3661, + "total_column_articles": 10, "frontend_question_id": "2878", "is_new_question": false }, @@ -12318,8 +12822,8 @@ "question__title": "Drop Missing Data", "question__title_slug": "drop-missing-data", "question__hide": false, - "total_acs": 1970, - "total_submitted": 3223, + "total_acs": 2158, + "total_submitted": 3478, "total_column_articles": 9, "frontend_question_id": "2883", "is_new_question": false @@ -12339,8 +12843,8 @@ "question__title": "Select Data", "question__title_slug": "select-data", "question__hide": false, - "total_acs": 2519, - "total_submitted": 3381, + "total_acs": 2788, + "total_submitted": 3709, "total_column_articles": 8, "frontend_question_id": "2880", "is_new_question": false @@ -12360,8 +12864,8 @@ "question__title": "Reshape Data: Melt", "question__title_slug": "reshape-data-melt", "question__hide": false, - "total_acs": 1608, - "total_submitted": 1996, + "total_acs": 1767, + "total_submitted": 2195, "total_column_articles": 6, "frontend_question_id": "2890", "is_new_question": false @@ -12381,8 +12885,8 @@ "question__title": "Reshape Data: Pivot", "question__title_slug": "reshape-data-pivot", "question__hide": false, - "total_acs": 1648, - "total_submitted": 2234, + "total_acs": 1799, + "total_submitted": 2448, "total_column_articles": 6, "frontend_question_id": "2889", "is_new_question": false @@ -12402,8 +12906,8 @@ "question__title": "Drop Duplicate Rows", "question__title_slug": "drop-duplicate-rows", "question__hide": false, - "total_acs": 2148, - "total_submitted": 2652, + "total_acs": 2360, + "total_submitted": 2901, "total_column_articles": 7, "frontend_question_id": "2882", "is_new_question": false @@ -12423,9 +12927,9 @@ "question__title": "Fill Missing Data", "question__title_slug": "fill-missing-data", "question__hide": false, - "total_acs": 1852, - "total_submitted": 2651, - "total_column_articles": 6, + "total_acs": 2036, + "total_submitted": 2897, + "total_column_articles": 7, "frontend_question_id": "2887", "is_new_question": false }, @@ -12444,8 +12948,8 @@ "question__title": "Change Data Type", "question__title_slug": "change-data-type", "question__hide": false, - "total_acs": 2014, - "total_submitted": 2430, + "total_acs": 2202, + "total_submitted": 2654, "total_column_articles": 12, "frontend_question_id": "2886", "is_new_question": false @@ -12465,8 +12969,8 @@ "question__title": "Rename Columns", "question__title_slug": "rename-columns", "question__hide": false, - "total_acs": 1968, - "total_submitted": 2406, + "total_acs": 2146, + "total_submitted": 2636, "total_column_articles": 9, "frontend_question_id": "2885", "is_new_question": false @@ -12486,8 +12990,8 @@ "question__title": "Modify Columns", "question__title_slug": "modify-columns", "question__hide": false, - "total_acs": 2188, - "total_submitted": 2378, + "total_acs": 2425, + "total_submitted": 2629, "total_column_articles": 10, "frontend_question_id": "2884", "is_new_question": false @@ -12507,9 +13011,9 @@ "question__title": "Create a New Column", "question__title_slug": "create-a-new-column", "question__hide": false, - "total_acs": 2345, - "total_submitted": 2627, - "total_column_articles": 9, + "total_acs": 2589, + "total_submitted": 2896, + "total_column_articles": 10, "frontend_question_id": "2881", "is_new_question": false }, @@ -12528,9 +13032,9 @@ "question__title": "Display the First Three Rows", "question__title_slug": "display-the-first-three-rows", "question__hide": false, - "total_acs": 3125, - "total_submitted": 3394, - "total_column_articles": 13, + "total_acs": 3446, + "total_submitted": 3746, + "total_column_articles": 14, "frontend_question_id": "2879", "is_new_question": false }, @@ -12549,8 +13053,8 @@ "question__title": "Reshape Data: Concatenate", "question__title_slug": "reshape-data-concatenate", "question__hide": false, - "total_acs": 1948, - "total_submitted": 2243, + "total_acs": 2146, + "total_submitted": 2464, "total_column_articles": 6, "frontend_question_id": "2888", "is_new_question": false @@ -12570,8 +13074,8 @@ "question__title": "Method Chaining", "question__title_slug": "method-chaining", "question__hide": false, - "total_acs": 1708, - "total_submitted": 2353, + "total_acs": 1887, + "total_submitted": 2598, "total_column_articles": 9, "frontend_question_id": "2891", "is_new_question": false @@ -12591,8 +13095,8 @@ "question__title": "Create a DataFrame from List", "question__title_slug": "create-a-dataframe-from-list", "question__hide": false, - "total_acs": 3315, - "total_submitted": 4280, + "total_acs": 3587, + "total_submitted": 4617, "total_column_articles": 10, "frontend_question_id": "2877", "is_new_question": false @@ -12612,8 +13116,8 @@ "question__title": "Maximum Number of K-Divisible Components", "question__title_slug": "maximum-number-of-k-divisible-components", "question__hide": false, - "total_acs": 2340, - "total_submitted": 3609, + "total_acs": 2379, + "total_submitted": 3660, "total_column_articles": 20, "frontend_question_id": "2872", "is_new_question": false @@ -12633,9 +13137,9 @@ "question__title": "Count K-Subsequences of a String With Maximum Beauty", "question__title_slug": "count-k-subsequences-of-a-string-with-maximum-beauty", "question__hide": false, - "total_acs": 2705, - "total_submitted": 9411, - "total_column_articles": 29, + "total_acs": 2756, + "total_submitted": 9531, + "total_column_articles": 30, "frontend_question_id": "2842", "is_new_question": false }, @@ -12654,8 +13158,8 @@ "question__title": "Determine if a Cell Is Reachable at a Given Time", "question__title_slug": "determine-if-a-cell-is-reachable-at-a-given-time", "question__hide": false, - "total_acs": 6519, - "total_submitted": 25431, + "total_acs": 6599, + "total_submitted": 25632, "total_column_articles": 56, "frontend_question_id": "2849", "is_new_question": false @@ -12675,9 +13179,9 @@ "question__title": "Maximum Odd Binary Number", "question__title_slug": "maximum-odd-binary-number", "question__hide": false, - "total_acs": 7966, - "total_submitted": 9875, - "total_column_articles": 47, + "total_acs": 33557, + "total_submitted": 39784, + "total_column_articles": 206, "frontend_question_id": "2864", "is_new_question": false }, @@ -12696,8 +13200,8 @@ "question__title": "Maximum Element-Sum of a Complete Subset of Indices", "question__title_slug": "maximum-element-sum-of-a-complete-subset-of-indices", "question__hide": false, - "total_acs": 3282, - "total_submitted": 6832, + "total_acs": 3326, + "total_submitted": 6916, "total_column_articles": 33, "frontend_question_id": "2862", "is_new_question": false @@ -12717,9 +13221,9 @@ "question__title": "Minimum Operations to Make a Special Number", "question__title_slug": "minimum-operations-to-make-a-special-number", "question__hide": false, - "total_acs": 5610, - "total_submitted": 13544, - "total_column_articles": 71, + "total_acs": 5693, + "total_submitted": 13767, + "total_column_articles": 72, "frontend_question_id": "2844", "is_new_question": false }, @@ -12738,9 +13242,9 @@ "question__title": "Minimum Right Shifts to Sort the Array", "question__title_slug": "minimum-right-shifts-to-sort-the-array", "question__hide": false, - "total_acs": 4549, - "total_submitted": 7753, - "total_column_articles": 54, + "total_acs": 4667, + "total_submitted": 7937, + "total_column_articles": 57, "frontend_question_id": "2855", "is_new_question": false }, @@ -12759,9 +13263,9 @@ "question__title": "Minimum Operations to Collect Elements", "question__title_slug": "minimum-operations-to-collect-elements", "question__hide": false, - "total_acs": 4262, - "total_submitted": 5968, - "total_column_articles": 35, + "total_acs": 4449, + "total_submitted": 6253, + "total_column_articles": 38, "frontend_question_id": "2869", "is_new_question": false }, @@ -12780,8 +13284,8 @@ "question__title": "Minimum Time Takes to Reach Destination Without Drowning", "question__title_slug": "minimum-time-takes-to-reach-destination-without-drowning", "question__hide": false, - "total_acs": 105, - "total_submitted": 218, + "total_acs": 112, + "total_submitted": 244, "total_column_articles": 5, "frontend_question_id": "2814", "is_new_question": false @@ -12801,9 +13305,9 @@ "question__title": "Points That Intersect With Cars", "question__title_slug": "points-that-intersect-with-cars", "question__hide": false, - "total_acs": 8251, - "total_submitted": 11169, - "total_column_articles": 74, + "total_acs": 8454, + "total_submitted": 11453, + "total_column_articles": 75, "frontend_question_id": "2848", "is_new_question": false }, @@ -12822,9 +13326,9 @@ "question__title": "Apply Operations to Make Two Strings Equal", "question__title_slug": "apply-operations-to-make-two-strings-equal", "question__hide": false, - "total_acs": 3965, - "total_submitted": 12518, - "total_column_articles": 39, + "total_acs": 4032, + "total_submitted": 12672, + "total_column_articles": 41, "frontend_question_id": "2896", "is_new_question": false }, @@ -12843,8 +13347,8 @@ "question__title": "Maximize Value of Function in a Ball Passing Game", "question__title_slug": "maximize-value-of-function-in-a-ball-passing-game", "question__hide": false, - "total_acs": 2557, - "total_submitted": 6454, + "total_acs": 2598, + "total_submitted": 6523, "total_column_articles": 36, "frontend_question_id": "2836", "is_new_question": false @@ -12864,9 +13368,9 @@ "question__title": "Construct Product Matrix", "question__title_slug": "construct-product-matrix", "question__hide": false, - "total_acs": 3726, - "total_submitted": 10458, - "total_column_articles": 44, + "total_acs": 3787, + "total_submitted": 10630, + "total_column_articles": 47, "frontend_question_id": "2906", "is_new_question": false }, @@ -12885,8 +13389,8 @@ "question__title": "Find The K-th Lucky Number", "question__title_slug": "find-the-k-th-lucky-number", "question__hide": false, - "total_acs": 164, - "total_submitted": 251, + "total_acs": 175, + "total_submitted": 287, "total_column_articles": 11, "frontend_question_id": "2802", "is_new_question": false @@ -12906,9 +13410,9 @@ "question__title": "Find the Minimum Possible Sum of a Beautiful Array", "question__title_slug": "find-the-minimum-possible-sum-of-a-beautiful-array", "question__hide": false, - "total_acs": 6489, - "total_submitted": 15955, - "total_column_articles": 52, + "total_acs": 23553, + "total_submitted": 65176, + "total_column_articles": 129, "frontend_question_id": "2834", "is_new_question": false }, @@ -12927,8 +13431,8 @@ "question__title": "Minimum Operations to Form Subsequence With Target Sum", "question__title_slug": "minimum-operations-to-form-subsequence-with-target-sum", "question__hide": false, - "total_acs": 3762, - "total_submitted": 10876, + "total_acs": 3840, + "total_submitted": 11040, "total_column_articles": 47, "frontend_question_id": "2835", "is_new_question": false @@ -12948,8 +13452,8 @@ "question__title": "String Transformation", "question__title_slug": "string-transformation", "question__hide": false, - "total_acs": 1562, - "total_submitted": 3669, + "total_acs": 1581, + "total_submitted": 3738, "total_column_articles": 29, "frontend_question_id": "2851", "is_new_question": false @@ -12969,9 +13473,9 @@ "question__title": "Furthest Point From Origin", "question__title_slug": "furthest-point-from-origin", "question__hide": false, - "total_acs": 8412, - "total_submitted": 10694, - "total_column_articles": 61, + "total_acs": 8635, + "total_submitted": 11000, + "total_column_articles": 62, "frontend_question_id": "2833", "is_new_question": false }, @@ -12990,9 +13494,9 @@ "question__title": "Make String a Subsequence Using Cyclic Increments", "question__title_slug": "make-string-a-subsequence-using-cyclic-increments", "question__hide": false, - "total_acs": 4348, - "total_submitted": 7896, - "total_column_articles": 35, + "total_acs": 4460, + "total_submitted": 8100, + "total_column_articles": 38, "frontend_question_id": "2825", "is_new_question": false }, @@ -13011,9 +13515,9 @@ "question__title": "Number of Beautiful Integers in the Range", "question__title_slug": "number-of-beautiful-integers-in-the-range", "question__hide": false, - "total_acs": 2716, - "total_submitted": 7922, - "total_column_articles": 25, + "total_acs": 2767, + "total_submitted": 8083, + "total_column_articles": 26, "frontend_question_id": "2827", "is_new_question": false }, @@ -13032,8 +13536,8 @@ "question__title": "Count Nodes That Are Great Enough", "question__title_slug": "count-nodes-that-are-great-enough", "question__hide": false, - "total_acs": 129, - "total_submitted": 246, + "total_acs": 139, + "total_submitted": 276, "total_column_articles": 5, "frontend_question_id": "2792", "is_new_question": false @@ -13053,9 +13557,9 @@ "question__title": "Status of Flight Tickets", "question__title_slug": "status-of-flight-tickets", "question__hide": false, - "total_acs": 422, - "total_submitted": 607, - "total_column_articles": 15, + "total_acs": 453, + "total_submitted": 649, + "total_column_articles": 16, "frontend_question_id": "2793", "is_new_question": false }, @@ -13074,8 +13578,8 @@ "question__title": "Flight Occupancy and Waitlist Analysis", "question__title_slug": "flight-occupancy-and-waitlist-analysis", "question__hide": false, - "total_acs": 419, - "total_submitted": 1079, + "total_acs": 459, + "total_submitted": 1199, "total_column_articles": 13, "frontend_question_id": "2783", "is_new_question": false @@ -13095,8 +13599,8 @@ "question__title": "Apply Operations to Maximize Score", "question__title_slug": "apply-operations-to-maximize-score", "question__hide": false, - "total_acs": 3873, - "total_submitted": 8326, + "total_acs": 3924, + "total_submitted": 8435, "total_column_articles": 45, "frontend_question_id": "2818", "is_new_question": false @@ -13116,8 +13620,8 @@ "question__title": "Minimum Absolute Difference Between Elements With Constraint", "question__title_slug": "minimum-absolute-difference-between-elements-with-constraint", "question__hide": false, - "total_acs": 5279, - "total_submitted": 16290, + "total_acs": 5323, + "total_submitted": 16400, "total_column_articles": 66, "frontend_question_id": "2817", "is_new_question": false @@ -13137,8 +13641,8 @@ "question__title": "Check if Strings Can be Made Equal With Operations I", "question__title_slug": "check-if-strings-can-be-made-equal-with-operations-i", "question__hide": false, - "total_acs": 4799, - "total_submitted": 7413, + "total_acs": 4915, + "total_submitted": 7620, "total_column_articles": 37, "frontend_question_id": "2839", "is_new_question": false @@ -13158,8 +13662,8 @@ "question__title": " Count Symmetric Integers", "question__title_slug": "count-symmetric-integers", "question__hide": false, - "total_acs": 7992, - "total_submitted": 11256, + "total_acs": 8171, + "total_submitted": 11501, "total_column_articles": 59, "frontend_question_id": "2843", "is_new_question": false @@ -13179,9 +13683,9 @@ "question__title": "Number of Unique Categories", "question__title_slug": "number-of-unique-categories", "question__hide": false, - "total_acs": 175, - "total_submitted": 210, - "total_column_articles": 7, + "total_acs": 208, + "total_submitted": 246, + "total_column_articles": 8, "frontend_question_id": "2782", "is_new_question": false }, @@ -13200,9 +13704,9 @@ "question__title": "Maximize the Profit as the Salesman", "question__title_slug": "maximize-the-profit-as-the-salesman", "question__hide": false, - "total_acs": 6002, - "total_submitted": 14070, - "total_column_articles": 68, + "total_acs": 6141, + "total_submitted": 14337, + "total_column_articles": 69, "frontend_question_id": "2830", "is_new_question": false }, @@ -13221,8 +13725,8 @@ "question__title": "Check if Strings Can be Made Equal With Operations II", "question__title_slug": "check-if-strings-can-be-made-equal-with-operations-ii", "question__hide": false, - "total_acs": 4112, - "total_submitted": 6737, + "total_acs": 4201, + "total_submitted": 6872, "total_column_articles": 30, "frontend_question_id": "2840", "is_new_question": false @@ -13242,9 +13746,9 @@ "question__title": "Check if a String Is an Acronym of Words", "question__title_slug": "check-if-a-string-is-an-acronym-of-words", "question__hide": false, - "total_acs": 30329, - "total_submitted": 35573, - "total_column_articles": 149, + "total_acs": 30863, + "total_submitted": 36224, + "total_column_articles": 151, "frontend_question_id": "2828", "is_new_question": false }, @@ -13263,9 +13767,9 @@ "question__title": "Account Balance After Rounded Purchase", "question__title_slug": "account-balance-after-rounded-purchase", "question__hide": false, - "total_acs": 4918, - "total_submitted": 7901, - "total_column_articles": 30, + "total_acs": 5094, + "total_submitted": 8146, + "total_column_articles": 32, "frontend_question_id": "2806", "is_new_question": false }, @@ -13284,9 +13788,9 @@ "question__title": "Maximum Sum of Almost Unique Subarray", "question__title_slug": "maximum-sum-of-almost-unique-subarray", "question__hide": false, - "total_acs": 4722, - "total_submitted": 10533, - "total_column_articles": 38, + "total_acs": 5012, + "total_submitted": 11201, + "total_column_articles": 41, "frontend_question_id": "2841", "is_new_question": false }, @@ -13305,8 +13809,8 @@ "question__title": "Count Pairs of Points With Distance k", "question__title_slug": "count-pairs-of-points-with-distance-k", "question__hide": false, - "total_acs": 2908, - "total_submitted": 7189, + "total_acs": 2971, + "total_submitted": 7331, "total_column_articles": 24, "frontend_question_id": "2857", "is_new_question": false @@ -13326,9 +13830,9 @@ "question__title": "Minimum Time to Make Array Sum At Most x", "question__title_slug": "minimum-time-to-make-array-sum-at-most-x", "question__hide": false, - "total_acs": 11066, - "total_submitted": 17914, - "total_column_articles": 57, + "total_acs": 11156, + "total_submitted": 18079, + "total_column_articles": 58, "frontend_question_id": "2809", "is_new_question": false }, @@ -13347,8 +13851,8 @@ "question__title": "Height of Special Binary Tree", "question__title_slug": "height-of-special-binary-tree", "question__hide": false, - "total_acs": 106, - "total_submitted": 156, + "total_acs": 114, + "total_submitted": 181, "total_column_articles": 3, "frontend_question_id": "2773", "is_new_question": false @@ -13368,8 +13872,8 @@ "question__title": "Inversion of Object", "question__title_slug": "inversion-of-object", "question__hide": false, - "total_acs": 175, - "total_submitted": 279, + "total_acs": 188, + "total_submitted": 299, "total_column_articles": 4, "frontend_question_id": "2822", "is_new_question": false @@ -13389,8 +13893,8 @@ "question__title": "Count Stepping Numbers in Range", "question__title_slug": "count-stepping-numbers-in-range", "question__hide": false, - "total_acs": 3050, - "total_submitted": 7098, + "total_acs": 3097, + "total_submitted": 7229, "total_column_articles": 49, "frontend_question_id": "2801", "is_new_question": false @@ -13410,8 +13914,8 @@ "question__title": "Minimum Seconds to Equalize a Circular Array", "question__title_slug": "minimum-seconds-to-equalize-a-circular-array", "question__hide": false, - "total_acs": 16158, - "total_submitted": 28830, + "total_acs": 16270, + "total_submitted": 29030, "total_column_articles": 137, "frontend_question_id": "2808", "is_new_question": false @@ -13431,8 +13935,8 @@ "question__title": "Maximum Number of Groups With Increasing Length", "question__title_slug": "maximum-number-of-groups-with-increasing-length", "question__hide": false, - "total_acs": 2861, - "total_submitted": 12878, + "total_acs": 2907, + "total_submitted": 13051, "total_column_articles": 47, "frontend_question_id": "2790", "is_new_question": false @@ -13452,8 +13956,8 @@ "question__title": "Is Array a Preorder of Some ‌Binary Tree", "question__title_slug": "is-array-a-preorder-of-some-binary-tree", "question__hide": false, - "total_acs": 165, - "total_submitted": 257, + "total_acs": 178, + "total_submitted": 290, "total_column_articles": 11, "frontend_question_id": "2764", "is_new_question": false @@ -13473,9 +13977,9 @@ "question__title": "Count Pairs Whose Sum is Less than Target", "question__title_slug": "count-pairs-whose-sum-is-less-than-target", "question__hide": false, - "total_acs": 32219, - "total_submitted": 37101, - "total_column_articles": 181, + "total_acs": 33265, + "total_submitted": 38373, + "total_column_articles": 185, "frontend_question_id": "2824", "is_new_question": false }, @@ -13494,9 +13998,9 @@ "question__title": "Check if it is Possible to Split Array", "question__title_slug": "check-if-it-is-possible-to-split-array", "question__hide": false, - "total_acs": 7154, - "total_submitted": 21853, - "total_column_articles": 77, + "total_acs": 7228, + "total_submitted": 22053, + "total_column_articles": 79, "frontend_question_id": "2811", "is_new_question": false }, @@ -13515,8 +14019,8 @@ "question__title": "Count of Interesting Subarrays", "question__title_slug": "count-of-interesting-subarrays", "question__hide": false, - "total_acs": 4224, - "total_submitted": 11901, + "total_acs": 4286, + "total_submitted": 12061, "total_column_articles": 45, "frontend_question_id": "2845", "is_new_question": false @@ -13536,8 +14040,8 @@ "question__title": "Find the Safest Path in a Grid", "question__title_slug": "find-the-safest-path-in-a-grid", "question__hide": false, - "total_acs": 4653, - "total_submitted": 16258, + "total_acs": 4735, + "total_submitted": 16475, "total_column_articles": 62, "frontend_question_id": "2812", "is_new_question": false @@ -13557,8 +14061,8 @@ "question__title": "Deep Object Filter", "question__title_slug": "deep-object-filter", "question__hide": false, - "total_acs": 108, - "total_submitted": 255, + "total_acs": 119, + "total_submitted": 274, "total_column_articles": 4, "frontend_question_id": "2823", "is_new_question": false @@ -13578,8 +14082,8 @@ "question__title": "Delay the Resolution of Each Promise", "question__title_slug": "delay-the-resolution-of-each-promise", "question__hide": false, - "total_acs": 152, - "total_submitted": 270, + "total_acs": 171, + "total_submitted": 292, "total_column_articles": 3, "frontend_question_id": "2821", "is_new_question": false @@ -13599,8 +14103,8 @@ "question__title": "Custom Interval", "question__title_slug": "custom-interval", "question__hide": false, - "total_acs": 109, - "total_submitted": 138, + "total_acs": 120, + "total_submitted": 154, "total_column_articles": 4, "frontend_question_id": "2805", "is_new_question": false @@ -13620,8 +14124,8 @@ "question__title": "Array Prototype ForEach", "question__title_slug": "array-prototype-foreach", "question__hide": false, - "total_acs": 181, - "total_submitted": 214, + "total_acs": 202, + "total_submitted": 235, "total_column_articles": 7, "frontend_question_id": "2804", "is_new_question": false @@ -13641,8 +14145,8 @@ "question__title": "Count Paths That Can Form a Palindrome in a Tree", "question__title_slug": "count-paths-that-can-form-a-palindrome-in-a-tree", "question__hide": false, - "total_acs": 2484, - "total_submitted": 4891, + "total_acs": 2527, + "total_submitted": 4974, "total_column_articles": 35, "frontend_question_id": "2791", "is_new_question": false @@ -13662,8 +14166,8 @@ "question__title": "Sorting Three Groups", "question__title_slug": "sorting-three-groups", "question__hide": false, - "total_acs": 3969, - "total_submitted": 7406, + "total_acs": 4088, + "total_submitted": 7590, "total_column_articles": 40, "frontend_question_id": "2826", "is_new_question": false @@ -13683,9 +14187,9 @@ "question__title": "Insert Greatest Common Divisors in Linked List", "question__title_slug": "insert-greatest-common-divisors-in-linked-list", "question__hide": false, - "total_acs": 22358, - "total_submitted": 24551, - "total_column_articles": 193, + "total_acs": 22721, + "total_submitted": 24971, + "total_column_articles": 196, "frontend_question_id": "2807", "is_new_question": false }, @@ -13704,9 +14208,9 @@ "question__title": "Max Pair Sum in an Array", "question__title_slug": "max-pair-sum-in-an-array", "question__hide": false, - "total_acs": 8269, - "total_submitted": 12167, - "total_column_articles": 57, + "total_acs": 8464, + "total_submitted": 12418, + "total_column_articles": 58, "frontend_question_id": "2815", "is_new_question": false }, @@ -13725,8 +14229,8 @@ "question__title": "Factorial Generator", "question__title_slug": "factorial-generator", "question__hide": false, - "total_acs": 169, - "total_submitted": 214, + "total_acs": 182, + "total_submitted": 227, "total_column_articles": 4, "frontend_question_id": "2803", "is_new_question": false @@ -13746,8 +14250,8 @@ "question__title": "Partial Function with Placeholders", "question__title_slug": "partial-function-with-placeholders", "question__hide": false, - "total_acs": 186, - "total_submitted": 205, + "total_acs": 194, + "total_submitted": 214, "total_column_articles": 7, "frontend_question_id": "2797", "is_new_question": false @@ -13767,8 +14271,8 @@ "question__title": "Repeat String", "question__title_slug": "repeat-string", "question__hide": false, - "total_acs": 271, - "total_submitted": 315, + "total_acs": 289, + "total_submitted": 333, "total_column_articles": 9, "frontend_question_id": "2796", "is_new_question": false @@ -13788,8 +14292,8 @@ "question__title": "Parallel Execution of Promises for Individual Results Retrieval", "question__title_slug": "parallel-execution-of-promises-for-individual-results-retrieval", "question__hide": false, - "total_acs": 150, - "total_submitted": 173, + "total_acs": 168, + "total_submitted": 193, "total_column_articles": 4, "frontend_question_id": "2795", "is_new_question": false @@ -13809,8 +14313,8 @@ "question__title": "Count Houses in a Circular Street II", "question__title_slug": "count-houses-in-a-circular-street-ii", "question__hide": false, - "total_acs": 227, - "total_submitted": 288, + "total_acs": 230, + "total_submitted": 307, "total_column_articles": 10, "frontend_question_id": "2753", "is_new_question": false @@ -13830,8 +14334,8 @@ "question__title": "Maximum Elegance of a K-Length Subsequence", "question__title_slug": "maximum-elegance-of-a-k-length-subsequence", "question__hide": false, - "total_acs": 2531, - "total_submitted": 6091, + "total_acs": 2572, + "total_submitted": 6230, "total_column_articles": 28, "frontend_question_id": "2813", "is_new_question": false @@ -13851,9 +14355,9 @@ "question__title": "Visit Array Positions to Maximize Score", "question__title_slug": "visit-array-positions-to-maximize-score", "question__hide": false, - "total_acs": 3992, - "total_submitted": 9791, - "total_column_articles": 64, + "total_acs": 4097, + "total_submitted": 10086, + "total_column_articles": 66, "frontend_question_id": "2786", "is_new_question": false }, @@ -13872,8 +14376,8 @@ "question__title": "Check if Array is Good", "question__title_slug": "check-if-array-is-good", "question__hide": false, - "total_acs": 5001, - "total_submitted": 8112, + "total_acs": 5190, + "total_submitted": 8428, "total_column_articles": 63, "frontend_question_id": "2784", "is_new_question": false @@ -13893,9 +14397,9 @@ "question__title": "Maximum Beauty of an Array After Applying Operation", "question__title_slug": "maximum-beauty-of-an-array-after-applying-operation", "question__hide": false, - "total_acs": 6811, - "total_submitted": 16965, - "total_column_articles": 88, + "total_acs": 6912, + "total_submitted": 17149, + "total_column_articles": 93, "frontend_question_id": "2779", "is_new_question": false }, @@ -13914,9 +14418,9 @@ "question__title": "Count Substrings Without Repeating Character", "question__title_slug": "count-substrings-without-repeating-character", "question__hide": false, - "total_acs": 214, - "total_submitted": 305, - "total_column_articles": 5, + "total_acs": 226, + "total_submitted": 327, + "total_column_articles": 6, "frontend_question_id": "2743", "is_new_question": false }, @@ -13935,9 +14439,9 @@ "question__title": "Number of Black Blocks", "question__title_slug": "number-of-black-blocks", "question__hide": false, - "total_acs": 2852, - "total_submitted": 6513, - "total_column_articles": 28, + "total_acs": 2898, + "total_submitted": 6635, + "total_column_articles": 29, "frontend_question_id": "2768", "is_new_question": false }, @@ -13956,9 +14460,9 @@ "question__title": "Minimum Index of a Valid Split", "question__title_slug": "minimum-index-of-a-valid-split", "question__hide": false, - "total_acs": 5040, - "total_submitted": 7705, - "total_column_articles": 60, + "total_acs": 5087, + "total_submitted": 7777, + "total_column_articles": 63, "frontend_question_id": "2780", "is_new_question": false }, @@ -13977,8 +14481,8 @@ "question__title": "Sort Vowels in a String", "question__title_slug": "sort-vowels-in-a-string", "question__hide": false, - "total_acs": 4331, - "total_submitted": 5638, + "total_acs": 4414, + "total_submitted": 5737, "total_column_articles": 42, "frontend_question_id": "2785", "is_new_question": false @@ -13998,9 +14502,9 @@ "question__title": "Faulty Keyboard", "question__title_slug": "faulty-keyboard", "question__hide": false, - "total_acs": 9521, - "total_submitted": 11579, - "total_column_articles": 59, + "total_acs": 9776, + "total_submitted": 11899, + "total_column_articles": 60, "frontend_question_id": "2810", "is_new_question": false }, @@ -14019,8 +14523,8 @@ "question__title": "Count Occurrences in Text", "question__title_slug": "count-occurrences-in-text", "question__hide": false, - "total_acs": 716, - "total_submitted": 1389, + "total_acs": 786, + "total_submitted": 1531, "total_column_articles": 12, "frontend_question_id": "2738", "is_new_question": false @@ -14040,8 +14544,8 @@ "question__title": "Length of the Longest Valid Substring", "question__title_slug": "length-of-the-longest-valid-substring", "question__hide": false, - "total_acs": 4175, - "total_submitted": 10737, + "total_acs": 4262, + "total_submitted": 10925, "total_column_articles": 47, "frontend_question_id": "2781", "is_new_question": false @@ -14061,9 +14565,9 @@ "question__title": "Partition String Into Minimum Beautiful Substrings", "question__title_slug": "partition-string-into-minimum-beautiful-substrings", "question__hide": false, - "total_acs": 3290, - "total_submitted": 5835, - "total_column_articles": 43, + "total_acs": 3432, + "total_submitted": 6076, + "total_column_articles": 44, "frontend_question_id": "2767", "is_new_question": false }, @@ -14082,9 +14586,9 @@ "question__title": "Ways to Express an Integer as Sum of Powers", "question__title_slug": "ways-to-express-an-integer-as-sum-of-powers", "question__hide": false, - "total_acs": 3494, - "total_submitted": 7826, - "total_column_articles": 37, + "total_acs": 3693, + "total_submitted": 8189, + "total_column_articles": 39, "frontend_question_id": "2787", "is_new_question": false }, @@ -14103,9 +14607,9 @@ "question__title": "Split Strings by Separator", "question__title_slug": "split-strings-by-separator", "question__hide": false, - "total_acs": 24609, - "total_submitted": 30473, - "total_column_articles": 188, + "total_acs": 24958, + "total_submitted": 30948, + "total_column_articles": 191, "frontend_question_id": "2788", "is_new_question": false }, @@ -14124,8 +14628,8 @@ "question__title": "Find the Closest Marked Node", "question__title_slug": "find-the-closest-marked-node", "question__hide": false, - "total_acs": 237, - "total_submitted": 441, + "total_acs": 271, + "total_submitted": 476, "total_column_articles": 7, "frontend_question_id": "2737", "is_new_question": false @@ -14145,9 +14649,9 @@ "question__title": "Minimum Changes to Make K Semi-palindromes", "question__title_slug": "minimum-changes-to-make-k-semi-palindromes", "question__hide": false, - "total_acs": 2261, - "total_submitted": 4739, - "total_column_articles": 24, + "total_acs": 2333, + "total_submitted": 4886, + "total_column_articles": 25, "frontend_question_id": "2911", "is_new_question": false }, @@ -14166,9 +14670,9 @@ "question__title": "Apply Operations to Make All Array Elements Equal to Zero", "question__title_slug": "apply-operations-to-make-all-array-elements-equal-to-zero", "question__hide": false, - "total_acs": 5794, - "total_submitted": 15691, - "total_column_articles": 61, + "total_acs": 5887, + "total_submitted": 15935, + "total_column_articles": 62, "frontend_question_id": "2772", "is_new_question": false }, @@ -14187,8 +14691,8 @@ "question__title": "Shortest String That Contains Three Strings", "question__title_slug": "shortest-string-that-contains-three-strings", "question__hide": false, - "total_acs": 4680, - "total_submitted": 13387, + "total_acs": 4732, + "total_submitted": 13503, "total_column_articles": 58, "frontend_question_id": "2800", "is_new_question": false @@ -14208,9 +14712,9 @@ "question__title": "Number of Employees Who Met the Target", "question__title_slug": "number-of-employees-who-met-the-target", "question__hide": false, - "total_acs": 10649, - "total_submitted": 12510, - "total_column_articles": 60, + "total_acs": 11027, + "total_submitted": 12961, + "total_column_articles": 61, "frontend_question_id": "2798", "is_new_question": false }, @@ -14229,8 +14733,8 @@ "question__title": "Count Houses in a Circular Street", "question__title_slug": "count-houses-in-a-circular-street", "question__hide": false, - "total_acs": 250, - "total_submitted": 309, + "total_acs": 259, + "total_submitted": 333, "total_column_articles": 10, "frontend_question_id": "2728", "is_new_question": false @@ -14250,9 +14754,9 @@ "question__title": "Popularity Percentage", "question__title_slug": "popularity-percentage", "question__hide": false, - "total_acs": 411, - "total_submitted": 829, - "total_column_articles": 10, + "total_acs": 463, + "total_submitted": 917, + "total_column_articles": 11, "frontend_question_id": "2720", "is_new_question": false }, @@ -14271,8 +14775,8 @@ "question__title": "Prime Pairs With Target Sum", "question__title_slug": "prime-pairs-with-target-sum", "question__hide": false, - "total_acs": 6308, - "total_submitted": 18245, + "total_acs": 6399, + "total_submitted": 18482, "total_column_articles": 47, "frontend_question_id": "2761", "is_new_question": false @@ -14292,9 +14796,9 @@ "question__title": "Largest Element in an Array after Merge Operations", "question__title_slug": "largest-element-in-an-array-after-merge-operations", "question__hide": false, - "total_acs": 6699, - "total_submitted": 13464, - "total_column_articles": 89, + "total_acs": 31135, + "total_submitted": 54363, + "total_column_articles": 271, "frontend_question_id": "2789", "is_new_question": false }, @@ -14313,9 +14817,9 @@ "question__title": "Double a Number Represented as a Linked List", "question__title_slug": "double-a-number-represented-as-a-linked-list", "question__hide": false, - "total_acs": 7637, - "total_submitted": 13146, - "total_column_articles": 86, + "total_acs": 7903, + "total_submitted": 13510, + "total_column_articles": 91, "frontend_question_id": "2816", "is_new_question": false }, @@ -14334,8 +14838,8 @@ "question__title": "Longest Alternating Subarray", "question__title_slug": "longest-alternating-subarray", "question__hide": false, - "total_acs": 24586, - "total_submitted": 48960, + "total_acs": 24874, + "total_submitted": 49540, "total_column_articles": 273, "frontend_question_id": "2765", "is_new_question": false @@ -14355,9 +14859,9 @@ "question__title": "Longest Non-decreasing Subarray From Two Arrays", "question__title_slug": "longest-non-decreasing-subarray-from-two-arrays", "question__hide": false, - "total_acs": 5850, - "total_submitted": 16682, - "total_column_articles": 64, + "total_acs": 6001, + "total_submitted": 17073, + "total_column_articles": 67, "frontend_question_id": "2771", "is_new_question": false }, @@ -14376,9 +14880,9 @@ "question__title": "Continuous Subarrays", "question__title_slug": "continuous-subarrays", "question__hide": false, - "total_acs": 5261, - "total_submitted": 10797, - "total_column_articles": 62, + "total_acs": 5359, + "total_submitted": 10996, + "total_column_articles": 63, "frontend_question_id": "2762", "is_new_question": false }, @@ -14397,9 +14901,9 @@ "question__title": "Ways to Split Array Into Good Subarrays", "question__title_slug": "ways-to-split-array-into-good-subarrays", "question__hide": false, - "total_acs": 4234, - "total_submitted": 10763, - "total_column_articles": 45, + "total_acs": 4315, + "total_submitted": 10930, + "total_column_articles": 46, "frontend_question_id": "2750", "is_new_question": false }, @@ -14418,9 +14922,9 @@ "question__title": "Longest Even Odd Subarray With Threshold", "question__title_slug": "longest-even-odd-subarray-with-threshold", "question__hide": false, - "total_acs": 29347, - "total_submitted": 64590, - "total_column_articles": 249, + "total_acs": 29684, + "total_submitted": 65434, + "total_column_articles": 251, "frontend_question_id": "2760", "is_new_question": false }, @@ -14439,8 +14943,8 @@ "question__title": "Find Shortest Path with K Hops", "question__title_slug": "find-shortest-path-with-k-hops", "question__hide": false, - "total_acs": 200, - "total_submitted": 316, + "total_acs": 209, + "total_submitted": 344, "total_column_articles": 5, "frontend_question_id": "2714", "is_new_question": false @@ -14460,8 +14964,8 @@ "question__title": "Is Object Empty", "question__title_slug": "is-object-empty", "question__hide": false, - "total_acs": 5367, - "total_submitted": 7266, + "total_acs": 5710, + "total_submitted": 7720, "total_column_articles": 45, "frontend_question_id": "2727", "is_new_question": false @@ -14481,8 +14985,8 @@ "question__title": "Calculator with Method Chaining", "question__title_slug": "calculator-with-method-chaining", "question__hide": false, - "total_acs": 2368, - "total_submitted": 3632, + "total_acs": 2521, + "total_submitted": 3846, "total_column_articles": 20, "frontend_question_id": "2726", "is_new_question": false @@ -14502,8 +15006,8 @@ "question__title": "Interval Cancellation", "question__title_slug": "interval-cancellation", "question__hide": false, - "total_acs": 2989, - "total_submitted": 4279, + "total_acs": 3172, + "total_submitted": 4515, "total_column_articles": 23, "frontend_question_id": "2725", "is_new_question": false @@ -14523,8 +15027,8 @@ "question__title": "Create Object from Two Arrays", "question__title_slug": "create-object-from-two-arrays", "question__hide": false, - "total_acs": 191, - "total_submitted": 311, + "total_acs": 207, + "total_submitted": 331, "total_column_articles": 7, "frontend_question_id": "2794", "is_new_question": false @@ -14544,8 +15048,8 @@ "question__title": "Sort By", "question__title_slug": "sort-by", "question__hide": false, - "total_acs": 3509, - "total_submitted": 4526, + "total_acs": 3740, + "total_submitted": 4817, "total_column_articles": 28, "frontend_question_id": "2724", "is_new_question": false @@ -14565,9 +15069,9 @@ "question__title": "Add Two Promises", "question__title_slug": "add-two-promises", "question__hide": false, - "total_acs": 5433, - "total_submitted": 6181, - "total_column_articles": 35, + "total_acs": 5793, + "total_submitted": 6579, + "total_column_articles": 36, "frontend_question_id": "2723", "is_new_question": false }, @@ -14586,9 +15090,9 @@ "question__title": "Join Two Arrays by ID", "question__title_slug": "join-two-arrays-by-id", "question__hide": false, - "total_acs": 2892, - "total_submitted": 6026, - "total_column_articles": 43, + "total_acs": 3072, + "total_submitted": 6389, + "total_column_articles": 44, "frontend_question_id": "2722", "is_new_question": false }, @@ -14607,9 +15111,9 @@ "question__title": "Total Distance Traveled", "question__title_slug": "total-distance-traveled", "question__hide": false, - "total_acs": 7491, - "total_submitted": 14282, - "total_column_articles": 64, + "total_acs": 7662, + "total_submitted": 14620, + "total_column_articles": 65, "frontend_question_id": "2739", "is_new_question": false }, @@ -14628,9 +15132,9 @@ "question__title": "Count Complete Subarrays in an Array", "question__title_slug": "count-complete-subarrays-in-an-array", "question__hide": false, - "total_acs": 7699, - "total_submitted": 13119, - "total_column_articles": 80, + "total_acs": 7943, + "total_submitted": 13482, + "total_column_articles": 85, "frontend_question_id": "2799", "is_new_question": false }, @@ -14649,9 +15153,9 @@ "question__title": "Maximum Number of Jumps to Reach the Last Index", "question__title_slug": "maximum-number-of-jumps-to-reach-the-last-index", "question__hide": false, - "total_acs": 6964, - "total_submitted": 19328, - "total_column_articles": 69, + "total_acs": 7082, + "total_submitted": 19632, + "total_column_articles": 70, "frontend_question_id": "2770", "is_new_question": false }, @@ -14670,9 +15174,9 @@ "question__title": "Decremental String Concatenation", "question__title_slug": "decremental-string-concatenation", "question__hide": false, - "total_acs": 2600, - "total_submitted": 6504, - "total_column_articles": 38, + "total_acs": 2645, + "total_submitted": 6614, + "total_column_articles": 39, "frontend_question_id": "2746", "is_new_question": false }, @@ -14691,9 +15195,9 @@ "question__title": "Consecutive Transactions with Increasing Amounts", "question__title_slug": "consecutive-transactions-with-increasing-amounts", "question__hide": false, - "total_acs": 490, - "total_submitted": 1873, - "total_column_articles": 20, + "total_acs": 538, + "total_submitted": 2059, + "total_column_articles": 21, "frontend_question_id": "2701", "is_new_question": false }, @@ -14712,9 +15216,9 @@ "question__title": "Customers with Maximum Number of Transactions on Consecutive Days", "question__title_slug": "customers-with-maximum-number-of-transactions-on-consecutive-days", "question__hide": false, - "total_acs": 411, - "total_submitted": 952, - "total_column_articles": 14, + "total_acs": 446, + "total_submitted": 1017, + "total_column_articles": 16, "frontend_question_id": "2752", "is_new_question": false }, @@ -14733,8 +15237,8 @@ "question__title": "Convert JSON String to Object", "question__title_slug": "convert-json-string-to-object", "question__hide": false, - "total_acs": 98, - "total_submitted": 197, + "total_acs": 102, + "total_submitted": 205, "total_column_articles": 6, "frontend_question_id": "2759", "is_new_question": false @@ -14754,9 +15258,9 @@ "question__title": "Construct the Longest New String", "question__title_slug": "construct-the-longest-new-string", "question__hide": false, - "total_acs": 3812, - "total_submitted": 6500, - "total_column_articles": 48, + "total_acs": 3932, + "total_submitted": 6682, + "total_column_articles": 51, "frontend_question_id": "2745", "is_new_question": false }, @@ -14775,8 +15279,8 @@ "question__title": "Sum of Imbalance Numbers of All Subarrays", "question__title_slug": "sum-of-imbalance-numbers-of-all-subarrays", "question__hide": false, - "total_acs": 2868, - "total_submitted": 4613, + "total_acs": 2891, + "total_submitted": 4661, "total_column_articles": 21, "frontend_question_id": "2763", "is_new_question": false @@ -14796,9 +15300,9 @@ "question__title": "Special Permutations", "question__title_slug": "special-permutations", "question__hide": false, - "total_acs": 4668, - "total_submitted": 12714, - "total_column_articles": 52, + "total_acs": 4711, + "total_submitted": 12824, + "total_column_articles": 53, "frontend_question_id": "2741", "is_new_question": false }, @@ -14817,9 +15321,9 @@ "question__title": "Find Maximum Number of String Pairs", "question__title_slug": "find-maximum-number-of-string-pairs", "question__hide": false, - "total_acs": 29182, - "total_submitted": 33631, - "total_column_articles": 208, + "total_acs": 29733, + "total_submitted": 34340, + "total_column_articles": 215, "frontend_question_id": "2744", "is_new_question": false }, @@ -14838,8 +15342,8 @@ "question__title": "Robot Collisions", "question__title_slug": "robot-collisions", "question__hide": false, - "total_acs": 2681, - "total_submitted": 5469, + "total_acs": 2703, + "total_submitted": 5521, "total_column_articles": 34, "frontend_question_id": "2751", "is_new_question": false @@ -14859,9 +15363,9 @@ "question__title": "Find the Value of the Partition", "question__title_slug": "find-the-value-of-the-partition", "question__hide": false, - "total_acs": 6325, - "total_submitted": 8537, - "total_column_articles": 50, + "total_acs": 6409, + "total_submitted": 8655, + "total_column_articles": 51, "frontend_question_id": "2740", "is_new_question": false }, @@ -14880,9 +15384,9 @@ "question__title": "Sum of Squares of Special Elements ", "question__title_slug": "sum-of-squares-of-special-elements", "question__hide": false, - "total_acs": 8612, - "total_submitted": 10938, - "total_column_articles": 48, + "total_acs": 8952, + "total_submitted": 11402, + "total_column_articles": 49, "frontend_question_id": "2778", "is_new_question": false }, @@ -14901,8 +15405,8 @@ "question__title": "Extract Kth Character From The Rope Tree", "question__title_slug": "extract-kth-character-from-the-rope-tree", "question__hide": false, - "total_acs": 226, - "total_submitted": 361, + "total_acs": 256, + "total_submitted": 419, "total_column_articles": 8, "frontend_question_id": "2689", "is_new_question": false @@ -14922,8 +15426,8 @@ "question__title": "Find Active Users", "question__title_slug": "find-active-users", "question__hide": false, - "total_acs": 606, - "total_submitted": 1538, + "total_acs": 665, + "total_submitted": 1662, "total_column_articles": 15, "frontend_question_id": "2688", "is_new_question": false @@ -14943,8 +15447,8 @@ "question__title": "Bikes Last Time Used ", "question__title_slug": "bikes-last-time-used", "question__hide": false, - "total_acs": 853, - "total_submitted": 1000, + "total_acs": 920, + "total_submitted": 1093, "total_column_articles": 10, "frontend_question_id": "2687", "is_new_question": false @@ -14964,8 +15468,8 @@ "question__title": "Immediate Food Delivery III", "question__title_slug": "immediate-food-delivery-iii", "question__hide": false, - "total_acs": 573, - "total_submitted": 885, + "total_acs": 615, + "total_submitted": 941, "total_column_articles": 12, "frontend_question_id": "2686", "is_new_question": false @@ -14985,8 +15489,8 @@ "question__title": "Maximum Sum Queries", "question__title_slug": "maximum-sum-queries", "question__hide": false, - "total_acs": 12568, - "total_submitted": 23961, + "total_acs": 12613, + "total_submitted": 24066, "total_column_articles": 108, "frontend_question_id": "2736", "is_new_question": false @@ -15006,9 +15510,9 @@ "question__title": "Sum of Matrix After Queries", "question__title_slug": "sum-of-matrix-after-queries", "question__hide": false, - "total_acs": 5658, - "total_submitted": 16133, - "total_column_articles": 99, + "total_acs": 5718, + "total_submitted": 16255, + "total_column_articles": 101, "frontend_question_id": "2718", "is_new_question": false }, @@ -15027,8 +15531,8 @@ "question__title": "Minimum Operations to Make the Integer Zero", "question__title_slug": "minimum-operations-to-make-the-integer-zero", "question__hide": false, - "total_acs": 3746, - "total_submitted": 11106, + "total_acs": 3795, + "total_submitted": 11235, "total_column_articles": 30, "frontend_question_id": "2749", "is_new_question": false @@ -15048,9 +15552,9 @@ "question__title": "Neither Minimum nor Maximum", "question__title_slug": "neither-minimum-nor-maximum", "question__hide": false, - "total_acs": 9945, - "total_submitted": 12764, - "total_column_articles": 68, + "total_acs": 10248, + "total_submitted": 13126, + "total_column_articles": 70, "frontend_question_id": "2733", "is_new_question": false }, @@ -15069,8 +15573,8 @@ "question__title": "Split a Circular Linked List", "question__title_slug": "split-a-circular-linked-list", "question__hide": false, - "total_acs": 180, - "total_submitted": 228, + "total_acs": 195, + "total_submitted": 266, "total_column_articles": 10, "frontend_question_id": "2674", "is_new_question": false @@ -15090,9 +15594,9 @@ "question__title": "Relocate Marbles", "question__title_slug": "relocate-marbles", "question__hide": false, - "total_acs": 3971, - "total_submitted": 7163, - "total_column_articles": 22, + "total_acs": 4075, + "total_submitted": 7342, + "total_column_articles": 23, "frontend_question_id": "2766", "is_new_question": false }, @@ -15111,8 +15615,8 @@ "question__title": "Count Zero Request Servers", "question__title_slug": "count-zero-request-servers", "question__hide": false, - "total_acs": 2057, - "total_submitted": 5431, + "total_acs": 2096, + "total_submitted": 5558, "total_column_articles": 28, "frontend_question_id": "2747", "is_new_question": false @@ -15132,9 +15636,9 @@ "question__title": "Find the Longest Equal Subarray", "question__title_slug": "find-the-longest-equal-subarray", "question__hide": false, - "total_acs": 5102, - "total_submitted": 12285, - "total_column_articles": 61, + "total_acs": 5240, + "total_submitted": 12590, + "total_column_articles": 62, "frontend_question_id": "2831", "is_new_question": false }, @@ -15153,9 +15657,9 @@ "question__title": "Number of Beautiful Pairs", "question__title_slug": "number-of-beautiful-pairs", "question__hide": false, - "total_acs": 5761, - "total_submitted": 10003, - "total_column_articles": 41, + "total_acs": 5953, + "total_submitted": 10295, + "total_column_articles": 42, "frontend_question_id": "2748", "is_new_question": false }, @@ -15174,8 +15678,8 @@ "question__title": "Count Artist Occurrences On Spotify Ranking List", "question__title_slug": "count-artist-occurrences-on-spotify-ranking-list", "question__hide": false, - "total_acs": 647, - "total_submitted": 871, + "total_acs": 703, + "total_submitted": 948, "total_column_articles": 6, "frontend_question_id": "2669", "is_new_question": false @@ -15195,8 +15699,8 @@ "question__title": "Find Latest Salaries", "question__title_slug": "find-latest-salaries", "question__hide": false, - "total_acs": 743, - "total_submitted": 1047, + "total_acs": 799, + "total_submitted": 1121, "total_column_articles": 11, "frontend_question_id": "2668", "is_new_question": false @@ -15216,8 +15720,8 @@ "question__title": "Lexicographically Smallest String After Substring Operation", "question__title_slug": "lexicographically-smallest-string-after-substring-operation", "question__hide": false, - "total_acs": 6099, - "total_submitted": 17761, + "total_acs": 6184, + "total_submitted": 17984, "total_column_articles": 49, "frontend_question_id": "2734", "is_new_question": false @@ -15237,9 +15741,9 @@ "question__title": "Greatest Common Divisor Traversal", "question__title_slug": "greatest-common-divisor-traversal", "question__hide": false, - "total_acs": 3159, - "total_submitted": 12404, - "total_column_articles": 41, + "total_acs": 3220, + "total_submitted": 12616, + "total_column_articles": 43, "frontend_question_id": "2709", "is_new_question": false }, @@ -15258,9 +15762,9 @@ "question__title": "Find a Good Subset of the Matrix", "question__title_slug": "find-a-good-subset-of-the-matrix", "question__hide": false, - "total_acs": 1771, - "total_submitted": 3123, - "total_column_articles": 19, + "total_acs": 1787, + "total_submitted": 3173, + "total_column_articles": 20, "frontend_question_id": "2732", "is_new_question": false }, @@ -15279,9 +15783,9 @@ "question__title": "Minimize String Length", "question__title_slug": "minimize-string-length", "question__hide": false, - "total_acs": 7503, - "total_submitted": 10306, - "total_column_articles": 60, + "total_acs": 7656, + "total_submitted": 10514, + "total_column_articles": 61, "frontend_question_id": "2716", "is_new_question": false }, @@ -15300,9 +15804,9 @@ "question__title": "Check if The Number is Fascinating", "question__title_slug": "check-if-the-number-is-fascinating", "question__hide": false, - "total_acs": 5730, - "total_submitted": 9399, - "total_column_articles": 63, + "total_acs": 5920, + "total_submitted": 9741, + "total_column_articles": 65, "frontend_question_id": "2729", "is_new_question": false }, @@ -15321,9 +15825,9 @@ "question__title": "The Knight’s Tour", "question__title_slug": "the-knights-tour", "question__hide": false, - "total_acs": 174, - "total_submitted": 254, - "total_column_articles": 8, + "total_acs": 189, + "total_submitted": 274, + "total_column_articles": 9, "frontend_question_id": "2664", "is_new_question": false }, @@ -15342,8 +15846,8 @@ "question__title": "Next Day", "question__title_slug": "next-day", "question__hide": false, - "total_acs": 227, - "total_submitted": 302, + "total_acs": 238, + "total_submitted": 313, "total_column_articles": 7, "frontend_question_id": "2758", "is_new_question": false @@ -15363,9 +15867,9 @@ "question__title": "Timeout Cancellation", "question__title_slug": "timeout-cancellation", "question__hide": false, - "total_acs": 3238, - "total_submitted": 4006, - "total_column_articles": 20, + "total_acs": 3448, + "total_submitted": 4249, + "total_column_articles": 21, "frontend_question_id": "2715", "is_new_question": false }, @@ -15384,8 +15888,8 @@ "question__title": "Return Length of Arguments Passed", "question__title_slug": "return-length-of-arguments-passed", "question__hide": false, - "total_acs": 7846, - "total_submitted": 8448, + "total_acs": 8319, + "total_submitted": 8963, "total_column_articles": 28, "frontend_question_id": "2703", "is_new_question": false @@ -15405,8 +15909,8 @@ "question__title": "Remove Trailing Zeros From a String", "question__title_slug": "remove-trailing-zeros-from-a-string", "question__hide": false, - "total_acs": 9465, - "total_submitted": 11556, + "total_acs": 9715, + "total_submitted": 11868, "total_column_articles": 80, "frontend_question_id": "2710", "is_new_question": false @@ -15426,8 +15930,8 @@ "question__title": "Maximum Strictly Increasing Cells in a Matrix", "question__title_slug": "maximum-strictly-increasing-cells-in-a-matrix", "question__hide": false, - "total_acs": 3007, - "total_submitted": 8191, + "total_acs": 3037, + "total_submitted": 8284, "total_column_articles": 33, "frontend_question_id": "2713", "is_new_question": false @@ -15447,9 +15951,9 @@ "question__title": "Minimum Cost to Make All Characters Equal", "question__title_slug": "minimum-cost-to-make-all-characters-equal", "question__hide": false, - "total_acs": 4859, - "total_submitted": 8512, - "total_column_articles": 60, + "total_acs": 4910, + "total_submitted": 8605, + "total_column_articles": 61, "frontend_question_id": "2712", "is_new_question": false }, @@ -15468,9 +15972,9 @@ "question__title": "Lexicographically Smallest Palindrome", "question__title_slug": "lexicographically-smallest-palindrome", "question__hide": false, - "total_acs": 29434, - "total_submitted": 33644, - "total_column_articles": 184, + "total_acs": 29978, + "total_submitted": 34310, + "total_column_articles": 190, "frontend_question_id": "2697", "is_new_question": false }, @@ -15489,8 +15993,8 @@ "question__title": "Find Maximal Uncovered Ranges", "question__title_slug": "find-maximal-uncovered-ranges", "question__hide": false, - "total_acs": 191, - "total_submitted": 335, + "total_acs": 201, + "total_submitted": 355, "total_column_articles": 6, "frontend_question_id": "2655", "is_new_question": false @@ -15510,8 +16014,8 @@ "question__title": "Generate Circular Array Values", "question__title_slug": "generate-circular-array-values", "question__hide": false, - "total_acs": 132, - "total_submitted": 206, + "total_acs": 151, + "total_submitted": 230, "total_column_articles": 4, "frontend_question_id": "2757", "is_new_question": false @@ -15531,8 +16035,8 @@ "question__title": "To Be Or Not To Be", "question__title_slug": "to-be-or-not-to-be", "question__hide": false, - "total_acs": 7090, - "total_submitted": 12746, + "total_acs": 7432, + "total_submitted": 13294, "total_column_articles": 44, "frontend_question_id": "2704", "is_new_question": false @@ -15552,9 +16056,9 @@ "question__title": "Find the Maximum Achievable Number", "question__title_slug": "find-the-maximum-achievable-number", "question__hide": false, - "total_acs": 14737, - "total_submitted": 16444, - "total_column_articles": 69, + "total_acs": 15298, + "total_submitted": 17063, + "total_column_articles": 72, "frontend_question_id": "2769", "is_new_question": false }, @@ -15573,9 +16077,9 @@ "question__title": "Determine the Minimum Sum of a k-avoiding Array", "question__title_slug": "determine-the-minimum-sum-of-a-k-avoiding-array", "question__hide": false, - "total_acs": 6848, - "total_submitted": 11519, - "total_column_articles": 47, + "total_acs": 6962, + "total_submitted": 11685, + "total_column_articles": 48, "frontend_question_id": "2829", "is_new_question": false }, @@ -15594,9 +16098,9 @@ "question__title": "Collecting Chocolates", "question__title_slug": "collecting-chocolates", "question__hide": false, - "total_acs": 16965, - "total_submitted": 30959, - "total_column_articles": 125, + "total_acs": 17030, + "total_submitted": 31085, + "total_column_articles": 126, "frontend_question_id": "2735", "is_new_question": false }, @@ -15615,8 +16119,8 @@ "question__title": "Create Hello World Function", "question__title_slug": "create-hello-world-function", "question__hide": false, - "total_acs": 14352, - "total_submitted": 16900, + "total_acs": 14871, + "total_submitted": 17480, "total_column_articles": 64, "frontend_question_id": "2667", "is_new_question": false @@ -15636,9 +16140,9 @@ "question__title": "Painting the Walls", "question__title_slug": "painting-the-walls", "question__hide": false, - "total_acs": 3426, - "total_submitted": 9237, - "total_column_articles": 32, + "total_acs": 3507, + "total_submitted": 9413, + "total_column_articles": 34, "frontend_question_id": "2742", "is_new_question": false }, @@ -15657,8 +16161,8 @@ "question__title": "Execute Asynchronous Functions in Parallel", "question__title_slug": "execute-asynchronous-functions-in-parallel", "question__hide": false, - "total_acs": 2305, - "total_submitted": 3826, + "total_acs": 2471, + "total_submitted": 4061, "total_column_articles": 24, "frontend_question_id": "2721", "is_new_question": false @@ -15678,8 +16182,8 @@ "question__title": "Query Batching", "question__title_slug": "query-batching", "question__hide": false, - "total_acs": 104, - "total_submitted": 241, + "total_acs": 109, + "total_submitted": 247, "total_column_articles": 4, "frontend_question_id": "2756", "is_new_question": false @@ -15699,8 +16203,8 @@ "question__title": "Array Wrapper", "question__title_slug": "array-wrapper", "question__hide": false, - "total_acs": 3262, - "total_submitted": 4112, + "total_acs": 3478, + "total_submitted": 4344, "total_column_articles": 30, "frontend_question_id": "2695", "is_new_question": false @@ -15720,9 +16224,9 @@ "question__title": "Compact Object", "question__title_slug": "compact-object", "question__hide": false, - "total_acs": 2492, - "total_submitted": 4029, - "total_column_articles": 35, + "total_acs": 2665, + "total_submitted": 4252, + "total_column_articles": 36, "frontend_question_id": "2705", "is_new_question": false }, @@ -15741,9 +16245,9 @@ "question__title": "Modify Graph Edge Weights", "question__title_slug": "modify-graph-edge-weights", "question__hide": false, - "total_acs": 9680, - "total_submitted": 18623, - "total_column_articles": 60, + "total_acs": 9723, + "total_submitted": 18710, + "total_column_articles": 61, "frontend_question_id": "2699", "is_new_question": false }, @@ -15762,9 +16266,9 @@ "question__title": "Find the Punishment Number of an Integer", "question__title_slug": "find-the-punishment-number-of-an-integer", "question__hide": false, - "total_acs": 27511, - "total_submitted": 35006, - "total_column_articles": 220, + "total_acs": 27831, + "total_submitted": 35442, + "total_column_articles": 222, "frontend_question_id": "2698", "is_new_question": false }, @@ -15783,8 +16287,8 @@ "question__title": "Difference of Number of Distinct Values on Diagonals", "question__title_slug": "difference-of-number-of-distinct-values-on-diagonals", "question__hide": false, - "total_acs": 5249, - "total_submitted": 7319, + "total_acs": 5289, + "total_submitted": 7386, "total_column_articles": 61, "frontend_question_id": "2711", "is_new_question": false @@ -15804,9 +16308,9 @@ "question__title": "Minimum String Length After Removing Substrings", "question__title_slug": "minimum-string-length-after-removing-substrings", "question__hide": false, - "total_acs": 32184, - "total_submitted": 41482, - "total_column_articles": 284, + "total_acs": 32547, + "total_submitted": 41979, + "total_column_articles": 290, "frontend_question_id": "2696", "is_new_question": false }, @@ -15825,8 +16329,8 @@ "question__title": "Date Range Generator", "question__title_slug": "date-range-generator", "question__hide": false, - "total_acs": 131, - "total_submitted": 190, + "total_acs": 140, + "total_submitted": 199, "total_column_articles": 6, "frontend_question_id": "2777", "is_new_question": false @@ -15846,8 +16350,8 @@ "question__title": "Chunk Array", "question__title_slug": "chunk-array", "question__hide": false, - "total_acs": 5309, - "total_submitted": 7149, + "total_acs": 5598, + "total_submitted": 7508, "total_column_articles": 97, "frontend_question_id": "2677", "is_new_question": false @@ -15867,8 +16371,8 @@ "question__title": "Event Emitter", "question__title_slug": "event-emitter", "question__hide": false, - "total_acs": 1926, - "total_submitted": 2942, + "total_acs": 2045, + "total_submitted": 3121, "total_column_articles": 29, "frontend_question_id": "2694", "is_new_question": false @@ -15888,8 +16392,8 @@ "question__title": "Allow One Function Call", "question__title_slug": "allow-one-function-call", "question__hide": false, - "total_acs": 6606, - "total_submitted": 8630, + "total_acs": 6879, + "total_submitted": 8986, "total_column_articles": 57, "frontend_question_id": "2666", "is_new_question": false @@ -15909,8 +16413,8 @@ "question__title": "Deep Merge of Two Objects", "question__title_slug": "deep-merge-of-two-objects", "question__hide": false, - "total_acs": 182, - "total_submitted": 341, + "total_acs": 203, + "total_submitted": 377, "total_column_articles": 7, "frontend_question_id": "2755", "is_new_question": false @@ -15930,9 +16434,9 @@ "question__title": "Maximum Number of Moves in a Grid", "question__title_slug": "maximum-number-of-moves-in-a-grid", "question__hide": false, - "total_acs": 7184, - "total_submitted": 17088, - "total_column_articles": 77, + "total_acs": 24782, + "total_submitted": 50431, + "total_column_articles": 247, "frontend_question_id": "2684", "is_new_question": false }, @@ -15951,9 +16455,9 @@ "question__title": "Count the Number of Complete Components", "question__title_slug": "count-the-number-of-complete-components", "question__hide": false, - "total_acs": 5331, - "total_submitted": 7874, - "total_column_articles": 59, + "total_acs": 5572, + "total_submitted": 8222, + "total_column_articles": 61, "frontend_question_id": "2685", "is_new_question": false }, @@ -15972,9 +16476,9 @@ "question__title": "Neighboring Bitwise XOR", "question__title_slug": "neighboring-bitwise-xor", "question__hide": false, - "total_acs": 6522, - "total_submitted": 9278, - "total_column_articles": 59, + "total_acs": 6630, + "total_submitted": 9406, + "total_column_articles": 60, "frontend_question_id": "2683", "is_new_question": false }, @@ -15993,9 +16497,9 @@ "question__title": "Find the Losers of the Circular Game", "question__title_slug": "find-the-losers-of-the-circular-game", "question__hide": false, - "total_acs": 31261, - "total_submitted": 51501, - "total_column_articles": 232, + "total_acs": 31383, + "total_submitted": 51719, + "total_column_articles": 235, "frontend_question_id": "2682", "is_new_question": false }, @@ -16014,8 +16518,8 @@ "question__title": "Call Function with Custom Context", "question__title_slug": "call-function-with-custom-context", "question__hide": false, - "total_acs": 1642, - "total_submitted": 2426, + "total_acs": 1719, + "total_submitted": 2543, "total_column_articles": 31, "frontend_question_id": "2693", "is_new_question": false @@ -16035,8 +16539,8 @@ "question__title": "Counter II", "question__title_slug": "counter-ii", "question__hide": false, - "total_acs": 9460, - "total_submitted": 14510, + "total_acs": 9846, + "total_submitted": 14992, "total_column_articles": 74, "frontend_question_id": "2665", "is_new_question": false @@ -16056,9 +16560,9 @@ "question__title": "Design Cancellable Function", "question__title_slug": "design-cancellable-function", "question__hide": false, - "total_acs": 732, - "total_submitted": 1320, - "total_column_articles": 19, + "total_acs": 764, + "total_submitted": 1369, + "total_column_articles": 20, "frontend_question_id": "2650", "is_new_question": false }, @@ -16077,8 +16581,8 @@ "question__title": "Movement of Robots", "question__title_slug": "movement-of-robots", "question__hide": false, - "total_acs": 20407, - "total_submitted": 53848, + "total_acs": 20520, + "total_submitted": 54263, "total_column_articles": 140, "frontend_question_id": "2731", "is_new_question": false @@ -16098,9 +16602,9 @@ "question__title": "Find the Longest Semi-Repetitive Substring", "question__title_slug": "find-the-longest-semi-repetitive-substring", "question__hide": false, - "total_acs": 5189, - "total_submitted": 10997, - "total_column_articles": 52, + "total_acs": 5571, + "total_submitted": 11734, + "total_column_articles": 57, "frontend_question_id": "2730", "is_new_question": false }, @@ -16119,9 +16623,9 @@ "question__title": "Semi-Ordered Permutation", "question__title_slug": "semi-ordered-permutation", "question__hide": false, - "total_acs": 7131, - "total_submitted": 9717, - "total_column_articles": 52, + "total_acs": 7257, + "total_submitted": 9907, + "total_column_articles": 54, "frontend_question_id": "2717", "is_new_question": false }, @@ -16140,9 +16644,9 @@ "question__title": "Power of Heroes", "question__title_slug": "power-of-heroes", "question__hide": false, - "total_acs": 18727, - "total_submitted": 45028, - "total_column_articles": 121, + "total_acs": 18807, + "total_submitted": 45203, + "total_column_articles": 122, "frontend_question_id": "2681", "is_new_question": false }, @@ -16161,8 +16665,8 @@ "question__title": "Nested Array Generator", "question__title_slug": "nested-array-generator", "question__hide": false, - "total_acs": 1941, - "total_submitted": 2562, + "total_acs": 2015, + "total_submitted": 2651, "total_column_articles": 40, "frontend_question_id": "2649", "is_new_question": false @@ -16182,8 +16686,8 @@ "question__title": "Convert Callback Based Function to Promise Based Function", "question__title_slug": "convert-callback-based-function-to-promise-based-function", "question__hide": false, - "total_acs": 142, - "total_submitted": 153, + "total_acs": 157, + "total_submitted": 169, "total_column_articles": 5, "frontend_question_id": "2776", "is_new_question": false @@ -16203,8 +16707,8 @@ "question__title": "Undefined to Null", "question__title_slug": "undefined-to-null", "question__hide": false, - "total_acs": 177, - "total_submitted": 236, + "total_acs": 191, + "total_submitted": 252, "total_column_articles": 8, "frontend_question_id": "2775", "is_new_question": false @@ -16224,9 +16728,9 @@ "question__title": "Make Costs of Paths Equal in a Binary Tree", "question__title_slug": "make-costs-of-paths-equal-in-a-binary-tree", "question__hide": false, - "total_acs": 20440, - "total_submitted": 28802, - "total_column_articles": 171, + "total_acs": 21037, + "total_submitted": 29669, + "total_column_articles": 177, "frontend_question_id": "2673", "is_new_question": false }, @@ -16245,8 +16749,8 @@ "question__title": "Number of Adjacent Elements With the Same Color", "question__title_slug": "number-of-adjacent-elements-with-the-same-color", "question__hide": false, - "total_acs": 5410, - "total_submitted": 9237, + "total_acs": 5484, + "total_submitted": 9356, "total_column_articles": 55, "frontend_question_id": "2672", "is_new_question": false @@ -16266,9 +16770,9 @@ "question__title": "Frequency Tracker", "question__title_slug": "frequency-tracker", "question__hide": false, - "total_acs": 6031, - "total_submitted": 18074, - "total_column_articles": 61, + "total_acs": 22562, + "total_submitted": 53914, + "total_column_articles": 162, "frontend_question_id": "2671", "is_new_question": false }, @@ -16287,9 +16791,9 @@ "question__title": "Find the Distinct Difference Array", "question__title_slug": "find-the-distinct-difference-array", "question__hide": false, - "total_acs": 25315, - "total_submitted": 30401, - "total_column_articles": 201, + "total_acs": 25661, + "total_submitted": 30855, + "total_column_articles": 204, "frontend_question_id": "2670", "is_new_question": false }, @@ -16308,8 +16812,8 @@ "question__title": "Make Object Immutable", "question__title_slug": "make-object-immutable", "question__hide": false, - "total_acs": 168, - "total_submitted": 293, + "total_acs": 184, + "total_submitted": 312, "total_column_articles": 7, "frontend_question_id": "2692", "is_new_question": false @@ -16329,8 +16833,8 @@ "question__title": "Generate Fibonacci Sequence", "question__title_slug": "generate-fibonacci-sequence", "question__hide": false, - "total_acs": 4017, - "total_submitted": 4990, + "total_acs": 4169, + "total_submitted": 5163, "total_column_articles": 57, "frontend_question_id": "2648", "is_new_question": false @@ -16350,8 +16854,8 @@ "question__title": "Differences Between Two Objects", "question__title_slug": "differences-between-two-objects", "question__hide": false, - "total_acs": 667, - "total_submitted": 1150, + "total_acs": 677, + "total_submitted": 1164, "total_column_articles": 25, "frontend_question_id": "2700", "is_new_question": false @@ -16371,8 +16875,8 @@ "question__title": "Immutability Helper", "question__title_slug": "immutability-helper", "question__hide": false, - "total_acs": 81, - "total_submitted": 350, + "total_acs": 82, + "total_submitted": 358, "total_column_articles": 3, "frontend_question_id": "2691", "is_new_question": false @@ -16392,8 +16896,8 @@ "question__title": "Infinite Method Object", "question__title_slug": "infinite-method-object", "question__hide": false, - "total_acs": 283, - "total_submitted": 323, + "total_acs": 293, + "total_submitted": 333, "total_column_articles": 6, "frontend_question_id": "2690", "is_new_question": false @@ -16413,8 +16917,8 @@ "question__title": "Throttle", "question__title_slug": "throttle", "question__hide": false, - "total_acs": 1045, - "total_submitted": 2253, + "total_acs": 1060, + "total_submitted": 2275, "total_column_articles": 29, "frontend_question_id": "2676", "is_new_question": false @@ -16434,8 +16938,8 @@ "question__title": "Bind Function to Context", "question__title_slug": "bind-function-to-context", "question__hide": false, - "total_acs": 195, - "total_submitted": 233, + "total_acs": 213, + "total_submitted": 261, "total_column_articles": 7, "frontend_question_id": "2754", "is_new_question": false @@ -16455,8 +16959,8 @@ "question__title": "Array of Objects to Matrix", "question__title_slug": "array-of-objects-to-matrix", "question__hide": false, - "total_acs": 783, - "total_submitted": 1381, + "total_acs": 797, + "total_submitted": 1403, "total_column_articles": 27, "frontend_question_id": "2675", "is_new_question": false @@ -16476,9 +16980,9 @@ "question__title": "Array Upper Bound", "question__title_slug": "array-upper-bound", "question__hide": false, - "total_acs": 241, - "total_submitted": 299, - "total_column_articles": 9, + "total_acs": 251, + "total_submitted": 310, + "total_column_articles": 10, "frontend_question_id": "2774", "is_new_question": false }, @@ -16497,9 +17001,9 @@ "question__title": "Maximum Sum With Exactly K Elements ", "question__title_slug": "maximum-sum-with-exactly-k-elements", "question__hide": false, - "total_acs": 36688, - "total_submitted": 42342, - "total_column_articles": 228, + "total_acs": 37604, + "total_submitted": 43481, + "total_column_articles": 239, "frontend_question_id": "2656", "is_new_question": false }, @@ -16518,9 +17022,9 @@ "question__title": "Find the Prefix Common Array of Two Arrays", "question__title_slug": "find-the-prefix-common-array-of-two-arrays", "question__hide": false, - "total_acs": 4931, - "total_submitted": 6065, - "total_column_articles": 55, + "total_acs": 5042, + "total_submitted": 6213, + "total_column_articles": 61, "frontend_question_id": "2657", "is_new_question": false }, @@ -16539,8 +17043,8 @@ "question__title": "Make Array Empty", "question__title_slug": "make-array-empty", "question__hide": false, - "total_acs": 2621, - "total_submitted": 6658, + "total_acs": 2665, + "total_submitted": 6765, "total_column_articles": 30, "frontend_question_id": "2659", "is_new_question": false @@ -16560,9 +17064,9 @@ "question__title": "Maximum Number of Fish in a Grid", "question__title_slug": "maximum-number-of-fish-in-a-grid", "question__hide": false, - "total_acs": 4347, - "total_submitted": 7176, - "total_column_articles": 48, + "total_acs": 4496, + "total_submitted": 7401, + "total_column_articles": 50, "frontend_question_id": "2658", "is_new_question": false }, @@ -16581,9 +17085,9 @@ "question__title": "Cache With Time Limit", "question__title_slug": "cache-with-time-limit", "question__hide": false, - "total_acs": 4851, - "total_submitted": 8201, - "total_column_articles": 94, + "total_acs": 5063, + "total_submitted": 8546, + "total_column_articles": 96, "frontend_question_id": "2622", "is_new_question": false }, @@ -16602,9 +17106,9 @@ "question__title": "Array Reduce Transformation", "question__title_slug": "array-reduce-transformation", "question__hide": false, - "total_acs": 10494, - "total_submitted": 13478, - "total_column_articles": 90, + "total_acs": 10916, + "total_submitted": 13975, + "total_column_articles": 92, "frontend_question_id": "2626", "is_new_question": false }, @@ -16623,9 +17127,9 @@ "question__title": "Snail Traversal", "question__title_slug": "snail-traversal", "question__hide": false, - "total_acs": 3465, - "total_submitted": 5486, - "total_column_articles": 95, + "total_acs": 3612, + "total_submitted": 5733, + "total_column_articles": 97, "frontend_question_id": "2624", "is_new_question": false }, @@ -16644,9 +17148,9 @@ "question__title": "Flatten Deeply Nested Array", "question__title_slug": "flatten-deeply-nested-array", "question__hide": false, - "total_acs": 6357, - "total_submitted": 11875, - "total_column_articles": 91, + "total_acs": 6667, + "total_submitted": 12403, + "total_column_articles": 94, "frontend_question_id": "2625", "is_new_question": false }, @@ -16665,9 +17169,9 @@ "question__title": "Check if Object Instance of Class", "question__title_slug": "check-if-object-instance-of-class", "question__hide": false, - "total_acs": 5952, - "total_submitted": 17387, - "total_column_articles": 65, + "total_acs": 6217, + "total_submitted": 18132, + "total_column_articles": 67, "frontend_question_id": "2618", "is_new_question": false }, @@ -16686,8 +17190,8 @@ "question__title": "Count of Integers", "question__title_slug": "count-of-integers", "question__hide": false, - "total_acs": 14700, - "total_submitted": 26302, + "total_acs": 14790, + "total_submitted": 26527, "total_column_articles": 96, "frontend_question_id": "2719", "is_new_question": false @@ -16707,8 +17211,8 @@ "question__title": "Buy Two Chocolates", "question__title_slug": "buy-two-chocolates", "question__hide": false, - "total_acs": 27301, - "total_submitted": 35343, + "total_acs": 27645, + "total_submitted": 35809, "total_column_articles": 206, "frontend_question_id": "2706", "is_new_question": false @@ -16728,9 +17232,9 @@ "question__title": "Extra Characters in a String", "question__title_slug": "extra-characters-in-a-string", "question__hide": false, - "total_acs": 20575, - "total_submitted": 32435, - "total_column_articles": 182, + "total_acs": 20838, + "total_submitted": 32815, + "total_column_articles": 185, "frontend_question_id": "2707", "is_new_question": false }, @@ -16749,9 +17253,9 @@ "question__title": "Maximum Strength of a Group", "question__title_slug": "maximum-strength-of-a-group", "question__hide": false, - "total_acs": 5038, - "total_submitted": 16452, - "total_column_articles": 69, + "total_acs": 5163, + "total_submitted": 16817, + "total_column_articles": 70, "frontend_question_id": "2708", "is_new_question": false }, @@ -16770,8 +17274,8 @@ "question__title": "Minimum Number of Operations to Make All Array Elements Equal to 1", "question__title_slug": "minimum-number-of-operations-to-make-all-array-elements-equal-to-1", "question__hide": false, - "total_acs": 3964, - "total_submitted": 9792, + "total_acs": 3991, + "total_submitted": 9862, "total_column_articles": 31, "frontend_question_id": "2654", "is_new_question": false @@ -16791,9 +17295,9 @@ "question__title": "Sum Multiples", "question__title_slug": "sum-multiples", "question__hide": false, - "total_acs": 39020, - "total_submitted": 49315, - "total_column_articles": 182, + "total_acs": 39709, + "total_submitted": 50232, + "total_column_articles": 183, "frontend_question_id": "2652", "is_new_question": false }, @@ -16812,9 +17316,9 @@ "question__title": "Sliding Subarray Beauty", "question__title_slug": "sliding-subarray-beauty", "question__hide": false, - "total_acs": 6144, - "total_submitted": 16659, - "total_column_articles": 71, + "total_acs": 6338, + "total_submitted": 17056, + "total_column_articles": 72, "frontend_question_id": "2653", "is_new_question": false }, @@ -16833,8 +17337,8 @@ "question__title": "Promise Pool", "question__title_slug": "promise-pool", "question__hide": false, - "total_acs": 1375, - "total_submitted": 2164, + "total_acs": 1410, + "total_submitted": 2207, "total_column_articles": 33, "frontend_question_id": "2636", "is_new_question": false @@ -16854,8 +17358,8 @@ "question__title": "Promise Time Limit", "question__title_slug": "promise-time-limit", "question__hide": false, - "total_acs": 4579, - "total_submitted": 6964, + "total_acs": 4787, + "total_submitted": 7214, "total_column_articles": 41, "frontend_question_id": "2637", "is_new_question": false @@ -16875,9 +17379,9 @@ "question__title": "Calculate Delayed Arrival Time", "question__title_slug": "calculate-delayed-arrival-time", "question__hide": false, - "total_acs": 41647, - "total_submitted": 47652, - "total_column_articles": 155, + "total_acs": 42140, + "total_submitted": 48292, + "total_column_articles": 160, "frontend_question_id": "2651", "is_new_question": false }, @@ -16896,9 +17400,9 @@ "question__title": "Apply Transform Over Each Element in Array", "question__title_slug": "apply-transform-over-each-element-in-array", "question__hide": false, - "total_acs": 10301, - "total_submitted": 13225, - "total_column_articles": 65, + "total_acs": 10720, + "total_submitted": 13710, + "total_column_articles": 66, "frontend_question_id": "2635", "is_new_question": false }, @@ -16917,9 +17421,9 @@ "question__title": "Filter Elements from Array", "question__title_slug": "filter-elements-from-array", "question__hide": false, - "total_acs": 9860, - "total_submitted": 13231, - "total_column_articles": 82, + "total_acs": 10285, + "total_submitted": 13741, + "total_column_articles": 83, "frontend_question_id": "2634", "is_new_question": false }, @@ -16938,8 +17442,8 @@ "question__title": "Convert Object to JSON String", "question__title_slug": "convert-object-to-json-string", "question__hide": false, - "total_acs": 1360, - "total_submitted": 2286, + "total_acs": 1376, + "total_submitted": 2311, "total_column_articles": 45, "frontend_question_id": "2633", "is_new_question": false @@ -16959,8 +17463,8 @@ "question__title": "Memoize II", "question__title_slug": "memoize-ii", "question__hide": false, - "total_acs": 1560, - "total_submitted": 3945, + "total_acs": 1634, + "total_submitted": 4118, "total_column_articles": 21, "frontend_question_id": "2630", "is_new_question": false @@ -16980,8 +17484,8 @@ "question__title": "Debounce", "question__title_slug": "debounce", "question__hide": false, - "total_acs": 5602, - "total_submitted": 7342, + "total_acs": 5893, + "total_submitted": 7681, "total_column_articles": 42, "frontend_question_id": "2627", "is_new_question": false @@ -17001,8 +17505,8 @@ "question__title": "Group By", "question__title_slug": "group-by", "question__hide": false, - "total_acs": 4225, - "total_submitted": 5324, + "total_acs": 4436, + "total_submitted": 5571, "total_column_articles": 54, "frontend_question_id": "2631", "is_new_question": false @@ -17022,9 +17526,9 @@ "question__title": "Function Composition", "question__title_slug": "function-composition", "question__hide": false, - "total_acs": 9731, - "total_submitted": 11835, - "total_column_articles": 101, + "total_acs": 10107, + "total_submitted": 12271, + "total_column_articles": 103, "frontend_question_id": "2629", "is_new_question": false }, @@ -17043,8 +17547,8 @@ "question__title": "Curry", "question__title_slug": "curry", "question__hide": false, - "total_acs": 1965, - "total_submitted": 2393, + "total_acs": 1998, + "total_submitted": 2431, "total_column_articles": 37, "frontend_question_id": "2632", "is_new_question": false @@ -17064,8 +17568,8 @@ "question__title": "Minimize the Total Price of the Trips", "question__title_slug": "minimize-the-total-price-of-the-trips", "question__hide": false, - "total_acs": 14028, - "total_submitted": 19993, + "total_acs": 14102, + "total_submitted": 20112, "total_column_articles": 123, "frontend_question_id": "2646", "is_new_question": false @@ -17085,9 +17589,9 @@ "question__title": "Count the Number of K-Free Subsets", "question__title_slug": "count-the-number-of-k-free-subsets", "question__hide": false, - "total_acs": 144, - "total_submitted": 280, - "total_column_articles": 6, + "total_acs": 160, + "total_submitted": 321, + "total_column_articles": 7, "frontend_question_id": "2638", "is_new_question": false }, @@ -17106,8 +17610,8 @@ "question__title": "Row With Maximum Ones", "question__title_slug": "row-with-maximum-ones", "question__hide": false, - "total_acs": 10163, - "total_submitted": 12739, + "total_acs": 10375, + "total_submitted": 13036, "total_column_articles": 74, "frontend_question_id": "2643", "is_new_question": false @@ -17127,8 +17631,8 @@ "question__title": "Minimum Additions to Make Valid String", "question__title_slug": "minimum-additions-to-make-valid-string", "question__hide": false, - "total_acs": 28407, - "total_submitted": 42095, + "total_acs": 28587, + "total_submitted": 42387, "total_column_articles": 396, "frontend_question_id": "2645", "is_new_question": false @@ -17148,8 +17652,8 @@ "question__title": "JSON Deep Equal", "question__title_slug": "json-deep-equal", "question__hide": false, - "total_acs": 1651, - "total_submitted": 5030, + "total_acs": 1674, + "total_submitted": 5074, "total_column_articles": 44, "frontend_question_id": "2628", "is_new_question": false @@ -17169,9 +17673,9 @@ "question__title": "Array Prototype Last", "question__title_slug": "array-prototype-last", "question__hide": false, - "total_acs": 18398, - "total_submitted": 26564, - "total_column_articles": 132, + "total_acs": 19165, + "total_submitted": 27596, + "total_column_articles": 134, "frontend_question_id": "2619", "is_new_question": false }, @@ -17190,9 +17694,9 @@ "question__title": "Sleep", "question__title_slug": "sleep", "question__hide": false, - "total_acs": 13393, - "total_submitted": 16163, - "total_column_articles": 81, + "total_acs": 13960, + "total_submitted": 16805, + "total_column_articles": 82, "frontend_question_id": "2621", "is_new_question": false }, @@ -17211,9 +17715,9 @@ "question__title": "Counter", "question__title_slug": "counter", "question__hide": false, - "total_acs": 23989, - "total_submitted": 29717, - "total_column_articles": 115, + "total_acs": 24848, + "total_submitted": 30737, + "total_column_articles": 117, "frontend_question_id": "2620", "is_new_question": false }, @@ -17232,8 +17736,8 @@ "question__title": "Memoize", "question__title_slug": "memoize", "question__hide": false, - "total_acs": 6403, - "total_submitted": 10513, + "total_acs": 6689, + "total_submitted": 11008, "total_column_articles": 63, "frontend_question_id": "2623", "is_new_question": false @@ -17253,9 +17757,9 @@ "question__title": "Maximum OR", "question__title_slug": "maximum-or", "question__hide": false, - "total_acs": 3650, - "total_submitted": 8305, - "total_column_articles": 38, + "total_acs": 3736, + "total_submitted": 8486, + "total_column_articles": 40, "frontend_question_id": "2680", "is_new_question": false }, @@ -17274,8 +17778,8 @@ "question__title": "Minimum Operations to Make Numbers Non-positive", "question__title_slug": "minimum-operations-to-make-numbers-non-positive", "question__hide": false, - "total_acs": 160, - "total_submitted": 318, + "total_acs": 168, + "total_submitted": 344, "total_column_articles": 10, "frontend_question_id": "2702", "is_new_question": false @@ -17295,9 +17799,9 @@ "question__title": "Sum in a Matrix", "question__title_slug": "sum-in-a-matrix", "question__hide": false, - "total_acs": 26110, - "total_submitted": 33504, - "total_column_articles": 215, + "total_acs": 26251, + "total_submitted": 33693, + "total_column_articles": 216, "frontend_question_id": "2679", "is_new_question": false }, @@ -17316,9 +17820,9 @@ "question__title": "Number of Senior Citizens", "question__title_slug": "number-of-senior-citizens", "question__hide": false, - "total_acs": 36106, - "total_submitted": 45514, - "total_column_articles": 214, + "total_acs": 36841, + "total_submitted": 46499, + "total_column_articles": 219, "frontend_question_id": "2678", "is_new_question": false }, @@ -17337,8 +17841,8 @@ "question__title": "Minimum Reverse Operations", "question__title_slug": "minimum-reverse-operations", "question__hide": false, - "total_acs": 2677, - "total_submitted": 12582, + "total_acs": 2698, + "total_submitted": 12641, "total_column_articles": 34, "frontend_question_id": "2612", "is_new_question": false @@ -17358,9 +17862,9 @@ "question__title": "Mice and Cheese", "question__title_slug": "mice-and-cheese", "question__hide": false, - "total_acs": 28390, - "total_submitted": 48639, - "total_column_articles": 303, + "total_acs": 28517, + "total_submitted": 48875, + "total_column_articles": 305, "frontend_question_id": "2611", "is_new_question": false }, @@ -17379,9 +17883,9 @@ "question__title": "Convert an Array Into a 2D Array With Conditions", "question__title_slug": "convert-an-array-into-a-2d-array-with-conditions", "question__hide": false, - "total_acs": 9298, - "total_submitted": 11045, - "total_column_articles": 103, + "total_acs": 9431, + "total_submitted": 11199, + "total_column_articles": 104, "frontend_question_id": "2610", "is_new_question": false }, @@ -17400,9 +17904,9 @@ "question__title": "Find the Longest Balanced Substring of a Binary String", "question__title_slug": "find-the-longest-balanced-substring-of-a-binary-string", "question__hide": false, - "total_acs": 33693, - "total_submitted": 58329, - "total_column_articles": 369, + "total_acs": 33924, + "total_submitted": 58796, + "total_column_articles": 371, "frontend_question_id": "2609", "is_new_question": false }, @@ -17421,9 +17925,9 @@ "question__title": "Prime In Diagonal", "question__title_slug": "prime-in-diagonal", "question__hide": false, - "total_acs": 9312, - "total_submitted": 27032, - "total_column_articles": 63, + "total_acs": 9527, + "total_submitted": 27475, + "total_column_articles": 65, "frontend_question_id": "2614", "is_new_question": false }, @@ -17442,9 +17946,9 @@ "question__title": "Sum of Distances", "question__title_slug": "sum-of-distances", "question__hide": false, - "total_acs": 6174, - "total_submitted": 17033, - "total_column_articles": 66, + "total_acs": 6230, + "total_submitted": 17146, + "total_column_articles": 67, "frontend_question_id": "2615", "is_new_question": false }, @@ -17463,9 +17967,9 @@ "question__title": "Minimize the Maximum Difference of Pairs", "question__title_slug": "minimize-the-maximum-difference-of-pairs", "question__hide": false, - "total_acs": 4847, - "total_submitted": 11756, - "total_column_articles": 41, + "total_acs": 4938, + "total_submitted": 11944, + "total_column_articles": 43, "frontend_question_id": "2616", "is_new_question": false }, @@ -17484,8 +17988,8 @@ "question__title": "Beautiful Pairs", "question__title_slug": "beautiful-pairs", "question__hide": false, - "total_acs": 105, - "total_submitted": 292, + "total_acs": 109, + "total_submitted": 317, "total_column_articles": 5, "frontend_question_id": "2613", "is_new_question": false @@ -17505,9 +18009,9 @@ "question__title": "Minimum Operations to Make All Array Elements Equal", "question__title_slug": "minimum-operations-to-make-all-array-elements-equal", "question__hide": false, - "total_acs": 7847, - "total_submitted": 22470, - "total_column_articles": 104, + "total_acs": 8267, + "total_submitted": 23377, + "total_column_articles": 108, "frontend_question_id": "2602", "is_new_question": false }, @@ -17526,9 +18030,9 @@ "question__title": "Collect Coins in a Tree", "question__title_slug": "collect-coins-in-a-tree", "question__hide": false, - "total_acs": 14325, - "total_submitted": 24295, - "total_column_articles": 100, + "total_acs": 14373, + "total_submitted": 24394, + "total_column_articles": 101, "frontend_question_id": "2603", "is_new_question": false }, @@ -17547,8 +18051,8 @@ "question__title": "Prime Subtraction Operation", "question__title_slug": "prime-subtraction-operation", "question__hide": false, - "total_acs": 7814, - "total_submitted": 19942, + "total_acs": 7874, + "total_submitted": 20097, "total_column_articles": 89, "frontend_question_id": "2601", "is_new_question": false @@ -17568,8 +18072,8 @@ "question__title": "K Items With the Maximum Sum", "question__title_slug": "k-items-with-the-maximum-sum", "question__hide": false, - "total_acs": 34369, - "total_submitted": 50760, + "total_acs": 34567, + "total_submitted": 51056, "total_column_articles": 234, "frontend_question_id": "2600", "is_new_question": false @@ -17589,9 +18093,9 @@ "question__title": "Left and Right Sum Differences", "question__title_slug": "left-and-right-sum-differences", "question__hide": false, - "total_acs": 13896, - "total_submitted": 16604, - "total_column_articles": 148, + "total_acs": 14194, + "total_submitted": 16956, + "total_column_articles": 153, "frontend_question_id": "2574", "is_new_question": false }, @@ -17610,9 +18114,9 @@ "question__title": "Find the Divisibility Array of a String", "question__title_slug": "find-the-divisibility-array-of-a-string", "question__hide": false, - "total_acs": 8614, - "total_submitted": 25662, - "total_column_articles": 84, + "total_acs": 29906, + "total_submitted": 69602, + "total_column_articles": 207, "frontend_question_id": "2575", "is_new_question": false }, @@ -17631,8 +18135,8 @@ "question__title": "Find the Maximum Number of Marked Indices", "question__title_slug": "find-the-maximum-number-of-marked-indices", "question__hide": false, - "total_acs": 7708, - "total_submitted": 20171, + "total_acs": 7853, + "total_submitted": 20468, "total_column_articles": 83, "frontend_question_id": "2576", "is_new_question": false @@ -17652,8 +18156,8 @@ "question__title": "Minimum Time to Visit a Cell In a Grid", "question__title_slug": "minimum-time-to-visit-a-cell-in-a-grid", "question__hide": false, - "total_acs": 4269, - "total_submitted": 10651, + "total_acs": 4346, + "total_submitted": 10821, "total_column_articles": 50, "frontend_question_id": "2577", "is_new_question": false @@ -17673,9 +18177,9 @@ "question__title": "Minimum Operations to Reduce an Integer to 0", "question__title_slug": "minimum-operations-to-reduce-an-integer-to-0", "question__hide": false, - "total_acs": 8236, - "total_submitted": 14845, - "total_column_articles": 134, + "total_acs": 8351, + "total_submitted": 15058, + "total_column_articles": 137, "frontend_question_id": "2571", "is_new_question": false }, @@ -17694,8 +18198,8 @@ "question__title": "Count the Number of Square-Free Subsets", "question__title_slug": "count-the-number-of-square-free-subsets", "question__hide": false, - "total_acs": 4088, - "total_submitted": 13149, + "total_acs": 4147, + "total_submitted": 13310, "total_column_articles": 44, "frontend_question_id": "2572", "is_new_question": false @@ -17715,9 +18219,9 @@ "question__title": "Find the String with LCP", "question__title_slug": "find-the-string-with-lcp", "question__hide": false, - "total_acs": 2002, - "total_submitted": 5602, - "total_column_articles": 33, + "total_acs": 2036, + "total_submitted": 5716, + "total_column_articles": 34, "frontend_question_id": "2573", "is_new_question": false }, @@ -17736,9 +18240,9 @@ "question__title": "Merge Two 2D Arrays by Summing Values", "question__title_slug": "merge-two-2d-arrays-by-summing-values", "question__hide": false, - "total_acs": 9788, - "total_submitted": 14064, - "total_column_articles": 90, + "total_acs": 9892, + "total_submitted": 14216, + "total_column_articles": 91, "frontend_question_id": "2570", "is_new_question": false }, @@ -17757,9 +18261,9 @@ "question__title": "Minimum Score by Changing Two Elements", "question__title_slug": "minimum-score-by-changing-two-elements", "question__hide": false, - "total_acs": 4551, - "total_submitted": 8610, - "total_column_articles": 37, + "total_acs": 4633, + "total_submitted": 8751, + "total_column_articles": 40, "frontend_question_id": "2567", "is_new_question": false }, @@ -17778,9 +18282,9 @@ "question__title": "Minimum Impossible OR", "question__title_slug": "minimum-impossible-or", "question__hide": false, - "total_acs": 4239, - "total_submitted": 6918, - "total_column_articles": 32, + "total_acs": 4312, + "total_submitted": 7025, + "total_column_articles": 33, "frontend_question_id": "2568", "is_new_question": false }, @@ -17799,9 +18303,9 @@ "question__title": "Maximum Difference by Remapping a Digit", "question__title_slug": "maximum-difference-by-remapping-a-digit", "question__hide": false, - "total_acs": 6281, - "total_submitted": 9875, - "total_column_articles": 73, + "total_acs": 6451, + "total_submitted": 10150, + "total_column_articles": 74, "frontend_question_id": "2566", "is_new_question": false }, @@ -17820,9 +18324,9 @@ "question__title": "Handling Sum Queries After Update", "question__title_slug": "handling-sum-queries-after-update", "question__hide": false, - "total_acs": 13136, - "total_submitted": 31014, - "total_column_articles": 111, + "total_acs": 13166, + "total_submitted": 31118, + "total_column_articles": 112, "frontend_question_id": "2569", "is_new_question": false }, @@ -17841,8 +18345,8 @@ "question__title": "Maximum Number of Integers to Choose From a Range II", "question__title_slug": "maximum-number-of-integers-to-choose-from-a-range-ii", "question__hide": false, - "total_acs": 233, - "total_submitted": 589, + "total_acs": 248, + "total_submitted": 639, "total_column_articles": 8, "frontend_question_id": "2557", "is_new_question": false @@ -17862,8 +18366,8 @@ "question__title": "Subsequence With the Minimum Score", "question__title_slug": "subsequence-with-the-minimum-score", "question__hide": false, - "total_acs": 3254, - "total_submitted": 8930, + "total_acs": 3283, + "total_submitted": 8998, "total_column_articles": 38, "frontend_question_id": "2565", "is_new_question": false @@ -17883,8 +18387,8 @@ "question__title": "Substring XOR Queries", "question__title_slug": "substring-xor-queries", "question__hide": false, - "total_acs": 5358, - "total_submitted": 14237, + "total_acs": 5424, + "total_submitted": 14387, "total_column_articles": 64, "frontend_question_id": "2564", "is_new_question": false @@ -17904,9 +18408,9 @@ "question__title": "Count the Number of Fair Pairs", "question__title_slug": "count-the-number-of-fair-pairs", "question__hide": false, - "total_acs": 8713, - "total_submitted": 24665, - "total_column_articles": 90, + "total_acs": 8836, + "total_submitted": 24972, + "total_column_articles": 91, "frontend_question_id": "2563", "is_new_question": false }, @@ -17925,9 +18429,9 @@ "question__title": "Find the Array Concatenation Value", "question__title_slug": "find-the-array-concatenation-value", "question__hide": false, - "total_acs": 35147, - "total_submitted": 46534, - "total_column_articles": 285, + "total_acs": 35481, + "total_submitted": 46972, + "total_column_articles": 286, "frontend_question_id": "2562", "is_new_question": false }, @@ -17946,9 +18450,9 @@ "question__title": "Minimum Number of Visited Cells in a Grid", "question__title_slug": "minimum-number-of-visited-cells-in-a-grid", "question__hide": false, - "total_acs": 3706, - "total_submitted": 11395, - "total_column_articles": 64, + "total_acs": 8424, + "total_submitted": 22946, + "total_column_articles": 89, "frontend_question_id": "2617", "is_new_question": false }, @@ -17967,8 +18471,8 @@ "question__title": "The Number of Beautiful Subsets", "question__title_slug": "the-number-of-beautiful-subsets", "question__hide": false, - "total_acs": 7706, - "total_submitted": 21554, + "total_acs": 7839, + "total_submitted": 21877, "total_column_articles": 64, "frontend_question_id": "2597", "is_new_question": false @@ -17988,9 +18492,9 @@ "question__title": "Find Score of an Array After Marking All Elements", "question__title_slug": "find-score-of-an-array-after-marking-all-elements", "question__hide": false, - "total_acs": 4851, - "total_submitted": 9260, - "total_column_articles": 53, + "total_acs": 4912, + "total_submitted": 9373, + "total_column_articles": 54, "frontend_question_id": "2593", "is_new_question": false }, @@ -18009,9 +18513,9 @@ "question__title": "Find the Maximum Divisibility Score", "question__title_slug": "find-the-maximum-divisibility-score", "question__hide": false, - "total_acs": 8014, - "total_submitted": 15699, - "total_column_articles": 38, + "total_acs": 8142, + "total_submitted": 15897, + "total_column_articles": 41, "frontend_question_id": "2644", "is_new_question": false }, @@ -18030,9 +18534,9 @@ "question__title": "Maximum Price to Fill a Bag", "question__title_slug": "maximum-price-to-fill-a-bag", "question__hide": false, - "total_acs": 309, - "total_submitted": 628, - "total_column_articles": 9, + "total_acs": 350, + "total_submitted": 690, + "total_column_articles": 11, "frontend_question_id": "2548", "is_new_question": false }, @@ -18051,9 +18555,9 @@ "question__title": "Take Gifts From the Richest Pile", "question__title_slug": "take-gifts-from-the-richest-pile", "question__hide": false, - "total_acs": 30027, - "total_submitted": 41998, - "total_column_articles": 225, + "total_acs": 30448, + "total_submitted": 42652, + "total_column_articles": 228, "frontend_question_id": "2558", "is_new_question": false }, @@ -18072,9 +18576,9 @@ "question__title": "Count Vowel Strings in Ranges", "question__title_slug": "count-vowel-strings-in-ranges", "question__hide": false, - "total_acs": 24760, - "total_submitted": 38959, - "total_column_articles": 269, + "total_acs": 24837, + "total_submitted": 39083, + "total_column_articles": 270, "frontend_question_id": "2559", "is_new_question": false }, @@ -18093,9 +18597,9 @@ "question__title": "House Robber IV", "question__title_slug": "house-robber-iv", "question__hide": false, - "total_acs": 25295, - "total_submitted": 41972, - "total_column_articles": 152, + "total_acs": 25646, + "total_submitted": 42514, + "total_column_articles": 156, "frontend_question_id": "2560", "is_new_question": false }, @@ -18114,8 +18618,8 @@ "question__title": "Rearranging Fruits", "question__title_slug": "rearranging-fruits", "question__hide": false, - "total_acs": 3462, - "total_submitted": 9177, + "total_acs": 3484, + "total_submitted": 9241, "total_column_articles": 36, "frontend_question_id": "2561", "is_new_question": false @@ -18135,8 +18639,8 @@ "question__title": "Design a Todo List", "question__title_slug": "design-a-todo-list", "question__hide": false, - "total_acs": 166, - "total_submitted": 304, + "total_acs": 185, + "total_submitted": 327, "total_column_articles": 6, "frontend_question_id": "2590", "is_new_question": false @@ -18156,8 +18660,8 @@ "question__title": "Lexicographically Smallest Beautiful String", "question__title_slug": "lexicographically-smallest-beautiful-string", "question__hide": false, - "total_acs": 1960, - "total_submitted": 4303, + "total_acs": 1980, + "total_submitted": 4363, "total_column_articles": 33, "frontend_question_id": "2663", "is_new_question": false @@ -18177,8 +18681,8 @@ "question__title": "Minimum Cost of a Path With Special Roads", "question__title_slug": "minimum-cost-of-a-path-with-special-roads", "question__hide": false, - "total_acs": 3967, - "total_submitted": 10422, + "total_acs": 4083, + "total_submitted": 10639, "total_column_articles": 62, "frontend_question_id": "2662", "is_new_question": false @@ -18198,9 +18702,9 @@ "question__title": "First Completely Painted Row or Column", "question__title_slug": "first-completely-painted-row-or-column", "question__hide": false, - "total_acs": 24548, - "total_submitted": 41011, - "total_column_articles": 250, + "total_acs": 24665, + "total_submitted": 41199, + "total_column_articles": 251, "frontend_question_id": "2661", "is_new_question": false }, @@ -18219,9 +18723,9 @@ "question__title": "Determine the Winner of a Bowling Game", "question__title_slug": "determine-the-winner-of-a-bowling-game", "question__hide": false, - "total_acs": 27335, - "total_submitted": 59133, - "total_column_articles": 197, + "total_acs": 27533, + "total_submitted": 59591, + "total_column_articles": 198, "frontend_question_id": "2660", "is_new_question": false }, @@ -18240,8 +18744,8 @@ "question__title": "Count the Number of Good Subsequences", "question__title_slug": "count-the-number-of-good-subsequences", "question__hide": false, - "total_acs": 203, - "total_submitted": 338, + "total_acs": 211, + "total_submitted": 366, "total_column_articles": 5, "frontend_question_id": "2539", "is_new_question": false @@ -18261,9 +18765,9 @@ "question__title": "Count Increasing Quadruplets", "question__title_slug": "count-increasing-quadruplets", "question__hide": false, - "total_acs": 4476, - "total_submitted": 11200, - "total_column_articles": 47, + "total_acs": 4556, + "total_submitted": 11360, + "total_column_articles": 49, "frontend_question_id": "2552", "is_new_question": false }, @@ -18282,8 +18786,8 @@ "question__title": "Put Marbles in Bags", "question__title_slug": "put-marbles-in-bags", "question__hide": false, - "total_acs": 4276, - "total_submitted": 7700, + "total_acs": 4332, + "total_submitted": 7800, "total_column_articles": 43, "frontend_question_id": "2551", "is_new_question": false @@ -18303,8 +18807,8 @@ "question__title": "Count Collisions of Monkeys on a Polygon", "question__title_slug": "count-collisions-of-monkeys-on-a-polygon", "question__hide": false, - "total_acs": 6069, - "total_submitted": 20608, + "total_acs": 6128, + "total_submitted": 20767, "total_column_articles": 48, "frontend_question_id": "2550", "is_new_question": false @@ -18324,9 +18828,9 @@ "question__title": "Count Distinct Numbers on Board", "question__title_slug": "count-distinct-numbers-on-board", "question__hide": false, - "total_acs": 8322, - "total_submitted": 13127, - "total_column_articles": 65, + "total_acs": 8457, + "total_submitted": 13309, + "total_column_articles": 66, "frontend_question_id": "2549", "is_new_question": false }, @@ -18345,9 +18849,9 @@ "question__title": "Design Graph With Shortest Path Calculator", "question__title_slug": "design-graph-with-shortest-path-calculator", "question__hide": false, - "total_acs": 5315, - "total_submitted": 9046, - "total_column_articles": 56, + "total_acs": 5726, + "total_submitted": 9607, + "total_column_articles": 59, "frontend_question_id": "2642", "is_new_question": false }, @@ -18366,9 +18870,9 @@ "question__title": "Cousins in Binary Tree II", "question__title_slug": "cousins-in-binary-tree-ii", "question__hide": false, - "total_acs": 17743, - "total_submitted": 23232, - "total_column_articles": 140, + "total_acs": 18061, + "total_submitted": 23751, + "total_column_articles": 142, "frontend_question_id": "2641", "is_new_question": false }, @@ -18387,8 +18891,8 @@ "question__title": "Find the Score of All Prefixes of an Array", "question__title_slug": "find-the-score-of-all-prefixes-of-an-array", "question__hide": false, - "total_acs": 5381, - "total_submitted": 6893, + "total_acs": 5493, + "total_submitted": 7039, "total_column_articles": 44, "frontend_question_id": "2640", "is_new_question": false @@ -18408,8 +18912,8 @@ "question__title": "Find the Width of Columns of a Grid", "question__title_slug": "find-the-width-of-columns-of-a-grid", "question__hide": false, - "total_acs": 5632, - "total_submitted": 7420, + "total_acs": 5761, + "total_submitted": 7584, "total_column_articles": 48, "frontend_question_id": "2639", "is_new_question": false @@ -18429,8 +18933,8 @@ "question__title": "Make the Prefix Sum Non-negative", "question__title_slug": "make-the-prefix-sum-non-negative", "question__hide": false, - "total_acs": 216, - "total_submitted": 408, + "total_acs": 239, + "total_submitted": 461, "total_column_articles": 6, "frontend_question_id": "2599", "is_new_question": false @@ -18450,9 +18954,9 @@ "question__title": "Maximize Win From Two Segments", "question__title_slug": "maximize-win-from-two-segments", "question__hide": false, - "total_acs": 3638, - "total_submitted": 8813, - "total_column_articles": 39, + "total_acs": 3683, + "total_submitted": 8924, + "total_column_articles": 40, "frontend_question_id": "2555", "is_new_question": false }, @@ -18471,9 +18975,9 @@ "question__title": "Number of Good Binary Strings", "question__title_slug": "number-of-good-binary-strings", "question__hide": false, - "total_acs": 262, - "total_submitted": 445, - "total_column_articles": 6, + "total_acs": 306, + "total_submitted": 503, + "total_column_articles": 8, "frontend_question_id": "2533", "is_new_question": false }, @@ -18492,8 +18996,8 @@ "question__title": "Shortest Cycle in a Graph", "question__title_slug": "shortest-cycle-in-a-graph", "question__hide": false, - "total_acs": 3785, - "total_submitted": 9147, + "total_acs": 3963, + "total_submitted": 9562, "total_column_articles": 34, "frontend_question_id": "2608", "is_new_question": false @@ -18513,8 +19017,8 @@ "question__title": "Make K-Subarray Sums Equal", "question__title_slug": "make-k-subarray-sums-equal", "question__hide": false, - "total_acs": 3342, - "total_submitted": 8279, + "total_acs": 3400, + "total_submitted": 8388, "total_column_articles": 28, "frontend_question_id": "2607", "is_new_question": false @@ -18534,9 +19038,9 @@ "question__title": "Find the Substring With Maximum Cost", "question__title_slug": "find-the-substring-with-maximum-cost", "question__hide": false, - "total_acs": 6034, - "total_submitted": 10721, - "total_column_articles": 51, + "total_acs": 6259, + "total_submitted": 11068, + "total_column_articles": 54, "frontend_question_id": "2606", "is_new_question": false }, @@ -18555,9 +19059,9 @@ "question__title": "Form Smallest Number From Two Digit Arrays", "question__title_slug": "form-smallest-number-from-two-digit-arrays", "question__hide": false, - "total_acs": 35473, - "total_submitted": 52972, - "total_column_articles": 305, + "total_acs": 35669, + "total_submitted": 53323, + "total_column_articles": 307, "frontend_question_id": "2605", "is_new_question": false }, @@ -18576,8 +19080,8 @@ "question__title": "Maximum Frequency Score of a Subarray", "question__title_slug": "maximum-frequency-score-of-a-subarray", "question__hide": false, - "total_acs": 200, - "total_submitted": 455, + "total_acs": 207, + "total_submitted": 481, "total_column_articles": 6, "frontend_question_id": "2524", "is_new_question": false @@ -18597,8 +19101,8 @@ "question__title": "Minimum Time to Eat All Grains", "question__title_slug": "minimum-time-to-eat-all-grains", "question__hide": false, - "total_acs": 169, - "total_submitted": 511, + "total_acs": 183, + "total_submitted": 553, "total_column_articles": 6, "frontend_question_id": "2604", "is_new_question": false @@ -18618,9 +19122,9 @@ "question__title": "Minimum Time to Repair Cars", "question__title_slug": "minimum-time-to-repair-cars", "question__hide": false, - "total_acs": 28087, - "total_submitted": 56218, - "total_column_articles": 161, + "total_acs": 28231, + "total_submitted": 56565, + "total_column_articles": 163, "frontend_question_id": "2594", "is_new_question": false }, @@ -18639,9 +19143,9 @@ "question__title": "Maximize Greatness of an Array", "question__title_slug": "maximize-greatness-of-an-array", "question__hide": false, - "total_acs": 5839, - "total_submitted": 10007, - "total_column_articles": 62, + "total_acs": 5928, + "total_submitted": 10165, + "total_column_articles": 63, "frontend_question_id": "2592", "is_new_question": false }, @@ -18660,9 +19164,9 @@ "question__title": "Distribute Money to Maximum Children", "question__title_slug": "distribute-money-to-maximum-children", "question__hide": false, - "total_acs": 30291, - "total_submitted": 113003, - "total_column_articles": 235, + "total_acs": 30491, + "total_submitted": 113793, + "total_column_articles": 236, "frontend_question_id": "2591", "is_new_question": false }, @@ -18681,8 +19185,8 @@ "question__title": "Check Knight Tour Configuration", "question__title_slug": "check-knight-tour-configuration", "question__hide": false, - "total_acs": 29262, - "total_submitted": 50552, + "total_acs": 29333, + "total_submitted": 50704, "total_column_articles": 317, "frontend_question_id": "2596", "is_new_question": false @@ -18702,9 +19206,9 @@ "question__title": "Smallest Missing Non-negative Integer After Operations", "question__title_slug": "smallest-missing-non-negative-integer-after-operations", "question__hide": false, - "total_acs": 5807, - "total_submitted": 14666, - "total_column_articles": 59, + "total_acs": 5864, + "total_submitted": 14795, + "total_column_articles": 60, "frontend_question_id": "2598", "is_new_question": false }, @@ -18723,9 +19227,9 @@ "question__title": "Number of Even and Odd Bits", "question__title_slug": "number-of-even-and-odd-bits", "question__hide": false, - "total_acs": 11491, - "total_submitted": 15619, - "total_column_articles": 73, + "total_acs": 11815, + "total_submitted": 15997, + "total_column_articles": 74, "frontend_question_id": "2595", "is_new_question": false }, @@ -18744,8 +19248,8 @@ "question__title": "Count the Number of K-Big Indices", "question__title_slug": "count-the-number-of-k-big-indices", "question__hide": false, - "total_acs": 310, - "total_submitted": 498, + "total_acs": 330, + "total_submitted": 528, "total_column_articles": 14, "frontend_question_id": "2519", "is_new_question": false @@ -18765,8 +19269,8 @@ "question__title": "Minimum Time to Complete All Tasks", "question__title_slug": "minimum-time-to-complete-all-tasks", "question__hide": false, - "total_acs": 4265, - "total_submitted": 9858, + "total_acs": 4304, + "total_submitted": 9932, "total_column_articles": 37, "frontend_question_id": "2589", "is_new_question": false @@ -18786,8 +19290,8 @@ "question__title": "Count the Number of Beautiful Subarrays", "question__title_slug": "count-the-number-of-beautiful-subarrays", "question__hide": false, - "total_acs": 6667, - "total_submitted": 15527, + "total_acs": 6746, + "total_submitted": 15655, "total_column_articles": 62, "frontend_question_id": "2588", "is_new_question": false @@ -18807,8 +19311,8 @@ "question__title": "Rearrange Array to Maximize Prefix Score", "question__title_slug": "rearrange-array-to-maximize-prefix-score", "question__hide": false, - "total_acs": 9122, - "total_submitted": 22069, + "total_acs": 9186, + "total_submitted": 22199, "total_column_articles": 47, "frontend_question_id": "2587", "is_new_question": false @@ -18828,9 +19332,9 @@ "question__title": "Count the Number of Vowel Strings in Range", "question__title_slug": "count-the-number-of-vowel-strings-in-range", "question__hide": false, - "total_acs": 40305, - "total_submitted": 49319, - "total_column_articles": 248, + "total_acs": 41067, + "total_submitted": 50368, + "total_column_articles": 249, "frontend_question_id": "2586", "is_new_question": false }, @@ -18849,8 +19353,8 @@ "question__title": "Check if There is a Path With Equal Number of 0's And 1's", "question__title_slug": "check-if-there-is-a-path-with-equal-number-of-0s-and-1s", "question__hide": false, - "total_acs": 329, - "total_submitted": 499, + "total_acs": 345, + "total_submitted": 536, "total_column_articles": 8, "frontend_question_id": "2510", "is_new_question": false @@ -18870,9 +19374,9 @@ "question__title": "Count Number of Possible Root Nodes", "question__title_slug": "count-number-of-possible-root-nodes", "question__hide": false, - "total_acs": 11699, - "total_submitted": 17821, - "total_column_articles": 76, + "total_acs": 12568, + "total_submitted": 19406, + "total_column_articles": 84, "frontend_question_id": "2581", "is_new_question": false }, @@ -18891,8 +19395,8 @@ "question__title": "Count Ways to Group Overlapping Ranges", "question__title_slug": "count-ways-to-group-overlapping-ranges", "question__hide": false, - "total_acs": 5489, - "total_submitted": 15087, + "total_acs": 5556, + "total_submitted": 15212, "total_column_articles": 57, "frontend_question_id": "2580", "is_new_question": false @@ -18912,9 +19416,9 @@ "question__title": "Split With Minimum Sum", "question__title_slug": "split-with-minimum-sum", "question__hide": false, - "total_acs": 31227, - "total_submitted": 38373, - "total_column_articles": 286, + "total_acs": 31660, + "total_submitted": 38988, + "total_column_articles": 291, "frontend_question_id": "2578", "is_new_question": false }, @@ -18933,8 +19437,8 @@ "question__title": "Count Total Number of Colored Cells", "question__title_slug": "count-total-number-of-colored-cells", "question__hide": false, - "total_acs": 6336, - "total_submitted": 9707, + "total_acs": 6428, + "total_submitted": 9844, "total_column_articles": 45, "frontend_question_id": "2579", "is_new_question": false @@ -18954,8 +19458,8 @@ "question__title": "Number of Ways to Earn Points", "question__title_slug": "number-of-ways-to-earn-points", "question__hide": false, - "total_acs": 6237, - "total_submitted": 9536, + "total_acs": 6334, + "total_submitted": 9672, "total_column_articles": 61, "frontend_question_id": "2585", "is_new_question": false @@ -18975,8 +19479,8 @@ "question__title": "Split the Array to Make Coprime Products", "question__title_slug": "split-the-array-to-make-coprime-products", "question__hide": false, - "total_acs": 6041, - "total_submitted": 23322, + "total_acs": 6074, + "total_submitted": 23390, "total_column_articles": 75, "frontend_question_id": "2584", "is_new_question": false @@ -18996,9 +19500,9 @@ "question__title": "Kth Largest Sum in a Binary Tree", "question__title_slug": "kth-largest-sum-in-a-binary-tree", "question__hide": false, - "total_acs": 26123, - "total_submitted": 49101, - "total_column_articles": 207, + "total_acs": 26453, + "total_submitted": 49787, + "total_column_articles": 208, "frontend_question_id": "2583", "is_new_question": false }, @@ -19017,9 +19521,9 @@ "question__title": "Pass the Pillow", "question__title_slug": "pass-the-pillow", "question__hide": false, - "total_acs": 36782, - "total_submitted": 63028, - "total_column_articles": 305, + "total_acs": 37014, + "total_submitted": 63434, + "total_column_articles": 307, "frontend_question_id": "2582", "is_new_question": false }, @@ -19038,8 +19542,8 @@ "question__title": "Bitwise OR of All Subsequence Sums", "question__title_slug": "bitwise-or-of-all-subsequence-sums", "question__hide": false, - "total_acs": 235, - "total_submitted": 405, + "total_acs": 252, + "total_submitted": 443, "total_column_articles": 7, "frontend_question_id": "2505", "is_new_question": false @@ -19059,8 +19563,8 @@ "question__title": "Concatenate the Name and the Profession", "question__title_slug": "concatenate-the-name-and-the-profession", "question__hide": false, - "total_acs": 1116, - "total_submitted": 1415, + "total_acs": 1172, + "total_submitted": 1489, "total_column_articles": 11, "frontend_question_id": "2504", "is_new_question": false @@ -19080,8 +19584,8 @@ "question__title": "Time to Cross a Bridge", "question__title_slug": "time-to-cross-a-bridge", "question__hide": false, - "total_acs": 10449, - "total_submitted": 15302, + "total_acs": 10460, + "total_submitted": 15330, "total_column_articles": 100, "frontend_question_id": "2532", "is_new_question": false @@ -19101,9 +19605,9 @@ "question__title": "Disconnect Path in a Binary Matrix by at Most One Flip", "question__title_slug": "disconnect-path-in-a-binary-matrix-by-at-most-one-flip", "question__hide": false, - "total_acs": 3322, - "total_submitted": 10744, - "total_column_articles": 48, + "total_acs": 3369, + "total_submitted": 10911, + "total_column_articles": 49, "frontend_question_id": "2556", "is_new_question": false }, @@ -19122,9 +19626,9 @@ "question__title": "Maximum Number of Integers to Choose From a Range I", "question__title_slug": "maximum-number-of-integers-to-choose-from-a-range-i", "question__hide": false, - "total_acs": 5130, - "total_submitted": 8964, - "total_column_articles": 56, + "total_acs": 5198, + "total_submitted": 9073, + "total_column_articles": 57, "frontend_question_id": "2554", "is_new_question": false }, @@ -19143,9 +19647,9 @@ "question__title": "Separate the Digits in an Array", "question__title_slug": "separate-the-digits-in-an-array", "question__hide": false, - "total_acs": 7830, - "total_submitted": 9883, - "total_column_articles": 90, + "total_acs": 8021, + "total_submitted": 10139, + "total_column_articles": 91, "frontend_question_id": "2553", "is_new_question": false }, @@ -19164,9 +19668,9 @@ "question__title": "Number of Subarrays Having Even Product", "question__title_slug": "number-of-subarrays-having-even-product", "question__hide": false, - "total_acs": 308, - "total_submitted": 468, - "total_column_articles": 13, + "total_acs": 352, + "total_submitted": 532, + "total_column_articles": 14, "frontend_question_id": "2495", "is_new_question": false }, @@ -19185,9 +19689,9 @@ "question__title": "Merge Overlapping Events in the Same Hall", "question__title_slug": "merge-overlapping-events-in-the-same-hall", "question__hide": false, - "total_acs": 617, - "total_submitted": 1459, - "total_column_articles": 13, + "total_acs": 644, + "total_submitted": 1536, + "total_column_articles": 14, "frontend_question_id": "2494", "is_new_question": false }, @@ -19206,9 +19710,9 @@ "question__title": "Maximum Subsequence Score", "question__title_slug": "maximum-subsequence-score", "question__hide": false, - "total_acs": 7029, - "total_submitted": 13587, - "total_column_articles": 70, + "total_acs": 7361, + "total_submitted": 14185, + "total_column_articles": 72, "frontend_question_id": "2542", "is_new_question": false }, @@ -19227,8 +19731,8 @@ "question__title": "Check if Point Is Reachable", "question__title_slug": "check-if-point-is-reachable", "question__hide": false, - "total_acs": 2176, - "total_submitted": 4556, + "total_acs": 2206, + "total_submitted": 4617, "total_column_articles": 23, "frontend_question_id": "2543", "is_new_question": false @@ -19248,8 +19752,8 @@ "question__title": "Minimum Common Value", "question__title_slug": "minimum-common-value", "question__hide": false, - "total_acs": 8324, - "total_submitted": 14052, + "total_acs": 8646, + "total_submitted": 14560, "total_column_articles": 99, "frontend_question_id": "2540", "is_new_question": false @@ -19269,8 +19773,8 @@ "question__title": "Minimum Cost to Split an Array", "question__title_slug": "minimum-cost-to-split-an-array", "question__hide": false, - "total_acs": 3853, - "total_submitted": 6721, + "total_acs": 3966, + "total_submitted": 6899, "total_column_articles": 45, "frontend_question_id": "2547", "is_new_question": false @@ -19290,8 +19794,8 @@ "question__title": "Apply Bitwise Operations to Make Strings Equal", "question__title_slug": "apply-bitwise-operations-to-make-strings-equal", "question__hide": false, - "total_acs": 4917, - "total_submitted": 11232, + "total_acs": 5007, + "total_submitted": 11417, "total_column_articles": 51, "frontend_question_id": "2546", "is_new_question": false @@ -19311,9 +19815,9 @@ "question__title": "Sort the Students by Their Kth Score", "question__title_slug": "sort-the-students-by-their-kth-score", "question__hide": false, - "total_acs": 7919, - "total_submitted": 9294, - "total_column_articles": 88, + "total_acs": 8040, + "total_submitted": 9432, + "total_column_articles": 90, "frontend_question_id": "2545", "is_new_question": false }, @@ -19332,9 +19836,9 @@ "question__title": "Alternating Digit Sum", "question__title_slug": "alternating-digit-sum", "question__hide": false, - "total_acs": 33750, - "total_submitted": 42542, - "total_column_articles": 306, + "total_acs": 33942, + "total_submitted": 42800, + "total_column_articles": 307, "frontend_question_id": "2544", "is_new_question": false }, @@ -19353,9 +19857,9 @@ "question__title": "Number of Substrings With Fixed Ratio", "question__title_slug": "number-of-substrings-with-fixed-ratio", "question__hide": false, - "total_acs": 183, - "total_submitted": 298, - "total_column_articles": 4, + "total_acs": 196, + "total_submitted": 323, + "total_column_articles": 5, "frontend_question_id": "2489", "is_new_question": false }, @@ -19374,9 +19878,9 @@ "question__title": "Minimize the Maximum of Two Arrays", "question__title_slug": "minimize-the-maximum-of-two-arrays", "question__hide": false, - "total_acs": 3345, - "total_submitted": 9378, - "total_column_articles": 45, + "total_acs": 3440, + "total_submitted": 9599, + "total_column_articles": 48, "frontend_question_id": "2513", "is_new_question": false }, @@ -19395,8 +19899,8 @@ "question__title": "Difference Between Maximum and Minimum Price Sum", "question__title_slug": "difference-between-maximum-and-minimum-price-sum", "question__hide": false, - "total_acs": 3826, - "total_submitted": 7849, + "total_acs": 3878, + "total_submitted": 7995, "total_column_articles": 48, "frontend_question_id": "2538", "is_new_question": false @@ -19416,9 +19920,9 @@ "question__title": "Count the Number of Good Subarrays", "question__title_slug": "count-the-number-of-good-subarrays", "question__hide": false, - "total_acs": 6368, - "total_submitted": 12573, - "total_column_articles": 93, + "total_acs": 6455, + "total_submitted": 12737, + "total_column_articles": 94, "frontend_question_id": "2537", "is_new_question": false }, @@ -19437,9 +19941,9 @@ "question__title": "Increment Submatrices by One", "question__title_slug": "increment-submatrices-by-one", "question__hide": false, - "total_acs": 7630, - "total_submitted": 12400, - "total_column_articles": 84, + "total_acs": 7732, + "total_submitted": 12537, + "total_column_articles": 85, "frontend_question_id": "2536", "is_new_question": false }, @@ -19458,9 +19962,9 @@ "question__title": "Difference Between Element Sum and Digit Sum of an Array", "question__title_slug": "difference-between-element-sum-and-digit-sum-of-an-array", "question__hide": false, - "total_acs": 13719, - "total_submitted": 16608, - "total_column_articles": 139, + "total_acs": 14120, + "total_submitted": 17078, + "total_column_articles": 142, "frontend_question_id": "2535", "is_new_question": false }, @@ -19479,8 +19983,8 @@ "question__title": "Maximum XOR of Two Non-Overlapping Subtrees", "question__title_slug": "maximum-xor-of-two-non-overlapping-subtrees", "question__hide": false, - "total_acs": 259, - "total_submitted": 412, + "total_acs": 265, + "total_submitted": 437, "total_column_articles": 11, "frontend_question_id": "2479", "is_new_question": false @@ -19500,8 +20004,8 @@ "question__title": "Form a Chemical Bond", "question__title_slug": "form-a-chemical-bond", "question__hide": false, - "total_acs": 1222, - "total_submitted": 1469, + "total_acs": 1281, + "total_submitted": 1539, "total_column_articles": 11, "frontend_question_id": "2480", "is_new_question": false @@ -19521,9 +20025,9 @@ "question__title": "Find Xor-Beauty of Array", "question__title_slug": "find-xor-beauty-of-array", "question__hide": false, - "total_acs": 4142, - "total_submitted": 5800, - "total_column_articles": 42, + "total_acs": 4206, + "total_submitted": 5891, + "total_column_articles": 43, "frontend_question_id": "2527", "is_new_question": false }, @@ -19542,9 +20046,9 @@ "question__title": "Find Consecutive Integers from a Data Stream", "question__title_slug": "find-consecutive-integers-from-a-data-stream", "question__hide": false, - "total_acs": 5262, - "total_submitted": 9649, - "total_column_articles": 56, + "total_acs": 5321, + "total_submitted": 9749, + "total_column_articles": 57, "frontend_question_id": "2526", "is_new_question": false }, @@ -19563,8 +20067,8 @@ "question__title": "Categorize Box According to Criteria", "question__title_slug": "categorize-box-according-to-criteria", "question__hide": false, - "total_acs": 28064, - "total_submitted": 58635, + "total_acs": 28402, + "total_submitted": 59459, "total_column_articles": 175, "frontend_question_id": "2525", "is_new_question": false @@ -19584,9 +20088,9 @@ "question__title": "Maximize the Minimum Powered City", "question__title_slug": "maximize-the-minimum-powered-city", "question__hide": false, - "total_acs": 4446, - "total_submitted": 10701, - "total_column_articles": 44, + "total_acs": 4554, + "total_submitted": 10940, + "total_column_articles": 47, "frontend_question_id": "2528", "is_new_question": false }, @@ -19605,9 +20109,9 @@ "question__title": "Time Taken to Cross the Door", "question__title_slug": "time-taken-to-cross-the-door", "question__hide": false, - "total_acs": 350, - "total_submitted": 599, - "total_column_articles": 9, + "total_acs": 365, + "total_submitted": 640, + "total_column_articles": 10, "frontend_question_id": "2534", "is_new_question": false }, @@ -19626,8 +20130,8 @@ "question__title": "Maximal Score After Applying K Operations", "question__title_slug": "maximal-score-after-applying-k-operations", "question__hide": false, - "total_acs": 30836, - "total_submitted": 57684, + "total_acs": 31135, + "total_submitted": 58378, "total_column_articles": 217, "frontend_question_id": "2530", "is_new_question": false @@ -19647,8 +20151,8 @@ "question__title": "Make Number of Distinct Characters Equal", "question__title_slug": "make-number-of-distinct-characters-equal", "question__hide": false, - "total_acs": 6096, - "total_submitted": 20303, + "total_acs": 6135, + "total_submitted": 20456, "total_column_articles": 92, "frontend_question_id": "2531", "is_new_question": false @@ -19668,9 +20172,9 @@ "question__title": "Maximum Count of Positive Integer and Negative Integer", "question__title_slug": "maximum-count-of-positive-integer-and-negative-integer", "question__hide": false, - "total_acs": 12065, - "total_submitted": 16301, - "total_column_articles": 102, + "total_acs": 12560, + "total_submitted": 17068, + "total_column_articles": 104, "frontend_question_id": "2529", "is_new_question": false }, @@ -19689,9 +20193,9 @@ "question__title": "Customers With Strictly Increasing Purchases", "question__title_slug": "customers-with-strictly-increasing-purchases", "question__hide": false, - "total_acs": 832, - "total_submitted": 1680, - "total_column_articles": 27, + "total_acs": 859, + "total_submitted": 1745, + "total_column_articles": 28, "frontend_question_id": "2474", "is_new_question": false }, @@ -19710,8 +20214,8 @@ "question__title": "Minimum Cost to Buy Apples", "question__title_slug": "minimum-cost-to-buy-apples", "question__hide": false, - "total_acs": 257, - "total_submitted": 462, + "total_acs": 272, + "total_submitted": 485, "total_column_articles": 9, "frontend_question_id": "2473", "is_new_question": false @@ -19731,8 +20235,8 @@ "question__title": "Closest Prime Numbers in Range", "question__title_slug": "closest-prime-numbers-in-range", "question__hide": false, - "total_acs": 7529, - "total_submitted": 18086, + "total_acs": 7579, + "total_submitted": 18226, "total_column_articles": 70, "frontend_question_id": "2523", "is_new_question": false @@ -19752,8 +20256,8 @@ "question__title": "Distinct Prime Factors of Product of Array", "question__title_slug": "distinct-prime-factors-of-product-of-array", "question__hide": false, - "total_acs": 7839, - "total_submitted": 12359, + "total_acs": 7952, + "total_submitted": 12527, "total_column_articles": 73, "frontend_question_id": "2521", "is_new_question": false @@ -19773,9 +20277,9 @@ "question__title": "Count the Digits That Divide a Number", "question__title_slug": "count-the-digits-that-divide-a-number", "question__hide": false, - "total_acs": 36625, - "total_submitted": 43089, - "total_column_articles": 253, + "total_acs": 37200, + "total_submitted": 43805, + "total_column_articles": 257, "frontend_question_id": "2520", "is_new_question": false }, @@ -19794,8 +20298,8 @@ "question__title": "Minimum Subarrays in a Valid Split", "question__title_slug": "minimum-subarrays-in-a-valid-split", "question__hide": false, - "total_acs": 243, - "total_submitted": 407, + "total_acs": 264, + "total_submitted": 450, "total_column_articles": 9, "frontend_question_id": "2464", "is_new_question": false @@ -19815,8 +20319,8 @@ "question__title": "Difference Between Ones and Zeros in Row and Column", "question__title_slug": "difference-between-ones-and-zeros-in-row-and-column", "question__hide": false, - "total_acs": 6210, - "total_submitted": 7571, + "total_acs": 6304, + "total_submitted": 7685, "total_column_articles": 70, "frontend_question_id": "2482", "is_new_question": false @@ -19836,8 +20340,8 @@ "question__title": "Count Anagrams", "question__title_slug": "count-anagrams", "question__hide": false, - "total_acs": 2688, - "total_submitted": 5752, + "total_acs": 2734, + "total_submitted": 5880, "total_column_articles": 42, "frontend_question_id": "2514", "is_new_question": false @@ -19857,9 +20361,9 @@ "question__title": "Minimum Operations to Make Array Equal II", "question__title_slug": "minimum-operations-to-make-array-equal-ii", "question__hide": false, - "total_acs": 3953, - "total_submitted": 12312, - "total_column_articles": 40, + "total_acs": 4021, + "total_submitted": 12501, + "total_column_articles": 41, "frontend_question_id": "2541", "is_new_question": false }, @@ -19878,9 +20382,9 @@ "question__title": "Reward Top K Students", "question__title_slug": "reward-top-k-students", "question__hide": false, - "total_acs": 24354, - "total_submitted": 45340, - "total_column_articles": 220, + "total_acs": 24504, + "total_submitted": 45690, + "total_column_articles": 222, "frontend_question_id": "2512", "is_new_question": false }, @@ -19899,8 +20403,8 @@ "question__title": "Maximum Enemy Forts That Can Be Captured", "question__title_slug": "maximum-enemy-forts-that-can-be-captured", "question__hide": false, - "total_acs": 26491, - "total_submitted": 47733, + "total_acs": 26599, + "total_submitted": 47938, "total_column_articles": 257, "frontend_question_id": "2511", "is_new_question": false @@ -19920,8 +20424,8 @@ "question__title": "Number of Great Partitions", "question__title_slug": "number-of-great-partitions", "question__hide": false, - "total_acs": 3048, - "total_submitted": 7077, + "total_acs": 3087, + "total_submitted": 7179, "total_column_articles": 33, "frontend_question_id": "2518", "is_new_question": false @@ -19941,9 +20445,9 @@ "question__title": "Maximum Tastiness of Candy Basket", "question__title_slug": "maximum-tastiness-of-candy-basket", "question__hide": false, - "total_acs": 21713, - "total_submitted": 30315, - "total_column_articles": 137, + "total_acs": 21856, + "total_submitted": 30495, + "total_column_articles": 138, "frontend_question_id": "2517", "is_new_question": false }, @@ -19962,9 +20466,9 @@ "question__title": "Take K of Each Character From Left and Right", "question__title_slug": "take-k-of-each-character-from-left-and-right", "question__hide": false, - "total_acs": 6393, - "total_submitted": 16617, - "total_column_articles": 84, + "total_acs": 6515, + "total_submitted": 16911, + "total_column_articles": 85, "frontend_question_id": "2516", "is_new_question": false }, @@ -19983,9 +20487,9 @@ "question__title": "Shortest Distance to Target String in a Circular Array", "question__title_slug": "shortest-distance-to-target-string-in-a-circular-array", "question__hide": false, - "total_acs": 7791, - "total_submitted": 13966, - "total_column_articles": 79, + "total_acs": 7882, + "total_submitted": 14098, + "total_column_articles": 80, "frontend_question_id": "2515", "is_new_question": false }, @@ -20004,9 +20508,9 @@ "question__title": "Cycle Length Queries in a Tree", "question__title_slug": "cycle-length-queries-in-a-tree", "question__hide": false, - "total_acs": 4624, - "total_submitted": 7046, - "total_column_articles": 63, + "total_acs": 4669, + "total_submitted": 7110, + "total_column_articles": 64, "frontend_question_id": "2509", "is_new_question": false }, @@ -20025,8 +20529,8 @@ "question__title": "Add Edges to Make Degrees of All Nodes Even", "question__title_slug": "add-edges-to-make-degrees-of-all-nodes-even", "question__hide": false, - "total_acs": 3719, - "total_submitted": 12404, + "total_acs": 3755, + "total_submitted": 12496, "total_column_articles": 56, "frontend_question_id": "2508", "is_new_question": false @@ -20046,8 +20550,8 @@ "question__title": "Smallest Value After Replacing With Sum of Prime Factors", "question__title_slug": "smallest-value-after-replacing-with-sum-of-prime-factors", "question__hide": false, - "total_acs": 6584, - "total_submitted": 13043, + "total_acs": 6660, + "total_submitted": 13186, "total_column_articles": 63, "frontend_question_id": "2507", "is_new_question": false @@ -20067,9 +20571,9 @@ "question__title": "Count Pairs Of Similar Strings", "question__title_slug": "count-pairs-of-similar-strings", "question__hide": false, - "total_acs": 9285, - "total_submitted": 12000, - "total_column_articles": 98, + "total_acs": 9417, + "total_submitted": 12172, + "total_column_articles": 99, "frontend_question_id": "2506", "is_new_question": false }, @@ -20088,8 +20592,8 @@ "question__title": "Number of Distinct Binary Strings After Applying Operations", "question__title_slug": "number-of-distinct-binary-strings-after-applying-operations", "question__hide": false, - "total_acs": 212, - "total_submitted": 312, + "total_acs": 215, + "total_submitted": 329, "total_column_articles": 9, "frontend_question_id": "2450", "is_new_question": false @@ -20109,8 +20613,8 @@ "question__title": "Minimum Total Cost to Make Arrays Unequal", "question__title_slug": "minimum-total-cost-to-make-arrays-unequal", "question__hide": false, - "total_acs": 1860, - "total_submitted": 4381, + "total_acs": 1870, + "total_submitted": 4413, "total_column_articles": 30, "frontend_question_id": "2499", "is_new_question": false @@ -20130,8 +20634,8 @@ "question__title": "Frog Jump II", "question__title_slug": "frog-jump-ii", "question__hide": false, - "total_acs": 4419, - "total_submitted": 6775, + "total_acs": 4488, + "total_submitted": 6898, "total_column_articles": 54, "frontend_question_id": "2498", "is_new_question": false @@ -20151,9 +20655,9 @@ "question__title": "Maximum Star Sum of a Graph", "question__title_slug": "maximum-star-sum-of-a-graph", "question__hide": false, - "total_acs": 4410, - "total_submitted": 11331, - "total_column_articles": 55, + "total_acs": 4452, + "total_submitted": 11441, + "total_column_articles": 56, "frontend_question_id": "2497", "is_new_question": false }, @@ -20172,9 +20676,9 @@ "question__title": "Maximum Value of a String in an Array", "question__title_slug": "maximum-value-of-a-string-in-an-array", "question__hide": false, - "total_acs": 21460, - "total_submitted": 27333, - "total_column_articles": 223, + "total_acs": 21678, + "total_submitted": 27640, + "total_column_articles": 226, "frontend_question_id": "2496", "is_new_question": false }, @@ -20193,8 +20697,8 @@ "question__title": "Maximum Number of Points From Grid Queries", "question__title_slug": "maximum-number-of-points-from-grid-queries", "question__hide": false, - "total_acs": 4595, - "total_submitted": 10272, + "total_acs": 4615, + "total_submitted": 10342, "total_column_articles": 69, "frontend_question_id": "2503", "is_new_question": false @@ -20214,8 +20718,8 @@ "question__title": "Design Memory Allocator", "question__title_slug": "design-memory-allocator", "question__hide": false, - "total_acs": 5898, - "total_submitted": 11208, + "total_acs": 5964, + "total_submitted": 11328, "total_column_articles": 78, "frontend_question_id": "2502", "is_new_question": false @@ -20235,9 +20739,9 @@ "question__title": "Longest Square Streak in an Array", "question__title_slug": "longest-square-streak-in-an-array", "question__hide": false, - "total_acs": 8368, - "total_submitted": 20107, - "total_column_articles": 92, + "total_acs": 8461, + "total_submitted": 20375, + "total_column_articles": 93, "frontend_question_id": "2501", "is_new_question": false }, @@ -20256,9 +20760,9 @@ "question__title": "Delete Greatest Value in Each Row", "question__title_slug": "delete-greatest-value-in-each-row", "question__hide": false, - "total_acs": 33185, - "total_submitted": 39750, - "total_column_articles": 264, + "total_acs": 33423, + "total_submitted": 40061, + "total_column_articles": 266, "frontend_question_id": "2500", "is_new_question": false }, @@ -20277,8 +20781,8 @@ "question__title": "Number of Nodes With Value One", "question__title_slug": "number-of-nodes-with-value-one", "question__hide": false, - "total_acs": 310, - "total_submitted": 414, + "total_acs": 320, + "total_submitted": 439, "total_column_articles": 18, "frontend_question_id": "2445", "is_new_question": false @@ -20298,8 +20802,8 @@ "question__title": "Divide Nodes Into the Maximum Number of Groups", "question__title_slug": "divide-nodes-into-the-maximum-number-of-groups", "question__hide": false, - "total_acs": 3212, - "total_submitted": 7261, + "total_acs": 3243, + "total_submitted": 7321, "total_column_articles": 45, "frontend_question_id": "2493", "is_new_question": false @@ -20319,9 +20823,9 @@ "question__title": "Minimum Score of a Path Between Two Cities", "question__title_slug": "minimum-score-of-a-path-between-two-cities", "question__hide": false, - "total_acs": 7886, - "total_submitted": 18697, - "total_column_articles": 123, + "total_acs": 8117, + "total_submitted": 19130, + "total_column_articles": 124, "frontend_question_id": "2492", "is_new_question": false }, @@ -20340,9 +20844,9 @@ "question__title": "Divide Players Into Teams of Equal Skill", "question__title_slug": "divide-players-into-teams-of-equal-skill", "question__hide": false, - "total_acs": 9402, - "total_submitted": 16971, - "total_column_articles": 118, + "total_acs": 9476, + "total_submitted": 17119, + "total_column_articles": 119, "frontend_question_id": "2491", "is_new_question": false }, @@ -20361,9 +20865,9 @@ "question__title": "Circular Sentence", "question__title_slug": "circular-sentence", "question__hide": false, - "total_acs": 28098, - "total_submitted": 38547, - "total_column_articles": 257, + "total_acs": 28248, + "total_submitted": 38722, + "total_column_articles": 258, "frontend_question_id": "2490", "is_new_question": false }, @@ -20382,8 +20886,8 @@ "question__title": "Minimum Split Into Subarrays With GCD Greater Than One", "question__title_slug": "minimum-split-into-subarrays-with-gcd-greater-than-one", "question__hide": false, - "total_acs": 280, - "total_submitted": 392, + "total_acs": 292, + "total_submitted": 416, "total_column_articles": 12, "frontend_question_id": "2436", "is_new_question": false @@ -20403,9 +20907,9 @@ "question__title": "Count Palindromic Subsequences", "question__title_slug": "count-palindromic-subsequences", "question__hide": false, - "total_acs": 3187, - "total_submitted": 6620, - "total_column_articles": 52, + "total_acs": 3233, + "total_submitted": 6706, + "total_column_articles": 53, "frontend_question_id": "2484", "is_new_question": false }, @@ -20424,8 +20928,8 @@ "question__title": "Minimum Penalty for a Shop", "question__title_slug": "minimum-penalty-for-a-shop", "question__hide": false, - "total_acs": 7038, - "total_submitted": 10894, + "total_acs": 7145, + "total_submitted": 11055, "total_column_articles": 96, "frontend_question_id": "2483", "is_new_question": false @@ -20445,9 +20949,9 @@ "question__title": "Minimum Cuts to Divide a Circle", "question__title_slug": "minimum-cuts-to-divide-a-circle", "question__hide": false, - "total_acs": 20065, - "total_submitted": 34288, - "total_column_articles": 142, + "total_acs": 20178, + "total_submitted": 34498, + "total_column_articles": 143, "frontend_question_id": "2481", "is_new_question": false }, @@ -20466,9 +20970,9 @@ "question__title": "Count Subarrays With Median K", "question__title_slug": "count-subarrays-with-median-k", "question__hide": false, - "total_acs": 20817, - "total_submitted": 41022, - "total_column_articles": 207, + "total_acs": 20854, + "total_submitted": 41106, + "total_column_articles": 209, "frontend_question_id": "2488", "is_new_question": false }, @@ -20487,9 +20991,9 @@ "question__title": "Remove Nodes From Linked List", "question__title_slug": "remove-nodes-from-linked-list", "question__hide": false, - "total_acs": 32076, - "total_submitted": 41949, - "total_column_articles": 325, + "total_acs": 32337, + "total_submitted": 42358, + "total_column_articles": 329, "frontend_question_id": "2487", "is_new_question": false }, @@ -20508,8 +21012,8 @@ "question__title": "Append Characters to String to Make Subsequence", "question__title_slug": "append-characters-to-string-to-make-subsequence", "question__hide": false, - "total_acs": 8631, - "total_submitted": 13180, + "total_acs": 8687, + "total_submitted": 13259, "total_column_articles": 91, "frontend_question_id": "2486", "is_new_question": false @@ -20529,9 +21033,9 @@ "question__title": "Find the Pivot Integer", "question__title_slug": "find-the-pivot-integer", "question__hide": false, - "total_acs": 33528, - "total_submitted": 41902, - "total_column_articles": 314, + "total_acs": 33886, + "total_submitted": 42348, + "total_column_articles": 317, "frontend_question_id": "2485", "is_new_question": false }, @@ -20550,8 +21054,8 @@ "question__title": "Maximize Total Tastiness of Purchased Fruits", "question__title_slug": "maximize-total-tastiness-of-purchased-fruits", "question__hide": false, - "total_acs": 256, - "total_submitted": 415, + "total_acs": 274, + "total_submitted": 439, "total_column_articles": 13, "frontend_question_id": "2431", "is_new_question": false @@ -20571,8 +21075,8 @@ "question__title": "Number of Beautiful Partitions", "question__title_slug": "number-of-beautiful-partitions", "question__hide": false, - "total_acs": 4538, - "total_submitted": 11409, + "total_acs": 4705, + "total_submitted": 11761, "total_column_articles": 54, "frontend_question_id": "2478", "is_new_question": false @@ -20592,9 +21096,9 @@ "question__title": "Minimum Fuel Cost to Report to the Capital", "question__title_slug": "minimum-fuel-cost-to-report-to-the-capital", "question__hide": false, - "total_acs": 21258, - "total_submitted": 32972, - "total_column_articles": 190, + "total_acs": 21412, + "total_submitted": 33207, + "total_column_articles": 192, "frontend_question_id": "2477", "is_new_question": false }, @@ -20613,9 +21117,9 @@ "question__title": "Closest Nodes Queries in a Binary Search Tree", "question__title_slug": "closest-nodes-queries-in-a-binary-search-tree", "question__hide": false, - "total_acs": 21298, - "total_submitted": 41398, - "total_column_articles": 211, + "total_acs": 21614, + "total_submitted": 42093, + "total_column_articles": 213, "frontend_question_id": "2476", "is_new_question": false }, @@ -20634,9 +21138,9 @@ "question__title": "Number of Unequal Triplets in Array", "question__title_slug": "number-of-unequal-triplets-in-array", "question__hide": false, - "total_acs": 29925, - "total_submitted": 38517, - "total_column_articles": 176, + "total_acs": 30057, + "total_submitted": 38692, + "total_column_articles": 177, "frontend_question_id": "2475", "is_new_question": false }, @@ -20655,8 +21159,8 @@ "question__title": "Merge Operations to Turn Array Into a Palindrome", "question__title_slug": "merge-operations-to-turn-array-into-a-palindrome", "question__hide": false, - "total_acs": 400, - "total_submitted": 575, + "total_acs": 415, + "total_submitted": 607, "total_column_articles": 13, "frontend_question_id": "2422", "is_new_question": false @@ -20676,8 +21180,8 @@ "question__title": "Most Profitable Path in a Tree", "question__title_slug": "most-profitable-path-in-a-tree", "question__hide": false, - "total_acs": 3429, - "total_submitted": 6704, + "total_acs": 3482, + "total_submitted": 6794, "total_column_articles": 50, "frontend_question_id": "2467", "is_new_question": false @@ -20697,9 +21201,9 @@ "question__title": "Split Message Based on Limit", "question__title_slug": "split-message-based-on-limit", "question__hide": false, - "total_acs": 2385, - "total_submitted": 5356, - "total_column_articles": 55, + "total_acs": 2408, + "total_submitted": 5402, + "total_column_articles": 56, "frontend_question_id": "2468", "is_new_question": false }, @@ -20718,9 +21222,9 @@ "question__title": "Count Ways To Build Good Strings", "question__title_slug": "count-ways-to-build-good-strings", "question__hide": false, - "total_acs": 9495, - "total_submitted": 18979, - "total_column_articles": 94, + "total_acs": 10307, + "total_submitted": 20704, + "total_column_articles": 100, "frontend_question_id": "2466", "is_new_question": false }, @@ -20739,8 +21243,8 @@ "question__title": "Number of Distinct Averages", "question__title_slug": "number-of-distinct-averages", "question__hide": false, - "total_acs": 24124, - "total_submitted": 33729, + "total_acs": 24289, + "total_submitted": 33992, "total_column_articles": 231, "frontend_question_id": "2465", "is_new_question": false @@ -20760,8 +21264,8 @@ "question__title": "Closest Fair Integer", "question__title_slug": "closest-fair-integer", "question__hide": false, - "total_acs": 199, - "total_submitted": 459, + "total_acs": 210, + "total_submitted": 504, "total_column_articles": 12, "frontend_question_id": "2417", "is_new_question": false @@ -20781,8 +21285,8 @@ "question__title": "Maximum Number of Non-overlapping Palindrome Substrings", "question__title_slug": "maximum-number-of-non-overlapping-palindrome-substrings", "question__hide": false, - "total_acs": 5710, - "total_submitted": 12751, + "total_acs": 5756, + "total_submitted": 12832, "total_column_articles": 88, "frontend_question_id": "2472", "is_new_question": false @@ -20802,8 +21306,8 @@ "question__title": "Minimum Number of Operations to Sort a Binary Tree by Level", "question__title_slug": "minimum-number-of-operations-to-sort-a-binary-tree-by-level", "question__hide": false, - "total_acs": 7344, - "total_submitted": 13132, + "total_acs": 7392, + "total_submitted": 13215, "total_column_articles": 96, "frontend_question_id": "2471", "is_new_question": false @@ -20823,8 +21327,8 @@ "question__title": "Number of Subarrays With LCM Equal to K", "question__title_slug": "number-of-subarrays-with-lcm-equal-to-k", "question__hide": false, - "total_acs": 8622, - "total_submitted": 20958, + "total_acs": 8704, + "total_submitted": 21112, "total_column_articles": 93, "frontend_question_id": "2470", "is_new_question": false @@ -20844,9 +21348,9 @@ "question__title": "Convert the Temperature", "question__title_slug": "convert-the-temperature", "question__hide": false, - "total_acs": 60010, - "total_submitted": 74654, - "total_column_articles": 237, + "total_acs": 62056, + "total_submitted": 77441, + "total_column_articles": 241, "frontend_question_id": "2469", "is_new_question": false }, @@ -20865,8 +21369,8 @@ "question__title": "Design SQL", "question__title_slug": "design-sql", "question__hide": false, - "total_acs": 263, - "total_submitted": 390, + "total_acs": 283, + "total_submitted": 414, "total_column_articles": 10, "frontend_question_id": "2408", "is_new_question": false @@ -20886,9 +21390,9 @@ "question__title": "Minimum Total Distance Traveled", "question__title_slug": "minimum-total-distance-traveled", "question__hide": false, - "total_acs": 4092, - "total_submitted": 8945, - "total_column_articles": 63, + "total_acs": 4147, + "total_submitted": 9070, + "total_column_articles": 64, "frontend_question_id": "2463", "is_new_question": false }, @@ -20907,8 +21411,8 @@ "question__title": "Total Cost to Hire K Workers", "question__title_slug": "total-cost-to-hire-k-workers", "question__hide": false, - "total_acs": 10687, - "total_submitted": 27275, + "total_acs": 11007, + "total_submitted": 28099, "total_column_articles": 160, "frontend_question_id": "2462", "is_new_question": false @@ -20928,9 +21432,9 @@ "question__title": "Maximum Sum of Distinct Subarrays With Length K", "question__title_slug": "maximum-sum-of-distinct-subarrays-with-length-k", "question__hide": false, - "total_acs": 9952, - "total_submitted": 31124, - "total_column_articles": 156, + "total_acs": 10201, + "total_submitted": 31659, + "total_column_articles": 163, "frontend_question_id": "2461", "is_new_question": false }, @@ -20949,8 +21453,8 @@ "question__title": "Apply Operations to an Array", "question__title_slug": "apply-operations-to-an-array", "question__hide": false, - "total_acs": 31597, - "total_submitted": 46519, + "total_acs": 31734, + "total_submitted": 46711, "total_column_articles": 267, "frontend_question_id": "2460", "is_new_question": false @@ -20970,8 +21474,8 @@ "question__title": "Words Within Two Edits of Dictionary", "question__title_slug": "words-within-two-edits-of-dictionary", "question__hide": false, - "total_acs": 5236, - "total_submitted": 8026, + "total_acs": 5288, + "total_submitted": 8106, "total_column_articles": 48, "frontend_question_id": "2452", "is_new_question": false @@ -20991,9 +21495,9 @@ "question__title": "Next Greater Element IV", "question__title_slug": "next-greater-element-iv", "question__hide": false, - "total_acs": 17239, - "total_submitted": 31090, - "total_column_articles": 191, + "total_acs": 17358, + "total_submitted": 31344, + "total_column_articles": 192, "frontend_question_id": "2454", "is_new_question": false }, @@ -21012,8 +21516,8 @@ "question__title": "Destroy Sequential Targets", "question__title_slug": "destroy-sequential-targets", "question__hide": false, - "total_acs": 5048, - "total_submitted": 13842, + "total_acs": 5096, + "total_submitted": 13961, "total_column_articles": 72, "frontend_question_id": "2453", "is_new_question": false @@ -21033,9 +21537,9 @@ "question__title": "Odd String Difference", "question__title_slug": "odd-string-difference", "question__hide": false, - "total_acs": 21935, - "total_submitted": 33154, - "total_column_articles": 254, + "total_acs": 22023, + "total_submitted": 33283, + "total_column_articles": 256, "frontend_question_id": "2451", "is_new_question": false }, @@ -21054,8 +21558,8 @@ "question__title": "Number of Subarrays With GCD Equal to K", "question__title_slug": "number-of-subarrays-with-gcd-equal-to-k", "question__hide": false, - "total_acs": 8628, - "total_submitted": 20176, + "total_acs": 8730, + "total_submitted": 20326, "total_column_articles": 71, "frontend_question_id": "2447", "is_new_question": false @@ -21075,8 +21579,8 @@ "question__title": "Height of Binary Tree After Subtree Removal Queries", "question__title_slug": "height-of-binary-tree-after-subtree-removal-queries", "question__hide": false, - "total_acs": 5091, - "total_submitted": 12116, + "total_acs": 5152, + "total_submitted": 12238, "total_column_articles": 90, "frontend_question_id": "2458", "is_new_question": false @@ -21096,8 +21600,8 @@ "question__title": "Minimum Addition to Make Integer Beautiful", "question__title_slug": "minimum-addition-to-make-integer-beautiful", "question__hide": false, - "total_acs": 7387, - "total_submitted": 18521, + "total_acs": 7431, + "total_submitted": 18629, "total_column_articles": 129, "frontend_question_id": "2457", "is_new_question": false @@ -21117,9 +21621,9 @@ "question__title": "Most Popular Video Creator", "question__title_slug": "most-popular-video-creator", "question__hide": false, - "total_acs": 8933, - "total_submitted": 22972, - "total_column_articles": 124, + "total_acs": 9020, + "total_submitted": 23181, + "total_column_articles": 126, "frontend_question_id": "2456", "is_new_question": false }, @@ -21138,9 +21642,9 @@ "question__title": "Average Value of Even Numbers That Are Divisible by Three", "question__title_slug": "average-value-of-even-numbers-that-are-divisible-by-three", "question__hide": false, - "total_acs": 33737, - "total_submitted": 53025, - "total_column_articles": 187, + "total_acs": 33937, + "total_submitted": 53281, + "total_column_articles": 188, "frontend_question_id": "2455", "is_new_question": false }, @@ -21159,8 +21663,8 @@ "question__title": "Sum of Number and Its Reverse", "question__title_slug": "sum-of-number-and-its-reverse", "question__hide": false, - "total_acs": 10397, - "total_submitted": 22174, + "total_acs": 10481, + "total_submitted": 22366, "total_column_articles": 87, "frontend_question_id": "2443", "is_new_question": false @@ -21180,8 +21684,8 @@ "question__title": "Color the Triangle Red", "question__title_slug": "color-the-triangle-red", "question__hide": false, - "total_acs": 56, - "total_submitted": 120, + "total_acs": 58, + "total_submitted": 137, "total_column_articles": 2, "frontend_question_id": "2647", "is_new_question": false @@ -21201,9 +21705,9 @@ "question__title": "Minimum Number of Operations to Make Arrays Similar", "question__title_slug": "minimum-number-of-operations-to-make-arrays-similar", "question__hide": false, - "total_acs": 4244, - "total_submitted": 6471, - "total_column_articles": 50, + "total_acs": 4282, + "total_submitted": 6554, + "total_column_articles": 51, "frontend_question_id": "2449", "is_new_question": false }, @@ -21222,8 +21726,8 @@ "question__title": "Minimum Cost to Make Array Equal", "question__title_slug": "minimum-cost-to-make-array-equal", "question__hide": false, - "total_acs": 6255, - "total_submitted": 16901, + "total_acs": 6347, + "total_submitted": 17090, "total_column_articles": 88, "frontend_question_id": "2448", "is_new_question": false @@ -21243,9 +21747,9 @@ "question__title": "Minimum Time to Kill All Monsters", "question__title_slug": "minimum-time-to-kill-all-monsters", "question__hide": false, - "total_acs": 418, - "total_submitted": 618, - "total_column_articles": 19, + "total_acs": 432, + "total_submitted": 648, + "total_column_articles": 20, "frontend_question_id": "2403", "is_new_question": false }, @@ -21264,9 +21768,9 @@ "question__title": "Determine if Two Events Have Conflict", "question__title_slug": "determine-if-two-events-have-conflict", "question__hide": false, - "total_acs": 31509, - "total_submitted": 49649, - "total_column_articles": 225, + "total_acs": 31632, + "total_submitted": 49823, + "total_column_articles": 228, "frontend_question_id": "2446", "is_new_question": false }, @@ -21285,8 +21789,8 @@ "question__title": "Count Strictly Increasing Subarrays", "question__title_slug": "count-strictly-increasing-subarrays", "question__hide": false, - "total_acs": 566, - "total_submitted": 747, + "total_acs": 574, + "total_submitted": 758, "total_column_articles": 16, "frontend_question_id": "2393", "is_new_question": false @@ -21306,8 +21810,8 @@ "question__title": "Employees With Deductions", "question__title_slug": "employees-with-deductions", "question__hide": false, - "total_acs": 1112, - "total_submitted": 2331, + "total_acs": 1156, + "total_submitted": 2419, "total_column_articles": 20, "frontend_question_id": "2394", "is_new_question": false @@ -21327,9 +21831,9 @@ "question__title": "Bitwise XOR of All Pairings", "question__title_slug": "bitwise-xor-of-all-pairings", "question__hide": false, - "total_acs": 5962, - "total_submitted": 9141, - "total_column_articles": 77, + "total_acs": 6075, + "total_submitted": 9344, + "total_column_articles": 79, "frontend_question_id": "2425", "is_new_question": false }, @@ -21348,9 +21852,9 @@ "question__title": "Remove Letter To Equalize Frequency", "question__title_slug": "remove-letter-to-equalize-frequency", "question__hide": false, - "total_acs": 21728, - "total_submitted": 87793, - "total_column_articles": 292, + "total_acs": 21870, + "total_submitted": 88372, + "total_column_articles": 293, "frontend_question_id": "2423", "is_new_question": false }, @@ -21369,8 +21873,8 @@ "question__title": "Create Components With Same Value", "question__title_slug": "create-components-with-same-value", "question__hide": false, - "total_acs": 2491, - "total_submitted": 4024, + "total_acs": 2527, + "total_submitted": 4097, "total_column_articles": 34, "frontend_question_id": "2440", "is_new_question": false @@ -21390,9 +21894,9 @@ "question__title": "Minimize Maximum of Array", "question__title_slug": "minimize-maximum-of-array", "question__hide": false, - "total_acs": 8310, - "total_submitted": 20419, - "total_column_articles": 133, + "total_acs": 8598, + "total_submitted": 21080, + "total_column_articles": 139, "frontend_question_id": "2439", "is_new_question": false }, @@ -21411,9 +21915,9 @@ "question__title": "Range Product Queries of Powers", "question__title_slug": "range-product-queries-of-powers", "question__hide": false, - "total_acs": 5383, - "total_submitted": 12645, - "total_column_articles": 88, + "total_acs": 5442, + "total_submitted": 12748, + "total_column_articles": 89, "frontend_question_id": "2438", "is_new_question": false }, @@ -21432,9 +21936,9 @@ "question__title": "Number of Valid Clock Times", "question__title_slug": "number-of-valid-clock-times", "question__hide": false, - "total_acs": 26169, - "total_submitted": 51933, - "total_column_articles": 298, + "total_acs": 26286, + "total_submitted": 52133, + "total_column_articles": 299, "frontend_question_id": "2437", "is_new_question": false }, @@ -21453,8 +21957,8 @@ "question__title": "Count Subarrays With Fixed Bounds", "question__title_slug": "count-subarrays-with-fixed-bounds", "question__hide": false, - "total_acs": 7314, - "total_submitted": 16050, + "total_acs": 7363, + "total_submitted": 16130, "total_column_articles": 106, "frontend_question_id": "2444", "is_new_question": false @@ -21474,9 +21978,9 @@ "question__title": "Longest Increasing Subsequence II", "question__title_slug": "longest-increasing-subsequence-ii", "question__hide": false, - "total_acs": 6519, - "total_submitted": 20836, - "total_column_articles": 106, + "total_acs": 6607, + "total_submitted": 21081, + "total_column_articles": 108, "frontend_question_id": "2407", "is_new_question": false }, @@ -21495,9 +21999,9 @@ "question__title": "Count Number of Distinct Integers After Reverse Operations", "question__title_slug": "count-number-of-distinct-integers-after-reverse-operations", "question__hide": false, - "total_acs": 11523, - "total_submitted": 15200, - "total_column_articles": 112, + "total_acs": 11624, + "total_submitted": 15338, + "total_column_articles": 113, "frontend_question_id": "2442", "is_new_question": false }, @@ -21516,9 +22020,9 @@ "question__title": "Largest Positive Integer That Exists With Its Negative", "question__title_slug": "largest-positive-integer-that-exists-with-its-negative", "question__hide": false, - "total_acs": 32242, - "total_submitted": 44436, - "total_column_articles": 295, + "total_acs": 32481, + "total_submitted": 44741, + "total_column_articles": 299, "frontend_question_id": "2441", "is_new_question": false }, @@ -21537,9 +22041,9 @@ "question__title": "Change Null Values in a Table to the Previous Value", "question__title_slug": "change-null-values-in-a-table-to-the-previous-value", "question__hide": false, - "total_acs": 1064, - "total_submitted": 1894, - "total_column_articles": 19, + "total_acs": 1117, + "total_submitted": 1967, + "total_column_articles": 21, "frontend_question_id": "2388", "is_new_question": false }, @@ -21558,9 +22062,9 @@ "question__title": "Median of a Row Wise Sorted Matrix", "question__title_slug": "median-of-a-row-wise-sorted-matrix", "question__hide": false, - "total_acs": 298, - "total_submitted": 391, - "total_column_articles": 6, + "total_acs": 310, + "total_submitted": 408, + "total_column_articles": 7, "frontend_question_id": "2387", "is_new_question": false }, @@ -21579,8 +22083,8 @@ "question__title": "Paths in Matrix Whose Sum Is Divisible by K", "question__title_slug": "paths-in-matrix-whose-sum-is-divisible-by-k", "question__hide": false, - "total_acs": 6812, - "total_submitted": 13118, + "total_acs": 6889, + "total_submitted": 13272, "total_column_articles": 102, "frontend_question_id": "2435", "is_new_question": false @@ -21600,9 +22104,9 @@ "question__title": "Using a Robot to Print the Lexicographically Smallest String", "question__title_slug": "using-a-robot-to-print-the-lexicographically-smallest-string", "question__hide": false, - "total_acs": 7216, - "total_submitted": 16812, - "total_column_articles": 120, + "total_acs": 7255, + "total_submitted": 16899, + "total_column_articles": 121, "frontend_question_id": "2434", "is_new_question": false }, @@ -21621,8 +22125,8 @@ "question__title": "Find The Original Array of Prefix Xor", "question__title_slug": "find-the-original-array-of-prefix-xor", "question__hide": false, - "total_acs": 9355, - "total_submitted": 11012, + "total_acs": 9470, + "total_submitted": 11155, "total_column_articles": 94, "frontend_question_id": "2433", "is_new_question": false @@ -21642,8 +22146,8 @@ "question__title": "The Employee That Worked on the Longest Task", "question__title_slug": "the-employee-that-worked-on-the-longest-task", "question__hide": false, - "total_acs": 31207, - "total_submitted": 56547, + "total_acs": 31297, + "total_submitted": 56691, "total_column_articles": 236, "frontend_question_id": "2432", "is_new_question": false @@ -21663,8 +22167,8 @@ "question__title": "Choose Edges to Maximize Score in a Tree", "question__title_slug": "choose-edges-to-maximize-score-in-a-tree", "question__hide": false, - "total_acs": 315, - "total_submitted": 491, + "total_acs": 325, + "total_submitted": 520, "total_column_articles": 10, "frontend_question_id": "2378", "is_new_question": false @@ -21684,8 +22188,8 @@ "question__title": "Sort the Olympic Table", "question__title_slug": "sort-the-olympic-table", "question__hide": false, - "total_acs": 1298, - "total_submitted": 1621, + "total_acs": 1363, + "total_submitted": 1696, "total_column_articles": 15, "frontend_question_id": "2377", "is_new_question": false @@ -21705,9 +22209,9 @@ "question__title": "Calculate the Influence of Each Salesperson", "question__title_slug": "calculate-the-influence-of-each-salesperson", "question__hide": false, - "total_acs": 1181, - "total_submitted": 1521, - "total_column_articles": 12, + "total_acs": 1226, + "total_submitted": 1583, + "total_column_articles": 13, "frontend_question_id": "2372", "is_new_question": false }, @@ -21726,9 +22230,9 @@ "question__title": "Number of Pairs Satisfying Inequality", "question__title_slug": "number-of-pairs-satisfying-inequality", "question__hide": false, - "total_acs": 4861, - "total_submitted": 10326, - "total_column_articles": 91, + "total_acs": 5012, + "total_submitted": 10558, + "total_column_articles": 94, "frontend_question_id": "2426", "is_new_question": false }, @@ -21747,9 +22251,9 @@ "question__title": "Longest Uploaded Prefix", "question__title_slug": "longest-uploaded-prefix", "question__hide": false, - "total_acs": 6618, - "total_submitted": 11627, - "total_column_articles": 100, + "total_acs": 6739, + "total_submitted": 11808, + "total_column_articles": 105, "frontend_question_id": "2424", "is_new_question": false }, @@ -21768,8 +22272,8 @@ "question__title": "Partition String Into Substrings With Values at Most K", "question__title_slug": "partition-string-into-substrings-with-values-at-most-k", "question__hide": false, - "total_acs": 6928, - "total_submitted": 13934, + "total_acs": 7025, + "total_submitted": 14115, "total_column_articles": 70, "frontend_question_id": "2522", "is_new_question": false @@ -21789,8 +22293,8 @@ "question__title": "Maximum Deletions on a String", "question__title_slug": "maximum-deletions-on-a-string", "question__hide": false, - "total_acs": 7333, - "total_submitted": 15245, + "total_acs": 7350, + "total_submitted": 15309, "total_column_articles": 107, "frontend_question_id": "2430", "is_new_question": false @@ -21810,8 +22314,8 @@ "question__title": "Minimize XOR", "question__title_slug": "minimize-xor", "question__hide": false, - "total_acs": 7973, - "total_submitted": 17580, + "total_acs": 8036, + "total_submitted": 17702, "total_column_articles": 116, "frontend_question_id": "2429", "is_new_question": false @@ -21831,9 +22335,9 @@ "question__title": "Maximum Sum of an Hourglass", "question__title_slug": "maximum-sum-of-an-hourglass", "question__hide": false, - "total_acs": 9222, - "total_submitted": 12330, - "total_column_articles": 103, + "total_acs": 9302, + "total_submitted": 12476, + "total_column_articles": 104, "frontend_question_id": "2428", "is_new_question": false }, @@ -21852,9 +22356,9 @@ "question__title": "Number of Common Factors", "question__title_slug": "number-of-common-factors", "question__hide": false, - "total_acs": 36859, - "total_submitted": 45815, - "total_column_articles": 261, + "total_acs": 37221, + "total_submitted": 46282, + "total_column_articles": 263, "frontend_question_id": "2427", "is_new_question": false }, @@ -21873,8 +22377,8 @@ "question__title": "Minimize Maximum Value in a Grid", "question__title_slug": "minimize-maximum-value-in-a-grid", "question__hide": false, - "total_acs": 334, - "total_submitted": 464, + "total_acs": 340, + "total_submitted": 485, "total_column_articles": 13, "frontend_question_id": "2371", "is_new_question": false @@ -21894,9 +22398,9 @@ "question__title": "Number of Good Paths", "question__title_slug": "number-of-good-paths", "question__hide": false, - "total_acs": 4564, - "total_submitted": 10393, - "total_column_articles": 57, + "total_acs": 4607, + "total_submitted": 10481, + "total_column_articles": 58, "frontend_question_id": "2421", "is_new_question": false }, @@ -21915,9 +22419,9 @@ "question__title": "Find All Good Indices", "question__title_slug": "find-all-good-indices", "question__hide": false, - "total_acs": 8902, - "total_submitted": 27273, - "total_column_articles": 150, + "total_acs": 8996, + "total_submitted": 27484, + "total_column_articles": 153, "frontend_question_id": "2420", "is_new_question": false }, @@ -21936,9 +22440,9 @@ "question__title": "Longest Subarray With Maximum Bitwise AND", "question__title_slug": "longest-subarray-with-maximum-bitwise-and", "question__hide": false, - "total_acs": 9308, - "total_submitted": 21549, - "total_column_articles": 109, + "total_acs": 9411, + "total_submitted": 21756, + "total_column_articles": 111, "frontend_question_id": "2419", "is_new_question": false }, @@ -21957,9 +22461,9 @@ "question__title": "Sort the People", "question__title_slug": "sort-the-people", "question__hide": false, - "total_acs": 41082, - "total_submitted": 52293, - "total_column_articles": 418, + "total_acs": 41641, + "total_submitted": 53101, + "total_column_articles": 423, "frontend_question_id": "2418", "is_new_question": false }, @@ -21978,9 +22482,9 @@ "question__title": "Generate the Invoice", "question__title_slug": "generate-the-invoice", "question__hide": false, - "total_acs": 922, - "total_submitted": 1272, - "total_column_articles": 22, + "total_acs": 959, + "total_submitted": 1317, + "total_column_articles": 23, "frontend_question_id": "2362", "is_new_question": false }, @@ -21999,8 +22503,8 @@ "question__title": "Minimum Costs Using the Train Line", "question__title_slug": "minimum-costs-using-the-train-line", "question__hide": false, - "total_acs": 436, - "total_submitted": 572, + "total_acs": 444, + "total_submitted": 595, "total_column_articles": 14, "frontend_question_id": "2361", "is_new_question": false @@ -22020,9 +22524,9 @@ "question__title": "Minimum Money Required Before Transactions", "question__title_slug": "minimum-money-required-before-transactions", "question__hide": false, - "total_acs": 3892, - "total_submitted": 7990, - "total_column_articles": 63, + "total_acs": 3912, + "total_submitted": 8053, + "total_column_articles": 64, "frontend_question_id": "2412", "is_new_question": false }, @@ -22041,9 +22545,9 @@ "question__title": "Smallest Subarrays With Maximum Bitwise OR", "question__title_slug": "smallest-subarrays-with-maximum-bitwise-or", "question__hide": false, - "total_acs": 5473, - "total_submitted": 12149, - "total_column_articles": 66, + "total_acs": 5568, + "total_submitted": 12314, + "total_column_articles": 69, "frontend_question_id": "2411", "is_new_question": false }, @@ -22062,9 +22566,9 @@ "question__title": "Maximum Matching of Players With Trainers", "question__title_slug": "maximum-matching-of-players-with-trainers", "question__hide": false, - "total_acs": 7927, - "total_submitted": 12066, - "total_column_articles": 94, + "total_acs": 8068, + "total_submitted": 12247, + "total_column_articles": 96, "frontend_question_id": "2410", "is_new_question": false }, @@ -22083,9 +22587,9 @@ "question__title": "Count Days Spent Together", "question__title_slug": "count-days-spent-together", "question__hide": false, - "total_acs": 26586, - "total_submitted": 47598, - "total_column_articles": 327, + "total_acs": 26705, + "total_submitted": 47797, + "total_column_articles": 328, "frontend_question_id": "2409", "is_new_question": false }, @@ -22104,9 +22608,9 @@ "question__title": "Number of Unique Subjects Taught by Each Teacher", "question__title_slug": "number-of-unique-subjects-taught-by-each-teacher", "question__hide": false, - "total_acs": 20708, - "total_submitted": 24733, - "total_column_articles": 84, + "total_acs": 22852, + "total_submitted": 27221, + "total_column_articles": 86, "frontend_question_id": "2356", "is_new_question": false }, @@ -22125,9 +22629,9 @@ "question__title": "Sum of Prefix Scores of Strings", "question__title_slug": "sum-of-prefix-scores-of-strings", "question__hide": false, - "total_acs": 9685, - "total_submitted": 23554, - "total_column_articles": 131, + "total_acs": 9741, + "total_submitted": 23661, + "total_column_articles": 133, "frontend_question_id": "2416", "is_new_question": false }, @@ -22146,9 +22650,9 @@ "question__title": "Reverse Odd Levels of Binary Tree", "question__title_slug": "reverse-odd-levels-of-binary-tree", "question__hide": false, - "total_acs": 27365, - "total_submitted": 34278, - "total_column_articles": 240, + "total_acs": 27617, + "total_submitted": 34610, + "total_column_articles": 242, "frontend_question_id": "2415", "is_new_question": false }, @@ -22167,9 +22671,9 @@ "question__title": "Length of the Longest Alphabetical Continuous Substring", "question__title_slug": "length-of-the-longest-alphabetical-continuous-substring", "question__hide": false, - "total_acs": 12976, - "total_submitted": 21316, - "total_column_articles": 138, + "total_acs": 13056, + "total_submitted": 21441, + "total_column_articles": 141, "frontend_question_id": "2414", "is_new_question": false }, @@ -22188,9 +22692,9 @@ "question__title": "Smallest Even Multiple", "question__title_slug": "smallest-even-multiple", "question__hide": false, - "total_acs": 65175, - "total_submitted": 77105, - "total_column_articles": 358, + "total_acs": 67217, + "total_submitted": 79651, + "total_column_articles": 366, "frontend_question_id": "2413", "is_new_question": false }, @@ -22209,8 +22713,8 @@ "question__title": "Maximum Number of Books You Can Take", "question__title_slug": "maximum-number-of-books-you-can-take", "question__hide": false, - "total_acs": 489, - "total_submitted": 891, + "total_acs": 502, + "total_submitted": 933, "total_column_articles": 11, "frontend_question_id": "2355", "is_new_question": false @@ -22230,8 +22734,8 @@ "question__title": "Sort Array by Moving Items to Empty Space", "question__title_slug": "sort-array-by-moving-items-to-empty-space", "question__hide": false, - "total_acs": 205, - "total_submitted": 365, + "total_acs": 208, + "total_submitted": 386, "total_column_articles": 4, "frontend_question_id": "2459", "is_new_question": false @@ -22251,9 +22755,9 @@ "question__title": "Divide Intervals Into Minimum Number of Groups", "question__title_slug": "divide-intervals-into-minimum-number-of-groups", "question__hide": false, - "total_acs": 10194, - "total_submitted": 21655, - "total_column_articles": 138, + "total_acs": 10318, + "total_submitted": 21878, + "total_column_articles": 140, "frontend_question_id": "2406", "is_new_question": false }, @@ -22272,9 +22776,9 @@ "question__title": "Optimal Partition of String", "question__title_slug": "optimal-partition-of-string", "question__hide": false, - "total_acs": 11818, - "total_submitted": 15765, - "total_column_articles": 147, + "total_acs": 11961, + "total_submitted": 15990, + "total_column_articles": 149, "frontend_question_id": "2405", "is_new_question": false }, @@ -22293,9 +22797,9 @@ "question__title": "Most Frequent Even Element", "question__title_slug": "most-frequent-even-element", "question__hide": false, - "total_acs": 38214, - "total_submitted": 65760, - "total_column_articles": 362, + "total_acs": 38371, + "total_submitted": 66003, + "total_column_articles": 363, "frontend_question_id": "2404", "is_new_question": false }, @@ -22314,8 +22818,8 @@ "question__title": "Finding the Number of Visible Mountains", "question__title_slug": "finding-the-number-of-visible-mountains", "question__hide": false, - "total_acs": 318, - "total_submitted": 613, + "total_acs": 324, + "total_submitted": 639, "total_column_articles": 8, "frontend_question_id": "2345", "is_new_question": false @@ -22335,8 +22839,8 @@ "question__title": "Compute the Rank as a Percentage", "question__title_slug": "compute-the-rank-as-a-percentage", "question__hide": false, - "total_acs": 1172, - "total_submitted": 3102, + "total_acs": 1212, + "total_submitted": 3213, "total_column_articles": 14, "frontend_question_id": "2346", "is_new_question": false @@ -22356,8 +22860,8 @@ "question__title": "Task Scheduler II", "question__title_slug": "task-scheduler-ii", "question__hide": false, - "total_acs": 7034, - "total_submitted": 14419, + "total_acs": 7106, + "total_submitted": 14569, "total_column_articles": 91, "frontend_question_id": "2365", "is_new_question": false @@ -22377,9 +22881,9 @@ "question__title": "Maximum Rows Covered by Columns", "question__title_slug": "maximum-rows-covered-by-columns", "question__hide": false, - "total_acs": 21042, - "total_submitted": 30508, - "total_column_articles": 264, + "total_acs": 21236, + "total_submitted": 30798, + "total_column_articles": 265, "frontend_question_id": "2397", "is_new_question": false }, @@ -22398,9 +22902,9 @@ "question__title": "Strictly Palindromic Number", "question__title_slug": "strictly-palindromic-number", "question__hide": false, - "total_acs": 13606, - "total_submitted": 15497, - "total_column_articles": 131, + "total_acs": 13839, + "total_submitted": 15774, + "total_column_articles": 135, "frontend_question_id": "2396", "is_new_question": false }, @@ -22419,8 +22923,8 @@ "question__title": "Find Subarrays With Equal Sum", "question__title_slug": "find-subarrays-with-equal-sum", "question__hide": false, - "total_acs": 29404, - "total_submitted": 38671, + "total_acs": 29576, + "total_submitted": 38910, "total_column_articles": 254, "frontend_question_id": "2395", "is_new_question": false @@ -22440,9 +22944,9 @@ "question__title": "Meeting Rooms III", "question__title_slug": "meeting-rooms-iii", "question__hide": false, - "total_acs": 7257, - "total_submitted": 21830, - "total_column_articles": 129, + "total_acs": 7368, + "total_submitted": 22141, + "total_column_articles": 131, "frontend_question_id": "2402", "is_new_question": false }, @@ -22461,9 +22965,9 @@ "question__title": "Longest Nice Subarray", "question__title_slug": "longest-nice-subarray", "question__hide": false, - "total_acs": 11669, - "total_submitted": 22952, - "total_column_articles": 176, + "total_acs": 11856, + "total_submitted": 23247, + "total_column_articles": 180, "frontend_question_id": "2401", "is_new_question": false }, @@ -22482,8 +22986,8 @@ "question__title": "Number of Ways to Reach a Position After Exactly k Steps", "question__title_slug": "number-of-ways-to-reach-a-position-after-exactly-k-steps", "question__hide": false, - "total_acs": 12352, - "total_submitted": 36979, + "total_acs": 12469, + "total_submitted": 37320, "total_column_articles": 160, "frontend_question_id": "2400", "is_new_question": false @@ -22503,8 +23007,8 @@ "question__title": "Check Distances Between Same Letters", "question__title_slug": "check-distances-between-same-letters", "question__hide": false, - "total_acs": 32634, - "total_submitted": 43588, + "total_acs": 32774, + "total_submitted": 43785, "total_column_articles": 320, "frontend_question_id": "2399", "is_new_question": false @@ -22524,9 +23028,9 @@ "question__title": "Largest Palindromic Number", "question__title_slug": "largest-palindromic-number", "question__hide": false, - "total_acs": 11178, - "total_submitted": 35014, - "total_column_articles": 154, + "total_acs": 11315, + "total_submitted": 35405, + "total_column_articles": 156, "frontend_question_id": "2384", "is_new_question": false }, @@ -22545,8 +23049,8 @@ "question__title": "Minimum Adjacent Swaps to Make a Valid Array", "question__title_slug": "minimum-adjacent-swaps-to-make-a-valid-array", "question__hide": false, - "total_acs": 454, - "total_submitted": 620, + "total_acs": 482, + "total_submitted": 671, "total_column_articles": 13, "frontend_question_id": "2340", "is_new_question": false @@ -22566,9 +23070,9 @@ "question__title": "Max Sum of a Pair With Equal Sum of Digits", "question__title_slug": "max-sum-of-a-pair-with-equal-sum-of-digits", "question__hide": false, - "total_acs": 30243, - "total_submitted": 48810, - "total_column_articles": 330, + "total_acs": 30411, + "total_submitted": 49101, + "total_column_articles": 331, "frontend_question_id": "2342", "is_new_question": false }, @@ -22587,9 +23091,9 @@ "question__title": "Build a Matrix With Conditions", "question__title_slug": "build-a-matrix-with-conditions", "question__hide": false, - "total_acs": 5986, - "total_submitted": 10621, - "total_column_articles": 99, + "total_acs": 6028, + "total_submitted": 10702, + "total_column_articles": 100, "frontend_question_id": "2392", "is_new_question": false }, @@ -22608,9 +23112,9 @@ "question__title": "Minimum Amount of Time to Collect Garbage", "question__title_slug": "minimum-amount-of-time-to-collect-garbage", "question__hide": false, - "total_acs": 11338, - "total_submitted": 13293, - "total_column_articles": 174, + "total_acs": 11454, + "total_submitted": 13451, + "total_column_articles": 176, "frontend_question_id": "2391", "is_new_question": false }, @@ -22629,9 +23133,9 @@ "question__title": "Removing Stars From a String", "question__title_slug": "removing-stars-from-a-string", "question__hide": false, - "total_acs": 27325, - "total_submitted": 37897, - "total_column_articles": 264, + "total_acs": 28428, + "total_submitted": 39341, + "total_column_articles": 270, "frontend_question_id": "2390", "is_new_question": false }, @@ -22650,9 +23154,9 @@ "question__title": "Longest Subsequence With Limited Sum", "question__title_slug": "longest-subsequence-with-limited-sum", "question__hide": false, - "total_acs": 36746, - "total_submitted": 51981, - "total_column_articles": 362, + "total_acs": 36966, + "total_submitted": 52309, + "total_column_articles": 365, "frontend_question_id": "2389", "is_new_question": false }, @@ -22671,9 +23175,9 @@ "question__title": "Valid Palindrome IV", "question__title_slug": "valid-palindrome-iv", "question__hide": false, - "total_acs": 510, - "total_submitted": 655, - "total_column_articles": 19, + "total_acs": 522, + "total_submitted": 677, + "total_column_articles": 20, "frontend_question_id": "2330", "is_new_question": false }, @@ -22692,9 +23196,9 @@ "question__title": "Maximum Segment Sum After Removals", "question__title_slug": "maximum-segment-sum-after-removals", "question__hide": false, - "total_acs": 4358, - "total_submitted": 7680, - "total_column_articles": 95, + "total_acs": 4411, + "total_submitted": 7775, + "total_column_articles": 97, "frontend_question_id": "2382", "is_new_question": false }, @@ -22713,8 +23217,8 @@ "question__title": "Shifting Letters II", "question__title_slug": "shifting-letters-ii", "question__hide": false, - "total_acs": 7150, - "total_submitted": 18209, + "total_acs": 7262, + "total_submitted": 18436, "total_column_articles": 110, "frontend_question_id": "2381", "is_new_question": false @@ -22734,8 +23238,8 @@ "question__title": "Time Needed to Rearrange a Binary String", "question__title_slug": "time-needed-to-rearrange-a-binary-string", "question__hide": false, - "total_acs": 7211, - "total_submitted": 12786, + "total_acs": 7275, + "total_submitted": 12917, "total_column_articles": 80, "frontend_question_id": "2380", "is_new_question": false @@ -22755,8 +23259,8 @@ "question__title": "Minimum Recolors to Get K Consecutive Black Blocks", "question__title_slug": "minimum-recolors-to-get-k-consecutive-black-blocks", "question__hide": false, - "total_acs": 38132, - "total_submitted": 61695, + "total_acs": 38420, + "total_submitted": 62193, "total_column_articles": 451, "frontend_question_id": "2379", "is_new_question": false @@ -22776,9 +23280,9 @@ "question__title": "Find the K-Sum of an Array", "question__title_slug": "find-the-k-sum-of-an-array", "question__hide": false, - "total_acs": 4662, - "total_submitted": 10986, - "total_column_articles": 53, + "total_acs": 14379, + "total_submitted": 25740, + "total_column_articles": 93, "frontend_question_id": "2386", "is_new_question": false }, @@ -22797,9 +23301,9 @@ "question__title": "Amount of Time for Binary Tree to Be Infected", "question__title_slug": "amount-of-time-for-binary-tree-to-be-infected", "question__hide": false, - "total_acs": 9375, - "total_submitted": 19951, - "total_column_articles": 167, + "total_acs": 9484, + "total_submitted": 20149, + "total_column_articles": 168, "frontend_question_id": "2385", "is_new_question": false }, @@ -22818,9 +23322,9 @@ "question__title": "Minimum Hours of Training to Win a Competition", "question__title_slug": "minimum-hours-of-training-to-win-a-competition", "question__hide": false, - "total_acs": 36530, - "total_submitted": 77540, - "total_column_articles": 376, + "total_acs": 36703, + "total_submitted": 77913, + "total_column_articles": 379, "frontend_question_id": "2383", "is_new_question": false }, @@ -22839,9 +23343,9 @@ "question__title": "Find Minimum Time to Finish All Jobs II", "question__title_slug": "find-minimum-time-to-finish-all-jobs-ii", "question__hide": false, - "total_acs": 362, - "total_submitted": 503, - "total_column_articles": 12, + "total_acs": 375, + "total_submitted": 528, + "total_column_articles": 13, "frontend_question_id": "2323", "is_new_question": false }, @@ -22860,9 +23364,9 @@ "question__title": "Count Special Integers", "question__title_slug": "count-special-integers", "question__hide": false, - "total_acs": 11314, - "total_submitted": 20276, - "total_column_articles": 140, + "total_acs": 11419, + "total_submitted": 20495, + "total_column_articles": 141, "frontend_question_id": "2376", "is_new_question": false }, @@ -22881,8 +23385,8 @@ "question__title": "Construct Smallest Number From DI String", "question__title_slug": "construct-smallest-number-from-di-string", "question__hide": false, - "total_acs": 10546, - "total_submitted": 14995, + "total_acs": 10621, + "total_submitted": 15101, "total_column_articles": 218, "frontend_question_id": "2375", "is_new_question": false @@ -22902,8 +23406,8 @@ "question__title": "Node With Highest Edge Score", "question__title_slug": "node-with-highest-edge-score", "question__hide": false, - "total_acs": 10529, - "total_submitted": 24543, + "total_acs": 10597, + "total_submitted": 24660, "total_column_articles": 107, "frontend_question_id": "2374", "is_new_question": false @@ -22923,8 +23427,8 @@ "question__title": "Largest Local Values in a Matrix", "question__title_slug": "largest-local-values-in-a-matrix", "question__hide": false, - "total_acs": 38875, - "total_submitted": 45846, + "total_acs": 39047, + "total_submitted": 46066, "total_column_articles": 321, "frontend_question_id": "2373", "is_new_question": false @@ -22944,8 +23448,8 @@ "question__title": "All the Matches of the League", "question__title_slug": "all-the-matches-of-the-league", "question__hide": false, - "total_acs": 1477, - "total_submitted": 1912, + "total_acs": 1538, + "total_submitted": 1985, "total_column_articles": 18, "frontend_question_id": "2339", "is_new_question": false @@ -22965,8 +23469,8 @@ "question__title": "Product Sales Analysis V", "question__title_slug": "product-sales-analysis-v", "question__hide": false, - "total_acs": 1515, - "total_submitted": 2107, + "total_acs": 1567, + "total_submitted": 2178, "total_column_articles": 15, "frontend_question_id": "2329", "is_new_question": false @@ -22986,9 +23490,9 @@ "question__title": "Product Sales Analysis IV", "question__title_slug": "product-sales-analysis-iv", "question__hide": false, - "total_acs": 1254, - "total_submitted": 1770, - "total_column_articles": 16, + "total_acs": 1304, + "total_submitted": 1843, + "total_column_articles": 17, "frontend_question_id": "2324", "is_new_question": false }, @@ -23007,9 +23511,9 @@ "question__title": "Minimum Replacements to Sort the Array", "question__title_slug": "minimum-replacements-to-sort-the-array", "question__hide": false, - "total_acs": 4753, - "total_submitted": 10807, - "total_column_articles": 54, + "total_acs": 4788, + "total_submitted": 10893, + "total_column_articles": 55, "frontend_question_id": "2366", "is_new_question": false }, @@ -23028,9 +23532,9 @@ "question__title": "Maximum Number of Robots Within Budget", "question__title_slug": "maximum-number-of-robots-within-budget", "question__hide": false, - "total_acs": 5235, - "total_submitted": 14513, - "total_column_articles": 97, + "total_acs": 5345, + "total_submitted": 14770, + "total_column_articles": 98, "frontend_question_id": "2398", "is_new_question": false }, @@ -23049,9 +23553,9 @@ "question__title": "Count Number of Bad Pairs", "question__title_slug": "count-number-of-bad-pairs", "question__hide": false, - "total_acs": 7029, - "total_submitted": 16363, - "total_column_articles": 88, + "total_acs": 7085, + "total_submitted": 16489, + "total_column_articles": 89, "frontend_question_id": "2364", "is_new_question": false }, @@ -23070,9 +23574,9 @@ "question__title": "Merge Similar Items", "question__title_slug": "merge-similar-items", "question__hide": false, - "total_acs": 36192, - "total_submitted": 46326, - "total_column_articles": 311, + "total_acs": 36371, + "total_submitted": 46554, + "total_column_articles": 312, "frontend_question_id": "2363", "is_new_question": false }, @@ -23091,9 +23595,9 @@ "question__title": "The First Day of the Maximum Recorded Degree in Each City", "question__title_slug": "the-first-day-of-the-maximum-recorded-degree-in-each-city", "question__hide": false, - "total_acs": 1340, - "total_submitted": 1892, - "total_column_articles": 15, + "total_acs": 1394, + "total_submitted": 1952, + "total_column_articles": 16, "frontend_question_id": "2314", "is_new_question": false }, @@ -23112,9 +23616,9 @@ "question__title": "Reachable Nodes With Restrictions", "question__title_slug": "reachable-nodes-with-restrictions", "question__hide": false, - "total_acs": 10670, - "total_submitted": 22683, - "total_column_articles": 152, + "total_acs": 27087, + "total_submitted": 47070, + "total_column_articles": 271, "frontend_question_id": "2368", "is_new_question": false }, @@ -23133,9 +23637,9 @@ "question__title": "Longest Ideal Subsequence", "question__title_slug": "longest-ideal-subsequence", "question__hide": false, - "total_acs": 9298, - "total_submitted": 21505, - "total_column_articles": 123, + "total_acs": 9457, + "total_submitted": 21882, + "total_column_articles": 125, "frontend_question_id": "2370", "is_new_question": false }, @@ -23154,9 +23658,9 @@ "question__title": "Check if There is a Valid Partition For The Array", "question__title_slug": "check-if-there-is-a-valid-partition-for-the-array", "question__hide": false, - "total_acs": 10107, - "total_submitted": 25137, - "total_column_articles": 129, + "total_acs": 27744, + "total_submitted": 58316, + "total_column_articles": 242, "frontend_question_id": "2369", "is_new_question": false }, @@ -23175,9 +23679,9 @@ "question__title": "Number of Arithmetic Triplets", "question__title_slug": "number-of-arithmetic-triplets", "question__hide": false, - "total_acs": 44488, - "total_submitted": 53461, - "total_column_articles": 412, + "total_acs": 45083, + "total_submitted": 54145, + "total_column_articles": 416, "frontend_question_id": "2367", "is_new_question": false }, @@ -23196,9 +23700,9 @@ "question__title": "Arrange Table by Gender", "question__title_slug": "arrange-table-by-gender", "question__hide": false, - "total_acs": 1365, - "total_submitted": 1815, - "total_column_articles": 17, + "total_acs": 1418, + "total_submitted": 1886, + "total_column_articles": 18, "frontend_question_id": "2308", "is_new_question": false }, @@ -23217,9 +23721,9 @@ "question__title": "Tasks Count in the Weekend", "question__title_slug": "tasks-count-in-the-weekend", "question__hide": false, - "total_acs": 1499, - "total_submitted": 1962, - "total_column_articles": 19, + "total_acs": 1567, + "total_submitted": 2046, + "total_column_articles": 21, "frontend_question_id": "2298", "is_new_question": false }, @@ -23238,9 +23742,9 @@ "question__title": "Longest Cycle in a Graph", "question__title_slug": "longest-cycle-in-a-graph", "question__hide": false, - "total_acs": 9216, - "total_submitted": 23738, - "total_column_articles": 148, + "total_acs": 9327, + "total_submitted": 23989, + "total_column_articles": 149, "frontend_question_id": "2360", "is_new_question": false }, @@ -23259,9 +23763,9 @@ "question__title": "Find Closest Node to Given Two Nodes", "question__title_slug": "find-closest-node-to-given-two-nodes", "question__hide": false, - "total_acs": 8626, - "total_submitted": 27803, - "total_column_articles": 115, + "total_acs": 8683, + "total_submitted": 27962, + "total_column_articles": 116, "frontend_question_id": "2359", "is_new_question": false }, @@ -23280,9 +23784,9 @@ "question__title": "Maximum Number of Groups Entering a Competition", "question__title_slug": "maximum-number-of-groups-entering-a-competition", "question__hide": false, - "total_acs": 11343, - "total_submitted": 17516, - "total_column_articles": 183, + "total_acs": 11414, + "total_submitted": 17625, + "total_column_articles": 184, "frontend_question_id": "2358", "is_new_question": false }, @@ -23301,9 +23805,9 @@ "question__title": "Make Array Zero by Subtracting Equal Amounts", "question__title_slug": "make-array-zero-by-subtracting-equal-amounts", "question__hide": false, - "total_acs": 44508, - "total_submitted": 58873, - "total_column_articles": 508, + "total_acs": 44831, + "total_submitted": 59307, + "total_column_articles": 511, "frontend_question_id": "2357", "is_new_question": false }, @@ -23322,9 +23826,9 @@ "question__title": "Shortest Impossible Sequence of Rolls", "question__title_slug": "shortest-impossible-sequence-of-rolls", "question__hide": false, - "total_acs": 4444, - "total_submitted": 6761, - "total_column_articles": 75, + "total_acs": 4471, + "total_submitted": 6819, + "total_column_articles": 76, "frontend_question_id": "2350", "is_new_question": false }, @@ -23343,9 +23847,9 @@ "question__title": "Design a Number Container System", "question__title_slug": "design-a-number-container-system", "question__hide": false, - "total_acs": 7142, - "total_submitted": 19056, - "total_column_articles": 98, + "total_acs": 7177, + "total_submitted": 19157, + "total_column_articles": 99, "frontend_question_id": "2349", "is_new_question": false }, @@ -23364,9 +23868,9 @@ "question__title": "Best Poker Hand", "question__title_slug": "best-poker-hand", "question__hide": false, - "total_acs": 33458, - "total_submitted": 56358, - "total_column_articles": 297, + "total_acs": 33572, + "total_submitted": 56559, + "total_column_articles": 298, "frontend_question_id": "2347", "is_new_question": false }, @@ -23385,9 +23889,9 @@ "question__title": "Number of Zero-Filled Subarrays", "question__title_slug": "number-of-zero-filled-subarrays", "question__hide": false, - "total_acs": 9036, - "total_submitted": 15809, - "total_column_articles": 124, + "total_acs": 9183, + "total_submitted": 16019, + "total_column_articles": 129, "frontend_question_id": "2348", "is_new_question": false }, @@ -23406,8 +23910,8 @@ "question__title": "Products With Three or More Orders in Two Consecutive Years", "question__title_slug": "products-with-three-or-more-orders-in-two-consecutive-years", "question__hide": false, - "total_acs": 1488, - "total_submitted": 3456, + "total_acs": 1548, + "total_submitted": 3617, "total_column_articles": 23, "frontend_question_id": "2292", "is_new_question": false @@ -23427,8 +23931,8 @@ "question__title": "Number of Excellent Pairs", "question__title_slug": "number-of-excellent-pairs", "question__hide": false, - "total_acs": 6723, - "total_submitted": 14824, + "total_acs": 6793, + "total_submitted": 14961, "total_column_articles": 80, "frontend_question_id": "2354", "is_new_question": false @@ -23448,8 +23952,8 @@ "question__title": "Design a Food Rating System", "question__title_slug": "design-a-food-rating-system", "question__hide": false, - "total_acs": 8496, - "total_submitted": 27196, + "total_acs": 8545, + "total_submitted": 27327, "total_column_articles": 124, "frontend_question_id": "2353", "is_new_question": false @@ -23469,9 +23973,9 @@ "question__title": "Equal Row and Column Pairs", "question__title_slug": "equal-row-and-column-pairs", "question__hide": false, - "total_acs": 43100, - "total_submitted": 58891, - "total_column_articles": 401, + "total_acs": 43894, + "total_submitted": 59972, + "total_column_articles": 404, "frontend_question_id": "2352", "is_new_question": false }, @@ -23490,9 +23994,9 @@ "question__title": "First Letter to Appear Twice", "question__title_slug": "first-letter-to-appear-twice", "question__hide": false, - "total_acs": 43633, - "total_submitted": 51969, - "total_column_articles": 452, + "total_acs": 44020, + "total_submitted": 52436, + "total_column_articles": 459, "frontend_question_id": "2351", "is_new_question": false }, @@ -23511,8 +24015,8 @@ "question__title": "Maximum Profit From Trading Stocks", "question__title_slug": "maximum-profit-from-trading-stocks", "question__hide": false, - "total_acs": 662, - "total_submitted": 1160, + "total_acs": 715, + "total_submitted": 1245, "total_column_articles": 20, "frontend_question_id": "2291", "is_new_question": false @@ -23532,9 +24036,9 @@ "question__title": "Number of People That Can Be Seen in a Grid", "question__title_slug": "number-of-people-that-can-be-seen-in-a-grid", "question__hide": false, - "total_acs": 299, - "total_submitted": 613, - "total_column_articles": 11, + "total_acs": 306, + "total_submitted": 645, + "total_column_articles": 12, "frontend_question_id": "2282", "is_new_question": false }, @@ -23553,9 +24057,9 @@ "question__title": "Minimum Deletions to Make Array Divisible", "question__title_slug": "minimum-deletions-to-make-array-divisible", "question__hide": false, - "total_acs": 9156, - "total_submitted": 16992, - "total_column_articles": 123, + "total_acs": 9218, + "total_submitted": 17096, + "total_column_articles": 125, "frontend_question_id": "2344", "is_new_question": false }, @@ -23574,9 +24078,9 @@ "question__title": "Query Kth Smallest Trimmed Number", "question__title_slug": "query-kth-smallest-trimmed-number", "question__hide": false, - "total_acs": 10180, - "total_submitted": 24191, - "total_column_articles": 148, + "total_acs": 10235, + "total_submitted": 24311, + "total_column_articles": 151, "frontend_question_id": "2343", "is_new_question": false }, @@ -23595,9 +24099,9 @@ "question__title": "Maximum Number of Pairs in Array", "question__title_slug": "maximum-number-of-pairs-in-array", "question__hide": false, - "total_acs": 41470, - "total_submitted": 51233, - "total_column_articles": 494, + "total_acs": 41670, + "total_submitted": 51471, + "total_column_articles": 497, "frontend_question_id": "2341", "is_new_question": false }, @@ -23616,8 +24120,8 @@ "question__title": "Closest Node to Path in Tree", "question__title_slug": "closest-node-to-path-in-tree", "question__hide": false, - "total_acs": 449, - "total_submitted": 659, + "total_acs": 459, + "total_submitted": 688, "total_column_articles": 15, "frontend_question_id": "2277", "is_new_question": false @@ -23637,8 +24141,8 @@ "question__title": "Subarray With Elements Greater Than Varying Threshold", "question__title_slug": "subarray-with-elements-greater-than-varying-threshold", "question__hide": false, - "total_acs": 3710, - "total_submitted": 7794, + "total_acs": 3760, + "total_submitted": 7898, "total_column_articles": 58, "frontend_question_id": "2334", "is_new_question": false @@ -23658,9 +24162,9 @@ "question__title": "Minimum Sum of Squared Difference", "question__title_slug": "minimum-sum-of-squared-difference", "question__hide": false, - "total_acs": 5598, - "total_submitted": 20547, - "total_column_articles": 84, + "total_acs": 5636, + "total_submitted": 20674, + "total_column_articles": 85, "frontend_question_id": "2333", "is_new_question": false }, @@ -23679,9 +24183,9 @@ "question__title": "The Latest Time to Catch a Bus", "question__title_slug": "the-latest-time-to-catch-a-bus", "question__hide": false, - "total_acs": 6323, - "total_submitted": 24973, - "total_column_articles": 101, + "total_acs": 6405, + "total_submitted": 25322, + "total_column_articles": 102, "frontend_question_id": "2332", "is_new_question": false }, @@ -23700,9 +24204,9 @@ "question__title": "Evaluate Boolean Binary Tree", "question__title_slug": "evaluate-boolean-binary-tree", "question__hide": false, - "total_acs": 35828, - "total_submitted": 43121, - "total_column_articles": 395, + "total_acs": 36368, + "total_submitted": 43852, + "total_column_articles": 400, "frontend_question_id": "2331", "is_new_question": false }, @@ -23721,9 +24225,9 @@ "question__title": "Count the Number of Ideal Arrays", "question__title_slug": "count-the-number-of-ideal-arrays", "question__hide": false, - "total_acs": 3128, - "total_submitted": 10034, - "total_column_articles": 47, + "total_acs": 3140, + "total_submitted": 10072, + "total_column_articles": 48, "frontend_question_id": "2338", "is_new_question": false }, @@ -23742,8 +24246,8 @@ "question__title": "Move Pieces to Obtain a String", "question__title_slug": "move-pieces-to-obtain-a-string", "question__hide": false, - "total_acs": 28613, - "total_submitted": 60239, + "total_acs": 28665, + "total_submitted": 60374, "total_column_articles": 290, "frontend_question_id": "2337", "is_new_question": false @@ -23763,9 +24267,9 @@ "question__title": "Smallest Number in Infinite Set", "question__title_slug": "smallest-number-in-infinite-set", "question__hide": false, - "total_acs": 33028, - "total_submitted": 45523, - "total_column_articles": 346, + "total_acs": 33415, + "total_submitted": 46079, + "total_column_articles": 352, "frontend_question_id": "2336", "is_new_question": false }, @@ -23784,9 +24288,9 @@ "question__title": "Minimum Amount of Time to Fill Cups", "question__title_slug": "minimum-amount-of-time-to-fill-cups", "question__hide": false, - "total_acs": 35136, - "total_submitted": 54406, - "total_column_articles": 410, + "total_acs": 35311, + "total_submitted": 54684, + "total_column_articles": 412, "frontend_question_id": "2335", "is_new_question": false }, @@ -23805,8 +24309,8 @@ "question__title": "Spiral Matrix IV", "question__title_slug": "spiral-matrix-iv", "question__hide": false, - "total_acs": 11108, - "total_submitted": 16543, + "total_acs": 11193, + "total_submitted": 16687, "total_column_articles": 152, "frontend_question_id": "2326", "is_new_question": false @@ -23826,8 +24330,8 @@ "question__title": "Number of Increasing Paths in a Grid", "question__title_slug": "number-of-increasing-paths-in-a-grid", "question__hide": false, - "total_acs": 7200, - "total_submitted": 13915, + "total_acs": 7263, + "total_submitted": 14021, "total_column_articles": 130, "frontend_question_id": "2328", "is_new_question": false @@ -23847,9 +24351,9 @@ "question__title": "Number of People Aware of a Secret", "question__title_slug": "number-of-people-aware-of-a-secret", "question__hide": false, - "total_acs": 11230, - "total_submitted": 24484, - "total_column_articles": 214, + "total_acs": 11280, + "total_submitted": 24626, + "total_column_articles": 215, "frontend_question_id": "2327", "is_new_question": false }, @@ -23868,9 +24372,9 @@ "question__title": "Decode the Message", "question__title_slug": "decode-the-message", "question__hide": false, - "total_acs": 45924, - "total_submitted": 54100, - "total_column_articles": 445, + "total_acs": 46081, + "total_submitted": 54323, + "total_column_articles": 446, "frontend_question_id": "2325", "is_new_question": false }, @@ -23889,9 +24393,9 @@ "question__title": "Minimum Number of Keypresses", "question__title_slug": "minimum-number-of-keypresses", "question__hide": false, - "total_acs": 597, - "total_submitted": 876, - "total_column_articles": 19, + "total_acs": 632, + "total_submitted": 932, + "total_column_articles": 20, "frontend_question_id": "2268", "is_new_question": false }, @@ -23910,9 +24414,9 @@ "question__title": "Number of Distinct Roll Sequences", "question__title_slug": "number-of-distinct-roll-sequences", "question__hide": false, - "total_acs": 4041, - "total_submitted": 7042, - "total_column_articles": 76, + "total_acs": 4063, + "total_submitted": 7090, + "total_column_articles": 77, "frontend_question_id": "2318", "is_new_question": false }, @@ -23931,9 +24435,9 @@ "question__title": "Count Unreachable Pairs of Nodes in an Undirected Graph", "question__title_slug": "count-unreachable-pairs-of-nodes-in-an-undirected-graph", "question__hide": false, - "total_acs": 24338, - "total_submitted": 50212, - "total_column_articles": 251, + "total_acs": 24891, + "total_submitted": 51323, + "total_column_articles": 261, "frontend_question_id": "2316", "is_new_question": false }, @@ -23952,9 +24456,9 @@ "question__title": "Maximum XOR After Operations ", "question__title_slug": "maximum-xor-after-operations", "question__hide": false, - "total_acs": 6250, - "total_submitted": 7323, - "total_column_articles": 78, + "total_acs": 6327, + "total_submitted": 7431, + "total_column_articles": 81, "frontend_question_id": "2317", "is_new_question": false }, @@ -23973,9 +24477,9 @@ "question__title": "Count Asterisks", "question__title_slug": "count-asterisks", "question__hide": false, - "total_acs": 38345, - "total_submitted": 45046, - "total_column_articles": 494, + "total_acs": 38717, + "total_submitted": 45509, + "total_column_articles": 500, "frontend_question_id": "2315", "is_new_question": false }, @@ -23994,9 +24498,9 @@ "question__title": "Minimum Score After Removals on a Tree", "question__title_slug": "minimum-score-after-removals-on-a-tree", "question__hide": false, - "total_acs": 3873, - "total_submitted": 6489, - "total_column_articles": 58, + "total_acs": 3916, + "total_submitted": 6570, + "total_column_articles": 59, "frontend_question_id": "2322", "is_new_question": false }, @@ -24015,8 +24519,8 @@ "question__title": "Minimum Flips in Binary Tree to Get Result", "question__title_slug": "minimum-flips-in-binary-tree-to-get-result", "question__hide": false, - "total_acs": 311, - "total_submitted": 453, + "total_acs": 313, + "total_submitted": 471, "total_column_articles": 17, "frontend_question_id": "2313", "is_new_question": false @@ -24036,9 +24540,9 @@ "question__title": "Check if Matrix Is X-Matrix", "question__title_slug": "check-if-matrix-is-x-matrix", "question__hide": false, - "total_acs": 38260, - "total_submitted": 50369, - "total_column_articles": 352, + "total_acs": 38512, + "total_submitted": 50730, + "total_column_articles": 355, "frontend_question_id": "2319", "is_new_question": false }, @@ -24057,9 +24561,9 @@ "question__title": "Count Number of Ways to Place Houses", "question__title_slug": "count-number-of-ways-to-place-houses", "question__hide": false, - "total_acs": 9379, - "total_submitted": 22794, - "total_column_articles": 101, + "total_acs": 9612, + "total_submitted": 23234, + "total_column_articles": 107, "frontend_question_id": "2320", "is_new_question": false }, @@ -24078,8 +24582,8 @@ "question__title": "Design Video Sharing Platform", "question__title_slug": "design-video-sharing-platform", "question__hide": false, - "total_acs": 264, - "total_submitted": 426, + "total_acs": 267, + "total_submitted": 445, "total_column_articles": 9, "frontend_question_id": "2254", "is_new_question": false @@ -24099,9 +24603,9 @@ "question__title": "Longest Binary Subsequence Less Than or Equal to K", "question__title_slug": "longest-binary-subsequence-less-than-or-equal-to-k", "question__hide": false, - "total_acs": 7966, - "total_submitted": 21215, - "total_column_articles": 139, + "total_acs": 8062, + "total_submitted": 21433, + "total_column_articles": 140, "frontend_question_id": "2311", "is_new_question": false }, @@ -24120,9 +24624,9 @@ "question__title": "Count Subarrays With Score Less Than K", "question__title_slug": "count-subarrays-with-score-less-than-k", "question__hide": false, - "total_acs": 6299, - "total_submitted": 12029, - "total_column_articles": 91, + "total_acs": 6498, + "total_submitted": 12368, + "total_column_articles": 92, "frontend_question_id": "2302", "is_new_question": false }, @@ -24141,8 +24645,8 @@ "question__title": "Match Substring After Replacement", "question__title_slug": "match-substring-after-replacement", "question__hide": false, - "total_acs": 4768, - "total_submitted": 10399, + "total_acs": 4808, + "total_submitted": 10471, "total_column_articles": 74, "frontend_question_id": "2301", "is_new_question": false @@ -24162,9 +24666,9 @@ "question__title": "Successful Pairs of Spells and Potions", "question__title_slug": "successful-pairs-of-spells-and-potions", "question__hide": false, - "total_acs": 37014, - "total_submitted": 83019, - "total_column_articles": 336, + "total_acs": 37827, + "total_submitted": 84862, + "total_column_articles": 342, "frontend_question_id": "2300", "is_new_question": false }, @@ -24183,9 +24687,9 @@ "question__title": "Strong Password Checker II", "question__title_slug": "strong-password-checker-ii", "question__hide": false, - "total_acs": 26285, - "total_submitted": 40164, - "total_column_articles": 304, + "total_acs": 26427, + "total_submitted": 40374, + "total_column_articles": 305, "frontend_question_id": "2299", "is_new_question": false }, @@ -24204,8 +24708,8 @@ "question__title": "Naming a Company", "question__title_slug": "naming-a-company", "question__hide": false, - "total_acs": 5068, - "total_submitted": 11279, + "total_acs": 5098, + "total_submitted": 11352, "total_column_articles": 71, "frontend_question_id": "2306", "is_new_question": false @@ -24225,8 +24729,8 @@ "question__title": "Design a Text Editor", "question__title_slug": "design-a-text-editor", "question__hide": false, - "total_acs": 7718, - "total_submitted": 17320, + "total_acs": 7772, + "total_submitted": 17426, "total_column_articles": 127, "frontend_question_id": "2296", "is_new_question": false @@ -24246,9 +24750,9 @@ "question__title": "Replace Elements in an Array", "question__title_slug": "replace-elements-in-an-array", "question__hide": false, - "total_acs": 9608, - "total_submitted": 16473, - "total_column_articles": 126, + "total_acs": 9734, + "total_submitted": 16650, + "total_column_articles": 130, "frontend_question_id": "2295", "is_new_question": false }, @@ -24267,9 +24771,9 @@ "question__title": "Partition Array Such That Maximum Difference Is K", "question__title_slug": "partition-array-such-that-maximum-difference-is-k", "question__hide": false, - "total_acs": 9226, - "total_submitted": 13442, - "total_column_articles": 121, + "total_acs": 9310, + "total_submitted": 13563, + "total_column_articles": 123, "frontend_question_id": "2294", "is_new_question": false }, @@ -24288,9 +24792,9 @@ "question__title": "Min Max Game", "question__title_slug": "min-max-game", "question__hide": false, - "total_acs": 30525, - "total_submitted": 41885, - "total_column_articles": 328, + "total_acs": 30647, + "total_submitted": 42045, + "total_column_articles": 330, "frontend_question_id": "2293", "is_new_question": false }, @@ -24309,8 +24813,8 @@ "question__title": "Count Positions on Street With Required Brightness", "question__title_slug": "count-positions-on-street-with-required-brightness", "question__hide": false, - "total_acs": 400, - "total_submitted": 560, + "total_acs": 411, + "total_submitted": 576, "total_column_articles": 17, "frontend_question_id": "2237", "is_new_question": false @@ -24330,9 +24834,9 @@ "question__title": "Root Equals Sum of Children", "question__title_slug": "root-equals-sum-of-children", "question__hide": false, - "total_acs": 54002, - "total_submitted": 63154, - "total_column_articles": 259, + "total_acs": 55710, + "total_submitted": 65325, + "total_column_articles": 263, "frontend_question_id": "2236", "is_new_question": false }, @@ -24351,9 +24855,9 @@ "question__title": "Add Two Integers", "question__title_slug": "add-two-integers", "question__hide": false, - "total_acs": 84139, - "total_submitted": 105682, - "total_column_articles": 288, + "total_acs": 87363, + "total_submitted": 110103, + "total_column_articles": 302, "frontend_question_id": "2235", "is_new_question": false }, @@ -24372,8 +24876,8 @@ "question__title": "Dynamic Unpivoting of a Table", "question__title_slug": "dynamic-unpivoting-of-a-table", "question__hide": false, - "total_acs": 355, - "total_submitted": 513, + "total_acs": 361, + "total_submitted": 526, "total_column_articles": 6, "frontend_question_id": "2253", "is_new_question": false @@ -24393,8 +24897,8 @@ "question__title": "Dynamic Pivoting of a Table", "question__title_slug": "dynamic-pivoting-of-a-table", "question__hide": false, - "total_acs": 395, - "total_submitted": 713, + "total_acs": 399, + "total_submitted": 718, "total_column_articles": 6, "frontend_question_id": "2252", "is_new_question": false @@ -24414,8 +24918,8 @@ "question__title": "Booking Concert Tickets in Groups", "question__title_slug": "booking-concert-tickets-in-groups", "question__hide": false, - "total_acs": 3655, - "total_submitted": 14738, + "total_acs": 3682, + "total_submitted": 14811, "total_column_articles": 63, "frontend_question_id": "2286", "is_new_question": false @@ -24435,8 +24939,8 @@ "question__title": "Maximum Total Importance of Roads", "question__title_slug": "maximum-total-importance-of-roads", "question__hide": false, - "total_acs": 6941, - "total_submitted": 11920, + "total_acs": 7002, + "total_submitted": 12018, "total_column_articles": 97, "frontend_question_id": "2285", "is_new_question": false @@ -24456,9 +24960,9 @@ "question__title": "Sender With Largest Word Count", "question__title_slug": "sender-with-largest-word-count", "question__hide": false, - "total_acs": 7219, - "total_submitted": 12553, - "total_column_articles": 103, + "total_acs": 7275, + "total_submitted": 12642, + "total_column_articles": 104, "frontend_question_id": "2284", "is_new_question": false }, @@ -24477,9 +24981,9 @@ "question__title": "Check if Number Has Equal Digit Count and Digit Value", "question__title_slug": "check-if-number-has-equal-digit-count-and-digit-value", "question__hide": false, - "total_acs": 33081, - "total_submitted": 42116, - "total_column_articles": 395, + "total_acs": 33239, + "total_submitted": 42329, + "total_column_articles": 396, "frontend_question_id": "2283", "is_new_question": false }, @@ -24498,9 +25002,9 @@ "question__title": "Number of Times a Driver Was a Passenger", "question__title_slug": "number-of-times-a-driver-was-a-passenger", "question__hide": false, - "total_acs": 1536, - "total_submitted": 2201, - "total_column_articles": 20, + "total_acs": 1584, + "total_submitted": 2277, + "total_column_articles": 22, "frontend_question_id": "2238", "is_new_question": false }, @@ -24519,8 +25023,8 @@ "question__title": "Minimum Obstacle Removal to Reach Corner", "question__title_slug": "minimum-obstacle-removal-to-reach-corner", "question__hide": false, - "total_acs": 7164, - "total_submitted": 12550, + "total_acs": 7251, + "total_submitted": 12674, "total_column_articles": 104, "frontend_question_id": "2290", "is_new_question": false @@ -24540,8 +25044,8 @@ "question__title": "Steps to Make Array Non-decreasing", "question__title_slug": "steps-to-make-array-non-decreasing", "question__hide": false, - "total_acs": 6819, - "total_submitted": 30460, + "total_acs": 6904, + "total_submitted": 30730, "total_column_articles": 108, "frontend_question_id": "2289", "is_new_question": false @@ -24561,9 +25065,9 @@ "question__title": "Apply Discount to Prices", "question__title_slug": "apply-discount-to-prices", "question__hide": false, - "total_acs": 8816, - "total_submitted": 27565, - "total_column_articles": 122, + "total_acs": 8871, + "total_submitted": 27681, + "total_column_articles": 123, "frontend_question_id": "2288", "is_new_question": false }, @@ -24582,9 +25086,9 @@ "question__title": "Rearrange Characters to Make Target String", "question__title_slug": "rearrange-characters-to-make-target-string", "question__hide": false, - "total_acs": 33061, - "total_submitted": 50780, - "total_column_articles": 431, + "total_acs": 33184, + "total_submitted": 50956, + "total_column_articles": 434, "frontend_question_id": "2287", "is_new_question": false }, @@ -24603,8 +25107,8 @@ "question__title": "The Users That Are Eligible for Discount", "question__title_slug": "the-users-that-are-eligible-for-discount", "question__hide": false, - "total_acs": 1448, - "total_submitted": 2938, + "total_acs": 1493, + "total_submitted": 3051, "total_column_articles": 12, "frontend_question_id": "2230", "is_new_question": false @@ -24624,9 +25128,9 @@ "question__title": "Users With Two Purchases Within Seven Days", "question__title_slug": "users-with-two-purchases-within-seven-days", "question__hide": false, - "total_acs": 1669, - "total_submitted": 3461, - "total_column_articles": 24, + "total_acs": 1740, + "total_submitted": 3597, + "total_column_articles": 26, "frontend_question_id": "2228", "is_new_question": false }, @@ -24645,8 +25149,8 @@ "question__title": "Maximum Sum Score of Array", "question__title_slug": "maximum-sum-score-of-array", "question__hide": false, - "total_acs": 431, - "total_submitted": 664, + "total_acs": 444, + "total_submitted": 678, "total_column_articles": 20, "frontend_question_id": "2219", "is_new_question": false @@ -24666,9 +25170,9 @@ "question__title": "Sum of Total Strength of Wizards", "question__title_slug": "sum-of-total-strength-of-wizards", "question__hide": false, - "total_acs": 4726, - "total_submitted": 17003, - "total_column_articles": 75, + "total_acs": 4777, + "total_submitted": 17125, + "total_column_articles": 76, "frontend_question_id": "2281", "is_new_question": false }, @@ -24687,8 +25191,8 @@ "question__title": "Minimum Lines to Represent a Line Chart", "question__title_slug": "minimum-lines-to-represent-a-line-chart", "question__hide": false, - "total_acs": 10467, - "total_submitted": 45079, + "total_acs": 10525, + "total_submitted": 45240, "total_column_articles": 159, "frontend_question_id": "2280", "is_new_question": false @@ -24708,9 +25212,9 @@ "question__title": "Maximum Bags With Full Capacity of Rocks", "question__title_slug": "maximum-bags-with-full-capacity-of-rocks", "question__hide": false, - "total_acs": 15514, - "total_submitted": 24426, - "total_column_articles": 158, + "total_acs": 15740, + "total_submitted": 24795, + "total_column_articles": 159, "frontend_question_id": "2279", "is_new_question": false }, @@ -24729,9 +25233,9 @@ "question__title": "Percentage of Letter in String", "question__title_slug": "percentage-of-letter-in-string", "question__hide": false, - "total_acs": 17332, - "total_submitted": 21621, - "total_column_articles": 156, + "total_acs": 17567, + "total_submitted": 21899, + "total_column_articles": 157, "frontend_question_id": "2278", "is_new_question": false }, @@ -24750,9 +25254,9 @@ "question__title": "Longest Path With Different Adjacent Characters", "question__title_slug": "longest-path-with-different-adjacent-characters", "question__hide": false, - "total_acs": 7995, - "total_submitted": 16258, - "total_column_articles": 82, + "total_acs": 8243, + "total_submitted": 16753, + "total_column_articles": 84, "frontend_question_id": "2246", "is_new_question": false }, @@ -24771,9 +25275,9 @@ "question__title": "Maximum Trailing Zeros in a Cornered Path", "question__title_slug": "maximum-trailing-zeros-in-a-cornered-path", "question__hide": false, - "total_acs": 4986, - "total_submitted": 13551, - "total_column_articles": 99, + "total_acs": 5010, + "total_submitted": 13623, + "total_column_articles": 100, "frontend_question_id": "2245", "is_new_question": false }, @@ -24792,8 +25296,8 @@ "question__title": "Minimum Rounds to Complete All Tasks", "question__title_slug": "minimum-rounds-to-complete-all-tasks", "question__hide": false, - "total_acs": 11789, - "total_submitted": 20447, + "total_acs": 11868, + "total_submitted": 20559, "total_column_articles": 169, "frontend_question_id": "2244", "is_new_question": false @@ -24813,9 +25317,9 @@ "question__title": "Calculate Digit Sum of a String", "question__title_slug": "calculate-digit-sum-of-a-string", "question__hide": false, - "total_acs": 13666, - "total_submitted": 21504, - "total_column_articles": 194, + "total_acs": 13843, + "total_submitted": 21799, + "total_column_articles": 195, "frontend_question_id": "2243", "is_new_question": false }, @@ -24834,9 +25338,9 @@ "question__title": "Substring With Largest Variance", "question__title_slug": "substring-with-largest-variance", "question__hide": false, - "total_acs": 4208, - "total_submitted": 10591, - "total_column_articles": 43, + "total_acs": 4256, + "total_submitted": 10725, + "total_column_articles": 44, "frontend_question_id": "2272", "is_new_question": false }, @@ -24855,8 +25359,8 @@ "question__title": "Maximum White Tiles Covered by a Carpet", "question__title_slug": "maximum-white-tiles-covered-by-a-carpet", "question__hide": false, - "total_acs": 6786, - "total_submitted": 20158, + "total_acs": 6826, + "total_submitted": 20265, "total_column_articles": 105, "frontend_question_id": "2271", "is_new_question": false @@ -24876,8 +25380,8 @@ "question__title": "Number of Ways to Split Array", "question__title_slug": "number-of-ways-to-split-array", "question__hide": false, - "total_acs": 7483, - "total_submitted": 15984, + "total_acs": 7555, + "total_submitted": 16138, "total_column_articles": 85, "frontend_question_id": "2270", "is_new_question": false @@ -24897,8 +25401,8 @@ "question__title": "Count Integers in Intervals", "question__title_slug": "count-integers-in-intervals", "question__hide": false, - "total_acs": 15692, - "total_submitted": 31739, + "total_acs": 15745, + "total_submitted": 31852, "total_column_articles": 147, "frontend_question_id": "2276", "is_new_question": false @@ -24918,9 +25422,9 @@ "question__title": "Largest Combination With Bitwise AND Greater Than Zero", "question__title_slug": "largest-combination-with-bitwise-and-greater-than-zero", "question__hide": false, - "total_acs": 8738, - "total_submitted": 14305, - "total_column_articles": 105, + "total_acs": 8787, + "total_submitted": 14373, + "total_column_articles": 106, "frontend_question_id": "2275", "is_new_question": false }, @@ -24939,8 +25443,8 @@ "question__title": "Maximum Consecutive Floors Without Special Floors", "question__title_slug": "maximum-consecutive-floors-without-special-floors", "question__hide": false, - "total_acs": 10553, - "total_submitted": 20042, + "total_acs": 10629, + "total_submitted": 20183, "total_column_articles": 116, "frontend_question_id": "2274", "is_new_question": false @@ -24960,8 +25464,8 @@ "question__title": "Minimum Health to Beat Game", "question__title_slug": "minimum-health-to-beat-game", "question__hide": false, - "total_acs": 785, - "total_submitted": 1420, + "total_acs": 793, + "total_submitted": 1443, "total_column_articles": 12, "frontend_question_id": "2214", "is_new_question": false @@ -24981,9 +25485,9 @@ "question__title": "Maximum Score of a Node Sequence", "question__title_slug": "maximum-score-of-a-node-sequence", "question__hide": false, - "total_acs": 3643, - "total_submitted": 10378, - "total_column_articles": 48, + "total_acs": 3685, + "total_submitted": 10471, + "total_column_articles": 50, "frontend_question_id": "2242", "is_new_question": false }, @@ -25002,8 +25506,8 @@ "question__title": "Design an ATM Machine", "question__title_slug": "design-an-atm-machine", "question__hide": false, - "total_acs": 7518, - "total_submitted": 20247, + "total_acs": 7567, + "total_submitted": 20367, "total_column_articles": 87, "frontend_question_id": "2241", "is_new_question": false @@ -25023,9 +25527,9 @@ "question__title": "Number of Ways to Buy Pens and Pencils", "question__title_slug": "number-of-ways-to-buy-pens-and-pencils", "question__hide": false, - "total_acs": 34071, - "total_submitted": 54901, - "total_column_articles": 276, + "total_acs": 34203, + "total_submitted": 55134, + "total_column_articles": 282, "frontend_question_id": "2240", "is_new_question": false }, @@ -25044,9 +25548,9 @@ "question__title": "Find Closest Number to Zero", "question__title_slug": "find-closest-number-to-zero", "question__hide": false, - "total_acs": 13565, - "total_submitted": 25417, - "total_column_articles": 158, + "total_acs": 13806, + "total_submitted": 25844, + "total_column_articles": 159, "frontend_question_id": "2239", "is_new_question": false }, @@ -25065,9 +25569,9 @@ "question__title": " Check if There Is a Valid Parentheses String Path", "question__title_slug": "check-if-there-is-a-valid-parentheses-string-path", "question__hide": false, - "total_acs": 8601, - "total_submitted": 22418, - "total_column_articles": 139, + "total_acs": 8663, + "total_submitted": 22534, + "total_column_articles": 140, "frontend_question_id": "2267", "is_new_question": false }, @@ -25086,9 +25590,9 @@ "question__title": "Count Number of Texts", "question__title_slug": "count-number-of-texts", "question__hide": false, - "total_acs": 8307, - "total_submitted": 18887, - "total_column_articles": 142, + "total_acs": 8542, + "total_submitted": 19288, + "total_column_articles": 146, "frontend_question_id": "2266", "is_new_question": false }, @@ -25107,9 +25611,9 @@ "question__title": "Count Nodes Equal to Average of Subtree", "question__title_slug": "count-nodes-equal-to-average-of-subtree", "question__hide": false, - "total_acs": 12213, - "total_submitted": 14783, - "total_column_articles": 216, + "total_acs": 12334, + "total_submitted": 14944, + "total_column_articles": 217, "frontend_question_id": "2265", "is_new_question": false }, @@ -25128,9 +25632,9 @@ "question__title": "Largest 3-Same-Digit Number in String", "question__title_slug": "largest-3-same-digit-number-in-string", "question__hide": false, - "total_acs": 14522, - "total_submitted": 23325, - "total_column_articles": 183, + "total_acs": 14690, + "total_submitted": 23596, + "total_column_articles": 184, "frontend_question_id": "2264", "is_new_question": false }, @@ -25149,9 +25653,9 @@ "question__title": "Minimum Number of Operations to Convert Time", "question__title_slug": "minimum-number-of-operations-to-convert-time", "question__hide": false, - "total_acs": 13629, - "total_submitted": 19581, - "total_column_articles": 177, + "total_acs": 13746, + "total_submitted": 19749, + "total_column_articles": 178, "frontend_question_id": "2224", "is_new_question": false }, @@ -25170,9 +25674,9 @@ "question__title": "Escape the Spreading Fire", "question__title_slug": "escape-the-spreading-fire", "question__hide": false, - "total_acs": 15451, - "total_submitted": 30207, - "total_column_articles": 165, + "total_acs": 15535, + "total_submitted": 30433, + "total_column_articles": 167, "frontend_question_id": "2258", "is_new_question": false }, @@ -25191,9 +25695,9 @@ "question__title": "Count Unguarded Cells in the Grid", "question__title_slug": "count-unguarded-cells-in-the-grid", "question__hide": false, - "total_acs": 5758, - "total_submitted": 10860, - "total_column_articles": 112, + "total_acs": 5809, + "total_submitted": 10957, + "total_column_articles": 114, "frontend_question_id": "2257", "is_new_question": false }, @@ -25212,8 +25716,8 @@ "question__title": "Minimum Average Difference", "question__title_slug": "minimum-average-difference", "question__hide": false, - "total_acs": 7587, - "total_submitted": 20213, + "total_acs": 7671, + "total_submitted": 20410, "total_column_articles": 92, "frontend_question_id": "2256", "is_new_question": false @@ -25233,9 +25737,9 @@ "question__title": "Count Prefixes of a Given String", "question__title_slug": "count-prefixes-of-a-given-string", "question__hide": false, - "total_acs": 11800, - "total_submitted": 15191, - "total_column_articles": 163, + "total_acs": 11941, + "total_submitted": 15381, + "total_column_articles": 166, "frontend_question_id": "2255", "is_new_question": false }, @@ -25254,9 +25758,9 @@ "question__title": "Total Appeal of A String", "question__title_slug": "total-appeal-of-a-string", "question__hide": false, - "total_acs": 7906, - "total_submitted": 13253, - "total_column_articles": 132, + "total_acs": 7957, + "total_submitted": 13377, + "total_column_articles": 135, "frontend_question_id": "2262", "is_new_question": false }, @@ -25275,8 +25779,8 @@ "question__title": "K Divisible Elements Subarrays", "question__title_slug": "k-divisible-elements-subarrays", "question__hide": false, - "total_acs": 9065, - "total_submitted": 16994, + "total_acs": 9110, + "total_submitted": 17065, "total_column_articles": 139, "frontend_question_id": "2261", "is_new_question": false @@ -25296,9 +25800,9 @@ "question__title": "Minimum Consecutive Cards to Pick Up", "question__title_slug": "minimum-consecutive-cards-to-pick-up", "question__hide": false, - "total_acs": 11540, - "total_submitted": 22415, - "total_column_articles": 159, + "total_acs": 11604, + "total_submitted": 22559, + "total_column_articles": 161, "frontend_question_id": "2260", "is_new_question": false }, @@ -25317,9 +25821,9 @@ "question__title": "Remove Digit From Number to Maximize Result", "question__title_slug": "remove-digit-from-number-to-maximize-result", "question__hide": false, - "total_acs": 14451, - "total_submitted": 28578, - "total_column_articles": 175, + "total_acs": 14668, + "total_submitted": 28928, + "total_column_articles": 177, "frontend_question_id": "2259", "is_new_question": false }, @@ -25338,8 +25842,8 @@ "question__title": "The Number of Users That Are Eligible for Discount", "question__title_slug": "the-number-of-users-that-are-eligible-for-discount", "question__hide": false, - "total_acs": 1577, - "total_submitted": 3545, + "total_acs": 1623, + "total_submitted": 3658, "total_column_articles": 16, "frontend_question_id": "2205", "is_new_question": false @@ -25359,8 +25863,8 @@ "question__title": "Finding the Topic of Each Post", "question__title_slug": "finding-the-topic-of-each-post", "question__hide": false, - "total_acs": 1049, - "total_submitted": 1767, + "total_acs": 1082, + "total_submitted": 1841, "total_column_articles": 18, "frontend_question_id": "2199", "is_new_question": false @@ -25380,9 +25884,9 @@ "question__title": "Number of Flowers in Full Bloom", "question__title_slug": "number-of-flowers-in-full-bloom", "question__hide": false, - "total_acs": 21038, - "total_submitted": 40067, - "total_column_articles": 231, + "total_acs": 21094, + "total_submitted": 40155, + "total_column_articles": 233, "frontend_question_id": "2251", "is_new_question": false }, @@ -25401,9 +25905,9 @@ "question__title": "Count Number of Rectangles Containing Each Point", "question__title_slug": "count-number-of-rectangles-containing-each-point", "question__hide": false, - "total_acs": 7146, - "total_submitted": 20129, - "total_column_articles": 122, + "total_acs": 7177, + "total_submitted": 20218, + "total_column_articles": 123, "frontend_question_id": "2250", "is_new_question": false }, @@ -25422,9 +25926,9 @@ "question__title": "Count Lattice Points Inside a Circle", "question__title_slug": "count-lattice-points-inside-a-circle", "question__hide": false, - "total_acs": 10812, - "total_submitted": 19959, - "total_column_articles": 143, + "total_acs": 10901, + "total_submitted": 20078, + "total_column_articles": 144, "frontend_question_id": "2249", "is_new_question": false }, @@ -25443,9 +25947,9 @@ "question__title": "Intersection of Multiple Arrays", "question__title_slug": "intersection-of-multiple-arrays", "question__hide": false, - "total_acs": 17350, - "total_submitted": 25863, - "total_column_articles": 213, + "total_acs": 17618, + "total_submitted": 26250, + "total_column_articles": 216, "frontend_question_id": "2248", "is_new_question": false }, @@ -25464,8 +25968,8 @@ "question__title": "Maximum Total Beauty of the Gardens", "question__title_slug": "maximum-total-beauty-of-the-gardens", "question__hide": false, - "total_acs": 3501, - "total_submitted": 12420, + "total_acs": 3517, + "total_submitted": 12481, "total_column_articles": 76, "frontend_question_id": "2234", "is_new_question": false @@ -25485,8 +25989,8 @@ "question__title": "Maximum Product After K Increments", "question__title_slug": "maximum-product-after-k-increments", "question__hide": false, - "total_acs": 9619, - "total_submitted": 25860, + "total_acs": 9671, + "total_submitted": 25982, "total_column_articles": 178, "frontend_question_id": "2233", "is_new_question": false @@ -25506,8 +26010,8 @@ "question__title": "Minimize Result by Adding Parentheses to Expression", "question__title_slug": "minimize-result-by-adding-parentheses-to-expression", "question__hide": false, - "total_acs": 7918, - "total_submitted": 12841, + "total_acs": 7962, + "total_submitted": 12905, "total_column_articles": 141, "frontend_question_id": "2232", "is_new_question": false @@ -25527,8 +26031,8 @@ "question__title": "Largest Number After Digit Swaps by Parity", "question__title_slug": "largest-number-after-digit-swaps-by-parity", "question__hide": false, - "total_acs": 13116, - "total_submitted": 20336, + "total_acs": 13252, + "total_submitted": 20529, "total_column_articles": 220, "frontend_question_id": "2231", "is_new_question": false @@ -25548,8 +26052,8 @@ "question__title": "Sum of Scores of Built Strings", "question__title_slug": "sum-of-scores-of-built-strings", "question__hide": false, - "total_acs": 4316, - "total_submitted": 10809, + "total_acs": 4362, + "total_submitted": 10904, "total_column_articles": 59, "frontend_question_id": "2223", "is_new_question": false @@ -25569,9 +26073,9 @@ "question__title": "Number of Ways to Select Buildings", "question__title_slug": "number-of-ways-to-select-buildings", "question__hide": false, - "total_acs": 7279, - "total_submitted": 14402, - "total_column_articles": 147, + "total_acs": 7345, + "total_submitted": 14535, + "total_column_articles": 148, "frontend_question_id": "2222", "is_new_question": false }, @@ -25590,9 +26094,9 @@ "question__title": "Find Triangular Sum of an Array", "question__title_slug": "find-triangular-sum-of-an-array", "question__hide": false, - "total_acs": 10777, - "total_submitted": 13613, - "total_column_articles": 128, + "total_acs": 10896, + "total_submitted": 13777, + "total_column_articles": 129, "frontend_question_id": "2221", "is_new_question": false }, @@ -25611,9 +26115,9 @@ "question__title": "Minimum Bit Flips to Convert Number", "question__title_slug": "minimum-bit-flips-to-convert-number", "question__hide": false, - "total_acs": 11852, - "total_submitted": 14336, - "total_column_articles": 173, + "total_acs": 12057, + "total_submitted": 14623, + "total_column_articles": 174, "frontend_question_id": "2220", "is_new_question": false }, @@ -25632,8 +26136,8 @@ "question__title": "Number of Ways to Build Sturdy Brick Wall", "question__title_slug": "number-of-ways-to-build-sturdy-brick-wall", "question__hide": false, - "total_acs": 455, - "total_submitted": 807, + "total_acs": 468, + "total_submitted": 837, "total_column_articles": 20, "frontend_question_id": "2184", "is_new_question": false @@ -25653,8 +26157,8 @@ "question__title": "Minimum Weighted Subgraph With the Required Paths", "question__title_slug": "minimum-weighted-subgraph-with-the-required-paths", "question__hide": false, - "total_acs": 4663, - "total_submitted": 12211, + "total_acs": 4708, + "total_submitted": 12352, "total_column_articles": 75, "frontend_question_id": "2203", "is_new_question": false @@ -25674,8 +26178,8 @@ "question__title": "Find All K-Distant Indices in an Array", "question__title_slug": "find-all-k-distant-indices-in-an-array", "question__hide": false, - "total_acs": 13335, - "total_submitted": 24419, + "total_acs": 13446, + "total_submitted": 24565, "total_column_articles": 159, "frontend_question_id": "2200", "is_new_question": false @@ -25695,8 +26199,8 @@ "question__title": "Longest Substring of One Repeating Character", "question__title_slug": "longest-substring-of-one-repeating-character", "question__hide": false, - "total_acs": 3408, - "total_submitted": 8242, + "total_acs": 3420, + "total_submitted": 8296, "total_column_articles": 87, "frontend_question_id": "2213", "is_new_question": false @@ -25716,9 +26220,9 @@ "question__title": "Maximum Points in an Archery Competition", "question__title_slug": "maximum-points-in-an-archery-competition", "question__hide": false, - "total_acs": 8079, - "total_submitted": 16675, - "total_column_articles": 168, + "total_acs": 8109, + "total_submitted": 16749, + "total_column_articles": 169, "frontend_question_id": "2212", "is_new_question": false }, @@ -25737,9 +26241,9 @@ "question__title": "Count Collisions on a Road", "question__title_slug": "count-collisions-on-a-road", "question__hide": false, - "total_acs": 10722, - "total_submitted": 25725, - "total_column_articles": 153, + "total_acs": 10782, + "total_submitted": 25851, + "total_column_articles": 156, "frontend_question_id": "2211", "is_new_question": false }, @@ -25758,9 +26262,9 @@ "question__title": "Count Hills and Valleys in an Array", "question__title_slug": "count-hills-and-valleys-in-an-array", "question__hide": false, - "total_acs": 13299, - "total_submitted": 22593, - "total_column_articles": 179, + "total_acs": 13410, + "total_submitted": 22771, + "total_column_articles": 180, "frontend_question_id": "2210", "is_new_question": false }, @@ -25779,9 +26283,9 @@ "question__title": "The Change in Global Rankings", "question__title_slug": "the-change-in-global-rankings", "question__hide": false, - "total_acs": 1484, - "total_submitted": 2780, - "total_column_articles": 21, + "total_acs": 1531, + "total_submitted": 2873, + "total_column_articles": 22, "frontend_question_id": "2175", "is_new_question": false }, @@ -25800,8 +26304,8 @@ "question__title": "Remove All Ones With Row and Column Flips II", "question__title_slug": "remove-all-ones-with-row-and-column-flips-ii", "question__hide": false, - "total_acs": 260, - "total_submitted": 394, + "total_acs": 264, + "total_submitted": 413, "total_column_articles": 12, "frontend_question_id": "2174", "is_new_question": false @@ -25821,8 +26325,8 @@ "question__title": "Longest Winning Streak", "question__title_slug": "longest-winning-streak", "question__hide": false, - "total_acs": 1705, - "total_submitted": 3178, + "total_acs": 1754, + "total_submitted": 3265, "total_column_articles": 38, "frontend_question_id": "2173", "is_new_question": false @@ -25842,9 +26346,9 @@ "question__title": "Most Frequent Number Following Key In an Array", "question__title_slug": "most-frequent-number-following-key-in-an-array", "question__hide": false, - "total_acs": 10552, - "total_submitted": 17901, - "total_column_articles": 132, + "total_acs": 10689, + "total_submitted": 18112, + "total_column_articles": 133, "frontend_question_id": "2190", "is_new_question": false }, @@ -25863,9 +26367,9 @@ "question__title": "Minimum White Tiles After Covering With Carpets", "question__title_slug": "minimum-white-tiles-after-covering-with-carpets", "question__hide": false, - "total_acs": 5127, - "total_submitted": 12768, - "total_column_articles": 57, + "total_acs": 5155, + "total_submitted": 12830, + "total_column_articles": 58, "frontend_question_id": "2209", "is_new_question": false }, @@ -25884,9 +26388,9 @@ "question__title": "Minimum Operations to Halve Array Sum", "question__title_slug": "minimum-operations-to-halve-array-sum", "question__hide": false, - "total_acs": 28779, - "total_submitted": 62574, - "total_column_articles": 283, + "total_acs": 29053, + "total_submitted": 63134, + "total_column_articles": 287, "frontend_question_id": "2208", "is_new_question": false }, @@ -25905,9 +26409,9 @@ "question__title": "Maximize Number of Subsequences in a String", "question__title_slug": "maximize-number-of-subsequences-in-a-string", "question__hide": false, - "total_acs": 7491, - "total_submitted": 23310, - "total_column_articles": 114, + "total_acs": 7543, + "total_submitted": 23431, + "total_column_articles": 115, "frontend_question_id": "2207", "is_new_question": false }, @@ -25926,9 +26430,9 @@ "question__title": "Divide Array Into Equal Pairs", "question__title_slug": "divide-array-into-equal-pairs", "question__hide": false, - "total_acs": 16061, - "total_submitted": 22006, - "total_column_articles": 187, + "total_acs": 16317, + "total_submitted": 22353, + "total_column_articles": 188, "frontend_question_id": "2206", "is_new_question": false }, @@ -25947,8 +26451,8 @@ "question__title": "Replace Non-Coprime Numbers in Array", "question__title_slug": "replace-non-coprime-numbers-in-array", "question__hide": false, - "total_acs": 6039, - "total_submitted": 17189, + "total_acs": 6075, + "total_submitted": 17266, "total_column_articles": 93, "frontend_question_id": "2197", "is_new_question": false @@ -25968,9 +26472,9 @@ "question__title": "Create Binary Tree From Descriptions", "question__title_slug": "create-binary-tree-from-descriptions", "question__hide": false, - "total_acs": 10274, - "total_submitted": 14026, - "total_column_articles": 169, + "total_acs": 10353, + "total_submitted": 14158, + "total_column_articles": 171, "frontend_question_id": "2196", "is_new_question": false }, @@ -25989,9 +26493,9 @@ "question__title": "Append K Integers With Minimal Sum", "question__title_slug": "append-k-integers-with-minimal-sum", "question__hide": false, - "total_acs": 12416, - "total_submitted": 50636, - "total_column_articles": 235, + "total_acs": 12466, + "total_submitted": 50814, + "total_column_articles": 236, "frontend_question_id": "2195", "is_new_question": false }, @@ -26010,9 +26514,9 @@ "question__title": "Cells in a Range on an Excel Sheet", "question__title_slug": "cells-in-a-range-on-an-excel-sheet", "question__hide": false, - "total_acs": 15376, - "total_submitted": 18292, - "total_column_articles": 164, + "total_acs": 15505, + "total_submitted": 18450, + "total_column_articles": 165, "frontend_question_id": "2194", "is_new_question": false }, @@ -26031,8 +26535,8 @@ "question__title": "Unique Substrings With Equal Digit Frequency", "question__title_slug": "unique-substrings-with-equal-digit-frequency", "question__hide": false, - "total_acs": 594, - "total_submitted": 934, + "total_acs": 610, + "total_submitted": 973, "total_column_articles": 17, "frontend_question_id": "2168", "is_new_question": false @@ -26052,9 +26556,9 @@ "question__title": "Order Two Columns Independently", "question__title_slug": "order-two-columns-independently", "question__hide": false, - "total_acs": 1667, - "total_submitted": 2681, - "total_column_articles": 13, + "total_acs": 1706, + "total_submitted": 2754, + "total_column_articles": 14, "frontend_question_id": "2159", "is_new_question": false }, @@ -26073,9 +26577,9 @@ "question__title": "Count Array Pairs Divisible by K", "question__title_slug": "count-array-pairs-divisible-by-k", "question__hide": false, - "total_acs": 5269, - "total_submitted": 18336, - "total_column_articles": 60, + "total_acs": 5302, + "total_submitted": 18422, + "total_column_articles": 61, "frontend_question_id": "2183", "is_new_question": false }, @@ -26094,9 +26598,9 @@ "question__title": "Construct String With Repeat Limit", "question__title_slug": "construct-string-with-repeat-limit", "question__hide": false, - "total_acs": 22078, - "total_submitted": 36475, - "total_column_articles": 317, + "total_acs": 22189, + "total_submitted": 36670, + "total_column_articles": 318, "frontend_question_id": "2182", "is_new_question": false }, @@ -26115,9 +26619,9 @@ "question__title": "Merge Nodes in Between Zeros", "question__title_slug": "merge-nodes-in-between-zeros", "question__hide": false, - "total_acs": 16717, - "total_submitted": 19866, - "total_column_articles": 236, + "total_acs": 16871, + "total_submitted": 20051, + "total_column_articles": 237, "frontend_question_id": "2181", "is_new_question": false }, @@ -26136,8 +26640,8 @@ "question__title": "Count Integers With Even Digit Sum", "question__title_slug": "count-integers-with-even-digit-sum", "question__hide": false, - "total_acs": 36321, - "total_submitted": 53663, + "total_acs": 36483, + "total_submitted": 53919, "total_column_articles": 404, "frontend_question_id": "2180", "is_new_question": false @@ -26157,8 +26661,8 @@ "question__title": "Amount of New Area Painted Each Day", "question__title_slug": "amount-of-new-area-painted-each-day", "question__hide": false, - "total_acs": 723, - "total_submitted": 1287, + "total_acs": 743, + "total_submitted": 1323, "total_column_articles": 23, "frontend_question_id": "2158", "is_new_question": false @@ -26178,8 +26682,8 @@ "question__title": "The Number of Passengers in Each Bus II", "question__title_slug": "the-number-of-passengers-in-each-bus-ii", "question__hide": false, - "total_acs": 872, - "total_submitted": 2001, + "total_acs": 896, + "total_submitted": 2053, "total_column_articles": 15, "frontend_question_id": "2153", "is_new_question": false @@ -26199,9 +26703,9 @@ "question__title": "Minimum Time to Finish the Race", "question__title_slug": "minimum-time-to-finish-the-race", "question__hide": false, - "total_acs": 4793, - "total_submitted": 10741, - "total_column_articles": 72, + "total_acs": 4833, + "total_submitted": 10880, + "total_column_articles": 73, "frontend_question_id": "2188", "is_new_question": false }, @@ -26220,9 +26724,9 @@ "question__title": "Minimum Time to Complete Trips", "question__title_slug": "minimum-time-to-complete-trips", "question__hide": false, - "total_acs": 15144, - "total_submitted": 51068, - "total_column_articles": 171, + "total_acs": 15575, + "total_submitted": 52134, + "total_column_articles": 173, "frontend_question_id": "2187", "is_new_question": false }, @@ -26241,9 +26745,9 @@ "question__title": "Minimum Number of Steps to Make Two Strings Anagram II", "question__title_slug": "minimum-number-of-steps-to-make-two-strings-anagram-ii", "question__hide": false, - "total_acs": 11346, - "total_submitted": 15554, - "total_column_articles": 131, + "total_acs": 11412, + "total_submitted": 15639, + "total_column_articles": 132, "frontend_question_id": "2186", "is_new_question": false }, @@ -26262,9 +26766,9 @@ "question__title": "Counting Words With a Given Prefix", "question__title_slug": "counting-words-with-a-given-prefix", "question__hide": false, - "total_acs": 38825, - "total_submitted": 47699, - "total_column_articles": 410, + "total_acs": 39098, + "total_submitted": 48031, + "total_column_articles": 411, "frontend_question_id": "2185", "is_new_question": false }, @@ -26283,9 +26787,9 @@ "question__title": "Maximum AND Sum of Array", "question__title_slug": "maximum-and-sum-of-array", "question__hide": false, - "total_acs": 5386, - "total_submitted": 10316, - "total_column_articles": 86, + "total_acs": 5432, + "total_submitted": 10419, + "total_column_articles": 87, "frontend_question_id": "2172", "is_new_question": false }, @@ -26304,9 +26808,9 @@ "question__title": "Removing Minimum Number of Magic Beans", "question__title_slug": "removing-minimum-number-of-magic-beans", "question__hide": false, - "total_acs": 29077, - "total_submitted": 60151, - "total_column_articles": 387, + "total_acs": 29234, + "total_submitted": 60474, + "total_column_articles": 390, "frontend_question_id": "2171", "is_new_question": false }, @@ -26325,8 +26829,8 @@ "question__title": "Minimum Operations to Make the Array Alternating", "question__title_slug": "minimum-operations-to-make-the-array-alternating", "question__hide": false, - "total_acs": 10117, - "total_submitted": 32056, + "total_acs": 10168, + "total_submitted": 32191, "total_column_articles": 167, "frontend_question_id": "2170", "is_new_question": false @@ -26346,9 +26850,9 @@ "question__title": "Count Operations to Obtain Zero", "question__title_slug": "count-operations-to-obtain-zero", "question__hide": false, - "total_acs": 19503, - "total_submitted": 26692, - "total_column_articles": 166, + "total_acs": 19758, + "total_submitted": 27030, + "total_column_articles": 168, "frontend_question_id": "2169", "is_new_question": false }, @@ -26367,8 +26871,8 @@ "question__title": "Minimum Number of Lines to Cover Points", "question__title_slug": "minimum-number-of-lines-to-cover-points", "question__hide": false, - "total_acs": 504, - "total_submitted": 973, + "total_acs": 508, + "total_submitted": 994, "total_column_articles": 19, "frontend_question_id": "2152", "is_new_question": false @@ -26388,9 +26892,9 @@ "question__title": "Minimum Time to Remove All Cars Containing Illegal Goods", "question__title_slug": "minimum-time-to-remove-all-cars-containing-illegal-goods", "question__hide": false, - "total_acs": 5292, - "total_submitted": 10564, - "total_column_articles": 86, + "total_acs": 5327, + "total_submitted": 10646, + "total_column_articles": 87, "frontend_question_id": "2167", "is_new_question": false }, @@ -26409,8 +26913,8 @@ "question__title": "Design Bitset", "question__title_slug": "design-bitset", "question__hide": false, - "total_acs": 6982, - "total_submitted": 22154, + "total_acs": 7132, + "total_submitted": 22658, "total_column_articles": 167, "frontend_question_id": "2166", "is_new_question": false @@ -26430,8 +26934,8 @@ "question__title": "Smallest Value of the Rearranged Number", "question__title_slug": "smallest-value-of-the-rearranged-number", "question__hide": false, - "total_acs": 8922, - "total_submitted": 16087, + "total_acs": 8997, + "total_submitted": 16267, "total_column_articles": 143, "frontend_question_id": "2165", "is_new_question": false @@ -26451,9 +26955,9 @@ "question__title": "Sort Even and Odd Indices Independently", "question__title_slug": "sort-even-and-odd-indices-independently", "question__hide": false, - "total_acs": 12663, - "total_submitted": 18712, - "total_column_articles": 161, + "total_acs": 12851, + "total_submitted": 19006, + "total_column_articles": 162, "frontend_question_id": "2164", "is_new_question": false }, @@ -26472,8 +26976,8 @@ "question__title": "Choose Numbers From Two Arrays in Range", "question__title_slug": "choose-numbers-from-two-arrays-in-range", "question__hide": false, - "total_acs": 288, - "total_submitted": 546, + "total_acs": 291, + "total_submitted": 568, "total_column_articles": 14, "frontend_question_id": "2143", "is_new_question": false @@ -26493,9 +26997,9 @@ "question__title": "The Number of Passengers in Each Bus I", "question__title_slug": "the-number-of-passengers-in-each-bus-i", "question__hide": false, - "total_acs": 1780, - "total_submitted": 3865, - "total_column_articles": 28, + "total_acs": 1827, + "total_submitted": 3974, + "total_column_articles": 29, "frontend_question_id": "2142", "is_new_question": false }, @@ -26514,9 +27018,9 @@ "question__title": "Count Good Triplets in an Array", "question__title_slug": "count-good-triplets-in-an-array", "question__hide": false, - "total_acs": 3774, - "total_submitted": 9787, - "total_column_articles": 84, + "total_acs": 3795, + "total_submitted": 9844, + "total_column_articles": 85, "frontend_question_id": "2179", "is_new_question": false }, @@ -26535,9 +27039,9 @@ "question__title": "Maximum Split of Positive Even Integers", "question__title_slug": "maximum-split-of-positive-even-integers", "question__hide": false, - "total_acs": 29566, - "total_submitted": 46140, - "total_column_articles": 331, + "total_acs": 29607, + "total_submitted": 46204, + "total_column_articles": 332, "frontend_question_id": "2178", "is_new_question": false }, @@ -26556,9 +27060,9 @@ "question__title": "Find Three Consecutive Integers That Sum to a Given Number", "question__title_slug": "find-three-consecutive-integers-that-sum-to-a-given-number", "question__hide": false, - "total_acs": 10013, - "total_submitted": 14231, - "total_column_articles": 107, + "total_acs": 10118, + "total_submitted": 14374, + "total_column_articles": 108, "frontend_question_id": "2177", "is_new_question": false }, @@ -26577,9 +27081,9 @@ "question__title": "Count Equal and Divisible Pairs in an Array", "question__title_slug": "count-equal-and-divisible-pairs-in-an-array", "question__hide": false, - "total_acs": 12270, - "total_submitted": 15576, - "total_column_articles": 132, + "total_acs": 12486, + "total_submitted": 15837, + "total_column_articles": 133, "frontend_question_id": "2176", "is_new_question": false }, @@ -26598,9 +27102,9 @@ "question__title": "Groups of Strings", "question__title_slug": "groups-of-strings", "question__hide": false, - "total_acs": 3873, - "total_submitted": 12228, - "total_column_articles": 81, + "total_acs": 3891, + "total_submitted": 12306, + "total_column_articles": 82, "frontend_question_id": "2157", "is_new_question": false }, @@ -26619,9 +27123,9 @@ "question__title": "Find Substring With Given Hash Value", "question__title_slug": "find-substring-with-given-hash-value", "question__hide": false, - "total_acs": 6468, - "total_submitted": 24796, - "total_column_articles": 105, + "total_acs": 6540, + "total_submitted": 25039, + "total_column_articles": 107, "frontend_question_id": "2156", "is_new_question": false }, @@ -26640,9 +27144,9 @@ "question__title": "Keep Multiplying Found Values by Two", "question__title_slug": "keep-multiplying-found-values-by-two", "question__hide": false, - "total_acs": 18907, - "total_submitted": 25835, - "total_column_articles": 213, + "total_acs": 19225, + "total_submitted": 26274, + "total_column_articles": 214, "frontend_question_id": "2154", "is_new_question": false }, @@ -26661,8 +27165,8 @@ "question__title": "Pour Water Between Buckets to Make Water Levels Equal", "question__title_slug": "pour-water-between-buckets-to-make-water-levels-equal", "question__hide": false, - "total_acs": 507, - "total_submitted": 785, + "total_acs": 519, + "total_submitted": 805, "total_column_articles": 15, "frontend_question_id": "2137", "is_new_question": false @@ -26682,8 +27186,8 @@ "question__title": "Maximum Good People Based on Statements", "question__title_slug": "maximum-good-people-based-on-statements", "question__hide": false, - "total_acs": 5710, - "total_submitted": 11183, + "total_acs": 5758, + "total_submitted": 11269, "total_column_articles": 102, "frontend_question_id": "2151", "is_new_question": false @@ -26703,9 +27207,9 @@ "question__title": "Rearrange Array Elements by Sign", "question__title_slug": "rearrange-array-elements-by-sign", "question__hide": false, - "total_acs": 13290, - "total_submitted": 16637, - "total_column_articles": 144, + "total_acs": 13426, + "total_submitted": 16803, + "total_column_articles": 145, "frontend_question_id": "2149", "is_new_question": false }, @@ -26724,8 +27228,8 @@ "question__title": "Find All Lonely Numbers in the Array", "question__title_slug": "find-all-lonely-numbers-in-the-array", "question__hide": false, - "total_acs": 10423, - "total_submitted": 17483, + "total_acs": 10578, + "total_submitted": 17742, "total_column_articles": 125, "frontend_question_id": "2150", "is_new_question": false @@ -26745,9 +27249,9 @@ "question__title": "Count Elements With Strictly Smaller and Greater Elements ", "question__title_slug": "count-elements-with-strictly-smaller-and-greater-elements", "question__hide": false, - "total_acs": 14878, - "total_submitted": 25942, - "total_column_articles": 193, + "total_acs": 15281, + "total_submitted": 26708, + "total_column_articles": 195, "frontend_question_id": "2148", "is_new_question": false }, @@ -26766,8 +27270,8 @@ "question__title": "Remove All Ones With Row and Column Flips", "question__title_slug": "remove-all-ones-with-row-and-column-flips", "question__hide": false, - "total_acs": 642, - "total_submitted": 862, + "total_acs": 650, + "total_submitted": 884, "total_column_articles": 17, "frontend_question_id": "2128", "is_new_question": false @@ -26787,9 +27291,9 @@ "question__title": "Minimum Difference in Sums After Removal of Elements", "question__title_slug": "minimum-difference-in-sums-after-removal-of-elements", "question__hide": false, - "total_acs": 3622, - "total_submitted": 7274, - "total_column_articles": 65, + "total_acs": 3640, + "total_submitted": 7323, + "total_column_articles": 67, "frontend_question_id": "2163", "is_new_question": false }, @@ -26808,8 +27312,8 @@ "question__title": "Minimum Cost to Set Cooking Time", "question__title_slug": "minimum-cost-to-set-cooking-time", "question__hide": false, - "total_acs": 3763, - "total_submitted": 10737, + "total_acs": 3780, + "total_submitted": 10790, "total_column_articles": 83, "frontend_question_id": "2162", "is_new_question": false @@ -26829,9 +27333,9 @@ "question__title": "Partition Array According to Given Pivot", "question__title_slug": "partition-array-according-to-given-pivot", "question__hide": false, - "total_acs": 9400, - "total_submitted": 11414, - "total_column_articles": 127, + "total_acs": 9501, + "total_submitted": 11536, + "total_column_articles": 130, "frontend_question_id": "2161", "is_new_question": false }, @@ -26850,9 +27354,9 @@ "question__title": "Minimum Sum of Four Digit Number After Splitting Digits", "question__title_slug": "minimum-sum-of-four-digit-number-after-splitting-digits", "question__hide": false, - "total_acs": 16706, - "total_submitted": 19966, - "total_column_articles": 249, + "total_acs": 16982, + "total_submitted": 20322, + "total_column_articles": 253, "frontend_question_id": "2160", "is_new_question": false }, @@ -26871,8 +27375,8 @@ "question__title": "Maximum Running Time of N Computers", "question__title_slug": "maximum-running-time-of-n-computers", "question__hide": false, - "total_acs": 6775, - "total_submitted": 16334, + "total_acs": 6915, + "total_submitted": 16647, "total_column_articles": 87, "frontend_question_id": "2141", "is_new_question": false @@ -26892,9 +27396,9 @@ "question__title": "Solving Questions With Brainpower", "question__title_slug": "solving-questions-with-brainpower", "question__hide": false, - "total_acs": 13297, - "total_submitted": 29761, - "total_column_articles": 197, + "total_acs": 13846, + "total_submitted": 31106, + "total_column_articles": 199, "frontend_question_id": "2140", "is_new_question": false }, @@ -26913,9 +27417,9 @@ "question__title": "All Divisions With the Highest Score of a Binary Array", "question__title_slug": "all-divisions-with-the-highest-score-of-a-binary-array", "question__hide": false, - "total_acs": 8838, - "total_submitted": 13603, - "total_column_articles": 122, + "total_acs": 8876, + "total_submitted": 13660, + "total_column_articles": 124, "frontend_question_id": "2155", "is_new_question": false }, @@ -26934,9 +27438,9 @@ "question__title": "Divide a String Into Groups of Size k", "question__title_slug": "divide-a-string-into-groups-of-size-k", "question__hide": false, - "total_acs": 11789, - "total_submitted": 17695, - "total_column_articles": 174, + "total_acs": 11916, + "total_submitted": 17864, + "total_column_articles": 176, "frontend_question_id": "2138", "is_new_question": false }, @@ -26955,8 +27459,8 @@ "question__title": "Minimum Operations to Remove Adjacent Ones in Matrix", "question__title_slug": "minimum-operations-to-remove-adjacent-ones-in-matrix", "question__hide": false, - "total_acs": 352, - "total_submitted": 671, + "total_acs": 355, + "total_submitted": 701, "total_column_articles": 8, "frontend_question_id": "2123", "is_new_question": false @@ -26976,9 +27480,9 @@ "question__title": "Elements in Array After Removing and Replacing Elements", "question__title_slug": "elements-in-array-after-removing-and-replacing-elements", "question__hide": false, - "total_acs": 349, - "total_submitted": 565, - "total_column_articles": 14, + "total_acs": 372, + "total_submitted": 604, + "total_column_articles": 15, "frontend_question_id": "2113", "is_new_question": false }, @@ -26997,9 +27501,9 @@ "question__title": "Earliest Possible Day of Full Bloom", "question__title_slug": "earliest-possible-day-of-full-bloom", "question__hide": false, - "total_acs": 14888, - "total_submitted": 20632, - "total_column_articles": 156, + "total_acs": 14921, + "total_submitted": 20705, + "total_column_articles": 157, "frontend_question_id": "2136", "is_new_question": false }, @@ -27018,8 +27522,8 @@ "question__title": "Count Words Obtained After Adding a Letter", "question__title_slug": "count-words-obtained-after-adding-a-letter", "question__hide": false, - "total_acs": 5888, - "total_submitted": 15993, + "total_acs": 5916, + "total_submitted": 16061, "total_column_articles": 105, "frontend_question_id": "2135", "is_new_question": false @@ -27039,9 +27543,9 @@ "question__title": "Minimum Swaps to Group All 1's Together II", "question__title_slug": "minimum-swaps-to-group-all-1s-together-ii", "question__hide": false, - "total_acs": 8866, - "total_submitted": 17610, - "total_column_articles": 188, + "total_acs": 9047, + "total_submitted": 17912, + "total_column_articles": 191, "frontend_question_id": "2134", "is_new_question": false }, @@ -27060,8 +27564,8 @@ "question__title": "Check if Every Row and Column Contains All Numbers", "question__title_slug": "check-if-every-row-and-column-contains-all-numbers", "question__hide": false, - "total_acs": 12140, - "total_submitted": 21739, + "total_acs": 12291, + "total_submitted": 21971, "total_column_articles": 172, "frontend_question_id": "2133", "is_new_question": false @@ -27081,8 +27585,8 @@ "question__title": "Build the Equation", "question__title_slug": "build-the-equation", "question__hide": false, - "total_acs": 1046, - "total_submitted": 1881, + "total_acs": 1058, + "total_submitted": 1898, "total_column_articles": 17, "frontend_question_id": "2118", "is_new_question": false @@ -27102,9 +27606,9 @@ "question__title": "The Airport With the Most Traffic", "question__title_slug": "the-airport-with-the-most-traffic", "question__hide": false, - "total_acs": 1825, - "total_submitted": 2744, - "total_column_articles": 27, + "total_acs": 1890, + "total_submitted": 2862, + "total_column_articles": 29, "frontend_question_id": "2112", "is_new_question": false }, @@ -27123,9 +27627,9 @@ "question__title": "Number of Ways to Divide a Long Corridor", "question__title_slug": "number-of-ways-to-divide-a-long-corridor", "question__hide": false, - "total_acs": 4598, - "total_submitted": 10728, - "total_column_articles": 95, + "total_acs": 4631, + "total_submitted": 10801, + "total_column_articles": 97, "frontend_question_id": "2147", "is_new_question": false }, @@ -27144,9 +27648,9 @@ "question__title": "K Highest Ranked Items Within a Price Range", "question__title_slug": "k-highest-ranked-items-within-a-price-range", "question__hide": false, - "total_acs": 4802, - "total_submitted": 11619, - "total_column_articles": 100, + "total_acs": 4844, + "total_submitted": 11724, + "total_column_articles": 101, "frontend_question_id": "2146", "is_new_question": false }, @@ -27165,9 +27669,9 @@ "question__title": "Count the Hidden Sequences", "question__title_slug": "count-the-hidden-sequences", "question__hide": false, - "total_acs": 6064, - "total_submitted": 16581, - "total_column_articles": 124, + "total_acs": 6111, + "total_submitted": 16695, + "total_column_articles": 125, "frontend_question_id": "2145", "is_new_question": false }, @@ -27186,9 +27690,9 @@ "question__title": "Minimum Cost of Buying Candies With Discount", "question__title_slug": "minimum-cost-of-buying-candies-with-discount", "question__hide": false, - "total_acs": 12153, - "total_submitted": 18204, - "total_column_articles": 195, + "total_acs": 12380, + "total_submitted": 18515, + "total_column_articles": 202, "frontend_question_id": "2144", "is_new_question": false }, @@ -27207,9 +27711,9 @@ "question__title": "Number of Unique Flavors After Sharing K Candies", "question__title_slug": "number-of-unique-flavors-after-sharing-k-candies", "question__hide": false, - "total_acs": 579, - "total_submitted": 1436, - "total_column_articles": 14, + "total_acs": 591, + "total_submitted": 1467, + "total_column_articles": 15, "frontend_question_id": "2107", "is_new_question": false }, @@ -27228,9 +27732,9 @@ "question__title": "Maximum Employees to Be Invited to a Meeting", "question__title_slug": "maximum-employees-to-be-invited-to-a-meeting", "question__hide": false, - "total_acs": 15704, - "total_submitted": 29672, - "total_column_articles": 118, + "total_acs": 15805, + "total_submitted": 29910, + "total_column_articles": 119, "frontend_question_id": "2127", "is_new_question": false }, @@ -27249,8 +27753,8 @@ "question__title": "Destroying Asteroids", "question__title_slug": "destroying-asteroids", "question__hide": false, - "total_acs": 9896, - "total_submitted": 19993, + "total_acs": 9992, + "total_submitted": 20183, "total_column_articles": 120, "frontend_question_id": "2126", "is_new_question": false @@ -27270,9 +27774,9 @@ "question__title": "Number of Laser Beams in a Bank", "question__title_slug": "number-of-laser-beams-in-a-bank", "question__hide": false, - "total_acs": 11328, - "total_submitted": 13713, - "total_column_articles": 140, + "total_acs": 11437, + "total_submitted": 13836, + "total_column_articles": 141, "frontend_question_id": "2125", "is_new_question": false }, @@ -27291,9 +27795,9 @@ "question__title": "Check if All A's Appears Before All B's", "question__title_slug": "check-if-all-as-appears-before-all-bs", "question__hide": false, - "total_acs": 14938, - "total_submitted": 21670, - "total_column_articles": 255, + "total_acs": 15230, + "total_submitted": 22110, + "total_column_articles": 261, "frontend_question_id": "2124", "is_new_question": false }, @@ -27312,8 +27816,8 @@ "question__title": "Subsequence of Size K With the Largest Even Sum", "question__title_slug": "subsequence-of-size-k-with-the-largest-even-sum", "question__hide": false, - "total_acs": 426, - "total_submitted": 1209, + "total_acs": 433, + "total_submitted": 1240, "total_column_articles": 14, "frontend_question_id": "2098", "is_new_question": false @@ -27333,8 +27837,8 @@ "question__title": "Recover the Original Array", "question__title_slug": "recover-the-original-array", "question__hide": false, - "total_acs": 4384, - "total_submitted": 10307, + "total_acs": 4401, + "total_submitted": 10353, "total_column_articles": 71, "frontend_question_id": "2122", "is_new_question": false @@ -27354,8 +27858,8 @@ "question__title": "Intervals Between Identical Elements", "question__title_slug": "intervals-between-identical-elements", "question__hide": false, - "total_acs": 7303, - "total_submitted": 18618, + "total_acs": 7343, + "total_submitted": 18710, "total_column_articles": 165, "frontend_question_id": "2121", "is_new_question": false @@ -27375,8 +27879,8 @@ "question__title": "Execution of All Suffix Instructions Staying in a Grid", "question__title_slug": "execution-of-all-suffix-instructions-staying-in-a-grid", "question__hide": false, - "total_acs": 8790, - "total_submitted": 10630, + "total_acs": 8865, + "total_submitted": 10751, "total_column_articles": 129, "frontend_question_id": "2120", "is_new_question": false @@ -27396,9 +27900,9 @@ "question__title": "A Number After a Double Reversal", "question__title_slug": "a-number-after-a-double-reversal", "question__hide": false, - "total_acs": 23483, - "total_submitted": 31889, - "total_column_articles": 242, + "total_acs": 24050, + "total_submitted": 32593, + "total_column_articles": 246, "frontend_question_id": "2119", "is_new_question": false }, @@ -27417,9 +27921,9 @@ "question__title": "Longest Palindrome by Concatenating Two Letter Words", "question__title_slug": "longest-palindrome-by-concatenating-two-letter-words", "question__hide": false, - "total_acs": 10830, - "total_submitted": 25043, - "total_column_articles": 157, + "total_acs": 10897, + "total_submitted": 25228, + "total_column_articles": 159, "frontend_question_id": "2131", "is_new_question": false }, @@ -27438,9 +27942,9 @@ "question__title": "Maximum Twin Sum of a Linked List", "question__title_slug": "maximum-twin-sum-of-a-linked-list", "question__hide": false, - "total_acs": 20985, - "total_submitted": 26738, - "total_column_articles": 278, + "total_acs": 21744, + "total_submitted": 27721, + "total_column_articles": 286, "frontend_question_id": "2130", "is_new_question": false }, @@ -27459,9 +27963,9 @@ "question__title": "Capitalize the Title", "question__title_slug": "capitalize-the-title", "question__hide": false, - "total_acs": 10633, - "total_submitted": 17342, - "total_column_articles": 174, + "total_acs": 34254, + "total_submitted": 48525, + "total_column_articles": 328, "frontend_question_id": "2129", "is_new_question": false }, @@ -27480,9 +27984,9 @@ "question__title": "Minimum Operations to Make the Array K-Increasing", "question__title_slug": "minimum-operations-to-make-the-array-k-increasing", "question__hide": false, - "total_acs": 5026, - "total_submitted": 13980, - "total_column_articles": 101, + "total_acs": 5084, + "total_submitted": 14115, + "total_column_articles": 102, "frontend_question_id": "2111", "is_new_question": false }, @@ -27501,9 +28005,9 @@ "question__title": "Number of Smooth Descent Periods of a Stock", "question__title_slug": "number-of-smooth-descent-periods-of-a-stock", "question__hide": false, - "total_acs": 11530, - "total_submitted": 21377, - "total_column_articles": 181, + "total_acs": 11639, + "total_submitted": 21564, + "total_column_articles": 184, "frontend_question_id": "2110", "is_new_question": false }, @@ -27522,9 +28026,9 @@ "question__title": "Adding Spaces to a String", "question__title_slug": "adding-spaces-to-a-string", "question__hide": false, - "total_acs": 11074, - "total_submitted": 18018, - "total_column_articles": 129, + "total_acs": 11246, + "total_submitted": 18281, + "total_column_articles": 131, "frontend_question_id": "2109", "is_new_question": false }, @@ -27543,9 +28047,9 @@ "question__title": "Find First Palindromic String in the Array", "question__title_slug": "find-first-palindromic-string-in-the-array", "question__hide": false, - "total_acs": 16289, - "total_submitted": 20887, - "total_column_articles": 232, + "total_acs": 16551, + "total_submitted": 21236, + "total_column_articles": 230, "frontend_question_id": "2108", "is_new_question": false }, @@ -27564,8 +28068,8 @@ "question__title": "Minimum Cost to Reach City With Discounts", "question__title_slug": "minimum-cost-to-reach-city-with-discounts", "question__hide": false, - "total_acs": 628, - "total_submitted": 1114, + "total_acs": 659, + "total_submitted": 1166, "total_column_articles": 25, "frontend_question_id": "2093", "is_new_question": false @@ -27585,9 +28089,9 @@ "question__title": "Maximum Fruits Harvested After at Most K Steps", "question__title_slug": "maximum-fruits-harvested-after-at-most-k-steps", "question__hide": false, - "total_acs": 18151, - "total_submitted": 40208, - "total_column_articles": 207, + "total_acs": 18214, + "total_submitted": 40378, + "total_column_articles": 208, "frontend_question_id": "2106", "is_new_question": false }, @@ -27606,9 +28110,9 @@ "question__title": "Watering Plants II", "question__title_slug": "watering-plants-ii", "question__hide": false, - "total_acs": 9622, - "total_submitted": 18188, - "total_column_articles": 146, + "total_acs": 9682, + "total_submitted": 18318, + "total_column_articles": 148, "frontend_question_id": "2105", "is_new_question": false }, @@ -27627,9 +28131,9 @@ "question__title": "Sum of Subarray Ranges", "question__title_slug": "sum-of-subarray-ranges", "question__hide": false, - "total_acs": 43415, - "total_submitted": 68726, - "total_column_articles": 416, + "total_acs": 43563, + "total_submitted": 68947, + "total_column_articles": 414, "frontend_question_id": "2104", "is_new_question": false }, @@ -27648,9 +28152,9 @@ "question__title": "Rings and Rods", "question__title_slug": "rings-and-rods", "question__hide": false, - "total_acs": 36238, - "total_submitted": 44274, - "total_column_articles": 458, + "total_acs": 36534, + "total_submitted": 44675, + "total_column_articles": 460, "frontend_question_id": "2103", "is_new_question": false }, @@ -27669,9 +28173,9 @@ "question__title": "Substrings That Begin and End With the Same Letter", "question__title_slug": "substrings-that-begin-and-end-with-the-same-letter", "question__hide": false, - "total_acs": 565, - "total_submitted": 925, - "total_column_articles": 16, + "total_acs": 576, + "total_submitted": 950, + "total_column_articles": 17, "frontend_question_id": "2083", "is_new_question": false }, @@ -27690,9 +28194,9 @@ "question__title": "Drop Type 1 Orders for Customers With Type 0 Orders", "question__title_slug": "drop-type-1-orders-for-customers-with-type-0-orders", "question__hide": false, - "total_acs": 2664, - "total_submitted": 3288, - "total_column_articles": 52, + "total_acs": 2730, + "total_submitted": 3370, + "total_column_articles": 55, "frontend_question_id": "2084", "is_new_question": false }, @@ -27711,8 +28215,8 @@ "question__title": "The Number of Rich Customers", "question__title_slug": "the-number-of-rich-customers", "question__hide": false, - "total_acs": 5890, - "total_submitted": 7852, + "total_acs": 5976, + "total_submitted": 7977, "total_column_articles": 44, "frontend_question_id": "2082", "is_new_question": false @@ -27732,8 +28236,8 @@ "question__title": "Abbreviating the Product of a Range", "question__title_slug": "abbreviating-the-product-of-a-range", "question__hide": false, - "total_acs": 1726, - "total_submitted": 5731, + "total_acs": 1732, + "total_submitted": 5772, "total_column_articles": 30, "frontend_question_id": "2117", "is_new_question": false @@ -27753,8 +28257,8 @@ "question__title": "Check if a Parentheses String Can Be Valid", "question__title_slug": "check-if-a-parentheses-string-can-be-valid", "question__hide": false, - "total_acs": 4586, - "total_submitted": 14325, + "total_acs": 4633, + "total_submitted": 14465, "total_column_articles": 76, "frontend_question_id": "2116", "is_new_question": false @@ -27774,8 +28278,8 @@ "question__title": "Find All Possible Recipes from Given Supplies", "question__title_slug": "find-all-possible-recipes-from-given-supplies", "question__hide": false, - "total_acs": 6871, - "total_submitted": 15756, + "total_acs": 7054, + "total_submitted": 16029, "total_column_articles": 131, "frontend_question_id": "2115", "is_new_question": false @@ -27795,9 +28299,9 @@ "question__title": "Maximum Number of Words Found in Sentences", "question__title_slug": "maximum-number-of-words-found-in-sentences", "question__hide": false, - "total_acs": 21987, - "total_submitted": 26069, - "total_column_articles": 287, + "total_acs": 22297, + "total_submitted": 26465, + "total_column_articles": 288, "frontend_question_id": "2114", "is_new_question": false }, @@ -27816,8 +28320,8 @@ "question__title": "Paths in Maze That Lead to Same Room", "question__title_slug": "paths-in-maze-that-lead-to-same-room", "question__hide": false, - "total_acs": 315, - "total_submitted": 508, + "total_acs": 322, + "total_submitted": 531, "total_column_articles": 12, "frontend_question_id": "2077", "is_new_question": false @@ -27837,9 +28341,9 @@ "question__title": "Step-By-Step Directions From a Binary Tree Node to Another", "question__title_slug": "step-by-step-directions-from-a-binary-tree-node-to-another", "question__hide": false, - "total_acs": 9088, - "total_submitted": 20025, - "total_column_articles": 230, + "total_acs": 9251, + "total_submitted": 20326, + "total_column_articles": 231, "frontend_question_id": "2096", "is_new_question": false }, @@ -27858,9 +28362,9 @@ "question__title": "Delete the Middle Node of a Linked List", "question__title_slug": "delete-the-middle-node-of-a-linked-list", "question__hide": false, - "total_acs": 30992, - "total_submitted": 53219, - "total_column_articles": 312, + "total_acs": 32099, + "total_submitted": 55139, + "total_column_articles": 321, "frontend_question_id": "2095", "is_new_question": false }, @@ -27879,8 +28383,8 @@ "question__title": "Finding 3-Digit Even Numbers", "question__title_slug": "finding-3-digit-even-numbers", "question__hide": false, - "total_acs": 13577, - "total_submitted": 24061, + "total_acs": 13779, + "total_submitted": 24409, "total_column_articles": 201, "frontend_question_id": "2094", "is_new_question": false @@ -27900,9 +28404,9 @@ "question__title": "The Winner University", "question__title_slug": "the-winner-university", "question__hide": false, - "total_acs": 2947, - "total_submitted": 4320, - "total_column_articles": 36, + "total_acs": 3012, + "total_submitted": 4411, + "total_column_articles": 37, "frontend_question_id": "2072", "is_new_question": false }, @@ -27921,8 +28425,8 @@ "question__title": "Find All People With Secret", "question__title_slug": "find-all-people-with-secret", "question__hide": false, - "total_acs": 7046, - "total_submitted": 23259, + "total_acs": 7211, + "total_submitted": 23719, "total_column_articles": 137, "frontend_question_id": "2092", "is_new_question": false @@ -27942,8 +28446,8 @@ "question__title": "Removing Minimum and Maximum From Array", "question__title_slug": "removing-minimum-and-maximum-from-array", "question__hide": false, - "total_acs": 9328, - "total_submitted": 16416, + "total_acs": 9417, + "total_submitted": 16570, "total_column_articles": 156, "frontend_question_id": "2091", "is_new_question": false @@ -27963,9 +28467,9 @@ "question__title": "K Radius Subarray Averages", "question__title_slug": "k-radius-subarray-averages", "question__hide": false, - "total_acs": 9075, - "total_submitted": 23580, - "total_column_articles": 126, + "total_acs": 9261, + "total_submitted": 23969, + "total_column_articles": 127, "frontend_question_id": "2090", "is_new_question": false }, @@ -27984,9 +28488,9 @@ "question__title": "Find Target Indices After Sorting Array", "question__title_slug": "find-target-indices-after-sorting-array", "question__hide": false, - "total_acs": 21290, - "total_submitted": 27407, - "total_column_articles": 271, + "total_acs": 21676, + "total_submitted": 27949, + "total_column_articles": 272, "frontend_question_id": "2089", "is_new_question": false }, @@ -28005,8 +28509,8 @@ "question__title": "Number of Equal Count Substrings", "question__title_slug": "number-of-equal-count-substrings", "question__hide": false, - "total_acs": 319, - "total_submitted": 601, + "total_acs": 326, + "total_submitted": 627, "total_column_articles": 13, "frontend_question_id": "2067", "is_new_question": false @@ -28026,8 +28530,8 @@ "question__title": "Account Balance", "question__title_slug": "account-balance", "question__hide": false, - "total_acs": 2441, - "total_submitted": 3072, + "total_acs": 2490, + "total_submitted": 3134, "total_column_articles": 36, "frontend_question_id": "2066", "is_new_question": false @@ -28047,9 +28551,9 @@ "question__title": "Sequentially Ordinal Rank Tracker", "question__title_slug": "sequentially-ordinal-rank-tracker", "question__hide": false, - "total_acs": 3645, - "total_submitted": 6509, - "total_column_articles": 91, + "total_acs": 3675, + "total_submitted": 6571, + "total_column_articles": 92, "frontend_question_id": "2102", "is_new_question": false }, @@ -28068,9 +28572,9 @@ "question__title": "Detonate the Maximum Bombs", "question__title_slug": "detonate-the-maximum-bombs", "question__hide": false, - "total_acs": 6947, - "total_submitted": 17121, - "total_column_articles": 117, + "total_acs": 7133, + "total_submitted": 17499, + "total_column_articles": 121, "frontend_question_id": "2101", "is_new_question": false }, @@ -28089,9 +28593,9 @@ "question__title": "Find Good Days to Rob the Bank", "question__title_slug": "find-good-days-to-rob-the-bank", "question__hide": false, - "total_acs": 35254, - "total_submitted": 72391, - "total_column_articles": 448, + "total_acs": 35328, + "total_submitted": 72541, + "total_column_articles": 446, "frontend_question_id": "2100", "is_new_question": false }, @@ -28110,8 +28614,8 @@ "question__title": "Find Subsequence of Length K With the Largest Sum", "question__title_slug": "find-subsequence-of-length-k-with-the-largest-sum", "question__hide": false, - "total_acs": 10883, - "total_submitted": 22378, + "total_acs": 11098, + "total_submitted": 22769, "total_column_articles": 211, "frontend_question_id": "2099", "is_new_question": false @@ -28131,8 +28635,8 @@ "question__title": "Number of Spaces Cleaning Robot Cleaned", "question__title_slug": "number-of-spaces-cleaning-robot-cleaned", "question__hide": false, - "total_acs": 738, - "total_submitted": 1493, + "total_acs": 741, + "total_submitted": 1521, "total_column_articles": 30, "frontend_question_id": "2061", "is_new_question": false @@ -28152,9 +28656,9 @@ "question__title": "Sum of k-Mirror Numbers", "question__title_slug": "sum-of-k-mirror-numbers", "question__hide": false, - "total_acs": 3567, - "total_submitted": 8076, - "total_column_articles": 84, + "total_acs": 3591, + "total_submitted": 8133, + "total_column_articles": 85, "frontend_question_id": "2081", "is_new_question": false }, @@ -28173,8 +28677,8 @@ "question__title": "Valid Arrangement of Pairs", "question__title_slug": "valid-arrangement-of-pairs", "question__hide": false, - "total_acs": 3195, - "total_submitted": 8257, + "total_acs": 3220, + "total_submitted": 8325, "total_column_articles": 57, "frontend_question_id": "2097", "is_new_question": false @@ -28194,9 +28698,9 @@ "question__title": "Stamping the Grid", "question__title_slug": "stamping-the-grid", "question__hide": false, - "total_acs": 12219, - "total_submitted": 24602, - "total_column_articles": 119, + "total_acs": 12339, + "total_submitted": 24809, + "total_column_articles": 120, "frontend_question_id": "2132", "is_new_question": false }, @@ -28215,9 +28719,9 @@ "question__title": "Two Furthest Houses With Different Colors", "question__title_slug": "two-furthest-houses-with-different-colors", "question__hide": false, - "total_acs": 14758, - "total_submitted": 20537, - "total_column_articles": 235, + "total_acs": 15018, + "total_submitted": 20912, + "total_column_articles": 238, "frontend_question_id": "2078", "is_new_question": false }, @@ -28236,8 +28740,8 @@ "question__title": "Process Restricted Friend Requests", "question__title_slug": "process-restricted-friend-requests", "question__hide": false, - "total_acs": 4107, - "total_submitted": 7940, + "total_acs": 4132, + "total_submitted": 7988, "total_column_articles": 92, "frontend_question_id": "2076", "is_new_question": false @@ -28257,8 +28761,8 @@ "question__title": "Decode the Slanted Ciphertext", "question__title_slug": "decode-the-slanted-ciphertext", "question__hide": false, - "total_acs": 5078, - "total_submitted": 10678, + "total_acs": 5121, + "total_submitted": 10777, "total_column_articles": 91, "frontend_question_id": "2075", "is_new_question": false @@ -28278,9 +28782,9 @@ "question__title": "Reverse Nodes in Even Length Groups", "question__title_slug": "reverse-nodes-in-even-length-groups", "question__hide": false, - "total_acs": 7356, - "total_submitted": 15768, - "total_column_articles": 168, + "total_acs": 7398, + "total_submitted": 15844, + "total_column_articles": 169, "frontend_question_id": "2074", "is_new_question": false }, @@ -28299,9 +28803,9 @@ "question__title": "Time Needed to Buy Tickets", "question__title_slug": "time-needed-to-buy-tickets", "question__hide": false, - "total_acs": 15974, - "total_submitted": 25721, - "total_column_articles": 252, + "total_acs": 16244, + "total_submitted": 26142, + "total_column_articles": 256, "frontend_question_id": "2073", "is_new_question": false }, @@ -28320,9 +28824,9 @@ "question__title": "The Category of Each Member in the Store", "question__title_slug": "the-category-of-each-member-in-the-store", "question__hide": false, - "total_acs": 1967, - "total_submitted": 3021, - "total_column_articles": 25, + "total_acs": 2008, + "total_submitted": 3080, + "total_column_articles": 27, "frontend_question_id": "2051", "is_new_question": false }, @@ -28341,8 +28845,8 @@ "question__title": "Count Fertile Pyramids in a Land", "question__title_slug": "count-fertile-pyramids-in-a-land", "question__hide": false, - "total_acs": 2770, - "total_submitted": 4351, + "total_acs": 2792, + "total_submitted": 4395, "total_column_articles": 59, "frontend_question_id": "2088", "is_new_question": false @@ -28362,9 +28866,9 @@ "question__title": "Minimum Cost Homecoming of a Robot in a Grid", "question__title_slug": "minimum-cost-homecoming-of-a-robot-in-a-grid", "question__hide": false, - "total_acs": 4565, - "total_submitted": 9103, - "total_column_articles": 91, + "total_acs": 4609, + "total_submitted": 9180, + "total_column_articles": 93, "frontend_question_id": "2087", "is_new_question": false }, @@ -28383,9 +28887,9 @@ "question__title": "Minimum Number of Food Buckets to Feed the Hamsters", "question__title_slug": "minimum-number-of-food-buckets-to-feed-the-hamsters", "question__hide": false, - "total_acs": 6580, - "total_submitted": 13848, - "total_column_articles": 118, + "total_acs": 6669, + "total_submitted": 14040, + "total_column_articles": 120, "frontend_question_id": "2086", "is_new_question": false }, @@ -28404,9 +28908,9 @@ "question__title": "Count Common Words With One Occurrence", "question__title_slug": "count-common-words-with-one-occurrence", "question__hide": false, - "total_acs": 30882, - "total_submitted": 39909, - "total_column_articles": 324, + "total_acs": 31149, + "total_submitted": 40320, + "total_column_articles": 326, "frontend_question_id": "2085", "is_new_question": false }, @@ -28425,8 +28929,8 @@ "question__title": "Maximum Path Quality of a Graph", "question__title_slug": "maximum-path-quality-of-a-graph", "question__hide": false, - "total_acs": 3467, - "total_submitted": 6306, + "total_acs": 3492, + "total_submitted": 6366, "total_column_articles": 70, "frontend_question_id": "2065", "is_new_question": false @@ -28446,9 +28950,9 @@ "question__title": "Minimized Maximum of Products Distributed to Any Store", "question__title_slug": "minimized-maximum-of-products-distributed-to-any-store", "question__hide": false, - "total_acs": 7410, - "total_submitted": 15726, - "total_column_articles": 111, + "total_acs": 7612, + "total_submitted": 16079, + "total_column_articles": 113, "frontend_question_id": "2064", "is_new_question": false }, @@ -28467,9 +28971,9 @@ "question__title": "Vowels of All Substrings", "question__title_slug": "vowels-of-all-substrings", "question__hide": false, - "total_acs": 7614, - "total_submitted": 14528, - "total_column_articles": 146, + "total_acs": 7708, + "total_submitted": 14691, + "total_column_articles": 147, "frontend_question_id": "2063", "is_new_question": false }, @@ -28488,9 +28992,9 @@ "question__title": "Count Vowel Substrings of a String", "question__title_slug": "count-vowel-substrings-of-a-string", "question__hide": false, - "total_acs": 10096, - "total_submitted": 15951, - "total_column_articles": 169, + "total_acs": 10209, + "total_submitted": 16107, + "total_column_articles": 171, "frontend_question_id": "2062", "is_new_question": false }, @@ -28509,9 +29013,9 @@ "question__title": "Accepted Candidates From the Interviews", "question__title_slug": "accepted-candidates-from-the-interviews", "question__hide": false, - "total_acs": 2735, - "total_submitted": 3574, - "total_column_articles": 40, + "total_acs": 2813, + "total_submitted": 3657, + "total_column_articles": 42, "frontend_question_id": "2041", "is_new_question": false }, @@ -28530,8 +29034,8 @@ "question__title": "Check if an Original String Exists Given Two Encoded Strings", "question__title_slug": "check-if-an-original-string-exists-given-two-encoded-strings", "question__hide": false, - "total_acs": 1781, - "total_submitted": 4426, + "total_acs": 1788, + "total_submitted": 4474, "total_column_articles": 28, "frontend_question_id": "2060", "is_new_question": false @@ -28551,8 +29055,8 @@ "question__title": "Minimum Operations to Convert Number", "question__title_slug": "minimum-operations-to-convert-number", "question__hide": false, - "total_acs": 7809, - "total_submitted": 15909, + "total_acs": 7861, + "total_submitted": 16005, "total_column_articles": 128, "frontend_question_id": "2059", "is_new_question": false @@ -28572,8 +29076,8 @@ "question__title": "Find the Minimum and Maximum Number of Nodes Between Critical Points", "question__title_slug": "find-the-minimum-and-maximum-number-of-nodes-between-critical-points", "question__hide": false, - "total_acs": 9024, - "total_submitted": 15808, + "total_acs": 9085, + "total_submitted": 15909, "total_column_articles": 128, "frontend_question_id": "2058", "is_new_question": false @@ -28593,9 +29097,9 @@ "question__title": "Smallest Index With Equal Value", "question__title_slug": "smallest-index-with-equal-value", "question__hide": false, - "total_acs": 15134, - "total_submitted": 19936, - "total_column_articles": 132, + "total_acs": 15698, + "total_submitted": 20621, + "total_column_articles": 134, "frontend_question_id": "2057", "is_new_question": false }, @@ -28614,8 +29118,8 @@ "question__title": "Maximum Number of Tasks You Can Assign", "question__title_slug": "maximum-number-of-tasks-you-can-assign", "question__hide": false, - "total_acs": 4312, - "total_submitted": 13873, + "total_acs": 4467, + "total_submitted": 14289, "total_column_articles": 54, "frontend_question_id": "2071", "is_new_question": false @@ -28635,9 +29139,9 @@ "question__title": "Most Beautiful Item for Each Query", "question__title_slug": "most-beautiful-item-for-each-query", "question__hide": false, - "total_acs": 4932, - "total_submitted": 10658, - "total_column_articles": 125, + "total_acs": 4995, + "total_submitted": 10755, + "total_column_articles": 128, "frontend_question_id": "2070", "is_new_question": false }, @@ -28656,8 +29160,8 @@ "question__title": "Walking Robot Simulation II", "question__title_slug": "walking-robot-simulation-ii", "question__hide": false, - "total_acs": 5344, - "total_submitted": 23650, + "total_acs": 5361, + "total_submitted": 23752, "total_column_articles": 119, "frontend_question_id": "2069", "is_new_question": false @@ -28677,9 +29181,9 @@ "question__title": "Check Whether Two Strings are Almost Equivalent", "question__title_slug": "check-whether-two-strings-are-almost-equivalent", "question__hide": false, - "total_acs": 11417, - "total_submitted": 16341, - "total_column_articles": 173, + "total_acs": 11574, + "total_submitted": 16555, + "total_column_articles": 177, "frontend_question_id": "2068", "is_new_question": false }, @@ -28698,8 +29202,8 @@ "question__title": "Parallel Courses III", "question__title_slug": "parallel-courses-iii", "question__hide": false, - "total_acs": 16657, - "total_submitted": 25839, + "total_acs": 16783, + "total_submitted": 26031, "total_column_articles": 218, "frontend_question_id": "2050", "is_new_question": false @@ -28719,9 +29223,9 @@ "question__title": "Count Nodes With the Highest Score", "question__title_slug": "count-nodes-with-the-highest-score", "question__hide": false, - "total_acs": 28554, - "total_submitted": 55053, - "total_column_articles": 326, + "total_acs": 28635, + "total_submitted": 55213, + "total_column_articles": 327, "frontend_question_id": "2049", "is_new_question": false }, @@ -28740,9 +29244,9 @@ "question__title": "Next Greater Numerically Balanced Number", "question__title_slug": "next-greater-numerically-balanced-number", "question__hide": false, - "total_acs": 20565, - "total_submitted": 34823, - "total_column_articles": 227, + "total_acs": 20683, + "total_submitted": 35043, + "total_column_articles": 228, "frontend_question_id": "2048", "is_new_question": false }, @@ -28761,9 +29265,9 @@ "question__title": "Number of Valid Words in a Sentence", "question__title_slug": "number-of-valid-words-in-a-sentence", "question__hide": false, - "total_acs": 29558, - "total_submitted": 76817, - "total_column_articles": 445, + "total_acs": 29672, + "total_submitted": 77181, + "total_column_articles": 443, "frontend_question_id": "2047", "is_new_question": false }, @@ -28782,8 +29286,8 @@ "question__title": "Low-Quality Problems", "question__title_slug": "low-quality-problems", "question__hide": false, - "total_acs": 4184, - "total_submitted": 5264, + "total_acs": 4250, + "total_submitted": 5344, "total_column_articles": 38, "frontend_question_id": "2026", "is_new_question": false @@ -28803,9 +29307,9 @@ "question__title": "Second Minimum Time to Reach Destination", "question__title_slug": "second-minimum-time-to-reach-destination", "question__hide": false, - "total_acs": 17485, - "total_submitted": 32786, - "total_column_articles": 171, + "total_acs": 17579, + "total_submitted": 32953, + "total_column_articles": 172, "frontend_question_id": "2045", "is_new_question": false }, @@ -28824,9 +29328,9 @@ "question__title": "Count Number of Maximum Bitwise-OR Subsets", "question__title_slug": "count-number-of-maximum-bitwise-or-subsets", "question__hide": false, - "total_acs": 37023, - "total_submitted": 45269, - "total_column_articles": 407, + "total_acs": 37135, + "total_submitted": 45417, + "total_column_articles": 409, "frontend_question_id": "2044", "is_new_question": false }, @@ -28845,9 +29349,9 @@ "question__title": "Simple Bank System", "question__title_slug": "simple-bank-system", "question__hide": false, - "total_acs": 37371, - "total_submitted": 56861, - "total_column_articles": 316, + "total_acs": 37476, + "total_submitted": 57041, + "total_column_articles": 314, "frontend_question_id": "2043", "is_new_question": false }, @@ -28866,9 +29370,9 @@ "question__title": "Check if Numbers Are Ascending in a Sentence", "question__title_slug": "check-if-numbers-are-ascending-in-a-sentence", "question__hide": false, - "total_acs": 37710, - "total_submitted": 52525, - "total_column_articles": 514, + "total_acs": 37865, + "total_submitted": 52741, + "total_column_articles": 515, "frontend_question_id": "2042", "is_new_question": false }, @@ -28887,8 +29391,8 @@ "question__title": "Number of Accounts That Did Not Stream", "question__title_slug": "number-of-accounts-that-did-not-stream", "question__hide": false, - "total_acs": 2378, - "total_submitted": 3435, + "total_acs": 2432, + "total_submitted": 3518, "total_column_articles": 39, "frontend_question_id": "2020", "is_new_question": false @@ -28908,8 +29412,8 @@ "question__title": "Number of Valid Move Combinations On Chessboard", "question__title_slug": "number-of-valid-move-combinations-on-chessboard", "question__hide": false, - "total_acs": 1249, - "total_submitted": 2156, + "total_acs": 1255, + "total_submitted": 2198, "total_column_articles": 27, "frontend_question_id": "2056", "is_new_question": false @@ -28929,9 +29433,9 @@ "question__title": "Plates Between Candles", "question__title_slug": "plates-between-candles", "question__hide": false, - "total_acs": 35144, - "total_submitted": 80589, - "total_column_articles": 445, + "total_acs": 35214, + "total_submitted": 80771, + "total_column_articles": 444, "frontend_question_id": "2055", "is_new_question": false }, @@ -28950,8 +29454,8 @@ "question__title": "Two Best Non-Overlapping Events", "question__title_slug": "two-best-non-overlapping-events", "question__hide": false, - "total_acs": 5493, - "total_submitted": 13837, + "total_acs": 5545, + "total_submitted": 13945, "total_column_articles": 100, "frontend_question_id": "2054", "is_new_question": false @@ -28971,9 +29475,9 @@ "question__title": "Kth Distinct String in an Array", "question__title_slug": "kth-distinct-string-in-an-array", "question__hide": false, - "total_acs": 11587, - "total_submitted": 16124, - "total_column_articles": 192, + "total_acs": 11727, + "total_submitted": 16309, + "total_column_articles": 193, "frontend_question_id": "2053", "is_new_question": false }, @@ -28992,9 +29496,9 @@ "question__title": "Partition Array Into Two Arrays to Minimize Sum Difference", "question__title_slug": "partition-array-into-two-arrays-to-minimize-sum-difference", "question__hide": false, - "total_acs": 4407, - "total_submitted": 12496, - "total_column_articles": 77, + "total_acs": 4880, + "total_submitted": 13138, + "total_column_articles": 82, "frontend_question_id": "2035", "is_new_question": false }, @@ -29013,8 +29517,8 @@ "question__title": "Stock Price Fluctuation ", "question__title_slug": "stock-price-fluctuation", "question__hide": false, - "total_acs": 39951, - "total_submitted": 82609, + "total_acs": 40030, + "total_submitted": 82818, "total_column_articles": 318, "frontend_question_id": "2034", "is_new_question": false @@ -29034,8 +29538,8 @@ "question__title": "Minimum Operations to Make a Uni-Value Grid", "question__title_slug": "minimum-operations-to-make-a-uni-value-grid", "question__hide": false, - "total_acs": 7364, - "total_submitted": 16538, + "total_acs": 7462, + "total_submitted": 16688, "total_column_articles": 129, "frontend_question_id": "2033", "is_new_question": false @@ -29055,9 +29559,9 @@ "question__title": "Two Out of Three", "question__title_slug": "two-out-of-three", "question__hide": false, - "total_acs": 33982, - "total_submitted": 46519, - "total_column_articles": 430, + "total_acs": 34160, + "total_submitted": 46782, + "total_column_articles": 431, "frontend_question_id": "2032", "is_new_question": false }, @@ -29076,8 +29580,8 @@ "question__title": "The Number of Seniors and Juniors to Join the Company II", "question__title_slug": "the-number-of-seniors-and-juniors-to-join-the-company-ii", "question__hide": false, - "total_acs": 2324, - "total_submitted": 3765, + "total_acs": 2347, + "total_submitted": 3791, "total_column_articles": 51, "frontend_question_id": "2010", "is_new_question": false @@ -29097,8 +29601,8 @@ "question__title": "Smallest K-Length Subsequence With Occurrences of a Letter", "question__title_slug": "smallest-k-length-subsequence-with-occurrences-of-a-letter", "question__hide": false, - "total_acs": 2488, - "total_submitted": 6785, + "total_acs": 2513, + "total_submitted": 6850, "total_column_articles": 59, "frontend_question_id": "2030", "is_new_question": false @@ -29118,8 +29622,8 @@ "question__title": "Stone Game IX", "question__title_slug": "stone-game-ix", "question__hide": false, - "total_acs": 20633, - "total_submitted": 44145, + "total_acs": 20665, + "total_submitted": 44281, "total_column_articles": 201, "frontend_question_id": "2029", "is_new_question": false @@ -29139,9 +29643,9 @@ "question__title": "Find Missing Observations", "question__title_slug": "find-missing-observations", "question__hide": false, - "total_acs": 35574, - "total_submitted": 70046, - "total_column_articles": 406, + "total_acs": 35634, + "total_submitted": 70144, + "total_column_articles": 404, "frontend_question_id": "2028", "is_new_question": false }, @@ -29160,9 +29664,9 @@ "question__title": "Minimum Moves to Convert String", "question__title_slug": "minimum-moves-to-convert-string", "question__hide": false, - "total_acs": 29214, - "total_submitted": 43719, - "total_column_articles": 316, + "total_acs": 29418, + "total_submitted": 44032, + "total_column_articles": 318, "frontend_question_id": "2027", "is_new_question": false }, @@ -29181,8 +29685,8 @@ "question__title": "Subtree Removal Game with Fibonacci Tree", "question__title_slug": "subtree-removal-game-with-fibonacci-tree", "question__hide": false, - "total_acs": 204, - "total_submitted": 406, + "total_acs": 208, + "total_submitted": 428, "total_column_articles": 11, "frontend_question_id": "2005", "is_new_question": false @@ -29202,8 +29706,8 @@ "question__title": "The Number of Seniors and Juniors to Join the Company", "question__title_slug": "the-number-of-seniors-and-juniors-to-join-the-company", "question__hide": false, - "total_acs": 1747, - "total_submitted": 3984, + "total_acs": 1772, + "total_submitted": 4044, "total_column_articles": 42, "frontend_question_id": "2004", "is_new_question": false @@ -29223,8 +29727,8 @@ "question__title": "The Time When the Network Becomes Idle", "question__title_slug": "the-time-when-the-network-becomes-idle", "question__hide": false, - "total_acs": 20900, - "total_submitted": 37398, + "total_acs": 20973, + "total_submitted": 37531, "total_column_articles": 182, "frontend_question_id": "2039", "is_new_question": false @@ -29244,9 +29748,9 @@ "question__title": "Kth Smallest Product of Two Sorted Arrays", "question__title_slug": "kth-smallest-product-of-two-sorted-arrays", "question__hide": false, - "total_acs": 2394, - "total_submitted": 6918, - "total_column_articles": 37, + "total_acs": 2435, + "total_submitted": 7043, + "total_column_articles": 38, "frontend_question_id": "2040", "is_new_question": false }, @@ -29265,8 +29769,8 @@ "question__title": "Remove Colored Pieces if Both Neighbors are the Same Color", "question__title_slug": "remove-colored-pieces-if-both-neighbors-are-the-same-color", "question__hide": false, - "total_acs": 36157, - "total_submitted": 57045, + "total_acs": 36240, + "total_submitted": 57176, "total_column_articles": 469, "frontend_question_id": "2038", "is_new_question": false @@ -29286,9 +29790,9 @@ "question__title": "Minimum Number of Moves to Seat Everyone", "question__title_slug": "minimum-number-of-moves-to-seat-everyone", "question__hide": false, - "total_acs": 25399, - "total_submitted": 30009, - "total_column_articles": 279, + "total_acs": 25666, + "total_submitted": 30327, + "total_column_articles": 280, "frontend_question_id": "2037", "is_new_question": false }, @@ -29307,9 +29811,9 @@ "question__title": "The Score of Students Solving Math Expression", "question__title_slug": "the-score-of-students-solving-math-expression", "question__hide": false, - "total_acs": 2117, - "total_submitted": 5528, - "total_column_articles": 47, + "total_acs": 2135, + "total_submitted": 5672, + "total_column_articles": 48, "frontend_question_id": "2019", "is_new_question": false }, @@ -29328,8 +29832,8 @@ "question__title": "Check if Word Can Be Placed In Crossword", "question__title_slug": "check-if-word-can-be-placed-in-crossword", "question__hide": false, - "total_acs": 3506, - "total_submitted": 8193, + "total_acs": 3519, + "total_submitted": 8236, "total_column_articles": 74, "frontend_question_id": "2018", "is_new_question": false @@ -29349,8 +29853,8 @@ "question__title": "Grid Game", "question__title_slug": "grid-game", "question__hide": false, - "total_acs": 6378, - "total_submitted": 16159, + "total_acs": 6432, + "total_submitted": 16306, "total_column_articles": 134, "frontend_question_id": "2017", "is_new_question": false @@ -29370,9 +29874,9 @@ "question__title": "Maximum Difference Between Increasing Elements", "question__title_slug": "maximum-difference-between-increasing-elements", "question__hide": false, - "total_acs": 46722, - "total_submitted": 78149, - "total_column_articles": 522, + "total_acs": 46923, + "total_submitted": 78435, + "total_column_articles": 520, "frontend_question_id": "2016", "is_new_question": false }, @@ -29391,9 +29895,9 @@ "question__title": "Count the Number of Experiments", "question__title_slug": "count-the-number-of-experiments", "question__hide": false, - "total_acs": 2854, - "total_submitted": 6041, - "total_column_articles": 33, + "total_acs": 2899, + "total_submitted": 6128, + "total_column_articles": 34, "frontend_question_id": "1990", "is_new_question": false }, @@ -29412,8 +29916,8 @@ "question__title": "Average Height of Buildings in Each Segment", "question__title_slug": "average-height-of-buildings-in-each-segment", "question__hide": false, - "total_acs": 406, - "total_submitted": 713, + "total_acs": 413, + "total_submitted": 740, "total_column_articles": 16, "frontend_question_id": "2015", "is_new_question": false @@ -29433,9 +29937,9 @@ "question__title": "Smallest Greater Multiple Made of Two Digits", "question__title_slug": "smallest-greater-multiple-made-of-two-digits", "question__hide": false, - "total_acs": 364, - "total_submitted": 814, - "total_column_articles": 14, + "total_acs": 375, + "total_submitted": 845, + "total_column_articles": 15, "frontend_question_id": "1999", "is_new_question": false }, @@ -29454,8 +29958,8 @@ "question__title": "Longest Subsequence Repeated k Times", "question__title_slug": "longest-subsequence-repeated-k-times", "question__hide": false, - "total_acs": 2580, - "total_submitted": 4687, + "total_acs": 2597, + "total_submitted": 4730, "total_column_articles": 32, "frontend_question_id": "2014", "is_new_question": false @@ -29475,8 +29979,8 @@ "question__title": "Detect Squares", "question__title_slug": "detect-squares", "question__hide": false, - "total_acs": 22290, - "total_submitted": 39408, + "total_acs": 22319, + "total_submitted": 39489, "total_column_articles": 247, "frontend_question_id": "2013", "is_new_question": false @@ -29496,9 +30000,9 @@ "question__title": "Sum of Beauty in the Array", "question__title_slug": "sum-of-beauty-in-the-array", "question__hide": false, - "total_acs": 6617, - "total_submitted": 16571, - "total_column_articles": 110, + "total_acs": 6678, + "total_submitted": 16668, + "total_column_articles": 111, "frontend_question_id": "2012", "is_new_question": false }, @@ -29517,9 +30021,9 @@ "question__title": "Final Value of Variable After Performing Operations", "question__title_slug": "final-value-of-variable-after-performing-operations", "question__hide": false, - "total_acs": 51684, - "total_submitted": 60006, - "total_column_articles": 444, + "total_acs": 52293, + "total_submitted": 60711, + "total_column_articles": 441, "frontend_question_id": "2011", "is_new_question": false }, @@ -29538,8 +30042,8 @@ "question__title": "Find Cutoff Score for Each School", "question__title_slug": "find-cutoff-score-for-each-school", "question__hide": false, - "total_acs": 5240, - "total_submitted": 8153, + "total_acs": 5283, + "total_submitted": 8211, "total_column_articles": 62, "frontend_question_id": "1988", "is_new_question": false @@ -29559,8 +30063,8 @@ "question__title": "Maximum Number of Ways to Partition an Array", "question__title_slug": "maximum-number-of-ways-to-partition-an-array", "question__hide": false, - "total_acs": 2742, - "total_submitted": 8826, + "total_acs": 2761, + "total_submitted": 8900, "total_column_articles": 67, "frontend_question_id": "2025", "is_new_question": false @@ -29580,8 +30084,8 @@ "question__title": "Maximize the Confusion of an Exam", "question__title_slug": "maximize-the-confusion-of-an-exam", "question__hide": false, - "total_acs": 40116, - "total_submitted": 69559, + "total_acs": 40341, + "total_submitted": 69857, "total_column_articles": 454, "frontend_question_id": "2024", "is_new_question": false @@ -29601,8 +30105,8 @@ "question__title": "Number of Pairs of Strings With Concatenation Equal to Target", "question__title_slug": "number-of-pairs-of-strings-with-concatenation-equal-to-target", "question__hide": false, - "total_acs": 7261, - "total_submitted": 9768, + "total_acs": 7344, + "total_submitted": 9892, "total_column_articles": 112, "frontend_question_id": "2023", "is_new_question": false @@ -29622,9 +30126,9 @@ "question__title": "Convert 1D Array Into 2D Array", "question__title_slug": "convert-1d-array-into-2d-array", "question__hide": false, - "total_acs": 42907, - "total_submitted": 65328, - "total_column_articles": 504, + "total_acs": 43177, + "total_submitted": 65721, + "total_column_articles": 505, "frontend_question_id": "2022", "is_new_question": false }, @@ -29643,8 +30147,8 @@ "question__title": "Smallest Missing Genetic Value in Each Subtree", "question__title_slug": "smallest-missing-genetic-value-in-each-subtree", "question__hide": false, - "total_acs": 15749, - "total_submitted": 26454, + "total_acs": 15803, + "total_submitted": 26564, "total_column_articles": 115, "frontend_question_id": "2003", "is_new_question": false @@ -29664,8 +30168,8 @@ "question__title": "Maximum Product of the Length of Two Palindromic Subsequences", "question__title_slug": "maximum-product-of-the-length-of-two-palindromic-subsequences", "question__hide": false, - "total_acs": 6445, - "total_submitted": 10570, + "total_acs": 6509, + "total_submitted": 10668, "total_column_articles": 129, "frontend_question_id": "2002", "is_new_question": false @@ -29685,9 +30189,9 @@ "question__title": "Number of Pairs of Interchangeable Rectangles", "question__title_slug": "number-of-pairs-of-interchangeable-rectangles", "question__hide": false, - "total_acs": 8953, - "total_submitted": 22510, - "total_column_articles": 176, + "total_acs": 9028, + "total_submitted": 22621, + "total_column_articles": 177, "frontend_question_id": "2001", "is_new_question": false }, @@ -29706,8 +30210,8 @@ "question__title": "Reverse Prefix of Word", "question__title_slug": "reverse-prefix-of-word", "question__hide": false, - "total_acs": 41067, - "total_submitted": 53218, + "total_acs": 41364, + "total_submitted": 53589, "total_column_articles": 516, "frontend_question_id": "2000", "is_new_question": false @@ -29727,9 +30231,9 @@ "question__title": "Employees Whose Manager Left the Company", "question__title_slug": "employees-whose-manager-left-the-company", "question__hide": false, - "total_acs": 16523, - "total_submitted": 34556, - "total_column_articles": 101, + "total_acs": 18117, + "total_submitted": 37945, + "total_column_articles": 104, "frontend_question_id": "1978", "is_new_question": false }, @@ -29748,8 +30252,8 @@ "question__title": "Count Nodes Equal to Sum of Descendants", "question__title_slug": "count-nodes-equal-to-sum-of-descendants", "question__hide": false, - "total_acs": 609, - "total_submitted": 997, + "total_acs": 623, + "total_submitted": 1012, "total_column_articles": 23, "frontend_question_id": "1973", "is_new_question": false @@ -29769,9 +30273,9 @@ "question__title": "GCD Sort of an Array", "question__title_slug": "gcd-sort-of-an-array", "question__hide": false, - "total_acs": 3380, - "total_submitted": 7307, - "total_column_articles": 63, + "total_acs": 3414, + "total_submitted": 7379, + "total_column_articles": 65, "frontend_question_id": "1998", "is_new_question": false }, @@ -29790,9 +30294,9 @@ "question__title": "First Day Where You Have Been in All the Rooms", "question__title_slug": "first-day-where-you-have-been-in-all-the-rooms", "question__hide": false, - "total_acs": 3888, - "total_submitted": 10936, - "total_column_articles": 57, + "total_acs": 3959, + "total_submitted": 11080, + "total_column_articles": 59, "frontend_question_id": "1997", "is_new_question": false }, @@ -29811,9 +30315,9 @@ "question__title": "The Number of Weak Characters in the Game", "question__title_slug": "the-number-of-weak-characters-in-the-game", "question__hide": false, - "total_acs": 30496, - "total_submitted": 73258, - "total_column_articles": 311, + "total_acs": 30578, + "total_submitted": 73444, + "total_column_articles": 312, "frontend_question_id": "1996", "is_new_question": false }, @@ -29832,9 +30336,9 @@ "question__title": "Count Special Quadruplets", "question__title_slug": "count-special-quadruplets", "question__hide": false, - "total_acs": 39245, - "total_submitted": 59133, - "total_column_articles": 295, + "total_acs": 39448, + "total_submitted": 59401, + "total_column_articles": 294, "frontend_question_id": "1995", "is_new_question": false }, @@ -29853,9 +30357,9 @@ "question__title": "Find if Path Exists in Graph", "question__title_slug": "find-if-path-exists-in-graph", "question__hide": false, - "total_acs": 37900, - "total_submitted": 70453, - "total_column_articles": 360, + "total_acs": 40008, + "total_submitted": 74283, + "total_column_articles": 368, "frontend_question_id": "1971", "is_new_question": false }, @@ -29874,9 +30378,9 @@ "question__title": "First and Last Call On the Same Day", "question__title_slug": "first-and-last-call-on-the-same-day", "question__hide": false, - "total_acs": 3116, - "total_submitted": 7355, - "total_column_articles": 54, + "total_acs": 3148, + "total_submitted": 7515, + "total_column_articles": 55, "frontend_question_id": "1972", "is_new_question": false }, @@ -29895,9 +30399,9 @@ "question__title": "Minimum Number of Operations to Make Array Continuous", "question__title_slug": "minimum-number-of-operations-to-make-array-continuous", "question__hide": false, - "total_acs": 3620, - "total_submitted": 8166, - "total_column_articles": 82, + "total_acs": 3663, + "total_submitted": 8295, + "total_column_articles": 83, "frontend_question_id": "2009", "is_new_question": false }, @@ -29916,9 +30420,9 @@ "question__title": "Maximum Earnings From Taxi", "question__title_slug": "maximum-earnings-from-taxi", "question__hide": false, - "total_acs": 23609, - "total_submitted": 41754, - "total_column_articles": 222, + "total_acs": 23766, + "total_submitted": 42065, + "total_column_articles": 224, "frontend_question_id": "2008", "is_new_question": false }, @@ -29937,9 +30441,9 @@ "question__title": "Find Original Array From Doubled Array", "question__title_slug": "find-original-array-from-doubled-array", "question__hide": false, - "total_acs": 7612, - "total_submitted": 22126, - "total_column_articles": 137, + "total_acs": 7766, + "total_submitted": 22486, + "total_column_articles": 138, "frontend_question_id": "2007", "is_new_question": false }, @@ -29958,9 +30462,9 @@ "question__title": "Count Number of Pairs With Absolute Difference K", "question__title_slug": "count-number-of-pairs-with-absolute-difference-k", "question__hide": false, - "total_acs": 59002, - "total_submitted": 71192, - "total_column_articles": 562, + "total_acs": 59722, + "total_submitted": 72103, + "total_column_articles": 561, "frontend_question_id": "2006", "is_new_question": false }, @@ -29979,9 +30483,9 @@ "question__title": "Number of Unique Good Subsequences", "question__title_slug": "number-of-unique-good-subsequences", "question__hide": false, - "total_acs": 2725, - "total_submitted": 5326, - "total_column_articles": 43, + "total_acs": 2747, + "total_submitted": 5378, + "total_column_articles": 45, "frontend_question_id": "1987", "is_new_question": false }, @@ -30000,8 +30504,8 @@ "question__title": "Minimum Number of Work Sessions to Finish the Tasks", "question__title_slug": "minimum-number-of-work-sessions-to-finish-the-tasks", "question__hide": false, - "total_acs": 7689, - "total_submitted": 22283, + "total_acs": 7755, + "total_submitted": 22424, "total_column_articles": 128, "frontend_question_id": "1986", "is_new_question": false @@ -30021,9 +30525,9 @@ "question__title": "Find the Kth Largest Integer in the Array", "question__title_slug": "find-the-kth-largest-integer-in-the-array", "question__hide": false, - "total_acs": 12545, - "total_submitted": 29447, - "total_column_articles": 162, + "total_acs": 12694, + "total_submitted": 29758, + "total_column_articles": 164, "frontend_question_id": "1985", "is_new_question": false }, @@ -30042,8 +30546,8 @@ "question__title": "Minimum Difference Between Highest and Lowest of K Scores", "question__title_slug": "minimum-difference-between-highest-and-lowest-of-k-scores", "question__hide": false, - "total_acs": 49688, - "total_submitted": 80275, + "total_acs": 50342, + "total_submitted": 81270, "total_column_articles": 575, "frontend_question_id": "1984", "is_new_question": false @@ -30063,8 +30567,8 @@ "question__title": "Binary Searchable Numbers in an Unsorted Array", "question__title_slug": "binary-searchable-numbers-in-an-unsorted-array", "question__hide": false, - "total_acs": 299, - "total_submitted": 481, + "total_acs": 304, + "total_submitted": 502, "total_column_articles": 11, "frontend_question_id": "1966", "is_new_question": false @@ -30084,9 +30588,9 @@ "question__title": "Employees With Missing Information", "question__title_slug": "employees-with-missing-information", "question__hide": false, - "total_acs": 51289, - "total_submitted": 72304, - "total_column_articles": 330, + "total_acs": 51957, + "total_submitted": 73268, + "total_column_articles": 334, "frontend_question_id": "1965", "is_new_question": false }, @@ -30105,8 +30609,8 @@ "question__title": "Find Array Given Subset Sums", "question__title_slug": "find-array-given-subset-sums", "question__hide": false, - "total_acs": 1686, - "total_submitted": 3423, + "total_acs": 1697, + "total_submitted": 3484, "total_column_articles": 28, "frontend_question_id": "1982", "is_new_question": false @@ -30126,8 +30630,8 @@ "question__title": "Minimize the Difference Between Target and Chosen Elements", "question__title_slug": "minimize-the-difference-between-target-and-chosen-elements", "question__hide": false, - "total_acs": 7949, - "total_submitted": 23400, + "total_acs": 8017, + "total_submitted": 23573, "total_column_articles": 110, "frontend_question_id": "1981", "is_new_question": false @@ -30147,9 +30651,9 @@ "question__title": "Find Unique Binary String", "question__title_slug": "find-unique-binary-string", "question__hide": false, - "total_acs": 9596, - "total_submitted": 15806, - "total_column_articles": 155, + "total_acs": 9704, + "total_submitted": 15951, + "total_column_articles": 157, "frontend_question_id": "1980", "is_new_question": false }, @@ -30168,9 +30672,9 @@ "question__title": "Find Greatest Common Divisor of Array", "question__title_slug": "find-greatest-common-divisor-of-array", "question__hide": false, - "total_acs": 25489, - "total_submitted": 33292, - "total_column_articles": 309, + "total_acs": 26222, + "total_submitted": 34220, + "total_column_articles": 315, "frontend_question_id": "1979", "is_new_question": false }, @@ -30189,9 +30693,9 @@ "question__title": "The Number of Good Subsets", "question__title_slug": "the-number-of-good-subsets", "question__hide": false, - "total_acs": 16979, - "total_submitted": 30238, - "total_column_articles": 192, + "total_acs": 17018, + "total_submitted": 30348, + "total_column_articles": 193, "frontend_question_id": "1994", "is_new_question": false }, @@ -30210,8 +30714,8 @@ "question__title": "Operations on Tree", "question__title_slug": "operations-on-tree", "question__hide": false, - "total_acs": 16161, - "total_submitted": 30767, + "total_acs": 16195, + "total_submitted": 30836, "total_column_articles": 151, "frontend_question_id": "1993", "is_new_question": false @@ -30231,9 +30735,9 @@ "question__title": "Find All Groups of Farmland", "question__title_slug": "find-all-groups-of-farmland", "question__hide": false, - "total_acs": 6371, - "total_submitted": 10358, - "total_column_articles": 134, + "total_acs": 6437, + "total_submitted": 10464, + "total_column_articles": 136, "frontend_question_id": "1992", "is_new_question": false }, @@ -30252,9 +30756,9 @@ "question__title": "Find the Middle Index in Array", "question__title_slug": "find-the-middle-index-in-array", "question__hide": false, - "total_acs": 28032, - "total_submitted": 44024, - "total_column_articles": 370, + "total_acs": 28970, + "total_submitted": 45447, + "total_column_articles": 377, "frontend_question_id": "1991", "is_new_question": false }, @@ -30273,8 +30777,8 @@ "question__title": "Last Day Where You Can Still Cross", "question__title_slug": "last-day-where-you-can-still-cross", "question__hide": false, - "total_acs": 4068, - "total_submitted": 7968, + "total_acs": 4111, + "total_submitted": 8032, "total_column_articles": 75, "frontend_question_id": "1970", "is_new_question": false @@ -30294,9 +30798,9 @@ "question__title": "Minimum Non-Zero Product of the Array Elements", "question__title_slug": "minimum-non-zero-product-of-the-array-elements", "question__hide": false, - "total_acs": 4197, - "total_submitted": 13726, - "total_column_articles": 58, + "total_acs": 17429, + "total_submitted": 40707, + "total_column_articles": 127, "frontend_question_id": "1969", "is_new_question": false }, @@ -30315,9 +30819,9 @@ "question__title": "Number of Strings That Appear as Substrings in Word", "question__title_slug": "number-of-strings-that-appear-as-substrings-in-word", "question__hide": false, - "total_acs": 13321, - "total_submitted": 16705, - "total_column_articles": 168, + "total_acs": 13542, + "total_submitted": 16993, + "total_column_articles": 171, "frontend_question_id": "1967", "is_new_question": false }, @@ -30336,8 +30840,8 @@ "question__title": "All the Pairs With the Maximum Number of Common Followers", "question__title_slug": "all-the-pairs-with-the-maximum-number-of-common-followers", "question__hide": false, - "total_acs": 4444, - "total_submitted": 6795, + "total_acs": 4490, + "total_submitted": 6860, "total_column_articles": 56, "frontend_question_id": "1951", "is_new_question": false @@ -30357,9 +30861,9 @@ "question__title": "Strong Friendship", "question__title_slug": "strong-friendship", "question__hide": false, - "total_acs": 4127, - "total_submitted": 7883, - "total_column_articles": 56, + "total_acs": 4167, + "total_submitted": 7963, + "total_column_articles": 57, "frontend_question_id": "1949", "is_new_question": false }, @@ -30378,9 +30882,9 @@ "question__title": "Find the Longest Valid Obstacle Course at Each Position", "question__title_slug": "find-the-longest-valid-obstacle-course-at-each-position", "question__hide": false, - "total_acs": 7258, - "total_submitted": 15881, - "total_column_articles": 87, + "total_acs": 7518, + "total_submitted": 16416, + "total_column_articles": 90, "frontend_question_id": "1964", "is_new_question": false }, @@ -30399,8 +30903,8 @@ "question__title": "Minimum Number of Swaps to Make the String Balanced", "question__title_slug": "minimum-number-of-swaps-to-make-the-string-balanced", "question__hide": false, - "total_acs": 7614, - "total_submitted": 11644, + "total_acs": 7669, + "total_submitted": 11732, "total_column_articles": 89, "frontend_question_id": "1963", "is_new_question": false @@ -30420,8 +30924,8 @@ "question__title": "Remove Stones to Minimize the Total", "question__title_slug": "remove-stones-to-minimize-the-total", "question__hide": false, - "total_acs": 23436, - "total_submitted": 39323, + "total_acs": 23585, + "total_submitted": 39541, "total_column_articles": 212, "frontend_question_id": "1962", "is_new_question": false @@ -30441,9 +30945,9 @@ "question__title": "Check If String Is a Prefix of Array", "question__title_slug": "check-if-string-is-a-prefix-of-array", "question__hide": false, - "total_acs": 14194, - "total_submitted": 26877, - "total_column_articles": 167, + "total_acs": 14365, + "total_submitted": 27188, + "total_column_articles": 168, "frontend_question_id": "1961", "is_new_question": false }, @@ -30462,8 +30966,8 @@ "question__title": "Users That Actively Request Confirmation Messages", "question__title_slug": "users-that-actively-request-confirmation-messages", "question__hide": false, - "total_acs": 3347, - "total_submitted": 5749, + "total_acs": 3401, + "total_submitted": 5834, "total_column_articles": 33, "frontend_question_id": "1939", "is_new_question": false @@ -30483,9 +30987,9 @@ "question__title": "Number of Ways to Separate Numbers", "question__title_slug": "number-of-ways-to-separate-numbers", "question__hide": false, - "total_acs": 1932, - "total_submitted": 6215, - "total_column_articles": 29, + "total_acs": 1962, + "total_submitted": 6318, + "total_column_articles": 30, "frontend_question_id": "1977", "is_new_question": false }, @@ -30504,9 +31008,9 @@ "question__title": "Number of Ways to Arrive at Destination", "question__title_slug": "number-of-ways-to-arrive-at-destination", "question__hide": false, - "total_acs": 7246, - "total_submitted": 19412, - "total_column_articles": 117, + "total_acs": 21429, + "total_submitted": 46631, + "total_column_articles": 164, "frontend_question_id": "1976", "is_new_question": false }, @@ -30525,8 +31029,8 @@ "question__title": "Maximum Matrix Sum", "question__title_slug": "maximum-matrix-sum", "question__hide": false, - "total_acs": 5685, - "total_submitted": 13408, + "total_acs": 5766, + "total_submitted": 13585, "total_column_articles": 83, "frontend_question_id": "1975", "is_new_question": false @@ -30546,9 +31050,9 @@ "question__title": "Minimum Time to Type Word Using Special Typewriter", "question__title_slug": "minimum-time-to-type-word-using-special-typewriter", "question__hide": false, - "total_acs": 11116, - "total_submitted": 15479, - "total_column_articles": 165, + "total_acs": 11342, + "total_submitted": 15771, + "total_column_articles": 169, "frontend_question_id": "1974", "is_new_question": false }, @@ -30567,9 +31071,9 @@ "question__title": "Confirmation Rate", "question__title_slug": "confirmation-rate", "question__hide": false, - "total_acs": 22459, - "total_submitted": 36354, - "total_column_articles": 195, + "total_acs": 24953, + "total_submitted": 40205, + "total_column_articles": 214, "frontend_question_id": "1934", "is_new_question": false }, @@ -30588,9 +31092,9 @@ "question__title": "Count Number of Special Subsequences", "question__title_slug": "count-number-of-special-subsequences", "question__hide": false, - "total_acs": 4290, - "total_submitted": 8066, - "total_column_articles": 62, + "total_acs": 4324, + "total_submitted": 8110, + "total_column_articles": 63, "frontend_question_id": "1955", "is_new_question": false }, @@ -30609,9 +31113,9 @@ "question__title": "Array With Elements Not Equal to Average of Neighbors", "question__title_slug": "array-with-elements-not-equal-to-average-of-neighbors", "question__hide": false, - "total_acs": 7082, - "total_submitted": 17645, - "total_column_articles": 102, + "total_acs": 7169, + "total_submitted": 17791, + "total_column_articles": 104, "frontend_question_id": "1968", "is_new_question": false }, @@ -30630,8 +31134,8 @@ "question__title": "Maximum Number of Weeks for Which You Can Work", "question__title_slug": "maximum-number-of-weeks-for-which-you-can-work", "question__hide": false, - "total_acs": 7228, - "total_submitted": 18960, + "total_acs": 7286, + "total_submitted": 19076, "total_column_articles": 120, "frontend_question_id": "1953", "is_new_question": false @@ -30651,9 +31155,9 @@ "question__title": "Three Divisors", "question__title_slug": "three-divisors", "question__hide": false, - "total_acs": 16771, - "total_submitted": 30287, - "total_column_articles": 200, + "total_acs": 17182, + "total_submitted": 31035, + "total_column_articles": 202, "frontend_question_id": "1952", "is_new_question": false }, @@ -30672,8 +31176,8 @@ "question__title": "Minimum Cost to Separate Sentence Into Rows", "question__title_slug": "minimum-cost-to-separate-sentence-into-rows", "question__hide": false, - "total_acs": 345, - "total_submitted": 757, + "total_acs": 355, + "total_submitted": 790, "total_column_articles": 19, "frontend_question_id": "2052", "is_new_question": false @@ -30693,8 +31197,8 @@ "question__title": "Minimum Total Space Wasted With K Resizing Operations", "question__title_slug": "minimum-total-space-wasted-with-k-resizing-operations", "question__hide": false, - "total_acs": 2891, - "total_submitted": 6039, + "total_acs": 2921, + "total_submitted": 6099, "total_column_articles": 53, "frontend_question_id": "1959", "is_new_question": false @@ -30714,8 +31218,8 @@ "question__title": "Check if Move is Legal", "question__title_slug": "check-if-move-is-legal", "question__hide": false, - "total_acs": 3978, - "total_submitted": 8724, + "total_acs": 4020, + "total_submitted": 8807, "total_column_articles": 69, "frontend_question_id": "1958", "is_new_question": false @@ -30735,8 +31239,8 @@ "question__title": "Delete Duplicate Folders in System", "question__title_slug": "delete-duplicate-folders-in-system", "question__hide": false, - "total_acs": 1879, - "total_submitted": 3442, + "total_acs": 1887, + "total_submitted": 3471, "total_column_articles": 31, "frontend_question_id": "1948", "is_new_question": false @@ -30756,8 +31260,8 @@ "question__title": "Maximum Compatibility Score Sum", "question__title_slug": "maximum-compatibility-score-sum", "question__hide": false, - "total_acs": 7520, - "total_submitted": 12669, + "total_acs": 7629, + "total_submitted": 12808, "total_column_articles": 141, "frontend_question_id": "1947", "is_new_question": false @@ -30777,8 +31281,8 @@ "question__title": "Largest Number After Mutating Substring", "question__title_slug": "largest-number-after-mutating-substring", "question__hide": false, - "total_acs": 8124, - "total_submitted": 24745, + "total_acs": 8193, + "total_submitted": 24903, "total_column_articles": 118, "frontend_question_id": "1946", "is_new_question": false @@ -30798,8 +31302,8 @@ "question__title": "Sum of Digits of String After Convert", "question__title_slug": "sum-of-digits-of-string-after-convert", "question__hide": false, - "total_acs": 32474, - "total_submitted": 46142, + "total_acs": 32687, + "total_submitted": 46502, "total_column_articles": 393, "frontend_question_id": "1945", "is_new_question": false @@ -30819,8 +31323,8 @@ "question__title": "Brightest Position on Street", "question__title_slug": "brightest-position-on-street", "question__hide": false, - "total_acs": 700, - "total_submitted": 1129, + "total_acs": 712, + "total_submitted": 1155, "total_column_articles": 23, "frontend_question_id": "2021", "is_new_question": false @@ -30840,8 +31344,8 @@ "question__title": "Erect the Fence II", "question__title_slug": "erect-the-fence-ii", "question__hide": false, - "total_acs": 276, - "total_submitted": 630, + "total_acs": 280, + "total_submitted": 659, "total_column_articles": 11, "frontend_question_id": "1924", "is_new_question": false @@ -30861,8 +31365,8 @@ "question__title": "Minimum Time For K Virus Variants to Spread", "question__title_slug": "minimum-time-for-k-virus-variants-to-spread", "question__hide": false, - "total_acs": 334, - "total_submitted": 952, + "total_acs": 338, + "total_submitted": 985, "total_column_articles": 15, "frontend_question_id": "1956", "is_new_question": false @@ -30882,8 +31386,8 @@ "question__title": "Maximum of Minimum Values in All Subarrays", "question__title_slug": "maximum-of-minimum-values-in-all-subarrays", "question__hide": false, - "total_acs": 526, - "total_submitted": 1049, + "total_acs": 532, + "total_submitted": 1079, "total_column_articles": 17, "frontend_question_id": "1950", "is_new_question": false @@ -30903,8 +31407,8 @@ "question__title": "Longest Common Subsequence Between Sorted Arrays", "question__title_slug": "longest-common-subsequence-between-sorted-arrays", "question__hide": false, - "total_acs": 1031, - "total_submitted": 1386, + "total_acs": 1039, + "total_submitted": 1399, "total_column_articles": 43, "frontend_question_id": "1940", "is_new_question": false @@ -30924,8 +31428,8 @@ "question__title": "Check if String Is Decomposable Into Value-Equal Substrings", "question__title_slug": "check-if-string-is-decomposable-into-value-equal-substrings", "question__hide": false, - "total_acs": 1219, - "total_submitted": 2468, + "total_acs": 1231, + "total_submitted": 2483, "total_column_articles": 45, "frontend_question_id": "1933", "is_new_question": false @@ -30945,8 +31449,8 @@ "question__title": "Kth Smallest Subarray Sum", "question__title_slug": "kth-smallest-subarray-sum", "question__hide": false, - "total_acs": 850, - "total_submitted": 1741, + "total_acs": 878, + "total_submitted": 1784, "total_column_articles": 12, "frontend_question_id": "1918", "is_new_question": false @@ -30966,8 +31470,8 @@ "question__title": "Maximum Genetic Difference Query", "question__title_slug": "maximum-genetic-difference-query", "question__hide": false, - "total_acs": 2165, - "total_submitted": 5179, + "total_acs": 2182, + "total_submitted": 5221, "total_column_articles": 56, "frontend_question_id": "1938", "is_new_question": false @@ -30987,8 +31491,8 @@ "question__title": "Maximum Number of Points with Cost", "question__title_slug": "maximum-number-of-points-with-cost", "question__hide": false, - "total_acs": 5608, - "total_submitted": 18871, + "total_acs": 5643, + "total_submitted": 18993, "total_column_articles": 94, "frontend_question_id": "1937", "is_new_question": false @@ -31008,8 +31512,8 @@ "question__title": "Add Minimum Number of Rungs", "question__title_slug": "add-minimum-number-of-rungs", "question__hide": false, - "total_acs": 9269, - "total_submitted": 19829, + "total_acs": 9373, + "total_submitted": 20027, "total_column_articles": 130, "frontend_question_id": "1936", "is_new_question": false @@ -31029,8 +31533,8 @@ "question__title": "Check for Contradictions in Equations", "question__title_slug": "check-for-contradictions-in-equations", "question__hide": false, - "total_acs": 256, - "total_submitted": 566, + "total_acs": 270, + "total_submitted": 598, "total_column_articles": 7, "frontend_question_id": "2307", "is_new_question": false @@ -31050,8 +31554,8 @@ "question__title": "Leetcodify Similar Friends", "question__title_slug": "leetcodify-similar-friends", "question__hide": false, - "total_acs": 2311, - "total_submitted": 5416, + "total_acs": 2342, + "total_submitted": 5497, "total_column_articles": 43, "frontend_question_id": "1919", "is_new_question": false @@ -31071,8 +31575,8 @@ "question__title": "Leetcodify Friends Recommendations", "question__title_slug": "leetcodify-friends-recommendations", "question__hide": false, - "total_acs": 2563, - "total_submitted": 8446, + "total_acs": 2604, + "total_submitted": 8582, "total_column_articles": 35, "frontend_question_id": "1917", "is_new_question": false @@ -31092,8 +31596,8 @@ "question__title": "Game of Nim", "question__title_slug": "game-of-nim", "question__hide": false, - "total_acs": 746, - "total_submitted": 1173, + "total_acs": 770, + "total_submitted": 1201, "total_column_articles": 20, "frontend_question_id": "1908", "is_new_question": false @@ -31113,9 +31617,9 @@ "question__title": "Painting a Grid With Three Different Colors", "question__title_slug": "painting-a-grid-with-three-different-colors", "question__hide": false, - "total_acs": 3576, - "total_submitted": 5932, - "total_column_articles": 95, + "total_acs": 3591, + "total_submitted": 5974, + "total_column_articles": 96, "frontend_question_id": "1931", "is_new_question": false }, @@ -31134,8 +31638,8 @@ "question__title": "Merge BSTs to Create Single BST", "question__title_slug": "merge-bsts-to-create-single-bst", "question__hide": false, - "total_acs": 2313, - "total_submitted": 6860, + "total_acs": 2338, + "total_submitted": 6956, "total_column_articles": 59, "frontend_question_id": "1932", "is_new_question": false @@ -31155,9 +31659,9 @@ "question__title": "Unique Length-3 Palindromic Subsequences", "question__title_slug": "unique-length-3-palindromic-subsequences", "question__hide": false, - "total_acs": 9823, - "total_submitted": 18496, - "total_column_articles": 166, + "total_acs": 9893, + "total_submitted": 18626, + "total_column_articles": 168, "frontend_question_id": "1930", "is_new_question": false }, @@ -31176,9 +31680,9 @@ "question__title": "Concatenation of Array", "question__title_slug": "concatenation-of-array", "question__hide": false, - "total_acs": 45429, - "total_submitted": 54013, - "total_column_articles": 384, + "total_acs": 46527, + "total_submitted": 55485, + "total_column_articles": 386, "frontend_question_id": "1929", "is_new_question": false }, @@ -31197,9 +31701,9 @@ "question__title": "Count Salary Categories", "question__title_slug": "count-salary-categories", "question__hide": false, - "total_acs": 16418, - "total_submitted": 25673, - "total_column_articles": 148, + "total_acs": 17818, + "total_submitted": 27809, + "total_column_articles": 156, "frontend_question_id": "1907", "is_new_question": false }, @@ -31218,8 +31722,8 @@ "question__title": "Jump Game VIII", "question__title_slug": "jump-game-viii", "question__hide": false, - "total_acs": 361, - "total_submitted": 602, + "total_acs": 378, + "total_submitted": 646, "total_column_articles": 18, "frontend_question_id": "2297", "is_new_question": false @@ -31239,8 +31743,8 @@ "question__title": "Describe the Painting", "question__title_slug": "describe-the-painting", "question__hide": false, - "total_acs": 3579, - "total_submitted": 7912, + "total_acs": 3620, + "total_submitted": 8013, "total_column_articles": 82, "frontend_question_id": "1943", "is_new_question": false @@ -31260,8 +31764,8 @@ "question__title": "The Number of the Smallest Unoccupied Chair", "question__title_slug": "the-number-of-the-smallest-unoccupied-chair", "question__hide": false, - "total_acs": 5794, - "total_submitted": 13556, + "total_acs": 5850, + "total_submitted": 13670, "total_column_articles": 115, "frontend_question_id": "1942", "is_new_question": false @@ -31281,8 +31785,8 @@ "question__title": "Check if All Characters Have Equal Number of Occurrences", "question__title_slug": "check-if-all-characters-have-equal-number-of-occurrences", "question__hide": false, - "total_acs": 14652, - "total_submitted": 19890, + "total_acs": 14846, + "total_submitted": 20171, "total_column_articles": 211, "frontend_question_id": "1941", "is_new_question": false @@ -31302,8 +31806,8 @@ "question__title": "Depth of BST Given Insertion Order", "question__title_slug": "depth-of-bst-given-insertion-order", "question__hide": false, - "total_acs": 510, - "total_submitted": 1030, + "total_acs": 517, + "total_submitted": 1058, "total_column_articles": 14, "frontend_question_id": "1902", "is_new_question": false @@ -31323,9 +31827,9 @@ "question__title": "Longest Common Subpath", "question__title_slug": "longest-common-subpath", "question__hide": false, - "total_acs": 2971, - "total_submitted": 10944, - "total_column_articles": 51, + "total_acs": 3031, + "total_submitted": 11069, + "total_column_articles": 52, "frontend_question_id": "1923", "is_new_question": false }, @@ -31344,8 +31848,8 @@ "question__title": "Count Good Numbers", "question__title_slug": "count-good-numbers", "question__hide": false, - "total_acs": 7590, - "total_submitted": 20526, + "total_acs": 7654, + "total_submitted": 20670, "total_column_articles": 107, "frontend_question_id": "1922", "is_new_question": false @@ -31365,9 +31869,9 @@ "question__title": "Eliminate Maximum Number of Monsters", "question__title_slug": "eliminate-maximum-number-of-monsters", "question__hide": false, - "total_acs": 29422, - "total_submitted": 59977, - "total_column_articles": 309, + "total_acs": 29486, + "total_submitted": 60111, + "total_column_articles": 310, "frontend_question_id": "1921", "is_new_question": false }, @@ -31386,9 +31890,9 @@ "question__title": "Build Array from Permutation", "question__title_slug": "build-array-from-permutation", "question__hide": false, - "total_acs": 39640, - "total_submitted": 45898, - "total_column_articles": 349, + "total_acs": 40346, + "total_submitted": 46695, + "total_column_articles": 347, "frontend_question_id": "1920", "is_new_question": false }, @@ -31407,9 +31911,9 @@ "question__title": "Find a Peak Element II", "question__title_slug": "find-a-peak-element-ii", "question__hide": false, - "total_acs": 23292, - "total_submitted": 39064, - "total_column_articles": 223, + "total_acs": 23483, + "total_submitted": 39403, + "total_column_articles": 225, "frontend_question_id": "1901", "is_new_question": false }, @@ -31428,9 +31932,9 @@ "question__title": "Page Recommendations II", "question__title_slug": "page-recommendations-ii", "question__hide": false, - "total_acs": 2640, - "total_submitted": 6838, - "total_column_articles": 38, + "total_acs": 2697, + "total_submitted": 6997, + "total_column_articles": 39, "frontend_question_id": "1892", "is_new_question": false }, @@ -31449,8 +31953,8 @@ "question__title": "Cutting Ribbons", "question__title_slug": "cutting-ribbons", "question__hide": false, - "total_acs": 4708, - "total_submitted": 11010, + "total_acs": 4746, + "total_submitted": 11085, "total_column_articles": 55, "frontend_question_id": "1891", "is_new_question": false @@ -31470,8 +31974,8 @@ "question__title": "Number of Wonderful Substrings", "question__title_slug": "number-of-wonderful-substrings", "question__hide": false, - "total_acs": 5349, - "total_submitted": 11537, + "total_acs": 5406, + "total_submitted": 11631, "total_column_articles": 88, "frontend_question_id": "1915", "is_new_question": false @@ -31491,8 +31995,8 @@ "question__title": "Cyclically Rotating a Grid", "question__title_slug": "cyclically-rotating-a-grid", "question__hide": false, - "total_acs": 4644, - "total_submitted": 9838, + "total_acs": 4678, + "total_submitted": 9907, "total_column_articles": 103, "frontend_question_id": "1914", "is_new_question": false @@ -31512,9 +32016,9 @@ "question__title": "Maximum Product Difference Between Two Pairs", "question__title_slug": "maximum-product-difference-between-two-pairs", "question__hide": false, - "total_acs": 23299, - "total_submitted": 28878, - "total_column_articles": 264, + "total_acs": 23699, + "total_submitted": 29359, + "total_column_articles": 269, "frontend_question_id": "1913", "is_new_question": false }, @@ -31533,9 +32037,9 @@ "question__title": "The Latest Login in 2020", "question__title_slug": "the-latest-login-in-2020", "question__hide": false, - "total_acs": 35447, - "total_submitted": 50780, - "total_column_articles": 232, + "total_acs": 36174, + "total_submitted": 51848, + "total_column_articles": 233, "frontend_question_id": "1890", "is_new_question": false }, @@ -31554,8 +32058,8 @@ "question__title": "Minimum Cost to Reach Destination in Time", "question__title_slug": "minimum-cost-to-reach-destination-in-time", "question__hide": false, - "total_acs": 6033, - "total_submitted": 13103, + "total_acs": 6109, + "total_submitted": 13291, "total_column_articles": 89, "frontend_question_id": "1928", "is_new_question": false @@ -31575,8 +32079,8 @@ "question__title": "Sum Game", "question__title_slug": "sum-game", "question__hide": false, - "total_acs": 3519, - "total_submitted": 7913, + "total_acs": 3564, + "total_submitted": 8048, "total_column_articles": 72, "frontend_question_id": "1927", "is_new_question": false @@ -31596,9 +32100,9 @@ "question__title": "Nearest Exit from Entrance in Maze", "question__title_slug": "nearest-exit-from-entrance-in-maze", "question__hide": false, - "total_acs": 20346, - "total_submitted": 50498, - "total_column_articles": 231, + "total_acs": 21190, + "total_submitted": 52509, + "total_column_articles": 238, "frontend_question_id": "1926", "is_new_question": false }, @@ -31617,9 +32121,9 @@ "question__title": "Count Square Sum Triples", "question__title_slug": "count-square-sum-triples", "question__hide": false, - "total_acs": 14709, - "total_submitted": 21347, - "total_column_articles": 158, + "total_acs": 15023, + "total_submitted": 21790, + "total_column_articles": 161, "frontend_question_id": "1925", "is_new_question": false }, @@ -31638,8 +32142,8 @@ "question__title": "Count Pairs in Two Arrays", "question__title_slug": "count-pairs-in-two-arrays", "question__hide": false, - "total_acs": 1317, - "total_submitted": 2234, + "total_acs": 1329, + "total_submitted": 2252, "total_column_articles": 32, "frontend_question_id": "1885", "is_new_question": false @@ -31659,9 +32163,9 @@ "question__title": "Count Sub Islands", "question__title_slug": "count-sub-islands", "question__hide": false, - "total_acs": 29444, - "total_submitted": 43706, - "total_column_articles": 452, + "total_acs": 29825, + "total_submitted": 44330, + "total_column_articles": 455, "frontend_question_id": "1905", "is_new_question": false }, @@ -31680,8 +32184,8 @@ "question__title": "Minimum Absolute Difference Queries", "question__title_slug": "minimum-absolute-difference-queries", "question__hide": false, - "total_acs": 4379, - "total_submitted": 9533, + "total_acs": 4405, + "total_submitted": 9603, "total_column_articles": 75, "frontend_question_id": "1906", "is_new_question": false @@ -31701,9 +32205,9 @@ "question__title": "The Number of Full Rounds You Have Played", "question__title_slug": "the-number-of-full-rounds-you-have-played", "question__hide": false, - "total_acs": 6304, - "total_submitted": 19627, - "total_column_articles": 115, + "total_acs": 6346, + "total_submitted": 19739, + "total_column_articles": 117, "frontend_question_id": "1904", "is_new_question": false }, @@ -31722,9 +32226,9 @@ "question__title": "Largest Odd Number in String", "question__title_slug": "largest-odd-number-in-string", "question__hide": false, - "total_acs": 18833, - "total_submitted": 30844, - "total_column_articles": 229, + "total_acs": 19178, + "total_submitted": 31320, + "total_column_articles": 233, "frontend_question_id": "1903", "is_new_question": false }, @@ -31743,8 +32247,8 @@ "question__title": "Egg Drop With 2 Eggs and N Floors", "question__title_slug": "egg-drop-with-2-eggs-and-n-floors", "question__hide": false, - "total_acs": 9208, - "total_submitted": 12938, + "total_acs": 9350, + "total_submitted": 13132, "total_column_articles": 117, "frontend_question_id": "1884", "is_new_question": false @@ -31764,8 +32268,8 @@ "question__title": "Group Employees of the Same Salary", "question__title_slug": "group-employees-of-the-same-salary", "question__hide": false, - "total_acs": 2799, - "total_submitted": 4406, + "total_acs": 2840, + "total_submitted": 4464, "total_column_articles": 49, "frontend_question_id": "1875", "is_new_question": false @@ -31785,9 +32289,9 @@ "question__title": "Minimize Product Sum of Two Arrays", "question__title_slug": "minimize-product-sum-of-two-arrays", "question__hide": false, - "total_acs": 1252, - "total_submitted": 1440, - "total_column_articles": 41, + "total_acs": 1278, + "total_submitted": 1466, + "total_column_articles": 42, "frontend_question_id": "1874", "is_new_question": false }, @@ -31806,8 +32310,8 @@ "question__title": "The Earliest and Latest Rounds Where Players Compete", "question__title_slug": "the-earliest-and-latest-rounds-where-players-compete", "question__hide": false, - "total_acs": 2054, - "total_submitted": 4409, + "total_acs": 2073, + "total_submitted": 4456, "total_column_articles": 51, "frontend_question_id": "1900", "is_new_question": false @@ -31827,9 +32331,9 @@ "question__title": "Maximum Number of Removable Characters", "question__title_slug": "maximum-number-of-removable-characters", "question__hide": false, - "total_acs": 9980, - "total_submitted": 25378, - "total_column_articles": 128, + "total_acs": 10153, + "total_submitted": 25719, + "total_column_articles": 131, "frontend_question_id": "1898", "is_new_question": false }, @@ -31848,8 +32352,8 @@ "question__title": "Merge Triplets to Form Target Triplet", "question__title_slug": "merge-triplets-to-form-target-triplet", "question__hide": false, - "total_acs": 6384, - "total_submitted": 9657, + "total_acs": 6443, + "total_submitted": 9743, "total_column_articles": 90, "frontend_question_id": "1899", "is_new_question": false @@ -31869,9 +32373,9 @@ "question__title": "Redistribute Characters to Make All Strings Equal", "question__title_slug": "redistribute-characters-to-make-all-strings-equal", "question__hide": false, - "total_acs": 12082, - "total_submitted": 21679, - "total_column_articles": 156, + "total_acs": 12240, + "total_submitted": 21925, + "total_column_articles": 157, "frontend_question_id": "1897", "is_new_question": false }, @@ -31890,9 +32394,9 @@ "question__title": "Calculate Special Bonus", "question__title_slug": "calculate-special-bonus", "question__hide": false, - "total_acs": 93014, - "total_submitted": 150628, - "total_column_articles": 456, + "total_acs": 94235, + "total_submitted": 152836, + "total_column_articles": 457, "frontend_question_id": "1873", "is_new_question": false }, @@ -31911,8 +32415,8 @@ "question__title": "Design Movie Rental System", "question__title_slug": "design-movie-rental-system", "question__hide": false, - "total_acs": 4642, - "total_submitted": 19040, + "total_acs": 4666, + "total_submitted": 19149, "total_column_articles": 88, "frontend_question_id": "1912", "is_new_question": false @@ -31932,9 +32436,9 @@ "question__title": "Maximum Alternating Subsequence Sum", "question__title_slug": "maximum-alternating-subsequence-sum", "question__hide": false, - "total_acs": 27123, - "total_submitted": 40170, - "total_column_articles": 313, + "total_acs": 27276, + "total_submitted": 40405, + "total_column_articles": 314, "frontend_question_id": "1911", "is_new_question": false }, @@ -31953,9 +32457,9 @@ "question__title": "Remove All Occurrences of a Substring", "question__title_slug": "remove-all-occurrences-of-a-substring", "question__hide": false, - "total_acs": 7645, - "total_submitted": 11479, - "total_column_articles": 138, + "total_acs": 7750, + "total_submitted": 11626, + "total_column_articles": 141, "frontend_question_id": "1910", "is_new_question": false }, @@ -31974,8 +32478,8 @@ "question__title": "Remove One Element to Make the Array Strictly Increasing", "question__title_slug": "remove-one-element-to-make-the-array-strictly-increasing", "question__hide": false, - "total_acs": 12070, - "total_submitted": 39888, + "total_acs": 12294, + "total_submitted": 40531, "total_column_articles": 184, "frontend_question_id": "1909", "is_new_question": false @@ -31995,8 +32499,8 @@ "question__title": "Product of Two Run-Length Encoded Arrays", "question__title_slug": "product-of-two-run-length-encoded-arrays", "question__hide": false, - "total_acs": 2451, - "total_submitted": 4930, + "total_acs": 2467, + "total_submitted": 4973, "total_column_articles": 52, "frontend_question_id": "1868", "is_new_question": false @@ -32016,8 +32520,8 @@ "question__title": "Minimum Space Wasted From Packaging", "question__title_slug": "minimum-space-wasted-from-packaging", "question__hide": false, - "total_acs": 4136, - "total_submitted": 13600, + "total_acs": 4158, + "total_submitted": 13678, "total_column_articles": 67, "frontend_question_id": "1889", "is_new_question": false @@ -32037,8 +32541,8 @@ "question__title": "Minimum Number of Flips to Make the Binary String Alternating", "question__title_slug": "minimum-number-of-flips-to-make-the-binary-string-alternating", "question__hide": false, - "total_acs": 4761, - "total_submitted": 13078, + "total_acs": 4801, + "total_submitted": 13185, "total_column_articles": 101, "frontend_question_id": "1888", "is_new_question": false @@ -32058,9 +32562,9 @@ "question__title": "Reduction Operations to Make the Array Elements Equal", "question__title_slug": "reduction-operations-to-make-the-array-elements-equal", "question__hide": false, - "total_acs": 8856, - "total_submitted": 13334, - "total_column_articles": 122, + "total_acs": 8937, + "total_submitted": 13466, + "total_column_articles": 124, "frontend_question_id": "1887", "is_new_question": false }, @@ -32079,9 +32583,9 @@ "question__title": "Determine Whether Matrix Can Be Obtained By Rotation", "question__title_slug": "determine-whether-matrix-can-be-obtained-by-rotation", "question__hide": false, - "total_acs": 12142, - "total_submitted": 20283, - "total_column_articles": 181, + "total_acs": 12239, + "total_submitted": 20435, + "total_column_articles": 183, "frontend_question_id": "1886", "is_new_question": false }, @@ -32100,8 +32604,8 @@ "question__title": "Orders With Maximum Quantity Above Average", "question__title_slug": "orders-with-maximum-quantity-above-average", "question__hide": false, - "total_acs": 5412, - "total_submitted": 8055, + "total_acs": 5456, + "total_submitted": 8116, "total_column_articles": 61, "frontend_question_id": "1867", "is_new_question": false @@ -32121,8 +32625,8 @@ "question__title": "Minimum Skips to Arrive at Meeting On Time", "question__title_slug": "minimum-skips-to-arrive-at-meeting-on-time", "question__hide": false, - "total_acs": 2791, - "total_submitted": 6692, + "total_acs": 2798, + "total_submitted": 6717, "total_column_articles": 40, "frontend_question_id": "1883", "is_new_question": false @@ -32142,8 +32646,8 @@ "question__title": "Process Tasks Using Servers", "question__title_slug": "process-tasks-using-servers", "question__hide": false, - "total_acs": 6046, - "total_submitted": 19182, + "total_acs": 6085, + "total_submitted": 19264, "total_column_articles": 154, "frontend_question_id": "1882", "is_new_question": false @@ -32163,8 +32667,8 @@ "question__title": "Maximum Value after Insertion", "question__title_slug": "maximum-value-after-insertion", "question__hide": false, - "total_acs": 10071, - "total_submitted": 26270, + "total_acs": 10142, + "total_submitted": 26429, "total_column_articles": 106, "frontend_question_id": "1881", "is_new_question": false @@ -32184,9 +32688,9 @@ "question__title": "Check if Word Equals Summation of Two Words", "question__title_slug": "check-if-word-equals-summation-of-two-words", "question__hide": false, - "total_acs": 14341, - "total_submitted": 18836, - "total_column_articles": 226, + "total_acs": 14522, + "total_submitted": 19043, + "total_column_articles": 227, "frontend_question_id": "1880", "is_new_question": false }, @@ -32205,8 +32709,8 @@ "question__title": "Longest Word With All Prefixes", "question__title_slug": "longest-word-with-all-prefixes", "question__hide": false, - "total_acs": 1266, - "total_submitted": 1895, + "total_acs": 1276, + "total_submitted": 1910, "total_column_articles": 47, "frontend_question_id": "1858", "is_new_question": false @@ -32226,9 +32730,9 @@ "question__title": "Minimum Cost to Change the Final Value of Expression", "question__title_slug": "minimum-cost-to-change-the-final-value-of-expression", "question__hide": false, - "total_acs": 1509, - "total_submitted": 2941, - "total_column_articles": 39, + "total_acs": 1518, + "total_submitted": 2980, + "total_column_articles": 40, "frontend_question_id": "1896", "is_new_question": false }, @@ -32247,8 +32751,8 @@ "question__title": "Maximum Cost of Trip With K Highways", "question__title_slug": "maximum-cost-of-trip-with-k-highways", "question__hide": false, - "total_acs": 381, - "total_submitted": 686, + "total_acs": 384, + "total_submitted": 708, "total_column_articles": 16, "frontend_question_id": "2247", "is_new_question": false @@ -32268,9 +32772,9 @@ "question__title": "Find the Student that Will Replace the Chalk", "question__title_slug": "find-the-student-that-will-replace-the-chalk", "question__hide": false, - "total_acs": 49340, - "total_submitted": 107410, - "total_column_articles": 626, + "total_acs": 49437, + "total_submitted": 107582, + "total_column_articles": 624, "frontend_question_id": "1894", "is_new_question": false }, @@ -32289,8 +32793,8 @@ "question__title": "Check if All the Integers in a Range Are Covered", "question__title_slug": "check-if-all-the-integers-in-a-range-are-covered", "question__hide": false, - "total_acs": 40908, - "total_submitted": 69328, + "total_acs": 41090, + "total_submitted": 69613, "total_column_articles": 542, "frontend_question_id": "1893", "is_new_question": false @@ -32310,8 +32814,8 @@ "question__title": "Convert Date Format", "question__title_slug": "convert-date-format", "question__hide": false, - "total_acs": 3789, - "total_submitted": 5937, + "total_acs": 3849, + "total_submitted": 6013, "total_column_articles": 35, "frontend_question_id": "1853", "is_new_question": false @@ -32331,8 +32835,8 @@ "question__title": "Distinct Numbers in Each Subarray", "question__title_slug": "distinct-numbers-in-each-subarray", "question__hide": false, - "total_acs": 953, - "total_submitted": 1552, + "total_acs": 972, + "total_submitted": 1581, "total_column_articles": 22, "frontend_question_id": "1852", "is_new_question": false @@ -32352,8 +32856,8 @@ "question__title": "Stone Game VIII", "question__title_slug": "stone-game-viii", "question__hide": false, - "total_acs": 3698, - "total_submitted": 5987, + "total_acs": 3717, + "total_submitted": 6032, "total_column_articles": 52, "frontend_question_id": "1872", "is_new_question": false @@ -32373,8 +32877,8 @@ "question__title": "Jump Game VII", "question__title_slug": "jump-game-vii", "question__hide": false, - "total_acs": 10431, - "total_submitted": 35749, + "total_acs": 10544, + "total_submitted": 36185, "total_column_articles": 191, "frontend_question_id": "1871", "is_new_question": false @@ -32394,9 +32898,9 @@ "question__title": "Minimum Speed to Arrive on Time", "question__title_slug": "minimum-speed-to-arrive-on-time", "question__hide": false, - "total_acs": 15213, - "total_submitted": 36063, - "total_column_articles": 161, + "total_acs": 15410, + "total_submitted": 36522, + "total_column_articles": 163, "frontend_question_id": "1870", "is_new_question": false }, @@ -32415,9 +32919,9 @@ "question__title": "Longer Contiguous Segments of Ones than Zeros", "question__title_slug": "longer-contiguous-segments-of-ones-than-zeros", "question__hide": false, - "total_acs": 21306, - "total_submitted": 30533, - "total_column_articles": 288, + "total_acs": 21638, + "total_submitted": 31055, + "total_column_articles": 289, "frontend_question_id": "1869", "is_new_question": false }, @@ -32436,9 +32940,9 @@ "question__title": "Suspicious Bank Accounts", "question__title_slug": "suspicious-bank-accounts", "question__hide": false, - "total_acs": 3420, - "total_submitted": 8018, - "total_column_articles": 49, + "total_acs": 3476, + "total_submitted": 8158, + "total_column_articles": 50, "frontend_question_id": "1843", "is_new_question": false }, @@ -32457,8 +32961,8 @@ "question__title": "Next Palindrome Using Same Digits", "question__title_slug": "next-palindrome-using-same-digits", "question__hide": false, - "total_acs": 430, - "total_submitted": 809, + "total_acs": 432, + "total_submitted": 829, "total_column_articles": 20, "frontend_question_id": "1842", "is_new_question": false @@ -32478,9 +32982,9 @@ "question__title": "Number of Ways to Rearrange Sticks With K Sticks Visible", "question__title_slug": "number-of-ways-to-rearrange-sticks-with-k-sticks-visible", "question__hide": false, - "total_acs": 4064, - "total_submitted": 6516, - "total_column_articles": 75, + "total_acs": 4100, + "total_submitted": 6564, + "total_column_articles": 77, "frontend_question_id": "1866", "is_new_question": false }, @@ -32499,9 +33003,9 @@ "question__title": "Finding Pairs With a Certain Sum", "question__title_slug": "finding-pairs-with-a-certain-sum", "question__hide": false, - "total_acs": 7694, - "total_submitted": 15058, - "total_column_articles": 89, + "total_acs": 7733, + "total_submitted": 15121, + "total_column_articles": 91, "frontend_question_id": "1865", "is_new_question": false }, @@ -32520,9 +33024,9 @@ "question__title": "Minimum Number of Swaps to Make the Binary String Alternating", "question__title_slug": "minimum-number-of-swaps-to-make-the-binary-string-alternating", "question__hide": false, - "total_acs": 8087, - "total_submitted": 19579, - "total_column_articles": 176, + "total_acs": 8232, + "total_submitted": 19859, + "total_column_articles": 178, "frontend_question_id": "1864", "is_new_question": false }, @@ -32541,9 +33045,9 @@ "question__title": "Sum of All Subset XOR Totals", "question__title_slug": "sum-of-all-subset-xor-totals", "question__hide": false, - "total_acs": 24598, - "total_submitted": 29448, - "total_column_articles": 295, + "total_acs": 25019, + "total_submitted": 29981, + "total_column_articles": 299, "frontend_question_id": "1863", "is_new_question": false }, @@ -32562,8 +33066,8 @@ "question__title": "Sort Linked List Already Sorted Using Absolute Values", "question__title_slug": "sort-linked-list-already-sorted-using-absolute-values", "question__hide": false, - "total_acs": 945, - "total_submitted": 1451, + "total_acs": 968, + "total_submitted": 1485, "total_column_articles": 35, "frontend_question_id": "2046", "is_new_question": false @@ -32583,8 +33087,8 @@ "question__title": "League Statistics", "question__title_slug": "league-statistics", "question__hide": false, - "total_acs": 3299, - "total_submitted": 6339, + "total_acs": 3341, + "total_submitted": 6421, "total_column_articles": 71, "frontend_question_id": "1841", "is_new_question": false @@ -32604,8 +33108,8 @@ "question__title": "Get Biggest Three Rhombus Sums in a Grid", "question__title_slug": "get-biggest-three-rhombus-sums-in-a-grid", "question__hide": false, - "total_acs": 3473, - "total_submitted": 7414, + "total_acs": 3493, + "total_submitted": 7465, "total_column_articles": 80, "frontend_question_id": "1878", "is_new_question": false @@ -32625,9 +33129,9 @@ "question__title": "Minimum XOR Sum of Two Arrays", "question__title_slug": "minimum-xor-sum-of-two-arrays", "question__hide": false, - "total_acs": 4808, - "total_submitted": 9104, - "total_column_articles": 77, + "total_acs": 4896, + "total_submitted": 9276, + "total_column_articles": 78, "frontend_question_id": "1879", "is_new_question": false }, @@ -32646,9 +33150,9 @@ "question__title": "Minimize Maximum Pair Sum in Array", "question__title_slug": "minimize-maximum-pair-sum-in-array", "question__hide": false, - "total_acs": 39741, - "total_submitted": 49037, - "total_column_articles": 501, + "total_acs": 39909, + "total_submitted": 49250, + "total_column_articles": 500, "frontend_question_id": "1877", "is_new_question": false }, @@ -32667,9 +33171,9 @@ "question__title": "Substrings of Size Three with Distinct Characters", "question__title_slug": "substrings-of-size-three-with-distinct-characters", "question__hide": false, - "total_acs": 19257, - "total_submitted": 27273, - "total_column_articles": 301, + "total_acs": 19587, + "total_submitted": 27773, + "total_column_articles": 300, "frontend_question_id": "1876", "is_new_question": false }, @@ -32688,8 +33192,8 @@ "question__title": "Largest Color Value in a Directed Graph", "question__title_slug": "largest-color-value-in-a-directed-graph", "question__hide": false, - "total_acs": 5032, - "total_submitted": 10177, + "total_acs": 5136, + "total_submitted": 10366, "total_column_articles": 68, "frontend_question_id": "1857", "is_new_question": false @@ -32709,9 +33213,9 @@ "question__title": "Maximum Subarray Min-Product", "question__title_slug": "maximum-subarray-min-product", "question__hide": false, - "total_acs": 11032, - "total_submitted": 28822, - "total_column_articles": 161, + "total_acs": 11144, + "total_submitted": 29099, + "total_column_articles": 162, "frontend_question_id": "1856", "is_new_question": false }, @@ -32730,9 +33234,9 @@ "question__title": "Maximum Distance Between a Pair of Values", "question__title_slug": "maximum-distance-between-a-pair-of-values", "question__hide": false, - "total_acs": 22321, - "total_submitted": 37680, - "total_column_articles": 249, + "total_acs": 22417, + "total_submitted": 37843, + "total_column_articles": 250, "frontend_question_id": "1855", "is_new_question": false }, @@ -32751,9 +33255,9 @@ "question__title": "Maximum Population Year", "question__title_slug": "maximum-population-year", "question__hide": false, - "total_acs": 19110, - "total_submitted": 26569, - "total_column_articles": 236, + "total_acs": 19312, + "total_submitted": 26881, + "total_column_articles": 238, "frontend_question_id": "1854", "is_new_question": false }, @@ -32772,8 +33276,8 @@ "question__title": "Remove Duplicates From an Unsorted Linked List", "question__title_slug": "remove-duplicates-from-an-unsorted-linked-list", "question__hide": false, - "total_acs": 2325, - "total_submitted": 3144, + "total_acs": 2368, + "total_submitted": 3191, "total_column_articles": 64, "frontend_question_id": "1836", "is_new_question": false @@ -32793,8 +33297,8 @@ "question__title": "Maximum Transaction Each Day", "question__title_slug": "maximum-transaction-each-day", "question__hide": false, - "total_acs": 6597, - "total_submitted": 8677, + "total_acs": 6855, + "total_submitted": 9030, "total_column_articles": 85, "frontend_question_id": "1831", "is_new_question": false @@ -32814,9 +33318,9 @@ "question__title": "Faulty Sensor", "question__title_slug": "faulty-sensor", "question__hide": false, - "total_acs": 972, - "total_submitted": 2341, - "total_column_articles": 40, + "total_acs": 995, + "total_submitted": 2394, + "total_column_articles": 41, "frontend_question_id": "1826", "is_new_question": false }, @@ -32835,8 +33339,8 @@ "question__title": "Maximum Number of People That Can Be Caught in Tag", "question__title_slug": "maximum-number-of-people-that-can-be-caught-in-tag", "question__hide": false, - "total_acs": 410, - "total_submitted": 720, + "total_acs": 418, + "total_submitted": 750, "total_column_articles": 16, "frontend_question_id": "1989", "is_new_question": false @@ -32856,9 +33360,9 @@ "question__title": "Minimum Adjacent Swaps to Reach the Kth Smallest Number", "question__title_slug": "minimum-adjacent-swaps-to-reach-the-kth-smallest-number", "question__hide": false, - "total_acs": 3837, - "total_submitted": 6085, - "total_column_articles": 71, + "total_acs": 3874, + "total_submitted": 6158, + "total_column_articles": 72, "frontend_question_id": "1850", "is_new_question": false }, @@ -32877,9 +33381,9 @@ "question__title": "Minimum Interval to Include Each Query", "question__title_slug": "minimum-interval-to-include-each-query", "question__hide": false, - "total_acs": 15623, - "total_submitted": 29944, - "total_column_articles": 174, + "total_acs": 15652, + "total_submitted": 29998, + "total_column_articles": 175, "frontend_question_id": "1851", "is_new_question": false }, @@ -32898,9 +33402,9 @@ "question__title": "Splitting a String Into Descending Consecutive Values", "question__title_slug": "splitting-a-string-into-descending-consecutive-values", "question__hide": false, - "total_acs": 8080, - "total_submitted": 24094, - "total_column_articles": 144, + "total_acs": 8232, + "total_submitted": 24445, + "total_column_articles": 145, "frontend_question_id": "1849", "is_new_question": false }, @@ -32919,9 +33423,9 @@ "question__title": "Minimum Distance to the Target Element", "question__title_slug": "minimum-distance-to-the-target-element", "question__hide": false, - "total_acs": 15275, - "total_submitted": 23051, - "total_column_articles": 200, + "total_acs": 15412, + "total_submitted": 23251, + "total_column_articles": 201, "frontend_question_id": "1848", "is_new_question": false }, @@ -32940,8 +33444,8 @@ "question__title": "Find Customers With Positive Revenue this Year", "question__title_slug": "find-customers-with-positive-revenue-this-year", "question__hide": false, - "total_acs": 11578, - "total_submitted": 13405, + "total_acs": 12353, + "total_submitted": 14330, "total_column_articles": 54, "frontend_question_id": "1821", "is_new_question": false @@ -32961,9 +33465,9 @@ "question__title": "Rotating the Box", "question__title_slug": "rotating-the-box", "question__hide": false, - "total_acs": 6433, - "total_submitted": 10076, - "total_column_articles": 123, + "total_acs": 6480, + "total_submitted": 10163, + "total_column_articles": 124, "frontend_question_id": "1861", "is_new_question": false }, @@ -32982,9 +33486,9 @@ "question__title": "Incremental Memory Leak", "question__title_slug": "incremental-memory-leak", "question__hide": false, - "total_acs": 7370, - "total_submitted": 9659, - "total_column_articles": 134, + "total_acs": 7449, + "total_submitted": 9764, + "total_column_articles": 135, "frontend_question_id": "1860", "is_new_question": false }, @@ -33003,8 +33507,8 @@ "question__title": "Sorting the Sentence", "question__title_slug": "sorting-the-sentence", "question__hide": false, - "total_acs": 17546, - "total_submitted": 23950, + "total_acs": 17803, + "total_submitted": 24306, "total_column_articles": 351, "frontend_question_id": "1859", "is_new_question": false @@ -33024,8 +33528,8 @@ "question__title": "Maximum Number of Accepted Invitations", "question__title_slug": "maximum-number-of-accepted-invitations", "question__hide": false, - "total_acs": 482, - "total_submitted": 1036, + "total_acs": 490, + "total_submitted": 1053, "total_column_articles": 18, "frontend_question_id": "1820", "is_new_question": false @@ -33045,8 +33549,8 @@ "question__title": "Maximum Building Height", "question__title_slug": "maximum-building-height", "question__hide": false, - "total_acs": 3186, - "total_submitted": 7985, + "total_acs": 3203, + "total_submitted": 8043, "total_column_articles": 66, "frontend_question_id": "1840", "is_new_question": false @@ -33066,9 +33570,9 @@ "question__title": "Longest Substring Of All Vowels in Order", "question__title_slug": "longest-substring-of-all-vowels-in-order", "question__hide": false, - "total_acs": 14040, - "total_submitted": 28688, - "total_column_articles": 242, + "total_acs": 14162, + "total_submitted": 28999, + "total_column_articles": 246, "frontend_question_id": "1839", "is_new_question": false }, @@ -33087,9 +33591,9 @@ "question__title": "Frequency of the Most Frequent Element", "question__title_slug": "frequency-of-the-most-frequent-element", "question__hide": false, - "total_acs": 38067, - "total_submitted": 88420, - "total_column_articles": 396, + "total_acs": 38249, + "total_submitted": 88857, + "total_column_articles": 398, "frontend_question_id": "1838", "is_new_question": false }, @@ -33108,9 +33612,9 @@ "question__title": "Sum of Digits in Base K", "question__title_slug": "sum-of-digits-in-base-k", "question__hide": false, - "total_acs": 17514, - "total_submitted": 22298, - "total_column_articles": 187, + "total_acs": 17724, + "total_submitted": 22560, + "total_column_articles": 191, "frontend_question_id": "1837", "is_new_question": false }, @@ -33129,9 +33633,9 @@ "question__title": "Find Interview Candidates", "question__title_slug": "find-interview-candidates", "question__hide": false, - "total_acs": 3770, - "total_submitted": 6064, - "total_column_articles": 61, + "total_acs": 3810, + "total_submitted": 6143, + "total_column_articles": 62, "frontend_question_id": "1811", "is_new_question": false }, @@ -33150,8 +33654,8 @@ "question__title": "Find XOR Sum of All Pairs Bitwise AND", "question__title_slug": "find-xor-sum-of-all-pairs-bitwise-and", "question__hide": false, - "total_acs": 5639, - "total_submitted": 9880, + "total_acs": 5697, + "total_submitted": 9961, "total_column_articles": 84, "frontend_question_id": "1835", "is_new_question": false @@ -33171,8 +33675,8 @@ "question__title": "Single-Threaded CPU", "question__title_slug": "single-threaded-cpu", "question__hide": false, - "total_acs": 11204, - "total_submitted": 29236, + "total_acs": 11272, + "total_submitted": 29375, "total_column_articles": 191, "frontend_question_id": "1834", "is_new_question": false @@ -33192,9 +33696,9 @@ "question__title": "Maximum Ice Cream Bars", "question__title_slug": "maximum-ice-cream-bars", "question__hide": false, - "total_acs": 50455, - "total_submitted": 74103, - "total_column_articles": 469, + "total_acs": 50579, + "total_submitted": 74256, + "total_column_articles": 467, "frontend_question_id": "1833", "is_new_question": false }, @@ -33213,8 +33717,8 @@ "question__title": "Check if the Sentence Is Pangram", "question__title_slug": "check-if-the-sentence-is-pangram", "question__hide": false, - "total_acs": 54441, - "total_submitted": 64599, + "total_acs": 54810, + "total_submitted": 65026, "total_column_articles": 642, "frontend_question_id": "1832", "is_new_question": false @@ -33234,8 +33738,8 @@ "question__title": "Minimum Path Cost in a Hidden Grid", "question__title_slug": "minimum-path-cost-in-a-hidden-grid", "question__hide": false, - "total_acs": 448, - "total_submitted": 737, + "total_acs": 451, + "total_submitted": 761, "total_column_articles": 11, "frontend_question_id": "1810", "is_new_question": false @@ -33255,8 +33759,8 @@ "question__title": "Ad-Free Sessions", "question__title_slug": "ad-free-sessions", "question__hide": false, - "total_acs": 5128, - "total_submitted": 8379, + "total_acs": 5193, + "total_submitted": 8514, "total_column_articles": 56, "frontend_question_id": "1809", "is_new_question": false @@ -33276,8 +33780,8 @@ "question__title": "Closest Room", "question__title_slug": "closest-room", "question__hide": false, - "total_acs": 4263, - "total_submitted": 10447, + "total_acs": 4274, + "total_submitted": 10486, "total_column_articles": 82, "frontend_question_id": "1847", "is_new_question": false @@ -33297,9 +33801,9 @@ "question__title": "Maximum Element After Decreasing and Rearranging", "question__title_slug": "maximum-element-after-decreasing-and-rearranging", "question__hide": false, - "total_acs": 31782, - "total_submitted": 50346, - "total_column_articles": 419, + "total_acs": 31858, + "total_submitted": 50457, + "total_column_articles": 417, "frontend_question_id": "1846", "is_new_question": false }, @@ -33318,8 +33822,8 @@ "question__title": "Seat Reservation Manager", "question__title_slug": "seat-reservation-manager", "question__hide": false, - "total_acs": 16927, - "total_submitted": 35051, + "total_acs": 17011, + "total_submitted": 35192, "total_column_articles": 175, "frontend_question_id": "1845", "is_new_question": false @@ -33339,8 +33843,8 @@ "question__title": "Replace All Digits with Characters", "question__title_slug": "replace-all-digits-with-characters", "question__hide": false, - "total_acs": 15065, - "total_submitted": 19082, + "total_acs": 15247, + "total_submitted": 19303, "total_column_articles": 230, "frontend_question_id": "1844", "is_new_question": false @@ -33360,8 +33864,8 @@ "question__title": "Finding MK Average", "question__title_slug": "finding-mk-average", "question__hide": false, - "total_acs": 13939, - "total_submitted": 32014, + "total_acs": 13964, + "total_submitted": 32113, "total_column_articles": 192, "frontend_question_id": "1825", "is_new_question": false @@ -33381,9 +33885,9 @@ "question__title": "Minimum Sideway Jumps", "question__title_slug": "minimum-sideway-jumps", "question__hide": false, - "total_acs": 23884, - "total_submitted": 34967, - "total_column_articles": 339, + "total_acs": 23943, + "total_submitted": 35072, + "total_column_articles": 340, "frontend_question_id": "1824", "is_new_question": false }, @@ -33402,9 +33906,9 @@ "question__title": "Find the Winner of the Circular Game", "question__title_slug": "find-the-winner-of-the-circular-game", "question__hide": false, - "total_acs": 56579, - "total_submitted": 72318, - "total_column_articles": 594, + "total_acs": 56995, + "total_submitted": 72981, + "total_column_articles": 591, "frontend_question_id": "1823", "is_new_question": false }, @@ -33423,9 +33927,9 @@ "question__title": "Sign of the Product of an Array", "question__title_slug": "sign-of-the-product-of-an-array", "question__hide": false, - "total_acs": 84435, - "total_submitted": 119046, - "total_column_articles": 811, + "total_acs": 86459, + "total_submitted": 122202, + "total_column_articles": 821, "frontend_question_id": "1822", "is_new_question": false }, @@ -33444,9 +33948,9 @@ "question__title": "Implement Trie II (Prefix Tree)", "question__title_slug": "implement-trie-ii-prefix-tree", "question__hide": false, - "total_acs": 2750, - "total_submitted": 4790, - "total_column_articles": 63, + "total_acs": 2796, + "total_submitted": 4875, + "total_column_articles": 64, "frontend_question_id": "1804", "is_new_question": false }, @@ -33465,9 +33969,9 @@ "question__title": "Rearrange Products Table", "question__title_slug": "rearrange-products-table", "question__hide": false, - "total_acs": 48700, - "total_submitted": 62193, - "total_column_articles": 233, + "total_acs": 49478, + "total_submitted": 63149, + "total_column_articles": 237, "frontend_question_id": "1795", "is_new_question": false }, @@ -33486,8 +33990,8 @@ "question__title": "Number of Different Subsequences GCDs", "question__title_slug": "number-of-different-subsequences-gcds", "question__hide": false, - "total_acs": 16393, - "total_submitted": 25916, + "total_acs": 16424, + "total_submitted": 26023, "total_column_articles": 109, "frontend_question_id": "1819", "is_new_question": false @@ -33507,8 +34011,8 @@ "question__title": "Minimum Absolute Sum Difference", "question__title_slug": "minimum-absolute-sum-difference", "question__hide": false, - "total_acs": 32299, - "total_submitted": 85974, + "total_acs": 32351, + "total_submitted": 86148, "total_column_articles": 399, "frontend_question_id": "1818", "is_new_question": false @@ -33528,9 +34032,9 @@ "question__title": "Finding the Users Active Minutes", "question__title_slug": "finding-the-users-active-minutes", "question__hide": false, - "total_acs": 25189, - "total_submitted": 31724, - "total_column_articles": 317, + "total_acs": 25286, + "total_submitted": 31837, + "total_column_articles": 318, "frontend_question_id": "1817", "is_new_question": false }, @@ -33549,9 +34053,9 @@ "question__title": "Truncate Sentence", "question__title_slug": "truncate-sentence", "question__hide": false, - "total_acs": 56809, - "total_submitted": 78358, - "total_column_articles": 754, + "total_acs": 56997, + "total_submitted": 78578, + "total_column_articles": 753, "frontend_question_id": "1816", "is_new_question": false }, @@ -33570,8 +34074,8 @@ "question__title": "Count Pairs of Equal Substrings With Minimum Difference", "question__title_slug": "count-pairs-of-equal-substrings-with-minimum-difference", "question__hide": false, - "total_acs": 430, - "total_submitted": 783, + "total_acs": 434, + "total_submitted": 803, "total_column_articles": 13, "frontend_question_id": "1794", "is_new_question": false @@ -33591,9 +34095,9 @@ "question__title": "Primary Department for Each Employee", "question__title_slug": "primary-department-for-each-employee", "question__hide": false, - "total_acs": 18773, - "total_submitted": 27870, - "total_column_articles": 178, + "total_acs": 20325, + "total_submitted": 30091, + "total_column_articles": 184, "frontend_question_id": "1789", "is_new_question": false }, @@ -33612,8 +34116,8 @@ "question__title": "Minimum Number of Operations to Make String Sorted", "question__title_slug": "minimum-number-of-operations-to-make-string-sorted", "question__hide": false, - "total_acs": 1632, - "total_submitted": 3091, + "total_acs": 1636, + "total_submitted": 3114, "total_column_articles": 31, "frontend_question_id": "1830", "is_new_question": false @@ -33633,8 +34137,8 @@ "question__title": "Maximum XOR for Each Query", "question__title_slug": "maximum-xor-for-each-query", "question__hide": false, - "total_acs": 6986, - "total_submitted": 9549, + "total_acs": 7063, + "total_submitted": 9651, "total_column_articles": 129, "frontend_question_id": "1829", "is_new_question": false @@ -33654,8 +34158,8 @@ "question__title": "Queries on Number of Points Inside a Circle", "question__title_slug": "queries-on-number-of-points-inside-a-circle", "question__hide": false, - "total_acs": 31768, - "total_submitted": 36135, + "total_acs": 31969, + "total_submitted": 36364, "total_column_articles": 337, "frontend_question_id": "1828", "is_new_question": false @@ -33675,9 +34179,9 @@ "question__title": "Minimum Operations to Make the Array Increasing", "question__title_slug": "minimum-operations-to-make-the-array-increasing", "question__hide": false, - "total_acs": 41728, - "total_submitted": 51580, - "total_column_articles": 441, + "total_acs": 42069, + "total_submitted": 52017, + "total_column_articles": 444, "frontend_question_id": "1827", "is_new_question": false }, @@ -33696,8 +34200,8 @@ "question__title": "Maximize the Beauty of the Garden", "question__title_slug": "maximize-the-beauty-of-the-garden", "question__hide": false, - "total_acs": 762, - "total_submitted": 1198, + "total_acs": 767, + "total_submitted": 1219, "total_column_articles": 32, "frontend_question_id": "1788", "is_new_question": false @@ -33717,8 +34221,8 @@ "question__title": "Maximize Number of Nice Divisors", "question__title_slug": "maximize-number-of-nice-divisors", "question__hide": false, - "total_acs": 3581, - "total_submitted": 12274, + "total_acs": 3607, + "total_submitted": 12359, "total_column_articles": 65, "frontend_question_id": "1808", "is_new_question": false @@ -33738,8 +34242,8 @@ "question__title": "Minimum Number of Operations to Reinitialize a Permutation", "question__title_slug": "minimum-number-of-operations-to-reinitialize-a-permutation", "question__hide": false, - "total_acs": 26315, - "total_submitted": 34240, + "total_acs": 26356, + "total_submitted": 34292, "total_column_articles": 306, "frontend_question_id": "1806", "is_new_question": false @@ -33759,9 +34263,9 @@ "question__title": "Evaluate the Bracket Pairs of a String", "question__title_slug": "evaluate-the-bracket-pairs-of-a-string", "question__hide": false, - "total_acs": 31820, - "total_submitted": 47069, - "total_column_articles": 438, + "total_acs": 31894, + "total_submitted": 47178, + "total_column_articles": 439, "frontend_question_id": "1807", "is_new_question": false }, @@ -33780,9 +34284,9 @@ "question__title": "Number of Different Integers in a String", "question__title_slug": "number-of-different-integers-in-a-string", "question__hide": false, - "total_acs": 40699, - "total_submitted": 94608, - "total_column_articles": 565, + "total_acs": 40833, + "total_submitted": 94933, + "total_column_articles": 568, "frontend_question_id": "1805", "is_new_question": false }, @@ -33801,9 +34305,9 @@ "question__title": "Grand Slam Titles", "question__title_slug": "grand-slam-titles", "question__hide": false, - "total_acs": 8147, - "total_submitted": 10377, - "total_column_articles": 98, + "total_acs": 8422, + "total_submitted": 10761, + "total_column_articles": 100, "frontend_question_id": "1783", "is_new_question": false }, @@ -33822,8 +34326,8 @@ "question__title": "Shortest Path in a Hidden Grid", "question__title_slug": "shortest-path-in-a-hidden-grid", "question__hide": false, - "total_acs": 519, - "total_submitted": 1080, + "total_acs": 522, + "total_submitted": 1099, "total_column_articles": 16, "frontend_question_id": "1778", "is_new_question": false @@ -33843,9 +34347,9 @@ "question__title": "Maximum Number of Consecutive Values You Can Make", "question__title_slug": "maximum-number-of-consecutive-values-you-can-make", "question__hide": false, - "total_acs": 23881, - "total_submitted": 33569, - "total_column_articles": 243, + "total_acs": 23978, + "total_submitted": 33706, + "total_column_articles": 245, "frontend_question_id": "1798", "is_new_question": false }, @@ -33864,8 +34368,8 @@ "question__title": "Maximum Value at a Given Index in a Bounded Array", "question__title_slug": "maximum-value-at-a-given-index-in-a-bounded-array", "question__hide": false, - "total_acs": 25949, - "total_submitted": 68196, + "total_acs": 26084, + "total_submitted": 68577, "total_column_articles": 392, "frontend_question_id": "1802", "is_new_question": false @@ -33885,8 +34389,8 @@ "question__title": "Number of Orders in the Backlog", "question__title_slug": "number-of-orders-in-the-backlog", "question__hide": false, - "total_acs": 21125, - "total_submitted": 39611, + "total_acs": 21166, + "total_submitted": 39692, "total_column_articles": 304, "frontend_question_id": "1801", "is_new_question": false @@ -33906,8 +34410,8 @@ "question__title": "Maximum Ascending Subarray Sum", "question__title_slug": "maximum-ascending-subarray-sum", "question__hide": false, - "total_acs": 45838, - "total_submitted": 66900, + "total_acs": 46094, + "total_submitted": 67270, "total_column_articles": 658, "frontend_question_id": "1800", "is_new_question": false @@ -33927,8 +34431,8 @@ "question__title": "Product's Price for Each Store", "question__title_slug": "products-price-for-each-store", "question__hide": false, - "total_acs": 9400, - "total_submitted": 12098, + "total_acs": 9479, + "total_submitted": 12200, "total_column_articles": 92, "frontend_question_id": "1777", "is_new_question": false @@ -33948,9 +34452,9 @@ "question__title": "Count Nice Pairs in an Array", "question__title_slug": "count-nice-pairs-in-an-array", "question__hide": false, - "total_acs": 26053, - "total_submitted": 55151, - "total_column_articles": 316, + "total_acs": 26099, + "total_submitted": 55240, + "total_column_articles": 319, "frontend_question_id": "1814", "is_new_question": false }, @@ -33969,8 +34473,8 @@ "question__title": "Maximum Number of Groups Getting Fresh Donuts", "question__title_slug": "maximum-number-of-groups-getting-fresh-donuts", "question__hide": false, - "total_acs": 11454, - "total_submitted": 21551, + "total_acs": 11468, + "total_submitted": 21603, "total_column_articles": 94, "frontend_question_id": "1815", "is_new_question": false @@ -33990,8 +34494,8 @@ "question__title": "Sentence Similarity III", "question__title_slug": "sentence-similarity-iii", "question__hide": false, - "total_acs": 25933, - "total_submitted": 62376, + "total_acs": 25972, + "total_submitted": 62495, "total_column_articles": 336, "frontend_question_id": "1813", "is_new_question": false @@ -34011,8 +34515,8 @@ "question__title": "Determine Color of a Chessboard Square", "question__title_slug": "determine-color-of-a-chessboard-square", "question__hide": false, - "total_acs": 45015, - "total_submitted": 55414, + "total_acs": 45363, + "total_submitted": 55872, "total_column_articles": 722, "frontend_question_id": "1812", "is_new_question": false @@ -34032,9 +34536,9 @@ "question__title": "Sort Features by Popularity", "question__title_slug": "sort-features-by-popularity", "question__hide": false, - "total_acs": 885, - "total_submitted": 1850, - "total_column_articles": 21, + "total_acs": 893, + "total_submitted": 1875, + "total_column_articles": 22, "frontend_question_id": "1772", "is_new_question": false }, @@ -34053,9 +34557,9 @@ "question__title": "Maximum Score of a Good Subarray", "question__title_slug": "maximum-score-of-a-good-subarray", "question__hide": false, - "total_acs": 6519, - "total_submitted": 13977, - "total_column_articles": 134, + "total_acs": 22119, + "total_submitted": 39963, + "total_column_articles": 237, "frontend_question_id": "1793", "is_new_question": false }, @@ -34074,8 +34578,8 @@ "question__title": "Maximum Average Pass Ratio", "question__title_slug": "maximum-average-pass-ratio", "question__hide": false, - "total_acs": 24933, - "total_submitted": 42291, + "total_acs": 25027, + "total_submitted": 42433, "total_column_articles": 264, "frontend_question_id": "1792", "is_new_question": false @@ -34095,9 +34599,9 @@ "question__title": "Find Center of Star Graph", "question__title_slug": "find-center-of-star-graph", "question__hide": false, - "total_acs": 59522, - "total_submitted": 71996, - "total_column_articles": 522, + "total_acs": 59890, + "total_submitted": 72458, + "total_column_articles": 525, "frontend_question_id": "1791", "is_new_question": false }, @@ -34116,9 +34620,9 @@ "question__title": "Check if One String Swap Can Make Strings Equal", "question__title_slug": "check-if-one-string-swap-can-make-strings-equal", "question__hide": false, - "total_acs": 66555, - "total_submitted": 126832, - "total_column_articles": 885, + "total_acs": 66754, + "total_submitted": 127211, + "total_column_articles": 889, "frontend_question_id": "1790", "is_new_question": false }, @@ -34137,9 +34641,9 @@ "question__title": "Find the Subtasks That Did Not Execute", "question__title_slug": "find-the-subtasks-that-did-not-execute", "question__hide": false, - "total_acs": 4978, - "total_submitted": 6489, - "total_column_articles": 81, + "total_acs": 5169, + "total_submitted": 6757, + "total_column_articles": 82, "frontend_question_id": "1767", "is_new_question": false }, @@ -34158,8 +34662,8 @@ "question__title": "Make the XOR of All Segments Equal to Zero", "question__title_slug": "make-the-xor-of-all-segments-equal-to-zero", "question__hide": false, - "total_acs": 12944, - "total_submitted": 20178, + "total_acs": 12950, + "total_submitted": 20203, "total_column_articles": 67, "frontend_question_id": "1787", "is_new_question": false @@ -34179,9 +34683,9 @@ "question__title": "Number of Restricted Paths From First to Last Node", "question__title_slug": "number-of-restricted-paths-from-first-to-last-node", "question__hide": false, - "total_acs": 6425, - "total_submitted": 17361, - "total_column_articles": 139, + "total_acs": 6588, + "total_submitted": 17742, + "total_column_articles": 140, "frontend_question_id": "1786", "is_new_question": false }, @@ -34200,8 +34704,8 @@ "question__title": "Minimum Elements to Add to Form a Given Sum", "question__title_slug": "minimum-elements-to-add-to-form-a-given-sum", "question__hide": false, - "total_acs": 27752, - "total_submitted": 63575, + "total_acs": 27828, + "total_submitted": 63754, "total_column_articles": 294, "frontend_question_id": "1785", "is_new_question": false @@ -34221,9 +34725,9 @@ "question__title": "Check if Binary String Has at Most One Segment of Ones", "question__title_slug": "check-if-binary-string-has-at-most-one-segment-of-ones", "question__hide": false, - "total_acs": 41021, - "total_submitted": 69029, - "total_column_articles": 557, + "total_acs": 41187, + "total_submitted": 69273, + "total_column_articles": 562, "frontend_question_id": "1784", "is_new_question": false }, @@ -34242,8 +34746,8 @@ "question__title": "Buildings With an Ocean View", "question__title_slug": "buildings-with-an-ocean-view", "question__hide": false, - "total_acs": 3493, - "total_submitted": 4793, + "total_acs": 3576, + "total_submitted": 4890, "total_column_articles": 54, "frontend_question_id": "1762", "is_new_question": false @@ -34263,9 +34767,9 @@ "question__title": "Recyclable and Low Fat Products", "question__title_slug": "recyclable-and-low-fat-products", "question__hide": false, - "total_acs": 169475, - "total_submitted": 197203, - "total_column_articles": 365, + "total_acs": 175772, + "total_submitted": 204676, + "total_column_articles": 371, "frontend_question_id": "1757", "is_new_question": false }, @@ -34284,8 +34788,8 @@ "question__title": "Count Pairs With XOR in a Range", "question__title_slug": "count-pairs-with-xor-in-a-range", "question__hide": false, - "total_acs": 16489, - "total_submitted": 29250, + "total_acs": 16519, + "total_submitted": 29323, "total_column_articles": 161, "frontend_question_id": "1803", "is_new_question": false @@ -34305,9 +34809,9 @@ "question__title": "Maximize Score After N Operations", "question__title_slug": "maximize-score-after-n-operations", "question__hide": false, - "total_acs": 14278, - "total_submitted": 21780, - "total_column_articles": 167, + "total_acs": 14322, + "total_submitted": 21860, + "total_column_articles": 169, "frontend_question_id": "1799", "is_new_question": false }, @@ -34326,9 +34830,9 @@ "question__title": "Design Authentication Manager", "question__title_slug": "design-authentication-manager", "question__hide": false, - "total_acs": 33351, - "total_submitted": 51570, - "total_column_articles": 351, + "total_acs": 33491, + "total_submitted": 51791, + "total_column_articles": 352, "frontend_question_id": "1797", "is_new_question": false }, @@ -34347,9 +34851,9 @@ "question__title": "Second Largest Digit in a String", "question__title_slug": "second-largest-digit-in-a-string", "question__hide": false, - "total_acs": 38491, - "total_submitted": 70297, - "total_column_articles": 475, + "total_acs": 38689, + "total_submitted": 70639, + "total_column_articles": 476, "frontend_question_id": "1796", "is_new_question": false }, @@ -34368,8 +34872,8 @@ "question__title": "Design Most Recently Used Queue", "question__title_slug": "design-most-recently-used-queue", "question__hide": false, - "total_acs": 1668, - "total_submitted": 2052, + "total_acs": 1687, + "total_submitted": 2081, "total_column_articles": 36, "frontend_question_id": "1756", "is_new_question": false @@ -34389,9 +34893,9 @@ "question__title": "Car Fleet II", "question__title_slug": "car-fleet-ii", "question__hide": false, - "total_acs": 3376, - "total_submitted": 6811, - "total_column_articles": 71, + "total_acs": 3415, + "total_submitted": 6898, + "total_column_articles": 72, "frontend_question_id": "1776", "is_new_question": false }, @@ -34410,9 +34914,9 @@ "question__title": "Equal Sum Arrays With Minimum Number of Operations", "question__title_slug": "equal-sum-arrays-with-minimum-number-of-operations", "question__hide": false, - "total_acs": 25609, - "total_submitted": 45339, - "total_column_articles": 363, + "total_acs": 25654, + "total_submitted": 45439, + "total_column_articles": 364, "frontend_question_id": "1775", "is_new_question": false }, @@ -34431,8 +34935,8 @@ "question__title": "Closest Dessert Cost", "question__title_slug": "closest-dessert-cost", "question__hide": false, - "total_acs": 27559, - "total_submitted": 48094, + "total_acs": 27666, + "total_submitted": 48329, "total_column_articles": 309, "frontend_question_id": "1774", "is_new_question": false @@ -34452,9 +34956,9 @@ "question__title": "Count Items Matching a Rule", "question__title_slug": "count-items-matching-a-rule", "question__hide": false, - "total_acs": 53069, - "total_submitted": 61628, - "total_column_articles": 525, + "total_acs": 53319, + "total_submitted": 61917, + "total_column_articles": 523, "frontend_question_id": "1773", "is_new_question": false }, @@ -34473,8 +34977,8 @@ "question__title": "Leetflex Banned Accounts", "question__title_slug": "leetflex-banned-accounts", "question__hide": false, - "total_acs": 7957, - "total_submitted": 12666, + "total_acs": 8231, + "total_submitted": 13254, "total_column_articles": 98, "frontend_question_id": "1747", "is_new_question": false @@ -34494,9 +34998,9 @@ "question__title": "Maximize Palindrome Length From Subsequences", "question__title_slug": "maximize-palindrome-length-from-subsequences", "question__hide": false, - "total_acs": 4087, - "total_submitted": 10225, - "total_column_articles": 72, + "total_acs": 4173, + "total_submitted": 10420, + "total_column_articles": 73, "frontend_question_id": "1771", "is_new_question": false }, @@ -34515,9 +35019,9 @@ "question__title": "Maximum Score from Performing Multiplication Operations", "question__title_slug": "maximum-score-from-performing-multiplication-operations", "question__hide": false, - "total_acs": 6754, - "total_submitted": 16537, - "total_column_articles": 148, + "total_acs": 6835, + "total_submitted": 16677, + "total_column_articles": 151, "frontend_question_id": "1770", "is_new_question": false }, @@ -34536,9 +35040,9 @@ "question__title": "Minimum Number of Operations to Move All Balls to Each Box", "question__title_slug": "minimum-number-of-operations-to-move-all-balls-to-each-box", "question__hide": false, - "total_acs": 42419, - "total_submitted": 48386, - "total_column_articles": 579, + "total_acs": 42613, + "total_submitted": 48605, + "total_column_articles": 581, "frontend_question_id": "1769", "is_new_question": false }, @@ -34557,9 +35061,9 @@ "question__title": "Merge Strings Alternately", "question__title_slug": "merge-strings-alternately", "question__hide": false, - "total_acs": 116446, - "total_submitted": 158213, - "total_column_articles": 1173, + "total_acs": 122887, + "total_submitted": 167909, + "total_column_articles": 1207, "frontend_question_id": "1768", "is_new_question": false }, @@ -34578,8 +35082,8 @@ "question__title": "Maximum Subarray Sum After One Operation", "question__title_slug": "maximum-subarray-sum-after-one-operation", "question__hide": false, - "total_acs": 3229, - "total_submitted": 5343, + "total_acs": 3247, + "total_submitted": 5404, "total_column_articles": 77, "frontend_question_id": "1746", "is_new_question": false @@ -34599,9 +35103,9 @@ "question__title": "Find Total Time Spent by Each Employee", "question__title_slug": "find-total-time-spent-by-each-employee", "question__hide": false, - "total_acs": 38976, - "total_submitted": 46243, - "total_column_articles": 219, + "total_acs": 39835, + "total_submitted": 47257, + "total_column_articles": 220, "frontend_question_id": "1741", "is_new_question": false }, @@ -34620,8 +35124,8 @@ "question__title": "Count Pairs Of Nodes", "question__title_slug": "count-pairs-of-nodes", "question__hide": false, - "total_acs": 13290, - "total_submitted": 24352, + "total_acs": 13305, + "total_submitted": 24403, "total_column_articles": 88, "frontend_question_id": "1782", "is_new_question": false @@ -34641,9 +35145,9 @@ "question__title": "Sum of Beauty of All Substrings", "question__title_slug": "sum-of-beauty-of-all-substrings", "question__hide": false, - "total_acs": 25314, - "total_submitted": 38050, - "total_column_articles": 227, + "total_acs": 25388, + "total_submitted": 38156, + "total_column_articles": 229, "frontend_question_id": "1781", "is_new_question": false }, @@ -34662,9 +35166,9 @@ "question__title": "Check if Number is a Sum of Powers of Three", "question__title_slug": "check-if-number-is-a-sum-of-powers-of-three", "question__hide": false, - "total_acs": 32476, - "total_submitted": 43390, - "total_column_articles": 517, + "total_acs": 32568, + "total_submitted": 43508, + "total_column_articles": 519, "frontend_question_id": "1780", "is_new_question": false }, @@ -34683,8 +35187,8 @@ "question__title": "Find Nearest Point That Has the Same X or Y Coordinate", "question__title_slug": "find-nearest-point-that-has-the-same-x-or-y-coordinate", "question__hide": false, - "total_acs": 47356, - "total_submitted": 68650, + "total_acs": 47483, + "total_submitted": 68807, "total_column_articles": 556, "frontend_question_id": "1779", "is_new_question": false @@ -34704,8 +35208,8 @@ "question__title": "Minimum Degree of a Connected Trio in a Graph", "question__title_slug": "minimum-degree-of-a-connected-trio-in-a-graph", "question__hide": false, - "total_acs": 17663, - "total_submitted": 31662, + "total_acs": 17694, + "total_submitted": 31713, "total_column_articles": 129, "frontend_question_id": "1761", "is_new_question": false @@ -34725,9 +35229,9 @@ "question__title": "Minimum Limit of Balls in a Bag", "question__title_slug": "minimum-limit-of-balls-in-a-bag", "question__hide": false, - "total_acs": 26499, - "total_submitted": 41317, - "total_column_articles": 291, + "total_acs": 26702, + "total_submitted": 41633, + "total_column_articles": 292, "frontend_question_id": "1760", "is_new_question": false }, @@ -34746,9 +35250,9 @@ "question__title": "Count Number of Homogenous Substrings", "question__title_slug": "count-number-of-homogenous-substrings", "question__hide": false, - "total_acs": 24938, - "total_submitted": 48719, - "total_column_articles": 284, + "total_acs": 25076, + "total_submitted": 48997, + "total_column_articles": 288, "frontend_question_id": "1759", "is_new_question": false }, @@ -34767,8 +35271,8 @@ "question__title": "Minimum Changes To Make Alternating Binary String", "question__title_slug": "minimum-changes-to-make-alternating-binary-string", "question__hide": false, - "total_acs": 37881, - "total_submitted": 54445, + "total_acs": 37996, + "total_submitted": 54604, "total_column_articles": 463, "frontend_question_id": "1758", "is_new_question": false @@ -34788,8 +35292,8 @@ "question__title": "Find Distance in a Binary Tree", "question__title_slug": "find-distance-in-a-binary-tree", "question__hide": false, - "total_acs": 1923, - "total_submitted": 2828, + "total_acs": 1958, + "total_submitted": 2874, "total_column_articles": 58, "frontend_question_id": "1740", "is_new_question": false @@ -34809,9 +35313,9 @@ "question__title": "The Number of Employees Which Report to Each Employee", "question__title_slug": "the-number-of-employees-which-report-to-each-employee", "question__hide": false, - "total_acs": 22784, - "total_submitted": 49151, - "total_column_articles": 190, + "total_acs": 24510, + "total_submitted": 52825, + "total_column_articles": 202, "frontend_question_id": "1731", "is_new_question": false }, @@ -34830,9 +35334,9 @@ "question__title": "Closest Subsequence Sum", "question__title_slug": "closest-subsequence-sum", "question__hide": false, - "total_acs": 7212, - "total_submitted": 15452, - "total_column_articles": 95, + "total_acs": 7338, + "total_submitted": 15665, + "total_column_articles": 98, "frontend_question_id": "1755", "is_new_question": false }, @@ -34851,9 +35355,9 @@ "question__title": "Largest Merge Of Two Strings", "question__title_slug": "largest-merge-of-two-strings", "question__hide": false, - "total_acs": 19493, - "total_submitted": 34546, - "total_column_articles": 213, + "total_acs": 19587, + "total_submitted": 34679, + "total_column_articles": 216, "frontend_question_id": "1754", "is_new_question": false }, @@ -34872,9 +35376,9 @@ "question__title": "Maximum Score From Removing Stones", "question__title_slug": "maximum-score-from-removing-stones", "question__hide": false, - "total_acs": 27670, - "total_submitted": 39201, - "total_column_articles": 348, + "total_acs": 27757, + "total_submitted": 39331, + "total_column_articles": 349, "frontend_question_id": "1753", "is_new_question": false }, @@ -34893,9 +35397,9 @@ "question__title": "Check if Array Is Sorted and Rotated", "question__title_slug": "check-if-array-is-sorted-and-rotated", "question__hide": false, - "total_acs": 33513, - "total_submitted": 57866, - "total_column_articles": 419, + "total_acs": 33623, + "total_submitted": 58096, + "total_column_articles": 423, "frontend_question_id": "1752", "is_new_question": false }, @@ -34914,9 +35418,9 @@ "question__title": "Find Followers Count", "question__title_slug": "find-followers-count", "question__hide": false, - "total_acs": 43590, - "total_submitted": 72420, - "total_column_articles": 165, + "total_acs": 45189, + "total_submitted": 75208, + "total_column_articles": 167, "frontend_question_id": "1729", "is_new_question": false }, @@ -34935,8 +35439,8 @@ "question__title": "Map of Highest Peak", "question__title_slug": "map-of-highest-peak", "question__hide": false, - "total_acs": 25355, - "total_submitted": 38243, + "total_acs": 25495, + "total_submitted": 38450, "total_column_articles": 334, "frontend_question_id": "1765", "is_new_question": false @@ -34956,9 +35460,9 @@ "question__title": "Tree of Coprimes", "question__title_slug": "tree-of-coprimes", "question__hide": false, - "total_acs": 2760, - "total_submitted": 6779, - "total_column_articles": 50, + "total_acs": 2782, + "total_submitted": 6858, + "total_column_articles": 51, "frontend_question_id": "1766", "is_new_question": false }, @@ -34977,9 +35481,9 @@ "question__title": "Form Array by Concatenating Subarrays of Another Array", "question__title_slug": "form-array-by-concatenating-subarrays-of-another-array", "question__hide": false, - "total_acs": 18815, - "total_submitted": 33858, - "total_column_articles": 260, + "total_acs": 18875, + "total_submitted": 33972, + "total_column_articles": 261, "frontend_question_id": "1764", "is_new_question": false }, @@ -34998,9 +35502,9 @@ "question__title": "Longest Nice Substring", "question__title_slug": "longest-nice-substring", "question__hide": false, - "total_acs": 30435, - "total_submitted": 45581, - "total_column_articles": 324, + "total_acs": 30712, + "total_submitted": 45989, + "total_column_articles": 321, "frontend_question_id": "1763", "is_new_question": false }, @@ -35019,9 +35523,9 @@ "question__title": "Can You Eat Your Favorite Candy on Your Favorite Day?", "question__title_slug": "can-you-eat-your-favorite-candy-on-your-favorite-day", "question__hide": false, - "total_acs": 31212, - "total_submitted": 85594, - "total_column_articles": 397, + "total_acs": 31241, + "total_submitted": 85686, + "total_column_articles": 394, "frontend_question_id": "1744", "is_new_question": false }, @@ -35040,8 +35544,8 @@ "question__title": "Palindrome Partitioning IV", "question__title_slug": "palindrome-partitioning-iv", "question__hide": false, - "total_acs": 6683, - "total_submitted": 13080, + "total_acs": 6801, + "total_submitted": 13287, "total_column_articles": 116, "frontend_question_id": "1745", "is_new_question": false @@ -35061,9 +35565,9 @@ "question__title": "Restore the Array From Adjacent Pairs", "question__title_slug": "restore-the-array-from-adjacent-pairs", "question__hide": false, - "total_acs": 25339, - "total_submitted": 36301, - "total_column_articles": 362, + "total_acs": 25470, + "total_submitted": 36476, + "total_column_articles": 365, "frontend_question_id": "1743", "is_new_question": false }, @@ -35082,8 +35586,8 @@ "question__title": "Checking Existence of Edge Length Limited Paths II", "question__title_slug": "checking-existence-of-edge-length-limited-paths-ii", "question__hide": false, - "total_acs": 764, - "total_submitted": 1363, + "total_acs": 768, + "total_submitted": 1384, "total_column_articles": 22, "frontend_question_id": "1724", "is_new_question": false @@ -35103,8 +35607,8 @@ "question__title": "Count Apples and Oranges", "question__title_slug": "count-apples-and-oranges", "question__hide": false, - "total_acs": 4640, - "total_submitted": 6455, + "total_acs": 4708, + "total_submitted": 6547, "total_column_articles": 63, "frontend_question_id": "1715", "is_new_question": false @@ -35124,8 +35628,8 @@ "question__title": "Building Boxes", "question__title_slug": "building-boxes", "question__hide": false, - "total_acs": 13277, - "total_submitted": 20766, + "total_acs": 13306, + "total_submitted": 20829, "total_column_articles": 135, "frontend_question_id": "1739", "is_new_question": false @@ -35145,9 +35649,9 @@ "question__title": "Find Kth Largest XOR Coordinate Value", "question__title_slug": "find-kth-largest-xor-coordinate-value", "question__hide": false, - "total_acs": 32412, - "total_submitted": 49719, - "total_column_articles": 439, + "total_acs": 32490, + "total_submitted": 49873, + "total_column_articles": 437, "frontend_question_id": "1738", "is_new_question": false }, @@ -35166,8 +35670,8 @@ "question__title": "Change Minimum Characters to Satisfy One of Three Conditions", "question__title_slug": "change-minimum-characters-to-satisfy-one-of-three-conditions", "question__hide": false, - "total_acs": 6280, - "total_submitted": 17217, + "total_acs": 6321, + "total_submitted": 17338, "total_column_articles": 134, "frontend_question_id": "1737", "is_new_question": false @@ -35187,9 +35691,9 @@ "question__title": "Latest Time by Replacing Hidden Digits", "question__title_slug": "latest-time-by-replacing-hidden-digits", "question__hide": false, - "total_acs": 35320, - "total_submitted": 79496, - "total_column_articles": 432, + "total_acs": 35506, + "total_submitted": 79948, + "total_column_articles": 430, "frontend_question_id": "1736", "is_new_question": false }, @@ -35208,9 +35712,9 @@ "question__title": "Biggest Window Between Visits", "question__title_slug": "biggest-window-between-visits", "question__hide": false, - "total_acs": 7595, - "total_submitted": 11524, - "total_column_articles": 104, + "total_acs": 7852, + "total_submitted": 11935, + "total_column_articles": 106, "frontend_question_id": "1709", "is_new_question": false }, @@ -35229,8 +35733,8 @@ "question__title": "Maximum Number of Events That Can Be Attended II", "question__title_slug": "maximum-number-of-events-that-can-be-attended-ii", "question__hide": false, - "total_acs": 7811, - "total_submitted": 14196, + "total_acs": 7859, + "total_submitted": 14304, "total_column_articles": 100, "frontend_question_id": "1751", "is_new_question": false @@ -35250,9 +35754,9 @@ "question__title": "Minimum Length of String After Deleting Similar Ends", "question__title_slug": "minimum-length-of-string-after-deleting-similar-ends", "question__hide": false, - "total_acs": 25023, - "total_submitted": 49404, - "total_column_articles": 303, + "total_acs": 25218, + "total_submitted": 49716, + "total_column_articles": 305, "frontend_question_id": "1750", "is_new_question": false }, @@ -35271,9 +35775,9 @@ "question__title": "Maximum Absolute Sum of Any Subarray", "question__title_slug": "maximum-absolute-sum-of-any-subarray", "question__hide": false, - "total_acs": 32251, - "total_submitted": 52958, - "total_column_articles": 342, + "total_acs": 32433, + "total_submitted": 53260, + "total_column_articles": 346, "frontend_question_id": "1749", "is_new_question": false }, @@ -35292,9 +35796,9 @@ "question__title": "Sum of Unique Elements", "question__title_slug": "sum-of-unique-elements", "question__hide": false, - "total_acs": 51930, - "total_submitted": 68270, - "total_column_articles": 686, + "total_acs": 52301, + "total_submitted": 68759, + "total_column_articles": 684, "frontend_question_id": "1748", "is_new_question": false }, @@ -35313,8 +35817,8 @@ "question__title": "Largest Subarray Length K", "question__title_slug": "largest-subarray-length-k", "question__hide": false, - "total_acs": 1947, - "total_submitted": 2887, + "total_acs": 1967, + "total_submitted": 2932, "total_column_articles": 55, "frontend_question_id": "1708", "is_new_question": false @@ -35334,8 +35838,8 @@ "question__title": "Largest Submatrix With Rearrangements", "question__title_slug": "largest-submatrix-with-rearrangements", "question__hide": false, - "total_acs": 5388, - "total_submitted": 8906, + "total_acs": 5431, + "total_submitted": 8974, "total_column_articles": 97, "frontend_question_id": "1727", "is_new_question": false @@ -35355,9 +35859,9 @@ "question__title": "Maximum Number of Balls in a Box", "question__title_slug": "maximum-number-of-balls-in-a-box", "question__hide": false, - "total_acs": 40762, - "total_submitted": 53804, - "total_column_articles": 411, + "total_acs": 40922, + "total_submitted": 54035, + "total_column_articles": 415, "frontend_question_id": "1742", "is_new_question": false }, @@ -35376,9 +35880,9 @@ "question__title": "Number Of Rectangles That Can Form The Largest Square", "question__title_slug": "number-of-rectangles-that-can-form-the-largest-square", "question__hide": false, - "total_acs": 40658, - "total_submitted": 49221, - "total_column_articles": 503, + "total_acs": 40808, + "total_submitted": 49424, + "total_column_articles": 500, "frontend_question_id": "1725", "is_new_question": false }, @@ -35397,8 +35901,8 @@ "question__title": "Number of Calls Between Two Persons", "question__title_slug": "number-of-calls-between-two-persons", "question__hide": false, - "total_acs": 14615, - "total_submitted": 19148, + "total_acs": 14986, + "total_submitted": 19657, "total_column_articles": 149, "frontend_question_id": "1699", "is_new_question": false @@ -35418,8 +35922,8 @@ "question__title": "Minimize Hamming Distance After Swap Operations", "question__title_slug": "minimize-hamming-distance-after-swap-operations", "question__hide": false, - "total_acs": 6702, - "total_submitted": 13040, + "total_acs": 6736, + "total_submitted": 13119, "total_column_articles": 158, "frontend_question_id": "1722", "is_new_question": false @@ -35439,9 +35943,9 @@ "question__title": "Decode XORed Array", "question__title_slug": "decode-xored-array", "question__hide": false, - "total_acs": 58175, - "total_submitted": 67902, - "total_column_articles": 616, + "total_acs": 58475, + "total_submitted": 68261, + "total_column_articles": 614, "frontend_question_id": "1720", "is_new_question": false }, @@ -35460,8 +35964,8 @@ "question__title": "Number of Distinct Substrings in a String", "question__title_slug": "number-of-distinct-substrings-in-a-string", "question__hide": false, - "total_acs": 1101, - "total_submitted": 1975, + "total_acs": 1110, + "total_submitted": 1987, "total_column_articles": 29, "frontend_question_id": "1698", "is_new_question": false @@ -35481,8 +35985,8 @@ "question__title": "Daily Leads and Partners", "question__title_slug": "daily-leads-and-partners", "question__hide": false, - "total_acs": 36918, - "total_submitted": 44826, + "total_acs": 37662, + "total_submitted": 45677, "total_column_articles": 203, "frontend_question_id": "1693", "is_new_question": false @@ -35502,8 +36006,8 @@ "question__title": "Count Ways to Make Array With Product", "question__title_slug": "count-ways-to-make-array-with-product", "question__hide": false, - "total_acs": 2170, - "total_submitted": 4103, + "total_acs": 2260, + "total_submitted": 4227, "total_column_articles": 51, "frontend_question_id": "1735", "is_new_question": false @@ -35523,9 +36027,9 @@ "question__title": "Decode XORed Permutation", "question__title_slug": "decode-xored-permutation", "question__hide": false, - "total_acs": 30198, - "total_submitted": 41683, - "total_column_articles": 388, + "total_acs": 30255, + "total_submitted": 41763, + "total_column_articles": 390, "frontend_question_id": "1734", "is_new_question": false }, @@ -35544,8 +36048,8 @@ "question__title": "Minimum Number of People to Teach", "question__title_slug": "minimum-number-of-people-to-teach", "question__hide": false, - "total_acs": 4025, - "total_submitted": 8134, + "total_acs": 4082, + "total_submitted": 8229, "total_column_articles": 82, "frontend_question_id": "1733", "is_new_question": false @@ -35565,9 +36069,9 @@ "question__title": "Find the Highest Altitude", "question__title_slug": "find-the-highest-altitude", "question__hide": false, - "total_acs": 61434, - "total_submitted": 75305, - "total_column_articles": 618, + "total_acs": 62777, + "total_submitted": 76899, + "total_column_articles": 621, "frontend_question_id": "1732", "is_new_question": false }, @@ -35586,8 +36090,8 @@ "question__title": "Minimum Operations to Make a Subsequence", "question__title_slug": "minimum-operations-to-make-a-subsequence", "question__hide": false, - "total_acs": 19372, - "total_submitted": 38720, + "total_acs": 19409, + "total_submitted": 38821, "total_column_articles": 204, "frontend_question_id": "1713", "is_new_question": false @@ -35607,9 +36111,9 @@ "question__title": "Ways to Split Array Into Three Subarrays", "question__title_slug": "ways-to-split-array-into-three-subarrays", "question__hide": false, - "total_acs": 13812, - "total_submitted": 47828, - "total_column_articles": 180, + "total_acs": 13891, + "total_submitted": 48089, + "total_column_articles": 181, "frontend_question_id": "1712", "is_new_question": false }, @@ -35628,9 +36132,9 @@ "question__title": "Count Good Meals", "question__title_slug": "count-good-meals", "question__hide": false, - "total_acs": 33843, - "total_submitted": 94053, - "total_column_articles": 394, + "total_acs": 33917, + "total_submitted": 94207, + "total_column_articles": 391, "frontend_question_id": "1711", "is_new_question": false }, @@ -35649,8 +36153,8 @@ "question__title": "Maximum Units on a Truck", "question__title_slug": "maximum-units-on-a-truck", "question__hide": false, - "total_acs": 52313, - "total_submitted": 71256, + "total_acs": 52566, + "total_submitted": 71647, "total_column_articles": 596, "frontend_question_id": "1710", "is_new_question": false @@ -35670,8 +36174,8 @@ "question__title": "Count Ways to Distribute Candies", "question__title_slug": "count-ways-to-distribute-candies", "question__hide": false, - "total_acs": 807, - "total_submitted": 1237, + "total_acs": 820, + "total_submitted": 1254, "total_column_articles": 25, "frontend_question_id": "1692", "is_new_question": false @@ -35691,9 +36195,9 @@ "question__title": "Invalid Tweets", "question__title_slug": "invalid-tweets", "question__hide": false, - "total_acs": 48712, - "total_submitted": 57411, - "total_column_articles": 157, + "total_acs": 53311, + "total_submitted": 62806, + "total_column_articles": 164, "frontend_question_id": "1683", "is_new_question": false }, @@ -35712,8 +36216,8 @@ "question__title": "Maximum XOR With an Element From Array", "question__title_slug": "maximum-xor-with-an-element-from-array", "question__hide": false, - "total_acs": 17414, - "total_submitted": 34010, + "total_acs": 17458, + "total_submitted": 34110, "total_column_articles": 179, "frontend_question_id": "1707", "is_new_question": false @@ -35733,9 +36237,9 @@ "question__title": "Find Minimum Time to Finish All Jobs", "question__title_slug": "find-minimum-time-to-finish-all-jobs", "question__hide": false, - "total_acs": 33019, - "total_submitted": 65006, - "total_column_articles": 231, + "total_acs": 33185, + "total_submitted": 65297, + "total_column_articles": 232, "frontend_question_id": "1723", "is_new_question": false }, @@ -35754,9 +36258,9 @@ "question__title": "Maximum Number of Eaten Apples", "question__title_slug": "maximum-number-of-eaten-apples", "question__hide": false, - "total_acs": 30669, - "total_submitted": 67627, - "total_column_articles": 397, + "total_acs": 30754, + "total_submitted": 67884, + "total_column_articles": 395, "frontend_question_id": "1705", "is_new_question": false }, @@ -35775,9 +36279,9 @@ "question__title": "Determine if String Halves Are Alike", "question__title_slug": "determine-if-string-halves-are-alike", "question__hide": false, - "total_acs": 51117, - "total_submitted": 65385, - "total_column_articles": 600, + "total_acs": 51372, + "total_submitted": 65723, + "total_column_articles": 597, "frontend_question_id": "1704", "is_new_question": false }, @@ -35796,8 +36300,8 @@ "question__title": "Longest Palindromic Subsequence II", "question__title_slug": "longest-palindromic-subsequence-ii", "question__hide": false, - "total_acs": 1256, - "total_submitted": 2221, + "total_acs": 1265, + "total_submitted": 2251, "total_column_articles": 43, "frontend_question_id": "1682", "is_new_question": false @@ -35817,8 +36321,8 @@ "question__title": "Product's Worth Over Invoices", "question__title_slug": "products-worth-over-invoices", "question__hide": false, - "total_acs": 5066, - "total_submitted": 14423, + "total_acs": 5125, + "total_submitted": 14586, "total_column_articles": 60, "frontend_question_id": "1677", "is_new_question": false @@ -35838,8 +36342,8 @@ "question__title": "Number Of Ways To Reconstruct A Tree", "question__title_slug": "number-of-ways-to-reconstruct-a-tree", "question__hide": false, - "total_acs": 13388, - "total_submitted": 19449, + "total_acs": 13407, + "total_submitted": 19509, "total_column_articles": 96, "frontend_question_id": "1719", "is_new_question": false @@ -35859,8 +36363,8 @@ "question__title": "Construct the Lexicographically Largest Valid Sequence", "question__title_slug": "construct-the-lexicographically-largest-valid-sequence", "question__hide": false, - "total_acs": 3799, - "total_submitted": 7370, + "total_acs": 3820, + "total_submitted": 7410, "total_column_articles": 83, "frontend_question_id": "1718", "is_new_question": false @@ -35880,9 +36384,9 @@ "question__title": "Maximum Score From Removing Substrings", "question__title_slug": "maximum-score-from-removing-substrings", "question__hide": false, - "total_acs": 4275, - "total_submitted": 9109, - "total_column_articles": 94, + "total_acs": 4320, + "total_submitted": 9202, + "total_column_articles": 95, "frontend_question_id": "1717", "is_new_question": false }, @@ -35901,9 +36405,9 @@ "question__title": "Calculate Money in Leetcode Bank", "question__title_slug": "calculate-money-in-leetcode-bank", "question__hide": false, - "total_acs": 44421, - "total_submitted": 64290, - "total_column_articles": 766, + "total_acs": 44598, + "total_submitted": 64524, + "total_column_articles": 767, "frontend_question_id": "1716", "is_new_question": false }, @@ -35922,8 +36426,8 @@ "question__title": "Lowest Common Ancestor of a Binary Tree IV", "question__title_slug": "lowest-common-ancestor-of-a-binary-tree-iv", "question__hide": false, - "total_acs": 3908, - "total_submitted": 4860, + "total_acs": 3973, + "total_submitted": 4936, "total_column_articles": 56, "frontend_question_id": "1676", "is_new_question": false @@ -35943,8 +36447,8 @@ "question__title": "Checking Existence of Edge Length Limited Paths", "question__title_slug": "checking-existence-of-edge-length-limited-paths", "question__hide": false, - "total_acs": 15427, - "total_submitted": 23826, + "total_acs": 15492, + "total_submitted": 23945, "total_column_articles": 168, "frontend_question_id": "1697", "is_new_question": false @@ -35964,9 +36468,9 @@ "question__title": "Jump Game VI", "question__title_slug": "jump-game-vi", "question__hide": false, - "total_acs": 27004, - "total_submitted": 60609, - "total_column_articles": 293, + "total_acs": 27396, + "total_submitted": 61528, + "total_column_articles": 294, "frontend_question_id": "1696", "is_new_question": false }, @@ -35985,9 +36489,9 @@ "question__title": "Maximum Erasure Value", "question__title_slug": "maximum-erasure-value", "question__hide": false, - "total_acs": 16331, - "total_submitted": 30584, - "total_column_articles": 256, + "total_acs": 16709, + "total_submitted": 31170, + "total_column_articles": 258, "frontend_question_id": "1695", "is_new_question": false }, @@ -36006,9 +36510,9 @@ "question__title": "Reformat Phone Number", "question__title_slug": "reformat-phone-number", "question__hide": false, - "total_acs": 38917, - "total_submitted": 58948, - "total_column_articles": 585, + "total_acs": 39027, + "total_submitted": 59097, + "total_column_articles": 586, "frontend_question_id": "1694", "is_new_question": false }, @@ -36027,9 +36531,9 @@ "question__title": "Fix Names in a Table", "question__title_slug": "fix-names-in-a-table", "question__hide": false, - "total_acs": 67587, - "total_submitted": 107680, - "total_column_articles": 347, + "total_acs": 69043, + "total_submitted": 110108, + "total_column_articles": 350, "frontend_question_id": "1667", "is_new_question": false }, @@ -36048,8 +36552,8 @@ "question__title": "Change the Root of a Binary Tree", "question__title_slug": "change-the-root-of-a-binary-tree", "question__hide": false, - "total_acs": 582, - "total_submitted": 904, + "total_acs": 592, + "total_submitted": 932, "total_column_articles": 24, "frontend_question_id": "1666", "is_new_question": false @@ -36069,8 +36573,8 @@ "question__title": "Sum Of Special Evenly-Spaced Elements In Array", "question__title_slug": "sum-of-special-evenly-spaced-elements-in-array", "question__hide": false, - "total_acs": 570, - "total_submitted": 967, + "total_acs": 582, + "total_submitted": 995, "total_column_articles": 17, "frontend_question_id": "1714", "is_new_question": false @@ -36090,9 +36594,9 @@ "question__title": "Stone Game VII", "question__title_slug": "stone-game-vii", "question__hide": false, - "total_acs": 17643, - "total_submitted": 26962, - "total_column_articles": 201, + "total_acs": 17798, + "total_submitted": 27190, + "total_column_articles": 200, "frontend_question_id": "1690", "is_new_question": false }, @@ -36111,8 +36615,8 @@ "question__title": "Partitioning Into Minimum Number Of Deci-Binary Numbers", "question__title_slug": "partitioning-into-minimum-number-of-deci-binary-numbers", "question__hide": false, - "total_acs": 23738, - "total_submitted": 27370, + "total_acs": 23898, + "total_submitted": 27548, "total_column_articles": 309, "frontend_question_id": "1689", "is_new_question": false @@ -36132,9 +36636,9 @@ "question__title": "Count of Matches in Tournament", "question__title_slug": "count-of-matches-in-tournament", "question__hide": false, - "total_acs": 64210, - "total_submitted": 77252, - "total_column_articles": 668, + "total_acs": 64641, + "total_submitted": 77781, + "total_column_articles": 669, "frontend_question_id": "1688", "is_new_question": false }, @@ -36153,8 +36657,8 @@ "question__title": "Minimum Adjacent Swaps for K Consecutive Ones", "question__title_slug": "minimum-adjacent-swaps-for-k-consecutive-ones", "question__hide": false, - "total_acs": 12004, - "total_submitted": 21326, + "total_acs": 12041, + "total_submitted": 21426, "total_column_articles": 88, "frontend_question_id": "1703", "is_new_question": false @@ -36174,8 +36678,8 @@ "question__title": "Maximum Binary String After Change", "question__title_slug": "maximum-binary-string-after-change", "question__hide": false, - "total_acs": 5566, - "total_submitted": 11436, + "total_acs": 5614, + "total_submitted": 11550, "total_column_articles": 106, "frontend_question_id": "1702", "is_new_question": false @@ -36195,9 +36699,9 @@ "question__title": "Average Waiting Time", "question__title_slug": "average-waiting-time", "question__hide": false, - "total_acs": 8064, - "total_submitted": 13198, - "total_column_articles": 155, + "total_acs": 8138, + "total_submitted": 13298, + "total_column_articles": 156, "frontend_question_id": "1701", "is_new_question": false }, @@ -36216,9 +36720,9 @@ "question__title": "Number of Students Unable to Eat Lunch", "question__title_slug": "number-of-students-unable-to-eat-lunch", "question__hide": false, - "total_acs": 54049, - "total_submitted": 74178, - "total_column_articles": 795, + "total_acs": 54514, + "total_submitted": 74838, + "total_column_articles": 800, "frontend_question_id": "1700", "is_new_question": false }, @@ -36237,9 +36741,9 @@ "question__title": "Average Time of Process per Machine", "question__title_slug": "average-time-of-process-per-machine", "question__hide": false, - "total_acs": 32226, - "total_submitted": 46622, - "total_column_articles": 302, + "total_acs": 35258, + "total_submitted": 50857, + "total_column_articles": 324, "frontend_question_id": "1661", "is_new_question": false }, @@ -36258,8 +36762,8 @@ "question__title": "Concatenation of Consecutive Binary Numbers", "question__title_slug": "concatenation-of-consecutive-binary-numbers", "question__hide": false, - "total_acs": 8687, - "total_submitted": 17101, + "total_acs": 8765, + "total_submitted": 17221, "total_column_articles": 102, "frontend_question_id": "1680", "is_new_question": false @@ -36279,9 +36783,9 @@ "question__title": "Minimum Incompatibility", "question__title_slug": "minimum-incompatibility", "question__hide": false, - "total_acs": 12535, - "total_submitted": 21377, - "total_column_articles": 116, + "total_acs": 12614, + "total_submitted": 21514, + "total_column_articles": 118, "frontend_question_id": "1681", "is_new_question": false }, @@ -36300,9 +36804,9 @@ "question__title": "Max Number of K-Sum Pairs", "question__title_slug": "max-number-of-k-sum-pairs", "question__hide": false, - "total_acs": 28498, - "total_submitted": 50427, - "total_column_articles": 332, + "total_acs": 29636, + "total_submitted": 52328, + "total_column_articles": 338, "frontend_question_id": "1679", "is_new_question": false }, @@ -36321,9 +36825,9 @@ "question__title": "Goal Parser Interpretation", "question__title_slug": "goal-parser-interpretation", "question__hide": false, - "total_acs": 59225, - "total_submitted": 69155, - "total_column_articles": 787, + "total_acs": 59509, + "total_submitted": 69532, + "total_column_articles": 788, "frontend_question_id": "1678", "is_new_question": false }, @@ -36342,8 +36846,8 @@ "question__title": "Correct a Binary Tree", "question__title_slug": "correct-a-binary-tree", "question__hide": false, - "total_acs": 1043, - "total_submitted": 1372, + "total_acs": 1051, + "total_submitted": 1397, "total_column_articles": 36, "frontend_question_id": "1660", "is_new_question": false @@ -36363,9 +36867,9 @@ "question__title": "Hopper Company Queries III", "question__title_slug": "hopper-company-queries-iii", "question__hide": false, - "total_acs": 2250, - "total_submitted": 3526, - "total_column_articles": 41, + "total_acs": 2289, + "total_submitted": 3586, + "total_column_articles": 42, "frontend_question_id": "1651", "is_new_question": false }, @@ -36384,8 +36888,8 @@ "question__title": "Minimize Deviation in Array", "question__title_slug": "minimize-deviation-in-array", "question__hide": false, - "total_acs": 6980, - "total_submitted": 15287, + "total_acs": 7051, + "total_submitted": 15419, "total_column_articles": 77, "frontend_question_id": "1675", "is_new_question": false @@ -36405,8 +36909,8 @@ "question__title": "Minimum Moves to Make Array Complementary", "question__title_slug": "minimum-moves-to-make-array-complementary", "question__hide": false, - "total_acs": 4675, - "total_submitted": 10906, + "total_acs": 4701, + "total_submitted": 10975, "total_column_articles": 85, "frontend_question_id": "1674", "is_new_question": false @@ -36426,9 +36930,9 @@ "question__title": "Find the Most Competitive Subsequence", "question__title_slug": "find-the-most-competitive-subsequence", "question__hide": false, - "total_acs": 13059, - "total_submitted": 32096, - "total_column_articles": 246, + "total_acs": 13156, + "total_submitted": 32269, + "total_column_articles": 247, "frontend_question_id": "1673", "is_new_question": false }, @@ -36447,9 +36951,9 @@ "question__title": "Richest Customer Wealth", "question__title_slug": "richest-customer-wealth", "question__hide": false, - "total_acs": 158575, - "total_submitted": 189422, - "total_column_articles": 1487, + "total_acs": 160598, + "total_submitted": 191785, + "total_column_articles": 1502, "frontend_question_id": "1672", "is_new_question": false }, @@ -36468,8 +36972,8 @@ "question__title": "Lowest Common Ancestor of a Binary Tree III", "question__title_slug": "lowest-common-ancestor-of-a-binary-tree-iii", "question__hide": false, - "total_acs": 6051, - "total_submitted": 7447, + "total_acs": 6187, + "total_submitted": 7603, "total_column_articles": 73, "frontend_question_id": "1650", "is_new_question": false @@ -36489,8 +36993,8 @@ "question__title": "Delivering Boxes from Storage to Ports", "question__title_slug": "delivering-boxes-from-storage-to-ports", "question__hide": false, - "total_acs": 12906, - "total_submitted": 22116, + "total_acs": 12918, + "total_submitted": 22156, "total_column_articles": 100, "frontend_question_id": "1687", "is_new_question": false @@ -36510,9 +37014,9 @@ "question__title": "Stone Game VI", "question__title_slug": "stone-game-vi", "question__hide": false, - "total_acs": 18889, - "total_submitted": 28825, - "total_column_articles": 187, + "total_acs": 19047, + "total_submitted": 29076, + "total_column_articles": 188, "frontend_question_id": "1686", "is_new_question": false }, @@ -36531,8 +37035,8 @@ "question__title": "Sum of Absolute Differences in a Sorted Array", "question__title_slug": "sum-of-absolute-differences-in-a-sorted-array", "question__hide": false, - "total_acs": 8906, - "total_submitted": 13581, + "total_acs": 8990, + "total_submitted": 13721, "total_column_articles": 191, "frontend_question_id": "1685", "is_new_question": false @@ -36552,9 +37056,9 @@ "question__title": "Count the Number of Consistent Strings", "question__title_slug": "count-the-number-of-consistent-strings", "question__hide": false, - "total_acs": 64801, - "total_submitted": 76168, - "total_column_articles": 878, + "total_acs": 65193, + "total_submitted": 76652, + "total_column_articles": 877, "frontend_question_id": "1684", "is_new_question": false }, @@ -36573,9 +37077,9 @@ "question__title": "Hopper Company Queries II", "question__title_slug": "hopper-company-queries-ii", "question__hide": false, - "total_acs": 2211, - "total_submitted": 5428, - "total_column_articles": 41, + "total_acs": 2241, + "total_submitted": 5501, + "total_column_articles": 42, "frontend_question_id": "1645", "is_new_question": false }, @@ -36594,9 +37098,9 @@ "question__title": "Minimum Initial Energy to Finish Tasks", "question__title_slug": "minimum-initial-energy-to-finish-tasks", "question__hide": false, - "total_acs": 8873, - "total_submitted": 13472, - "total_column_articles": 132, + "total_acs": 8940, + "total_submitted": 13609, + "total_column_articles": 133, "frontend_question_id": "1665", "is_new_question": false }, @@ -36615,9 +37119,9 @@ "question__title": "Ways to Make a Fair Array", "question__title_slug": "ways-to-make-a-fair-array", "question__hide": false, - "total_acs": 25692, - "total_submitted": 38580, - "total_column_articles": 405, + "total_acs": 25764, + "total_submitted": 38690, + "total_column_articles": 406, "frontend_question_id": "1664", "is_new_question": false }, @@ -36636,9 +37140,9 @@ "question__title": "Smallest String With A Given Numeric Value", "question__title_slug": "smallest-string-with-a-given-numeric-value", "question__hide": false, - "total_acs": 27426, - "total_submitted": 42117, - "total_column_articles": 354, + "total_acs": 27493, + "total_submitted": 42212, + "total_column_articles": 356, "frontend_question_id": "1663", "is_new_question": false }, @@ -36657,9 +37161,9 @@ "question__title": "Check If Two String Arrays are Equivalent", "question__title_slug": "check-if-two-string-arrays-are-equivalent", "question__hide": false, - "total_acs": 71555, - "total_submitted": 88446, - "total_column_articles": 731, + "total_acs": 71777, + "total_submitted": 88735, + "total_column_articles": 730, "frontend_question_id": "1662", "is_new_question": false }, @@ -36678,8 +37182,8 @@ "question__title": "Lowest Common Ancestor of a Binary Tree II", "question__title_slug": "lowest-common-ancestor-of-a-binary-tree-ii", "question__hide": false, - "total_acs": 5074, - "total_submitted": 8713, + "total_acs": 5172, + "total_submitted": 8865, "total_column_articles": 66, "frontend_question_id": "1644", "is_new_question": false @@ -36699,9 +37203,9 @@ "question__title": "Hopper Company Queries I", "question__title_slug": "hopper-company-queries-i", "question__hide": false, - "total_acs": 3265, - "total_submitted": 6630, - "total_column_articles": 65, + "total_acs": 3337, + "total_submitted": 6778, + "total_column_articles": 67, "frontend_question_id": "1635", "is_new_question": false }, @@ -36720,9 +37224,9 @@ "question__title": "Maximize Grid Happiness", "question__title_slug": "maximize-grid-happiness", "question__hide": false, - "total_acs": 8452, - "total_submitted": 13130, - "total_column_articles": 72, + "total_acs": 8463, + "total_submitted": 13163, + "total_column_articles": 71, "frontend_question_id": "1659", "is_new_question": false }, @@ -36741,9 +37245,9 @@ "question__title": "Determine if Two Strings Are Close", "question__title_slug": "determine-if-two-strings-are-close", "question__hide": false, - "total_acs": 41376, - "total_submitted": 77307, - "total_column_articles": 379, + "total_acs": 42290, + "total_submitted": 79112, + "total_column_articles": 383, "frontend_question_id": "1657", "is_new_question": false }, @@ -36762,9 +37266,9 @@ "question__title": "Minimum Operations to Reduce X to Zero", "question__title_slug": "minimum-operations-to-reduce-x-to-zero", "question__hide": false, - "total_acs": 44697, - "total_submitted": 113572, - "total_column_articles": 477, + "total_acs": 45587, + "total_submitted": 115888, + "total_column_articles": 485, "frontend_question_id": "1658", "is_new_question": false }, @@ -36783,9 +37287,9 @@ "question__title": "Design an Ordered Stream", "question__title_slug": "design-an-ordered-stream", "question__hide": false, - "total_acs": 40930, - "total_submitted": 48786, - "total_column_articles": 376, + "total_acs": 41033, + "total_submitted": 48902, + "total_column_articles": 378, "frontend_question_id": "1656", "is_new_question": false }, @@ -36804,8 +37308,8 @@ "question__title": "Add Two Polynomials Represented as Linked Lists", "question__title_slug": "add-two-polynomials-represented-as-linked-lists", "question__hide": false, - "total_acs": 2055, - "total_submitted": 3413, + "total_acs": 2091, + "total_submitted": 3463, "total_column_articles": 59, "frontend_question_id": "1634", "is_new_question": false @@ -36825,9 +37329,9 @@ "question__title": "Percentage of Users Attended a Contest", "question__title_slug": "percentage-of-users-attended-a-contest", "question__hide": false, - "total_acs": 29111, - "total_submitted": 48719, - "total_column_articles": 162, + "total_acs": 31304, + "total_submitted": 52388, + "total_column_articles": 166, "frontend_question_id": "1633", "is_new_question": false }, @@ -36846,8 +37350,8 @@ "question__title": "Create Sorted Array through Instructions", "question__title_slug": "create-sorted-array-through-instructions", "question__hide": false, - "total_acs": 4672, - "total_submitted": 9364, + "total_acs": 4707, + "total_submitted": 9427, "total_column_articles": 103, "frontend_question_id": "1649", "is_new_question": false @@ -36867,8 +37371,8 @@ "question__title": "Sell Diminishing-Valued Colored Balls", "question__title_slug": "sell-diminishing-valued-colored-balls", "question__hide": false, - "total_acs": 8024, - "total_submitted": 25231, + "total_acs": 8059, + "total_submitted": 25364, "total_column_articles": 148, "frontend_question_id": "1648", "is_new_question": false @@ -36888,9 +37392,9 @@ "question__title": "Minimum Deletions to Make Character Frequencies Unique", "question__title_slug": "minimum-deletions-to-make-character-frequencies-unique", "question__hide": false, - "total_acs": 13792, - "total_submitted": 25080, - "total_column_articles": 198, + "total_acs": 13914, + "total_submitted": 25291, + "total_column_articles": 199, "frontend_question_id": "1647", "is_new_question": false }, @@ -36909,9 +37413,9 @@ "question__title": "Get Maximum in Generated Array", "question__title_slug": "get-maximum-in-generated-array", "question__hide": false, - "total_acs": 53663, - "total_submitted": 103988, - "total_column_articles": 527, + "total_acs": 53937, + "total_submitted": 104641, + "total_column_articles": 525, "frontend_question_id": "1646", "is_new_question": false }, @@ -36930,8 +37434,8 @@ "question__title": "Design an Expression Tree With Evaluate Function", "question__title_slug": "design-an-expression-tree-with-evaluate-function", "question__hide": false, - "total_acs": 1035, - "total_submitted": 1266, + "total_acs": 1050, + "total_submitted": 1289, "total_column_articles": 34, "frontend_question_id": "1628", "is_new_question": false @@ -36951,8 +37455,8 @@ "question__title": "Design Front Middle Back Queue", "question__title_slug": "design-front-middle-back-queue", "question__hide": false, - "total_acs": 23368, - "total_submitted": 38517, + "total_acs": 23473, + "total_submitted": 38761, "total_column_articles": 272, "frontend_question_id": "1670", "is_new_question": false @@ -36972,9 +37476,9 @@ "question__title": "Minimum Number of Removals to Make Mountain Array", "question__title_slug": "minimum-number-of-removals-to-make-mountain-array", "question__hide": false, - "total_acs": 15778, - "total_submitted": 30583, - "total_column_articles": 171, + "total_acs": 15909, + "total_submitted": 30864, + "total_column_articles": 172, "frontend_question_id": "1671", "is_new_question": false }, @@ -36993,9 +37497,9 @@ "question__title": "Merge In Between Linked Lists", "question__title_slug": "merge-in-between-linked-lists", "question__hide": false, - "total_acs": 49486, - "total_submitted": 64413, - "total_column_articles": 652, + "total_acs": 50014, + "total_submitted": 65070, + "total_column_articles": 650, "frontend_question_id": "1669", "is_new_question": false }, @@ -37014,8 +37518,8 @@ "question__title": "Maximum Repeating Substring", "question__title_slug": "maximum-repeating-substring", "question__hide": false, - "total_acs": 45640, - "total_submitted": 97645, + "total_acs": 45927, + "total_submitted": 98361, "total_column_articles": 624, "frontend_question_id": "1668", "is_new_question": false @@ -37035,8 +37539,8 @@ "question__title": "All Valid Triplets That Can Represent a Country", "question__title_slug": "all-valid-triplets-that-can-represent-a-country", "question__hide": false, - "total_acs": 6768, - "total_submitted": 8628, + "total_acs": 6827, + "total_submitted": 8713, "total_column_articles": 67, "frontend_question_id": "1623", "is_new_question": false @@ -37056,9 +37560,9 @@ "question__title": "Furthest Building You Can Reach", "question__title_slug": "furthest-building-you-can-reach", "question__hide": false, - "total_acs": 12425, - "total_submitted": 26606, - "total_column_articles": 189, + "total_acs": 12698, + "total_submitted": 27111, + "total_column_articles": 191, "frontend_question_id": "1642", "is_new_question": false }, @@ -37077,9 +37581,9 @@ "question__title": "Count Sorted Vowel Strings", "question__title_slug": "count-sorted-vowel-strings", "question__hide": false, - "total_acs": 40551, - "total_submitted": 49156, - "total_column_articles": 610, + "total_acs": 40687, + "total_submitted": 49313, + "total_column_articles": 612, "frontend_question_id": "1641", "is_new_question": false }, @@ -37098,8 +37602,8 @@ "question__title": "Check Array Formation Through Concatenation", "question__title_slug": "check-array-formation-through-concatenation", "question__hide": false, - "total_acs": 46038, - "total_submitted": 75463, + "total_acs": 46272, + "total_submitted": 75802, "total_column_articles": 672, "frontend_question_id": "1640", "is_new_question": false @@ -37119,9 +37623,9 @@ "question__title": "Find the Missing IDs", "question__title_slug": "find-the-missing-ids", "question__hide": false, - "total_acs": 5943, - "total_submitted": 8188, - "total_column_articles": 70, + "total_acs": 6018, + "total_submitted": 8280, + "total_column_articles": 71, "frontend_question_id": "1613", "is_new_question": false }, @@ -37140,8 +37644,8 @@ "question__title": "Distribute Repeating Integers", "question__title_slug": "distribute-repeating-integers", "question__hide": false, - "total_acs": 4627, - "total_submitted": 11498, + "total_acs": 4673, + "total_submitted": 11635, "total_column_articles": 67, "frontend_question_id": "1655", "is_new_question": false @@ -37161,8 +37665,8 @@ "question__title": "Minimum Jumps to Reach Home", "question__title_slug": "minimum-jumps-to-reach-home", "question__hide": false, - "total_acs": 23813, - "total_submitted": 65395, + "total_acs": 23850, + "total_submitted": 65518, "total_column_articles": 180, "frontend_question_id": "1654", "is_new_question": false @@ -37182,9 +37686,9 @@ "question__title": "Minimum Deletions to Make String Balanced", "question__title_slug": "minimum-deletions-to-make-string-balanced", "question__hide": false, - "total_acs": 35572, - "total_submitted": 58281, - "total_column_articles": 363, + "total_acs": 35659, + "total_submitted": 58457, + "total_column_articles": 364, "frontend_question_id": "1653", "is_new_question": false }, @@ -37203,9 +37707,9 @@ "question__title": "Defuse the Bomb", "question__title_slug": "defuse-the-bomb", "question__hide": false, - "total_acs": 39214, - "total_submitted": 58808, - "total_column_articles": 622, + "total_acs": 39434, + "total_submitted": 59126, + "total_column_articles": 621, "frontend_question_id": "1652", "is_new_question": false }, @@ -37224,9 +37728,9 @@ "question__title": "Path With Minimum Effort", "question__title_slug": "path-with-minimum-effort", "question__hide": false, - "total_acs": 62031, - "total_submitted": 117618, - "total_column_articles": 537, + "total_acs": 62639, + "total_submitted": 118760, + "total_column_articles": 540, "frontend_question_id": "1631", "is_new_question": false }, @@ -37245,9 +37749,9 @@ "question__title": "Arithmetic Subarrays", "question__title_slug": "arithmetic-subarrays", "question__hide": false, - "total_acs": 34478, - "total_submitted": 45235, - "total_column_articles": 455, + "total_acs": 34552, + "total_submitted": 45319, + "total_column_articles": 456, "frontend_question_id": "1630", "is_new_question": false }, @@ -37266,9 +37770,9 @@ "question__title": "Slowest Key", "question__title_slug": "slowest-key", "question__hide": false, - "total_acs": 38530, - "total_submitted": 68951, - "total_column_articles": 466, + "total_acs": 38675, + "total_submitted": 69230, + "total_column_articles": 464, "frontend_question_id": "1629", "is_new_question": false }, @@ -37287,8 +37791,8 @@ "question__title": "Check If Two Expression Trees are Equivalent", "question__title_slug": "check-if-two-expression-trees-are-equivalent", "question__hide": false, - "total_acs": 973, - "total_submitted": 1299, + "total_acs": 983, + "total_submitted": 1314, "total_column_articles": 35, "frontend_question_id": "1612", "is_new_question": false @@ -37308,8 +37812,8 @@ "question__title": "Sellers With No Sales", "question__title_slug": "sellers-with-no-sales", "question__hide": false, - "total_acs": 13744, - "total_submitted": 25911, + "total_acs": 14224, + "total_submitted": 27002, "total_column_articles": 103, "frontend_question_id": "1607", "is_new_question": false @@ -37329,9 +37833,9 @@ "question__title": "Best Team With No Conflicts", "question__title_slug": "best-team-with-no-conflicts", "question__hide": false, - "total_acs": 26268, - "total_submitted": 48793, - "total_column_articles": 255, + "total_acs": 26391, + "total_submitted": 48999, + "total_column_articles": 257, "frontend_question_id": "1626", "is_new_question": false }, @@ -37350,8 +37854,8 @@ "question__title": "Lexicographically Smallest String After Applying Operations", "question__title_slug": "lexicographically-smallest-string-after-applying-operations", "question__hide": false, - "total_acs": 17606, - "total_submitted": 26406, + "total_acs": 17637, + "total_submitted": 26453, "total_column_articles": 152, "frontend_question_id": "1625", "is_new_question": false @@ -37371,9 +37875,9 @@ "question__title": "Largest Substring Between Two Equal Characters", "question__title_slug": "largest-substring-between-two-equal-characters", "question__hide": false, - "total_acs": 48608, - "total_submitted": 75360, - "total_column_articles": 708, + "total_acs": 48808, + "total_submitted": 75677, + "total_column_articles": 707, "frontend_question_id": "1624", "is_new_question": false }, @@ -37392,8 +37896,8 @@ "question__title": "Find Nearest Right Node in Binary Tree", "question__title_slug": "find-nearest-right-node-in-binary-tree", "question__hide": false, - "total_acs": 2193, - "total_submitted": 2981, + "total_acs": 2208, + "total_submitted": 3004, "total_column_articles": 64, "frontend_question_id": "1602", "is_new_question": false @@ -37413,8 +37917,8 @@ "question__title": "Number of Ways to Form a Target String Given a Dictionary", "question__title_slug": "number-of-ways-to-form-a-target-string-given-a-dictionary", "question__hide": false, - "total_acs": 3042, - "total_submitted": 6407, + "total_acs": 3072, + "total_submitted": 6485, "total_column_articles": 68, "frontend_question_id": "1639", "is_new_question": false @@ -37434,8 +37938,8 @@ "question__title": "Count Substrings That Differ by One Character", "question__title_slug": "count-substrings-that-differ-by-one-character", "question__hide": false, - "total_acs": 23163, - "total_submitted": 29863, + "total_acs": 23237, + "total_submitted": 29970, "total_column_articles": 200, "frontend_question_id": "1638", "is_new_question": false @@ -37455,9 +37959,9 @@ "question__title": "Widest Vertical Area Between Two Points Containing No Points", "question__title_slug": "widest-vertical-area-between-two-points-containing-no-points", "question__hide": false, - "total_acs": 31384, - "total_submitted": 37264, - "total_column_articles": 289, + "total_acs": 31560, + "total_submitted": 37498, + "total_column_articles": 290, "frontend_question_id": "1637", "is_new_question": false }, @@ -37476,9 +37980,9 @@ "question__title": "Sort Array by Increasing Frequency", "question__title_slug": "sort-array-by-increasing-frequency", "question__hide": false, - "total_acs": 50593, - "total_submitted": 67664, - "total_column_articles": 626, + "total_acs": 50896, + "total_submitted": 68053, + "total_column_articles": 629, "frontend_question_id": "1636", "is_new_question": false }, @@ -37497,8 +38001,8 @@ "question__title": "Count Subtrees With Max Distance Between Cities", "question__title_slug": "count-subtrees-with-max-distance-between-cities", "question__hide": false, - "total_acs": 13208, - "total_submitted": 16772, + "total_acs": 13264, + "total_submitted": 16864, "total_column_articles": 105, "frontend_question_id": "1617", "is_new_question": false @@ -37518,8 +38022,8 @@ "question__title": "Split Two Strings to Make Palindrome", "question__title_slug": "split-two-strings-to-make-palindrome", "question__hide": false, - "total_acs": 24559, - "total_submitted": 65325, + "total_acs": 24593, + "total_submitted": 65412, "total_column_articles": 262, "frontend_question_id": "1616", "is_new_question": false @@ -37539,8 +38043,8 @@ "question__title": "Maximal Network Rank", "question__title_slug": "maximal-network-rank", "question__hide": false, - "total_acs": 33855, - "total_submitted": 56066, + "total_acs": 34023, + "total_submitted": 56302, "total_column_articles": 296, "frontend_question_id": "1615", "is_new_question": false @@ -37560,9 +38064,9 @@ "question__title": "Maximum Nesting Depth of the Parentheses", "question__title_slug": "maximum-nesting-depth-of-the-parentheses", "question__hide": false, - "total_acs": 70153, - "total_submitted": 85733, - "total_column_articles": 885, + "total_acs": 70867, + "total_submitted": 86633, + "total_column_articles": 888, "frontend_question_id": "1614", "is_new_question": false }, @@ -37581,8 +38085,8 @@ "question__title": "Build Binary Expression Tree From Infix Expression", "question__title_slug": "build-binary-expression-tree-from-infix-expression", "question__hide": false, - "total_acs": 862, - "total_submitted": 1301, + "total_acs": 865, + "total_submitted": 1310, "total_column_articles": 34, "frontend_question_id": "1597", "is_new_question": false @@ -37602,9 +38106,9 @@ "question__title": "The Most Frequently Ordered Products for Each Customer", "question__title_slug": "the-most-frequently-ordered-products-for-each-customer", "question__hide": false, - "total_acs": 9409, - "total_submitted": 13410, - "total_column_articles": 108, + "total_acs": 9697, + "total_submitted": 13879, + "total_column_articles": 111, "frontend_question_id": "1596", "is_new_question": false }, @@ -37623,9 +38127,9 @@ "question__title": "Bank Account Summary II", "question__title_slug": "bank-account-summary-ii", "question__hide": false, - "total_acs": 35409, - "total_submitted": 44625, - "total_column_articles": 187, + "total_acs": 36129, + "total_submitted": 45592, + "total_column_articles": 189, "frontend_question_id": "1587", "is_new_question": false }, @@ -37644,8 +38148,8 @@ "question__title": "Maximum Number of Visible Points", "question__title_slug": "maximum-number-of-visible-points", "question__hide": false, - "total_acs": 17961, - "total_submitted": 40463, + "total_acs": 17989, + "total_submitted": 40575, "total_column_articles": 163, "frontend_question_id": "1610", "is_new_question": false @@ -37665,8 +38169,8 @@ "question__title": "Minimum One Bit Operations to Make Integers Zero", "question__title_slug": "minimum-one-bit-operations-to-make-integers-zero", "question__hide": false, - "total_acs": 3660, - "total_submitted": 6042, + "total_acs": 3689, + "total_submitted": 6109, "total_column_articles": 76, "frontend_question_id": "1611", "is_new_question": false @@ -37686,9 +38190,9 @@ "question__title": "Even Odd Tree", "question__title_slug": "even-odd-tree", "question__hide": false, - "total_acs": 35012, - "total_submitted": 60128, - "total_column_articles": 515, + "total_acs": 35203, + "total_submitted": 60417, + "total_column_articles": 514, "frontend_question_id": "1609", "is_new_question": false }, @@ -37707,9 +38211,9 @@ "question__title": "Special Array With X Elements Greater Than or Equal X", "question__title_slug": "special-array-with-x-elements-greater-than-or-equal-x", "question__hide": false, - "total_acs": 56420, - "total_submitted": 91926, - "total_column_articles": 830, + "total_acs": 56623, + "total_submitted": 92238, + "total_column_articles": 829, "frontend_question_id": "1608", "is_new_question": false }, @@ -37728,8 +38232,8 @@ "question__title": "Binary Search Tree Iterator II", "question__title_slug": "binary-search-tree-iterator-ii", "question__hide": false, - "total_acs": 934, - "total_submitted": 1528, + "total_acs": 938, + "total_submitted": 1557, "total_column_articles": 41, "frontend_question_id": "1586", "is_new_question": false @@ -37749,8 +38253,8 @@ "question__title": "Fancy Sequence", "question__title_slug": "fancy-sequence", "question__hide": false, - "total_acs": 5873, - "total_submitted": 32513, + "total_acs": 5934, + "total_submitted": 32739, "total_column_articles": 120, "frontend_question_id": "1622", "is_new_question": false @@ -37770,8 +38274,8 @@ "question__title": "Cat and Mouse II", "question__title_slug": "cat-and-mouse-ii", "question__hide": false, - "total_acs": 13902, - "total_submitted": 21859, + "total_acs": 13914, + "total_submitted": 21892, "total_column_articles": 88, "frontend_question_id": "1728", "is_new_question": false @@ -37791,8 +38295,8 @@ "question__title": "Coordinate With Maximum Network Quality", "question__title_slug": "coordinate-with-maximum-network-quality", "question__hide": false, - "total_acs": 29833, - "total_submitted": 64920, + "total_acs": 29915, + "total_submitted": 65134, "total_column_articles": 289, "frontend_question_id": "1620", "is_new_question": false @@ -37812,8 +38316,8 @@ "question__title": "Number of Sets of K Non-Overlapping Line Segments", "question__title_slug": "number-of-sets-of-k-non-overlapping-line-segments", "question__hide": false, - "total_acs": 3409, - "total_submitted": 6998, + "total_acs": 3434, + "total_submitted": 7054, "total_column_articles": 61, "frontend_question_id": "1621", "is_new_question": false @@ -37833,9 +38337,9 @@ "question__title": "Customer Who Visited but Did Not Make Any Transactions", "question__title_slug": "customer-who-visited-but-did-not-make-any-transactions", "question__hide": false, - "total_acs": 71757, - "total_submitted": 96962, - "total_column_articles": 381, + "total_acs": 75433, + "total_submitted": 102924, + "total_column_articles": 393, "frontend_question_id": "1581", "is_new_question": false }, @@ -37854,9 +38358,9 @@ "question__title": "Maximum Number of Achievable Transfer Requests", "question__title_slug": "maximum-number-of-achievable-transfer-requests", "question__hide": false, - "total_acs": 23340, - "total_submitted": 37626, - "total_column_articles": 264, + "total_acs": 23458, + "total_submitted": 37815, + "total_column_articles": 265, "frontend_question_id": "1601", "is_new_question": false }, @@ -37875,8 +38379,8 @@ "question__title": "Throne Inheritance", "question__title_slug": "throne-inheritance", "question__hide": false, - "total_acs": 19812, - "total_submitted": 30153, + "total_acs": 19845, + "total_submitted": 30210, "total_column_articles": 238, "frontend_question_id": "1600", "is_new_question": false @@ -37896,9 +38400,9 @@ "question__title": "Maximum Profit of Operating a Centennial Wheel", "question__title_slug": "maximum-profit-of-operating-a-centennial-wheel", "question__hide": false, - "total_acs": 36727, - "total_submitted": 69002, - "total_column_articles": 409, + "total_acs": 36817, + "total_submitted": 69222, + "total_column_articles": 411, "frontend_question_id": "1599", "is_new_question": false }, @@ -37917,9 +38421,9 @@ "question__title": "Crawler Log Folder", "question__title_slug": "crawler-log-folder", "question__hide": false, - "total_acs": 45900, - "total_submitted": 66030, - "total_column_articles": 567, + "total_acs": 46087, + "total_submitted": 66303, + "total_column_articles": 565, "frontend_question_id": "1598", "is_new_question": false }, @@ -37938,8 +38442,8 @@ "question__title": "Put Boxes Into the Warehouse II", "question__title_slug": "put-boxes-into-the-warehouse-ii", "question__hide": false, - "total_acs": 696, - "total_submitted": 1193, + "total_acs": 704, + "total_submitted": 1218, "total_column_articles": 33, "frontend_question_id": "1580", "is_new_question": false @@ -37959,9 +38463,9 @@ "question__title": "Warehouse Manager", "question__title_slug": "warehouse-manager", "question__hide": false, - "total_acs": 13809, - "total_submitted": 17702, - "total_column_articles": 106, + "total_acs": 14141, + "total_submitted": 18137, + "total_column_articles": 107, "frontend_question_id": "1571", "is_new_question": false }, @@ -37980,8 +38484,8 @@ "question__title": "Minimum Cost to Connect Two Groups of Points", "question__title_slug": "minimum-cost-to-connect-two-groups-of-points", "question__hide": false, - "total_acs": 11089, - "total_submitted": 16901, + "total_acs": 11114, + "total_submitted": 16949, "total_column_articles": 93, "frontend_question_id": "1595", "is_new_question": false @@ -38001,8 +38505,8 @@ "question__title": "Maximum Non Negative Product in a Matrix", "question__title_slug": "maximum-non-negative-product-in-a-matrix", "question__hide": false, - "total_acs": 7236, - "total_submitted": 20867, + "total_acs": 7322, + "total_submitted": 21061, "total_column_articles": 143, "frontend_question_id": "1594", "is_new_question": false @@ -38022,9 +38526,9 @@ "question__title": "Split a String Into the Max Number of Unique Substrings", "question__title_slug": "split-a-string-into-the-max-number-of-unique-substrings", "question__hide": false, - "total_acs": 9964, - "total_submitted": 17078, - "total_column_articles": 151, + "total_acs": 10050, + "total_submitted": 17212, + "total_column_articles": 153, "frontend_question_id": "1593", "is_new_question": false }, @@ -38043,9 +38547,9 @@ "question__title": "Rearrange Spaces Between Words", "question__title_slug": "rearrange-spaces-between-words", "question__hide": false, - "total_acs": 42176, - "total_submitted": 90446, - "total_column_articles": 590, + "total_acs": 42282, + "total_submitted": 90677, + "total_column_articles": 591, "frontend_question_id": "1592", "is_new_question": false }, @@ -38064,8 +38568,8 @@ "question__title": "Dot Product of Two Sparse Vectors", "question__title_slug": "dot-product-of-two-sparse-vectors", "question__hide": false, - "total_acs": 4914, - "total_submitted": 5557, + "total_acs": 4999, + "total_submitted": 5650, "total_column_articles": 62, "frontend_question_id": "1570", "is_new_question": false @@ -38085,8 +38589,8 @@ "question__title": "Unique Orders and Customers Per Month", "question__title_slug": "unique-orders-and-customers-per-month", "question__hide": false, - "total_acs": 6681, - "total_submitted": 8970, + "total_acs": 6752, + "total_submitted": 9057, "total_column_articles": 60, "frontend_question_id": "1565", "is_new_question": false @@ -38106,9 +38610,9 @@ "question__title": "Find Valid Matrix Given Row and Column Sums", "question__title_slug": "find-valid-matrix-given-row-and-column-sums", "question__hide": false, - "total_acs": 28169, - "total_submitted": 34822, - "total_column_articles": 279, + "total_acs": 28240, + "total_submitted": 34912, + "total_column_articles": 280, "frontend_question_id": "1605", "is_new_question": false }, @@ -38127,8 +38631,8 @@ "question__title": "Find Servers That Handled Most Number of Requests", "question__title_slug": "find-servers-that-handled-most-number-of-requests", "question__hide": false, - "total_acs": 21531, - "total_submitted": 44475, + "total_acs": 21551, + "total_submitted": 44547, "total_column_articles": 205, "frontend_question_id": "1606", "is_new_question": false @@ -38148,9 +38652,9 @@ "question__title": "Alert Using Same Key-Card Three or More Times in a One Hour Period", "question__title_slug": "alert-using-same-key-card-three-or-more-times-in-a-one-hour-period", "question__hide": false, - "total_acs": 29626, - "total_submitted": 58806, - "total_column_articles": 351, + "total_acs": 29682, + "total_submitted": 58914, + "total_column_articles": 352, "frontend_question_id": "1604", "is_new_question": false }, @@ -38169,9 +38673,9 @@ "question__title": "Design Parking System", "question__title_slug": "design-parking-system", "question__hide": false, - "total_acs": 80258, - "total_submitted": 96020, - "total_column_articles": 608, + "total_acs": 80751, + "total_submitted": 96706, + "total_column_articles": 611, "frontend_question_id": "1603", "is_new_question": false }, @@ -38190,8 +38694,8 @@ "question__title": "Check If String Is Transformable With Substring Sort Operations", "question__title_slug": "check-if-string-is-transformable-with-substring-sort-operations", "question__hide": false, - "total_acs": 3630, - "total_submitted": 8298, + "total_acs": 3652, + "total_submitted": 8353, "total_column_articles": 54, "frontend_question_id": "1585", "is_new_question": false @@ -38211,9 +38715,9 @@ "question__title": "Min Cost to Connect All Points", "question__title_slug": "min-cost-to-connect-all-points", "question__hide": false, - "total_acs": 58250, - "total_submitted": 89047, - "total_column_articles": 683, + "total_acs": 59056, + "total_submitted": 90214, + "total_column_articles": 685, "frontend_question_id": "1584", "is_new_question": false }, @@ -38232,9 +38736,9 @@ "question__title": "Count Unhappy Friends", "question__title_slug": "count-unhappy-friends", "question__hide": false, - "total_acs": 21168, - "total_submitted": 31200, - "total_column_articles": 259, + "total_acs": 21229, + "total_submitted": 31289, + "total_column_articles": 260, "frontend_question_id": "1583", "is_new_question": false }, @@ -38253,8 +38757,8 @@ "question__title": "Special Positions in a Binary Matrix", "question__title_slug": "special-positions-in-a-binary-matrix", "question__hide": false, - "total_acs": 43214, - "total_submitted": 62441, + "total_acs": 43378, + "total_submitted": 62724, "total_column_articles": 485, "frontend_question_id": "1582", "is_new_question": false @@ -38274,8 +38778,8 @@ "question__title": "Put Boxes Into the Warehouse I", "question__title_slug": "put-boxes-into-the-warehouse-i", "question__hide": false, - "total_acs": 1267, - "total_submitted": 2129, + "total_acs": 1277, + "total_submitted": 2161, "total_column_articles": 43, "frontend_question_id": "1564", "is_new_question": false @@ -38295,8 +38799,8 @@ "question__title": "Bank Account Summary", "question__title_slug": "bank-account-summary", "question__hide": false, - "total_acs": 5998, - "total_submitted": 13212, + "total_acs": 6081, + "total_submitted": 13364, "total_column_articles": 84, "frontend_question_id": "1555", "is_new_question": false @@ -38316,9 +38820,9 @@ "question__title": "Remove Max Number of Edges to Keep Graph Fully Traversable", "question__title_slug": "remove-max-number-of-edges-to-keep-graph-fully-traversable", "question__hide": false, - "total_acs": 19386, - "total_submitted": 31205, - "total_column_articles": 334, + "total_acs": 19421, + "total_submitted": 31279, + "total_column_articles": 335, "frontend_question_id": "1579", "is_new_question": false }, @@ -38337,9 +38841,9 @@ "question__title": "Minimum Time to Make Rope Colorful", "question__title_slug": "minimum-time-to-make-rope-colorful", "question__hide": false, - "total_acs": 16891, - "total_submitted": 28035, - "total_column_articles": 289, + "total_acs": 16992, + "total_submitted": 28196, + "total_column_articles": 293, "frontend_question_id": "1578", "is_new_question": false }, @@ -38358,9 +38862,9 @@ "question__title": "Number of Ways Where Square of Number Is Equal to Product of Two Numbers", "question__title_slug": "number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers", "question__hide": false, - "total_acs": 7623, - "total_submitted": 21415, - "total_column_articles": 114, + "total_acs": 7670, + "total_submitted": 21532, + "total_column_articles": 115, "frontend_question_id": "1577", "is_new_question": false }, @@ -38379,9 +38883,9 @@ "question__title": "Replace All ?'s to Avoid Consecutive Repeating Characters", "question__title_slug": "replace-all-s-to-avoid-consecutive-repeating-characters", "question__hide": false, - "total_acs": 55057, - "total_submitted": 108540, - "total_column_articles": 671, + "total_acs": 55402, + "total_submitted": 109378, + "total_column_articles": 672, "frontend_question_id": "1576", "is_new_question": false }, @@ -38400,9 +38904,9 @@ "question__title": "Strings Differ by One Character", "question__title_slug": "strings-differ-by-one-character", "question__hide": false, - "total_acs": 1340, - "total_submitted": 2821, - "total_column_articles": 34, + "total_acs": 1351, + "total_submitted": 2880, + "total_column_articles": 35, "frontend_question_id": "1554", "is_new_question": false }, @@ -38421,8 +38925,8 @@ "question__title": "Strange Printer II", "question__title_slug": "strange-printer-ii", "question__hide": false, - "total_acs": 2700, - "total_submitted": 4187, + "total_acs": 2744, + "total_submitted": 4264, "total_column_articles": 72, "frontend_question_id": "1591", "is_new_question": false @@ -38442,8 +38946,8 @@ "question__title": "Maximum Sum Obtained of Any Permutation", "question__title_slug": "maximum-sum-obtained-of-any-permutation", "question__hide": false, - "total_acs": 7230, - "total_submitted": 21848, + "total_acs": 7289, + "total_submitted": 21998, "total_column_articles": 102, "frontend_question_id": "1589", "is_new_question": false @@ -38463,9 +38967,9 @@ "question__title": "Make Sum Divisible by P", "question__title_slug": "make-sum-divisible-by-p", "question__hide": false, - "total_acs": 27042, - "total_submitted": 73905, - "total_column_articles": 202, + "total_acs": 27190, + "total_submitted": 74315, + "total_column_articles": 203, "frontend_question_id": "1590", "is_new_question": false }, @@ -38484,9 +38988,9 @@ "question__title": "Sum of All Odd Length Subarrays", "question__title_slug": "sum-of-all-odd-length-subarrays", "question__hide": false, - "total_acs": 70709, - "total_submitted": 85384, - "total_column_articles": 1021, + "total_acs": 71206, + "total_submitted": 86034, + "total_column_articles": 1025, "frontend_question_id": "1588", "is_new_question": false }, @@ -38505,8 +39009,8 @@ "question__title": "Number of Ways to Reorder Array to Get Same BST", "question__title_slug": "number-of-ways-to-reorder-array-to-get-same-bst", "question__hide": false, - "total_acs": 3700, - "total_submitted": 7515, + "total_acs": 3717, + "total_submitted": 7547, "total_column_articles": 68, "frontend_question_id": "1569", "is_new_question": false @@ -38526,8 +39030,8 @@ "question__title": "Minimum Number of Days to Disconnect Island", "question__title_slug": "minimum-number-of-days-to-disconnect-island", "question__hide": false, - "total_acs": 4266, - "total_submitted": 9530, + "total_acs": 4292, + "total_submitted": 9632, "total_column_articles": 88, "frontend_question_id": "1568", "is_new_question": false @@ -38547,9 +39051,9 @@ "question__title": "Maximum Length of Subarray With Positive Product", "question__title_slug": "maximum-length-of-subarray-with-positive-product", "question__hide": false, - "total_acs": 36394, - "total_submitted": 84423, - "total_column_articles": 480, + "total_acs": 36618, + "total_submitted": 84946, + "total_column_articles": 481, "frontend_question_id": "1567", "is_new_question": false }, @@ -38568,9 +39072,9 @@ "question__title": "Detect Pattern of Length M Repeated K or More Times", "question__title_slug": "detect-pattern-of-length-m-repeated-k-or-more-times", "question__hide": false, - "total_acs": 13920, - "total_submitted": 31211, - "total_column_articles": 198, + "total_acs": 14099, + "total_submitted": 31626, + "total_column_articles": 200, "frontend_question_id": "1566", "is_new_question": false }, @@ -38589,8 +39093,8 @@ "question__title": "The Most Recent Orders for Each Product", "question__title_slug": "the-most-recent-orders-for-each-product", "question__hide": false, - "total_acs": 11272, - "total_submitted": 17028, + "total_acs": 11553, + "total_submitted": 17504, "total_column_articles": 139, "frontend_question_id": "1549", "is_new_question": false @@ -38610,8 +39114,8 @@ "question__title": "The Most Similar Path in a Graph", "question__title_slug": "the-most-similar-path-in-a-graph", "question__hide": false, - "total_acs": 783, - "total_submitted": 1166, + "total_acs": 787, + "total_submitted": 1186, "total_column_articles": 25, "frontend_question_id": "1548", "is_new_question": false @@ -38631,9 +39135,9 @@ "question__title": "Fix Product Name Format", "question__title_slug": "fix-product-name-format", "question__hide": false, - "total_acs": 6317, - "total_submitted": 11454, - "total_column_articles": 59, + "total_acs": 6389, + "total_submitted": 11606, + "total_column_articles": 60, "frontend_question_id": "1543", "is_new_question": false }, @@ -38652,9 +39156,9 @@ "question__title": "Stone Game V", "question__title_slug": "stone-game-v", "question__hide": false, - "total_acs": 6326, - "total_submitted": 15895, - "total_column_articles": 81, + "total_acs": 6363, + "total_submitted": 16026, + "total_column_articles": 82, "frontend_question_id": "1563", "is_new_question": false }, @@ -38673,9 +39177,9 @@ "question__title": "Find Latest Group of Size M", "question__title_slug": "find-latest-group-of-size-m", "question__hide": false, - "total_acs": 7434, - "total_submitted": 19974, - "total_column_articles": 142, + "total_acs": 7459, + "total_submitted": 20091, + "total_column_articles": 143, "frontend_question_id": "1562", "is_new_question": false }, @@ -38694,9 +39198,9 @@ "question__title": "Maximum Number of Coins You Can Get", "question__title_slug": "maximum-number-of-coins-you-can-get", "question__hide": false, - "total_acs": 18256, - "total_submitted": 23380, - "total_column_articles": 272, + "total_acs": 18468, + "total_submitted": 23664, + "total_column_articles": 277, "frontend_question_id": "1561", "is_new_question": false }, @@ -38715,8 +39219,8 @@ "question__title": "Most Visited Sector in a Circular Track", "question__title_slug": "most-visited-sector-in-a-circular-track", "question__hide": false, - "total_acs": 13053, - "total_submitted": 22559, + "total_acs": 13163, + "total_submitted": 22725, "total_column_articles": 139, "frontend_question_id": "1560", "is_new_question": false @@ -38736,8 +39240,8 @@ "question__title": "Guess the Majority in a Hidden Array", "question__title_slug": "guess-the-majority-in-a-hidden-array", "question__hide": false, - "total_acs": 652, - "total_submitted": 1068, + "total_acs": 672, + "total_submitted": 1121, "total_column_articles": 16, "frontend_question_id": "1538", "is_new_question": false @@ -38757,8 +39261,8 @@ "question__title": "Count All Possible Routes", "question__title_slug": "count-all-possible-routes", "question__hide": false, - "total_acs": 13810, - "total_submitted": 24409, + "total_acs": 13971, + "total_submitted": 24751, "total_column_articles": 130, "frontend_question_id": "1575", "is_new_question": false @@ -38778,9 +39282,9 @@ "question__title": "Shortest Subarray to be Removed to Make Array Sorted", "question__title_slug": "shortest-subarray-to-be-removed-to-make-array-sorted", "question__hide": false, - "total_acs": 27791, - "total_submitted": 64260, - "total_column_articles": 297, + "total_acs": 27916, + "total_submitted": 64511, + "total_column_articles": 298, "frontend_question_id": "1574", "is_new_question": false }, @@ -38799,9 +39303,9 @@ "question__title": "Number of Ways to Split a String", "question__title_slug": "number-of-ways-to-split-a-string", "question__hide": false, - "total_acs": 7386, - "total_submitted": 23365, - "total_column_articles": 98, + "total_acs": 7434, + "total_submitted": 23498, + "total_column_articles": 99, "frontend_question_id": "1573", "is_new_question": false }, @@ -38820,9 +39324,9 @@ "question__title": "Matrix Diagonal Sum", "question__title_slug": "matrix-diagonal-sum", "question__hide": false, - "total_acs": 70867, - "total_submitted": 85408, - "total_column_articles": 830, + "total_acs": 72390, + "total_submitted": 87292, + "total_column_articles": 843, "frontend_question_id": "1572", "is_new_question": false }, @@ -38841,8 +39345,8 @@ "question__title": "Minimum Number of Days to Eat N Oranges", "question__title_slug": "minimum-number-of-days-to-eat-n-oranges", "question__hide": false, - "total_acs": 11893, - "total_submitted": 35969, + "total_acs": 12004, + "total_submitted": 36259, "total_column_articles": 154, "frontend_question_id": "1553", "is_new_question": false @@ -38862,9 +39366,9 @@ "question__title": "Magnetic Force Between Two Balls", "question__title_slug": "magnetic-force-between-two-balls", "question__hide": false, - "total_acs": 20177, - "total_submitted": 34963, - "total_column_articles": 244, + "total_acs": 20386, + "total_submitted": 35255, + "total_column_articles": 246, "frontend_question_id": "1552", "is_new_question": false }, @@ -38883,8 +39387,8 @@ "question__title": "Minimum Operations to Make Array Equal", "question__title_slug": "minimum-operations-to-make-array-equal", "question__hide": false, - "total_acs": 16274, - "total_submitted": 19768, + "total_acs": 16363, + "total_submitted": 19879, "total_column_articles": 232, "frontend_question_id": "1551", "is_new_question": false @@ -38904,8 +39408,8 @@ "question__title": "Find the Index of the Large Integer", "question__title_slug": "find-the-index-of-the-large-integer", "question__hide": false, - "total_acs": 1734, - "total_submitted": 2947, + "total_acs": 1778, + "total_submitted": 3034, "total_column_articles": 56, "frontend_question_id": "1533", "is_new_question": false @@ -38925,9 +39429,9 @@ "question__title": "The Most Recent Three Orders", "question__title_slug": "the-most-recent-three-orders", "question__hide": false, - "total_acs": 9441, - "total_submitted": 14960, - "total_column_articles": 110, + "total_acs": 9711, + "total_submitted": 15403, + "total_column_articles": 112, "frontend_question_id": "1532", "is_new_question": false }, @@ -38946,9 +39450,9 @@ "question__title": "Patients With a Condition", "question__title_slug": "patients-with-a-condition", "question__hide": false, - "total_acs": 69146, - "total_submitted": 147509, - "total_column_articles": 319, + "total_acs": 70687, + "total_submitted": 150784, + "total_column_articles": 321, "frontend_question_id": "1527", "is_new_question": false }, @@ -38967,8 +39471,8 @@ "question__title": "Minimum Cost to Cut a Stick", "question__title_slug": "minimum-cost-to-cut-a-stick", "question__hide": false, - "total_acs": 7996, - "total_submitted": 13867, + "total_acs": 8132, + "total_submitted": 14090, "total_column_articles": 122, "frontend_question_id": "1547", "is_new_question": false @@ -38988,9 +39492,9 @@ "question__title": "Find Longest Awesome Substring", "question__title_slug": "find-longest-awesome-substring", "question__hide": false, - "total_acs": 4962, - "total_submitted": 10980, - "total_column_articles": 83, + "total_acs": 4997, + "total_submitted": 11099, + "total_column_articles": 82, "frontend_question_id": "1542", "is_new_question": false }, @@ -39009,8 +39513,8 @@ "question__title": "Find Kth Bit in Nth Binary String", "question__title_slug": "find-kth-bit-in-nth-binary-string", "question__hide": false, - "total_acs": 15701, - "total_submitted": 26504, + "total_acs": 15778, + "total_submitted": 26641, "total_column_articles": 194, "frontend_question_id": "1545", "is_new_question": false @@ -39030,8 +39534,8 @@ "question__title": "Make The String Great", "question__title_slug": "make-the-string-great", "question__hide": false, - "total_acs": 31195, - "total_submitted": 55272, + "total_acs": 31462, + "total_submitted": 55729, "total_column_articles": 483, "frontend_question_id": "1544", "is_new_question": false @@ -39051,8 +39555,8 @@ "question__title": "Diameter of N-Ary Tree", "question__title_slug": "diameter-of-n-ary-tree", "question__hide": false, - "total_acs": 3098, - "total_submitted": 4301, + "total_acs": 3173, + "total_submitted": 4413, "total_column_articles": 68, "frontend_question_id": "1522", "is_new_question": false @@ -39072,9 +39576,9 @@ "question__title": "Find Users With Valid E-Mails", "question__title_slug": "find-users-with-valid-e-mails", "question__hide": false, - "total_acs": 21389, - "total_submitted": 40305, - "total_column_articles": 123, + "total_acs": 22702, + "total_submitted": 42722, + "total_column_articles": 125, "frontend_question_id": "1517", "is_new_question": false }, @@ -39093,9 +39597,9 @@ "question__title": "Detect Cycles in 2D Grid", "question__title_slug": "detect-cycles-in-2d-grid", "question__hide": false, - "total_acs": 7963, - "total_submitted": 19109, - "total_column_articles": 123, + "total_acs": 8080, + "total_submitted": 19346, + "total_column_articles": 125, "frontend_question_id": "1559", "is_new_question": false }, @@ -39114,8 +39618,8 @@ "question__title": "Minimum Numbers of Function Calls to Make Target Array", "question__title_slug": "minimum-numbers-of-function-calls-to-make-target-array", "question__hide": false, - "total_acs": 6994, - "total_submitted": 11097, + "total_acs": 7062, + "total_submitted": 11226, "total_column_articles": 102, "frontend_question_id": "1558", "is_new_question": false @@ -39135,8 +39639,8 @@ "question__title": "Minimum Number of Vertices to Reach All Nodes", "question__title_slug": "minimum-number-of-vertices-to-reach-all-nodes", "question__hide": false, - "total_acs": 20257, - "total_submitted": 24835, + "total_acs": 20548, + "total_submitted": 25172, "total_column_articles": 247, "frontend_question_id": "1557", "is_new_question": false @@ -39156,9 +39660,9 @@ "question__title": "Thousand Separator", "question__title_slug": "thousand-separator", "question__hide": false, - "total_acs": 22395, - "total_submitted": 39809, - "total_column_articles": 321, + "total_acs": 22752, + "total_submitted": 40445, + "total_column_articles": 322, "frontend_question_id": "1556", "is_new_question": false }, @@ -39177,8 +39681,8 @@ "question__title": "Get the Maximum Score", "question__title_slug": "get-the-maximum-score", "question__hide": false, - "total_acs": 7510, - "total_submitted": 18477, + "total_acs": 7563, + "total_submitted": 18577, "total_column_articles": 135, "frontend_question_id": "1537", "is_new_question": false @@ -39198,8 +39702,8 @@ "question__title": "Minimum Swaps to Arrange a Binary Grid", "question__title_slug": "minimum-swaps-to-arrange-a-binary-grid", "question__hide": false, - "total_acs": 5725, - "total_submitted": 12177, + "total_acs": 5741, + "total_submitted": 12228, "total_column_articles": 99, "frontend_question_id": "1536", "is_new_question": false @@ -39219,8 +39723,8 @@ "question__title": "Find the Winner of an Array Game", "question__title_slug": "find-the-winner-of-an-array-game", "question__hide": false, - "total_acs": 17835, - "total_submitted": 38336, + "total_acs": 17895, + "total_submitted": 38461, "total_column_articles": 229, "frontend_question_id": "1535", "is_new_question": false @@ -39240,9 +39744,9 @@ "question__title": "Count Good Triplets", "question__title_slug": "count-good-triplets", "question__hide": false, - "total_acs": 36135, - "total_submitted": 47971, - "total_column_articles": 301, + "total_acs": 37274, + "total_submitted": 49579, + "total_column_articles": 305, "frontend_question_id": "1534", "is_new_question": false }, @@ -39261,8 +39765,8 @@ "question__title": "Move Sub-Tree of N-Ary Tree", "question__title_slug": "move-sub-tree-of-n-ary-tree", "question__hide": false, - "total_acs": 469, - "total_submitted": 883, + "total_acs": 475, + "total_submitted": 905, "total_column_articles": 19, "frontend_question_id": "1516", "is_new_question": false @@ -39282,8 +39786,8 @@ "question__title": "Customer Order Frequency", "question__title_slug": "customer-order-frequency", "question__hide": false, - "total_acs": 10785, - "total_submitted": 17197, + "total_acs": 11070, + "total_submitted": 17903, "total_column_articles": 123, "frontend_question_id": "1511", "is_new_question": false @@ -39303,9 +39807,9 @@ "question__title": "Number of Good Leaf Nodes Pairs", "question__title_slug": "number-of-good-leaf-nodes-pairs", "question__hide": false, - "total_acs": 12268, - "total_submitted": 20772, - "total_column_articles": 215, + "total_acs": 12354, + "total_submitted": 20900, + "total_column_articles": 216, "frontend_question_id": "1530", "is_new_question": false }, @@ -39324,8 +39828,8 @@ "question__title": "Minimum Suffix Flips", "question__title_slug": "minimum-suffix-flips", "question__hide": false, - "total_acs": 12228, - "total_submitted": 17308, + "total_acs": 12319, + "total_submitted": 17431, "total_column_articles": 189, "frontend_question_id": "1529", "is_new_question": false @@ -39345,9 +39849,9 @@ "question__title": "Shuffle String", "question__title_slug": "shuffle-string", "question__hide": false, - "total_acs": 41976, - "total_submitted": 53328, - "total_column_articles": 510, + "total_acs": 42241, + "total_submitted": 53644, + "total_column_articles": 513, "frontend_question_id": "1528", "is_new_question": false }, @@ -39366,8 +39870,8 @@ "question__title": "Find Root of N-Ary Tree", "question__title_slug": "find-root-of-n-ary-tree", "question__hide": false, - "total_acs": 1805, - "total_submitted": 2241, + "total_acs": 1845, + "total_submitted": 2294, "total_column_articles": 34, "frontend_question_id": "1506", "is_new_question": false @@ -39387,8 +39891,8 @@ "question__title": "Maximum Number of Non-Overlapping Subarrays With Sum Equals Target", "question__title_slug": "maximum-number-of-non-overlapping-subarrays-with-sum-equals-target", "question__hide": false, - "total_acs": 7995, - "total_submitted": 17513, + "total_acs": 8047, + "total_submitted": 17612, "total_column_articles": 112, "frontend_question_id": "1546", "is_new_question": false @@ -39408,8 +39912,8 @@ "question__title": "Minimum Insertions to Balance a Parentheses String", "question__title_slug": "minimum-insertions-to-balance-a-parentheses-string", "question__hide": false, - "total_acs": 21027, - "total_submitted": 42879, + "total_acs": 21277, + "total_submitted": 43359, "total_column_articles": 237, "frontend_question_id": "1541", "is_new_question": false @@ -39429,8 +39933,8 @@ "question__title": "Can Convert String in K Moves", "question__title_slug": "can-convert-string-in-k-moves", "question__hide": false, - "total_acs": 7316, - "total_submitted": 21600, + "total_acs": 7360, + "total_submitted": 21705, "total_column_articles": 116, "frontend_question_id": "1540", "is_new_question": false @@ -39450,9 +39954,9 @@ "question__title": "Kth Missing Positive Number", "question__title_slug": "kth-missing-positive-number", "question__hide": false, - "total_acs": 46008, - "total_submitted": 84866, - "total_column_articles": 614, + "total_acs": 46524, + "total_submitted": 85747, + "total_column_articles": 615, "frontend_question_id": "1539", "is_new_question": false }, @@ -39471,8 +39975,8 @@ "question__title": "Find a Value of a Mysterious Function Closest to Target", "question__title_slug": "find-a-value-of-a-mysterious-function-closest-to-target", "question__hide": false, - "total_acs": 4584, - "total_submitted": 10344, + "total_acs": 4644, + "total_submitted": 10456, "total_column_articles": 81, "frontend_question_id": "1521", "is_new_question": false @@ -39492,8 +39996,8 @@ "question__title": "Maximum Number of Non-Overlapping Substrings", "question__title_slug": "maximum-number-of-non-overlapping-substrings", "question__hide": false, - "total_acs": 3685, - "total_submitted": 10115, + "total_acs": 3708, + "total_submitted": 10193, "total_column_articles": 91, "frontend_question_id": "1520", "is_new_question": false @@ -39513,8 +40017,8 @@ "question__title": "Number of Nodes in the Sub-Tree With the Same Label", "question__title_slug": "number-of-nodes-in-the-sub-tree-with-the-same-label", "question__hide": false, - "total_acs": 8036, - "total_submitted": 23596, + "total_acs": 8091, + "total_submitted": 23680, "total_column_articles": 155, "frontend_question_id": "1519", "is_new_question": false @@ -39534,9 +40038,9 @@ "question__title": "Water Bottles", "question__title_slug": "water-bottles", "question__hide": false, - "total_acs": 65154, - "total_submitted": 93776, - "total_column_articles": 938, + "total_acs": 65417, + "total_submitted": 94153, + "total_column_articles": 939, "frontend_question_id": "1518", "is_new_question": false }, @@ -39555,9 +40059,9 @@ "question__title": "Countries You Can Safely Invest In", "question__title_slug": "countries-you-can-safely-invest-in", "question__hide": false, - "total_acs": 15516, - "total_submitted": 27713, - "total_column_articles": 166, + "total_acs": 15824, + "total_submitted": 28323, + "total_column_articles": 169, "frontend_question_id": "1501", "is_new_question": false }, @@ -39576,8 +40080,8 @@ "question__title": "Design a File Sharing System", "question__title_slug": "design-a-file-sharing-system", "question__hide": false, - "total_acs": 2052, - "total_submitted": 6807, + "total_acs": 2077, + "total_submitted": 6868, "total_column_articles": 53, "frontend_question_id": "1500", "is_new_question": false @@ -39597,9 +40101,9 @@ "question__title": "Friendly Movies Streamed Last Month", "question__title_slug": "friendly-movies-streamed-last-month", "question__hide": false, - "total_acs": 9346, - "total_submitted": 17700, - "total_column_articles": 59, + "total_acs": 9620, + "total_submitted": 18226, + "total_column_articles": 60, "frontend_question_id": "1495", "is_new_question": false }, @@ -39618,8 +40122,8 @@ "question__title": "Best Position for a Service Centre", "question__title_slug": "best-position-for-a-service-centre", "question__hide": false, - "total_acs": 4865, - "total_submitted": 13845, + "total_acs": 4882, + "total_submitted": 13890, "total_column_articles": 75, "frontend_question_id": "1515", "is_new_question": false @@ -39639,8 +40143,8 @@ "question__title": "String Compression II", "question__title_slug": "string-compression-ii", "question__hide": false, - "total_acs": 3325, - "total_submitted": 8461, + "total_acs": 3347, + "total_submitted": 8525, "total_column_articles": 51, "frontend_question_id": "1531", "is_new_question": false @@ -39660,9 +40164,9 @@ "question__title": "Number of Substrings With Only 1s", "question__title_slug": "number-of-substrings-with-only-1s", "question__hide": false, - "total_acs": 15557, - "total_submitted": 38761, - "total_column_articles": 216, + "total_acs": 15673, + "total_submitted": 39044, + "total_column_articles": 219, "frontend_question_id": "1513", "is_new_question": false }, @@ -39681,9 +40185,9 @@ "question__title": "Number of Good Pairs", "question__title_slug": "number-of-good-pairs", "question__hide": false, - "total_acs": 88963, - "total_submitted": 106714, - "total_column_articles": 1053, + "total_acs": 90718, + "total_submitted": 108876, + "total_column_articles": 1065, "frontend_question_id": "1512", "is_new_question": false }, @@ -39702,9 +40206,9 @@ "question__title": "Clone N-ary Tree", "question__title_slug": "clone-n-ary-tree", "question__hide": false, - "total_acs": 2799, - "total_submitted": 3377, - "total_column_articles": 56, + "total_acs": 2855, + "total_submitted": 3456, + "total_column_articles": 57, "frontend_question_id": "1490", "is_new_question": false }, @@ -39723,8 +40227,8 @@ "question__title": "Minimum Number of Increments on Subarrays to Form a Target Array", "question__title_slug": "minimum-number-of-increments-on-subarrays-to-form-a-target-array", "question__hide": false, - "total_acs": 5700, - "total_submitted": 8657, + "total_acs": 5761, + "total_submitted": 8743, "total_column_articles": 101, "frontend_question_id": "1526", "is_new_question": false @@ -39744,9 +40248,9 @@ "question__title": "Number of Good Ways to Split a String", "question__title_slug": "number-of-good-ways-to-split-a-string", "question__hide": false, - "total_acs": 9543, - "total_submitted": 14312, - "total_column_articles": 173, + "total_acs": 9657, + "total_submitted": 14484, + "total_column_articles": 175, "frontend_question_id": "1525", "is_new_question": false }, @@ -39765,9 +40269,9 @@ "question__title": "Number of Sub-arrays With Odd Sum", "question__title_slug": "number-of-sub-arrays-with-odd-sum", "question__hide": false, - "total_acs": 10758, - "total_submitted": 22835, - "total_column_articles": 184, + "total_acs": 10869, + "total_submitted": 23058, + "total_column_articles": 186, "frontend_question_id": "1524", "is_new_question": false }, @@ -39786,9 +40290,9 @@ "question__title": "Count Odd Numbers in an Interval Range", "question__title_slug": "count-odd-numbers-in-an-interval-range", "question__hide": false, - "total_acs": 56471, - "total_submitted": 113609, - "total_column_articles": 783, + "total_acs": 57843, + "total_submitted": 116057, + "total_column_articles": 806, "frontend_question_id": "1523", "is_new_question": false }, @@ -39807,8 +40311,8 @@ "question__title": "Minimum Possible Integer After at Most K Adjacent Swaps On Digits", "question__title_slug": "minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits", "question__hide": false, - "total_acs": 5059, - "total_submitted": 12340, + "total_acs": 5106, + "total_submitted": 12443, "total_column_articles": 103, "frontend_question_id": "1505", "is_new_question": false @@ -39828,8 +40332,8 @@ "question__title": "Count Submatrices With All Ones", "question__title_slug": "count-submatrices-with-all-ones", "question__hide": false, - "total_acs": 13298, - "total_submitted": 21019, + "total_acs": 13458, + "total_submitted": 21304, "total_column_articles": 191, "frontend_question_id": "1504", "is_new_question": false @@ -39849,9 +40353,9 @@ "question__title": "Last Moment Before All Ants Fall Out of a Plank", "question__title_slug": "last-moment-before-all-ants-fall-out-of-a-plank", "question__hide": false, - "total_acs": 13166, - "total_submitted": 23719, - "total_column_articles": 133, + "total_acs": 13250, + "total_submitted": 23829, + "total_column_articles": 136, "frontend_question_id": "1503", "is_new_question": false }, @@ -39870,9 +40374,9 @@ "question__title": "Can Make Arithmetic Progression From Sequence", "question__title_slug": "can-make-arithmetic-progression-from-sequence", "question__hide": false, - "total_acs": 55698, - "total_submitted": 81163, - "total_column_articles": 676, + "total_acs": 57575, + "total_submitted": 84304, + "total_column_articles": 693, "frontend_question_id": "1502", "is_new_question": false }, @@ -39891,9 +40395,9 @@ "question__title": "Group Sold Products By The Date", "question__title_slug": "group-sold-products-by-the-date", "question__hide": false, - "total_acs": 66152, - "total_submitted": 96475, - "total_column_articles": 371, + "total_acs": 67417, + "total_submitted": 98102, + "total_column_articles": 375, "frontend_question_id": "1484", "is_new_question": false }, @@ -39912,9 +40416,9 @@ "question__title": "Clone Binary Tree With Random Pointer", "question__title_slug": "clone-binary-tree-with-random-pointer", "question__hide": false, - "total_acs": 1658, - "total_submitted": 2107, - "total_column_articles": 40, + "total_acs": 1688, + "total_submitted": 2147, + "total_column_articles": 41, "frontend_question_id": "1485", "is_new_question": false }, @@ -39933,9 +40437,9 @@ "question__title": "Sales by Day of the Week", "question__title_slug": "sales-by-day-of-the-week", "question__hide": false, - "total_acs": 4351, - "total_submitted": 7671, - "total_column_articles": 77, + "total_acs": 4394, + "total_submitted": 7748, + "total_column_articles": 78, "frontend_question_id": "1479", "is_new_question": false }, @@ -39954,8 +40458,8 @@ "question__title": "Max Value of Equation", "question__title_slug": "max-value-of-equation", "question__hide": false, - "total_acs": 17444, - "total_submitted": 36094, + "total_acs": 17538, + "total_submitted": 36291, "total_column_articles": 176, "frontend_question_id": "1499", "is_new_question": false @@ -39975,9 +40479,9 @@ "question__title": "Number of Subsequences That Satisfy the Given Sum Condition", "question__title_slug": "number-of-subsequences-that-satisfy-the-given-sum-condition", "question__hide": false, - "total_acs": 11788, - "total_submitted": 30308, - "total_column_articles": 138, + "total_acs": 11901, + "total_submitted": 30663, + "total_column_articles": 139, "frontend_question_id": "1498", "is_new_question": false }, @@ -39996,8 +40500,8 @@ "question__title": "Check If Array Pairs Are Divisible by k", "question__title_slug": "check-if-array-pairs-are-divisible-by-k", "question__hide": false, - "total_acs": 14057, - "total_submitted": 34885, + "total_acs": 14137, + "total_submitted": 35115, "total_column_articles": 159, "frontend_question_id": "1497", "is_new_question": false @@ -40017,9 +40521,9 @@ "question__title": "Path Crossing", "question__title_slug": "path-crossing", "question__hide": false, - "total_acs": 18303, - "total_submitted": 33877, - "total_column_articles": 272, + "total_acs": 18496, + "total_submitted": 34189, + "total_column_articles": 273, "frontend_question_id": "1496", "is_new_question": false }, @@ -40038,9 +40542,9 @@ "question__title": "Delete N Nodes After M Nodes of a Linked List", "question__title_slug": "delete-n-nodes-after-m-nodes-of-a-linked-list", "question__hide": false, - "total_acs": 4740, - "total_submitted": 6761, - "total_column_articles": 121, + "total_acs": 4856, + "total_submitted": 6932, + "total_column_articles": 122, "frontend_question_id": "1474", "is_new_question": false }, @@ -40059,8 +40563,8 @@ "question__title": "Stone Game IV", "question__title_slug": "stone-game-iv", "question__hide": false, - "total_acs": 9355, - "total_submitted": 15316, + "total_acs": 9430, + "total_submitted": 15459, "total_column_articles": 112, "frontend_question_id": "1510", "is_new_question": false @@ -40080,8 +40584,8 @@ "question__title": "Minimum Difference Between Largest and Smallest Value in Three Moves", "question__title_slug": "minimum-difference-between-largest-and-smallest-value-in-three-moves", "question__hide": false, - "total_acs": 8773, - "total_submitted": 15699, + "total_acs": 8831, + "total_submitted": 15827, "total_column_articles": 141, "frontend_question_id": "1509", "is_new_question": false @@ -40101,9 +40605,9 @@ "question__title": "Range Sum of Sorted Subarray Sums", "question__title_slug": "range-sum-of-sorted-subarray-sums", "question__hide": false, - "total_acs": 12046, - "total_submitted": 20706, - "total_column_articles": 124, + "total_acs": 12196, + "total_submitted": 20990, + "total_column_articles": 128, "frontend_question_id": "1508", "is_new_question": false }, @@ -40122,9 +40626,9 @@ "question__title": "Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree", "question__title_slug": "find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree", "question__hide": false, - "total_acs": 14065, - "total_submitted": 21299, - "total_column_articles": 156, + "total_acs": 14127, + "total_submitted": 21414, + "total_column_articles": 158, "frontend_question_id": "1489", "is_new_question": false }, @@ -40143,9 +40647,9 @@ "question__title": "Avoid Flood in The City", "question__title_slug": "avoid-flood-in-the-city", "question__hide": false, - "total_acs": 31242, - "total_submitted": 101311, - "total_column_articles": 300, + "total_acs": 31472, + "total_submitted": 102090, + "total_column_articles": 301, "frontend_question_id": "1488", "is_new_question": false }, @@ -40164,9 +40668,9 @@ "question__title": "Making File Names Unique", "question__title_slug": "making-file-names-unique", "question__hide": false, - "total_acs": 36656, - "total_submitted": 88173, - "total_column_articles": 339, + "total_acs": 36734, + "total_submitted": 88343, + "total_column_articles": 340, "frontend_question_id": "1487", "is_new_question": false }, @@ -40185,9 +40689,9 @@ "question__title": "XOR Operation in an Array", "question__title_slug": "xor-operation-in-an-array", "question__hide": false, - "total_acs": 94290, - "total_submitted": 111739, - "total_column_articles": 832, + "total_acs": 95764, + "total_submitted": 113601, + "total_column_articles": 834, "frontend_question_id": "1486", "is_new_question": false }, @@ -40206,8 +40710,8 @@ "question__title": "Find All The Lonely Nodes", "question__title_slug": "find-all-the-lonely-nodes", "question__hide": false, - "total_acs": 5361, - "total_submitted": 6540, + "total_acs": 5398, + "total_submitted": 6582, "total_column_articles": 142, "frontend_question_id": "1469", "is_new_question": false @@ -40227,8 +40731,8 @@ "question__title": "Calculate Salaries", "question__title_slug": "calculate-salaries", "question__hide": false, - "total_acs": 6162, - "total_submitted": 8873, + "total_acs": 6234, + "total_submitted": 8981, "total_column_articles": 73, "frontend_question_id": "1468", "is_new_question": false @@ -40248,8 +40752,8 @@ "question__title": "Rectangles Area", "question__title_slug": "rectangles-area", "question__hide": false, - "total_acs": 6889, - "total_submitted": 10984, + "total_acs": 6937, + "total_submitted": 11057, "total_column_articles": 102, "frontend_question_id": "1459", "is_new_question": false @@ -40269,9 +40773,9 @@ "question__title": "Minimum Number of Days to Make m Bouquets", "question__title_slug": "minimum-number-of-days-to-make-m-bouquets", "question__hide": false, - "total_acs": 43668, - "total_submitted": 76973, - "total_column_articles": 526, + "total_acs": 43981, + "total_submitted": 77559, + "total_column_articles": 530, "frontend_question_id": "1482", "is_new_question": false }, @@ -40290,9 +40794,9 @@ "question__title": "Least Number of Unique Integers after K Removals", "question__title_slug": "least-number-of-unique-integers-after-k-removals", "question__hide": false, - "total_acs": 20951, - "total_submitted": 45593, - "total_column_articles": 265, + "total_acs": 21113, + "total_submitted": 45816, + "total_column_articles": 269, "frontend_question_id": "1481", "is_new_question": false }, @@ -40311,9 +40815,9 @@ "question__title": "Running Sum of 1d Array", "question__title_slug": "running-sum-of-1d-array", "question__hide": false, - "total_acs": 338513, - "total_submitted": 443099, - "total_column_articles": 2639, + "total_acs": 340731, + "total_submitted": 445976, + "total_column_articles": 2652, "frontend_question_id": "1480", "is_new_question": false }, @@ -40332,9 +40836,9 @@ "question__title": "Parallel Courses II", "question__title_slug": "parallel-courses-ii", "question__hide": false, - "total_acs": 12909, - "total_submitted": 25066, - "total_column_articles": 107, + "total_acs": 12963, + "total_submitted": 25166, + "total_column_articles": 109, "frontend_question_id": "1494", "is_new_question": false }, @@ -40353,9 +40857,9 @@ "question__title": "Longest Subarray of 1's After Deleting One Element", "question__title_slug": "longest-subarray-of-1s-after-deleting-one-element", "question__hide": false, - "total_acs": 32096, - "total_submitted": 51370, - "total_column_articles": 433, + "total_acs": 33340, + "total_submitted": 53197, + "total_column_articles": 442, "frontend_question_id": "1493", "is_new_question": false }, @@ -40374,9 +40878,9 @@ "question__title": "The kth Factor of n", "question__title_slug": "the-kth-factor-of-n", "question__hide": false, - "total_acs": 19052, - "total_submitted": 30678, - "total_column_articles": 177, + "total_acs": 19459, + "total_submitted": 31238, + "total_column_articles": 179, "frontend_question_id": "1492", "is_new_question": false }, @@ -40395,9 +40899,9 @@ "question__title": "Average Salary Excluding the Minimum and Maximum Salary", "question__title_slug": "average-salary-excluding-the-minimum-and-maximum-salary", "question__hide": false, - "total_acs": 59966, - "total_submitted": 96000, - "total_column_articles": 754, + "total_acs": 61389, + "total_submitted": 98320, + "total_column_articles": 761, "frontend_question_id": "1491", "is_new_question": false }, @@ -40416,8 +40920,8 @@ "question__title": "Paint House III", "question__title_slug": "paint-house-iii", "question__hide": false, - "total_acs": 18243, - "total_submitted": 27583, + "total_acs": 18306, + "total_submitted": 27699, "total_column_articles": 198, "frontend_question_id": "1473", "is_new_question": false @@ -40437,9 +40941,9 @@ "question__title": "Design Browser History", "question__title_slug": "design-browser-history", "question__hide": false, - "total_acs": 19230, - "total_submitted": 31092, - "total_column_articles": 285, + "total_acs": 19516, + "total_submitted": 31613, + "total_column_articles": 286, "frontend_question_id": "1472", "is_new_question": false }, @@ -40458,9 +40962,9 @@ "question__title": "The k Strongest Values in an Array", "question__title_slug": "the-k-strongest-values-in-an-array", "question__hide": false, - "total_acs": 10653, - "total_submitted": 18966, - "total_column_articles": 148, + "total_acs": 10715, + "total_submitted": 19069, + "total_column_articles": 149, "frontend_question_id": "1471", "is_new_question": false }, @@ -40479,9 +40983,9 @@ "question__title": "Shuffle the Array", "question__title_slug": "shuffle-the-array", "question__hide": false, - "total_acs": 110498, - "total_submitted": 131791, - "total_column_articles": 1201, + "total_acs": 111689, + "total_submitted": 133389, + "total_column_articles": 1208, "frontend_question_id": "1470", "is_new_question": false }, @@ -40500,9 +41004,9 @@ "question__title": "Active Users", "question__title_slug": "active-users", "question__hide": false, - "total_acs": 11699, - "total_submitted": 30744, - "total_column_articles": 139, + "total_acs": 11836, + "total_submitted": 31120, + "total_column_articles": 140, "frontend_question_id": "1454", "is_new_question": false }, @@ -40521,9 +41025,9 @@ "question__title": "Apples & Oranges", "question__title_slug": "apples-oranges", "question__hide": false, - "total_acs": 15743, - "total_submitted": 18973, - "total_column_articles": 147, + "total_acs": 16158, + "total_submitted": 19485, + "total_column_articles": 148, "frontend_question_id": "1445", "is_new_question": false }, @@ -40542,8 +41046,8 @@ "question__title": "Probability of a Two Boxes Having The Same Number of Distinct Balls", "question__title_slug": "probability-of-a-two-boxes-having-the-same-number-of-distinct-balls", "question__hide": false, - "total_acs": 2913, - "total_submitted": 4730, + "total_acs": 2932, + "total_submitted": 4777, "total_column_articles": 74, "frontend_question_id": "1467", "is_new_question": false @@ -40563,9 +41067,9 @@ "question__title": "Reorder Routes to Make All Paths Lead to the City Zero", "question__title_slug": "reorder-routes-to-make-all-paths-lead-to-the-city-zero", "question__hide": false, - "total_acs": 33732, - "total_submitted": 55707, - "total_column_articles": 435, + "total_acs": 34303, + "total_submitted": 56729, + "total_column_articles": 443, "frontend_question_id": "1466", "is_new_question": false }, @@ -40584,9 +41088,9 @@ "question__title": "Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts", "question__title_slug": "maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts", "question__hide": false, - "total_acs": 30169, - "total_submitted": 70484, - "total_column_articles": 269, + "total_acs": 30348, + "total_submitted": 70882, + "total_column_articles": 270, "frontend_question_id": "1465", "is_new_question": false }, @@ -40605,9 +41109,9 @@ "question__title": "Maximum Product of Two Elements in an Array", "question__title_slug": "maximum-product-of-two-elements-in-an-array", "question__hide": false, - "total_acs": 81936, - "total_submitted": 104815, - "total_column_articles": 910, + "total_acs": 82772, + "total_submitted": 105924, + "total_column_articles": 915, "frontend_question_id": "1464", "is_new_question": false }, @@ -40626,8 +41130,8 @@ "question__title": "Find Two Non-overlapping Sub-arrays Each With Target Sum", "question__title_slug": "find-two-non-overlapping-sub-arrays-each-with-target-sum", "question__hide": false, - "total_acs": 9989, - "total_submitted": 31342, + "total_acs": 10119, + "total_submitted": 31662, "total_column_articles": 161, "frontend_question_id": "1477", "is_new_question": false @@ -40647,8 +41151,8 @@ "question__title": "Subrectangle Queries", "question__title_slug": "subrectangle-queries", "question__hide": false, - "total_acs": 16761, - "total_submitted": 19328, + "total_acs": 16843, + "total_submitted": 19411, "total_column_articles": 150, "frontend_question_id": "1476", "is_new_question": false @@ -40668,8 +41172,8 @@ "question__title": "Allocate Mailboxes", "question__title_slug": "allocate-mailboxes", "question__hide": false, - "total_acs": 6296, - "total_submitted": 9984, + "total_acs": 6378, + "total_submitted": 10112, "total_column_articles": 102, "frontend_question_id": "1478", "is_new_question": false @@ -40689,9 +41193,9 @@ "question__title": "Final Prices With a Special Discount in a Shop", "question__title_slug": "final-prices-with-a-special-discount-in-a-shop", "question__hide": false, - "total_acs": 74049, - "total_submitted": 100561, - "total_column_articles": 910, + "total_acs": 74767, + "total_submitted": 101487, + "total_column_articles": 915, "frontend_question_id": "1475", "is_new_question": false }, @@ -40710,9 +41214,9 @@ "question__title": "Max Dot Product of Two Subsequences", "question__title_slug": "max-dot-product-of-two-subsequences", "question__hide": false, - "total_acs": 9160, - "total_submitted": 18919, - "total_column_articles": 137, + "total_acs": 9290, + "total_submitted": 19132, + "total_column_articles": 139, "frontend_question_id": "1458", "is_new_question": false }, @@ -40731,9 +41235,9 @@ "question__title": "Pseudo-Palindromic Paths in a Binary Tree", "question__title_slug": "pseudo-palindromic-paths-in-a-binary-tree", "question__hide": false, - "total_acs": 28928, - "total_submitted": 42163, - "total_column_articles": 321, + "total_acs": 29197, + "total_submitted": 42592, + "total_column_articles": 325, "frontend_question_id": "1457", "is_new_question": false }, @@ -40752,9 +41256,9 @@ "question__title": "Maximum Number of Vowels in a Substring of Given Length", "question__title_slug": "maximum-number-of-vowels-in-a-substring-of-given-length", "question__hide": false, - "total_acs": 44754, - "total_submitted": 78773, - "total_column_articles": 465, + "total_acs": 46351, + "total_submitted": 81402, + "total_column_articles": 471, "frontend_question_id": "1456", "is_new_question": false }, @@ -40773,9 +41277,9 @@ "question__title": "Check If a Word Occurs As a Prefix of Any Word in a Sentence", "question__title_slug": "check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence", "question__hide": false, - "total_acs": 43691, - "total_submitted": 67678, - "total_column_articles": 726, + "total_acs": 43950, + "total_submitted": 68085, + "total_column_articles": 725, "frontend_question_id": "1455", "is_new_question": false }, @@ -40794,8 +41298,8 @@ "question__title": "Evaluate Boolean Expression", "question__title_slug": "evaluate-boolean-expression", "question__hide": false, - "total_acs": 11196, - "total_submitted": 16372, + "total_acs": 11557, + "total_submitted": 16991, "total_column_articles": 100, "frontend_question_id": "1440", "is_new_question": false @@ -40815,8 +41319,8 @@ "question__title": "Create a Session Bar Chart", "question__title_slug": "create-a-session-bar-chart", "question__hide": false, - "total_acs": 7796, - "total_submitted": 12149, + "total_acs": 7883, + "total_submitted": 12278, "total_column_articles": 68, "frontend_question_id": "1435", "is_new_question": false @@ -40836,8 +41340,8 @@ "question__title": "Maximum Number of Darts Inside of a Circular Dartboard", "question__title_slug": "maximum-number-of-darts-inside-of-a-circular-dartboard", "question__hide": false, - "total_acs": 2459, - "total_submitted": 6415, + "total_acs": 2478, + "total_submitted": 6488, "total_column_articles": 43, "frontend_question_id": "1453", "is_new_question": false @@ -40857,8 +41361,8 @@ "question__title": "People Whose List of Favorite Companies Is Not a Subset of Another List", "question__title_slug": "people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list", "question__hide": false, - "total_acs": 8534, - "total_submitted": 16571, + "total_acs": 8582, + "total_submitted": 16638, "total_column_articles": 119, "frontend_question_id": "1452", "is_new_question": false @@ -40878,9 +41382,9 @@ "question__title": "Rearrange Words in a Sentence", "question__title_slug": "rearrange-words-in-a-sentence", "question__hide": false, - "total_acs": 14748, - "total_submitted": 26998, - "total_column_articles": 220, + "total_acs": 14825, + "total_submitted": 27122, + "total_column_articles": 223, "frontend_question_id": "1451", "is_new_question": false }, @@ -40899,9 +41403,9 @@ "question__title": "Number of Students Doing Homework at a Given Time", "question__title_slug": "number-of-students-doing-homework-at-a-given-time", "question__hide": false, - "total_acs": 63660, - "total_submitted": 77314, - "total_column_articles": 714, + "total_acs": 63917, + "total_submitted": 77627, + "total_column_articles": 712, "frontend_question_id": "1450", "is_new_question": false }, @@ -40920,8 +41424,8 @@ "question__title": "Cherry Pickup II", "question__title_slug": "cherry-pickup-ii", "question__hide": false, - "total_acs": 5591, - "total_submitted": 8917, + "total_acs": 5653, + "total_submitted": 9011, "total_column_articles": 118, "frontend_question_id": "1463", "is_new_question": false @@ -40941,8 +41445,8 @@ "question__title": "Course Schedule IV", "question__title_slug": "course-schedule-iv", "question__hide": false, - "total_acs": 31426, - "total_submitted": 61616, + "total_acs": 31694, + "total_submitted": 62053, "total_column_articles": 348, "frontend_question_id": "1462", "is_new_question": false @@ -40962,8 +41466,8 @@ "question__title": "Check If a String Contains All Binary Codes of Size K", "question__title_slug": "check-if-a-string-contains-all-binary-codes-of-size-k", "question__hide": false, - "total_acs": 10625, - "total_submitted": 20136, + "total_acs": 10683, + "total_submitted": 20238, "total_column_articles": 137, "frontend_question_id": "1461", "is_new_question": false @@ -40983,9 +41487,9 @@ "question__title": "Make Two Arrays Equal by Reversing Subarrays", "question__title_slug": "make-two-arrays-equal-by-reversing-subarrays", "question__hide": false, - "total_acs": 56160, - "total_submitted": 72726, - "total_column_articles": 776, + "total_acs": 56425, + "total_submitted": 73089, + "total_column_articles": 779, "frontend_question_id": "1460", "is_new_question": false }, @@ -41004,8 +41508,8 @@ "question__title": "Number of Ways of Cutting a Pizza", "question__title_slug": "number-of-ways-of-cutting-a-pizza", "question__hide": false, - "total_acs": 18641, - "total_submitted": 30218, + "total_acs": 18743, + "total_submitted": 30409, "total_column_articles": 165, "frontend_question_id": "1444", "is_new_question": false @@ -41025,9 +41529,9 @@ "question__title": "Minimum Time to Collect All Apples in a Tree", "question__title_slug": "minimum-time-to-collect-all-apples-in-a-tree", "question__hide": false, - "total_acs": 8765, - "total_submitted": 20014, - "total_column_articles": 205, + "total_acs": 8816, + "total_submitted": 20114, + "total_column_articles": 207, "frontend_question_id": "1443", "is_new_question": false }, @@ -41046,9 +41550,9 @@ "question__title": "Count Triplets That Can Form Two Arrays of Equal XOR", "question__title_slug": "count-triplets-that-can-form-two-arrays-of-equal-xor", "question__hide": false, - "total_acs": 39948, - "total_submitted": 50321, - "total_column_articles": 424, + "total_acs": 40059, + "total_submitted": 50474, + "total_column_articles": 426, "frontend_question_id": "1442", "is_new_question": false }, @@ -41067,9 +41571,9 @@ "question__title": "Build an Array With Stack Operations", "question__title_slug": "build-an-array-with-stack-operations", "question__hide": false, - "total_acs": 50440, - "total_submitted": 70365, - "total_column_articles": 916, + "total_acs": 50639, + "total_submitted": 70631, + "total_column_articles": 914, "frontend_question_id": "1441", "is_new_question": false }, @@ -41088,8 +41592,8 @@ "question__title": "NPV Queries", "question__title_slug": "npv-queries", "question__hide": false, - "total_acs": 6704, - "total_submitted": 9340, + "total_acs": 6782, + "total_submitted": 9439, "total_column_articles": 53, "frontend_question_id": "1421", "is_new_question": false @@ -41109,8 +41613,8 @@ "question__title": "Find the Kth Smallest Sum of a Matrix With Sorted Rows", "question__title_slug": "find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows", "question__hide": false, - "total_acs": 17203, - "total_submitted": 25909, + "total_acs": 17343, + "total_submitted": 26189, "total_column_articles": 142, "frontend_question_id": "1439", "is_new_question": false @@ -41130,9 +41634,9 @@ "question__title": "Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit", "question__title_slug": "longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit", "question__hide": false, - "total_acs": 49950, - "total_submitted": 99175, - "total_column_articles": 611, + "total_acs": 50568, + "total_submitted": 100225, + "total_column_articles": 615, "frontend_question_id": "1438", "is_new_question": false }, @@ -41151,9 +41655,9 @@ "question__title": "Check If All 1's Are at Least Length K Places Away", "question__title_slug": "check-if-all-1s-are-at-least-length-k-places-away", "question__hide": false, - "total_acs": 18635, - "total_submitted": 33494, - "total_column_articles": 278, + "total_acs": 18828, + "total_submitted": 33867, + "total_column_articles": 280, "frontend_question_id": "1437", "is_new_question": false }, @@ -41172,9 +41676,9 @@ "question__title": "Destination City", "question__title_slug": "destination-city", "question__hide": false, - "total_acs": 56197, - "total_submitted": 68809, - "total_column_articles": 800, + "total_acs": 56426, + "total_submitted": 69076, + "total_column_articles": 798, "frontend_question_id": "1436", "is_new_question": false }, @@ -41193,8 +41697,8 @@ "question__title": "Find the Quiet Students in All Exams", "question__title_slug": "find-the-quiet-students-in-all-exams", "question__hide": false, - "total_acs": 8592, - "total_submitted": 16713, + "total_acs": 8841, + "total_submitted": 17301, "total_column_articles": 150, "frontend_question_id": "1412", "is_new_question": false @@ -41214,8 +41718,8 @@ "question__title": "Form Largest Integer With Digits That Add up to Target", "question__title_slug": "form-largest-integer-with-digits-that-add-up-to-target", "question__hide": false, - "total_acs": 20081, - "total_submitted": 32256, + "total_acs": 20152, + "total_submitted": 32392, "total_column_articles": 239, "frontend_question_id": "1449", "is_new_question": false @@ -41235,9 +41739,9 @@ "question__title": "Count Good Nodes in Binary Tree", "question__title_slug": "count-good-nodes-in-binary-tree", "question__hide": false, - "total_acs": 51296, - "total_submitted": 69456, - "total_column_articles": 576, + "total_acs": 52237, + "total_submitted": 70784, + "total_column_articles": 588, "frontend_question_id": "1448", "is_new_question": false }, @@ -41256,9 +41760,9 @@ "question__title": "Simplified Fractions", "question__title_slug": "simplified-fractions", "question__hide": false, - "total_acs": 42711, - "total_submitted": 63188, - "total_column_articles": 540, + "total_acs": 42812, + "total_submitted": 63346, + "total_column_articles": 538, "frontend_question_id": "1447", "is_new_question": false }, @@ -41277,9 +41781,9 @@ "question__title": "Consecutive Characters", "question__title_slug": "consecutive-characters", "question__hide": false, - "total_acs": 63797, - "total_submitted": 106164, - "total_column_articles": 832, + "total_acs": 64227, + "total_submitted": 106889, + "total_column_articles": 831, "frontend_question_id": "1446", "is_new_question": false }, @@ -41298,9 +41802,9 @@ "question__title": "Top Travellers", "question__title_slug": "top-travellers", "question__hide": false, - "total_acs": 43977, - "total_submitted": 78195, - "total_column_articles": 309, + "total_acs": 44866, + "total_submitted": 79795, + "total_column_articles": 314, "frontend_question_id": "1407", "is_new_question": false }, @@ -41319,8 +41823,8 @@ "question__title": "Diagonal Traverse II", "question__title_slug": "diagonal-traverse-ii", "question__hide": false, - "total_acs": 11679, - "total_submitted": 27141, + "total_acs": 11794, + "total_submitted": 27350, "total_column_articles": 227, "frontend_question_id": "1424", "is_new_question": false @@ -41340,9 +41844,9 @@ "question__title": "Maximum Points You Can Obtain from Cards", "question__title_slug": "maximum-points-you-can-obtain-from-cards", "question__hide": false, - "total_acs": 68968, - "total_submitted": 120735, - "total_column_articles": 838, + "total_acs": 69532, + "total_submitted": 121702, + "total_column_articles": 841, "frontend_question_id": "1423", "is_new_question": false }, @@ -41361,9 +41865,9 @@ "question__title": "Maximum Score After Splitting a String", "question__title_slug": "maximum-score-after-splitting-a-string", "question__hide": false, - "total_acs": 47531, - "total_submitted": 83484, - "total_column_articles": 735, + "total_acs": 48263, + "total_submitted": 84804, + "total_column_articles": 740, "frontend_question_id": "1422", "is_new_question": false }, @@ -41382,9 +41886,9 @@ "question__title": "Customers Who Bought Products A and B but Not C", "question__title_slug": "customers-who-bought-products-a-and-b-but-not-c", "question__hide": false, - "total_acs": 16967, - "total_submitted": 24695, - "total_column_articles": 172, + "total_acs": 17621, + "total_submitted": 25879, + "total_column_articles": 175, "frontend_question_id": "1398", "is_new_question": false }, @@ -41403,8 +41907,8 @@ "question__title": "Build Array Where You Can Find The Maximum Exactly K Comparisons", "question__title_slug": "build-array-where-you-can-find-the-maximum-exactly-k-comparisons", "question__hide": false, - "total_acs": 4256, - "total_submitted": 6661, + "total_acs": 4290, + "total_submitted": 6752, "total_column_articles": 72, "frontend_question_id": "1420", "is_new_question": false @@ -41424,9 +41928,9 @@ "question__title": "Minimum Number of Frogs Croaking", "question__title_slug": "minimum-number-of-frogs-croaking", "question__hide": false, - "total_acs": 34506, - "total_submitted": 68634, - "total_column_articles": 447, + "total_acs": 34744, + "total_submitted": 69179, + "total_column_articles": 450, "frontend_question_id": "1419", "is_new_question": false }, @@ -41445,9 +41949,9 @@ "question__title": "Display Table of Food Orders in a Restaurant", "question__title_slug": "display-table-of-food-orders-in-a-restaurant", "question__hide": false, - "total_acs": 29609, - "total_submitted": 40409, - "total_column_articles": 461, + "total_acs": 29657, + "total_submitted": 40470, + "total_column_articles": 460, "frontend_question_id": "1418", "is_new_question": false }, @@ -41466,9 +41970,9 @@ "question__title": "Reformat The String", "question__title_slug": "reformat-the-string", "question__hide": false, - "total_acs": 48369, - "total_submitted": 87886, - "total_column_articles": 637, + "total_acs": 48485, + "total_submitted": 88102, + "total_column_articles": 635, "frontend_question_id": "1417", "is_new_question": false }, @@ -41487,8 +41991,8 @@ "question__title": "Number of Ways to Wear Different Hats to Each Other", "question__title_slug": "number-of-ways-to-wear-different-hats-to-each-other", "question__hide": false, - "total_acs": 4820, - "total_submitted": 9227, + "total_acs": 4867, + "total_submitted": 9328, "total_column_articles": 76, "frontend_question_id": "1434", "is_new_question": false @@ -41508,9 +42012,9 @@ "question__title": "Check If a String Can Break Another String", "question__title_slug": "check-if-a-string-can-break-another-string", "question__hide": false, - "total_acs": 9240, - "total_submitted": 14142, - "total_column_articles": 157, + "total_acs": 9301, + "total_submitted": 14230, + "total_column_articles": 158, "frontend_question_id": "1433", "is_new_question": false }, @@ -41529,9 +42033,9 @@ "question__title": "Max Difference You Can Get From Changing an Integer", "question__title_slug": "max-difference-you-can-get-from-changing-an-integer", "question__hide": false, - "total_acs": 7067, - "total_submitted": 17588, - "total_column_articles": 146, + "total_acs": 7132, + "total_submitted": 17780, + "total_column_articles": 147, "frontend_question_id": "1432", "is_new_question": false }, @@ -41550,9 +42054,9 @@ "question__title": "Kids With the Greatest Number of Candies", "question__title_slug": "kids-with-the-greatest-number-of-candies", "question__hide": false, - "total_acs": 116830, - "total_submitted": 137961, - "total_column_articles": 1321, + "total_acs": 118800, + "total_submitted": 140254, + "total_column_articles": 1328, "frontend_question_id": "1431", "is_new_question": false }, @@ -41571,9 +42075,9 @@ "question__title": "Number of Ways to Paint N × 3 Grid", "question__title_slug": "number-of-ways-to-paint-n-3-grid", "question__hide": false, - "total_acs": 10506, - "total_submitted": 18108, - "total_column_articles": 169, + "total_acs": 10567, + "total_submitted": 18226, + "total_column_articles": 170, "frontend_question_id": "1411", "is_new_question": false }, @@ -41592,9 +42096,9 @@ "question__title": "HTML Entity Parser", "question__title_slug": "html-entity-parser", "question__hide": false, - "total_acs": 29945, - "total_submitted": 56904, - "total_column_articles": 322, + "total_acs": 30077, + "total_submitted": 57175, + "total_column_articles": 324, "frontend_question_id": "1410", "is_new_question": false }, @@ -41613,9 +42117,9 @@ "question__title": "Queries on a Permutation With Key", "question__title_slug": "queries-on-a-permutation-with-key", "question__hide": false, - "total_acs": 12089, - "total_submitted": 14822, - "total_column_articles": 206, + "total_acs": 12161, + "total_submitted": 14909, + "total_column_articles": 207, "frontend_question_id": "1409", "is_new_question": false }, @@ -41634,9 +42138,9 @@ "question__title": "String Matching in an Array", "question__title_slug": "string-matching-in-an-array", "question__hide": false, - "total_acs": 48050, - "total_submitted": 74665, - "total_column_articles": 580, + "total_acs": 48336, + "total_submitted": 75089, + "total_column_articles": 579, "frontend_question_id": "1408", "is_new_question": false }, @@ -41655,9 +42159,9 @@ "question__title": "Capital Gain/Loss", "question__title_slug": "capital-gainloss", "question__hide": false, - "total_acs": 34958, - "total_submitted": 41837, - "total_column_articles": 297, + "total_acs": 35409, + "total_submitted": 42375, + "total_column_articles": 304, "frontend_question_id": "1393", "is_new_question": false }, @@ -41676,9 +42180,9 @@ "question__title": "Stone Game III", "question__title_slug": "stone-game-iii", "question__hide": false, - "total_acs": 8930, - "total_submitted": 15058, - "total_column_articles": 134, + "total_acs": 9015, + "total_submitted": 15233, + "total_column_articles": 135, "frontend_question_id": "1406", "is_new_question": false }, @@ -41697,9 +42201,9 @@ "question__title": "Number of Steps to Reduce a Number in Binary Representation to One", "question__title_slug": "number-of-steps-to-reduce-a-number-in-binary-representation-to-one", "question__hide": false, - "total_acs": 10619, - "total_submitted": 20700, - "total_column_articles": 209, + "total_acs": 10683, + "total_submitted": 20839, + "total_column_articles": 211, "frontend_question_id": "1404", "is_new_question": false }, @@ -41718,9 +42222,9 @@ "question__title": "Minimum Subsequence in Non-Increasing Order", "question__title_slug": "minimum-subsequence-in-non-increasing-order", "question__hide": false, - "total_acs": 58554, - "total_submitted": 79827, - "total_column_articles": 780, + "total_acs": 58817, + "total_submitted": 80200, + "total_column_articles": 779, "frontend_question_id": "1403", "is_new_question": false }, @@ -41739,9 +42243,9 @@ "question__title": "Total Sales Amount by Year", "question__title_slug": "total-sales-amount-by-year", "question__hide": false, - "total_acs": 5498, - "total_submitted": 9606, - "total_column_articles": 112, + "total_acs": 5541, + "total_submitted": 9684, + "total_column_articles": 113, "frontend_question_id": "1384", "is_new_question": false }, @@ -41760,8 +42264,8 @@ "question__title": "Restore The Array", "question__title_slug": "restore-the-array", "question__hide": false, - "total_acs": 5561, - "total_submitted": 13131, + "total_acs": 5654, + "total_submitted": 13324, "total_column_articles": 91, "frontend_question_id": "1416", "is_new_question": false @@ -41781,9 +42285,9 @@ "question__title": "The k-th Lexicographical String of All Happy Strings of Length n", "question__title_slug": "the-k-th-lexicographical-string-of-all-happy-strings-of-length-n", "question__hide": false, - "total_acs": 9725, - "total_submitted": 14126, - "total_column_articles": 247, + "total_acs": 9782, + "total_submitted": 14211, + "total_column_articles": 250, "frontend_question_id": "1415", "is_new_question": false }, @@ -41802,9 +42306,9 @@ "question__title": "Find the Minimum Number of Fibonacci Numbers Whose Sum Is K", "question__title_slug": "find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k", "question__hide": false, - "total_acs": 31320, - "total_submitted": 44473, - "total_column_articles": 459, + "total_acs": 31418, + "total_submitted": 44613, + "total_column_articles": 457, "frontend_question_id": "1414", "is_new_question": false }, @@ -41823,9 +42327,9 @@ "question__title": "Minimum Value to Get Positive Step by Step Sum", "question__title_slug": "minimum-value-to-get-positive-step-by-step-sum", "question__hide": false, - "total_acs": 49446, - "total_submitted": 67612, - "total_column_articles": 725, + "total_acs": 49742, + "total_submitted": 68013, + "total_column_articles": 728, "frontend_question_id": "1413", "is_new_question": false }, @@ -41844,8 +42348,8 @@ "question__title": "Find All Good Strings", "question__title_slug": "find-all-good-strings", "question__hide": false, - "total_acs": 2748, - "total_submitted": 6057, + "total_acs": 2776, + "total_submitted": 6149, "total_column_articles": 74, "frontend_question_id": "1397", "is_new_question": false @@ -41865,9 +42369,9 @@ "question__title": "Design Underground System", "question__title_slug": "design-underground-system", "question__hide": false, - "total_acs": 23066, - "total_submitted": 54374, - "total_column_articles": 283, + "total_acs": 23197, + "total_submitted": 54668, + "total_column_articles": 284, "frontend_question_id": "1396", "is_new_question": false }, @@ -41886,9 +42390,9 @@ "question__title": "Count Number of Teams", "question__title_slug": "count-number-of-teams", "question__hide": false, - "total_acs": 21022, - "total_submitted": 29633, - "total_column_articles": 303, + "total_acs": 21120, + "total_submitted": 29811, + "total_column_articles": 305, "frontend_question_id": "1395", "is_new_question": false }, @@ -41907,9 +42411,9 @@ "question__title": "Find Lucky Integer in an Array", "question__title_slug": "find-lucky-integer-in-an-array", "question__hide": false, - "total_acs": 29227, - "total_submitted": 44071, - "total_column_articles": 457, + "total_acs": 29612, + "total_submitted": 44546, + "total_column_articles": 459, "frontend_question_id": "1394", "is_new_question": false }, @@ -41928,9 +42432,9 @@ "question__title": "Replace Employee ID With The Unique Identifier", "question__title_slug": "replace-employee-id-with-the-unique-identifier", "question__hide": false, - "total_acs": 47991, - "total_submitted": 58135, - "total_column_articles": 167, + "total_acs": 52198, + "total_submitted": 63265, + "total_column_articles": 170, "frontend_question_id": "1378", "is_new_question": false }, @@ -41949,8 +42453,8 @@ "question__title": "Longest Happy Prefix", "question__title_slug": "longest-happy-prefix", "question__hide": false, - "total_acs": 15402, - "total_submitted": 34172, + "total_acs": 15513, + "total_submitted": 34396, "total_column_articles": 244, "frontend_question_id": "1392", "is_new_question": false @@ -41970,9 +42474,9 @@ "question__title": "Check if There is a Valid Path in a Grid", "question__title_slug": "check-if-there-is-a-valid-path-in-a-grid", "question__hide": false, - "total_acs": 9500, - "total_submitted": 22351, - "total_column_articles": 281, + "total_acs": 9580, + "total_submitted": 22520, + "total_column_articles": 280, "frontend_question_id": "1391", "is_new_question": false }, @@ -41991,8 +42495,8 @@ "question__title": "Create Target Array in the Given Order", "question__title_slug": "create-target-array-in-the-given-order", "question__hide": false, - "total_acs": 37329, - "total_submitted": 45076, + "total_acs": 37578, + "total_submitted": 45397, "total_column_articles": 603, "frontend_question_id": "1389", "is_new_question": false @@ -42012,9 +42516,9 @@ "question__title": "Get the Second Most Recent Activity", "question__title_slug": "get-the-second-most-recent-activity", "question__hide": false, - "total_acs": 7244, - "total_submitted": 11728, - "total_column_articles": 91, + "total_acs": 7293, + "total_submitted": 11814, + "total_column_articles": 92, "frontend_question_id": "1369", "is_new_question": false }, @@ -42033,9 +42537,9 @@ "question__title": "Reducing Dishes", "question__title_slug": "reducing-dishes", "question__hide": false, - "total_acs": 33017, - "total_submitted": 41509, - "total_column_articles": 443, + "total_acs": 33280, + "total_submitted": 41855, + "total_column_articles": 447, "frontend_question_id": "1402", "is_new_question": false }, @@ -42054,9 +42558,9 @@ "question__title": "Construct K Palindrome Strings", "question__title_slug": "construct-k-palindrome-strings", "question__hide": false, - "total_acs": 10451, - "total_submitted": 16978, - "total_column_articles": 164, + "total_acs": 10593, + "total_submitted": 17196, + "total_column_articles": 166, "frontend_question_id": "1400", "is_new_question": false }, @@ -42075,9 +42579,9 @@ "question__title": "Circle and Rectangle Overlapping", "question__title_slug": "circle-and-rectangle-overlapping", "question__hide": false, - "total_acs": 18809, - "total_submitted": 36357, - "total_column_articles": 255, + "total_acs": 18867, + "total_submitted": 36470, + "total_column_articles": 256, "frontend_question_id": "1401", "is_new_question": false }, @@ -42096,9 +42600,9 @@ "question__title": "Count Largest Group", "question__title_slug": "count-largest-group", "question__hide": false, - "total_acs": 15483, - "total_submitted": 23188, - "total_column_articles": 224, + "total_acs": 15652, + "total_submitted": 23494, + "total_column_articles": 225, "frontend_question_id": "1399", "is_new_question": false }, @@ -42117,8 +42621,8 @@ "question__title": "Maximum Performance of a Team", "question__title_slug": "maximum-performance-of-a-team", "question__hide": false, - "total_acs": 7440, - "total_submitted": 20659, + "total_acs": 7562, + "total_submitted": 21037, "total_column_articles": 136, "frontend_question_id": "1383", "is_new_question": false @@ -42138,9 +42642,9 @@ "question__title": "Find a Corresponding Node of a Binary Tree in a Clone of That Tree", "question__title_slug": "find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree", "question__hide": false, - "total_acs": 19687, - "total_submitted": 23756, - "total_column_articles": 272, + "total_acs": 19893, + "total_submitted": 24005, + "total_column_articles": 273, "frontend_question_id": "1379", "is_new_question": false }, @@ -42159,9 +42663,9 @@ "question__title": "Design a Stack With Increment Operation", "question__title_slug": "design-a-stack-with-increment-operation", "question__hide": false, - "total_acs": 19246, - "total_submitted": 26620, - "total_column_articles": 240, + "total_acs": 19350, + "total_submitted": 26782, + "total_column_articles": 237, "frontend_question_id": "1381", "is_new_question": false }, @@ -42180,9 +42684,9 @@ "question__title": "Lucky Numbers in a Matrix", "question__title_slug": "lucky-numbers-in-a-matrix", "question__hide": false, - "total_acs": 58630, - "total_submitted": 77134, - "total_column_articles": 775, + "total_acs": 58866, + "total_submitted": 77473, + "total_column_articles": 776, "frontend_question_id": "1380", "is_new_question": false }, @@ -42201,9 +42705,9 @@ "question__title": "Number of Trusted Contacts of a Customer", "question__title_slug": "number-of-trusted-contacts-of-a-customer", "question__hide": false, - "total_acs": 6743, - "total_submitted": 9882, - "total_column_articles": 96, + "total_acs": 6818, + "total_submitted": 9985, + "total_column_articles": 98, "frontend_question_id": "1364", "is_new_question": false }, @@ -42222,8 +42726,8 @@ "question__title": "Activity Participants", "question__title_slug": "activity-participants", "question__hide": false, - "total_acs": 7970, - "total_submitted": 12100, + "total_acs": 8072, + "total_submitted": 12265, "total_column_articles": 95, "frontend_question_id": "1355", "is_new_question": false @@ -42243,8 +42747,8 @@ "question__title": "Frog Position After T Seconds", "question__title_slug": "frog-position-after-t-seconds", "question__hide": false, - "total_acs": 19724, - "total_submitted": 46560, + "total_acs": 19853, + "total_submitted": 46842, "total_column_articles": 280, "frontend_question_id": "1377", "is_new_question": false @@ -42264,9 +42768,9 @@ "question__title": "Time Needed to Inform All Employees", "question__title_slug": "time-needed-to-inform-all-employees", "question__hide": false, - "total_acs": 34757, - "total_submitted": 58079, - "total_column_articles": 444, + "total_acs": 35032, + "total_submitted": 58570, + "total_column_articles": 446, "frontend_question_id": "1376", "is_new_question": false }, @@ -42285,8 +42789,8 @@ "question__title": "Number of Times Binary String Is Prefix-Aligned", "question__title_slug": "number-of-times-binary-string-is-prefix-aligned", "question__hide": false, - "total_acs": 28858, - "total_submitted": 42346, + "total_acs": 28922, + "total_submitted": 42455, "total_column_articles": 436, "frontend_question_id": "1375", "is_new_question": false @@ -42306,8 +42810,8 @@ "question__title": "Generate a String With Characters That Have Odd Counts", "question__title_slug": "generate-a-string-with-characters-that-have-odd-counts", "question__hide": false, - "total_acs": 55409, - "total_submitted": 71268, + "total_acs": 55576, + "total_submitted": 71479, "total_column_articles": 565, "frontend_question_id": "1374", "is_new_question": false @@ -42327,9 +42831,9 @@ "question__title": "Pizza With 3n Slices", "question__title_slug": "pizza-with-3n-slices", "question__hide": false, - "total_acs": 18907, - "total_submitted": 29333, - "total_column_articles": 119, + "total_acs": 19024, + "total_submitted": 29559, + "total_column_articles": 121, "frontend_question_id": "1388", "is_new_question": false }, @@ -42348,9 +42852,9 @@ "question__title": "Sort Integers by The Power Value", "question__title_slug": "sort-integers-by-the-power-value", "question__hide": false, - "total_acs": 16587, - "total_submitted": 23862, - "total_column_articles": 285, + "total_acs": 16691, + "total_submitted": 24026, + "total_column_articles": 289, "frontend_question_id": "1387", "is_new_question": false }, @@ -42369,8 +42873,8 @@ "question__title": "Cinema Seat Allocation", "question__title_slug": "cinema-seat-allocation", "question__hide": false, - "total_acs": 10961, - "total_submitted": 30338, + "total_acs": 10997, + "total_submitted": 30455, "total_column_articles": 185, "frontend_question_id": "1386", "is_new_question": false @@ -42390,9 +42894,9 @@ "question__title": "Find the Distance Value Between Two Arrays", "question__title_slug": "find-the-distance-value-between-two-arrays", "question__hide": false, - "total_acs": 42531, - "total_submitted": 65800, - "total_column_articles": 534, + "total_acs": 42803, + "total_submitted": 66166, + "total_column_articles": 535, "frontend_question_id": "1385", "is_new_question": false }, @@ -42411,9 +42915,9 @@ "question__title": "Minimum Cost to Make at Least One Valid Path in a Grid", "question__title_slug": "minimum-cost-to-make-at-least-one-valid-path-in-a-grid", "question__hide": false, - "total_acs": 8614, - "total_submitted": 14191, - "total_column_articles": 162, + "total_acs": 8787, + "total_submitted": 14416, + "total_column_articles": 163, "frontend_question_id": "1368", "is_new_question": false }, @@ -42432,9 +42936,9 @@ "question__title": "Linked List in Binary Tree", "question__title_slug": "linked-list-in-binary-tree", "question__hide": false, - "total_acs": 26807, - "total_submitted": 60535, - "total_column_articles": 366, + "total_acs": 27047, + "total_submitted": 61028, + "total_column_articles": 368, "frontend_question_id": "1367", "is_new_question": false }, @@ -42453,9 +42957,9 @@ "question__title": "Rank Teams by Votes", "question__title_slug": "rank-teams-by-votes", "question__hide": false, - "total_acs": 13737, - "total_submitted": 26527, - "total_column_articles": 219, + "total_acs": 13802, + "total_submitted": 26633, + "total_column_articles": 223, "frontend_question_id": "1366", "is_new_question": false }, @@ -42474,9 +42978,9 @@ "question__title": "How Many Numbers Are Smaller Than the Current Number", "question__title_slug": "how-many-numbers-are-smaller-than-the-current-number", "question__hide": false, - "total_acs": 123537, - "total_submitted": 150149, - "total_column_articles": 1362, + "total_acs": 124289, + "total_submitted": 151124, + "total_column_articles": 1366, "frontend_question_id": "1365", "is_new_question": false }, @@ -42495,8 +42999,8 @@ "question__title": "Students With Invalid Departments", "question__title_slug": "students-with-invalid-departments", "question__hide": false, - "total_acs": 14764, - "total_submitted": 17449, + "total_acs": 15058, + "total_submitted": 17791, "total_column_articles": 114, "frontend_question_id": "1350", "is_new_question": false @@ -42516,9 +43020,9 @@ "question__title": "Movie Rating", "question__title_slug": "movie-rating", "question__hide": false, - "total_acs": 19271, - "total_submitted": 52812, - "total_column_articles": 229, + "total_acs": 20485, + "total_submitted": 56178, + "total_column_articles": 239, "frontend_question_id": "1341", "is_new_question": false }, @@ -42537,9 +43041,9 @@ "question__title": "Construct Target Array With Multiple Sums", "question__title_slug": "construct-target-array-with-multiple-sums", "question__hide": false, - "total_acs": 4619, - "total_submitted": 15856, - "total_column_articles": 97, + "total_acs": 4649, + "total_submitted": 15966, + "total_column_articles": 98, "frontend_question_id": "1354", "is_new_question": false }, @@ -42558,9 +43062,9 @@ "question__title": "Maximum Number of Events That Can Be Attended", "question__title_slug": "maximum-number-of-events-that-can-be-attended", "question__hide": false, - "total_acs": 20005, - "total_submitted": 67390, - "total_column_articles": 226, + "total_acs": 20146, + "total_submitted": 67851, + "total_column_articles": 227, "frontend_question_id": "1353", "is_new_question": false }, @@ -42579,9 +43083,9 @@ "question__title": "Product of the Last K Numbers", "question__title_slug": "product-of-the-last-k-numbers", "question__hide": false, - "total_acs": 13981, - "total_submitted": 28563, - "total_column_articles": 136, + "total_acs": 14111, + "total_submitted": 28780, + "total_column_articles": 137, "frontend_question_id": "1352", "is_new_question": false }, @@ -42600,9 +43104,9 @@ "question__title": "Count Negative Numbers in a Sorted Matrix", "question__title_slug": "count-negative-numbers-in-a-sorted-matrix", "question__hide": false, - "total_acs": 58052, - "total_submitted": 77970, - "total_column_articles": 849, + "total_acs": 58723, + "total_submitted": 78865, + "total_column_articles": 851, "frontend_question_id": "1351", "is_new_question": false }, @@ -42621,8 +43125,8 @@ "question__title": "Maximum Sum BST in Binary Tree", "question__title_slug": "maximum-sum-bst-in-binary-tree", "question__hide": false, - "total_acs": 30861, - "total_submitted": 64146, + "total_acs": 31081, + "total_submitted": 64572, "total_column_articles": 418, "frontend_question_id": "1373", "is_new_question": false @@ -42642,9 +43146,9 @@ "question__title": "Longest ZigZag Path in a Binary Tree", "question__title_slug": "longest-zigzag-path-in-a-binary-tree", "question__hide": false, - "total_acs": 24691, - "total_submitted": 43870, - "total_column_articles": 339, + "total_acs": 25433, + "total_submitted": 45058, + "total_column_articles": 348, "frontend_question_id": "1372", "is_new_question": false }, @@ -42663,8 +43167,8 @@ "question__title": "Find the Longest Substring Containing Vowels in Even Counts", "question__title_slug": "find-the-longest-substring-containing-vowels-in-even-counts", "question__hide": false, - "total_acs": 27929, - "total_submitted": 46935, + "total_acs": 28138, + "total_submitted": 47268, "total_column_articles": 333, "frontend_question_id": "1371", "is_new_question": false @@ -42684,9 +43188,9 @@ "question__title": "Increasing Decreasing String", "question__title_slug": "increasing-decreasing-string", "question__hide": false, - "total_acs": 56309, - "total_submitted": 71292, - "total_column_articles": 679, + "total_acs": 56450, + "total_submitted": 71488, + "total_column_articles": 678, "frontend_question_id": "1370", "is_new_question": false }, @@ -42705,9 +43209,9 @@ "question__title": "Maximum Students Taking Exam", "question__title_slug": "maximum-students-taking-exam", "question__hide": false, - "total_acs": 15982, - "total_submitted": 25021, - "total_column_articles": 206, + "total_acs": 16042, + "total_submitted": 25120, + "total_column_articles": 207, "frontend_question_id": "1349", "is_new_question": false }, @@ -42726,8 +43230,8 @@ "question__title": "Tweet Counts Per Frequency", "question__title_slug": "tweet-counts-per-frequency", "question__hide": false, - "total_acs": 5770, - "total_submitted": 16230, + "total_acs": 5790, + "total_submitted": 16268, "total_column_articles": 81, "frontend_question_id": "1348", "is_new_question": false @@ -42747,8 +43251,8 @@ "question__title": "Minimum Number of Steps to Make Two Strings Anagram", "question__title_slug": "minimum-number-of-steps-to-make-two-strings-anagram", "question__hide": false, - "total_acs": 13087, - "total_submitted": 17089, + "total_acs": 13186, + "total_submitted": 17206, "total_column_articles": 184, "frontend_question_id": "1347", "is_new_question": false @@ -42768,9 +43272,9 @@ "question__title": "Check If N and Its Double Exist", "question__title_slug": "check-if-n-and-its-double-exist", "question__hide": false, - "total_acs": 38751, - "total_submitted": 92608, - "total_column_articles": 570, + "total_acs": 39049, + "total_submitted": 93363, + "total_column_articles": 572, "frontend_question_id": "1346", "is_new_question": false }, @@ -42789,8 +43293,8 @@ "question__title": "Number of Transactions per Visit", "question__title_slug": "number-of-transactions-per-visit", "question__hide": false, - "total_acs": 4232, - "total_submitted": 9419, + "total_acs": 4274, + "total_submitted": 9521, "total_column_articles": 93, "frontend_question_id": "1336", "is_new_question": false @@ -42810,9 +43314,9 @@ "question__title": "Jump Game V", "question__title_slug": "jump-game-v", "question__hide": false, - "total_acs": 7910, - "total_submitted": 13169, - "total_column_articles": 140, + "total_acs": 8004, + "total_submitted": 13321, + "total_column_articles": 142, "frontend_question_id": "1340", "is_new_question": false }, @@ -42831,8 +43335,8 @@ "question__title": "Maximum Product of Splitted Binary Tree", "question__title_slug": "maximum-product-of-splitted-binary-tree", "question__hide": false, - "total_acs": 14613, - "total_submitted": 34725, + "total_acs": 14738, + "total_submitted": 34995, "total_column_articles": 198, "frontend_question_id": "1339", "is_new_question": false @@ -42852,8 +43356,8 @@ "question__title": "Reduce Array Size to The Half", "question__title_slug": "reduce-array-size-to-the-half", "question__hide": false, - "total_acs": 14455, - "total_submitted": 22178, + "total_acs": 14605, + "total_submitted": 22411, "total_column_articles": 192, "frontend_question_id": "1338", "is_new_question": false @@ -42873,9 +43377,9 @@ "question__title": "The K Weakest Rows in a Matrix", "question__title_slug": "the-k-weakest-rows-in-a-matrix", "question__hide": false, - "total_acs": 60430, - "total_submitted": 88163, - "total_column_articles": 940, + "total_acs": 60741, + "total_submitted": 88686, + "total_column_articles": 939, "frontend_question_id": "1337", "is_new_question": false }, @@ -42894,9 +43398,9 @@ "question__title": "List the Products Ordered in a Period", "question__title_slug": "list-the-products-ordered-in-a-period", "question__hide": false, - "total_acs": 22148, - "total_submitted": 32356, - "total_column_articles": 153, + "total_acs": 23357, + "total_submitted": 34008, + "total_column_articles": 161, "frontend_question_id": "1327", "is_new_question": false }, @@ -42915,9 +43419,9 @@ "question__title": "Count All Valid Pickup and Delivery Options", "question__title_slug": "count-all-valid-pickup-and-delivery-options", "question__hide": false, - "total_acs": 6252, - "total_submitted": 10600, - "total_column_articles": 131, + "total_acs": 6309, + "total_submitted": 10704, + "total_column_articles": 133, "frontend_question_id": "1359", "is_new_question": false }, @@ -42936,9 +43440,9 @@ "question__title": "Number of Substrings Containing All Three Characters", "question__title_slug": "number-of-substrings-containing-all-three-characters", "question__hide": false, - "total_acs": 12476, - "total_submitted": 22946, - "total_column_articles": 204, + "total_acs": 12619, + "total_submitted": 23154, + "total_column_articles": 205, "frontend_question_id": "1358", "is_new_question": false }, @@ -42957,9 +43461,9 @@ "question__title": "Apply Discount Every n Orders", "question__title_slug": "apply-discount-every-n-orders", "question__hide": false, - "total_acs": 7507, - "total_submitted": 13619, - "total_column_articles": 75, + "total_acs": 7574, + "total_submitted": 13725, + "total_column_articles": 78, "frontend_question_id": "1357", "is_new_question": false }, @@ -42978,9 +43482,9 @@ "question__title": "Sort Integers by The Number of 1 Bits", "question__title_slug": "sort-integers-by-the-number-of-1-bits", "question__hide": false, - "total_acs": 66075, - "total_submitted": 89639, - "total_column_articles": 707, + "total_acs": 66524, + "total_submitted": 90222, + "total_column_articles": 708, "frontend_question_id": "1356", "is_new_question": false }, @@ -42999,9 +43503,9 @@ "question__title": "Minimum Difficulty of a Job Schedule", "question__title_slug": "minimum-difficulty-of-a-job-schedule", "question__hide": false, - "total_acs": 18988, - "total_submitted": 28441, - "total_column_articles": 182, + "total_acs": 19239, + "total_submitted": 28797, + "total_column_articles": 185, "frontend_question_id": "1335", "is_new_question": false }, @@ -43020,8 +43524,8 @@ "question__title": "Find the City With the Smallest Number of Neighbors at a Threshold Distance", "question__title_slug": "find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance", "question__hide": false, - "total_acs": 28888, - "total_submitted": 47078, + "total_acs": 29205, + "total_submitted": 47568, "total_column_articles": 266, "frontend_question_id": "1334", "is_new_question": false @@ -43041,8 +43545,8 @@ "question__title": "Filter Restaurants by Vegan-Friendly, Price and Distance", "question__title_slug": "filter-restaurants-by-vegan-friendly-price-and-distance", "question__hide": false, - "total_acs": 28482, - "total_submitted": 40978, + "total_acs": 28558, + "total_submitted": 41065, "total_column_articles": 343, "frontend_question_id": "1333", "is_new_question": false @@ -43062,8 +43566,8 @@ "question__title": "Remove Palindromic Subsequences", "question__title_slug": "remove-palindromic-subsequences", "question__hide": false, - "total_acs": 37417, - "total_submitted": 48056, + "total_acs": 37572, + "total_submitted": 48253, "total_column_articles": 387, "frontend_question_id": "1332", "is_new_question": false @@ -43083,9 +43587,9 @@ "question__title": "Ads Performance", "question__title_slug": "ads-performance", "question__hide": false, - "total_acs": 10211, - "total_submitted": 17135, - "total_column_articles": 104, + "total_acs": 10321, + "total_submitted": 17324, + "total_column_articles": 106, "frontend_question_id": "1322", "is_new_question": false }, @@ -43104,9 +43608,9 @@ "question__title": "Restaurant Growth", "question__title_slug": "restaurant-growth", "question__hide": false, - "total_acs": 21286, - "total_submitted": 40450, - "total_column_articles": 265, + "total_acs": 22486, + "total_submitted": 42240, + "total_column_articles": 274, "frontend_question_id": "1321", "is_new_question": false }, @@ -43125,8 +43629,8 @@ "question__title": "Minimum Number of Taps to Open to Water a Garden", "question__title_slug": "minimum-number-of-taps-to-open-to-water-a-garden", "question__hide": false, - "total_acs": 27354, - "total_submitted": 50597, + "total_acs": 27412, + "total_submitted": 50708, "total_column_articles": 265, "frontend_question_id": "1326", "is_new_question": false @@ -43146,9 +43650,9 @@ "question__title": "Delete Leaves With a Given Value", "question__title_slug": "delete-leaves-with-a-given-value", "question__hide": false, - "total_acs": 19318, - "total_submitted": 26345, - "total_column_articles": 279, + "total_acs": 19508, + "total_submitted": 26628, + "total_column_articles": 281, "frontend_question_id": "1325", "is_new_question": false }, @@ -43167,9 +43671,9 @@ "question__title": "Print Words Vertically", "question__title_slug": "print-words-vertically", "question__hide": false, - "total_acs": 10064, - "total_submitted": 16743, - "total_column_articles": 186, + "total_acs": 10138, + "total_submitted": 16849, + "total_column_articles": 188, "frontend_question_id": "1324", "is_new_question": false }, @@ -43188,9 +43692,9 @@ "question__title": "Maximum 69 Number", "question__title_slug": "maximum-69-number", "question__hide": false, - "total_acs": 40797, - "total_submitted": 54445, - "total_column_articles": 682, + "total_acs": 41262, + "total_submitted": 55029, + "total_column_articles": 683, "frontend_question_id": "1323", "is_new_question": false }, @@ -43209,8 +43713,8 @@ "question__title": "Jump Game IV", "question__title_slug": "jump-game-iv", "question__hide": false, - "total_acs": 30677, - "total_submitted": 67473, + "total_acs": 30826, + "total_submitted": 67796, "total_column_articles": 327, "frontend_question_id": "1345", "is_new_question": false @@ -43230,9 +43734,9 @@ "question__title": "Angle Between Hands of a Clock", "question__title_slug": "angle-between-hands-of-a-clock", "question__hide": false, - "total_acs": 12534, - "total_submitted": 20742, - "total_column_articles": 187, + "total_acs": 12643, + "total_submitted": 20948, + "total_column_articles": 188, "frontend_question_id": "1344", "is_new_question": false }, @@ -43251,9 +43755,9 @@ "question__title": "Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold", "question__title_slug": "number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold", "question__hide": false, - "total_acs": 21687, - "total_submitted": 37005, - "total_column_articles": 320, + "total_acs": 22086, + "total_submitted": 37569, + "total_column_articles": 323, "frontend_question_id": "1343", "is_new_question": false }, @@ -43272,9 +43776,9 @@ "question__title": "Number of Steps to Reduce a Number to Zero", "question__title_slug": "number-of-steps-to-reduce-a-number-to-zero", "question__hide": false, - "total_acs": 151141, - "total_submitted": 200109, - "total_column_articles": 1699, + "total_acs": 152602, + "total_submitted": 202094, + "total_column_articles": 1712, "frontend_question_id": "1342", "is_new_question": false }, @@ -43293,8 +43797,8 @@ "question__title": "Minimum Distance to Type a Word Using Two Fingers", "question__title_slug": "minimum-distance-to-type-a-word-using-two-fingers", "question__hide": false, - "total_acs": 4200, - "total_submitted": 6834, + "total_acs": 4233, + "total_submitted": 6897, "total_column_articles": 82, "frontend_question_id": "1320", "is_new_question": false @@ -43314,8 +43818,8 @@ "question__title": "Number of Operations to Make Network Connected", "question__title_slug": "number-of-operations-to-make-network-connected", "question__hide": false, - "total_acs": 46923, - "total_submitted": 75161, + "total_acs": 47382, + "total_submitted": 75850, "total_column_articles": 703, "frontend_question_id": "1319", "is_new_question": false @@ -43335,9 +43839,9 @@ "question__title": "Minimum Flips to Make a OR b Equal to c", "question__title_slug": "minimum-flips-to-make-a-or-b-equal-to-c", "question__hide": false, - "total_acs": 14091, - "total_submitted": 20713, - "total_column_articles": 219, + "total_acs": 14592, + "total_submitted": 21416, + "total_column_articles": 225, "frontend_question_id": "1318", "is_new_question": false }, @@ -43356,9 +43860,9 @@ "question__title": "Convert Integer to the Sum of Two No-Zero Integers", "question__title_slug": "convert-integer-to-the-sum-of-two-no-zero-integers", "question__hide": false, - "total_acs": 16275, - "total_submitted": 26225, - "total_column_articles": 270, + "total_acs": 16436, + "total_submitted": 26441, + "total_column_articles": 272, "frontend_question_id": "1317", "is_new_question": false }, @@ -43377,8 +43881,8 @@ "question__title": "Running Total for Different Genders", "question__title_slug": "running-total-for-different-genders", "question__hide": false, - "total_acs": 13900, - "total_submitted": 18884, + "total_acs": 13992, + "total_submitted": 18996, "total_column_articles": 105, "frontend_question_id": "1308", "is_new_question": false @@ -43398,8 +43902,8 @@ "question__title": "Find the Team Size", "question__title_slug": "find-the-team-size", "question__hide": false, - "total_acs": 23959, - "total_submitted": 29020, + "total_acs": 24233, + "total_submitted": 29340, "total_column_articles": 180, "frontend_question_id": "1303", "is_new_question": false @@ -43419,9 +43923,9 @@ "question__title": "Minimum Insertion Steps to Make a String Palindrome", "question__title_slug": "minimum-insertion-steps-to-make-a-string-palindrome", "question__hide": false, - "total_acs": 30545, - "total_submitted": 43764, - "total_column_articles": 293, + "total_acs": 31490, + "total_submitted": 45155, + "total_column_articles": 302, "frontend_question_id": "1312", "is_new_question": false }, @@ -43440,9 +43944,9 @@ "question__title": "Get Watched Videos by Your Friends", "question__title_slug": "get-watched-videos-by-your-friends", "question__hide": false, - "total_acs": 8697, - "total_submitted": 21357, - "total_column_articles": 123, + "total_acs": 8922, + "total_submitted": 21810, + "total_column_articles": 124, "frontend_question_id": "1311", "is_new_question": false }, @@ -43461,9 +43965,9 @@ "question__title": "XOR Queries of a Subarray", "question__title_slug": "xor-queries-of-a-subarray", "question__hide": false, - "total_acs": 43823, - "total_submitted": 60713, - "total_column_articles": 569, + "total_acs": 44060, + "total_submitted": 61013, + "total_column_articles": 567, "frontend_question_id": "1310", "is_new_question": false }, @@ -43482,8 +43986,8 @@ "question__title": "Decrypt String from Alphabet to Integer Mapping", "question__title_slug": "decrypt-string-from-alphabet-to-integer-mapping", "question__hide": false, - "total_acs": 29485, - "total_submitted": 38458, + "total_acs": 29662, + "total_submitted": 38682, "total_column_articles": 500, "frontend_question_id": "1309", "is_new_question": false @@ -43503,8 +44007,8 @@ "question__title": "Encrypt and Decrypt Strings", "question__title_slug": "encrypt-and-decrypt-strings", "question__hide": false, - "total_acs": 5957, - "total_submitted": 14913, + "total_acs": 5977, + "total_submitted": 14981, "total_column_articles": 91, "frontend_question_id": "2227", "is_new_question": false @@ -43524,9 +44028,9 @@ "question__title": "Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree", "question__title_slug": "check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree", "question__hide": false, - "total_acs": 1586, - "total_submitted": 2913, - "total_column_articles": 55, + "total_acs": 1610, + "total_submitted": 2958, + "total_column_articles": 56, "frontend_question_id": "1430", "is_new_question": false }, @@ -43545,9 +44049,9 @@ "question__title": "All Ancestors of a Node in a Directed Acyclic Graph", "question__title_slug": "all-ancestors-of-a-node-in-a-directed-acyclic-graph", "question__hide": false, - "total_acs": 7101, - "total_submitted": 15465, - "total_column_articles": 118, + "total_acs": 7341, + "total_submitted": 15895, + "total_column_articles": 122, "frontend_question_id": "2192", "is_new_question": false }, @@ -43566,9 +44070,9 @@ "question__title": "Find the K-Beauty of a Number", "question__title_slug": "find-the-k-beauty-of-a-number", "question__hide": false, - "total_acs": 11959, - "total_submitted": 18913, - "total_column_articles": 146, + "total_acs": 12313, + "total_submitted": 19437, + "total_column_articles": 150, "frontend_question_id": "2269", "is_new_question": false }, @@ -43587,8 +44091,8 @@ "question__title": "Verbal Arithmetic Puzzle", "question__title_slug": "verbal-arithmetic-puzzle", "question__hide": false, - "total_acs": 3376, - "total_submitted": 9619, + "total_acs": 3394, + "total_submitted": 9690, "total_column_articles": 75, "frontend_question_id": "1307", "is_new_question": false @@ -43608,9 +44112,9 @@ "question__title": "Jump Game III", "question__title_slug": "jump-game-iii", "question__hide": false, - "total_acs": 34704, - "total_submitted": 59237, - "total_column_articles": 477, + "total_acs": 35182, + "total_submitted": 59994, + "total_column_articles": 483, "frontend_question_id": "1306", "is_new_question": false }, @@ -43629,9 +44133,9 @@ "question__title": "All Elements in Two Binary Search Trees", "question__title_slug": "all-elements-in-two-binary-search-trees", "question__hide": false, - "total_acs": 52476, - "total_submitted": 67181, - "total_column_articles": 711, + "total_acs": 52617, + "total_submitted": 67364, + "total_column_articles": 709, "frontend_question_id": "1305", "is_new_question": false }, @@ -43650,9 +44154,9 @@ "question__title": "Find N Unique Integers Sum up to Zero", "question__title_slug": "find-n-unique-integers-sum-up-to-zero", "question__hide": false, - "total_acs": 31353, - "total_submitted": 44652, - "total_column_articles": 513, + "total_acs": 31622, + "total_submitted": 45003, + "total_column_articles": 514, "frontend_question_id": "1304", "is_new_question": false }, @@ -43671,9 +44175,9 @@ "question__title": "Weather Type in Each Country", "question__title_slug": "weather-type-in-each-country", "question__hide": false, - "total_acs": 15831, - "total_submitted": 24082, - "total_column_articles": 140, + "total_acs": 15912, + "total_submitted": 24214, + "total_column_articles": 141, "frontend_question_id": "1294", "is_new_question": false }, @@ -43692,9 +44196,9 @@ "question__title": "Maximum Candies You Can Get from Boxes", "question__title_slug": "maximum-candies-you-can-get-from-boxes", "question__hide": false, - "total_acs": 4387, - "total_submitted": 7389, - "total_column_articles": 129, + "total_acs": 4497, + "total_submitted": 7562, + "total_column_articles": 130, "frontend_question_id": "1298", "is_new_question": false }, @@ -43713,9 +44217,9 @@ "question__title": "Maximum Number of Occurrences of a Substring", "question__title_slug": "maximum-number-of-occurrences-of-a-substring", "question__hide": false, - "total_acs": 11386, - "total_submitted": 23274, - "total_column_articles": 138, + "total_acs": 11478, + "total_submitted": 23448, + "total_column_articles": 137, "frontend_question_id": "1297", "is_new_question": false }, @@ -43734,9 +44238,9 @@ "question__title": "Divide Array in Sets of K Consecutive Numbers", "question__title_slug": "divide-array-in-sets-of-k-consecutive-numbers", "question__hide": false, - "total_acs": 13589, - "total_submitted": 27459, - "total_column_articles": 176, + "total_acs": 13696, + "total_submitted": 27627, + "total_column_articles": 179, "frontend_question_id": "1296", "is_new_question": false }, @@ -43755,9 +44259,9 @@ "question__title": "Find Numbers with Even Number of Digits", "question__title_slug": "find-numbers-with-even-number-of-digits", "question__hide": false, - "total_acs": 62705, - "total_submitted": 78867, - "total_column_articles": 799, + "total_acs": 63107, + "total_submitted": 79386, + "total_column_articles": 803, "frontend_question_id": "1295", "is_new_question": false }, @@ -43776,9 +44280,9 @@ "question__title": "Find the Start and End Number of Continuous Ranges", "question__title_slug": "find-the-start-and-end-number-of-continuous-ranges", "question__hide": false, - "total_acs": 13124, - "total_submitted": 16597, - "total_column_articles": 124, + "total_acs": 13441, + "total_submitted": 17090, + "total_column_articles": 125, "frontend_question_id": "1285", "is_new_question": false }, @@ -43797,8 +44301,8 @@ "question__title": "Make Array Non-decreasing or Non-increasing", "question__title_slug": "make-array-non-decreasing-or-non-increasing", "question__hide": false, - "total_acs": 348, - "total_submitted": 485, + "total_acs": 364, + "total_submitted": 523, "total_column_articles": 15, "frontend_question_id": "2263", "is_new_question": false @@ -43818,9 +44322,9 @@ "question__title": "Fair Distribution of Cookies", "question__title_slug": "fair-distribution-of-cookies", "question__hide": false, - "total_acs": 14563, - "total_submitted": 19932, - "total_column_articles": 153, + "total_acs": 14712, + "total_submitted": 20148, + "total_column_articles": 156, "frontend_question_id": "2305", "is_new_question": false }, @@ -43839,9 +44343,9 @@ "question__title": "Check if an Array Is Consecutive", "question__title_slug": "check-if-an-array-is-consecutive", "question__hide": false, - "total_acs": 840, - "total_submitted": 1184, - "total_column_articles": 31, + "total_acs": 880, + "total_submitted": 1239, + "total_column_articles": 32, "frontend_question_id": "2229", "is_new_question": false }, @@ -43860,9 +44364,9 @@ "question__title": "Students and Examinations", "question__title_slug": "students-and-examinations", "question__hide": false, - "total_acs": 41703, - "total_submitted": 82873, - "total_column_articles": 303, + "total_acs": 44451, + "total_submitted": 87958, + "total_column_articles": 316, "frontend_question_id": "1280", "is_new_question": false }, @@ -43881,9 +44385,9 @@ "question__title": "Shortest Path in a Grid with Obstacles Elimination", "question__title_slug": "shortest-path-in-a-grid-with-obstacles-elimination", "question__hide": false, - "total_acs": 24004, - "total_submitted": 61871, - "total_column_articles": 207, + "total_acs": 24264, + "total_submitted": 62510, + "total_column_articles": 209, "frontend_question_id": "1293", "is_new_question": false }, @@ -43902,8 +44406,8 @@ "question__title": "Maximum Side Length of a Square with Sum Less than or Equal to Threshold", "question__title_slug": "maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold", "question__hide": false, - "total_acs": 12260, - "total_submitted": 23958, + "total_acs": 12354, + "total_submitted": 24116, "total_column_articles": 166, "frontend_question_id": "1292", "is_new_question": false @@ -43923,9 +44427,9 @@ "question__title": "Convert Binary Number in a Linked List to Integer", "question__title_slug": "convert-binary-number-in-a-linked-list-to-integer", "question__hide": false, - "total_acs": 86648, - "total_submitted": 108393, - "total_column_articles": 1047, + "total_acs": 87558, + "total_submitted": 109530, + "total_column_articles": 1051, "frontend_question_id": "1290", "is_new_question": false }, @@ -43944,8 +44448,8 @@ "question__title": "Traffic Light Controlled Intersection", "question__title_slug": "traffic-light-controlled-intersection", "question__hide": false, - "total_acs": 2650, - "total_submitted": 4691, + "total_acs": 2684, + "total_submitted": 4733, "total_column_articles": 27, "frontend_question_id": "1279", "is_new_question": false @@ -43965,8 +44469,8 @@ "question__title": "Minimum Number of Flips to Convert Binary Matrix to Zero Matrix", "question__title_slug": "minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix", "question__hide": false, - "total_acs": 4470, - "total_submitted": 6485, + "total_acs": 4505, + "total_submitted": 6530, "total_column_articles": 108, "frontend_question_id": "1284", "is_new_question": false @@ -43986,9 +44490,9 @@ "question__title": "Find the Smallest Divisor Given a Threshold", "question__title_slug": "find-the-smallest-divisor-given-a-threshold", "question__hide": false, - "total_acs": 16998, - "total_submitted": 33535, - "total_column_articles": 207, + "total_acs": 17361, + "total_submitted": 34074, + "total_column_articles": 216, "frontend_question_id": "1283", "is_new_question": false }, @@ -44007,9 +44511,9 @@ "question__title": "Group the People Given the Group Size They Belong To", "question__title_slug": "group-the-people-given-the-group-size-they-belong-to", "question__hide": false, - "total_acs": 51527, - "total_submitted": 59834, - "total_column_articles": 824, + "total_acs": 51714, + "total_submitted": 60059, + "total_column_articles": 825, "frontend_question_id": "1282", "is_new_question": false }, @@ -44028,9 +44532,9 @@ "question__title": "Subtract the Product and Sum of Digits of an Integer", "question__title_slug": "subtract-the-product-and-sum-of-digits-of-an-integer", "question__hide": false, - "total_acs": 107162, - "total_submitted": 128848, - "total_column_articles": 1109, + "total_acs": 108298, + "total_submitted": 130311, + "total_column_articles": 1113, "frontend_question_id": "1281", "is_new_question": false }, @@ -44049,9 +44553,9 @@ "question__title": "All People Report to the Given Manager", "question__title_slug": "all-people-report-to-the-given-manager", "question__hide": false, - "total_acs": 14201, - "total_submitted": 18003, - "total_column_articles": 146, + "total_acs": 14497, + "total_submitted": 18442, + "total_column_articles": 148, "frontend_question_id": "1270", "is_new_question": false }, @@ -44070,8 +44574,8 @@ "question__title": "Print Immutable Linked List in Reverse", "question__title_slug": "print-immutable-linked-list-in-reverse", "question__hide": false, - "total_acs": 6040, - "total_submitted": 6650, + "total_acs": 6140, + "total_submitted": 6754, "total_column_articles": 117, "frontend_question_id": "1265", "is_new_question": false @@ -44091,9 +44595,9 @@ "question__title": "Palindrome Partitioning III", "question__title_slug": "palindrome-partitioning-iii", "question__hide": false, - "total_acs": 6927, - "total_submitted": 11037, - "total_column_articles": 103, + "total_acs": 7187, + "total_submitted": 11383, + "total_column_articles": 105, "frontend_question_id": "1278", "is_new_question": false }, @@ -44112,9 +44616,9 @@ "question__title": "Count Square Submatrices with All Ones", "question__title_slug": "count-square-submatrices-with-all-ones", "question__hide": false, - "total_acs": 34137, - "total_submitted": 46239, - "total_column_articles": 368, + "total_acs": 34606, + "total_submitted": 46893, + "total_column_articles": 371, "frontend_question_id": "1277", "is_new_question": false }, @@ -44133,9 +44637,9 @@ "question__title": "Number of Burgers with No Waste of Ingredients", "question__title_slug": "number-of-burgers-with-no-waste-of-ingredients", "question__hide": false, - "total_acs": 27721, - "total_submitted": 47628, - "total_column_articles": 323, + "total_acs": 27867, + "total_submitted": 47908, + "total_column_articles": 324, "frontend_question_id": "1276", "is_new_question": false }, @@ -44154,9 +44658,9 @@ "question__title": "Find Winner on a Tic Tac Toe Game", "question__title_slug": "find-winner-on-a-tic-tac-toe-game", "question__hide": false, - "total_acs": 16942, - "total_submitted": 30761, - "total_column_articles": 309, + "total_acs": 17851, + "total_submitted": 32504, + "total_column_articles": 326, "frontend_question_id": "1275", "is_new_question": false }, @@ -44175,9 +44679,9 @@ "question__title": "Page Recommendations", "question__title_slug": "page-recommendations", "question__hide": false, - "total_acs": 15005, - "total_submitted": 26683, - "total_column_articles": 178, + "total_acs": 15369, + "total_submitted": 27374, + "total_column_articles": 179, "frontend_question_id": "1264", "is_new_question": false }, @@ -44196,9 +44700,9 @@ "question__title": "Number of Ways to Stay in the Same Place After Some Steps", "question__title_slug": "number-of-ways-to-stay-in-the-same-place-after-some-steps", "question__hide": false, - "total_acs": 33632, - "total_submitted": 68543, - "total_column_articles": 352, + "total_acs": 33682, + "total_submitted": 68639, + "total_column_articles": 353, "frontend_question_id": "1269", "is_new_question": false }, @@ -44217,9 +44721,9 @@ "question__title": "Search Suggestions System", "question__title_slug": "search-suggestions-system", "question__hide": false, - "total_acs": 20532, - "total_submitted": 34004, - "total_column_articles": 298, + "total_acs": 20949, + "total_submitted": 34652, + "total_column_articles": 302, "frontend_question_id": "1268", "is_new_question": false }, @@ -44238,8 +44742,8 @@ "question__title": "Count Servers that Communicate", "question__title_slug": "count-servers-that-communicate", "question__hide": false, - "total_acs": 35625, - "total_submitted": 51189, + "total_acs": 35719, + "total_submitted": 51347, "total_column_articles": 450, "frontend_question_id": "1267", "is_new_question": false @@ -44259,9 +44763,9 @@ "question__title": "Minimum Time Visiting All Points", "question__title_slug": "minimum-time-visiting-all-points", "question__hide": false, - "total_acs": 37738, - "total_submitted": 45582, - "total_column_articles": 548, + "total_acs": 37929, + "total_submitted": 45817, + "total_column_articles": 547, "frontend_question_id": "1266", "is_new_question": false }, @@ -44280,9 +44784,9 @@ "question__title": "Minimum Path Cost in a Grid", "question__title_slug": "minimum-path-cost-in-a-grid", "question__hide": false, - "total_acs": 20686, - "total_submitted": 28536, - "total_column_articles": 232, + "total_acs": 20833, + "total_submitted": 28749, + "total_column_articles": 233, "frontend_question_id": "2304", "is_new_question": false }, @@ -44301,8 +44805,8 @@ "question__title": "Maximum Value of K Coins From Piles", "question__title_slug": "maximum-value-of-k-coins-from-piles", "question__hide": false, - "total_acs": 7664, - "total_submitted": 13582, + "total_acs": 7838, + "total_submitted": 13897, "total_column_articles": 99, "frontend_question_id": "2218", "is_new_question": false @@ -44322,9 +44826,9 @@ "question__title": "Find the Difference of Two Arrays", "question__title_slug": "find-the-difference-of-two-arrays", "question__hide": false, - "total_acs": 29713, - "total_submitted": 42154, - "total_column_articles": 278, + "total_acs": 30775, + "total_submitted": 43562, + "total_column_articles": 282, "frontend_question_id": "2215", "is_new_question": false }, @@ -44343,9 +44847,9 @@ "question__title": "Counting Elements", "question__title_slug": "counting-elements", "question__hide": false, - "total_acs": 3955, - "total_submitted": 5809, - "total_column_articles": 94, + "total_acs": 4045, + "total_submitted": 5941, + "total_column_articles": 96, "frontend_question_id": "1426", "is_new_question": false }, @@ -44364,9 +44868,9 @@ "question__title": "Average Selling Price", "question__title_slug": "average-selling-price", "question__hide": false, - "total_acs": 41933, - "total_submitted": 82608, - "total_column_articles": 312, + "total_acs": 44391, + "total_submitted": 91069, + "total_column_articles": 322, "frontend_question_id": "1251", "is_new_question": false }, @@ -44385,8 +44889,8 @@ "question__title": "Minimum Moves to Move a Box to Their Target Location", "question__title_slug": "minimum-moves-to-move-a-box-to-their-target-location", "question__hide": false, - "total_acs": 15458, - "total_submitted": 28627, + "total_acs": 15510, + "total_submitted": 28735, "total_column_articles": 160, "frontend_question_id": "1263", "is_new_question": false @@ -44406,9 +44910,9 @@ "question__title": "Greatest Sum Divisible by Three", "question__title_slug": "greatest-sum-divisible-by-three", "question__hide": false, - "total_acs": 41232, - "total_submitted": 73081, - "total_column_articles": 421, + "total_acs": 41704, + "total_submitted": 73989, + "total_column_articles": 425, "frontend_question_id": "1262", "is_new_question": false }, @@ -44427,9 +44931,9 @@ "question__title": "Find Elements in a Contaminated Binary Tree", "question__title_slug": "find-elements-in-a-contaminated-binary-tree", "question__hide": false, - "total_acs": 13197, - "total_submitted": 17877, - "total_column_articles": 175, + "total_acs": 34078, + "total_submitted": 43227, + "total_column_articles": 306, "frontend_question_id": "1261", "is_new_question": false }, @@ -44448,9 +44952,9 @@ "question__title": "Shift 2D Grid", "question__title_slug": "shift-2d-grid", "question__hide": false, - "total_acs": 45312, - "total_submitted": 69309, - "total_column_articles": 684, + "total_acs": 45616, + "total_submitted": 69771, + "total_column_articles": 688, "frontend_question_id": "1260", "is_new_question": false }, @@ -44469,8 +44973,8 @@ "question__title": "Number of Ways to Build House of Cards", "question__title_slug": "number-of-ways-to-build-house-of-cards", "question__hide": false, - "total_acs": 276, - "total_submitted": 439, + "total_acs": 280, + "total_submitted": 462, "total_column_articles": 15, "frontend_question_id": "2189", "is_new_question": false @@ -44490,8 +44994,8 @@ "question__title": "Maximum Font to Fit a Sentence in a Screen", "question__title_slug": "maximum-font-to-fit-a-sentence-in-a-screen", "question__hide": false, - "total_acs": 885, - "total_submitted": 1407, + "total_acs": 896, + "total_submitted": 1418, "total_column_articles": 30, "frontend_question_id": "1618", "is_new_question": false @@ -44511,8 +45015,8 @@ "question__title": "Number of Single Divisor Triplets", "question__title_slug": "number-of-single-divisor-triplets", "question__hide": false, - "total_acs": 251, - "total_submitted": 436, + "total_acs": 255, + "total_submitted": 456, "total_column_articles": 8, "frontend_question_id": "2198", "is_new_question": false @@ -44532,8 +45036,8 @@ "question__title": "Calculate Amount Paid in Taxes", "question__title_slug": "calculate-amount-paid-in-taxes", "question__hide": false, - "total_acs": 24914, - "total_submitted": 35401, + "total_acs": 25036, + "total_submitted": 35571, "total_column_articles": 217, "frontend_question_id": "2303", "is_new_question": false @@ -44553,9 +45057,9 @@ "question__title": "Maximum Score Words Formed by Letters", "question__title_slug": "maximum-score-words-formed-by-letters", "question__hide": false, - "total_acs": 18597, - "total_submitted": 23326, - "total_column_articles": 250, + "total_acs": 18661, + "total_submitted": 23422, + "total_column_articles": 252, "frontend_question_id": "1255", "is_new_question": false }, @@ -44574,9 +45078,9 @@ "question__title": "Number of Closed Islands", "question__title_slug": "number-of-closed-islands", "question__hide": false, - "total_acs": 62699, - "total_submitted": 97949, - "total_column_articles": 850, + "total_acs": 63477, + "total_submitted": 99167, + "total_column_articles": 849, "frontend_question_id": "1254", "is_new_question": false }, @@ -44595,8 +45099,8 @@ "question__title": "Reconstruct a 2-Row Binary Matrix", "question__title_slug": "reconstruct-a-2-row-binary-matrix", "question__hide": false, - "total_acs": 23487, - "total_submitted": 48411, + "total_acs": 23553, + "total_submitted": 48533, "total_column_articles": 267, "frontend_question_id": "1253", "is_new_question": false @@ -44616,9 +45120,9 @@ "question__title": "Cells with Odd Values in a Matrix", "question__title_slug": "cells-with-odd-values-in-a-matrix", "question__hide": false, - "total_acs": 52793, - "total_submitted": 66369, - "total_column_articles": 676, + "total_acs": 52996, + "total_submitted": 66617, + "total_column_articles": 675, "frontend_question_id": "1252", "is_new_question": false }, @@ -44637,9 +45141,9 @@ "question__title": "Number of Comments per Post", "question__title_slug": "number-of-comments-per-post", "question__hide": false, - "total_acs": 12103, - "total_submitted": 20341, - "total_column_articles": 99, + "total_acs": 12190, + "total_submitted": 20480, + "total_column_articles": 101, "frontend_question_id": "1241", "is_new_question": false }, @@ -44658,9 +45162,9 @@ "question__title": "Selling Pieces of Wood", "question__title_slug": "selling-pieces-of-wood", "question__hide": false, - "total_acs": 5037, - "total_submitted": 9297, - "total_column_articles": 63, + "total_acs": 18717, + "total_submitted": 28674, + "total_column_articles": 123, "frontend_question_id": "2312", "is_new_question": false }, @@ -44679,8 +45183,8 @@ "question__title": "Find Palindrome With Fixed Length", "question__title_slug": "find-palindrome-with-fixed-length", "question__hide": false, - "total_acs": 7970, - "total_submitted": 23232, + "total_acs": 8030, + "total_submitted": 23388, "total_column_articles": 154, "frontend_question_id": "2217", "is_new_question": false @@ -44700,9 +45204,9 @@ "question__title": "Leftmost Column with at Least a One", "question__title_slug": "leftmost-column-with-at-least-a-one", "question__hide": false, - "total_acs": 2444, - "total_submitted": 3945, - "total_column_articles": 39, + "total_acs": 2480, + "total_submitted": 4002, + "total_column_articles": 40, "frontend_question_id": "1428", "is_new_question": false }, @@ -44721,9 +45225,9 @@ "question__title": "Check If It Is a Good Array", "question__title_slug": "check-if-it-is-a-good-array", "question__hide": false, - "total_acs": 21917, - "total_submitted": 30921, - "total_column_articles": 154, + "total_acs": 21985, + "total_submitted": 31022, + "total_column_articles": 156, "frontend_question_id": "1250", "is_new_question": false }, @@ -44742,9 +45246,9 @@ "question__title": "Minimum Remove to Make Valid Parentheses", "question__title_slug": "minimum-remove-to-make-valid-parentheses", "question__hide": false, - "total_acs": 46706, - "total_submitted": 78522, - "total_column_articles": 586, + "total_acs": 47101, + "total_submitted": 79094, + "total_column_articles": 588, "frontend_question_id": "1249", "is_new_question": false }, @@ -44763,8 +45267,8 @@ "question__title": "Count Number of Nice Subarrays", "question__title_slug": "count-number-of-nice-subarrays", "question__hide": false, - "total_acs": 54886, - "total_submitted": 93826, + "total_acs": 55366, + "total_submitted": 94572, "total_column_articles": 661, "frontend_question_id": "1248", "is_new_question": false @@ -44784,8 +45288,8 @@ "question__title": "Minimum Swaps to Make Strings Equal", "question__title_slug": "minimum-swaps-to-make-strings-equal", "question__hide": false, - "total_acs": 32431, - "total_submitted": 47008, + "total_acs": 32548, + "total_submitted": 47180, "total_column_articles": 446, "frontend_question_id": "1247", "is_new_question": false @@ -44805,8 +45309,8 @@ "question__title": "Web Crawler Multithreaded", "question__title_slug": "web-crawler-multithreaded", "question__hide": false, - "total_acs": 2447, - "total_submitted": 5084, + "total_acs": 2477, + "total_submitted": 5150, "total_column_articles": 31, "frontend_question_id": "1242", "is_new_question": false @@ -44826,8 +45330,8 @@ "question__title": "Maximum Height by Stacking Cuboids ", "question__title_slug": "maximum-height-by-stacking-cuboids", "question__hide": false, - "total_acs": 15338, - "total_submitted": 23591, + "total_acs": 15377, + "total_submitted": 23654, "total_column_articles": 179, "frontend_question_id": "1691", "is_new_question": false @@ -44847,9 +45351,9 @@ "question__title": "First Unique Number", "question__title_slug": "first-unique-number", "question__hide": false, - "total_acs": 4262, - "total_submitted": 7961, - "total_column_articles": 97, + "total_acs": 4353, + "total_submitted": 8099, + "total_column_articles": 99, "frontend_question_id": "1429", "is_new_question": false }, @@ -44868,9 +45372,9 @@ "question__title": "Tuple with Same Product", "question__title_slug": "tuple-with-same-product", "question__hide": false, - "total_acs": 31761, - "total_submitted": 49235, - "total_column_articles": 283, + "total_acs": 32004, + "total_submitted": 49644, + "total_column_articles": 284, "frontend_question_id": "1726", "is_new_question": false }, @@ -44889,9 +45393,9 @@ "question__title": "Greatest English Letter in Upper and Lower Case", "question__title_slug": "greatest-english-letter-in-upper-and-lower-case", "question__hide": false, - "total_acs": 30394, - "total_submitted": 42347, - "total_column_articles": 342, + "total_acs": 30654, + "total_submitted": 42710, + "total_column_articles": 344, "frontend_question_id": "2309", "is_new_question": false }, @@ -44910,9 +45414,9 @@ "question__title": "Airplane Seat Assignment Probability", "question__title_slug": "airplane-seat-assignment-probability", "question__hide": false, - "total_acs": 15265, - "total_submitted": 22741, - "total_column_articles": 199, + "total_acs": 15377, + "total_submitted": 22890, + "total_column_articles": 200, "frontend_question_id": "1227", "is_new_question": false }, @@ -44931,9 +45435,9 @@ "question__title": "Tiling a Rectangle with the Fewest Squares", "question__title_slug": "tiling-a-rectangle-with-the-fewest-squares", "question__hide": false, - "total_acs": 15119, - "total_submitted": 23835, - "total_column_articles": 122, + "total_acs": 15164, + "total_submitted": 23911, + "total_column_articles": 123, "frontend_question_id": "1240", "is_new_question": false }, @@ -44952,9 +45456,9 @@ "question__title": "Maximum Length of a Concatenated String with Unique Characters", "question__title_slug": "maximum-length-of-a-concatenated-string-with-unique-characters", "question__hide": false, - "total_acs": 42997, - "total_submitted": 87643, - "total_column_articles": 462, + "total_acs": 43213, + "total_submitted": 88053, + "total_column_articles": 459, "frontend_question_id": "1239", "is_new_question": false }, @@ -44973,8 +45477,8 @@ "question__title": "Circular Permutation in Binary Representation", "question__title_slug": "circular-permutation-in-binary-representation", "question__hide": false, - "total_acs": 22166, - "total_submitted": 28654, + "total_acs": 22256, + "total_submitted": 28761, "total_column_articles": 230, "frontend_question_id": "1238", "is_new_question": false @@ -44994,9 +45498,9 @@ "question__title": "Find Positive Integer Solution for a Given Equation", "question__title_slug": "find-positive-integer-solution-for-a-given-equation", "question__hide": false, - "total_acs": 32707, - "total_submitted": 41863, - "total_column_articles": 327, + "total_acs": 32858, + "total_submitted": 42033, + "total_column_articles": 329, "frontend_question_id": "1237", "is_new_question": false }, @@ -45015,9 +45519,9 @@ "question__title": "Report Contiguous Dates", "question__title_slug": "report-contiguous-dates", "question__hide": false, - "total_acs": 9358, - "total_submitted": 18043, - "total_column_articles": 162, + "total_acs": 9601, + "total_submitted": 18554, + "total_column_articles": 166, "frontend_question_id": "1225", "is_new_question": false }, @@ -45036,9 +45540,9 @@ "question__title": "Minimum Number of Moves to Make Palindrome", "question__title_slug": "minimum-number-of-moves-to-make-palindrome", "question__hide": false, - "total_acs": 3720, - "total_submitted": 7535, - "total_column_articles": 67, + "total_acs": 3791, + "total_submitted": 7679, + "total_column_articles": 69, "frontend_question_id": "2193", "is_new_question": false }, @@ -45057,9 +45561,9 @@ "question__title": "Minimum Deletions to Make Array Beautiful", "question__title_slug": "minimum-deletions-to-make-array-beautiful", "question__hide": false, - "total_acs": 34712, - "total_submitted": 56069, - "total_column_articles": 433, + "total_acs": 34857, + "total_submitted": 56303, + "total_column_articles": 434, "frontend_question_id": "2216", "is_new_question": false }, @@ -45078,9 +45582,9 @@ "question__title": "Find Players With Zero or One Losses", "question__title_slug": "find-players-with-zero-or-one-losses", "question__hide": false, - "total_acs": 11434, - "total_submitted": 18003, - "total_column_articles": 121, + "total_acs": 11495, + "total_submitted": 18091, + "total_column_articles": 125, "frontend_question_id": "2225", "is_new_question": false }, @@ -45099,9 +45603,9 @@ "question__title": "Find Resultant Array After Removing Anagrams", "question__title_slug": "find-resultant-array-after-removing-anagrams", "question__hide": false, - "total_acs": 13011, - "total_submitted": 21655, - "total_column_articles": 173, + "total_acs": 13119, + "total_submitted": 21807, + "total_column_articles": 174, "frontend_question_id": "2273", "is_new_question": false }, @@ -45120,9 +45624,9 @@ "question__title": "Maximum Profit in Job Scheduling", "question__title_slug": "maximum-profit-in-job-scheduling", "question__hide": false, - "total_acs": 34243, - "total_submitted": 59261, - "total_column_articles": 395, + "total_acs": 34442, + "total_submitted": 59736, + "total_column_articles": 397, "frontend_question_id": "1235", "is_new_question": false }, @@ -45141,9 +45645,9 @@ "question__title": "Replace the Substring for Balanced String", "question__title_slug": "replace-the-substring-for-balanced-string", "question__hide": false, - "total_acs": 33584, - "total_submitted": 74002, - "total_column_articles": 340, + "total_acs": 33935, + "total_submitted": 74605, + "total_column_articles": 342, "frontend_question_id": "1234", "is_new_question": false }, @@ -45162,9 +45666,9 @@ "question__title": "Remove Sub-Folders from the Filesystem", "question__title_slug": "remove-sub-folders-from-the-filesystem", "question__hide": false, - "total_acs": 37498, - "total_submitted": 60929, - "total_column_articles": 454, + "total_acs": 37652, + "total_submitted": 61210, + "total_column_articles": 456, "frontend_question_id": "1233", "is_new_question": false }, @@ -45183,9 +45687,9 @@ "question__title": "Check If It Is a Straight Line", "question__title_slug": "check-if-it-is-a-straight-line", "question__hide": false, - "total_acs": 52831, - "total_submitted": 118133, - "total_column_articles": 643, + "total_acs": 53795, + "total_submitted": 120891, + "total_column_articles": 649, "frontend_question_id": "1232", "is_new_question": false }, @@ -45204,9 +45708,9 @@ "question__title": "Maximum Score Of Spliced Array", "question__title_slug": "maximum-score-of-spliced-array", "question__hide": false, - "total_acs": 7230, - "total_submitted": 13776, - "total_column_articles": 110, + "total_acs": 7311, + "total_submitted": 13907, + "total_column_articles": 113, "frontend_question_id": "2321", "is_new_question": false }, @@ -45225,8 +45729,8 @@ "question__title": "Distance to a Cycle in Undirected Graph", "question__title_slug": "distance-to-a-cycle-in-undirected-graph", "question__hide": false, - "total_acs": 471, - "total_submitted": 673, + "total_acs": 486, + "total_submitted": 700, "total_column_articles": 20, "frontend_question_id": "2204", "is_new_question": false @@ -45246,8 +45750,8 @@ "question__title": "Maximize the Topmost Element After K Moves", "question__title_slug": "maximize-the-topmost-element-after-k-moves", "question__hide": false, - "total_acs": 9903, - "total_submitted": 44776, + "total_acs": 9950, + "total_submitted": 44939, "total_column_articles": 156, "frontend_question_id": "2202", "is_new_question": false @@ -45267,9 +45771,9 @@ "question__title": "Perform String Shifts", "question__title_slug": "perform-string-shifts", "question__hide": false, - "total_acs": 6279, - "total_submitted": 10829, - "total_column_articles": 165, + "total_acs": 6466, + "total_submitted": 11137, + "total_column_articles": 166, "frontend_question_id": "1427", "is_new_question": false }, @@ -45288,8 +45792,8 @@ "question__title": "Maximum Equal Frequency", "question__title_slug": "maximum-equal-frequency", "question__hide": false, - "total_acs": 27408, - "total_submitted": 62863, + "total_acs": 27450, + "total_submitted": 62974, "total_column_articles": 303, "frontend_question_id": "1224", "is_new_question": false @@ -45309,9 +45813,9 @@ "question__title": "Dice Roll Simulation", "question__title_slug": "dice-roll-simulation", "question__hide": false, - "total_acs": 18240, - "total_submitted": 29500, - "total_column_articles": 191, + "total_acs": 18274, + "total_submitted": 29567, + "total_column_articles": 194, "frontend_question_id": "1223", "is_new_question": false }, @@ -45330,9 +45834,9 @@ "question__title": "Queens That Can Attack the King", "question__title_slug": "queens-that-can-attack-the-king", "question__hide": false, - "total_acs": 30738, - "total_submitted": 41547, - "total_column_articles": 395, + "total_acs": 30837, + "total_submitted": 41675, + "total_column_articles": 396, "frontend_question_id": "1222", "is_new_question": false }, @@ -45351,9 +45855,9 @@ "question__title": "Split a String in Balanced Strings", "question__title_slug": "split-a-string-in-balanced-strings", "question__hide": false, - "total_acs": 106649, - "total_submitted": 125271, - "total_column_articles": 1398, + "total_acs": 107467, + "total_submitted": 126193, + "total_column_articles": 1406, "frontend_question_id": "1221", "is_new_question": false }, @@ -45372,8 +45876,8 @@ "question__title": "The Dining Philosophers", "question__title_slug": "the-dining-philosophers", "question__hide": false, - "total_acs": 20195, - "total_submitted": 33894, + "total_acs": 20363, + "total_submitted": 34167, "total_column_articles": 201, "frontend_question_id": "1226", "is_new_question": false @@ -45393,8 +45897,8 @@ "question__title": "Team Scores in Football Tournament", "question__title_slug": "team-scores-in-football-tournament", "question__hide": false, - "total_acs": 12905, - "total_submitted": 25756, + "total_acs": 13325, + "total_submitted": 26688, "total_column_articles": 195, "frontend_question_id": "1212", "is_new_question": false @@ -45414,9 +45918,9 @@ "question__title": "Queries Quality and Percentage", "question__title_slug": "queries-quality-and-percentage", "question__hide": false, - "total_acs": 36860, - "total_submitted": 62056, - "total_column_articles": 225, + "total_acs": 39019, + "total_submitted": 67783, + "total_column_articles": 237, "frontend_question_id": "1211", "is_new_question": false }, @@ -45435,9 +45939,9 @@ "question__title": "Design Skiplist", "question__title_slug": "design-skiplist", "question__hide": false, - "total_acs": 32163, - "total_submitted": 47397, - "total_column_articles": 267, + "total_acs": 32488, + "total_submitted": 47953, + "total_column_articles": 269, "frontend_question_id": "1206", "is_new_question": false }, @@ -45456,8 +45960,8 @@ "question__title": "Maximum Product of the Length of Two Palindromic Substrings", "question__title_slug": "maximum-product-of-the-length-of-two-palindromic-substrings", "question__hide": false, - "total_acs": 1326, - "total_submitted": 4003, + "total_acs": 1335, + "total_submitted": 4059, "total_column_articles": 37, "frontend_question_id": "1960", "is_new_question": false @@ -45477,9 +45981,9 @@ "question__title": "Maximum Candies Allocated to K Children", "question__title_slug": "maximum-candies-allocated-to-k-children", "question__hide": false, - "total_acs": 13811, - "total_submitted": 38995, - "total_column_articles": 198, + "total_acs": 14111, + "total_submitted": 39748, + "total_column_articles": 201, "frontend_question_id": "2226", "is_new_question": false }, @@ -45498,9 +46002,9 @@ "question__title": "Sum of Numbers With Units Digit K", "question__title_slug": "sum-of-numbers-with-units-digit-k", "question__hide": false, - "total_acs": 9670, - "total_submitted": 34344, - "total_column_articles": 136, + "total_acs": 9796, + "total_submitted": 34682, + "total_column_articles": 141, "frontend_question_id": "2310", "is_new_question": false }, @@ -45519,9 +46023,9 @@ "question__title": "Sort the Jumbled Numbers", "question__title_slug": "sort-the-jumbled-numbers", "question__hide": false, - "total_acs": 7504, - "total_submitted": 17008, - "total_column_articles": 115, + "total_acs": 7554, + "total_submitted": 17102, + "total_column_articles": 116, "frontend_question_id": "2191", "is_new_question": false }, @@ -45540,9 +46044,9 @@ "question__title": "Count Vowels Permutation", "question__title_slug": "count-vowels-permutation", "question__hide": false, - "total_acs": 28050, - "total_submitted": 46052, - "total_column_articles": 383, + "total_acs": 28181, + "total_submitted": 46281, + "total_column_articles": 380, "frontend_question_id": "1220", "is_new_question": false }, @@ -45561,9 +46065,9 @@ "question__title": "Path with Maximum Gold", "question__title_slug": "path-with-maximum-gold", "question__hide": false, - "total_acs": 42652, - "total_submitted": 61867, - "total_column_articles": 534, + "total_acs": 42916, + "total_submitted": 62396, + "total_column_articles": 532, "frontend_question_id": "1219", "is_new_question": false }, @@ -45582,9 +46086,9 @@ "question__title": "Longest Arithmetic Subsequence of Given Difference", "question__title_slug": "longest-arithmetic-subsequence-of-given-difference", "question__hide": false, - "total_acs": 49671, - "total_submitted": 97345, - "total_column_articles": 441, + "total_acs": 50504, + "total_submitted": 99410, + "total_column_articles": 447, "frontend_question_id": "1218", "is_new_question": false }, @@ -45603,8 +46107,8 @@ "question__title": "Minimum Cost to Move Chips to The Same Position", "question__title_slug": "minimum-cost-to-move-chips-to-the-same-position", "question__hide": false, - "total_acs": 60800, - "total_submitted": 81332, + "total_acs": 61205, + "total_submitted": 81840, "total_column_articles": 779, "frontend_question_id": "1217", "is_new_question": false @@ -45624,8 +46128,8 @@ "question__title": "Monthly Transactions II", "question__title_slug": "monthly-transactions-ii", "question__hide": false, - "total_acs": 9804, - "total_submitted": 21712, + "total_acs": 9874, + "total_submitted": 21853, "total_column_articles": 121, "frontend_question_id": "1205", "is_new_question": false @@ -45645,9 +46149,9 @@ "question__title": "Last Person to Fit in the Bus", "question__title_slug": "last-person-to-fit-in-the-bus", "question__hide": false, - "total_acs": 23294, - "total_submitted": 32757, - "total_column_articles": 217, + "total_acs": 24680, + "total_submitted": 34675, + "total_column_articles": 223, "frontend_question_id": "1204", "is_new_question": false }, @@ -45666,8 +46170,8 @@ "question__title": "Sum of Floored Pairs", "question__title_slug": "sum-of-floored-pairs", "question__hide": false, - "total_acs": 4272, - "total_submitted": 12273, + "total_acs": 4307, + "total_submitted": 12409, "total_column_articles": 67, "frontend_question_id": "1862", "is_new_question": false @@ -45687,9 +46191,9 @@ "question__title": "Path with Maximum Probability", "question__title_slug": "path-with-maximum-probability", "question__hide": false, - "total_acs": 22520, - "total_submitted": 54213, - "total_column_articles": 279, + "total_acs": 23162, + "total_submitted": 55635, + "total_column_articles": 284, "frontend_question_id": "1514", "is_new_question": false }, @@ -45708,9 +46212,9 @@ "question__title": "Where Will the Ball Fall", "question__title_slug": "where-will-the-ball-fall", "question__hide": false, - "total_acs": 40604, - "total_submitted": 58828, - "total_column_articles": 692, + "total_acs": 40659, + "total_submitted": 58904, + "total_column_articles": 690, "frontend_question_id": "1706", "is_new_question": false }, @@ -45729,8 +46233,8 @@ "question__title": "Minimum Moves to Reach Target with Rotations", "question__title_slug": "minimum-moves-to-reach-target-with-rotations", "question__hide": false, - "total_acs": 15509, - "total_submitted": 24145, + "total_acs": 15540, + "total_submitted": 24210, "total_column_articles": 183, "frontend_question_id": "1210", "is_new_question": false @@ -45750,9 +46254,9 @@ "question__title": "Get Equal Substrings Within Budget", "question__title_slug": "get-equal-substrings-within-budget", "question__hide": false, - "total_acs": 72661, - "total_submitted": 144731, - "total_column_articles": 795, + "total_acs": 73024, + "total_submitted": 145393, + "total_column_articles": 792, "frontend_question_id": "1208", "is_new_question": false }, @@ -45771,9 +46275,9 @@ "question__title": "Remove All Adjacent Duplicates in String II", "question__title_slug": "remove-all-adjacent-duplicates-in-string-ii", "question__hide": false, - "total_acs": 22167, - "total_submitted": 43267, - "total_column_articles": 244, + "total_acs": 22442, + "total_submitted": 43746, + "total_column_articles": 245, "frontend_question_id": "1209", "is_new_question": false }, @@ -45792,9 +46296,9 @@ "question__title": "Unique Number of Occurrences", "question__title_slug": "unique-number-of-occurrences", "question__hide": false, - "total_acs": 99135, - "total_submitted": 135050, - "total_column_articles": 1173, + "total_acs": 100753, + "total_submitted": 137209, + "total_column_articles": 1182, "frontend_question_id": "1207", "is_new_question": false }, @@ -45813,8 +46317,8 @@ "question__title": "Tournament Winners", "question__title_slug": "tournament-winners", "question__hide": false, - "total_acs": 7547, - "total_submitted": 14879, + "total_acs": 7602, + "total_submitted": 15016, "total_column_articles": 110, "frontend_question_id": "1194", "is_new_question": false @@ -45834,9 +46338,9 @@ "question__title": "Monthly Transactions I", "question__title_slug": "monthly-transactions-i", "question__hide": false, - "total_acs": 33369, - "total_submitted": 54885, - "total_column_articles": 233, + "total_acs": 35443, + "total_submitted": 58380, + "total_column_articles": 243, "frontend_question_id": "1193", "is_new_question": false }, @@ -45855,9 +46359,9 @@ "question__title": "Fizz Buzz Multithreaded", "question__title_slug": "fizz-buzz-multithreaded", "question__hide": false, - "total_acs": 23113, - "total_submitted": 35406, - "total_column_articles": 386, + "total_acs": 23314, + "total_submitted": 35712, + "total_column_articles": 387, "frontend_question_id": "1195", "is_new_question": false }, @@ -45876,8 +46380,8 @@ "question__title": "Count Ways to Build Rooms in an Ant Colony", "question__title_slug": "count-ways-to-build-rooms-in-an-ant-colony", "question__hide": false, - "total_acs": 2271, - "total_submitted": 3978, + "total_acs": 2283, + "total_submitted": 4014, "total_column_articles": 32, "frontend_question_id": "1916", "is_new_question": false @@ -45897,8 +46401,8 @@ "question__title": "Count Artifacts That Can Be Extracted", "question__title_slug": "count-artifacts-that-can-be-extracted", "question__hide": false, - "total_acs": 8950, - "total_submitted": 17866, + "total_acs": 8996, + "total_submitted": 17944, "total_column_articles": 143, "frontend_question_id": "2201", "is_new_question": false @@ -45918,8 +46422,8 @@ "question__title": "Largest Magic Square", "question__title_slug": "largest-magic-square", "question__hide": false, - "total_acs": 3560, - "total_submitted": 6273, + "total_acs": 3594, + "total_submitted": 6322, "total_column_articles": 65, "frontend_question_id": "1895", "is_new_question": false @@ -45939,9 +46443,9 @@ "question__title": "Watering Plants", "question__title_slug": "watering-plants", "question__hide": false, - "total_acs": 9498, - "total_submitted": 12237, - "total_column_articles": 178, + "total_acs": 9577, + "total_submitted": 12348, + "total_column_articles": 182, "frontend_question_id": "2079", "is_new_question": false }, @@ -45960,9 +46464,9 @@ "question__title": "Sort Items by Groups Respecting Dependencies", "question__title_slug": "sort-items-by-groups-respecting-dependencies", "question__hide": false, - "total_acs": 14853, - "total_submitted": 24461, - "total_column_articles": 180, + "total_acs": 14945, + "total_submitted": 24612, + "total_column_articles": 181, "frontend_question_id": "1203", "is_new_question": false }, @@ -45981,8 +46485,8 @@ "question__title": "Smallest String With Swaps", "question__title_slug": "smallest-string-with-swaps", "question__hide": false, - "total_acs": 33452, - "total_submitted": 64554, + "total_acs": 33557, + "total_submitted": 64760, "total_column_articles": 390, "frontend_question_id": "1202", "is_new_question": false @@ -46002,9 +46506,9 @@ "question__title": "Ugly Number III", "question__title_slug": "ugly-number-iii", "question__hide": false, - "total_acs": 13117, - "total_submitted": 45272, - "total_column_articles": 169, + "total_acs": 13297, + "total_submitted": 45760, + "total_column_articles": 171, "frontend_question_id": "1201", "is_new_question": false }, @@ -46023,9 +46527,9 @@ "question__title": "Minimum Absolute Difference", "question__title_slug": "minimum-absolute-difference", "question__hide": false, - "total_acs": 60787, - "total_submitted": 84005, - "total_column_articles": 650, + "total_acs": 61130, + "total_submitted": 84480, + "total_column_articles": 651, "frontend_question_id": "1200", "is_new_question": false }, @@ -46044,9 +46548,9 @@ "question__title": "Number of Visible People in a Queue", "question__title_slug": "number-of-visible-people-in-a-queue", "question__hide": false, - "total_acs": 21715, - "total_submitted": 31680, - "total_column_articles": 250, + "total_acs": 21897, + "total_submitted": 31946, + "total_column_articles": 252, "frontend_question_id": "1944", "is_new_question": false }, @@ -46065,9 +46569,9 @@ "question__title": "Longest Happy String", "question__title_slug": "longest-happy-string", "question__hide": false, - "total_acs": 30639, - "total_submitted": 48221, - "total_column_articles": 526, + "total_acs": 30707, + "total_submitted": 48352, + "total_column_articles": 527, "frontend_question_id": "1405", "is_new_question": false }, @@ -46086,8 +46590,8 @@ "question__title": "Minimum Moves to Reach Target Score", "question__title_slug": "minimum-moves-to-reach-target-score", "question__hide": false, - "total_acs": 9954, - "total_submitted": 19100, + "total_acs": 10019, + "total_submitted": 19273, "total_column_articles": 172, "frontend_question_id": "2139", "is_new_question": false @@ -46107,9 +46611,9 @@ "question__title": "Delete Characters to Make Fancy String", "question__title_slug": "delete-characters-to-make-fancy-string", "question__hide": false, - "total_acs": 12814, - "total_submitted": 20859, - "total_column_articles": 163, + "total_acs": 12986, + "total_submitted": 21090, + "total_column_articles": 164, "frontend_question_id": "1957", "is_new_question": false }, @@ -46128,9 +46632,9 @@ "question__title": "Reformat Department Table", "question__title_slug": "reformat-department-table", "question__hide": false, - "total_acs": 52384, - "total_submitted": 80093, - "total_column_articles": 302, + "total_acs": 52912, + "total_submitted": 80884, + "total_column_articles": 306, "frontend_question_id": "1179", "is_new_question": false }, @@ -46149,8 +46653,8 @@ "question__title": "Critical Connections in a Network", "question__title_slug": "critical-connections-in-a-network", "question__hide": false, - "total_acs": 9600, - "total_submitted": 17218, + "total_acs": 9715, + "total_submitted": 17399, "total_column_articles": 123, "frontend_question_id": "1192", "is_new_question": false @@ -46170,9 +46674,9 @@ "question__title": "K-Concatenation Maximum Sum", "question__title_slug": "k-concatenation-maximum-sum", "question__hide": false, - "total_acs": 9183, - "total_submitted": 33733, - "total_column_articles": 140, + "total_acs": 9296, + "total_submitted": 34184, + "total_column_articles": 142, "frontend_question_id": "1191", "is_new_question": false }, @@ -46191,9 +46695,9 @@ "question__title": "Reverse Substrings Between Each Pair of Parentheses", "question__title_slug": "reverse-substrings-between-each-pair-of-parentheses", "question__hide": false, - "total_acs": 63022, - "total_submitted": 97136, - "total_column_articles": 766, + "total_acs": 63387, + "total_submitted": 97661, + "total_column_articles": 765, "frontend_question_id": "1190", "is_new_question": false }, @@ -46212,9 +46716,9 @@ "question__title": "Maximum Number of Balloons", "question__title_slug": "maximum-number-of-balloons", "question__hide": false, - "total_acs": 62296, - "total_submitted": 91409, - "total_column_articles": 847, + "total_acs": 62680, + "total_submitted": 92009, + "total_column_articles": 848, "frontend_question_id": "1189", "is_new_question": false }, @@ -46233,8 +46737,8 @@ "question__title": "Kth Ancestor of a Tree Node", "question__title_slug": "kth-ancestor-of-a-tree-node", "question__hide": false, - "total_acs": 16942, - "total_submitted": 36678, + "total_acs": 17036, + "total_submitted": 36830, "total_column_articles": 164, "frontend_question_id": "1483", "is_new_question": false @@ -46254,9 +46758,9 @@ "question__title": "Minimum Garden Perimeter to Collect Enough Apples", "question__title_slug": "minimum-garden-perimeter-to-collect-enough-apples", "question__hide": false, - "total_acs": 20060, - "total_submitted": 31547, - "total_column_articles": 191, + "total_acs": 20156, + "total_submitted": 31702, + "total_column_articles": 192, "frontend_question_id": "1954", "is_new_question": false }, @@ -46275,8 +46779,8 @@ "question__title": "Range Frequency Queries", "question__title_slug": "range-frequency-queries", "question__hide": false, - "total_acs": 9452, - "total_submitted": 29337, + "total_acs": 9509, + "total_submitted": 29467, "total_column_articles": 190, "frontend_question_id": "2080", "is_new_question": false @@ -46296,9 +46800,9 @@ "question__title": "Three Consecutive Odds", "question__title_slug": "three-consecutive-odds", "question__hide": false, - "total_acs": 31904, - "total_submitted": 48471, - "total_column_articles": 417, + "total_acs": 32510, + "total_submitted": 49473, + "total_column_articles": 419, "frontend_question_id": "1550", "is_new_question": false }, @@ -46317,9 +46821,9 @@ "question__title": "Immediate Food Delivery II", "question__title_slug": "immediate-food-delivery-ii", "question__hide": false, - "total_acs": 26097, - "total_submitted": 47431, - "total_column_articles": 231, + "total_acs": 27761, + "total_submitted": 52481, + "total_column_articles": 253, "frontend_question_id": "1174", "is_new_question": false }, @@ -46338,8 +46842,8 @@ "question__title": "Immediate Food Delivery I", "question__title_slug": "immediate-food-delivery-i", "question__hide": false, - "total_acs": 25329, - "total_submitted": 33189, + "total_acs": 25721, + "total_submitted": 33698, "total_column_articles": 167, "frontend_question_id": "1173", "is_new_question": false @@ -46359,8 +46863,8 @@ "question__title": "Make Array Strictly Increasing", "question__title_slug": "make-array-strictly-increasing", "question__hide": false, - "total_acs": 15055, - "total_submitted": 25348, + "total_acs": 15092, + "total_submitted": 25434, "total_column_articles": 127, "frontend_question_id": "1187", "is_new_question": false @@ -46380,9 +46884,9 @@ "question__title": "Day of the Week", "question__title_slug": "day-of-the-week", "question__hide": false, - "total_acs": 53079, - "total_submitted": 83187, - "total_column_articles": 622, + "total_acs": 53319, + "total_submitted": 83593, + "total_column_articles": 619, "frontend_question_id": "1185", "is_new_question": false }, @@ -46401,9 +46905,9 @@ "question__title": "Maximum Subarray Sum with One Deletion", "question__title_slug": "maximum-subarray-sum-with-one-deletion", "question__hide": false, - "total_acs": 29009, - "total_submitted": 59983, - "total_column_articles": 286, + "total_acs": 29157, + "total_submitted": 60254, + "total_column_articles": 288, "frontend_question_id": "1186", "is_new_question": false }, @@ -46422,9 +46926,9 @@ "question__title": "Distance Between Bus Stops", "question__title_slug": "distance-between-bus-stops", "question__hide": false, - "total_acs": 43846, - "total_submitted": 71141, - "total_column_articles": 644, + "total_acs": 44110, + "total_submitted": 71610, + "total_column_articles": 645, "frontend_question_id": "1184", "is_new_question": false }, @@ -46443,8 +46947,8 @@ "question__title": "Constrained Subsequence Sum", "question__title_slug": "constrained-subsequence-sum", "question__hide": false, - "total_acs": 7572, - "total_submitted": 15526, + "total_acs": 7664, + "total_submitted": 15705, "total_column_articles": 126, "frontend_question_id": "1425", "is_new_question": false @@ -46464,9 +46968,9 @@ "question__title": "Balance a Binary Search Tree", "question__title_slug": "balance-a-binary-search-tree", "question__hide": false, - "total_acs": 27667, - "total_submitted": 37401, - "total_column_articles": 317, + "total_acs": 28056, + "total_submitted": 37891, + "total_column_articles": 320, "frontend_question_id": "1382", "is_new_question": false }, @@ -46485,9 +46989,9 @@ "question__title": "Four Divisors", "question__title_slug": "four-divisors", "question__hide": false, - "total_acs": 10222, - "total_submitted": 25785, - "total_column_articles": 152, + "total_acs": 10303, + "total_submitted": 25950, + "total_column_articles": 155, "frontend_question_id": "1390", "is_new_question": false }, @@ -46506,9 +47010,9 @@ "question__title": "Reformat Date", "question__title_slug": "reformat-date", "question__hide": false, - "total_acs": 16785, - "total_submitted": 28094, - "total_column_articles": 229, + "total_acs": 16909, + "total_submitted": 28299, + "total_column_articles": 228, "frontend_question_id": "1507", "is_new_question": false }, @@ -46527,8 +47031,8 @@ "question__title": "Number of Valid Words for Each Puzzle", "question__title_slug": "number-of-valid-words-for-each-puzzle", "question__hide": false, - "total_acs": 20842, - "total_submitted": 44404, + "total_acs": 20859, + "total_submitted": 44444, "total_column_articles": 203, "frontend_question_id": "1178", "is_new_question": false @@ -46548,8 +47052,8 @@ "question__title": "Can Make Palindrome from Substring", "question__title_slug": "can-make-palindrome-from-substring", "question__hide": false, - "total_acs": 23830, - "total_submitted": 56141, + "total_acs": 23933, + "total_submitted": 56329, "total_column_articles": 249, "frontend_question_id": "1177", "is_new_question": false @@ -46569,9 +47073,9 @@ "question__title": "Diet Plan Performance", "question__title_slug": "diet-plan-performance", "question__hide": false, - "total_acs": 6227, - "total_submitted": 12675, - "total_column_articles": 101, + "total_acs": 6276, + "total_submitted": 12739, + "total_column_articles": 102, "frontend_question_id": "1176", "is_new_question": false }, @@ -46590,9 +47094,9 @@ "question__title": "Prime Arrangements", "question__title_slug": "prime-arrangements", "question__hide": false, - "total_acs": 33974, - "total_submitted": 60026, - "total_column_articles": 392, + "total_acs": 34161, + "total_submitted": 60323, + "total_column_articles": 393, "frontend_question_id": "1175", "is_new_question": false }, @@ -46611,9 +47115,9 @@ "question__title": "Product Price at a Given Date", "question__title_slug": "product-price-at-a-given-date", "question__hide": false, - "total_acs": 28334, - "total_submitted": 50368, - "total_column_articles": 301, + "total_acs": 29831, + "total_submitted": 52783, + "total_column_articles": 310, "frontend_question_id": "1164", "is_new_question": false }, @@ -46632,8 +47136,8 @@ "question__title": "Largest Multiple of Three", "question__title_slug": "largest-multiple-of-three", "question__hide": false, - "total_acs": 8460, - "total_submitted": 23475, + "total_acs": 8529, + "total_submitted": 23655, "total_column_articles": 142, "frontend_question_id": "1363", "is_new_question": false @@ -46653,8 +47157,8 @@ "question__title": "Closest Divisors", "question__title_slug": "closest-divisors", "question__hide": false, - "total_acs": 8681, - "total_submitted": 15648, + "total_acs": 8767, + "total_submitted": 15817, "total_column_articles": 104, "frontend_question_id": "1362", "is_new_question": false @@ -46674,9 +47178,9 @@ "question__title": "Validate Binary Tree Nodes", "question__title_slug": "validate-binary-tree-nodes", "question__hide": false, - "total_acs": 13488, - "total_submitted": 33672, - "total_column_articles": 315, + "total_acs": 13568, + "total_submitted": 33878, + "total_column_articles": 316, "frontend_question_id": "1361", "is_new_question": false }, @@ -46695,9 +47199,9 @@ "question__title": "Number of Days Between Two Dates", "question__title_slug": "number-of-days-between-two-dates", "question__hide": false, - "total_acs": 16797, - "total_submitted": 32551, - "total_column_articles": 254, + "total_acs": 17002, + "total_submitted": 32902, + "total_column_articles": 256, "frontend_question_id": "1360", "is_new_question": false }, @@ -46716,8 +47220,8 @@ "question__title": "Compare Strings by Frequency of the Smallest Character", "question__title_slug": "compare-strings-by-frequency-of-the-smallest-character", "question__hide": false, - "total_acs": 33107, - "total_submitted": 49891, + "total_acs": 33198, + "total_submitted": 50031, "total_column_articles": 438, "frontend_question_id": "1170", "is_new_question": false @@ -46737,9 +47241,9 @@ "question__title": "Invalid Transactions", "question__title_slug": "invalid-transactions", "question__hide": false, - "total_acs": 9992, - "total_submitted": 29891, - "total_column_articles": 118, + "total_acs": 10033, + "total_submitted": 30010, + "total_column_articles": 119, "frontend_question_id": "1169", "is_new_question": false }, @@ -46758,9 +47262,9 @@ "question__title": "Web Crawler", "question__title_slug": "web-crawler", "question__hide": false, - "total_acs": 2300, - "total_submitted": 3988, - "total_column_articles": 46, + "total_acs": 2337, + "total_submitted": 4065, + "total_column_articles": 47, "frontend_question_id": "1236", "is_new_question": false }, @@ -46779,9 +47283,9 @@ "question__title": "Dinner Plate Stacks", "question__title_slug": "dinner-plate-stacks", "question__hide": false, - "total_acs": 13807, - "total_submitted": 34894, - "total_column_articles": 161, + "total_acs": 13835, + "total_submitted": 34989, + "total_column_articles": 162, "frontend_question_id": "1172", "is_new_question": false }, @@ -46800,9 +47304,9 @@ "question__title": "Market Analysis II", "question__title_slug": "market-analysis-ii", "question__hide": false, - "total_acs": 7931, - "total_submitted": 15708, - "total_column_articles": 139, + "total_acs": 7995, + "total_submitted": 15837, + "total_column_articles": 140, "frontend_question_id": "1159", "is_new_question": false }, @@ -46821,9 +47325,9 @@ "question__title": "Market Analysis I", "question__title_slug": "market-analysis-i", "question__hide": false, - "total_acs": 43082, - "total_submitted": 79375, - "total_column_articles": 325, + "total_acs": 43649, + "total_submitted": 80413, + "total_column_articles": 327, "frontend_question_id": "1158", "is_new_question": false }, @@ -46842,9 +47346,9 @@ "question__title": "Remove Zero Sum Consecutive Nodes from Linked List", "question__title_slug": "remove-zero-sum-consecutive-nodes-from-linked-list", "question__hide": false, - "total_acs": 35896, - "total_submitted": 67875, - "total_column_articles": 347, + "total_acs": 36197, + "total_submitted": 68355, + "total_column_articles": 349, "frontend_question_id": "1171", "is_new_question": false }, @@ -46863,9 +47367,9 @@ "question__title": "Maximum Number of Words You Can Type", "question__title_slug": "maximum-number-of-words-you-can-type", "question__hide": false, - "total_acs": 15412, - "total_submitted": 21748, - "total_column_articles": 259, + "total_acs": 15703, + "total_submitted": 22113, + "total_column_articles": 261, "frontend_question_id": "1935", "is_new_question": false }, @@ -46884,9 +47388,9 @@ "question__title": "Number of Dice Rolls With Target Sum", "question__title_slug": "number-of-dice-rolls-with-target-sum", "question__hide": false, - "total_acs": 43334, - "total_submitted": 68777, - "total_column_articles": 338, + "total_acs": 43816, + "total_submitted": 69454, + "total_column_articles": 340, "frontend_question_id": "1155", "is_new_question": false }, @@ -46905,8 +47409,8 @@ "question__title": "Online Majority Element In Subarray", "question__title_slug": "online-majority-element-in-subarray", "question__hide": false, - "total_acs": 14490, - "total_submitted": 31360, + "total_acs": 14556, + "total_submitted": 31480, "total_column_articles": 130, "frontend_question_id": "1157", "is_new_question": false @@ -46926,9 +47430,9 @@ "question__title": "Swap For Longest Repeated Character Substring", "question__title_slug": "swap-for-longest-repeated-character-substring", "question__hide": false, - "total_acs": 23378, - "total_submitted": 45592, - "total_column_articles": 319, + "total_acs": 23544, + "total_submitted": 45926, + "total_column_articles": 321, "frontend_question_id": "1156", "is_new_question": false }, @@ -46947,9 +47451,9 @@ "question__title": "Day of the Year", "question__title_slug": "day-of-the-year", "question__hide": false, - "total_acs": 72787, - "total_submitted": 115262, - "total_column_articles": 754, + "total_acs": 73222, + "total_submitted": 116067, + "total_column_articles": 752, "frontend_question_id": "1154", "is_new_question": false }, @@ -46968,8 +47472,8 @@ "question__title": "Article Views II", "question__title_slug": "article-views-ii", "question__hide": false, - "total_acs": 11397, - "total_submitted": 25754, + "total_acs": 11515, + "total_submitted": 26020, "total_column_articles": 79, "frontend_question_id": "1149", "is_new_question": false @@ -46989,9 +47493,9 @@ "question__title": "Article Views I", "question__title_slug": "article-views-i", "question__hide": false, - "total_acs": 94089, - "total_submitted": 133180, - "total_column_articles": 282, + "total_acs": 99053, + "total_submitted": 139867, + "total_column_articles": 289, "frontend_question_id": "1148", "is_new_question": false }, @@ -47010,8 +47514,8 @@ "question__title": "Rank Transform of a Matrix", "question__title_slug": "rank-transform-of-a-matrix", "question__hide": false, - "total_acs": 10669, - "total_submitted": 18641, + "total_acs": 10690, + "total_submitted": 18697, "total_column_articles": 98, "frontend_question_id": "1632", "is_new_question": false @@ -47031,8 +47535,8 @@ "question__title": "Rank Transform of an Array", "question__title_slug": "rank-transform-of-an-array", "question__hide": false, - "total_acs": 48234, - "total_submitted": 79890, + "total_acs": 48518, + "total_submitted": 80363, "total_column_articles": 547, "frontend_question_id": "1331", "is_new_question": false @@ -47052,8 +47556,8 @@ "question__title": "Reverse Subarray To Maximize Array Value", "question__title_slug": "reverse-subarray-to-maximize-array-value", "question__hide": false, - "total_acs": 10953, - "total_submitted": 19109, + "total_acs": 10970, + "total_submitted": 19165, "total_column_articles": 85, "frontend_question_id": "1330", "is_new_question": false @@ -47073,8 +47577,8 @@ "question__title": "Deepest Leaves Sum", "question__title_slug": "deepest-leaves-sum", "question__hide": false, - "total_acs": 66114, - "total_submitted": 77345, + "total_acs": 66450, + "total_submitted": 77737, "total_column_articles": 795, "frontend_question_id": "1302", "is_new_question": false @@ -47094,9 +47598,9 @@ "question__title": "Sort the Matrix Diagonally", "question__title_slug": "sort-the-matrix-diagonally", "question__hide": false, - "total_acs": 12408, - "total_submitted": 15948, - "total_column_articles": 249, + "total_acs": 12477, + "total_submitted": 16027, + "total_column_articles": 250, "frontend_question_id": "1329", "is_new_question": false }, @@ -47115,8 +47619,8 @@ "question__title": "Break a Palindrome", "question__title_slug": "break-a-palindrome", "question__hide": false, - "total_acs": 10183, - "total_submitted": 21553, + "total_acs": 10267, + "total_submitted": 21714, "total_column_articles": 177, "frontend_question_id": "1328", "is_new_question": false @@ -47136,9 +47640,9 @@ "question__title": "Longest Chunked Palindrome Decomposition", "question__title_slug": "longest-chunked-palindrome-decomposition", "question__hide": false, - "total_acs": 24037, - "total_submitted": 40852, - "total_column_articles": 369, + "total_acs": 24115, + "total_submitted": 41035, + "total_column_articles": 370, "frontend_question_id": "1147", "is_new_question": false }, @@ -47157,9 +47661,9 @@ "question__title": "Longest Common Subsequence", "question__title_slug": "longest-common-subsequence", "question__hide": false, - "total_acs": 416490, - "total_submitted": 640493, - "total_column_articles": 2057, + "total_acs": 429987, + "total_submitted": 660660, + "total_column_articles": 2093, "frontend_question_id": "1143", "is_new_question": false }, @@ -47178,9 +47682,9 @@ "question__title": "Snapshot Array", "question__title_slug": "snapshot-array", "question__hide": false, - "total_acs": 10817, - "total_submitted": 31840, - "total_column_articles": 132, + "total_acs": 11021, + "total_submitted": 32373, + "total_column_articles": 134, "frontend_question_id": "1146", "is_new_question": false }, @@ -47199,9 +47703,9 @@ "question__title": "Binary Tree Coloring Game", "question__title_slug": "binary-tree-coloring-game", "question__hide": false, - "total_acs": 27192, - "total_submitted": 49119, - "total_column_articles": 385, + "total_acs": 27274, + "total_submitted": 49279, + "total_column_articles": 386, "frontend_question_id": "1145", "is_new_question": false }, @@ -47220,9 +47724,9 @@ "question__title": "Decrease Elements To Make Array Zigzag", "question__title_slug": "decrease-elements-to-make-array-zigzag", "question__hide": false, - "total_acs": 32928, - "total_submitted": 65073, - "total_column_articles": 342, + "total_acs": 32994, + "total_submitted": 65195, + "total_column_articles": 343, "frontend_question_id": "1144", "is_new_question": false }, @@ -47241,9 +47745,9 @@ "question__title": "User Activity for the Past 30 Days II", "question__title_slug": "user-activity-for-the-past-30-days-ii", "question__hide": false, - "total_acs": 13389, - "total_submitted": 36345, - "total_column_articles": 82, + "total_acs": 13504, + "total_submitted": 36716, + "total_column_articles": 84, "frontend_question_id": "1142", "is_new_question": false }, @@ -47262,9 +47766,9 @@ "question__title": "User Activity for the Past 30 Days I", "question__title_slug": "user-activity-for-the-past-30-days-i", "question__hide": false, - "total_acs": 70232, - "total_submitted": 155643, - "total_column_articles": 405, + "total_acs": 72429, + "total_submitted": 160217, + "total_column_articles": 413, "frontend_question_id": "1141", "is_new_question": false }, @@ -47283,8 +47787,8 @@ "question__title": "Distinct Echo Substrings", "question__title_slug": "distinct-echo-substrings", "question__hide": false, - "total_acs": 5688, - "total_submitted": 11414, + "total_acs": 5759, + "total_submitted": 11554, "total_column_articles": 97, "frontend_question_id": "1316", "is_new_question": false @@ -47304,9 +47808,9 @@ "question__title": "Sum of Nodes with Even-Valued Grandparent", "question__title_slug": "sum-of-nodes-with-even-valued-grandparent", "question__hide": false, - "total_acs": 19456, - "total_submitted": 23797, - "total_column_articles": 394, + "total_acs": 19646, + "total_submitted": 24047, + "total_column_articles": 395, "frontend_question_id": "1315", "is_new_question": false }, @@ -47325,9 +47829,9 @@ "question__title": "Matrix Block Sum", "question__title_slug": "matrix-block-sum", "question__hide": false, - "total_acs": 26145, - "total_submitted": 34815, - "total_column_articles": 387, + "total_acs": 26535, + "total_submitted": 35401, + "total_column_articles": 390, "frontend_question_id": "1314", "is_new_question": false }, @@ -47346,9 +47850,9 @@ "question__title": "Decompress Run-Length Encoded List", "question__title_slug": "decompress-run-length-encoded-list", "question__hide": false, - "total_acs": 45516, - "total_submitted": 54713, - "total_column_articles": 671, + "total_acs": 45740, + "total_submitted": 54977, + "total_column_articles": 669, "frontend_question_id": "1313", "is_new_question": false }, @@ -47367,9 +47871,9 @@ "question__title": "Stone Game II", "question__title_slug": "stone-game-ii", "question__hide": false, - "total_acs": 26592, - "total_submitted": 37738, - "total_column_articles": 227, + "total_acs": 26696, + "total_submitted": 37933, + "total_column_articles": 228, "frontend_question_id": "1140", "is_new_question": false }, @@ -47388,9 +47892,9 @@ "question__title": "Largest 1-Bordered Square", "question__title_slug": "largest-1-bordered-square", "question__hide": false, - "total_acs": 32713, - "total_submitted": 58242, - "total_column_articles": 380, + "total_acs": 32903, + "total_submitted": 58598, + "total_column_articles": 382, "frontend_question_id": "1139", "is_new_question": false }, @@ -47409,9 +47913,9 @@ "question__title": "Alphabet Board Path", "question__title_slug": "alphabet-board-path", "question__hide": false, - "total_acs": 26707, - "total_submitted": 51552, - "total_column_articles": 444, + "total_acs": 26766, + "total_submitted": 51691, + "total_column_articles": 445, "frontend_question_id": "1138", "is_new_question": false }, @@ -47430,8 +47934,8 @@ "question__title": "Reported Posts II", "question__title_slug": "reported-posts-ii", "question__hide": false, - "total_acs": 9973, - "total_submitted": 26208, + "total_acs": 10062, + "total_submitted": 26480, "total_column_articles": 88, "frontend_question_id": "1132", "is_new_question": false @@ -47451,9 +47955,9 @@ "question__title": "N-th Tribonacci Number", "question__title_slug": "n-th-tribonacci-number", "question__hide": false, - "total_acs": 190776, - "total_submitted": 312666, - "total_column_articles": 1591, + "total_acs": 195437, + "total_submitted": 320521, + "total_column_articles": 1609, "frontend_question_id": "1137", "is_new_question": false }, @@ -47472,8 +47976,8 @@ "question__title": "Number of Paths with Max Score", "question__title_slug": "number-of-paths-with-max-score", "question__hide": false, - "total_acs": 8033, - "total_submitted": 21294, + "total_acs": 8131, + "total_submitted": 21524, "total_column_articles": 157, "frontend_question_id": "1301", "is_new_question": false @@ -47493,9 +47997,9 @@ "question__title": "Number of Ships in a Rectangle", "question__title_slug": "number-of-ships-in-a-rectangle", "question__hide": false, - "total_acs": 1805, - "total_submitted": 2778, - "total_column_articles": 38, + "total_acs": 1827, + "total_submitted": 2816, + "total_column_articles": 39, "frontend_question_id": "1274", "is_new_question": false }, @@ -47514,9 +48018,9 @@ "question__title": "Sum of Mutated Array Closest to Target", "question__title_slug": "sum-of-mutated-array-closest-to-target", "question__hide": false, - "total_acs": 32207, - "total_submitted": 68752, - "total_column_articles": 461, + "total_acs": 32368, + "total_submitted": 69094, + "total_column_articles": 462, "frontend_question_id": "1300", "is_new_question": false }, @@ -47535,8 +48039,8 @@ "question__title": "Replace Elements with Greatest Element on Right Side", "question__title_slug": "replace-elements-with-greatest-element-on-right-side", "question__hide": false, - "total_acs": 43395, - "total_submitted": 57064, + "total_acs": 43683, + "total_submitted": 57515, "total_column_articles": 577, "frontend_question_id": "1299", "is_new_question": false @@ -47556,8 +48060,8 @@ "question__title": "Maximum of Absolute Value Expression", "question__title_slug": "maximum-of-absolute-value-expression", "question__hide": false, - "total_acs": 5102, - "total_submitted": 10641, + "total_acs": 5121, + "total_submitted": 10690, "total_column_articles": 72, "frontend_question_id": "1131", "is_new_question": false @@ -47577,9 +48081,9 @@ "question__title": "Shortest Path with Alternating Colors", "question__title_slug": "shortest-path-with-alternating-colors", "question__hide": false, - "total_acs": 30435, - "total_submitted": 63188, - "total_column_articles": 414, + "total_acs": 30715, + "total_submitted": 63810, + "total_column_articles": 415, "frontend_question_id": "1129", "is_new_question": false }, @@ -47598,8 +48102,8 @@ "question__title": "Minimum Cost Tree From Leaf Values", "question__title_slug": "minimum-cost-tree-from-leaf-values", "question__hide": false, - "total_acs": 21801, - "total_submitted": 30847, + "total_acs": 21863, + "total_submitted": 30946, "total_column_articles": 257, "frontend_question_id": "1130", "is_new_question": false @@ -47619,8 +48123,8 @@ "question__title": "Number of Equivalent Domino Pairs", "question__title_slug": "number-of-equivalent-domino-pairs", "question__hide": false, - "total_acs": 45928, - "total_submitted": 84537, + "total_acs": 46127, + "total_submitted": 84887, "total_column_articles": 561, "frontend_question_id": "1128", "is_new_question": false @@ -47640,9 +48144,9 @@ "question__title": "User Purchase Platform", "question__title_slug": "user-purchase-platform", "question__hide": false, - "total_acs": 8634, - "total_submitted": 20083, - "total_column_articles": 119, + "total_acs": 8710, + "total_submitted": 20265, + "total_column_articles": 120, "frontend_question_id": "1127", "is_new_question": false }, @@ -47661,9 +48165,9 @@ "question__title": "Active Businesses", "question__title_slug": "active-businesses", "question__hide": false, - "total_acs": 14905, - "total_submitted": 22088, - "total_column_articles": 159, + "total_acs": 15004, + "total_submitted": 22259, + "total_column_articles": 160, "frontend_question_id": "1126", "is_new_question": false }, @@ -47682,8 +48186,8 @@ "question__title": "Minimum Falling Path Sum II", "question__title_slug": "minimum-falling-path-sum-ii", "question__hide": false, - "total_acs": 36763, - "total_submitted": 59902, + "total_acs": 36979, + "total_submitted": 60281, "total_column_articles": 341, "frontend_question_id": "1289", "is_new_question": false @@ -47703,8 +48207,8 @@ "question__title": "Graph Connectivity With Threshold", "question__title_slug": "graph-connectivity-with-threshold", "question__hide": false, - "total_acs": 4485, - "total_submitted": 10459, + "total_acs": 4508, + "total_submitted": 10520, "total_column_articles": 67, "frontend_question_id": "1627", "is_new_question": false @@ -47724,9 +48228,9 @@ "question__title": "Remove Covered Intervals", "question__title_slug": "remove-covered-intervals", "question__hide": false, - "total_acs": 30775, - "total_submitted": 54858, - "total_column_articles": 301, + "total_acs": 31056, + "total_submitted": 55348, + "total_column_articles": 302, "frontend_question_id": "1288", "is_new_question": false }, @@ -47745,9 +48249,9 @@ "question__title": "Element Appearing More Than 25% In Sorted Array", "question__title_slug": "element-appearing-more-than-25-in-sorted-array", "question__hide": false, - "total_acs": 27381, - "total_submitted": 46913, - "total_column_articles": 368, + "total_acs": 27707, + "total_submitted": 47519, + "total_column_articles": 370, "frontend_question_id": "1287", "is_new_question": false }, @@ -47766,8 +48270,8 @@ "question__title": "Smallest Sufficient Team", "question__title_slug": "smallest-sufficient-team", "question__hide": false, - "total_acs": 16953, - "total_submitted": 27978, + "total_acs": 17019, + "total_submitted": 28106, "total_column_articles": 156, "frontend_question_id": "1125", "is_new_question": false @@ -47787,9 +48291,9 @@ "question__title": "Longest Well-Performing Interval", "question__title_slug": "longest-well-performing-interval", "question__hide": false, - "total_acs": 45475, - "total_submitted": 114696, - "total_column_articles": 387, + "total_acs": 45806, + "total_submitted": 115341, + "total_column_articles": 388, "frontend_question_id": "1124", "is_new_question": false }, @@ -47808,9 +48312,9 @@ "question__title": "Lowest Common Ancestor of Deepest Leaves", "question__title_slug": "lowest-common-ancestor-of-deepest-leaves", "question__hide": false, - "total_acs": 33939, - "total_submitted": 44264, - "total_column_articles": 305, + "total_acs": 34173, + "total_submitted": 44552, + "total_column_articles": 308, "frontend_question_id": "1123", "is_new_question": false }, @@ -47829,9 +48333,9 @@ "question__title": "Relative Sort Array", "question__title_slug": "relative-sort-array", "question__hide": false, - "total_acs": 92883, - "total_submitted": 131481, - "total_column_articles": 1169, + "total_acs": 93500, + "total_submitted": 132258, + "total_column_articles": 1178, "frontend_question_id": "1122", "is_new_question": false }, @@ -47850,9 +48354,9 @@ "question__title": "Print Zero Even Odd", "question__title_slug": "print-zero-even-odd", "question__hide": false, - "total_acs": 37376, - "total_submitted": 67765, - "total_column_articles": 498, + "total_acs": 37758, + "total_submitted": 68402, + "total_column_articles": 499, "frontend_question_id": "1116", "is_new_question": false }, @@ -47871,9 +48375,9 @@ "question__title": "Reported Posts", "question__title_slug": "reported-posts", "question__hide": false, - "total_acs": 13519, - "total_submitted": 25121, - "total_column_articles": 77, + "total_acs": 13626, + "total_submitted": 25300, + "total_column_articles": 79, "frontend_question_id": "1113", "is_new_question": false }, @@ -47892,9 +48396,9 @@ "question__title": "Highest Grade For Each Student", "question__title_slug": "highest-grade-for-each-student", "question__hide": false, - "total_acs": 22932, - "total_submitted": 35542, - "total_column_articles": 189, + "total_acs": 23557, + "total_submitted": 36570, + "total_column_articles": 192, "frontend_question_id": "1112", "is_new_question": false }, @@ -47913,9 +48417,9 @@ "question__title": "Handshakes That Don't Cross", "question__title_slug": "handshakes-that-dont-cross", "question__hide": false, - "total_acs": 4251, - "total_submitted": 7940, - "total_column_articles": 76, + "total_acs": 4317, + "total_submitted": 8058, + "total_column_articles": 77, "frontend_question_id": "1259", "is_new_question": false }, @@ -47934,8 +48438,8 @@ "question__title": "Sequential Digits", "question__title_slug": "sequential-digits", "question__hide": false, - "total_acs": 11709, - "total_submitted": 21521, + "total_acs": 11830, + "total_submitted": 21728, "total_column_articles": 228, "frontend_question_id": "1291", "is_new_question": false @@ -47955,9 +48459,9 @@ "question__title": "Iterator for Combination", "question__title_slug": "iterator-for-combination", "question__hide": false, - "total_acs": 7613, - "total_submitted": 11612, - "total_column_articles": 149, + "total_acs": 7680, + "total_submitted": 11702, + "total_column_articles": 151, "frontend_question_id": "1286", "is_new_question": false }, @@ -47976,8 +48480,8 @@ "question__title": "Mean of Array After Removing Some Elements", "question__title_slug": "mean-of-array-after-removing-some-elements", "question__hide": false, - "total_acs": 46566, - "total_submitted": 64798, + "total_acs": 46861, + "total_submitted": 65204, "total_column_articles": 461, "frontend_question_id": "1619", "is_new_question": false @@ -47997,8 +48501,8 @@ "question__title": "Design Bounded Blocking Queue", "question__title_slug": "design-bounded-blocking-queue", "question__hide": false, - "total_acs": 5801, - "total_submitted": 8200, + "total_acs": 5862, + "total_submitted": 8285, "total_column_articles": 93, "frontend_question_id": "1188", "is_new_question": false @@ -48018,9 +48522,9 @@ "question__title": "Maximum Nesting Depth of Two Valid Parentheses Strings", "question__title_slug": "maximum-nesting-depth-of-two-valid-parentheses-strings", "question__hide": false, - "total_acs": 28483, - "total_submitted": 37040, - "total_column_articles": 449, + "total_acs": 28549, + "total_submitted": 37151, + "total_column_articles": 447, "frontend_question_id": "1111", "is_new_question": false }, @@ -48039,9 +48543,9 @@ "question__title": "Delete Nodes And Return Forest", "question__title_slug": "delete-nodes-and-return-forest", "question__hide": false, - "total_acs": 38843, - "total_submitted": 55962, - "total_column_articles": 531, + "total_acs": 39243, + "total_submitted": 56517, + "total_column_articles": 533, "frontend_question_id": "1110", "is_new_question": false }, @@ -48060,9 +48564,9 @@ "question__title": "Corporate Flight Bookings", "question__title_slug": "corporate-flight-bookings", "question__hide": false, - "total_acs": 121996, - "total_submitted": 189397, - "total_column_articles": 1719, + "total_acs": 123198, + "total_submitted": 190984, + "total_column_articles": 1723, "frontend_question_id": "1109", "is_new_question": false }, @@ -48081,9 +48585,9 @@ "question__title": "Defanging an IP Address", "question__title_slug": "defanging-an-ip-address", "question__hide": false, - "total_acs": 118877, - "total_submitted": 139595, - "total_column_articles": 1043, + "total_acs": 119681, + "total_submitted": 140577, + "total_column_articles": 1042, "frontend_question_id": "1108", "is_new_question": false }, @@ -48102,9 +48606,9 @@ "question__title": "New Users Daily Count", "question__title_slug": "new-users-daily-count", "question__hide": false, - "total_acs": 14100, - "total_submitted": 34568, - "total_column_articles": 143, + "total_acs": 14217, + "total_submitted": 34868, + "total_column_articles": 144, "frontend_question_id": "1107", "is_new_question": false }, @@ -48123,9 +48627,9 @@ "question__title": "Print in Order", "question__title_slug": "print-in-order", "question__hide": false, - "total_acs": 120350, - "total_submitted": 183912, - "total_column_articles": 778, + "total_acs": 121286, + "total_submitted": 185287, + "total_column_articles": 782, "frontend_question_id": "1114", "is_new_question": false }, @@ -48144,8 +48648,8 @@ "question__title": "Palindrome Removal", "question__title_slug": "palindrome-removal", "question__hide": false, - "total_acs": 4099, - "total_submitted": 8152, + "total_acs": 4108, + "total_submitted": 8186, "total_column_articles": 62, "frontend_question_id": "1246", "is_new_question": false @@ -48165,9 +48669,9 @@ "question__title": "Delete Tree Nodes", "question__title_slug": "delete-tree-nodes", "question__hide": false, - "total_acs": 2696, - "total_submitted": 4708, - "total_column_articles": 70, + "total_acs": 2717, + "total_submitted": 4735, + "total_column_articles": 71, "frontend_question_id": "1273", "is_new_question": false }, @@ -48186,9 +48690,9 @@ "question__title": "Remove Interval", "question__title_slug": "remove-interval", "question__hide": false, - "total_acs": 4013, - "total_submitted": 6884, - "total_column_articles": 66, + "total_acs": 4100, + "total_submitted": 7007, + "total_column_articles": 68, "frontend_question_id": "1272", "is_new_question": false }, @@ -48207,8 +48711,8 @@ "question__title": "Hexspeak", "question__title_slug": "hexspeak", "question__hide": false, - "total_acs": 3416, - "total_submitted": 6503, + "total_acs": 3440, + "total_submitted": 6536, "total_column_articles": 70, "frontend_question_id": "1271", "is_new_question": false @@ -48228,9 +48732,9 @@ "question__title": "Unpopular Books", "question__title_slug": "unpopular-books", "question__hide": false, - "total_acs": 14723, - "total_submitted": 31576, - "total_column_articles": 146, + "total_acs": 14831, + "total_submitted": 31846, + "total_column_articles": 147, "frontend_question_id": "1098", "is_new_question": false }, @@ -48249,8 +48753,8 @@ "question__title": "Parsing A Boolean Expression", "question__title_slug": "parsing-a-boolean-expression", "question__hide": false, - "total_acs": 27526, - "total_submitted": 40184, + "total_acs": 27564, + "total_submitted": 40245, "total_column_articles": 576, "frontend_question_id": "1106", "is_new_question": false @@ -48270,8 +48774,8 @@ "question__title": "Filling Bookcase Shelves", "question__title_slug": "filling-bookcase-shelves", "question__hide": false, - "total_acs": 22477, - "total_submitted": 33391, + "total_acs": 22599, + "total_submitted": 33540, "total_column_articles": 210, "frontend_question_id": "1105", "is_new_question": false @@ -48291,9 +48795,9 @@ "question__title": "Distribute Candies to People", "question__title_slug": "distribute-candies-to-people", "question__hide": false, - "total_acs": 46724, - "total_submitted": 73009, - "total_column_articles": 1256, + "total_acs": 47002, + "total_submitted": 73384, + "total_column_articles": 1258, "frontend_question_id": "1103", "is_new_question": false }, @@ -48312,9 +48816,9 @@ "question__title": "Path In Zigzag Labelled Binary Tree", "question__title_slug": "path-in-zigzag-labelled-binary-tree", "question__hide": false, - "total_acs": 33940, - "total_submitted": 44762, - "total_column_articles": 794, + "total_acs": 34026, + "total_submitted": 44893, + "total_column_articles": 792, "frontend_question_id": "1104", "is_new_question": false }, @@ -48333,9 +48837,9 @@ "question__title": "Game Play Analysis V", "question__title_slug": "game-play-analysis-v", "question__hide": false, - "total_acs": 12735, - "total_submitted": 24592, - "total_column_articles": 183, + "total_acs": 12860, + "total_submitted": 24854, + "total_column_articles": 187, "frontend_question_id": "1097", "is_new_question": false }, @@ -48354,8 +48858,8 @@ "question__title": "Divide Chocolate", "question__title_slug": "divide-chocolate", "question__hide": false, - "total_acs": 7992, - "total_submitted": 13439, + "total_acs": 8044, + "total_submitted": 13507, "total_column_articles": 105, "frontend_question_id": "1231", "is_new_question": false @@ -48375,8 +48879,8 @@ "question__title": "Synonymous Sentences", "question__title_slug": "synonymous-sentences", "question__hide": false, - "total_acs": 2209, - "total_submitted": 3730, + "total_acs": 2222, + "total_submitted": 3760, "total_column_articles": 78, "frontend_question_id": "1258", "is_new_question": false @@ -48396,8 +48900,8 @@ "question__title": "Smallest Common Region", "question__title_slug": "smallest-common-region", "question__hide": false, - "total_acs": 2920, - "total_submitted": 4860, + "total_acs": 2947, + "total_submitted": 4911, "total_column_articles": 72, "frontend_question_id": "1257", "is_new_question": false @@ -48417,8 +48921,8 @@ "question__title": "Encode Number", "question__title_slug": "encode-number", "question__hide": false, - "total_acs": 2183, - "total_submitted": 3157, + "total_acs": 2194, + "total_submitted": 3191, "total_column_articles": 56, "frontend_question_id": "1256", "is_new_question": false @@ -48438,8 +48942,8 @@ "question__title": "Brace Expansion II", "question__title_slug": "brace-expansion-ii", "question__hide": false, - "total_acs": 15531, - "total_submitted": 21200, + "total_acs": 15562, + "total_submitted": 21262, "total_column_articles": 157, "frontend_question_id": "1096", "is_new_question": false @@ -48459,9 +48963,9 @@ "question__title": "Print FooBar Alternately", "question__title_slug": "print-foobar-alternately", "question__hide": false, - "total_acs": 71181, - "total_submitted": 123293, - "total_column_articles": 634, + "total_acs": 71856, + "total_submitted": 124305, + "total_column_articles": 639, "frontend_question_id": "1115", "is_new_question": false }, @@ -48480,8 +48984,8 @@ "question__title": "Building H2O", "question__title_slug": "building-h2o", "question__hide": false, - "total_acs": 28912, - "total_submitted": 53019, + "total_acs": 29129, + "total_submitted": 53398, "total_column_articles": 358, "frontend_question_id": "1117", "is_new_question": false @@ -48501,8 +49005,8 @@ "question__title": "Find in Mountain Array", "question__title_slug": "find-in-mountain-array", "question__hide": false, - "total_acs": 28488, - "total_submitted": 75339, + "total_acs": 28659, + "total_submitted": 75781, "total_column_articles": 481, "frontend_question_id": "1095", "is_new_question": false @@ -48522,9 +49026,9 @@ "question__title": "Car Pooling", "question__title_slug": "car-pooling", "question__hide": false, - "total_acs": 104163, - "total_submitted": 195447, - "total_column_articles": 1632, + "total_acs": 105422, + "total_submitted": 198098, + "total_column_articles": 1637, "frontend_question_id": "1094", "is_new_question": false }, @@ -48543,9 +49047,9 @@ "question__title": "Statistics from a Large Sample", "question__title_slug": "statistics-from-a-large-sample", "question__hide": false, - "total_acs": 17752, - "total_submitted": 42483, - "total_column_articles": 211, + "total_acs": 17791, + "total_submitted": 42609, + "total_column_articles": 212, "frontend_question_id": "1093", "is_new_question": false }, @@ -48564,9 +49068,9 @@ "question__title": "Game Play Analysis IV", "question__title_slug": "game-play-analysis-iv", "question__hide": false, - "total_acs": 50319, - "total_submitted": 121440, - "total_column_articles": 482, + "total_acs": 52546, + "total_submitted": 127003, + "total_column_articles": 499, "frontend_question_id": "550", "is_new_question": false }, @@ -48585,9 +49089,9 @@ "question__title": "Game Play Analysis III", "question__title_slug": "game-play-analysis-iii", "question__hide": false, - "total_acs": 32212, - "total_submitted": 46355, - "total_column_articles": 224, + "total_acs": 32658, + "total_submitted": 46956, + "total_column_articles": 225, "frontend_question_id": "534", "is_new_question": false }, @@ -48606,8 +49110,8 @@ "question__title": "Game Play Analysis II", "question__title_slug": "game-play-analysis-ii", "question__hide": false, - "total_acs": 39125, - "total_submitted": 72165, + "total_acs": 39557, + "total_submitted": 72973, "total_column_articles": 249, "frontend_question_id": "512", "is_new_question": false @@ -48627,9 +49131,9 @@ "question__title": "Game Play Analysis I", "question__title_slug": "game-play-analysis-i", "question__hide": false, - "total_acs": 110829, - "total_submitted": 156452, - "total_column_articles": 449, + "total_acs": 113008, + "total_submitted": 159504, + "total_column_articles": 455, "frontend_question_id": "511", "is_new_question": false }, @@ -48648,8 +49152,8 @@ "question__title": "Valid Palindrome III", "question__title_slug": "valid-palindrome-iii", "question__hide": false, - "total_acs": 3154, - "total_submitted": 5462, + "total_acs": 3180, + "total_submitted": 5525, "total_column_articles": 58, "frontend_question_id": "1216", "is_new_question": false @@ -48669,9 +49173,9 @@ "question__title": "Tree Diameter", "question__title_slug": "tree-diameter", "question__hide": false, - "total_acs": 6839, - "total_submitted": 12443, - "total_column_articles": 121, + "total_acs": 6912, + "total_submitted": 12581, + "total_column_articles": 122, "frontend_question_id": "1245", "is_new_question": false }, @@ -48690,9 +49194,9 @@ "question__title": "Design A Leaderboard", "question__title_slug": "design-a-leaderboard", "question__hide": false, - "total_acs": 4803, - "total_submitted": 7543, - "total_column_articles": 72, + "total_acs": 4851, + "total_submitted": 7608, + "total_column_articles": 73, "frontend_question_id": "1244", "is_new_question": false }, @@ -48711,9 +49215,9 @@ "question__title": "Array Transformation", "question__title_slug": "array-transformation", "question__hide": false, - "total_acs": 3775, - "total_submitted": 6981, - "total_column_articles": 89, + "total_acs": 3803, + "total_submitted": 7032, + "total_column_articles": 90, "frontend_question_id": "1243", "is_new_question": false }, @@ -48732,9 +49236,9 @@ "question__title": "Sales Analysis III", "question__title_slug": "sales-analysis-iii", "question__hide": false, - "total_acs": 67974, - "total_submitted": 131613, - "total_column_articles": 482, + "total_acs": 70192, + "total_submitted": 135841, + "total_column_articles": 490, "frontend_question_id": "1084", "is_new_question": false }, @@ -48753,9 +49257,9 @@ "question__title": "Sales Analysis II", "question__title_slug": "sales-analysis-ii", "question__hide": false, - "total_acs": 19492, - "total_submitted": 36793, - "total_column_articles": 164, + "total_acs": 19634, + "total_submitted": 37073, + "total_column_articles": 166, "frontend_question_id": "1083", "is_new_question": false }, @@ -48774,9 +49278,9 @@ "question__title": "Sales Analysis I", "question__title_slug": "sales-analysis-i", "question__hide": false, - "total_acs": 20590, - "total_submitted": 26906, - "total_column_articles": 141, + "total_acs": 20710, + "total_submitted": 27074, + "total_column_articles": 142, "frontend_question_id": "1082", "is_new_question": false }, @@ -48795,9 +49299,9 @@ "question__title": "Shortest Path in Binary Matrix", "question__title_slug": "shortest-path-in-binary-matrix", "question__hide": false, - "total_acs": 81748, - "total_submitted": 201742, - "total_column_articles": 745, + "total_acs": 82236, + "total_submitted": 202709, + "total_column_articles": 743, "frontend_question_id": "1091", "is_new_question": false }, @@ -48816,8 +49320,8 @@ "question__title": "Shortest Common Supersequence ", "question__title_slug": "shortest-common-supersequence", "question__hide": false, - "total_acs": 18846, - "total_submitted": 32382, + "total_acs": 18972, + "total_submitted": 32611, "total_column_articles": 176, "frontend_question_id": "1092", "is_new_question": false @@ -48837,9 +49341,9 @@ "question__title": "Largest Values From Labels", "question__title_slug": "largest-values-from-labels", "question__hide": false, - "total_acs": 24327, - "total_submitted": 36312, - "total_column_articles": 328, + "total_acs": 24522, + "total_submitted": 36586, + "total_column_articles": 331, "frontend_question_id": "1090", "is_new_question": false }, @@ -48858,9 +49362,9 @@ "question__title": "Duplicate Zeros", "question__title_slug": "duplicate-zeros", "question__hide": false, - "total_acs": 63920, - "total_submitted": 110228, - "total_column_articles": 815, + "total_acs": 64773, + "total_submitted": 112639, + "total_column_articles": 821, "frontend_question_id": "1089", "is_new_question": false }, @@ -48879,8 +49383,8 @@ "question__title": "Minimum Time to Build Blocks", "question__title_slug": "minimum-time-to-build-blocks", "question__hide": false, - "total_acs": 1180, - "total_submitted": 2493, + "total_acs": 1186, + "total_submitted": 2521, "total_column_articles": 33, "frontend_question_id": "1199", "is_new_question": false @@ -48900,8 +49404,8 @@ "question__title": "Toss Strange Coins", "question__title_slug": "toss-strange-coins", "question__hide": false, - "total_acs": 6957, - "total_submitted": 12643, + "total_acs": 7029, + "total_submitted": 12754, "total_column_articles": 120, "frontend_question_id": "1230", "is_new_question": false @@ -48921,8 +49425,8 @@ "question__title": "Meeting Scheduler", "question__title_slug": "meeting-scheduler", "question__hide": false, - "total_acs": 6678, - "total_submitted": 14255, + "total_acs": 6707, + "total_submitted": 14322, "total_column_articles": 125, "frontend_question_id": "1229", "is_new_question": false @@ -48942,9 +49446,9 @@ "question__title": "Missing Number In Arithmetic Progression", "question__title_slug": "missing-number-in-arithmetic-progression", "question__hide": false, - "total_acs": 5343, - "total_submitted": 9836, - "total_column_articles": 93, + "total_acs": 5423, + "total_submitted": 9979, + "total_column_articles": 94, "frontend_question_id": "1228", "is_new_question": false }, @@ -48963,9 +49467,9 @@ "question__title": "Project Employees III", "question__title_slug": "project-employees-iii", "question__hide": false, - "total_acs": 19678, - "total_submitted": 27380, - "total_column_articles": 165, + "total_acs": 20030, + "total_submitted": 27913, + "total_column_articles": 168, "frontend_question_id": "1077", "is_new_question": false }, @@ -48984,9 +49488,9 @@ "question__title": "Project Employees II", "question__title_slug": "project-employees-ii", "question__hide": false, - "total_acs": 19639, - "total_submitted": 39788, - "total_column_articles": 139, + "total_acs": 19792, + "total_submitted": 40105, + "total_column_articles": 140, "frontend_question_id": "1076", "is_new_question": false }, @@ -49005,9 +49509,9 @@ "question__title": "Project Employees I", "question__title_slug": "project-employees-i", "question__hide": false, - "total_acs": 41501, - "total_submitted": 64188, - "total_column_articles": 210, + "total_acs": 44170, + "total_submitted": 69470, + "total_column_articles": 219, "frontend_question_id": "1075", "is_new_question": false }, @@ -49026,9 +49530,9 @@ "question__title": "Letter Tile Possibilities", "question__title_slug": "letter-tile-possibilities", "question__hide": false, - "total_acs": 33980, - "total_submitted": 42933, - "total_column_articles": 410, + "total_acs": 34112, + "total_submitted": 43117, + "total_column_articles": 412, "frontend_question_id": "1079", "is_new_question": false }, @@ -49047,9 +49551,9 @@ "question__title": "Smallest Subsequence of Distinct Characters", "question__title_slug": "smallest-subsequence-of-distinct-characters", "question__hide": false, - "total_acs": 29042, - "total_submitted": 49356, - "total_column_articles": 253, + "total_acs": 29346, + "total_submitted": 49783, + "total_column_articles": 254, "frontend_question_id": "1081", "is_new_question": false }, @@ -49068,9 +49572,9 @@ "question__title": "Insufficient Nodes in Root to Leaf Paths", "question__title_slug": "insufficient-nodes-in-root-to-leaf-paths", "question__hide": false, - "total_acs": 24353, - "total_submitted": 39299, - "total_column_articles": 281, + "total_acs": 24575, + "total_submitted": 39606, + "total_column_articles": 282, "frontend_question_id": "1080", "is_new_question": false }, @@ -49089,8 +49593,8 @@ "question__title": "Occurrences After Bigram", "question__title_slug": "occurrences-after-bigram", "question__hide": false, - "total_acs": 39332, - "total_submitted": 60406, + "total_acs": 39504, + "total_submitted": 60654, "total_column_articles": 536, "frontend_question_id": "1078", "is_new_question": false @@ -49110,9 +49614,9 @@ "question__title": "Product Sales Analysis III", "question__title_slug": "product-sales-analysis-iii", "question__hide": false, - "total_acs": 22252, - "total_submitted": 47391, - "total_column_articles": 146, + "total_acs": 22912, + "total_submitted": 48802, + "total_column_articles": 150, "frontend_question_id": "1070", "is_new_question": false }, @@ -49131,9 +49635,9 @@ "question__title": "Product Sales Analysis II", "question__title_slug": "product-sales-analysis-ii", "question__hide": false, - "total_acs": 19725, - "total_submitted": 24042, - "total_column_articles": 88, + "total_acs": 19862, + "total_submitted": 24199, + "total_column_articles": 89, "frontend_question_id": "1069", "is_new_question": false }, @@ -49152,9 +49656,9 @@ "question__title": "Product Sales Analysis I", "question__title_slug": "product-sales-analysis-i", "question__hide": false, - "total_acs": 63226, - "total_submitted": 72419, - "total_column_articles": 172, + "total_acs": 67886, + "total_submitted": 77808, + "total_column_articles": 183, "frontend_question_id": "1068", "is_new_question": false }, @@ -49173,9 +49677,9 @@ "question__title": "Maximum Number of Ones", "question__title_slug": "maximum-number-of-ones", "question__hide": false, - "total_acs": 1230, - "total_submitted": 1945, - "total_column_articles": 31, + "total_acs": 1251, + "total_submitted": 1986, + "total_column_articles": 32, "frontend_question_id": "1183", "is_new_question": false }, @@ -49194,8 +49698,8 @@ "question__title": "Stepping Numbers", "question__title_slug": "stepping-numbers", "question__hide": false, - "total_acs": 2751, - "total_submitted": 6233, + "total_acs": 2770, + "total_submitted": 6266, "total_column_articles": 57, "frontend_question_id": "1215", "is_new_question": false @@ -49215,8 +49719,8 @@ "question__title": "Two Sum BSTs", "question__title_slug": "two-sum-bsts", "question__hide": false, - "total_acs": 6055, - "total_submitted": 9144, + "total_acs": 6119, + "total_submitted": 9256, "total_column_articles": 108, "frontend_question_id": "1214", "is_new_question": false @@ -49236,8 +49740,8 @@ "question__title": "Intersection of Three Sorted Arrays", "question__title_slug": "intersection-of-three-sorted-arrays", "question__hide": false, - "total_acs": 9207, - "total_submitted": 11757, + "total_acs": 9238, + "total_submitted": 11795, "total_column_articles": 188, "frontend_question_id": "1213", "is_new_question": false @@ -49257,8 +49761,8 @@ "question__title": "Adding Two Negabinary Numbers", "question__title_slug": "adding-two-negabinary-numbers", "question__hide": false, - "total_acs": 17079, - "total_submitted": 41198, + "total_acs": 17168, + "total_submitted": 41485, "total_column_articles": 197, "frontend_question_id": "1073", "is_new_question": false @@ -49278,8 +49782,8 @@ "question__title": "Flip Columns For Maximum Number of Equal Rows", "question__title_slug": "flip-columns-for-maximum-number-of-equal-rows", "question__hide": false, - "total_acs": 21992, - "total_submitted": 30790, + "total_acs": 22046, + "total_submitted": 30878, "total_column_articles": 212, "frontend_question_id": "1072", "is_new_question": false @@ -49299,9 +49803,9 @@ "question__title": "Greatest Common Divisor of Strings", "question__title_slug": "greatest-common-divisor-of-strings", "question__hide": false, - "total_acs": 72238, - "total_submitted": 124138, - "total_column_articles": 930, + "total_acs": 74070, + "total_submitted": 127227, + "total_column_articles": 935, "frontend_question_id": "1071", "is_new_question": false }, @@ -49320,8 +49824,8 @@ "question__title": "Number of Submatrices That Sum to Target", "question__title_slug": "number-of-submatrices-that-sum-to-target", "question__hide": false, - "total_acs": 22743, - "total_submitted": 33622, + "total_acs": 22814, + "total_submitted": 33722, "total_column_articles": 223, "frontend_question_id": "1074", "is_new_question": false @@ -49341,9 +49845,9 @@ "question__title": "Optimize Water Distribution in a Village", "question__title_slug": "optimize-water-distribution-in-a-village", "question__hide": false, - "total_acs": 3256, - "total_submitted": 5211, - "total_column_articles": 60, + "total_acs": 3345, + "total_submitted": 5319, + "total_column_articles": 61, "frontend_question_id": "1168", "is_new_question": false }, @@ -49362,9 +49866,9 @@ "question__title": "Find Smallest Common Element in All Rows", "question__title_slug": "find-smallest-common-element-in-all-rows", "question__hide": false, - "total_acs": 7798, - "total_submitted": 10480, - "total_column_articles": 107, + "total_acs": 7949, + "total_submitted": 10666, + "total_column_articles": 108, "frontend_question_id": "1198", "is_new_question": false }, @@ -49383,8 +49887,8 @@ "question__title": "Minimum Knight Moves", "question__title_slug": "minimum-knight-moves", "question__hide": false, - "total_acs": 8380, - "total_submitted": 21110, + "total_acs": 8452, + "total_submitted": 21257, "total_column_articles": 89, "frontend_question_id": "1197", "is_new_question": false @@ -49404,8 +49908,8 @@ "question__title": "How Many Apples Can You Put into the Basket", "question__title_slug": "how-many-apples-can-you-put-into-the-basket", "question__hide": false, - "total_acs": 5266, - "total_submitted": 7689, + "total_acs": 5317, + "total_submitted": 7761, "total_column_articles": 87, "frontend_question_id": "1196", "is_new_question": false @@ -49425,8 +49929,8 @@ "question__title": "Distant Barcodes", "question__title_slug": "distant-barcodes", "question__hide": false, - "total_acs": 26979, - "total_submitted": 59987, + "total_acs": 27095, + "total_submitted": 60212, "total_column_articles": 320, "frontend_question_id": "1054", "is_new_question": false @@ -49446,8 +49950,8 @@ "question__title": "Previous Permutation With One Swap", "question__title_slug": "previous-permutation-with-one-swap", "question__hide": false, - "total_acs": 28628, - "total_submitted": 59179, + "total_acs": 28695, + "total_submitted": 59310, "total_column_articles": 311, "frontend_question_id": "1053", "is_new_question": false @@ -49467,9 +49971,9 @@ "question__title": "Grumpy Bookstore Owner", "question__title_slug": "grumpy-bookstore-owner", "question__hide": false, - "total_acs": 66292, - "total_submitted": 113976, - "total_column_articles": 940, + "total_acs": 66741, + "total_submitted": 114718, + "total_column_articles": 941, "frontend_question_id": "1052", "is_new_question": false }, @@ -49488,9 +49992,9 @@ "question__title": "Height Checker", "question__title_slug": "height-checker", "question__hide": false, - "total_acs": 73043, - "total_submitted": 91191, - "total_column_articles": 709, + "total_acs": 73431, + "total_submitted": 91637, + "total_column_articles": 712, "frontend_question_id": "1051", "is_new_question": false }, @@ -49509,9 +50013,9 @@ "question__title": "Actors and Directors Who Cooperated At Least Three Times", "question__title_slug": "actors-and-directors-who-cooperated-at-least-three-times", "question__hide": false, - "total_acs": 66087, - "total_submitted": 86712, - "total_column_articles": 253, + "total_acs": 67407, + "total_submitted": 88434, + "total_column_articles": 264, "frontend_question_id": "1050", "is_new_question": false }, @@ -49530,9 +50034,9 @@ "question__title": "Customers Who Bought All Products", "question__title_slug": "customers-who-bought-all-products", "question__hide": false, - "total_acs": 37958, - "total_submitted": 63524, - "total_column_articles": 301, + "total_acs": 40000, + "total_submitted": 66760, + "total_column_articles": 312, "frontend_question_id": "1045", "is_new_question": false }, @@ -49551,8 +50055,8 @@ "question__title": "Shortest Distance to Target Color", "question__title_slug": "shortest-distance-to-target-color", "question__hide": false, - "total_acs": 5698, - "total_submitted": 11872, + "total_acs": 5707, + "total_submitted": 11900, "total_column_articles": 100, "frontend_question_id": "1182", "is_new_question": false @@ -49572,9 +50076,9 @@ "question__title": "Last Substring in Lexicographical Order", "question__title_slug": "last-substring-in-lexicographical-order", "question__hide": false, - "total_acs": 23158, - "total_submitted": 65977, - "total_column_articles": 242, + "total_acs": 23278, + "total_submitted": 66354, + "total_column_articles": 243, "frontend_question_id": "1163", "is_new_question": false }, @@ -49593,8 +50097,8 @@ "question__title": "Before and After Puzzle", "question__title_slug": "before-and-after-puzzle", "question__hide": false, - "total_acs": 2025, - "total_submitted": 5059, + "total_acs": 2037, + "total_submitted": 5086, "total_column_articles": 38, "frontend_question_id": "1181", "is_new_question": false @@ -49614,8 +50118,8 @@ "question__title": "Count Substrings with Only One Distinct Letter", "question__title_slug": "count-substrings-with-only-one-distinct-letter", "question__hide": false, - "total_acs": 5176, - "total_submitted": 6558, + "total_acs": 5245, + "total_submitted": 6640, "total_column_articles": 112, "frontend_question_id": "1180", "is_new_question": false @@ -49635,9 +50139,9 @@ "question__title": "Last Stone Weight II", "question__title_slug": "last-stone-weight-ii", "question__hide": false, - "total_acs": 159425, - "total_submitted": 227745, - "total_column_articles": 949, + "total_acs": 165309, + "total_submitted": 235709, + "total_column_articles": 965, "frontend_question_id": "1049", "is_new_question": false }, @@ -49656,9 +50160,9 @@ "question__title": "Longest String Chain", "question__title_slug": "longest-string-chain", "question__hide": false, - "total_acs": 37386, - "total_submitted": 66385, - "total_column_articles": 410, + "total_acs": 37645, + "total_submitted": 66765, + "total_column_articles": 412, "frontend_question_id": "1048", "is_new_question": false }, @@ -49677,9 +50181,9 @@ "question__title": "Remove All Adjacent Duplicates In String", "question__title_slug": "remove-all-adjacent-duplicates-in-string", "question__hide": false, - "total_acs": 285741, - "total_submitted": 395074, - "total_column_articles": 1796, + "total_acs": 294119, + "total_submitted": 406573, + "total_column_articles": 1827, "frontend_question_id": "1047", "is_new_question": false }, @@ -49698,9 +50202,9 @@ "question__title": "Last Stone Weight", "question__title_slug": "last-stone-weight", "question__hide": false, - "total_acs": 100074, - "total_submitted": 153380, - "total_column_articles": 1279, + "total_acs": 101212, + "total_submitted": 155364, + "total_column_articles": 1286, "frontend_question_id": "1046", "is_new_question": false }, @@ -49719,8 +50223,8 @@ "question__title": "Minimum Cost to Connect Sticks", "question__title_slug": "minimum-cost-to-connect-sticks", "question__hide": false, - "total_acs": 4529, - "total_submitted": 8468, + "total_acs": 4580, + "total_submitted": 8541, "total_column_articles": 61, "frontend_question_id": "1167", "is_new_question": false @@ -49740,8 +50244,8 @@ "question__title": "Design File System", "question__title_slug": "design-file-system", "question__hide": false, - "total_acs": 5130, - "total_submitted": 10164, + "total_acs": 5180, + "total_submitted": 10223, "total_column_articles": 88, "frontend_question_id": "1166", "is_new_question": false @@ -49761,8 +50265,8 @@ "question__title": "String Transforms Into Another String", "question__title_slug": "string-transforms-into-another-string", "question__hide": false, - "total_acs": 2424, - "total_submitted": 6395, + "total_acs": 2437, + "total_submitted": 6437, "total_column_articles": 35, "frontend_question_id": "1153", "is_new_question": false @@ -49782,9 +50286,9 @@ "question__title": "Single-Row Keyboard", "question__title_slug": "single-row-keyboard", "question__hide": false, - "total_acs": 11075, - "total_submitted": 13053, - "total_column_articles": 166, + "total_acs": 11188, + "total_submitted": 13180, + "total_column_articles": 167, "frontend_question_id": "1165", "is_new_question": false }, @@ -49803,8 +50307,8 @@ "question__title": "Longest Duplicate Substring", "question__title_slug": "longest-duplicate-substring", "question__hide": false, - "total_acs": 30240, - "total_submitted": 85050, + "total_acs": 30517, + "total_submitted": 86020, "total_column_articles": 246, "frontend_question_id": "1044", "is_new_question": false @@ -49824,9 +50328,9 @@ "question__title": "Partition Array for Maximum Sum", "question__title_slug": "partition-array-for-maximum-sum", "question__hide": false, - "total_acs": 32969, - "total_submitted": 43760, - "total_column_articles": 314, + "total_acs": 33287, + "total_submitted": 44220, + "total_column_articles": 318, "frontend_question_id": "1043", "is_new_question": false }, @@ -49845,8 +50349,8 @@ "question__title": "Flower Planting With No Adjacent", "question__title_slug": "flower-planting-with-no-adjacent", "question__hide": false, - "total_acs": 32764, - "total_submitted": 53516, + "total_acs": 32882, + "total_submitted": 53689, "total_column_articles": 347, "frontend_question_id": "1042", "is_new_question": false @@ -49866,9 +50370,9 @@ "question__title": "Robot Bounded In Circle", "question__title_slug": "robot-bounded-in-circle", "question__hide": false, - "total_acs": 36694, - "total_submitted": 64764, - "total_column_articles": 500, + "total_acs": 37665, + "total_submitted": 66666, + "total_column_articles": 518, "frontend_question_id": "1041", "is_new_question": false }, @@ -49887,8 +50391,8 @@ "question__title": "Divide Array Into Increasing Sequences", "question__title_slug": "divide-array-into-increasing-sequences", "question__hide": false, - "total_acs": 1709, - "total_submitted": 2786, + "total_acs": 1719, + "total_submitted": 2815, "total_column_articles": 29, "frontend_question_id": "1121", "is_new_question": false @@ -49908,9 +50412,9 @@ "question__title": "As Far from Land as Possible", "question__title_slug": "as-far-from-land-as-possible", "question__hide": false, - "total_acs": 57005, - "total_submitted": 121877, - "total_column_articles": 693, + "total_acs": 57349, + "total_submitted": 122517, + "total_column_articles": 692, "frontend_question_id": "1162", "is_new_question": false }, @@ -49929,9 +50433,9 @@ "question__title": "Maximum Level Sum of a Binary Tree", "question__title_slug": "maximum-level-sum-of-a-binary-tree", "question__hide": false, - "total_acs": 45334, - "total_submitted": 68991, - "total_column_articles": 557, + "total_acs": 46062, + "total_submitted": 70110, + "total_column_articles": 560, "frontend_question_id": "1161", "is_new_question": false }, @@ -49950,9 +50454,9 @@ "question__title": "Valid Boomerang", "question__title_slug": "valid-boomerang", "question__hide": false, - "total_acs": 43008, - "total_submitted": 89043, - "total_column_articles": 433, + "total_acs": 43214, + "total_submitted": 89458, + "total_column_articles": 435, "frontend_question_id": "1037", "is_new_question": false }, @@ -49971,9 +50475,9 @@ "question__title": "Binary Search Tree to Greater Sum Tree", "question__title_slug": "binary-search-tree-to-greater-sum-tree", "question__hide": false, - "total_acs": 66578, - "total_submitted": 79703, - "total_column_articles": 692, + "total_acs": 67125, + "total_submitted": 80345, + "total_column_articles": 690, "frontend_question_id": "1038", "is_new_question": false }, @@ -49992,8 +50496,8 @@ "question__title": "Moving Stones Until Consecutive II", "question__title_slug": "moving-stones-until-consecutive-ii", "question__hide": false, - "total_acs": 14998, - "total_submitted": 22734, + "total_acs": 15026, + "total_submitted": 22787, "total_column_articles": 94, "frontend_question_id": "1040", "is_new_question": false @@ -50013,9 +50517,9 @@ "question__title": "Find Words That Can Be Formed by Characters", "question__title_slug": "find-words-that-can-be-formed-by-characters", "question__hide": false, - "total_acs": 79270, - "total_submitted": 116602, - "total_column_articles": 1088, + "total_acs": 79680, + "total_submitted": 117164, + "total_column_articles": 1091, "frontend_question_id": "1160", "is_new_question": false }, @@ -50034,9 +50538,9 @@ "question__title": "Minimum Score Triangulation of Polygon", "question__title_slug": "minimum-score-triangulation-of-polygon", "question__hide": false, - "total_acs": 24349, - "total_submitted": 37293, - "total_column_articles": 161, + "total_acs": 24746, + "total_submitted": 37826, + "total_column_articles": 162, "frontend_question_id": "1039", "is_new_question": false }, @@ -50055,9 +50559,9 @@ "question__title": "Analyze User Website Visit Pattern", "question__title_slug": "analyze-user-website-visit-pattern", "question__hide": false, - "total_acs": 2907, - "total_submitted": 6916, - "total_column_articles": 60, + "total_acs": 2925, + "total_submitted": 6979, + "total_column_articles": 61, "frontend_question_id": "1152", "is_new_question": false }, @@ -50076,8 +50580,8 @@ "question__title": "Minimum Swaps to Group All 1's Together", "question__title_slug": "minimum-swaps-to-group-all-1s-together", "question__hide": false, - "total_acs": 9862, - "total_submitted": 18535, + "total_acs": 9896, + "total_submitted": 18604, "total_column_articles": 142, "frontend_question_id": "1151", "is_new_question": false @@ -50097,9 +50601,9 @@ "question__title": "Escape a Large Maze", "question__title_slug": "escape-a-large-maze", "question__hide": false, - "total_acs": 21481, - "total_submitted": 46051, - "total_column_articles": 221, + "total_acs": 21531, + "total_submitted": 46188, + "total_column_articles": 222, "frontend_question_id": "1036", "is_new_question": false }, @@ -50118,9 +50622,9 @@ "question__title": "Uncrossed Lines", "question__title_slug": "uncrossed-lines", "question__hide": false, - "total_acs": 98534, - "total_submitted": 137259, - "total_column_articles": 674, + "total_acs": 101816, + "total_submitted": 141354, + "total_column_articles": 688, "frontend_question_id": "1035", "is_new_question": false }, @@ -50139,9 +50643,9 @@ "question__title": "Coloring A Border", "question__title_slug": "coloring-a-border", "question__hide": false, - "total_acs": 35112, - "total_submitted": 63771, - "total_column_articles": 542, + "total_acs": 35277, + "total_submitted": 64114, + "total_column_articles": 546, "frontend_question_id": "1034", "is_new_question": false }, @@ -50160,9 +50664,9 @@ "question__title": "Moving Stones Until Consecutive", "question__title_slug": "moving-stones-until-consecutive", "question__hide": false, - "total_acs": 25787, - "total_submitted": 51814, - "total_column_articles": 307, + "total_acs": 25958, + "total_submitted": 52076, + "total_column_articles": 309, "frontend_question_id": "1033", "is_new_question": false }, @@ -50181,9 +50685,9 @@ "question__title": "Check If a Number Is Majority Element in a Sorted Array", "question__title_slug": "check-if-a-number-is-majority-element-in-a-sorted-array", "question__hide": false, - "total_acs": 8230, - "total_submitted": 13755, - "total_column_articles": 134, + "total_acs": 8316, + "total_submitted": 13892, + "total_column_articles": 136, "frontend_question_id": "1150", "is_new_question": false }, @@ -50202,9 +50706,9 @@ "question__title": "Parallel Courses", "question__title_slug": "parallel-courses", "question__hide": false, - "total_acs": 7284, - "total_submitted": 11972, - "total_column_articles": 107, + "total_acs": 7396, + "total_submitted": 12127, + "total_column_articles": 108, "frontend_question_id": "1136", "is_new_question": false }, @@ -50223,8 +50727,8 @@ "question__title": "Connecting Cities With Minimum Cost", "question__title_slug": "connecting-cities-with-minimum-cost", "question__hide": false, - "total_acs": 14484, - "total_submitted": 24820, + "total_acs": 14642, + "total_submitted": 25040, "total_column_articles": 169, "frontend_question_id": "1135", "is_new_question": false @@ -50244,8 +50748,8 @@ "question__title": "Path With Maximum Minimum Value", "question__title_slug": "path-with-maximum-minimum-value", "question__hide": false, - "total_acs": 9039, - "total_submitted": 22279, + "total_acs": 9071, + "total_submitted": 22348, "total_column_articles": 116, "frontend_question_id": "1102", "is_new_question": false @@ -50265,9 +50769,9 @@ "question__title": "Largest Unique Number", "question__title_slug": "largest-unique-number", "question__hide": false, - "total_acs": 6292, - "total_submitted": 9336, - "total_column_articles": 115, + "total_acs": 6408, + "total_submitted": 9482, + "total_column_articles": 117, "frontend_question_id": "1133", "is_new_question": false }, @@ -50286,9 +50790,9 @@ "question__title": "Stream of Characters", "question__title_slug": "stream-of-characters", "question__hide": false, - "total_acs": 19924, - "total_submitted": 35076, - "total_column_articles": 265, + "total_acs": 19988, + "total_submitted": 35199, + "total_column_articles": 266, "frontend_question_id": "1032", "is_new_question": false }, @@ -50307,8 +50811,8 @@ "question__title": "Maximum Sum of Two Non-Overlapping Subarrays", "question__title_slug": "maximum-sum-of-two-non-overlapping-subarrays", "question__hide": false, - "total_acs": 27448, - "total_submitted": 41818, + "total_acs": 27579, + "total_submitted": 42020, "total_column_articles": 311, "frontend_question_id": "1031", "is_new_question": false @@ -50328,8 +50832,8 @@ "question__title": "Two City Scheduling", "question__title_slug": "two-city-scheduling", "question__hide": false, - "total_acs": 26955, - "total_submitted": 38894, + "total_acs": 27214, + "total_submitted": 39239, "total_column_articles": 291, "frontend_question_id": "1029", "is_new_question": false @@ -50349,8 +50853,8 @@ "question__title": "Matrix Cells in Distance Order", "question__title_slug": "matrix-cells-in-distance-order", "question__hide": false, - "total_acs": 49725, - "total_submitted": 70368, + "total_acs": 49886, + "total_submitted": 70568, "total_column_articles": 543, "frontend_question_id": "1030", "is_new_question": false @@ -50370,9 +50874,9 @@ "question__title": "Recover a Tree From Preorder Traversal", "question__title_slug": "recover-a-tree-from-preorder-traversal", "question__hide": false, - "total_acs": 26555, - "total_submitted": 36494, - "total_column_articles": 550, + "total_acs": 26655, + "total_submitted": 36647, + "total_column_articles": 547, "frontend_question_id": "1028", "is_new_question": false }, @@ -50391,9 +50895,9 @@ "question__title": "Maximum Difference Between Node and Ancestor", "question__title_slug": "maximum-difference-between-node-and-ancestor", "question__hide": false, - "total_acs": 38267, - "total_submitted": 50699, - "total_column_articles": 487, + "total_acs": 38590, + "total_submitted": 51091, + "total_column_articles": 489, "frontend_question_id": "1026", "is_new_question": false }, @@ -50412,8 +50916,8 @@ "question__title": "Maximum Average Subtree", "question__title_slug": "maximum-average-subtree", "question__hide": false, - "total_acs": 4968, - "total_submitted": 7835, + "total_acs": 5071, + "total_submitted": 7966, "total_column_articles": 92, "frontend_question_id": "1120", "is_new_question": false @@ -50433,8 +50937,8 @@ "question__title": "Armstrong Number", "question__title_slug": "armstrong-number", "question__hide": false, - "total_acs": 5435, - "total_submitted": 7010, + "total_acs": 5505, + "total_submitted": 7100, "total_column_articles": 85, "frontend_question_id": "1134", "is_new_question": false @@ -50454,9 +50958,9 @@ "question__title": "Remove Vowels from a String", "question__title_slug": "remove-vowels-from-a-string", "question__hide": false, - "total_acs": 10816, - "total_submitted": 12406, - "total_column_articles": 193, + "total_acs": 10864, + "total_submitted": 12458, + "total_column_articles": 194, "frontend_question_id": "1119", "is_new_question": false }, @@ -50475,8 +50979,8 @@ "question__title": "Number of Days in a Month", "question__title_slug": "number-of-days-in-a-month", "question__hide": false, - "total_acs": 4041, - "total_submitted": 6156, + "total_acs": 4083, + "total_submitted": 6204, "total_column_articles": 71, "frontend_question_id": "1118", "is_new_question": false @@ -50496,9 +51000,9 @@ "question__title": "Longest Arithmetic Subsequence", "question__title_slug": "longest-arithmetic-subsequence", "question__hide": false, - "total_acs": 44169, - "total_submitted": 89175, - "total_column_articles": 350, + "total_acs": 45063, + "total_submitted": 91134, + "total_column_articles": 354, "frontend_question_id": "1027", "is_new_question": false }, @@ -50517,9 +51021,9 @@ "question__title": "Divisor Game", "question__title_slug": "divisor-game", "question__hide": false, - "total_acs": 102940, - "total_submitted": 145624, - "total_column_articles": 830, + "total_acs": 103648, + "total_submitted": 146670, + "total_column_articles": 831, "frontend_question_id": "1025", "is_new_question": false }, @@ -50538,9 +51042,9 @@ "question__title": "The Earliest Moment When Everyone Become Friends", "question__title_slug": "the-earliest-moment-when-everyone-become-friends", "question__hide": false, - "total_acs": 4565, - "total_submitted": 6659, - "total_column_articles": 111, + "total_acs": 4607, + "total_submitted": 6714, + "total_column_articles": 112, "frontend_question_id": "1101", "is_new_question": false }, @@ -50559,9 +51063,9 @@ "question__title": "Find K-Length Substrings With No Repeated Characters", "question__title_slug": "find-k-length-substrings-with-no-repeated-characters", "question__hide": false, - "total_acs": 11346, - "total_submitted": 16149, - "total_column_articles": 204, + "total_acs": 11491, + "total_submitted": 16360, + "total_column_articles": 207, "frontend_question_id": "1100", "is_new_question": false }, @@ -50580,8 +51084,8 @@ "question__title": "Two Sum Less Than K", "question__title_slug": "two-sum-less-than-k", "question__hide": false, - "total_acs": 9960, - "total_submitted": 16466, + "total_acs": 10095, + "total_submitted": 16649, "total_column_articles": 153, "frontend_question_id": "1099", "is_new_question": false @@ -50601,8 +51105,8 @@ "question__title": "Sum of Digits in the Minimum Number", "question__title_slug": "sum-of-digits-in-the-minimum-number", "question__hide": false, - "total_acs": 5067, - "total_submitted": 6488, + "total_acs": 5107, + "total_submitted": 6535, "total_column_articles": 114, "frontend_question_id": "1085", "is_new_question": false @@ -50622,9 +51126,9 @@ "question__title": "Video Stitching", "question__title_slug": "video-stitching", "question__hide": false, - "total_acs": 49976, - "total_submitted": 94050, - "total_column_articles": 565, + "total_acs": 50224, + "total_submitted": 94506, + "total_column_articles": 564, "frontend_question_id": "1024", "is_new_question": false }, @@ -50643,9 +51147,9 @@ "question__title": "Camelcase Matching", "question__title_slug": "camelcase-matching", "question__hide": false, - "total_acs": 30263, - "total_submitted": 46905, - "total_column_articles": 486, + "total_acs": 30343, + "total_submitted": 47031, + "total_column_articles": 488, "frontend_question_id": "1023", "is_new_question": false }, @@ -50664,9 +51168,9 @@ "question__title": "Sum of Root To Leaf Binary Numbers", "question__title_slug": "sum-of-root-to-leaf-binary-numbers", "question__hide": false, - "total_acs": 59080, - "total_submitted": 79201, - "total_column_articles": 674, + "total_acs": 59506, + "total_submitted": 79755, + "total_column_articles": 675, "frontend_question_id": "1022", "is_new_question": false }, @@ -50685,9 +51189,9 @@ "question__title": "Remove Outermost Parentheses", "question__title_slug": "remove-outermost-parentheses", "question__hide": false, - "total_acs": 100943, - "total_submitted": 124093, - "total_column_articles": 1094, + "total_acs": 101359, + "total_submitted": 124630, + "total_column_articles": 1098, "frontend_question_id": "1021", "is_new_question": false }, @@ -50706,8 +51210,8 @@ "question__title": "Confusing Number II", "question__title_slug": "confusing-number-ii", "question__hide": false, - "total_acs": 1786, - "total_submitted": 3575, + "total_acs": 1797, + "total_submitted": 3603, "total_column_articles": 53, "frontend_question_id": "1088", "is_new_question": false @@ -50727,9 +51231,9 @@ "question__title": "Brace Expansion", "question__title_slug": "brace-expansion", "question__hide": false, - "total_acs": 4051, - "total_submitted": 7064, - "total_column_articles": 98, + "total_acs": 4107, + "total_submitted": 7150, + "total_column_articles": 99, "frontend_question_id": "1087", "is_new_question": false }, @@ -50748,8 +51252,8 @@ "question__title": "Index Pairs of a String", "question__title_slug": "index-pairs-of-a-string", "question__hide": false, - "total_acs": 3772, - "total_submitted": 6712, + "total_acs": 3795, + "total_submitted": 6746, "total_column_articles": 112, "frontend_question_id": "1065", "is_new_question": false @@ -50769,8 +51273,8 @@ "question__title": "High Five", "question__title_slug": "high-five", "question__hide": false, - "total_acs": 7780, - "total_submitted": 11391, + "total_acs": 7865, + "total_submitted": 11502, "total_column_articles": 132, "frontend_question_id": "1086", "is_new_question": false @@ -50790,9 +51294,9 @@ "question__title": "Number of Enclaves", "question__title_slug": "number-of-enclaves", "question__hide": false, - "total_acs": 73370, - "total_submitted": 118618, - "total_column_articles": 906, + "total_acs": 76010, + "total_submitted": 123157, + "total_column_articles": 921, "frontend_question_id": "1020", "is_new_question": false }, @@ -50811,9 +51315,9 @@ "question__title": "Next Greater Node In Linked List", "question__title_slug": "next-greater-node-in-linked-list", "question__hide": false, - "total_acs": 58175, - "total_submitted": 90116, - "total_column_articles": 685, + "total_acs": 58628, + "total_submitted": 90761, + "total_column_articles": 689, "frontend_question_id": "1019", "is_new_question": false }, @@ -50832,9 +51336,9 @@ "question__title": "Binary Prefix Divisible By 5", "question__title_slug": "binary-prefix-divisible-by-5", "question__hide": false, - "total_acs": 52929, - "total_submitted": 104933, - "total_column_articles": 462, + "total_acs": 53171, + "total_submitted": 105568, + "total_column_articles": 461, "frontend_question_id": "1018", "is_new_question": false }, @@ -50853,8 +51357,8 @@ "question__title": "Convert to Base -2", "question__title_slug": "convert-to-base-2", "question__hide": false, - "total_acs": 23992, - "total_submitted": 36949, + "total_acs": 24077, + "total_submitted": 37074, "total_column_articles": 261, "frontend_question_id": "1017", "is_new_question": false @@ -50874,9 +51378,9 @@ "question__title": "Confusing Number", "question__title_slug": "confusing-number", "question__hide": false, - "total_acs": 8465, - "total_submitted": 18977, - "total_column_articles": 150, + "total_acs": 8698, + "total_submitted": 19480, + "total_column_articles": 151, "frontend_question_id": "1056", "is_new_question": false }, @@ -50895,8 +51399,8 @@ "question__title": "Digit Count in Range", "question__title_slug": "digit-count-in-range", "question__hide": false, - "total_acs": 2224, - "total_submitted": 4495, + "total_acs": 2240, + "total_submitted": 4538, "total_column_articles": 55, "frontend_question_id": "1067", "is_new_question": false @@ -50916,8 +51420,8 @@ "question__title": "Campus Bikes II", "question__title_slug": "campus-bikes-ii", "question__hide": false, - "total_acs": 3471, - "total_submitted": 6708, + "total_acs": 3482, + "total_submitted": 6741, "total_column_articles": 72, "frontend_question_id": "1066", "is_new_question": false @@ -50937,8 +51441,8 @@ "question__title": "Fixed Point", "question__title_slug": "fixed-point", "question__hide": false, - "total_acs": 6785, - "total_submitted": 10490, + "total_acs": 6873, + "total_submitted": 10613, "total_column_articles": 109, "frontend_question_id": "1064", "is_new_question": false @@ -50958,8 +51462,8 @@ "question__title": "Binary String With Substrings Representing 1 To N", "question__title_slug": "binary-string-with-substrings-representing-1-to-n", "question__hide": false, - "total_acs": 26464, - "total_submitted": 41784, + "total_acs": 26524, + "total_submitted": 41898, "total_column_articles": 271, "frontend_question_id": "1016", "is_new_question": false @@ -50979,8 +51483,8 @@ "question__title": "Smallest Integer Divisible by K", "question__title_slug": "smallest-integer-divisible-by-k", "question__hide": false, - "total_acs": 26517, - "total_submitted": 56816, + "total_acs": 26589, + "total_submitted": 56989, "total_column_articles": 174, "frontend_question_id": "1015", "is_new_question": false @@ -51000,9 +51504,9 @@ "question__title": "Best Sightseeing Pair", "question__title_slug": "best-sightseeing-pair", "question__hide": false, - "total_acs": 63160, - "total_submitted": 110436, - "total_column_articles": 727, + "total_acs": 63344, + "total_submitted": 110724, + "total_column_articles": 726, "frontend_question_id": "1014", "is_new_question": false }, @@ -51021,9 +51525,9 @@ "question__title": "Partition Array Into Three Parts With Equal Sum", "question__title_slug": "partition-array-into-three-parts-with-equal-sum", "question__hide": false, - "total_acs": 63083, - "total_submitted": 163937, - "total_column_articles": 1073, + "total_acs": 63521, + "total_submitted": 165163, + "total_column_articles": 1078, "frontend_question_id": "1013", "is_new_question": false }, @@ -51042,8 +51546,8 @@ "question__title": "Number of Valid Subarrays", "question__title_slug": "number-of-valid-subarrays", "question__hide": false, - "total_acs": 3159, - "total_submitted": 4260, + "total_acs": 3171, + "total_submitted": 4276, "total_column_articles": 62, "frontend_question_id": "1063", "is_new_question": false @@ -51063,8 +51567,8 @@ "question__title": "Longest Repeating Substring", "question__title_slug": "longest-repeating-substring", "question__hide": false, - "total_acs": 6896, - "total_submitted": 12042, + "total_acs": 6984, + "total_submitted": 12157, "total_column_articles": 88, "frontend_question_id": "1062", "is_new_question": false @@ -51084,8 +51588,8 @@ "question__title": "Missing Element in Sorted Array", "question__title_slug": "missing-element-in-sorted-array", "question__hide": false, - "total_acs": 12497, - "total_submitted": 22626, + "total_acs": 12589, + "total_submitted": 22770, "total_column_articles": 168, "frontend_question_id": "1060", "is_new_question": false @@ -51105,9 +51609,9 @@ "question__title": "Lexicographically Smallest Equivalent String", "question__title_slug": "lexicographically-smallest-equivalent-string", "question__hide": false, - "total_acs": 6495, - "total_submitted": 9939, - "total_column_articles": 132, + "total_acs": 6622, + "total_submitted": 10117, + "total_column_articles": 133, "frontend_question_id": "1061", "is_new_question": false }, @@ -51126,8 +51630,8 @@ "question__title": "Numbers With Repeated Digits", "question__title_slug": "numbers-with-repeated-digits", "question__hide": false, - "total_acs": 21612, - "total_submitted": 40214, + "total_acs": 21727, + "total_submitted": 40423, "total_column_articles": 204, "frontend_question_id": "1012", "is_new_question": false @@ -51147,9 +51651,9 @@ "question__title": "Capacity To Ship Packages Within D Days", "question__title_slug": "capacity-to-ship-packages-within-d-days", "question__hide": false, - "total_acs": 102093, - "total_submitted": 163835, - "total_column_articles": 887, + "total_acs": 102888, + "total_submitted": 165003, + "total_column_articles": 890, "frontend_question_id": "1011", "is_new_question": false }, @@ -51168,8 +51672,8 @@ "question__title": "Pairs of Songs With Total Durations Divisible by 60", "question__title_slug": "pairs-of-songs-with-total-durations-divisible-by-60", "question__hide": false, - "total_acs": 44218, - "total_submitted": 88756, + "total_acs": 44386, + "total_submitted": 89016, "total_column_articles": 497, "frontend_question_id": "1010", "is_new_question": false @@ -51189,9 +51693,9 @@ "question__title": "Complement of Base 10 Integer", "question__title_slug": "complement-of-base-10-integer", "question__hide": false, - "total_acs": 26085, - "total_submitted": 44511, - "total_column_articles": 367, + "total_acs": 26403, + "total_submitted": 45093, + "total_column_articles": 368, "frontend_question_id": "1009", "is_new_question": false }, @@ -51210,8 +51714,8 @@ "question__title": "Minimize Rounding Error to Meet Target", "question__title_slug": "minimize-rounding-error-to-meet-target", "question__hide": false, - "total_acs": 2023, - "total_submitted": 5372, + "total_acs": 2032, + "total_submitted": 5402, "total_column_articles": 52, "frontend_question_id": "1058", "is_new_question": false @@ -51231,9 +51735,9 @@ "question__title": "Campus Bikes", "question__title_slug": "campus-bikes", "question__hide": false, - "total_acs": 4884, - "total_submitted": 9339, - "total_column_articles": 63, + "total_acs": 4927, + "total_submitted": 9408, + "total_column_articles": 64, "frontend_question_id": "1057", "is_new_question": false }, @@ -51252,8 +51756,8 @@ "question__title": "Shortest Way to Form String", "question__title_slug": "shortest-way-to-form-string", "question__hide": false, - "total_acs": 11437, - "total_submitted": 18851, + "total_acs": 11586, + "total_submitted": 19072, "total_column_articles": 169, "frontend_question_id": "1055", "is_new_question": false @@ -51273,9 +51777,9 @@ "question__title": "Construct Binary Search Tree from Preorder Traversal", "question__title_slug": "construct-binary-search-tree-from-preorder-traversal", "question__hide": false, - "total_acs": 34270, - "total_submitted": 47881, - "total_column_articles": 428, + "total_acs": 34710, + "total_submitted": 48527, + "total_column_articles": 429, "frontend_question_id": "1008", "is_new_question": false }, @@ -51294,8 +51798,8 @@ "question__title": "Minimum Domino Rotations For Equal Row", "question__title_slug": "minimum-domino-rotations-for-equal-row", "question__hide": false, - "total_acs": 9803, - "total_submitted": 20286, + "total_acs": 9851, + "total_submitted": 20389, "total_column_articles": 129, "frontend_question_id": "1007", "is_new_question": false @@ -51315,9 +51819,9 @@ "question__title": "Clumsy Factorial", "question__title_slug": "clumsy-factorial", "question__hide": false, - "total_acs": 50374, - "total_submitted": 80056, - "total_column_articles": 684, + "total_acs": 50601, + "total_submitted": 80401, + "total_column_articles": 685, "frontend_question_id": "1006", "is_new_question": false }, @@ -51336,9 +51840,9 @@ "question__title": "Maximize Sum Of Array After K Negations", "question__title_slug": "maximize-sum-of-array-after-k-negations", "question__hide": false, - "total_acs": 157089, - "total_submitted": 307654, - "total_column_articles": 1638, + "total_acs": 161942, + "total_submitted": 317330, + "total_column_articles": 1665, "frontend_question_id": "1005", "is_new_question": false }, @@ -51357,9 +51861,9 @@ "question__title": "Max Consecutive Ones III", "question__title_slug": "max-consecutive-ones-iii", "question__hide": false, - "total_acs": 150737, - "total_submitted": 253872, - "total_column_articles": 1227, + "total_acs": 153359, + "total_submitted": 258511, + "total_column_articles": 1238, "frontend_question_id": "1004", "is_new_question": false }, @@ -51378,9 +51882,9 @@ "question__title": "Check If Word Is Valid After Substitutions", "question__title_slug": "check-if-word-is-valid-after-substitutions", "question__hide": false, - "total_acs": 36646, - "total_submitted": 57419, - "total_column_articles": 451, + "total_acs": 36792, + "total_submitted": 57622, + "total_column_articles": 452, "frontend_question_id": "1003", "is_new_question": false }, @@ -51399,9 +51903,9 @@ "question__title": "Find Common Characters", "question__title_slug": "find-common-characters", "question__hide": false, - "total_acs": 92664, - "total_submitted": 131801, - "total_column_articles": 884, + "total_acs": 93404, + "total_submitted": 132812, + "total_column_articles": 887, "frontend_question_id": "1002", "is_new_question": false }, @@ -51420,9 +51924,9 @@ "question__title": "Grid Illumination", "question__title_slug": "grid-illumination", "question__hide": false, - "total_acs": 19881, - "total_submitted": 44378, - "total_column_articles": 285, + "total_acs": 19921, + "total_submitted": 44470, + "total_column_articles": 282, "frontend_question_id": "1001", "is_new_question": false }, @@ -51441,8 +51945,8 @@ "question__title": "Minimum Cost to Merge Stones", "question__title_slug": "minimum-cost-to-merge-stones", "question__hide": false, - "total_acs": 20201, - "total_submitted": 37650, + "total_acs": 20347, + "total_submitted": 37905, "total_column_articles": 111, "frontend_question_id": "1000", "is_new_question": false @@ -51462,8 +51966,8 @@ "question__title": "Available Captures for Rook", "question__title_slug": "available-captures-for-rook", "question__hide": false, - "total_acs": 36745, - "total_submitted": 52933, + "total_acs": 36919, + "total_submitted": 53148, "total_column_articles": 649, "frontend_question_id": "999", "is_new_question": false @@ -51483,8 +51987,8 @@ "question__title": "Maximum Binary Tree II", "question__title_slug": "maximum-binary-tree-ii", "question__hide": false, - "total_acs": 34008, - "total_submitted": 49334, + "total_acs": 34159, + "total_submitted": 49542, "total_column_articles": 449, "frontend_question_id": "998", "is_new_question": false @@ -51504,9 +52008,9 @@ "question__title": "Find the Town Judge", "question__title_slug": "find-the-town-judge", "question__hide": false, - "total_acs": 94961, - "total_submitted": 183855, - "total_column_articles": 894, + "total_acs": 95677, + "total_submitted": 185301, + "total_column_articles": 896, "frontend_question_id": "997", "is_new_question": false }, @@ -51525,8 +52029,8 @@ "question__title": "Number of Squareful Arrays", "question__title_slug": "number-of-squareful-arrays", "question__hide": false, - "total_acs": 7859, - "total_submitted": 15375, + "total_acs": 7935, + "total_submitted": 15550, "total_column_articles": 146, "frontend_question_id": "996", "is_new_question": false @@ -51546,8 +52050,8 @@ "question__title": "Minimum Number of K Consecutive Bit Flips", "question__title_slug": "minimum-number-of-k-consecutive-bit-flips", "question__hide": false, - "total_acs": 26885, - "total_submitted": 49664, + "total_acs": 26964, + "total_submitted": 49813, "total_column_articles": 291, "frontend_question_id": "995", "is_new_question": false @@ -51567,9 +52071,9 @@ "question__title": "Rotting Oranges", "question__title_slug": "rotting-oranges", "question__hide": false, - "total_acs": 146248, - "total_submitted": 284923, - "total_column_articles": 2304, + "total_acs": 153674, + "total_submitted": 299705, + "total_column_articles": 2354, "frontend_question_id": "994", "is_new_question": false }, @@ -51588,8 +52092,8 @@ "question__title": "Cousins in Binary Tree", "question__title_slug": "cousins-in-binary-tree", "question__hide": false, - "total_acs": 79837, - "total_submitted": 135926, + "total_acs": 80441, + "total_submitted": 136802, "total_column_articles": 1171, "frontend_question_id": "993", "is_new_question": false @@ -51609,9 +52113,9 @@ "question__title": "Subarrays with K Different Integers", "question__title_slug": "subarrays-with-k-different-integers", "question__hide": false, - "total_acs": 33124, - "total_submitted": 69398, - "total_column_articles": 343, + "total_acs": 33438, + "total_submitted": 70034, + "total_column_articles": 346, "frontend_question_id": "992", "is_new_question": false }, @@ -51630,9 +52134,9 @@ "question__title": "Broken Calculator", "question__title_slug": "broken-calculator", "question__hide": false, - "total_acs": 13635, - "total_submitted": 25849, - "total_column_articles": 155, + "total_acs": 13763, + "total_submitted": 26075, + "total_column_articles": 157, "frontend_question_id": "991", "is_new_question": false }, @@ -51651,9 +52155,9 @@ "question__title": "Satisfiability of Equality Equations", "question__title_slug": "satisfiability-of-equality-equations", "question__hide": false, - "total_acs": 57886, - "total_submitted": 107771, - "total_column_articles": 937, + "total_acs": 58336, + "total_submitted": 108506, + "total_column_articles": 936, "frontend_question_id": "990", "is_new_question": false }, @@ -51672,8 +52176,8 @@ "question__title": "Add to Array-Form of Integer", "question__title_slug": "add-to-array-form-of-integer", "question__hide": false, - "total_acs": 75434, - "total_submitted": 166313, + "total_acs": 75917, + "total_submitted": 167590, "total_column_articles": 822, "frontend_question_id": "989", "is_new_question": false @@ -51693,8 +52197,8 @@ "question__title": "Smallest String Starting From Leaf", "question__title_slug": "smallest-string-starting-from-leaf", "question__hide": false, - "total_acs": 17550, - "total_submitted": 33897, + "total_acs": 17765, + "total_submitted": 34259, "total_column_articles": 202, "frontend_question_id": "988", "is_new_question": false @@ -51714,9 +52218,9 @@ "question__title": "Vertical Order Traversal of a Binary Tree", "question__title_slug": "vertical-order-traversal-of-a-binary-tree", "question__hide": false, - "total_acs": 43498, - "total_submitted": 75932, - "total_column_articles": 626, + "total_acs": 43903, + "total_submitted": 76547, + "total_column_articles": 624, "frontend_question_id": "987", "is_new_question": false }, @@ -51735,9 +52239,9 @@ "question__title": "Interval List Intersections", "question__title_slug": "interval-list-intersections", "question__hide": false, - "total_acs": 66436, - "total_submitted": 96879, - "total_column_articles": 606, + "total_acs": 66811, + "total_submitted": 97388, + "total_column_articles": 603, "frontend_question_id": "986", "is_new_question": false }, @@ -51756,8 +52260,8 @@ "question__title": "Sum of Even Numbers After Queries", "question__title_slug": "sum-of-even-numbers-after-queries", "question__hide": false, - "total_acs": 20556, - "total_submitted": 33571, + "total_acs": 20686, + "total_submitted": 33756, "total_column_articles": 236, "frontend_question_id": "985", "is_new_question": false @@ -51777,9 +52281,9 @@ "question__title": "String Without AAA or BBB", "question__title_slug": "string-without-aaa-or-bbb", "question__hide": false, - "total_acs": 14308, - "total_submitted": 32605, - "total_column_articles": 228, + "total_acs": 14415, + "total_submitted": 32850, + "total_column_articles": 230, "frontend_question_id": "984", "is_new_question": false }, @@ -51798,9 +52302,9 @@ "question__title": "Minimum Cost For Tickets", "question__title_slug": "minimum-cost-for-tickets", "question__hide": false, - "total_acs": 46947, - "total_submitted": 74228, - "total_column_articles": 592, + "total_acs": 47852, + "total_submitted": 75770, + "total_column_articles": 600, "frontend_question_id": "983", "is_new_question": false }, @@ -51819,8 +52323,8 @@ "question__title": "Triples with Bitwise AND Equal To Zero", "question__title_slug": "triples-with-bitwise-and-equal-to-zero", "question__hide": false, - "total_acs": 21644, - "total_submitted": 32124, + "total_acs": 21701, + "total_submitted": 32214, "total_column_articles": 153, "frontend_question_id": "982", "is_new_question": false @@ -51840,9 +52344,9 @@ "question__title": "Time Based Key-Value Store", "question__title_slug": "time-based-key-value-store", "question__hide": false, - "total_acs": 32598, - "total_submitted": 62008, - "total_column_articles": 395, + "total_acs": 32820, + "total_submitted": 62441, + "total_column_articles": 399, "frontend_question_id": "981", "is_new_question": false }, @@ -51861,9 +52365,9 @@ "question__title": "Unique Paths III", "question__title_slug": "unique-paths-iii", "question__hide": false, - "total_acs": 37393, - "total_submitted": 47956, - "total_column_articles": 432, + "total_acs": 37664, + "total_submitted": 48370, + "total_column_articles": 433, "frontend_question_id": "980", "is_new_question": false }, @@ -51882,9 +52386,9 @@ "question__title": "Distribute Coins in Binary Tree", "question__title_slug": "distribute-coins-in-binary-tree", "question__hide": false, - "total_acs": 30547, - "total_submitted": 40019, - "total_column_articles": 364, + "total_acs": 30745, + "total_submitted": 40249, + "total_column_articles": 365, "frontend_question_id": "979", "is_new_question": false }, @@ -51903,9 +52407,9 @@ "question__title": "Longest Turbulent Subarray", "question__title_slug": "longest-turbulent-subarray", "question__hide": false, - "total_acs": 54656, - "total_submitted": 114575, - "total_column_articles": 708, + "total_acs": 55121, + "total_submitted": 115528, + "total_column_articles": 707, "frontend_question_id": "978", "is_new_question": false }, @@ -51924,9 +52428,9 @@ "question__title": "Squares of a Sorted Array", "question__title_slug": "squares-of-a-sorted-array", "question__hide": false, - "total_acs": 636792, - "total_submitted": 938138, - "total_column_articles": 3777, + "total_acs": 652106, + "total_submitted": 960483, + "total_column_articles": 3846, "frontend_question_id": "977", "is_new_question": false }, @@ -51945,9 +52449,9 @@ "question__title": "Largest Perimeter Triangle", "question__title_slug": "largest-perimeter-triangle", "question__hide": false, - "total_acs": 93550, - "total_submitted": 162661, - "total_column_articles": 890, + "total_acs": 95233, + "total_submitted": 165558, + "total_column_articles": 907, "frontend_question_id": "976", "is_new_question": false }, @@ -51966,8 +52470,8 @@ "question__title": "Odd Even Jump", "question__title_slug": "odd-even-jump", "question__hide": false, - "total_acs": 6104, - "total_submitted": 12606, + "total_acs": 6158, + "total_submitted": 12730, "total_column_articles": 95, "frontend_question_id": "975", "is_new_question": false @@ -51987,9 +52491,9 @@ "question__title": "Subarray Sums Divisible by K", "question__title_slug": "subarray-sums-divisible-by-k", "question__hide": false, - "total_acs": 64030, - "total_submitted": 132606, - "total_column_articles": 586, + "total_acs": 64604, + "total_submitted": 133735, + "total_column_articles": 591, "frontend_question_id": "974", "is_new_question": false }, @@ -52008,9 +52512,9 @@ "question__title": "K Closest Points to Origin", "question__title_slug": "k-closest-points-to-origin", "question__hide": false, - "total_acs": 99829, - "total_submitted": 152942, - "total_column_articles": 838, + "total_acs": 100335, + "total_submitted": 153707, + "total_column_articles": 835, "frontend_question_id": "973", "is_new_question": false }, @@ -52029,9 +52533,9 @@ "question__title": "Fibonacci Number", "question__title_slug": "fibonacci-number", "question__hide": false, - "total_acs": 659049, - "total_submitted": 998971, - "total_column_articles": 3472, + "total_acs": 674794, + "total_submitted": 1023242, + "total_column_articles": 3519, "frontend_question_id": "509", "is_new_question": false }, @@ -52050,8 +52554,8 @@ "question__title": "Equal Rational Numbers", "question__title_slug": "equal-rational-numbers", "question__hide": false, - "total_acs": 2382, - "total_submitted": 5729, + "total_acs": 2395, + "total_submitted": 5761, "total_column_articles": 55, "frontend_question_id": "972", "is_new_question": false @@ -52071,9 +52575,9 @@ "question__title": "Flip Binary Tree To Match Preorder Traversal", "question__title_slug": "flip-binary-tree-to-match-preorder-traversal", "question__hide": false, - "total_acs": 11644, - "total_submitted": 25208, - "total_column_articles": 176, + "total_acs": 11752, + "total_submitted": 25406, + "total_column_articles": 177, "frontend_question_id": "971", "is_new_question": false }, @@ -52092,8 +52596,8 @@ "question__title": "Powerful Integers", "question__title_slug": "powerful-integers", "question__hide": false, - "total_acs": 30201, - "total_submitted": 64398, + "total_acs": 30303, + "total_submitted": 64634, "total_column_articles": 311, "frontend_question_id": "970", "is_new_question": false @@ -52113,8 +52617,8 @@ "question__title": "Pancake Sorting", "question__title_slug": "pancake-sorting", "question__hide": false, - "total_acs": 49807, - "total_submitted": 73553, + "total_acs": 50010, + "total_submitted": 73851, "total_column_articles": 706, "frontend_question_id": "969", "is_new_question": false @@ -52134,9 +52638,9 @@ "question__title": "Binary Tree Cameras", "question__title_slug": "binary-tree-cameras", "question__hide": false, - "total_acs": 73399, - "total_submitted": 140034, - "total_column_articles": 681, + "total_acs": 75416, + "total_submitted": 143901, + "total_column_articles": 685, "frontend_question_id": "968", "is_new_question": false }, @@ -52155,9 +52659,9 @@ "question__title": "Numbers With Same Consecutive Differences", "question__title_slug": "numbers-with-same-consecutive-differences", "question__hide": false, - "total_acs": 13549, - "total_submitted": 26356, - "total_column_articles": 244, + "total_acs": 13752, + "total_submitted": 26724, + "total_column_articles": 245, "frontend_question_id": "967", "is_new_question": false }, @@ -52176,8 +52680,8 @@ "question__title": "Vowel Spellchecker", "question__title_slug": "vowel-spellchecker", "question__hide": false, - "total_acs": 5171, - "total_submitted": 11784, + "total_acs": 5208, + "total_submitted": 11838, "total_column_articles": 72, "frontend_question_id": "966", "is_new_question": false @@ -52197,9 +52701,9 @@ "question__title": "Univalued Binary Tree", "question__title_slug": "univalued-binary-tree", "question__hide": false, - "total_acs": 87650, - "total_submitted": 125370, - "total_column_articles": 930, + "total_acs": 88571, + "total_submitted": 126817, + "total_column_articles": 935, "frontend_question_id": "965", "is_new_question": false }, @@ -52218,8 +52722,8 @@ "question__title": "Least Operators to Express Number", "question__title_slug": "least-operators-to-express-number", "question__hide": false, - "total_acs": 2485, - "total_submitted": 5330, + "total_acs": 2505, + "total_submitted": 5391, "total_column_articles": 42, "frontend_question_id": "964", "is_new_question": false @@ -52239,8 +52743,8 @@ "question__title": "Minimum Area Rectangle II", "question__title_slug": "minimum-area-rectangle-ii", "question__hide": false, - "total_acs": 4197, - "total_submitted": 8133, + "total_acs": 4225, + "total_submitted": 8185, "total_column_articles": 59, "frontend_question_id": "963", "is_new_question": false @@ -52260,9 +52764,9 @@ "question__title": "Maximum Width Ramp", "question__title_slug": "maximum-width-ramp", "question__hide": false, - "total_acs": 26658, - "total_submitted": 55351, - "total_column_articles": 246, + "total_acs": 26977, + "total_submitted": 55873, + "total_column_articles": 250, "frontend_question_id": "962", "is_new_question": false }, @@ -52281,9 +52785,9 @@ "question__title": "N-Repeated Element in Size 2N Array", "question__title_slug": "n-repeated-element-in-size-2n-array", "question__hide": false, - "total_acs": 84191, - "total_submitted": 119717, - "total_column_articles": 754, + "total_acs": 84774, + "total_submitted": 120540, + "total_column_articles": 757, "frontend_question_id": "961", "is_new_question": false }, @@ -52302,8 +52806,8 @@ "question__title": "Delete Columns to Make Sorted III", "question__title_slug": "delete-columns-to-make-sorted-iii", "question__hide": false, - "total_acs": 3929, - "total_submitted": 6668, + "total_acs": 3962, + "total_submitted": 6730, "total_column_articles": 64, "frontend_question_id": "960", "is_new_question": false @@ -52323,9 +52827,9 @@ "question__title": "Regions Cut By Slashes", "question__title_slug": "regions-cut-by-slashes", "question__hide": false, - "total_acs": 23906, - "total_submitted": 32178, - "total_column_articles": 364, + "total_acs": 23972, + "total_submitted": 32279, + "total_column_articles": 365, "frontend_question_id": "959", "is_new_question": false }, @@ -52344,9 +52848,9 @@ "question__title": "Check Completeness of a Binary Tree", "question__title_slug": "check-completeness-of-a-binary-tree", "question__hide": false, - "total_acs": 55342, - "total_submitted": 101046, - "total_column_articles": 493, + "total_acs": 56055, + "total_submitted": 102325, + "total_column_articles": 498, "frontend_question_id": "958", "is_new_question": false }, @@ -52365,9 +52869,9 @@ "question__title": "Prison Cells After N Days", "question__title_slug": "prison-cells-after-n-days", "question__hide": false, - "total_acs": 20522, - "total_submitted": 54742, - "total_column_articles": 197, + "total_acs": 20607, + "total_submitted": 55010, + "total_column_articles": 198, "frontend_question_id": "957", "is_new_question": false }, @@ -52386,8 +52890,8 @@ "question__title": "Tallest Billboard", "question__title_slug": "tallest-billboard", "question__hide": false, - "total_acs": 7379, - "total_submitted": 15582, + "total_acs": 7460, + "total_submitted": 15726, "total_column_articles": 85, "frontend_question_id": "956", "is_new_question": false @@ -52407,8 +52911,8 @@ "question__title": "Delete Columns to Make Sorted II", "question__title_slug": "delete-columns-to-make-sorted-ii", "question__hide": false, - "total_acs": 6034, - "total_submitted": 16798, + "total_acs": 6072, + "total_submitted": 16897, "total_column_articles": 98, "frontend_question_id": "955", "is_new_question": false @@ -52428,9 +52932,9 @@ "question__title": "Array of Doubled Pairs", "question__title_slug": "array-of-doubled-pairs", "question__hide": false, - "total_acs": 44114, - "total_submitted": 112447, - "total_column_articles": 484, + "total_acs": 44292, + "total_submitted": 112853, + "total_column_articles": 482, "frontend_question_id": "954", "is_new_question": false }, @@ -52449,9 +52953,9 @@ "question__title": "Verifying an Alien Dictionary", "question__title_slug": "verifying-an-alien-dictionary", "question__hide": false, - "total_acs": 57377, - "total_submitted": 99515, - "total_column_articles": 715, + "total_acs": 57647, + "total_submitted": 99987, + "total_column_articles": 716, "frontend_question_id": "953", "is_new_question": false }, @@ -52470,8 +52974,8 @@ "question__title": "Largest Component Size by Common Factor", "question__title_slug": "largest-component-size-by-common-factor", "question__hide": false, - "total_acs": 19966, - "total_submitted": 39099, + "total_acs": 20066, + "total_submitted": 39304, "total_column_articles": 188, "frontend_question_id": "952", "is_new_question": false @@ -52491,8 +52995,8 @@ "question__title": "Flip Equivalent Binary Trees", "question__title_slug": "flip-equivalent-binary-trees", "question__hide": false, - "total_acs": 18964, - "total_submitted": 28280, + "total_acs": 19140, + "total_submitted": 28528, "total_column_articles": 261, "frontend_question_id": "951", "is_new_question": false @@ -52512,9 +53016,9 @@ "question__title": "Reveal Cards In Increasing Order", "question__title_slug": "reveal-cards-in-increasing-order", "question__hide": false, - "total_acs": 15738, - "total_submitted": 19989, - "total_column_articles": 246, + "total_acs": 15865, + "total_submitted": 20138, + "total_column_articles": 248, "frontend_question_id": "950", "is_new_question": false }, @@ -52533,8 +53037,8 @@ "question__title": "Largest Time for Given Digits", "question__title_slug": "largest-time-for-given-digits", "question__hide": false, - "total_acs": 12538, - "total_submitted": 32815, + "total_acs": 12667, + "total_submitted": 33158, "total_column_articles": 198, "frontend_question_id": "949", "is_new_question": false @@ -52554,9 +53058,9 @@ "question__title": "Bag of Tokens", "question__title_slug": "bag-of-tokens", "question__hide": false, - "total_acs": 10969, - "total_submitted": 26711, - "total_column_articles": 164, + "total_acs": 11147, + "total_submitted": 27009, + "total_column_articles": 165, "frontend_question_id": "948", "is_new_question": false }, @@ -52575,9 +53079,9 @@ "question__title": "Most Stones Removed with Same Row or Column", "question__title_slug": "most-stones-removed-with-same-row-or-column", "question__hide": false, - "total_acs": 35799, - "total_submitted": 58171, - "total_column_articles": 439, + "total_acs": 35977, + "total_submitted": 58469, + "total_column_articles": 437, "frontend_question_id": "947", "is_new_question": false }, @@ -52596,9 +53100,9 @@ "question__title": "Validate Stack Sequences", "question__title_slug": "validate-stack-sequences", "question__hide": false, - "total_acs": 88456, - "total_submitted": 133015, - "total_column_articles": 893, + "total_acs": 89668, + "total_submitted": 134828, + "total_column_articles": 894, "frontend_question_id": "946", "is_new_question": false }, @@ -52617,9 +53121,9 @@ "question__title": "Minimum Increment to Make Array Unique", "question__title_slug": "minimum-increment-to-make-array-unique", "question__hide": false, - "total_acs": 45079, - "total_submitted": 93808, - "total_column_articles": 636, + "total_acs": 45332, + "total_submitted": 94301, + "total_column_articles": 635, "frontend_question_id": "945", "is_new_question": false }, @@ -52638,8 +53142,8 @@ "question__title": "Delete Columns to Make Sorted", "question__title_slug": "delete-columns-to-make-sorted", "question__hide": false, - "total_acs": 59389, - "total_submitted": 85968, + "total_acs": 59642, + "total_submitted": 86315, "total_column_articles": 517, "frontend_question_id": "944", "is_new_question": false @@ -52659,8 +53163,8 @@ "question__title": "Find the Shortest Superstring", "question__title_slug": "find-the-shortest-superstring", "question__hide": false, - "total_acs": 4099, - "total_submitted": 8485, + "total_acs": 4148, + "total_submitted": 8613, "total_column_articles": 82, "frontend_question_id": "943", "is_new_question": false @@ -52680,9 +53184,9 @@ "question__title": "DI String Match", "question__title_slug": "di-string-match", "question__hide": false, - "total_acs": 69856, - "total_submitted": 90274, - "total_column_articles": 810, + "total_acs": 70367, + "total_submitted": 90942, + "total_column_articles": 811, "frontend_question_id": "942", "is_new_question": false }, @@ -52701,9 +53205,9 @@ "question__title": "Valid Mountain Array", "question__title_slug": "valid-mountain-array", "question__hide": false, - "total_acs": 91126, - "total_submitted": 229314, - "total_column_articles": 829, + "total_acs": 91769, + "total_submitted": 230778, + "total_column_articles": 834, "frontend_question_id": "941", "is_new_question": false }, @@ -52722,9 +53226,9 @@ "question__title": "Distinct Subsequences II", "question__title_slug": "distinct-subsequences-ii", "question__hide": false, - "total_acs": 31858, - "total_submitted": 60010, - "total_column_articles": 286, + "total_acs": 32076, + "total_submitted": 60475, + "total_column_articles": 287, "frontend_question_id": "940", "is_new_question": false }, @@ -52743,9 +53247,9 @@ "question__title": "Minimum Area Rectangle", "question__title_slug": "minimum-area-rectangle", "question__hide": false, - "total_acs": 9917, - "total_submitted": 20201, - "total_column_articles": 111, + "total_acs": 10053, + "total_submitted": 20400, + "total_column_articles": 112, "frontend_question_id": "939", "is_new_question": false }, @@ -52764,9 +53268,9 @@ "question__title": "Range Sum of BST", "question__title_slug": "range-sum-of-bst", "question__hide": false, - "total_acs": 149638, - "total_submitted": 180013, - "total_column_articles": 1124, + "total_acs": 150977, + "total_submitted": 181626, + "total_column_articles": 1127, "frontend_question_id": "938", "is_new_question": false }, @@ -52785,9 +53289,9 @@ "question__title": "Reorder Data in Log Files", "question__title_slug": "reorder-data-in-log-files", "question__hide": false, - "total_acs": 42670, - "total_submitted": 67316, - "total_column_articles": 512, + "total_acs": 42841, + "total_submitted": 67530, + "total_column_articles": 509, "frontend_question_id": "937", "is_new_question": false }, @@ -52806,9 +53310,9 @@ "question__title": "Stamping The Sequence", "question__title_slug": "stamping-the-sequence", "question__hide": false, - "total_acs": 3139, - "total_submitted": 7212, - "total_column_articles": 44, + "total_acs": 3293, + "total_submitted": 7429, + "total_column_articles": 45, "frontend_question_id": "936", "is_new_question": false }, @@ -52827,8 +53331,8 @@ "question__title": "Knight Dialer", "question__title_slug": "knight-dialer", "question__hide": false, - "total_acs": 10904, - "total_submitted": 20482, + "total_acs": 11114, + "total_submitted": 20768, "total_column_articles": 140, "frontend_question_id": "935", "is_new_question": false @@ -52848,8 +53352,8 @@ "question__title": "Shortest Bridge", "question__title_slug": "shortest-bridge", "question__hide": false, - "total_acs": 71509, - "total_submitted": 136016, + "total_acs": 72174, + "total_submitted": 137118, "total_column_articles": 753, "frontend_question_id": "934", "is_new_question": false @@ -52869,9 +53373,9 @@ "question__title": "Number of Recent Calls", "question__title_slug": "number-of-recent-calls", "question__hide": false, - "total_acs": 113106, - "total_submitted": 147364, - "total_column_articles": 889, + "total_acs": 114779, + "total_submitted": 149366, + "total_column_articles": 895, "frontend_question_id": "933", "is_new_question": false }, @@ -52890,9 +53394,9 @@ "question__title": "Beautiful Array", "question__title_slug": "beautiful-array", "question__hide": false, - "total_acs": 14761, - "total_submitted": 22252, - "total_column_articles": 134, + "total_acs": 14957, + "total_submitted": 22485, + "total_column_articles": 135, "frontend_question_id": "932", "is_new_question": false }, @@ -52911,9 +53415,9 @@ "question__title": "Minimum Falling Path Sum", "question__title_slug": "minimum-falling-path-sum", "question__hide": false, - "total_acs": 98067, - "total_submitted": 145031, - "total_column_articles": 1359, + "total_acs": 100564, + "total_submitted": 148817, + "total_column_articles": 1378, "frontend_question_id": "931", "is_new_question": false }, @@ -52932,8 +53436,8 @@ "question__title": "Binary Subarrays With Sum", "question__title_slug": "binary-subarrays-with-sum", "question__hide": false, - "total_acs": 48222, - "total_submitted": 86916, + "total_acs": 48847, + "total_submitted": 87841, "total_column_articles": 454, "frontend_question_id": "930", "is_new_question": false @@ -52953,9 +53457,9 @@ "question__title": "Unique Email Addresses", "question__title_slug": "unique-email-addresses", "question__hide": false, - "total_acs": 58342, - "total_submitted": 85062, - "total_column_articles": 560, + "total_acs": 58627, + "total_submitted": 85596, + "total_column_articles": 562, "frontend_question_id": "929", "is_new_question": false }, @@ -52974,9 +53478,9 @@ "question__title": "Minimize Malware Spread II", "question__title_slug": "minimize-malware-spread-ii", "question__hide": false, - "total_acs": 4713, - "total_submitted": 10782, - "total_column_articles": 85, + "total_acs": 4904, + "total_submitted": 11033, + "total_column_articles": 86, "frontend_question_id": "928", "is_new_question": false }, @@ -52995,9 +53499,9 @@ "question__title": "Three Equal Parts", "question__title_slug": "three-equal-parts", "question__hide": false, - "total_acs": 24305, - "total_submitted": 55485, - "total_column_articles": 370, + "total_acs": 24459, + "total_submitted": 55715, + "total_column_articles": 371, "frontend_question_id": "927", "is_new_question": false }, @@ -53016,8 +53520,8 @@ "question__title": "Flip String to Monotone Increasing", "question__title_slug": "flip-string-to-monotone-increasing", "question__hide": false, - "total_acs": 39786, - "total_submitted": 62643, + "total_acs": 40207, + "total_submitted": 63243, "total_column_articles": 545, "frontend_question_id": "926", "is_new_question": false @@ -53037,9 +53541,9 @@ "question__title": "Long Pressed Name", "question__title_slug": "long-pressed-name", "question__hide": false, - "total_acs": 71032, - "total_submitted": 190422, - "total_column_articles": 854, + "total_acs": 71648, + "total_submitted": 191940, + "total_column_articles": 853, "frontend_question_id": "925", "is_new_question": false }, @@ -53058,9 +53562,9 @@ "question__title": "Minimize Malware Spread", "question__title_slug": "minimize-malware-spread", "question__hide": false, - "total_acs": 11011, - "total_submitted": 30522, - "total_column_articles": 158, + "total_acs": 11296, + "total_submitted": 31121, + "total_column_articles": 161, "frontend_question_id": "924", "is_new_question": false }, @@ -53079,8 +53583,8 @@ "question__title": "3Sum With Multiplicity", "question__title_slug": "3sum-with-multiplicity", "question__hide": false, - "total_acs": 10906, - "total_submitted": 28975, + "total_acs": 11107, + "total_submitted": 29289, "total_column_articles": 129, "frontend_question_id": "923", "is_new_question": false @@ -53100,9 +53604,9 @@ "question__title": "Sort Array By Parity II", "question__title_slug": "sort-array-by-parity-ii", "question__hide": false, - "total_acs": 123790, - "total_submitted": 173544, - "total_column_articles": 1110, + "total_acs": 124797, + "total_submitted": 174837, + "total_column_articles": 1120, "frontend_question_id": "922", "is_new_question": false }, @@ -53121,9 +53625,9 @@ "question__title": "Minimum Add to Make Parentheses Valid", "question__title_slug": "minimum-add-to-make-parentheses-valid", "question__hide": false, - "total_acs": 70723, - "total_submitted": 96716, - "total_column_articles": 938, + "total_acs": 71462, + "total_submitted": 97652, + "total_column_articles": 940, "frontend_question_id": "921", "is_new_question": false }, @@ -53142,8 +53646,8 @@ "question__title": "Number of Music Playlists", "question__title_slug": "number-of-music-playlists", "question__hide": false, - "total_acs": 4012, - "total_submitted": 7498, + "total_acs": 4176, + "total_submitted": 7699, "total_column_articles": 43, "frontend_question_id": "920", "is_new_question": false @@ -53163,9 +53667,9 @@ "question__title": "Complete Binary Tree Inserter", "question__title_slug": "complete-binary-tree-inserter", "question__hide": false, - "total_acs": 33129, - "total_submitted": 49442, - "total_column_articles": 422, + "total_acs": 33366, + "total_submitted": 49748, + "total_column_articles": 421, "frontend_question_id": "919", "is_new_question": false }, @@ -53184,9 +53688,9 @@ "question__title": "Maximum Sum Circular Subarray", "question__title_slug": "maximum-sum-circular-subarray", "question__hide": false, - "total_acs": 80494, - "total_submitted": 195550, - "total_column_articles": 648, + "total_acs": 82572, + "total_submitted": 199860, + "total_column_articles": 655, "frontend_question_id": "918", "is_new_question": false }, @@ -53205,9 +53709,9 @@ "question__title": "Reverse Only Letters", "question__title_slug": "reverse-only-letters", "question__hide": false, - "total_acs": 82026, - "total_submitted": 138308, - "total_column_articles": 1119, + "total_acs": 82691, + "total_submitted": 139350, + "total_column_articles": 1126, "frontend_question_id": "917", "is_new_question": false }, @@ -53226,8 +53730,8 @@ "question__title": "Word Subsets", "question__title_slug": "word-subsets", "question__hide": false, - "total_acs": 10196, - "total_submitted": 21790, + "total_acs": 10387, + "total_submitted": 22085, "total_column_articles": 135, "frontend_question_id": "916", "is_new_question": false @@ -53247,8 +53751,8 @@ "question__title": "Partition Array into Disjoint Intervals", "question__title_slug": "partition-array-into-disjoint-intervals", "question__hide": false, - "total_acs": 50144, - "total_submitted": 100010, + "total_acs": 50427, + "total_submitted": 100500, "total_column_articles": 568, "frontend_question_id": "915", "is_new_question": false @@ -53268,8 +53772,8 @@ "question__title": "X of a Kind in a Deck of Cards", "question__title_slug": "x-of-a-kind-in-a-deck-of-cards", "question__hide": false, - "total_acs": 62847, - "total_submitted": 169035, + "total_acs": 63391, + "total_submitted": 170484, "total_column_articles": 766, "frontend_question_id": "914", "is_new_question": false @@ -53289,8 +53793,8 @@ "question__title": "Cat and Mouse", "question__title_slug": "cat-and-mouse", "question__hide": false, - "total_acs": 18531, - "total_submitted": 35051, + "total_acs": 18560, + "total_submitted": 35308, "total_column_articles": 142, "frontend_question_id": "913", "is_new_question": false @@ -53310,9 +53814,9 @@ "question__title": "Sort an Array", "question__title_slug": "sort-an-array", "question__hide": false, - "total_acs": 614152, - "total_submitted": 1234592, - "total_column_articles": 2346, + "total_acs": 625479, + "total_submitted": 1262699, + "total_column_articles": 2378, "frontend_question_id": "912", "is_new_question": false }, @@ -53331,8 +53835,8 @@ "question__title": "Online Election", "question__title_slug": "online-election", "question__hide": false, - "total_acs": 33087, - "total_submitted": 61514, + "total_acs": 33294, + "total_submitted": 61782, "total_column_articles": 378, "frontend_question_id": "911", "is_new_question": false @@ -53352,8 +53856,8 @@ "question__title": "Smallest Range II", "question__title_slug": "smallest-range-ii", "question__hide": false, - "total_acs": 12727, - "total_submitted": 35283, + "total_acs": 12927, + "total_submitted": 35602, "total_column_articles": 126, "frontend_question_id": "910", "is_new_question": false @@ -53373,9 +53877,9 @@ "question__title": "Snakes and Ladders", "question__title_slug": "snakes-and-ladders", "question__hide": false, - "total_acs": 26041, - "total_submitted": 58472, - "total_column_articles": 248, + "total_acs": 27413, + "total_submitted": 61687, + "total_column_articles": 256, "frontend_question_id": "909", "is_new_question": false }, @@ -53394,9 +53898,9 @@ "question__title": "Smallest Range I", "question__title_slug": "smallest-range-i", "question__hide": false, - "total_acs": 58472, - "total_submitted": 78559, - "total_column_articles": 599, + "total_acs": 58977, + "total_submitted": 79170, + "total_column_articles": 600, "frontend_question_id": "908", "is_new_question": false }, @@ -53415,9 +53919,9 @@ "question__title": "Sum of Subarray Minimums", "question__title_slug": "sum-of-subarray-minimums", "question__hide": false, - "total_acs": 65500, - "total_submitted": 165773, - "total_column_articles": 559, + "total_acs": 66120, + "total_submitted": 167234, + "total_column_articles": 562, "frontend_question_id": "907", "is_new_question": false }, @@ -53436,9 +53940,9 @@ "question__title": "Super Palindromes", "question__title_slug": "super-palindromes", "question__hide": false, - "total_acs": 5059, - "total_submitted": 15658, - "total_column_articles": 85, + "total_acs": 5267, + "total_submitted": 16175, + "total_column_articles": 86, "frontend_question_id": "906", "is_new_question": false }, @@ -53457,9 +53961,9 @@ "question__title": "Sort Array By Parity", "question__title_slug": "sort-array-by-parity", "question__hide": false, - "total_acs": 129568, - "total_submitted": 182386, - "total_column_articles": 1512, + "total_acs": 130926, + "total_submitted": 184220, + "total_column_articles": 1520, "frontend_question_id": "905", "is_new_question": false }, @@ -53478,9 +53982,9 @@ "question__title": "Fruit Into Baskets", "question__title_slug": "fruit-into-baskets", "question__hide": false, - "total_acs": 154774, - "total_submitted": 344630, - "total_column_articles": 1644, + "total_acs": 158912, + "total_submitted": 353896, + "total_column_articles": 1674, "frontend_question_id": "904", "is_new_question": false }, @@ -53499,8 +54003,8 @@ "question__title": "Valid Permutations for DI Sequence", "question__title_slug": "valid-permutations-for-di-sequence", "question__hide": false, - "total_acs": 4730, - "total_submitted": 8272, + "total_acs": 4891, + "total_submitted": 8495, "total_column_articles": 68, "frontend_question_id": "903", "is_new_question": false @@ -53520,9 +54024,9 @@ "question__title": "Numbers At Most N Given Digit Set", "question__title_slug": "numbers-at-most-n-given-digit-set", "question__hide": false, - "total_acs": 30023, - "total_submitted": 63629, - "total_column_articles": 418, + "total_acs": 30323, + "total_submitted": 64092, + "total_column_articles": 419, "frontend_question_id": "902", "is_new_question": false }, @@ -53541,9 +54045,9 @@ "question__title": "Online Stock Span", "question__title_slug": "online-stock-span", "question__hide": false, - "total_acs": 87065, - "total_submitted": 135809, - "total_column_articles": 804, + "total_acs": 88042, + "total_submitted": 137393, + "total_column_articles": 808, "frontend_question_id": "901", "is_new_question": false }, @@ -53562,9 +54066,9 @@ "question__title": "RLE Iterator", "question__title_slug": "rle-iterator", "question__hide": false, - "total_acs": 6369, - "total_submitted": 12316, - "total_column_articles": 94, + "total_acs": 6686, + "total_submitted": 12771, + "total_column_articles": 95, "frontend_question_id": "900", "is_new_question": false }, @@ -53583,9 +54087,9 @@ "question__title": "Orderly Queue", "question__title_slug": "orderly-queue", "question__hide": false, - "total_acs": 29239, - "total_submitted": 45849, - "total_column_articles": 284, + "total_acs": 29463, + "total_submitted": 46193, + "total_column_articles": 287, "frontend_question_id": "899", "is_new_question": false }, @@ -53604,9 +54108,9 @@ "question__title": "Bitwise ORs of Subarrays", "question__title_slug": "bitwise-ors-of-subarrays", "question__hide": false, - "total_acs": 9839, - "total_submitted": 24255, - "total_column_articles": 64, + "total_acs": 9994, + "total_submitted": 24526, + "total_column_articles": 66, "frontend_question_id": "898", "is_new_question": false }, @@ -53625,9 +54129,9 @@ "question__title": "Increasing Order Search Tree", "question__title_slug": "increasing-order-search-tree", "question__hide": false, - "total_acs": 81993, - "total_submitted": 111049, - "total_column_articles": 927, + "total_acs": 82547, + "total_submitted": 111760, + "total_column_articles": 926, "frontend_question_id": "897", "is_new_question": false }, @@ -53646,9 +54150,9 @@ "question__title": "Monotonic Array", "question__title_slug": "monotonic-array", "question__hide": false, - "total_acs": 95744, - "total_submitted": 168895, - "total_column_articles": 1094, + "total_acs": 98518, + "total_submitted": 174117, + "total_column_articles": 1125, "frontend_question_id": "896", "is_new_question": false }, @@ -53667,9 +54171,9 @@ "question__title": "Maximum Frequency Stack", "question__title_slug": "maximum-frequency-stack", "question__hide": false, - "total_acs": 33601, - "total_submitted": 52560, - "total_column_articles": 329, + "total_acs": 33936, + "total_submitted": 53078, + "total_column_articles": 330, "frontend_question_id": "895", "is_new_question": false }, @@ -53688,9 +54192,9 @@ "question__title": "All Possible Full Binary Trees", "question__title_slug": "all-possible-full-binary-trees", "question__hide": false, - "total_acs": 21156, - "total_submitted": 27233, - "total_column_articles": 213, + "total_acs": 21356, + "total_submitted": 27495, + "total_column_articles": 214, "frontend_question_id": "894", "is_new_question": false }, @@ -53709,9 +54213,9 @@ "question__title": "Groups of Special-Equivalent Strings", "question__title_slug": "groups-of-special-equivalent-strings", "question__hide": false, - "total_acs": 13848, - "total_submitted": 18840, - "total_column_articles": 149, + "total_acs": 13919, + "total_submitted": 18922, + "total_column_articles": 150, "frontend_question_id": "893", "is_new_question": false }, @@ -53730,9 +54234,9 @@ "question__title": "Surface Area of 3D Shapes", "question__title_slug": "surface-area-of-3d-shapes", "question__hide": false, - "total_acs": 40231, - "total_submitted": 62108, - "total_column_articles": 789, + "total_acs": 40410, + "total_submitted": 62340, + "total_column_articles": 788, "frontend_question_id": "892", "is_new_question": false }, @@ -53751,8 +54255,8 @@ "question__title": "Sum of Subsequence Widths", "question__title_slug": "sum-of-subsequence-widths", "question__hide": false, - "total_acs": 21308, - "total_submitted": 45677, + "total_acs": 21371, + "total_submitted": 45798, "total_column_articles": 204, "frontend_question_id": "891", "is_new_question": false @@ -53772,9 +54276,9 @@ "question__title": "Find and Replace Pattern", "question__title_slug": "find-and-replace-pattern", "question__hide": false, - "total_acs": 32859, - "total_submitted": 41766, - "total_column_articles": 490, + "total_acs": 32984, + "total_submitted": 41938, + "total_column_articles": 488, "frontend_question_id": "890", "is_new_question": false }, @@ -53793,9 +54297,9 @@ "question__title": "Construct Binary Tree from Preorder and Postorder Traversal", "question__title_slug": "construct-binary-tree-from-preorder-and-postorder-traversal", "question__hide": false, - "total_acs": 58245, - "total_submitted": 83155, - "total_column_articles": 506, + "total_acs": 59200, + "total_submitted": 84529, + "total_column_articles": 513, "frontend_question_id": "889", "is_new_question": false }, @@ -53814,9 +54318,9 @@ "question__title": "Fair Candy Swap", "question__title_slug": "fair-candy-swap", "question__hide": false, - "total_acs": 72239, - "total_submitted": 113804, - "total_column_articles": 638, + "total_acs": 72755, + "total_submitted": 114556, + "total_column_articles": 639, "frontend_question_id": "888", "is_new_question": false }, @@ -53835,9 +54339,9 @@ "question__title": "Super Egg Drop", "question__title_slug": "super-egg-drop", "question__hide": false, - "total_acs": 82302, - "total_submitted": 266328, - "total_column_articles": 481, + "total_acs": 82867, + "total_submitted": 267762, + "total_column_articles": 482, "frontend_question_id": "887", "is_new_question": false }, @@ -53856,9 +54360,9 @@ "question__title": "Possible Bipartition", "question__title_slug": "possible-bipartition", "question__hide": false, - "total_acs": 51963, - "total_submitted": 99399, - "total_column_articles": 632, + "total_acs": 52354, + "total_submitted": 100056, + "total_column_articles": 633, "frontend_question_id": "886", "is_new_question": false }, @@ -53877,9 +54381,9 @@ "question__title": "Spiral Matrix III", "question__title_slug": "spiral-matrix-iii", "question__hide": false, - "total_acs": 9316, - "total_submitted": 12936, - "total_column_articles": 142, + "total_acs": 9414, + "total_submitted": 13072, + "total_column_articles": 143, "frontend_question_id": "885", "is_new_question": false }, @@ -53898,9 +54402,9 @@ "question__title": "Uncommon Words from Two Sentences", "question__title_slug": "uncommon-words-from-two-sentences", "question__hide": false, - "total_acs": 53683, - "total_submitted": 75291, - "total_column_articles": 679, + "total_acs": 53988, + "total_submitted": 75734, + "total_column_articles": 678, "frontend_question_id": "884", "is_new_question": false }, @@ -53919,9 +54423,9 @@ "question__title": "Projection Area of 3D Shapes", "question__title_slug": "projection-area-of-3d-shapes", "question__hide": false, - "total_acs": 47673, - "total_submitted": 62263, - "total_column_articles": 581, + "total_acs": 47876, + "total_submitted": 62520, + "total_column_articles": 579, "frontend_question_id": "883", "is_new_question": false }, @@ -53940,9 +54444,9 @@ "question__title": "Reachable Nodes In Subdivided Graph", "question__title_slug": "reachable-nodes-in-subdivided-graph", "question__hide": false, - "total_acs": 16469, - "total_submitted": 25791, - "total_column_articles": 148, + "total_acs": 16540, + "total_submitted": 25929, + "total_column_articles": 150, "frontend_question_id": "882", "is_new_question": false }, @@ -53961,9 +54465,9 @@ "question__title": "Boats to Save People", "question__title_slug": "boats-to-save-people", "question__hide": false, - "total_acs": 73223, - "total_submitted": 135202, - "total_column_articles": 787, + "total_acs": 73978, + "total_submitted": 136467, + "total_column_articles": 788, "frontend_question_id": "881", "is_new_question": false }, @@ -53982,8 +54486,8 @@ "question__title": "Decoded String at Index", "question__title_slug": "decoded-string-at-index", "question__hide": false, - "total_acs": 9362, - "total_submitted": 34109, + "total_acs": 9423, + "total_submitted": 34271, "total_column_articles": 117, "frontend_question_id": "880", "is_new_question": false @@ -54003,8 +54507,8 @@ "question__title": "Generate Random Point in a Circle", "question__title_slug": "generate-random-point-in-a-circle", "question__hide": false, - "total_acs": 31005, - "total_submitted": 64182, + "total_acs": 31106, + "total_submitted": 64372, "total_column_articles": 192, "frontend_question_id": "478", "is_new_question": false @@ -54024,9 +54528,9 @@ "question__title": "Random Point in Non-overlapping Rectangles", "question__title_slug": "random-point-in-non-overlapping-rectangles", "question__hide": false, - "total_acs": 25044, - "total_submitted": 59680, - "total_column_articles": 219, + "total_acs": 25127, + "total_submitted": 59869, + "total_column_articles": 220, "frontend_question_id": "497", "is_new_question": false }, @@ -54045,9 +54549,9 @@ "question__title": "Random Flip Matrix", "question__title_slug": "random-flip-matrix", "question__hide": false, - "total_acs": 22845, - "total_submitted": 49381, - "total_column_articles": 217, + "total_acs": 22908, + "total_submitted": 49613, + "total_column_articles": 218, "frontend_question_id": "519", "is_new_question": false }, @@ -54066,8 +54570,8 @@ "question__title": "Random Pick with Weight", "question__title_slug": "random-pick-with-weight", "question__hide": false, - "total_acs": 61788, - "total_submitted": 126881, + "total_acs": 62262, + "total_submitted": 127710, "total_column_articles": 509, "frontend_question_id": "528", "is_new_question": false @@ -54087,8 +54591,8 @@ "question__title": "Profitable Schemes", "question__title_slug": "profitable-schemes", "question__hide": false, - "total_acs": 30099, - "total_submitted": 55119, + "total_acs": 30324, + "total_submitted": 55573, "total_column_articles": 244, "frontend_question_id": "879", "is_new_question": false @@ -54108,9 +54612,9 @@ "question__title": "Nth Magical Number", "question__title_slug": "nth-magical-number", "question__hide": false, - "total_acs": 25381, - "total_submitted": 63111, - "total_column_articles": 226, + "total_acs": 25541, + "total_submitted": 63483, + "total_column_articles": 230, "frontend_question_id": "878", "is_new_question": false }, @@ -54129,8 +54633,8 @@ "question__title": "Stone Game", "question__title_slug": "stone-game", "question__hide": false, - "total_acs": 101510, - "total_submitted": 132361, + "total_acs": 102031, + "total_submitted": 133048, "total_column_articles": 686, "frontend_question_id": "877", "is_new_question": false @@ -54150,9 +54654,9 @@ "question__title": "Middle of the Linked List", "question__title_slug": "middle-of-the-linked-list", "question__hide": false, - "total_acs": 440117, - "total_submitted": 622320, - "total_column_articles": 3764, + "total_acs": 445367, + "total_submitted": 628880, + "total_column_articles": 3791, "frontend_question_id": "876", "is_new_question": false }, @@ -54171,9 +54675,9 @@ "question__title": "Koko Eating Bananas", "question__title_slug": "koko-eating-bananas", "question__hide": false, - "total_acs": 146552, - "total_submitted": 296441, - "total_column_articles": 1043, + "total_acs": 148483, + "total_submitted": 300340, + "total_column_articles": 1050, "frontend_question_id": "875", "is_new_question": false }, @@ -54192,9 +54696,9 @@ "question__title": "Walking Robot Simulation", "question__title_slug": "walking-robot-simulation", "question__hide": false, - "total_acs": 45313, - "total_submitted": 95574, - "total_column_articles": 512, + "total_acs": 45497, + "total_submitted": 95922, + "total_column_articles": 511, "frontend_question_id": "874", "is_new_question": false }, @@ -54213,9 +54717,9 @@ "question__title": "Length of Longest Fibonacci Subsequence", "question__title_slug": "length-of-longest-fibonacci-subsequence", "question__hide": false, - "total_acs": 52753, - "total_submitted": 93844, - "total_column_articles": 390, + "total_acs": 53195, + "total_submitted": 94646, + "total_column_articles": 389, "frontend_question_id": "873", "is_new_question": false }, @@ -54234,9 +54738,9 @@ "question__title": "Leaf-Similar Trees", "question__title_slug": "leaf-similar-trees", "question__hide": false, - "total_acs": 85295, - "total_submitted": 130867, - "total_column_articles": 976, + "total_acs": 86422, + "total_submitted": 132664, + "total_column_articles": 983, "frontend_question_id": "872", "is_new_question": false }, @@ -54255,9 +54759,9 @@ "question__title": "Implement Rand10() Using Rand7()", "question__title_slug": "implement-rand10-using-rand7", "question__hide": false, - "total_acs": 108803, - "total_submitted": 197392, - "total_column_articles": 489, + "total_acs": 109894, + "total_submitted": 199312, + "total_column_articles": 495, "frontend_question_id": "470", "is_new_question": false }, @@ -54276,9 +54780,9 @@ "question__title": "Minimum Number of Refueling Stops", "question__title_slug": "minimum-number-of-refueling-stops", "question__hide": false, - "total_acs": 36421, - "total_submitted": 83626, - "total_column_articles": 384, + "total_acs": 36614, + "total_submitted": 84104, + "total_column_articles": 385, "frontend_question_id": "871", "is_new_question": false }, @@ -54297,9 +54801,9 @@ "question__title": "Advantage Shuffle", "question__title_slug": "advantage-shuffle", "question__hide": false, - "total_acs": 70604, - "total_submitted": 138564, - "total_column_articles": 787, + "total_acs": 71213, + "total_submitted": 139567, + "total_column_articles": 788, "frontend_question_id": "870", "is_new_question": false }, @@ -54318,9 +54822,9 @@ "question__title": "Reordered Power of 2", "question__title_slug": "reordered-power-of-2", "question__hide": false, - "total_acs": 38363, - "total_submitted": 60481, - "total_column_articles": 552, + "total_acs": 38527, + "total_submitted": 60769, + "total_column_articles": 549, "frontend_question_id": "869", "is_new_question": false }, @@ -54339,9 +54843,9 @@ "question__title": "Binary Gap", "question__title_slug": "binary-gap", "question__hide": false, - "total_acs": 54314, - "total_submitted": 78068, - "total_column_articles": 718, + "total_acs": 54736, + "total_submitted": 78610, + "total_column_articles": 719, "frontend_question_id": "868", "is_new_question": false }, @@ -54360,9 +54864,9 @@ "question__title": "Transpose Matrix", "question__title_slug": "transpose-matrix", "question__hide": false, - "total_acs": 106300, - "total_submitted": 158547, - "total_column_articles": 909, + "total_acs": 107378, + "total_submitted": 160034, + "total_column_articles": 911, "frontend_question_id": "867", "is_new_question": false }, @@ -54381,8 +54885,8 @@ "question__title": "Prime Palindrome", "question__title_slug": "prime-palindrome", "question__hide": false, - "total_acs": 12246, - "total_submitted": 50546, + "total_acs": 12369, + "total_submitted": 50934, "total_column_articles": 133, "frontend_question_id": "866", "is_new_question": false @@ -54402,9 +54906,9 @@ "question__title": "Smallest Subtree with all the Deepest Nodes", "question__title_slug": "smallest-subtree-with-all-the-deepest-nodes", "question__hide": false, - "total_acs": 18922, - "total_submitted": 26796, - "total_column_articles": 245, + "total_acs": 19097, + "total_submitted": 27004, + "total_column_articles": 247, "frontend_question_id": "865", "is_new_question": false }, @@ -54423,9 +54927,9 @@ "question__title": "Shortest Path to Get All Keys", "question__title_slug": "shortest-path-to-get-all-keys", "question__hide": false, - "total_acs": 22085, - "total_submitted": 37269, - "total_column_articles": 254, + "total_acs": 22242, + "total_submitted": 37582, + "total_column_articles": 255, "frontend_question_id": "864", "is_new_question": false }, @@ -54444,9 +54948,9 @@ "question__title": "Random Pick with Blacklist", "question__title_slug": "random-pick-with-blacklist", "question__hide": false, - "total_acs": 32162, - "total_submitted": 74018, - "total_column_articles": 454, + "total_acs": 32424, + "total_submitted": 74708, + "total_column_articles": 458, "frontend_question_id": "710", "is_new_question": false }, @@ -54465,8 +54969,8 @@ "question__title": "All Nodes Distance K in Binary Tree", "question__title_slug": "all-nodes-distance-k-in-binary-tree", "question__hide": false, - "total_acs": 56688, - "total_submitted": 92322, + "total_acs": 57090, + "total_submitted": 92987, "total_column_articles": 786, "frontend_question_id": "863", "is_new_question": false @@ -54486,9 +54990,9 @@ "question__title": "Shortest Subarray with Sum at Least K", "question__title_slug": "shortest-subarray-with-sum-at-least-k", "question__hide": false, - "total_acs": 51426, - "total_submitted": 190547, - "total_column_articles": 397, + "total_acs": 51773, + "total_submitted": 191542, + "total_column_articles": 398, "frontend_question_id": "862", "is_new_question": false }, @@ -54507,9 +55011,9 @@ "question__title": "Score After Flipping Matrix", "question__title_slug": "score-after-flipping-matrix", "question__hide": false, - "total_acs": 37242, - "total_submitted": 46131, - "total_column_articles": 530, + "total_acs": 37346, + "total_submitted": 46271, + "total_column_articles": 528, "frontend_question_id": "861", "is_new_question": false }, @@ -54528,9 +55032,9 @@ "question__title": "Lemonade Change", "question__title_slug": "lemonade-change", "question__hide": false, - "total_acs": 221927, - "total_submitted": 376145, - "total_column_articles": 1608, + "total_acs": 227412, + "total_submitted": 385744, + "total_column_articles": 1632, "frontend_question_id": "860", "is_new_question": false }, @@ -54549,8 +55053,8 @@ "question__title": "Buddy Strings", "question__title_slug": "buddy-strings", "question__hide": false, - "total_acs": 73538, - "total_submitted": 211553, + "total_acs": 73977, + "total_submitted": 212631, "total_column_articles": 928, "frontend_question_id": "859", "is_new_question": false @@ -54570,8 +55074,8 @@ "question__title": "Mirror Reflection", "question__title_slug": "mirror-reflection", "question__hide": false, - "total_acs": 5636, - "total_submitted": 9677, + "total_acs": 5702, + "total_submitted": 9816, "total_column_articles": 85, "frontend_question_id": "858", "is_new_question": false @@ -54591,8 +55095,8 @@ "question__title": "Minimum Cost to Hire K Workers", "question__title_slug": "minimum-cost-to-hire-k-workers", "question__hide": false, - "total_acs": 21049, - "total_submitted": 33048, + "total_acs": 21121, + "total_submitted": 33149, "total_column_articles": 224, "frontend_question_id": "857", "is_new_question": false @@ -54612,9 +55116,9 @@ "question__title": "Score of Parentheses", "question__title_slug": "score-of-parentheses", "question__hide": false, - "total_acs": 56020, - "total_submitted": 81796, - "total_column_articles": 716, + "total_acs": 56175, + "total_submitted": 82035, + "total_column_articles": 718, "frontend_question_id": "856", "is_new_question": false }, @@ -54633,9 +55137,9 @@ "question__title": "Exam Room", "question__title_slug": "exam-room", "question__hide": false, - "total_acs": 22651, - "total_submitted": 47798, - "total_column_articles": 234, + "total_acs": 22704, + "total_submitted": 47993, + "total_column_articles": 235, "frontend_question_id": "855", "is_new_question": false }, @@ -54654,8 +55158,8 @@ "question__title": "K-Similar Strings", "question__title_slug": "k-similar-strings", "question__hide": false, - "total_acs": 26625, - "total_submitted": 56858, + "total_acs": 26657, + "total_submitted": 56935, "total_column_articles": 251, "frontend_question_id": "854", "is_new_question": false @@ -54675,9 +55179,9 @@ "question__title": "Car Fleet", "question__title_slug": "car-fleet", "question__hide": false, - "total_acs": 20163, - "total_submitted": 47621, - "total_column_articles": 228, + "total_acs": 20432, + "total_submitted": 48103, + "total_column_articles": 229, "frontend_question_id": "853", "is_new_question": false }, @@ -54696,9 +55200,9 @@ "question__title": "Peak Index in a Mountain Array", "question__title_slug": "peak-index-in-a-mountain-array", "question__hide": false, - "total_acs": 151594, - "total_submitted": 221444, - "total_column_articles": 1205, + "total_acs": 153398, + "total_submitted": 224089, + "total_column_articles": 1211, "frontend_question_id": "852", "is_new_question": false }, @@ -54717,9 +55221,9 @@ "question__title": "Loud and Rich", "question__title_slug": "loud-and-rich", "question__hide": false, - "total_acs": 32424, - "total_submitted": 51260, - "total_column_articles": 340, + "total_acs": 32607, + "total_submitted": 51562, + "total_column_articles": 341, "frontend_question_id": "851", "is_new_question": false }, @@ -54738,8 +55242,8 @@ "question__title": "Rectangle Area II", "question__title_slug": "rectangle-area-ii", "question__hide": false, - "total_acs": 19758, - "total_submitted": 31457, + "total_acs": 19797, + "total_submitted": 31541, "total_column_articles": 186, "frontend_question_id": "850", "is_new_question": false @@ -54759,9 +55263,9 @@ "question__title": "Maximize Distance to Closest Person", "question__title_slug": "maximize-distance-to-closest-person", "question__hide": false, - "total_acs": 48284, - "total_submitted": 93144, - "total_column_articles": 592, + "total_acs": 48427, + "total_submitted": 93409, + "total_column_articles": 594, "frontend_question_id": "849", "is_new_question": false }, @@ -54780,9 +55284,9 @@ "question__title": "Shifting Letters", "question__title_slug": "shifting-letters", "question__hide": false, - "total_acs": 15481, - "total_submitted": 33232, - "total_column_articles": 161, + "total_acs": 15627, + "total_submitted": 33593, + "total_column_articles": 165, "frontend_question_id": "848", "is_new_question": false }, @@ -54801,8 +55305,8 @@ "question__title": "Shortest Path Visiting All Nodes", "question__title_slug": "shortest-path-visiting-all-nodes", "question__hide": false, - "total_acs": 27892, - "total_submitted": 41426, + "total_acs": 28043, + "total_submitted": 41655, "total_column_articles": 241, "frontend_question_id": "847", "is_new_question": false @@ -54822,9 +55326,9 @@ "question__title": "Hand of Straights", "question__title_slug": "hand-of-straights", "question__hide": false, - "total_acs": 42272, - "total_submitted": 73879, - "total_column_articles": 552, + "total_acs": 42499, + "total_submitted": 74245, + "total_column_articles": 554, "frontend_question_id": "846", "is_new_question": false }, @@ -54843,8 +55347,8 @@ "question__title": "Longest Mountain in Array", "question__title_slug": "longest-mountain-in-array", "question__hide": false, - "total_acs": 51978, - "total_submitted": 122678, + "total_acs": 52439, + "total_submitted": 123800, "total_column_articles": 752, "frontend_question_id": "845", "is_new_question": false @@ -54864,9 +55368,9 @@ "question__title": "Backspace String Compare", "question__title_slug": "backspace-string-compare", "question__hide": false, - "total_acs": 230747, - "total_submitted": 482429, - "total_column_articles": 2102, + "total_acs": 234981, + "total_submitted": 491572, + "total_column_articles": 2127, "frontend_question_id": "844", "is_new_question": false }, @@ -54885,9 +55389,9 @@ "question__title": "Guess the Word", "question__title_slug": "guess-the-word", "question__hide": false, - "total_acs": 5023, - "total_submitted": 13624, - "total_column_articles": 71, + "total_acs": 5036, + "total_submitted": 13678, + "total_column_articles": 72, "frontend_question_id": "843", "is_new_question": false }, @@ -54906,9 +55410,9 @@ "question__title": "Split Array into Fibonacci Sequence", "question__title_slug": "split-array-into-fibonacci-sequence", "question__hide": false, - "total_acs": 35051, - "total_submitted": 72345, - "total_column_articles": 389, + "total_acs": 35167, + "total_submitted": 72646, + "total_column_articles": 387, "frontend_question_id": "842", "is_new_question": false }, @@ -54927,9 +55431,9 @@ "question__title": "Keys and Rooms", "question__title_slug": "keys-and-rooms", "question__hide": false, - "total_acs": 107207, - "total_submitted": 155054, - "total_column_articles": 901, + "total_acs": 109927, + "total_submitted": 158681, + "total_column_articles": 914, "frontend_question_id": "841", "is_new_question": false }, @@ -54948,9 +55452,9 @@ "question__title": "Magic Squares In Grid", "question__title_slug": "magic-squares-in-grid", "question__hide": false, - "total_acs": 12377, - "total_submitted": 33437, - "total_column_articles": 155, + "total_acs": 12470, + "total_submitted": 33672, + "total_column_articles": 156, "frontend_question_id": "840", "is_new_question": false }, @@ -54969,8 +55473,8 @@ "question__title": "Similar String Groups", "question__title_slug": "similar-string-groups", "question__hide": false, - "total_acs": 26087, - "total_submitted": 43985, + "total_acs": 26297, + "total_submitted": 44299, "total_column_articles": 349, "frontend_question_id": "839", "is_new_question": false @@ -54990,9 +55494,9 @@ "question__title": "Push Dominoes", "question__title_slug": "push-dominoes", "question__hide": false, - "total_acs": 40689, - "total_submitted": 72850, - "total_column_articles": 568, + "total_acs": 40797, + "total_submitted": 73050, + "total_column_articles": 565, "frontend_question_id": "838", "is_new_question": false }, @@ -55011,9 +55515,9 @@ "question__title": "New 21 Game", "question__title_slug": "new-21-game", "question__hide": false, - "total_acs": 23412, - "total_submitted": 58985, - "total_column_articles": 278, + "total_acs": 23501, + "total_submitted": 59276, + "total_column_articles": 279, "frontend_question_id": "837", "is_new_question": false }, @@ -55032,9 +55536,9 @@ "question__title": "Rectangle Overlap", "question__title_slug": "rectangle-overlap", "question__hide": false, - "total_acs": 52007, - "total_submitted": 105446, - "total_column_articles": 792, + "total_acs": 52337, + "total_submitted": 105981, + "total_column_articles": 791, "frontend_question_id": "836", "is_new_question": false }, @@ -55053,8 +55557,8 @@ "question__title": "Robot Room Cleaner", "question__title_slug": "robot-room-cleaner", "question__hide": false, - "total_acs": 3862, - "total_submitted": 5227, + "total_acs": 3892, + "total_submitted": 5266, "total_column_articles": 40, "frontend_question_id": "489", "is_new_question": false @@ -55074,8 +55578,8 @@ "question__title": "Image Overlap", "question__title_slug": "image-overlap", "question__hide": false, - "total_acs": 7141, - "total_submitted": 12205, + "total_acs": 7216, + "total_submitted": 12318, "total_column_articles": 75, "frontend_question_id": "835", "is_new_question": false @@ -55095,9 +55599,9 @@ "question__title": "Sum of Distances in Tree", "question__title_slug": "sum-of-distances-in-tree", "question__hide": false, - "total_acs": 28807, - "total_submitted": 47165, - "total_column_articles": 250, + "total_acs": 29156, + "total_submitted": 47699, + "total_column_articles": 251, "frontend_question_id": "834", "is_new_question": false }, @@ -55116,8 +55620,8 @@ "question__title": "Find And Replace in String", "question__title_slug": "find-and-replace-in-string", "question__hide": false, - "total_acs": 28814, - "total_submitted": 56113, + "total_acs": 28891, + "total_submitted": 56317, "total_column_articles": 344, "frontend_question_id": "833", "is_new_question": false @@ -55137,9 +55641,9 @@ "question__title": "Flipping an Image", "question__title_slug": "flipping-an-image", "question__hide": false, - "total_acs": 105584, - "total_submitted": 132904, - "total_column_articles": 1175, + "total_acs": 106138, + "total_submitted": 133621, + "total_column_articles": 1177, "frontend_question_id": "832", "is_new_question": false }, @@ -55158,9 +55662,9 @@ "question__title": "Design Circular Queue", "question__title_slug": "design-circular-queue", "question__hide": false, - "total_acs": 141541, - "total_submitted": 303388, - "total_column_articles": 1056, + "total_acs": 142992, + "total_submitted": 306698, + "total_column_articles": 1062, "frontend_question_id": "622", "is_new_question": false }, @@ -55179,9 +55683,9 @@ "question__title": "Design Circular Deque", "question__title_slug": "design-circular-deque", "question__hide": false, - "total_acs": 63919, - "total_submitted": 112538, - "total_column_articles": 670, + "total_acs": 64509, + "total_submitted": 113649, + "total_column_articles": 667, "frontend_question_id": "641", "is_new_question": false }, @@ -55200,9 +55704,9 @@ "question__title": "Masking Personal Information", "question__title_slug": "masking-personal-information", "question__hide": false, - "total_acs": 28799, - "total_submitted": 53261, - "total_column_articles": 283, + "total_acs": 28880, + "total_submitted": 53399, + "total_column_articles": 284, "frontend_question_id": "831", "is_new_question": false }, @@ -55221,9 +55725,9 @@ "question__title": "Positions of Large Groups", "question__title_slug": "positions-of-large-groups", "question__hide": false, - "total_acs": 62914, - "total_submitted": 115971, - "total_column_articles": 730, + "total_acs": 63205, + "total_submitted": 116477, + "total_column_articles": 729, "frontend_question_id": "830", "is_new_question": false }, @@ -55242,9 +55746,9 @@ "question__title": "Consecutive Numbers Sum", "question__title_slug": "consecutive-numbers-sum", "question__hide": false, - "total_acs": 33299, - "total_submitted": 72132, - "total_column_articles": 388, + "total_acs": 33478, + "total_submitted": 72578, + "total_column_articles": 389, "frontend_question_id": "829", "is_new_question": false }, @@ -55263,9 +55767,9 @@ "question__title": "Count Unique Characters of All Substrings of a Given String", "question__title_slug": "count-unique-characters-of-all-substrings-of-a-given-string", "question__hide": false, - "total_acs": 39600, - "total_submitted": 57835, - "total_column_articles": 383, + "total_acs": 39695, + "total_submitted": 57995, + "total_column_articles": 384, "frontend_question_id": "828", "is_new_question": false }, @@ -55284,9 +55788,9 @@ "question__title": "Making A Large Island", "question__title_slug": "making-a-large-island", "question__hide": false, - "total_acs": 48234, - "total_submitted": 101896, - "total_column_articles": 610, + "total_acs": 49620, + "total_submitted": 105081, + "total_column_articles": 624, "frontend_question_id": "827", "is_new_question": false }, @@ -55305,9 +55809,9 @@ "question__title": "Most Profit Assigning Work", "question__title_slug": "most-profit-assigning-work", "question__hide": false, - "total_acs": 18090, - "total_submitted": 41740, - "total_column_articles": 243, + "total_acs": 18260, + "total_submitted": 42030, + "total_column_articles": 244, "frontend_question_id": "826", "is_new_question": false }, @@ -55326,9 +55830,9 @@ "question__title": "Friends Of Appropriate Ages", "question__title_slug": "friends-of-appropriate-ages", "question__hide": false, - "total_acs": 38355, - "total_submitted": 84283, - "total_column_articles": 368, + "total_acs": 38555, + "total_submitted": 84610, + "total_column_articles": 365, "frontend_question_id": "825", "is_new_question": false }, @@ -55347,8 +55851,8 @@ "question__title": "Goat Latin", "question__title_slug": "goat-latin", "question__hide": false, - "total_acs": 57176, - "total_submitted": 87603, + "total_acs": 57459, + "total_submitted": 87998, "total_column_articles": 767, "frontend_question_id": "824", "is_new_question": false @@ -55368,8 +55872,8 @@ "question__title": "Insert into a Sorted Circular Linked List", "question__title_slug": "insert-into-a-sorted-circular-linked-list", "question__hide": false, - "total_acs": 6830, - "total_submitted": 17821, + "total_acs": 6973, + "total_submitted": 18151, "total_column_articles": 117, "frontend_question_id": "708", "is_new_question": false @@ -55389,9 +55893,9 @@ "question__title": "Binary Trees With Factors", "question__title_slug": "binary-trees-with-factors", "question__hide": false, - "total_acs": 26121, - "total_submitted": 55517, - "total_column_articles": 219, + "total_acs": 26281, + "total_submitted": 55812, + "total_column_articles": 220, "frontend_question_id": "823", "is_new_question": false }, @@ -55410,8 +55914,8 @@ "question__title": "Card Flipping Game", "question__title_slug": "card-flipping-game", "question__hide": false, - "total_acs": 25536, - "total_submitted": 42918, + "total_acs": 25653, + "total_submitted": 43087, "total_column_articles": 245, "frontend_question_id": "822", "is_new_question": false @@ -55431,9 +55935,9 @@ "question__title": "Shortest Distance to a Character", "question__title_slug": "shortest-distance-to-a-character", "question__hide": false, - "total_acs": 78224, - "total_submitted": 107513, - "total_column_articles": 1047, + "total_acs": 78807, + "total_submitted": 108332, + "total_column_articles": 1048, "frontend_question_id": "821", "is_new_question": false }, @@ -55452,9 +55956,9 @@ "question__title": "Short Encoding of Words", "question__title_slug": "short-encoding-of-words", "question__hide": false, - "total_acs": 72361, - "total_submitted": 138430, - "total_column_articles": 753, + "total_acs": 72624, + "total_submitted": 138842, + "total_column_articles": 752, "frontend_question_id": "820", "is_new_question": false }, @@ -55473,9 +55977,9 @@ "question__title": "Design Linked List", "question__title_slug": "design-linked-list", "question__hide": false, - "total_acs": 288016, - "total_submitted": 835222, - "total_column_articles": 1601, + "total_acs": 296519, + "total_submitted": 861054, + "total_column_articles": 1632, "frontend_question_id": "707", "is_new_question": false }, @@ -55494,8 +55998,8 @@ "question__title": "Most Common Word", "question__title_slug": "most-common-word", "question__hide": false, - "total_acs": 64520, - "total_submitted": 141410, + "total_acs": 65009, + "total_submitted": 142468, "total_column_articles": 769, "frontend_question_id": "819", "is_new_question": false @@ -55515,8 +56019,8 @@ "question__title": "Race Car", "question__title_slug": "race-car", "question__hide": false, - "total_acs": 6518, - "total_submitted": 14386, + "total_acs": 6626, + "total_submitted": 14594, "total_column_articles": 74, "frontend_question_id": "818", "is_new_question": false @@ -55536,8 +56040,8 @@ "question__title": "Linked List Components", "question__title_slug": "linked-list-components", "question__hide": false, - "total_acs": 50578, - "total_submitted": 82527, + "total_acs": 50773, + "total_submitted": 82870, "total_column_articles": 592, "frontend_question_id": "817", "is_new_question": false @@ -55557,9 +56061,9 @@ "question__title": "Ambiguous Coordinates", "question__title_slug": "ambiguous-coordinates", "question__hide": false, - "total_acs": 28497, - "total_submitted": 45362, - "total_column_articles": 398, + "total_acs": 28664, + "total_submitted": 45600, + "total_column_articles": 399, "frontend_question_id": "816", "is_new_question": false }, @@ -55578,8 +56082,8 @@ "question__title": "Bus Routes", "question__title_slug": "bus-routes", "question__hide": false, - "total_acs": 39624, - "total_submitted": 89112, + "total_acs": 39821, + "total_submitted": 89498, "total_column_articles": 423, "frontend_question_id": "815", "is_new_question": false @@ -55599,9 +56103,9 @@ "question__title": "Binary Tree Pruning", "question__title_slug": "binary-tree-pruning", "question__hide": false, - "total_acs": 62647, - "total_submitted": 86290, - "total_column_articles": 819, + "total_acs": 63123, + "total_submitted": 86928, + "total_column_articles": 817, "frontend_question_id": "814", "is_new_question": false }, @@ -55620,9 +56124,9 @@ "question__title": "Largest Sum of Averages", "question__title_slug": "largest-sum-of-averages", "question__hide": false, - "total_acs": 29577, - "total_submitted": 47720, - "total_column_articles": 274, + "total_acs": 30041, + "total_submitted": 48389, + "total_column_articles": 276, "frontend_question_id": "813", "is_new_question": false }, @@ -55641,8 +56145,8 @@ "question__title": "Largest Triangle Area", "question__title_slug": "largest-triangle-area", "question__hide": false, - "total_acs": 38825, - "total_submitted": 56989, + "total_acs": 39161, + "total_submitted": 57477, "total_column_articles": 337, "frontend_question_id": "812", "is_new_question": false @@ -55662,9 +56166,9 @@ "question__title": "Subdomain Visit Count", "question__title_slug": "subdomain-visit-count", "question__hide": false, - "total_acs": 45531, - "total_submitted": 59270, - "total_column_articles": 571, + "total_acs": 45758, + "total_submitted": 59547, + "total_column_articles": 573, "frontend_question_id": "811", "is_new_question": false }, @@ -55683,8 +56187,8 @@ "question__title": "Chalkboard XOR Game", "question__title_slug": "chalkboard-xor-game", "question__hide": false, - "total_acs": 19752, - "total_submitted": 27202, + "total_acs": 19853, + "total_submitted": 27323, "total_column_articles": 157, "frontend_question_id": "810", "is_new_question": false @@ -55704,8 +56208,8 @@ "question__title": "Expressive Words", "question__title_slug": "expressive-words", "question__hide": false, - "total_acs": 26559, - "total_submitted": 54236, + "total_acs": 26701, + "total_submitted": 54464, "total_column_articles": 375, "frontend_question_id": "809", "is_new_question": false @@ -55725,8 +56229,8 @@ "question__title": "Soup Servings", "question__title_slug": "soup-servings", "question__hide": false, - "total_acs": 23306, - "total_submitted": 39862, + "total_acs": 23565, + "total_submitted": 40300, "total_column_articles": 172, "frontend_question_id": "808", "is_new_question": false @@ -55746,8 +56250,8 @@ "question__title": "Max Increase to Keep City Skyline", "question__title_slug": "max-increase-to-keep-city-skyline", "question__hide": false, - "total_acs": 56760, - "total_submitted": 64533, + "total_acs": 57115, + "total_submitted": 64943, "total_column_articles": 782, "frontend_question_id": "807", "is_new_question": false @@ -55767,9 +56271,9 @@ "question__title": "Number of Lines To Write String", "question__title_slug": "number-of-lines-to-write-string", "question__hide": false, - "total_acs": 55271, - "total_submitted": 80592, - "total_column_articles": 668, + "total_acs": 55661, + "total_submitted": 81149, + "total_column_articles": 666, "frontend_question_id": "806", "is_new_question": false }, @@ -55788,9 +56292,9 @@ "question__title": "Split Array With Same Average", "question__title_slug": "split-array-with-same-average", "question__hide": false, - "total_acs": 22935, - "total_submitted": 53565, - "total_column_articles": 194, + "total_acs": 23140, + "total_submitted": 53972, + "total_column_articles": 195, "frontend_question_id": "805", "is_new_question": false }, @@ -55809,9 +56313,9 @@ "question__title": "Unique Morse Code Words", "question__title_slug": "unique-morse-code-words", "question__hide": false, - "total_acs": 82646, - "total_submitted": 100603, - "total_column_articles": 871, + "total_acs": 83104, + "total_submitted": 101138, + "total_column_articles": 869, "frontend_question_id": "804", "is_new_question": false }, @@ -55830,9 +56334,9 @@ "question__title": "Bricks Falling When Hit", "question__title_slug": "bricks-falling-when-hit", "question__hide": false, - "total_acs": 15379, - "total_submitted": 32736, - "total_column_articles": 159, + "total_acs": 15529, + "total_submitted": 33004, + "total_column_articles": 160, "frontend_question_id": "803", "is_new_question": false }, @@ -55851,8 +56355,8 @@ "question__title": "Find Eventual Safe States", "question__title_slug": "find-eventual-safe-states", "question__hide": false, - "total_acs": 48532, - "total_submitted": 81971, + "total_acs": 49151, + "total_submitted": 83012, "total_column_articles": 486, "frontend_question_id": "802", "is_new_question": false @@ -55872,8 +56376,8 @@ "question__title": "Minimum Swaps To Make Sequences Increasing", "question__title_slug": "minimum-swaps-to-make-sequences-increasing", "question__hide": false, - "total_acs": 31955, - "total_submitted": 62918, + "total_acs": 32094, + "total_submitted": 63120, "total_column_articles": 325, "frontend_question_id": "801", "is_new_question": false @@ -55893,8 +56397,8 @@ "question__title": "Similar RGB Color", "question__title_slug": "similar-rgb-color", "question__hide": false, - "total_acs": 2570, - "total_submitted": 3670, + "total_acs": 2606, + "total_submitted": 3720, "total_column_articles": 58, "frontend_question_id": "800", "is_new_question": false @@ -55914,9 +56418,9 @@ "question__title": "Design HashMap", "question__title_slug": "design-hashmap", "question__hide": false, - "total_acs": 102963, - "total_submitted": 161549, - "total_column_articles": 622, + "total_acs": 103546, + "total_submitted": 162438, + "total_column_articles": 620, "frontend_question_id": "706", "is_new_question": false }, @@ -55935,9 +56439,9 @@ "question__title": "Design HashSet", "question__title_slug": "design-hashset", "question__hide": false, - "total_acs": 111049, - "total_submitted": 174934, - "total_column_articles": 649, + "total_acs": 111815, + "total_submitted": 176106, + "total_column_articles": 651, "frontend_question_id": "705", "is_new_question": false }, @@ -55956,9 +56460,9 @@ "question__title": "Champagne Tower", "question__title_slug": "champagne-tower", "question__hide": false, - "total_acs": 30445, - "total_submitted": 57112, - "total_column_articles": 315, + "total_acs": 30634, + "total_submitted": 57413, + "total_column_articles": 317, "frontend_question_id": "799", "is_new_question": false }, @@ -55977,8 +56481,8 @@ "question__title": "Smallest Rotation with Highest Score", "question__title_slug": "smallest-rotation-with-highest-score", "question__hide": false, - "total_acs": 21936, - "total_submitted": 35536, + "total_acs": 22017, + "total_submitted": 35690, "total_column_articles": 233, "frontend_question_id": "798", "is_new_question": false @@ -55998,9 +56502,9 @@ "question__title": "All Paths From Source to Target", "question__title_slug": "all-paths-from-source-to-target", "question__hide": false, - "total_acs": 124755, - "total_submitted": 158359, - "total_column_articles": 1951, + "total_acs": 128957, + "total_submitted": 163957, + "total_column_articles": 1963, "frontend_question_id": "797", "is_new_question": false }, @@ -56019,8 +56523,8 @@ "question__title": "Rotate String", "question__title_slug": "rotate-string", "question__hide": false, - "total_acs": 86192, - "total_submitted": 135688, + "total_acs": 87069, + "total_submitted": 136974, "total_column_articles": 946, "frontend_question_id": "796", "is_new_question": false @@ -56040,8 +56544,8 @@ "question__title": "Number of Subarrays with Bounded Maximum", "question__title_slug": "number-of-subarrays-with-bounded-maximum", "question__hide": false, - "total_acs": 37808, - "total_submitted": 65317, + "total_acs": 38058, + "total_submitted": 65775, "total_column_articles": 360, "frontend_question_id": "795", "is_new_question": false @@ -56061,9 +56565,9 @@ "question__title": "Valid Tic-Tac-Toe State", "question__title_slug": "valid-tic-tac-toe-state", "question__hide": false, - "total_acs": 32160, - "total_submitted": 83447, - "total_column_articles": 508, + "total_acs": 32285, + "total_submitted": 83770, + "total_column_articles": 506, "frontend_question_id": "794", "is_new_question": false }, @@ -56082,8 +56586,8 @@ "question__title": "Preimage Size of Factorial Zeroes Function", "question__title_slug": "preimage-size-of-factorial-zeroes-function", "question__hide": false, - "total_acs": 28900, - "total_submitted": 59470, + "total_acs": 29070, + "total_submitted": 59819, "total_column_articles": 293, "frontend_question_id": "793", "is_new_question": false @@ -56103,9 +56607,9 @@ "question__title": "Number of Matching Subsequences", "question__title_slug": "number-of-matching-subsequences", "question__hide": false, - "total_acs": 43121, - "total_submitted": 84647, - "total_column_articles": 459, + "total_acs": 43416, + "total_submitted": 85319, + "total_column_articles": 462, "frontend_question_id": "792", "is_new_question": false }, @@ -56124,9 +56628,9 @@ "question__title": "Custom Sort String", "question__title_slug": "custom-sort-string", "question__hide": false, - "total_acs": 43438, - "total_submitted": 58573, - "total_column_articles": 614, + "total_acs": 43916, + "total_submitted": 59163, + "total_column_articles": 616, "frontend_question_id": "791", "is_new_question": false }, @@ -56145,9 +56649,9 @@ "question__title": "Domino and Tromino Tiling", "question__title_slug": "domino-and-tromino-tiling", "question__hide": false, - "total_acs": 32343, - "total_submitted": 60315, - "total_column_articles": 314, + "total_acs": 33139, + "total_submitted": 62146, + "total_column_articles": 319, "frontend_question_id": "790", "is_new_question": false }, @@ -56166,9 +56670,9 @@ "question__title": "Escape The Ghosts", "question__title_slug": "escape-the-ghosts", "question__hide": false, - "total_acs": 24217, - "total_submitted": 35316, - "total_column_articles": 336, + "total_acs": 24335, + "total_submitted": 35463, + "total_column_articles": 337, "frontend_question_id": "789", "is_new_question": false }, @@ -56187,9 +56691,9 @@ "question__title": "Rotated Digits", "question__title_slug": "rotated-digits", "question__hide": false, - "total_acs": 47242, - "total_submitted": 71092, - "total_column_articles": 530, + "total_acs": 47473, + "total_submitted": 71425, + "total_column_articles": 531, "frontend_question_id": "788", "is_new_question": false }, @@ -56208,9 +56712,9 @@ "question__title": "Cheapest Flights Within K Stops", "question__title_slug": "cheapest-flights-within-k-stops", "question__hide": false, - "total_acs": 72942, - "total_submitted": 182786, - "total_column_articles": 700, + "total_acs": 73626, + "total_submitted": 184396, + "total_column_articles": 702, "frontend_question_id": "787", "is_new_question": false }, @@ -56229,9 +56733,9 @@ "question__title": "K-th Smallest Prime Fraction", "question__title_slug": "k-th-smallest-prime-fraction", "question__hide": false, - "total_acs": 34519, - "total_submitted": 51062, - "total_column_articles": 324, + "total_acs": 34821, + "total_submitted": 51479, + "total_column_articles": 322, "frontend_question_id": "786", "is_new_question": false }, @@ -56250,9 +56754,9 @@ "question__title": "Is Graph Bipartite?", "question__title_slug": "is-graph-bipartite", "question__hide": false, - "total_acs": 86546, - "total_submitted": 156885, - "total_column_articles": 1514, + "total_acs": 87418, + "total_submitted": 158252, + "total_column_articles": 1512, "frontend_question_id": "785", "is_new_question": false }, @@ -56271,9 +56775,9 @@ "question__title": "Letter Case Permutation", "question__title_slug": "letter-case-permutation", "question__hide": false, - "total_acs": 112355, - "total_submitted": 154531, - "total_column_articles": 1223, + "total_acs": 113161, + "total_submitted": 155790, + "total_column_articles": 1224, "frontend_question_id": "784", "is_new_question": false }, @@ -56292,9 +56796,9 @@ "question__title": "Minimum Distance Between BST Nodes", "question__title_slug": "minimum-distance-between-bst-nodes", "question__hide": false, - "total_acs": 90109, - "total_submitted": 149507, - "total_column_articles": 859, + "total_acs": 90600, + "total_submitted": 150300, + "total_column_articles": 861, "frontend_question_id": "783", "is_new_question": false }, @@ -56313,8 +56817,8 @@ "question__title": "Transform to Chessboard", "question__title_slug": "transform-to-chessboard", "question__hide": false, - "total_acs": 14559, - "total_submitted": 24460, + "total_acs": 14572, + "total_submitted": 24509, "total_column_articles": 149, "frontend_question_id": "782", "is_new_question": false @@ -56334,9 +56838,9 @@ "question__title": "Rabbits in Forest", "question__title_slug": "rabbits-in-forest", "question__hide": false, - "total_acs": 58146, - "total_submitted": 99297, - "total_column_articles": 818, + "total_acs": 58475, + "total_submitted": 99944, + "total_column_articles": 820, "frontend_question_id": "781", "is_new_question": false }, @@ -56355,8 +56859,8 @@ "question__title": "Reaching Points", "question__title_slug": "reaching-points", "question__hide": false, - "total_acs": 27328, - "total_submitted": 72374, + "total_acs": 27364, + "total_submitted": 72512, "total_column_articles": 268, "frontend_question_id": "780", "is_new_question": false @@ -56376,8 +56880,8 @@ "question__title": "K-th Symbol in Grammar", "question__title_slug": "k-th-symbol-in-grammar", "question__hide": false, - "total_acs": 53066, - "total_submitted": 106378, + "total_acs": 53235, + "total_submitted": 106699, "total_column_articles": 766, "frontend_question_id": "779", "is_new_question": false @@ -56397,9 +56901,9 @@ "question__title": "Swim in Rising Water", "question__title_slug": "swim-in-rising-water", "question__hide": false, - "total_acs": 35507, - "total_submitted": 59995, - "total_column_articles": 454, + "total_acs": 35703, + "total_submitted": 60314, + "total_column_articles": 457, "frontend_question_id": "778", "is_new_question": false }, @@ -56418,9 +56922,9 @@ "question__title": "Swap Adjacent in LR String", "question__title_slug": "swap-adjacent-in-lr-string", "question__hide": false, - "total_acs": 29190, - "total_submitted": 75590, - "total_column_articles": 308, + "total_acs": 29268, + "total_submitted": 75842, + "total_column_articles": 309, "frontend_question_id": "777", "is_new_question": false }, @@ -56439,9 +56943,9 @@ "question__title": "Binary Search", "question__title_slug": "binary-search", "question__hide": false, - "total_acs": 1170891, - "total_submitted": 2124762, - "total_column_articles": 5517, + "total_acs": 1194336, + "total_submitted": 2163714, + "total_column_articles": 5574, "frontend_question_id": "704", "is_new_question": false }, @@ -56460,8 +56964,8 @@ "question__title": "Split BST", "question__title_slug": "split-bst", "question__hide": false, - "total_acs": 2887, - "total_submitted": 4779, + "total_acs": 2921, + "total_submitted": 4831, "total_column_articles": 57, "frontend_question_id": "776", "is_new_question": false @@ -56481,8 +56985,8 @@ "question__title": "Global and Local Inversions", "question__title_slug": "global-and-local-inversions", "question__hide": false, - "total_acs": 33877, - "total_submitted": 68329, + "total_acs": 33973, + "total_submitted": 68556, "total_column_articles": 426, "frontend_question_id": "775", "is_new_question": false @@ -56502,9 +57006,9 @@ "question__title": "Kth Largest Element in a Stream", "question__title_slug": "kth-largest-element-in-a-stream", "question__hide": false, - "total_acs": 97006, - "total_submitted": 184412, - "total_column_articles": 851, + "total_acs": 97756, + "total_submitted": 185884, + "total_column_articles": 852, "frontend_question_id": "703", "is_new_question": false }, @@ -56523,8 +57027,8 @@ "question__title": "Minimize Max Distance to Gas Station", "question__title_slug": "minimize-max-distance-to-gas-station", "question__hide": false, - "total_acs": 2469, - "total_submitted": 3878, + "total_acs": 2503, + "total_submitted": 3937, "total_column_articles": 40, "frontend_question_id": "774", "is_new_question": false @@ -56544,9 +57048,9 @@ "question__title": "Sliding Puzzle", "question__title_slug": "sliding-puzzle", "question__hide": false, - "total_acs": 37639, - "total_submitted": 53617, - "total_column_articles": 532, + "total_acs": 37904, + "total_submitted": 54005, + "total_column_articles": 530, "frontend_question_id": "773", "is_new_question": false }, @@ -56565,8 +57069,8 @@ "question__title": "Search in a Sorted Array of Unknown Size", "question__title_slug": "search-in-a-sorted-array-of-unknown-size", "question__hide": false, - "total_acs": 8855, - "total_submitted": 11851, + "total_acs": 8957, + "total_submitted": 11977, "total_column_articles": 125, "frontend_question_id": "702", "is_new_question": false @@ -56586,8 +57090,8 @@ "question__title": "Basic Calculator III", "question__title_slug": "basic-calculator-iii", "question__hide": false, - "total_acs": 14830, - "total_submitted": 27766, + "total_acs": 15014, + "total_submitted": 28147, "total_column_articles": 216, "frontend_question_id": "772", "is_new_question": false @@ -56607,9 +57111,9 @@ "question__title": "Insert into a Binary Search Tree", "question__title_slug": "insert-into-a-binary-search-tree", "question__hide": false, - "total_acs": 226392, - "total_submitted": 321819, - "total_column_articles": 1480, + "total_acs": 231043, + "total_submitted": 328934, + "total_column_articles": 1486, "frontend_question_id": "701", "is_new_question": false }, @@ -56628,9 +57132,9 @@ "question__title": "Search in a Binary Search Tree", "question__title_slug": "search-in-a-binary-search-tree", "question__hide": false, - "total_acs": 305894, - "total_submitted": 392075, - "total_column_articles": 2029, + "total_acs": 312575, + "total_submitted": 400253, + "total_column_articles": 2041, "frontend_question_id": "700", "is_new_question": false }, @@ -56649,9 +57153,9 @@ "question__title": "Jewels and Stones", "question__title_slug": "jewels-and-stones", "question__hide": false, - "total_acs": 216407, - "total_submitted": 252694, - "total_column_articles": 1623, + "total_acs": 217341, + "total_submitted": 253775, + "total_column_articles": 1626, "frontend_question_id": "771", "is_new_question": false }, @@ -56670,9 +57174,9 @@ "question__title": "Basic Calculator IV", "question__title_slug": "basic-calculator-iv", "question__hide": false, - "total_acs": 2306, - "total_submitted": 3978, - "total_column_articles": 45, + "total_acs": 2334, + "total_submitted": 4039, + "total_column_articles": 46, "frontend_question_id": "770", "is_new_question": false }, @@ -56691,9 +57195,9 @@ "question__title": "Max Chunks To Make Sorted", "question__title_slug": "max-chunks-to-make-sorted", "question__hide": false, - "total_acs": 57047, - "total_submitted": 96360, - "total_column_articles": 769, + "total_acs": 57432, + "total_submitted": 96990, + "total_column_articles": 773, "frontend_question_id": "769", "is_new_question": false }, @@ -56712,8 +57216,8 @@ "question__title": "Max Chunks To Make Sorted II", "question__title_slug": "max-chunks-to-make-sorted-ii", "question__hide": false, - "total_acs": 34004, - "total_submitted": 57833, + "total_acs": 34166, + "total_submitted": 58121, "total_column_articles": 398, "frontend_question_id": "768", "is_new_question": false @@ -56733,9 +57237,9 @@ "question__title": "Reorganize String", "question__title_slug": "reorganize-string", "question__hide": false, - "total_acs": 55136, - "total_submitted": 113179, - "total_column_articles": 636, + "total_acs": 55403, + "total_submitted": 113772, + "total_column_articles": 634, "frontend_question_id": "767", "is_new_question": false }, @@ -56754,9 +57258,9 @@ "question__title": "Toeplitz Matrix", "question__title_slug": "toeplitz-matrix", "question__hide": false, - "total_acs": 72456, - "total_submitted": 103545, - "total_column_articles": 796, + "total_acs": 72891, + "total_submitted": 104226, + "total_column_articles": 797, "frontend_question_id": "766", "is_new_question": false }, @@ -56775,8 +57279,8 @@ "question__title": "N-ary Tree Postorder Traversal", "question__title_slug": "n-ary-tree-postorder-traversal", "question__hide": false, - "total_acs": 156328, - "total_submitted": 196574, + "total_acs": 157739, + "total_submitted": 198327, "total_column_articles": 1011, "frontend_question_id": "590", "is_new_question": false @@ -56796,9 +57300,9 @@ "question__title": "N-ary Tree Preorder Traversal", "question__title_slug": "n-ary-tree-preorder-traversal", "question__hide": false, - "total_acs": 215146, - "total_submitted": 283586, - "total_column_articles": 1247, + "total_acs": 216922, + "total_submitted": 285876, + "total_column_articles": 1252, "frontend_question_id": "589", "is_new_question": false }, @@ -56817,9 +57321,9 @@ "question__title": "Maximum Depth of N-ary Tree", "question__title_slug": "maximum-depth-of-n-ary-tree", "question__hide": false, - "total_acs": 161487, - "total_submitted": 215090, - "total_column_articles": 1127, + "total_acs": 163817, + "total_submitted": 218067, + "total_column_articles": 1134, "frontend_question_id": "559", "is_new_question": false }, @@ -56838,8 +57342,8 @@ "question__title": "Logical OR of Two Binary Grids Represented as Quad-Trees", "question__title_slug": "logical-or-of-two-binary-grids-represented-as-quad-trees", "question__hide": false, - "total_acs": 18715, - "total_submitted": 29817, + "total_acs": 18783, + "total_submitted": 29941, "total_column_articles": 167, "frontend_question_id": "558", "is_new_question": false @@ -56859,9 +57363,9 @@ "question__title": "Construct Quad Tree", "question__title_slug": "construct-quad-tree", "question__hide": false, - "total_acs": 30825, - "total_submitted": 43060, - "total_column_articles": 372, + "total_acs": 31782, + "total_submitted": 44324, + "total_column_articles": 379, "frontend_question_id": "427", "is_new_question": false }, @@ -56880,8 +57384,8 @@ "question__title": "Encode N-ary Tree to Binary Tree", "question__title_slug": "encode-n-ary-tree-to-binary-tree", "question__hide": false, - "total_acs": 2376, - "total_submitted": 3174, + "total_acs": 2407, + "total_submitted": 3227, "total_column_articles": 51, "frontend_question_id": "431", "is_new_question": false @@ -56901,9 +57405,9 @@ "question__title": "Couples Holding Hands", "question__title_slug": "couples-holding-hands", "question__hide": false, - "total_acs": 52796, - "total_submitted": 78366, - "total_column_articles": 693, + "total_acs": 53151, + "total_submitted": 78941, + "total_column_articles": 697, "frontend_question_id": "765", "is_new_question": false }, @@ -56922,8 +57426,8 @@ "question__title": "Largest Plus Sign", "question__title_slug": "largest-plus-sign", "question__hide": false, - "total_acs": 30461, - "total_submitted": 56019, + "total_acs": 30540, + "total_submitted": 56172, "total_column_articles": 350, "frontend_question_id": "764", "is_new_question": false @@ -56943,9 +57447,9 @@ "question__title": "Partition Labels", "question__title_slug": "partition-labels", "question__hide": false, - "total_acs": 208780, - "total_submitted": 271726, - "total_column_articles": 1795, + "total_acs": 217737, + "total_submitted": 283405, + "total_column_articles": 1847, "frontend_question_id": "763", "is_new_question": false }, @@ -56964,9 +57468,9 @@ "question__title": "Prime Number of Set Bits in Binary Representation", "question__title_slug": "prime-number-of-set-bits-in-binary-representation", "question__hide": false, - "total_acs": 59237, - "total_submitted": 78641, - "total_column_articles": 510, + "total_acs": 59591, + "total_submitted": 79118, + "total_column_articles": 508, "frontend_question_id": "762", "is_new_question": false }, @@ -56985,8 +57489,8 @@ "question__title": "Flatten a Multilevel Doubly Linked List", "question__title_slug": "flatten-a-multilevel-doubly-linked-list", "question__hide": false, - "total_acs": 66291, - "total_submitted": 111288, + "total_acs": 66646, + "total_submitted": 111884, "total_column_articles": 926, "frontend_question_id": "430", "is_new_question": false @@ -57006,8 +57510,8 @@ "question__title": "Serialize and Deserialize N-ary Tree", "question__title_slug": "serialize-and-deserialize-n-ary-tree", "question__hide": false, - "total_acs": 5783, - "total_submitted": 8308, + "total_acs": 5835, + "total_submitted": 8388, "total_column_articles": 89, "frontend_question_id": "428", "is_new_question": false @@ -57027,9 +57531,9 @@ "question__title": "N-ary Tree Level Order Traversal", "question__title_slug": "n-ary-tree-level-order-traversal", "question__hide": false, - "total_acs": 191758, - "total_submitted": 260713, - "total_column_articles": 1319, + "total_acs": 196015, + "total_submitted": 266580, + "total_column_articles": 1333, "frontend_question_id": "429", "is_new_question": false }, @@ -57048,8 +57552,8 @@ "question__title": "Special Binary String", "question__title_slug": "special-binary-string", "question__hide": false, - "total_acs": 17479, - "total_submitted": 23266, + "total_acs": 17491, + "total_submitted": 23285, "total_column_articles": 154, "frontend_question_id": "761", "is_new_question": false @@ -57069,9 +57573,9 @@ "question__title": "Find Anagram Mappings", "question__title_slug": "find-anagram-mappings", "question__hide": false, - "total_acs": 7708, - "total_submitted": 9116, - "total_column_articles": 141, + "total_acs": 7870, + "total_submitted": 9299, + "total_column_articles": 143, "frontend_question_id": "760", "is_new_question": false }, @@ -57090,8 +57594,8 @@ "question__title": "Employee Free Time", "question__title_slug": "employee-free-time", "question__hide": false, - "total_acs": 4680, - "total_submitted": 6658, + "total_acs": 4730, + "total_submitted": 6755, "total_column_articles": 81, "frontend_question_id": "759", "is_new_question": false @@ -57111,8 +57615,8 @@ "question__title": "Bold Words in String", "question__title_slug": "bold-words-in-string", "question__hide": false, - "total_acs": 4545, - "total_submitted": 9381, + "total_acs": 4569, + "total_submitted": 9415, "total_column_articles": 88, "frontend_question_id": "758", "is_new_question": false @@ -57132,8 +57636,8 @@ "question__title": "Set Intersection Size At Least Two", "question__title_slug": "set-intersection-size-at-least-two", "question__hide": false, - "total_acs": 19031, - "total_submitted": 33941, + "total_acs": 19055, + "total_submitted": 34009, "total_column_articles": 201, "frontend_question_id": "757", "is_new_question": false @@ -57153,9 +57657,9 @@ "question__title": "Convert Binary Search Tree to Sorted Doubly Linked List", "question__title_slug": "convert-binary-search-tree-to-sorted-doubly-linked-list", "question__hide": false, - "total_acs": 14860, - "total_submitted": 21818, - "total_column_articles": 196, + "total_acs": 15034, + "total_submitted": 22074, + "total_column_articles": 197, "frontend_question_id": "426", "is_new_question": false }, @@ -57174,8 +57678,8 @@ "question__title": "Pyramid Transition Matrix", "question__title_slug": "pyramid-transition-matrix", "question__hide": false, - "total_acs": 7410, - "total_submitted": 14718, + "total_acs": 7457, + "total_submitted": 14854, "total_column_articles": 110, "frontend_question_id": "756", "is_new_question": false @@ -57195,8 +57699,8 @@ "question__title": "Pour Water", "question__title_slug": "pour-water", "question__hide": false, - "total_acs": 2101, - "total_submitted": 4349, + "total_acs": 2120, + "total_submitted": 4399, "total_column_articles": 47, "frontend_question_id": "755", "is_new_question": false @@ -57216,9 +57720,9 @@ "question__title": "Reach a Number", "question__title_slug": "reach-a-number", "question__hide": false, - "total_acs": 38010, - "total_submitted": 73721, - "total_column_articles": 408, + "total_acs": 38097, + "total_submitted": 73908, + "total_column_articles": 410, "frontend_question_id": "754", "is_new_question": false }, @@ -57237,9 +57741,9 @@ "question__title": "Cracking the Safe", "question__title_slug": "cracking-the-safe", "question__hide": false, - "total_acs": 17502, - "total_submitted": 23401, - "total_column_articles": 153, + "total_acs": 17589, + "total_submitted": 23509, + "total_column_articles": 154, "frontend_question_id": "753", "is_new_question": false }, @@ -57258,9 +57762,9 @@ "question__title": "Open the Lock", "question__title_slug": "open-the-lock", "question__hide": false, - "total_acs": 128644, - "total_submitted": 243768, - "total_column_articles": 1262, + "total_acs": 129719, + "total_submitted": 245757, + "total_column_articles": 1268, "frontend_question_id": "752", "is_new_question": false }, @@ -57279,8 +57783,8 @@ "question__title": "IP to CIDR", "question__title_slug": "ip-to-cidr", "question__hide": false, - "total_acs": 2045, - "total_submitted": 4250, + "total_acs": 2071, + "total_submitted": 4302, "total_column_articles": 40, "frontend_question_id": "751", "is_new_question": false @@ -57300,8 +57804,8 @@ "question__title": "Number Of Corner Rectangles", "question__title_slug": "number-of-corner-rectangles", "question__hide": false, - "total_acs": 3535, - "total_submitted": 4828, + "total_acs": 3562, + "total_submitted": 4877, "total_column_articles": 63, "frontend_question_id": "750", "is_new_question": false @@ -57321,8 +57825,8 @@ "question__title": "Contain Virus", "question__title_slug": "contain-virus", "question__hide": false, - "total_acs": 14220, - "total_submitted": 20600, + "total_acs": 14249, + "total_submitted": 20654, "total_column_articles": 142, "frontend_question_id": "749", "is_new_question": false @@ -57342,9 +57846,9 @@ "question__title": "Shortest Completing Word", "question__title_slug": "shortest-completing-word", "question__hide": false, - "total_acs": 49907, - "total_submitted": 74951, - "total_column_articles": 592, + "total_acs": 50226, + "total_submitted": 75430, + "total_column_articles": 590, "frontend_question_id": "748", "is_new_question": false }, @@ -57363,9 +57867,9 @@ "question__title": "Largest Number At Least Twice of Others", "question__title_slug": "largest-number-at-least-twice-of-others", "question__hide": false, - "total_acs": 99183, - "total_submitted": 212687, - "total_column_articles": 984, + "total_acs": 99946, + "total_submitted": 213975, + "total_column_articles": 992, "frontend_question_id": "747", "is_new_question": false }, @@ -57384,9 +57888,9 @@ "question__title": "Min Cost Climbing Stairs", "question__title_slug": "min-cost-climbing-stairs", "question__hide": false, - "total_acs": 403821, - "total_submitted": 609686, - "total_column_articles": 2743, + "total_acs": 416200, + "total_submitted": 626884, + "total_column_articles": 2806, "frontend_question_id": "746", "is_new_question": false }, @@ -57405,8 +57909,8 @@ "question__title": "Prefix and Suffix Search", "question__title_slug": "prefix-and-suffix-search", "question__hide": false, - "total_acs": 25816, - "total_submitted": 58838, + "total_acs": 25927, + "total_submitted": 59075, "total_column_articles": 259, "frontend_question_id": "745", "is_new_question": false @@ -57426,9 +57930,9 @@ "question__title": "Find Smallest Letter Greater Than Target", "question__title_slug": "find-smallest-letter-greater-than-target", "question__hide": false, - "total_acs": 122110, - "total_submitted": 249297, - "total_column_articles": 1044, + "total_acs": 123144, + "total_submitted": 250945, + "total_column_articles": 1045, "frontend_question_id": "744", "is_new_question": false }, @@ -57447,9 +57951,9 @@ "question__title": "Network Delay Time", "question__title_slug": "network-delay-time", "question__hide": false, - "total_acs": 121621, - "total_submitted": 217225, - "total_column_articles": 940, + "total_acs": 123733, + "total_submitted": 220653, + "total_column_articles": 946, "frontend_question_id": "743", "is_new_question": false }, @@ -57468,8 +57972,8 @@ "question__title": "Closest Leaf in a Binary Tree", "question__title_slug": "closest-leaf-in-a-binary-tree", "question__hide": false, - "total_acs": 2826, - "total_submitted": 5757, + "total_acs": 2864, + "total_submitted": 5834, "total_column_articles": 82, "frontend_question_id": "742", "is_new_question": false @@ -57489,9 +57993,9 @@ "question__title": "To Lower Case", "question__title_slug": "to-lower-case", "question__hide": false, - "total_acs": 141426, - "total_submitted": 184906, - "total_column_articles": 999, + "total_acs": 144359, + "total_submitted": 188810, + "total_column_articles": 1007, "frontend_question_id": "709", "is_new_question": false }, @@ -57510,8 +58014,8 @@ "question__title": "Cherry Pickup", "question__title_slug": "cherry-pickup", "question__hide": false, - "total_acs": 20736, - "total_submitted": 40828, + "total_acs": 20859, + "total_submitted": 41061, "total_column_articles": 150, "frontend_question_id": "741", "is_new_question": false @@ -57531,9 +58035,9 @@ "question__title": "Delete and Earn", "question__title_slug": "delete-and-earn", "question__hide": false, - "total_acs": 113914, - "total_submitted": 186393, - "total_column_articles": 1100, + "total_acs": 116752, + "total_submitted": 191617, + "total_column_articles": 1124, "frontend_question_id": "740", "is_new_question": false }, @@ -57552,9 +58056,9 @@ "question__title": "Daily Temperatures", "question__title_slug": "daily-temperatures", "question__hide": false, - "total_acs": 512246, - "total_submitted": 744719, - "total_column_articles": 2978, + "total_acs": 525623, + "total_submitted": 764522, + "total_column_articles": 3033, "frontend_question_id": "739", "is_new_question": false }, @@ -57573,9 +58077,9 @@ "question__title": "Monotone Increasing Digits", "question__title_slug": "monotone-increasing-digits", "question__hide": false, - "total_acs": 110958, - "total_submitted": 218682, - "total_column_articles": 1035, + "total_acs": 114121, + "total_submitted": 224935, + "total_column_articles": 1043, "frontend_question_id": "738", "is_new_question": false }, @@ -57594,8 +58098,8 @@ "question__title": "Sentence Similarity II", "question__title_slug": "sentence-similarity-ii", "question__hide": false, - "total_acs": 6516, - "total_submitted": 13294, + "total_acs": 6579, + "total_submitted": 13369, "total_column_articles": 114, "frontend_question_id": "737", "is_new_question": false @@ -57615,9 +58119,9 @@ "question__title": "Parse Lisp Expression", "question__title_slug": "parse-lisp-expression", "question__hide": false, - "total_acs": 13928, - "total_submitted": 21005, - "total_column_articles": 159, + "total_acs": 13957, + "total_submitted": 21061, + "total_column_articles": 160, "frontend_question_id": "736", "is_new_question": false }, @@ -57636,9 +58140,9 @@ "question__title": "Asteroid Collision", "question__title_slug": "asteroid-collision", "question__hide": false, - "total_acs": 88731, - "total_submitted": 208539, - "total_column_articles": 918, + "total_acs": 90010, + "total_submitted": 211702, + "total_column_articles": 923, "frontend_question_id": "735", "is_new_question": false }, @@ -57657,8 +58161,8 @@ "question__title": "Sentence Similarity", "question__title_slug": "sentence-similarity", "question__hide": false, - "total_acs": 5756, - "total_submitted": 11895, + "total_acs": 5864, + "total_submitted": 12163, "total_column_articles": 94, "frontend_question_id": "734", "is_new_question": false @@ -57678,9 +58182,9 @@ "question__title": "Flood Fill", "question__title_slug": "flood-fill", "question__hide": false, - "total_acs": 166591, - "total_submitted": 282906, - "total_column_articles": 1327, + "total_acs": 167407, + "total_submitted": 284316, + "total_column_articles": 1331, "frontend_question_id": "733", "is_new_question": false }, @@ -57699,9 +58203,9 @@ "question__title": "My Calendar III", "question__title_slug": "my-calendar-iii", "question__hide": false, - "total_acs": 26447, - "total_submitted": 37320, - "total_column_articles": 251, + "total_acs": 26636, + "total_submitted": 37640, + "total_column_articles": 253, "frontend_question_id": "732", "is_new_question": false }, @@ -57720,9 +58224,9 @@ "question__title": "My Calendar II", "question__title_slug": "my-calendar-ii", "question__hide": false, - "total_acs": 29713, - "total_submitted": 47282, - "total_column_articles": 243, + "total_acs": 29855, + "total_submitted": 47543, + "total_column_articles": 244, "frontend_question_id": "731", "is_new_question": false }, @@ -57741,8 +58245,8 @@ "question__title": "Count Different Palindromic Subsequences", "question__title_slug": "count-different-palindromic-subsequences", "question__hide": false, - "total_acs": 18884, - "total_submitted": 29989, + "total_acs": 18957, + "total_submitted": 30142, "total_column_articles": 130, "frontend_question_id": "730", "is_new_question": false @@ -57762,9 +58266,9 @@ "question__title": "My Calendar I", "question__title_slug": "my-calendar-i", "question__hide": false, - "total_acs": 54949, - "total_submitted": 94225, - "total_column_articles": 458, + "total_acs": 55294, + "total_submitted": 94862, + "total_column_articles": 459, "frontend_question_id": "729", "is_new_question": false }, @@ -57783,8 +58287,8 @@ "question__title": "Self Dividing Numbers", "question__title_slug": "self-dividing-numbers", "question__hide": false, - "total_acs": 83830, - "total_submitted": 109877, + "total_acs": 84299, + "total_submitted": 110491, "total_column_articles": 795, "frontend_question_id": "728", "is_new_question": false @@ -57804,8 +58308,8 @@ "question__title": "Minimum Window Subsequence", "question__title_slug": "minimum-window-subsequence", "question__hide": false, - "total_acs": 6221, - "total_submitted": 14571, + "total_acs": 6273, + "total_submitted": 14693, "total_column_articles": 84, "frontend_question_id": "727", "is_new_question": false @@ -57825,8 +58329,8 @@ "question__title": "Number of Atoms", "question__title_slug": "number-of-atoms", "question__hide": false, - "total_acs": 28370, - "total_submitted": 51230, + "total_acs": 28498, + "total_submitted": 51528, "total_column_articles": 486, "frontend_question_id": "726", "is_new_question": false @@ -57846,8 +58350,8 @@ "question__title": "Split Linked List in Parts", "question__title_slug": "split-linked-list-in-parts", "question__hide": false, - "total_acs": 63913, - "total_submitted": 105207, + "total_acs": 64235, + "total_submitted": 105747, "total_column_articles": 767, "frontend_question_id": "725", "is_new_question": false @@ -57867,9 +58371,9 @@ "question__title": "Find Pivot Index", "question__title_slug": "find-pivot-index", "question__hide": false, - "total_acs": 344390, - "total_submitted": 655159, - "total_column_articles": 1731, + "total_acs": 349799, + "total_submitted": 664232, + "total_column_articles": 1746, "frontend_question_id": "724", "is_new_question": false }, @@ -57888,8 +58392,8 @@ "question__title": "Candy Crush", "question__title_slug": "candy-crush", "question__hide": false, - "total_acs": 3168, - "total_submitted": 4310, + "total_acs": 3220, + "total_submitted": 4393, "total_column_articles": 74, "frontend_question_id": "723", "is_new_question": false @@ -57909,8 +58413,8 @@ "question__title": "Remove Comments", "question__title_slug": "remove-comments", "question__hide": false, - "total_acs": 24106, - "total_submitted": 56736, + "total_acs": 24156, + "total_submitted": 56851, "total_column_articles": 242, "frontend_question_id": "722", "is_new_question": false @@ -57930,9 +58434,9 @@ "question__title": "Accounts Merge", "question__title_slug": "accounts-merge", "question__hide": false, - "total_acs": 41932, - "total_submitted": 86177, - "total_column_articles": 458, + "total_acs": 42210, + "total_submitted": 86659, + "total_column_articles": 461, "frontend_question_id": "721", "is_new_question": false }, @@ -57951,9 +58455,9 @@ "question__title": "Longest Word in Dictionary", "question__title_slug": "longest-word-in-dictionary", "question__hide": false, - "total_acs": 68704, - "total_submitted": 132037, - "total_column_articles": 722, + "total_acs": 68921, + "total_submitted": 132438, + "total_column_articles": 723, "frontend_question_id": "720", "is_new_question": false }, @@ -57972,9 +58476,9 @@ "question__title": "Find K-th Smallest Pair Distance", "question__title_slug": "find-k-th-smallest-pair-distance", "question__hide": false, - "total_acs": 36556, - "total_submitted": 77524, - "total_column_articles": 290, + "total_acs": 36927, + "total_submitted": 78182, + "total_column_articles": 293, "frontend_question_id": "719", "is_new_question": false }, @@ -57993,9 +58497,9 @@ "question__title": "Maximum Length of Repeated Subarray", "question__title_slug": "maximum-length-of-repeated-subarray", "question__hide": false, - "total_acs": 226430, - "total_submitted": 398743, - "total_column_articles": 1143, + "total_acs": 232318, + "total_submitted": 409403, + "total_column_articles": 1160, "frontend_question_id": "718", "is_new_question": false }, @@ -58014,9 +58518,9 @@ "question__title": "1-bit and 2-bit Characters", "question__title_slug": "1-bit-and-2-bit-characters", "question__hide": false, - "total_acs": 72003, - "total_submitted": 130042, - "total_column_articles": 859, + "total_acs": 72407, + "total_submitted": 130735, + "total_column_articles": 856, "frontend_question_id": "717", "is_new_question": false }, @@ -58035,8 +58539,8 @@ "question__title": "Max Stack", "question__title_slug": "max-stack", "question__hide": false, - "total_acs": 7511, - "total_submitted": 17312, + "total_acs": 7572, + "total_submitted": 17459, "total_column_articles": 113, "frontend_question_id": "716", "is_new_question": false @@ -58056,8 +58560,8 @@ "question__title": "Range Module", "question__title_slug": "range-module", "question__hide": false, - "total_acs": 29071, - "total_submitted": 52207, + "total_acs": 29159, + "total_submitted": 52432, "total_column_articles": 253, "frontend_question_id": "715", "is_new_question": false @@ -58077,9 +58581,9 @@ "question__title": "Best Time to Buy and Sell Stock with Transaction Fee", "question__title_slug": "best-time-to-buy-and-sell-stock-with-transaction-fee", "question__hide": false, - "total_acs": 262020, - "total_submitted": 343472, - "total_column_articles": 1436, + "total_acs": 266789, + "total_submitted": 349536, + "total_column_articles": 1449, "frontend_question_id": "714", "is_new_question": false }, @@ -58098,9 +58602,9 @@ "question__title": "Subarray Product Less Than K", "question__title_slug": "subarray-product-less-than-k", "question__hide": false, - "total_acs": 112337, - "total_submitted": 223375, - "total_column_articles": 940, + "total_acs": 113823, + "total_submitted": 225824, + "total_column_articles": 944, "frontend_question_id": "713", "is_new_question": false }, @@ -58119,9 +58623,9 @@ "question__title": "Minimum ASCII Delete Sum for Two Strings", "question__title_slug": "minimum-ascii-delete-sum-for-two-strings", "question__hide": false, - "total_acs": 40778, - "total_submitted": 58139, - "total_column_articles": 376, + "total_acs": 41973, + "total_submitted": 59767, + "total_column_articles": 383, "frontend_question_id": "712", "is_new_question": false }, @@ -58140,9 +58644,9 @@ "question__title": "Number of Distinct Islands II", "question__title_slug": "number-of-distinct-islands-ii", "question__hide": false, - "total_acs": 1767, - "total_submitted": 3078, - "total_column_articles": 48, + "total_acs": 1819, + "total_submitted": 3154, + "total_column_articles": 49, "frontend_question_id": "711", "is_new_question": false }, @@ -58161,8 +58665,8 @@ "question__title": "Falling Squares", "question__title_slug": "falling-squares", "question__hide": false, - "total_acs": 23850, - "total_submitted": 43599, + "total_acs": 23953, + "total_submitted": 43791, "total_column_articles": 247, "frontend_question_id": "699", "is_new_question": false @@ -58182,9 +58686,9 @@ "question__title": "Partition to K Equal Sum Subsets", "question__title_slug": "partition-to-k-equal-sum-subsets", "question__hide": false, - "total_acs": 112239, - "total_submitted": 268007, - "total_column_articles": 1456, + "total_acs": 113133, + "total_submitted": 270500, + "total_column_articles": 1453, "frontend_question_id": "698", "is_new_question": false }, @@ -58203,9 +58707,9 @@ "question__title": "Degree of an Array", "question__title_slug": "degree-of-an-array", "question__hide": false, - "total_acs": 99119, - "total_submitted": 167487, - "total_column_articles": 1208, + "total_acs": 100113, + "total_submitted": 169407, + "total_column_articles": 1214, "frontend_question_id": "697", "is_new_question": false }, @@ -58224,9 +58728,9 @@ "question__title": "Count Binary Substrings", "question__title_slug": "count-binary-substrings", "question__hide": false, - "total_acs": 75376, - "total_submitted": 118461, - "total_column_articles": 654, + "total_acs": 75922, + "total_submitted": 119352, + "total_column_articles": 655, "frontend_question_id": "696", "is_new_question": false }, @@ -58245,9 +58749,9 @@ "question__title": "Max Area of Island", "question__title_slug": "max-area-of-island", "question__hide": false, - "total_acs": 315695, - "total_submitted": 463268, - "total_column_articles": 2659, + "total_acs": 321042, + "total_submitted": 471424, + "total_column_articles": 2684, "frontend_question_id": "695", "is_new_question": false }, @@ -58266,8 +58770,8 @@ "question__title": "Number of Distinct Islands", "question__title_slug": "number-of-distinct-islands", "question__hide": false, - "total_acs": 12431, - "total_submitted": 21278, + "total_acs": 12578, + "total_submitted": 21492, "total_column_articles": 201, "frontend_question_id": "694", "is_new_question": false @@ -58287,9 +58791,9 @@ "question__title": "Binary Number with Alternating Bits", "question__title_slug": "binary-number-with-alternating-bits", "question__hide": false, - "total_acs": 81993, - "total_submitted": 125673, - "total_column_articles": 871, + "total_acs": 82679, + "total_submitted": 126650, + "total_column_articles": 870, "frontend_question_id": "693", "is_new_question": false }, @@ -58308,9 +58812,9 @@ "question__title": "Top K Frequent Words", "question__title_slug": "top-k-frequent-words", "question__hide": false, - "total_acs": 114666, - "total_submitted": 204387, - "total_column_articles": 1114, + "total_acs": 115869, + "total_submitted": 206564, + "total_column_articles": 1119, "frontend_question_id": "692", "is_new_question": false }, @@ -58329,8 +58833,8 @@ "question__title": "Stickers to Spell Word", "question__title_slug": "stickers-to-spell-word", "question__hide": false, - "total_acs": 26322, - "total_submitted": 45239, + "total_acs": 26568, + "total_submitted": 45691, "total_column_articles": 215, "frontend_question_id": "691", "is_new_question": false @@ -58350,9 +58854,9 @@ "question__title": "Employee Importance", "question__title_slug": "employee-importance", "question__hide": false, - "total_acs": 67971, - "total_submitted": 102951, - "total_column_articles": 680, + "total_acs": 68214, + "total_submitted": 103299, + "total_column_articles": 678, "frontend_question_id": "690", "is_new_question": false }, @@ -58371,9 +58875,9 @@ "question__title": "Maximum Sum of 3 Non-Overlapping Subarrays", "question__title_slug": "maximum-sum-of-3-non-overlapping-subarrays", "question__hide": false, - "total_acs": 32636, - "total_submitted": 55700, - "total_column_articles": 353, + "total_acs": 32751, + "total_submitted": 55880, + "total_column_articles": 355, "frontend_question_id": "689", "is_new_question": false }, @@ -58392,9 +58896,9 @@ "question__title": "Knight Probability in Chessboard", "question__title_slug": "knight-probability-in-chessboard", "question__hide": false, - "total_acs": 37616, - "total_submitted": 64725, - "total_column_articles": 398, + "total_acs": 37805, + "total_submitted": 65084, + "total_column_articles": 399, "frontend_question_id": "688", "is_new_question": false }, @@ -58413,9 +58917,9 @@ "question__title": "Longest Univalue Path", "question__title_slug": "longest-univalue-path", "question__hide": false, - "total_acs": 86478, - "total_submitted": 180384, - "total_column_articles": 689, + "total_acs": 86974, + "total_submitted": 181280, + "total_column_articles": 691, "frontend_question_id": "687", "is_new_question": false }, @@ -58434,9 +58938,9 @@ "question__title": "Repeated String Match", "question__title_slug": "repeated-string-match", "question__hide": false, - "total_acs": 53210, - "total_submitted": 133938, - "total_column_articles": 665, + "total_acs": 53490, + "total_submitted": 134639, + "total_column_articles": 664, "frontend_question_id": "686", "is_new_question": false }, @@ -58455,9 +58959,9 @@ "question__title": "Redundant Connection II", "question__title_slug": "redundant-connection-ii", "question__hide": false, - "total_acs": 33665, - "total_submitted": 79684, - "total_column_articles": 394, + "total_acs": 34333, + "total_submitted": 81422, + "total_column_articles": 396, "frontend_question_id": "685", "is_new_question": false }, @@ -58476,9 +58980,9 @@ "question__title": "Redundant Connection", "question__title_slug": "redundant-connection", "question__hide": false, - "total_acs": 109574, - "total_submitted": 161937, - "total_column_articles": 992, + "total_acs": 111415, + "total_submitted": 164529, + "total_column_articles": 996, "frontend_question_id": "684", "is_new_question": false }, @@ -58497,8 +59001,8 @@ "question__title": "K Empty Slots", "question__title_slug": "k-empty-slots", "question__hide": false, - "total_acs": 4427, - "total_submitted": 9460, + "total_acs": 4468, + "total_submitted": 9574, "total_column_articles": 77, "frontend_question_id": "683", "is_new_question": false @@ -58518,9 +59022,9 @@ "question__title": "Baseball Game", "question__title_slug": "baseball-game", "question__hide": false, - "total_acs": 105203, - "total_submitted": 148233, - "total_column_articles": 1080, + "total_acs": 107154, + "total_submitted": 151089, + "total_column_articles": 1093, "frontend_question_id": "682", "is_new_question": false }, @@ -58539,8 +59043,8 @@ "question__title": "Next Closest Time", "question__title_slug": "next-closest-time", "question__hide": false, - "total_acs": 4599, - "total_submitted": 9221, + "total_acs": 4641, + "total_submitted": 9309, "total_column_articles": 97, "frontend_question_id": "681", "is_new_question": false @@ -58560,9 +59064,9 @@ "question__title": "Valid Palindrome II", "question__title_slug": "valid-palindrome-ii", "question__hide": false, - "total_acs": 145760, - "total_submitted": 362648, - "total_column_articles": 1258, + "total_acs": 147208, + "total_submitted": 366238, + "total_column_articles": 1263, "frontend_question_id": "680", "is_new_question": false }, @@ -58581,9 +59085,9 @@ "question__title": "24 Game", "question__title_slug": "24-game", "question__hide": false, - "total_acs": 42537, - "total_submitted": 79082, - "total_column_articles": 371, + "total_acs": 42856, + "total_submitted": 79654, + "total_column_articles": 372, "frontend_question_id": "679", "is_new_question": false }, @@ -58602,8 +59106,8 @@ "question__title": "Valid Parenthesis String", "question__title_slug": "valid-parenthesis-string", "question__hide": false, - "total_acs": 72648, - "total_submitted": 184570, + "total_acs": 73203, + "total_submitted": 185859, "total_column_articles": 698, "frontend_question_id": "678", "is_new_question": false @@ -58623,9 +59127,9 @@ "question__title": "Map Sum Pairs", "question__title_slug": "map-sum-pairs", "question__hide": false, - "total_acs": 50799, - "total_submitted": 77535, - "total_column_articles": 720, + "total_acs": 51010, + "total_submitted": 77884, + "total_column_articles": 718, "frontend_question_id": "677", "is_new_question": false }, @@ -58644,9 +59148,9 @@ "question__title": "Implement Magic Dictionary", "question__title_slug": "implement-magic-dictionary", "question__hide": false, - "total_acs": 41190, - "total_submitted": 63077, - "total_column_articles": 482, + "total_acs": 41360, + "total_submitted": 63342, + "total_column_articles": 484, "frontend_question_id": "676", "is_new_question": false }, @@ -58665,8 +59169,8 @@ "question__title": "Cut Off Trees for Golf Event", "question__title_slug": "cut-off-trees-for-golf-event", "question__hide": false, - "total_acs": 22556, - "total_submitted": 43387, + "total_acs": 22741, + "total_submitted": 43844, "total_column_articles": 220, "frontend_question_id": "675", "is_new_question": false @@ -58686,9 +59190,9 @@ "question__title": "Longest Continuous Increasing Subsequence", "question__title_slug": "longest-continuous-increasing-subsequence", "question__hide": false, - "total_acs": 229954, - "total_submitted": 405548, - "total_column_articles": 1415, + "total_acs": 236125, + "total_submitted": 414985, + "total_column_articles": 1435, "frontend_question_id": "674", "is_new_question": false }, @@ -58707,9 +59211,9 @@ "question__title": "Number of Longest Increasing Subsequence", "question__title_slug": "number-of-longest-increasing-subsequence", "question__hide": false, - "total_acs": 98209, - "total_submitted": 218795, - "total_column_articles": 705, + "total_acs": 99959, + "total_submitted": 222820, + "total_column_articles": 708, "frontend_question_id": "673", "is_new_question": false }, @@ -58728,8 +59232,8 @@ "question__title": "Bulb Switcher II", "question__title_slug": "bulb-switcher-ii", "question__hide": false, - "total_acs": 27392, - "total_submitted": 45080, + "total_acs": 27476, + "total_submitted": 45202, "total_column_articles": 265, "frontend_question_id": "672", "is_new_question": false @@ -58749,8 +59253,8 @@ "question__title": "Second Minimum Node In a Binary Tree", "question__title_slug": "second-minimum-node-in-a-binary-tree", "question__hide": false, - "total_acs": 73871, - "total_submitted": 153940, + "total_acs": 74413, + "total_submitted": 155100, "total_column_articles": 898, "frontend_question_id": "671", "is_new_question": false @@ -58770,8 +59274,8 @@ "question__title": "Maximum Swap", "question__title_slug": "maximum-swap", "question__hide": false, - "total_acs": 90716, - "total_submitted": 184512, + "total_acs": 91875, + "total_submitted": 187114, "total_column_articles": 1179, "frontend_question_id": "670", "is_new_question": false @@ -58791,9 +59295,9 @@ "question__title": "Trim a Binary Search Tree", "question__title_slug": "trim-a-binary-search-tree", "question__hide": false, - "total_acs": 151080, - "total_submitted": 224849, - "total_column_articles": 1034, + "total_acs": 154706, + "total_submitted": 230502, + "total_column_articles": 1045, "frontend_question_id": "669", "is_new_question": false }, @@ -58812,9 +59316,9 @@ "question__title": "Kth Smallest Number in Multiplication Table", "question__title_slug": "kth-smallest-number-in-multiplication-table", "question__hide": false, - "total_acs": 31541, - "total_submitted": 53795, - "total_column_articles": 282, + "total_acs": 31680, + "total_submitted": 54015, + "total_column_articles": 283, "frontend_question_id": "668", "is_new_question": false }, @@ -58833,9 +59337,9 @@ "question__title": "Beautiful Arrangement II", "question__title_slug": "beautiful-arrangement-ii", "question__hide": false, - "total_acs": 36842, - "total_submitted": 55119, - "total_column_articles": 520, + "total_acs": 36915, + "total_submitted": 55255, + "total_column_articles": 522, "frontend_question_id": "667", "is_new_question": false }, @@ -58854,8 +59358,8 @@ "question__title": "Path Sum IV", "question__title_slug": "path-sum-iv", "question__hide": false, - "total_acs": 3953, - "total_submitted": 6333, + "total_acs": 4008, + "total_submitted": 6431, "total_column_articles": 115, "frontend_question_id": "666", "is_new_question": false @@ -58875,9 +59379,9 @@ "question__title": "Non-decreasing Array", "question__title_slug": "non-decreasing-array", "question__hide": false, - "total_acs": 107387, - "total_submitted": 385413, - "total_column_articles": 1261, + "total_acs": 108300, + "total_submitted": 388386, + "total_column_articles": 1264, "frontend_question_id": "665", "is_new_question": false }, @@ -58896,8 +59400,8 @@ "question__title": "Strange Printer", "question__title_slug": "strange-printer", "question__hide": false, - "total_acs": 28935, - "total_submitted": 44216, + "total_acs": 29066, + "total_submitted": 44435, "total_column_articles": 246, "frontend_question_id": "664", "is_new_question": false @@ -58917,9 +59421,9 @@ "question__title": "Equal Tree Partition", "question__title_slug": "equal-tree-partition", "question__hide": false, - "total_acs": 3056, - "total_submitted": 6679, - "total_column_articles": 59, + "total_acs": 3090, + "total_submitted": 6745, + "total_column_articles": 60, "frontend_question_id": "663", "is_new_question": false }, @@ -58938,9 +59442,9 @@ "question__title": "Maximum Width of Binary Tree", "question__title_slug": "maximum-width-of-binary-tree", "question__hide": false, - "total_acs": 103461, - "total_submitted": 236270, - "total_column_articles": 885, + "total_acs": 104930, + "total_submitted": 239328, + "total_column_articles": 886, "frontend_question_id": "662", "is_new_question": false }, @@ -58959,9 +59463,9 @@ "question__title": "Image Smoother", "question__title_slug": "image-smoother", "question__hide": false, - "total_acs": 57974, - "total_submitted": 90353, - "total_column_articles": 599, + "total_acs": 58452, + "total_submitted": 91137, + "total_column_articles": 600, "frontend_question_id": "661", "is_new_question": false }, @@ -58980,8 +59484,8 @@ "question__title": "Remove 9", "question__title_slug": "remove-9", "question__hide": false, - "total_acs": 1487, - "total_submitted": 2315, + "total_acs": 1505, + "total_submitted": 2358, "total_column_articles": 40, "frontend_question_id": "660", "is_new_question": false @@ -59001,9 +59505,9 @@ "question__title": "Split Array into Consecutive Subsequences", "question__title_slug": "split-array-into-consecutive-subsequences", "question__hide": false, - "total_acs": 38625, - "total_submitted": 70095, - "total_column_articles": 410, + "total_acs": 38820, + "total_submitted": 70408, + "total_column_articles": 408, "frontend_question_id": "659", "is_new_question": false }, @@ -59022,9 +59526,9 @@ "question__title": "Find K Closest Elements", "question__title_slug": "find-k-closest-elements", "question__hide": false, - "total_acs": 96764, - "total_submitted": 202132, - "total_column_articles": 866, + "total_acs": 97682, + "total_submitted": 204097, + "total_column_articles": 865, "frontend_question_id": "658", "is_new_question": false }, @@ -59043,9 +59547,9 @@ "question__title": "Robot Return to Origin", "question__title_slug": "robot-return-to-origin", "question__hide": false, - "total_acs": 117857, - "total_submitted": 148587, - "total_column_articles": 919, + "total_acs": 120006, + "total_submitted": 151285, + "total_column_articles": 931, "frontend_question_id": "657", "is_new_question": false }, @@ -59064,8 +59568,8 @@ "question__title": "Coin Path", "question__title_slug": "coin-path", "question__hide": false, - "total_acs": 1584, - "total_submitted": 4629, + "total_acs": 1626, + "total_submitted": 4706, "total_column_articles": 37, "frontend_question_id": "656", "is_new_question": false @@ -59085,9 +59589,9 @@ "question__title": "Print Binary Tree", "question__title_slug": "print-binary-tree", "question__hide": false, - "total_acs": 37415, - "total_submitted": 53616, - "total_column_articles": 520, + "total_acs": 37541, + "total_submitted": 53816, + "total_column_articles": 521, "frontend_question_id": "655", "is_new_question": false }, @@ -59106,9 +59610,9 @@ "question__title": "Maximum Binary Tree", "question__title_slug": "maximum-binary-tree", "question__hide": false, - "total_acs": 236724, - "total_submitted": 288151, - "total_column_articles": 1759, + "total_acs": 242124, + "total_submitted": 294808, + "total_column_articles": 1776, "frontend_question_id": "654", "is_new_question": false }, @@ -59127,8 +59631,8 @@ "question__title": "Two Sum IV - Input is a BST", "question__title_slug": "two-sum-iv-input-is-a-bst", "question__hide": false, - "total_acs": 119117, - "total_submitted": 187505, + "total_acs": 119861, + "total_submitted": 188649, "total_column_articles": 1016, "frontend_question_id": "653", "is_new_question": false @@ -59148,9 +59652,9 @@ "question__title": "Find Duplicate Subtrees", "question__title_slug": "find-duplicate-subtrees", "question__hide": false, - "total_acs": 102069, - "total_submitted": 166346, - "total_column_articles": 663, + "total_acs": 102674, + "total_submitted": 167327, + "total_column_articles": 662, "frontend_question_id": "652", "is_new_question": false }, @@ -59169,9 +59673,9 @@ "question__title": "4 Keys Keyboard", "question__title_slug": "4-keys-keyboard", "question__hide": false, - "total_acs": 7815, - "total_submitted": 12889, - "total_column_articles": 110, + "total_acs": 7936, + "total_submitted": 13088, + "total_column_articles": 111, "frontend_question_id": "651", "is_new_question": false }, @@ -59190,9 +59694,9 @@ "question__title": "2 Keys Keyboard", "question__title_slug": "2-keys-keyboard", "question__hide": false, - "total_acs": 69221, - "total_submitted": 119706, - "total_column_articles": 804, + "total_acs": 69594, + "total_submitted": 120317, + "total_column_articles": 803, "frontend_question_id": "650", "is_new_question": false }, @@ -59211,9 +59715,9 @@ "question__title": "Dota2 Senate", "question__title_slug": "dota2-senate", "question__hide": false, - "total_acs": 50678, - "total_submitted": 103854, - "total_column_articles": 474, + "total_acs": 51480, + "total_submitted": 105421, + "total_column_articles": 473, "frontend_question_id": "649", "is_new_question": false }, @@ -59232,8 +59736,8 @@ "question__title": "Replace Words", "question__title_slug": "replace-words", "question__hide": false, - "total_acs": 78022, - "total_submitted": 122689, + "total_acs": 78586, + "total_submitted": 123566, "total_column_articles": 876, "frontend_question_id": "648", "is_new_question": false @@ -59253,9 +59757,9 @@ "question__title": "Palindromic Substrings", "question__title_slug": "palindromic-substrings", "question__hide": false, - "total_acs": 318126, - "total_submitted": 473311, - "total_column_articles": 1835, + "total_acs": 323865, + "total_submitted": 481719, + "total_column_articles": 1849, "frontend_question_id": "647", "is_new_question": false }, @@ -59274,9 +59778,9 @@ "question__title": "Maximum Length of Pair Chain", "question__title_slug": "maximum-length-of-pair-chain", "question__hide": false, - "total_acs": 74814, - "total_submitted": 118932, - "total_column_articles": 679, + "total_acs": 76012, + "total_submitted": 120750, + "total_column_articles": 687, "frontend_question_id": "646", "is_new_question": false }, @@ -59295,9 +59799,9 @@ "question__title": "Set Mismatch", "question__title_slug": "set-mismatch", "question__hide": false, - "total_acs": 117156, - "total_submitted": 299564, - "total_column_articles": 1123, + "total_acs": 118654, + "total_submitted": 303407, + "total_column_articles": 1129, "frontend_question_id": "645", "is_new_question": false }, @@ -59316,8 +59820,8 @@ "question__title": "Maximum Average Subarray II", "question__title_slug": "maximum-average-subarray-ii", "question__hide": false, - "total_acs": 2810, - "total_submitted": 6205, + "total_acs": 2856, + "total_submitted": 6295, "total_column_articles": 41, "frontend_question_id": "644", "is_new_question": false @@ -59337,9 +59841,9 @@ "question__title": "Maximum Average Subarray I", "question__title_slug": "maximum-average-subarray-i", "question__hide": false, - "total_acs": 130054, - "total_submitted": 301696, - "total_column_articles": 1005, + "total_acs": 132451, + "total_submitted": 307375, + "total_column_articles": 1007, "frontend_question_id": "643", "is_new_question": false }, @@ -59358,8 +59862,8 @@ "question__title": "Design Search Autocomplete System", "question__title_slug": "design-search-autocomplete-system", "question__hide": false, - "total_acs": 5804, - "total_submitted": 10364, + "total_acs": 5849, + "total_submitted": 10442, "total_column_articles": 99, "frontend_question_id": "642", "is_new_question": false @@ -59379,9 +59883,9 @@ "question__title": "Solve the Equation", "question__title_slug": "solve-the-equation", "question__hide": false, - "total_acs": 38553, - "total_submitted": 86611, - "total_column_articles": 727, + "total_acs": 38684, + "total_submitted": 86962, + "total_column_articles": 728, "frontend_question_id": "640", "is_new_question": false }, @@ -59400,9 +59904,9 @@ "question__title": "Decode Ways II", "question__title_slug": "decode-ways-ii", "question__hide": false, - "total_acs": 25378, - "total_submitted": 68525, - "total_column_articles": 330, + "total_acs": 25605, + "total_submitted": 69182, + "total_column_articles": 331, "frontend_question_id": "639", "is_new_question": false }, @@ -59421,9 +59925,9 @@ "question__title": "Shopping Offers", "question__title_slug": "shopping-offers", "question__hide": false, - "total_acs": 37393, - "total_submitted": 60006, - "total_column_articles": 350, + "total_acs": 37547, + "total_submitted": 60322, + "total_column_articles": 351, "frontend_question_id": "638", "is_new_question": false }, @@ -59442,9 +59946,9 @@ "question__title": "Average of Levels in Binary Tree", "question__title_slug": "average-of-levels-in-binary-tree", "question__hide": false, - "total_acs": 177254, - "total_submitted": 252129, - "total_column_articles": 1170, + "total_acs": 184228, + "total_submitted": 261868, + "total_column_articles": 1190, "frontend_question_id": "637", "is_new_question": false }, @@ -59463,9 +59967,9 @@ "question__title": "Exclusive Time of Functions", "question__title_slug": "exclusive-time-of-functions", "question__hide": false, - "total_acs": 36884, - "total_submitted": 55625, - "total_column_articles": 357, + "total_acs": 37057, + "total_submitted": 55858, + "total_column_articles": 360, "frontend_question_id": "636", "is_new_question": false }, @@ -59484,8 +59988,8 @@ "question__title": "Design Log Storage System", "question__title_slug": "design-log-storage-system", "question__hide": false, - "total_acs": 6399, - "total_submitted": 11460, + "total_acs": 6428, + "total_submitted": 11516, "total_column_articles": 112, "frontend_question_id": "635", "is_new_question": false @@ -59505,8 +60009,8 @@ "question__title": "Find the Derangement of An Array", "question__title_slug": "find-the-derangement-of-an-array", "question__hide": false, - "total_acs": 2614, - "total_submitted": 5614, + "total_acs": 2667, + "total_submitted": 5719, "total_column_articles": 37, "frontend_question_id": "634", "is_new_question": false @@ -59526,8 +60030,8 @@ "question__title": "Sum of Square Numbers", "question__title_slug": "sum-of-square-numbers", "question__hide": false, - "total_acs": 138351, - "total_submitted": 363303, + "total_acs": 139178, + "total_submitted": 365814, "total_column_articles": 1063, "frontend_question_id": "633", "is_new_question": false @@ -59547,9 +60051,9 @@ "question__title": "Smallest Range Covering Elements from K Lists", "question__title_slug": "smallest-range-covering-elements-from-k-lists", "question__hide": false, - "total_acs": 27208, - "total_submitted": 44647, - "total_column_articles": 328, + "total_acs": 27416, + "total_submitted": 44976, + "total_column_articles": 329, "frontend_question_id": "632", "is_new_question": false }, @@ -59568,8 +60072,8 @@ "question__title": "Design Excel Sum Formula", "question__title_slug": "design-excel-sum-formula", "question__hide": false, - "total_acs": 1793, - "total_submitted": 5306, + "total_acs": 1812, + "total_submitted": 5337, "total_column_articles": 49, "frontend_question_id": "631", "is_new_question": false @@ -59589,9 +60093,9 @@ "question__title": "Course Schedule III", "question__title_slug": "course-schedule-iii", "question__hide": false, - "total_acs": 45672, - "total_submitted": 94028, - "total_column_articles": 339, + "total_acs": 45894, + "total_submitted": 94463, + "total_column_articles": 340, "frontend_question_id": "630", "is_new_question": false }, @@ -59610,8 +60114,8 @@ "question__title": "K Inverse Pairs Array", "question__title_slug": "k-inverse-pairs-array", "question__hide": false, - "total_acs": 23933, - "total_submitted": 47128, + "total_acs": 24040, + "total_submitted": 47421, "total_column_articles": 220, "frontend_question_id": "629", "is_new_question": false @@ -59631,9 +60135,9 @@ "question__title": "Maximum Product of Three Numbers", "question__title_slug": "maximum-product-of-three-numbers", "question__hide": false, - "total_acs": 129512, - "total_submitted": 249815, - "total_column_articles": 1162, + "total_acs": 130990, + "total_submitted": 252748, + "total_column_articles": 1169, "frontend_question_id": "628", "is_new_question": false }, @@ -59652,9 +60156,9 @@ "question__title": "Swap Salary", "question__title_slug": "swap-salary", "question__hide": false, - "total_acs": 187937, - "total_submitted": 228339, - "total_column_articles": 684, + "total_acs": 188892, + "total_submitted": 229480, + "total_column_articles": 693, "frontend_question_id": "627", "is_new_question": false }, @@ -59673,9 +60177,9 @@ "question__title": "Exchange Seats", "question__title_slug": "exchange-seats", "question__hide": false, - "total_acs": 86318, - "total_submitted": 126096, - "total_column_articles": 728, + "total_acs": 87857, + "total_submitted": 128097, + "total_column_articles": 742, "frontend_question_id": "626", "is_new_question": false }, @@ -59694,8 +60198,8 @@ "question__title": "Minimum Factorization", "question__title_slug": "minimum-factorization", "question__hide": false, - "total_acs": 3543, - "total_submitted": 10222, + "total_acs": 3556, + "total_submitted": 10275, "total_column_articles": 70, "frontend_question_id": "625", "is_new_question": false @@ -59715,9 +60219,9 @@ "question__title": "Maximum Distance in Arrays", "question__title_slug": "maximum-distance-in-arrays", "question__hide": false, - "total_acs": 8147, - "total_submitted": 20251, - "total_column_articles": 130, + "total_acs": 8394, + "total_submitted": 20932, + "total_column_articles": 133, "frontend_question_id": "624", "is_new_question": false }, @@ -59736,9 +60240,9 @@ "question__title": "Add One Row to Tree", "question__title_slug": "add-one-row-to-tree", "question__hide": false, - "total_acs": 47879, - "total_submitted": 79640, - "total_column_articles": 670, + "total_acs": 48091, + "total_submitted": 80016, + "total_column_articles": 667, "frontend_question_id": "623", "is_new_question": false }, @@ -59757,9 +60261,9 @@ "question__title": "Task Scheduler", "question__title_slug": "task-scheduler", "question__hide": false, - "total_acs": 149079, - "total_submitted": 248377, - "total_column_articles": 884, + "total_acs": 150156, + "total_submitted": 250054, + "total_column_articles": 893, "frontend_question_id": "621", "is_new_question": false }, @@ -59778,9 +60282,9 @@ "question__title": "Not Boring Movies", "question__title_slug": "not-boring-movies", "question__hide": false, - "total_acs": 157454, - "total_submitted": 203704, - "total_column_articles": 517, + "total_acs": 160645, + "total_submitted": 207679, + "total_column_articles": 525, "frontend_question_id": "620", "is_new_question": false }, @@ -59799,9 +60303,9 @@ "question__title": "Biggest Single Number", "question__title_slug": "biggest-single-number", "question__hide": false, - "total_acs": 50499, - "total_submitted": 94860, - "total_column_articles": 277, + "total_acs": 52845, + "total_submitted": 98279, + "total_column_articles": 285, "frontend_question_id": "619", "is_new_question": false }, @@ -59820,9 +60324,9 @@ "question__title": "Students Report By Geography", "question__title_slug": "students-report-by-geography", "question__hide": false, - "total_acs": 10558, - "total_submitted": 17158, - "total_column_articles": 95, + "total_acs": 10641, + "total_submitted": 17285, + "total_column_articles": 97, "frontend_question_id": "618", "is_new_question": false }, @@ -59841,9 +60345,9 @@ "question__title": "Merge Two Binary Trees", "question__title_slug": "merge-two-binary-trees", "question__hide": false, - "total_acs": 473036, - "total_submitted": 596209, - "total_column_articles": 2578, + "total_acs": 479394, + "total_submitted": 604364, + "total_column_articles": 2593, "frontend_question_id": "617", "is_new_question": false }, @@ -59862,8 +60366,8 @@ "question__title": "Add Bold Tag in String", "question__title_slug": "add-bold-tag-in-string", "question__hide": false, - "total_acs": 6753, - "total_submitted": 13386, + "total_acs": 6834, + "total_submitted": 13516, "total_column_articles": 109, "frontend_question_id": "616", "is_new_question": false @@ -59883,9 +60387,9 @@ "question__title": "Average Salary: Departments VS Company", "question__title_slug": "average-salary-departments-vs-company", "question__hide": false, - "total_acs": 11468, - "total_submitted": 27020, - "total_column_articles": 161, + "total_acs": 11565, + "total_submitted": 27198, + "total_column_articles": 163, "frontend_question_id": "615", "is_new_question": false }, @@ -59904,9 +60408,9 @@ "question__title": "Second Degree Follower", "question__title_slug": "second-degree-follower", "question__hide": false, - "total_acs": 16763, - "total_submitted": 44285, - "total_column_articles": 118, + "total_acs": 16887, + "total_submitted": 44557, + "total_column_articles": 120, "frontend_question_id": "614", "is_new_question": false }, @@ -59925,8 +60429,8 @@ "question__title": "Shortest Distance in a Line", "question__title_slug": "shortest-distance-in-a-line", "question__hide": false, - "total_acs": 22410, - "total_submitted": 28364, + "total_acs": 22754, + "total_submitted": 28803, "total_column_articles": 137, "frontend_question_id": "613", "is_new_question": false @@ -59946,9 +60450,9 @@ "question__title": "Shortest Distance in a Plane", "question__title_slug": "shortest-distance-in-a-plane", "question__hide": false, - "total_acs": 14945, - "total_submitted": 23223, - "total_column_articles": 112, + "total_acs": 15034, + "total_submitted": 23380, + "total_column_articles": 113, "frontend_question_id": "612", "is_new_question": false }, @@ -59967,9 +60471,9 @@ "question__title": "Valid Triangle Number", "question__title_slug": "valid-triangle-number", "question__hide": false, - "total_acs": 99545, - "total_submitted": 185748, - "total_column_articles": 696, + "total_acs": 101011, + "total_submitted": 188591, + "total_column_articles": 698, "frontend_question_id": "611", "is_new_question": false }, @@ -59988,9 +60492,9 @@ "question__title": "Triangle Judgement", "question__title_slug": "triangle-judgement", "question__hide": false, - "total_acs": 40911, - "total_submitted": 60143, - "total_column_articles": 201, + "total_acs": 43015, + "total_submitted": 62909, + "total_column_articles": 208, "frontend_question_id": "610", "is_new_question": false }, @@ -60009,9 +60513,9 @@ "question__title": "Find Duplicate File in System", "question__title_slug": "find-duplicate-file-in-system", "question__hide": false, - "total_acs": 11626, - "total_submitted": 21761, - "total_column_articles": 168, + "total_acs": 11745, + "total_submitted": 21936, + "total_column_articles": 169, "frontend_question_id": "609", "is_new_question": false }, @@ -60030,9 +60534,9 @@ "question__title": "Tree Node", "question__title_slug": "tree-node", "question__hide": false, - "total_acs": 64408, - "total_submitted": 103920, - "total_column_articles": 481, + "total_acs": 65269, + "total_submitted": 105104, + "total_column_articles": 489, "frontend_question_id": "608", "is_new_question": false }, @@ -60051,9 +60555,9 @@ "question__title": "Sales Person", "question__title_slug": "sales-person", "question__hide": false, - "total_acs": 84924, - "total_submitted": 126839, - "total_column_articles": 471, + "total_acs": 86459, + "total_submitted": 129313, + "total_column_articles": 479, "frontend_question_id": "607", "is_new_question": false }, @@ -60072,9 +60576,9 @@ "question__title": "Construct String from Binary Tree", "question__title_slug": "construct-string-from-binary-tree", "question__hide": false, - "total_acs": 79032, - "total_submitted": 127565, - "total_column_articles": 769, + "total_acs": 79489, + "total_submitted": 128336, + "total_column_articles": 768, "frontend_question_id": "606", "is_new_question": false }, @@ -60093,9 +60597,9 @@ "question__title": "Can Place Flowers", "question__title_slug": "can-place-flowers", "question__hide": false, - "total_acs": 220438, - "total_submitted": 680754, - "total_column_articles": 2198, + "total_acs": 223706, + "total_submitted": 692104, + "total_column_articles": 2219, "frontend_question_id": "605", "is_new_question": false }, @@ -60114,8 +60618,8 @@ "question__title": "Design Compressed String Iterator", "question__title_slug": "design-compressed-string-iterator", "question__hide": false, - "total_acs": 4478, - "total_submitted": 11341, + "total_acs": 4539, + "total_submitted": 11511, "total_column_articles": 99, "frontend_question_id": "604", "is_new_question": false @@ -60135,9 +60639,9 @@ "question__title": "Consecutive Available Seats", "question__title_slug": "consecutive-available-seats", "question__hide": false, - "total_acs": 29623, - "total_submitted": 46992, - "total_column_articles": 256, + "total_acs": 30038, + "total_submitted": 47764, + "total_column_articles": 259, "frontend_question_id": "603", "is_new_question": false }, @@ -60156,9 +60660,9 @@ "question__title": "Friend Requests II: Who Has the Most Friends", "question__title_slug": "friend-requests-ii-who-has-the-most-friends", "question__hide": false, - "total_acs": 31124, - "total_submitted": 51484, - "total_column_articles": 279, + "total_acs": 32573, + "total_submitted": 53889, + "total_column_articles": 290, "frontend_question_id": "602", "is_new_question": false }, @@ -60177,9 +60681,9 @@ "question__title": "Human Traffic of Stadium", "question__title_slug": "human-traffic-of-stadium", "question__hide": false, - "total_acs": 56028, - "total_submitted": 116238, - "total_column_articles": 652, + "total_acs": 56700, + "total_submitted": 117453, + "total_column_articles": 660, "frontend_question_id": "601", "is_new_question": false }, @@ -60198,9 +60702,9 @@ "question__title": "Non-negative Integers without Consecutive Ones", "question__title_slug": "non-negative-integers-without-consecutive-ones", "question__hide": false, - "total_acs": 27355, - "total_submitted": 54432, - "total_column_articles": 332, + "total_acs": 27478, + "total_submitted": 54710, + "total_column_articles": 333, "frontend_question_id": "600", "is_new_question": false }, @@ -60219,8 +60723,8 @@ "question__title": "Minimum Index Sum of Two Lists", "question__title_slug": "minimum-index-sum-of-two-lists", "question__hide": false, - "total_acs": 93716, - "total_submitted": 164042, + "total_acs": 94441, + "total_submitted": 165162, "total_column_articles": 767, "frontend_question_id": "599", "is_new_question": false @@ -60240,9 +60744,9 @@ "question__title": "Range Addition II", "question__title_slug": "range-addition-ii", "question__hide": false, - "total_acs": 58385, - "total_submitted": 100295, - "total_column_articles": 660, + "total_acs": 58922, + "total_submitted": 101264, + "total_column_articles": 663, "frontend_question_id": "598", "is_new_question": false }, @@ -60261,9 +60765,9 @@ "question__title": "Friend Requests I: Overall Acceptance Rate", "question__title_slug": "friend-requests-i-overall-acceptance-rate", "question__hide": false, - "total_acs": 20290, - "total_submitted": 47362, - "total_column_articles": 136, + "total_acs": 20435, + "total_submitted": 47716, + "total_column_articles": 137, "frontend_question_id": "597", "is_new_question": false }, @@ -60282,9 +60786,9 @@ "question__title": "Classes More Than 5 Students", "question__title_slug": "classes-more-than-5-students", "question__hide": false, - "total_acs": 175347, - "total_submitted": 331451, - "total_column_articles": 546, + "total_acs": 177967, + "total_submitted": 334801, + "total_column_articles": 550, "frontend_question_id": "596", "is_new_question": false }, @@ -60303,9 +60807,9 @@ "question__title": "Big Countries", "question__title_slug": "big-countries", "question__hide": false, - "total_acs": 327550, - "total_submitted": 493440, - "total_column_articles": 688, + "total_acs": 332936, + "total_submitted": 501353, + "total_column_articles": 695, "frontend_question_id": "595", "is_new_question": false }, @@ -60324,9 +60828,9 @@ "question__title": "Longest Harmonious Subsequence", "question__title_slug": "longest-harmonious-subsequence", "question__hide": false, - "total_acs": 90107, - "total_submitted": 159731, - "total_column_articles": 749, + "total_acs": 91285, + "total_submitted": 161704, + "total_column_articles": 747, "frontend_question_id": "594", "is_new_question": false }, @@ -60345,9 +60849,9 @@ "question__title": "Valid Square", "question__title_slug": "valid-square", "question__hide": false, - "total_acs": 37243, - "total_submitted": 79047, - "total_column_articles": 593, + "total_acs": 37442, + "total_submitted": 79490, + "total_column_articles": 594, "frontend_question_id": "593", "is_new_question": false }, @@ -60366,9 +60870,9 @@ "question__title": "Fraction Addition and Subtraction", "question__title_slug": "fraction-addition-and-subtraction", "question__hide": false, - "total_acs": 28106, - "total_submitted": 47034, - "total_column_articles": 485, + "total_acs": 28352, + "total_submitted": 47436, + "total_column_articles": 486, "frontend_question_id": "592", "is_new_question": false }, @@ -60387,8 +60891,8 @@ "question__title": "Tag Validator", "question__title_slug": "tag-validator", "question__hide": false, - "total_acs": 18382, - "total_submitted": 35387, + "total_acs": 18403, + "total_submitted": 35452, "total_column_articles": 196, "frontend_question_id": "591", "is_new_question": false @@ -60408,8 +60912,8 @@ "question__title": "Design In-Memory File System", "question__title_slug": "design-in-memory-file-system", "question__hide": false, - "total_acs": 3756, - "total_submitted": 8569, + "total_acs": 3806, + "total_submitted": 8682, "total_column_articles": 58, "frontend_question_id": "588", "is_new_question": false @@ -60429,8 +60933,8 @@ "question__title": "Erect the Fence", "question__title_slug": "erect-the-fence", "question__hide": false, - "total_acs": 18435, - "total_submitted": 30584, + "total_acs": 18486, + "total_submitted": 30695, "total_column_articles": 141, "frontend_question_id": "587", "is_new_question": false @@ -60450,9 +60954,9 @@ "question__title": "Customer Placing the Largest Number of Orders", "question__title_slug": "customer-placing-the-largest-number-of-orders", "question__hide": false, - "total_acs": 95723, - "total_submitted": 141046, - "total_column_articles": 438, + "total_acs": 97611, + "total_submitted": 144081, + "total_column_articles": 443, "frontend_question_id": "586", "is_new_question": false }, @@ -60471,9 +60975,9 @@ "question__title": "Investments in 2016", "question__title_slug": "investments-in-2016", "question__hide": false, - "total_acs": 32482, - "total_submitted": 69618, - "total_column_articles": 308, + "total_acs": 34147, + "total_submitted": 72959, + "total_column_articles": 317, "frontend_question_id": "585", "is_new_question": false }, @@ -60492,9 +60996,9 @@ "question__title": "Find Customer Referee", "question__title_slug": "find-customer-referee", "question__hide": false, - "total_acs": 197930, - "total_submitted": 299300, - "total_column_articles": 538, + "total_acs": 204290, + "total_submitted": 308107, + "total_column_articles": 544, "frontend_question_id": "584", "is_new_question": false }, @@ -60513,9 +61017,9 @@ "question__title": "Delete Operation for Two Strings", "question__title_slug": "delete-operation-for-two-strings", "question__hide": false, - "total_acs": 148136, - "total_submitted": 220706, - "total_column_articles": 999, + "total_acs": 151855, + "total_submitted": 226008, + "total_column_articles": 1012, "frontend_question_id": "583", "is_new_question": false }, @@ -60534,8 +61038,8 @@ "question__title": "Kill Process", "question__title_slug": "kill-process", "question__hide": false, - "total_acs": 13527, - "total_submitted": 28748, + "total_acs": 13591, + "total_submitted": 28847, "total_column_articles": 193, "frontend_question_id": "582", "is_new_question": false @@ -60555,9 +61059,9 @@ "question__title": "Shortest Unsorted Continuous Subarray", "question__title_slug": "shortest-unsorted-continuous-subarray", "question__hide": false, - "total_acs": 193591, - "total_submitted": 460065, - "total_column_articles": 1411, + "total_acs": 195619, + "total_submitted": 464242, + "total_column_articles": 1415, "frontend_question_id": "581", "is_new_question": false }, @@ -60576,9 +61080,9 @@ "question__title": "Count Student Number in Departments", "question__title_slug": "count-student-number-in-departments", "question__hide": false, - "total_acs": 24669, - "total_submitted": 45919, - "total_column_articles": 163, + "total_acs": 24825, + "total_submitted": 46203, + "total_column_articles": 166, "frontend_question_id": "580", "is_new_question": false }, @@ -60597,8 +61101,8 @@ "question__title": "Find Cumulative Salary of an Employee", "question__title_slug": "find-cumulative-salary-of-an-employee", "question__hide": false, - "total_acs": 15507, - "total_submitted": 34588, + "total_acs": 15620, + "total_submitted": 34780, "total_column_articles": 200, "frontend_question_id": "579", "is_new_question": false @@ -60618,9 +61122,9 @@ "question__title": "Get Highest Answer Rate Question", "question__title_slug": "get-highest-answer-rate-question", "question__hide": false, - "total_acs": 21020, - "total_submitted": 50142, - "total_column_articles": 204, + "total_acs": 21182, + "total_submitted": 50613, + "total_column_articles": 209, "frontend_question_id": "578", "is_new_question": false }, @@ -60639,9 +61143,9 @@ "question__title": "Employee Bonus", "question__title_slug": "employee-bonus", "question__hide": false, - "total_acs": 69190, - "total_submitted": 99059, - "total_column_articles": 251, + "total_acs": 73254, + "total_submitted": 104612, + "total_column_articles": 258, "frontend_question_id": "577", "is_new_question": false }, @@ -60660,9 +61164,9 @@ "question__title": "Out of Boundary Paths", "question__title_slug": "out-of-boundary-paths", "question__hide": false, - "total_acs": 38730, - "total_submitted": 82228, - "total_column_articles": 399, + "total_acs": 38972, + "total_submitted": 82837, + "total_column_articles": 401, "frontend_question_id": "576", "is_new_question": false }, @@ -60681,9 +61185,9 @@ "question__title": "Distribute Candies", "question__title_slug": "distribute-candies", "question__hide": false, - "total_acs": 121615, - "total_submitted": 172327, - "total_column_articles": 1129, + "total_acs": 122628, + "total_submitted": 173779, + "total_column_articles": 1130, "frontend_question_id": "575", "is_new_question": false }, @@ -60702,9 +61206,9 @@ "question__title": "Winning Candidate", "question__title_slug": "winning-candidate", "question__hide": false, - "total_acs": 25378, - "total_submitted": 38405, - "total_column_articles": 178, + "total_acs": 25561, + "total_submitted": 38693, + "total_column_articles": 180, "frontend_question_id": "574", "is_new_question": false }, @@ -60723,8 +61227,8 @@ "question__title": "Squirrel Simulation", "question__title_slug": "squirrel-simulation", "question__hide": false, - "total_acs": 1857, - "total_submitted": 2845, + "total_acs": 1886, + "total_submitted": 2889, "total_column_articles": 52, "frontend_question_id": "573", "is_new_question": false @@ -60744,9 +61248,9 @@ "question__title": "Subtree of Another Tree", "question__title_slug": "subtree-of-another-tree", "question__hide": false, - "total_acs": 196387, - "total_submitted": 412804, - "total_column_articles": 1414, + "total_acs": 199334, + "total_submitted": 418561, + "total_column_articles": 1427, "frontend_question_id": "572", "is_new_question": false }, @@ -60765,9 +61269,9 @@ "question__title": "Find Median Given Frequency of Numbers", "question__title_slug": "find-median-given-frequency-of-numbers", "question__hide": false, - "total_acs": 14830, - "total_submitted": 31714, - "total_column_articles": 160, + "total_acs": 14965, + "total_submitted": 32041, + "total_column_articles": 162, "frontend_question_id": "571", "is_new_question": false }, @@ -60786,9 +61290,9 @@ "question__title": "Managers with at Least 5 Direct Reports", "question__title_slug": "managers-with-at-least-5-direct-reports", "question__hide": false, - "total_acs": 66003, - "total_submitted": 114306, - "total_column_articles": 348, + "total_acs": 69802, + "total_submitted": 122227, + "total_column_articles": 363, "frontend_question_id": "570", "is_new_question": false }, @@ -60807,9 +61311,9 @@ "question__title": "Median Employee Salary", "question__title_slug": "median-employee-salary", "question__hide": false, - "total_acs": 21857, - "total_submitted": 38259, - "total_column_articles": 283, + "total_acs": 22023, + "total_submitted": 38559, + "total_column_articles": 284, "frontend_question_id": "569", "is_new_question": false }, @@ -60828,8 +61332,8 @@ "question__title": "Maximum Vacation Days", "question__title_slug": "maximum-vacation-days", "question__hide": false, - "total_acs": 2576, - "total_submitted": 4606, + "total_acs": 2593, + "total_submitted": 4645, "total_column_articles": 48, "frontend_question_id": "568", "is_new_question": false @@ -60849,9 +61353,9 @@ "question__title": "Permutation in String", "question__title_slug": "permutation-in-string", "question__hide": false, - "total_acs": 282786, - "total_submitted": 630037, - "total_column_articles": 2417, + "total_acs": 285300, + "total_submitted": 634970, + "total_column_articles": 2423, "frontend_question_id": "567", "is_new_question": false }, @@ -60870,9 +61374,9 @@ "question__title": "Reshape the Matrix", "question__title_slug": "reshape-the-matrix", "question__hide": false, - "total_acs": 154295, - "total_submitted": 238740, - "total_column_articles": 1380, + "total_acs": 155171, + "total_submitted": 240190, + "total_column_articles": 1385, "frontend_question_id": "566", "is_new_question": false }, @@ -60891,9 +61395,9 @@ "question__title": "Array Nesting", "question__title_slug": "array-nesting", "question__hide": false, - "total_acs": 50209, - "total_submitted": 80539, - "total_column_articles": 466, + "total_acs": 50416, + "total_submitted": 80903, + "total_column_articles": 465, "frontend_question_id": "565", "is_new_question": false }, @@ -60912,9 +61416,9 @@ "question__title": "Find the Closest Palindrome", "question__title_slug": "find-the-closest-palindrome", "question__hide": false, - "total_acs": 25562, - "total_submitted": 83902, - "total_column_articles": 264, + "total_acs": 25644, + "total_submitted": 84257, + "total_column_articles": 265, "frontend_question_id": "564", "is_new_question": false }, @@ -60933,9 +61437,9 @@ "question__title": "Binary Tree Tilt", "question__title_slug": "binary-tree-tilt", "question__hide": false, - "total_acs": 80803, - "total_submitted": 121735, - "total_column_articles": 799, + "total_acs": 81372, + "total_submitted": 122476, + "total_column_articles": 798, "frontend_question_id": "563", "is_new_question": false }, @@ -60954,8 +61458,8 @@ "question__title": "Longest Line of Consecutive One in Matrix", "question__title_slug": "longest-line-of-consecutive-one-in-matrix", "question__hide": false, - "total_acs": 6218, - "total_submitted": 12468, + "total_acs": 6241, + "total_submitted": 12504, "total_column_articles": 104, "frontend_question_id": "562", "is_new_question": false @@ -60975,9 +61479,9 @@ "question__title": "Array Partition", "question__title_slug": "array-partition", "question__hide": false, - "total_acs": 150552, - "total_submitted": 191952, - "total_column_articles": 1203, + "total_acs": 152408, + "total_submitted": 194312, + "total_column_articles": 1209, "frontend_question_id": "561", "is_new_question": false }, @@ -60996,9 +61500,9 @@ "question__title": "Subarray Sum Equals K", "question__title_slug": "subarray-sum-equals-k", "question__hide": false, - "total_acs": 408227, - "total_submitted": 920694, - "total_column_articles": 2150, + "total_acs": 427218, + "total_submitted": 968189, + "total_column_articles": 2216, "frontend_question_id": "560", "is_new_question": false }, @@ -61017,9 +61521,9 @@ "question__title": "Reverse Words in a String III", "question__title_slug": "reverse-words-in-a-string-iii", "question__hide": false, - "total_acs": 320425, - "total_submitted": 434884, - "total_column_articles": 2647, + "total_acs": 322207, + "total_submitted": 437439, + "total_column_articles": 2655, "frontend_question_id": "557", "is_new_question": false }, @@ -61038,9 +61542,9 @@ "question__title": "Next Greater Element III", "question__title_slug": "next-greater-element-iii", "question__hide": false, - "total_acs": 49500, - "total_submitted": 134243, - "total_column_articles": 589, + "total_acs": 49897, + "total_submitted": 135384, + "total_column_articles": 588, "frontend_question_id": "556", "is_new_question": false }, @@ -61059,8 +61563,8 @@ "question__title": "Split Concatenated Strings", "question__title_slug": "split-concatenated-strings", "question__hide": false, - "total_acs": 1832, - "total_submitted": 4854, + "total_acs": 1839, + "total_submitted": 4891, "total_column_articles": 33, "frontend_question_id": "555", "is_new_question": false @@ -61080,9 +61584,9 @@ "question__title": "Brick Wall", "question__title_slug": "brick-wall", "question__hide": false, - "total_acs": 67304, - "total_submitted": 129567, - "total_column_articles": 617, + "total_acs": 67739, + "total_submitted": 130278, + "total_column_articles": 618, "frontend_question_id": "554", "is_new_question": false }, @@ -61101,9 +61605,9 @@ "question__title": "Optimal Division", "question__title_slug": "optimal-division", "question__hide": false, - "total_acs": 33632, - "total_submitted": 51881, - "total_column_articles": 389, + "total_acs": 33809, + "total_submitted": 52168, + "total_column_articles": 386, "frontend_question_id": "553", "is_new_question": false }, @@ -61122,9 +61626,9 @@ "question__title": "Student Attendance Record II", "question__title_slug": "student-attendance-record-ii", "question__hide": false, - "total_acs": 29846, - "total_submitted": 51452, - "total_column_articles": 355, + "total_acs": 29960, + "total_submitted": 51635, + "total_column_articles": 356, "frontend_question_id": "552", "is_new_question": false }, @@ -61143,9 +61647,9 @@ "question__title": "Student Attendance Record I", "question__title_slug": "student-attendance-record-i", "question__hide": false, - "total_acs": 85425, - "total_submitted": 149704, - "total_column_articles": 1032, + "total_acs": 86138, + "total_submitted": 150870, + "total_column_articles": 1031, "frontend_question_id": "551", "is_new_question": false }, @@ -61164,8 +61668,8 @@ "question__title": "Shortest Path to Get Food", "question__title_slug": "shortest-path-to-get-food", "question__hide": false, - "total_acs": 1939, - "total_submitted": 3651, + "total_acs": 1973, + "total_submitted": 3699, "total_column_articles": 44, "frontend_question_id": "1730", "is_new_question": false @@ -61185,9 +61689,9 @@ "question__title": "Binary Tree Longest Consecutive Sequence II", "question__title_slug": "binary-tree-longest-consecutive-sequence-ii", "question__hide": false, - "total_acs": 5486, - "total_submitted": 10986, - "total_column_articles": 98, + "total_acs": 5562, + "total_submitted": 11154, + "total_column_articles": 99, "frontend_question_id": "549", "is_new_question": false }, @@ -61206,8 +61710,8 @@ "question__title": "Split Array with Equal Sum", "question__title_slug": "split-array-with-equal-sum", "question__hide": false, - "total_acs": 2548, - "total_submitted": 6486, + "total_acs": 2552, + "total_submitted": 6511, "total_column_articles": 54, "frontend_question_id": "548", "is_new_question": false @@ -61227,9 +61731,9 @@ "question__title": "Number of Provinces", "question__title_slug": "number-of-provinces", "question__hide": false, - "total_acs": 298448, - "total_submitted": 480061, - "total_column_articles": 1965, + "total_acs": 301781, + "total_submitted": 485289, + "total_column_articles": 1978, "frontend_question_id": "547", "is_new_question": false }, @@ -61248,9 +61752,9 @@ "question__title": "Remove Boxes", "question__title_slug": "remove-boxes", "question__hide": false, - "total_acs": 19434, - "total_submitted": 31983, - "total_column_articles": 150, + "total_acs": 19508, + "total_submitted": 32143, + "total_column_articles": 151, "frontend_question_id": "546", "is_new_question": false }, @@ -61269,9 +61773,9 @@ "question__title": "Boundary of Binary Tree", "question__title_slug": "boundary-of-binary-tree", "question__hide": false, - "total_acs": 6349, - "total_submitted": 13811, - "total_column_articles": 116, + "total_acs": 6419, + "total_submitted": 13949, + "total_column_articles": 118, "frontend_question_id": "545", "is_new_question": false }, @@ -61290,8 +61794,8 @@ "question__title": "Output Contest Matches", "question__title_slug": "output-contest-matches", "question__hide": false, - "total_acs": 3555, - "total_submitted": 4906, + "total_acs": 3573, + "total_submitted": 4946, "total_column_articles": 75, "frontend_question_id": "544", "is_new_question": false @@ -61311,9 +61815,9 @@ "question__title": "Diameter of Binary Tree", "question__title_slug": "diameter-of-binary-tree", "question__hide": false, - "total_acs": 385433, - "total_submitted": 645876, - "total_column_articles": 2468, + "total_acs": 399908, + "total_submitted": 667497, + "total_column_articles": 2503, "frontend_question_id": "543", "is_new_question": false }, @@ -61332,8 +61836,8 @@ "question__title": "01 Matrix", "question__title_slug": "01-matrix", "question__hide": false, - "total_acs": 140771, - "total_submitted": 301083, + "total_acs": 141539, + "total_submitted": 302612, "total_column_articles": 1138, "frontend_question_id": "542", "is_new_question": false @@ -61353,9 +61857,9 @@ "question__title": "Reverse String II", "question__title_slug": "reverse-string-ii", "question__hide": false, - "total_acs": 256716, - "total_submitted": 445976, - "total_column_articles": 1753, + "total_acs": 265852, + "total_submitted": 462505, + "total_column_articles": 1795, "frontend_question_id": "541", "is_new_question": false }, @@ -61374,9 +61878,9 @@ "question__title": "Single Element in a Sorted Array", "question__title_slug": "single-element-in-a-sorted-array", "question__hide": false, - "total_acs": 125016, - "total_submitted": 206833, - "total_column_articles": 1131, + "total_acs": 126298, + "total_submitted": 209290, + "total_column_articles": 1132, "frontend_question_id": "540", "is_new_question": false }, @@ -61395,9 +61899,9 @@ "question__title": "Minimum Time Difference", "question__title_slug": "minimum-time-difference", "question__hide": false, - "total_acs": 67411, - "total_submitted": 102854, - "total_column_articles": 691, + "total_acs": 67757, + "total_submitted": 103495, + "total_column_articles": 692, "frontend_question_id": "539", "is_new_question": false }, @@ -61416,9 +61920,9 @@ "question__title": "Convert BST to Greater Tree", "question__title_slug": "convert-bst-to-greater-tree", "question__hide": false, - "total_acs": 267060, - "total_submitted": 346014, - "total_column_articles": 1660, + "total_acs": 271569, + "total_submitted": 351588, + "total_column_articles": 1671, "frontend_question_id": "538", "is_new_question": false }, @@ -61437,8 +61941,8 @@ "question__title": "Complex Number Multiplication", "question__title_slug": "complex-number-multiplication", "question__hide": false, - "total_acs": 46317, - "total_submitted": 62297, + "total_acs": 46574, + "total_submitted": 62660, "total_column_articles": 678, "frontend_question_id": "537", "is_new_question": false @@ -61458,9 +61962,9 @@ "question__title": "Construct Binary Tree from String", "question__title_slug": "construct-binary-tree-from-string", "question__hide": false, - "total_acs": 6085, - "total_submitted": 10938, - "total_column_articles": 101, + "total_acs": 6130, + "total_submitted": 11014, + "total_column_articles": 102, "frontend_question_id": "536", "is_new_question": false }, @@ -61479,8 +61983,8 @@ "question__title": "Encode and Decode TinyURL", "question__title_slug": "encode-and-decode-tinyurl", "question__hide": false, - "total_acs": 46671, - "total_submitted": 53356, + "total_acs": 46904, + "total_submitted": 53635, "total_column_articles": 290, "frontend_question_id": "535", "is_new_question": false @@ -61500,9 +62004,9 @@ "question__title": "Lonely Pixel II", "question__title_slug": "lonely-pixel-ii", "question__hide": false, - "total_acs": 2861, - "total_submitted": 5447, - "total_column_articles": 51, + "total_acs": 2884, + "total_submitted": 5502, + "total_column_articles": 52, "frontend_question_id": "533", "is_new_question": false }, @@ -61521,9 +62025,9 @@ "question__title": "K-diff Pairs in an Array", "question__title_slug": "k-diff-pairs-in-an-array", "question__hide": false, - "total_acs": 65868, - "total_submitted": 143105, - "total_column_articles": 726, + "total_acs": 66270, + "total_submitted": 143740, + "total_column_articles": 725, "frontend_question_id": "532", "is_new_question": false }, @@ -61542,8 +62046,8 @@ "question__title": "Lonely Pixel I", "question__title_slug": "lonely-pixel-i", "question__hide": false, - "total_acs": 7853, - "total_submitted": 12240, + "total_acs": 7977, + "total_submitted": 12411, "total_column_articles": 132, "frontend_question_id": "531", "is_new_question": false @@ -61563,9 +62067,9 @@ "question__title": "Minimum Absolute Difference in BST", "question__title_slug": "minimum-absolute-difference-in-bst", "question__hide": false, - "total_acs": 225445, - "total_submitted": 357785, - "total_column_articles": 1344, + "total_acs": 233344, + "total_submitted": 371055, + "total_column_articles": 1368, "frontend_question_id": "530", "is_new_question": false }, @@ -61584,9 +62088,9 @@ "question__title": "Minesweeper", "question__title_slug": "minesweeper", "question__hide": false, - "total_acs": 54220, - "total_submitted": 84855, - "total_column_articles": 621, + "total_acs": 54533, + "total_submitted": 85345, + "total_column_articles": 618, "frontend_question_id": "529", "is_new_question": false }, @@ -61605,9 +62109,9 @@ "question__title": "Swapping Nodes in a Linked List", "question__title_slug": "swapping-nodes-in-a-linked-list", "question__hide": false, - "total_acs": 22338, - "total_submitted": 35099, - "total_column_articles": 329, + "total_acs": 22537, + "total_submitted": 35452, + "total_column_articles": 330, "frontend_question_id": "1721", "is_new_question": false }, @@ -61626,8 +62130,8 @@ "question__title": "Word Abbreviation", "question__title_slug": "word-abbreviation", "question__hide": false, - "total_acs": 3004, - "total_submitted": 4975, + "total_acs": 3012, + "total_submitted": 5002, "total_column_articles": 43, "frontend_question_id": "527", "is_new_question": false @@ -61647,9 +62151,9 @@ "question__title": "Beautiful Arrangement", "question__title_slug": "beautiful-arrangement", "question__hide": false, - "total_acs": 51748, - "total_submitted": 71092, - "total_column_articles": 545, + "total_acs": 52117, + "total_submitted": 71774, + "total_column_articles": 542, "frontend_question_id": "526", "is_new_question": false }, @@ -61668,9 +62172,9 @@ "question__title": "Contiguous Array", "question__title_slug": "contiguous-array", "question__hide": false, - "total_acs": 75002, - "total_submitted": 137232, - "total_column_articles": 738, + "total_acs": 76026, + "total_submitted": 139290, + "total_column_articles": 746, "frontend_question_id": "525", "is_new_question": false }, @@ -61689,9 +62193,9 @@ "question__title": "Longest Word in Dictionary through Deleting", "question__title_slug": "longest-word-in-dictionary-through-deleting", "question__hide": false, - "total_acs": 107270, - "total_submitted": 213515, - "total_column_articles": 1020, + "total_acs": 107950, + "total_submitted": 214885, + "total_column_articles": 1018, "frontend_question_id": "524", "is_new_question": false }, @@ -61710,8 +62214,8 @@ "question__title": "Continuous Subarray Sum", "question__title_slug": "continuous-subarray-sum", "question__hide": false, - "total_acs": 104110, - "total_submitted": 361910, + "total_acs": 104932, + "total_submitted": 364800, "total_column_articles": 820, "frontend_question_id": "523", "is_new_question": false @@ -61731,8 +62235,8 @@ "question__title": "Longest Uncommon Subsequence II", "question__title_slug": "longest-uncommon-subsequence-ii", "question__hide": false, - "total_acs": 33832, - "total_submitted": 69203, + "total_acs": 33949, + "total_submitted": 69447, "total_column_articles": 369, "frontend_question_id": "522", "is_new_question": false @@ -61752,9 +62256,9 @@ "question__title": "Longest Uncommon Subsequence I", "question__title_slug": "longest-uncommon-subsequence-i", "question__hide": false, - "total_acs": 67373, - "total_submitted": 91445, - "total_column_articles": 593, + "total_acs": 67898, + "total_submitted": 92161, + "total_column_articles": 591, "frontend_question_id": "521", "is_new_question": false }, @@ -61773,9 +62277,9 @@ "question__title": "Detect Capital", "question__title_slug": "detect-capital", "question__hide": false, - "total_acs": 96377, - "total_submitted": 170662, - "total_column_articles": 1417, + "total_acs": 97277, + "total_submitted": 172363, + "total_column_articles": 1424, "frontend_question_id": "520", "is_new_question": false }, @@ -61794,8 +62298,8 @@ "question__title": "Widest Pair of Indices With Equal Range Sum", "question__title_slug": "widest-pair-of-indices-with-equal-range-sum", "question__hide": false, - "total_acs": 417, - "total_submitted": 842, + "total_acs": 432, + "total_submitted": 862, "total_column_articles": 13, "frontend_question_id": "1983", "is_new_question": false @@ -61815,9 +62319,9 @@ "question__title": "Coin Change II", "question__title_slug": "coin-change-ii", "question__hide": false, - "total_acs": 288252, - "total_submitted": 405938, - "total_column_articles": 1405, + "total_acs": 295660, + "total_submitted": 415854, + "total_column_articles": 1424, "frontend_question_id": "518", "is_new_question": false }, @@ -61836,8 +62340,8 @@ "question__title": "Super Washing Machines", "question__title_slug": "super-washing-machines", "question__hide": false, - "total_acs": 25312, - "total_submitted": 49408, + "total_acs": 25415, + "total_submitted": 49627, "total_column_articles": 218, "frontend_question_id": "517", "is_new_question": false @@ -61857,9 +62361,9 @@ "question__title": "Longest Palindromic Subsequence", "question__title_slug": "longest-palindromic-subsequence", "question__hide": false, - "total_acs": 219584, - "total_submitted": 327175, - "total_column_articles": 1226, + "total_acs": 225309, + "total_submitted": 335891, + "total_column_articles": 1236, "frontend_question_id": "516", "is_new_question": false }, @@ -61878,9 +62382,9 @@ "question__title": "Find Largest Value in Each Tree Row", "question__title_slug": "find-largest-value-in-each-tree-row", "question__hide": false, - "total_acs": 142874, - "total_submitted": 215113, - "total_column_articles": 1196, + "total_acs": 146437, + "total_submitted": 220483, + "total_column_articles": 1204, "frontend_question_id": "515", "is_new_question": false }, @@ -61899,8 +62403,8 @@ "question__title": "Freedom Trail", "question__title_slug": "freedom-trail", "question__hide": false, - "total_acs": 40191, - "total_submitted": 74013, + "total_acs": 40421, + "total_submitted": 74454, "total_column_articles": 443, "frontend_question_id": "514", "is_new_question": false @@ -61920,9 +62424,9 @@ "question__title": "Find Bottom Left Tree Value", "question__title_slug": "find-bottom-left-tree-value", "question__hide": false, - "total_acs": 229366, - "total_submitted": 313207, - "total_column_articles": 1670, + "total_acs": 236100, + "total_submitted": 322558, + "total_column_articles": 1694, "frontend_question_id": "513", "is_new_question": false }, @@ -61941,8 +62445,8 @@ "question__title": "Maximum Alternating Subarray Sum", "question__title_slug": "maximum-alternating-subarray-sum", "question__hide": false, - "total_acs": 551, - "total_submitted": 1304, + "total_acs": 560, + "total_submitted": 1336, "total_column_articles": 19, "frontend_question_id": "2036", "is_new_question": false @@ -61962,9 +62466,9 @@ "question__title": "All Paths from Source Lead to Destination", "question__title_slug": "all-paths-from-source-lead-to-destination", "question__hide": false, - "total_acs": 4345, - "total_submitted": 12329, - "total_column_articles": 65, + "total_acs": 4396, + "total_submitted": 12490, + "total_column_articles": 67, "frontend_question_id": "1059", "is_new_question": false }, @@ -61983,8 +62487,8 @@ "question__title": "Count Subarrays With More Ones Than Zeros", "question__title_slug": "count-subarrays-with-more-ones-than-zeros", "question__hide": false, - "total_acs": 866, - "total_submitted": 1581, + "total_acs": 895, + "total_submitted": 1657, "total_column_articles": 25, "frontend_question_id": "2031", "is_new_question": false @@ -62004,8 +62508,8 @@ "question__title": "Inorder Successor in BST II", "question__title_slug": "inorder-successor-in-bst-ii", "question__hide": false, - "total_acs": 6107, - "total_submitted": 10053, + "total_acs": 6160, + "total_submitted": 10132, "total_column_articles": 75, "frontend_question_id": "510", "is_new_question": false @@ -62025,9 +62529,9 @@ "question__title": "Most Frequent Subtree Sum", "question__title_slug": "most-frequent-subtree-sum", "question__hide": false, - "total_acs": 46902, - "total_submitted": 61988, - "total_column_articles": 583, + "total_acs": 47150, + "total_submitted": 62331, + "total_column_articles": 585, "frontend_question_id": "508", "is_new_question": false }, @@ -62046,8 +62550,8 @@ "question__title": "Perfect Number", "question__title_slug": "perfect-number", "question__hide": false, - "total_acs": 84350, - "total_submitted": 171707, + "total_acs": 85268, + "total_submitted": 173543, "total_column_articles": 603, "frontend_question_id": "507", "is_new_question": false @@ -62067,9 +62571,9 @@ "question__title": "Relative Ranks", "question__title_slug": "relative-ranks", "question__hide": false, - "total_acs": 86621, - "total_submitted": 132265, - "total_column_articles": 1042, + "total_acs": 87606, + "total_submitted": 133775, + "total_column_articles": 1046, "frontend_question_id": "506", "is_new_question": false }, @@ -62088,9 +62592,9 @@ "question__title": "The Maze II", "question__title_slug": "the-maze-ii", "question__hide": false, - "total_acs": 11082, - "total_submitted": 21354, - "total_column_articles": 129, + "total_acs": 11173, + "total_submitted": 21526, + "total_column_articles": 130, "frontend_question_id": "505", "is_new_question": false }, @@ -62109,9 +62613,9 @@ "question__title": "Base 7", "question__title_slug": "base-7", "question__hide": false, - "total_acs": 93617, - "total_submitted": 180555, - "total_column_articles": 878, + "total_acs": 94561, + "total_submitted": 182405, + "total_column_articles": 877, "frontend_question_id": "504", "is_new_question": false }, @@ -62130,9 +62634,9 @@ "question__title": "Next Greater Element II", "question__title_slug": "next-greater-element-ii", "question__hide": false, - "total_acs": 230430, - "total_submitted": 342459, - "total_column_articles": 1733, + "total_acs": 234366, + "total_submitted": 348133, + "total_column_articles": 1752, "frontend_question_id": "503", "is_new_question": false }, @@ -62151,9 +62655,9 @@ "question__title": "IPO", "question__title_slug": "ipo", "question__hide": false, - "total_acs": 41465, - "total_submitted": 91620, - "total_column_articles": 463, + "total_acs": 42410, + "total_submitted": 93744, + "total_column_articles": 465, "frontend_question_id": "502", "is_new_question": false }, @@ -62172,9 +62676,9 @@ "question__title": "Find Mode in Binary Search Tree", "question__title_slug": "find-mode-in-binary-search-tree", "question__hide": false, - "total_acs": 194256, - "total_submitted": 352488, - "total_column_articles": 1218, + "total_acs": 199243, + "total_submitted": 361570, + "total_column_articles": 1233, "frontend_question_id": "501", "is_new_question": false }, @@ -62193,9 +62697,9 @@ "question__title": "Keyboard Row", "question__title_slug": "keyboard-row", "question__hide": false, - "total_acs": 76600, - "total_submitted": 103511, - "total_column_articles": 1101, + "total_acs": 77301, + "total_submitted": 104568, + "total_column_articles": 1105, "frontend_question_id": "500", "is_new_question": false }, @@ -62214,9 +62718,9 @@ "question__title": "The Maze III", "question__title_slug": "the-maze-iii", "question__hide": false, - "total_acs": 5391, - "total_submitted": 12077, - "total_column_articles": 97, + "total_acs": 5440, + "total_submitted": 12190, + "total_column_articles": 98, "frontend_question_id": "499", "is_new_question": false }, @@ -62235,9 +62739,9 @@ "question__title": "Diagonal Traverse", "question__title_slug": "diagonal-traverse", "question__hide": false, - "total_acs": 121800, - "total_submitted": 218070, - "total_column_articles": 1194, + "total_acs": 123061, + "total_submitted": 220343, + "total_column_articles": 1207, "frontend_question_id": "498", "is_new_question": false }, @@ -62256,9 +62760,9 @@ "question__title": "Next Greater Element I", "question__title_slug": "next-greater-element-i", "question__hide": false, - "total_acs": 304218, - "total_submitted": 423316, - "total_column_articles": 2590, + "total_acs": 309479, + "total_submitted": 430426, + "total_column_articles": 2610, "frontend_question_id": "496", "is_new_question": false }, @@ -62277,9 +62781,9 @@ "question__title": "Teemo Attacking", "question__title_slug": "teemo-attacking", "question__hide": false, - "total_acs": 105796, - "total_submitted": 178244, - "total_column_articles": 1367, + "total_acs": 107305, + "total_submitted": 180800, + "total_column_articles": 1378, "frontend_question_id": "495", "is_new_question": false }, @@ -62298,9 +62802,9 @@ "question__title": "Target Sum", "question__title_slug": "target-sum", "question__hide": false, - "total_acs": 413242, - "total_submitted": 853871, - "total_column_articles": 2162, + "total_acs": 422487, + "total_submitted": 874015, + "total_column_articles": 2182, "frontend_question_id": "494", "is_new_question": false }, @@ -62319,9 +62823,9 @@ "question__title": "Reverse Pairs", "question__title_slug": "reverse-pairs", "question__hide": false, - "total_acs": 44871, - "total_submitted": 121488, - "total_column_articles": 428, + "total_acs": 45545, + "total_submitted": 123297, + "total_column_articles": 433, "frontend_question_id": "493", "is_new_question": false }, @@ -62340,9 +62844,9 @@ "question__title": "Construct the Rectangle", "question__title_slug": "construct-the-rectangle", "question__hide": false, - "total_acs": 61574, - "total_submitted": 99775, - "total_column_articles": 562, + "total_acs": 62110, + "total_submitted": 100539, + "total_column_articles": 560, "frontend_question_id": "492", "is_new_question": false }, @@ -62361,9 +62865,9 @@ "question__title": "Non-decreasing Subsequences", "question__title_slug": "non-decreasing-subsequences", "question__hide": false, - "total_acs": 168304, - "total_submitted": 324373, - "total_column_articles": 1008, + "total_acs": 173379, + "total_submitted": 334526, + "total_column_articles": 1023, "frontend_question_id": "491", "is_new_question": false }, @@ -62382,8 +62886,8 @@ "question__title": "The Maze", "question__title_slug": "the-maze", "question__hide": false, - "total_acs": 13421, - "total_submitted": 26200, + "total_acs": 13568, + "total_submitted": 26429, "total_column_articles": 153, "frontend_question_id": "490", "is_new_question": false @@ -62403,9 +62907,9 @@ "question__title": "Kth Smallest Instructions", "question__title_slug": "kth-smallest-instructions", "question__hide": false, - "total_acs": 3731, - "total_submitted": 7633, - "total_column_articles": 81, + "total_acs": 3755, + "total_submitted": 7687, + "total_column_articles": 82, "frontend_question_id": "1643", "is_new_question": false }, @@ -62424,8 +62928,8 @@ "question__title": "Zuma Game", "question__title_slug": "zuma-game", "question__hide": false, - "total_acs": 20986, - "total_submitted": 44515, + "total_acs": 21021, + "total_submitted": 44629, "total_column_articles": 188, "frontend_question_id": "488", "is_new_question": false @@ -62445,8 +62949,8 @@ "question__title": "Max Consecutive Ones II", "question__title_slug": "max-consecutive-ones-ii", "question__hide": false, - "total_acs": 16526, - "total_submitted": 28938, + "total_acs": 16745, + "total_submitted": 29322, "total_column_articles": 258, "frontend_question_id": "487", "is_new_question": false @@ -62466,9 +62970,9 @@ "question__title": "Predict the Winner", "question__title_slug": "predict-the-winner", "question__hide": false, - "total_acs": 74243, - "total_submitted": 124900, - "total_column_articles": 598, + "total_acs": 74922, + "total_submitted": 126069, + "total_column_articles": 599, "frontend_question_id": "486", "is_new_question": false }, @@ -62487,9 +62991,9 @@ "question__title": "Max Consecutive Ones", "question__title_slug": "max-consecutive-ones", "question__hide": false, - "total_acs": 231353, - "total_submitted": 378138, - "total_column_articles": 1772, + "total_acs": 234934, + "total_submitted": 383828, + "total_column_articles": 1794, "frontend_question_id": "485", "is_new_question": false }, @@ -62508,8 +63012,8 @@ "question__title": "Find Permutation", "question__title_slug": "find-permutation", "question__hide": false, - "total_acs": 3854, - "total_submitted": 6408, + "total_acs": 3945, + "total_submitted": 6559, "total_column_articles": 68, "frontend_question_id": "484", "is_new_question": false @@ -62529,9 +63033,9 @@ "question__title": "Smallest Good Base", "question__title_slug": "smallest-good-base", "question__hide": false, - "total_acs": 19849, - "total_submitted": 33765, - "total_column_articles": 152, + "total_acs": 19885, + "total_submitted": 33853, + "total_column_articles": 153, "frontend_question_id": "483", "is_new_question": false }, @@ -62550,8 +63054,8 @@ "question__title": "License Key Formatting", "question__title_slug": "license-key-formatting", "question__hide": false, - "total_acs": 61575, - "total_submitted": 131624, + "total_acs": 62158, + "total_submitted": 132998, "total_column_articles": 630, "frontend_question_id": "482", "is_new_question": false @@ -62571,9 +63075,9 @@ "question__title": "Magical String", "question__title_slug": "magical-string", "question__hide": false, - "total_acs": 37403, - "total_submitted": 58463, - "total_column_articles": 482, + "total_acs": 37639, + "total_submitted": 58908, + "total_column_articles": 484, "frontend_question_id": "481", "is_new_question": false }, @@ -62592,9 +63096,9 @@ "question__title": "Sliding Window Median", "question__title_slug": "sliding-window-median", "question__hide": false, - "total_acs": 42341, - "total_submitted": 99011, - "total_column_articles": 545, + "total_acs": 42611, + "total_submitted": 99960, + "total_column_articles": 543, "frontend_question_id": "480", "is_new_question": false }, @@ -62613,9 +63117,9 @@ "question__title": "Largest Palindrome Product", "question__title_slug": "largest-palindrome-product", "question__hide": false, - "total_acs": 23999, - "total_submitted": 38576, - "total_column_articles": 180, + "total_acs": 24076, + "total_submitted": 38739, + "total_column_articles": 181, "frontend_question_id": "479", "is_new_question": false }, @@ -62634,9 +63138,9 @@ "question__title": "Total Hamming Distance", "question__title_slug": "total-hamming-distance", "question__hide": false, - "total_acs": 48175, - "total_submitted": 79394, - "total_column_articles": 398, + "total_acs": 48576, + "total_submitted": 80083, + "total_column_articles": 399, "frontend_question_id": "477", "is_new_question": false }, @@ -62655,9 +63159,9 @@ "question__title": "Number Complement", "question__title_slug": "number-complement", "question__hide": false, - "total_acs": 87330, - "total_submitted": 125737, - "total_column_articles": 1149, + "total_acs": 88198, + "total_submitted": 127011, + "total_column_articles": 1154, "frontend_question_id": "476", "is_new_question": false }, @@ -62676,9 +63180,9 @@ "question__title": "Heaters", "question__title_slug": "heaters", "question__hide": false, - "total_acs": 74142, - "total_submitted": 179607, - "total_column_articles": 731, + "total_acs": 74572, + "total_submitted": 180562, + "total_column_articles": 730, "frontend_question_id": "475", "is_new_question": false }, @@ -62697,9 +63201,9 @@ "question__title": "Ones and Zeroes", "question__title_slug": "ones-and-zeroes", "question__hide": false, - "total_acs": 192763, - "total_submitted": 292641, - "total_column_articles": 1180, + "total_acs": 198186, + "total_submitted": 300622, + "total_column_articles": 1196, "frontend_question_id": "474", "is_new_question": false }, @@ -62718,8 +63222,8 @@ "question__title": "Matchsticks to Square", "question__title_slug": "matchsticks-to-square", "question__hide": false, - "total_acs": 76326, - "total_submitted": 163279, + "total_acs": 76787, + "total_submitted": 164349, "total_column_articles": 543, "frontend_question_id": "473", "is_new_question": false @@ -62739,9 +63243,9 @@ "question__title": "Concatenated Words", "question__title_slug": "concatenated-words", "question__hide": false, - "total_acs": 28583, - "total_submitted": 54904, - "total_column_articles": 276, + "total_acs": 28701, + "total_submitted": 55150, + "total_column_articles": 277, "frontend_question_id": "472", "is_new_question": false }, @@ -62760,8 +63264,8 @@ "question__title": "Encode String with Shortest Length", "question__title_slug": "encode-string-with-shortest-length", "question__hide": false, - "total_acs": 2752, - "total_submitted": 4656, + "total_acs": 2761, + "total_submitted": 4683, "total_column_articles": 46, "frontend_question_id": "471", "is_new_question": false @@ -62781,8 +63285,8 @@ "question__title": "Convex Polygon", "question__title_slug": "convex-polygon", "question__hide": false, - "total_acs": 2723, - "total_submitted": 6347, + "total_acs": 2740, + "total_submitted": 6390, "total_column_articles": 37, "frontend_question_id": "469", "is_new_question": false @@ -62802,9 +63306,9 @@ "question__title": "Validate IP Address", "question__title_slug": "validate-ip-address", "question__hide": false, - "total_acs": 67506, - "total_submitted": 239388, - "total_column_articles": 745, + "total_acs": 67927, + "total_submitted": 241040, + "total_column_articles": 746, "frontend_question_id": "468", "is_new_question": false }, @@ -62823,8 +63327,8 @@ "question__title": "Unique Substrings in Wraparound String", "question__title_slug": "unique-substrings-in-wraparound-string", "question__hide": false, - "total_acs": 40711, - "total_submitted": 78666, + "total_acs": 41129, + "total_submitted": 79525, "total_column_articles": 390, "frontend_question_id": "467", "is_new_question": false @@ -62844,8 +63348,8 @@ "question__title": "Count The Repetitions", "question__title_slug": "count-the-repetitions", "question__hide": false, - "total_acs": 24950, - "total_submitted": 59819, + "total_acs": 25006, + "total_submitted": 60046, "total_column_articles": 266, "frontend_question_id": "466", "is_new_question": false @@ -62865,8 +63369,8 @@ "question__title": "Optimal Account Balancing", "question__title_slug": "optimal-account-balancing", "question__hide": false, - "total_acs": 3046, - "total_submitted": 5524, + "total_acs": 3091, + "total_submitted": 5624, "total_column_articles": 46, "frontend_question_id": "465", "is_new_question": false @@ -62886,9 +63390,9 @@ "question__title": "Can I Win", "question__title_slug": "can-i-win", "question__hide": false, - "total_acs": 41044, - "total_submitted": 100478, - "total_column_articles": 301, + "total_acs": 41311, + "total_submitted": 101295, + "total_column_articles": 302, "frontend_question_id": "464", "is_new_question": false }, @@ -62907,9 +63411,9 @@ "question__title": "Island Perimeter", "question__title_slug": "island-perimeter", "question__hide": false, - "total_acs": 150836, - "total_submitted": 215143, - "total_column_articles": 1562, + "total_acs": 153722, + "total_submitted": 219334, + "total_column_articles": 1585, "frontend_question_id": "463", "is_new_question": false }, @@ -62928,9 +63432,9 @@ "question__title": "Minimum Moves to Equal Array Elements II", "question__title_slug": "minimum-moves-to-equal-array-elements-ii", "question__hide": false, - "total_acs": 55463, - "total_submitted": 88728, - "total_column_articles": 545, + "total_acs": 55834, + "total_submitted": 89297, + "total_column_articles": 543, "frontend_question_id": "462", "is_new_question": false }, @@ -62949,9 +63453,9 @@ "question__title": "Hamming Distance", "question__title_slug": "hamming-distance", "question__hide": false, - "total_acs": 298630, - "total_submitted": 364849, - "total_column_articles": 2164, + "total_acs": 301216, + "total_submitted": 368032, + "total_column_articles": 2169, "frontend_question_id": "461", "is_new_question": false }, @@ -62970,9 +63474,9 @@ "question__title": "LFU Cache", "question__title_slug": "lfu-cache", "question__hide": false, - "total_acs": 82612, - "total_submitted": 174892, - "total_column_articles": 757, + "total_acs": 83760, + "total_submitted": 177224, + "total_column_articles": 762, "frontend_question_id": "460", "is_new_question": false }, @@ -62991,9 +63495,9 @@ "question__title": "Repeated Substring Pattern", "question__title_slug": "repeated-substring-pattern", "question__hide": false, - "total_acs": 239301, - "total_submitted": 465741, - "total_column_articles": 1524, + "total_acs": 247623, + "total_submitted": 482098, + "total_column_articles": 1559, "frontend_question_id": "459", "is_new_question": false }, @@ -63012,8 +63516,8 @@ "question__title": "Poor Pigs", "question__title_slug": "poor-pigs", "question__hide": false, - "total_acs": 28303, - "total_submitted": 42507, + "total_acs": 28402, + "total_submitted": 42701, "total_column_articles": 255, "frontend_question_id": "458", "is_new_question": false @@ -63033,9 +63537,9 @@ "question__title": "Circular Array Loop", "question__title_slug": "circular-array-loop", "question__hide": false, - "total_acs": 37541, - "total_submitted": 86487, - "total_column_articles": 387, + "total_acs": 37683, + "total_submitted": 86791, + "total_column_articles": 388, "frontend_question_id": "457", "is_new_question": false }, @@ -63054,9 +63558,9 @@ "question__title": "132 Pattern", "question__title_slug": "132-pattern", "question__hide": false, - "total_acs": 80076, - "total_submitted": 219526, - "total_column_articles": 634, + "total_acs": 80481, + "total_submitted": 220656, + "total_column_articles": 633, "frontend_question_id": "456", "is_new_question": false }, @@ -63075,9 +63579,9 @@ "question__title": "Assign Cookies", "question__title_slug": "assign-cookies", "question__hide": false, - "total_acs": 380921, - "total_submitted": 677796, - "total_column_articles": 2546, + "total_acs": 390597, + "total_submitted": 695524, + "total_column_articles": 2585, "frontend_question_id": "455", "is_new_question": false }, @@ -63096,9 +63600,9 @@ "question__title": "4Sum II", "question__title_slug": "4sum-ii", "question__hide": false, - "total_acs": 252817, - "total_submitted": 392747, - "total_column_articles": 1393, + "total_acs": 260992, + "total_submitted": 405284, + "total_column_articles": 1437, "frontend_question_id": "454", "is_new_question": false }, @@ -63117,9 +63621,9 @@ "question__title": "Minimum Moves to Equal Array Elements", "question__title_slug": "minimum-moves-to-equal-array-elements", "question__hide": false, - "total_acs": 81456, - "total_submitted": 132738, - "total_column_articles": 909, + "total_acs": 82312, + "total_submitted": 134076, + "total_column_articles": 910, "frontend_question_id": "453", "is_new_question": false }, @@ -63138,9 +63642,9 @@ "question__title": "Minimum Number of Arrows to Burst Balloons", "question__title_slug": "minimum-number-of-arrows-to-burst-balloons", "question__hide": false, - "total_acs": 253706, - "total_submitted": 495346, - "total_column_articles": 1748, + "total_acs": 261986, + "total_submitted": 510696, + "total_column_articles": 1791, "frontend_question_id": "452", "is_new_question": false }, @@ -63159,8 +63663,8 @@ "question__title": "Sort Characters By Frequency", "question__title_slug": "sort-characters-by-frequency", "question__hide": false, - "total_acs": 135555, - "total_submitted": 187969, + "total_acs": 136589, + "total_submitted": 189385, "total_column_articles": 1406, "frontend_question_id": "451", "is_new_question": false @@ -63180,9 +63684,9 @@ "question__title": "Delete Node in a BST", "question__title_slug": "delete-node-in-a-bst", "question__hide": false, - "total_acs": 248271, - "total_submitted": 474374, - "total_column_articles": 2176, + "total_acs": 253760, + "total_submitted": 485253, + "total_column_articles": 2199, "frontend_question_id": "450", "is_new_question": false }, @@ -63201,9 +63705,9 @@ "question__title": "Serialize and Deserialize BST", "question__title_slug": "serialize-and-deserialize-bst", "question__hide": false, - "total_acs": 66370, - "total_submitted": 106623, - "total_column_articles": 539, + "total_acs": 66591, + "total_submitted": 106974, + "total_column_articles": 537, "frontend_question_id": "449", "is_new_question": false }, @@ -63222,9 +63726,9 @@ "question__title": "Find All Numbers Disappeared in an Array", "question__title_slug": "find-all-numbers-disappeared-in-an-array", "question__hide": false, - "total_acs": 307695, - "total_submitted": 467839, - "total_column_articles": 2067, + "total_acs": 310953, + "total_submitted": 472781, + "total_column_articles": 2083, "frontend_question_id": "448", "is_new_question": false }, @@ -63243,9 +63747,9 @@ "question__title": "Number of Boomerangs", "question__title_slug": "number-of-boomerangs", "question__hide": false, - "total_acs": 75970, - "total_submitted": 111394, - "total_column_articles": 568, + "total_acs": 76209, + "total_submitted": 111748, + "total_column_articles": 566, "frontend_question_id": "447", "is_new_question": false }, @@ -63264,9 +63768,9 @@ "question__title": "Arithmetic Slices II - Subsequence", "question__title_slug": "arithmetic-slices-ii-subsequence", "question__hide": false, - "total_acs": 25817, - "total_submitted": 47494, - "total_column_articles": 221, + "total_acs": 25986, + "total_submitted": 47915, + "total_column_articles": 224, "frontend_question_id": "446", "is_new_question": false }, @@ -63285,9 +63789,9 @@ "question__title": "Add Two Numbers II", "question__title_slug": "add-two-numbers-ii", "question__hide": false, - "total_acs": 151576, - "total_submitted": 248556, - "total_column_articles": 1543, + "total_acs": 152957, + "total_submitted": 250809, + "total_column_articles": 1551, "frontend_question_id": "445", "is_new_question": false }, @@ -63306,8 +63810,8 @@ "question__title": "Sequence Reconstruction", "question__title_slug": "sequence-reconstruction", "question__hide": false, - "total_acs": 6255, - "total_submitted": 19395, + "total_acs": 6297, + "total_submitted": 19465, "total_column_articles": 89, "frontend_question_id": "444", "is_new_question": false @@ -63327,9 +63831,9 @@ "question__title": "String Compression", "question__title_slug": "string-compression", "question__hide": false, - "total_acs": 98139, - "total_submitted": 202190, - "total_column_articles": 1020, + "total_acs": 99606, + "total_submitted": 204937, + "total_column_articles": 1024, "frontend_question_id": "443", "is_new_question": false }, @@ -63348,9 +63852,9 @@ "question__title": "Find All Duplicates in an Array", "question__title_slug": "find-all-duplicates-in-an-array", "question__hide": false, - "total_acs": 119712, - "total_submitted": 159446, - "total_column_articles": 1079, + "total_acs": 121305, + "total_submitted": 161594, + "total_column_articles": 1084, "frontend_question_id": "442", "is_new_question": false }, @@ -63369,9 +63873,9 @@ "question__title": "Arranging Coins", "question__title_slug": "arranging-coins", "question__hide": false, - "total_acs": 130728, - "total_submitted": 289810, - "total_column_articles": 1188, + "total_acs": 132034, + "total_submitted": 292908, + "total_column_articles": 1190, "frontend_question_id": "441", "is_new_question": false }, @@ -63390,8 +63894,8 @@ "question__title": "K-th Smallest in Lexicographical Order", "question__title_slug": "k-th-smallest-in-lexicographical-order", "question__hide": false, - "total_acs": 51666, - "total_submitted": 121792, + "total_acs": 51994, + "total_submitted": 122672, "total_column_articles": 311, "frontend_question_id": "440", "is_new_question": false @@ -63411,8 +63915,8 @@ "question__title": "Ternary Expression Parser", "question__title_slug": "ternary-expression-parser", "question__hide": false, - "total_acs": 5464, - "total_submitted": 8794, + "total_acs": 5552, + "total_submitted": 8940, "total_column_articles": 115, "frontend_question_id": "439", "is_new_question": false @@ -63432,9 +63936,9 @@ "question__title": "Find All Anagrams in a String", "question__title_slug": "find-all-anagrams-in-a-string", "question__hide": false, - "total_acs": 380702, - "total_submitted": 706314, - "total_column_articles": 2575, + "total_acs": 399771, + "total_submitted": 745105, + "total_column_articles": 2649, "frontend_question_id": "438", "is_new_question": false }, @@ -63453,9 +63957,9 @@ "question__title": "Path Sum III", "question__title_slug": "path-sum-iii", "question__hide": false, - "total_acs": 274872, - "total_submitted": 566607, - "total_column_articles": 1745, + "total_acs": 284081, + "total_submitted": 589461, + "total_column_articles": 1777, "frontend_question_id": "437", "is_new_question": false }, @@ -63474,9 +63978,9 @@ "question__title": "Find Right Interval", "question__title_slug": "find-right-interval", "question__hide": false, - "total_acs": 48146, - "total_submitted": 84494, - "total_column_articles": 597, + "total_acs": 48550, + "total_submitted": 85202, + "total_column_articles": 595, "frontend_question_id": "436", "is_new_question": false }, @@ -63495,9 +63999,9 @@ "question__title": "Non-overlapping Intervals", "question__title_slug": "non-overlapping-intervals", "question__hide": false, - "total_acs": 259608, - "total_submitted": 504548, - "total_column_articles": 1808, + "total_acs": 264792, + "total_submitted": 514016, + "total_column_articles": 1828, "frontend_question_id": "435", "is_new_question": false }, @@ -63516,9 +64020,9 @@ "question__title": "Number of Segments in a String", "question__title_slug": "number-of-segments-in-a-string", "question__hide": false, - "total_acs": 99898, - "total_submitted": 260967, - "total_column_articles": 1224, + "total_acs": 101056, + "total_submitted": 264317, + "total_column_articles": 1230, "frontend_question_id": "434", "is_new_question": false }, @@ -63537,9 +64041,9 @@ "question__title": "Minimum Genetic Mutation", "question__title_slug": "minimum-genetic-mutation", "question__hide": false, - "total_acs": 60929, - "total_submitted": 111583, - "total_column_articles": 809, + "total_acs": 62600, + "total_submitted": 114818, + "total_column_articles": 817, "frontend_question_id": "433", "is_new_question": false }, @@ -63558,8 +64062,8 @@ "question__title": "All O`one Data Structure", "question__title_slug": "all-oone-data-structure", "question__hide": false, - "total_acs": 29965, - "total_submitted": 64370, + "total_acs": 30059, + "total_submitted": 64596, "total_column_articles": 321, "frontend_question_id": "432", "is_new_question": false @@ -63579,8 +64083,8 @@ "question__title": "Word Squares", "question__title_slug": "word-squares", "question__hide": false, - "total_acs": 2622, - "total_submitted": 4187, + "total_acs": 2655, + "total_submitted": 4252, "total_column_articles": 50, "frontend_question_id": "425", "is_new_question": false @@ -63600,9 +64104,9 @@ "question__title": "Longest Repeating Character Replacement", "question__title_slug": "longest-repeating-character-replacement", "question__hide": false, - "total_acs": 95758, - "total_submitted": 174458, - "total_column_articles": 787, + "total_acs": 96687, + "total_submitted": 176041, + "total_column_articles": 788, "frontend_question_id": "424", "is_new_question": false }, @@ -63621,9 +64125,9 @@ "question__title": "Reconstruct Original Digits from English", "question__title_slug": "reconstruct-original-digits-from-english", "question__hide": false, - "total_acs": 41529, - "total_submitted": 68462, - "total_column_articles": 467, + "total_acs": 41716, + "total_submitted": 68793, + "total_column_articles": 465, "frontend_question_id": "423", "is_new_question": false }, @@ -63642,9 +64146,9 @@ "question__title": "Valid Word Square", "question__title_slug": "valid-word-square", "question__hide": false, - "total_acs": 5743, - "total_submitted": 12962, - "total_column_articles": 116, + "total_acs": 5908, + "total_submitted": 13296, + "total_column_articles": 117, "frontend_question_id": "422", "is_new_question": false }, @@ -63663,9 +64167,9 @@ "question__title": "Maximum XOR of Two Numbers in an Array", "question__title_slug": "maximum-xor-of-two-numbers-in-an-array", "question__hide": false, - "total_acs": 62438, - "total_submitted": 104137, - "total_column_articles": 534, + "total_acs": 62829, + "total_submitted": 104879, + "total_column_articles": 537, "frontend_question_id": "421", "is_new_question": false }, @@ -63684,8 +64188,8 @@ "question__title": "Strong Password Checker", "question__title_slug": "strong-password-checker", "question__hide": false, - "total_acs": 18878, - "total_submitted": 48611, + "total_acs": 18916, + "total_submitted": 48804, "total_column_articles": 167, "frontend_question_id": "420", "is_new_question": false @@ -63705,9 +64209,9 @@ "question__title": "Battleships in a Board", "question__title_slug": "battleships-in-a-board", "question__hide": false, - "total_acs": 48157, - "total_submitted": 61867, - "total_column_articles": 587, + "total_acs": 48573, + "total_submitted": 62420, + "total_column_articles": 589, "frontend_question_id": "419", "is_new_question": false }, @@ -63726,8 +64230,8 @@ "question__title": "Sentence Screen Fitting", "question__title_slug": "sentence-screen-fitting", "question__hide": false, - "total_acs": 4236, - "total_submitted": 10764, + "total_acs": 4260, + "total_submitted": 10832, "total_column_articles": 64, "frontend_question_id": "418", "is_new_question": false @@ -63747,9 +64251,9 @@ "question__title": "Pacific Atlantic Water Flow", "question__title_slug": "pacific-atlantic-water-flow", "question__hide": false, - "total_acs": 94431, - "total_submitted": 167562, - "total_column_articles": 916, + "total_acs": 96374, + "total_submitted": 171346, + "total_column_articles": 928, "frontend_question_id": "417", "is_new_question": false }, @@ -63768,9 +64272,9 @@ "question__title": "Partition Equal Subset Sum", "question__title_slug": "partition-equal-subset-sum", "question__hide": false, - "total_acs": 502055, - "total_submitted": 958624, - "total_column_articles": 2323, + "total_acs": 517782, + "total_submitted": 988433, + "total_column_articles": 2361, "frontend_question_id": "416", "is_new_question": false }, @@ -63789,9 +64293,9 @@ "question__title": "Add Strings", "question__title_slug": "add-strings", "question__hide": false, - "total_acs": 317898, - "total_submitted": 582673, - "total_column_articles": 1981, + "total_acs": 322111, + "total_submitted": 590546, + "total_column_articles": 1993, "frontend_question_id": "415", "is_new_question": false }, @@ -63810,9 +64314,9 @@ "question__title": "Third Maximum Number", "question__title_slug": "third-maximum-number", "question__hide": false, - "total_acs": 160335, - "total_submitted": 400146, - "total_column_articles": 1836, + "total_acs": 162597, + "total_submitted": 405110, + "total_column_articles": 1849, "frontend_question_id": "414", "is_new_question": false }, @@ -63831,9 +64335,9 @@ "question__title": "Arithmetic Slices", "question__title_slug": "arithmetic-slices", "question__hide": false, - "total_acs": 125806, - "total_submitted": 181023, - "total_column_articles": 1518, + "total_acs": 126762, + "total_submitted": 182390, + "total_column_articles": 1521, "frontend_question_id": "413", "is_new_question": false }, @@ -63852,9 +64356,9 @@ "question__title": "Fizz Buzz", "question__title_slug": "fizz-buzz", "question__hide": false, - "total_acs": 213218, - "total_submitted": 307630, - "total_column_articles": 1362, + "total_acs": 214768, + "total_submitted": 309630, + "total_column_articles": 1366, "frontend_question_id": "412", "is_new_question": false }, @@ -63873,8 +64377,8 @@ "question__title": "Minimum Unique Word Abbreviation", "question__title_slug": "minimum-unique-word-abbreviation", "question__hide": false, - "total_acs": 1690, - "total_submitted": 3383, + "total_acs": 1694, + "total_submitted": 3413, "total_column_articles": 36, "frontend_question_id": "411", "is_new_question": false @@ -63894,9 +64398,9 @@ "question__title": "Split Array Largest Sum", "question__title_slug": "split-array-largest-sum", "question__hide": false, - "total_acs": 85841, - "total_submitted": 141939, - "total_column_articles": 656, + "total_acs": 87038, + "total_submitted": 143925, + "total_column_articles": 665, "frontend_question_id": "410", "is_new_question": false }, @@ -63915,9 +64419,9 @@ "question__title": "Longest Palindrome", "question__title_slug": "longest-palindrome", "question__hide": false, - "total_acs": 192030, - "total_submitted": 344691, - "total_column_articles": 2193, + "total_acs": 194651, + "total_submitted": 349605, + "total_column_articles": 2215, "frontend_question_id": "409", "is_new_question": false }, @@ -63936,8 +64440,8 @@ "question__title": "Valid Word Abbreviation", "question__title_slug": "valid-word-abbreviation", "question__hide": false, - "total_acs": 7237, - "total_submitted": 20120, + "total_acs": 7383, + "total_submitted": 20449, "total_column_articles": 128, "frontend_question_id": "408", "is_new_question": false @@ -63957,8 +64461,8 @@ "question__title": "Trapping Rain Water II", "question__title_slug": "trapping-rain-water-ii", "question__hide": false, - "total_acs": 37543, - "total_submitted": 65622, + "total_acs": 37824, + "total_submitted": 66170, "total_column_articles": 322, "frontend_question_id": "407", "is_new_question": false @@ -63978,9 +64482,9 @@ "question__title": "Queue Reconstruction by Height", "question__title_slug": "queue-reconstruction-by-height", "question__hide": false, - "total_acs": 280356, - "total_submitted": 366743, - "total_column_articles": 1535, + "total_acs": 284840, + "total_submitted": 372743, + "total_column_articles": 1550, "frontend_question_id": "406", "is_new_question": false }, @@ -63999,9 +64503,9 @@ "question__title": "Convert a Number to Hexadecimal", "question__title_slug": "convert-a-number-to-hexadecimal", "question__hide": false, - "total_acs": 70601, - "total_submitted": 128910, - "total_column_articles": 672, + "total_acs": 71695, + "total_submitted": 131145, + "total_column_articles": 679, "frontend_question_id": "405", "is_new_question": false }, @@ -64020,9 +64524,9 @@ "question__title": "Sum of Left Leaves", "question__title_slug": "sum-of-left-leaves", "question__hide": false, - "total_acs": 285316, - "total_submitted": 455312, - "total_column_articles": 2294, + "total_acs": 292149, + "total_submitted": 465782, + "total_column_articles": 2336, "frontend_question_id": "404", "is_new_question": false }, @@ -64041,9 +64545,9 @@ "question__title": "Frog Jump", "question__title_slug": "frog-jump", "question__hide": false, - "total_acs": 65115, - "total_submitted": 141153, - "total_column_articles": 590, + "total_acs": 65439, + "total_submitted": 141858, + "total_column_articles": 589, "frontend_question_id": "403", "is_new_question": false }, @@ -64062,8 +64566,8 @@ "question__title": "Remove K Digits", "question__title_slug": "remove-k-digits", "question__hide": false, - "total_acs": 149213, - "total_submitted": 468108, + "total_acs": 151133, + "total_submitted": 474207, "total_column_articles": 992, "frontend_question_id": "402", "is_new_question": false @@ -64083,9 +64587,9 @@ "question__title": "Binary Watch", "question__title_slug": "binary-watch", "question__hide": false, - "total_acs": 77046, - "total_submitted": 122690, - "total_column_articles": 927, + "total_acs": 77541, + "total_submitted": 123432, + "total_column_articles": 926, "frontend_question_id": "401", "is_new_question": false }, @@ -64104,9 +64608,9 @@ "question__title": "Nth Digit", "question__title_slug": "nth-digit", "question__hide": false, - "total_acs": 62336, - "total_submitted": 136809, - "total_column_articles": 653, + "total_acs": 62803, + "total_submitted": 137803, + "total_column_articles": 652, "frontend_question_id": "400", "is_new_question": false }, @@ -64125,9 +64629,9 @@ "question__title": "Evaluate Division", "question__title_slug": "evaluate-division", "question__hide": false, - "total_acs": 91502, - "total_submitted": 155659, - "total_column_articles": 998, + "total_acs": 93431, + "total_submitted": 159141, + "total_column_articles": 1015, "frontend_question_id": "399", "is_new_question": false }, @@ -64146,9 +64650,9 @@ "question__title": "Random Pick Index", "question__title_slug": "random-pick-index", "question__hide": false, - "total_acs": 59737, - "total_submitted": 86473, - "total_column_articles": 483, + "total_acs": 59940, + "total_submitted": 86836, + "total_column_articles": 482, "frontend_question_id": "398", "is_new_question": false }, @@ -64167,8 +64671,8 @@ "question__title": "Integer Replacement", "question__title_slug": "integer-replacement", "question__hide": false, - "total_acs": 72135, - "total_submitted": 170394, + "total_acs": 72893, + "total_submitted": 172437, "total_column_articles": 738, "frontend_question_id": "397", "is_new_question": false @@ -64188,9 +64692,9 @@ "question__title": "Rotate Function", "question__title_slug": "rotate-function", "question__hide": false, - "total_acs": 53999, - "total_submitted": 101947, - "total_column_articles": 627, + "total_acs": 54473, + "total_submitted": 103042, + "total_column_articles": 629, "frontend_question_id": "396", "is_new_question": false }, @@ -64209,9 +64713,9 @@ "question__title": "Longest Substring with At Least K Repeating Characters", "question__title_slug": "longest-substring-with-at-least-k-repeating-characters", "question__hide": false, - "total_acs": 91659, - "total_submitted": 174263, - "total_column_articles": 705, + "total_acs": 92759, + "total_submitted": 176410, + "total_column_articles": 707, "frontend_question_id": "395", "is_new_question": false }, @@ -64230,9 +64734,9 @@ "question__title": "Decode String", "question__title_slug": "decode-string", "question__hide": false, - "total_acs": 290944, - "total_submitted": 507757, - "total_column_articles": 2512, + "total_acs": 299875, + "total_submitted": 522665, + "total_column_articles": 2561, "frontend_question_id": "394", "is_new_question": false }, @@ -64251,9 +64755,9 @@ "question__title": "UTF-8 Validation", "question__title_slug": "utf-8-validation", "question__hide": false, - "total_acs": 40695, - "total_submitted": 93121, - "total_column_articles": 506, + "total_acs": 40848, + "total_submitted": 93548, + "total_column_articles": 503, "frontend_question_id": "393", "is_new_question": false }, @@ -64272,9 +64776,9 @@ "question__title": "Is Subsequence", "question__title_slug": "is-subsequence", "question__hide": false, - "total_acs": 391448, - "total_submitted": 747364, - "total_column_articles": 3176, + "total_acs": 406191, + "total_submitted": 775282, + "total_column_articles": 3240, "frontend_question_id": "392", "is_new_question": false }, @@ -64293,9 +64797,9 @@ "question__title": "Perfect Rectangle", "question__title_slug": "perfect-rectangle", "question__hide": false, - "total_acs": 28417, - "total_submitted": 61736, - "total_column_articles": 334, + "total_acs": 28531, + "total_submitted": 62035, + "total_column_articles": 337, "frontend_question_id": "391", "is_new_question": false }, @@ -64314,8 +64818,8 @@ "question__title": "Elimination Game", "question__title_slug": "elimination-game", "question__hide": false, - "total_acs": 39060, - "total_submitted": 65648, + "total_acs": 39260, + "total_submitted": 66142, "total_column_articles": 484, "frontend_question_id": "390", "is_new_question": false @@ -64335,9 +64839,9 @@ "question__title": "Find the Difference", "question__title_slug": "find-the-difference", "question__hide": false, - "total_acs": 195919, - "total_submitted": 301855, - "total_column_articles": 1867, + "total_acs": 201060, + "total_submitted": 311167, + "total_column_articles": 1899, "frontend_question_id": "389", "is_new_question": false }, @@ -64356,9 +64860,9 @@ "question__title": "Longest Absolute File Path", "question__title_slug": "longest-absolute-file-path", "question__hide": false, - "total_acs": 36162, - "total_submitted": 56616, - "total_column_articles": 539, + "total_acs": 36322, + "total_submitted": 56893, + "total_column_articles": 536, "frontend_question_id": "388", "is_new_question": false }, @@ -64377,9 +64881,9 @@ "question__title": "First Unique Character in a String", "question__title_slug": "first-unique-character-in-a-string", "question__hide": false, - "total_acs": 412042, - "total_submitted": 732511, - "total_column_articles": 2285, + "total_acs": 415622, + "total_submitted": 738049, + "total_column_articles": 2298, "frontend_question_id": "387", "is_new_question": false }, @@ -64398,9 +64902,9 @@ "question__title": "Lexicographical Numbers", "question__title_slug": "lexicographical-numbers", "question__hide": false, - "total_acs": 74754, - "total_submitted": 100144, - "total_column_articles": 687, + "total_acs": 75295, + "total_submitted": 100885, + "total_column_articles": 685, "frontend_question_id": "386", "is_new_question": false }, @@ -64419,8 +64923,8 @@ "question__title": "Mini Parser", "question__title_slug": "mini-parser", "question__hide": false, - "total_acs": 33070, - "total_submitted": 60229, + "total_acs": 33166, + "total_submitted": 60433, "total_column_articles": 314, "frontend_question_id": "385", "is_new_question": false @@ -64440,8 +64944,8 @@ "question__title": "Shuffle an Array", "question__title_slug": "shuffle-an-array", "question__hide": false, - "total_acs": 130201, - "total_submitted": 210757, + "total_acs": 130811, + "total_submitted": 211737, "total_column_articles": 620, "frontend_question_id": "384", "is_new_question": false @@ -64461,9 +64965,9 @@ "question__title": "Ransom Note", "question__title_slug": "ransom-note", "question__hide": false, - "total_acs": 447173, - "total_submitted": 705577, - "total_column_articles": 3467, + "total_acs": 462592, + "total_submitted": 725847, + "total_column_articles": 3550, "frontend_question_id": "383", "is_new_question": false }, @@ -64482,9 +64986,9 @@ "question__title": "Linked List Random Node", "question__title_slug": "linked-list-random-node", "question__hide": false, - "total_acs": 66003, - "total_submitted": 90776, - "total_column_articles": 468, + "total_acs": 66365, + "total_submitted": 91277, + "total_column_articles": 470, "frontend_question_id": "382", "is_new_question": false }, @@ -64503,9 +65007,9 @@ "question__title": "Insert Delete GetRandom O(1) - Duplicates allowed", "question__title_slug": "insert-delete-getrandom-o1-duplicates-allowed", "question__hide": false, - "total_acs": 28023, - "total_submitted": 66686, - "total_column_articles": 247, + "total_acs": 28228, + "total_submitted": 67272, + "total_column_articles": 248, "frontend_question_id": "381", "is_new_question": false }, @@ -64524,9 +65028,9 @@ "question__title": "Insert Delete GetRandom O(1)", "question__title_slug": "insert-delete-getrandom-o1", "question__hide": false, - "total_acs": 145307, - "total_submitted": 277414, - "total_column_articles": 1849, + "total_acs": 151881, + "total_submitted": 290513, + "total_column_articles": 1871, "frontend_question_id": "380", "is_new_question": false }, @@ -64545,8 +65049,8 @@ "question__title": "Design Phone Directory", "question__title_slug": "design-phone-directory", "question__hide": false, - "total_acs": 6042, - "total_submitted": 9859, + "total_acs": 6075, + "total_submitted": 9915, "total_column_articles": 122, "frontend_question_id": "379", "is_new_question": false @@ -64566,9 +65070,9 @@ "question__title": "Kth Smallest Element in a Sorted Matrix", "question__title_slug": "kth-smallest-element-in-a-sorted-matrix", "question__hide": false, - "total_acs": 130924, - "total_submitted": 205569, - "total_column_articles": 875, + "total_acs": 132277, + "total_submitted": 207682, + "total_column_articles": 877, "frontend_question_id": "378", "is_new_question": false }, @@ -64587,9 +65091,9 @@ "question__title": "Combination Sum IV", "question__title_slug": "combination-sum-iv", "question__hide": false, - "total_acs": 174365, - "total_submitted": 330728, - "total_column_articles": 1063, + "total_acs": 179690, + "total_submitted": 341567, + "total_column_articles": 1082, "frontend_question_id": "377", "is_new_question": false }, @@ -64608,9 +65112,9 @@ "question__title": "Wiggle Subsequence", "question__title_slug": "wiggle-subsequence", "question__hide": false, - "total_acs": 219882, - "total_submitted": 471896, - "total_column_articles": 1742, + "total_acs": 226173, + "total_submitted": 487098, + "total_column_articles": 1773, "frontend_question_id": "376", "is_new_question": false }, @@ -64629,9 +65133,9 @@ "question__title": "Guess Number Higher or Lower II", "question__title_slug": "guess-number-higher-or-lower-ii", "question__hide": false, - "total_acs": 49398, - "total_submitted": 78483, - "total_column_articles": 370, + "total_acs": 49863, + "total_submitted": 79245, + "total_column_articles": 371, "frontend_question_id": "375", "is_new_question": false }, @@ -64650,9 +65154,9 @@ "question__title": "Guess Number Higher or Lower", "question__title_slug": "guess-number-higher-or-lower", "question__hide": false, - "total_acs": 181392, - "total_submitted": 346599, - "total_column_articles": 1107, + "total_acs": 183698, + "total_submitted": 350938, + "total_column_articles": 1117, "frontend_question_id": "374", "is_new_question": false }, @@ -64671,9 +65175,9 @@ "question__title": "Find K Pairs with Smallest Sums", "question__title_slug": "find-k-pairs-with-smallest-sums", "question__hide": false, - "total_acs": 69330, - "total_submitted": 169766, - "total_column_articles": 586, + "total_acs": 71185, + "total_submitted": 174383, + "total_column_articles": 588, "frontend_question_id": "373", "is_new_question": false }, @@ -64692,8 +65196,8 @@ "question__title": "Super Pow", "question__title_slug": "super-pow", "question__hide": false, - "total_acs": 48778, - "total_submitted": 85761, + "total_acs": 49073, + "total_submitted": 86314, "total_column_articles": 524, "frontend_question_id": "372", "is_new_question": false @@ -64713,9 +65217,9 @@ "question__title": "Sum of Two Integers", "question__title_slug": "sum-of-two-integers", "question__hide": false, - "total_acs": 119875, - "total_submitted": 192004, - "total_column_articles": 732, + "total_acs": 121106, + "total_submitted": 193787, + "total_column_articles": 735, "frontend_question_id": "371", "is_new_question": false }, @@ -64734,9 +65238,9 @@ "question__title": "Range Addition", "question__title_slug": "range-addition", "question__hide": false, - "total_acs": 13763, - "total_submitted": 17838, - "total_column_articles": 290, + "total_acs": 13935, + "total_submitted": 18048, + "total_column_articles": 291, "frontend_question_id": "370", "is_new_question": false }, @@ -64755,9 +65259,9 @@ "question__title": "Plus One Linked List", "question__title_slug": "plus-one-linked-list", "question__hide": false, - "total_acs": 9764, - "total_submitted": 15750, - "total_column_articles": 250, + "total_acs": 9880, + "total_submitted": 15946, + "total_column_articles": 252, "frontend_question_id": "369", "is_new_question": false }, @@ -64776,8 +65280,8 @@ "question__title": "Largest Divisible Subset", "question__title_slug": "largest-divisible-subset", "question__hide": false, - "total_acs": 60314, - "total_submitted": 131172, + "total_acs": 60782, + "total_submitted": 132325, "total_column_articles": 612, "frontend_question_id": "368", "is_new_question": false @@ -64797,9 +65301,9 @@ "question__title": "Valid Perfect Square", "question__title_slug": "valid-perfect-square", "question__hide": false, - "total_acs": 260276, - "total_submitted": 579763, - "total_column_articles": 1833, + "total_acs": 265314, + "total_submitted": 590904, + "total_column_articles": 1857, "frontend_question_id": "367", "is_new_question": false }, @@ -64818,9 +65322,9 @@ "question__title": "Find Leaves of Binary Tree", "question__title_slug": "find-leaves-of-binary-tree", "question__hide": false, - "total_acs": 10594, - "total_submitted": 13166, - "total_column_articles": 239, + "total_acs": 10705, + "total_submitted": 13306, + "total_column_articles": 241, "frontend_question_id": "366", "is_new_question": false }, @@ -64839,8 +65343,8 @@ "question__title": "Water and Jug Problem", "question__title_slug": "water-and-jug-problem", "question__hide": false, - "total_acs": 63370, - "total_submitted": 146733, + "total_acs": 63915, + "total_submitted": 147844, "total_column_articles": 714, "frontend_question_id": "365", "is_new_question": false @@ -64860,8 +65364,8 @@ "question__title": "Nested List Weight Sum II", "question__title_slug": "nested-list-weight-sum-ii", "question__hide": false, - "total_acs": 3520, - "total_submitted": 5413, + "total_acs": 3536, + "total_submitted": 5467, "total_column_articles": 81, "frontend_question_id": "364", "is_new_question": false @@ -64881,9 +65385,9 @@ "question__title": "Max Sum of Rectangle No Larger Than K", "question__title_slug": "max-sum-of-rectangle-no-larger-than-k", "question__hide": false, - "total_acs": 43307, - "total_submitted": 89810, - "total_column_articles": 274, + "total_acs": 43512, + "total_submitted": 90271, + "total_column_articles": 275, "frontend_question_id": "363", "is_new_question": false }, @@ -64902,8 +65406,8 @@ "question__title": "Design Hit Counter", "question__title_slug": "design-hit-counter", "question__hide": false, - "total_acs": 7424, - "total_submitted": 10745, + "total_acs": 7513, + "total_submitted": 10857, "total_column_articles": 131, "frontend_question_id": "362", "is_new_question": false @@ -64923,8 +65427,8 @@ "question__title": "Bomb Enemy", "question__title_slug": "bomb-enemy", "question__hide": false, - "total_acs": 6304, - "total_submitted": 10543, + "total_acs": 6341, + "total_submitted": 10608, "total_column_articles": 109, "frontend_question_id": "361", "is_new_question": false @@ -64944,8 +65448,8 @@ "question__title": "Sort Transformed Array", "question__title_slug": "sort-transformed-array", "question__hide": false, - "total_acs": 5600, - "total_submitted": 8987, + "total_acs": 5656, + "total_submitted": 9069, "total_column_articles": 93, "frontend_question_id": "360", "is_new_question": false @@ -64965,8 +65469,8 @@ "question__title": "Logger Rate Limiter", "question__title_slug": "logger-rate-limiter", "question__hide": false, - "total_acs": 9272, - "total_submitted": 12335, + "total_acs": 9365, + "total_submitted": 12469, "total_column_articles": 110, "frontend_question_id": "359", "is_new_question": false @@ -64986,8 +65490,8 @@ "question__title": "Rearrange String k Distance Apart", "question__title_slug": "rearrange-string-k-distance-apart", "question__hide": false, - "total_acs": 7495, - "total_submitted": 20015, + "total_acs": 7527, + "total_submitted": 20091, "total_column_articles": 97, "frontend_question_id": "358", "is_new_question": false @@ -65007,9 +65511,9 @@ "question__title": "Count Numbers with Unique Digits", "question__title_slug": "count-numbers-with-unique-digits", "question__hide": false, - "total_acs": 72074, - "total_submitted": 118816, - "total_column_articles": 956, + "total_acs": 72499, + "total_submitted": 119511, + "total_column_articles": 958, "frontend_question_id": "357", "is_new_question": false }, @@ -65028,8 +65532,8 @@ "question__title": "Line Reflection", "question__title_slug": "line-reflection", "question__hide": false, - "total_acs": 2866, - "total_submitted": 7756, + "total_acs": 2892, + "total_submitted": 7844, "total_column_articles": 65, "frontend_question_id": "356", "is_new_question": false @@ -65049,9 +65553,9 @@ "question__title": "Design Twitter", "question__title_slug": "design-twitter", "question__hide": false, - "total_acs": 46173, - "total_submitted": 112135, - "total_column_articles": 744, + "total_acs": 46478, + "total_submitted": 112862, + "total_column_articles": 741, "frontend_question_id": "355", "is_new_question": false }, @@ -65070,8 +65574,8 @@ "question__title": "Russian Doll Envelopes", "question__title_slug": "russian-doll-envelopes", "question__hide": false, - "total_acs": 111832, - "total_submitted": 308200, + "total_acs": 112884, + "total_submitted": 312561, "total_column_articles": 867, "frontend_question_id": "354", "is_new_question": false @@ -65091,9 +65595,9 @@ "question__title": "Design Snake Game", "question__title_slug": "design-snake-game", "question__hide": false, - "total_acs": 4960, - "total_submitted": 11447, - "total_column_articles": 90, + "total_acs": 5001, + "total_submitted": 11592, + "total_column_articles": 91, "frontend_question_id": "353", "is_new_question": false }, @@ -65112,9 +65616,9 @@ "question__title": "Data Stream as Disjoint Intervals", "question__title_slug": "data-stream-as-disjoint-intervals", "question__hide": false, - "total_acs": 26341, - "total_submitted": 39371, - "total_column_articles": 428, + "total_acs": 26412, + "total_submitted": 39505, + "total_column_articles": 426, "frontend_question_id": "352", "is_new_question": false }, @@ -65133,8 +65637,8 @@ "question__title": "Android Unlock Patterns", "question__title_slug": "android-unlock-patterns", "question__hide": false, - "total_acs": 7801, - "total_submitted": 12647, + "total_acs": 7844, + "total_submitted": 12722, "total_column_articles": 138, "frontend_question_id": "351", "is_new_question": false @@ -65154,9 +65658,9 @@ "question__title": "Intersection of Two Arrays II", "question__title_slug": "intersection-of-two-arrays-ii", "question__hide": false, - "total_acs": 507334, - "total_submitted": 883697, - "total_column_articles": 2983, + "total_acs": 511308, + "total_submitted": 889474, + "total_column_articles": 3003, "frontend_question_id": "350", "is_new_question": false }, @@ -65175,9 +65679,9 @@ "question__title": "Intersection of Two Arrays", "question__title_slug": "intersection-of-two-arrays", "question__hide": false, - "total_acs": 531690, - "total_submitted": 714867, - "total_column_articles": 3328, + "total_acs": 544711, + "total_submitted": 731783, + "total_column_articles": 3387, "frontend_question_id": "349", "is_new_question": false }, @@ -65196,8 +65700,8 @@ "question__title": "Design Tic-Tac-Toe", "question__title_slug": "design-tic-tac-toe", "question__hide": false, - "total_acs": 10225, - "total_submitted": 17199, + "total_acs": 10296, + "total_submitted": 17312, "total_column_articles": 143, "frontend_question_id": "348", "is_new_question": false @@ -65217,9 +65721,9 @@ "question__title": "Top K Frequent Elements", "question__title_slug": "top-k-frequent-elements", "question__hide": false, - "total_acs": 511541, - "total_submitted": 804587, - "total_column_articles": 3275, + "total_acs": 525504, + "total_submitted": 826257, + "total_column_articles": 3327, "frontend_question_id": "347", "is_new_question": false }, @@ -65238,9 +65742,9 @@ "question__title": "Moving Average from Data Stream", "question__title_slug": "moving-average-from-data-stream", "question__hide": false, - "total_acs": 21934, - "total_submitted": 30045, - "total_column_articles": 219, + "total_acs": 22170, + "total_submitted": 30340, + "total_column_articles": 220, "frontend_question_id": "346", "is_new_question": false }, @@ -65259,9 +65763,9 @@ "question__title": "Reverse Vowels of a String", "question__title_slug": "reverse-vowels-of-a-string", "question__hide": false, - "total_acs": 191655, - "total_submitted": 350017, - "total_column_articles": 1610, + "total_acs": 194490, + "total_submitted": 355071, + "total_column_articles": 1627, "frontend_question_id": "345", "is_new_question": false }, @@ -65280,9 +65784,9 @@ "question__title": "Reverse String", "question__title_slug": "reverse-string", "question__hide": false, - "total_acs": 870827, - "total_submitted": 1087315, - "total_column_articles": 4060, + "total_acs": 885196, + "total_submitted": 1104285, + "total_column_articles": 4100, "frontend_question_id": "344", "is_new_question": false }, @@ -65301,9 +65805,9 @@ "question__title": "Integer Break", "question__title_slug": "integer-break", "question__hide": false, - "total_acs": 308979, - "total_submitted": 490875, - "total_column_articles": 2099, + "total_acs": 317354, + "total_submitted": 503007, + "total_column_articles": 2133, "frontend_question_id": "343", "is_new_question": false }, @@ -65322,9 +65826,9 @@ "question__title": "Power of Four", "question__title_slug": "power-of-four", "question__hide": false, - "total_acs": 145094, - "total_submitted": 272734, - "total_column_articles": 1182, + "total_acs": 146986, + "total_submitted": 276046, + "total_column_articles": 1186, "frontend_question_id": "342", "is_new_question": false }, @@ -65343,9 +65847,9 @@ "question__title": "Flatten Nested List Iterator", "question__title_slug": "flatten-nested-list-iterator", "question__hide": false, - "total_acs": 78926, - "total_submitted": 108441, - "total_column_articles": 682, + "total_acs": 79286, + "total_submitted": 108950, + "total_column_articles": 681, "frontend_question_id": "341", "is_new_question": false }, @@ -65364,9 +65868,9 @@ "question__title": "Longest Substring with At Most K Distinct Characters", "question__title_slug": "longest-substring-with-at-most-k-distinct-characters", "question__hide": false, - "total_acs": 28433, - "total_submitted": 55511, - "total_column_articles": 321, + "total_acs": 28744, + "total_submitted": 56104, + "total_column_articles": 323, "frontend_question_id": "340", "is_new_question": false }, @@ -65385,9 +65889,9 @@ "question__title": "Nested List Weight Sum", "question__title_slug": "nested-list-weight-sum", "question__hide": false, - "total_acs": 6778, - "total_submitted": 8083, - "total_column_articles": 86, + "total_acs": 6875, + "total_submitted": 8217, + "total_column_articles": 87, "frontend_question_id": "339", "is_new_question": false }, @@ -65406,9 +65910,9 @@ "question__title": "Counting Bits", "question__title_slug": "counting-bits", "question__hide": false, - "total_acs": 325441, - "total_submitted": 413528, - "total_column_articles": 2367, + "total_acs": 329338, + "total_submitted": 418483, + "total_column_articles": 2390, "frontend_question_id": "338", "is_new_question": false }, @@ -65427,9 +65931,9 @@ "question__title": "House Robber III", "question__title_slug": "house-robber-iii", "question__hide": false, - "total_acs": 333342, - "total_submitted": 541566, - "total_column_articles": 1989, + "total_acs": 338861, + "total_submitted": 550546, + "total_column_articles": 2004, "frontend_question_id": "337", "is_new_question": false }, @@ -65448,8 +65952,8 @@ "question__title": "Palindrome Pairs", "question__title_slug": "palindrome-pairs", "question__hide": false, - "total_acs": 28700, - "total_submitted": 75492, + "total_acs": 28829, + "total_submitted": 75848, "total_column_articles": 256, "frontend_question_id": "336", "is_new_question": false @@ -65469,8 +65973,8 @@ "question__title": "Self Crossing", "question__title_slug": "self-crossing", "question__hide": false, - "total_acs": 19308, - "total_submitted": 45423, + "total_acs": 19379, + "total_submitted": 45580, "total_column_articles": 172, "frontend_question_id": "335", "is_new_question": false @@ -65490,9 +65994,9 @@ "question__title": "Increasing Triplet Subsequence", "question__title_slug": "increasing-triplet-subsequence", "question__hide": false, - "total_acs": 145432, - "total_submitted": 339493, - "total_column_articles": 911, + "total_acs": 147282, + "total_submitted": 344096, + "total_column_articles": 919, "frontend_question_id": "334", "is_new_question": false }, @@ -65511,8 +66015,8 @@ "question__title": "Largest BST Subtree", "question__title_slug": "largest-bst-subtree", "question__hide": false, - "total_acs": 10210, - "total_submitted": 20793, + "total_acs": 10346, + "total_submitted": 21018, "total_column_articles": 168, "frontend_question_id": "333", "is_new_question": false @@ -65532,9 +66036,9 @@ "question__title": "Reconstruct Itinerary", "question__title_slug": "reconstruct-itinerary", "question__hide": false, - "total_acs": 101331, - "total_submitted": 218920, - "total_column_articles": 673, + "total_acs": 103003, + "total_submitted": 224716, + "total_column_articles": 680, "frontend_question_id": "332", "is_new_question": false }, @@ -65553,9 +66057,9 @@ "question__title": "Verify Preorder Serialization of a Binary Tree", "question__title_slug": "verify-preorder-serialization-of-a-binary-tree", "question__hide": false, - "total_acs": 63456, - "total_submitted": 131238, - "total_column_articles": 671, + "total_acs": 63798, + "total_submitted": 131833, + "total_column_articles": 672, "frontend_question_id": "331", "is_new_question": false }, @@ -65574,9 +66078,9 @@ "question__title": "Patching Array", "question__title_slug": "patching-array", "question__hide": false, - "total_acs": 24804, - "total_submitted": 46816, - "total_column_articles": 206, + "total_acs": 24952, + "total_submitted": 47092, + "total_column_articles": 208, "frontend_question_id": "330", "is_new_question": false }, @@ -65595,9 +66099,9 @@ "question__title": "Longest Increasing Path in a Matrix", "question__title_slug": "longest-increasing-path-in-a-matrix", "question__hide": false, - "total_acs": 105339, - "total_submitted": 202510, - "total_column_articles": 888, + "total_acs": 106201, + "total_submitted": 204125, + "total_column_articles": 889, "frontend_question_id": "329", "is_new_question": false }, @@ -65616,9 +66120,9 @@ "question__title": "Odd Even Linked List", "question__title_slug": "odd-even-linked-list", "question__hide": false, - "total_acs": 231742, - "total_submitted": 358577, - "total_column_articles": 1722, + "total_acs": 234539, + "total_submitted": 363050, + "total_column_articles": 1729, "frontend_question_id": "328", "is_new_question": false }, @@ -65637,9 +66141,9 @@ "question__title": "Count of Range Sum", "question__title_slug": "count-of-range-sum", "question__hide": false, - "total_acs": 45085, - "total_submitted": 111493, - "total_column_articles": 374, + "total_acs": 45472, + "total_submitted": 112310, + "total_column_articles": 377, "frontend_question_id": "327", "is_new_question": false }, @@ -65658,9 +66162,9 @@ "question__title": "Power of Three", "question__title_slug": "power-of-three", "question__hide": false, - "total_acs": 230777, - "total_submitted": 450213, - "total_column_articles": 1006, + "total_acs": 233638, + "total_submitted": 455435, + "total_column_articles": 1013, "frontend_question_id": "326", "is_new_question": false }, @@ -65679,8 +66183,8 @@ "question__title": "Maximum Size Subarray Sum Equals k", "question__title_slug": "maximum-size-subarray-sum-equals-k", "question__hide": false, - "total_acs": 18116, - "total_submitted": 35089, + "total_acs": 18230, + "total_submitted": 35337, "total_column_articles": 198, "frontend_question_id": "325", "is_new_question": false @@ -65700,9 +66204,9 @@ "question__title": "Wiggle Sort II", "question__title_slug": "wiggle-sort-ii", "question__hide": false, - "total_acs": 66300, - "total_submitted": 162157, - "total_column_articles": 419, + "total_acs": 66798, + "total_submitted": 163382, + "total_column_articles": 417, "frontend_question_id": "324", "is_new_question": false }, @@ -65721,9 +66225,9 @@ "question__title": "Number of Connected Components in an Undirected Graph", "question__title_slug": "number-of-connected-components-in-an-undirected-graph", "question__hide": false, - "total_acs": 26441, - "total_submitted": 40422, - "total_column_articles": 366, + "total_acs": 26735, + "total_submitted": 40885, + "total_column_articles": 367, "frontend_question_id": "323", "is_new_question": false }, @@ -65742,9 +66246,9 @@ "question__title": "Coin Change", "question__title_slug": "coin-change", "question__hide": false, - "total_acs": 746776, - "total_submitted": 1573847, - "total_column_articles": 3878, + "total_acs": 767626, + "total_submitted": 1611091, + "total_column_articles": 3926, "frontend_question_id": "322", "is_new_question": false }, @@ -65763,9 +66267,9 @@ "question__title": "Create Maximum Number", "question__title_slug": "create-maximum-number", "question__hide": false, - "total_acs": 38415, - "total_submitted": 91206, - "total_column_articles": 314, + "total_acs": 38791, + "total_submitted": 92136, + "total_column_articles": 315, "frontend_question_id": "321", "is_new_question": false }, @@ -65784,8 +66288,8 @@ "question__title": "Generalized Abbreviation", "question__title_slug": "generalized-abbreviation", "question__hide": false, - "total_acs": 5038, - "total_submitted": 7185, + "total_acs": 5093, + "total_submitted": 7275, "total_column_articles": 84, "frontend_question_id": "320", "is_new_question": false @@ -65805,9 +66309,9 @@ "question__title": "Bulb Switcher", "question__title_slug": "bulb-switcher", "question__hide": false, - "total_acs": 65042, - "total_submitted": 112550, - "total_column_articles": 555, + "total_acs": 65439, + "total_submitted": 113252, + "total_column_articles": 557, "frontend_question_id": "319", "is_new_question": false }, @@ -65826,9 +66330,9 @@ "question__title": "Maximum Product of Word Lengths", "question__title_slug": "maximum-product-of-word-lengths", "question__hide": false, - "total_acs": 93908, - "total_submitted": 130493, - "total_column_articles": 778, + "total_acs": 94371, + "total_submitted": 131226, + "total_column_articles": 776, "frontend_question_id": "318", "is_new_question": false }, @@ -65847,9 +66351,9 @@ "question__title": "Shortest Distance from All Buildings", "question__title_slug": "shortest-distance-from-all-buildings", "question__hide": false, - "total_acs": 8052, - "total_submitted": 16960, - "total_column_articles": 99, + "total_acs": 8154, + "total_submitted": 17171, + "total_column_articles": 100, "frontend_question_id": "317", "is_new_question": false }, @@ -65868,9 +66372,9 @@ "question__title": "Remove Duplicate Letters", "question__title_slug": "remove-duplicate-letters", "question__hide": false, - "total_acs": 131035, - "total_submitted": 268517, - "total_column_articles": 948, + "total_acs": 132659, + "total_submitted": 271571, + "total_column_articles": 954, "frontend_question_id": "316", "is_new_question": false }, @@ -65889,9 +66393,9 @@ "question__title": "Count of Smaller Numbers After Self", "question__title_slug": "count-of-smaller-numbers-after-self", "question__hide": false, - "total_acs": 89864, - "total_submitted": 206188, - "total_column_articles": 853, + "total_acs": 90970, + "total_submitted": 208462, + "total_column_articles": 857, "frontend_question_id": "315", "is_new_question": false }, @@ -65910,9 +66414,9 @@ "question__title": "Binary Tree Vertical Order Traversal", "question__title_slug": "binary-tree-vertical-order-traversal", "question__hide": false, - "total_acs": 12185, - "total_submitted": 21635, - "total_column_articles": 192, + "total_acs": 12358, + "total_submitted": 21974, + "total_column_articles": 194, "frontend_question_id": "314", "is_new_question": false }, @@ -65931,9 +66435,9 @@ "question__title": "Super Ugly Number", "question__title_slug": "super-ugly-number", "question__hide": false, - "total_acs": 63017, - "total_submitted": 113054, - "total_column_articles": 527, + "total_acs": 63544, + "total_submitted": 114224, + "total_column_articles": 526, "frontend_question_id": "313", "is_new_question": false }, @@ -65952,9 +66456,9 @@ "question__title": "Burst Balloons", "question__title_slug": "burst-balloons", "question__hide": false, - "total_acs": 114335, - "total_submitted": 163354, - "total_column_articles": 700, + "total_acs": 115264, + "total_submitted": 164707, + "total_column_articles": 699, "frontend_question_id": "312", "is_new_question": false }, @@ -65973,8 +66477,8 @@ "question__title": "Sparse Matrix Multiplication", "question__title_slug": "sparse-matrix-multiplication", "question__hide": false, - "total_acs": 8615, - "total_submitted": 11406, + "total_acs": 8771, + "total_submitted": 11598, "total_column_articles": 96, "frontend_question_id": "311", "is_new_question": false @@ -65994,9 +66498,9 @@ "question__title": "Minimum Height Trees", "question__title_slug": "minimum-height-trees", "question__hide": false, - "total_acs": 65913, - "total_submitted": 155116, - "total_column_articles": 515, + "total_acs": 78072, + "total_submitted": 178402, + "total_column_articles": 586, "frontend_question_id": "310", "is_new_question": false }, @@ -66015,9 +66519,9 @@ "question__title": "Best Time to Buy and Sell Stock with Cooldown", "question__title_slug": "best-time-to-buy-and-sell-stock-with-cooldown", "question__hide": false, - "total_acs": 307393, - "total_submitted": 474714, - "total_column_articles": 2142, + "total_acs": 312781, + "total_submitted": 483122, + "total_column_articles": 2163, "frontend_question_id": "309", "is_new_question": false }, @@ -66036,9 +66540,9 @@ "question__title": "Range Sum Query 2D - Mutable", "question__title_slug": "range-sum-query-2d-mutable", "question__hide": false, - "total_acs": 4467, - "total_submitted": 6986, - "total_column_articles": 87, + "total_acs": 4522, + "total_submitted": 7075, + "total_column_articles": 88, "frontend_question_id": "308", "is_new_question": false }, @@ -66057,9 +66561,9 @@ "question__title": "Range Sum Query - Mutable", "question__title_slug": "range-sum-query-mutable", "question__hide": false, - "total_acs": 86663, - "total_submitted": 162311, - "total_column_articles": 681, + "total_acs": 87838, + "total_submitted": 164274, + "total_column_articles": 683, "frontend_question_id": "307", "is_new_question": false }, @@ -66078,9 +66582,9 @@ "question__title": "Additive Number", "question__title_slug": "additive-number", "question__hide": false, - "total_acs": 52479, - "total_submitted": 139152, - "total_column_articles": 725, + "total_acs": 52864, + "total_submitted": 140405, + "total_column_articles": 726, "frontend_question_id": "306", "is_new_question": false }, @@ -66099,8 +66603,8 @@ "question__title": "Number of Islands II", "question__title_slug": "number-of-islands-ii", "question__hide": false, - "total_acs": 10590, - "total_submitted": 25128, + "total_acs": 10670, + "total_submitted": 25372, "total_column_articles": 136, "frontend_question_id": "305", "is_new_question": false @@ -66120,9 +66624,9 @@ "question__title": "Range Sum Query 2D - Immutable", "question__title_slug": "range-sum-query-2d-immutable", "question__hide": false, - "total_acs": 138922, - "total_submitted": 223259, - "total_column_articles": 1416, + "total_acs": 140835, + "total_submitted": 226151, + "total_column_articles": 1426, "frontend_question_id": "304", "is_new_question": false }, @@ -66141,9 +66645,9 @@ "question__title": "Range Sum Query - Immutable", "question__title_slug": "range-sum-query-immutable", "question__hide": false, - "total_acs": 240331, - "total_submitted": 310836, - "total_column_articles": 2283, + "total_acs": 264488, + "total_submitted": 337852, + "total_column_articles": 2374, "frontend_question_id": "303", "is_new_question": false }, @@ -66162,8 +66666,8 @@ "question__title": "Smallest Rectangle Enclosing Black Pixels", "question__title_slug": "smallest-rectangle-enclosing-black-pixels", "question__hide": false, - "total_acs": 4162, - "total_submitted": 6161, + "total_acs": 4187, + "total_submitted": 6203, "total_column_articles": 67, "frontend_question_id": "302", "is_new_question": false @@ -66183,9 +66687,9 @@ "question__title": "Remove Invalid Parentheses", "question__title_slug": "remove-invalid-parentheses", "question__hide": false, - "total_acs": 105467, - "total_submitted": 190503, - "total_column_articles": 619, + "total_acs": 106265, + "total_submitted": 192045, + "total_column_articles": 618, "frontend_question_id": "301", "is_new_question": false }, @@ -66204,9 +66708,9 @@ "question__title": "Longest Increasing Subsequence", "question__title_slug": "longest-increasing-subsequence", "question__hide": false, - "total_acs": 871910, - "total_submitted": 1571354, - "total_column_articles": 4685, + "total_acs": 894949, + "total_submitted": 1610624, + "total_column_articles": 4753, "frontend_question_id": "300", "is_new_question": false }, @@ -66225,9 +66729,9 @@ "question__title": "Bulls and Cows", "question__title_slug": "bulls-and-cows", "question__hide": false, - "total_acs": 87651, - "total_submitted": 152033, - "total_column_articles": 920, + "total_acs": 105208, + "total_submitted": 176680, + "total_column_articles": 1035, "frontend_question_id": "299", "is_new_question": false }, @@ -66246,9 +66750,9 @@ "question__title": "Binary Tree Longest Consecutive Sequence", "question__title_slug": "binary-tree-longest-consecutive-sequence", "question__hide": false, - "total_acs": 11622, - "total_submitted": 19420, - "total_column_articles": 157, + "total_acs": 11818, + "total_submitted": 19761, + "total_column_articles": 158, "frontend_question_id": "298", "is_new_question": false }, @@ -66267,9 +66771,9 @@ "question__title": "Serialize and Deserialize Binary Tree", "question__title_slug": "serialize-and-deserialize-binary-tree", "question__hide": false, - "total_acs": 233893, - "total_submitted": 395398, - "total_column_articles": 1431, + "total_acs": 235821, + "total_submitted": 398688, + "total_column_articles": 1436, "frontend_question_id": "297", "is_new_question": false }, @@ -66288,8 +66792,8 @@ "question__title": "Best Meeting Point", "question__title_slug": "best-meeting-point", "question__hide": false, - "total_acs": 4719, - "total_submitted": 7707, + "total_acs": 4759, + "total_submitted": 7770, "total_column_articles": 69, "frontend_question_id": "296", "is_new_question": false @@ -66309,9 +66813,9 @@ "question__title": "Find Median from Data Stream", "question__title_slug": "find-median-from-data-stream", "question__hide": false, - "total_acs": 131071, - "total_submitted": 242296, - "total_column_articles": 888, + "total_acs": 135366, + "total_submitted": 249829, + "total_column_articles": 905, "frontend_question_id": "295", "is_new_question": false }, @@ -66330,8 +66834,8 @@ "question__title": "Flip Game II", "question__title_slug": "flip-game-ii", "question__hide": false, - "total_acs": 6983, - "total_submitted": 11823, + "total_acs": 7067, + "total_submitted": 11942, "total_column_articles": 87, "frontend_question_id": "294", "is_new_question": false @@ -66351,9 +66855,9 @@ "question__title": "Flip Game", "question__title_slug": "flip-game", "question__hide": false, - "total_acs": 8526, - "total_submitted": 11707, - "total_column_articles": 129, + "total_acs": 8612, + "total_submitted": 11821, + "total_column_articles": 130, "frontend_question_id": "293", "is_new_question": false }, @@ -66372,9 +66876,9 @@ "question__title": "Nim Game", "question__title_slug": "nim-game", "question__hide": false, - "total_acs": 186950, - "total_submitted": 263843, - "total_column_articles": 1204, + "total_acs": 188437, + "total_submitted": 266033, + "total_column_articles": 1202, "frontend_question_id": "292", "is_new_question": false }, @@ -66393,9 +66897,9 @@ "question__title": "Word Pattern II", "question__title_slug": "word-pattern-ii", "question__hide": false, - "total_acs": 5404, - "total_submitted": 10458, - "total_column_articles": 109, + "total_acs": 5471, + "total_submitted": 10576, + "total_column_articles": 111, "frontend_question_id": "291", "is_new_question": false }, @@ -66414,9 +66918,9 @@ "question__title": "Word Pattern", "question__title_slug": "word-pattern", "question__hide": false, - "total_acs": 165478, - "total_submitted": 370903, - "total_column_articles": 1925, + "total_acs": 171102, + "total_submitted": 383685, + "total_column_articles": 1964, "frontend_question_id": "290", "is_new_question": false }, @@ -66435,9 +66939,9 @@ "question__title": "Game of Life", "question__title_slug": "game-of-life", "question__hide": false, - "total_acs": 95796, - "total_submitted": 125956, - "total_column_articles": 1269, + "total_acs": 99341, + "total_submitted": 130474, + "total_column_articles": 1289, "frontend_question_id": "289", "is_new_question": false }, @@ -66456,9 +66960,9 @@ "question__title": "Unique Word Abbreviation", "question__title_slug": "unique-word-abbreviation", "question__hide": false, - "total_acs": 6799, - "total_submitted": 13665, - "total_column_articles": 93, + "total_acs": 6893, + "total_submitted": 13797, + "total_column_articles": 94, "frontend_question_id": "288", "is_new_question": false }, @@ -66477,9 +66981,9 @@ "question__title": "Find the Duplicate Number", "question__title_slug": "find-the-duplicate-number", "question__hide": false, - "total_acs": 363957, - "total_submitted": 568160, - "total_column_articles": 2200, + "total_acs": 372209, + "total_submitted": 580563, + "total_column_articles": 2229, "frontend_question_id": "287", "is_new_question": false }, @@ -66498,8 +67002,8 @@ "question__title": "Walls and Gates", "question__title_slug": "walls-and-gates", "question__hide": false, - "total_acs": 20857, - "total_submitted": 37799, + "total_acs": 21021, + "total_submitted": 38026, "total_column_articles": 246, "frontend_question_id": "286", "is_new_question": false @@ -66519,9 +67023,9 @@ "question__title": "Inorder Successor in BST", "question__title_slug": "inorder-successor-in-bst", "question__hide": false, - "total_acs": 16876, - "total_submitted": 26121, - "total_column_articles": 183, + "total_acs": 17032, + "total_submitted": 26375, + "total_column_articles": 184, "frontend_question_id": "285", "is_new_question": false }, @@ -66540,8 +67044,8 @@ "question__title": "Peeking Iterator", "question__title_slug": "peeking-iterator", "question__hide": false, - "total_acs": 34518, - "total_submitted": 45130, + "total_acs": 34674, + "total_submitted": 45324, "total_column_articles": 269, "frontend_question_id": "284", "is_new_question": false @@ -66561,9 +67065,9 @@ "question__title": "Move Zeroes", "question__title_slug": "move-zeroes", "question__hide": false, - "total_acs": 1285600, - "total_submitted": 2023968, - "total_column_articles": 7510, + "total_acs": 1324989, + "total_submitted": 2087014, + "total_column_articles": 7703, "frontend_question_id": "283", "is_new_question": false }, @@ -66582,9 +67086,9 @@ "question__title": "Expression Add Operators", "question__title_slug": "expression-add-operators", "question__hide": false, - "total_acs": 28255, - "total_submitted": 60379, - "total_column_articles": 228, + "total_acs": 28405, + "total_submitted": 60727, + "total_column_articles": 229, "frontend_question_id": "282", "is_new_question": false }, @@ -66603,8 +67107,8 @@ "question__title": "Zigzag Iterator", "question__title_slug": "zigzag-iterator", "question__hide": false, - "total_acs": 6535, - "total_submitted": 8502, + "total_acs": 6601, + "total_submitted": 8595, "total_column_articles": 138, "frontend_question_id": "281", "is_new_question": false @@ -66624,9 +67128,9 @@ "question__title": "Wiggle Sort", "question__title_slug": "wiggle-sort", "question__hide": false, - "total_acs": 13980, - "total_submitted": 20187, - "total_column_articles": 133, + "total_acs": 14277, + "total_submitted": 20631, + "total_column_articles": 134, "frontend_question_id": "280", "is_new_question": false }, @@ -66645,9 +67149,9 @@ "question__title": "Perfect Squares", "question__title_slug": "perfect-squares", "question__hide": false, - "total_acs": 480092, - "total_submitted": 720967, - "total_column_articles": 2220, + "total_acs": 494926, + "total_submitted": 742307, + "total_column_articles": 2261, "frontend_question_id": "279", "is_new_question": false }, @@ -66666,9 +67170,9 @@ "question__title": "First Bad Version", "question__title_slug": "first-bad-version", "question__hide": false, - "total_acs": 490389, - "total_submitted": 1076977, - "total_column_articles": 2629, + "total_acs": 493004, + "total_submitted": 1082206, + "total_column_articles": 2634, "frontend_question_id": "278", "is_new_question": false }, @@ -66687,8 +67191,8 @@ "question__title": "Find the Celebrity", "question__title_slug": "find-the-celebrity", "question__hide": false, - "total_acs": 16177, - "total_submitted": 28001, + "total_acs": 16339, + "total_submitted": 28267, "total_column_articles": 151, "frontend_question_id": "277", "is_new_question": false @@ -66708,9 +67212,9 @@ "question__title": "Paint Fence", "question__title_slug": "paint-fence", "question__hide": false, - "total_acs": 12301, - "total_submitted": 22496, - "total_column_articles": 206, + "total_acs": 12434, + "total_submitted": 22682, + "total_column_articles": 207, "frontend_question_id": "276", "is_new_question": false }, @@ -66729,9 +67233,9 @@ "question__title": "H-Index II", "question__title_slug": "h-index-ii", "question__hide": false, - "total_acs": 101974, - "total_submitted": 224391, - "total_column_articles": 708, + "total_acs": 103272, + "total_submitted": 227503, + "total_column_articles": 713, "frontend_question_id": "275", "is_new_question": false }, @@ -66750,9 +67254,9 @@ "question__title": "H-Index", "question__title_slug": "h-index", "question__hide": false, - "total_acs": 157950, - "total_submitted": 340190, - "total_column_articles": 1329, + "total_acs": 168833, + "total_submitted": 364270, + "total_column_articles": 1370, "frontend_question_id": "274", "is_new_question": false }, @@ -66771,9 +67275,9 @@ "question__title": "Integer to English Words", "question__title_slug": "integer-to-english-words", "question__hide": false, - "total_acs": 39947, - "total_submitted": 109269, - "total_column_articles": 454, + "total_acs": 40073, + "total_submitted": 109625, + "total_column_articles": 452, "frontend_question_id": "273", "is_new_question": false }, @@ -66792,8 +67296,8 @@ "question__title": "Closest Binary Search Tree Value II", "question__title_slug": "closest-binary-search-tree-value-ii", "question__hide": false, - "total_acs": 7508, - "total_submitted": 11326, + "total_acs": 7597, + "total_submitted": 11458, "total_column_articles": 141, "frontend_question_id": "272", "is_new_question": false @@ -66813,8 +67317,8 @@ "question__title": "Encode and Decode Strings", "question__title_slug": "encode-and-decode-strings", "question__hide": false, - "total_acs": 6048, - "total_submitted": 10342, + "total_acs": 6137, + "total_submitted": 10470, "total_column_articles": 80, "frontend_question_id": "271", "is_new_question": false @@ -66834,8 +67338,8 @@ "question__title": "Closest Binary Search Tree Value", "question__title_slug": "closest-binary-search-tree-value", "question__hide": false, - "total_acs": 20282, - "total_submitted": 37553, + "total_acs": 20517, + "total_submitted": 38194, "total_column_articles": 226, "frontend_question_id": "270", "is_new_question": false @@ -66855,9 +67359,9 @@ "question__title": "Alien Dictionary", "question__title_slug": "alien-dictionary", "question__hide": false, - "total_acs": 13821, - "total_submitted": 37287, - "total_column_articles": 197, + "total_acs": 14176, + "total_submitted": 38030, + "total_column_articles": 198, "frontend_question_id": "269", "is_new_question": false }, @@ -66876,9 +67380,9 @@ "question__title": "Missing Number", "question__title_slug": "missing-number", "question__hide": false, - "total_acs": 341157, - "total_submitted": 510406, - "total_column_articles": 2521, + "total_acs": 345547, + "total_submitted": 516309, + "total_column_articles": 2547, "frontend_question_id": "268", "is_new_question": false }, @@ -66897,8 +67401,8 @@ "question__title": "Palindrome Permutation II", "question__title_slug": "palindrome-permutation-ii", "question__hide": false, - "total_acs": 6755, - "total_submitted": 14467, + "total_acs": 6806, + "total_submitted": 14570, "total_column_articles": 137, "frontend_question_id": "267", "is_new_question": false @@ -66918,9 +67422,9 @@ "question__title": "Palindrome Permutation", "question__title_slug": "palindrome-permutation", "question__hide": false, - "total_acs": 14596, - "total_submitted": 20609, - "total_column_articles": 206, + "total_acs": 14812, + "total_submitted": 20904, + "total_column_articles": 207, "frontend_question_id": "266", "is_new_question": false }, @@ -66939,8 +67443,8 @@ "question__title": "Paint House II", "question__title_slug": "paint-house-ii", "question__hide": false, - "total_acs": 15402, - "total_submitted": 23943, + "total_acs": 15580, + "total_submitted": 24195, "total_column_articles": 278, "frontend_question_id": "265", "is_new_question": false @@ -66960,9 +67464,9 @@ "question__title": "Ugly Number II", "question__title_slug": "ugly-number-ii", "question__hide": false, - "total_acs": 170941, - "total_submitted": 293259, - "total_column_articles": 1004, + "total_acs": 172727, + "total_submitted": 296506, + "total_column_articles": 1006, "frontend_question_id": "264", "is_new_question": false }, @@ -66981,9 +67485,9 @@ "question__title": "Ugly Number", "question__title_slug": "ugly-number", "question__hide": false, - "total_acs": 174843, - "total_submitted": 347758, - "total_column_articles": 1235, + "total_acs": 177245, + "total_submitted": 352920, + "total_column_articles": 1239, "frontend_question_id": "263", "is_new_question": false }, @@ -67002,9 +67506,9 @@ "question__title": "Trips and Users", "question__title_slug": "trips-and-users", "question__hide": false, - "total_acs": 75253, - "total_submitted": 183708, - "total_column_articles": 715, + "total_acs": 76091, + "total_submitted": 185864, + "total_column_articles": 725, "frontend_question_id": "262", "is_new_question": false }, @@ -67023,9 +67527,9 @@ "question__title": "Graph Valid Tree", "question__title_slug": "graph-valid-tree", "question__hide": false, - "total_acs": 19913, - "total_submitted": 38806, - "total_column_articles": 250, + "total_acs": 20108, + "total_submitted": 39143, + "total_column_articles": 251, "frontend_question_id": "261", "is_new_question": false }, @@ -67044,9 +67548,9 @@ "question__title": "Single Number III", "question__title_slug": "single-number-iii", "question__hide": false, - "total_acs": 147823, - "total_submitted": 204764, - "total_column_articles": 1136, + "total_acs": 149656, + "total_submitted": 207736, + "total_column_articles": 1141, "frontend_question_id": "260", "is_new_question": false }, @@ -67065,9 +67569,9 @@ "question__title": "3Sum Smaller", "question__title_slug": "3sum-smaller", "question__hide": false, - "total_acs": 13883, - "total_submitted": 25243, - "total_column_articles": 146, + "total_acs": 13999, + "total_submitted": 25469, + "total_column_articles": 147, "frontend_question_id": "259", "is_new_question": false }, @@ -67086,9 +67590,9 @@ "question__title": "Add Digits", "question__title_slug": "add-digits", "question__hide": false, - "total_acs": 186531, - "total_submitted": 264116, - "total_column_articles": 1519, + "total_acs": 189171, + "total_submitted": 267903, + "total_column_articles": 1535, "frontend_question_id": "258", "is_new_question": false }, @@ -67107,9 +67611,9 @@ "question__title": "Binary Tree Paths", "question__title_slug": "binary-tree-paths", "question__hide": false, - "total_acs": 372036, - "total_submitted": 525786, - "total_column_articles": 2212, + "total_acs": 380316, + "total_submitted": 537665, + "total_column_articles": 2244, "frontend_question_id": "257", "is_new_question": false }, @@ -67128,9 +67632,9 @@ "question__title": "Paint House", "question__title_slug": "paint-house", "question__hide": false, - "total_acs": 23740, - "total_submitted": 33543, - "total_column_articles": 331, + "total_acs": 24015, + "total_submitted": 33875, + "total_column_articles": 332, "frontend_question_id": "256", "is_new_question": false }, @@ -67149,9 +67653,9 @@ "question__title": "Verify Preorder Sequence in Binary Search Tree", "question__title_slug": "verify-preorder-sequence-in-binary-search-tree", "question__hide": false, - "total_acs": 11163, - "total_submitted": 22453, - "total_column_articles": 126, + "total_acs": 11289, + "total_submitted": 22696, + "total_column_articles": 127, "frontend_question_id": "255", "is_new_question": false }, @@ -67170,9 +67674,9 @@ "question__title": "Factor Combinations", "question__title_slug": "factor-combinations", "question__hide": false, - "total_acs": 11636, - "total_submitted": 20420, - "total_column_articles": 147, + "total_acs": 11737, + "total_submitted": 20578, + "total_column_articles": 148, "frontend_question_id": "254", "is_new_question": false }, @@ -67191,9 +67695,9 @@ "question__title": "Meeting Rooms II", "question__title_slug": "meeting-rooms-ii", "question__hide": false, - "total_acs": 69794, - "total_submitted": 133261, - "total_column_articles": 620, + "total_acs": 70277, + "total_submitted": 134105, + "total_column_articles": 623, "frontend_question_id": "253", "is_new_question": false }, @@ -67212,8 +67716,8 @@ "question__title": "Meeting Rooms", "question__title_slug": "meeting-rooms", "question__hide": false, - "total_acs": 26688, - "total_submitted": 45839, + "total_acs": 26920, + "total_submitted": 46222, "total_column_articles": 255, "frontend_question_id": "252", "is_new_question": false @@ -67233,8 +67737,8 @@ "question__title": "Flatten 2D Vector", "question__title_slug": "flatten-2d-vector", "question__hide": false, - "total_acs": 7953, - "total_submitted": 14354, + "total_acs": 8001, + "total_submitted": 14440, "total_column_articles": 117, "frontend_question_id": "251", "is_new_question": false @@ -67254,9 +67758,9 @@ "question__title": "Count Univalue Subtrees", "question__title_slug": "count-univalue-subtrees", "question__hide": false, - "total_acs": 9950, - "total_submitted": 15367, - "total_column_articles": 177, + "total_acs": 10064, + "total_submitted": 15545, + "total_column_articles": 178, "frontend_question_id": "250", "is_new_question": false }, @@ -67275,8 +67779,8 @@ "question__title": "Group Shifted Strings", "question__title_slug": "group-shifted-strings", "question__hide": false, - "total_acs": 12908, - "total_submitted": 19768, + "total_acs": 13078, + "total_submitted": 20003, "total_column_articles": 200, "frontend_question_id": "249", "is_new_question": false @@ -67296,8 +67800,8 @@ "question__title": "Strobogrammatic Number III", "question__title_slug": "strobogrammatic-number-iii", "question__hide": false, - "total_acs": 4714, - "total_submitted": 9620, + "total_acs": 4733, + "total_submitted": 9678, "total_column_articles": 88, "frontend_question_id": "248", "is_new_question": false @@ -67317,9 +67821,9 @@ "question__title": "Strobogrammatic Number II", "question__title_slug": "strobogrammatic-number-ii", "question__hide": false, - "total_acs": 9653, - "total_submitted": 17638, - "total_column_articles": 141, + "total_acs": 9730, + "total_submitted": 17803, + "total_column_articles": 142, "frontend_question_id": "247", "is_new_question": false }, @@ -67338,9 +67842,9 @@ "question__title": "Strobogrammatic Number", "question__title_slug": "strobogrammatic-number", "question__hide": false, - "total_acs": 11490, - "total_submitted": 24218, - "total_column_articles": 182, + "total_acs": 11615, + "total_submitted": 24513, + "total_column_articles": 183, "frontend_question_id": "246", "is_new_question": false }, @@ -67359,9 +67863,9 @@ "question__title": "Shortest Word Distance III", "question__title_slug": "shortest-word-distance-iii", "question__hide": false, - "total_acs": 8028, - "total_submitted": 13976, - "total_column_articles": 94, + "total_acs": 8532, + "total_submitted": 14714, + "total_column_articles": 100, "frontend_question_id": "245", "is_new_question": false }, @@ -67380,9 +67884,9 @@ "question__title": "Shortest Word Distance II", "question__title_slug": "shortest-word-distance-ii", "question__hide": false, - "total_acs": 10493, - "total_submitted": 17436, - "total_column_articles": 115, + "total_acs": 11082, + "total_submitted": 18295, + "total_column_articles": 117, "frontend_question_id": "244", "is_new_question": false }, @@ -67401,9 +67905,9 @@ "question__title": "Shortest Word Distance", "question__title_slug": "shortest-word-distance", "question__hide": false, - "total_acs": 16930, - "total_submitted": 25260, - "total_column_articles": 192, + "total_acs": 17840, + "total_submitted": 26435, + "total_column_articles": 197, "frontend_question_id": "243", "is_new_question": false }, @@ -67422,9 +67926,9 @@ "question__title": "Valid Anagram", "question__title_slug": "valid-anagram", "question__hide": false, - "total_acs": 730348, - "total_submitted": 1101839, - "total_column_articles": 4003, + "total_acs": 750445, + "total_submitted": 1130854, + "total_column_articles": 4095, "frontend_question_id": "242", "is_new_question": false }, @@ -67443,8 +67947,8 @@ "question__title": "Different Ways to Add Parentheses", "question__title_slug": "different-ways-to-add-parentheses", "question__hide": false, - "total_acs": 82743, - "total_submitted": 109505, + "total_acs": 83330, + "total_submitted": 110250, "total_column_articles": 805, "frontend_question_id": "241", "is_new_question": false @@ -67464,9 +67968,9 @@ "question__title": "Search a 2D Matrix II", "question__title_slug": "search-a-2d-matrix-ii", "question__hide": false, - "total_acs": 428724, - "total_submitted": 801906, - "total_column_articles": 1934, + "total_acs": 441159, + "total_submitted": 823814, + "total_column_articles": 1978, "frontend_question_id": "240", "is_new_question": false }, @@ -67485,9 +67989,9 @@ "question__title": "Sliding Window Maximum", "question__title_slug": "sliding-window-maximum", "question__hide": false, - "total_acs": 554735, - "total_submitted": 1130373, - "total_column_articles": 3809, + "total_acs": 574279, + "total_submitted": 1172329, + "total_column_articles": 3873, "frontend_question_id": "239", "is_new_question": false }, @@ -67506,9 +68010,9 @@ "question__title": "Product of Array Except Self", "question__title_slug": "product-of-array-except-self", "question__hide": false, - "total_acs": 382581, - "total_submitted": 508765, - "total_column_articles": 2188, + "total_acs": 403910, + "total_submitted": 536588, + "total_column_articles": 2274, "frontend_question_id": "238", "is_new_question": false }, @@ -67527,9 +68031,9 @@ "question__title": "Delete Node in a Linked List", "question__title_slug": "delete-node-in-a-linked-list", "question__hide": false, - "total_acs": 364513, - "total_submitted": 422565, - "total_column_articles": 1830, + "total_acs": 367134, + "total_submitted": 425432, + "total_column_articles": 1840, "frontend_question_id": "237", "is_new_question": false }, @@ -67548,9 +68052,9 @@ "question__title": "Lowest Common Ancestor of a Binary Tree", "question__title_slug": "lowest-common-ancestor-of-a-binary-tree", "question__hide": false, - "total_acs": 663842, - "total_submitted": 939040, - "total_column_articles": 3224, + "total_acs": 682306, + "total_submitted": 962961, + "total_column_articles": 3272, "frontend_question_id": "236", "is_new_question": false }, @@ -67569,9 +68073,9 @@ "question__title": "Lowest Common Ancestor of a Binary Search Tree", "question__title_slug": "lowest-common-ancestor-of-a-binary-search-tree", "question__hide": false, - "total_acs": 408162, - "total_submitted": 584182, - "total_column_articles": 2123, + "total_acs": 414782, + "total_submitted": 592455, + "total_column_articles": 2135, "frontend_question_id": "235", "is_new_question": false }, @@ -67590,9 +68094,9 @@ "question__title": "Palindrome Linked List", "question__title_slug": "palindrome-linked-list", "question__hide": false, - "total_acs": 693501, - "total_submitted": 1282884, - "total_column_articles": 3904, + "total_acs": 711989, + "total_submitted": 1313715, + "total_column_articles": 3980, "frontend_question_id": "234", "is_new_question": false }, @@ -67611,9 +68115,9 @@ "question__title": "Number of Digit One", "question__title_slug": "number-of-digit-one", "question__hide": false, - "total_acs": 62046, - "total_submitted": 125466, - "total_column_articles": 676, + "total_acs": 62729, + "total_submitted": 127022, + "total_column_articles": 674, "frontend_question_id": "233", "is_new_question": false }, @@ -67632,9 +68136,9 @@ "question__title": "Implement Queue using Stacks", "question__title_slug": "implement-queue-using-stacks", "question__hide": false, - "total_acs": 417803, - "total_submitted": 615749, - "total_column_articles": 2585, + "total_acs": 444874, + "total_submitted": 652518, + "total_column_articles": 2685, "frontend_question_id": "232", "is_new_question": false }, @@ -67653,9 +68157,9 @@ "question__title": "Power of Two", "question__title_slug": "power-of-two", "question__hide": false, - "total_acs": 326077, - "total_submitted": 654670, - "total_column_articles": 2301, + "total_acs": 330450, + "total_submitted": 663575, + "total_column_articles": 2325, "frontend_question_id": "231", "is_new_question": false }, @@ -67674,9 +68178,9 @@ "question__title": "Kth Smallest Element in a BST", "question__title_slug": "kth-smallest-element-in-a-bst", "question__hide": false, - "total_acs": 327438, - "total_submitted": 426328, - "total_column_articles": 2068, + "total_acs": 340351, + "total_submitted": 442332, + "total_column_articles": 2120, "frontend_question_id": "230", "is_new_question": false }, @@ -67695,8 +68199,8 @@ "question__title": "Majority Element II", "question__title_slug": "majority-element-ii", "question__hide": false, - "total_acs": 104229, - "total_submitted": 192014, + "total_acs": 105130, + "total_submitted": 193603, "total_column_articles": 893, "frontend_question_id": "229", "is_new_question": false @@ -67716,9 +68220,9 @@ "question__title": "Summary Ranges", "question__title_slug": "summary-ranges", "question__hide": false, - "total_acs": 144681, - "total_submitted": 263598, - "total_column_articles": 1399, + "total_acs": 150568, + "total_submitted": 274900, + "total_column_articles": 1424, "frontend_question_id": "228", "is_new_question": false }, @@ -67737,9 +68241,9 @@ "question__title": "Basic Calculator II", "question__title_slug": "basic-calculator-ii", "question__hide": false, - "total_acs": 163484, - "total_submitted": 365078, - "total_column_articles": 1149, + "total_acs": 165166, + "total_submitted": 368524, + "total_column_articles": 1156, "frontend_question_id": "227", "is_new_question": false }, @@ -67758,9 +68262,9 @@ "question__title": "Invert Binary Tree", "question__title_slug": "invert-binary-tree", "question__hide": false, - "total_acs": 818646, - "total_submitted": 1022106, - "total_column_articles": 4706, + "total_acs": 845245, + "total_submitted": 1053700, + "total_column_articles": 4789, "frontend_question_id": "226", "is_new_question": false }, @@ -67779,9 +68283,9 @@ "question__title": "Implement Stack using Queues", "question__title_slug": "implement-stack-using-queues", "question__hide": false, - "total_acs": 343898, - "total_submitted": 526133, - "total_column_articles": 5776, + "total_acs": 367589, + "total_submitted": 557776, + "total_column_articles": 5866, "frontend_question_id": "225", "is_new_question": false }, @@ -67800,9 +68304,9 @@ "question__title": "Basic Calculator", "question__title_slug": "basic-calculator", "question__hide": false, - "total_acs": 135743, - "total_submitted": 318479, - "total_column_articles": 1119, + "total_acs": 138443, + "total_submitted": 324832, + "total_column_articles": 1136, "frontend_question_id": "224", "is_new_question": false }, @@ -67821,9 +68325,9 @@ "question__title": "Rectangle Area", "question__title_slug": "rectangle-area", "question__hide": false, - "total_acs": 62354, - "total_submitted": 115464, - "total_column_articles": 679, + "total_acs": 62844, + "total_submitted": 116313, + "total_column_articles": 681, "frontend_question_id": "223", "is_new_question": false }, @@ -67842,9 +68346,9 @@ "question__title": "Count Complete Tree Nodes", "question__title_slug": "count-complete-tree-nodes", "question__hide": false, - "total_acs": 360971, - "total_submitted": 443627, - "total_column_articles": 2061, + "total_acs": 372895, + "total_submitted": 457754, + "total_column_articles": 2105, "frontend_question_id": "222", "is_new_question": false }, @@ -67863,9 +68367,9 @@ "question__title": "Maximal Square", "question__title_slug": "maximal-square", "question__hide": false, - "total_acs": 308562, - "total_submitted": 615712, - "total_column_articles": 1841, + "total_acs": 314067, + "total_submitted": 625800, + "total_column_articles": 1866, "frontend_question_id": "221", "is_new_question": false }, @@ -67884,9 +68388,9 @@ "question__title": "Contains Duplicate III", "question__title_slug": "contains-duplicate-iii", "question__hide": false, - "total_acs": 99977, - "total_submitted": 327914, - "total_column_articles": 659, + "total_acs": 100464, + "total_submitted": 329173, + "total_column_articles": 658, "frontend_question_id": "220", "is_new_question": false }, @@ -67905,9 +68409,9 @@ "question__title": "Contains Duplicate II", "question__title_slug": "contains-duplicate-ii", "question__hide": false, - "total_acs": 279530, - "total_submitted": 610210, - "total_column_articles": 2020, + "total_acs": 286892, + "total_submitted": 622958, + "total_column_articles": 2043, "frontend_question_id": "219", "is_new_question": false }, @@ -67926,9 +68430,9 @@ "question__title": "The Skyline Problem", "question__title_slug": "the-skyline-problem", "question__hide": false, - "total_acs": 53015, - "total_submitted": 95944, - "total_column_articles": 456, + "total_acs": 53367, + "total_submitted": 96624, + "total_column_articles": 458, "frontend_question_id": "218", "is_new_question": false }, @@ -67947,9 +68451,9 @@ "question__title": "Contains Duplicate", "question__title_slug": "contains-duplicate", "question__hide": false, - "total_acs": 844242, - "total_submitted": 1531506, - "total_column_articles": 3926, + "total_acs": 849631, + "total_submitted": 1540579, + "total_column_articles": 3950, "frontend_question_id": "217", "is_new_question": false }, @@ -67968,9 +68472,9 @@ "question__title": "Combination Sum III", "question__title_slug": "combination-sum-iii", "question__hide": false, - "total_acs": 338497, - "total_submitted": 475848, - "total_column_articles": 2208, + "total_acs": 349699, + "total_submitted": 492027, + "total_column_articles": 2247, "frontend_question_id": "216", "is_new_question": false }, @@ -67989,9 +68493,9 @@ "question__title": "Kth Largest Element in an Array", "question__title_slug": "kth-largest-element-in-an-array", "question__hide": false, - "total_acs": 998809, - "total_submitted": 1612307, - "total_column_articles": 4465, + "total_acs": 1021070, + "total_submitted": 1653942, + "total_column_articles": 4535, "frontend_question_id": "215", "is_new_question": false }, @@ -68010,9 +68514,9 @@ "question__title": "Shortest Palindrome", "question__title_slug": "shortest-palindrome", "question__hide": false, - "total_acs": 50537, - "total_submitted": 125285, - "total_column_articles": 509, + "total_acs": 51055, + "total_submitted": 126454, + "total_column_articles": 511, "frontend_question_id": "214", "is_new_question": false }, @@ -68031,9 +68535,9 @@ "question__title": "House Robber II", "question__title_slug": "house-robber-ii", "question__hide": false, - "total_acs": 405287, - "total_submitted": 903202, - "total_column_articles": 2996, + "total_acs": 411827, + "total_submitted": 916976, + "total_column_articles": 3025, "frontend_question_id": "213", "is_new_question": false }, @@ -68052,9 +68556,9 @@ "question__title": "Word Search II", "question__title_slug": "word-search-ii", "question__hide": false, - "total_acs": 101962, - "total_submitted": 235216, - "total_column_articles": 790, + "total_acs": 103474, + "total_submitted": 239281, + "total_column_articles": 797, "frontend_question_id": "212", "is_new_question": false }, @@ -68073,9 +68577,9 @@ "question__title": "Design Add and Search Words Data Structure", "question__title_slug": "design-add-and-search-words-data-structure", "question__hide": false, - "total_acs": 83505, - "total_submitted": 167426, - "total_column_articles": 814, + "total_acs": 85023, + "total_submitted": 170289, + "total_column_articles": 818, "frontend_question_id": "211", "is_new_question": false }, @@ -68094,9 +68598,9 @@ "question__title": "Course Schedule II", "question__title_slug": "course-schedule-ii", "question__hide": false, - "total_acs": 220857, - "total_submitted": 381678, - "total_column_articles": 1523, + "total_acs": 224478, + "total_submitted": 387514, + "total_column_articles": 1537, "frontend_question_id": "210", "is_new_question": false }, @@ -68115,9 +68619,9 @@ "question__title": "Minimum Size Subarray Sum", "question__title_slug": "minimum-size-subarray-sum", "question__hide": false, - "total_acs": 700491, - "total_submitted": 1508836, - "total_column_articles": 4085, + "total_acs": 724676, + "total_submitted": 1562858, + "total_column_articles": 4195, "frontend_question_id": "209", "is_new_question": false }, @@ -68136,9 +68640,9 @@ "question__title": "Implement Trie (Prefix Tree)", "question__title_slug": "implement-trie-prefix-tree", "question__hide": false, - "total_acs": 308060, - "total_submitted": 427744, - "total_column_articles": 1825, + "total_acs": 315359, + "total_submitted": 438502, + "total_column_articles": 1851, "frontend_question_id": "208", "is_new_question": false }, @@ -68157,9 +68661,9 @@ "question__title": "Course Schedule", "question__title_slug": "course-schedule", "question__hide": false, - "total_acs": 376237, - "total_submitted": 697656, - "total_column_articles": 2508, + "total_acs": 386850, + "total_submitted": 717335, + "total_column_articles": 2546, "frontend_question_id": "207", "is_new_question": false }, @@ -68178,9 +68682,9 @@ "question__title": "Reverse Linked List", "question__title_slug": "reverse-linked-list", "question__hide": false, - "total_acs": 1772789, - "total_submitted": 2395442, - "total_column_articles": 12427, + "total_acs": 1818730, + "total_submitted": 2453196, + "total_column_articles": 12585, "frontend_question_id": "206", "is_new_question": false }, @@ -68199,9 +68703,9 @@ "question__title": "Isomorphic Strings", "question__title_slug": "isomorphic-strings", "question__hide": false, - "total_acs": 249056, - "total_submitted": 505293, - "total_column_articles": 1781, + "total_acs": 257002, + "total_submitted": 521048, + "total_column_articles": 1813, "frontend_question_id": "205", "is_new_question": false }, @@ -68220,9 +68724,9 @@ "question__title": "Count Primes", "question__title_slug": "count-primes", "question__hide": false, - "total_acs": 271502, - "total_submitted": 732397, - "total_column_articles": 1155, + "total_acs": 273672, + "total_submitted": 739095, + "total_column_articles": 1159, "frontend_question_id": "204", "is_new_question": false }, @@ -68241,9 +68745,9 @@ "question__title": "Remove Linked List Elements", "question__title_slug": "remove-linked-list-elements", "question__hide": false, - "total_acs": 685207, - "total_submitted": 1220916, - "total_column_articles": 3684, + "total_acs": 702443, + "total_submitted": 1246744, + "total_column_articles": 3742, "frontend_question_id": "203", "is_new_question": false }, @@ -68262,9 +68766,9 @@ "question__title": "Happy Number", "question__title_slug": "happy-number", "question__hide": false, - "total_acs": 474882, - "total_submitted": 742442, - "total_column_articles": 3277, + "total_acs": 489659, + "total_submitted": 763878, + "total_column_articles": 3353, "frontend_question_id": "202", "is_new_question": false }, @@ -68283,9 +68787,9 @@ "question__title": "Bitwise AND of Numbers Range", "question__title_slug": "bitwise-and-of-numbers-range", "question__hide": false, - "total_acs": 86089, - "total_submitted": 158054, - "total_column_articles": 564, + "total_acs": 87945, + "total_submitted": 161293, + "total_column_articles": 573, "frontend_question_id": "201", "is_new_question": false }, @@ -68304,9 +68808,9 @@ "question__title": "Number of Islands", "question__title_slug": "number-of-islands", "question__hide": false, - "total_acs": 772323, - "total_submitted": 1284412, - "total_column_articles": 4378, + "total_acs": 793870, + "total_submitted": 1317698, + "total_column_articles": 4450, "frontend_question_id": "200", "is_new_question": false }, @@ -68325,9 +68829,9 @@ "question__title": "Binary Tree Right Side View", "question__title_slug": "binary-tree-right-side-view", "question__hide": false, - "total_acs": 373036, - "total_submitted": 559579, - "total_column_articles": 3146, + "total_acs": 389590, + "total_submitted": 583414, + "total_column_articles": 3244, "frontend_question_id": "199", "is_new_question": false }, @@ -68346,9 +68850,9 @@ "question__title": "House Robber", "question__title_slug": "house-robber", "question__hide": false, - "total_acs": 914049, - "total_submitted": 1664589, - "total_column_articles": 5266, + "total_acs": 938973, + "total_submitted": 1709080, + "total_column_articles": 5364, "frontend_question_id": "198", "is_new_question": false }, @@ -68367,9 +68871,9 @@ "question__title": "Rising Temperature", "question__title_slug": "rising-temperature", "question__hide": false, - "total_acs": 219502, - "total_submitted": 409929, - "total_column_articles": 1169, + "total_acs": 224441, + "total_submitted": 418795, + "total_column_articles": 1187, "frontend_question_id": "197", "is_new_question": false }, @@ -68388,9 +68892,9 @@ "question__title": "Delete Duplicate Emails", "question__title_slug": "delete-duplicate-emails", "question__hide": false, - "total_acs": 242837, - "total_submitted": 358928, - "total_column_articles": 895, + "total_acs": 245706, + "total_submitted": 363064, + "total_column_articles": 903, "frontend_question_id": "196", "is_new_question": false }, @@ -68409,8 +68913,8 @@ "question__title": "Tenth Line", "question__title_slug": "tenth-line", "question__hide": false, - "total_acs": 57073, - "total_submitted": 130159, + "total_acs": 57478, + "total_submitted": 131228, "total_column_articles": 224, "frontend_question_id": "195", "is_new_question": false @@ -68430,9 +68934,9 @@ "question__title": "Transpose File", "question__title_slug": "transpose-file", "question__hide": false, - "total_acs": 16912, - "total_submitted": 49441, - "total_column_articles": 111, + "total_acs": 17047, + "total_submitted": 49853, + "total_column_articles": 112, "frontend_question_id": "194", "is_new_question": false }, @@ -68451,8 +68955,8 @@ "question__title": "Valid Phone Numbers", "question__title_slug": "valid-phone-numbers", "question__hide": false, - "total_acs": 42699, - "total_submitted": 127639, + "total_acs": 43073, + "total_submitted": 128671, "total_column_articles": 209, "frontend_question_id": "193", "is_new_question": false @@ -68472,9 +68976,9 @@ "question__title": "Word Frequency", "question__title_slug": "word-frequency", "question__hide": false, - "total_acs": 33548, - "total_submitted": 94695, - "total_column_articles": 249, + "total_acs": 33790, + "total_submitted": 95472, + "total_column_articles": 250, "frontend_question_id": "192", "is_new_question": false }, @@ -68493,9 +68997,9 @@ "question__title": "Number of 1 Bits", "question__title_slug": "number-of-1-bits", "question__hide": false, - "total_acs": 364236, - "total_submitted": 472860, - "total_column_articles": 2212, + "total_acs": 369228, + "total_submitted": 478569, + "total_column_articles": 2220, "frontend_question_id": "191", "is_new_question": false }, @@ -68514,9 +69018,9 @@ "question__title": "Reverse Bits", "question__title_slug": "reverse-bits", "question__hide": false, - "total_acs": 234302, - "total_submitted": 323901, - "total_column_articles": 1414, + "total_acs": 237869, + "total_submitted": 328238, + "total_column_articles": 1430, "frontend_question_id": "190", "is_new_question": false }, @@ -68535,9 +69039,9 @@ "question__title": "Rotate Array", "question__title_slug": "rotate-array", "question__hide": false, - "total_acs": 804735, - "total_submitted": 1803720, - "total_column_articles": 3966, + "total_acs": 832942, + "total_submitted": 1862431, + "total_column_articles": 4086, "frontend_question_id": "189", "is_new_question": false }, @@ -68556,9 +69060,9 @@ "question__title": "Best Time to Buy and Sell Stock IV", "question__title_slug": "best-time-to-buy-and-sell-stock-iv", "question__hide": false, - "total_acs": 241094, - "total_submitted": 493006, - "total_column_articles": 1576, + "total_acs": 247102, + "total_submitted": 502238, + "total_column_articles": 1603, "frontend_question_id": "188", "is_new_question": false }, @@ -68577,9 +69081,9 @@ "question__title": "Repeated DNA Sequences", "question__title_slug": "repeated-dna-sequences", "question__hide": false, - "total_acs": 167250, - "total_submitted": 304986, - "total_column_articles": 1142, + "total_acs": 168534, + "total_submitted": 307222, + "total_column_articles": 1147, "frontend_question_id": "187", "is_new_question": false }, @@ -68598,9 +69102,9 @@ "question__title": "Reverse Words in a String II", "question__title_slug": "reverse-words-in-a-string-ii", "question__hide": false, - "total_acs": 17626, - "total_submitted": 23196, - "total_column_articles": 220, + "total_acs": 17998, + "total_submitted": 23664, + "total_column_articles": 224, "frontend_question_id": "186", "is_new_question": false }, @@ -68619,9 +69123,9 @@ "question__title": "Department Top Three Salaries", "question__title_slug": "department-top-three-salaries", "question__hide": false, - "total_acs": 141317, - "total_submitted": 262206, - "total_column_articles": 1159, + "total_acs": 143544, + "total_submitted": 265429, + "total_column_articles": 1168, "frontend_question_id": "185", "is_new_question": false }, @@ -68640,9 +69144,9 @@ "question__title": "Department Highest Salary", "question__title_slug": "department-highest-salary", "question__hide": false, - "total_acs": 197044, - "total_submitted": 378573, - "total_column_articles": 1259, + "total_acs": 199327, + "total_submitted": 382238, + "total_column_articles": 1270, "frontend_question_id": "184", "is_new_question": false }, @@ -68661,9 +69165,9 @@ "question__title": "Customers Who Never Order", "question__title_slug": "customers-who-never-order", "question__hide": false, - "total_acs": 374548, - "total_submitted": 564123, - "total_column_articles": 1238, + "total_acs": 378363, + "total_submitted": 569499, + "total_column_articles": 1246, "frontend_question_id": "183", "is_new_question": false }, @@ -68682,9 +69186,9 @@ "question__title": "Duplicate Emails", "question__title_slug": "duplicate-emails", "question__hide": false, - "total_acs": 332862, - "total_submitted": 423022, - "total_column_articles": 1129, + "total_acs": 336268, + "total_submitted": 427276, + "total_column_articles": 1139, "frontend_question_id": "182", "is_new_question": false }, @@ -68703,9 +69207,9 @@ "question__title": "Employees Earning More Than Their Managers", "question__title_slug": "employees-earning-more-than-their-managers", "question__hide": false, - "total_acs": 310592, - "total_submitted": 452219, - "total_column_articles": 1215, + "total_acs": 313920, + "total_submitted": 456723, + "total_column_articles": 1220, "frontend_question_id": "181", "is_new_question": false }, @@ -68724,9 +69228,9 @@ "question__title": "Consecutive Numbers", "question__title_slug": "consecutive-numbers", "question__hide": false, - "total_acs": 175689, - "total_submitted": 371936, - "total_column_articles": 1018, + "total_acs": 178582, + "total_submitted": 378144, + "total_column_articles": 1041, "frontend_question_id": "180", "is_new_question": false }, @@ -68745,9 +69249,9 @@ "question__title": "Largest Number", "question__title_slug": "largest-number", "question__hide": false, - "total_acs": 219488, - "total_submitted": 535206, - "total_column_articles": 1537, + "total_acs": 222346, + "total_submitted": 542278, + "total_column_articles": 1551, "frontend_question_id": "179", "is_new_question": false }, @@ -68766,9 +69270,9 @@ "question__title": "Rank Scores", "question__title_slug": "rank-scores", "question__hide": false, - "total_acs": 227542, - "total_submitted": 368441, - "total_column_articles": 1103, + "total_acs": 229907, + "total_submitted": 371534, + "total_column_articles": 1109, "frontend_question_id": "178", "is_new_question": false }, @@ -68787,9 +69291,9 @@ "question__title": "Nth Highest Salary", "question__title_slug": "nth-highest-salary", "question__hide": false, - "total_acs": 232713, - "total_submitted": 501267, - "total_column_articles": 928, + "total_acs": 234659, + "total_submitted": 505948, + "total_column_articles": 936, "frontend_question_id": "177", "is_new_question": false }, @@ -68808,9 +69312,9 @@ "question__title": "Second Highest Salary", "question__title_slug": "second-highest-salary", "question__hide": false, - "total_acs": 458936, - "total_submitted": 1235411, - "total_column_articles": 1867, + "total_acs": 463495, + "total_submitted": 1244527, + "total_column_articles": 1878, "frontend_question_id": "176", "is_new_question": false }, @@ -68829,9 +69333,9 @@ "question__title": "Combine Two Tables", "question__title_slug": "combine-two-tables", "question__hide": false, - "total_acs": 551254, - "total_submitted": 741901, - "total_column_articles": 2314, + "total_acs": 556747, + "total_submitted": 748742, + "total_column_articles": 2321, "frontend_question_id": "175", "is_new_question": false }, @@ -68850,9 +69354,9 @@ "question__title": "Dungeon Game", "question__title_slug": "dungeon-game", "question__hide": false, - "total_acs": 71036, - "total_submitted": 146204, - "total_column_articles": 1477, + "total_acs": 71856, + "total_submitted": 148056, + "total_column_articles": 1480, "frontend_question_id": "174", "is_new_question": false }, @@ -68871,9 +69375,9 @@ "question__title": "Binary Search Tree Iterator", "question__title_slug": "binary-search-tree-iterator", "question__hide": false, - "total_acs": 129680, - "total_submitted": 158386, - "total_column_articles": 960, + "total_acs": 132044, + "total_submitted": 161179, + "total_column_articles": 966, "frontend_question_id": "173", "is_new_question": false }, @@ -68892,9 +69396,9 @@ "question__title": "Factorial Trailing Zeroes", "question__title_slug": "factorial-trailing-zeroes", "question__hide": false, - "total_acs": 188505, - "total_submitted": 374656, - "total_column_articles": 1178, + "total_acs": 191679, + "total_submitted": 380849, + "total_column_articles": 1183, "frontend_question_id": "172", "is_new_question": false }, @@ -68913,9 +69417,9 @@ "question__title": "Excel Sheet Column Number", "question__title_slug": "excel-sheet-column-number", "question__hide": false, - "total_acs": 178668, - "total_submitted": 250048, - "total_column_articles": 1432, + "total_acs": 180414, + "total_submitted": 252475, + "total_column_articles": 1445, "frontend_question_id": "171", "is_new_question": false }, @@ -68934,8 +69438,8 @@ "question__title": "Two Sum III - Data structure design", "question__title_slug": "two-sum-iii-data-structure-design", "question__hide": false, - "total_acs": 17541, - "total_submitted": 41131, + "total_acs": 17684, + "total_submitted": 41515, "total_column_articles": 163, "frontend_question_id": "170", "is_new_question": false @@ -68955,9 +69459,9 @@ "question__title": "Majority Element", "question__title_slug": "majority-element", "question__hide": false, - "total_acs": 872885, - "total_submitted": 1315470, - "total_column_articles": 4417, + "total_acs": 903447, + "total_submitted": 1362200, + "total_column_articles": 4513, "frontend_question_id": "169", "is_new_question": false }, @@ -68976,9 +69480,9 @@ "question__title": "Excel Sheet Column Title", "question__title_slug": "excel-sheet-column-title", "question__hide": false, - "total_acs": 151467, - "total_submitted": 340768, - "total_column_articles": 1221, + "total_acs": 153345, + "total_submitted": 344301, + "total_column_articles": 1235, "frontend_question_id": "168", "is_new_question": false }, @@ -68997,9 +69501,9 @@ "question__title": "Two Sum II - Input Array Is Sorted", "question__title_slug": "two-sum-ii-input-array-is-sorted", "question__hide": false, - "total_acs": 655824, - "total_submitted": 1092665, - "total_column_articles": 4084, + "total_acs": 667797, + "total_submitted": 1112209, + "total_column_articles": 4129, "frontend_question_id": "167", "is_new_question": false }, @@ -69018,9 +69522,9 @@ "question__title": "Fraction to Recurring Decimal", "question__title_slug": "fraction-to-recurring-decimal", "question__hide": false, - "total_acs": 68637, - "total_submitted": 204983, - "total_column_articles": 555, + "total_acs": 69109, + "total_submitted": 206410, + "total_column_articles": 557, "frontend_question_id": "166", "is_new_question": false }, @@ -69039,9 +69543,9 @@ "question__title": "Compare Version Numbers", "question__title_slug": "compare-version-numbers", "question__hide": false, - "total_acs": 167266, - "total_submitted": 321074, - "total_column_articles": 1359, + "total_acs": 169644, + "total_submitted": 325574, + "total_column_articles": 1367, "frontend_question_id": "165", "is_new_question": false }, @@ -69060,9 +69564,9 @@ "question__title": "Maximum Gap", "question__title_slug": "maximum-gap", "question__hide": false, - "total_acs": 93578, - "total_submitted": 155814, - "total_column_articles": 700, + "total_acs": 94914, + "total_submitted": 158180, + "total_column_articles": 701, "frontend_question_id": "164", "is_new_question": false }, @@ -69081,9 +69585,9 @@ "question__title": "Missing Ranges", "question__title_slug": "missing-ranges", "question__hide": false, - "total_acs": 21008, - "total_submitted": 58500, - "total_column_articles": 286, + "total_acs": 21264, + "total_submitted": 59153, + "total_column_articles": 289, "frontend_question_id": "163", "is_new_question": false }, @@ -69102,9 +69606,9 @@ "question__title": "Find Peak Element", "question__title_slug": "find-peak-element", "question__hide": false, - "total_acs": 372308, - "total_submitted": 752206, - "total_column_articles": 2262, + "total_acs": 379585, + "total_submitted": 767172, + "total_column_articles": 2299, "frontend_question_id": "162", "is_new_question": false }, @@ -69123,9 +69627,9 @@ "question__title": "One Edit Distance", "question__title_slug": "one-edit-distance", "question__hide": false, - "total_acs": 16806, - "total_submitted": 49517, - "total_column_articles": 214, + "total_acs": 17055, + "total_submitted": 50185, + "total_column_articles": 216, "frontend_question_id": "161", "is_new_question": false }, @@ -69144,9 +69648,9 @@ "question__title": "Intersection of Two Linked Lists", "question__title_slug": "intersection-of-two-linked-lists", "question__hide": false, - "total_acs": 793416, - "total_submitted": 1230295, - "total_column_articles": 4212, + "total_acs": 816324, + "total_submitted": 1262578, + "total_column_articles": 4310, "frontend_question_id": "160", "is_new_question": false }, @@ -69165,9 +69669,9 @@ "question__title": "Longest Substring with At Most Two Distinct Characters", "question__title_slug": "longest-substring-with-at-most-two-distinct-characters", "question__hide": false, - "total_acs": 36178, - "total_submitted": 64424, - "total_column_articles": 371, + "total_acs": 36664, + "total_submitted": 65285, + "total_column_articles": 373, "frontend_question_id": "159", "is_new_question": false }, @@ -69186,9 +69690,9 @@ "question__title": "Read N Characters Given read4 II - Call Multiple Times", "question__title_slug": "read-n-characters-given-read4-ii-call-multiple-times", "question__hide": false, - "total_acs": 5330, - "total_submitted": 8878, - "total_column_articles": 108, + "total_acs": 5362, + "total_submitted": 8935, + "total_column_articles": 109, "frontend_question_id": "158", "is_new_question": false }, @@ -69207,8 +69711,8 @@ "question__title": "Read N Characters Given Read4", "question__title_slug": "read-n-characters-given-read4", "question__hide": false, - "total_acs": 10850, - "total_submitted": 19854, + "total_acs": 10930, + "total_submitted": 20015, "total_column_articles": 139, "frontend_question_id": "157", "is_new_question": false @@ -69228,8 +69732,8 @@ "question__title": "Binary Tree Upside Down", "question__title_slug": "binary-tree-upside-down", "question__hide": false, - "total_acs": 15498, - "total_submitted": 21169, + "total_acs": 15604, + "total_submitted": 21294, "total_column_articles": 253, "frontend_question_id": "156", "is_new_question": false @@ -69249,9 +69753,9 @@ "question__title": "Min Stack", "question__title_slug": "min-stack", "question__hide": false, - "total_acs": 549016, - "total_submitted": 922860, - "total_column_articles": 2775, + "total_acs": 561002, + "total_submitted": 941189, + "total_column_articles": 2824, "frontend_question_id": "155", "is_new_question": false }, @@ -69270,9 +69774,9 @@ "question__title": "Find Minimum in Rotated Sorted Array II", "question__title_slug": "find-minimum-in-rotated-sorted-array-ii", "question__hide": false, - "total_acs": 187567, - "total_submitted": 358992, - "total_column_articles": 1374, + "total_acs": 189389, + "total_submitted": 362990, + "total_column_articles": 1379, "frontend_question_id": "154", "is_new_question": false }, @@ -69291,9 +69795,9 @@ "question__title": "Find Minimum in Rotated Sorted Array", "question__title_slug": "find-minimum-in-rotated-sorted-array", "question__hide": false, - "total_acs": 434606, - "total_submitted": 757790, - "total_column_articles": 2714, + "total_acs": 446905, + "total_submitted": 778327, + "total_column_articles": 2764, "frontend_question_id": "153", "is_new_question": false }, @@ -69312,9 +69816,9 @@ "question__title": "Maximum Product Subarray", "question__title_slug": "maximum-product-subarray", "question__hide": false, - "total_acs": 407983, - "total_submitted": 944716, - "total_column_articles": 2304, + "total_acs": 417201, + "total_submitted": 966420, + "total_column_articles": 2336, "frontend_question_id": "152", "is_new_question": false }, @@ -69333,9 +69837,9 @@ "question__title": "Reverse Words in a String", "question__title_slug": "reverse-words-in-a-string", "question__hide": false, - "total_acs": 518699, - "total_submitted": 956545, - "total_column_articles": 3724, + "total_acs": 537786, + "total_submitted": 985017, + "total_column_articles": 3824, "frontend_question_id": "151", "is_new_question": false }, @@ -69354,9 +69858,9 @@ "question__title": "Evaluate Reverse Polish Notation", "question__title_slug": "evaluate-reverse-polish-notation", "question__hide": false, - "total_acs": 343483, - "total_submitted": 638000, - "total_column_articles": 2245, + "total_acs": 354324, + "total_submitted": 656101, + "total_column_articles": 2291, "frontend_question_id": "150", "is_new_question": false }, @@ -69375,9 +69879,9 @@ "question__title": "Max Points on a Line", "question__title_slug": "max-points-on-a-line", "question__hide": false, - "total_acs": 88789, - "total_submitted": 221322, - "total_column_articles": 840, + "total_acs": 90204, + "total_submitted": 224347, + "total_column_articles": 841, "frontend_question_id": "149", "is_new_question": false }, @@ -69396,9 +69900,9 @@ "question__title": "Sort List", "question__title_slug": "sort-list", "question__hide": false, - "total_acs": 472785, - "total_submitted": 721464, - "total_column_articles": 2459, + "total_acs": 486286, + "total_submitted": 742012, + "total_column_articles": 2510, "frontend_question_id": "148", "is_new_question": false }, @@ -69417,9 +69921,9 @@ "question__title": "Insertion Sort List", "question__title_slug": "insertion-sort-list", "question__hide": false, - "total_acs": 161981, - "total_submitted": 232564, - "total_column_articles": 1172, + "total_acs": 163598, + "total_submitted": 234841, + "total_column_articles": 1176, "frontend_question_id": "147", "is_new_question": false }, @@ -69438,9 +69942,9 @@ "question__title": "LRU Cache", "question__title_slug": "lru-cache", "question__hide": false, - "total_acs": 589813, - "total_submitted": 1098869, - "total_column_articles": 4015, + "total_acs": 608149, + "total_submitted": 1134440, + "total_column_articles": 4080, "frontend_question_id": "146", "is_new_question": false }, @@ -69459,9 +69963,9 @@ "question__title": "Binary Tree Postorder Traversal", "question__title_slug": "binary-tree-postorder-traversal", "question__hide": false, - "total_acs": 739622, - "total_submitted": 965968, - "total_column_articles": 3003, + "total_acs": 754113, + "total_submitted": 984719, + "total_column_articles": 3039, "frontend_question_id": "145", "is_new_question": false }, @@ -69480,9 +69984,9 @@ "question__title": "Binary Tree Preorder Traversal", "question__title_slug": "binary-tree-preorder-traversal", "question__hide": false, - "total_acs": 1018015, - "total_submitted": 1419905, - "total_column_articles": 3934, + "total_acs": 1038346, + "total_submitted": 1446778, + "total_column_articles": 3989, "frontend_question_id": "144", "is_new_question": false }, @@ -69501,9 +70005,9 @@ "question__title": "Reorder List", "question__title_slug": "reorder-list", "question__hide": false, - "total_acs": 303901, - "total_submitted": 460127, - "total_column_articles": 2111, + "total_acs": 308306, + "total_submitted": 466571, + "total_column_articles": 2131, "frontend_question_id": "143", "is_new_question": false }, @@ -69522,9 +70026,9 @@ "question__title": "Linked List Cycle II", "question__title_slug": "linked-list-cycle-ii", "question__hide": false, - "total_acs": 828604, - "total_submitted": 1419051, - "total_column_articles": 4409, + "total_acs": 854043, + "total_submitted": 1457556, + "total_column_articles": 4511, "frontend_question_id": "142", "is_new_question": false }, @@ -69543,9 +70047,9 @@ "question__title": "Linked List Cycle", "question__title_slug": "linked-list-cycle", "question__hide": false, - "total_acs": 1171869, - "total_submitted": 2246857, - "total_column_articles": 5619, + "total_acs": 1200748, + "total_submitted": 2299349, + "total_column_articles": 5703, "frontend_question_id": "141", "is_new_question": false }, @@ -69564,9 +70068,9 @@ "question__title": "Word Break II", "question__title_slug": "word-break-ii", "question__hide": false, - "total_acs": 97587, - "total_submitted": 166839, - "total_column_articles": 1058, + "total_acs": 98481, + "total_submitted": 167990, + "total_column_articles": 1062, "frontend_question_id": "140", "is_new_question": false }, @@ -69585,9 +70089,9 @@ "question__title": "Word Break", "question__title_slug": "word-break", "question__hide": false, - "total_acs": 535499, - "total_submitted": 973890, - "total_column_articles": 2787, + "total_acs": 552350, + "total_submitted": 1001425, + "total_column_articles": 2846, "frontend_question_id": "139", "is_new_question": false }, @@ -69606,9 +70110,9 @@ "question__title": "Copy List with Random Pointer", "question__title_slug": "copy-list-with-random-pointer", "question__hide": false, - "total_acs": 253325, - "total_submitted": 381173, - "total_column_articles": 1642, + "total_acs": 265126, + "total_submitted": 397952, + "total_column_articles": 1710, "frontend_question_id": "138", "is_new_question": false }, @@ -69627,9 +70131,9 @@ "question__title": "Single Number II", "question__title_slug": "single-number-ii", "question__hide": false, - "total_acs": 193723, - "total_submitted": 267786, - "total_column_articles": 1302, + "total_acs": 197508, + "total_submitted": 273254, + "total_column_articles": 1318, "frontend_question_id": "137", "is_new_question": false }, @@ -69648,9 +70152,9 @@ "question__title": "Single Number", "question__title_slug": "single-number", "question__hide": false, - "total_acs": 1033040, - "total_submitted": 1409899, - "total_column_articles": 4534, + "total_acs": 1049931, + "total_submitted": 1430318, + "total_column_articles": 4601, "frontend_question_id": "136", "is_new_question": false }, @@ -69669,9 +70173,9 @@ "question__title": "Candy", "question__title_slug": "candy", "question__hide": false, - "total_acs": 286498, - "total_submitted": 580827, - "total_column_articles": 1871, + "total_acs": 296686, + "total_submitted": 603937, + "total_column_articles": 1913, "frontend_question_id": "135", "is_new_question": false }, @@ -69690,9 +70194,9 @@ "question__title": "Gas Station", "question__title_slug": "gas-station", "question__hide": false, - "total_acs": 328505, - "total_submitted": 675140, - "total_column_articles": 2078, + "total_acs": 341322, + "total_submitted": 707915, + "total_column_articles": 2145, "frontend_question_id": "134", "is_new_question": false }, @@ -69711,9 +70215,9 @@ "question__title": "Clone Graph", "question__title_slug": "clone-graph", "question__hide": false, - "total_acs": 136026, - "total_submitted": 194070, - "total_column_articles": 886, + "total_acs": 139049, + "total_submitted": 197862, + "total_column_articles": 899, "frontend_question_id": "133", "is_new_question": false }, @@ -69732,9 +70236,9 @@ "question__title": "Palindrome Partitioning II", "question__title_slug": "palindrome-partitioning-ii", "question__hide": false, - "total_acs": 85283, - "total_submitted": 171288, - "total_column_articles": 656, + "total_acs": 86187, + "total_submitted": 173055, + "total_column_articles": 659, "frontend_question_id": "132", "is_new_question": false }, @@ -69753,9 +70257,9 @@ "question__title": "Palindrome Partitioning", "question__title_slug": "palindrome-partitioning", "question__hide": false, - "total_acs": 364485, - "total_submitted": 495893, - "total_column_articles": 1972, + "total_acs": 377629, + "total_submitted": 513967, + "total_column_articles": 2020, "frontend_question_id": "131", "is_new_question": false }, @@ -69774,9 +70278,9 @@ "question__title": "Surrounded Regions", "question__title_slug": "surrounded-regions", "question__hide": false, - "total_acs": 263746, - "total_submitted": 568327, - "total_column_articles": 2391, + "total_acs": 269528, + "total_submitted": 580648, + "total_column_articles": 2422, "frontend_question_id": "130", "is_new_question": false }, @@ -69795,9 +70299,9 @@ "question__title": "Sum Root to Leaf Numbers", "question__title_slug": "sum-root-to-leaf-numbers", "question__hide": false, - "total_acs": 249006, - "total_submitted": 353944, - "total_column_articles": 1945, + "total_acs": 255274, + "total_submitted": 362546, + "total_column_articles": 1971, "frontend_question_id": "129", "is_new_question": false }, @@ -69816,9 +70320,9 @@ "question__title": "Longest Consecutive Sequence", "question__title_slug": "longest-consecutive-sequence", "question__hide": false, - "total_acs": 552576, - "total_submitted": 1053260, - "total_column_articles": 3136, + "total_acs": 584876, + "total_submitted": 1122632, + "total_column_articles": 3300, "frontend_question_id": "128", "is_new_question": false }, @@ -69837,9 +70341,9 @@ "question__title": "Word Ladder", "question__title_slug": "word-ladder", "question__hide": false, - "total_acs": 206305, - "total_submitted": 424957, - "total_column_articles": 1101, + "total_acs": 209251, + "total_submitted": 430566, + "total_column_articles": 1123, "frontend_question_id": "127", "is_new_question": false }, @@ -69858,9 +70362,9 @@ "question__title": "Word Ladder II", "question__title_slug": "word-ladder-ii", "question__hide": false, - "total_acs": 58178, - "total_submitted": 156698, - "total_column_articles": 515, + "total_acs": 58508, + "total_submitted": 157900, + "total_column_articles": 516, "frontend_question_id": "126", "is_new_question": false }, @@ -69879,9 +70383,9 @@ "question__title": "Valid Palindrome", "question__title_slug": "valid-palindrome", "question__hide": false, - "total_acs": 556744, - "total_submitted": 1187701, - "total_column_articles": 3328, + "total_acs": 570400, + "total_submitted": 1215527, + "total_column_articles": 3384, "frontend_question_id": "125", "is_new_question": false }, @@ -69900,9 +70404,9 @@ "question__title": "Binary Tree Maximum Path Sum", "question__title_slug": "binary-tree-maximum-path-sum", "question__hide": false, - "total_acs": 380820, - "total_submitted": 838327, - "total_column_articles": 2176, + "total_acs": 391164, + "total_submitted": 861071, + "total_column_articles": 2220, "frontend_question_id": "124", "is_new_question": false }, @@ -69921,9 +70425,9 @@ "question__title": "Best Time to Buy and Sell Stock III", "question__title_slug": "best-time-to-buy-and-sell-stock-iii", "question__hide": false, - "total_acs": 317770, - "total_submitted": 527003, - "total_column_articles": 1697, + "total_acs": 324785, + "total_submitted": 537652, + "total_column_articles": 1722, "frontend_question_id": "123", "is_new_question": false }, @@ -69942,9 +70446,9 @@ "question__title": "Best Time to Buy and Sell Stock II", "question__title_slug": "best-time-to-buy-and-sell-stock-ii", "question__hide": false, - "total_acs": 1041432, - "total_submitted": 1424029, - "total_column_articles": 5477, + "total_acs": 1067767, + "total_submitted": 1457275, + "total_column_articles": 5602, "frontend_question_id": "122", "is_new_question": false }, @@ -69963,9 +70467,9 @@ "question__title": "Best Time to Buy and Sell Stock", "question__title_slug": "best-time-to-buy-and-sell-stock", "question__hide": false, - "total_acs": 1327182, - "total_submitted": 2299685, - "total_column_articles": 7003, + "total_acs": 1361831, + "total_submitted": 2360464, + "total_column_articles": 7162, "frontend_question_id": "121", "is_new_question": false }, @@ -69984,9 +70488,9 @@ "question__title": "Triangle", "question__title_slug": "triangle", "question__hide": false, - "total_acs": 332186, - "total_submitted": 483730, - "total_column_articles": 2618, + "total_acs": 338365, + "total_submitted": 492635, + "total_column_articles": 2647, "frontend_question_id": "120", "is_new_question": false }, @@ -70005,9 +70509,9 @@ "question__title": "Pascal's Triangle II", "question__title_slug": "pascals-triangle-ii", "question__hide": false, - "total_acs": 299266, - "total_submitted": 434024, - "total_column_articles": 2198, + "total_acs": 302856, + "total_submitted": 439105, + "total_column_articles": 2217, "frontend_question_id": "119", "is_new_question": false }, @@ -70026,9 +70530,9 @@ "question__title": "Pascal's Triangle", "question__title_slug": "pascals-triangle", "question__hide": false, - "total_acs": 483003, - "total_submitted": 638196, - "total_column_articles": 3515, + "total_acs": 495374, + "total_submitted": 653983, + "total_column_articles": 3567, "frontend_question_id": "118", "is_new_question": false }, @@ -70047,9 +70551,9 @@ "question__title": "Populating Next Right Pointers in Each Node II", "question__title_slug": "populating-next-right-pointers-in-each-node-ii", "question__hide": false, - "total_acs": 239655, - "total_submitted": 349879, - "total_column_articles": 1624, + "total_acs": 246039, + "total_submitted": 357764, + "total_column_articles": 1640, "frontend_question_id": "117", "is_new_question": false }, @@ -70068,9 +70572,9 @@ "question__title": "Populating Next Right Pointers in Each Node", "question__title_slug": "populating-next-right-pointers-in-each-node", "question__hide": false, - "total_acs": 392447, - "total_submitted": 536647, - "total_column_articles": 2822, + "total_acs": 398302, + "total_submitted": 544070, + "total_column_articles": 2841, "frontend_question_id": "116", "is_new_question": false }, @@ -70089,9 +70593,9 @@ "question__title": "Distinct Subsequences", "question__title_slug": "distinct-subsequences", "question__hide": false, - "total_acs": 166050, - "total_submitted": 320453, - "total_column_articles": 1397, + "total_acs": 170283, + "total_submitted": 328504, + "total_column_articles": 1413, "frontend_question_id": "115", "is_new_question": false }, @@ -70110,9 +70614,9 @@ "question__title": "Flatten Binary Tree to Linked List", "question__title_slug": "flatten-binary-tree-to-linked-list", "question__hide": false, - "total_acs": 429839, - "total_submitted": 585090, - "total_column_articles": 3242, + "total_acs": 443484, + "total_submitted": 603038, + "total_column_articles": 3314, "frontend_question_id": "114", "is_new_question": false }, @@ -70131,9 +70635,9 @@ "question__title": "Path Sum II", "question__title_slug": "path-sum-ii", "question__hide": false, - "total_acs": 391512, - "total_submitted": 618882, - "total_column_articles": 2374, + "total_acs": 397631, + "total_submitted": 628562, + "total_column_articles": 2399, "frontend_question_id": "113", "is_new_question": false }, @@ -70152,9 +70656,9 @@ "question__title": "Path Sum", "question__title_slug": "path-sum", "question__hide": false, - "total_acs": 640307, - "total_submitted": 1185135, - "total_column_articles": 3456, + "total_acs": 654468, + "total_submitted": 1209279, + "total_column_articles": 3518, "frontend_question_id": "112", "is_new_question": false }, @@ -70173,9 +70677,9 @@ "question__title": "Minimum Depth of Binary Tree", "question__title_slug": "minimum-depth-of-binary-tree", "question__hide": false, - "total_acs": 653140, - "total_submitted": 1220308, - "total_column_articles": 4199, + "total_acs": 665884, + "total_submitted": 1239926, + "total_column_articles": 4245, "frontend_question_id": "111", "is_new_question": false }, @@ -70194,9 +70698,9 @@ "question__title": "Balanced Binary Tree", "question__title_slug": "balanced-binary-tree", "question__hide": false, - "total_acs": 582172, - "total_submitted": 1001265, - "total_column_articles": 2836, + "total_acs": 592826, + "total_submitted": 1017813, + "total_column_articles": 2877, "frontend_question_id": "110", "is_new_question": false }, @@ -70215,9 +70719,9 @@ "question__title": "Convert Sorted List to Binary Search Tree", "question__title_slug": "convert-sorted-list-to-binary-search-tree", "question__hide": false, - "total_acs": 158179, - "total_submitted": 206571, - "total_column_articles": 1188, + "total_acs": 159475, + "total_submitted": 208283, + "total_column_articles": 1192, "frontend_question_id": "109", "is_new_question": false }, @@ -70236,9 +70740,9 @@ "question__title": "Convert Sorted Array to Binary Search Tree", "question__title_slug": "convert-sorted-array-to-binary-search-tree", "question__hide": false, - "total_acs": 435323, - "total_submitted": 557314, - "total_column_articles": 2330, + "total_acs": 450042, + "total_submitted": 575153, + "total_column_articles": 2373, "frontend_question_id": "108", "is_new_question": false }, @@ -70257,9 +70761,9 @@ "question__title": "Binary Tree Level Order Traversal II", "question__title_slug": "binary-tree-level-order-traversal-ii", "question__hide": false, - "total_acs": 321889, - "total_submitted": 436682, - "total_column_articles": 2168, + "total_acs": 327835, + "total_submitted": 444162, + "total_column_articles": 2188, "frontend_question_id": "107", "is_new_question": false }, @@ -70278,9 +70782,9 @@ "question__title": "Construct Binary Tree from Inorder and Postorder Traversal", "question__title_slug": "construct-binary-tree-from-inorder-and-postorder-traversal", "question__hide": false, - "total_acs": 356731, - "total_submitted": 493752, - "total_column_articles": 2037, + "total_acs": 365889, + "total_submitted": 506516, + "total_column_articles": 2072, "frontend_question_id": "106", "is_new_question": false }, @@ -70299,9 +70803,9 @@ "question__title": "Construct Binary Tree from Preorder and Inorder Traversal", "question__title_slug": "construct-binary-tree-from-preorder-and-inorder-traversal", "question__hide": false, - "total_acs": 603133, - "total_submitted": 843321, - "total_column_articles": 2972, + "total_acs": 619319, + "total_submitted": 865636, + "total_column_articles": 3034, "frontend_question_id": "105", "is_new_question": false }, @@ -70320,9 +70824,9 @@ "question__title": "Maximum Depth of Binary Tree", "question__title_slug": "maximum-depth-of-binary-tree", "question__hide": false, - "total_acs": 1218845, - "total_submitted": 1575503, - "total_column_articles": 5738, + "total_acs": 1252545, + "total_submitted": 1617797, + "total_column_articles": 5837, "frontend_question_id": "104", "is_new_question": false }, @@ -70341,9 +70845,9 @@ "question__title": "Binary Tree Zigzag Level Order Traversal", "question__title_slug": "binary-tree-zigzag-level-order-traversal", "question__hide": false, - "total_acs": 357721, - "total_submitted": 609933, - "total_column_articles": 2705, + "total_acs": 364175, + "total_submitted": 619874, + "total_column_articles": 2736, "frontend_question_id": "103", "is_new_question": false }, @@ -70362,9 +70866,9 @@ "question__title": "Binary Tree Level Order Traversal", "question__title_slug": "binary-tree-level-order-traversal", "question__hide": false, - "total_acs": 977604, - "total_submitted": 1464024, - "total_column_articles": 4992, + "total_acs": 1003351, + "total_submitted": 1499173, + "total_column_articles": 5073, "frontend_question_id": "102", "is_new_question": false }, @@ -70383,9 +70887,9 @@ "question__title": "Symmetric Tree", "question__title_slug": "symmetric-tree", "question__hide": false, - "total_acs": 986159, - "total_submitted": 1649400, - "total_column_articles": 4793, + "total_acs": 1013060, + "total_submitted": 1690124, + "total_column_articles": 4890, "frontend_question_id": "101", "is_new_question": false }, @@ -70404,9 +70908,9 @@ "question__title": "Same Tree", "question__title_slug": "same-tree", "question__hide": false, - "total_acs": 537191, - "total_submitted": 881950, - "total_column_articles": 3431, + "total_acs": 548730, + "total_submitted": 898463, + "total_column_articles": 3478, "frontend_question_id": "100", "is_new_question": false }, @@ -70425,9 +70929,9 @@ "question__title": "Recover Binary Search Tree", "question__title_slug": "recover-binary-search-tree", "question__hide": false, - "total_acs": 148936, - "total_submitted": 246087, - "total_column_articles": 1162, + "total_acs": 150369, + "total_submitted": 248406, + "total_column_articles": 1174, "frontend_question_id": "99", "is_new_question": false }, @@ -70446,9 +70950,9 @@ "question__title": "Validate Binary Search Tree", "question__title_slug": "validate-binary-search-tree", "question__hide": false, - "total_acs": 850887, - "total_submitted": 2261519, - "total_column_articles": 4470, + "total_acs": 872032, + "total_submitted": 2312549, + "total_column_articles": 4544, "frontend_question_id": "98", "is_new_question": false }, @@ -70467,9 +70971,9 @@ "question__title": "Interleaving String", "question__title_slug": "interleaving-string", "question__hide": false, - "total_acs": 136761, - "total_submitted": 305320, - "total_column_articles": 974, + "total_acs": 139933, + "total_submitted": 312307, + "total_column_articles": 985, "frontend_question_id": "97", "is_new_question": false }, @@ -70488,9 +70992,9 @@ "question__title": "Unique Binary Search Trees", "question__title_slug": "unique-binary-search-trees", "question__hide": false, - "total_acs": 421383, - "total_submitted": 593401, - "total_column_articles": 2686, + "total_acs": 429131, + "total_submitted": 604288, + "total_column_articles": 2722, "frontend_question_id": "96", "is_new_question": false }, @@ -70509,9 +71013,9 @@ "question__title": "Unique Binary Search Trees II", "question__title_slug": "unique-binary-search-trees-ii", "question__hide": false, - "total_acs": 184773, - "total_submitted": 250297, - "total_column_articles": 1120, + "total_acs": 186439, + "total_submitted": 252456, + "total_column_articles": 1125, "frontend_question_id": "95", "is_new_question": false }, @@ -70530,9 +71034,9 @@ "question__title": "Binary Tree Inorder Traversal", "question__title_slug": "binary-tree-inorder-traversal", "question__hide": false, - "total_acs": 1366310, - "total_submitted": 1783995, - "total_column_articles": 4745, + "total_acs": 1398997, + "total_submitted": 1825143, + "total_column_articles": 4818, "frontend_question_id": "94", "is_new_question": false }, @@ -70551,9 +71055,9 @@ "question__title": "Restore IP Addresses", "question__title_slug": "restore-ip-addresses", "question__hide": false, - "total_acs": 395860, - "total_submitted": 670553, - "total_column_articles": 2735, + "total_acs": 404504, + "total_submitted": 683661, + "total_column_articles": 2775, "frontend_question_id": "93", "is_new_question": false }, @@ -70572,9 +71076,9 @@ "question__title": "Reverse Linked List II", "question__title_slug": "reverse-linked-list-ii", "question__hide": false, - "total_acs": 476358, - "total_submitted": 850932, - "total_column_articles": 4061, + "total_acs": 487976, + "total_submitted": 870991, + "total_column_articles": 4115, "frontend_question_id": "92", "is_new_question": false }, @@ -70593,9 +71097,9 @@ "question__title": "Decode Ways", "question__title_slug": "decode-ways", "question__hide": false, - "total_acs": 294828, - "total_submitted": 878985, - "total_column_articles": 2421, + "total_acs": 297856, + "total_submitted": 887361, + "total_column_articles": 2438, "frontend_question_id": "91", "is_new_question": false }, @@ -70614,9 +71118,9 @@ "question__title": "Subsets II", "question__title_slug": "subsets-ii", "question__hide": false, - "total_acs": 350036, - "total_submitted": 551476, - "total_column_articles": 2460, + "total_acs": 357355, + "total_submitted": 563383, + "total_column_articles": 2489, "frontend_question_id": "90", "is_new_question": false }, @@ -70635,9 +71139,9 @@ "question__title": "Gray Code", "question__title_slug": "gray-code", "question__hide": false, - "total_acs": 126353, - "total_submitted": 167497, - "total_column_articles": 944, + "total_acs": 127175, + "total_submitted": 168632, + "total_column_articles": 946, "frontend_question_id": "89", "is_new_question": false }, @@ -70656,9 +71160,9 @@ "question__title": "Merge Sorted Array", "question__title_slug": "merge-sorted-array", "question__hide": false, - "total_acs": 1174107, - "total_submitted": 2207162, - "total_column_articles": 7403, + "total_acs": 1210644, + "total_submitted": 2270329, + "total_column_articles": 7562, "frontend_question_id": "88", "is_new_question": false }, @@ -70677,9 +71181,9 @@ "question__title": "Scramble String", "question__title_slug": "scramble-string", "question__hide": false, - "total_acs": 62017, - "total_submitted": 131623, - "total_column_articles": 470, + "total_acs": 62407, + "total_submitted": 132549, + "total_column_articles": 473, "frontend_question_id": "87", "is_new_question": false }, @@ -70698,9 +71202,9 @@ "question__title": "Partition List", "question__title_slug": "partition-list", "question__hide": false, - "total_acs": 261870, - "total_submitted": 405803, - "total_column_articles": 2366, + "total_acs": 268637, + "total_submitted": 416235, + "total_column_articles": 2401, "frontend_question_id": "86", "is_new_question": false }, @@ -70719,9 +71223,9 @@ "question__title": "Maximal Rectangle", "question__title_slug": "maximal-rectangle", "question__hide": false, - "total_acs": 191895, - "total_submitted": 348680, - "total_column_articles": 1263, + "total_acs": 193429, + "total_submitted": 351449, + "total_column_articles": 1267, "frontend_question_id": "85", "is_new_question": false }, @@ -70740,9 +71244,9 @@ "question__title": "Largest Rectangle in Histogram", "question__title_slug": "largest-rectangle-in-histogram", "question__hide": false, - "total_acs": 392824, - "total_submitted": 863640, - "total_column_articles": 2177, + "total_acs": 400913, + "total_submitted": 879899, + "total_column_articles": 2227, "frontend_question_id": "84", "is_new_question": false }, @@ -70761,9 +71265,9 @@ "question__title": "Remove Duplicates from Sorted List", "question__title_slug": "remove-duplicates-from-sorted-list", "question__hide": false, - "total_acs": 669293, - "total_submitted": 1246836, - "total_column_articles": 3998, + "total_acs": 678664, + "total_submitted": 1262948, + "total_column_articles": 4042, "frontend_question_id": "83", "is_new_question": false }, @@ -70782,9 +71286,9 @@ "question__title": "Remove Duplicates from Sorted List II", "question__title_slug": "remove-duplicates-from-sorted-list-ii", "question__hide": false, - "total_acs": 413917, - "total_submitted": 764088, - "total_column_articles": 3156, + "total_acs": 422261, + "total_submitted": 778876, + "total_column_articles": 3193, "frontend_question_id": "82", "is_new_question": false }, @@ -70803,9 +71307,9 @@ "question__title": "Search in Rotated Sorted Array II", "question__title_slug": "search-in-rotated-sorted-array-ii", "question__hide": false, - "total_acs": 215335, - "total_submitted": 524814, - "total_column_articles": 1554, + "total_acs": 217357, + "total_submitted": 529568, + "total_column_articles": 1563, "frontend_question_id": "81", "is_new_question": false }, @@ -70824,9 +71328,9 @@ "question__title": "Remove Duplicates from Sorted Array II", "question__title_slug": "remove-duplicates-from-sorted-array-ii", "question__hide": false, - "total_acs": 347218, - "total_submitted": 563652, - "total_column_articles": 2651, + "total_acs": 365977, + "total_submitted": 594169, + "total_column_articles": 2748, "frontend_question_id": "80", "is_new_question": false }, @@ -70845,9 +71349,9 @@ "question__title": "Word Search", "question__title_slug": "word-search", "question__hide": false, - "total_acs": 491135, - "total_submitted": 1051551, - "total_column_articles": 2830, + "total_acs": 502495, + "total_submitted": 1074553, + "total_column_articles": 2890, "frontend_question_id": "79", "is_new_question": false }, @@ -70866,9 +71370,9 @@ "question__title": "Subsets", "question__title_slug": "subsets", "question__hide": false, - "total_acs": 735553, - "total_submitted": 905376, - "total_column_articles": 4645, + "total_acs": 753931, + "total_submitted": 928032, + "total_column_articles": 4729, "frontend_question_id": "78", "is_new_question": false }, @@ -70887,9 +71391,9 @@ "question__title": "Combinations", "question__title_slug": "combinations", "question__hide": false, - "total_acs": 659090, - "total_submitted": 855620, - "total_column_articles": 3181, + "total_acs": 677388, + "total_submitted": 880404, + "total_column_articles": 3232, "frontend_question_id": "77", "is_new_question": false }, @@ -70908,9 +71412,9 @@ "question__title": "Minimum Window Substring", "question__title_slug": "minimum-window-substring", "question__hide": false, - "total_acs": 520992, - "total_submitted": 1142734, - "total_column_articles": 3896, + "total_acs": 537676, + "total_submitted": 1179406, + "total_column_articles": 3977, "frontend_question_id": "76", "is_new_question": false }, @@ -70929,9 +71433,9 @@ "question__title": "Sort Colors", "question__title_slug": "sort-colors", "question__hide": false, - "total_acs": 604058, - "total_submitted": 991515, - "total_column_articles": 3898, + "total_acs": 614979, + "total_submitted": 1007781, + "total_column_articles": 3948, "frontend_question_id": "75", "is_new_question": false }, @@ -70950,9 +71454,9 @@ "question__title": "Search a 2D Matrix", "question__title_slug": "search-a-2d-matrix", "question__hide": false, - "total_acs": 370043, - "total_submitted": 749415, - "total_column_articles": 3239, + "total_acs": 382173, + "total_submitted": 772712, + "total_column_articles": 3297, "frontend_question_id": "74", "is_new_question": false }, @@ -70971,9 +71475,9 @@ "question__title": "Set Matrix Zeroes", "question__title_slug": "set-matrix-zeroes", "question__hide": false, - "total_acs": 322748, - "total_submitted": 493008, - "total_column_articles": 2128, + "total_acs": 338227, + "total_submitted": 513376, + "total_column_articles": 2197, "frontend_question_id": "73", "is_new_question": false }, @@ -70992,9 +71496,9 @@ "question__title": "Edit Distance", "question__title_slug": "edit-distance", "question__hide": false, - "total_acs": 444626, - "total_submitted": 707528, - "total_column_articles": 3380, + "total_acs": 458038, + "total_submitted": 729084, + "total_column_articles": 3410, "frontend_question_id": "72", "is_new_question": false }, @@ -71013,9 +71517,9 @@ "question__title": "Simplify Path", "question__title_slug": "simplify-path", "question__hide": false, - "total_acs": 216660, - "total_submitted": 484460, - "total_column_articles": 1833, + "total_acs": 221883, + "total_submitted": 495542, + "total_column_articles": 1853, "frontend_question_id": "71", "is_new_question": false }, @@ -71034,9 +71538,9 @@ "question__title": "Climbing Stairs", "question__title_slug": "climbing-stairs", "question__hide": false, - "total_acs": 1380519, - "total_submitted": 2538188, - "total_column_articles": 7094, + "total_acs": 1414127, + "total_submitted": 2597815, + "total_column_articles": 7203, "frontend_question_id": "70", "is_new_question": false }, @@ -71055,9 +71559,9 @@ "question__title": "Sqrt(x)", "question__title_slug": "sqrtx", "question__hide": false, - "total_acs": 857305, - "total_submitted": 2226065, - "total_column_articles": 4237, + "total_acs": 873253, + "total_submitted": 2267905, + "total_column_articles": 4288, "frontend_question_id": "69", "is_new_question": false }, @@ -71076,9 +71580,9 @@ "question__title": "Text Justification", "question__title_slug": "text-justification", "question__hide": false, - "total_acs": 70513, - "total_submitted": 131669, - "total_column_articles": 959, + "total_acs": 73122, + "total_submitted": 136342, + "total_column_articles": 978, "frontend_question_id": "68", "is_new_question": false }, @@ -71097,9 +71601,9 @@ "question__title": "Add Binary", "question__title_slug": "add-binary", "question__hide": false, - "total_acs": 375974, - "total_submitted": 709257, - "total_column_articles": 3314, + "total_acs": 383517, + "total_submitted": 723620, + "total_column_articles": 3359, "frontend_question_id": "67", "is_new_question": false }, @@ -71118,9 +71622,9 @@ "question__title": "Plus One", "question__title_slug": "plus-one", "question__hide": false, - "total_acs": 714166, - "total_submitted": 1568334, - "total_column_articles": 6316, + "total_acs": 725159, + "total_submitted": 1589943, + "total_column_articles": 6386, "frontend_question_id": "66", "is_new_question": false }, @@ -71139,9 +71643,9 @@ "question__title": "Valid Number", "question__title_slug": "valid-number", "question__hide": false, - "total_acs": 71119, - "total_submitted": 257174, - "total_column_articles": 972, + "total_acs": 71745, + "total_submitted": 259258, + "total_column_articles": 973, "frontend_question_id": "65", "is_new_question": false }, @@ -71160,9 +71664,9 @@ "question__title": "Minimum Path Sum", "question__title_slug": "minimum-path-sum", "question__hide": false, - "total_acs": 563154, - "total_submitted": 804045, - "total_column_articles": 3705, + "total_acs": 576759, + "total_submitted": 822228, + "total_column_articles": 3756, "frontend_question_id": "64", "is_new_question": false }, @@ -71181,9 +71685,9 @@ "question__title": "Unique Paths II", "question__title_slug": "unique-paths-ii", "question__hide": false, - "total_acs": 453051, - "total_submitted": 1098084, - "total_column_articles": 3352, + "total_acs": 465680, + "total_submitted": 1128086, + "total_column_articles": 3421, "frontend_question_id": "63", "is_new_question": false }, @@ -71202,9 +71706,9 @@ "question__title": "Unique Paths", "question__title_slug": "unique-paths", "question__hide": false, - "total_acs": 734583, - "total_submitted": 1079771, - "total_column_articles": 4653, + "total_acs": 752866, + "total_submitted": 1105645, + "total_column_articles": 4729, "frontend_question_id": "62", "is_new_question": false }, @@ -71223,9 +71727,9 @@ "question__title": "Rotate List", "question__title_slug": "rotate-list", "question__hide": false, - "total_acs": 360573, - "total_submitted": 871755, - "total_column_articles": 3327, + "total_acs": 367255, + "total_submitted": 888321, + "total_column_articles": 3364, "frontend_question_id": "61", "is_new_question": false }, @@ -71244,9 +71748,9 @@ "question__title": "Permutation Sequence", "question__title_slug": "permutation-sequence", "question__hide": false, - "total_acs": 138370, - "total_submitted": 257993, - "total_column_articles": 1518, + "total_acs": 139313, + "total_submitted": 259740, + "total_column_articles": 1523, "frontend_question_id": "60", "is_new_question": false }, @@ -71265,9 +71769,9 @@ "question__title": "Spiral Matrix II", "question__title_slug": "spiral-matrix-ii", "question__hide": false, - "total_acs": 394915, - "total_submitted": 553134, - "total_column_articles": 3927, + "total_acs": 406284, + "total_submitted": 570907, + "total_column_articles": 4012, "frontend_question_id": "59", "is_new_question": false }, @@ -71286,9 +71790,9 @@ "question__title": "Length of Last Word", "question__title_slug": "length-of-last-word", "question__hide": false, - "total_acs": 533070, - "total_submitted": 1188647, - "total_column_articles": 5360, + "total_acs": 548087, + "total_submitted": 1214326, + "total_column_articles": 5455, "frontend_question_id": "58", "is_new_question": false }, @@ -71307,9 +71811,9 @@ "question__title": "Insert Interval", "question__title_slug": "insert-interval", "question__hide": false, - "total_acs": 195413, - "total_submitted": 457015, - "total_column_articles": 1699, + "total_acs": 200139, + "total_submitted": 468564, + "total_column_articles": 1721, "frontend_question_id": "57", "is_new_question": false }, @@ -71328,9 +71832,9 @@ "question__title": "Merge Intervals", "question__title_slug": "merge-intervals", "question__hide": false, - "total_acs": 793227, - "total_submitted": 1592945, - "total_column_articles": 4828, + "total_acs": 817821, + "total_submitted": 1640807, + "total_column_articles": 4928, "frontend_question_id": "56", "is_new_question": false }, @@ -71349,9 +71853,9 @@ "question__title": "Jump Game", "question__title_slug": "jump-game", "question__hide": false, - "total_acs": 878046, - "total_submitted": 2026005, - "total_column_articles": 5723, + "total_acs": 906534, + "total_submitted": 2094005, + "total_column_articles": 5911, "frontend_question_id": "55", "is_new_question": false }, @@ -71370,9 +71874,9 @@ "question__title": "Spiral Matrix", "question__title_slug": "spiral-matrix", "question__hide": false, - "total_acs": 466819, - "total_submitted": 927445, - "total_column_articles": 4542, + "total_acs": 486158, + "total_submitted": 962659, + "total_column_articles": 4692, "frontend_question_id": "54", "is_new_question": false }, @@ -71391,9 +71895,9 @@ "question__title": "Maximum Subarray", "question__title_slug": "maximum-subarray", "question__hide": false, - "total_acs": 1625930, - "total_submitted": 2944393, - "total_column_articles": 7584, + "total_acs": 1661450, + "total_submitted": 3008095, + "total_column_articles": 7713, "frontend_question_id": "53", "is_new_question": false }, @@ -71412,9 +71916,9 @@ "question__title": "N-Queens II", "question__title_slug": "n-queens-ii", "question__hide": false, - "total_acs": 140752, - "total_submitted": 170976, - "total_column_articles": 1016, + "total_acs": 143440, + "total_submitted": 174278, + "total_column_articles": 1030, "frontend_question_id": "52", "is_new_question": false }, @@ -71433,9 +71937,9 @@ "question__title": "N-Queens", "question__title_slug": "n-queens", "question__hide": false, - "total_acs": 369894, - "total_submitted": 500285, - "total_column_articles": 3328, + "total_acs": 380017, + "total_submitted": 514237, + "total_column_articles": 3395, "frontend_question_id": "51", "is_new_question": false }, @@ -71454,9 +71958,9 @@ "question__title": "Pow(x, n)", "question__title_slug": "powx-n", "question__hide": false, - "total_acs": 428432, - "total_submitted": 1123081, - "total_column_articles": 2318, + "total_acs": 436766, + "total_submitted": 1143558, + "total_column_articles": 2348, "frontend_question_id": "50", "is_new_question": false }, @@ -71475,9 +71979,9 @@ "question__title": "Group Anagrams", "question__title_slug": "group-anagrams", "question__hide": false, - "total_acs": 625630, - "total_submitted": 921370, - "total_column_articles": 3184, + "total_acs": 656075, + "total_submitted": 965757, + "total_column_articles": 3296, "frontend_question_id": "49", "is_new_question": false }, @@ -71496,9 +72000,9 @@ "question__title": "Rotate Image", "question__title_slug": "rotate-image", "question__hide": false, - "total_acs": 535178, - "total_submitted": 707639, - "total_column_articles": 4943, + "total_acs": 550302, + "total_submitted": 725954, + "total_column_articles": 5057, "frontend_question_id": "48", "is_new_question": false }, @@ -71517,9 +72021,9 @@ "question__title": "Permutations II", "question__title_slug": "permutations-ii", "question__hide": false, - "total_acs": 526295, - "total_submitted": 801162, - "total_column_articles": 3105, + "total_acs": 535962, + "total_submitted": 815915, + "total_column_articles": 3139, "frontend_question_id": "47", "is_new_question": false }, @@ -71538,9 +72042,9 @@ "question__title": "Permutations", "question__title_slug": "permutations", "question__hide": false, - "total_acs": 1010433, - "total_submitted": 1277861, - "total_column_articles": 6250, + "total_acs": 1034935, + "total_submitted": 1308368, + "total_column_articles": 6327, "frontend_question_id": "46", "is_new_question": false }, @@ -71559,9 +72063,9 @@ "question__title": "Jump Game II", "question__title_slug": "jump-game-ii", "question__hide": false, - "total_acs": 635405, - "total_submitted": 1423423, - "total_column_articles": 3980, + "total_acs": 659945, + "total_submitted": 1482052, + "total_column_articles": 4087, "frontend_question_id": "45", "is_new_question": false }, @@ -71580,9 +72084,9 @@ "question__title": "Wildcard Matching", "question__title_slug": "wildcard-matching", "question__hide": false, - "total_acs": 151504, - "total_submitted": 446502, - "total_column_articles": 961, + "total_acs": 152961, + "total_submitted": 450535, + "total_column_articles": 967, "frontend_question_id": "44", "is_new_question": false }, @@ -71601,9 +72105,9 @@ "question__title": "Multiply Strings", "question__title_slug": "multiply-strings", "question__hide": false, - "total_acs": 331221, - "total_submitted": 747247, - "total_column_articles": 2231, + "total_acs": 335478, + "total_submitted": 757107, + "total_column_articles": 2256, "frontend_question_id": "43", "is_new_question": false }, @@ -71622,9 +72126,9 @@ "question__title": "Trapping Rain Water", "question__title_slug": "trapping-rain-water", "question__hide": false, - "total_acs": 873390, - "total_submitted": 1380206, - "total_column_articles": 5246, + "total_acs": 903523, + "total_submitted": 1427082, + "total_column_articles": 5384, "frontend_question_id": "42", "is_new_question": false }, @@ -71643,9 +72147,9 @@ "question__title": "First Missing Positive", "question__title_slug": "first-missing-positive", "question__hide": false, - "total_acs": 357071, - "total_submitted": 810856, - "total_column_articles": 2506, + "total_acs": 368644, + "total_submitted": 833586, + "total_column_articles": 2563, "frontend_question_id": "41", "is_new_question": false }, @@ -71664,9 +72168,9 @@ "question__title": "Combination Sum II", "question__title_slug": "combination-sum-ii", "question__hide": false, - "total_acs": 499408, - "total_submitted": 838748, - "total_column_articles": 2998, + "total_acs": 509322, + "total_submitted": 856126, + "total_column_articles": 3035, "frontend_question_id": "40", "is_new_question": false }, @@ -71685,9 +72189,9 @@ "question__title": "Combination Sum", "question__title_slug": "combination-sum", "question__hide": false, - "total_acs": 866498, - "total_submitted": 1196027, - "total_column_articles": 4301, + "total_acs": 888574, + "total_submitted": 1226573, + "total_column_articles": 4369, "frontend_question_id": "39", "is_new_question": false }, @@ -71706,9 +72210,9 @@ "question__title": "Count and Say", "question__title_slug": "count-and-say", "question__hide": false, - "total_acs": 361042, - "total_submitted": 594687, - "total_column_articles": 3419, + "total_acs": 363274, + "total_submitted": 598138, + "total_column_articles": 3432, "frontend_question_id": "38", "is_new_question": false }, @@ -71727,9 +72231,9 @@ "question__title": "Sudoku Solver", "question__title_slug": "sudoku-solver", "question__hide": false, - "total_acs": 238200, - "total_submitted": 352021, - "total_column_articles": 1741, + "total_acs": 242077, + "total_submitted": 357621, + "total_column_articles": 1761, "frontend_question_id": "37", "is_new_question": false }, @@ -71748,9 +72252,9 @@ "question__title": "Valid Sudoku", "question__title_slug": "valid-sudoku", "question__hide": false, - "total_acs": 419989, - "total_submitted": 663460, - "total_column_articles": 2863, + "total_acs": 426640, + "total_submitted": 673609, + "total_column_articles": 2903, "frontend_question_id": "36", "is_new_question": false }, @@ -71769,9 +72273,9 @@ "question__title": "Search Insert Position", "question__title_slug": "search-insert-position", "question__hide": false, - "total_acs": 1355561, - "total_submitted": 2958095, - "total_column_articles": 8362, + "total_acs": 1385405, + "total_submitted": 3012094, + "total_column_articles": 8470, "frontend_question_id": "35", "is_new_question": false }, @@ -71790,9 +72294,9 @@ "question__title": "Find First and Last Position of Element in Sorted Array", "question__title_slug": "find-first-and-last-position-of-element-in-sorted-array", "question__hide": false, - "total_acs": 927090, - "total_submitted": 2151438, - "total_column_articles": 8232, + "total_acs": 947840, + "total_submitted": 2193620, + "total_column_articles": 8350, "frontend_question_id": "34", "is_new_question": false }, @@ -71811,9 +72315,9 @@ "question__title": "Search in Rotated Sorted Array", "question__title_slug": "search-in-rotated-sorted-array", "question__hide": false, - "total_acs": 836763, - "total_submitted": 1896804, - "total_column_articles": 5058, + "total_acs": 853928, + "total_submitted": 1933266, + "total_column_articles": 5127, "frontend_question_id": "33", "is_new_question": false }, @@ -71832,9 +72336,9 @@ "question__title": "Longest Valid Parentheses", "question__title_slug": "longest-valid-parentheses", "question__hide": false, - "total_acs": 425338, - "total_submitted": 1128229, - "total_column_articles": 2518, + "total_acs": 433045, + "total_submitted": 1146291, + "total_column_articles": 2560, "frontend_question_id": "32", "is_new_question": false }, @@ -71853,9 +72357,9 @@ "question__title": "Next Permutation", "question__title_slug": "next-permutation", "question__hide": false, - "total_acs": 489453, - "total_submitted": 1257188, - "total_column_articles": 3479, + "total_acs": 498670, + "total_submitted": 1277333, + "total_column_articles": 3528, "frontend_question_id": "31", "is_new_question": false }, @@ -71874,9 +72378,9 @@ "question__title": "Substring with Concatenation of All Words", "question__title_slug": "substring-with-concatenation-of-all-words", "question__hide": false, - "total_acs": 192702, - "total_submitted": 492125, - "total_column_articles": 1470, + "total_acs": 196828, + "total_submitted": 503808, + "total_column_articles": 1494, "frontend_question_id": "30", "is_new_question": false }, @@ -71895,9 +72399,9 @@ "question__title": "Divide Two Integers", "question__title_slug": "divide-two-integers", "question__hide": false, - "total_acs": 231479, - "total_submitted": 1038201, - "total_column_articles": 1706, + "total_acs": 233570, + "total_submitted": 1047550, + "total_column_articles": 1718, "frontend_question_id": "29", "is_new_question": false }, @@ -71916,9 +72420,9 @@ "question__title": "Find the Index of the First Occurrence in a String", "question__title_slug": "find-the-index-of-the-first-occurrence-in-a-string", "question__hide": false, - "total_acs": 1007889, - "total_submitted": 2324652, - "total_column_articles": 6839, + "total_acs": 1031495, + "total_submitted": 2372517, + "total_column_articles": 6976, "frontend_question_id": "28", "is_new_question": false }, @@ -71937,9 +72441,9 @@ "question__title": "Remove Element", "question__title_slug": "remove-element", "question__hide": false, - "total_acs": 1395687, - "total_submitted": 2353148, - "total_column_articles": 9545, + "total_acs": 1443810, + "total_submitted": 2430746, + "total_column_articles": 9782, "frontend_question_id": "27", "is_new_question": false }, @@ -71958,9 +72462,9 @@ "question__title": "Remove Duplicates from Sorted Array", "question__title_slug": "remove-duplicates-from-sorted-array", "question__hide": false, - "total_acs": 1763764, - "total_submitted": 3157649, - "total_column_articles": 9757, + "total_acs": 1801500, + "total_submitted": 3214845, + "total_column_articles": 9946, "frontend_question_id": "26", "is_new_question": false }, @@ -71979,9 +72483,9 @@ "question__title": "Reverse Nodes in k-Group", "question__title_slug": "reverse-nodes-in-k-group", "question__hide": false, - "total_acs": 555152, - "total_submitted": 818688, - "total_column_articles": 4415, + "total_acs": 571258, + "total_submitted": 842184, + "total_column_articles": 4520, "frontend_question_id": "25", "is_new_question": false }, @@ -72000,9 +72504,9 @@ "question__title": "Swap Nodes in Pairs", "question__title_slug": "swap-nodes-in-pairs", "question__hide": false, - "total_acs": 786453, - "total_submitted": 1092511, - "total_column_articles": 5257, + "total_acs": 810182, + "total_submitted": 1124151, + "total_column_articles": 5357, "frontend_question_id": "24", "is_new_question": false }, @@ -72021,9 +72525,9 @@ "question__title": "Merge k Sorted Lists", "question__title_slug": "merge-k-sorted-lists", "question__hide": false, - "total_acs": 762027, - "total_submitted": 1290805, - "total_column_articles": 4776, + "total_acs": 777583, + "total_submitted": 1313001, + "total_column_articles": 4845, "frontend_question_id": "23", "is_new_question": false }, @@ -72042,9 +72546,9 @@ "question__title": "Generate Parentheses", "question__title_slug": "generate-parentheses", "question__hide": false, - "total_acs": 797102, - "total_submitted": 1027231, - "total_column_articles": 5168, + "total_acs": 812868, + "total_submitted": 1047202, + "total_column_articles": 5252, "frontend_question_id": "22", "is_new_question": false }, @@ -72063,9 +72567,9 @@ "question__title": "Merge Two Sorted Lists", "question__title_slug": "merge-two-sorted-lists", "question__hide": false, - "total_acs": 1613940, - "total_submitted": 2433301, - "total_column_articles": 8016, + "total_acs": 1648221, + "total_submitted": 2482756, + "total_column_articles": 8127, "frontend_question_id": "21", "is_new_question": false }, @@ -72084,9 +72588,9 @@ "question__title": "Valid Parentheses", "question__title_slug": "valid-parentheses", "question__hide": false, - "total_acs": 1716871, - "total_submitted": 3910453, - "total_column_articles": 10687, + "total_acs": 1751126, + "total_submitted": 3987661, + "total_column_articles": 10826, "frontend_question_id": "20", "is_new_question": false }, @@ -72105,9 +72609,9 @@ "question__title": "Remove Nth Node From End of List", "question__title_slug": "remove-nth-node-from-end-of-list", "question__hide": false, - "total_acs": 1330864, - "total_submitted": 2815535, - "total_column_articles": 8789, + "total_acs": 1364295, + "total_submitted": 2866796, + "total_column_articles": 8937, "frontend_question_id": "19", "is_new_question": false }, @@ -72126,9 +72630,9 @@ "question__title": "4Sum", "question__title_slug": "4sum", "question__hide": false, - "total_acs": 555472, - "total_submitted": 1514462, - "total_column_articles": 3275, + "total_acs": 566668, + "total_submitted": 1546801, + "total_column_articles": 3323, "frontend_question_id": "18", "is_new_question": false }, @@ -72147,9 +72651,9 @@ "question__title": "Letter Combinations of a Phone Number", "question__title_slug": "letter-combinations-of-a-phone-number", "question__hide": false, - "total_acs": 820215, - "total_submitted": 1387001, - "total_column_articles": 6114, + "total_acs": 840396, + "total_submitted": 1417335, + "total_column_articles": 6205, "frontend_question_id": "17", "is_new_question": false }, @@ -72168,9 +72672,9 @@ "question__title": "3Sum Closest", "question__title_slug": "3sum-closest", "question__hide": false, - "total_acs": 543073, - "total_submitted": 1211409, - "total_column_articles": 2790, + "total_acs": 549232, + "total_submitted": 1226041, + "total_column_articles": 2821, "frontend_question_id": "16", "is_new_question": false }, @@ -72189,9 +72693,9 @@ "question__title": "3Sum", "question__title_slug": "3sum", "question__hide": false, - "total_acs": 1669150, - "total_submitted": 4424902, - "total_column_articles": 6829, + "total_acs": 1714538, + "total_submitted": 4536967, + "total_column_articles": 6987, "frontend_question_id": "15", "is_new_question": false }, @@ -72210,9 +72714,9 @@ "question__title": "Longest Common Prefix", "question__title_slug": "longest-common-prefix", "question__hide": false, - "total_acs": 1251261, - "total_submitted": 2856524, - "total_column_articles": 7500, + "total_acs": 1271528, + "total_submitted": 2898290, + "total_column_articles": 7589, "frontend_question_id": "14", "is_new_question": false }, @@ -72231,9 +72735,9 @@ "question__title": "Roman to Integer", "question__title_slug": "roman-to-integer", "question__hide": false, - "total_acs": 962528, - "total_submitted": 1538048, - "total_column_articles": 7510, + "total_acs": 980265, + "total_submitted": 1563968, + "total_column_articles": 7615, "frontend_question_id": "13", "is_new_question": false }, @@ -72252,9 +72756,9 @@ "question__title": "Integer to Roman", "question__title_slug": "integer-to-roman", "question__hide": false, - "total_acs": 450765, - "total_submitted": 674375, - "total_column_articles": 3374, + "total_acs": 460106, + "total_submitted": 687570, + "total_column_articles": 3423, "frontend_question_id": "12", "is_new_question": false }, @@ -72273,9 +72777,9 @@ "question__title": "Container With Most Water", "question__title_slug": "container-with-most-water", "question__hide": false, - "total_acs": 1196157, - "total_submitted": 1991683, - "total_column_articles": 6311, + "total_acs": 1230778, + "total_submitted": 2049245, + "total_column_articles": 6443, "frontend_question_id": "11", "is_new_question": false }, @@ -72294,9 +72798,9 @@ "question__title": "Regular Expression Matching", "question__title_slug": "regular-expression-matching", "question__hide": false, - "total_acs": 407523, - "total_submitted": 1326726, - "total_column_articles": 2359, + "total_acs": 411348, + "total_submitted": 1339781, + "total_column_articles": 2373, "frontend_question_id": "10", "is_new_question": false }, @@ -72315,9 +72819,9 @@ "question__title": "Palindrome Number", "question__title_slug": "palindrome-number", "question__hide": false, - "total_acs": 1558678, - "total_submitted": 2786669, - "total_column_articles": 9197, + "total_acs": 1579203, + "total_submitted": 2822374, + "total_column_articles": 9285, "frontend_question_id": "9", "is_new_question": false }, @@ -72336,9 +72840,9 @@ "question__title": "String to Integer (atoi)", "question__title_slug": "string-to-integer-atoi", "question__hide": false, - "total_acs": 628301, - "total_submitted": 2965161, - "total_column_articles": 4589, + "total_acs": 634707, + "total_submitted": 2995428, + "total_column_articles": 4616, "frontend_question_id": "8", "is_new_question": false }, @@ -72357,9 +72861,9 @@ "question__title": "Reverse Integer", "question__title_slug": "reverse-integer", "question__hide": false, - "total_acs": 1276605, - "total_submitted": 3599993, - "total_column_articles": 7618, + "total_acs": 1285045, + "total_submitted": 3623370, + "total_column_articles": 7662, "frontend_question_id": "7", "is_new_question": false }, @@ -72378,9 +72882,9 @@ "question__title": "Zigzag Conversion", "question__title_slug": "zigzag-conversion", "question__hide": false, - "total_acs": 648763, - "total_submitted": 1233473, - "total_column_articles": 5103, + "total_acs": 659829, + "total_submitted": 1252752, + "total_column_articles": 5178, "frontend_question_id": "6", "is_new_question": false }, @@ -72399,9 +72903,9 @@ "question__title": "Longest Palindromic Substring", "question__title_slug": "longest-palindromic-substring", "question__hide": false, - "total_acs": 1624114, - "total_submitted": 4264932, - "total_column_articles": 8397, + "total_acs": 1650438, + "total_submitted": 4325037, + "total_column_articles": 8518, "frontend_question_id": "5", "is_new_question": false }, @@ -72420,9 +72924,9 @@ "question__title": "Median of Two Sorted Arrays", "question__title_slug": "median-of-two-sorted-arrays", "question__hide": false, - "total_acs": 1073757, - "total_submitted": 2557135, - "total_column_articles": 7583, + "total_acs": 1088352, + "total_submitted": 2587220, + "total_column_articles": 7658, "frontend_question_id": "4", "is_new_question": false }, @@ -72441,9 +72945,9 @@ "question__title": "Longest Substring Without Repeating Characters", "question__title_slug": "longest-substring-without-repeating-characters", "question__hide": false, - "total_acs": 2706962, - "total_submitted": 6846201, - "total_column_articles": 15248, + "total_acs": 2758981, + "total_submitted": 6963799, + "total_column_articles": 15497, "frontend_question_id": "3", "is_new_question": false }, @@ -72462,9 +72966,9 @@ "question__title": "Add Two Numbers", "question__title_slug": "add-two-numbers", "question__hide": false, - "total_acs": 1989869, - "total_submitted": 4597699, - "total_column_articles": 13279, + "total_acs": 2021783, + "total_submitted": 4657745, + "total_column_articles": 13447, "frontend_question_id": "2", "is_new_question": false }, @@ -72483,9 +72987,9 @@ "question__title": "Two Sum", "question__title_slug": "two-sum", "question__hide": false, - "total_acs": 5199855, - "total_submitted": 9747608, - "total_column_articles": 23952, + "total_acs": 5283674, + "total_submitted": 9882544, + "total_column_articles": 24195, "frontend_question_id": "1", "is_new_question": false }, diff --git a/leetcode-cn/originData/[no content]find-trending-hashtags.json b/leetcode-cn/originData/[no content]find-trending-hashtags.json new file mode 100644 index 00000000..61eda050 --- /dev/null +++ b/leetcode-cn/originData/[no content]find-trending-hashtags.json @@ -0,0 +1,56 @@ +{ + "data": { + "question": { + "questionId": "3392", + "questionFrontendId": "3087", + "categoryTitle": "Database", + "boundTopicId": 2693470, + "title": "Find Trending Hashtags", + "titleSlug": "find-trending-hashtags", + "content": null, + "translatedTitle": "查找热门话题标签", + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"31\", \"totalSubmission\": \"63\", \"totalAcceptedRaw\": 31, \"totalSubmissionRaw\": 63, \"acRate\": \"49.2%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\":{\"Tweets\":[\"user_id\",\"tweet_id\",\"tweet\",\"tweet_date\"]},\"rows\":{\"Tweets\":[[135,13,\"Enjoying a great start to the day. #HappyDay\",\"2024-02-01\"],[136,14,\"Another #HappyDay with good \",\"2024-02-03\"],[137,15,\"Productivity peaks! #WorkLife\",\"2024-02-04\"],[138,16,\"Exploring new tech frontiers. #TechLife\",\"2024-02-04\"],[139,17,\"Gratitude for today's moments. #HappyDay\",\"2024-02-05\"],[140,18,\"Innovation drives us. #TechLife\",\"2024-02-07\"],[141,19,\"Connecting with nature's serenity. #Nature\",\"2024-02-09\"]]}}", + "metaData": "{\"mysql\":[\"Create table If Not Exists Tweets (user_id int, tweet_id int, tweet_date date, tweet varchar(100))\"],\"mssql\":[\"Create table Tweets (user_id int, tweet_id int, tweet_date date, tweet varchar(100))\"],\"oraclesql\":[\"Create table Tweets (user_id int, tweet_id int, tweet_date date, tweet varchar(100))\",\"ALTER SESSION SET nls_date_format='YYYY-MM-DD'\"],\"database\":true,\"name\":\"find_trending_hashtags\",\"postgresql\":[\"CREATE TABLE Tweets (\\n user_id INT,\\n tweet_id INT,\\n tweet_date DATE,\\n tweet VARCHAR(100)\\n);\",\"SET DateStyle = 'ISO, MDY';\"],\"pythondata\":[\"Tweets = pd.DataFrame([], columns=['user_id', 'tweet_id', 'tweet_date', 'tweet']).astype({'user_id':'Int64', 'tweet_id':'Int64', 'tweet_date':'datetime64[ns]', 'tweet':'object'})\\n\"],\"database_schema\":{\"Tweets\":{\"user_id\":\"INT\",\"tweet_id\":\"INT\",\"tweet_date\":\"DATE\",\"tweet\":\"VARCHAR(100)\"}}}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "Create table If Not Exists Tweets (user_id int, tweet_id int, tweet_date date, tweet varchar(100))", + "Truncate table Tweets", + "insert into Tweets (user_id, tweet_id, tweet, tweet_date) values ('135', '13', 'Enjoying a great start to the day. #HappyDay', '2024-02-01')", + "insert into Tweets (user_id, tweet_id, tweet, tweet_date) values ('136', '14', 'Another #HappyDay with good ', '2024-02-03')", + "insert into Tweets (user_id, tweet_id, tweet, tweet_date) values ('137', '15', 'Productivity peaks! #WorkLife', '2024-02-04')", + "insert into Tweets (user_id, tweet_id, tweet, tweet_date) values ('138', '16', 'Exploring new tech frontiers. #TechLife', '2024-02-04')", + "insert into Tweets (user_id, tweet_id, tweet, tweet_date) values ('139', '17', 'Gratitude for today's moments. #HappyDay', '2024-02-05')", + "insert into Tweets (user_id, tweet_id, tweet, tweet_date) values ('140', '18', 'Innovation drives us. #TechLife', '2024-02-07')", + "insert into Tweets (user_id, tweet_id, tweet, tweet_date) values ('141', '19', 'Connecting with nature's serenity. #Nature', '2024-02-09')" + ], + "enableRunCode": true, + "envInfo": "{\"mysql\":[\"MySQL\",\"

\\u7248\\u672c\\uff1aMySQL 8.0<\\/code><\\/p>\"],\"mssql\":[\"MS SQL Server\",\"

mssql server 2019.<\\/p>\"],\"oraclesql\":[\"Oracle\",\"

Oracle Sql 11.2.<\\/p>\"],\"pythondata\":[\"Pandas\",\"

Python 3.10 with Pandas 2.0.2 and NumPy 1.25.0<\\/p>\"],\"postgresql\":[\"PostgreSQL\",\"

PostgreSQL 16<\\/p>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "{\"headers\":{\"Tweets\":[\"user_id\",\"tweet_id\",\"tweet\",\"tweet_date\"]},\"rows\":{\"Tweets\":[[135,13,\"Enjoying a great start to the day. #HappyDay\",\"2024-02-01\"],[136,14,\"Another #HappyDay with good \",\"2024-02-03\"],[137,15,\"Productivity peaks! #WorkLife\",\"2024-02-04\"],[138,16,\"Exploring new tech frontiers. #TechLife\",\"2024-02-04\"],[139,17,\"Gratitude for today's moments. #HappyDay\",\"2024-02-05\"],[140,18,\"Innovation drives us. #TechLife\",\"2024-02-07\"],[141,19,\"Connecting with nature's serenity. #Nature\",\"2024-02-09\"]]}}", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/[no content]make-string-anti-palindrome.json b/leetcode-cn/originData/[no content]make-string-anti-palindrome.json new file mode 100644 index 00000000..e8a69c1d --- /dev/null +++ b/leetcode-cn/originData/[no content]make-string-anti-palindrome.json @@ -0,0 +1,49 @@ +{ + "data": { + "question": { + "questionId": "3393", + "questionFrontendId": "3088", + "categoryTitle": "Algorithms", + "boundTopicId": 2699312, + "title": "Make String Anti-palindrome", + "titleSlug": "make-string-anti-palindrome", + "content": null, + "translatedTitle": "使字符串反回文", + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Hard", + "likes": 0, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"160\", \"totalSubmission\": \"181\", \"totalAcceptedRaw\": 160, \"totalSubmissionRaw\": 181, \"acRate\": \"88.4%\"}", + "hints": [ + "Sort the string.", + "Check if there are equivalent characters in the middle, if there are, shift the ones from the right side more to the right until they don't overlap." + ], + "solution": null, + "status": null, + "sampleTestCase": "\"abca\"", + "metaData": "{\n \"name\": \"makeAntiPalindrome\",\n \"params\": [\n {\n \"name\": \"s\",\n \"type\": \"string\"\n }\n ],\n \"return\": {\n \"type\": \"string\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n

\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n

\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"

\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n

\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n

\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"

\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n

\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n

\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"

\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n

\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n

\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n

\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n

1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n

\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.0.6<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "\"abca\"\n\"abba\"\n\"cccd\"",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/[no content]match-alphanumerical-pattern-in-matrix-i.json b/leetcode-cn/originData/[no content]match-alphanumerical-pattern-in-matrix-i.json
new file mode 100644
index 00000000..8f241073
--- /dev/null
+++ b/leetcode-cn/originData/[no content]match-alphanumerical-pattern-in-matrix-i.json	
@@ -0,0 +1,73 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3385",
+            "questionFrontendId": "3078",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2685845,
+            "title": "Match Alphanumerical Pattern in Matrix I",
+            "titleSlug": "match-alphanumerical-pattern-in-matrix-i",
+            "content": null,
+            "translatedTitle": "矩阵中的字母数字模式匹配 I",
+            "translatedContent": null,
+            "isPaidOnly": true,
+            "difficulty": "Medium",
+            "likes": 0,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": null,
+            "topicTags": [
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Hash Table",
+                    "slug": "hash-table",
+                    "translatedName": "哈希表",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "String",
+                    "slug": "string",
+                    "translatedName": "字符串",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Matrix",
+                    "slug": "matrix",
+                    "translatedName": "矩阵",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": null,
+            "stats": "{\"totalAccepted\": \"31\", \"totalSubmission\": \"39\", \"totalAcceptedRaw\": 31, \"totalSubmissionRaw\": 39, \"acRate\": \"79.5%\"}",
+            "hints": [
+                "Use brute force and check all the possible submatrices."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[[1,2,2],[2,2,3],[2,3,3]]\n[\"ab\",\"bb\"]",
+            "metaData": "{\n  \"name\": \"findPattern\",\n  \"params\": [\n    {\n      \"name\": \"board\",\n      \"type\": \"integer[][]\"\n    },\n    {\n      \"type\": \"string[]\",\n      \"name\": \"pattern\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"integer[]\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.0.6<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[[1,2,2],[2,2,3],[2,3,3]]\n[\"ab\",\"bb\"]\n[[1,1,2],[3,3,4],[6,6,6]]\n[\"ab\",\"66\"]\n[[1,2],[2,1]]\n[\"xx\"]",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/[no content]maximum-increasing-triplet-value.json b/leetcode-cn/originData/[no content]maximum-increasing-triplet-value.json
new file mode 100644
index 00000000..edc02249
--- /dev/null
+++ b/leetcode-cn/originData/[no content]maximum-increasing-triplet-value.json	
@@ -0,0 +1,65 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3378",
+            "questionFrontendId": "3073",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2672120,
+            "title": "Maximum Increasing Triplet Value",
+            "titleSlug": "maximum-increasing-triplet-value",
+            "content": null,
+            "translatedTitle": "最大递增三元组",
+            "translatedContent": null,
+            "isPaidOnly": true,
+            "difficulty": "Medium",
+            "likes": 0,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": null,
+            "topicTags": [
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Ordered Set",
+                    "slug": "ordered-set",
+                    "translatedName": "有序集合",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": null,
+            "stats": "{\"totalAccepted\": \"63\", \"totalSubmission\": \"93\", \"totalAcceptedRaw\": 63, \"totalSubmissionRaw\": 93, \"acRate\": \"67.7%\"}",
+            "hints": [
+                "For each element, define right[i] as the value of the greatest element with an index greater than i.",
+                "Start iterating from the beginning, define a set containing the elements seen so far.",
+                "When you are at index i, use binary search on the set to find the greatest element on the left of index i that is smaller than nums[i] and name it greatest_left.",
+                "Also check that nums[i] < right[i].",
+                "If the above conditions hold, then ans = max(ans, greatest_left - nums[i] + right[i])."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[5,6,9]",
+            "metaData": "{\n  \"name\": \"maximumTripletValue\",\n  \"params\": [\n    {\n      \"name\": \"nums\",\n      \"type\": \"integer[]\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"integer\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.0.6<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[5,6,9]",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/apple-redistribution-into-boxes.json b/leetcode-cn/originData/apple-redistribution-into-boxes.json
new file mode 100644
index 00000000..bdbedcd1
--- /dev/null
+++ b/leetcode-cn/originData/apple-redistribution-into-boxes.json
@@ -0,0 +1,183 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3334",
+            "questionFrontendId": "3074",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2674401,
+            "title": "Apple Redistribution into Boxes",
+            "titleSlug": "apple-redistribution-into-boxes",
+            "content": "
You are given an array apple of size n and an array capacity of size m.
\n\n
There are n packs where the ith pack contains apple[i] apples. There are m boxes as well, and the ith box has a capacity of capacity[i] apples.
\n\n
Return the minimum number of boxes you need to select to redistribute these n packs of apples into boxes.
\n\n
Note that, apples from the same pack can be distributed into different boxes.
\n\n
 
\n
Example 1:
\n\n
\nInput: apple = [1,3,2], capacity = [4,3,1,5,2]\nOutput: 2\nExplanation: We will use boxes with capacities 4 and 5.\nIt is possible to distribute the apples as the total capacity is greater than or equal to the total number of apples.\n
\n\n
Example 2:
\n\n
\nInput: apple = [5,5,5], capacity = [2,4,2,7]\nOutput: 4\nExplanation: We will need to use all the boxes.\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= n == apple.length <= 50
    • \n\t
  • 1 <= m == capacity.length <= 50
    • \n\t
  • 1 <= apple[i], capacity[i] <= 50
    • \n\t
  • The input is generated such that it's possible to redistribute packs of apples into boxes.
    • \n
\n",
+            "translatedTitle": "重新分装苹果",
+            "translatedContent": "
给你一个长度为 n 的数组 apple 和另一个长度为 m 的数组 capacity 。
\n\n
一共有 n 个包裹，其中第 i 个包裹中装着 apple[i] 个苹果。同时，还有 m 个箱子，第 i 个箱子的容量为 capacity[i] 个苹果。
\n\n
请你选择一些箱子来将这 n 个包裹中的苹果重新分装到箱子中，返回你需要选择的箱子的 最小 数量。
\n\n
注意，同一个包裹中的苹果可以分装到不同的箱子中。
\n\n
 
\n\n
示例 1：
\n\n
\n输入：apple = [1,3,2], capacity = [4,3,1,5,2]\n输出：2\n解释：使用容量为 4 和 5 的箱子。\n总容量大于或等于苹果的总数，所以可以完成重新分装。\n
\n\n
示例 2：
\n\n
\n输入：apple = [5,5,5], capacity = [2,4,2,7]\n输出：4\n解释：需要使用所有箱子。\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= n == apple.length <= 50
    • \n\t
  • 1 <= m == capacity.length <= 50
    • \n\t
  • 1 <= apple[i], capacity[i] <= 50
    • \n\t
  • 输入数据保证可以将包裹中的苹果重新分装到箱子中。
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Easy",
+            "likes": 2,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
+            "topicTags": [
+                {
+                    "name": "Greedy",
+                    "slug": "greedy",
+                    "translatedName": "贪心",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Sorting",
+                    "slug": "sorting",
+                    "translatedName": "排序",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    int minimumBoxes(vector& apple, vector& capacity) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public int minimumBoxes(int[] apple, int[] capacity) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def minimumBoxes(self, apple, capacity):\n        \"\"\"\n        :type apple: List[int]\n        :type capacity: List[int]\n        :rtype: int\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def minimumBoxes(self, apple: List[int], capacity: List[int]) -> int:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "int minimumBoxes(int* apple, int appleSize, int* capacity, int capacitySize) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public int MinimumBoxes(int[] apple, int[] capacity) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[]} apple\n * @param {number[]} capacity\n * @return {number}\n */\nvar minimumBoxes = function(apple, capacity) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function minimumBoxes(apple: number[], capacity: number[]): number {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[] $apple\n     * @param Integer[] $capacity\n     * @return Integer\n     */\n    function minimumBoxes($apple, $capacity) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func minimumBoxes(_ apple: [Int], _ capacity: [Int]) -> Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun minimumBoxes(apple: IntArray, capacity: IntArray): Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  int minimumBoxes(List apple, List capacity) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func minimumBoxes(apple []int, capacity []int) int {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[]} apple\n# @param {Integer[]} capacity\n# @return {Integer}\ndef minimum_boxes(apple, capacity)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def minimumBoxes(apple: Array[Int], capacity: Array[Int]): Int = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn minimum_boxes(apple: Vec, capacity: Vec) -> i32 {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (minimum-boxes apple capacity)\n  (-> (listof exact-integer?) (listof exact-integer?) exact-integer?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec minimum_boxes(Apple :: [integer()], Capacity :: [integer()]) -> integer().\nminimum_boxes(Apple, Capacity) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec minimum_boxes(apple :: [integer], capacity :: [integer]) :: integer\n  def minimum_boxes(apple, capacity) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"6.3K\", \"totalSubmission\": \"8.3K\", \"totalAcceptedRaw\": 6311, \"totalSubmissionRaw\": 8260, \"acRate\": \"76.4%\"}",
+            "hints": [
+                "Sort array capacity in non-decreasing order.",
+                "Select boxes greedily while the total capacity is smaller than the total number of apples."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[1,3,2]\n[4,3,1,5,2]",
+            "metaData": "{\n  \"name\": \"minimumBoxes\",\n  \"params\": [\n    {\n      \"name\": \"apple\",\n      \"type\": \"integer[]\"\n    },\n    {\n      \"type\": \"integer[]\",\n      \"name\": \"capacity\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"integer\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.0.6<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[1,3,2]\n[4,3,1,5,2]\n[5,5,5]\n[2,4,2,7]",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/count-pairs-of-connectable-servers-in-a-weighted-tree-network.json b/leetcode-cn/originData/count-pairs-of-connectable-servers-in-a-weighted-tree-network.json
new file mode 100644
index 00000000..b388883a
--- /dev/null
+++ b/leetcode-cn/originData/count-pairs-of-connectable-servers-in-a-weighted-tree-network.json
@@ -0,0 +1,183 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3326",
+            "questionFrontendId": "3067",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2664187,
+            "title": "Count Pairs of Connectable Servers in a Weighted Tree Network",
+            "titleSlug": "count-pairs-of-connectable-servers-in-a-weighted-tree-network",
+            "content": "
You are given an unrooted weighted tree with n vertices representing servers numbered from 0 to n - 1, an array edges where edges[i] = [ai, bi, weighti] represents a bidirectional edge between vertices ai and bi of weight weighti. You are also given an integer signalSpeed.
\n\n
Two servers a and b are connectable through a server c if:
\n\n
    \n\t
  • a < b, a != c and b != c.
    • \n\t
  • The distance from c to a is divisible by signalSpeed.
    • \n\t
  • The distance from c to b is divisible by signalSpeed.
    • \n\t
  • The path from c to b and the path from c to a do not share any edges.
    • \n
\n\n
Return an integer array count of length n where count[i] is the number of server pairs that are connectable through the server i.
\n\n
 
\n
Example 1:
\n\"\"\n
\nInput: edges = [[0,1,1],[1,2,5],[2,3,13],[3,4,9],[4,5,2]], signalSpeed = 1\nOutput: [0,4,6,6,4,0]\nExplanation: Since signalSpeed is 1, count[c] is equal to the number of pairs of paths that start at c and do not share any edges.\nIn the case of the given path graph, count[c] is equal to the number of servers to the left of c multiplied by the servers to the right of c.\n
\n\n
Example 2:
\n\"\"\n
\nInput: edges = [[0,6,3],[6,5,3],[0,3,1],[3,2,7],[3,1,6],[3,4,2]], signalSpeed = 3\nOutput: [2,0,0,0,0,0,2]\nExplanation: Through server 0, there are 2 pairs of connectable servers: (4, 5) and (4, 6).\nThrough server 6, there are 2 pairs of connectable servers: (4, 5) and (0, 5).\nIt can be shown that no two servers are connectable through servers other than 0 and 6.\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 2 <= n <= 1000
    • \n\t
  • edges.length == n - 1
    • \n\t
  • edges[i].length == 3
    • \n\t
  • 0 <= ai, bi < n
    • \n\t
  • edges[i] = [ai, bi, weighti]
    • \n\t
  • 1 <= weighti <= 106
    • \n\t
  • 1 <= signalSpeed <= 106
    • \n\t
  • The input is generated such that edges represents a valid tree.
    • \n
\n",
+            "translatedTitle": "在带权树网络中统计可连接服务器对数目",
+            "translatedContent": "
给你一棵无根带权树，树中总共有 n 个节点，分别表示 n 个服务器，服务器从 0 到 n - 1 编号。同时给你一个数组 edges ，其中 edges[i] = [ai, bi, weighti] 表示节点 ai 和 bi 之间有一条双向边，边的权值为 weighti 。再给你一个整数 signalSpeed 。
\n\n
如果两个服务器 a ，b 和 c 满足以下条件，那么我们称服务器 a 和 b 是通过服务器 c 可连接的 ：
\n\n
    \n\t
  • a < b ，a != c 且 b != c 。
    • \n\t
  • 从 c 到 a 的距离是可以被 signalSpeed 整除的。
    • \n\t
  • 从 c 到 b 的距离是可以被 signalSpeed 整除的。
    • \n\t
  • 从 c 到 b 的路径与从 c 到 a 的路径没有任何公共边。
    • \n
\n\n
请你返回一个长度为 n 的整数数组 count ，其中 count[i] 表示通过服务器 i 可连接 的服务器对的 数目 。
\n\n
 
\n\n
示例 1：
\n\n
\"\"
\n\n
\n输入：edges = [[0,1,1],[1,2,5],[2,3,13],[3,4,9],[4,5,2]], signalSpeed = 1\n输出：[0,4,6,6,4,0]\n解释：由于 signalSpeed 等于 1 ，count[c] 等于所有从 c 开始且没有公共边的路径对数目。\n在输入图中，count[c] 等于服务器 c 左边服务器数目乘以右边服务器数目。\n
\n\n
示例 2：
\n\n
\"\"
\n\n
\n输入：edges = [[0,6,3],[6,5,3],[0,3,1],[3,2,7],[3,1,6],[3,4,2]], signalSpeed = 3\n输出：[2,0,0,0,0,0,2]\n解释：通过服务器 0 ，有 2 个可连接服务器对(4, 5) 和 (4, 6) 。\n通过服务器 6 ，有 2 个可连接服务器对 (4, 5) 和 (0, 5) 。\n所有服务器对都必须通过服务器 0 或 6 才可连接，所以其他服务器对应的可连接服务器对数目都为 0 。\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 2 <= n <= 1000
    • \n\t
  • edges.length == n - 1
    • \n\t
  • edges[i].length == 3
    • \n\t
  • 0 <= ai, bi < n
    • \n\t
  • edges[i] = [ai, bi, weighti]
    • \n\t
  • 1 <= weighti <= 106
    • \n\t
  • 1 <= signalSpeed <= 106
    • \n\t
  • 输入保证 edges 构成一棵合法的树。
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Medium",
+            "likes": 5,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": false, \"java\": true, \"python\": true, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
+            "topicTags": [
+                {
+                    "name": "Tree",
+                    "slug": "tree",
+                    "translatedName": "树",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Depth-First Search",
+                    "slug": "depth-first-search",
+                    "translatedName": "深度优先搜索",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    vector countPairsOfConnectableServers(vector>& edges, int signalSpeed) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public int[] countPairsOfConnectableServers(int[][] edges, int signalSpeed) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def countPairsOfConnectableServers(self, edges, signalSpeed):\n        \"\"\"\n        :type edges: List[List[int]]\n        :type signalSpeed: int\n        :rtype: List[int]\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def countPairsOfConnectableServers(self, edges: List[List[int]], signalSpeed: int) -> List[int]:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "/**\n * Note: The returned array must be malloced, assume caller calls free().\n */\nint* countPairsOfConnectableServers(int** edges, int edgesSize, int* edgesColSize, int signalSpeed, int* returnSize) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public int[] CountPairsOfConnectableServers(int[][] edges, int signalSpeed) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[][]} edges\n * @param {number} signalSpeed\n * @return {number[]}\n */\nvar countPairsOfConnectableServers = function(edges, signalSpeed) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function countPairsOfConnectableServers(edges: number[][], signalSpeed: number): number[] {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[][] $edges\n     * @param Integer $signalSpeed\n     * @return Integer[]\n     */\n    function countPairsOfConnectableServers($edges, $signalSpeed) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func countPairsOfConnectableServers(_ edges: [[Int]], _ signalSpeed: Int) -> [Int] {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun countPairsOfConnectableServers(edges: Array, signalSpeed: Int): IntArray {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  List countPairsOfConnectableServers(List> edges, int signalSpeed) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func countPairsOfConnectableServers(edges [][]int, signalSpeed int) []int {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[][]} edges\n# @param {Integer} signal_speed\n# @return {Integer[]}\ndef count_pairs_of_connectable_servers(edges, signal_speed)\n    \nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def countPairsOfConnectableServers(edges: Array[Array[Int]], signalSpeed: Int): Array[Int] = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn count_pairs_of_connectable_servers(edges: Vec>, signal_speed: i32) -> Vec {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (count-pairs-of-connectable-servers edges signalSpeed)\n  (-> (listof (listof exact-integer?)) exact-integer? (listof exact-integer?))\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec count_pairs_of_connectable_servers(Edges :: [[integer()]], SignalSpeed :: integer()) -> [integer()].\ncount_pairs_of_connectable_servers(Edges, SignalSpeed) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec count_pairs_of_connectable_servers(edges :: [[integer]], signal_speed :: integer) :: [integer]\n  def count_pairs_of_connectable_servers(edges, signal_speed) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"2.1K\", \"totalSubmission\": \"3.3K\", \"totalAcceptedRaw\": 2100, \"totalSubmissionRaw\": 3326, \"acRate\": \"63.1%\"}",
+            "hints": [
+                "Take each node as the root of the tree, run DFS, and save for each node i, the number of nodes in the subtree rooted at i whose distance to the root is divisible by signalSpeed.",
+                "If the root has m children named c1, c2, …, cm that respectively have num[c1], num[c2], …, num[cm] nodes in their subtrees whose distance is divisible by signalSpeed. Then, there are ((S - num[ci]) * num[ci]) / 2that are connectable through the root that we have fixed, where S is the sum of num[ci]."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[[0,1,1],[1,2,5],[2,3,13],[3,4,9],[4,5,2]]\n1",
+            "metaData": "{\n  \"name\": \"countPairsOfConnectableServers\",\n  \"params\": [\n    {\n      \"name\": \"edges\",\n      \"type\": \"integer[][]\"\n    },\n    {\n      \"type\": \"integer\",\n      \"name\": \"signalSpeed\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"integer[]\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.0.6<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[[0,1,1],[1,2,5],[2,3,13],[3,4,9],[4,5,2]]\n1\n[[0,6,3],[6,5,3],[0,3,1],[3,2,7],[3,1,6],[3,4,2]]\n3",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/count-submatrices-with-top-left-element-and-sum-less-than-k.json b/leetcode-cn/originData/count-submatrices-with-top-left-element-and-sum-less-than-k.json
new file mode 100644
index 00000000..a6ae72ad
--- /dev/null
+++ b/leetcode-cn/originData/count-submatrices-with-top-left-element-and-sum-less-than-k.json
@@ -0,0 +1,180 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3338",
+            "questionFrontendId": "3070",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2662371,
+            "title": "Count Submatrices with Top-Left Element and Sum Less Than k",
+            "titleSlug": "count-submatrices-with-top-left-element-and-sum-less-than-k",
+            "content": "
You are given a 0-indexed integer matrix grid and an integer k.
\n\n
Return the number of submatrices that contain the top-left element of the grid, and have a sum less than or equal to k.
\n\n
 
\n
Example 1:
\n\"\"\n
\nInput: grid = [[7,6,3],[6,6,1]], k = 18\nOutput: 4\nExplanation: There are only 4 submatrices, shown in the image above, that contain the top-left element of grid, and have a sum less than or equal to 18.
\n\n
Example 2:
\n\"\"\n
\nInput: grid = [[7,2,9],[1,5,0],[2,6,6]], k = 20\nOutput: 6\nExplanation: There are only 6 submatrices, shown in the image above, that contain the top-left element of grid, and have a sum less than or equal to 20.\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • m == grid.length 
    • \n\t
  • n == grid[i].length
    • \n\t
  • 1 <= n, m <= 1000 
    • \n\t
  • 0 <= grid[i][j] <= 1000
    • \n\t
  • 1 <= k <= 109
    • \n
\n",
+            "translatedTitle": "元素和小于等于 k 的子矩阵的数目",
+            "translatedContent": "
给你一个下标从 0 开始的整数矩阵 grid 和一个整数 k。
\n\n
返回包含 grid 左上角元素、元素和小于或等于 k 的 子矩阵的数目。
\n\n
 
\n\n
示例 1：
\n\"\"\n
\n输入：grid = [[7,6,3],[6,6,1]], k = 18\n输出：4\n解释：如上图所示，只有 4 个子矩阵满足：包含 grid 的左上角元素，并且元素和小于或等于 18 。
\n\n
示例 2：
\n\"\"\n
\n输入：grid = [[7,2,9],[1,5,0],[2,6,6]], k = 20\n输出：6\n解释：如上图所示，只有 6 个子矩阵满足：包含 grid 的左上角元素，并且元素和小于或等于 20 。\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • m == grid.length 
    • \n\t
  • n == grid[i].length
    • \n\t
  • 1 <= n, m <= 1000 
    • \n\t
  • 0 <= grid[i][j] <= 1000
    • \n\t
  • 1 <= k <= 109
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Medium",
+            "likes": 4,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": false, \"java\": true, \"python\": true, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
+            "topicTags": [
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Matrix",
+                    "slug": "matrix",
+                    "translatedName": "矩阵",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Prefix Sum",
+                    "slug": "prefix-sum",
+                    "translatedName": "前缀和",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    int countSubmatrices(vector>& grid, int k) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public int countSubmatrices(int[][] grid, int k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def countSubmatrices(self, grid, k):\n        \"\"\"\n        :type grid: List[List[int]]\n        :type k: int\n        :rtype: int\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def countSubmatrices(self, grid: List[List[int]], k: int) -> int:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "int countSubmatrices(int** grid, int gridSize, int* gridColSize, int k) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public int CountSubmatrices(int[][] grid, int k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[][]} grid\n * @param {number} k\n * @return {number}\n */\nvar countSubmatrices = function(grid, k) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function countSubmatrices(grid: number[][], k: number): number {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[][] $grid\n     * @param Integer $k\n     * @return Integer\n     */\n    function countSubmatrices($grid, $k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func countSubmatrices(_ grid: [[Int]], _ k: Int) -> Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun countSubmatrices(grid: Array, k: Int): Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  int countSubmatrices(List> grid, int k) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func countSubmatrices(grid [][]int, k int) int {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[][]} grid\n# @param {Integer} k\n# @return {Integer}\ndef count_submatrices(grid, k)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def countSubmatrices(grid: Array[Array[Int]], k: Int): Int = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn count_submatrices(grid: Vec>, k: i32) -> i32 {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (count-submatrices grid k)\n  (-> (listof (listof exact-integer?)) exact-integer? exact-integer?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec count_submatrices(Grid :: [[integer()]], K :: integer()) -> integer().\ncount_submatrices(Grid, K) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec count_submatrices(grid :: [[integer]], k :: integer) :: integer\n  def count_submatrices(grid, k) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"5.1K\", \"totalSubmission\": \"8.1K\", \"totalAcceptedRaw\": 5054, \"totalSubmissionRaw\": 8141, \"acRate\": \"62.1%\"}",
+            "hints": [],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[[7,6,3],[6,6,1]]\n18",
+            "metaData": "{\n  \"name\": \"countSubmatrices\",\n  \"params\": [\n    {\n      \"name\": \"grid\",\n      \"type\": \"integer[][]\"\n    },\n    {\n      \"type\": \"integer\",\n      \"name\": \"k\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"integer\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.0.6<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[[7,6,3],[6,6,1]]\n18\n[[7,2,9],[1,5,0],[2,6,6]]\n20",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/count-substrings-starting-and-ending-with-given-character.json b/leetcode-cn/originData/count-substrings-starting-and-ending-with-given-character.json
new file mode 100644
index 00000000..570dce05
--- /dev/null
+++ b/leetcode-cn/originData/count-substrings-starting-and-ending-with-given-character.json
@@ -0,0 +1,184 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3337",
+            "questionFrontendId": "3084",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2689641,
+            "title": "Count Substrings Starting and Ending with Given Character",
+            "titleSlug": "count-substrings-starting-and-ending-with-given-character",
+            "content": "
You are given a string s and a character c. Return the total number of substrings of s that start and end with c.
\n\n
 
\n
Example 1:
\n\n
\n
Input: s = "abada", c = "a"
\n\n
Output: 6
\n\n
Explanation: Substrings starting and ending with "a" are: "abada", "abada", "abada", "abada", "abada", "abada".
\n
\n\n
Example 2:
\n\n
\n
Input: s = "zzz", c = "z"
\n\n
Output: 6
\n\n
Explanation: There are a total of 6 substrings in s and all start and end with "z".
\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= s.length <= 105
    • \n\t
  • s and c consist only of lowercase English letters.
    • \n
\n",
+            "translatedTitle": "统计以给定字符开头和结尾的子字符串总数",
+            "translatedContent": "
给你一个字符串 s 和一个字符 c 。返回在字符串 s 中并且以 c 字符开头和结尾的非空子字符串的总数。
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：s = \"abada\", c = \"a\"
\n\n
输出：6
\n\n
解释：以 \"a\" 开头和结尾的子字符串有： \"abada\"、\"abada\"、\"abada\"、\"abada\"、\"abada\"、\"abada\"。
\n
\n\n
示例 2：
\n\n
\n
输入：s = \"zzz\", c = \"z\"
\n\n
输出：6
\n\n
解释：字符串 s 中总共有 6 个子字符串，并且它们都以 \"z\" 开头和结尾。
\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= s.length <= 105
    • \n\t
  • s 和 c 均由小写英文字母组成。
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Medium",
+            "likes": 3,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": false, \"java\": false, \"python\": false, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
+            "topicTags": [
+                {
+                    "name": "Math",
+                    "slug": "math",
+                    "translatedName": "数学",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "String",
+                    "slug": "string",
+                    "translatedName": "字符串",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Counting",
+                    "slug": "counting",
+                    "translatedName": "计数",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    long long countSubstrings(string s, char c) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public long countSubstrings(String s, char c) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def countSubstrings(self, s, c):\n        \"\"\"\n        :type s: str\n        :type c: str\n        :rtype: int\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def countSubstrings(self, s: str, c: str) -> int:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "long long countSubstrings(char* s, char c) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public long CountSubstrings(string s, char c) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {string} s\n * @param {character} c\n * @return {number}\n */\nvar countSubstrings = function(s, c) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function countSubstrings(s: string, c: string): number {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param String $s\n     * @param String $c\n     * @return Integer\n     */\n    function countSubstrings($s, $c) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func countSubstrings(_ s: String, _ c: Character) -> Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun countSubstrings(s: String, c: Char): Long {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  int countSubstrings(String s, String c) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func countSubstrings(s string, c byte) int64 {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {String} s\n# @param {Character} c\n# @return {Integer}\ndef count_substrings(s, c)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def countSubstrings(s: String, c: Char): Long = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn count_substrings(s: String, c: char) -> i64 {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (count-substrings s c)\n  (-> string? char? exact-integer?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec count_substrings(S :: unicode:unicode_binary(), C :: char()) -> integer().\ncount_substrings(S, C) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec count_substrings(s :: String.t, c :: char) :: integer\n  def count_substrings(s, c) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"5.5K\", \"totalSubmission\": \"10.4K\", \"totalAcceptedRaw\": 5468, \"totalSubmissionRaw\": 10374, \"acRate\": \"52.7%\"}",
+            "hints": [
+                "Count the number of characters 'c' in string s, let’s call it m.",
+                "We can select 2 numbers i and j such that i <= j are the start and end indices of substring. Note that i and j can be the same.",
+                "The answer is m * (m + 1) / 2."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "\"abada\"\n\"a\"",
+            "metaData": "{\n  \"name\": \"countSubstrings\",\n  \"params\": [\n    {\n      \"name\": \"s\",\n      \"type\": \"string\"\n    },\n    {\n      \"type\": \"character\",\n      \"name\": \"c\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"long\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.0.6<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "\"abada\"\n\"a\"\n\"zzz\"\n\"z\"",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/distribute-elements-into-two-arrays-i.json b/leetcode-cn/originData/distribute-elements-into-two-arrays-i.json
new file mode 100644
index 00000000..63ff2061
--- /dev/null
+++ b/leetcode-cn/originData/distribute-elements-into-two-arrays-i.json
@@ -0,0 +1,176 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3347",
+            "questionFrontendId": "3069",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2662460,
+            "title": "Distribute Elements Into Two Arrays I",
+            "titleSlug": "distribute-elements-into-two-arrays-i",
+            "content": "
You are given a 1-indexed array of distinct integers nums of length n.
\n\n
You need to distribute all the elements of nums between two arrays arr1 and arr2 using n operations. In the first operation, append nums[1] to arr1. In the second operation, append nums[2] to arr2. Afterwards, in the ith operation:
\n\n
    \n\t
  • If the last element of arr1 is greater than the last element of arr2, append nums[i] to arr1. Otherwise, append nums[i] to arr2.
    • \n
\n\n
The array result is formed by concatenating the arrays arr1 and arr2. For example, if arr1 == [1,2,3] and arr2 == [4,5,6], then result = [1,2,3,4,5,6].
\n\n
Return the array result.
\n\n
 
\n
Example 1:
\n\n
\nInput: nums = [2,1,3]\nOutput: [2,3,1]\nExplanation: After the first 2 operations, arr1 = [2] and arr2 = [1].\nIn the 3rd operation, as the last element of arr1 is greater than the last element of arr2 (2 > 1), append nums[3] to arr1.\nAfter 3 operations, arr1 = [2,3] and arr2 = [1].\nHence, the array result formed by concatenation is [2,3,1].\n
\n\n
Example 2:
\n\n
\nInput: nums = [5,4,3,8]\nOutput: [5,3,4,8]\nExplanation: After the first 2 operations, arr1 = [5] and arr2 = [4].\nIn the 3rd operation, as the last element of arr1 is greater than the last element of arr2 (5 > 4), append nums[3] to arr1, hence arr1 becomes [5,3].\nIn the 4th operation, as the last element of arr2 is greater than the last element of arr1 (4 > 3), append nums[4] to arr2, hence arr2 becomes [4,8].\nAfter 4 operations, arr1 = [5,3] and arr2 = [4,8].\nHence, the array result formed by concatenation is [5,3,4,8].\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 3 <= n <= 50
    • \n\t
  • 1 <= nums[i] <= 100
    • \n\t
  • All elements in nums are distinct.
    • \n
\n",
+            "translatedTitle": "将元素分配到两个数组中 I",
+            "translatedContent": "
给你一个下标从 1 开始、包含 不同 整数的数组 nums ，数组长度为 n 。
\n\n
你需要通过 n 次操作，将 nums 中的所有元素分配到两个数组 arr1 和 arr2 中。在第一次操作中，将 nums[1] 追加到 arr1 。在第二次操作中，将 nums[2] 追加到 arr2 。之后，在第 i 次操作中：
\n\n
    \n\t
  • 如果 arr1 的最后一个元素 大于 arr2 的最后一个元素，就将 nums[i] 追加到 arr1 。否则，将 nums[i] 追加到 arr2 。
    • \n
\n\n
通过连接数组 arr1 和 arr2 形成数组 result 。例如，如果 arr1 == [1,2,3] 且 arr2 == [4,5,6] ，那么 result = [1,2,3,4,5,6] 。
\n\n
返回数组 result 。
\n\n
 
\n\n
示例 1：
\n\n
\n输入：nums = [2,1,3]\n输出：[2,3,1]\n解释：在前两次操作后，arr1 = [2] ，arr2 = [1] 。\n在第 3 次操作中，由于 arr1 的最后一个元素大于 arr2 的最后一个元素（2 > 1），将 nums[3] 追加到 arr1 。\n3 次操作后，arr1 = [2,3] ，arr2 = [1] 。\n因此，连接形成的数组 result 是 [2,3,1] 。\n
\n\n
示例 2：
\n\n
\n输入：nums = [5,4,3,8]\n输出：[5,3,4,8]\n解释：在前两次操作后，arr1 = [5] ，arr2 = [4] 。\n在第 3 次操作中，由于 arr1 的最后一个元素大于 arr2 的最后一个元素（5 > 4），将 nums[3] 追加到 arr1 ，因此 arr1 变为 [5,3] 。\n在第 4 次操作中，由于 arr2 的最后一个元素大于 arr1 的最后一个元素（4 > 3），将 nums[4] 追加到 arr2 ，因此 arr2 变为 [4,8] 。\n4 次操作后，arr1 = [5,3] ，arr2 = [4,8] 。\n因此，连接形成的数组 result 是 [5,3,4,8] 。\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 3 <= n <= 50
    • \n\t
  • 1 <= nums[i] <= 100
    • \n\t
  • nums中的所有元素都互不相同。
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Easy",
+            "likes": 4,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
+            "topicTags": [
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Simulation",
+                    "slug": "simulation",
+                    "translatedName": "模拟",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    vector resultArray(vector& nums) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public int[] resultArray(int[] nums) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def resultArray(self, nums):\n        \"\"\"\n        :type nums: List[int]\n        :rtype: List[int]\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def resultArray(self, nums: List[int]) -> List[int]:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "/**\n * Note: The returned array must be malloced, assume caller calls free().\n */\nint* resultArray(int* nums, int numsSize, int* returnSize) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public int[] ResultArray(int[] nums) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[]} nums\n * @return {number[]}\n */\nvar resultArray = function(nums) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function resultArray(nums: number[]): number[] {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[] $nums\n     * @return Integer[]\n     */\n    function resultArray($nums) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func resultArray(_ nums: [Int]) -> [Int] {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun resultArray(nums: IntArray): IntArray {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  List resultArray(List nums) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func resultArray(nums []int) []int {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[]} nums\n# @return {Integer[]}\ndef result_array(nums)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def resultArray(nums: Array[Int]): Array[Int] = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn result_array(nums: Vec) -> Vec {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (result-array nums)\n  (-> (listof exact-integer?) (listof exact-integer?))\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec result_array(Nums :: [integer()]) -> [integer()].\nresult_array(Nums) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec result_array(nums :: [integer]) :: [integer]\n  def result_array(nums) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"5.7K\", \"totalSubmission\": \"6.8K\", \"totalAcceptedRaw\": 5684, \"totalSubmissionRaw\": 6763, \"acRate\": \"84.0%\"}",
+            "hints": [
+                "Divide the array into two arrays by keeping track of the last elements of both subarrays."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[2,1,3]",
+            "metaData": "{\n  \"name\": \"resultArray\",\n  \"params\": [\n    {\n      \"name\": \"nums\",\n      \"type\": \"integer[]\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"integer[]\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.0.6<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[2,1,3]\n[5,4,3,8]",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/distribute-elements-into-two-arrays-ii.json b/leetcode-cn/originData/distribute-elements-into-two-arrays-ii.json
new file mode 100644
index 00000000..c6c0a98d
--- /dev/null
+++ b/leetcode-cn/originData/distribute-elements-into-two-arrays-ii.json
@@ -0,0 +1,189 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3350",
+            "questionFrontendId": "3072",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2639129,
+            "title": "Distribute Elements Into Two Arrays II",
+            "titleSlug": "distribute-elements-into-two-arrays-ii",
+            "content": "
You are given a 1-indexed array of integers nums of length n.
\n\n
We define a function greaterCount such that greaterCount(arr, val) returns the number of elements in arr that are strictly greater than val.
\n\n
You need to distribute all the elements of nums between two arrays arr1 and arr2 using n operations. In the first operation, append nums[1] to arr1. In the second operation, append nums[2] to arr2. Afterwards, in the ith operation:
\n\n
    \n\t
  • If greaterCount(arr1, nums[i]) > greaterCount(arr2, nums[i]), append nums[i] to arr1.
    • \n\t
  • If greaterCount(arr1, nums[i]) < greaterCount(arr2, nums[i]), append nums[i] to arr2.
    • \n\t
  • If greaterCount(arr1, nums[i]) == greaterCount(arr2, nums[i]), append nums[i] to the array with a lesser number of elements.
    • \n\t
  • If there is still a tie, append nums[i] to arr1.
    • \n
\n\n
The array result is formed by concatenating the arrays arr1 and arr2. For example, if arr1 == [1,2,3] and arr2 == [4,5,6], then result = [1,2,3,4,5,6].
\n\n
Return the integer array result.
\n\n
 
\n
Example 1:
\n\n
\nInput: nums = [2,1,3,3]\nOutput: [2,3,1,3]\nExplanation: After the first 2 operations, arr1 = [2] and arr2 = [1].\nIn the 3rd operation, the number of elements greater than 3 is zero in both arrays. Also, the lengths are equal, hence, append nums[3] to arr1.\nIn the 4th operation, the number of elements greater than 3 is zero in both arrays. As the length of arr2 is lesser, hence, append nums[4] to arr2.\nAfter 4 operations, arr1 = [2,3] and arr2 = [1,3].\nHence, the array result formed by concatenation is [2,3,1,3].\n
\n\n
Example 2:
\n\n
\nInput: nums = [5,14,3,1,2]\nOutput: [5,3,1,2,14]\nExplanation: After the first 2 operations, arr1 = [5] and arr2 = [14].\nIn the 3rd operation, the number of elements greater than 3 is one in both arrays. Also, the lengths are equal, hence, append nums[3] to arr1.\nIn the 4th operation, the number of elements greater than 1 is greater in arr1 than arr2 (2 > 1). Hence, append nums[4] to arr1.\nIn the 5th operation, the number of elements greater than 2 is greater in arr1 than arr2 (2 > 1). Hence, append nums[5] to arr1.\nAfter 5 operations, arr1 = [5,3,1,2] and arr2 = [14].\nHence, the array result formed by concatenation is [5,3,1,2,14].\n
\n\n
Example 3:
\n\n
\nInput: nums = [3,3,3,3]\nOutput: [3,3,3,3]\nExplanation: At the end of 4 operations, arr1 = [3,3] and arr2 = [3,3].\nHence, the array result formed by concatenation is [3,3,3,3].\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 3 <= n <= 105
    • \n\t
  • 1 <= nums[i] <= 109
    • \n
\n",
+            "translatedTitle": "将元素分配到两个数组中 II",
+            "translatedContent": "
给你一个下标从 1 开始、长度为 n 的整数数组 nums 。
\n\n
现定义函数 greaterCount ，使得 greaterCount(arr, val) 返回数组 arr 中 严格大于 val 的元素数量。
\n\n
你需要使用 n 次操作，将 nums 的所有元素分配到两个数组 arr1 和 arr2 中。在第一次操作中，将 nums[1] 追加到 arr1 。在第二次操作中，将 nums[2] 追加到 arr2 。之后，在第 i 次操作中：
\n\n
    \n\t
  • 如果 greaterCount(arr1, nums[i]) > greaterCount(arr2, nums[i]) ，将 nums[i] 追加到 arr1 。
    • \n\t
  • 如果 greaterCount(arr1, nums[i]) < greaterCount(arr2, nums[i]) ，将 nums[i] 追加到 arr2 。
    • \n\t
  • 如果 greaterCount(arr1, nums[i]) == greaterCount(arr2, nums[i]) ，将 nums[i] 追加到元素数量较少的数组中。
    • \n\t
  • 如果仍然相等，那么将 nums[i] 追加到 arr1 。
    • \n
\n\n
连接数组 arr1 和 arr2 形成数组 result 。例如，如果 arr1 == [1,2,3] 且 arr2 == [4,5,6] ，那么 result = [1,2,3,4,5,6] 。
\n\n
返回整数数组 result 。
\n\n
 
\n\n
示例 1：
\n\n
\n输入：nums = [2,1,3,3]\n输出：[2,3,1,3]\n解释：在前两次操作后，arr1 = [2] ，arr2 = [1] 。\n在第 3 次操作中，两个数组中大于 3 的元素数量都是零，并且长度相等，因此，将 nums[3] 追加到 arr1 。\n在第 4 次操作中，两个数组中大于 3 的元素数量都是零，但 arr2 的长度较小，因此，将 nums[4] 追加到 arr2 。\n在 4 次操作后，arr1 = [2,3] ，arr2 = [1,3] 。\n因此，连接形成的数组 result 是 [2,3,1,3] 。\n
\n\n
示例 2：
\n\n
\n输入：nums = [5,14,3,1,2]\n输出：[5,3,1,2,14]\n解释：在前两次操作后，arr1 = [5] ，arr2 = [14] 。\n在第 3 次操作中，两个数组中大于 3 的元素数量都是一，并且长度相等，因此，将 nums[3] 追加到 arr1 。\n在第 4 次操作中，arr1 中大于 1 的元素数量大于 arr2 中的数量（2 > 1），因此，将 nums[4] 追加到 arr1 。\n在第 5 次操作中，arr1 中大于 2 的元素数量大于 arr2 中的数量（2 > 1），因此，将 nums[5] 追加到 arr1 。\n在 5 次操作后，arr1 = [5,3,1,2] ，arr2 = [14] 。\n因此，连接形成的数组 result 是 [5,3,1,2,14] 。\n
\n\n
示例 3：
\n\n
\n输入：nums = [3,3,3,3]\n输出：[3,3,3,3]\n解释：在 4 次操作后，arr1 = [3,3] ，arr2 = [3,3] 。\n因此，连接形成的数组 result 是 [3,3,3,3] 。\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 3 <= n <= 105
    • \n\t
  • 1 <= nums[i] <= 109
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Hard",
+            "likes": 7,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
+            "topicTags": [
+                {
+                    "name": "Binary Indexed Tree",
+                    "slug": "binary-indexed-tree",
+                    "translatedName": "树状数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Segment Tree",
+                    "slug": "segment-tree",
+                    "translatedName": "线段树",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Simulation",
+                    "slug": "simulation",
+                    "translatedName": "模拟",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    vector resultArray(vector& nums) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public int[] resultArray(int[] nums) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def resultArray(self, nums):\n        \"\"\"\n        :type nums: List[int]\n        :rtype: List[int]\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def resultArray(self, nums: List[int]) -> List[int]:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "/**\n * Note: The returned array must be malloced, assume caller calls free().\n */\nint* resultArray(int* nums, int numsSize, int* returnSize) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public int[] ResultArray(int[] nums) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[]} nums\n * @return {number[]}\n */\nvar resultArray = function(nums) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function resultArray(nums: number[]): number[] {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[] $nums\n     * @return Integer[]\n     */\n    function resultArray($nums) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func resultArray(_ nums: [Int]) -> [Int] {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun resultArray(nums: IntArray): IntArray {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  List resultArray(List nums) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func resultArray(nums []int) []int {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[]} nums\n# @return {Integer[]}\ndef result_array(nums)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def resultArray(nums: Array[Int]): Array[Int] = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn result_array(nums: Vec) -> Vec {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (result-array nums)\n  (-> (listof exact-integer?) (listof exact-integer?))\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec result_array(Nums :: [integer()]) -> [integer()].\nresult_array(Nums) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec result_array(nums :: [integer]) :: [integer]\n  def result_array(nums) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"3K\", \"totalSubmission\": \"8.2K\", \"totalAcceptedRaw\": 3040, \"totalSubmissionRaw\": 8168, \"acRate\": \"37.2%\"}",
+            "hints": [
+                "We need a data structure that counts the number of integers greater than a given value x and supports insertion.",
+                "Use Segment Tree or Binary Indexed Tree by compressing the numbers to the range [1,n]."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[2,1,3,3]",
+            "metaData": "{\n  \"name\": \"resultArray\",\n  \"params\": [\n    {\n      \"name\": \"nums\",\n      \"type\": \"integer[]\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"integer[]\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.0.6<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[2,1,3,3]\n[5,14,3,1,2]\n[3,3,3,3]",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/existence-of-a-substring-in-a-string-and-its-reverse.json b/leetcode-cn/originData/existence-of-a-substring-in-a-string-and-its-reverse.json
new file mode 100644
index 00000000..71779eaa
--- /dev/null
+++ b/leetcode-cn/originData/existence-of-a-substring-in-a-string-and-its-reverse.json
@@ -0,0 +1,177 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3353",
+            "questionFrontendId": "3083",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2688167,
+            "title": "Existence of a Substring in a String and Its Reverse",
+            "titleSlug": "existence-of-a-substring-in-a-string-and-its-reverse",
+            "content": "
Given a string s, find any substring of length 2 which is also present in the reverse of s.
\n\n
Return true if such a substring exists, and false otherwise.
\n\n
 
\n
Example 1:
\n\n
\n
Input: s = "leetcode"
\n\n
Output: true
\n\n
Explanation: Substring "ee" is of length 2 which is also present in reverse(s) == "edocteel".
\n
\n\n
Example 2:
\n\n
\n
Input: s = "abcba"
\n\n
Output: true
\n\n
Explanation: All of the substrings of length 2 "ab", "bc", "cb", "ba" are also present in reverse(s) == "abcba".
\n
\n\n
Example 3:
\n\n
\n
Input: s = "abcd"
\n\n
Output: false
\n\n
Explanation: There is no substring of length 2 in s, which is also present in the reverse of s.
\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= s.length <= 100
    • \n\t
  • s consists only of lowercase English letters.
    • \n
\n",
+            "translatedTitle": "字符串及其反转中是否存在同一子字符串",
+            "translatedContent": "
给你一个字符串 s ，请你判断字符串 s 是否存在一个长度为 2 的子字符串，在其反转后的字符串中也出现。
\n\n
如果存在这样的子字符串，返回 true；如果不存在，返回 false 。
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：s = \"leetcode\"
\n\n
输出：true
\n\n
解释：子字符串 \"ee\" 的长度为 2，它也出现在 reverse(s) == \"edocteel\" 中。
\n
\n\n
示例 2：
\n\n
\n
输入：s = \"abcba\"
\n\n
输出：true
\n\n
解释：所有长度为 2 的子字符串 \"ab\"、\"bc\"、\"cb\"、\"ba\" 也都出现在 reverse(s) == \"abcba\" 中。
\n
\n\n
示例 3：
\n\n
\n
输入：s = \"abcd\"
\n\n
输出：false
\n\n
解释：字符串 s 中不存在满足「在其反转后的字符串中也出现」且长度为 2 的子字符串。
\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= s.length <= 100
    • \n\t
  • 字符串 s 仅由小写英文字母组成。
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Easy",
+            "likes": 3,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
+            "topicTags": [
+                {
+                    "name": "Hash Table",
+                    "slug": "hash-table",
+                    "translatedName": "哈希表",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "String",
+                    "slug": "string",
+                    "translatedName": "字符串",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    bool isSubstringPresent(string s) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public boolean isSubstringPresent(String s) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def isSubstringPresent(self, s):\n        \"\"\"\n        :type s: str\n        :rtype: bool\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def isSubstringPresent(self, s: str) -> bool:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "bool isSubstringPresent(char* s) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public bool IsSubstringPresent(string s) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {string} s\n * @return {boolean}\n */\nvar isSubstringPresent = function(s) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function isSubstringPresent(s: string): boolean {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param String $s\n     * @return Boolean\n     */\n    function isSubstringPresent($s) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func isSubstringPresent(_ s: String) -> Bool {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun isSubstringPresent(s: String): Boolean {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  bool isSubstringPresent(String s) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func isSubstringPresent(s string) bool {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {String} s\n# @return {Boolean}\ndef is_substring_present(s)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def isSubstringPresent(s: String): Boolean = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn is_substring_present(s: String) -> bool {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (is-substring-present s)\n  (-> string? boolean?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec is_substring_present(S :: unicode:unicode_binary()) -> boolean().\nis_substring_present(S) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec is_substring_present(s :: String.t) :: boolean\n  def is_substring_present(s) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"5.8K\", \"totalSubmission\": \"8.2K\", \"totalAcceptedRaw\": 5821, \"totalSubmissionRaw\": 8159, \"acRate\": \"71.3%\"}",
+            "hints": [
+                "Make a new string by reversing the string s.",
+                "For every substring of length 2 in s, check if there is a corresponding substring in the reverse of s."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "\"leetcode\"",
+            "metaData": "{\n  \"name\": \"isSubstringPresent\",\n  \"params\": [\n    {\n      \"name\": \"s\",\n      \"type\": \"string\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"boolean\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.0.6<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "\"leetcode\"\n\"abcba\"\n\"abcd\"",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/find-the-maximum-sum-of-node-values.json b/leetcode-cn/originData/find-the-maximum-sum-of-node-values.json
new file mode 100644
index 00000000..7913a46c
--- /dev/null
+++ b/leetcode-cn/originData/find-the-maximum-sum-of-node-values.json
@@ -0,0 +1,203 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3307",
+            "questionFrontendId": "3068",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2659028,
+            "title": "Find the Maximum Sum of Node Values",
+            "titleSlug": "find-the-maximum-sum-of-node-values",
+            "content": "
There exists an undirected tree with n nodes numbered 0 to n - 1. You are given a 0-indexed 2D integer array edges of length n - 1, where edges[i] = [ui, vi] indicates that there is an edge between nodes ui and vi in the tree. You are also given a positive integer k, and a 0-indexed array of non-negative integers nums of length n, where nums[i] represents the value of the node numbered i.
\n\n
Alice wants the sum of values of tree nodes to be maximum, for which Alice can perform the following operation any number of times (including zero) on the tree:
\n\n
    \n\t
  • Choose any edge [u, v] connecting the nodes u and v, and update their values as follows:\n\n\t
      \n\t\t
    • nums[u] = nums[u] XOR k
      • \n\t\t
    • nums[v] = nums[v] XOR k
      • \n\t
    \n\t
    • \n
\n\n
Return the maximum possible sum of the values Alice can achieve by performing the operation any number of times.
\n\n
 
\n
Example 1:
\n\"\"\n
\nInput: nums = [1,2,1], k = 3, edges = [[0,1],[0,2]]\nOutput: 6\nExplanation: Alice can achieve the maximum sum of 6 using a single operation:\n- Choose the edge [0,2]. nums[0] and nums[2] become: 1 XOR 3 = 2, and the array nums becomes: [1,2,1] -> [2,2,2].\nThe total sum of values is 2 + 2 + 2 = 6.\nIt can be shown that 6 is the maximum achievable sum of values.\n
\n\n
Example 2:
\n\"\"\n
\nInput: nums = [2,3], k = 7, edges = [[0,1]]\nOutput: 9\nExplanation: Alice can achieve the maximum sum of 9 using a single operation:\n- Choose the edge [0,1]. nums[0] becomes: 2 XOR 7 = 5 and nums[1] become: 3 XOR 7 = 4, and the array nums becomes: [2,3] -> [5,4].\nThe total sum of values is 5 + 4 = 9.\nIt can be shown that 9 is the maximum achievable sum of values.\n
\n\n
Example 3:
\n\"\"\n
\nInput: nums = [7,7,7,7,7,7], k = 3, edges = [[0,1],[0,2],[0,3],[0,4],[0,5]]\nOutput: 42\nExplanation: The maximum achievable sum is 42 which can be achieved by Alice performing no operations.\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 2 <= n == nums.length <= 2 * 104
    • \n\t
  • 1 <= k <= 109
    • \n\t
  • 0 <= nums[i] <= 109
    • \n\t
  • edges.length == n - 1
    • \n\t
  • edges[i].length == 2
    • \n\t
  • 0 <= edges[i][0], edges[i][1] <= n - 1
    • \n\t
  • The input is generated such that edges represent a valid tree.
    • \n
\n",
+            "translatedTitle": "最大节点价值之和",
+            "translatedContent": "
给你一棵 n 个节点的 无向 树，节点从 0 到 n - 1 编号。树以长度为 n - 1 下标从 0 开始的二维整数数组 edges 的形式给你，其中 edges[i] = [ui, vi] 表示树中节点 ui 和 vi 之间有一条边。同时给你一个 正 整数 k 和一个长度为 n 下标从 0 开始的 非负 整数数组 nums ，其中 nums[i] 表示节点 i 的 价值 。
\n\n
Alice 想 最大化 树中所有节点价值之和。为了实现这一目标，Alice 可以执行以下操作 任意 次（包括 0 次）：
\n\n
    \n\t
  • 选择连接节点 u 和 v 的边 [u, v] ，并将它们的值更新为：\n\n\t
      \n\t\t
    • nums[u] = nums[u] XOR k
      • \n\t\t
    • nums[v] = nums[v] XOR k
      • \n\t
    \n\t
    • \n
\n\n
请你返回 Alice 通过执行以上操作 任意次 后，可以得到所有节点 价值之和 的 最大值 。
\n\n
 
\n\n
示例 1：
\n\n
\"\"
\n\n
\n输入：nums = [1,2,1], k = 3, edges = [[0,1],[0,2]]\n输出：6\n解释：Alice 可以通过一次操作得到最大价值和 6 ：\n- 选择边 [0,2] 。nums[0] 和 nums[2] 都变为：1 XOR 3 = 2 ，数组 nums 变为：[1,2,1] -> [2,2,2] 。\n所有节点价值之和为 2 + 2 + 2 = 6 。\n6 是可以得到最大的价值之和。\n
\n\n
示例 2：
\n\n
\"\"
\n\n
\n输入：nums = [2,3], k = 7, edges = [[0,1]]\n输出：9\n解释：Alice 可以通过一次操作得到最大和 9 ：\n- 选择边 [0,1] 。nums[0] 变为：2 XOR 7 = 5 ，nums[1] 变为：3 XOR 7 = 4 ，数组 nums 变为：[2,3] -> [5,4] 。\n所有节点价值之和为 5 + 4 = 9 。\n9 是可以得到最大的价值之和。\n
\n\n
示例 3：
\n\n
\"\"
\n\n
\n输入：nums = [7,7,7,7,7,7], k = 3, edges = [[0,1],[0,2],[0,3],[0,4],[0,5]]\n输出：42\n解释：Alice 不需要执行任何操作，就可以得到最大价值之和 42 。\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 2 <= n == nums.length <= 2 * 104
    • \n\t
  • 1 <= k <= 109
    • \n\t
  • 0 <= nums[i] <= 109
    • \n\t
  • edges.length == n - 1
    • \n\t
  • edges[i].length == 2
    • \n\t
  • 0 <= edges[i][0], edges[i][1] <= n - 1
    • \n\t
  • 输入保证 edges 构成一棵合法的树。
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Hard",
+            "likes": 16,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": false, \"java\": false, \"python\": false, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
+            "topicTags": [
+                {
+                    "name": "Greedy",
+                    "slug": "greedy",
+                    "translatedName": "贪心",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Bit Manipulation",
+                    "slug": "bit-manipulation",
+                    "translatedName": "位运算",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Tree",
+                    "slug": "tree",
+                    "translatedName": "树",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Dynamic Programming",
+                    "slug": "dynamic-programming",
+                    "translatedName": "动态规划",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Sorting",
+                    "slug": "sorting",
+                    "translatedName": "排序",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    long long maximumValueSum(vector& nums, int k, vector>& edges) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public long maximumValueSum(int[] nums, int k, int[][] edges) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def maximumValueSum(self, nums, k, edges):\n        \"\"\"\n        :type nums: List[int]\n        :type k: int\n        :type edges: List[List[int]]\n        :rtype: int\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def maximumValueSum(self, nums: List[int], k: int, edges: List[List[int]]) -> int:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "long long maximumValueSum(int* nums, int numsSize, int k, int** edges, int edgesSize, int* edgesColSize) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public long MaximumValueSum(int[] nums, int k, int[][] edges) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[]} nums\n * @param {number} k\n * @param {number[][]} edges\n * @return {number}\n */\nvar maximumValueSum = function(nums, k, edges) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function maximumValueSum(nums: number[], k: number, edges: number[][]): number {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[] $nums\n     * @param Integer $k\n     * @param Integer[][] $edges\n     * @return Integer\n     */\n    function maximumValueSum($nums, $k, $edges) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func maximumValueSum(_ nums: [Int], _ k: Int, _ edges: [[Int]]) -> Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun maximumValueSum(nums: IntArray, k: Int, edges: Array): Long {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  int maximumValueSum(List nums, int k, List> edges) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func maximumValueSum(nums []int, k int, edges [][]int) int64 {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[]} nums\n# @param {Integer} k\n# @param {Integer[][]} edges\n# @return {Integer}\ndef maximum_value_sum(nums, k, edges)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def maximumValueSum(nums: Array[Int], k: Int, edges: Array[Array[Int]]): Long = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn maximum_value_sum(nums: Vec, k: i32, edges: Vec>) -> i64 {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (maximum-value-sum nums k edges)\n  (-> (listof exact-integer?) exact-integer? (listof (listof exact-integer?)) exact-integer?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec maximum_value_sum(Nums :: [integer()], K :: integer(), Edges :: [[integer()]]) -> integer().\nmaximum_value_sum(Nums, K, Edges) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec maximum_value_sum(nums :: [integer], k :: integer, edges :: [[integer]]) :: integer\n  def maximum_value_sum(nums, k, edges) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"1.7K\", \"totalSubmission\": \"3.2K\", \"totalAcceptedRaw\": 1671, \"totalSubmissionRaw\": 3183, \"acRate\": \"52.5%\"}",
+            "hints": [
+                "Select any node as the root.",
+                "Let dp[x][c] be the maximum sum we can get for the subtree rooted at node x, where c is a boolean representing whether the edge between node x and its parent (if any) is selected or not.",
+                "dp[x][c] = max(sum(dp[y][cy]) + v(nums[x], sum(cy) + c))\r\nwhere cy is 0 or 1. \r\nWhen sum(cy) + c is odd, v(nums[x], sum(cy) + c) = nums[x] XOR k. \r\nWhen sum(cy) + c is even, v(nums[x], sum(cy) + c) = nums[x].",
+                "There’s also an easier solution - does the parity of the number of elements where nums[i] XOR k > nums[i] help?"
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[1,2,1]\n3\n[[0,1],[0,2]]",
+            "metaData": "{\n  \"name\": \"maximumValueSum\",\n  \"params\": [\n    {\n      \"name\": \"nums\",\n      \"type\": \"integer[]\"\n    },\n    {\n      \"type\": \"integer\",\n      \"name\": \"k\"\n    },\n    {\n      \"type\": \"integer[][]\",\n      \"name\": \"edges\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"long\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.0.6<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[1,2,1]\n3\n[[0,1],[0,2]]\n[2,3]\n7\n[[0,1]]\n[7,7,7,7,7,7]\n3\n[[0,1],[0,2],[0,3],[0,4],[0,5]]",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/find-the-sum-of-encrypted-integers.json b/leetcode-cn/originData/find-the-sum-of-encrypted-integers.json
new file mode 100644
index 00000000..f69703c8
--- /dev/null
+++ b/leetcode-cn/originData/find-the-sum-of-encrypted-integers.json
@@ -0,0 +1,176 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3367",
+            "questionFrontendId": "3079",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2688088,
+            "title": "Find the Sum of Encrypted Integers",
+            "titleSlug": "find-the-sum-of-encrypted-integers",
+            "content": "
You are given an integer array nums containing positive integers. We define a function encrypt such that encrypt(x) replaces every digit in x with the largest digit in x. For example, encrypt(523) = 555 and encrypt(213) = 333.
\n\n
Return the sum of encrypted elements.
\n\n
 
\n
Example 1:
\n\n
\n
Input: nums = [1,2,3]
\n\n
Output: 6
\n\n
Explanation: The encrypted elements are [1,2,3]. The sum of encrypted elements is 1 + 2 + 3 == 6.
\n
\n\n
Example 2:
\n\n
\n
Input: nums = [10,21,31]
\n\n
Output: 66
\n\n
Explanation: The encrypted elements are [11,22,33]. The sum of encrypted elements is 11 + 22 + 33 == 66.
\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= nums.length <= 50
    • \n\t
  • 1 <= nums[i] <= 1000
    • \n
\n",
+            "translatedTitle": "求出加密整数的和",
+            "translatedContent": "
给你一个整数数组 nums ，数组中的元素都是 正 整数。定义一个加密函数 encrypt ，encrypt(x) 将一个整数 x 中 每一个 数位都用 x 中的 最大 数位替换。比方说 encrypt(523) = 555 且 encrypt(213) = 333 。
\n\n
请你返回数组中所有元素加密后的 和 。
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：nums = [1,2,3]
\n\n
输出：6
\n\n
解释：加密后的元素位 [1,2,3] 。加密元素的和为 1 + 2 + 3 == 6 。
\n
\n\n
示例 2：
\n\n
\n
输入：nums = [10,21,31]
\n\n
输出：66
\n\n
解释：加密后的元素为 [11,22,33] 。加密元素的和为 11 + 22 + 33 == 66 。
\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= nums.length <= 50
    • \n\t
  • 1 <= nums[i] <= 1000
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Easy",
+            "likes": 2,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
+            "topicTags": [
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Math",
+                    "slug": "math",
+                    "translatedName": "数学",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    int sumOfEncryptedInt(vector& nums) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public int sumOfEncryptedInt(int[] nums) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def sumOfEncryptedInt(self, nums):\n        \"\"\"\n        :type nums: List[int]\n        :rtype: int\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def sumOfEncryptedInt(self, nums: List[int]) -> int:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "int sumOfEncryptedInt(int* nums, int numsSize) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public int SumOfEncryptedInt(int[] nums) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[]} nums\n * @return {number}\n */\nvar sumOfEncryptedInt = function(nums) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function sumOfEncryptedInt(nums: number[]): number {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[] $nums\n     * @return Integer\n     */\n    function sumOfEncryptedInt($nums) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func sumOfEncryptedInt(_ nums: [Int]) -> Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun sumOfEncryptedInt(nums: IntArray): Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  int sumOfEncryptedInt(List nums) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func sumOfEncryptedInt(nums []int) int {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[]} nums\n# @return {Integer}\ndef sum_of_encrypted_int(nums)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def sumOfEncryptedInt(nums: Array[Int]): Int = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn sum_of_encrypted_int(nums: Vec) -> i32 {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (sum-of-encrypted-int nums)\n  (-> (listof exact-integer?) exact-integer?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec sum_of_encrypted_int(Nums :: [integer()]) -> integer().\nsum_of_encrypted_int(Nums) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec sum_of_encrypted_int(nums :: [integer]) :: integer\n  def sum_of_encrypted_int(nums) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"3.6K\", \"totalSubmission\": \"4.4K\", \"totalAcceptedRaw\": 3563, \"totalSubmissionRaw\": 4394, \"acRate\": \"81.1%\"}",
+            "hints": [
+                "Encrypted numbers are of the form 11…1 * maxDigit."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[1,2,3]",
+            "metaData": "{\n  \"name\": \"sumOfEncryptedInt\",\n  \"params\": [\n    {\n      \"name\": \"nums\",\n      \"type\": \"integer[]\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"integer\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.0.6<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[1,2,3]\n[10,21,31]",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/find-the-sum-of-the-power-of-all-subsequences.json b/leetcode-cn/originData/find-the-sum-of-the-power-of-all-subsequences.json
new file mode 100644
index 00000000..0c20b779
--- /dev/null
+++ b/leetcode-cn/originData/find-the-sum-of-the-power-of-all-subsequences.json
@@ -0,0 +1,178 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3345",
+            "questionFrontendId": "3082",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2688425,
+            "title": "Find the Sum of the Power of All Subsequences",
+            "titleSlug": "find-the-sum-of-the-power-of-all-subsequences",
+            "content": "
You are given an integer array nums of length n and a positive integer k.
\n\n
The power of an array of integers is defined as the number of subsequences with their sum equal to k.
\n\n
Return the sum of power of all subsequences of nums.
\n\n
Since the answer may be very large, return it modulo 109 + 7.
\n\n
 
\n
Example 1:
\n\n
\n
Input:   nums = [1,2,3], k = 3 
\n\n
Output:   6 
\n\n
Explanation:
\n\n
There are 5 subsequences of nums with non-zero power:
\n\n
    \n\t
  • The subsequence [1,2,3] has 2 subsequences with sum == 3: [1,2,3] and [1,2,3].
    • \n\t
  • The subsequence [1,2,3] has 1 subsequence with sum == 3: [1,2,3].
    • \n\t
  • The subsequence [1,2,3] has 1 subsequence with sum == 3: [1,2,3].
    • \n\t
  • The subsequence [1,2,3] has 1 subsequence with sum == 3: [1,2,3].
    • \n\t
  • The subsequence [1,2,3] has 1 subsequence with sum == 3: [1,2,3].
    • \n
\n\n
Hence the answer is 2 + 1 + 1 + 1 + 1 = 6.
\n
\n\n
Example 2:
\n\n
\n
Input:   nums = [2,3,3], k = 5 
\n\n
Output:   4 
\n\n
Explanation:
\n\n
There are 3 subsequences of nums with non-zero power:
\n\n
    \n\t
  • The subsequence [2,3,3] has 2 subsequences with sum == 5: [2,3,3] and [2,3,3].
    • \n\t
  • The subsequence [2,3,3] has 1 subsequence with sum == 5: [2,3,3].
    • \n\t
  • The subsequence [2,3,3] has 1 subsequence with sum == 5: [2,3,3].
    • \n
\n\n
Hence the answer is 2 + 1 + 1 = 4.
\n
\n\n
Example 3:
\n\n
\n
Input:   nums = [1,2,3], k = 7 
\n\n
Output:   0 
\n\n
Explanation: There exists no subsequence with sum 7. Hence all subsequences of nums have power = 0.
\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= n <= 100
    • \n\t
  • 1 <= nums[i] <= 104
    • \n\t
  • 1 <= k <= 100
    • \n
\n",
+            "translatedTitle": "求出所有子序列的能量和",
+            "translatedContent": "
给你一个长度为 n 的整数数组 nums 和一个 正 整数 k 。
\n\n
一个整数数组的 能量 定义为和 等于 k 的子序列的数目。
\n\n
请你返回 nums 中所有子序列的 能量和 。
\n\n
由于答案可能很大，请你将它对 109 + 7 取余 后返回。
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：  nums = [1,2,3], k = 3 
\n\n
输出：  6 
\n\n
解释：
\n\n
总共有 5 个能量不为 0 的子序列：
\n\n
    \n\t
  • 子序列 [1,2,3] 有 2 个和为 3 的子序列：[1,2,3] 和 [1,2,3] 。
    • \n\t
  • 子序列 [1,2,3] 有 1 个和为 3 的子序列：[1,2,3] 。
    • \n\t
  • 子序列 [1,2,3] 有 1 个和为 3 的子序列：[1,2,3] 。
    • \n\t
  • 子序列 [1,2,3] 有 1 个和为 3 的子序列：[1,2,3] 。
    • \n\t
  • 子序列 [1,2,3] 有 1 个和为 3 的子序列：[1,2,3] 。
    • \n
\n\n
所以答案为 2 + 1 + 1 + 1 + 1 = 6 。
\n
\n\n
示例 2：
\n\n
\n
输入：  nums = [2,3,3], k = 5 
\n\n
输出：  4 
\n\n
解释：
\n\n
总共有 3 个能量不为 0 的子序列：
\n\n
    \n\t
  • 子序列 [2,3,3] 有 2 个子序列和为 5 ：[2,3,3] 和 [2,3,3] 。
    • \n\t
  • 子序列 [2,3,3] 有 1 个子序列和为 5 ：[2,3,3] 。
    • \n\t
  • 子序列 [2,3,3] 有 1 个子序列和为 5 ：[2,3,3] 。
    • \n
\n\n
所以答案为 2 + 1 + 1 = 4 。
\n
\n\n
示例 3：
\n\n
\n
输入：  nums = [1,2,3], k = 7 
\n\n
输出：  0 
\n\n
解释：不存在和为 7 的子序列，所以 nums 的能量和为 0 。
\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= n <= 100
    • \n\t
  • 1 <= nums[i] <= 104
    • \n\t
  • 1 <= k <= 100
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Hard",
+            "likes": 8,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
+            "topicTags": [
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Dynamic Programming",
+                    "slug": "dynamic-programming",
+                    "translatedName": "动态规划",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    int sumOfPower(vector& nums, int k) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public int sumOfPower(int[] nums, int k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def sumOfPower(self, nums, k):\n        \"\"\"\n        :type nums: List[int]\n        :type k: int\n        :rtype: int\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def sumOfPower(self, nums: List[int], k: int) -> int:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "int sumOfPower(int* nums, int numsSize, int k) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public int SumOfPower(int[] nums, int k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[]} nums\n * @param {number} k\n * @return {number}\n */\nvar sumOfPower = function(nums, k) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function sumOfPower(nums: number[], k: number): number {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[] $nums\n     * @param Integer $k\n     * @return Integer\n     */\n    function sumOfPower($nums, $k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func sumOfPower(_ nums: [Int], _ k: Int) -> Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun sumOfPower(nums: IntArray, k: Int): Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  int sumOfPower(List nums, int k) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func sumOfPower(nums []int, k int) int {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[]} nums\n# @param {Integer} k\n# @return {Integer}\ndef sum_of_power(nums, k)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def sumOfPower(nums: Array[Int], k: Int): Int = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn sum_of_power(nums: Vec, k: i32) -> i32 {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (sum-of-power nums k)\n  (-> (listof exact-integer?) exact-integer? exact-integer?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec sum_of_power(Nums :: [integer()], K :: integer()) -> integer().\nsum_of_power(Nums, K) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec sum_of_power(nums :: [integer], k :: integer) :: integer\n  def sum_of_power(nums, k) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"1.5K\", \"totalSubmission\": \"3.2K\", \"totalAcceptedRaw\": 1533, \"totalSubmissionRaw\": 3195, \"acRate\": \"48.0%\"}",
+            "hints": [
+                "If there is a subsequence of length j with the sum of elements k, it contributes 2n - j to the answer.",
+                "Let dp[i][j] represent the number of subsequences in the subarray nums[0..i] which have a sum of j.",
+                "We can find the dp[i][k] for all 0 <= i <= n-1 and multiply them with 2n - j to get final answer."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[1,2,3]\n3",
+            "metaData": "{\n  \"name\": \"sumOfPower\",\n  \"params\": [\n    {\n      \"name\": \"nums\",\n      \"type\": \"integer[]\"\n    },\n    {\n      \"type\": \"integer\",\n      \"name\": \"k\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"integer\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.0.6<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[1,2,3]\n3\n[2,3,3]\n5\n[1,2,3]\n7",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/mark-elements-on-array-by-performing-queries.json b/leetcode-cn/originData/mark-elements-on-array-by-performing-queries.json
new file mode 100644
index 00000000..92e8655a
--- /dev/null
+++ b/leetcode-cn/originData/mark-elements-on-array-by-performing-queries.json
@@ -0,0 +1,195 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3306",
+            "questionFrontendId": "3080",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2688104,
+            "title": "Mark Elements on Array by Performing Queries",
+            "titleSlug": "mark-elements-on-array-by-performing-queries",
+            "content": "
You are given a 0-indexed array nums of size n consisting of positive integers.
\n\n
You are also given a 2D array queries of size m where queries[i] = [indexi, ki].
\n\n
Initially all elements of the array are unmarked.
\n\n
You need to apply m queries on the array in order, where on the ith query you do the following:
\n\n
    \n\t
  • Mark the element at index indexi if it is not already marked.
    • \n\t
  • Then mark ki unmarked elements in the array with the smallest values. If multiple such elements exist, mark the ones with the smallest indices. And if less than ki unmarked elements exist, then mark all of them.
    • \n
\n\n
Return an array answer of size m where answer[i] is the sum of unmarked elements in the array after the ith query.
\n\n
 
\n
Example 1:
\n\n
\n
Input: nums = [1,2,2,1,2,3,1], queries = [[1,2],[3,3],[4,2]]
\n\n
Output: [8,3,0]
\n\n
Explanation:
\n\n
We do the following queries on the array:
\n\n
    \n\t
  • Mark the element at index 1, and 2 of the smallest unmarked elements with the smallest indices if they exist, the marked elements now are nums = [1,2,2,1,2,3,1]. The sum of unmarked elements is 2 + 2 + 3 + 1 = 8.
    • \n\t
  • Mark the element at index 3, since it is already marked we skip it. Then we mark 3 of the smallest unmarked elements with the smallest indices, the marked elements now are nums = [1,2,2,1,2,3,1]. The sum of unmarked elements is 3.
    • \n\t
  • Mark the element at index 4, since it is already marked we skip it. Then we mark 2 of the smallest unmarked elements with the smallest indices if they exist, the marked elements now are nums = [1,2,2,1,2,3,1]. The sum of unmarked elements is 0.
    • \n
\n
\n\n
Example 2:
\n\n
\n
Input: nums = [1,4,2,3], queries = [[0,1]]
\n\n
Output: [7]
\n\n
Explanation:  We do one query which is mark the element at index 0 and mark the smallest element among unmarked elements. The marked elements will be nums = [1,4,2,3], and the sum of unmarked elements is 4 + 3 = 7.
\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • n == nums.length
    • \n\t
  • m == queries.length
    • \n\t
  • 1 <= m <= n <= 105
    • \n\t
  • 1 <= nums[i] <= 105
    • \n\t
  • queries[i].length == 2
    • \n\t
  • 0 <= indexi, ki <= n - 1
    • \n
\n",
+            "translatedTitle": "执行操作标记数组中的元素",
+            "translatedContent": "
给你一个长度为 n 下标从 0 开始的正整数数组 nums 。
\n\n
同时给你一个长度为 m 的二维操作数组 queries ，其中 queries[i] = [indexi, ki] 。
\n\n
一开始，数组中的所有元素都 未标记 。
\n\n
你需要依次对数组执行 m 次操作，第 i 次操作中，你需要执行：
\n\n
    \n\t
  • 如果下标 indexi 对应的元素还没标记，那么标记这个元素。
    • \n\t
  • 然后标记 ki 个数组中还没有标记的 最小 元素。如果有元素的值相等，那么优先标记它们中下标较小的。如果少于 ki 个未标记元素存在，那么将它们全部标记。
    • \n
\n\n
请你返回一个长度为 m 的数组 answer ，其中 answer[i]是第 i 次操作后数组中还没标记元素的 和 。
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：nums = [1,2,2,1,2,3,1], queries = [[1,2],[3,3],[4,2]]
\n\n
输出：[8,3,0]
\n\n
解释：
\n\n
我们依次对数组做以下操作：
\n\n
    \n\t
  • 标记下标为 1 的元素，同时标记 2 个未标记的最小元素。标记完后数组为 nums = [1,2,2,1,2,3,1] 。未标记元素的和为 2 + 2 + 3 + 1 = 8 。
    • \n\t
  • 标记下标为 3 的元素，由于它已经被标记过了，所以我们忽略这次标记，同时标记最靠前的 3 个未标记的最小元素。标记完后数组为 nums = [1,2,2,1,2,3,1] 。未标记元素的和为 3 。
    • \n\t
  • 标记下标为 4 的元素，由于它已经被标记过了，所以我们忽略这次标记，同时标记最靠前的 2 个未标记的最小元素。标记完后数组为 nums = [1,2,2,1,2,3,1] 。未标记元素的和为 0 。
    • \n
\n
\n\n
示例 2：
\n\n
\n
输入：nums = [1,4,2,3], queries = [[0,1]]
\n\n
输出：[7]
\n\n
解释：我们执行一次操作，将下标为 0 处的元素标记，并且标记最靠前的 1 个未标记的最小元素。标记完后数组为 nums = [1,4,2,3] 。未标记元素的和为 4 + 3 = 7 。
\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • n == nums.length
    • \n\t
  • m == queries.length
    • \n\t
  • 1 <= m <= n <= 105
    • \n\t
  • 1 <= nums[i] <= 105
    • \n\t
  • queries[i].length == 2
    • \n\t
  • 0 <= indexi, ki <= n - 1
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Medium",
+            "likes": 5,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": false, \"java\": false, \"python\": false, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
+            "topicTags": [
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Hash Table",
+                    "slug": "hash-table",
+                    "translatedName": "哈希表",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Sorting",
+                    "slug": "sorting",
+                    "translatedName": "排序",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Simulation",
+                    "slug": "simulation",
+                    "translatedName": "模拟",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Heap (Priority Queue)",
+                    "slug": "heap-priority-queue",
+                    "translatedName": "堆（优先队列）",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    vector unmarkedSumArray(vector& nums, vector>& queries) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public long[] unmarkedSumArray(int[] nums, int[][] queries) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def unmarkedSumArray(self, nums, queries):\n        \"\"\"\n        :type nums: List[int]\n        :type queries: List[List[int]]\n        :rtype: List[int]\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def unmarkedSumArray(self, nums: List[int], queries: List[List[int]]) -> List[int]:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "/**\n * Note: The returned array must be malloced, assume caller calls free().\n */\nlong long* unmarkedSumArray(int* nums, int numsSize, int** queries, int queriesSize, int* queriesColSize, int* returnSize) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public long[] UnmarkedSumArray(int[] nums, int[][] queries) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[]} nums\n * @param {number[][]} queries\n * @return {number[]}\n */\nvar unmarkedSumArray = function(nums, queries) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function unmarkedSumArray(nums: number[], queries: number[][]): number[] {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[] $nums\n     * @param Integer[][] $queries\n     * @return Integer[]\n     */\n    function unmarkedSumArray($nums, $queries) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func unmarkedSumArray(_ nums: [Int], _ queries: [[Int]]) -> [Int] {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun unmarkedSumArray(nums: IntArray, queries: Array): LongArray {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  List unmarkedSumArray(List nums, List> queries) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func unmarkedSumArray(nums []int, queries [][]int) []int64 {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[]} nums\n# @param {Integer[][]} queries\n# @return {Integer[]}\ndef unmarked_sum_array(nums, queries)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def unmarkedSumArray(nums: Array[Int], queries: Array[Array[Int]]): Array[Long] = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn unmarked_sum_array(nums: Vec, queries: Vec>) -> Vec {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (unmarked-sum-array nums queries)\n  (-> (listof exact-integer?) (listof (listof exact-integer?)) (listof exact-integer?))\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec unmarked_sum_array(Nums :: [integer()], Queries :: [[integer()]]) -> [integer()].\nunmarked_sum_array(Nums, Queries) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec unmarked_sum_array(nums :: [integer], queries :: [[integer]]) :: [integer]\n  def unmarked_sum_array(nums, queries) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"2.7K\", \"totalSubmission\": \"5.7K\", \"totalAcceptedRaw\": 2683, \"totalSubmissionRaw\": 5688, \"acRate\": \"47.2%\"}",
+            "hints": [
+                "Use another array to keep track of marked indices.",
+                "Sort the array nums to be able to find the smallest unmarked elements quickly in each query."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[1,2,2,1,2,3,1]\n[[1,2],[3,3],[4,2]]",
+            "metaData": "{\n  \"name\": \"unmarkedSumArray\",\n  \"params\": [\n    {\n      \"name\": \"nums\",\n      \"type\": \"integer[]\"\n    },\n    {\n      \"type\": \"integer[][]\",\n      \"name\": \"queries\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"long[]\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.0.6<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[1,2,2,1,2,3,1]\n[[1,2],[3,3],[4,2]]\n[1,4,2,3]\n[[0,1]]",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/maximize-happiness-of-selected-children.json b/leetcode-cn/originData/maximize-happiness-of-selected-children.json
new file mode 100644
index 00000000..a4ab1779
--- /dev/null
+++ b/leetcode-cn/originData/maximize-happiness-of-selected-children.json
@@ -0,0 +1,184 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3351",
+            "questionFrontendId": "3075",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2674402,
+            "title": "Maximize Happiness of Selected Children",
+            "titleSlug": "maximize-happiness-of-selected-children",
+            "content": "
You are given an array happiness of length n, and a positive integer k.
\n\n
There are n children standing in a queue, where the ith child has happiness value happiness[i]. You want to select k children from these n children in k turns.
\n\n
In each turn, when you select a child, the happiness value of all the children that have not been selected till now decreases by 1. Note that the happiness value cannot become negative and gets decremented only if it is positive.
\n\n
Return the maximum sum of the happiness values of the selected children you can achieve by selecting k children.
\n\n
 
\n
Example 1:
\n\n
\nInput: happiness = [1,2,3], k = 2\nOutput: 4\nExplanation: We can pick 2 children in the following way:\n- Pick the child with the happiness value == 3. The happiness value of the remaining children becomes [0,1].\n- Pick the child with the happiness value == 1. The happiness value of the remaining child becomes [0]. Note that the happiness value cannot become less than 0.\nThe sum of the happiness values of the selected children is 3 + 1 = 4.\n
\n\n
Example 2:
\n\n
\nInput: happiness = [1,1,1,1], k = 2\nOutput: 1\nExplanation: We can pick 2 children in the following way:\n- Pick any child with the happiness value == 1. The happiness value of the remaining children becomes [0,0,0].\n- Pick the child with the happiness value == 0. The happiness value of the remaining child becomes [0,0].\nThe sum of the happiness values of the selected children is 1 + 0 = 1.\n
\n\n
Example 3:
\n\n
\nInput: happiness = [2,3,4,5], k = 1\nOutput: 5\nExplanation: We can pick 1 child in the following way:\n- Pick the child with the happiness value == 5. The happiness value of the remaining children becomes [1,2,3].\nThe sum of the happiness values of the selected children is 5.\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= n == happiness.length <= 2 * 105
    • \n\t
  • 1 <= happiness[i] <= 108
    • \n\t
  • 1 <= k <= n
    • \n
\n",
+            "translatedTitle": "幸福值最大化的选择方案",
+            "translatedContent": "
给你一个长度为 n 的数组 happiness ，以及一个 正整数 k 。
\n\n
n 个孩子站成一队，其中第 i 个孩子的 幸福值 是 happiness[i] 。你计划组织 k 轮筛选从这 n 个孩子中选出 k 个孩子。
\n\n
在每一轮选择一个孩子时，所有 尚未 被选中的孩子的 幸福值 将减少 1 。注意，幸福值 不能 变成负数，且只有在它是正数的情况下才会减少。
\n\n
选择 k 个孩子，并使你选中的孩子幸福值之和最大，返回你能够得到的 最大值 。
\n\n
 
\n\n
示例 1：
\n\n
\n输入：happiness = [1,2,3], k = 2\n输出：4\n解释：按以下方式选择 2 个孩子：\n- 选择幸福值为 3 的孩子。剩余孩子的幸福值变为 [0,1] 。\n- 选择幸福值为 1 的孩子。剩余孩子的幸福值变为 [0] 。注意幸福值不能小于 0 。\n所选孩子的幸福值之和为 3 + 1 = 4 。\n
\n\n
示例 2：
\n\n
\n输入：happiness = [1,1,1,1], k = 2\n输出：1\n解释：按以下方式选择 2 个孩子：\n- 选择幸福值为 1 的任意一个孩子。剩余孩子的幸福值变为 [0,0,0] 。\n- 选择幸福值为 0 的孩子。剩余孩子的幸福值变为 [0,0] 。\n所选孩子的幸福值之和为 1 + 0 = 1 。\n
\n\n
示例 3：
\n\n
\n输入：happiness = [2,3,4,5], k = 1\n输出：5\n解释：按以下方式选择 1 个孩子：\n- 选择幸福值为 5 的孩子。剩余孩子的幸福值变为 [1,2,3] 。\n所选孩子的幸福值之和为 5 。\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= n == happiness.length <= 2 * 105
    • \n\t
  • 1 <= happiness[i] <= 108
    • \n\t
  • 1 <= k <= n
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Medium",
+            "likes": 1,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": false, \"java\": false, \"python\": false, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
+            "topicTags": [
+                {
+                    "name": "Greedy",
+                    "slug": "greedy",
+                    "translatedName": "贪心",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Sorting",
+                    "slug": "sorting",
+                    "translatedName": "排序",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    long long maximumHappinessSum(vector& happiness, int k) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public long maximumHappinessSum(int[] happiness, int k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def maximumHappinessSum(self, happiness, k):\n        \"\"\"\n        :type happiness: List[int]\n        :type k: int\n        :rtype: int\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def maximumHappinessSum(self, happiness: List[int], k: int) -> int:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "long long maximumHappinessSum(int* happiness, int happinessSize, int k) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public long MaximumHappinessSum(int[] happiness, int k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[]} happiness\n * @param {number} k\n * @return {number}\n */\nvar maximumHappinessSum = function(happiness, k) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function maximumHappinessSum(happiness: number[], k: number): number {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[] $happiness\n     * @param Integer $k\n     * @return Integer\n     */\n    function maximumHappinessSum($happiness, $k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func maximumHappinessSum(_ happiness: [Int], _ k: Int) -> Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun maximumHappinessSum(happiness: IntArray, k: Int): Long {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  int maximumHappinessSum(List happiness, int k) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func maximumHappinessSum(happiness []int, k int) int64 {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[]} happiness\n# @param {Integer} k\n# @return {Integer}\ndef maximum_happiness_sum(happiness, k)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def maximumHappinessSum(happiness: Array[Int], k: Int): Long = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn maximum_happiness_sum(happiness: Vec, k: i32) -> i64 {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (maximum-happiness-sum happiness k)\n  (-> (listof exact-integer?) exact-integer? exact-integer?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec maximum_happiness_sum(Happiness :: [integer()], K :: integer()) -> integer().\nmaximum_happiness_sum(Happiness, K) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec maximum_happiness_sum(happiness :: [integer], k :: integer) :: integer\n  def maximum_happiness_sum(happiness, k) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"6K\", \"totalSubmission\": \"12.5K\", \"totalAcceptedRaw\": 6021, \"totalSubmissionRaw\": 12540, \"acRate\": \"48.0%\"}",
+            "hints": [
+                "Since all the unselected numbers are decreasing at the same rate, we should greedily select k largest values.",
+                "The ith largest number (i = 1, 2, 3,…k) should decrease by (i - 1) when it is picked.",
+                "Add 0 if the decreased value is negative."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[1,2,3]\n2",
+            "metaData": "{\n  \"name\": \"maximumHappinessSum\",\n  \"params\": [\n    {\n      \"name\": \"happiness\",\n      \"type\": \"integer[]\"\n    },\n    {\n      \"type\": \"integer\",\n      \"name\": \"k\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"long\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.0.6<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[1,2,3]\n2\n[1,1,1,1]\n2\n[2,3,4,5]\n1",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/maximum-strength-of-k-disjoint-subarrays.json b/leetcode-cn/originData/maximum-strength-of-k-disjoint-subarrays.json
new file mode 100644
index 00000000..247836fd
--- /dev/null
+++ b/leetcode-cn/originData/maximum-strength-of-k-disjoint-subarrays.json
@@ -0,0 +1,186 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3313",
+            "questionFrontendId": "3077",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2674662,
+            "title": "Maximum Strength of K Disjoint Subarrays",
+            "titleSlug": "maximum-strength-of-k-disjoint-subarrays",
+            "content": "
You are given a 0-indexed array of integers nums of length n, and a positive odd integer k.
\n\n
The strength of x subarrays is defined as strength = sum[1] * x - sum[2] * (x - 1) + sum[3] * (x - 2) - sum[4] * (x - 3) + ... + sum[x] * 1 where sum[i] is the sum of the elements in the ith subarray. Formally, strength is sum of (-1)i+1 * sum[i] * (x - i + 1) over all i's such that 1 <= i <= x.
\n\n
You need to select k disjoint subarrays from nums, such that their strength is maximum.
\n\n
Return the maximum possible strength that can be obtained.
\n\n
Note that the selected subarrays don't need to cover the entire array.
\n\n
 
\n
Example 1:
\n\n
\nInput: nums = [1,2,3,-1,2], k = 3\nOutput: 22\nExplanation: The best possible way to select 3 subarrays is: nums[0..2], nums[3..3], and nums[4..4]. The strength is (1 + 2 + 3) * 3 - (-1) * 2 + 2 * 1 = 22.\n
\n\n
Example 2:
\n\n
\nInput: nums = [12,-2,-2,-2,-2], k = 5\nOutput: 64\nExplanation: The only possible way to select 5 disjoint subarrays is: nums[0..0], nums[1..1], nums[2..2], nums[3..3], and nums[4..4]. The strength is 12 * 5 - (-2) * 4 + (-2) * 3 - (-2) * 2 + (-2) * 1 = 64.\n
\n\n
Example 3:
\n\n
\nInput: nums = [-1,-2,-3], k = 1\nOutput: -1\nExplanation: The best possible way to select 1 subarray is: nums[0..0]. The strength is -1.\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= n <= 104
    • \n\t
  • -109 <= nums[i] <= 109
    • \n\t
  • 1 <= k <= n
    • \n\t
  • 1 <= n * k <= 106
    • \n\t
  • k is odd.
    • \n
\n",
+            "translatedTitle": "K 个不相交子数组的最大能量值",
+            "translatedContent": "
给你一个长度为 n 下标从 0 开始的整数数组 nums 和一个 正奇数 整数 k 。
\n\n
x 个子数组的能量值定义为 strength = sum[1] * x - sum[2] * (x - 1) + sum[3] * (x - 2) - sum[4] * (x - 3) + ... + sum[x] * 1 ，其中 sum[i] 是第 i 个子数组的和。更正式的，能量值是满足 1 <= i <= x 的所有 i 对应的 (-1)i+1 * sum[i] * (x - i + 1) 之和。
\n\n
你需要在 nums 中选择 k 个 不相交子数组 ，使得 能量值最大 。
\n\n
请你返回可以得到的 最大能量值 。
\n\n
注意，选出来的所有子数组 不 需要覆盖整个数组。
\n\n
 
\n\n
示例 1：
\n\n
\n输入：nums = [1,2,3,-1,2], k = 3\n输出：22\n解释：选择 3 个子数组的最好方式是选择：nums[0..2] ，nums[3..3] 和 nums[4..4] 。能量值为 (1 + 2 + 3) * 3 - (-1) * 2 + 2 * 1 = 22 。\n
\n\n
示例 2：
\n\n
\n输入：nums = [12,-2,-2,-2,-2], k = 5\n输出：64\n解释：唯一一种选 5 个不相交子数组的方案是：nums[0..0] ，nums[1..1] ，nums[2..2] ，nums[3..3] 和 nums[4..4] 。能量值为 12 * 5 - (-2) * 4 + (-2) * 3 - (-2) * 2 + (-2) * 1 = 64 。\n
\n\n
示例 3：
\n\n
\n输入：nums = [-1,-2,-3], k = 1\n输出：-1\n解释：选择 1 个子数组的最优方案是：nums[0..0] 。能量值为 -1 。\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= n <= 104
    • \n\t
  • -109 <= nums[i] <= 109
    • \n\t
  • 1 <= k <= n
    • \n\t
  • 1 <= n * k <= 106
    • \n\t
  • k 是奇数。
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Hard",
+            "likes": 15,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": false, \"java\": false, \"python\": false, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
+            "topicTags": [
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Dynamic Programming",
+                    "slug": "dynamic-programming",
+                    "translatedName": "动态规划",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Prefix Sum",
+                    "slug": "prefix-sum",
+                    "translatedName": "前缀和",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    long long maximumStrength(vector& nums, int k) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public long maximumStrength(int[] nums, int k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def maximumStrength(self, nums, k):\n        \"\"\"\n        :type nums: List[int]\n        :type k: int\n        :rtype: int\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def maximumStrength(self, nums: List[int], k: int) -> int:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "long long maximumStrength(int* nums, int numsSize, int k) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public long MaximumStrength(int[] nums, int k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[]} nums\n * @param {number} k\n * @return {number}\n */\nvar maximumStrength = function(nums, k) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function maximumStrength(nums: number[], k: number): number {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[] $nums\n     * @param Integer $k\n     * @return Integer\n     */\n    function maximumStrength($nums, $k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func maximumStrength(_ nums: [Int], _ k: Int) -> Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun maximumStrength(nums: IntArray, k: Int): Long {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  int maximumStrength(List nums, int k) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func maximumStrength(nums []int, k int) int64 {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[]} nums\n# @param {Integer} k\n# @return {Integer}\ndef maximum_strength(nums, k)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def maximumStrength(nums: Array[Int], k: Int): Long = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn maximum_strength(nums: Vec, k: i32) -> i64 {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (maximum-strength nums k)\n  (-> (listof exact-integer?) exact-integer? exact-integer?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec maximum_strength(Nums :: [integer()], K :: integer()) -> integer().\nmaximum_strength(Nums, K) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec maximum_strength(nums :: [integer], k :: integer) :: integer\n  def maximum_strength(nums, k) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"2.2K\", \"totalSubmission\": \"5.2K\", \"totalAcceptedRaw\": 2176, \"totalSubmissionRaw\": 5219, \"acRate\": \"41.7%\"}",
+            "hints": [
+                "Let dp[i][j][x == 0/1] be the maximum strength to select j disjoint subarrays from the original array’s suffix (nums[i..(n - 1)]), x denotes whether we select the element or not.",
+                "Initially dp[n][0][0] == 0.",
+                "We have \r\ndp[i][j][1] = nums[i] * get(j) + max(dp[i + 1][j - 1][0], dp[i + 1][j][1]) where get(j) = j if j is odd, otherwise -j.",
+                "We can select nums[i] as a separate subarray or select at least nums[i] and nums[i + 1] as the first subarray.\r\ndp[i][j][0] = max(dp[i + 1][j][0], dp[i][j][1]).",
+                "The answer is dp[0][k][0]."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[1,2,3,-1,2]\n3",
+            "metaData": "{\n  \"name\": \"maximumStrength\",\n  \"params\": [\n    {\n      \"name\": \"nums\",\n      \"type\": \"integer[]\"\n    },\n    {\n      \"type\": \"integer\",\n      \"name\": \"k\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"long\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.0.6<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[1,2,3,-1,2]\n3\n[12,-2,-2,-2,-2]\n5\n[-1,-2,-3]\n1",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/minimum-deletions-to-make-string-k-special.json b/leetcode-cn/originData/minimum-deletions-to-make-string-k-special.json
new file mode 100644
index 00000000..94661eb1
--- /dev/null
+++ b/leetcode-cn/originData/minimum-deletions-to-make-string-k-special.json
@@ -0,0 +1,197 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3360",
+            "questionFrontendId": "3085",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2689642,
+            "title": "Minimum Deletions to Make String K-Special",
+            "titleSlug": "minimum-deletions-to-make-string-k-special",
+            "content": "
You are given a string word and an integer k.
\n\n
We consider word to be k-special if |freq(word[i]) - freq(word[j])| <= k for all indices i and j in the string.
\n\n
Here, freq(x) denotes the frequency of the character x in word, and |y| denotes the absolute value of y.
\n\n
Return the minimum number of characters you need to delete to make word k-special.
\n\n
 
\n
Example 1:
\n\n
\n
Input: word = "aabcaba", k = 0
\n\n
Output: 3
\n\n
Explanation: We can make word 0-special by deleting 2 occurrences of "a" and 1 occurrence of "c". Therefore, word becomes equal to "baba" where freq('a') == freq('b') == 2.
\n
\n\n
Example 2:
\n\n
\n
Input: word = "dabdcbdcdcd", k = 2
\n\n
Output: 2
\n\n
Explanation: We can make word 2-special by deleting 1 occurrence of "a" and 1 occurrence of "d". Therefore, word becomes equal to "bdcbdcdcd" where freq('b') == 2, freq('c') == 3, and freq('d') == 4.
\n
\n\n
Example 3:
\n\n
\n
Input: word = "aaabaaa", k = 2
\n\n
Output: 1
\n\n
Explanation: We can make word 2-special by deleting 1 occurrence of "b". Therefore, word becomes equal to "aaaaaa" where each letter's frequency is now uniformly 6.
\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= word.length <= 105
    • \n\t
  • 0 <= k <= 105
    • \n\t
  • word consists only of lowercase English letters.
    • \n
\n",
+            "translatedTitle": "成为 K 特殊字符串需要删除的最少字符数",
+            "translatedContent": "
给你一个字符串 word 和一个整数 k。
\n\n
如果 |freq(word[i]) - freq(word[j])| <= k 对于字符串中所有下标 i 和 j  都成立，则认为 word 是 k 特殊字符串。
\n\n
此处，freq(x) 表示字符 x 在 word 中的出现频率，而 |y| 表示 y 的绝对值。
\n\n
返回使 word 成为 k 特殊字符串 需要删除的字符的最小数量。
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：word = \"aabcaba\", k = 0
\n\n
输出：3
\n\n
解释：可以删除 2 个 \"a\" 和 1 个 \"c\" 使 word 成为 0 特殊字符串。word 变为 \"baba\"，此时 freq('a') == freq('b') == 2。
\n
\n\n
示例 2：
\n\n
\n
输入：word = \"dabdcbdcdcd\", k = 2
\n\n
输出：2
\n\n
解释：可以删除 1 个 \"a\" 和 1 个 \"d\" 使 word 成为 2 特殊字符串。word 变为 \"bdcbdcdcd\"，此时 freq('b') == 2，freq('c') == 3，freq('d') == 4。
\n
\n\n
示例 3：
\n\n
\n
输入：word = \"aaabaaa\", k = 2
\n\n
输出：1
\n\n
解释：可以删除 1 个 \"b\" 使 word 成为 2特殊字符串。因此，word 变为 \"aaaaaa\"，此时每个字母的频率都是 6。
\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= word.length <= 105
    • \n\t
  • 0 <= k <= 105
    • \n\t
  • word 仅由小写英文字母组成。
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Medium",
+            "likes": 6,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
+            "topicTags": [
+                {
+                    "name": "Greedy",
+                    "slug": "greedy",
+                    "translatedName": "贪心",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Hash Table",
+                    "slug": "hash-table",
+                    "translatedName": "哈希表",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "String",
+                    "slug": "string",
+                    "translatedName": "字符串",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Counting",
+                    "slug": "counting",
+                    "translatedName": "计数",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Sorting",
+                    "slug": "sorting",
+                    "translatedName": "排序",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    int minimumDeletions(string word, int k) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public int minimumDeletions(String word, int k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def minimumDeletions(self, word, k):\n        \"\"\"\n        :type word: str\n        :type k: int\n        :rtype: int\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def minimumDeletions(self, word: str, k: int) -> int:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "int minimumDeletions(char* word, int k) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public int MinimumDeletions(string word, int k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {string} word\n * @param {number} k\n * @return {number}\n */\nvar minimumDeletions = function(word, k) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function minimumDeletions(word: string, k: number): number {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param String $word\n     * @param Integer $k\n     * @return Integer\n     */\n    function minimumDeletions($word, $k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func minimumDeletions(_ word: String, _ k: Int) -> Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun minimumDeletions(word: String, k: Int): Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  int minimumDeletions(String word, int k) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func minimumDeletions(word string, k int) int {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {String} word\n# @param {Integer} k\n# @return {Integer}\ndef minimum_deletions(word, k)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def minimumDeletions(word: String, k: Int): Int = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn minimum_deletions(word: String, k: i32) -> i32 {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (minimum-deletions word k)\n  (-> string? exact-integer? exact-integer?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec minimum_deletions(Word :: unicode:unicode_binary(), K :: integer()) -> integer().\nminimum_deletions(Word, K) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec minimum_deletions(word :: String.t, k :: integer) :: integer\n  def minimum_deletions(word, k) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"10.8K\", \"totalAcceptedRaw\": 4434, \"totalSubmissionRaw\": 10838, \"acRate\": \"40.9%\"}",
+            "hints": [
+                "Count the frequency of each letter.",
+                "Suppose we select several characters as the final answer, and let x be the character with the smallest frequency in the answer. It can be shown that out of the selected characters, the optimal solution will never delete an occurrence of character x to obtain the answer.",
+                "We will fix a character c and assume that it will be the character with the smallest frequency in the answer. Suppose its frequency is x.",
+                "Then, for every other character, we will count the number of occurrences that will be deleted. Suppose that the current character has y occurrences. 
     
  1. If y < x, we need to delete all of them.
    2.  
  2.  if y > x + k, we should delete y - x - k of such character.
    3.  
  3.  Otherwise we don’t need to delete it.
"
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "\"aabcaba\"\n0",
+            "metaData": "{\n  \"name\": \"minimumDeletions\",\n  \"params\": [\n    {\n      \"name\": \"word\",\n      \"type\": \"string\"\n    },\n    {\n      \"type\": \"integer\",\n      \"name\": \"k\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"integer\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.0.6<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "\"aabcaba\"\n0\n\"dabdcbdcdcd\"\n2\n\"aaabaaa\"\n2",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/minimum-moves-to-pick-k-ones.json b/leetcode-cn/originData/minimum-moves-to-pick-k-ones.json
new file mode 100644
index 00000000..dfe7e074
--- /dev/null
+++ b/leetcode-cn/originData/minimum-moves-to-pick-k-ones.json
@@ -0,0 +1,190 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3327",
+            "questionFrontendId": "3086",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2689643,
+            "title": "Minimum Moves to Pick K Ones",
+            "titleSlug": "minimum-moves-to-pick-k-ones",
+            "content": "
You are given a binary array nums of length n, a positive integer k and a non-negative integer maxChanges.
\n\n
Alice plays a game, where the goal is for Alice to pick up k ones from nums using the minimum number of moves. When the game starts, Alice picks up any index aliceIndex in the range [0, n - 1] and stands there. If nums[aliceIndex] == 1 , Alice picks up the one and nums[aliceIndex] becomes 0(this does not count as a move). After this, Alice can make any number of moves (including zero) where in each move Alice must perform exactly one of the following actions:
\n\n
    \n\t
  • Select any index j != aliceIndex such that nums[j] == 0 and set nums[j] = 1. This action can be performed at most maxChanges times.
    • \n\t
  • Select any two adjacent indices x and y (|x - y| == 1) such that nums[x] == 1, nums[y] == 0, then swap their values (set nums[y] = 1 and nums[x] = 0). If y == aliceIndex, Alice picks up the one after this move and nums[y] becomes 0.
    • \n
\n\n
Return the minimum number of moves required by Alice to pick exactly k ones.
\n\n
 
\n
Example 1:
\n\n
\n
Input: nums = [1,1,0,0,0,1,1,0,0,1], k = 3, maxChanges = 1
\n\n
Output: 3
\n\n
Explanation: Alice can pick up 3 ones in 3 moves, if Alice performs the following actions in each move when standing at aliceIndex == 1:
\n\n
    \n\t
  •  At the start of the game Alice picks up the one and nums[1] becomes 0. nums becomes [1,1,1,0,0,1,1,0,0,1].
    • \n\t
  • Select j == 2 and perform an action of the first type. nums becomes [1,0,1,0,0,1,1,0,0,1]
    • \n\t
  • Select x == 2 and y == 1, and perform an action of the second type. nums becomes [1,1,0,0,0,1,1,0,0,1]. As y == aliceIndex, Alice picks up the one and nums becomes [1,0,0,0,0,1,1,0,0,1].
    • \n\t
  • Select x == 0 and y == 1, and perform an action of the second type. nums becomes [0,1,0,0,0,1,1,0,0,1]. As y == aliceIndex, Alice picks up the one and nums becomes [0,0,0,0,0,1,1,0,0,1].
    • \n
\n\n
Note that it may be possible for Alice to pick up 3 ones using some other sequence of 3 moves.
\n
\n\n
Example 2:
\n\n
\n
Input: nums = [0,0,0,0], k = 2, maxChanges = 3
\n\n
Output: 4
\n\n
Explanation: Alice can pick up 2 ones in 4 moves, if Alice performs the following actions in each move when standing at aliceIndex == 0:
\n\n
    \n\t
  • Select j == 1 and perform an action of the first type. nums becomes [0,1,0,0].
    • \n\t
  • Select x == 1 and y == 0, and perform an action of the second type. nums becomes [1,0,0,0]. As y == aliceIndex, Alice picks up the one and nums becomes [0,0,0,0].
    • \n\t
  • Select j == 1 again and perform an action of the first type. nums becomes [0,1,0,0].
    • \n\t
  • Select x == 1 and y == 0 again, and perform an action of the second type. nums becomes [1,0,0,0]. As y == aliceIndex, Alice picks up the one and nums becomes [0,0,0,0].
    • \n
\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 2 <= n <= 105
    • \n\t
  • 0 <= nums[i] <= 1
    • \n\t
  • 1 <= k <= 105
    • \n\t
  • 0 <= maxChanges <= 105
    • \n\t
  • maxChanges + sum(nums) >= k
    • \n
\n",
+            "translatedTitle": "拾起 K 个 1 需要的最少行动次数",
+            "translatedContent": "
给你一个下标从 0 开始的二进制数组 nums，其长度为 n ；另给你一个 正整数 k 以及一个 非负整数 maxChanges 。
\n\n
Alice 在玩一个游戏，游戏的目标是让 Alice 使用 最少 数量的 行动 次数从 nums 中拾起 k 个 1 。游戏开始时，Alice 可以选择数组 [0, n - 1] 范围内的任何索引 aliceIndex 站立。如果 nums[aliceIndex] == 1 ，Alice 会拾起一个 1 ，并且 nums[aliceIndex] 变成0（这 不算 作一次行动）。之后，Alice 可以执行 任意数量 的 行动（包括零次），在每次行动中 Alice 必须 恰好 执行以下动作之一：
\n\n
    \n\t
  • 选择任意一个下标 j != aliceIndex 且满足 nums[j] == 0 ，然后将 nums[j] 设置为 1 。这个动作最多可以执行 maxChanges 次。
    • \n\t
  • 选择任意两个相邻的下标 x 和 y（|x - y| == 1）且满足 nums[x] == 1, nums[y] == 0 ，然后交换它们的值（将 nums[y] = 1 和 nums[x] = 0）。如果 y == aliceIndex，在这次行动后 Alice 拾起一个 1 ，并且 nums[y] 变成 0 。
    • \n
\n\n
返回 Alice 拾起 恰好 k 个 1 所需的 最少 行动次数。
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：nums = [1,1,0,0,0,1,1,0,0,1], k = 3, maxChanges = 1
\n\n
输出：3
\n\n
解释：如果游戏开始时 Alice 在 aliceIndex == 1 的位置上，按照以下步骤执行每个动作，他可以利用 3 次行动拾取 3 个 1 ：
\n\n
    \n\t
  • 游戏开始时 Alice 拾取了一个 1 ，nums[1] 变成了 0。此时 nums 变为 [1,1,1,0,0,1,1,0,0,1] 。
    • \n\t
  • 选择 j == 2 并执行第一种类型的动作。nums 变为 [1,0,1,0,0,1,1,0,0,1]
    • \n\t
  • 选择 x == 2 和 y == 1 ，并执行第二种类型的动作。nums 变为 [1,1,0,0,0,1,1,0,0,1] 。由于 y == aliceIndex，Alice 拾取了一个 1 ，nums 变为  [1,0,0,0,0,1,1,0,0,1] 。
    • \n\t
  • 选择 x == 0 和 y == 1 ，并执行第二种类型的动作。nums 变为 [0,1,0,0,0,1,1,0,0,1] 。由于 y == aliceIndex，Alice 拾取了一个 1 ，nums 变为  [0,0,0,0,0,1,1,0,0,1] 。
    • \n
\n\n
请注意，Alice 也可能执行其他的 3 次行动序列达成拾取 3 个 1 。
\n
\n\n
示例 2：
\n\n
\n
输入：nums = [0,0,0,0], k = 2, maxChanges = 3
\n\n
输出：4
\n\n
解释：如果游戏开始时 Alice 在 aliceIndex == 0 的位置上，按照以下步骤执行每个动作，他可以利用 4 次行动拾取 2 个 1 ：
\n\n
    \n\t
  • 选择 j == 1 并执行第一种类型的动作。nums 变为 [0,1,0,0] 。
    • \n\t
  • 选择 x == 1 和 y == 0 ，并执行第二种类型的动作。nums 变为 [1,0,0,0] 。由于 y == aliceIndex，Alice 拾起了一个 1 ，nums 变为 [0,0,0,0] 。
    • \n\t
  • 再次选择 j == 1 并执行第一种类型的动作。nums 变为 [0,1,0,0] 。
    • \n\t
  • 再次选择 x == 1 和 y == 0 ，并执行第二种类型的动作。nums 变为 [1,0,0,0] 。由于y == aliceIndex，Alice 拾起了一个 1 ，nums 变为 [0,0,0,0] 。
    • \n
\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 2 <= n <= 105
    • \n\t
  • 0 <= nums[i] <= 1
    • \n\t
  • 1 <= k <= 105
    • \n\t
  • 0 <= maxChanges <= 105
    • \n\t
  • maxChanges + sum(nums) >= k
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Hard",
+            "likes": 9,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": false, \"java\": false, \"python\": false, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
+            "topicTags": [
+                {
+                    "name": "Greedy",
+                    "slug": "greedy",
+                    "translatedName": "贪心",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Prefix Sum",
+                    "slug": "prefix-sum",
+                    "translatedName": "前缀和",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Sliding Window",
+                    "slug": "sliding-window",
+                    "translatedName": "滑动窗口",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    long long minimumMoves(vector& nums, int k, int maxChanges) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public long minimumMoves(int[] nums, int k, int maxChanges) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def minimumMoves(self, nums, k, maxChanges):\n        \"\"\"\n        :type nums: List[int]\n        :type k: int\n        :type maxChanges: int\n        :rtype: int\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def minimumMoves(self, nums: List[int], k: int, maxChanges: int) -> int:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "long long minimumMoves(int* nums, int numsSize, int k, int maxChanges) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public long MinimumMoves(int[] nums, int k, int maxChanges) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[]} nums\n * @param {number} k\n * @param {number} maxChanges\n * @return {number}\n */\nvar minimumMoves = function(nums, k, maxChanges) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function minimumMoves(nums: number[], k: number, maxChanges: number): number {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[] $nums\n     * @param Integer $k\n     * @param Integer $maxChanges\n     * @return Integer\n     */\n    function minimumMoves($nums, $k, $maxChanges) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func minimumMoves(_ nums: [Int], _ k: Int, _ maxChanges: Int) -> Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun minimumMoves(nums: IntArray, k: Int, maxChanges: Int): Long {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  int minimumMoves(List nums, int k, int maxChanges) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func minimumMoves(nums []int, k int, maxChanges int) int64 {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[]} nums\n# @param {Integer} k\n# @param {Integer} max_changes\n# @return {Integer}\ndef minimum_moves(nums, k, max_changes)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def minimumMoves(nums: Array[Int], k: Int, maxChanges: Int): Long = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn minimum_moves(nums: Vec, k: i32, max_changes: i32) -> i64 {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (minimum-moves nums k maxChanges)\n  (-> (listof exact-integer?) exact-integer? exact-integer? exact-integer?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec minimum_moves(Nums :: [integer()], K :: integer(), MaxChanges :: integer()) -> integer().\nminimum_moves(Nums, K, MaxChanges) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec minimum_moves(nums :: [integer], k :: integer, max_changes :: integer) :: integer\n  def minimum_moves(nums, k, max_changes) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"1.2K\", \"totalSubmission\": \"4.8K\", \"totalAcceptedRaw\": 1179, \"totalSubmissionRaw\": 4835, \"acRate\": \"24.4%\"}",
+            "hints": [
+                "Ones created using a change require 2 moves. Hence except for the immediate neighbors of the index where we move all the ones, we should try to use change operations.",
+                "For some subset of ones, it is always better to move the ones to the median position.",
+                "We only need to be concerned with the indices where nums[i] == 1."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[1,1,0,0,0,1,1,0,0,1]\n3\n1",
+            "metaData": "{\n  \"name\": \"minimumMoves\",\n  \"params\": [\n    {\n      \"name\": \"nums\",\n      \"type\": \"integer[]\"\n    },\n    {\n      \"type\": \"integer\",\n      \"name\": \"k\"\n    },\n    {\n      \"type\": \"integer\",\n      \"name\": \"maxChanges\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"long\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.0.6<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[1,1,0,0,0,1,1,0,0,1]\n3\n1\n[0,0,0,0]\n2\n3",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/minimum-operations-to-exceed-threshold-value-i.json b/leetcode-cn/originData/minimum-operations-to-exceed-threshold-value-i.json
new file mode 100644
index 00000000..b6af561e
--- /dev/null
+++ b/leetcode-cn/originData/minimum-operations-to-exceed-threshold-value-i.json
@@ -0,0 +1,170 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3331",
+            "questionFrontendId": "3065",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2658935,
+            "title": "Minimum Operations to Exceed Threshold Value I",
+            "titleSlug": "minimum-operations-to-exceed-threshold-value-i",
+            "content": "
You are given a 0-indexed integer array nums, and an integer k.
\n\n
In one operation, you can remove one occurrence of the smallest element of nums.
\n\n
Return the minimum number of operations needed so that all elements of the array are greater than or equal to k.
\n\n
 
\n
Example 1:
\n\n
\nInput: nums = [2,11,10,1,3], k = 10\nOutput: 3\nExplanation: After one operation, nums becomes equal to [2, 11, 10, 3].\nAfter two operations, nums becomes equal to [11, 10, 3].\nAfter three operations, nums becomes equal to [11, 10].\nAt this stage, all the elements of nums are greater than or equal to 10 so we can stop.\nIt can be shown that 3 is the minimum number of operations needed so that all elements of the array are greater than or equal to 10.\n
\n\n
Example 2:
\n\n
\nInput: nums = [1,1,2,4,9], k = 1\nOutput: 0\nExplanation: All elements of the array are greater than or equal to 1 so we do not need to apply any operations on nums.
\n\n
Example 3:
\n\n
\nInput: nums = [1,1,2,4,9], k = 9\nOutput: 4\nExplanation: only a single element of nums is greater than or equal to 9 so we need to apply the operations 4 times on nums.\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= nums.length <= 50
    • \n\t
  • 1 <= nums[i] <= 109
    • \n\t
  • 1 <= k <= 109
    • \n\t
  • The input is generated such that there is at least one index i such that nums[i] >= k.
    • \n
\n",
+            "translatedTitle": "超过阈值的最少操作数 I",
+            "translatedContent": "
给你一个下标从 0 开始的整数数组 nums 和一个整数 k 。
\n\n
一次操作中，你可以删除 nums 中的最小元素。
\n\n
你需要使数组中的所有元素都大于或等于 k ，请你返回需要的 最少 操作次数。
\n\n
 
\n\n
示例 1：
\n\n
\n输入：nums = [2,11,10,1,3], k = 10\n输出：3\n解释：第一次操作后，nums 变为 [2, 11, 10, 3] 。\n第二次操作后，nums 变为 [11, 10, 3] 。\n第三次操作后，nums 变为 [11, 10] 。\n此时，数组中的所有元素都大于等于 10 ，所以我们停止操作。\n使数组中所有元素都大于等于 10 需要的最少操作次数为 3 。\n
\n\n
示例 2：
\n\n
\n输入：nums = [1,1,2,4,9], k = 1\n输出：0\n解释：数组中的所有元素都大于等于 1 ，所以不需要对 nums 做任何操作。
\n\n
示例 3：
\n\n
\n输入：nums = [1,1,2,4,9], k = 9\n输出：4\n解释：nums 中只有一个元素大于等于 9 ，所以需要执行 4 次操作。\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= nums.length <= 50
    • \n\t
  • 1 <= nums[i] <= 109
    • \n\t
  • 1 <= k <= 109
    • \n\t
  • 输入保证至少有一个满足 nums[i] >= k 的下标 i 存在。
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Easy",
+            "likes": 2,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
+            "topicTags": [
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    int minOperations(vector& nums, int k) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public int minOperations(int[] nums, int k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def minOperations(self, nums, k):\n        \"\"\"\n        :type nums: List[int]\n        :type k: int\n        :rtype: int\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def minOperations(self, nums: List[int], k: int) -> int:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "int minOperations(int* nums, int numsSize, int k) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public int MinOperations(int[] nums, int k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[]} nums\n * @param {number} k\n * @return {number}\n */\nvar minOperations = function(nums, k) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function minOperations(nums: number[], k: number): number {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[] $nums\n     * @param Integer $k\n     * @return Integer\n     */\n    function minOperations($nums, $k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func minOperations(_ nums: [Int], _ k: Int) -> Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun minOperations(nums: IntArray, k: Int): Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  int minOperations(List nums, int k) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func minOperations(nums []int, k int) int {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[]} nums\n# @param {Integer} k\n# @return {Integer}\ndef min_operations(nums, k)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def minOperations(nums: Array[Int], k: Int): Int = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn min_operations(nums: Vec, k: i32) -> i32 {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (min-operations nums k)\n  (-> (listof exact-integer?) exact-integer? exact-integer?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec min_operations(Nums :: [integer()], K :: integer()) -> integer().\nmin_operations(Nums, K) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec min_operations(nums :: [integer], k :: integer) :: integer\n  def min_operations(nums, k) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"4.4K\", \"totalSubmission\": \"4.8K\", \"totalAcceptedRaw\": 4376, \"totalSubmissionRaw\": 4788, \"acRate\": \"91.4%\"}",
+            "hints": [
+                "Iterate over nums and count the number of elements less than k."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[2,11,10,1,3]\n10",
+            "metaData": "{\n  \"name\": \"minOperations\",\n  \"params\": [\n    {\n      \"name\": \"nums\",\n      \"type\": \"integer[]\"\n    },\n    {\n      \"type\": \"integer\",\n      \"name\": \"k\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"integer\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.0.6<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[2,11,10,1,3]\n10\n[1,1,2,4,9]\n1\n[1,1,2,4,9]\n9",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/minimum-operations-to-exceed-threshold-value-ii.json b/leetcode-cn/originData/minimum-operations-to-exceed-threshold-value-ii.json
new file mode 100644
index 00000000..64d7fd42
--- /dev/null
+++ b/leetcode-cn/originData/minimum-operations-to-exceed-threshold-value-ii.json
@@ -0,0 +1,183 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3332",
+            "questionFrontendId": "3066",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2658981,
+            "title": "Minimum Operations to Exceed Threshold Value II",
+            "titleSlug": "minimum-operations-to-exceed-threshold-value-ii",
+            "content": "
You are given a 0-indexed integer array nums, and an integer k.
\n\n
In one operation, you will:
\n\n
    \n\t
  • Take the two smallest integers x and y in nums.
    • \n\t
  • Remove x and y from nums.
    • \n\t
  • Add min(x, y) * 2 + max(x, y) anywhere in the array.
    • \n
\n\n
Note that you can only apply the described operation if nums contains at least two elements.
\n\n
Return the minimum number of operations needed so that all elements of the array are greater than or equal to k.
\n\n
 
\n
Example 1:
\n\n
\nInput: nums = [2,11,10,1,3], k = 10\nOutput: 2\nExplanation: In the first operation, we remove elements 1 and 2, then add 1 * 2 + 2 to nums. nums becomes equal to [4, 11, 10, 3].\nIn the second operation, we remove elements 3 and 4, then add 3 * 2 + 4 to nums. nums becomes equal to [10, 11, 10].\nAt this stage, all the elements of nums are greater than or equal to 10 so we can stop.\nIt can be shown that 2 is the minimum number of operations needed so that all elements of the array are greater than or equal to 10.\n
\n\n
Example 2:
\n\n
\nInput: nums = [1,1,2,4,9], k = 20\nOutput: 4\nExplanation: After one operation, nums becomes equal to [2, 4, 9, 3].\nAfter two operations, nums becomes equal to [7, 4, 9].\nAfter three operations, nums becomes equal to [15, 9].\nAfter four operations, nums becomes equal to [33].\nAt this stage, all the elements of nums are greater than 20 so we can stop.\nIt can be shown that 4 is the minimum number of operations needed so that all elements of the array are greater than or equal to 20.
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 2 <= nums.length <= 2 * 105
    • \n\t
  • 1 <= nums[i] <= 109
    • \n\t
  • 1 <= k <= 109
    • \n\t
  • The input is generated such that an answer always exists. That is, there exists some sequence of operations after which all elements of the array are greater than or equal to k.
    • \n
\n",
+            "translatedTitle": "超过阈值的最少操作数 II",
+            "translatedContent": "
给你一个下标从 0 开始的整数数组 nums 和一个整数 k 。
\n\n
一次操作中，你将执行：
\n\n
    \n\t
  • 选择 nums 中最小的两个整数 x 和 y 。
    • \n\t
  • 将 x 和 y 从 nums 中删除。
    • \n\t
  • 将 min(x, y) * 2 + max(x, y) 添加到数组中的任意位置。
    • \n
\n\n
注意，只有当 nums 至少包含两个元素时，你才可以执行以上操作。
\n\n
你需要使数组中的所有元素都大于或等于 k ，请你返回需要的 最少 操作次数。
\n\n
 
\n\n
示例 1：
\n\n
\n输入：nums = [2,11,10,1,3], k = 10\n输出：2\n解释：第一次操作中，我们删除元素 1 和 2 ，然后添加 1 * 2 + 2 到 nums 中，nums 变为 [4, 11, 10, 3] 。\n第二次操作中，我们删除元素 3 和 4 ，然后添加 3 * 2 + 4 到 nums 中，nums 变为 [10, 11, 10] 。\n此时，数组中的所有元素都大于等于 10 ，所以我们停止操作。\n使数组中所有元素都大于等于 10 需要的最少操作次数为 2 。\n
\n\n
示例 2：
\n\n
\n输入：nums = [1,1,2,4,9], k = 20\n输出：4\n解释：第一次操作后，nums 变为 [2, 4, 9, 3] 。\n第二次操作后，nums 变为 [7, 4, 9] 。\n第三次操作后，nums 变为 [15, 9] 。\n第四次操作后，nums 变为 [33] 。\n此时，数组中的所有元素都大于等于 20 ，所以我们停止操作。\n使数组中所有元素都大于等于 20 需要的最少操作次数为 4 。
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 2 <= nums.length <= 2 * 105
    • \n\t
  • 1 <= nums[i] <= 109
    • \n\t
  • 1 <= k <= 109
    • \n\t
  • 输入保证答案一定存在，也就是说一定存在一个操作序列使数组中所有元素都大于等于 k 。
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Medium",
+            "likes": 3,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
+            "topicTags": [
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Simulation",
+                    "slug": "simulation",
+                    "translatedName": "模拟",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Heap (Priority Queue)",
+                    "slug": "heap-priority-queue",
+                    "translatedName": "堆（优先队列）",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    int minOperations(vector& nums, int k) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public int minOperations(int[] nums, int k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def minOperations(self, nums, k):\n        \"\"\"\n        :type nums: List[int]\n        :type k: int\n        :rtype: int\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def minOperations(self, nums: List[int], k: int) -> int:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "int minOperations(int* nums, int numsSize, int k) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public int MinOperations(int[] nums, int k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[]} nums\n * @param {number} k\n * @return {number}\n */\nvar minOperations = function(nums, k) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function minOperations(nums: number[], k: number): number {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[] $nums\n     * @param Integer $k\n     * @return Integer\n     */\n    function minOperations($nums, $k) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func minOperations(_ nums: [Int], _ k: Int) -> Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun minOperations(nums: IntArray, k: Int): Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  int minOperations(List nums, int k) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func minOperations(nums []int, k int) int {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[]} nums\n# @param {Integer} k\n# @return {Integer}\ndef min_operations(nums, k)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def minOperations(nums: Array[Int], k: Int): Int = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn min_operations(nums: Vec, k: i32) -> i32 {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (min-operations nums k)\n  (-> (listof exact-integer?) exact-integer? exact-integer?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec min_operations(Nums :: [integer()], K :: integer()) -> integer().\nmin_operations(Nums, K) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec min_operations(nums :: [integer], k :: integer) :: integer\n  def min_operations(nums, k) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"3.3K\", \"totalSubmission\": \"9.6K\", \"totalAcceptedRaw\": 3328, \"totalSubmissionRaw\": 9605, \"acRate\": \"34.6%\"}",
+            "hints": [
+                "Use priority queue to keep track of minimum elements.",
+                "Remove the minimum two elements, perform the operation, and insert the resulting number into the priority queue."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[2,11,10,1,3]\n10",
+            "metaData": "{\n  \"name\": \"minOperations\",\n  \"params\": [\n    {\n      \"name\": \"nums\",\n      \"type\": \"integer[]\"\n    },\n    {\n      \"type\": \"integer\",\n      \"name\": \"k\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"integer\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.0.6<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[2,11,10,1,3]\n10\n[1,1,2,4,9]\n20",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/minimum-operations-to-write-the-letter-y-on-a-grid.json b/leetcode-cn/originData/minimum-operations-to-write-the-letter-y-on-a-grid.json
new file mode 100644
index 00000000..b72833e6
--- /dev/null
+++ b/leetcode-cn/originData/minimum-operations-to-write-the-letter-y-on-a-grid.json
@@ -0,0 +1,186 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3335",
+            "questionFrontendId": "3071",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2662372,
+            "title": "Minimum Operations to Write the Letter Y on a Grid",
+            "titleSlug": "minimum-operations-to-write-the-letter-y-on-a-grid",
+            "content": "
You are given a 0-indexed n x n grid where n is odd, and grid[r][c] is 0, 1, or 2.
\n\n
We say that a cell belongs to the Letter Y if it belongs to one of the following:
\n\n
    \n\t
  • The diagonal starting at the top-left cell and ending at the center cell of the grid.
    • \n\t
  • The diagonal starting at the top-right cell and ending at the center cell of the grid.
    • \n\t
  • The vertical line starting at the center cell and ending at the bottom border of the grid.
    • \n
\n\n
The Letter Y is written on the grid if and only if:
\n\n
    \n\t
  • All values at cells belonging to the Y are equal.
    • \n\t
  • All values at cells not belonging to the Y are equal.
    • \n\t
  • The values at cells belonging to the Y are different from the values at cells not belonging to the Y.
    • \n
\n\n
Return the minimum number of operations needed to write the letter Y on the grid given that in one operation you can change the value at any cell to 0, 1, or 2.
\n\n
 
\n
Example 1:
\n\"\"\n
\nInput: grid = [[1,2,2],[1,1,0],[0,1,0]]\nOutput: 3\nExplanation: We can write Y on the grid by applying the changes highlighted in blue in the image above. After the operations, all cells that belong to Y, denoted in bold, have the same value of 1 while those that do not belong to Y are equal to 0.\nIt can be shown that 3 is the minimum number of operations needed to write Y on the grid.\n
\n\n
Example 2:
\n\"\"\n
\nInput: grid = [[0,1,0,1,0],[2,1,0,1,2],[2,2,2,0,1],[2,2,2,2,2],[2,1,2,2,2]]\nOutput: 12\nExplanation: We can write Y on the grid by applying the changes highlighted in blue in the image above. After the operations, all cells that belong to Y, denoted in bold, have the same value of 0 while those that do not belong to Y are equal to 2. \nIt can be shown that 12 is the minimum number of operations needed to write Y on the grid.
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 3 <= n <= 49 
    • \n\t
  • n == grid.length == grid[i].length
    • \n\t
  • 0 <= grid[i][j] <= 2
    • \n\t
  • n is odd.
    • \n
\n",
+            "translatedTitle": "在矩阵上写出字母 Y 所需的最少操作次数",
+            "translatedContent": "
给你一个下标从 0 开始、大小为 n x n 的矩阵 grid ，其中 n 为奇数，且 grid[r][c] 的值为 0 、1 或 2 。
\n\n
如果一个单元格属于以下三条线中的任一一条，我们就认为它是字母 Y 的一部分：
\n\n
    \n\t
  • 从左上角单元格开始到矩阵中心单元格结束的对角线。
    • \n\t
  • 从右上角单元格开始到矩阵中心单元格结束的对角线。
    • \n\t
  • 从中心单元格开始到矩阵底部边界结束的垂直线。
    • \n
\n\n
当且仅当满足以下全部条件时，可以判定矩阵上写有字母 Y ：
\n\n
    \n\t
  • 属于 Y 的所有单元格的值相等。
    • \n\t
  • 不属于 Y 的所有单元格的值相等。
    • \n\t
  • 属于 Y 的单元格的值与不属于Y的单元格的值不同。
    • \n
\n\n
每次操作你可以将任意单元格的值改变为 0 、1 或 2 。返回在矩阵上写出字母 Y 所需的 最少 操作次数。
\n\n
 
\n\n
示例 1：
\n\"\"\n
\n输入：grid = [[1,2,2],[1,1,0],[0,1,0]]\n输出：3\n解释：将在矩阵上写出字母 Y 需要执行的操作用蓝色高亮显示。操作后，所有属于 Y 的单元格（加粗显示）的值都为 1 ，而不属于 Y 的单元格的值都为 0 。\n可以证明，写出 Y 至少需要进行 3 次操作。\n
\n\n
示例 2：
\n\"\"\n
\n输入：grid = [[0,1,0,1,0],[2,1,0,1,2],[2,2,2,0,1],[2,2,2,2,2],[2,1,2,2,2]]\n输出：12\n解释：将在矩阵上写出字母 Y 需要执行的操作用蓝色高亮显示。操作后，所有属于 Y 的单元格（加粗显示）的值都为 0 ，而不属于 Y 的单元格的值都为 2 。\n可以证明，写出 Y 至少需要进行 12 次操作。\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 3 <= n <= 49
    • \n\t
  • n == grid.length == grid[i].length
    • \n\t
  • 0 <= grid[i][j] <= 2
    • \n\t
  • n 为奇数。
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Medium",
+            "likes": 3,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": false, \"java\": true, \"python\": true, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
+            "topicTags": [
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Hash Table",
+                    "slug": "hash-table",
+                    "translatedName": "哈希表",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Counting",
+                    "slug": "counting",
+                    "translatedName": "计数",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Matrix",
+                    "slug": "matrix",
+                    "translatedName": "矩阵",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    int minimumOperationsToWriteY(vector>& grid) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public int minimumOperationsToWriteY(int[][] grid) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def minimumOperationsToWriteY(self, grid):\n        \"\"\"\n        :type grid: List[List[int]]\n        :rtype: int\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def minimumOperationsToWriteY(self, grid: List[List[int]]) -> int:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "int minimumOperationsToWriteY(int** grid, int gridSize, int* gridColSize) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public int MinimumOperationsToWriteY(int[][] grid) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {number[][]} grid\n * @return {number}\n */\nvar minimumOperationsToWriteY = function(grid) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function minimumOperationsToWriteY(grid: number[][]): number {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param Integer[][] $grid\n     * @return Integer\n     */\n    function minimumOperationsToWriteY($grid) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func minimumOperationsToWriteY(_ grid: [[Int]]) -> Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun minimumOperationsToWriteY(grid: Array): Int {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  int minimumOperationsToWriteY(List> grid) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func minimumOperationsToWriteY(grid [][]int) int {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {Integer[][]} grid\n# @return {Integer}\ndef minimum_operations_to_write_y(grid)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def minimumOperationsToWriteY(grid: Array[Array[Int]]): Int = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn minimum_operations_to_write_y(grid: Vec>) -> i32 {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (minimum-operations-to-write-y grid)\n  (-> (listof (listof exact-integer?)) exact-integer?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec minimum_operations_to_write_y(Grid :: [[integer()]]) -> integer().\nminimum_operations_to_write_y(Grid) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec minimum_operations_to_write_y(grid :: [[integer]]) :: integer\n  def minimum_operations_to_write_y(grid) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"4.1K\", \"totalSubmission\": \"6K\", \"totalAcceptedRaw\": 4069, \"totalSubmissionRaw\": 5993, \"acRate\": \"67.9%\"}",
+            "hints": [],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[[1,2,2],[1,1,0],[0,1,0]]",
+            "metaData": "{\n  \"name\": \"minimumOperationsToWriteY\",\n  \"params\": [\n    {\n      \"name\": \"grid\",\n      \"type\": \"integer[][]\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"integer\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.0.6<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[[1,2,2],[1,1,0],[0,1,0]]\n[[0,1,0,1,0],[2,1,0,1,2],[2,2,2,0,1],[2,2,2,2,2],[2,1,2,2,2]]",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/replace-question-marks-in-string-to-minimize-its-value.json b/leetcode-cn/originData/replace-question-marks-in-string-to-minimize-its-value.json
new file mode 100644
index 00000000..495d6779
--- /dev/null
+++ b/leetcode-cn/originData/replace-question-marks-in-string-to-minimize-its-value.json
@@ -0,0 +1,203 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3354",
+            "questionFrontendId": "3081",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2689084,
+            "title": "Replace Question Marks in String to Minimize Its Value",
+            "titleSlug": "replace-question-marks-in-string-to-minimize-its-value",
+            "content": "
You are given a string s. s[i] is either a lowercase English letter or '?'.
\n\n
For a string t having length m containing only lowercase English letters, we define the function cost(i) for an index i as the number of characters equal to t[i] that appeared before it, i.e. in the range [0, i - 1].
\n\n
The value of t is the sum of cost(i) for all indices i.
\n\n
For example, for the string t = "aab":
\n\n
    \n\t
  • cost(0) = 0
    • \n\t
  • cost(1) = 1
    • \n\t
  • cost(2) = 0
    • \n\t
  • Hence, the value of "aab" is 0 + 1 + 0 = 1.
    • \n
\n\n
Your task is to replace all occurrences of '?' in s with any lowercase English letter so that the value of s is minimized.
\n\n
Return a string denoting the modified string with replaced occurrences of '?'. If there are multiple strings resulting in the minimum value, return the lexicographically smallest one.
\n\n
 
\n
Example 1:
\n\n
\n
Input:   s = "???" 
\n\n
Output:   "abc" 
\n\n
Explanation:  In this example, we can replace the occurrences of '?' to make s equal to "abc".
\n\n
For "abc", cost(0) = 0, cost(1) = 0, and cost(2) = 0.
\n\n
The value of "abc" is 0.
\n\n
Some other modifications of s that have a value of 0 are "cba", "abz", and, "hey".
\n\n
Among all of them, we choose the lexicographically smallest.
\n
\n\n
Example 2:
\n\n
\n
Input:  s = "a?a?"
\n\n
Output:  "abac"
\n\n
Explanation:  In this example, the occurrences of '?' can be replaced to make s equal to "abac".
\n\n
For "abac", cost(0) = 0, cost(1) = 0, cost(2) = 1, and cost(3) = 0.
\n\n
The value of "abac" is 1.
\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • 1 <= s.length <= 105
    • \n\t
  • s[i] is either a lowercase English letter or '?'.
    • \n
\n",
+            "translatedTitle": "替换字符串中的问号使分数最小",
+            "translatedContent": "
给你一个字符串 s 。s[i] 要么是小写英文字母，要么是问号 '?' 。
\n\n
对于长度为 m 且 只 含有小写英文字母的字符串 t ，我们定义函数 cost(i) 为下标 i 之前（也就是范围 [0, i - 1] 中）出现过与 t[i] 相同 字符出现的次数。
\n\n
字符串 t 的 分数 为所有下标 i 的 cost(i) 之 和 。
\n\n
比方说，字符串 t = \"aab\" ：
\n\n
    \n\t
  • cost(0) = 0
    • \n\t
  • cost(1) = 1
    • \n\t
  • cost(2) = 0
    • \n\t
  • 所以，字符串 \"aab\" 的分数为 0 + 1 + 0 = 1 。
    • \n
\n\n
你的任务是用小写英文字母 替换 s 中 所有 问号，使 s 的 分数最小 。
\n\n
请你返回替换所有问号 '?' 之后且分数最小的字符串。如果有多个字符串的 分数最小 ，那么返回字典序最小的一个。
\n\n
 
\n\n
示例 1：
\n\n
\n
输入：s = \"???\" 
\n\n
输出： \"abc\" 
\n\n
解释：这个例子中，我们将 s 中的问号 '?' 替换得到 \"abc\" 。
\n\n
对于字符串 \"abc\" ，cost(0) = 0 ，cost(1) = 0 和 cost(2) = 0 。
\n\n
\"abc\" 的分数为 0 。
\n\n
其他修改 s 得到分数 0 的字符串为 \"cba\" ，\"abz\" 和 \"hey\" 。
\n\n
这些字符串中，我们返回字典序最小的。
\n
\n\n
示例 2：
\n\n
\n
输入： s = \"a?a?\"
\n\n
输出： \"abac\"
\n\n
解释：这个例子中，我们将 s 中的问号 '?' 替换得到 \"abac\" 。
\n\n
对于字符串 \"abac\" ，cost(0) = 0 ，cost(1) = 0 ，cost(2) = 1 和 cost(3) = 0 。
\n\n
\"abac\" 的分数为 1 。
\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • 1 <= s.length <= 105
    • \n\t
  • s[i] 要么是小写英文字母，要么是 '?' 。
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Medium",
+            "likes": 10,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": true, \"java\": true, \"python\": true, \"python3\": true, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
+            "topicTags": [
+                {
+                    "name": "Greedy",
+                    "slug": "greedy",
+                    "translatedName": "贪心",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Hash Table",
+                    "slug": "hash-table",
+                    "translatedName": "哈希表",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "String",
+                    "slug": "string",
+                    "translatedName": "字符串",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Counting",
+                    "slug": "counting",
+                    "translatedName": "计数",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Sorting",
+                    "slug": "sorting",
+                    "translatedName": "排序",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Heap (Priority Queue)",
+                    "slug": "heap-priority-queue",
+                    "translatedName": "堆（优先队列）",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    string minimizeStringValue(string s) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public String minimizeStringValue(String s) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def minimizeStringValue(self, s):\n        \"\"\"\n        :type s: str\n        :rtype: str\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def minimizeStringValue(self, s: str) -> str:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "char* minimizeStringValue(char* s) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public string MinimizeStringValue(string s) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {string} s\n * @return {string}\n */\nvar minimizeStringValue = function(s) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function minimizeStringValue(s: string): string {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param String $s\n     * @return String\n     */\n    function minimizeStringValue($s) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func minimizeStringValue(_ s: String) -> String {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun minimizeStringValue(s: String): String {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  String minimizeStringValue(String s) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func minimizeStringValue(s string) string {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {String} s\n# @return {String}\ndef minimize_string_value(s)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def minimizeStringValue(s: String): String = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn minimize_string_value(s: String) -> String {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (minimize-string-value s)\n  (-> string? string?)\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec minimize_string_value(S :: unicode:unicode_binary()) -> unicode:unicode_binary().\nminimize_string_value(S) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec minimize_string_value(s :: String.t) :: String.t\n  def minimize_string_value(s) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"2.1K\", \"totalSubmission\": \"6.2K\", \"totalAcceptedRaw\": 2097, \"totalSubmissionRaw\": 6222, \"acRate\": \"33.7%\"}",
+            "hints": [
+                "
The cost does not depend on the order of characters. If a character c appears x times, the cost is exactly 0 + 1 + 2 + … + (x − 1) = x * (x − 1) / 2.
",
+                "
We know the total number of question marks; for each one, we should select the letter with the minimum frequency to replace it.
",
+                "
The letter selection can be achieved by a min-heap (or even by brute-forcing the 26 possibilities).
",
+                "
So, we know the extra letters we need to replace finally. However, we must put those letters in order from left to right so that the resulting string is the lexicographically smallest one.
"
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "\"???\"",
+            "metaData": "{\n  \"name\": \"minimizeStringValue\",\n  \"params\": [\n    {\n      \"name\": \"s\",\n      \"type\": \"string\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"string\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.0.6<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "\"???\"\n\"a?a?\"",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/originData/shortest-uncommon-substring-in-an-array.json b/leetcode-cn/originData/shortest-uncommon-substring-in-an-array.json
new file mode 100644
index 00000000..eb35154b
--- /dev/null
+++ b/leetcode-cn/originData/shortest-uncommon-substring-in-an-array.json
@@ -0,0 +1,189 @@
+{
+    "data": {
+        "question": {
+            "questionId": "3356",
+            "questionFrontendId": "3076",
+            "categoryTitle": "Algorithms",
+            "boundTopicId": 2674637,
+            "title": "Shortest Uncommon Substring in an Array",
+            "titleSlug": "shortest-uncommon-substring-in-an-array",
+            "content": "
You are given an array arr of size n consisting of non-empty strings.
\n\n
Find a string array answer of size n such that:
\n\n
    \n\t
  • answer[i] is the shortest substring of arr[i] that does not occur as a substring in any other string in arr. If multiple such substrings exist, answer[i] should be the lexicographically smallest. And if no such substring exists, answer[i] should be an empty string.
    • \n
\n\n
Return the array answer.
\n\n
 
\n
Example 1:
\n\n
\nInput: arr = ["cab","ad","bad","c"]\nOutput: ["ab","","ba",""]\nExplanation: We have the following:\n- For the string "cab", the shortest substring that does not occur in any other string is either "ca" or "ab", we choose the lexicographically smaller substring, which is "ab".\n- For the string "ad", there is no substring that does not occur in any other string.\n- For the string "bad", the shortest substring that does not occur in any other string is "ba".\n- For the string "c", there is no substring that does not occur in any other string.\n
\n\n
Example 2:
\n\n
\nInput: arr = ["abc","bcd","abcd"]\nOutput: ["","","abcd"]\nExplanation: We have the following:\n- For the string "abc", there is no substring that does not occur in any other string.\n- For the string "bcd", there is no substring that does not occur in any other string.\n- For the string "abcd", the shortest substring that does not occur in any other string is "abcd".\n
\n\n
 
\n
Constraints:
\n\n
    \n\t
  • n == arr.length
    • \n\t
  • 2 <= n <= 100
    • \n\t
  • 1 <= arr[i].length <= 20
    • \n\t
  • arr[i] consists only of lowercase English letters.
    • \n
\n",
+            "translatedTitle": "数组中的最短非公共子字符串",
+            "translatedContent": "
给你一个数组 arr ，数组中有 n 个 非空 字符串。
\n\n
请你求出一个长度为 n 的字符串 answer ，满足：
\n\n
    \n\t
  • answer[i] 是 arr[i] 最短 的子字符串，且它不是 arr 中其他任何字符串的子字符串。如果有多个这样的子字符串存在，answer[i] 应该是它们中字典序最小的一个。如果不存在这样的子字符串，answer[i] 为空字符串。
    • \n
\n\n
请你返回数组 answer 。
\n\n
 
\n\n
示例 1：
\n\n
\n输入：arr = [\"cab\",\"ad\",\"bad\",\"c\"]\n输出：[\"ab\",\"\",\"ba\",\"\"]\n解释：求解过程如下：\n- 对于字符串 \"cab\" ，最短没有在其他字符串中出现过的子字符串是 \"ca\" 或者 \"ab\" ，我们选择字典序更小的子字符串，也就是 \"ab\" 。\n- 对于字符串 \"ad\" ，不存在没有在其他字符串中出现过的子字符串。\n- 对于字符串 \"bad\" ，最短没有在其他字符串中出现过的子字符串是 \"ba\" 。\n- 对于字符串 \"c\" ，不存在没有在其他字符串中出现过的子字符串。\n
\n\n
示例 2：
\n\n
\n输入：arr = [\"abc\",\"bcd\",\"abcd\"]\n输出：[\"\",\"\",\"abcd\"]\n解释：求解过程如下：\n- 对于字符串 \"abc\" ，不存在没有在其他字符串中出现过的子字符串。\n- 对于字符串 \"bcd\" ，不存在没有在其他字符串中出现过的子字符串。\n- 对于字符串 \"abcd\" ，最短没有在其他字符串中出现过的子字符串是 \"abcd\" 。\n
\n\n
 
\n\n
提示：
\n\n
    \n\t
  • n == arr.length
    • \n\t
  • 2 <= n <= 100
    • \n\t
  • 1 <= arr[i].length <= 20
    • \n\t
  • arr[i] 只包含小写英文字母。
    • \n
\n",
+            "isPaidOnly": false,
+            "difficulty": "Medium",
+            "likes": 5,
+            "dislikes": 0,
+            "isLiked": null,
+            "similarQuestions": "[]",
+            "contributors": [],
+            "langToValidPlayground": "{\"cpp\": false, \"java\": false, \"python\": true, \"python3\": false, \"mysql\": false, \"mssql\": false, \"oraclesql\": false, \"c\": false, \"csharp\": false, \"javascript\": false, \"typescript\": false, \"bash\": false, \"php\": false, \"swift\": false, \"kotlin\": false, \"dart\": false, \"golang\": false, \"ruby\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"rust\": false, \"racket\": false, \"erlang\": false, \"elixir\": false, \"pythondata\": false, \"react\": false, \"vanillajs\": false, \"postgresql\": false}",
+            "topicTags": [
+                {
+                    "name": "Trie",
+                    "slug": "trie",
+                    "translatedName": "字典树",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Array",
+                    "slug": "array",
+                    "translatedName": "数组",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "Hash Table",
+                    "slug": "hash-table",
+                    "translatedName": "哈希表",
+                    "__typename": "TopicTagNode"
+                },
+                {
+                    "name": "String",
+                    "slug": "string",
+                    "translatedName": "字符串",
+                    "__typename": "TopicTagNode"
+                }
+            ],
+            "companyTagStats": null,
+            "codeSnippets": [
+                {
+                    "lang": "C++",
+                    "langSlug": "cpp",
+                    "code": "class Solution {\npublic:\n    vector shortestSubstrings(vector& arr) {\n        \n    }\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Java",
+                    "langSlug": "java",
+                    "code": "class Solution {\n    public String[] shortestSubstrings(String[] arr) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python",
+                    "langSlug": "python",
+                    "code": "class Solution(object):\n    def shortestSubstrings(self, arr):\n        \"\"\"\n        :type arr: List[str]\n        :rtype: List[str]\n        \"\"\"",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Python3",
+                    "langSlug": "python3",
+                    "code": "class Solution:\n    def shortestSubstrings(self, arr: List[str]) -> List[str]:",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C",
+                    "langSlug": "c",
+                    "code": "/**\n * Note: The returned array must be malloced, assume caller calls free().\n */\nchar** shortestSubstrings(char** arr, int arrSize, int* returnSize) {\n    \n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "C#",
+                    "langSlug": "csharp",
+                    "code": "public class Solution {\n    public string[] ShortestSubstrings(string[] arr) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "JavaScript",
+                    "langSlug": "javascript",
+                    "code": "/**\n * @param {string[]} arr\n * @return {string[]}\n */\nvar shortestSubstrings = function(arr) {\n\n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "TypeScript",
+                    "langSlug": "typescript",
+                    "code": "function shortestSubstrings(arr: string[]): string[] {\n    \n};",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "PHP",
+                    "langSlug": "php",
+                    "code": "class Solution {\n\n    /**\n     * @param String[] $arr\n     * @return String[]\n     */\n    function shortestSubstrings($arr) {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Swift",
+                    "langSlug": "swift",
+                    "code": "class Solution {\n    func shortestSubstrings(_ arr: [String]) -> [String] {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Kotlin",
+                    "langSlug": "kotlin",
+                    "code": "class Solution {\n    fun shortestSubstrings(arr: Array): Array {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Dart",
+                    "langSlug": "dart",
+                    "code": "class Solution {\n  List shortestSubstrings(List arr) {\n    \n  }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Go",
+                    "langSlug": "golang",
+                    "code": "func shortestSubstrings(arr []string) []string {\n\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Ruby",
+                    "langSlug": "ruby",
+                    "code": "# @param {String[]} arr\n# @return {String[]}\ndef shortest_substrings(arr)\n\nend",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Scala",
+                    "langSlug": "scala",
+                    "code": "object Solution {\n    def shortestSubstrings(arr: Array[String]): Array[String] = {\n        \n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Rust",
+                    "langSlug": "rust",
+                    "code": "impl Solution {\n    pub fn shortest_substrings(arr: Vec) -> Vec {\n\n    }\n}",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Racket",
+                    "langSlug": "racket",
+                    "code": "(define/contract (shortest-substrings arr)\n  (-> (listof string?) (listof string?))\n  )",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Erlang",
+                    "langSlug": "erlang",
+                    "code": "-spec shortest_substrings(Arr :: [unicode:unicode_binary()]) -> [unicode:unicode_binary()].\nshortest_substrings(Arr) ->\n  .",
+                    "__typename": "CodeSnippetNode"
+                },
+                {
+                    "lang": "Elixir",
+                    "langSlug": "elixir",
+                    "code": "defmodule Solution do\n  @spec shortest_substrings(arr :: [String.t]) :: [String.t]\n  def shortest_substrings(arr) do\n    \n  end\nend",
+                    "__typename": "CodeSnippetNode"
+                }
+            ],
+            "stats": "{\"totalAccepted\": \"4.7K\", \"totalSubmission\": \"9.7K\", \"totalAcceptedRaw\": 4727, \"totalSubmissionRaw\": 9733, \"acRate\": \"48.6%\"}",
+            "hints": [
+                "Try a brute force solution where you check every substring.",
+                "Use a Hash map to keep track of the substrings."
+            ],
+            "solution": null,
+            "status": null,
+            "sampleTestCase": "[\"cab\",\"ad\",\"bad\",\"c\"]",
+            "metaData": "{\n  \"name\": \"shortestSubstrings\",\n  \"params\": [\n    {\n      \"name\": \"arr\",\n      \"type\": \"string[]\"\n    }\n  ],\n  \"return\": {\n    \"type\": \"string[]\"\n  }\n}",
+            "judgerAvailable": true,
+            "judgeType": "large",
+            "mysqlSchemas": [],
+            "enableRunCode": true,
+            "envInfo": "{\"cpp\":[\"C++\",\"
\\u7248\\u672c\\uff1aclang 17<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 20\\u6807\\u51c6\\uff0c\\u5e76\\u4f7f\\u7528 GCC 11 \\u63d0\\u4f9b\\u7684 libstdc++<\\/code>\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002AddressSanitizer<\\/a> \\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\"],\"java\":[\"Java\",\"
\\u7248\\u672c\\uff1aOpenJDK 21<\\/code>\\u3002\\u4f7f\\u7528\\u7f16\\u8bd1\\u53c2\\u6570 --enable-preview --release 21<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u88ab\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5305\\u542b Pair \\u7c7b: https:\\/\\/docs.oracle.com\\/javase\\/8\\/javafx\\/api\\/javafx\\/util\\/Pair.html <\\/p>\"],\"python\":[\"Python\",\"
\\u7248\\u672c\\uff1a Python 2.7.12<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982\\uff1aarray<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u6ce8\\u610f Python 2.7 \\u5c06\\u57282020\\u5e74\\u540e\\u4e0d\\u518d\\u7ef4\\u62a4<\\/a>\\u3002 \\u5982\\u60f3\\u4f7f\\u7528\\u6700\\u65b0\\u7248\\u7684Python\\uff0c\\u8bf7\\u9009\\u62e9Python 3\\u3002<\\/p>\"],\"c\":[\"C\",\"
\\u7248\\u672c\\uff1aGCC 11<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n
\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O2<\\/code>\\u7ea7\\u4f18\\u5316\\u3002 AddressSanitizer<\\/a>\\u4e5f\\u88ab\\u5f00\\u542f\\u6765\\u68c0\\u6d4bout-of-bounds<\\/code>\\u548cuse-after-free<\\/code>\\u9519\\u8bef\\u3002<\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u4f7f\\u7528\\u65b9\\u4fbf\\uff0c\\u5927\\u90e8\\u5206\\u6807\\u51c6\\u5e93\\u7684\\u5934\\u6587\\u4ef6\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u60f3\\u4f7f\\u7528\\u54c8\\u5e0c\\u8868\\u8fd0\\u7b97, \\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 uthash<\\/a>\\u3002 \\\"uthash.h\\\"\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5bfc\\u5165\\u3002\\u8bf7\\u770b\\u5982\\u4e0b\\u793a\\u4f8b:<\\/p>\\r\\n\\r\\n
1. \\u5f80\\u54c8\\u5e0c\\u8868\\u4e2d\\u6dfb\\u52a0\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry {\\r\\n    int id;            \\/* we'll use this field as the key *\\/\\r\\n    char name[10];\\r\\n    UT_hash_handle hh; \\/* makes this structure hashable *\\/\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n    HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
2. \\u5728\\u54c8\\u5e0c\\u8868\\u4e2d\\u67e5\\u627e\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n    struct hash_entry *s;\\r\\n    HASH_FIND_INT(users, &user_id, s);\\r\\n    return s;\\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\\r\\n\\r\\n
3. \\u4ece\\u54c8\\u5e0c\\u8868\\u4e2d\\u5220\\u9664\\u4e00\\u4e2a\\u5bf9\\u8c61\\uff1a<\\/b>\\r\\n
\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n<\\/pre>\\r\\n<\\/p>\"],\"csharp\":[\"C#\",\"
C# 12<\\/a> \\u8fd0\\u884c\\u5728 .NET 8 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"
\\u7248\\u672c\\uff1aNode.js 20.10.0<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5728\\u6267\\u884c\\u65f6\\u5c06\\u5e26\\u4e0a --harmony<\\/code> \\u6807\\u8bb0\\u6765\\u5f00\\u542f \\u65b0\\u7248ES6\\u7279\\u6027<\\/a>\\u3002<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"
\\u4f7f\\u7528Ruby 3.2<\\/code>\\u6267\\u884c<\\/p>\\r\\n\\r\\n
\\u4e00\\u4e9b\\u5e38\\u7528\\u7684\\u6570\\u636e\\u7ed3\\u6784\\u5df2\\u5728 Algorithms \\u6a21\\u5757\\u4e2d\\u63d0\\u4f9b\\uff1ahttps:\\/\\/www.rubydoc.info\\/github\\/kanwei\\/algorithms\\/Algorithms<\\/p>\"],\"swift\":[\"Swift\",\"
\\u7248\\u672c\\uff1aSwift 5.9<\\/code><\\/p>\\r\\n\\r\\n
\\u60a8\\u53ef\\u4ee5\\u4f7f\\u7528 swift-algorithms 1.2.0<\\/a> \\u548c swift-collections 1.0.6<\\/a><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u901a\\u5e38\\u4fdd\\u8bc1\\u66f4\\u65b0\\u5230 Apple\\u653e\\u51fa\\u7684\\u6700\\u65b0\\u7248Swift<\\/a>\\u3002\\u5982\\u679c\\u60a8\\u53d1\\u73b0Swift\\u4e0d\\u662f\\u6700\\u65b0\\u7248\\u7684\\uff0c\\u8bf7\\u8054\\u7cfb\\u6211\\u4eec\\uff01\\u6211\\u4eec\\u5c06\\u5c3d\\u5feb\\u66f4\\u65b0\\u3002<\\/p>\"],\"golang\":[\"Go\",\"
\\u7248\\u672c\\uff1aGo 1.21<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods@v1.18.1<\\/a> \\u548c https:\\/\\/pkg.go.dev\\/github.com\\/emirpasic\\/gods\\/v2@v2.0.0-alpha<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"
\\u7248\\u672c\\uff1aPython 3.11<\\/code><\\/p>\\r\\n\\r\\n
\\u4e3a\\u4e86\\u65b9\\u4fbf\\u8d77\\u89c1\\uff0c\\u5927\\u90e8\\u5206\\u5e38\\u7528\\u5e93\\u5df2\\u7ecf\\u88ab\\u81ea\\u52a8 \\u5bfc\\u5165\\uff0c\\u5982array<\\/a>, bisect<\\/a>, collections<\\/a>\\u3002 \\u5982\\u679c\\u60a8\\u9700\\u8981\\u4f7f\\u7528\\u5176\\u4ed6\\u5e93\\u51fd\\u6570\\uff0c\\u8bf7\\u81ea\\u884c\\u5bfc\\u5165\\u3002<\\/p>\\r\\n\\r\\n
\\u5982\\u9700\\u4f7f\\u7528 Map\\/TreeMap \\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528 sortedcontainers<\\/a> \\u5e93\\u3002<\\/p>\"],\"scala\":[\"Scala\",\"
\\u7248\\u672c\\uff1aScala 3.3.1<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"
\\u7248\\u672c\\uff1aKotlin 1.9.0<\\/code><\\/p>\\r\\n\\r\\n
\\u6211\\u4eec\\u4f7f\\u7528\\u7684\\u662f JetBrains \\u63d0\\u4f9b\\u7684 experimental compiler\\u3002\\u5982\\u679c\\u60a8\\u8ba4\\u4e3a\\u60a8\\u9047\\u5230\\u4e86\\u7f16\\u8bd1\\u5668\\u76f8\\u5173\\u7684\\u95ee\\u9898\\uff0c\\u8bf7\\u5411\\u6211\\u4eec\\u53cd\\u9988<\\/p>\"],\"rust\":[\"Rust\",\"
\\u7248\\u672c\\uff1arust 1.74.1<\\/code><\\/p>\\r\\n\\r\\n
\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"
PHP 8.2<\\/code>.<\\/p>\\r\\n\\r\\n
With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"
TypeScript 5.1.6<\\/p>\\r\\n\\r\\n
Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2022<\\/p>\\r\\n\\r\\n
lodash.js<\\/a> \\u5e93\\u5df2\\u7ecf\\u9ed8\\u8ba4\\u88ab\\u5305\\u542b\\u3002<\\/p>\\r\\n\\r\\n
 \\u5982\\u9700\\u4f7f\\u7528\\u961f\\u5217\\/\\u4f18\\u5148\\u961f\\u5217\\uff0c\\u60a8\\u53ef\\u4f7f\\u7528  datastructures-js\\/priority-queue@5.4.0<\\/a> \\u548c  datastructures-js\\/queue@4.2.3<\\/a>\\u3002<\\/p>\"],\"racket\":[\"Racket\",\"
Racket CS<\\/a> v8.11<\\/p>\\r\\n\\r\\n
\\u4f7f\\u7528 #lang racket<\\/p>\\r\\n\\r\\n
\\u5df2\\u9884\\u5148 (require data\\/gvector data\\/queue data\\/order data\\/heap). \\u82e5\\u9700\\u4f7f\\u7528\\u5176\\u5b83\\u6570\\u636e\\u7ed3\\u6784\\uff0c\\u53ef\\u81ea\\u884c require\\u3002<\\/p>\"],\"erlang\":[\"Erlang\",\"Erlang\\/OTP 26\"],\"elixir\":[\"Elixir\",\"Elixir 1.15 with Erlang\\/OTP 26\"],\"dart\":[\"Dart\",\"
Dart 3.2<\\/p>\\r\\n\\r\\n
\\u60a8\\u7684\\u4ee3\\u7801\\u5c06\\u4f1a\\u88ab\\u4e0d\\u7f16\\u8bd1\\u76f4\\u63a5\\u8fd0\\u884c<\\/p>\"]}",
+            "book": null,
+            "isSubscribed": false,
+            "isDailyQuestion": false,
+            "dailyRecordStatus": null,
+            "editorType": "CKEDITOR",
+            "ugcQuestionId": null,
+            "style": "LEETCODE",
+            "exampleTestcases": "[\"cab\",\"ad\",\"bad\",\"c\"]\n[\"abc\",\"bcd\",\"abcd\"]",
+            "__typename": "QuestionNode"
+        }
+    }
+}
\ No newline at end of file
diff --git a/leetcode-cn/problem (Chinese)/K 个不相交子数组的最大能量值 [maximum-strength-of-k-disjoint-subarrays].html b/leetcode-cn/problem (Chinese)/K 个不相交子数组的最大能量值 [maximum-strength-of-k-disjoint-subarrays].html
new file mode 100644
index 00000000..fae14218
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/K 个不相交子数组的最大能量值 [maximum-strength-of-k-disjoint-subarrays].html	
@@ -0,0 +1,47 @@
+
给你一个长度为 n 下标从 0 开始的整数数组 nums 和一个 正奇数 整数 k 。

+
+
x 个子数组的能量值定义为 strength = sum[1] * x - sum[2] * (x - 1) + sum[3] * (x - 2) - sum[4] * (x - 3) + ... + sum[x] * 1 ，其中 sum[i] 是第 i 个子数组的和。更正式的，能量值是满足 1 <= i <= x 的所有 i 对应的 (-1)i+1 * sum[i] * (x - i + 1) 之和。

+
+
你需要在 nums 中选择 k 个 不相交子数组 ，使得 能量值最大 。

+
+
请你返回可以得到的 最大能量值 。

+
+
注意，选出来的所有子数组 不 需要覆盖整个数组。

+
+
 

+
+
示例 1：

+
+
+输入：nums = [1,2,3,-1,2], k = 3
+输出：22
+解释：选择 3 个子数组的最好方式是选择：nums[0..2] ，nums[3..3] 和 nums[4..4] 。能量值为 (1 + 2 + 3) * 3 - (-1) * 2 + 2 * 1 = 22 。
+

+
+
示例 2：

+
+
+输入：nums = [12,-2,-2,-2,-2], k = 5
+输出：64
+解释：唯一一种选 5 个不相交子数组的方案是：nums[0..0] ，nums[1..1] ，nums[2..2] ，nums[3..3] 和 nums[4..4] 。能量值为 12 * 5 - (-2) * 4 + (-2) * 3 - (-2) * 2 + (-2) * 1 = 64 。
+

+
+
示例 3：

+
+
+输入：nums = [-1,-2,-3], k = 1
+输出：-1
+解释：选择 1 个子数组的最优方案是：nums[0..0] 。能量值为 -1 。
+

+
+
 

+
+
提示：

+
+
    
+	
  • 1 <= n <= 104
    • 
+	
  • -109 <= nums[i] <= 109
    • 
+	
  • 1 <= k <= n
    • 
+	
  • 1 <= n * k <= 106
    • 
+	
  • k 是奇数。
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/元素和小于等于 k 的子矩阵的数目 [count-submatrices-with-top-left-element-and-sum-less-than-k].html b/leetcode-cn/problem (Chinese)/元素和小于等于 k 的子矩阵的数目 [count-submatrices-with-top-left-element-and-sum-less-than-k].html
new file mode 100644
index 00000000..81dd3d45
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/元素和小于等于 k 的子矩阵的数目 [count-submatrices-with-top-left-element-and-sum-less-than-k].html	
@@ -0,0 +1,32 @@
+
给你一个下标从 0 开始的整数矩阵 grid 和一个整数 k。

+
+
返回包含 grid 左上角元素、元素和小于或等于 k 的 子矩阵的数目。

+
+
 

+
+
示例 1：

+
+
+输入：grid = [[7,6,3],[6,6,1]], k = 18
+输出：4
+解释：如上图所示，只有 4 个子矩阵满足：包含 grid 的左上角元素，并且元素和小于或等于 18 。

+
+
示例 2：

+
+
+输入：grid = [[7,2,9],[1,5,0],[2,6,6]], k = 20
+输出：6
+解释：如上图所示，只有 6 个子矩阵满足：包含 grid 的左上角元素，并且元素和小于或等于 20 。
+

+
+
 

+
+
提示：

+
+
    
+	
  • m == grid.length 
    • 
+	
  • n == grid[i].length
    • 
+	
  • 1 <= n, m <= 1000 
    • 
+	
  • 0 <= grid[i][j] <= 1000
    • 
+	
  • 1 <= k <= 109
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/在带权树网络中统计可连接服务器对数目 [count-pairs-of-connectable-servers-in-a-weighted-tree-network].html b/leetcode-cn/problem (Chinese)/在带权树网络中统计可连接服务器对数目 [count-pairs-of-connectable-servers-in-a-weighted-tree-network].html
new file mode 100644
index 00000000..78d47137
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/在带权树网络中统计可连接服务器对数目 [count-pairs-of-connectable-servers-in-a-weighted-tree-network].html	
@@ -0,0 +1,52 @@
+
给你一棵无根带权树，树中总共有 n 个节点，分别表示 n 个服务器，服务器从 0 到 n - 1 编号。同时给你一个数组 edges ，其中 edges[i] = [ai, bi, weighti] 表示节点 ai 和 bi 之间有一条双向边，边的权值为 weighti 。再给你一个整数 signalSpeed 。

+
+
如果两个服务器 a ，b 和 c 满足以下条件，那么我们称服务器 a 和 b 是通过服务器 c 可连接的 ：

+
+
    
+	
  • a < b ，a != c 且 b != c 。
    • 
+	
  • 从 c 到 a 的距离是可以被 signalSpeed 整除的。
    • 
+	
  • 从 c 到 b 的距离是可以被 signalSpeed 整除的。
    • 
+	
  • 从 c 到 b 的路径与从 c 到 a 的路径没有任何公共边。
    • 
+

+
+
请你返回一个长度为 n 的整数数组 count ，其中 count[i] 表示通过服务器 i 可连接 的服务器对的 数目 。

+
+
 

+
+
示例 1：

+
+

+
+
+输入：edges = [[0,1,1],[1,2,5],[2,3,13],[3,4,9],[4,5,2]], signalSpeed = 1
+输出：[0,4,6,6,4,0]
+解释：由于 signalSpeed 等于 1 ，count[c] 等于所有从 c 开始且没有公共边的路径对数目。
+在输入图中，count[c] 等于服务器 c 左边服务器数目乘以右边服务器数目。
+

+
+
示例 2：

+
+

+
+
+输入：edges = [[0,6,3],[6,5,3],[0,3,1],[3,2,7],[3,1,6],[3,4,2]], signalSpeed = 3
+输出：[2,0,0,0,0,0,2]
+解释：通过服务器 0 ，有 2 个可连接服务器对(4, 5) 和 (4, 6) 。
+通过服务器 6 ，有 2 个可连接服务器对 (4, 5) 和 (0, 5) 。
+所有服务器对都必须通过服务器 0 或 6 才可连接，所以其他服务器对应的可连接服务器对数目都为 0 。
+

+
+
 

+
+
提示：

+
+
    
+	
  • 2 <= n <= 1000
    • 
+	
  • edges.length == n - 1
    • 
+	
  • edges[i].length == 3
    • 
+	
  • 0 <= ai, bi < n
    • 
+	
  • edges[i] = [ai, bi, weighti]
    • 
+	
  • 1 <= weighti <= 106
    • 
+	
  • 1 <= signalSpeed <= 106
    • 
+	
  • 输入保证 edges 构成一棵合法的树。
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/在矩阵上写出字母 Y 所需的最少操作次数 [minimum-operations-to-write-the-letter-y-on-a-grid].html b/leetcode-cn/problem (Chinese)/在矩阵上写出字母 Y 所需的最少操作次数 [minimum-operations-to-write-the-letter-y-on-a-grid].html
new file mode 100644
index 00000000..8885f032
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/在矩阵上写出字母 Y 所需的最少操作次数 [minimum-operations-to-write-the-letter-y-on-a-grid].html	
@@ -0,0 +1,50 @@
+
给你一个下标从 0 开始、大小为 n x n 的矩阵 grid ，其中 n 为奇数，且 grid[r][c] 的值为 0 、1 或 2 。

+
+
如果一个单元格属于以下三条线中的任一一条，我们就认为它是字母 Y 的一部分：

+
+
    
+	
  • 从左上角单元格开始到矩阵中心单元格结束的对角线。
    • 
+	
  • 从右上角单元格开始到矩阵中心单元格结束的对角线。
    • 
+	
  • 从中心单元格开始到矩阵底部边界结束的垂直线。
    • 
+

+
+
当且仅当满足以下全部条件时，可以判定矩阵上写有字母 Y ：

+
+
    
+	
  • 属于 Y 的所有单元格的值相等。
    • 
+	
  • 不属于 Y 的所有单元格的值相等。
    • 
+	
  • 属于 Y 的单元格的值与不属于Y的单元格的值不同。
    • 
+

+
+
每次操作你可以将任意单元格的值改变为 0 、1 或 2 。返回在矩阵上写出字母 Y 所需的 最少 操作次数。

+
+
 

+
+
示例 1：

+
+
+输入：grid = [[1,2,2],[1,1,0],[0,1,0]]
+输出：3
+解释：将在矩阵上写出字母 Y 需要执行的操作用蓝色高亮显示。操作后，所有属于 Y 的单元格（加粗显示）的值都为 1 ，而不属于 Y 的单元格的值都为 0 。
+可以证明，写出 Y 至少需要进行 3 次操作。
+

+
+
示例 2：

+
+
+输入：grid = [[0,1,0,1,0],[2,1,0,1,2],[2,2,2,0,1],[2,2,2,2,2],[2,1,2,2,2]]
+输出：12
+解释：将在矩阵上写出字母 Y 需要执行的操作用蓝色高亮显示。操作后，所有属于 Y 的单元格（加粗显示）的值都为 0 ，而不属于 Y 的单元格的值都为 2 。
+可以证明，写出 Y 至少需要进行 12 次操作。
+

+
+
 

+
+
提示：

+
+
    
+	
  • 3 <= n <= 49
    • 
+	
  • n == grid.length == grid[i].length
    • 
+	
  • 0 <= grid[i][j] <= 2
    • 
+	
  • n 为奇数。
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/字符串及其反转中是否存在同一子字符串 [existence-of-a-substring-in-a-string-and-its-reverse].html b/leetcode-cn/problem (Chinese)/字符串及其反转中是否存在同一子字符串 [existence-of-a-substring-in-a-string-and-its-reverse].html
new file mode 100644
index 00000000..1e53b533
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/字符串及其反转中是否存在同一子字符串 [existence-of-a-substring-in-a-string-and-its-reverse].html	
@@ -0,0 +1,44 @@
+
给你一个字符串 s ，请你判断字符串 s 是否存在一个长度为 2 的子字符串，在其反转后的字符串中也出现。

+
+
如果存在这样的子字符串，返回 true；如果不存在，返回 false 。

+
+
 

+
+
示例 1：

+
+

+
输入：s = "leetcode"

+
+
输出：true

+
+
解释：子字符串 "ee" 的长度为 2，它也出现在 reverse(s) == "edocteel" 中。

+

+
+
示例 2：

+
+

+
输入：s = "abcba"

+
+
输出：true

+
+
解释：所有长度为 2 的子字符串 "ab"、"bc"、"cb"、"ba" 也都出现在 reverse(s) == "abcba" 中。

+

+
+
示例 3：

+
+

+
输入：s = "abcd"

+
+
输出：false

+
+
解释：字符串 s 中不存在满足「在其反转后的字符串中也出现」且长度为 2 的子字符串。

+

+
+
 

+
+
提示：

+
+
    
+	
  • 1 <= s.length <= 100
    • 
+	
  • 字符串 s 仅由小写英文字母组成。
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/将元素分配到两个数组中 I [distribute-elements-into-two-arrays-i].html b/leetcode-cn/problem (Chinese)/将元素分配到两个数组中 I [distribute-elements-into-two-arrays-i].html
new file mode 100644
index 00000000..05a96843
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/将元素分配到两个数组中 I [distribute-elements-into-two-arrays-i].html	
@@ -0,0 +1,46 @@
+
给你一个下标从 1 开始、包含 不同 整数的数组 nums ，数组长度为 n 。

+
+
你需要通过 n 次操作，将 nums 中的所有元素分配到两个数组 arr1 和 arr2 中。在第一次操作中，将 nums[1] 追加到 arr1 。在第二次操作中，将 nums[2] 追加到 arr2 。之后，在第 i 次操作中：

+
+
    
+	
  • 如果 arr1 的最后一个元素 大于 arr2 的最后一个元素，就将 nums[i] 追加到 arr1 。否则，将 nums[i] 追加到 arr2 。
    • 
+

+
+
通过连接数组 arr1 和 arr2 形成数组 result 。例如，如果 arr1 == [1,2,3] 且 arr2 == [4,5,6] ，那么 result = [1,2,3,4,5,6] 。

+
+
返回数组 result 。

+
+
 

+
+
示例 1：

+
+
+输入：nums = [2,1,3]
+输出：[2,3,1]
+解释：在前两次操作后，arr1 = [2] ，arr2 = [1] 。
+在第 3 次操作中，由于 arr1 的最后一个元素大于 arr2 的最后一个元素（2 > 1），将 nums[3] 追加到 arr1 。
+3 次操作后，arr1 = [2,3] ，arr2 = [1] 。
+因此，连接形成的数组 result 是 [2,3,1] 。
+

+
+
示例 2：

+
+
+输入：nums = [5,4,3,8]
+输出：[5,3,4,8]
+解释：在前两次操作后，arr1 = [5] ，arr2 = [4] 。
+在第 3 次操作中，由于 arr1 的最后一个元素大于 arr2 的最后一个元素（5 > 4），将 nums[3] 追加到 arr1 ，因此 arr1 变为 [5,3] 。
+在第 4 次操作中，由于 arr2 的最后一个元素大于 arr1 的最后一个元素（4 > 3），将 nums[4] 追加到 arr2 ，因此 arr2 变为 [4,8] 。
+4 次操作后，arr1 = [5,3] ，arr2 = [4,8] 。
+因此，连接形成的数组 result 是 [5,3,4,8] 。
+

+
+
 

+
+
提示：

+
+
    
+	
  • 3 <= n <= 50
    • 
+	
  • 1 <= nums[i] <= 100
    • 
+	
  • nums中的所有元素都互不相同。
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/将元素分配到两个数组中 II [distribute-elements-into-two-arrays-ii].html b/leetcode-cn/problem (Chinese)/将元素分配到两个数组中 II [distribute-elements-into-two-arrays-ii].html
new file mode 100644
index 00000000..c77443ee
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/将元素分配到两个数组中 II [distribute-elements-into-two-arrays-ii].html	
@@ -0,0 +1,61 @@
+
给你一个下标从 1 开始、长度为 n 的整数数组 nums 。

+
+
现定义函数 greaterCount ，使得 greaterCount(arr, val) 返回数组 arr 中 严格大于 val 的元素数量。

+
+
你需要使用 n 次操作，将 nums 的所有元素分配到两个数组 arr1 和 arr2 中。在第一次操作中，将 nums[1] 追加到 arr1 。在第二次操作中，将 nums[2] 追加到 arr2 。之后，在第 i 次操作中：

+
+
    
+	
  • 如果 greaterCount(arr1, nums[i]) > greaterCount(arr2, nums[i]) ，将 nums[i] 追加到 arr1 。
    • 
+	
  • 如果 greaterCount(arr1, nums[i]) < greaterCount(arr2, nums[i]) ，将 nums[i] 追加到 arr2 。
    • 
+	
  • 如果 greaterCount(arr1, nums[i]) == greaterCount(arr2, nums[i]) ，将 nums[i] 追加到元素数量较少的数组中。
    • 
+	
  • 如果仍然相等，那么将 nums[i] 追加到 arr1 。
    • 
+

+
+
连接数组 arr1 和 arr2 形成数组 result 。例如，如果 arr1 == [1,2,3] 且 arr2 == [4,5,6] ，那么 result = [1,2,3,4,5,6] 。

+
+
返回整数数组 result 。

+
+
 

+
+
示例 1：

+
+
+输入：nums = [2,1,3,3]
+输出：[2,3,1,3]
+解释：在前两次操作后，arr1 = [2] ，arr2 = [1] 。
+在第 3 次操作中，两个数组中大于 3 的元素数量都是零，并且长度相等，因此，将 nums[3] 追加到 arr1 。
+在第 4 次操作中，两个数组中大于 3 的元素数量都是零，但 arr2 的长度较小，因此，将 nums[4] 追加到 arr2 。
+在 4 次操作后，arr1 = [2,3] ，arr2 = [1,3] 。
+因此，连接形成的数组 result 是 [2,3,1,3] 。
+

+
+
示例 2：

+
+
+输入：nums = [5,14,3,1,2]
+输出：[5,3,1,2,14]
+解释：在前两次操作后，arr1 = [5] ，arr2 = [14] 。
+在第 3 次操作中，两个数组中大于 3 的元素数量都是一，并且长度相等，因此，将 nums[3] 追加到 arr1 。
+在第 4 次操作中，arr1 中大于 1 的元素数量大于 arr2 中的数量（2 > 1），因此，将 nums[4] 追加到 arr1 。
+在第 5 次操作中，arr1 中大于 2 的元素数量大于 arr2 中的数量（2 > 1），因此，将 nums[5] 追加到 arr1 。
+在 5 次操作后，arr1 = [5,3,1,2] ，arr2 = [14] 。
+因此，连接形成的数组 result 是 [5,3,1,2,14] 。
+

+
+
示例 3：

+
+
+输入：nums = [3,3,3,3]
+输出：[3,3,3,3]
+解释：在 4 次操作后，arr1 = [3,3] ，arr2 = [3,3] 。
+因此，连接形成的数组 result 是 [3,3,3,3] 。
+

+
+
 

+
+
提示：

+
+
    
+	
  • 3 <= n <= 105
    • 
+	
  • 1 <= nums[i] <= 109
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/幸福值最大化的选择方案 [maximize-happiness-of-selected-children].html b/leetcode-cn/problem (Chinese)/幸福值最大化的选择方案 [maximize-happiness-of-selected-children].html
new file mode 100644
index 00000000..4e249ea9
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/幸福值最大化的选择方案 [maximize-happiness-of-selected-children].html	
@@ -0,0 +1,51 @@
+
给你一个长度为 n 的数组 happiness ，以及一个 正整数 k 。

+
+
n 个孩子站成一队，其中第 i 个孩子的 幸福值 是 happiness[i] 。你计划组织 k 轮筛选从这 n 个孩子中选出 k 个孩子。

+
+
在每一轮选择一个孩子时，所有 尚未 被选中的孩子的 幸福值 将减少 1 。注意，幸福值 不能 变成负数，且只有在它是正数的情况下才会减少。

+
+
选择 k 个孩子，并使你选中的孩子幸福值之和最大，返回你能够得到的 最大值 。

+
+
 

+
+
示例 1：

+
+
+输入：happiness = [1,2,3], k = 2
+输出：4
+解释：按以下方式选择 2 个孩子：
+- 选择幸福值为 3 的孩子。剩余孩子的幸福值变为 [0,1] 。
+- 选择幸福值为 1 的孩子。剩余孩子的幸福值变为 [0] 。注意幸福值不能小于 0 。
+所选孩子的幸福值之和为 3 + 1 = 4 。
+

+
+
示例 2：

+
+
+输入：happiness = [1,1,1,1], k = 2
+输出：1
+解释：按以下方式选择 2 个孩子：
+- 选择幸福值为 1 的任意一个孩子。剩余孩子的幸福值变为 [0,0,0] 。
+- 选择幸福值为 0 的孩子。剩余孩子的幸福值变为 [0,0] 。
+所选孩子的幸福值之和为 1 + 0 = 1 。
+

+
+
示例 3：

+
+
+输入：happiness = [2,3,4,5], k = 1
+输出：5
+解释：按以下方式选择 1 个孩子：
+- 选择幸福值为 5 的孩子。剩余孩子的幸福值变为 [1,2,3] 。
+所选孩子的幸福值之和为 5 。
+

+
+
 

+
+
提示：

+
+
    
+	
  • 1 <= n == happiness.length <= 2 * 105
    • 
+	
  • 1 <= happiness[i] <= 108
    • 
+	
  • 1 <= k <= n
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/成为 K 特殊字符串需要删除的最少字符数 [minimum-deletions-to-make-string-k-special].html b/leetcode-cn/problem (Chinese)/成为 K 特殊字符串需要删除的最少字符数 [minimum-deletions-to-make-string-k-special].html
new file mode 100644
index 00000000..4555ce1a
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/成为 K 特殊字符串需要删除的最少字符数 [minimum-deletions-to-make-string-k-special].html	
@@ -0,0 +1,49 @@
+
给你一个字符串 word 和一个整数 k。

+
+
如果 |freq(word[i]) - freq(word[j])| <= k 对于字符串中所有下标 i 和 j  都成立，则认为 word 是 k 特殊字符串。

+
+
此处，freq(x) 表示字符 x 在 word 中的出现频率，而 |y| 表示 y 的绝对值。

+
+
返回使 word 成为 k 特殊字符串 需要删除的字符的最小数量。

+
+
 

+
+
示例 1：

+
+

+
输入：word = "aabcaba", k = 0

+
+
输出：3

+
+
解释：可以删除 2 个 "a" 和 1 个 "c" 使 word 成为 0 特殊字符串。word 变为 "baba"，此时 freq('a') == freq('b') == 2。

+

+
+
示例 2：

+
+

+
输入：word = "dabdcbdcdcd", k = 2

+
+
输出：2

+
+
解释：可以删除 1 个 "a" 和 1 个 "d" 使 word 成为 2 特殊字符串。word 变为 "bdcbdcdcd"，此时 freq('b') == 2，freq('c') == 3，freq('d') == 4。

+

+
+
示例 3：

+
+

+
输入：word = "aaabaaa", k = 2

+
+
输出：1

+
+
解释：可以删除 1 个 "b" 使 word 成为 2特殊字符串。因此，word 变为 "aaaaaa"，此时每个字母的频率都是 6。

+

+
+
 

+
+
提示：

+
+
    
+	
  • 1 <= word.length <= 105
    • 
+	
  • 0 <= k <= 105
    • 
+	
  • word 仅由小写英文字母组成。
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/执行操作标记数组中的元素 [mark-elements-on-array-by-performing-queries].html b/leetcode-cn/problem (Chinese)/执行操作标记数组中的元素 [mark-elements-on-array-by-performing-queries].html
new file mode 100644
index 00000000..3844f6c7
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/执行操作标记数组中的元素 [mark-elements-on-array-by-performing-queries].html	
@@ -0,0 +1,57 @@
+
给你一个长度为 n 下标从 0 开始的正整数数组 nums 。

+
+
同时给你一个长度为 m 的二维操作数组 queries ，其中 queries[i] = [indexi, ki] 。

+
+
一开始，数组中的所有元素都 未标记 。

+
+
你需要依次对数组执行 m 次操作，第 i 次操作中，你需要执行：

+
+
    
+	
  • 如果下标 indexi 对应的元素还没标记，那么标记这个元素。
    • 
+	
  • 然后标记 ki 个数组中还没有标记的 最小 元素。如果有元素的值相等，那么优先标记它们中下标较小的。如果少于 ki 个未标记元素存在，那么将它们全部标记。
    • 
+

+
+
请你返回一个长度为 m 的数组 answer ，其中 answer[i]是第 i 次操作后数组中还没标记元素的 和 。

+
+
 

+
+
示例 1：

+
+

+
输入：nums = [1,2,2,1,2,3,1], queries = [[1,2],[3,3],[4,2]]

+
+
输出：[8,3,0]

+
+
解释：

+
+
我们依次对数组做以下操作：

+
+
    
+	
  • 标记下标为 1 的元素，同时标记 2 个未标记的最小元素。标记完后数组为 nums = [1,2,2,1,2,3,1] 。未标记元素的和为 2 + 2 + 3 + 1 = 8 。
    • 
+	
  • 标记下标为 3 的元素，由于它已经被标记过了，所以我们忽略这次标记，同时标记最靠前的 3 个未标记的最小元素。标记完后数组为 nums = [1,2,2,1,2,3,1] 。未标记元素的和为 3 。
    • 
+	
  • 标记下标为 4 的元素，由于它已经被标记过了，所以我们忽略这次标记，同时标记最靠前的 2 个未标记的最小元素。标记完后数组为 nums = [1,2,2,1,2,3,1] 。未标记元素的和为 0 。
    • 
+

+

+
+
示例 2：

+
+

+
输入：nums = [1,4,2,3], queries = [[0,1]]

+
+
输出：[7]

+
+
解释：我们执行一次操作，将下标为 0 处的元素标记，并且标记最靠前的 1 个未标记的最小元素。标记完后数组为 nums = [1,4,2,3] 。未标记元素的和为 4 + 3 = 7 。

+

+
+
 

+
+
提示：

+
+
    
+	
  • n == nums.length
    • 
+	
  • m == queries.length
    • 
+	
  • 1 <= m <= n <= 105
    • 
+	
  • 1 <= nums[i] <= 105
    • 
+	
  • queries[i].length == 2
    • 
+	
  • 0 <= indexi, ki <= n - 1
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/拾起 K 个 1 需要的最少行动次数 [minimum-moves-to-pick-k-ones].html b/leetcode-cn/problem (Chinese)/拾起 K 个 1 需要的最少行动次数 [minimum-moves-to-pick-k-ones].html
new file mode 100644
index 00000000..ce126663
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/拾起 K 个 1 需要的最少行动次数 [minimum-moves-to-pick-k-ones].html	
@@ -0,0 +1,60 @@
+
给你一个下标从 0 开始的二进制数组 nums，其长度为 n ；另给你一个 正整数 k 以及一个 非负整数 maxChanges 。

+
+
Alice 在玩一个游戏，游戏的目标是让 Alice 使用 最少 数量的 行动 次数从 nums 中拾起 k 个 1 。游戏开始时，Alice 可以选择数组 [0, n - 1] 范围内的任何索引 aliceIndex 站立。如果 nums[aliceIndex] == 1 ，Alice 会拾起一个 1 ，并且 nums[aliceIndex] 变成0（这 不算 作一次行动）。之后，Alice 可以执行 任意数量 的 行动（包括零次），在每次行动中 Alice 必须 恰好 执行以下动作之一：

+
+
    
+	
  • 选择任意一个下标 j != aliceIndex 且满足 nums[j] == 0 ，然后将 nums[j] 设置为 1 。这个动作最多可以执行 maxChanges 次。
    • 
+	
  • 选择任意两个相邻的下标 x 和 y（|x - y| == 1）且满足 nums[x] == 1, nums[y] == 0 ，然后交换它们的值（将 nums[y] = 1 和 nums[x] = 0）。如果 y == aliceIndex，在这次行动后 Alice 拾起一个 1 ，并且 nums[y] 变成 0 。
    • 
+

+
+
返回 Alice 拾起 恰好 k 个 1 所需的 最少 行动次数。

+
+
 

+
+
示例 1：

+
+

+
输入：nums = [1,1,0,0,0,1,1,0,0,1], k = 3, maxChanges = 1

+
+
输出：3

+
+
解释：如果游戏开始时 Alice 在 aliceIndex == 1 的位置上，按照以下步骤执行每个动作，他可以利用 3 次行动拾取 3 个 1 ：

+
+
    
+	
  • 游戏开始时 Alice 拾取了一个 1 ，nums[1] 变成了 0。此时 nums 变为 [1,1,1,0,0,1,1,0,0,1] 。
    • 
+	
  • 选择 j == 2 并执行第一种类型的动作。nums 变为 [1,0,1,0,0,1,1,0,0,1]
    • 
+	
  • 选择 x == 2 和 y == 1 ，并执行第二种类型的动作。nums 变为 [1,1,0,0,0,1,1,0,0,1] 。由于 y == aliceIndex，Alice 拾取了一个 1 ，nums 变为  [1,0,0,0,0,1,1,0,0,1] 。
    • 
+	
  • 选择 x == 0 和 y == 1 ，并执行第二种类型的动作。nums 变为 [0,1,0,0,0,1,1,0,0,1] 。由于 y == aliceIndex，Alice 拾取了一个 1 ，nums 变为  [0,0,0,0,0,1,1,0,0,1] 。
    • 
+

+
+
请注意，Alice 也可能执行其他的 3 次行动序列达成拾取 3 个 1 。

+

+
+
示例 2：

+
+

+
输入：nums = [0,0,0,0], k = 2, maxChanges = 3

+
+
输出：4

+
+
解释：如果游戏开始时 Alice 在 aliceIndex == 0 的位置上，按照以下步骤执行每个动作，他可以利用 4 次行动拾取 2 个 1 ：

+
+
    
+	
  • 选择 j == 1 并执行第一种类型的动作。nums 变为 [0,1,0,0] 。
    • 
+	
  • 选择 x == 1 和 y == 0 ，并执行第二种类型的动作。nums 变为 [1,0,0,0] 。由于 y == aliceIndex，Alice 拾起了一个 1 ，nums 变为 [0,0,0,0] 。
    • 
+	
  • 再次选择 j == 1 并执行第一种类型的动作。nums 变为 [0,1,0,0] 。
    • 
+	
  • 再次选择 x == 1 和 y == 0 ，并执行第二种类型的动作。nums 变为 [1,0,0,0] 。由于y == aliceIndex，Alice 拾起了一个 1 ，nums 变为 [0,0,0,0] 。
    • 
+

+

+
+
 

+
+
提示：

+
+
    
+	
  • 2 <= n <= 105
    • 
+	
  • 0 <= nums[i] <= 1
    • 
+	
  • 1 <= k <= 105
    • 
+	
  • 0 <= maxChanges <= 105
    • 
+	
  • maxChanges + sum(nums) >= k
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/数组中的最短非公共子字符串 [shortest-uncommon-substring-in-an-array].html b/leetcode-cn/problem (Chinese)/数组中的最短非公共子字符串 [shortest-uncommon-substring-in-an-array].html
new file mode 100644
index 00000000..5f1338a9
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/数组中的最短非公共子字符串 [shortest-uncommon-substring-in-an-array].html	
@@ -0,0 +1,45 @@
+
给你一个数组 arr ，数组中有 n 个 非空 字符串。

+
+
请你求出一个长度为 n 的字符串 answer ，满足：

+
+
    
+	
  • answer[i] 是 arr[i] 最短 的子字符串，且它不是 arr 中其他任何字符串的子字符串。如果有多个这样的子字符串存在，answer[i] 应该是它们中字典序最小的一个。如果不存在这样的子字符串，answer[i] 为空字符串。
    • 
+

+
+
请你返回数组 answer 。

+
+
 

+
+
示例 1：

+
+
+输入：arr = ["cab","ad","bad","c"]
+输出：["ab","","ba",""]
+解释：求解过程如下：
+- 对于字符串 "cab" ，最短没有在其他字符串中出现过的子字符串是 "ca" 或者 "ab" ，我们选择字典序更小的子字符串，也就是 "ab" 。
+- 对于字符串 "ad" ，不存在没有在其他字符串中出现过的子字符串。
+- 对于字符串 "bad" ，最短没有在其他字符串中出现过的子字符串是 "ba" 。
+- 对于字符串 "c" ，不存在没有在其他字符串中出现过的子字符串。
+

+
+
示例 2：

+
+
+输入：arr = ["abc","bcd","abcd"]
+输出：["","","abcd"]
+解释：求解过程如下：
+- 对于字符串 "abc" ，不存在没有在其他字符串中出现过的子字符串。
+- 对于字符串 "bcd" ，不存在没有在其他字符串中出现过的子字符串。
+- 对于字符串 "abcd" ，最短没有在其他字符串中出现过的子字符串是 "abcd" 。
+

+
+
 

+
+
提示：

+
+
    
+	
  • n == arr.length
    • 
+	
  • 2 <= n <= 100
    • 
+	
  • 1 <= arr[i].length <= 20
    • 
+	
  • arr[i] 只包含小写英文字母。
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/替换字符串中的问号使分数最小 [replace-question-marks-in-string-to-minimize-its-value].html b/leetcode-cn/problem (Chinese)/替换字符串中的问号使分数最小 [replace-question-marks-in-string-to-minimize-its-value].html
new file mode 100644
index 00000000..26ecc6c7
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/替换字符串中的问号使分数最小 [replace-question-marks-in-string-to-minimize-its-value].html	
@@ -0,0 +1,61 @@
+
给你一个字符串 s 。s[i] 要么是小写英文字母，要么是问号 '?' 。

+
+
对于长度为 m 且 只 含有小写英文字母的字符串 t ，我们定义函数 cost(i) 为下标 i 之前（也就是范围 [0, i - 1] 中）出现过与 t[i] 相同 字符出现的次数。

+
+
字符串 t 的 分数 为所有下标 i 的 cost(i) 之 和 。

+
+
比方说，字符串 t = "aab" ：

+
+
    
+	
  • cost(0) = 0
    • 
+	
  • cost(1) = 1
    • 
+	
  • cost(2) = 0
    • 
+	
  • 所以，字符串 "aab" 的分数为 0 + 1 + 0 = 1 。
    • 
+

+
+
你的任务是用小写英文字母 替换 s 中 所有 问号，使 s 的 分数最小 。

+
+
请你返回替换所有问号 '?' 之后且分数最小的字符串。如果有多个字符串的 分数最小 ，那么返回字典序最小的一个。

+
+
 

+
+
示例 1：

+
+

+
输入：s = "???" 

+
+
输出： "abc" 

+
+
解释：这个例子中，我们将 s 中的问号 '?' 替换得到 "abc" 。

+
+
对于字符串 "abc" ，cost(0) = 0 ，cost(1) = 0 和 cost(2) = 0 。

+
+
"abc" 的分数为 0 。

+
+
其他修改 s 得到分数 0 的字符串为 "cba" ，"abz" 和 "hey" 。

+
+
这些字符串中，我们返回字典序最小的。

+

+
+
示例 2：

+
+

+
输入： s = "a?a?"

+
+
输出： "abac"

+
+
解释：这个例子中，我们将 s 中的问号 '?' 替换得到 "abac" 。

+
+
对于字符串 "abac" ，cost(0) = 0 ，cost(1) = 0 ，cost(2) = 1 和 cost(3) = 0 。

+
+
"abac" 的分数为 1 。

+

+
+
 

+
+
提示：

+
+
    
+	
  • 1 <= s.length <= 105
    • 
+	
  • s[i] 要么是小写英文字母，要么是 '?' 。
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/最大节点价值之和 [find-the-maximum-sum-of-node-values].html b/leetcode-cn/problem (Chinese)/最大节点价值之和 [find-the-maximum-sum-of-node-values].html
new file mode 100644
index 00000000..bd070b52
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/最大节点价值之和 [find-the-maximum-sum-of-node-values].html	
@@ -0,0 +1,67 @@
+
给你一棵 n 个节点的 无向 树，节点从 0 到 n - 1 编号。树以长度为 n - 1 下标从 0 开始的二维整数数组 edges 的形式给你，其中 edges[i] = [ui, vi] 表示树中节点 ui 和 vi 之间有一条边。同时给你一个 正 整数 k 和一个长度为 n 下标从 0 开始的 非负 整数数组 nums ，其中 nums[i] 表示节点 i 的 价值 。

+
+
Alice 想 最大化 树中所有节点价值之和。为了实现这一目标，Alice 可以执行以下操作 任意 次（包括 0 次）：

+
+
    
+	
  • 选择连接节点 u 和 v 的边 [u, v] ，并将它们的值更新为：
+
+	
      
+		
    • nums[u] = nums[u] XOR k
      • 
+		
    • nums[v] = nums[v] XOR k
      • 
+	
    
+	
    • 
+

+
+
请你返回 Alice 通过执行以上操作 任意次 后，可以得到所有节点 价值之和 的 最大值 。

+
+
 

+
+
示例 1：

+
+

+
+
+输入：nums = [1,2,1], k = 3, edges = [[0,1],[0,2]]
+输出：6
+解释：Alice 可以通过一次操作得到最大价值和 6 ：
+- 选择边 [0,2] 。nums[0] 和 nums[2] 都变为：1 XOR 3 = 2 ，数组 nums 变为：[1,2,1] -> [2,2,2] 。
+所有节点价值之和为 2 + 2 + 2 = 6 。
+6 是可以得到最大的价值之和。
+

+
+
示例 2：

+
+

+
+
+输入：nums = [2,3], k = 7, edges = [[0,1]]
+输出：9
+解释：Alice 可以通过一次操作得到最大和 9 ：
+- 选择边 [0,1] 。nums[0] 变为：2 XOR 7 = 5 ，nums[1] 变为：3 XOR 7 = 4 ，数组 nums 变为：[2,3] -> [5,4] 。
+所有节点价值之和为 5 + 4 = 9 。
+9 是可以得到最大的价值之和。
+

+
+
示例 3：

+
+

+
+
+输入：nums = [7,7,7,7,7,7], k = 3, edges = [[0,1],[0,2],[0,3],[0,4],[0,5]]
+输出：42
+解释：Alice 不需要执行任何操作，就可以得到最大价值之和 42 。
+

+
+
 

+
+
提示：

+
+
    
+	
  • 2 <= n == nums.length <= 2 * 104
    • 
+	
  • 1 <= k <= 109
    • 
+	
  • 0 <= nums[i] <= 109
    • 
+	
  • edges.length == n - 1
    • 
+	
  • edges[i].length == 2
    • 
+	
  • 0 <= edges[i][0], edges[i][1] <= n - 1
    • 
+	
  • 输入保证 edges 构成一棵合法的树。
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/求出加密整数的和 [find-the-sum-of-encrypted-integers].html b/leetcode-cn/problem (Chinese)/求出加密整数的和 [find-the-sum-of-encrypted-integers].html
new file mode 100644
index 00000000..d2a9c056
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/求出加密整数的和 [find-the-sum-of-encrypted-integers].html	
@@ -0,0 +1,34 @@
+
给你一个整数数组 nums ，数组中的元素都是 正 整数。定义一个加密函数 encrypt ，encrypt(x) 将一个整数 x 中 每一个 数位都用 x 中的 最大 数位替换。比方说 encrypt(523) = 555 且 encrypt(213) = 333 。

+
+
请你返回数组中所有元素加密后的 和 。

+
+
 

+
+
示例 1：

+
+

+
输入：nums = [1,2,3]

+
+
输出：6

+
+
解释：加密后的元素位 [1,2,3] 。加密元素的和为 1 + 2 + 3 == 6 。

+

+
+
示例 2：

+
+

+
输入：nums = [10,21,31]

+
+
输出：66

+
+
解释：加密后的元素为 [11,22,33] 。加密元素的和为 11 + 22 + 33 == 66 。

+

+
+
 

+
+
提示：

+
+
    
+	
  • 1 <= nums.length <= 50
    • 
+	
  • 1 <= nums[i] <= 1000
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/求出所有子序列的能量和 [find-the-sum-of-the-power-of-all-subsequences].html b/leetcode-cn/problem (Chinese)/求出所有子序列的能量和 [find-the-sum-of-the-power-of-all-subsequences].html
new file mode 100644
index 00000000..34b7e324
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/求出所有子序列的能量和 [find-the-sum-of-the-power-of-all-subsequences].html	
@@ -0,0 +1,71 @@
+
给你一个长度为 n 的整数数组 nums 和一个 正 整数 k 。

+
+
一个整数数组的 能量 定义为和 等于 k 的子序列的数目。

+
+
请你返回 nums 中所有子序列的 能量和 。

+
+
由于答案可能很大，请你将它对 109 + 7 取余 后返回。

+
+
 

+
+
示例 1：

+
+

+
输入：  nums = [1,2,3], k = 3 

+
+
输出：  6 

+
+
解释：

+
+
总共有 5 个能量不为 0 的子序列：

+
+
    
+	
  • 子序列 [1,2,3] 有 2 个和为 3 的子序列：[1,2,3] 和 [1,2,3] 。
    • 
+	
  • 子序列 [1,2,3] 有 1 个和为 3 的子序列：[1,2,3] 。
    • 
+	
  • 子序列 [1,2,3] 有 1 个和为 3 的子序列：[1,2,3] 。
    • 
+	
  • 子序列 [1,2,3] 有 1 个和为 3 的子序列：[1,2,3] 。
    • 
+	
  • 子序列 [1,2,3] 有 1 个和为 3 的子序列：[1,2,3] 。
    • 
+

+
+
所以答案为 2 + 1 + 1 + 1 + 1 = 6 。

+

+
+
示例 2：

+
+

+
输入：  nums = [2,3,3], k = 5 

+
+
输出：  4 

+
+
解释：

+
+
总共有 3 个能量不为 0 的子序列：

+
+
    
+	
  • 子序列 [2,3,3] 有 2 个子序列和为 5 ：[2,3,3] 和 [2,3,3] 。
    • 
+	
  • 子序列 [2,3,3] 有 1 个子序列和为 5 ：[2,3,3] 。
    • 
+	
  • 子序列 [2,3,3] 有 1 个子序列和为 5 ：[2,3,3] 。
    • 
+

+
+
所以答案为 2 + 1 + 1 = 4 。

+

+
+
示例 3：

+
+

+
输入：  nums = [1,2,3], k = 7 

+
+
输出：  0 

+
+
解释：不存在和为 7 的子序列，所以 nums 的能量和为 0 。

+

+
+
 

+
+
提示：

+
+
    
+	
  • 1 <= n <= 100
    • 
+	
  • 1 <= nums[i] <= 104
    • 
+	
  • 1 <= k <= 100
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/统计以给定字符开头和结尾的子字符串总数 [count-substrings-starting-and-ending-with-given-character].html b/leetcode-cn/problem (Chinese)/统计以给定字符开头和结尾的子字符串总数 [count-substrings-starting-and-ending-with-given-character].html
new file mode 100644
index 00000000..5ca8b3ce
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/统计以给定字符开头和结尾的子字符串总数 [count-substrings-starting-and-ending-with-given-character].html	
@@ -0,0 +1,32 @@
+
给你一个字符串 s 和一个字符 c 。返回在字符串 s 中并且以 c 字符开头和结尾的非空子字符串的总数。

+
+
 

+
+
示例 1：

+
+

+
输入：s = "abada", c = "a"

+
+
输出：6

+
+
解释：以 "a" 开头和结尾的子字符串有： "abada"、"abada"、"abada"、"abada"、"abada"、"abada"。

+

+
+
示例 2：

+
+

+
输入：s = "zzz", c = "z"

+
+
输出：6

+
+
解释：字符串 s 中总共有 6 个子字符串，并且它们都以 "z" 开头和结尾。

+

+
+
 

+
+
提示：

+
+
    
+	
  • 1 <= s.length <= 105
    • 
+	
  • s 和 c 均由小写英文字母组成。
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/超过阈值的最少操作数 I [minimum-operations-to-exceed-threshold-value-i].html b/leetcode-cn/problem (Chinese)/超过阈值的最少操作数 I [minimum-operations-to-exceed-threshold-value-i].html
new file mode 100644
index 00000000..73406643
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/超过阈值的最少操作数 I [minimum-operations-to-exceed-threshold-value-i].html	
@@ -0,0 +1,45 @@
+
给你一个下标从 0 开始的整数数组 nums 和一个整数 k 。

+
+
一次操作中，你可以删除 nums 中的最小元素。

+
+
你需要使数组中的所有元素都大于或等于 k ，请你返回需要的 最少 操作次数。

+
+
 

+
+
示例 1：

+
+
+输入：nums = [2,11,10,1,3], k = 10
+输出：3
+解释：第一次操作后，nums 变为 [2, 11, 10, 3] 。
+第二次操作后，nums 变为 [11, 10, 3] 。
+第三次操作后，nums 变为 [11, 10] 。
+此时，数组中的所有元素都大于等于 10 ，所以我们停止操作。
+使数组中所有元素都大于等于 10 需要的最少操作次数为 3 。
+

+
+
示例 2：

+
+
+输入：nums = [1,1,2,4,9], k = 1
+输出：0
+解释：数组中的所有元素都大于等于 1 ，所以不需要对 nums 做任何操作。

+
+
示例 3：

+
+
+输入：nums = [1,1,2,4,9], k = 9
+输出：4
+解释：nums 中只有一个元素大于等于 9 ，所以需要执行 4 次操作。
+

+
+
 

+
+
提示：

+
+
    
+	
  • 1 <= nums.length <= 50
    • 
+	
  • 1 <= nums[i] <= 109
    • 
+	
  • 1 <= k <= 109
    • 
+	
  • 输入保证至少有一个满足 nums[i] >= k 的下标 i 存在。
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/超过阈值的最少操作数 II [minimum-operations-to-exceed-threshold-value-ii].html b/leetcode-cn/problem (Chinese)/超过阈值的最少操作数 II [minimum-operations-to-exceed-threshold-value-ii].html
new file mode 100644
index 00000000..e5dd0969
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/超过阈值的最少操作数 II [minimum-operations-to-exceed-threshold-value-ii].html	
@@ -0,0 +1,49 @@
+
给你一个下标从 0 开始的整数数组 nums 和一个整数 k 。

+
+
一次操作中，你将执行：

+
+
    
+	
  • 选择 nums 中最小的两个整数 x 和 y 。
    • 
+	
  • 将 x 和 y 从 nums 中删除。
    • 
+	
  • 将 min(x, y) * 2 + max(x, y) 添加到数组中的任意位置。
    • 
+

+
+
注意，只有当 nums 至少包含两个元素时，你才可以执行以上操作。

+
+
你需要使数组中的所有元素都大于或等于 k ，请你返回需要的 最少 操作次数。

+
+
 

+
+
示例 1：

+
+
+输入：nums = [2,11,10,1,3], k = 10
+输出：2
+解释：第一次操作中，我们删除元素 1 和 2 ，然后添加 1 * 2 + 2 到 nums 中，nums 变为 [4, 11, 10, 3] 。
+第二次操作中，我们删除元素 3 和 4 ，然后添加 3 * 2 + 4 到 nums 中，nums 变为 [10, 11, 10] 。
+此时，数组中的所有元素都大于等于 10 ，所以我们停止操作。
+使数组中所有元素都大于等于 10 需要的最少操作次数为 2 。
+

+
+
示例 2：

+
+
+输入：nums = [1,1,2,4,9], k = 20
+输出：4
+解释：第一次操作后，nums 变为 [2, 4, 9, 3] 。
+第二次操作后，nums 变为 [7, 4, 9] 。
+第三次操作后，nums 变为 [15, 9] 。
+第四次操作后，nums 变为 [33] 。
+此时，数组中的所有元素都大于等于 20 ，所以我们停止操作。
+使数组中所有元素都大于等于 20 需要的最少操作次数为 4 。

+
+
 

+
+
提示：

+
+
    
+	
  • 2 <= nums.length <= 2 * 105
    • 
+	
  • 1 <= nums[i] <= 109
    • 
+	
  • 1 <= k <= 109
    • 
+	
  • 输入保证答案一定存在，也就是说一定存在一个操作序列使数组中所有元素都大于等于 k 。
    • 
+

diff --git a/leetcode-cn/problem (Chinese)/重新分装苹果 [apple-redistribution-into-boxes].html b/leetcode-cn/problem (Chinese)/重新分装苹果 [apple-redistribution-into-boxes].html
new file mode 100644
index 00000000..2d65ccc1
--- /dev/null
+++ b/leetcode-cn/problem (Chinese)/重新分装苹果 [apple-redistribution-into-boxes].html	
@@ -0,0 +1,37 @@
+
给你一个长度为 n 的数组 apple 和另一个长度为 m 的数组 capacity 。

+
+
一共有 n 个包裹，其中第 i 个包裹中装着 apple[i] 个苹果。同时，还有 m 个箱子，第 i 个箱子的容量为 capacity[i] 个苹果。

+
+
请你选择一些箱子来将这 n 个包裹中的苹果重新分装到箱子中，返回你需要选择的箱子的 最小 数量。

+
+
注意，同一个包裹中的苹果可以分装到不同的箱子中。

+
+
 

+
+
示例 1：

+
+
+输入：apple = [1,3,2], capacity = [4,3,1,5,2]
+输出：2
+解释：使用容量为 4 和 5 的箱子。
+总容量大于或等于苹果的总数，所以可以完成重新分装。
+

+
+
示例 2：

+
+
+输入：apple = [5,5,5], capacity = [2,4,2,7]
+输出：4
+解释：需要使用所有箱子。
+

+
+
 

+
+
提示：

+
+
    
+	
  • 1 <= n == apple.length <= 50
    • 
+	
  • 1 <= m == capacity.length <= 50
    • 
+	
  • 1 <= apple[i], capacity[i] <= 50
    • 
+	
  • 输入数据保证可以将包裹中的苹果重新分装到箱子中。
    • 
+

diff --git a/leetcode-cn/problem (English)/K 个不相交子数组的最大能量值(English) [maximum-strength-of-k-disjoint-subarrays].html b/leetcode-cn/problem (English)/K 个不相交子数组的最大能量值(English) [maximum-strength-of-k-disjoint-subarrays].html
new file mode 100644
index 00000000..5373712c
--- /dev/null
+++ b/leetcode-cn/problem (English)/K 个不相交子数组的最大能量值(English) [maximum-strength-of-k-disjoint-subarrays].html	
@@ -0,0 +1,45 @@
+
You are given a 0-indexed array of integers nums of length n, and a positive odd integer k.

+
+
The strength of x subarrays is defined as strength = sum[1] * x - sum[2] * (x - 1) + sum[3] * (x - 2) - sum[4] * (x - 3) + ... + sum[x] * 1 where sum[i] is the sum of the elements in the ith subarray. Formally, strength is sum of (-1)i+1 * sum[i] * (x - i + 1) over all i's such that 1 <= i <= x.

+
+
You need to select k disjoint subarrays from nums, such that their strength is maximum.

+
+
Return the maximum possible strength that can be obtained.

+
+
Note that the selected subarrays don't need to cover the entire array.

+
+
 

+
Example 1:

+
+
+Input: nums = [1,2,3,-1,2], k = 3
+Output: 22
+Explanation: The best possible way to select 3 subarrays is: nums[0..2], nums[3..3], and nums[4..4]. The strength is (1 + 2 + 3) * 3 - (-1) * 2 + 2 * 1 = 22.
+

+
+
Example 2:

+
+
+Input: nums = [12,-2,-2,-2,-2], k = 5
+Output: 64
+Explanation: The only possible way to select 5 disjoint subarrays is: nums[0..0], nums[1..1], nums[2..2], nums[3..3], and nums[4..4]. The strength is 12 * 5 - (-2) * 4 + (-2) * 3 - (-2) * 2 + (-2) * 1 = 64.
+

+
+
Example 3:

+
+
+Input: nums = [-1,-2,-3], k = 1
+Output: -1
+Explanation: The best possible way to select 1 subarray is: nums[0..0]. The strength is -1.
+

+
+
 

+
Constraints:

+
+
    
+	
  • 1 <= n <= 104
    • 
+	
  • -109 <= nums[i] <= 109
    • 
+	
  • 1 <= k <= n
    • 
+	
  • 1 <= n * k <= 106
    • 
+	
  • k is odd.
    • 
+

diff --git a/leetcode-cn/problem (English)/元素和小于等于 k 的子矩阵的数目(English) [count-submatrices-with-top-left-element-and-sum-less-than-k].html b/leetcode-cn/problem (English)/元素和小于等于 k 的子矩阵的数目(English) [count-submatrices-with-top-left-element-and-sum-less-than-k].html
new file mode 100644
index 00000000..c9e3cf3c
--- /dev/null
+++ b/leetcode-cn/problem (English)/元素和小于等于 k 的子矩阵的数目(English) [count-submatrices-with-top-left-element-and-sum-less-than-k].html	
@@ -0,0 +1,30 @@
+
You are given a 0-indexed integer matrix grid and an integer k.

+
+
Return the number of submatrices that contain the top-left element of the grid, and have a sum less than or equal to k.

+
+
 

+
Example 1:

+
+
+Input: grid = [[7,6,3],[6,6,1]], k = 18
+Output: 4
+Explanation: There are only 4 submatrices, shown in the image above, that contain the top-left element of grid, and have a sum less than or equal to 18.

+
+
Example 2:

+
+
+Input: grid = [[7,2,9],[1,5,0],[2,6,6]], k = 20
+Output: 6
+Explanation: There are only 6 submatrices, shown in the image above, that contain the top-left element of grid, and have a sum less than or equal to 20.
+

+
+
 

+
Constraints:

+
+
    
+	
  • m == grid.length 
    • 
+	
  • n == grid[i].length
    • 
+	
  • 1 <= n, m <= 1000 
    • 
+	
  • 0 <= grid[i][j] <= 1000
    • 
+	
  • 1 <= k <= 109
    • 
+

diff --git a/leetcode-cn/problem (English)/在带权树网络中统计可连接服务器对数目(English) [count-pairs-of-connectable-servers-in-a-weighted-tree-network].html b/leetcode-cn/problem (English)/在带权树网络中统计可连接服务器对数目(English) [count-pairs-of-connectable-servers-in-a-weighted-tree-network].html
new file mode 100644
index 00000000..a99be0b8
--- /dev/null
+++ b/leetcode-cn/problem (English)/在带权树网络中统计可连接服务器对数目(English) [count-pairs-of-connectable-servers-in-a-weighted-tree-network].html	
@@ -0,0 +1,46 @@
+
You are given an unrooted weighted tree with n vertices representing servers numbered from 0 to n - 1, an array edges where edges[i] = [ai, bi, weighti] represents a bidirectional edge between vertices ai and bi of weight weighti. You are also given an integer signalSpeed.

+
+
Two servers a and b are connectable through a server c if:

+
+
    
+	
  • a < b, a != c and b != c.
    • 
+	
  • The distance from c to a is divisible by signalSpeed.
    • 
+	
  • The distance from c to b is divisible by signalSpeed.
    • 
+	
  • The path from c to b and the path from c to a do not share any edges.
    • 
+

+
+
Return an integer array count of length n where count[i] is the number of server pairs that are connectable through the server i.

+
+
 

+
Example 1:

+
+
+Input: edges = [[0,1,1],[1,2,5],[2,3,13],[3,4,9],[4,5,2]], signalSpeed = 1
+Output: [0,4,6,6,4,0]
+Explanation: Since signalSpeed is 1, count[c] is equal to the number of pairs of paths that start at c and do not share any edges.
+In the case of the given path graph, count[c] is equal to the number of servers to the left of c multiplied by the servers to the right of c.
+

+
+
Example 2:

+
+
+Input: edges = [[0,6,3],[6,5,3],[0,3,1],[3,2,7],[3,1,6],[3,4,2]], signalSpeed = 3
+Output: [2,0,0,0,0,0,2]
+Explanation: Through server 0, there are 2 pairs of connectable servers: (4, 5) and (4, 6).
+Through server 6, there are 2 pairs of connectable servers: (4, 5) and (0, 5).
+It can be shown that no two servers are connectable through servers other than 0 and 6.
+

+
+
 

+
Constraints:

+
+
    
+	
  • 2 <= n <= 1000
    • 
+	
  • edges.length == n - 1
    • 
+	
  • edges[i].length == 3
    • 
+	
  • 0 <= ai, bi < n
    • 
+	
  • edges[i] = [ai, bi, weighti]
    • 
+	
  • 1 <= weighti <= 106
    • 
+	
  • 1 <= signalSpeed <= 106
    • 
+	
  • The input is generated such that edges represents a valid tree.
    • 
+

diff --git a/leetcode-cn/problem (English)/在矩阵上写出字母 Y 所需的最少操作次数(English) [minimum-operations-to-write-the-letter-y-on-a-grid].html b/leetcode-cn/problem (English)/在矩阵上写出字母 Y 所需的最少操作次数(English) [minimum-operations-to-write-the-letter-y-on-a-grid].html
new file mode 100644
index 00000000..9beff3f9
--- /dev/null
+++ b/leetcode-cn/problem (English)/在矩阵上写出字母 Y 所需的最少操作次数(English) [minimum-operations-to-write-the-letter-y-on-a-grid].html	
@@ -0,0 +1,47 @@
+
You are given a 0-indexed n x n grid where n is odd, and grid[r][c] is 0, 1, or 2.

+
+
We say that a cell belongs to the Letter Y if it belongs to one of the following:

+
+
    
+	
  • The diagonal starting at the top-left cell and ending at the center cell of the grid.
    • 
+	
  • The diagonal starting at the top-right cell and ending at the center cell of the grid.
    • 
+	
  • The vertical line starting at the center cell and ending at the bottom border of the grid.
    • 
+

+
+
The Letter Y is written on the grid if and only if:

+
+
    
+	
  • All values at cells belonging to the Y are equal.
    • 
+	
  • All values at cells not belonging to the Y are equal.
    • 
+	
  • The values at cells belonging to the Y are different from the values at cells not belonging to the Y.
    • 
+

+
+
Return the minimum number of operations needed to write the letter Y on the grid given that in one operation you can change the value at any cell to 0, 1, or 2.

+
+
 

+
Example 1:

+
+
+Input: grid = [[1,2,2],[1,1,0],[0,1,0]]
+Output: 3
+Explanation: We can write Y on the grid by applying the changes highlighted in blue in the image above. After the operations, all cells that belong to Y, denoted in bold, have the same value of 1 while those that do not belong to Y are equal to 0.
+It can be shown that 3 is the minimum number of operations needed to write Y on the grid.
+

+
+
Example 2:

+
+
+Input: grid = [[0,1,0,1,0],[2,1,0,1,2],[2,2,2,0,1],[2,2,2,2,2],[2,1,2,2,2]]
+Output: 12
+Explanation: We can write Y on the grid by applying the changes highlighted in blue in the image above. After the operations, all cells that belong to Y, denoted in bold, have the same value of 0 while those that do not belong to Y are equal to 2. 
+It can be shown that 12 is the minimum number of operations needed to write Y on the grid.

+
+
 

+
Constraints:

+
+
    
+	
  • 3 <= n <= 49 
    • 
+	
  • n == grid.length == grid[i].length
    • 
+	
  • 0 <= grid[i][j] <= 2
    • 
+	
  • n is odd.
    • 
+

diff --git a/leetcode-cn/problem (English)/字符串及其反转中是否存在同一子字符串(English) [existence-of-a-substring-in-a-string-and-its-reverse].html b/leetcode-cn/problem (English)/字符串及其反转中是否存在同一子字符串(English) [existence-of-a-substring-in-a-string-and-its-reverse].html
new file mode 100644
index 00000000..fc3b3eb0
--- /dev/null
+++ b/leetcode-cn/problem (English)/字符串及其反转中是否存在同一子字符串(English) [existence-of-a-substring-in-a-string-and-its-reverse].html	
@@ -0,0 +1,42 @@
+
Given a string s, find any substring of length 2 which is also present in the reverse of s.

+
+
Return true if such a substring exists, and false otherwise.

+
+
 

+
Example 1:

+
+

+
Input: s = "leetcode"

+
+
Output: true

+
+
Explanation: Substring "ee" is of length 2 which is also present in reverse(s) == "edocteel".

+

+
+
Example 2:

+
+

+
Input: s = "abcba"

+
+
Output: true

+
+
Explanation: All of the substrings of length 2 "ab", "bc", "cb", "ba" are also present in reverse(s) == "abcba".

+

+
+
Example 3:

+
+

+
Input: s = "abcd"

+
+
Output: false

+
+
Explanation: There is no substring of length 2 in s, which is also present in the reverse of s.

+

+
+
 

+
Constraints:

+
+
    
+	
  • 1 <= s.length <= 100
    • 
+	
  • s consists only of lowercase English letters.
    • 
+

diff --git a/leetcode-cn/problem (English)/将元素分配到两个数组中 I(English) [distribute-elements-into-two-arrays-i].html b/leetcode-cn/problem (English)/将元素分配到两个数组中 I(English) [distribute-elements-into-two-arrays-i].html
new file mode 100644
index 00000000..55fb771e
--- /dev/null
+++ b/leetcode-cn/problem (English)/将元素分配到两个数组中 I(English) [distribute-elements-into-two-arrays-i].html	
@@ -0,0 +1,44 @@
+
You are given a 1-indexed array of distinct integers nums of length n.

+
+
You need to distribute all the elements of nums between two arrays arr1 and arr2 using n operations. In the first operation, append nums[1] to arr1. In the second operation, append nums[2] to arr2. Afterwards, in the ith operation:

+
+
    
+	
  • If the last element of arr1 is greater than the last element of arr2, append nums[i] to arr1. Otherwise, append nums[i] to arr2.
    • 
+

+
+
The array result is formed by concatenating the arrays arr1 and arr2. For example, if arr1 == [1,2,3] and arr2 == [4,5,6], then result = [1,2,3,4,5,6].

+
+
Return the array result.

+
+
 

+
Example 1:

+
+
+Input: nums = [2,1,3]
+Output: [2,3,1]
+Explanation: After the first 2 operations, arr1 = [2] and arr2 = [1].
+In the 3rd operation, as the last element of arr1 is greater than the last element of arr2 (2 > 1), append nums[3] to arr1.
+After 3 operations, arr1 = [2,3] and arr2 = [1].
+Hence, the array result formed by concatenation is [2,3,1].
+

+
+
Example 2:

+
+
+Input: nums = [5,4,3,8]
+Output: [5,3,4,8]
+Explanation: After the first 2 operations, arr1 = [5] and arr2 = [4].
+In the 3rd operation, as the last element of arr1 is greater than the last element of arr2 (5 > 4), append nums[3] to arr1, hence arr1 becomes [5,3].
+In the 4th operation, as the last element of arr2 is greater than the last element of arr1 (4 > 3), append nums[4] to arr2, hence arr2 becomes [4,8].
+After 4 operations, arr1 = [5,3] and arr2 = [4,8].
+Hence, the array result formed by concatenation is [5,3,4,8].
+

+
+
 

+
Constraints:

+
+
    
+	
  • 3 <= n <= 50
    • 
+	
  • 1 <= nums[i] <= 100
    • 
+	
  • All elements in nums are distinct.
    • 
+

diff --git a/leetcode-cn/problem (English)/将元素分配到两个数组中 II(English) [distribute-elements-into-two-arrays-ii].html b/leetcode-cn/problem (English)/将元素分配到两个数组中 II(English) [distribute-elements-into-two-arrays-ii].html
new file mode 100644
index 00000000..556ac467
--- /dev/null
+++ b/leetcode-cn/problem (English)/将元素分配到两个数组中 II(English) [distribute-elements-into-two-arrays-ii].html	
@@ -0,0 +1,59 @@
+
You are given a 1-indexed array of integers nums of length n.

+
+
We define a function greaterCount such that greaterCount(arr, val) returns the number of elements in arr that are strictly greater than val.

+
+
You need to distribute all the elements of nums between two arrays arr1 and arr2 using n operations. In the first operation, append nums[1] to arr1. In the second operation, append nums[2] to arr2. Afterwards, in the ith operation:

+
+
    
+	
  • If greaterCount(arr1, nums[i]) > greaterCount(arr2, nums[i]), append nums[i] to arr1.
    • 
+	
  • If greaterCount(arr1, nums[i]) < greaterCount(arr2, nums[i]), append nums[i] to arr2.
    • 
+	
  • If greaterCount(arr1, nums[i]) == greaterCount(arr2, nums[i]), append nums[i] to the array with a lesser number of elements.
    • 
+	
  • If there is still a tie, append nums[i] to arr1.
    • 
+

+
+
The array result is formed by concatenating the arrays arr1 and arr2. For example, if arr1 == [1,2,3] and arr2 == [4,5,6], then result = [1,2,3,4,5,6].

+
+
Return the integer array result.

+
+
 

+
Example 1:

+
+
+Input: nums = [2,1,3,3]
+Output: [2,3,1,3]
+Explanation: After the first 2 operations, arr1 = [2] and arr2 = [1].
+In the 3rd operation, the number of elements greater than 3 is zero in both arrays. Also, the lengths are equal, hence, append nums[3] to arr1.
+In the 4th operation, the number of elements greater than 3 is zero in both arrays. As the length of arr2 is lesser, hence, append nums[4] to arr2.
+After 4 operations, arr1 = [2,3] and arr2 = [1,3].
+Hence, the array result formed by concatenation is [2,3,1,3].
+

+
+
Example 2:

+
+
+Input: nums = [5,14,3,1,2]
+Output: [5,3,1,2,14]
+Explanation: After the first 2 operations, arr1 = [5] and arr2 = [14].
+In the 3rd operation, the number of elements greater than 3 is one in both arrays. Also, the lengths are equal, hence, append nums[3] to arr1.
+In the 4th operation, the number of elements greater than 1 is greater in arr1 than arr2 (2 > 1). Hence, append nums[4] to arr1.
+In the 5th operation, the number of elements greater than 2 is greater in arr1 than arr2 (2 > 1). Hence, append nums[5] to arr1.
+After 5 operations, arr1 = [5,3,1,2] and arr2 = [14].
+Hence, the array result formed by concatenation is [5,3,1,2,14].
+

+
+
Example 3:

+
+
+Input: nums = [3,3,3,3]
+Output: [3,3,3,3]
+Explanation: At the end of 4 operations, arr1 = [3,3] and arr2 = [3,3].
+Hence, the array result formed by concatenation is [3,3,3,3].
+

+
+
 

+
Constraints:

+
+
    
+	
  • 3 <= n <= 105
    • 
+	
  • 1 <= nums[i] <= 109
    • 
+

diff --git a/leetcode-cn/problem (English)/幸福值最大化的选择方案(English) [maximize-happiness-of-selected-children].html b/leetcode-cn/problem (English)/幸福值最大化的选择方案(English) [maximize-happiness-of-selected-children].html
new file mode 100644
index 00000000..ab3706ae
--- /dev/null
+++ b/leetcode-cn/problem (English)/幸福值最大化的选择方案(English) [maximize-happiness-of-selected-children].html	
@@ -0,0 +1,49 @@
+
You are given an array happiness of length n, and a positive integer k.

+
+
There are n children standing in a queue, where the ith child has happiness value happiness[i]. You want to select k children from these n children in k turns.

+
+
In each turn, when you select a child, the happiness value of all the children that have not been selected till now decreases by 1. Note that the happiness value cannot become negative and gets decremented only if it is positive.

+
+
Return the maximum sum of the happiness values of the selected children you can achieve by selecting k children.

+
+
 

+
Example 1:

+
+
+Input: happiness = [1,2,3], k = 2
+Output: 4
+Explanation: We can pick 2 children in the following way:
+- Pick the child with the happiness value == 3. The happiness value of the remaining children becomes [0,1].
+- Pick the child with the happiness value == 1. The happiness value of the remaining child becomes [0]. Note that the happiness value cannot become less than 0.
+The sum of the happiness values of the selected children is 3 + 1 = 4.
+

+
+
Example 2:

+
+
+Input: happiness = [1,1,1,1], k = 2
+Output: 1
+Explanation: We can pick 2 children in the following way:
+- Pick any child with the happiness value == 1. The happiness value of the remaining children becomes [0,0,0].
+- Pick the child with the happiness value == 0. The happiness value of the remaining child becomes [0,0].
+The sum of the happiness values of the selected children is 1 + 0 = 1.
+

+
+
Example 3:

+
+
+Input: happiness = [2,3,4,5], k = 1
+Output: 5
+Explanation: We can pick 1 child in the following way:
+- Pick the child with the happiness value == 5. The happiness value of the remaining children becomes [1,2,3].
+The sum of the happiness values of the selected children is 5.
+

+
+
 

+
Constraints:

+
+
    
+	
  • 1 <= n == happiness.length <= 2 * 105
    • 
+	
  • 1 <= happiness[i] <= 108
    • 
+	
  • 1 <= k <= n
    • 
+

diff --git a/leetcode-cn/problem (English)/成为 K 特殊字符串需要删除的最少字符数(English) [minimum-deletions-to-make-string-k-special].html b/leetcode-cn/problem (English)/成为 K 特殊字符串需要删除的最少字符数(English) [minimum-deletions-to-make-string-k-special].html
new file mode 100644
index 00000000..b5e17994
--- /dev/null
+++ b/leetcode-cn/problem (English)/成为 K 特殊字符串需要删除的最少字符数(English) [minimum-deletions-to-make-string-k-special].html	
@@ -0,0 +1,47 @@
+
You are given a string word and an integer k.

+
+
We consider word to be k-special if |freq(word[i]) - freq(word[j])| <= k for all indices i and j in the string.

+
+
Here, freq(x) denotes the frequency of the character x in word, and |y| denotes the absolute value of y.

+
+
Return the minimum number of characters you need to delete to make word k-special.

+
+
 

+
Example 1:

+
+

+
Input: word = "aabcaba", k = 0

+
+
Output: 3

+
+
Explanation: We can make word 0-special by deleting 2 occurrences of "a" and 1 occurrence of "c". Therefore, word becomes equal to "baba" where freq('a') == freq('b') == 2.

+

+
+
Example 2:

+
+

+
Input: word = "dabdcbdcdcd", k = 2

+
+
Output: 2

+
+
Explanation: We can make word 2-special by deleting 1 occurrence of "a" and 1 occurrence of "d". Therefore, word becomes equal to "bdcbdcdcd" where freq('b') == 2, freq('c') == 3, and freq('d') == 4.

+

+
+
Example 3:

+
+

+
Input: word = "aaabaaa", k = 2

+
+
Output: 1

+
+
Explanation: We can make word 2-special by deleting 1 occurrence of "b". Therefore, word becomes equal to "aaaaaa" where each letter's frequency is now uniformly 6.

+

+
+
 

+
Constraints:

+
+
    
+	
  • 1 <= word.length <= 105
    • 
+	
  • 0 <= k <= 105
    • 
+	
  • word consists only of lowercase English letters.
    • 
+

diff --git a/leetcode-cn/problem (English)/执行操作标记数组中的元素(English) [mark-elements-on-array-by-performing-queries].html b/leetcode-cn/problem (English)/执行操作标记数组中的元素(English) [mark-elements-on-array-by-performing-queries].html
new file mode 100644
index 00000000..d79b20ae
--- /dev/null
+++ b/leetcode-cn/problem (English)/执行操作标记数组中的元素(English) [mark-elements-on-array-by-performing-queries].html	
@@ -0,0 +1,55 @@
+
You are given a 0-indexed array nums of size n consisting of positive integers.

+
+
You are also given a 2D array queries of size m where queries[i] = [indexi, ki].

+
+
Initially all elements of the array are unmarked.

+
+
You need to apply m queries on the array in order, where on the ith query you do the following:

+
+
    
+	
  • Mark the element at index indexi if it is not already marked.
    • 
+	
  • Then mark ki unmarked elements in the array with the smallest values. If multiple such elements exist, mark the ones with the smallest indices. And if less than ki unmarked elements exist, then mark all of them.
    • 
+

+
+
Return an array answer of size m where answer[i] is the sum of unmarked elements in the array after the ith query.

+
+
 

+
Example 1:

+
+

+
Input: nums = [1,2,2,1,2,3,1], queries = [[1,2],[3,3],[4,2]]

+
+
Output: [8,3,0]

+
+
Explanation:

+
+
We do the following queries on the array:

+
+
    
+	
  • Mark the element at index 1, and 2 of the smallest unmarked elements with the smallest indices if they exist, the marked elements now are nums = [1,2,2,1,2,3,1]. The sum of unmarked elements is 2 + 2 + 3 + 1 = 8.
    • 
+	
  • Mark the element at index 3, since it is already marked we skip it. Then we mark 3 of the smallest unmarked elements with the smallest indices, the marked elements now are nums = [1,2,2,1,2,3,1]. The sum of unmarked elements is 3.
    • 
+	
  • Mark the element at index 4, since it is already marked we skip it. Then we mark 2 of the smallest unmarked elements with the smallest indices if they exist, the marked elements now are nums = [1,2,2,1,2,3,1]. The sum of unmarked elements is 0.
    • 
+

+

+
+
Example 2:

+
+

+
Input: nums = [1,4,2,3], queries = [[0,1]]

+
+
Output: [7]

+
+
Explanation:  We do one query which is mark the element at index 0 and mark the smallest element among unmarked elements. The marked elements will be nums = [1,4,2,3], and the sum of unmarked elements is 4 + 3 = 7.

+

+
+
 

+
Constraints:

+
+
    
+	
  • n == nums.length
    • 
+	
  • m == queries.length
    • 
+	
  • 1 <= m <= n <= 105
    • 
+	
  • 1 <= nums[i] <= 105
    • 
+	
  • queries[i].length == 2
    • 
+	
  • 0 <= indexi, ki <= n - 1
    • 
+

diff --git a/leetcode-cn/problem (English)/拾起 K 个 1 需要的最少行动次数(English) [minimum-moves-to-pick-k-ones].html b/leetcode-cn/problem (English)/拾起 K 个 1 需要的最少行动次数(English) [minimum-moves-to-pick-k-ones].html
new file mode 100644
index 00000000..5df078ba
--- /dev/null
+++ b/leetcode-cn/problem (English)/拾起 K 个 1 需要的最少行动次数(English) [minimum-moves-to-pick-k-ones].html	
@@ -0,0 +1,58 @@
+
You are given a binary array nums of length n, a positive integer k and a non-negative integer maxChanges.

+
+
Alice plays a game, where the goal is for Alice to pick up k ones from nums using the minimum number of moves. When the game starts, Alice picks up any index aliceIndex in the range [0, n - 1] and stands there. If nums[aliceIndex] == 1 , Alice picks up the one and nums[aliceIndex] becomes 0(this does not count as a move). After this, Alice can make any number of moves (including zero) where in each move Alice must perform exactly one of the following actions:

+
+
    
+	
  • Select any index j != aliceIndex such that nums[j] == 0 and set nums[j] = 1. This action can be performed at most maxChanges times.
    • 
+	
  • Select any two adjacent indices x and y (|x - y| == 1) such that nums[x] == 1, nums[y] == 0, then swap their values (set nums[y] = 1 and nums[x] = 0). If y == aliceIndex, Alice picks up the one after this move and nums[y] becomes 0.
    • 
+

+
+
Return the minimum number of moves required by Alice to pick exactly k ones.

+
+
 

+
Example 1:

+
+

+
Input: nums = [1,1,0,0,0,1,1,0,0,1], k = 3, maxChanges = 1

+
+
Output: 3

+
+
Explanation: Alice can pick up 3 ones in 3 moves, if Alice performs the following actions in each move when standing at aliceIndex == 1:

+
+
    
+	
  •  At the start of the game Alice picks up the one and nums[1] becomes 0. nums becomes [1,1,1,0,0,1,1,0,0,1].
    • 
+	
  • Select j == 2 and perform an action of the first type. nums becomes [1,0,1,0,0,1,1,0,0,1]
    • 
+	
  • Select x == 2 and y == 1, and perform an action of the second type. nums becomes [1,1,0,0,0,1,1,0,0,1]. As y == aliceIndex, Alice picks up the one and nums becomes [1,0,0,0,0,1,1,0,0,1].
    • 
+	
  • Select x == 0 and y == 1, and perform an action of the second type. nums becomes [0,1,0,0,0,1,1,0,0,1]. As y == aliceIndex, Alice picks up the one and nums becomes [0,0,0,0,0,1,1,0,0,1].
    • 
+

+
+
Note that it may be possible for Alice to pick up 3 ones using some other sequence of 3 moves.

+

+
+
Example 2:

+
+

+
Input: nums = [0,0,0,0], k = 2, maxChanges = 3

+
+
Output: 4

+
+
Explanation: Alice can pick up 2 ones in 4 moves, if Alice performs the following actions in each move when standing at aliceIndex == 0:

+
+
    
+	
  • Select j == 1 and perform an action of the first type. nums becomes [0,1,0,0].
    • 
+	
  • Select x == 1 and y == 0, and perform an action of the second type. nums becomes [1,0,0,0]. As y == aliceIndex, Alice picks up the one and nums becomes [0,0,0,0].
    • 
+	
  • Select j == 1 again and perform an action of the first type. nums becomes [0,1,0,0].
    • 
+	
  • Select x == 1 and y == 0 again, and perform an action of the second type. nums becomes [1,0,0,0]. As y == aliceIndex, Alice picks up the one and nums becomes [0,0,0,0].
    • 
+

+

+
+
 

+
Constraints:

+
+
    
+	
  • 2 <= n <= 105
    • 
+	
  • 0 <= nums[i] <= 1
    • 
+	
  • 1 <= k <= 105
    • 
+	
  • 0 <= maxChanges <= 105
    • 
+	
  • maxChanges + sum(nums) >= k
    • 
+

diff --git a/leetcode-cn/problem (English)/数组中的最短非公共子字符串(English) [shortest-uncommon-substring-in-an-array].html b/leetcode-cn/problem (English)/数组中的最短非公共子字符串(English) [shortest-uncommon-substring-in-an-array].html
new file mode 100644
index 00000000..435227c8
--- /dev/null
+++ b/leetcode-cn/problem (English)/数组中的最短非公共子字符串(English) [shortest-uncommon-substring-in-an-array].html	
@@ -0,0 +1,43 @@
+
You are given an array arr of size n consisting of non-empty strings.

+
+
Find a string array answer of size n such that:

+
+
    
+	
  • answer[i] is the shortest substring of arr[i] that does not occur as a substring in any other string in arr. If multiple such substrings exist, answer[i] should be the lexicographically smallest. And if no such substring exists, answer[i] should be an empty string.
    • 
+

+
+
Return the array answer.

+
+
 

+
Example 1:

+
+
+Input: arr = ["cab","ad","bad","c"]
+Output: ["ab","","ba",""]
+Explanation: We have the following:
+- For the string "cab", the shortest substring that does not occur in any other string is either "ca" or "ab", we choose the lexicographically smaller substring, which is "ab".
+- For the string "ad", there is no substring that does not occur in any other string.
+- For the string "bad", the shortest substring that does not occur in any other string is "ba".
+- For the string "c", there is no substring that does not occur in any other string.
+

+
+
Example 2:

+
+
+Input: arr = ["abc","bcd","abcd"]
+Output: ["","","abcd"]
+Explanation: We have the following:
+- For the string "abc", there is no substring that does not occur in any other string.
+- For the string "bcd", there is no substring that does not occur in any other string.
+- For the string "abcd", the shortest substring that does not occur in any other string is "abcd".
+

+
+
 

+
Constraints:

+
+
    
+	
  • n == arr.length
    • 
+	
  • 2 <= n <= 100
    • 
+	
  • 1 <= arr[i].length <= 20
    • 
+	
  • arr[i] consists only of lowercase English letters.
    • 
+

diff --git a/leetcode-cn/problem (English)/替换字符串中的问号使分数最小(English) [replace-question-marks-in-string-to-minimize-its-value].html b/leetcode-cn/problem (English)/替换字符串中的问号使分数最小(English) [replace-question-marks-in-string-to-minimize-its-value].html
new file mode 100644
index 00000000..ee45cf84
--- /dev/null
+++ b/leetcode-cn/problem (English)/替换字符串中的问号使分数最小(English) [replace-question-marks-in-string-to-minimize-its-value].html	
@@ -0,0 +1,59 @@
+
You are given a string s. s[i] is either a lowercase English letter or '?'.

+
+
For a string t having length m containing only lowercase English letters, we define the function cost(i) for an index i as the number of characters equal to t[i] that appeared before it, i.e. in the range [0, i - 1].

+
+
The value of t is the sum of cost(i) for all indices i.

+
+
For example, for the string t = "aab":

+
+
    
+	
  • cost(0) = 0
    • 
+	
  • cost(1) = 1
    • 
+	
  • cost(2) = 0
    • 
+	
  • Hence, the value of "aab" is 0 + 1 + 0 = 1.
    • 
+

+
+
Your task is to replace all occurrences of '?' in s with any lowercase English letter so that the value of s is minimized.

+
+
Return a string denoting the modified string with replaced occurrences of '?'. If there are multiple strings resulting in the minimum value, return the lexicographically smallest one.

+
+
 

+
Example 1:

+
+

+
Input:   s = "???" 

+
+
Output:   "abc" 

+
+
Explanation:  In this example, we can replace the occurrences of '?' to make s equal to "abc".

+
+
For "abc", cost(0) = 0, cost(1) = 0, and cost(2) = 0.

+
+
The value of "abc" is 0.

+
+
Some other modifications of s that have a value of 0 are "cba", "abz", and, "hey".

+
+
Among all of them, we choose the lexicographically smallest.

+

+
+
Example 2:

+
+

+
Input:  s = "a?a?"

+
+
Output:  "abac"

+
+
Explanation:  In this example, the occurrences of '?' can be replaced to make s equal to "abac".

+
+
For "abac", cost(0) = 0, cost(1) = 0, cost(2) = 1, and cost(3) = 0.

+
+
The value of "abac" is 1.

+

+
+
 

+
Constraints:

+
+
    
+	
  • 1 <= s.length <= 105
    • 
+	
  • s[i] is either a lowercase English letter or '?'.
    • 
+

diff --git a/leetcode-cn/problem (English)/最大节点价值之和(English) [find-the-maximum-sum-of-node-values].html b/leetcode-cn/problem (English)/最大节点价值之和(English) [find-the-maximum-sum-of-node-values].html
new file mode 100644
index 00000000..579553d0
--- /dev/null
+++ b/leetcode-cn/problem (English)/最大节点价值之和(English) [find-the-maximum-sum-of-node-values].html	
@@ -0,0 +1,59 @@
+
There exists an undirected tree with n nodes numbered 0 to n - 1. You are given a 0-indexed 2D integer array edges of length n - 1, where edges[i] = [ui, vi] indicates that there is an edge between nodes ui and vi in the tree. You are also given a positive integer k, and a 0-indexed array of non-negative integers nums of length n, where nums[i] represents the value of the node numbered i.

+
+
Alice wants the sum of values of tree nodes to be maximum, for which Alice can perform the following operation any number of times (including zero) on the tree:

+
+
    
+	
  • Choose any edge [u, v] connecting the nodes u and v, and update their values as follows:
+
+	
      
+		
    • nums[u] = nums[u] XOR k
      • 
+		
    • nums[v] = nums[v] XOR k
      • 
+	
    
+	
    • 
+

+
+
Return the maximum possible sum of the values Alice can achieve by performing the operation any number of times.

+
+
 

+
Example 1:

+
+
+Input: nums = [1,2,1], k = 3, edges = [[0,1],[0,2]]
+Output: 6
+Explanation: Alice can achieve the maximum sum of 6 using a single operation:
+- Choose the edge [0,2]. nums[0] and nums[2] become: 1 XOR 3 = 2, and the array nums becomes: [1,2,1] -> [2,2,2].
+The total sum of values is 2 + 2 + 2 = 6.
+It can be shown that 6 is the maximum achievable sum of values.
+

+
+
Example 2:

+
+
+Input: nums = [2,3], k = 7, edges = [[0,1]]
+Output: 9
+Explanation: Alice can achieve the maximum sum of 9 using a single operation:
+- Choose the edge [0,1]. nums[0] becomes: 2 XOR 7 = 5 and nums[1] become: 3 XOR 7 = 4, and the array nums becomes: [2,3] -> [5,4].
+The total sum of values is 5 + 4 = 9.
+It can be shown that 9 is the maximum achievable sum of values.
+

+
+
Example 3:

+
+
+Input: nums = [7,7,7,7,7,7], k = 3, edges = [[0,1],[0,2],[0,3],[0,4],[0,5]]
+Output: 42
+Explanation: The maximum achievable sum is 42 which can be achieved by Alice performing no operations.
+

+
+
 

+
Constraints:

+
+
    
+	
  • 2 <= n == nums.length <= 2 * 104
    • 
+	
  • 1 <= k <= 109
    • 
+	
  • 0 <= nums[i] <= 109
    • 
+	
  • edges.length == n - 1
    • 
+	
  • edges[i].length == 2
    • 
+	
  • 0 <= edges[i][0], edges[i][1] <= n - 1
    • 
+	
  • The input is generated such that edges represent a valid tree.
    • 
+

diff --git a/leetcode-cn/problem (English)/求出加密整数的和(English) [find-the-sum-of-encrypted-integers].html b/leetcode-cn/problem (English)/求出加密整数的和(English) [find-the-sum-of-encrypted-integers].html
new file mode 100644
index 00000000..26036086
--- /dev/null
+++ b/leetcode-cn/problem (English)/求出加密整数的和(English) [find-the-sum-of-encrypted-integers].html	
@@ -0,0 +1,32 @@
+
You are given an integer array nums containing positive integers. We define a function encrypt such that encrypt(x) replaces every digit in x with the largest digit in x. For example, encrypt(523) = 555 and encrypt(213) = 333.

+
+
Return the sum of encrypted elements.

+
+
 

+
Example 1:

+
+

+
Input: nums = [1,2,3]

+
+
Output: 6

+
+
Explanation: The encrypted elements are [1,2,3]. The sum of encrypted elements is 1 + 2 + 3 == 6.

+

+
+
Example 2:

+
+

+
Input: nums = [10,21,31]

+
+
Output: 66

+
+
Explanation: The encrypted elements are [11,22,33]. The sum of encrypted elements is 11 + 22 + 33 == 66.

+

+
+
 

+
Constraints:

+
+
    
+	
  • 1 <= nums.length <= 50
    • 
+	
  • 1 <= nums[i] <= 1000
    • 
+

diff --git a/leetcode-cn/problem (English)/求出所有子序列的能量和(English) [find-the-sum-of-the-power-of-all-subsequences].html b/leetcode-cn/problem (English)/求出所有子序列的能量和(English) [find-the-sum-of-the-power-of-all-subsequences].html
new file mode 100644
index 00000000..189b7791
--- /dev/null
+++ b/leetcode-cn/problem (English)/求出所有子序列的能量和(English) [find-the-sum-of-the-power-of-all-subsequences].html	
@@ -0,0 +1,69 @@
+
You are given an integer array nums of length n and a positive integer k.

+
+
The power of an array of integers is defined as the number of subsequences with their sum equal to k.

+
+
Return the sum of power of all subsequences of nums.

+
+
Since the answer may be very large, return it modulo 109 + 7.

+
+
 

+
Example 1:

+
+

+
Input:   nums = [1,2,3], k = 3 

+
+
Output:   6 

+
+
Explanation:

+
+
There are 5 subsequences of nums with non-zero power:

+
+
    
+	
  • The subsequence [1,2,3] has 2 subsequences with sum == 3: [1,2,3] and [1,2,3].
    • 
+	
  • The subsequence [1,2,3] has 1 subsequence with sum == 3: [1,2,3].
    • 
+	
  • The subsequence [1,2,3] has 1 subsequence with sum == 3: [1,2,3].
    • 
+	
  • The subsequence [1,2,3] has 1 subsequence with sum == 3: [1,2,3].
    • 
+	
  • The subsequence [1,2,3] has 1 subsequence with sum == 3: [1,2,3].
    • 
+

+
+
Hence the answer is 2 + 1 + 1 + 1 + 1 = 6.

+

+
+
Example 2:

+
+

+
Input:   nums = [2,3,3], k = 5 

+
+
Output:   4 

+
+
Explanation:

+
+
There are 3 subsequences of nums with non-zero power:

+
+
    
+	
  • The subsequence [2,3,3] has 2 subsequences with sum == 5: [2,3,3] and [2,3,3].
    • 
+	
  • The subsequence [2,3,3] has 1 subsequence with sum == 5: [2,3,3].
    • 
+	
  • The subsequence [2,3,3] has 1 subsequence with sum == 5: [2,3,3].
    • 
+

+
+
Hence the answer is 2 + 1 + 1 = 4.

+

+
+
Example 3:

+
+

+
Input:   nums = [1,2,3], k = 7 

+
+
Output:   0 

+
+
Explanation: There exists no subsequence with sum 7. Hence all subsequences of nums have power = 0.

+

+
+
 

+
Constraints:

+
+
    
+	
  • 1 <= n <= 100
    • 
+	
  • 1 <= nums[i] <= 104
    • 
+	
  • 1 <= k <= 100
    • 
+

diff --git a/leetcode-cn/problem (English)/统计以给定字符开头和结尾的子字符串总数(English) [count-substrings-starting-and-ending-with-given-character].html b/leetcode-cn/problem (English)/统计以给定字符开头和结尾的子字符串总数(English) [count-substrings-starting-and-ending-with-given-character].html
new file mode 100644
index 00000000..5d03c7b8
--- /dev/null
+++ b/leetcode-cn/problem (English)/统计以给定字符开头和结尾的子字符串总数(English) [count-substrings-starting-and-ending-with-given-character].html	
@@ -0,0 +1,30 @@
+
You are given a string s and a character c. Return the total number of substrings of s that start and end with c.

+
+
 

+
Example 1:

+
+

+
Input: s = "abada", c = "a"

+
+
Output: 6

+
+
Explanation: Substrings starting and ending with "a" are: "abada", "abada", "abada", "abada", "abada", "abada".

+

+
+
Example 2:

+
+

+
Input: s = "zzz", c = "z"

+
+
Output: 6

+
+
Explanation: There are a total of 6 substrings in s and all start and end with "z".

+

+
+
 

+
Constraints:

+
+
    
+	
  • 1 <= s.length <= 105
    • 
+	
  • s and c consist only of lowercase English letters.
    • 
+

diff --git a/leetcode-cn/problem (English)/超过阈值的最少操作数 I(English) [minimum-operations-to-exceed-threshold-value-i].html b/leetcode-cn/problem (English)/超过阈值的最少操作数 I(English) [minimum-operations-to-exceed-threshold-value-i].html
new file mode 100644
index 00000000..6ef08327
--- /dev/null
+++ b/leetcode-cn/problem (English)/超过阈值的最少操作数 I(English) [minimum-operations-to-exceed-threshold-value-i].html	
@@ -0,0 +1,43 @@
+
You are given a 0-indexed integer array nums, and an integer k.

+
+
In one operation, you can remove one occurrence of the smallest element of nums.

+
+
Return the minimum number of operations needed so that all elements of the array are greater than or equal to k.

+
+
 

+
Example 1:

+
+
+Input: nums = [2,11,10,1,3], k = 10
+Output: 3
+Explanation: After one operation, nums becomes equal to [2, 11, 10, 3].
+After two operations, nums becomes equal to [11, 10, 3].
+After three operations, nums becomes equal to [11, 10].
+At this stage, all the elements of nums are greater than or equal to 10 so we can stop.
+It can be shown that 3 is the minimum number of operations needed so that all elements of the array are greater than or equal to 10.
+

+
+
Example 2:

+
+
+Input: nums = [1,1,2,4,9], k = 1
+Output: 0
+Explanation: All elements of the array are greater than or equal to 1 so we do not need to apply any operations on nums.

+
+
Example 3:

+
+
+Input: nums = [1,1,2,4,9], k = 9
+Output: 4
+Explanation: only a single element of nums is greater than or equal to 9 so we need to apply the operations 4 times on nums.
+

+
+
 

+
Constraints:

+
+
    
+	
  • 1 <= nums.length <= 50
    • 
+	
  • 1 <= nums[i] <= 109
    • 
+	
  • 1 <= k <= 109
    • 
+	
  • The input is generated such that there is at least one index i such that nums[i] >= k.
    • 
+

diff --git a/leetcode-cn/problem (English)/超过阈值的最少操作数 II(English) [minimum-operations-to-exceed-threshold-value-ii].html b/leetcode-cn/problem (English)/超过阈值的最少操作数 II(English) [minimum-operations-to-exceed-threshold-value-ii].html
new file mode 100644
index 00000000..8edae3c7
--- /dev/null
+++ b/leetcode-cn/problem (English)/超过阈值的最少操作数 II(English) [minimum-operations-to-exceed-threshold-value-ii].html	
@@ -0,0 +1,47 @@
+
You are given a 0-indexed integer array nums, and an integer k.

+
+
In one operation, you will:

+
+
    
+	
  • Take the two smallest integers x and y in nums.
    • 
+	
  • Remove x and y from nums.
    • 
+	
  • Add min(x, y) * 2 + max(x, y) anywhere in the array.
    • 
+

+
+
Note that you can only apply the described operation if nums contains at least two elements.

+
+
Return the minimum number of operations needed so that all elements of the array are greater than or equal to k.

+
+
 

+
Example 1:

+
+
+Input: nums = [2,11,10,1,3], k = 10
+Output: 2
+Explanation: In the first operation, we remove elements 1 and 2, then add 1 * 2 + 2 to nums. nums becomes equal to [4, 11, 10, 3].
+In the second operation, we remove elements 3 and 4, then add 3 * 2 + 4 to nums. nums becomes equal to [10, 11, 10].
+At this stage, all the elements of nums are greater than or equal to 10 so we can stop.
+It can be shown that 2 is the minimum number of operations needed so that all elements of the array are greater than or equal to 10.
+

+
+
Example 2:

+
+
+Input: nums = [1,1,2,4,9], k = 20
+Output: 4
+Explanation: After one operation, nums becomes equal to [2, 4, 9, 3].
+After two operations, nums becomes equal to [7, 4, 9].
+After three operations, nums becomes equal to [15, 9].
+After four operations, nums becomes equal to [33].
+At this stage, all the elements of nums are greater than 20 so we can stop.
+It can be shown that 4 is the minimum number of operations needed so that all elements of the array are greater than or equal to 20.

+
+
 

+
Constraints:

+
+
    
+	
  • 2 <= nums.length <= 2 * 105
    • 
+	
  • 1 <= nums[i] <= 109
    • 
+	
  • 1 <= k <= 109
    • 
+	
  • The input is generated such that an answer always exists. That is, there exists some sequence of operations after which all elements of the array are greater than or equal to k.
    • 
+

diff --git a/leetcode-cn/problem (English)/重新分装苹果(English) [apple-redistribution-into-boxes].html b/leetcode-cn/problem (English)/重新分装苹果(English) [apple-redistribution-into-boxes].html
new file mode 100644
index 00000000..09dff306
--- /dev/null
+++ b/leetcode-cn/problem (English)/重新分装苹果(English) [apple-redistribution-into-boxes].html	
@@ -0,0 +1,35 @@
+
You are given an array apple of size n and an array capacity of size m.

+
+
There are n packs where the ith pack contains apple[i] apples. There are m boxes as well, and the ith box has a capacity of capacity[i] apples.

+
+
Return the minimum number of boxes you need to select to redistribute these n packs of apples into boxes.

+
+
Note that, apples from the same pack can be distributed into different boxes.

+
+
 

+
Example 1:

+
+
+Input: apple = [1,3,2], capacity = [4,3,1,5,2]
+Output: 2
+Explanation: We will use boxes with capacities 4 and 5.
+It is possible to distribute the apples as the total capacity is greater than or equal to the total number of apples.
+

+
+
Example 2:

+
+
+Input: apple = [5,5,5], capacity = [2,4,2,7]
+Output: 4
+Explanation: We will need to use all the boxes.
+

+
+
 

+
Constraints:

+
+
    
+	
  • 1 <= n == apple.length <= 50
    • 
+	
  • 1 <= m == capacity.length <= 50
    • 
+	
  • 1 <= apple[i], capacity[i] <= 50
    • 
+	
  • The input is generated such that it's possible to redistribute packs of apples into boxes.
    • 
+