From 210ba37692fc8d1325133fb5bb0e55881fa5c6e3 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: Wed, 29 Jun 2022 22:54:34 +0800 Subject: [PATCH] update --- README.md | 2 +- leetcode-cn/origin-data.json | 14924 ++++++++-------- .../[no content]jump-game-viii.json | 87 + ...um-flips-in-binary-tree-to-get-result.json | 75 + ...-maximum-recorded-degree-in-each-city.json | 63 + .../check-if-matrix-is-x-matrix.json | 171 + leetcode-cn/originData/count-asterisks.json | 165 + .../count-number-of-ways-to-place-houses.json | 166 + ...pairs-of-nodes-in-an-undirected-graph.json | 184 + ...nglish-letter-in-upper-and-lower-case.json | 177 + ...y-subsequence-less-than-or-equal-to-k.json | 183 + .../maximum-score-of-spliced-array.json | 172 + .../maximum-xor-after-operations.json | 179 + ...inimum-score-after-removals-on-a-tree.json | 183 + .../number-of-distinct-roll-sequences.json | 172 + .../originData/selling-pieces-of-wood.json | 178 + .../sum-of-numbers-with-units-digit-k.json | 183 + ...的数目 [number-of-distinct-roll-sequences].html | 41 + ...数之和 [sum-of-numbers-with-units-digit-k].html | 52 + ...分数 [minimum-score-after-removals-on-a-tree].html | 57 + ...[greatest-english-letter-in-upper-and-lower-case].html | 43 + ...是一个 X 矩阵 [check-if-matrix-is-x-matrix].html | 38 + .../卖木头块 [selling-pieces-of-wood].html | 59 + ...ongest-binary-subsequence-less-than-or-equal-to-k].html | 40 + ...最大分数 [maximum-score-of-spliced-array].html | 53 + ...最大异或和 [maximum-xor-after-operations].html | 33 + ...式数 [count-number-of-ways-to-place-houses].html | 34 + ...t-unreachable-pairs-of-nodes-in-an-undirected-graph].html | 38 + .../统计星号 [count-asterisks].html | 39 + ...(English) [number-of-distinct-roll-sequences].html | 39 + ...(English) [sum-of-numbers-with-units-digit-k].html | 51 + ...nglish) [minimum-score-after-removals-on-a-tree].html | 57 + ...[greatest-english-letter-in-upper-and-lower-case].html | 40 + ... X 矩阵(English) [check-if-matrix-is-x-matrix].html | 38 + ...头块(English) [selling-pieces-of-wood].html | 46 + ...ongest-binary-subsequence-less-than-or-equal-to-k].html | 40 + ...数(English) [maximum-score-of-spliced-array].html | 51 + ...或和(English) [maximum-xor-after-operations].html | 33 + ...English) [count-number-of-ways-to-place-houses].html | 34 + ...t-unreachable-pairs-of-nodes-in-an-undirected-graph].html | 34 + .../统计星号(English) [count-asterisks].html | 40 + leetcode/origin-data.json | 9578 +++++----- ...um-flips-in-binary-tree-to-get-result.json | 72 + ...-maximum-recorded-degree-in-each-city.json | 60 + .../check-if-matrix-is-x-matrix.json | 168 + leetcode/originData/count-asterisks.json | 162 + .../count-number-of-ways-to-place-houses.json | 163 + ...pairs-of-nodes-in-an-undirected-graph.json | 181 + ...nglish-letter-in-upper-and-lower-case.json | 174 + ...y-subsequence-less-than-or-equal-to-k.json | 180 + .../maximum-score-of-spliced-array.json | 169 + .../maximum-xor-after-operations.json | 176 + ...inimum-score-after-removals-on-a-tree.json | 180 + .../number-of-distinct-roll-sequences.json | 169 + .../originData/selling-pieces-of-wood.json | 175 + .../sum-of-numbers-with-units-digit-k.json | 180 + .../problem/check-if-matrix-is-x-matrix.html | 38 + leetcode/problem/count-asterisks.html | 40 + .../count-number-of-ways-to-place-houses.html | 34 + ...pairs-of-nodes-in-an-undirected-graph.html | 34 + ...nglish-letter-in-upper-and-lower-case.html | 40 + ...y-subsequence-less-than-or-equal-to-k.html | 40 + .../maximum-score-of-spliced-array.html | 51 + .../problem/maximum-xor-after-operations.html | 33 + ...inimum-score-after-removals-on-a-tree.html | 57 + .../number-of-distinct-roll-sequences.html | 39 + leetcode/problem/selling-pieces-of-wood.html | 46 + .../sum-of-numbers-with-units-digit-k.html | 51 + 68 files changed, 18640 insertions(+), 11944 deletions(-) create mode 100644 leetcode-cn/originData/[no content]jump-game-viii.json create mode 100644 leetcode-cn/originData/[no content]minimum-flips-in-binary-tree-to-get-result.json create mode 100644 leetcode-cn/originData/[no content]the-first-day-of-the-maximum-recorded-degree-in-each-city.json create mode 100644 leetcode-cn/originData/check-if-matrix-is-x-matrix.json create mode 100644 leetcode-cn/originData/count-asterisks.json create mode 100644 leetcode-cn/originData/count-number-of-ways-to-place-houses.json create mode 100644 leetcode-cn/originData/count-unreachable-pairs-of-nodes-in-an-undirected-graph.json create mode 100644 leetcode-cn/originData/greatest-english-letter-in-upper-and-lower-case.json create mode 100644 leetcode-cn/originData/longest-binary-subsequence-less-than-or-equal-to-k.json create mode 100644 leetcode-cn/originData/maximum-score-of-spliced-array.json create mode 100644 leetcode-cn/originData/maximum-xor-after-operations.json create mode 100644 leetcode-cn/originData/minimum-score-after-removals-on-a-tree.json create mode 100644 leetcode-cn/originData/number-of-distinct-roll-sequences.json create mode 100644 leetcode-cn/originData/selling-pieces-of-wood.json create mode 100644 leetcode-cn/originData/sum-of-numbers-with-units-digit-k.json create mode 100644 leetcode-cn/problem (Chinese)/不同骰子序列的数目 [number-of-distinct-roll-sequences].html create mode 100644 leetcode-cn/problem (Chinese)/个位数字为 K 的整数之和 [sum-of-numbers-with-units-digit-k].html create mode 100644 leetcode-cn/problem (Chinese)/从树中删除边的最小分数 [minimum-score-after-removals-on-a-tree].html create mode 100644 leetcode-cn/problem (Chinese)/兼具大小写的最好英文字母 [greatest-english-letter-in-upper-and-lower-case].html create mode 100644 leetcode-cn/problem (Chinese)/判断矩阵是否是一个 X 矩阵 [check-if-matrix-is-x-matrix].html create mode 100644 leetcode-cn/problem (Chinese)/卖木头块 [selling-pieces-of-wood].html create mode 100644 leetcode-cn/problem (Chinese)/小于等于 K 的最长二进制子序列 [longest-binary-subsequence-less-than-or-equal-to-k].html create mode 100644 leetcode-cn/problem (Chinese)/拼接数组的最大分数 [maximum-score-of-spliced-array].html create mode 100644 leetcode-cn/problem (Chinese)/操作后的最大异或和 [maximum-xor-after-operations].html create mode 100644 leetcode-cn/problem (Chinese)/统计放置房子的方式数 [count-number-of-ways-to-place-houses].html create mode 100644 leetcode-cn/problem (Chinese)/统计无向图中无法互相到达点对数 [count-unreachable-pairs-of-nodes-in-an-undirected-graph].html create mode 100644 leetcode-cn/problem (Chinese)/统计星号 [count-asterisks].html create mode 100644 leetcode-cn/problem (English)/不同骰子序列的数目(English) [number-of-distinct-roll-sequences].html create mode 100644 leetcode-cn/problem (English)/个位数字为 K 的整数之和(English) [sum-of-numbers-with-units-digit-k].html create mode 100644 leetcode-cn/problem (English)/从树中删除边的最小分数(English) [minimum-score-after-removals-on-a-tree].html create mode 100644 leetcode-cn/problem (English)/兼具大小写的最好英文字母(English) [greatest-english-letter-in-upper-and-lower-case].html create mode 100644 leetcode-cn/problem (English)/判断矩阵是否是一个 X 矩阵(English) [check-if-matrix-is-x-matrix].html create mode 100644 leetcode-cn/problem (English)/卖木头块(English) [selling-pieces-of-wood].html create mode 100644 leetcode-cn/problem (English)/小于等于 K 的最长二进制子序列(English) [longest-binary-subsequence-less-than-or-equal-to-k].html create mode 100644 leetcode-cn/problem (English)/拼接数组的最大分数(English) [maximum-score-of-spliced-array].html create mode 100644 leetcode-cn/problem (English)/操作后的最大异或和(English) [maximum-xor-after-operations].html create mode 100644 leetcode-cn/problem (English)/统计放置房子的方式数(English) [count-number-of-ways-to-place-houses].html create mode 100644 leetcode-cn/problem (English)/统计无向图中无法互相到达点对数(English) [count-unreachable-pairs-of-nodes-in-an-undirected-graph].html create mode 100644 leetcode-cn/problem (English)/统计星号(English) [count-asterisks].html create mode 100644 leetcode/originData/[no content]minimum-flips-in-binary-tree-to-get-result.json create mode 100644 leetcode/originData/[no content]the-first-day-of-the-maximum-recorded-degree-in-each-city.json create mode 100644 leetcode/originData/check-if-matrix-is-x-matrix.json create mode 100644 leetcode/originData/count-asterisks.json create mode 100644 leetcode/originData/count-number-of-ways-to-place-houses.json create mode 100644 leetcode/originData/count-unreachable-pairs-of-nodes-in-an-undirected-graph.json create mode 100644 leetcode/originData/greatest-english-letter-in-upper-and-lower-case.json create mode 100644 leetcode/originData/longest-binary-subsequence-less-than-or-equal-to-k.json create mode 100644 leetcode/originData/maximum-score-of-spliced-array.json create mode 100644 leetcode/originData/maximum-xor-after-operations.json create mode 100644 leetcode/originData/minimum-score-after-removals-on-a-tree.json create mode 100644 leetcode/originData/number-of-distinct-roll-sequences.json create mode 100644 leetcode/originData/selling-pieces-of-wood.json create mode 100644 leetcode/originData/sum-of-numbers-with-units-digit-k.json create mode 100644 leetcode/problem/check-if-matrix-is-x-matrix.html create mode 100644 leetcode/problem/count-asterisks.html create mode 100644 leetcode/problem/count-number-of-ways-to-place-houses.html create mode 100644 leetcode/problem/count-unreachable-pairs-of-nodes-in-an-undirected-graph.html create mode 100644 leetcode/problem/greatest-english-letter-in-upper-and-lower-case.html create mode 100644 leetcode/problem/longest-binary-subsequence-less-than-or-equal-to-k.html create mode 100644 leetcode/problem/maximum-score-of-spliced-array.html create mode 100644 leetcode/problem/maximum-xor-after-operations.html create mode 100644 leetcode/problem/minimum-score-after-removals-on-a-tree.html create mode 100644 leetcode/problem/number-of-distinct-roll-sequences.html create mode 100644 leetcode/problem/selling-pieces-of-wood.html create mode 100644 leetcode/problem/sum-of-numbers-with-units-digit-k.html diff --git a/README.md b/README.md index af542c6e..dd060fa2 100644 --- a/README.md +++ b/README.md @@ -1,6 +1,6 @@ # 力扣题库(完整版) -> 最后更新日期: **2022.06.18** +> 最后更新日期: **2022.06.29** > > 使用脚本前请务必仔细完整阅读本 `README.md` 文件 diff --git a/leetcode-cn/origin-data.json b/leetcode-cn/origin-data.json index 94eb5358..ccd7e415 100644 --- a/leetcode-cn/origin-data.json +++ b/leetcode-cn/origin-data.json @@ -1,7 +1,7 @@ { "user_name": "", "num_solved": 0, - "num_total": 2674, + "num_total": 2688, "ac_easy": 0, "ac_medium": 0, "ac_hard": 0, @@ -12,8 +12,8 @@ "question__title": "积木拼接", "question__title_slug": "De4qBB", "question__hide": false, - "total_acs": 232, - "total_submitted": 871, + "total_acs": 242, + "total_submitted": 884, "total_column_articles": 12, "frontend_question_id": "LCP 58", "is_new_question": false @@ -33,9 +33,9 @@ "question__title": "力扣泡泡龙", "question__title_slug": "WInSav", "question__hide": false, - "total_acs": 353, - "total_submitted": 2082, - "total_column_articles": 14, + "total_acs": 374, + "total_submitted": 2166, + "total_column_articles": 15, "frontend_question_id": "LCP 60", "is_new_question": false }, @@ -54,8 +54,8 @@ "question__title": "搭桥过河", "question__title_slug": "NfY1m5", "question__hide": false, - "total_acs": 102, - "total_submitted": 402, + "total_acs": 105, + "total_submitted": 409, "total_column_articles": 5, "frontend_question_id": "LCP 59", "is_new_question": false @@ -75,9 +75,9 @@ "question__title": "打地鼠", "question__title_slug": "ZbAuEH", "question__hide": false, - "total_acs": 1314, - "total_submitted": 5410, - "total_column_articles": 31, + "total_acs": 1336, + "total_submitted": 5490, + "total_column_articles": 32, "frontend_question_id": "LCP 57", "is_new_question": false }, @@ -96,8 +96,8 @@ "question__title": "信物传送", "question__title_slug": "6UEx57", "question__hide": false, - "total_acs": 1613, - "total_submitted": 4419, + "total_acs": 1660, + "total_submitted": 4493, "total_column_articles": 46, "frontend_question_id": "LCP 56", "is_new_question": false @@ -117,9 +117,9 @@ "question__title": "采集果实", "question__title_slug": "PTXy4P", "question__hide": false, - "total_acs": 2832, - "total_submitted": 3827, - "total_column_articles": 36, + "total_acs": 2935, + "total_submitted": 3987, + "total_column_articles": 39, "frontend_question_id": "LCP 55", "is_new_question": false }, @@ -138,8 +138,8 @@ "question__title": "夺回据点", "question__title_slug": "s5kipK", "question__hide": false, - "total_acs": 275, - "total_submitted": 837, + "total_acs": 286, + "total_submitted": 862, "total_column_articles": 7, "frontend_question_id": "LCP 54", "is_new_question": false @@ -159,8 +159,8 @@ "question__title": "守护太空城", "question__title_slug": "EJvmW4", "question__hide": false, - "total_acs": 716, - "total_submitted": 1800, + "total_acs": 723, + "total_submitted": 1808, "total_column_articles": 15, "frontend_question_id": "LCP 53", "is_new_question": false @@ -180,9 +180,9 @@ "question__title": "二叉搜索树染色", "question__title_slug": "QO5KpG", "question__hide": false, - "total_acs": 2695, - "total_submitted": 11129, - "total_column_articles": 73, + "total_acs": 2751, + "total_submitted": 11271, + "total_column_articles": 74, "frontend_question_id": "LCP 52", "is_new_question": false }, @@ -201,9 +201,9 @@ "question__title": "烹饪料理", "question__title_slug": "UEcfPD", "question__hide": false, - "total_acs": 3766, - "total_submitted": 8222, - "total_column_articles": 65, + "total_acs": 3831, + "total_submitted": 8365, + "total_column_articles": 67, "frontend_question_id": "LCP 51", "is_new_question": false }, @@ -222,9 +222,9 @@ "question__title": "宝石补给", "question__title_slug": "WHnhjV", "question__hide": false, - "total_acs": 5350, - "total_submitted": 8012, - "total_column_articles": 51, + "total_acs": 5410, + "total_submitted": 8098, + "total_column_articles": 54, "frontend_question_id": "LCP 50", "is_new_question": false }, @@ -243,8 +243,8 @@ "question__title": "自行车炫技赛场", "question__title_slug": "kplEvH", "question__hide": false, - "total_acs": 1737, - "total_submitted": 7078, + "total_acs": 1761, + "total_submitted": 7167, "total_column_articles": 38, "frontend_question_id": "LCP 45", "is_new_question": false @@ -264,8 +264,8 @@ "question__title": "无限棋局", "question__title_slug": "fsa7oZ", "question__hide": false, - "total_acs": 599, - "total_submitted": 2627, + "total_acs": 607, + "total_submitted": 2638, "total_column_articles": 14, "frontend_question_id": "LCP 48", "is_new_question": false @@ -285,8 +285,8 @@ "question__title": "志愿者调配", "question__title_slug": "05ZEDJ", "question__hide": false, - "total_acs": 1325, - "total_submitted": 3025, + "total_acs": 1338, + "total_submitted": 3041, "total_column_articles": 33, "frontend_question_id": "LCP 46", "is_new_question": false @@ -306,8 +306,8 @@ "question__title": "玩具套圈", "question__title_slug": "vFjcfV", "question__hide": false, - "total_acs": 1657, - "total_submitted": 6707, + "total_acs": 1675, + "total_submitted": 6746, "total_column_articles": 36, "frontend_question_id": "LCP 42", "is_new_question": false @@ -327,9 +327,9 @@ "question__title": "黑白翻转棋", "question__title_slug": "fHi6rV", "question__hide": false, - "total_acs": 1857, - "total_submitted": 3991, - "total_column_articles": 39, + "total_acs": 1875, + "total_submitted": 4015, + "total_column_articles": 40, "frontend_question_id": "LCP 41", "is_new_question": false }, @@ -348,9 +348,9 @@ "question__title": "无人机方阵", "question__title_slug": "0jQkd0", "question__hide": false, - "total_acs": 5746, - "total_submitted": 10844, - "total_column_articles": 56, + "total_acs": 5793, + "total_submitted": 10971, + "total_column_articles": 57, "frontend_question_id": "LCP 39", "is_new_question": false }, @@ -369,9 +369,9 @@ "question__title": "心算挑战", "question__title_slug": "uOAnQW", "question__hide": false, - "total_acs": 5306, - "total_submitted": 18850, - "total_column_articles": 105, + "total_acs": 5383, + "total_submitted": 19050, + "total_column_articles": 106, "frontend_question_id": "LCP 40", "is_new_question": false }, @@ -390,8 +390,8 @@ "question__title": "十字路口的交通", "question__title_slug": "Y1VbOX", "question__hide": false, - "total_acs": 658, - "total_submitted": 1383, + "total_acs": 661, + "total_submitted": 1387, "total_column_articles": 22, "frontend_question_id": "LCP 43", "is_new_question": false @@ -411,9 +411,9 @@ "question__title": "开幕式焰火", "question__title_slug": "sZ59z6", "question__hide": false, - "total_acs": 8676, - "total_submitted": 10883, - "total_column_articles": 120, + "total_acs": 8907, + "total_submitted": 11159, + "total_column_articles": 125, "frontend_question_id": "LCP 44", "is_new_question": false }, @@ -432,9 +432,9 @@ "question__title": "入场安检", "question__title_slug": "oPs9Bm", "question__hide": false, - "total_acs": 1205, - "total_submitted": 2966, - "total_column_articles": 20, + "total_acs": 1231, + "total_submitted": 3006, + "total_column_articles": 22, "frontend_question_id": "LCP 47", "is_new_question": false }, @@ -453,9 +453,9 @@ "question__title": "环形闯关游戏", "question__title_slug": "K8GULz", "question__hide": false, - "total_acs": 605, - "total_submitted": 2032, - "total_column_articles": 16, + "total_acs": 608, + "total_submitted": 2038, + "total_column_articles": 17, "frontend_question_id": "LCP 49", "is_new_question": false }, @@ -474,9 +474,9 @@ "question__title": "省份数量", "question__title_slug": "bLyHh0", "question__hide": false, - "total_acs": 11909, - "total_submitted": 17717, - "total_column_articles": 149, + "total_acs": 12424, + "total_submitted": 18435, + "total_column_articles": 151, "frontend_question_id": "剑指 Offer II 116", "is_new_question": false }, @@ -495,9 +495,9 @@ "question__title": "路径的数目", "question__title_slug": "2AoeFn", "question__hide": false, - "total_acs": 10380, - "total_submitted": 13442, - "total_column_articles": 138, + "total_acs": 10809, + "total_submitted": 13966, + "total_column_articles": 140, "frontend_question_id": "剑指 Offer II 098", "is_new_question": false }, @@ -516,9 +516,9 @@ "question__title": "含有 k 个元素的组合", "question__title_slug": "uUsW3B", "question__hide": false, - "total_acs": 14075, - "total_submitted": 16890, - "total_column_articles": 126, + "total_acs": 14626, + "total_submitted": 17521, + "total_column_articles": 130, "frontend_question_id": "剑指 Offer II 080", "is_new_question": false }, @@ -537,9 +537,9 @@ "question__title": "所有子集", "question__title_slug": "TVdhkn", "question__hide": false, - "total_acs": 15633, - "total_submitted": 18213, - "total_column_articles": 201, + "total_acs": 16254, + "total_submitted": 18966, + "total_column_articles": 204, "frontend_question_id": "剑指 Offer II 079", "is_new_question": false }, @@ -558,9 +558,9 @@ "question__title": "合并排序链表", "question__title_slug": "vvXgSW", "question__hide": false, - "total_acs": 14880, - "total_submitted": 23321, - "total_column_articles": 171, + "total_acs": 15432, + "total_submitted": 24203, + "total_column_articles": 176, "frontend_question_id": "剑指 Offer II 078", "is_new_question": false }, @@ -579,9 +579,9 @@ "question__title": "链表排序", "question__title_slug": "7WHec2", "question__hide": false, - "total_acs": 19813, - "total_submitted": 32141, - "total_column_articles": 226, + "total_acs": 20614, + "total_submitted": 33291, + "total_column_articles": 230, "frontend_question_id": "剑指 Offer II 077", "is_new_question": false }, @@ -600,9 +600,9 @@ "question__title": "数组中的第 k 大的数字", "question__title_slug": "xx4gT2", "question__hide": false, - "total_acs": 22956, - "total_submitted": 33779, - "total_column_articles": 181, + "total_acs": 23871, + "total_submitted": 35117, + "total_column_articles": 183, "frontend_question_id": "剑指 Offer II 076", "is_new_question": false }, @@ -621,9 +621,9 @@ "question__title": "数组相对排序", "question__title_slug": "0H97ZC", "question__hide": false, - "total_acs": 13983, - "total_submitted": 19704, - "total_column_articles": 193, + "total_acs": 14534, + "total_submitted": 20445, + "total_column_articles": 196, "frontend_question_id": "剑指 Offer II 075", "is_new_question": false }, @@ -642,9 +642,9 @@ "question__title": "合并区间", "question__title_slug": "SsGoHC", "question__hide": false, - "total_acs": 13427, - "total_submitted": 23319, - "total_column_articles": 139, + "total_acs": 13964, + "total_submitted": 24237, + "total_column_articles": 144, "frontend_question_id": "剑指 Offer II 074", "is_new_question": false }, @@ -663,9 +663,9 @@ "question__title": "狒狒吃香蕉", "question__title_slug": "nZZqjQ", "question__hide": false, - "total_acs": 11559, - "total_submitted": 22020, - "total_column_articles": 130, + "total_acs": 12060, + "total_submitted": 22927, + "total_column_articles": 134, "frontend_question_id": "剑指 Offer II 073", "is_new_question": false }, @@ -684,9 +684,9 @@ "question__title": "求平方根", "question__title_slug": "jJ0w9p", "question__hide": false, - "total_acs": 18064, - "total_submitted": 43101, - "total_column_articles": 158, + "total_acs": 18740, + "total_submitted": 44590, + "total_column_articles": 162, "frontend_question_id": "剑指 Offer II 072", "is_new_question": false }, @@ -705,8 +705,8 @@ "question__title": "按权重生成随机数", "question__title_slug": "cuyjEf", "question__hide": false, - "total_acs": 8341, - "total_submitted": 16691, + "total_acs": 8717, + "total_submitted": 17457, "total_column_articles": 77, "frontend_question_id": "剑指 Offer II 071", "is_new_question": false @@ -726,9 +726,9 @@ "question__title": "排序数组中只出现一次的数字", "question__title_slug": "skFtm2", "question__hide": false, - "total_acs": 15628, - "total_submitted": 24418, - "total_column_articles": 159, + "total_acs": 16229, + "total_submitted": 25416, + "total_column_articles": 162, "frontend_question_id": "剑指 Offer II 070", "is_new_question": false }, @@ -747,9 +747,9 @@ "question__title": "山峰数组的顶部", "question__title_slug": "B1IidL", "question__hide": false, - "total_acs": 50072, - "total_submitted": 70492, - "total_column_articles": 489, + "total_acs": 50720, + "total_submitted": 71448, + "total_column_articles": 494, "frontend_question_id": "剑指 Offer II 069", "is_new_question": false }, @@ -768,9 +768,9 @@ "question__title": "查找插入位置", "question__title_slug": "N6YdxV", "question__hide": false, - "total_acs": 15887, - "total_submitted": 31621, - "total_column_articles": 169, + "total_acs": 16526, + "total_submitted": 32836, + "total_column_articles": 174, "frontend_question_id": "剑指 Offer II 068", "is_new_question": false }, @@ -789,9 +789,9 @@ "question__title": "最大的异或", "question__title_slug": "ms70jA", "question__hide": false, - "total_acs": 7148, - "total_submitted": 10862, - "total_column_articles": 90, + "total_acs": 7446, + "total_submitted": 11293, + "total_column_articles": 94, "frontend_question_id": "剑指 Offer II 067", "is_new_question": false }, @@ -810,9 +810,9 @@ "question__title": "单词之和", "question__title_slug": "z1R5dt", "question__hide": false, - "total_acs": 8175, - "total_submitted": 12541, - "total_column_articles": 146, + "total_acs": 8566, + "total_submitted": 13133, + "total_column_articles": 151, "frontend_question_id": "剑指 Offer II 066", "is_new_question": false }, @@ -831,9 +831,9 @@ "question__title": "最短的单词编码", "question__title_slug": "iSwD2y", "question__hide": false, - "total_acs": 8112, - "total_submitted": 12667, - "total_column_articles": 110, + "total_acs": 8479, + "total_submitted": 13213, + "total_column_articles": 114, "frontend_question_id": "剑指 Offer II 065", "is_new_question": false }, @@ -852,9 +852,9 @@ "question__title": "神奇的字典", "question__title_slug": "US1pGT", "question__hide": false, - "total_acs": 8367, - "total_submitted": 13635, - "total_column_articles": 113, + "total_acs": 8743, + "total_submitted": 14226, + "total_column_articles": 117, "frontend_question_id": "剑指 Offer II 064", "is_new_question": false }, @@ -873,9 +873,9 @@ "question__title": "替换单词", "question__title_slug": "UhWRSj", "question__hide": false, - "total_acs": 10093, - "total_submitted": 14312, - "total_column_articles": 171, + "total_acs": 10543, + "total_submitted": 14962, + "total_column_articles": 173, "frontend_question_id": "剑指 Offer II 063", "is_new_question": false }, @@ -894,9 +894,9 @@ "question__title": "和最小的 k 个数对", "question__title_slug": "qn8gGX", "question__hide": false, - "total_acs": 10793, - "total_submitted": 19811, - "total_column_articles": 116, + "total_acs": 11269, + "total_submitted": 20642, + "total_column_articles": 120, "frontend_question_id": "剑指 Offer II 061", "is_new_question": false }, @@ -915,9 +915,9 @@ "question__title": "实现前缀树", "question__title_slug": "QC3q1f", "question__hide": false, - "total_acs": 11647, - "total_submitted": 15140, - "total_column_articles": 123, + "total_acs": 12091, + "total_submitted": 15715, + "total_column_articles": 129, "frontend_question_id": "剑指 Offer II 062", "is_new_question": false }, @@ -936,9 +936,9 @@ "question__title": "出现频率最高的 k 个数字", "question__title_slug": "g5c51o", "question__hide": false, - "total_acs": 13730, - "total_submitted": 19751, - "total_column_articles": 171, + "total_acs": 14325, + "total_submitted": 20577, + "total_column_articles": 176, "frontend_question_id": "剑指 Offer II 060", "is_new_question": false }, @@ -957,9 +957,9 @@ "question__title": "数据流的第 K 大数值", "question__title_slug": "jBjn9C", "question__hide": false, - "total_acs": 12552, - "total_submitted": 19773, - "total_column_articles": 129, + "total_acs": 13055, + "total_submitted": 20595, + "total_column_articles": 132, "frontend_question_id": "剑指 Offer II 059", "is_new_question": false }, @@ -978,9 +978,9 @@ "question__title": "日程表", "question__title_slug": "fi9suh", "question__hide": false, - "total_acs": 9391, - "total_submitted": 15247, - "total_column_articles": 102, + "total_acs": 9794, + "total_submitted": 15971, + "total_column_articles": 108, "frontend_question_id": "剑指 Offer II 058", "is_new_question": false }, @@ -999,9 +999,9 @@ "question__title": "值和下标之差都在给定的范围内", "question__title_slug": "7WqeDu", "question__hide": false, - "total_acs": 10215, - "total_submitted": 29200, - "total_column_articles": 84, + "total_acs": 10651, + "total_submitted": 30484, + "total_column_articles": 90, "frontend_question_id": "剑指 Offer II 057", "is_new_question": false }, @@ -1020,9 +1020,9 @@ "question__title": "最长连续序列", "question__title_slug": "WhsWhI", "question__hide": false, - "total_acs": 13177, - "total_submitted": 26646, - "total_column_articles": 128, + "total_acs": 13787, + "total_submitted": 27888, + "total_column_articles": 133, "frontend_question_id": "剑指 Offer II 119", "is_new_question": false }, @@ -1041,9 +1041,9 @@ "question__title": "二叉搜索树中两个节点之和", "question__title_slug": "opLdQZ", "question__hide": false, - "total_acs": 16368, - "total_submitted": 22281, - "total_column_articles": 190, + "total_acs": 17009, + "total_submitted": 23124, + "total_column_articles": 195, "frontend_question_id": "剑指 Offer II 056", "is_new_question": false }, @@ -1062,9 +1062,9 @@ "question__title": "多余的边", "question__title_slug": "7LpjUW", "question__hide": false, - "total_acs": 5724, - "total_submitted": 8189, - "total_column_articles": 85, + "total_acs": 5987, + "total_submitted": 8580, + "total_column_articles": 88, "frontend_question_id": "剑指 Offer II 118", "is_new_question": false }, @@ -1083,9 +1083,9 @@ "question__title": "相似的字符串", "question__title_slug": "H6lPxb", "question__hide": false, - "total_acs": 4803, - "total_submitted": 7644, - "total_column_articles": 60, + "total_acs": 5027, + "total_submitted": 8024, + "total_column_articles": 61, "frontend_question_id": "剑指 Offer II 117", "is_new_question": false }, @@ -1104,9 +1104,9 @@ "question__title": "二叉搜索树迭代器", "question__title_slug": "kTOapQ", "question__hide": false, - "total_acs": 11851, - "total_submitted": 13718, - "total_column_articles": 129, + "total_acs": 12301, + "total_submitted": 14236, + "total_column_articles": 131, "frontend_question_id": "剑指 Offer II 055", "is_new_question": false }, @@ -1125,9 +1125,9 @@ "question__title": "所有大于等于节点的值之和", "question__title_slug": "w6cpku", "question__hide": false, - "total_acs": 13642, - "total_submitted": 15923, - "total_column_articles": 177, + "total_acs": 14179, + "total_submitted": 16545, + "total_column_articles": 182, "frontend_question_id": "剑指 Offer II 054", "is_new_question": false }, @@ -1146,9 +1146,9 @@ "question__title": "重建序列", "question__title_slug": "ur2n8P", "question__hide": false, - "total_acs": 4839, - "total_submitted": 16001, - "total_column_articles": 72, + "total_acs": 5073, + "total_submitted": 16522, + "total_column_articles": 77, "frontend_question_id": "剑指 Offer II 115", "is_new_question": false }, @@ -1167,9 +1167,9 @@ "question__title": "二叉搜索树中的中序后继", "question__title_slug": "P5rCT8", "question__hide": false, - "total_acs": 17510, - "total_submitted": 27543, - "total_column_articles": 182, + "total_acs": 18195, + "total_submitted": 28552, + "total_column_articles": 186, "frontend_question_id": "剑指 Offer II 053", "is_new_question": false }, @@ -1188,8 +1188,8 @@ "question__title": "外星文字典", "question__title_slug": "Jf1JuT", "question__hide": false, - "total_acs": 16649, - "total_submitted": 30553, + "total_acs": 16839, + "total_submitted": 30978, "total_column_articles": 190, "frontend_question_id": "剑指 Offer II 114", "is_new_question": false @@ -1209,9 +1209,9 @@ "question__title": "展平二叉搜索树", "question__title_slug": "NYBBNL", "question__hide": false, - "total_acs": 16973, - "total_submitted": 22711, - "total_column_articles": 170, + "total_acs": 17590, + "total_submitted": 23559, + "total_column_articles": 178, "frontend_question_id": "剑指 Offer II 052", "is_new_question": false }, @@ -1230,9 +1230,9 @@ "question__title": "课程顺序", "question__title_slug": "QA2IGt", "question__hide": false, - "total_acs": 6819, - "total_submitted": 11988, - "total_column_articles": 86, + "total_acs": 7139, + "total_submitted": 12555, + "total_column_articles": 87, "frontend_question_id": "剑指 Offer II 113", "is_new_question": false }, @@ -1251,9 +1251,9 @@ "question__title": "节点之和最大的路径", "question__title_slug": "jC7MId", "question__hide": false, - "total_acs": 10678, - "total_submitted": 22621, - "total_column_articles": 108, + "total_acs": 11040, + "total_submitted": 23295, + "total_column_articles": 114, "frontend_question_id": "剑指 Offer II 051", "is_new_question": false }, @@ -1272,9 +1272,9 @@ "question__title": "最长递增路径", "question__title_slug": "fpTFWP", "question__hide": false, - "total_acs": 6899, - "total_submitted": 11932, - "total_column_articles": 81, + "total_acs": 7172, + "total_submitted": 12432, + "total_column_articles": 83, "frontend_question_id": "剑指 Offer II 112", "is_new_question": false }, @@ -1293,9 +1293,9 @@ "question__title": "向下的路径节点之和", "question__title_slug": "6eUYwP", "question__hide": false, - "total_acs": 14262, - "total_submitted": 23513, - "total_column_articles": 138, + "total_acs": 14831, + "total_submitted": 24424, + "total_column_articles": 140, "frontend_question_id": "剑指 Offer II 050", "is_new_question": false }, @@ -1314,9 +1314,9 @@ "question__title": "从根节点到叶节点的路径数字之和", "question__title_slug": "3Etpl5", "question__hide": false, - "total_acs": 16054, - "total_submitted": 21526, - "total_column_articles": 192, + "total_acs": 16671, + "total_submitted": 22379, + "total_column_articles": 200, "frontend_question_id": "剑指 Offer II 049", "is_new_question": false }, @@ -1335,9 +1335,9 @@ "question__title": "计算除法", "question__title_slug": "vlzXQL", "question__hide": false, - "total_acs": 4527, - "total_submitted": 6971, - "total_column_articles": 72, + "total_acs": 4770, + "total_submitted": 7371, + "total_column_articles": 75, "frontend_question_id": "剑指 Offer II 111", "is_new_question": false }, @@ -1356,9 +1356,9 @@ "question__title": "序列化与反序列化二叉树", "question__title_slug": "h54YBf", "question__hide": false, - "total_acs": 11772, - "total_submitted": 17540, - "total_column_articles": 112, + "total_acs": 12224, + "total_submitted": 18168, + "total_column_articles": 114, "frontend_question_id": "剑指 Offer II 048", "is_new_question": false }, @@ -1377,9 +1377,9 @@ "question__title": "所有路径", "question__title_slug": "bP4bmD", "question__hide": false, - "total_acs": 8898, - "total_submitted": 11036, - "total_column_articles": 131, + "total_acs": 9272, + "total_submitted": 11496, + "total_column_articles": 132, "frontend_question_id": "剑指 Offer II 110", "is_new_question": false }, @@ -1398,9 +1398,9 @@ "question__title": "开密码锁", "question__title_slug": "zlDJc7", "question__hide": false, - "total_acs": 6724, - "total_submitted": 11619, - "total_column_articles": 77, + "total_acs": 7071, + "total_submitted": 12208, + "total_column_articles": 79, "frontend_question_id": "剑指 Offer II 109", "is_new_question": false }, @@ -1419,9 +1419,9 @@ "question__title": "二叉树剪枝", "question__title_slug": "pOCWxh", "question__hide": false, - "total_acs": 16017, - "total_submitted": 23292, - "total_column_articles": 216, + "total_acs": 16677, + "total_submitted": 24254, + "total_column_articles": 228, "frontend_question_id": "剑指 Offer II 047", "is_new_question": false }, @@ -1440,9 +1440,9 @@ "question__title": "单词演变", "question__title_slug": "om3reC", "question__hide": false, - "total_acs": 5261, - "total_submitted": 8746, - "total_column_articles": 57, + "total_acs": 5549, + "total_submitted": 9166, + "total_column_articles": 58, "frontend_question_id": "剑指 Offer II 108", "is_new_question": false }, @@ -1461,9 +1461,9 @@ "question__title": "二叉树的右侧视图", "question__title_slug": "WNC0Lk", "question__hide": false, - "total_acs": 14898, - "total_submitted": 20798, - "total_column_articles": 205, + "total_acs": 15510, + "total_submitted": 21626, + "total_column_articles": 210, "frontend_question_id": "剑指 Offer II 046", "is_new_question": false }, @@ -1482,9 +1482,9 @@ "question__title": "二叉树最底层最左边的值", "question__title_slug": "LwUNpT", "question__hide": false, - "total_acs": 16628, - "total_submitted": 20893, - "total_column_articles": 228, + "total_acs": 17331, + "total_submitted": 21759, + "total_column_articles": 234, "frontend_question_id": "剑指 Offer II 045", "is_new_question": false }, @@ -1503,9 +1503,9 @@ "question__title": "二叉树每层的最大值", "question__title_slug": "hPov7L", "question__hide": false, - "total_acs": 16553, - "total_submitted": 26176, - "total_column_articles": 199, + "total_acs": 17181, + "total_submitted": 27121, + "total_column_articles": 203, "frontend_question_id": "剑指 Offer II 044", "is_new_question": false }, @@ -1524,8 +1524,8 @@ "question__title": "矩阵中的距离", "question__title_slug": "2bCMpM", "question__hide": false, - "total_acs": 7311, - "total_submitted": 14028, + "total_acs": 7713, + "total_submitted": 14747, "total_column_articles": 70, "frontend_question_id": "剑指 Offer II 107", "is_new_question": false @@ -1545,9 +1545,9 @@ "question__title": "往完全二叉树添加节点", "question__title_slug": "NaqhDT", "question__hide": false, - "total_acs": 12081, - "total_submitted": 19393, - "total_column_articles": 172, + "total_acs": 12601, + "total_submitted": 20291, + "total_column_articles": 180, "frontend_question_id": "剑指 Offer II 043", "is_new_question": false }, @@ -1566,8 +1566,8 @@ "question__title": "二分图", "question__title_slug": "vEAB3K", "question__hide": false, - "total_acs": 7565, - "total_submitted": 13810, + "total_acs": 7954, + "total_submitted": 14522, "total_column_articles": 90, "frontend_question_id": "剑指 Offer II 106", "is_new_question": false @@ -1587,9 +1587,9 @@ "question__title": "最近请求次数", "question__title_slug": "H8086Q", "question__hide": false, - "total_acs": 14778, - "total_submitted": 17797, - "total_column_articles": 143, + "total_acs": 15322, + "total_submitted": 18470, + "total_column_articles": 147, "frontend_question_id": "剑指 Offer II 042", "is_new_question": false }, @@ -1608,9 +1608,9 @@ "question__title": "滑动窗口的平均值", "question__title_slug": "qIsx9U", "question__hide": false, - "total_acs": 17512, - "total_submitted": 22615, - "total_column_articles": 173, + "total_acs": 18278, + "total_submitted": 23730, + "total_column_articles": 183, "frontend_question_id": "剑指 Offer II 041", "is_new_question": false }, @@ -1629,9 +1629,9 @@ "question__title": "岛屿的最大面积", "question__title_slug": "ZL6zAn", "question__hide": false, - "total_acs": 14651, - "total_submitted": 20937, - "total_column_articles": 166, + "total_acs": 15325, + "total_submitted": 21855, + "total_column_articles": 170, "frontend_question_id": "剑指 Offer II 105", "is_new_question": false }, @@ -1650,9 +1650,9 @@ "question__title": "排列的数目", "question__title_slug": "D0F0SV", "question__hide": false, - "total_acs": 7374, - "total_submitted": 12562, - "total_column_articles": 70, + "total_acs": 7701, + "total_submitted": 13148, + "total_column_articles": 71, "frontend_question_id": "剑指 Offer II 104", "is_new_question": false }, @@ -1671,9 +1671,9 @@ "question__title": "最少的硬币数目", "question__title_slug": "gaM7Ch", "question__hide": false, - "total_acs": 13945, - "total_submitted": 27555, - "total_column_articles": 108, + "total_acs": 14541, + "total_submitted": 28725, + "total_column_articles": 110, "frontend_question_id": "剑指 Offer II 103", "is_new_question": false }, @@ -1692,9 +1692,9 @@ "question__title": "加减的目标值", "question__title_slug": "YaVDxD", "question__hide": false, - "total_acs": 10020, - "total_submitted": 17494, - "total_column_articles": 84, + "total_acs": 10521, + "total_submitted": 18394, + "total_column_articles": 85, "frontend_question_id": "剑指 Offer II 102", "is_new_question": false }, @@ -1713,9 +1713,9 @@ "question__title": "分割等和子集", "question__title_slug": "NUPfPr", "question__hide": false, - "total_acs": 12534, - "total_submitted": 25095, - "total_column_articles": 100, + "total_acs": 13066, + "total_submitted": 26154, + "total_column_articles": 101, "frontend_question_id": "剑指 Offer II 101", "is_new_question": false }, @@ -1734,9 +1734,9 @@ "question__title": "三角形中最小路径之和", "question__title_slug": "IlPe0q", "question__hide": false, - "total_acs": 10707, - "total_submitted": 14145, - "total_column_articles": 128, + "total_acs": 11173, + "total_submitted": 14757, + "total_column_articles": 131, "frontend_question_id": "剑指 Offer II 100", "is_new_question": false }, @@ -1755,9 +1755,9 @@ "question__title": "最小路径之和", "question__title_slug": "0i0mDW", "question__hide": false, - "total_acs": 12362, - "total_submitted": 16894, - "total_column_articles": 134, + "total_acs": 12845, + "total_submitted": 17544, + "total_column_articles": 136, "frontend_question_id": "剑指 Offer II 099", "is_new_question": false }, @@ -1776,9 +1776,9 @@ "question__title": "矩阵中最大的矩形", "question__title_slug": "PLYXKQ", "question__hide": false, - "total_acs": 9248, - "total_submitted": 15806, - "total_column_articles": 123, + "total_acs": 9595, + "total_submitted": 16401, + "total_column_articles": 128, "frontend_question_id": "剑指 Offer II 040", "is_new_question": false }, @@ -1797,9 +1797,9 @@ "question__title": "直方图最大矩形面积", "question__title_slug": "0ynMMM", "question__hide": false, - "total_acs": 13964, - "total_submitted": 27423, - "total_column_articles": 121, + "total_acs": 14509, + "total_submitted": 28470, + "total_column_articles": 128, "frontend_question_id": "剑指 Offer II 039", "is_new_question": false }, @@ -1818,9 +1818,9 @@ "question__title": "每日温度", "question__title_slug": "iIQa4I", "question__hide": false, - "total_acs": 19845, - "total_submitted": 25690, - "total_column_articles": 206, + "total_acs": 20613, + "total_submitted": 26674, + "total_column_articles": 212, "frontend_question_id": "剑指 Offer II 038", "is_new_question": false }, @@ -1839,9 +1839,9 @@ "question__title": "小行星碰撞", "question__title_slug": "XagZNi", "question__hide": false, - "total_acs": 16080, - "total_submitted": 36456, - "total_column_articles": 218, + "total_acs": 16717, + "total_submitted": 38036, + "total_column_articles": 226, "frontend_question_id": "剑指 Offer II 037", "is_new_question": false }, @@ -1860,9 +1860,9 @@ "question__title": "子序列的数目", "question__title_slug": "21dk04", "question__hide": false, - "total_acs": 6845, - "total_submitted": 12451, - "total_column_articles": 73, + "total_acs": 7156, + "total_submitted": 12990, + "total_column_articles": 76, "frontend_question_id": "剑指 Offer II 097", "is_new_question": false }, @@ -1881,9 +1881,9 @@ "question__title": "后缀表达式", "question__title_slug": "8Zf90G", "question__hide": false, - "total_acs": 15345, - "total_submitted": 27203, - "total_column_articles": 182, + "total_acs": 15950, + "total_submitted": 28308, + "total_column_articles": 190, "frontend_question_id": "剑指 Offer II 036", "is_new_question": false }, @@ -1902,9 +1902,9 @@ "question__title": "最小时间差", "question__title_slug": "569nqc", "question__hide": false, - "total_acs": 15591, - "total_submitted": 23262, - "total_column_articles": 138, + "total_acs": 16192, + "total_submitted": 24165, + "total_column_articles": 141, "frontend_question_id": "剑指 Offer II 035", "is_new_question": false }, @@ -1923,8 +1923,8 @@ "question__title": "字符串交织", "question__title_slug": "IY6buf", "question__hide": false, - "total_acs": 8026, - "total_submitted": 16848, + "total_acs": 8417, + "total_submitted": 17605, "total_column_articles": 80, "frontend_question_id": "剑指 Offer II 096", "is_new_question": false @@ -1944,9 +1944,9 @@ "question__title": "外星语言是否排序", "question__title_slug": "lwyVBB", "question__hide": false, - "total_acs": 13608, - "total_submitted": 24355, - "total_column_articles": 189, + "total_acs": 14151, + "total_submitted": 25352, + "total_column_articles": 196, "frontend_question_id": "剑指 Offer II 034", "is_new_question": false }, @@ -1965,9 +1965,9 @@ "question__title": "变位词组", "question__title_slug": "sfvd7V", "question__hide": false, - "total_acs": 15922, - "total_submitted": 21160, - "total_column_articles": 155, + "total_acs": 16628, + "total_submitted": 22075, + "total_column_articles": 159, "frontend_question_id": "剑指 Offer II 033", "is_new_question": false }, @@ -1986,9 +1986,9 @@ "question__title": "最长公共子序列", "question__title_slug": "qJnOS7", "question__hide": false, - "total_acs": 22757, - "total_submitted": 34370, - "total_column_articles": 159, + "total_acs": 23574, + "total_submitted": 35583, + "total_column_articles": 160, "frontend_question_id": "剑指 Offer II 095", "is_new_question": false }, @@ -2007,9 +2007,9 @@ "question__title": "有效的变位词", "question__title_slug": "dKk3P7", "question__hide": false, - "total_acs": 18780, - "total_submitted": 31190, - "total_column_articles": 169, + "total_acs": 19515, + "total_submitted": 32489, + "total_column_articles": 175, "frontend_question_id": "剑指 Offer II 032", "is_new_question": false }, @@ -2028,9 +2028,9 @@ "question__title": "最少回文分割", "question__title_slug": "omKAoA", "question__hide": false, - "total_acs": 7078, - "total_submitted": 12171, - "total_column_articles": 66, + "total_acs": 7408, + "total_submitted": 12747, + "total_column_articles": 67, "frontend_question_id": "剑指 Offer II 094", "is_new_question": false }, @@ -2049,9 +2049,9 @@ "question__title": "最长斐波那契数列", "question__title_slug": "Q91FMA", "question__hide": false, - "total_acs": 9792, - "total_submitted": 16615, - "total_column_articles": 78, + "total_acs": 10270, + "total_submitted": 17433, + "total_column_articles": 80, "frontend_question_id": "剑指 Offer II 093", "is_new_question": false }, @@ -2070,9 +2070,9 @@ "question__title": "最近最少使用缓存", "question__title_slug": "OrIXps", "question__hide": false, - "total_acs": 14024, - "total_submitted": 25751, - "total_column_articles": 141, + "total_acs": 14586, + "total_submitted": 26747, + "total_column_articles": 148, "frontend_question_id": "剑指 Offer II 031", "is_new_question": false }, @@ -2091,9 +2091,9 @@ "question__title": "翻转字符", "question__title_slug": "cyJERH", "question__hide": false, - "total_acs": 10653, - "total_submitted": 15788, - "total_column_articles": 154, + "total_acs": 11223, + "total_submitted": 16622, + "total_column_articles": 160, "frontend_question_id": "剑指 Offer II 092", "is_new_question": false }, @@ -2112,9 +2112,9 @@ "question__title": "粉刷房子", "question__title_slug": "JEj789", "question__hide": false, - "total_acs": 11893, - "total_submitted": 15370, - "total_column_articles": 194, + "total_acs": 33607, + "total_submitted": 43280, + "total_column_articles": 451, "frontend_question_id": "剑指 Offer II 091", "is_new_question": false }, @@ -2133,9 +2133,9 @@ "question__title": "插入、删除和随机访问都是 O(1) 的容器", "question__title_slug": "FortPu", "question__hide": false, - "total_acs": 12921, - "total_submitted": 23828, - "total_column_articles": 98, + "total_acs": 13513, + "total_submitted": 24940, + "total_column_articles": 102, "frontend_question_id": "剑指 Offer II 030", "is_new_question": false }, @@ -2154,9 +2154,9 @@ "question__title": "环形房屋偷盗", "question__title_slug": "PzWKhm", "question__hide": false, - "total_acs": 9170, - "total_submitted": 18718, - "total_column_articles": 97, + "total_acs": 9593, + "total_submitted": 19623, + "total_column_articles": 101, "frontend_question_id": "剑指 Offer II 090", "is_new_question": false }, @@ -2175,9 +2175,9 @@ "question__title": "排序的循环链表", "question__title_slug": "4ueAj6", "question__hide": false, - "total_acs": 23982, - "total_submitted": 72776, - "total_column_articles": 390, + "total_acs": 33324, + "total_submitted": 97550, + "total_column_articles": 502, "frontend_question_id": "剑指 Offer II 029", "is_new_question": false }, @@ -2196,9 +2196,9 @@ "question__title": "展平多级双向链表", "question__title_slug": "Qv1Da2", "question__hide": false, - "total_acs": 13866, - "total_submitted": 22848, - "total_column_articles": 208, + "total_acs": 14464, + "total_submitted": 23878, + "total_column_articles": 221, "frontend_question_id": "剑指 Offer II 028", "is_new_question": false }, @@ -2217,9 +2217,9 @@ "question__title": "回文链表", "question__title_slug": "aMhZSa", "question__hide": false, - "total_acs": 33282, - "total_submitted": 54086, - "total_column_articles": 315, + "total_acs": 34472, + "total_submitted": 55978, + "total_column_articles": 323, "frontend_question_id": "剑指 Offer II 027", "is_new_question": false }, @@ -2238,9 +2238,9 @@ "question__title": "重排链表", "question__title_slug": "LGjMqU", "question__hide": false, - "total_acs": 21987, - "total_submitted": 32948, - "total_column_articles": 233, + "total_acs": 22805, + "total_submitted": 34148, + "total_column_articles": 239, "frontend_question_id": "剑指 Offer II 026", "is_new_question": false }, @@ -2259,9 +2259,9 @@ "question__title": "链表中的两数相加", "question__title_slug": "lMSNwu", "question__hide": false, - "total_acs": 21382, - "total_submitted": 36005, - "total_column_articles": 257, + "total_acs": 22195, + "total_submitted": 37320, + "total_column_articles": 264, "frontend_question_id": "剑指 Offer II 025", "is_new_question": false }, @@ -2280,9 +2280,9 @@ "question__title": "反转链表", "question__title_slug": "UHnkqh", "question__hide": false, - "total_acs": 52411, - "total_submitted": 69331, - "total_column_articles": 337, + "total_acs": 54124, + "total_submitted": 71584, + "total_column_articles": 355, "frontend_question_id": "剑指 Offer II 024", "is_new_question": false }, @@ -2301,9 +2301,9 @@ "question__title": "两个链表的第一个重合节点", "question__title_slug": "3u1WK4", "question__hide": false, - "total_acs": 23890, - "total_submitted": 34144, - "total_column_articles": 184, + "total_acs": 24753, + "total_submitted": 35317, + "total_column_articles": 189, "frontend_question_id": "剑指 Offer II 023", "is_new_question": false }, @@ -2322,9 +2322,9 @@ "question__title": "链表中环的入口节点", "question__title_slug": "c32eOV", "question__hide": false, - "total_acs": 30298, - "total_submitted": 54718, - "total_column_articles": 224, + "total_acs": 31381, + "total_submitted": 56589, + "total_column_articles": 231, "frontend_question_id": "剑指 Offer II 022", "is_new_question": false }, @@ -2343,9 +2343,9 @@ "question__title": "删除链表的倒数第 n 个结点", "question__title_slug": "SLwz0R", "question__hide": false, - "total_acs": 27142, - "total_submitted": 51148, - "total_column_articles": 294, + "total_acs": 28086, + "total_submitted": 52865, + "total_column_articles": 304, "frontend_question_id": "剑指 Offer II 021", "is_new_question": false }, @@ -2364,9 +2364,9 @@ "question__title": "回文子字符串的个数", "question__title_slug": "a7VOhD", "question__hide": false, - "total_acs": 20342, - "total_submitted": 28346, - "total_column_articles": 198, + "total_acs": 21130, + "total_submitted": 29408, + "total_column_articles": 202, "frontend_question_id": "剑指 Offer II 020", "is_new_question": false }, @@ -2385,9 +2385,9 @@ "question__title": "最多删除一个字符得到回文", "question__title_slug": "RQku0D", "question__hide": false, - "total_acs": 20656, - "total_submitted": 45005, - "total_column_articles": 205, + "total_acs": 21445, + "total_submitted": 46720, + "total_column_articles": 212, "frontend_question_id": "剑指 Offer II 019", "is_new_question": false }, @@ -2406,9 +2406,9 @@ "question__title": "有效的回文", "question__title_slug": "XltzEq", "question__hide": false, - "total_acs": 23391, - "total_submitted": 45344, - "total_column_articles": 214, + "total_acs": 24247, + "total_submitted": 46918, + "total_column_articles": 221, "frontend_question_id": "剑指 Offer II 018", "is_new_question": false }, @@ -2427,9 +2427,9 @@ "question__title": "含有所有字符的最短字符串", "question__title_slug": "M1oyTv", "question__hide": false, - "total_acs": 16127, - "total_submitted": 31868, - "total_column_articles": 185, + "total_acs": 16791, + "total_submitted": 33129, + "total_column_articles": 192, "frontend_question_id": "剑指 Offer II 017", "is_new_question": false }, @@ -2448,9 +2448,9 @@ "question__title": "不含重复字符的最长子字符串", "question__title_slug": "wtcaE1", "question__hide": false, - "total_acs": 25105, - "total_submitted": 52685, - "total_column_articles": 264, + "total_acs": 25988, + "total_submitted": 54619, + "total_column_articles": 272, "frontend_question_id": "剑指 Offer II 016", "is_new_question": false }, @@ -2469,9 +2469,9 @@ "question__title": "字符串中的所有变位词", "question__title_slug": "VabMRr", "question__hide": false, - "total_acs": 18361, - "total_submitted": 29632, - "total_column_articles": 188, + "total_acs": 19105, + "total_submitted": 30772, + "total_column_articles": 194, "frontend_question_id": "剑指 Offer II 015", "is_new_question": false }, @@ -2490,9 +2490,9 @@ "question__title": "字符串中的变位词", "question__title_slug": "MPnaiL", "question__hide": false, - "total_acs": 23163, - "total_submitted": 45239, - "total_column_articles": 213, + "total_acs": 24083, + "total_submitted": 46940, + "total_column_articles": 220, "frontend_question_id": "剑指 Offer II 014", "is_new_question": false }, @@ -2511,9 +2511,9 @@ "question__title": "二维子矩阵的和", "question__title_slug": "O4NDxx", "question__hide": false, - "total_acs": 18209, - "total_submitted": 27362, - "total_column_articles": 180, + "total_acs": 18931, + "total_submitted": 28348, + "total_column_articles": 183, "frontend_question_id": "剑指 Offer II 013", "is_new_question": false }, @@ -2532,9 +2532,9 @@ "question__title": "左右两边子数组的和相等", "question__title_slug": "tvdfij", "question__hide": false, - "total_acs": 25562, - "total_submitted": 38111, - "total_column_articles": 260, + "total_acs": 26432, + "total_submitted": 39371, + "total_column_articles": 267, "frontend_question_id": "剑指 Offer II 012", "is_new_question": false }, @@ -2553,9 +2553,9 @@ "question__title": "0 和 1 个数相同的子数组", "question__title_slug": "A1NYOS", "question__hide": false, - "total_acs": 22141, - "total_submitted": 40024, - "total_column_articles": 215, + "total_acs": 22893, + "total_submitted": 41365, + "total_column_articles": 226, "frontend_question_id": "剑指 Offer II 011", "is_new_question": false }, @@ -2574,9 +2574,9 @@ "question__title": "和为 k 的子数组", "question__title_slug": "QTMn0o", "question__hide": false, - "total_acs": 28234, - "total_submitted": 65502, - "total_column_articles": 231, + "total_acs": 29246, + "total_submitted": 67789, + "total_column_articles": 234, "frontend_question_id": "剑指 Offer II 010", "is_new_question": false }, @@ -2595,9 +2595,9 @@ "question__title": "房屋偷盗", "question__title_slug": "Gu0c2T", "question__hide": false, - "total_acs": 13604, - "total_submitted": 22407, - "total_column_articles": 124, + "total_acs": 14155, + "total_submitted": 23283, + "total_column_articles": 129, "frontend_question_id": "剑指 Offer II 089", "is_new_question": false }, @@ -2616,9 +2616,9 @@ "question__title": "乘积小于 K 的子数组", "question__title_slug": "ZVAVXX", "question__hide": false, - "total_acs": 26710, - "total_submitted": 49524, - "total_column_articles": 253, + "total_acs": 27620, + "total_submitted": 51122, + "total_column_articles": 258, "frontend_question_id": "剑指 Offer II 009", "is_new_question": false }, @@ -2637,9 +2637,9 @@ "question__title": "爬楼梯的最少成本", "question__title_slug": "GzCJIP", "question__hide": false, - "total_acs": 18968, - "total_submitted": 25782, - "total_column_articles": 172, + "total_acs": 19608, + "total_submitted": 26659, + "total_column_articles": 177, "frontend_question_id": "剑指 Offer II 088", "is_new_question": false }, @@ -2658,9 +2658,9 @@ "question__title": "和大于等于 target 的最短子数组", "question__title_slug": "2VG8Kg", "question__hide": false, - "total_acs": 32001, - "total_submitted": 65305, - "total_column_articles": 288, + "total_acs": 33151, + "total_submitted": 67467, + "total_column_articles": 300, "frontend_question_id": "剑指 Offer II 008", "is_new_question": false }, @@ -2679,9 +2679,9 @@ "question__title": "复原 IP ", "question__title_slug": "0on3uN", "question__hide": false, - "total_acs": 11260, - "total_submitted": 17916, - "total_column_articles": 136, + "total_acs": 11712, + "total_submitted": 18751, + "total_column_articles": 140, "frontend_question_id": "剑指 Offer II 087", "is_new_question": false }, @@ -2700,9 +2700,9 @@ "question__title": "分割回文子字符串", "question__title_slug": "M99OJA", "question__hide": false, - "total_acs": 11004, - "total_submitted": 14652, - "total_column_articles": 112, + "total_acs": 11495, + "total_submitted": 15312, + "total_column_articles": 115, "frontend_question_id": "剑指 Offer II 086", "is_new_question": false }, @@ -2721,9 +2721,9 @@ "question__title": "数组中和为 0 的三个数", "question__title_slug": "1fGaJU", "question__hide": false, - "total_acs": 31036, - "total_submitted": 70393, - "total_column_articles": 227, + "total_acs": 32100, + "total_submitted": 72750, + "total_column_articles": 229, "frontend_question_id": "剑指 Offer II 007", "is_new_question": false }, @@ -2742,9 +2742,9 @@ "question__title": "生成匹配的括号", "question__title_slug": "IDBivT", "question__hide": false, - "total_acs": 15143, - "total_submitted": 17715, - "total_column_articles": 190, + "total_acs": 15669, + "total_submitted": 18348, + "total_column_articles": 195, "frontend_question_id": "剑指 Offer II 085", "is_new_question": false }, @@ -2763,9 +2763,9 @@ "question__title": "排序数组中两个数字之和", "question__title_slug": "kLl5u1", "question__hide": false, - "total_acs": 34364, - "total_submitted": 52777, - "total_column_articles": 279, + "total_acs": 35513, + "total_submitted": 54358, + "total_column_articles": 285, "frontend_question_id": "剑指 Offer II 006", "is_new_question": false }, @@ -2784,9 +2784,9 @@ "question__title": "单词长度的最大乘积", "question__title_slug": "aseY1I", "question__hide": false, - "total_acs": 29694, - "total_submitted": 41813, - "total_column_articles": 262, + "total_acs": 30684, + "total_submitted": 43186, + "total_column_articles": 268, "frontend_question_id": "剑指 Offer II 005", "is_new_question": false }, @@ -2805,9 +2805,9 @@ "question__title": "含有重复元素集合的全排列 ", "question__title_slug": "7p8L0Z", "question__hide": false, - "total_acs": 12629, - "total_submitted": 18300, - "total_column_articles": 120, + "total_acs": 13113, + "total_submitted": 18986, + "total_column_articles": 123, "frontend_question_id": "剑指 Offer II 084", "is_new_question": false }, @@ -2826,9 +2826,9 @@ "question__title": "没有重复元素集合的全排列", "question__title_slug": "VvJkup", "question__hide": false, - "total_acs": 14440, - "total_submitted": 16829, - "total_column_articles": 170, + "total_acs": 14996, + "total_submitted": 17518, + "total_column_articles": 172, "frontend_question_id": "剑指 Offer II 083", "is_new_question": false }, @@ -2847,9 +2847,9 @@ "question__title": "只出现一次的数字 ", "question__title_slug": "WGki4K", "question__hide": false, - "total_acs": 37045, - "total_submitted": 52020, - "total_column_articles": 307, + "total_acs": 38188, + "total_submitted": 53548, + "total_column_articles": 317, "frontend_question_id": "剑指 Offer II 004", "is_new_question": false }, @@ -2868,9 +2868,9 @@ "question__title": "含有重复元素集合的组合", "question__title_slug": "4sjJUc", "question__hide": false, - "total_acs": 13052, - "total_submitted": 19893, - "total_column_articles": 131, + "total_acs": 13517, + "total_submitted": 20625, + "total_column_articles": 133, "frontend_question_id": "剑指 Offer II 082", "is_new_question": false }, @@ -2889,9 +2889,9 @@ "question__title": "二进制加法", "question__title_slug": "JFETK5", "question__hide": false, - "total_acs": 34038, - "total_submitted": 61964, - "total_column_articles": 345, + "total_acs": 35088, + "total_submitted": 63848, + "total_column_articles": 349, "frontend_question_id": "剑指 Offer II 002", "is_new_question": false }, @@ -2910,9 +2910,9 @@ "question__title": "前 n 个数字二进制中 1 的个数", "question__title_slug": "w3tCBm", "question__hide": false, - "total_acs": 43451, - "total_submitted": 55231, - "total_column_articles": 400, + "total_acs": 44776, + "total_submitted": 56941, + "total_column_articles": 404, "frontend_question_id": "剑指 Offer II 003", "is_new_question": false }, @@ -2931,9 +2931,9 @@ "question__title": "允许重复选择元素的组合", "question__title_slug": "Ygoe9J", "question__hide": false, - "total_acs": 15719, - "total_submitted": 19518, - "total_column_articles": 167, + "total_acs": 16272, + "total_submitted": 20184, + "total_column_articles": 169, "frontend_question_id": "剑指 Offer II 081", "is_new_question": false }, @@ -2952,9 +2952,9 @@ "question__title": "整数除法", "question__title_slug": "xoh6Oh", "question__hide": false, - "total_acs": 38385, - "total_submitted": 180960, - "total_column_articles": 331, + "total_acs": 39504, + "total_submitted": 185831, + "total_column_articles": 335, "frontend_question_id": "剑指 Offer II 001", "is_new_question": false }, @@ -2973,9 +2973,9 @@ "question__title": "主题空间", "question__title_slug": "YesdPw", "question__hide": false, - "total_acs": 2665, - "total_submitted": 6447, - "total_column_articles": 77, + "total_acs": 2709, + "total_submitted": 6527, + "total_column_articles": 80, "frontend_question_id": "LCS 03", "is_new_question": false }, @@ -2994,9 +2994,9 @@ "question__title": "完成一半题目", "question__title_slug": "WqXACV", "question__hide": false, - "total_acs": 6206, - "total_submitted": 9473, - "total_column_articles": 123, + "total_acs": 6295, + "total_submitted": 9594, + "total_column_articles": 125, "frontend_question_id": "LCS 02", "is_new_question": false }, @@ -3015,9 +3015,9 @@ "question__title": "下载插件", "question__title_slug": "Ju9Xwi", "question__hide": false, - "total_acs": 8692, - "total_submitted": 15886, - "total_column_articles": 193, + "total_acs": 8844, + "total_submitted": 16190, + "total_column_articles": 196, "frontend_question_id": "LCS 01", "is_new_question": false }, @@ -3036,9 +3036,9 @@ "question__title": "魔塔游戏", "question__title_slug": "p0NxJO", "question__hide": false, - "total_acs": 7794, - "total_submitted": 20920, - "total_column_articles": 131, + "total_acs": 7859, + "total_submitted": 21099, + "total_column_articles": 132, "frontend_question_id": "LCP 30", "is_new_question": false }, @@ -3057,8 +3057,8 @@ "question__title": "守卫城堡", "question__title_slug": "7rLGCR", "question__hide": false, - "total_acs": 788, - "total_submitted": 1246, + "total_acs": 794, + "total_submitted": 1255, "total_column_articles": 16, "frontend_question_id": "LCP 38", "is_new_question": false @@ -3078,8 +3078,8 @@ "question__title": "最多牌组数", "question__title_slug": "Up5XYM", "question__hide": false, - "total_acs": 1308, - "total_submitted": 3950, + "total_acs": 1320, + "total_submitted": 3972, "total_column_articles": 24, "frontend_question_id": "LCP 36", "is_new_question": false @@ -3099,9 +3099,9 @@ "question__title": "蓄水", "question__title_slug": "o8SXZn", "question__hide": false, - "total_acs": 7054, - "total_submitted": 27989, - "total_column_articles": 121, + "total_acs": 7130, + "total_submitted": 28291, + "total_column_articles": 122, "frontend_question_id": "LCP 33", "is_new_question": false }, @@ -3120,9 +3120,9 @@ "question__title": "电动车游城市", "question__title_slug": "DFPeFJ", "question__hide": false, - "total_acs": 1861, - "total_submitted": 3963, - "total_column_articles": 30, + "total_acs": 1884, + "total_submitted": 4007, + "total_column_articles": 31, "frontend_question_id": "LCP 35", "is_new_question": false }, @@ -3141,8 +3141,8 @@ "question__title": "批量处理任务", "question__title_slug": "t3fKg1", "question__hide": false, - "total_acs": 1573, - "total_submitted": 3526, + "total_acs": 1577, + "total_submitted": 3534, "total_column_articles": 26, "frontend_question_id": "LCP 32", "is_new_question": false @@ -3162,8 +3162,8 @@ "question__title": "变换的迷宫", "question__title_slug": "Db3wC1", "question__hide": false, - "total_acs": 2430, - "total_submitted": 8505, + "total_acs": 2437, + "total_submitted": 8518, "total_column_articles": 40, "frontend_question_id": "LCP 31", "is_new_question": false @@ -3183,8 +3183,8 @@ "question__title": "乐团站位", "question__title_slug": "SNJvJP", "question__hide": false, - "total_acs": 7278, - "total_submitted": 34860, + "total_acs": 7311, + "total_submitted": 35024, "total_column_articles": 163, "frontend_question_id": "LCP 29", "is_new_question": false @@ -3204,9 +3204,9 @@ "question__title": "采购方案", "question__title_slug": "4xy4Wx", "question__hide": false, - "total_acs": 15350, - "total_submitted": 49893, - "total_column_articles": 251, + "total_acs": 15478, + "total_submitted": 50251, + "total_column_articles": 255, "frontend_question_id": "LCP 28", "is_new_question": false }, @@ -3225,9 +3225,9 @@ "question__title": "黑盒光线反射", "question__title_slug": "IQvJ9i", "question__hide": false, - "total_acs": 1449, - "total_submitted": 4304, - "total_column_articles": 30, + "total_acs": 1453, + "total_submitted": 4319, + "total_column_articles": 31, "frontend_question_id": "LCP 27", "is_new_question": false }, @@ -3246,9 +3246,9 @@ "question__title": "早餐组合", "question__title_slug": "2vYnGI", "question__hide": false, - "total_acs": 21347, - "total_submitted": 71904, - "total_column_articles": 291, + "total_acs": 21459, + "total_submitted": 72305, + "total_column_articles": 294, "frontend_question_id": "LCP 18", "is_new_question": false }, @@ -3267,9 +3267,9 @@ "question__title": "黑白方格画", "question__title_slug": "ccw6C7", "question__hide": false, - "total_acs": 10060, - "total_submitted": 29369, - "total_column_articles": 202, + "total_acs": 10083, + "total_submitted": 29438, + "total_column_articles": 205, "frontend_question_id": "LCP 22", "is_new_question": false }, @@ -3288,9 +3288,9 @@ "question__title": "速算机器人", "question__title_slug": "nGK0Fy", "question__hide": false, - "total_acs": 27680, - "total_submitted": 34603, - "total_column_articles": 307, + "total_acs": 27864, + "total_submitted": 34829, + "total_column_articles": 309, "frontend_question_id": "LCP 17", "is_new_question": false }, @@ -3309,9 +3309,9 @@ "question__title": "古董键盘", "question__title_slug": "Uh984O", "question__hide": false, - "total_acs": 1511, - "total_submitted": 4173, - "total_column_articles": 31, + "total_acs": 1517, + "total_submitted": 4235, + "total_column_articles": 33, "frontend_question_id": "LCP 25", "is_new_question": false }, @@ -3330,8 +3330,8 @@ "question__title": "追逐游戏", "question__title_slug": "Za25hA", "question__hide": false, - "total_acs": 1243, - "total_submitted": 3382, + "total_acs": 1254, + "total_submitted": 3411, "total_column_articles": 32, "frontend_question_id": "LCP 21", "is_new_question": false @@ -3351,8 +3351,8 @@ "question__title": "快速公交", "question__title_slug": "meChtZ", "question__hide": false, - "total_acs": 2183, - "total_submitted": 6437, + "total_acs": 2191, + "total_submitted": 6459, "total_column_articles": 34, "frontend_question_id": "LCP 20", "is_new_question": false @@ -3372,8 +3372,8 @@ "question__title": "导航装置", "question__title_slug": "hSRGyL", "question__hide": false, - "total_acs": 775, - "total_submitted": 2102, + "total_acs": 781, + "total_submitted": 2139, "total_column_articles": 23, "frontend_question_id": "LCP 26", "is_new_question": false @@ -3393,9 +3393,9 @@ "question__title": "数字游戏", "question__title_slug": "5TxKeK", "question__hide": false, - "total_acs": 1148, - "total_submitted": 3793, - "total_column_articles": 29, + "total_acs": 1152, + "total_submitted": 3814, + "total_column_articles": 30, "frontend_question_id": "LCP 24", "is_new_question": false }, @@ -3414,8 +3414,8 @@ "question__title": "秋叶收藏集", "question__title_slug": "UlBDOe", "question__hide": false, - "total_acs": 20848, - "total_submitted": 40234, + "total_acs": 20885, + "total_submitted": 40296, "total_column_articles": 219, "frontend_question_id": "LCP 19", "is_new_question": false @@ -3435,9 +3435,9 @@ "question__title": "寻宝", "question__title_slug": "xun-bao", "question__hide": false, - "total_acs": 9803, - "total_submitted": 16135, - "total_column_articles": 88, + "total_acs": 9821, + "total_submitted": 16169, + "total_column_articles": 91, "frontend_question_id": "LCP 13", "is_new_question": false }, @@ -3456,8 +3456,8 @@ "question__title": "最小矩形面积", "question__title_slug": "zui-xiao-ju-xing-mian-ji", "question__hide": false, - "total_acs": 1259, - "total_submitted": 5234, + "total_acs": 1263, + "total_submitted": 5241, "total_column_articles": 26, "frontend_question_id": "LCP 37", "is_new_question": false @@ -3477,9 +3477,9 @@ "question__title": "最小跳跃次数", "question__title_slug": "zui-xiao-tiao-yue-ci-shu", "question__hide": false, - "total_acs": 8621, - "total_submitted": 28535, - "total_column_articles": 120, + "total_acs": 8768, + "total_submitted": 28829, + "total_column_articles": 121, "frontend_question_id": "LCP 09", "is_new_question": false }, @@ -3498,8 +3498,8 @@ "question__title": "二叉树染色", "question__title_slug": "er-cha-shu-ran-se-UGC", "question__hide": false, - "total_acs": 3852, - "total_submitted": 7135, + "total_acs": 3893, + "total_submitted": 7213, "total_column_articles": 79, "frontend_question_id": "LCP 34", "is_new_question": false @@ -3519,8 +3519,8 @@ "question__title": "游乐园的迷宫", "question__title_slug": "you-le-yuan-de-mi-gong", "question__hide": false, - "total_acs": 1119, - "total_submitted": 1879, + "total_acs": 1128, + "total_submitted": 1889, "total_column_articles": 25, "frontend_question_id": "LCP 15", "is_new_question": false @@ -3540,8 +3540,8 @@ "question__title": "小张刷题计划", "question__title_slug": "xiao-zhang-shua-ti-ji-hua", "question__hide": false, - "total_acs": 8540, - "total_submitted": 19987, + "total_acs": 8682, + "total_submitted": 20285, "total_column_articles": 130, "frontend_question_id": "LCP 12", "is_new_question": false @@ -3561,9 +3561,9 @@ "question__title": "期望个数统计", "question__title_slug": "qi-wang-ge-shu-tong-ji", "question__hide": false, - "total_acs": 8376, - "total_submitted": 11847, - "total_column_articles": 85, + "total_acs": 8433, + "total_submitted": 11923, + "total_column_articles": 88, "frontend_question_id": "LCP 11", "is_new_question": false }, @@ -3582,8 +3582,8 @@ "question__title": "游乐园的游览计划", "question__title_slug": "you-le-yuan-de-you-lan-ji-hua", "question__hide": false, - "total_acs": 811, - "total_submitted": 2434, + "total_acs": 815, + "total_submitted": 2443, "total_column_articles": 18, "frontend_question_id": "LCP 16", "is_new_question": false @@ -3603,9 +3603,9 @@ "question__title": "传递信息", "question__title_slug": "chuan-di-xin-xi", "question__hide": false, - "total_acs": 46177, - "total_submitted": 60461, - "total_column_articles": 547, + "total_acs": 46393, + "total_submitted": 60762, + "total_column_articles": 549, "frontend_question_id": "LCP 07", "is_new_question": false }, @@ -3624,9 +3624,9 @@ "question__title": "二叉树任务调度", "question__title_slug": "er-cha-shu-ren-wu-diao-du", "question__hide": false, - "total_acs": 2387, - "total_submitted": 3956, - "total_column_articles": 43, + "total_acs": 2413, + "total_submitted": 4004, + "total_column_articles": 44, "frontend_question_id": "LCP 10", "is_new_question": false }, @@ -3645,8 +3645,8 @@ "question__title": "切分数组", "question__title_slug": "qie-fen-shu-zu", "question__hide": false, - "total_acs": 3290, - "total_submitted": 14542, + "total_acs": 3309, + "total_submitted": 14587, "total_column_articles": 51, "frontend_question_id": "LCP 14", "is_new_question": false @@ -3666,8 +3666,8 @@ "question__title": "魔术排列", "question__title_slug": "er94lq", "question__hide": false, - "total_acs": 3162, - "total_submitted": 9011, + "total_acs": 3185, + "total_submitted": 9057, "total_column_articles": 59, "frontend_question_id": "LCP 23", "is_new_question": false @@ -3687,8 +3687,8 @@ "question__title": "剧情触发时间", "question__title_slug": "ju-qing-hong-fa-shi-jian", "question__hide": false, - "total_acs": 6160, - "total_submitted": 19858, + "total_acs": 6218, + "total_submitted": 20020, "total_column_articles": 117, "frontend_question_id": "LCP 08", "is_new_question": false @@ -3708,9 +3708,9 @@ "question__title": "拿硬币", "question__title_slug": "na-ying-bi", "question__hide": false, - "total_acs": 50514, - "total_submitted": 60123, - "total_column_articles": 754, + "total_acs": 50801, + "total_submitted": 60518, + "total_column_articles": 760, "frontend_question_id": "LCP 06", "is_new_question": false }, @@ -3729,9 +3729,9 @@ "question__title": "Sparse Similarity LCCI", "question__title_slug": "sparse-similarity-lcci", "question__hide": false, - "total_acs": 4585, - "total_submitted": 13132, - "total_column_articles": 75, + "total_acs": 4622, + "total_submitted": 13249, + "total_column_articles": 76, "frontend_question_id": "面试题 17.26", "is_new_question": false }, @@ -3750,8 +3750,8 @@ "question__title": "Langtons Ant LCCI", "question__title_slug": "langtons-ant-lcci", "question__hide": false, - "total_acs": 3617, - "total_submitted": 6227, + "total_acs": 3666, + "total_submitted": 6300, "total_column_articles": 70, "frontend_question_id": "面试题 16.22", "is_new_question": false @@ -3771,8 +3771,8 @@ "question__title": "Word Rectangle LCCI", "question__title_slug": "word-rectangle-lcci", "question__hide": false, - "total_acs": 2224, - "total_submitted": 4355, + "total_acs": 2242, + "total_submitted": 4381, "total_column_articles": 46, "frontend_question_id": "面试题 17.25", "is_new_question": false @@ -3792,9 +3792,9 @@ "question__title": "Sum Swap LCCI", "question__title_slug": "sum-swap-lcci", "question__hide": false, - "total_acs": 12604, - "total_submitted": 26714, - "total_column_articles": 223, + "total_acs": 12744, + "total_submitted": 26984, + "total_column_articles": 224, "frontend_question_id": "面试题 16.21", "is_new_question": false }, @@ -3813,9 +3813,9 @@ "question__title": "T9 LCCI", "question__title_slug": "t9-lcci", "question__hide": false, - "total_acs": 11748, - "total_submitted": 16385, - "total_column_articles": 217, + "total_acs": 11899, + "total_submitted": 16627, + "total_column_articles": 221, "frontend_question_id": "面试题 16.20", "is_new_question": false }, @@ -3834,9 +3834,9 @@ "question__title": "Max Submatrix LCCI", "question__title_slug": "max-submatrix-lcci", "question__hide": false, - "total_acs": 17108, - "total_submitted": 32082, - "total_column_articles": 166, + "total_acs": 17332, + "total_submitted": 32454, + "total_column_articles": 168, "frontend_question_id": "面试题 17.24", "is_new_question": false }, @@ -3855,8 +3855,8 @@ "question__title": "Max Black Square LCCI", "question__title_slug": "max-black-square-lcci", "question__hide": false, - "total_acs": 6202, - "total_submitted": 16514, + "total_acs": 6291, + "total_submitted": 16762, "total_column_articles": 133, "frontend_question_id": "面试题 17.23", "is_new_question": false @@ -3876,9 +3876,9 @@ "question__title": "Missing Two LCCI", "question__title_slug": "missing-two-lcci", "question__hide": false, - "total_acs": 11018, - "total_submitted": 19014, - "total_column_articles": 223, + "total_acs": 11107, + "total_submitted": 19162, + "total_column_articles": 224, "frontend_question_id": "面试题 17.19", "is_new_question": false }, @@ -3897,9 +3897,9 @@ "question__title": "Shortest Supersequence LCCI", "question__title_slug": "shortest-supersequence-lcci", "question__hide": false, - "total_acs": 10215, - "total_submitted": 22997, - "total_column_articles": 151, + "total_acs": 10365, + "total_submitted": 23348, + "total_column_articles": 152, "frontend_question_id": "面试题 17.18", "is_new_question": false }, @@ -3918,9 +3918,9 @@ "question__title": "Pairs With Sum LCCI", "question__title_slug": "pairs-with-sum-lcci", "question__hide": false, - "total_acs": 13997, - "total_submitted": 29223, - "total_column_articles": 205, + "total_acs": 14152, + "total_submitted": 29548, + "total_column_articles": 209, "frontend_question_id": "面试题 16.24", "is_new_question": false }, @@ -3939,9 +3939,9 @@ "question__title": "Rank from Stream LCCI", "question__title_slug": "rank-from-stream-lcci", "question__hide": false, - "total_acs": 7215, - "total_submitted": 11634, - "total_column_articles": 124, + "total_acs": 7310, + "total_submitted": 11804, + "total_column_articles": 127, "frontend_question_id": "面试题 10.10", "is_new_question": false }, @@ -3960,9 +3960,9 @@ "question__title": "Group Anagrams LCCI", "question__title_slug": "group-anagrams-lcci", "question__hide": false, - "total_acs": 38465, - "total_submitted": 51875, - "total_column_articles": 455, + "total_acs": 38594, + "total_submitted": 52022, + "total_column_articles": 456, "frontend_question_id": "面试题 10.02", "is_new_question": false }, @@ -3981,8 +3981,8 @@ "question__title": "Find Closest LCCI", "question__title_slug": "find-closest-lcci", "question__hide": false, - "total_acs": 46631, - "total_submitted": 63703, + "total_acs": 46792, + "total_submitted": 63949, "total_column_articles": 640, "frontend_question_id": "面试题 17.11", "is_new_question": false @@ -4002,9 +4002,9 @@ "question__title": "Find Majority Element LCCI", "question__title_slug": "find-majority-element-lcci", "question__hide": false, - "total_acs": 72276, - "total_submitted": 127514, - "total_column_articles": 992, + "total_acs": 72462, + "total_submitted": 127921, + "total_column_articles": 995, "frontend_question_id": "面试题 17.10", "is_new_question": false }, @@ -4023,9 +4023,9 @@ "question__title": "Get Kth Magic Number LCCI", "question__title_slug": "get-kth-magic-number-lcci", "question__hide": false, - "total_acs": 17674, - "total_submitted": 32076, - "total_column_articles": 181, + "total_acs": 17806, + "total_submitted": 32309, + "total_column_articles": 184, "frontend_question_id": "面试题 17.09", "is_new_question": false }, @@ -4044,9 +4044,9 @@ "question__title": "Circus Tower LCCI", "question__title_slug": "circus-tower-lcci", "question__hide": false, - "total_acs": 10353, - "total_submitted": 37236, - "total_column_articles": 142, + "total_acs": 10467, + "total_submitted": 37618, + "total_column_articles": 143, "frontend_question_id": "面试题 17.08", "is_new_question": false }, @@ -4065,9 +4065,9 @@ "question__title": "Baby Names LCCI", "question__title_slug": "baby-names-lcci", "question__hide": false, - "total_acs": 10561, - "total_submitted": 25645, - "total_column_articles": 244, + "total_acs": 10720, + "total_submitted": 25994, + "total_column_articles": 247, "frontend_question_id": "面试题 17.07", "is_new_question": false }, @@ -4086,9 +4086,9 @@ "question__title": "Number Of 2s In Range LCCI", "question__title_slug": "number-of-2s-in-range-lcci", "question__hide": false, - "total_acs": 6177, - "total_submitted": 13361, - "total_column_articles": 133, + "total_acs": 6224, + "total_submitted": 13466, + "total_column_articles": 134, "frontend_question_id": "面试题 17.06", "is_new_question": false }, @@ -4107,9 +4107,9 @@ "question__title": "Find Longest Subarray LCCI", "question__title_slug": "find-longest-subarray-lcci", "question__hide": false, - "total_acs": 7642, - "total_submitted": 19210, - "total_column_articles": 116, + "total_acs": 7746, + "total_submitted": 19407, + "total_column_articles": 119, "frontend_question_id": "面试题 17.05", "is_new_question": false }, @@ -4128,9 +4128,9 @@ "question__title": "Missing Number LCCI", "question__title_slug": "missing-number-lcci", "question__hide": false, - "total_acs": 37861, - "total_submitted": 60563, - "total_column_articles": 578, + "total_acs": 38219, + "total_submitted": 61201, + "total_column_articles": 580, "frontend_question_id": "面试题 17.04", "is_new_question": false }, @@ -4149,8 +4149,8 @@ "question__title": "Boolean Evaluation LCCI", "question__title_slug": "boolean-evaluation-lcci", "question__hide": false, - "total_acs": 6017, - "total_submitted": 11332, + "total_acs": 6102, + "total_submitted": 11482, "total_column_articles": 91, "frontend_question_id": "面试题 08.14", "is_new_question": false @@ -4170,9 +4170,9 @@ "question__title": "Word Transformer LCCI", "question__title_slug": "word-transformer-lcci", "question__hide": false, - "total_acs": 11652, - "total_submitted": 29868, - "total_column_articles": 182, + "total_acs": 11767, + "total_submitted": 30139, + "total_column_articles": 183, "frontend_question_id": "面试题 17.22", "is_new_question": false }, @@ -4191,8 +4191,8 @@ "question__title": "Volume of Histogram LCCI", "question__title_slug": "volume-of-histogram-lcci", "question__hide": false, - "total_acs": 47649, - "total_submitted": 74846, + "total_acs": 47818, + "total_submitted": 75107, "total_column_articles": 566, "frontend_question_id": "面试题 17.21", "is_new_question": false @@ -4212,8 +4212,8 @@ "question__title": "Continuous Median LCCI", "question__title_slug": "continuous-median-lcci", "question__hide": false, - "total_acs": 5438, - "total_submitted": 9467, + "total_acs": 5501, + "total_submitted": 9558, "total_column_articles": 93, "frontend_question_id": "面试题 17.20", "is_new_question": false @@ -4233,9 +4233,9 @@ "question__title": "Calculator LCCI", "question__title_slug": "calculator-lcci", "question__hide": false, - "total_acs": 19322, - "total_submitted": 49016, - "total_column_articles": 261, + "total_acs": 19507, + "total_submitted": 49459, + "total_column_articles": 264, "frontend_question_id": "面试题 16.26", "is_new_question": false }, @@ -4254,8 +4254,8 @@ "question__title": "LRU Cache LCCI", "question__title_slug": "lru-cache-lcci", "question__hide": false, - "total_acs": 40360, - "total_submitted": 73503, + "total_acs": 40584, + "total_submitted": 73883, "total_column_articles": 322, "frontend_question_id": "面试题 16.25", "is_new_question": false @@ -4275,9 +4275,9 @@ "question__title": "Add Without Plus LCCI", "question__title_slug": "add-without-plus-lcci", "question__hide": false, - "total_acs": 17192, - "total_submitted": 28389, - "total_column_articles": 206, + "total_acs": 17359, + "total_submitted": 28645, + "total_column_articles": 210, "frontend_question_id": "面试题 17.01", "is_new_question": false }, @@ -4296,8 +4296,8 @@ "question__title": "Multi Search LCCI", "question__title_slug": "multi-search-lcci", "question__hide": false, - "total_acs": 10679, - "total_submitted": 23709, + "total_acs": 10786, + "total_submitted": 23927, "total_column_articles": 222, "frontend_question_id": "面试题 17.17", "is_new_question": false @@ -4317,9 +4317,9 @@ "question__title": "The Masseuse LCCI", "question__title_slug": "the-masseuse-lcci", "question__hide": false, - "total_acs": 69018, - "total_submitted": 134308, - "total_column_articles": 1232, + "total_acs": 69402, + "total_submitted": 135071, + "total_column_articles": 1234, "frontend_question_id": "面试题 17.16", "is_new_question": false }, @@ -4338,9 +4338,9 @@ "question__title": "Longest Word LCCI", "question__title_slug": "longest-word-lcci", "question__hide": false, - "total_acs": 8642, - "total_submitted": 21222, - "total_column_articles": 157, + "total_acs": 8828, + "total_submitted": 21701, + "total_column_articles": 159, "frontend_question_id": "面试题 17.15", "is_new_question": false }, @@ -4359,9 +4359,9 @@ "question__title": "Smallest K LCCI", "question__title_slug": "smallest-k-lcci", "question__hide": false, - "total_acs": 91446, - "total_submitted": 153860, - "total_column_articles": 840, + "total_acs": 91882, + "total_submitted": 154796, + "total_column_articles": 843, "frontend_question_id": "面试题 17.14", "is_new_question": false }, @@ -4380,9 +4380,9 @@ "question__title": "Re-Space LCCI", "question__title_slug": "re-space-lcci", "question__hide": false, - "total_acs": 26752, - "total_submitted": 48313, - "total_column_articles": 291, + "total_acs": 26831, + "total_submitted": 48491, + "total_column_articles": 293, "frontend_question_id": "面试题 17.13", "is_new_question": false }, @@ -4401,9 +4401,9 @@ "question__title": "BiNode LCCI", "question__title_slug": "binode-lcci", "question__hide": false, - "total_acs": 26304, - "total_submitted": 41323, - "total_column_articles": 344, + "total_acs": 26533, + "total_submitted": 41661, + "total_column_articles": 348, "frontend_question_id": "面试题 17.12", "is_new_question": false }, @@ -4422,8 +4422,8 @@ "question__title": "English Int LCCI", "question__title_slug": "english-int-lcci", "question__hide": false, - "total_acs": 3109, - "total_submitted": 8100, + "total_acs": 3131, + "total_submitted": 8174, "total_column_articles": 71, "frontend_question_id": "面试题 16.08", "is_new_question": false @@ -4443,8 +4443,8 @@ "question__title": "Factorial Zeros LCCI", "question__title_slug": "factorial-zeros-lcci", "question__hide": false, - "total_acs": 14087, - "total_submitted": 30908, + "total_acs": 14195, + "total_submitted": 31140, "total_column_articles": 150, "frontend_question_id": "面试题 16.05", "is_new_question": false @@ -4464,8 +4464,8 @@ "question__title": "Sorted Matrix Search LCCI", "question__title_slug": "sorted-matrix-search-lcci", "question__hide": false, - "total_acs": 16678, - "total_submitted": 36789, + "total_acs": 16836, + "total_submitted": 37164, "total_column_articles": 204, "frontend_question_id": "面试题 10.09", "is_new_question": false @@ -4485,8 +4485,8 @@ "question__title": "Hanota LCCI", "question__title_slug": "hanota-lcci", "question__hide": false, - "total_acs": 33312, - "total_submitted": 51069, + "total_acs": 33714, + "total_submitted": 51705, "total_column_articles": 344, "frontend_question_id": "面试题 08.06", "is_new_question": false @@ -4506,9 +4506,9 @@ "question__title": "Peaks and Valleys LCCI", "question__title_slug": "peaks-and-valleys-lcci", "question__hide": false, - "total_acs": 10930, - "total_submitted": 16596, - "total_column_articles": 139, + "total_acs": 11084, + "total_submitted": 16819, + "total_column_articles": 143, "frontend_question_id": "面试题 10.11", "is_new_question": false }, @@ -4527,9 +4527,9 @@ "question__title": "Sorted Merge LCCI", "question__title_slug": "sorted-merge-lcci", "question__hide": false, - "total_acs": 67466, - "total_submitted": 120467, - "total_column_articles": 2467, + "total_acs": 67856, + "total_submitted": 121115, + "total_column_articles": 2482, "frontend_question_id": "面试题 10.01", "is_new_question": false }, @@ -4548,9 +4548,9 @@ "question__title": "Robot in a Grid LCCI", "question__title_slug": "robot-in-a-grid-lcci", "question__hide": false, - "total_acs": 17170, - "total_submitted": 47460, - "total_column_articles": 260, + "total_acs": 17368, + "total_submitted": 48005, + "total_column_articles": 262, "frontend_question_id": "面试题 08.02", "is_new_question": false }, @@ -4569,8 +4569,8 @@ "question__title": "BST Sequences LCCI", "question__title_slug": "bst-sequences-lcci", "question__hide": false, - "total_acs": 9012, - "total_submitted": 18642, + "total_acs": 9091, + "total_submitted": 18797, "total_column_articles": 136, "frontend_question_id": "面试题 04.09", "is_new_question": false @@ -4590,8 +4590,8 @@ "question__title": "Paths with Sum LCCI", "question__title_slug": "paths-with-sum-lcci", "question__hide": false, - "total_acs": 23725, - "total_submitted": 48687, + "total_acs": 23962, + "total_submitted": 49152, "total_column_articles": 312, "frontend_question_id": "面试题 04.12", "is_new_question": false @@ -4611,9 +4611,9 @@ "question__title": "Partition List LCCI", "question__title_slug": "partition-list-lcci", "question__hide": false, - "total_acs": 34739, - "total_submitted": 54670, - "total_column_articles": 474, + "total_acs": 35059, + "total_submitted": 55211, + "total_column_articles": 480, "frontend_question_id": "面试题 02.04", "is_new_question": false }, @@ -4632,9 +4632,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": 78592, - "total_submitted": 100572, - "total_column_articles": 1091, + "total_acs": 79034, + "total_submitted": 101138, + "total_column_articles": 1093, "frontend_question_id": "面试题 02.02", "is_new_question": false }, @@ -4653,9 +4653,9 @@ "question__title": "One Away LCCI", "question__title_slug": "one-away-lcci", "question__hide": false, - "total_acs": 76373, - "total_submitted": 214097, - "total_column_articles": 1223, + "total_acs": 76822, + "total_submitted": 215369, + "total_column_articles": 1225, "frontend_question_id": "面试题 01.05", "is_new_question": false }, @@ -4674,8 +4674,8 @@ "question__title": "Pond Sizes LCCI", "question__title_slug": "pond-sizes-lcci", "question__hide": false, - "total_acs": 24018, - "total_submitted": 38603, + "total_acs": 24160, + "total_submitted": 38825, "total_column_articles": 434, "frontend_question_id": "面试题 16.19", "is_new_question": false @@ -4695,8 +4695,8 @@ "question__title": "Pattern Matching LCCI", "question__title_slug": "pattern-matching-lcci", "question__hide": false, - "total_acs": 16473, - "total_submitted": 48334, + "total_acs": 16515, + "total_submitted": 48456, "total_column_articles": 332, "frontend_question_id": "面试题 16.18", "is_new_question": false @@ -4716,9 +4716,9 @@ "question__title": "Contiguous Sequence LCCI", "question__title_slug": "contiguous-sequence-lcci", "question__hide": false, - "total_acs": 41535, - "total_submitted": 69872, - "total_column_articles": 442, + "total_acs": 41817, + "total_submitted": 70336, + "total_column_articles": 443, "frontend_question_id": "面试题 16.17", "is_new_question": false }, @@ -4737,9 +4737,9 @@ "question__title": "Sub Sort LCCI", "question__title_slug": "sub-sort-lcci", "question__hide": false, - "total_acs": 20241, - "total_submitted": 43764, - "total_column_articles": 279, + "total_acs": 20460, + "total_submitted": 44218, + "total_column_articles": 284, "frontend_question_id": "面试题 16.16", "is_new_question": false }, @@ -4758,9 +4758,9 @@ "question__title": "Master Mind LCCI", "question__title_slug": "master-mind-lcci", "question__hide": false, - "total_acs": 12485, - "total_submitted": 25626, - "total_column_articles": 294, + "total_acs": 12597, + "total_submitted": 25906, + "total_column_articles": 295, "frontend_question_id": "面试题 16.15", "is_new_question": false }, @@ -4779,8 +4779,8 @@ "question__title": "Best Line LCCI", "question__title_slug": "best-line-lcci", "question__hide": false, - "total_acs": 4786, - "total_submitted": 8497, + "total_acs": 4833, + "total_submitted": 8579, "total_column_articles": 75, "frontend_question_id": "面试题 16.14", "is_new_question": false @@ -4800,8 +4800,8 @@ "question__title": "Bisect Squares LCCI", "question__title_slug": "bisect-squares-lcci", "question__hide": false, - "total_acs": 2725, - "total_submitted": 6225, + "total_acs": 2761, + "total_submitted": 6297, "total_column_articles": 69, "frontend_question_id": "面试题 16.13", "is_new_question": false @@ -4821,8 +4821,8 @@ "question__title": "Diving Board LCCI", "question__title_slug": "diving-board-lcci", "question__hide": false, - "total_acs": 55297, - "total_submitted": 125548, + "total_acs": 55437, + "total_submitted": 125894, "total_column_articles": 629, "frontend_question_id": "面试题 16.11", "is_new_question": false @@ -4842,8 +4842,8 @@ "question__title": "Living People LCCI", "question__title_slug": "living-people-lcci", "question__hide": false, - "total_acs": 13479, - "total_submitted": 19799, + "total_acs": 13603, + "total_submitted": 19967, "total_column_articles": 235, "frontend_question_id": "面试题 16.10", "is_new_question": false @@ -4863,9 +4863,9 @@ "question__title": "Operations LCCI", "question__title_slug": "operations-lcci", "question__hide": false, - "total_acs": 2984, - "total_submitted": 5398, - "total_column_articles": 47, + "total_acs": 3015, + "total_submitted": 5454, + "total_column_articles": 49, "frontend_question_id": "面试题 16.09", "is_new_question": false }, @@ -4884,9 +4884,9 @@ "question__title": "Maximum LCCI", "question__title_slug": "maximum-lcci", "question__hide": false, - "total_acs": 25546, - "total_submitted": 34831, - "total_column_articles": 344, + "total_acs": 25739, + "total_submitted": 35076, + "total_column_articles": 346, "frontend_question_id": "面试题 16.07", "is_new_question": false }, @@ -4905,9 +4905,9 @@ "question__title": "Permutation II LCCI", "question__title_slug": "permutation-ii-lcci", "question__hide": false, - "total_acs": 22076, - "total_submitted": 31048, - "total_column_articles": 303, + "total_acs": 22456, + "total_submitted": 31617, + "total_column_articles": 305, "frontend_question_id": "面试题 08.08", "is_new_question": false }, @@ -4926,9 +4926,9 @@ "question__title": "二叉树的最近公共祖先 LCOF", "question__title_slug": "er-cha-shu-de-zui-jin-gong-gong-zu-xian-lcof", "question__hide": false, - "total_acs": 169355, - "total_submitted": 240494, - "total_column_articles": 933, + "total_acs": 171328, + "total_submitted": 243304, + "total_column_articles": 937, "frontend_question_id": "剑指 Offer 68 - II", "is_new_question": false }, @@ -4947,9 +4947,9 @@ "question__title": "二叉搜索树的最近公共祖先 LCOF", "question__title_slug": "er-cha-sou-suo-shu-de-zui-jin-gong-gong-zu-xian-lcof", "question__hide": false, - "total_acs": 174612, - "total_submitted": 251268, - "total_column_articles": 930, + "total_acs": 176787, + "total_submitted": 254437, + "total_column_articles": 934, "frontend_question_id": "剑指 Offer 68 - I", "is_new_question": false }, @@ -4968,9 +4968,9 @@ "question__title": "求1+2+…+n LCOF", "question__title_slug": "qiu-12n-lcof", "question__hide": false, - "total_acs": 191393, - "total_submitted": 222741, - "total_column_articles": 1569, + "total_acs": 193463, + "total_submitted": 225128, + "total_column_articles": 1590, "frontend_question_id": "剑指 Offer 64", "is_new_question": false }, @@ -4989,9 +4989,9 @@ "question__title": "股票的最大利润 LCOF", "question__title_slug": "gu-piao-de-zui-da-li-run-lcof", "question__hide": false, - "total_acs": 206662, - "total_submitted": 325215, - "total_column_articles": 1333, + "total_acs": 209621, + "total_submitted": 329998, + "total_column_articles": 1350, "frontend_question_id": "剑指 Offer 63", "is_new_question": false }, @@ -5010,9 +5010,9 @@ "question__title": "圆圈中最后剩下的数字 LCOF", "question__title_slug": "yuan-quan-zhong-zui-hou-sheng-xia-de-shu-zi-lcof", "question__hide": false, - "total_acs": 153461, - "total_submitted": 232836, - "total_column_articles": 936, + "total_acs": 155130, + "total_submitted": 235309, + "total_column_articles": 938, "frontend_question_id": "剑指 Offer 62", "is_new_question": false }, @@ -5031,9 +5031,9 @@ "question__title": "平衡二叉树 LCOF", "question__title_slug": "ping-heng-er-cha-shu-lcof", "question__hide": false, - "total_acs": 198712, - "total_submitted": 333706, - "total_column_articles": 1242, + "total_acs": 201096, + "total_submitted": 337448, + "total_column_articles": 1249, "frontend_question_id": "剑指 Offer 55 - II", "is_new_question": false }, @@ -5052,9 +5052,9 @@ "question__title": "扑克牌中的顺子 LCOF", "question__title_slug": "bu-ke-pai-zhong-de-shun-zi-lcof", "question__hide": false, - "total_acs": 162878, - "total_submitted": 353582, - "total_column_articles": 1379, + "total_acs": 165330, + "total_submitted": 358806, + "total_column_articles": 1386, "frontend_question_id": "剑指 Offer 61", "is_new_question": false }, @@ -5073,9 +5073,9 @@ "question__title": "把字符串转换成整数 LCOF", "question__title_slug": "ba-zi-fu-chuan-zhuan-huan-cheng-zheng-shu-lcof", "question__hide": false, - "total_acs": 102222, - "total_submitted": 351069, - "total_column_articles": 791, + "total_acs": 103582, + "total_submitted": 355667, + "total_column_articles": 797, "frontend_question_id": "剑指 Offer 67", "is_new_question": false }, @@ -5094,9 +5094,9 @@ "question__title": "n个骰子的点数 LCOF", "question__title_slug": "nge-tou-zi-de-dian-shu-lcof", "question__hide": false, - "total_acs": 95688, - "total_submitted": 166810, - "total_column_articles": 797, + "total_acs": 97018, + "total_submitted": 169047, + "total_column_articles": 804, "frontend_question_id": "剑指 Offer 60", "is_new_question": false }, @@ -5115,9 +5115,9 @@ "question__title": "构建乘积数组 LCOF", "question__title_slug": "gou-jian-cheng-ji-shu-zu-lcof", "question__hide": false, - "total_acs": 112125, - "total_submitted": 187663, - "total_column_articles": 776, + "total_acs": 113725, + "total_submitted": 190439, + "total_column_articles": 785, "frontend_question_id": "剑指 Offer 66", "is_new_question": false }, @@ -5136,9 +5136,9 @@ "question__title": "队列的最大值 LCOF", "question__title_slug": "dui-lie-de-zui-da-zhi-lcof", "question__hide": false, - "total_acs": 132098, - "total_submitted": 275994, - "total_column_articles": 1249, + "total_acs": 133646, + "total_submitted": 279109, + "total_column_articles": 1255, "frontend_question_id": "剑指 Offer 59 - II", "is_new_question": false }, @@ -5157,9 +5157,9 @@ "question__title": "滑动窗口的最大值 LCOF", "question__title_slug": "hua-dong-chuang-kou-de-zui-da-zhi-lcof", "question__hide": false, - "total_acs": 179962, - "total_submitted": 402565, - "total_column_articles": 1493, + "total_acs": 182030, + "total_submitted": 407058, + "total_column_articles": 1515, "frontend_question_id": "剑指 Offer 59 - I", "is_new_question": false }, @@ -5178,9 +5178,9 @@ "question__title": "不用加减乘除做加法 LCOF", "question__title_slug": "bu-yong-jia-jian-cheng-chu-zuo-jia-fa-lcof", "question__hide": false, - "total_acs": 110202, - "total_submitted": 185627, - "total_column_articles": 690, + "total_acs": 111560, + "total_submitted": 187923, + "total_column_articles": 691, "frontend_question_id": "剑指 Offer 65", "is_new_question": false }, @@ -5199,9 +5199,9 @@ "question__title": "丑数 LCOF", "question__title_slug": "chou-shu-lcof", "question__hide": false, - "total_acs": 127515, - "total_submitted": 195283, - "total_column_articles": 702, + "total_acs": 129159, + "total_submitted": 197703, + "total_column_articles": 709, "frontend_question_id": "剑指 Offer 49", "is_new_question": false }, @@ -5220,9 +5220,9 @@ "question__title": "二叉搜索树的第k大节点 LCOF", "question__title_slug": "er-cha-sou-suo-shu-de-di-kda-jie-dian-lcof", "question__hide": false, - "total_acs": 239370, - "total_submitted": 313512, - "total_column_articles": 1554, + "total_acs": 242328, + "total_submitted": 317180, + "total_column_articles": 1577, "frontend_question_id": "剑指 Offer 54", "is_new_question": false }, @@ -5241,9 +5241,9 @@ "question__title": "最长不含重复字符的子字符串 LCOF", "question__title_slug": "zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 232759, - "total_submitted": 501869, - "total_column_articles": 1471, + "total_acs": 236021, + "total_submitted": 508838, + "total_column_articles": 1493, "frontend_question_id": "剑指 Offer 48", "is_new_question": false }, @@ -5262,9 +5262,9 @@ "question__title": "缺失的数字 LCOF", "question__title_slug": "que-shi-de-shu-zi-lcof", "question__hide": false, - "total_acs": 266428, - "total_submitted": 595695, - "total_column_articles": 2113, + "total_acs": 269933, + "total_submitted": 603335, + "total_column_articles": 2138, "frontend_question_id": "剑指 Offer 53 - II", "is_new_question": false }, @@ -5283,9 +5283,9 @@ "question__title": "左旋转字符串 LCOF", "question__title_slug": "zuo-xuan-zhuan-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 337516, - "total_submitted": 391894, - "total_column_articles": 2525, + "total_acs": 342721, + "total_submitted": 397844, + "total_column_articles": 2551, "frontend_question_id": "剑指 Offer 58 - II", "is_new_question": false }, @@ -5304,9 +5304,9 @@ "question__title": "在排序数组中查找数字 LCOF", "question__title_slug": "zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof", "question__hide": false, - "total_acs": 295547, - "total_submitted": 556190, - "total_column_articles": 2198, + "total_acs": 299295, + "total_submitted": 563501, + "total_column_articles": 2219, "frontend_question_id": "剑指 Offer 53 - I", "is_new_question": false }, @@ -5325,9 +5325,9 @@ "question__title": "翻转单词顺序 LCOF", "question__title_slug": "fan-zhuan-dan-ci-shun-xu-lcof", "question__hide": false, - "total_acs": 196453, - "total_submitted": 441052, - "total_column_articles": 1340, + "total_acs": 199082, + "total_submitted": 446787, + "total_column_articles": 1346, "frontend_question_id": "剑指 Offer 58 - I", "is_new_question": false }, @@ -5346,9 +5346,9 @@ "question__title": "礼物的最大价值 LCOF", "question__title_slug": "li-wu-de-zui-da-jie-zhi-lcof", "question__hide": false, - "total_acs": 187638, - "total_submitted": 271495, - "total_column_articles": 1409, + "total_acs": 190426, + "total_submitted": 275453, + "total_column_articles": 1418, "frontend_question_id": "剑指 Offer 47", "is_new_question": false }, @@ -5367,9 +5367,9 @@ "question__title": "两个链表的第一个公共节点 LCOF", "question__title_slug": "liang-ge-lian-biao-de-di-yi-ge-gong-gong-jie-dian-lcof", "question__hide": false, - "total_acs": 246671, - "total_submitted": 376041, - "total_column_articles": 1322, + "total_acs": 249620, + "total_submitted": 380467, + "total_column_articles": 1334, "frontend_question_id": "剑指 Offer 52", "is_new_question": false }, @@ -5388,9 +5388,9 @@ "question__title": "把数字翻译成字符串 LCOF", "question__title_slug": "ba-shu-zi-fan-yi-cheng-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 189721, - "total_submitted": 363074, - "total_column_articles": 1946, + "total_acs": 192561, + "total_submitted": 368635, + "total_column_articles": 1968, "frontend_question_id": "剑指 Offer 46", "is_new_question": false }, @@ -5409,9 +5409,9 @@ "question__title": "和为s的连续正数序列 LCOF", "question__title_slug": "he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof", "question__hide": false, - "total_acs": 192612, - "total_submitted": 270762, - "total_column_articles": 2198, + "total_acs": 194733, + "total_submitted": 273659, + "total_column_articles": 2216, "frontend_question_id": "剑指 Offer 57 - II", "is_new_question": false }, @@ -5430,9 +5430,9 @@ "question__title": "把数组排成最小的数 LCOF", "question__title_slug": "ba-shu-zu-pai-cheng-zui-xiao-de-shu-lcof", "question__hide": false, - "total_acs": 172126, - "total_submitted": 309293, - "total_column_articles": 1188, + "total_acs": 174638, + "total_submitted": 313827, + "total_column_articles": 1197, "frontend_question_id": "剑指 Offer 45", "is_new_question": false }, @@ -5451,9 +5451,9 @@ "question__title": "和为s的两个数字 LCOF", "question__title_slug": "he-wei-sde-liang-ge-shu-zi-lcof", "question__hide": false, - "total_acs": 204091, - "total_submitted": 300821, - "total_column_articles": 1173, + "total_acs": 206864, + "total_submitted": 304791, + "total_column_articles": 1179, "frontend_question_id": "剑指 Offer 57", "is_new_question": false }, @@ -5472,9 +5472,9 @@ "question__title": "数组中数字出现的次数 II LCOF", "question__title_slug": "shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-ii-lcof", "question__hide": false, - "total_acs": 132068, - "total_submitted": 163858, - "total_column_articles": 904, + "total_acs": 133735, + "total_submitted": 165874, + "total_column_articles": 914, "frontend_question_id": "剑指 Offer 56 - II", "is_new_question": false }, @@ -5493,9 +5493,9 @@ "question__title": "数组中数字出现的次数 LCOF", "question__title_slug": "shu-zu-zhong-shu-zi-chu-xian-de-ci-shu-lcof", "question__hide": false, - "total_acs": 161310, - "total_submitted": 232752, - "total_column_articles": 1317, + "total_acs": 163153, + "total_submitted": 235465, + "total_column_articles": 1321, "frontend_question_id": "剑指 Offer 56 - I", "is_new_question": false }, @@ -5514,9 +5514,9 @@ "question__title": "二叉树的深度 LCOF", "question__title_slug": "er-cha-shu-de-shen-du-lcof", "question__hide": false, - "total_acs": 245875, - "total_submitted": 310332, - "total_column_articles": 1577, + "total_acs": 248464, + "total_submitted": 313566, + "total_column_articles": 1591, "frontend_question_id": "剑指 Offer 55 - I", "is_new_question": false }, @@ -5535,9 +5535,9 @@ "question__title": "数组中的逆序对 LCOF", "question__title_slug": "shu-zu-zhong-de-ni-xu-dui-lcof", "question__hide": false, - "total_acs": 150503, - "total_submitted": 305366, - "total_column_articles": 1189, + "total_acs": 152659, + "total_submitted": 309307, + "total_column_articles": 1202, "frontend_question_id": "剑指 Offer 51", "is_new_question": false }, @@ -5556,9 +5556,9 @@ "question__title": "二叉树中和为某一值的路径 LCOF", "question__title_slug": "er-cha-shu-zhong-he-wei-mou-yi-zhi-de-lu-jing-lcof", "question__hide": false, - "total_acs": 202108, - "total_submitted": 344419, - "total_column_articles": 1222, + "total_acs": 204974, + "total_submitted": 348983, + "total_column_articles": 1232, "frontend_question_id": "剑指 Offer 34", "is_new_question": false }, @@ -5577,9 +5577,9 @@ "question__title": "第一个只出现一次的字符 LCOF", "question__title_slug": "di-yi-ge-zhi-chu-xian-yi-ci-de-zi-fu-lcof", "question__hide": false, - "total_acs": 245342, - "total_submitted": 394337, - "total_column_articles": 1521, + "total_acs": 248796, + "total_submitted": 399922, + "total_column_articles": 1546, "frontend_question_id": "剑指 Offer 50", "is_new_question": false }, @@ -5598,9 +5598,9 @@ "question__title": "二叉搜索树的后序遍历序列 LCOF", "question__title_slug": "er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof", "question__hide": false, - "total_acs": 170005, - "total_submitted": 302478, - "total_column_articles": 1347, + "total_acs": 172321, + "total_submitted": 306318, + "total_column_articles": 1359, "frontend_question_id": "剑指 Offer 33", "is_new_question": false }, @@ -5619,9 +5619,9 @@ "question__title": "从上到下打印二叉树 III LCOF", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-iii-lcof", "question__hide": false, - "total_acs": 194171, - "total_submitted": 330863, - "total_column_articles": 1708, + "total_acs": 196965, + "total_submitted": 335812, + "total_column_articles": 1735, "frontend_question_id": "剑指 Offer 32 - III", "is_new_question": false }, @@ -5640,9 +5640,9 @@ "question__title": "数字序列中某一位的数字 LCOF", "question__title_slug": "shu-zi-xu-lie-zhong-mou-yi-wei-de-shu-zi-lcof", "question__hide": false, - "total_acs": 81763, - "total_submitted": 191514, - "total_column_articles": 641, + "total_acs": 82833, + "total_submitted": 194042, + "total_column_articles": 649, "frontend_question_id": "剑指 Offer 44", "is_new_question": false }, @@ -5661,9 +5661,9 @@ "question__title": "从上到下打印二叉树 II LCOF", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-ii-lcof", "question__hide": false, - "total_acs": 212651, - "total_submitted": 308512, - "total_column_articles": 1560, + "total_acs": 215469, + "total_submitted": 312491, + "total_column_articles": 1586, "frontend_question_id": "剑指 Offer 32 - II", "is_new_question": false }, @@ -5682,9 +5682,9 @@ "question__title": "从上到下打印二叉树 LCOF", "question__title_slug": "cong-shang-dao-xia-da-yin-er-cha-shu-lcof", "question__hide": false, - "total_acs": 213662, - "total_submitted": 334887, - "total_column_articles": 1404, + "total_acs": 216631, + "total_submitted": 339622, + "total_column_articles": 1420, "frontend_question_id": "剑指 Offer 32 - I", "is_new_question": false }, @@ -5703,9 +5703,9 @@ "question__title": "数组中出现次数超过一半的数字 LCOF", "question__title_slug": "shu-zu-zhong-chu-xian-ci-shu-chao-guo-yi-ban-de-shu-zi-lcof", "question__hide": false, - "total_acs": 238723, - "total_submitted": 340896, - "total_column_articles": 1307, + "total_acs": 241390, + "total_submitted": 344575, + "total_column_articles": 1314, "frontend_question_id": "剑指 Offer 39", "is_new_question": false }, @@ -5724,8 +5724,8 @@ "question__title": "1~n整数中1出现的次数 LCOF", "question__title_slug": "1nzheng-shu-zhong-1chu-xian-de-ci-shu-lcof", "question__hide": false, - "total_acs": 69716, - "total_submitted": 139154, + "total_acs": 70521, + "total_submitted": 140659, "total_column_articles": 654, "frontend_question_id": "剑指 Offer 43", "is_new_question": false @@ -5745,9 +5745,9 @@ "question__title": "字符串的排列 LCOF", "question__title_slug": "zi-fu-chuan-de-pai-lie-lcof", "question__hide": false, - "total_acs": 216948, - "total_submitted": 374721, - "total_column_articles": 1393, + "total_acs": 219528, + "total_submitted": 379075, + "total_column_articles": 1402, "frontend_question_id": "剑指 Offer 38", "is_new_question": false }, @@ -5766,9 +5766,9 @@ "question__title": "序列化二叉树 LCOF", "question__title_slug": "xu-lie-hua-er-cha-shu-lcof", "question__hide": false, - "total_acs": 107862, - "total_submitted": 188858, - "total_column_articles": 716, + "total_acs": 109117, + "total_submitted": 190902, + "total_column_articles": 720, "frontend_question_id": "剑指 Offer 37", "is_new_question": false }, @@ -5787,9 +5787,9 @@ "question__title": "栈的压入、弹出序列 LCOF", "question__title_slug": "zhan-de-ya-ru-dan-chu-xu-lie-lcof", "question__hide": false, - "total_acs": 166366, - "total_submitted": 268775, - "total_column_articles": 1296, + "total_acs": 167640, + "total_submitted": 275984, + "total_column_articles": 1303, "frontend_question_id": "剑指 Offer 31", "is_new_question": false }, @@ -5808,9 +5808,9 @@ "question__title": "二叉搜索树与双向链表 LCOF", "question__title_slug": "er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof", "question__hide": false, - "total_acs": 162488, - "total_submitted": 248857, - "total_column_articles": 1324, + "total_acs": 164791, + "total_submitted": 252353, + "total_column_articles": 1335, "frontend_question_id": "剑指 Offer 36", "is_new_question": false }, @@ -5829,9 +5829,9 @@ "question__title": "连续子数组的最大和 LCOF", "question__title_slug": "lian-xu-zi-shu-zu-de-zui-da-he-lcof", "question__hide": false, - "total_acs": 315626, - "total_submitted": 519611, - "total_column_articles": 1930, + "total_acs": 319367, + "total_submitted": 525608, + "total_column_articles": 1954, "frontend_question_id": "剑指 Offer 42", "is_new_question": false }, @@ -5850,9 +5850,9 @@ "question__title": "数据流中的中位数 LCOF", "question__title_slug": "shu-ju-liu-zhong-de-zhong-wei-shu-lcof", "question__hide": false, - "total_acs": 101561, - "total_submitted": 173653, - "total_column_articles": 705, + "total_acs": 102996, + "total_submitted": 176109, + "total_column_articles": 706, "frontend_question_id": "剑指 Offer 41", "is_new_question": false }, @@ -5871,9 +5871,9 @@ "question__title": "包含min函数的栈 LCOF", "question__title_slug": "bao-han-minhan-shu-de-zhan-lcof", "question__hide": false, - "total_acs": 257931, - "total_submitted": 466105, - "total_column_articles": 1615, + "total_acs": 261510, + "total_submitted": 472404, + "total_column_articles": 1636, "frontend_question_id": "剑指 Offer 30", "is_new_question": false }, @@ -5892,10 +5892,10 @@ "question__title": "最小的k个数 LCOF", "question__title_slug": "zui-xiao-de-kge-shu-lcof", "question__hide": false, - "total_acs": 351200, - "total_submitted": 612237, - "total_column_articles": 2238, - "frontend_question_id": "剑指 Offer 40", + "total_acs": 354947, + "total_submitted": 618520, + "total_column_articles": 2257, + "frontend_question_id": "面试题40", "is_new_question": false }, "status": null, @@ -5913,9 +5913,9 @@ "question__title": "复杂链表的复制 LCOF", "question__title_slug": "fu-za-lian-biao-de-fu-zhi-lcof", "question__hide": false, - "total_acs": 210235, - "total_submitted": 293563, - "total_column_articles": 1390, + "total_acs": 213276, + "total_submitted": 297788, + "total_column_articles": 1401, "frontend_question_id": "剑指 Offer 35", "is_new_question": false }, @@ -5934,9 +5934,9 @@ "question__title": "删除链表的节点 LCOF", "question__title_slug": "shan-chu-lian-biao-de-jie-dian-lcof", "question__hide": false, - "total_acs": 274052, - "total_submitted": 455583, - "total_column_articles": 1908, + "total_acs": 277417, + "total_submitted": 461019, + "total_column_articles": 1930, "frontend_question_id": "剑指 Offer 18", "is_new_question": false }, @@ -5955,9 +5955,9 @@ "question__title": "反转链表 LCOF", "question__title_slug": "fan-zhuan-lian-biao-lcof", "question__hide": false, - "total_acs": 436403, - "total_submitted": 586857, - "total_column_articles": 2430, + "total_acs": 441341, + "total_submitted": 593501, + "total_column_articles": 2459, "frontend_question_id": "剑指 Offer 24", "is_new_question": false }, @@ -5976,9 +5976,9 @@ "question__title": "正则表达式匹配 LCOF", "question__title_slug": "zheng-ze-biao-da-shi-pi-pei-lcof", "question__hide": false, - "total_acs": 92965, - "total_submitted": 239614, - "total_column_articles": 573, + "total_acs": 94192, + "total_submitted": 242668, + "total_column_articles": 578, "frontend_question_id": "剑指 Offer 19", "is_new_question": false }, @@ -5997,9 +5997,9 @@ "question__title": "打印从1到最大的n位数 LCOF", "question__title_slug": "da-yin-cong-1dao-zui-da-de-nwei-shu-lcof", "question__hide": false, - "total_acs": 204746, - "total_submitted": 262916, - "total_column_articles": 1358, + "total_acs": 207025, + "total_submitted": 265823, + "total_column_articles": 1360, "frontend_question_id": "剑指 Offer 17", "is_new_question": false }, @@ -6018,9 +6018,9 @@ "question__title": "数值的整数次方 LCOF", "question__title_slug": "shu-zhi-de-zheng-shu-ci-fang-lcof", "question__hide": false, - "total_acs": 180497, - "total_submitted": 521582, - "total_column_articles": 1037, + "total_acs": 182858, + "total_submitted": 528127, + "total_column_articles": 1047, "frontend_question_id": "剑指 Offer 16", "is_new_question": false }, @@ -6039,9 +6039,9 @@ "question__title": "链表中倒数第k个节点 LCOF", "question__title_slug": "lian-biao-zhong-dao-shu-di-kge-jie-dian-lcof", "question__hide": false, - "total_acs": 363228, - "total_submitted": 452743, - "total_column_articles": 3048, + "total_acs": 367317, + "total_submitted": 457812, + "total_column_articles": 3080, "frontend_question_id": "剑指 Offer 22", "is_new_question": false }, @@ -6060,9 +6060,9 @@ "question__title": "顺时针打印矩阵 LCOF", "question__title_slug": "shun-shi-zhen-da-yin-ju-zhen-lcof", "question__hide": false, - "total_acs": 201856, - "total_submitted": 462004, - "total_column_articles": 1839, + "total_acs": 204164, + "total_submitted": 467511, + "total_column_articles": 1859, "frontend_question_id": "剑指 Offer 29", "is_new_question": false }, @@ -6081,9 +6081,9 @@ "question__title": "二进制中1的个数 LCOF", "question__title_slug": "er-jin-zhi-zhong-1de-ge-shu-lcof", "question__hide": false, - "total_acs": 267110, - "total_submitted": 355207, - "total_column_articles": 1539, + "total_acs": 269782, + "total_submitted": 358678, + "total_column_articles": 1558, "frontend_question_id": "剑指 Offer 15", "is_new_question": false }, @@ -6102,9 +6102,9 @@ "question__title": "调整数组顺序使奇数位于偶数前面 LCOF", "question__title_slug": "diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof", "question__hide": false, - "total_acs": 287514, - "total_submitted": 443868, - "total_column_articles": 2171, + "total_acs": 291277, + "total_submitted": 449417, + "total_column_articles": 2195, "frontend_question_id": "剑指 Offer 21", "is_new_question": false }, @@ -6123,9 +6123,9 @@ "question__title": "表示数值的字符串 LCOF", "question__title_slug": "biao-shi-shu-zhi-de-zi-fu-chuan-lcof", "question__hide": false, - "total_acs": 109028, - "total_submitted": 432397, - "total_column_articles": 1193, + "total_acs": 110334, + "total_submitted": 437148, + "total_column_articles": 1203, "frontend_question_id": "剑指 Offer 20", "is_new_question": false }, @@ -6144,9 +6144,9 @@ "question__title": "对称的二叉树 LCOF", "question__title_slug": "dui-cheng-de-er-cha-shu-lcof", "question__hide": false, - "total_acs": 227161, - "total_submitted": 393792, - "total_column_articles": 1540, + "total_acs": 230066, + "total_submitted": 398937, + "total_column_articles": 1560, "frontend_question_id": "剑指 Offer 28", "is_new_question": false }, @@ -6165,9 +6165,9 @@ "question__title": "二叉树的镜像 LCOF", "question__title_slug": "er-cha-shu-de-jing-xiang-lcof", "question__hide": false, - "total_acs": 281909, - "total_submitted": 354593, - "total_column_articles": 1879, + "total_acs": 285329, + "total_submitted": 358840, + "total_column_articles": 1899, "frontend_question_id": "剑指 Offer 27", "is_new_question": false }, @@ -6186,9 +6186,9 @@ "question__title": "树的子结构 LCOF", "question__title_slug": "shu-de-zi-jie-gou-lcof", "question__hide": false, - "total_acs": 231821, - "total_submitted": 495969, - "total_column_articles": 1717, + "total_acs": 235104, + "total_submitted": 503013, + "total_column_articles": 1749, "frontend_question_id": "剑指 Offer 26", "is_new_question": false }, @@ -6207,9 +6207,9 @@ "question__title": "合并两个排序的链表 LCOF", "question__title_slug": "he-bing-liang-ge-pai-xu-de-lian-biao-lcof", "question__hide": false, - "total_acs": 272931, - "total_submitted": 375424, - "total_column_articles": 1582, + "total_acs": 276248, + "total_submitted": 380056, + "total_column_articles": 1604, "frontend_question_id": "剑指 Offer 25", "is_new_question": false }, @@ -6228,9 +6228,9 @@ "question__title": "剪绳子 II LCOF", "question__title_slug": "jian-sheng-zi-ii-lcof", "question__hide": false, - "total_acs": 117009, - "total_submitted": 368785, - "total_column_articles": 639, + "total_acs": 118501, + "total_submitted": 373192, + "total_column_articles": 650, "frontend_question_id": "剑指 Offer 14- II", "is_new_question": false }, @@ -6249,9 +6249,9 @@ "question__title": "剪绳子 LCOF", "question__title_slug": "jian-sheng-zi-lcof", "question__hide": false, - "total_acs": 222643, - "total_submitted": 388214, - "total_column_articles": 1725, + "total_acs": 225428, + "total_submitted": 392812, + "total_column_articles": 1741, "frontend_question_id": "剑指 Offer 14- I", "is_new_question": false }, @@ -6270,9 +6270,9 @@ "question__title": "重建二叉树 LCOF", "question__title_slug": "zhong-jian-er-cha-shu-lcof", "question__hide": false, - "total_acs": 263514, - "total_submitted": 374723, - "total_column_articles": 1827, + "total_acs": 266581, + "total_submitted": 378891, + "total_column_articles": 1840, "frontend_question_id": "剑指 Offer 07", "is_new_question": false }, @@ -6291,9 +6291,9 @@ "question__title": "从尾到头打印链表 LCOF", "question__title_slug": "cong-wei-dao-tou-da-yin-lian-biao-lcof", "question__hide": false, - "total_acs": 467548, - "total_submitted": 623865, - "total_column_articles": 2930, + "total_acs": 473921, + "total_submitted": 632457, + "total_column_articles": 2965, "frontend_question_id": "剑指 Offer 06", "is_new_question": false }, @@ -6312,9 +6312,9 @@ "question__title": "机器人的运动范围 LCOF", "question__title_slug": "ji-qi-ren-de-yun-dong-fan-wei-lcof", "question__hide": false, - "total_acs": 259825, - "total_submitted": 486575, - "total_column_articles": 2220, + "total_acs": 263276, + "total_submitted": 492825, + "total_column_articles": 2242, "frontend_question_id": "剑指 Offer 13", "is_new_question": false }, @@ -6333,9 +6333,9 @@ "question__title": "替换空格 LCOF", "question__title_slug": "ti-huan-kong-ge-lcof", "question__hide": false, - "total_acs": 467129, - "total_submitted": 615876, - "total_column_articles": 2756, + "total_acs": 474825, + "total_submitted": 626200, + "total_column_articles": 2791, "frontend_question_id": "剑指 Offer 05", "is_new_question": false }, @@ -6354,9 +6354,9 @@ "question__title": "矩阵中的路径 LCOF", "question__title_slug": "ju-zhen-zhong-de-lu-jing-lcof", "question__hide": false, - "total_acs": 255037, - "total_submitted": 563801, - "total_column_articles": 1547, + "total_acs": 258522, + "total_submitted": 571908, + "total_column_articles": 1567, "frontend_question_id": "剑指 Offer 12", "is_new_question": false }, @@ -6375,9 +6375,9 @@ "question__title": "旋转数组的最小数字 LCOF", "question__title_slug": "xuan-zhuan-shu-zu-de-zui-xiao-shu-zi-lcof", "question__hide": false, - "total_acs": 383397, - "total_submitted": 779097, - "total_column_articles": 2195, + "total_acs": 388158, + "total_submitted": 788672, + "total_column_articles": 2220, "frontend_question_id": "剑指 Offer 11", "is_new_question": false }, @@ -6396,9 +6396,9 @@ "question__title": "青蛙跳台阶问题 LCOF", "question__title_slug": "qing-wa-tiao-tai-jie-wen-ti-lcof", "question__hide": false, - "total_acs": 290671, - "total_submitted": 638243, - "total_column_articles": 1730, + "total_acs": 294417, + "total_submitted": 646006, + "total_column_articles": 1756, "frontend_question_id": "剑指 Offer 10- II", "is_new_question": false }, @@ -6417,9 +6417,9 @@ "question__title": "二维数组中的查找 LCOF", "question__title_slug": "er-wei-shu-zu-zhong-de-cha-zhao-lcof", "question__hide": false, - "total_acs": 388845, - "total_submitted": 970045, - "total_column_articles": 2871, + "total_acs": 394159, + "total_submitted": 983634, + "total_column_articles": 2902, "frontend_question_id": "剑指 Offer 04", "is_new_question": false }, @@ -6438,9 +6438,9 @@ "question__title": "数组中重复的数字 LCOF", "question__title_slug": "shu-zu-zhong-zhong-fu-de-shu-zi-lcof", "question__hide": false, - "total_acs": 579031, - "total_submitted": 852296, - "total_column_articles": 3626, + "total_acs": 586481, + "total_submitted": 863281, + "total_column_articles": 3661, "frontend_question_id": "剑指 Offer 03", "is_new_question": false }, @@ -6459,9 +6459,9 @@ "question__title": "斐波那契数列 LCOF", "question__title_slug": "fei-bo-na-qi-shu-lie-lcof", "question__hide": false, - "total_acs": 382180, - "total_submitted": 1056444, - "total_column_articles": 2377, + "total_acs": 386721, + "total_submitted": 1069012, + "total_column_articles": 2398, "frontend_question_id": "剑指 Offer 10- I", "is_new_question": false }, @@ -6480,9 +6480,9 @@ "question__title": "用两个栈实现队列 LCOF", "question__title_slug": "yong-liang-ge-zhan-shi-xian-dui-lie-lcof", "question__hide": false, - "total_acs": 430160, - "total_submitted": 607685, - "total_column_articles": 2440, + "total_acs": 435781, + "total_submitted": 615648, + "total_column_articles": 2465, "frontend_question_id": "剑指 Offer 09", "is_new_question": false }, @@ -6501,8 +6501,8 @@ "question__title": "Smallest Difference LCCI", "question__title_slug": "smallest-difference-lcci", "question__hide": false, - "total_acs": 17504, - "total_submitted": 40791, + "total_acs": 17638, + "total_submitted": 41104, "total_column_articles": 243, "frontend_question_id": "面试题 16.06", "is_new_question": false @@ -6522,9 +6522,9 @@ "question__title": "Tic-Tac-Toe LCCI", "question__title_slug": "tic-tac-toe-lcci", "question__hide": false, - "total_acs": 9608, - "total_submitted": 20696, - "total_column_articles": 187, + "total_acs": 9685, + "total_submitted": 20852, + "total_column_articles": 189, "frontend_question_id": "面试题 16.04", "is_new_question": false }, @@ -6543,8 +6543,8 @@ "question__title": "Intersection LCCI", "question__title_slug": "intersection-lcci", "question__hide": false, - "total_acs": 10365, - "total_submitted": 23593, + "total_acs": 10385, + "total_submitted": 23644, "total_column_articles": 246, "frontend_question_id": "面试题 16.03", "is_new_question": false @@ -6564,9 +6564,9 @@ "question__title": "Words Frequency LCCI", "question__title_slug": "words-frequency-lcci", "question__hide": false, - "total_acs": 19471, - "total_submitted": 25350, - "total_column_articles": 245, + "total_acs": 19697, + "total_submitted": 25687, + "total_column_articles": 247, "frontend_question_id": "面试题 16.02", "is_new_question": false }, @@ -6585,9 +6585,9 @@ "question__title": "Swap Numbers LCCI", "question__title_slug": "swap-numbers-lcci", "question__hide": false, - "total_acs": 31337, - "total_submitted": 37948, - "total_column_articles": 479, + "total_acs": 31561, + "total_submitted": 38217, + "total_column_articles": 483, "frontend_question_id": "面试题 16.01", "is_new_question": false }, @@ -6606,8 +6606,8 @@ "question__title": "Sparse Array Search LCCI", "question__title_slug": "sparse-array-search-lcci", "question__hide": false, - "total_acs": 25027, - "total_submitted": 44377, + "total_acs": 25246, + "total_submitted": 44725, "total_column_articles": 309, "frontend_question_id": "面试题 10.05", "is_new_question": false @@ -6627,9 +6627,9 @@ "question__title": "Permutation I LCCI", "question__title_slug": "permutation-i-lcci", "question__hide": false, - "total_acs": 26975, - "total_submitted": 33111, - "total_column_articles": 392, + "total_acs": 27248, + "total_submitted": 33476, + "total_column_articles": 397, "frontend_question_id": "面试题 08.07", "is_new_question": false }, @@ -6648,8 +6648,8 @@ "question__title": "Magic Index LCCI", "question__title_slug": "magic-index-lcci", "question__hide": false, - "total_acs": 57267, - "total_submitted": 84893, + "total_acs": 57445, + "total_submitted": 85170, "total_column_articles": 460, "frontend_question_id": "面试题 08.03", "is_new_question": false @@ -6669,9 +6669,9 @@ "question__title": "Eight Queens LCCI", "question__title_slug": "eight-queens-lcci", "question__hide": false, - "total_acs": 23480, - "total_submitted": 30577, - "total_column_articles": 364, + "total_acs": 23741, + "total_submitted": 30885, + "total_column_articles": 367, "frontend_question_id": "面试题 08.12", "is_new_question": false }, @@ -6690,9 +6690,9 @@ "question__title": "Search Rotate Array LCCI", "question__title_slug": "search-rotate-array-lcci", "question__hide": false, - "total_acs": 19642, - "total_submitted": 50318, - "total_column_articles": 260, + "total_acs": 19937, + "total_submitted": 51063, + "total_column_articles": 261, "frontend_question_id": "面试题 10.03", "is_new_question": false }, @@ -6711,9 +6711,9 @@ "question__title": "Coin LCCI", "question__title_slug": "coin-lcci", "question__hide": false, - "total_acs": 38615, - "total_submitted": 77890, - "total_column_articles": 354, + "total_acs": 38810, + "total_submitted": 78243, + "total_column_articles": 356, "frontend_question_id": "面试题 08.11", "is_new_question": false }, @@ -6732,9 +6732,9 @@ "question__title": "Reverse Bits LCCI", "question__title_slug": "reverse-bits-lcci", "question__hide": false, - "total_acs": 16213, - "total_submitted": 42340, - "total_column_articles": 296, + "total_acs": 16412, + "total_submitted": 42812, + "total_column_articles": 297, "frontend_question_id": "面试题 05.03", "is_new_question": false }, @@ -6753,9 +6753,9 @@ "question__title": "Check SubTree LCCI", "question__title_slug": "check-subtree-lcci", "question__hide": false, - "total_acs": 22028, - "total_submitted": 30731, - "total_column_articles": 332, + "total_acs": 22266, + "total_submitted": 31054, + "total_column_articles": 334, "frontend_question_id": "面试题 04.10", "is_new_question": false }, @@ -6774,9 +6774,9 @@ "question__title": "Animal Shelter LCCI", "question__title_slug": "animal-shelter-lcci", "question__hide": false, - "total_acs": 15130, - "total_submitted": 25806, - "total_column_articles": 227, + "total_acs": 15273, + "total_submitted": 26044, + "total_column_articles": 226, "frontend_question_id": "面试题 03.06", "is_new_question": false }, @@ -6795,9 +6795,9 @@ "question__title": "Binary Number to String LCCI", "question__title_slug": "bianry-number-to-string-lcci", "question__hide": false, - "total_acs": 10580, - "total_submitted": 14913, - "total_column_articles": 169, + "total_acs": 10709, + "total_submitted": 15080, + "total_column_articles": 171, "frontend_question_id": "面试题 05.02", "is_new_question": false }, @@ -6816,8 +6816,8 @@ "question__title": "Pile Box LCCI", "question__title_slug": "pile-box-lcci", "question__hide": false, - "total_acs": 9424, - "total_submitted": 18546, + "total_acs": 9505, + "total_submitted": 18700, "total_column_articles": 112, "frontend_question_id": "面试题 08.13", "is_new_question": false @@ -6837,9 +6837,9 @@ "question__title": "Color Fill LCCI", "question__title_slug": "color-fill-lcci", "question__hide": false, - "total_acs": 18366, - "total_submitted": 32845, - "total_column_articles": 285, + "total_acs": 18509, + "total_submitted": 33114, + "total_column_articles": 287, "frontend_question_id": "面试题 08.10", "is_new_question": false }, @@ -6858,8 +6858,8 @@ "question__title": "Bracket LCCI", "question__title_slug": "bracket-lcci", "question__hide": false, - "total_acs": 27594, - "total_submitted": 33817, + "total_acs": 27829, + "total_submitted": 34105, "total_column_articles": 442, "frontend_question_id": "面试题 08.09", "is_new_question": false @@ -6879,9 +6879,9 @@ "question__title": "Recursive Mulitply LCCI", "question__title_slug": "recursive-mulitply-lcci", "question__hide": false, - "total_acs": 32109, - "total_submitted": 47809, - "total_column_articles": 626, + "total_acs": 32482, + "total_submitted": 48358, + "total_column_articles": 628, "frontend_question_id": "面试题 08.05", "is_new_question": false }, @@ -6900,8 +6900,8 @@ "question__title": "Power Set LCCI", "question__title_slug": "power-set-lcci", "question__hide": false, - "total_acs": 26200, - "total_submitted": 31916, + "total_acs": 26369, + "total_submitted": 32114, "total_column_articles": 396, "frontend_question_id": "面试题 08.04", "is_new_question": false @@ -6921,9 +6921,9 @@ "question__title": "Three Steps Problem LCCI", "question__title_slug": "three-steps-problem-lcci", "question__hide": false, - "total_acs": 52878, - "total_submitted": 144325, - "total_column_articles": 570, + "total_acs": 53222, + "total_submitted": 145246, + "total_column_articles": 572, "frontend_question_id": "面试题 08.01", "is_new_question": false }, @@ -6942,9 +6942,9 @@ "question__title": "Draw Line LCCI", "question__title_slug": "draw-line-lcci", "question__hide": false, - "total_acs": 5111, - "total_submitted": 9331, - "total_column_articles": 99, + "total_acs": 5164, + "total_submitted": 9433, + "total_column_articles": 100, "frontend_question_id": "面试题 05.08", "is_new_question": false }, @@ -6963,8 +6963,8 @@ "question__title": "Stack of Plates LCCI", "question__title_slug": "stack-of-plates-lcci", "question__hide": false, - "total_acs": 12349, - "total_submitted": 31906, + "total_acs": 12526, + "total_submitted": 32344, "total_column_articles": 187, "frontend_question_id": "面试题 03.03", "is_new_question": false @@ -6984,9 +6984,9 @@ "question__title": "Sum Lists LCCI", "question__title_slug": "sum-lists-lcci", "question__hide": false, - "total_acs": 50734, - "total_submitted": 108165, - "total_column_articles": 662, + "total_acs": 51233, + "total_submitted": 109194, + "total_column_articles": 665, "frontend_question_id": "面试题 02.05", "is_new_question": false }, @@ -7005,9 +7005,9 @@ "question__title": "Delete Middle Node LCCI", "question__title_slug": "delete-middle-node-lcci", "question__hide": false, - "total_acs": 82978, - "total_submitted": 96617, - "total_column_articles": 775, + "total_acs": 83346, + "total_submitted": 97023, + "total_column_articles": 774, "frontend_question_id": "面试题 02.03", "is_new_question": false }, @@ -7026,9 +7026,9 @@ "question__title": "Zero Matrix LCCI", "question__title_slug": "zero-matrix-lcci", "question__hide": false, - "total_acs": 63744, - "total_submitted": 102680, - "total_column_articles": 615, + "total_acs": 64462, + "total_submitted": 103811, + "total_column_articles": 620, "frontend_question_id": "面试题 01.08", "is_new_question": false }, @@ -7047,9 +7047,9 @@ "question__title": "Rotate Matrix LCCI", "question__title_slug": "rotate-matrix-lcci", "question__hide": false, - "total_acs": 86868, - "total_submitted": 117192, - "total_column_articles": 1103, + "total_acs": 87626, + "total_submitted": 118241, + "total_column_articles": 1104, "frontend_question_id": "面试题 01.07", "is_new_question": false }, @@ -7068,9 +7068,9 @@ "question__title": "Palindrome Permutation LCCI", "question__title_slug": "palindrome-permutation-lcci", "question__hide": false, - "total_acs": 55065, - "total_submitted": 101307, - "total_column_articles": 959, + "total_acs": 55460, + "total_submitted": 102003, + "total_column_articles": 963, "frontend_question_id": "面试题 01.04", "is_new_question": false }, @@ -7089,9 +7089,9 @@ "question__title": "Closed Number LCCI", "question__title_slug": "closed-number-lcci", "question__hide": false, - "total_acs": 7135, - "total_submitted": 19539, - "total_column_articles": 169, + "total_acs": 7204, + "total_submitted": 19709, + "total_column_articles": 172, "frontend_question_id": "面试题 05.04", "is_new_question": false }, @@ -7110,9 +7110,9 @@ "question__title": "Exchange LCCI", "question__title_slug": "exchange-lcci", "question__hide": false, - "total_acs": 14999, - "total_submitted": 21117, - "total_column_articles": 264, + "total_acs": 15112, + "total_submitted": 21262, + "total_column_articles": 265, "frontend_question_id": "面试题 05.07", "is_new_question": false }, @@ -7131,9 +7131,9 @@ "question__title": "Convert Integer LCCI", "question__title_slug": "convert-integer-lcci", "question__hide": false, - "total_acs": 15991, - "total_submitted": 30505, - "total_column_articles": 285, + "total_acs": 16121, + "total_submitted": 30722, + "total_column_articles": 286, "frontend_question_id": "面试题 05.06", "is_new_question": false }, @@ -7152,9 +7152,9 @@ "question__title": "Insert Into Bits LCCI", "question__title_slug": "insert-into-bits-lcci", "question__hide": false, - "total_acs": 13272, - "total_submitted": 25937, - "total_column_articles": 255, + "total_acs": 13422, + "total_submitted": 26224, + "total_column_articles": 258, "frontend_question_id": "面试题 05.01", "is_new_question": false }, @@ -7173,9 +7173,9 @@ "question__title": "First Common Ancestor LCCI", "question__title_slug": "first-common-ancestor-lcci", "question__hide": false, - "total_acs": 22707, - "total_submitted": 31716, - "total_column_articles": 235, + "total_acs": 22934, + "total_submitted": 32016, + "total_column_articles": 237, "frontend_question_id": "面试题 04.08", "is_new_question": false }, @@ -7194,9 +7194,9 @@ "question__title": "Successor LCCI", "question__title_slug": "successor-lcci", "question__hide": false, - "total_acs": 58396, - "total_submitted": 93234, - "total_column_articles": 617, + "total_acs": 58757, + "total_submitted": 93789, + "total_column_articles": 619, "frontend_question_id": "面试题 04.06", "is_new_question": false }, @@ -7215,9 +7215,9 @@ "question__title": "Legal Binary Search Tree LCCI", "question__title_slug": "legal-binary-search-tree-lcci", "question__hide": false, - "total_acs": 32853, - "total_submitted": 92772, - "total_column_articles": 400, + "total_acs": 33194, + "total_submitted": 93737, + "total_column_articles": 401, "frontend_question_id": "面试题 04.05", "is_new_question": false }, @@ -7236,9 +7236,9 @@ "question__title": "Check Balance LCCI", "question__title_slug": "check-balance-lcci", "question__hide": false, - "total_acs": 39888, - "total_submitted": 67359, - "total_column_articles": 435, + "total_acs": 40125, + "total_submitted": 67734, + "total_column_articles": 436, "frontend_question_id": "面试题 04.04", "is_new_question": false }, @@ -7257,9 +7257,9 @@ "question__title": "List of Depth LCCI", "question__title_slug": "list-of-depth-lcci", "question__hide": false, - "total_acs": 29949, - "total_submitted": 37197, - "total_column_articles": 634, + "total_acs": 30186, + "total_submitted": 37531, + "total_column_articles": 638, "frontend_question_id": "面试题 04.03", "is_new_question": false }, @@ -7278,9 +7278,9 @@ "question__title": "Minimum Height Tree LCCI", "question__title_slug": "minimum-height-tree-lcci", "question__hide": false, - "total_acs": 42105, - "total_submitted": 53394, - "total_column_articles": 502, + "total_acs": 42347, + "total_submitted": 53701, + "total_column_articles": 506, "frontend_question_id": "面试题 04.02", "is_new_question": false }, @@ -7299,8 +7299,8 @@ "question__title": "Sort of Stacks LCCI", "question__title_slug": "sort-of-stacks-lcci", "question__hide": false, - "total_acs": 21298, - "total_submitted": 39481, + "total_acs": 21525, + "total_submitted": 39915, "total_column_articles": 278, "frontend_question_id": "面试题 03.05", "is_new_question": false @@ -7320,9 +7320,9 @@ "question__title": "Three in One LCCI", "question__title_slug": "three-in-one-lcci", "question__hide": false, - "total_acs": 16168, - "total_submitted": 30375, - "total_column_articles": 248, + "total_acs": 16364, + "total_submitted": 30731, + "total_column_articles": 247, "frontend_question_id": "面试题 03.01", "is_new_question": false }, @@ -7338,12 +7338,12 @@ { "stat": { "question_id": 100171, - "question__title": "Route Between Nodes LCCI", + "question__title": "Route Between Nodes LCCI ", "question__title_slug": "route-between-nodes-lcci", "question__hide": false, - "total_acs": 24401, - "total_submitted": 45468, - "total_column_articles": 330, + "total_acs": 24664, + "total_submitted": 46009, + "total_column_articles": 334, "frontend_question_id": "面试题 04.01", "is_new_question": false }, @@ -7362,9 +7362,9 @@ "question__title": "Implement Queue using Stacks LCCI", "question__title_slug": "implement-queue-using-stacks-lcci", "question__hide": false, - "total_acs": 29254, - "total_submitted": 40852, - "total_column_articles": 397, + "total_acs": 29440, + "total_submitted": 41105, + "total_column_articles": 396, "frontend_question_id": "面试题 03.04", "is_new_question": false }, @@ -7383,9 +7383,9 @@ "question__title": "Min Stack LCCI", "question__title_slug": "min-stack-lcci", "question__hide": false, - "total_acs": 32740, - "total_submitted": 53120, - "total_column_articles": 357, + "total_acs": 32966, + "total_submitted": 53460, + "total_column_articles": 359, "frontend_question_id": "面试题 03.02", "is_new_question": false }, @@ -7404,9 +7404,9 @@ "question__title": "Linked List Cycle LCCI", "question__title_slug": "linked-list-cycle-lcci", "question__hide": false, - "total_acs": 35750, - "total_submitted": 65788, - "total_column_articles": 352, + "total_acs": 36021, + "total_submitted": 66288, + "total_column_articles": 354, "frontend_question_id": "面试题 02.08", "is_new_question": false }, @@ -7425,9 +7425,9 @@ "question__title": "Intersection of Two Linked Lists LCCI", "question__title_slug": "intersection-of-two-linked-lists-lcci", "question__hide": false, - "total_acs": 99911, - "total_submitted": 148683, - "total_column_articles": 741, + "total_acs": 102268, + "total_submitted": 152346, + "total_column_articles": 747, "frontend_question_id": "面试题 02.07", "is_new_question": false }, @@ -7446,9 +7446,9 @@ "question__title": "Palindrome Linked List LCCI", "question__title_slug": "palindrome-linked-list-lcci", "question__hide": false, - "total_acs": 51390, - "total_submitted": 105651, - "total_column_articles": 603, + "total_acs": 51749, + "total_submitted": 106395, + "total_column_articles": 607, "frontend_question_id": "面试题 02.06", "is_new_question": false }, @@ -7467,9 +7467,9 @@ "question__title": "Remove Duplicate Node LCCI", "question__title_slug": "remove-duplicate-node-lcci", "question__hide": false, - "total_acs": 78133, - "total_submitted": 116013, - "total_column_articles": 794, + "total_acs": 78626, + "total_submitted": 116753, + "total_column_articles": 796, "frontend_question_id": "面试题 02.01", "is_new_question": false }, @@ -7488,9 +7488,9 @@ "question__title": "String Rotation LCCI", "question__title_slug": "string-rotation-lcci", "question__hide": false, - "total_acs": 44775, - "total_submitted": 81998, - "total_column_articles": 524, + "total_acs": 45082, + "total_submitted": 82583, + "total_column_articles": 525, "frontend_question_id": "面试题 01.09", "is_new_question": false }, @@ -7509,9 +7509,9 @@ "question__title": "Compress String LCCI", "question__title_slug": "compress-string-lcci", "question__hide": false, - "total_acs": 91420, - "total_submitted": 195515, - "total_column_articles": 1324, + "total_acs": 91956, + "total_submitted": 196603, + "total_column_articles": 1327, "frontend_question_id": "面试题 01.06", "is_new_question": false }, @@ -7530,9 +7530,9 @@ "question__title": "String to URL LCCI", "question__title_slug": "string-to-url-lcci", "question__hide": false, - "total_acs": 61306, - "total_submitted": 106374, - "total_column_articles": 617, + "total_acs": 61733, + "total_submitted": 107035, + "total_column_articles": 618, "frontend_question_id": "面试题 01.03", "is_new_question": false }, @@ -7551,9 +7551,9 @@ "question__title": "Check Permutation LCCI", "question__title_slug": "check-permutation-lcci", "question__hide": false, - "total_acs": 78648, - "total_submitted": 123348, - "total_column_articles": 1360, + "total_acs": 79161, + "total_submitted": 124136, + "total_column_articles": 1364, "frontend_question_id": "面试题 01.02", "is_new_question": false }, @@ -7572,9 +7572,9 @@ "question__title": "Is Unique LCCI", "question__title_slug": "is-unique-lcci", "question__hide": false, - "total_acs": 125139, - "total_submitted": 175461, - "total_column_articles": 1905, + "total_acs": 126011, + "total_submitted": 176674, + "total_column_articles": 1931, "frontend_question_id": "面试题 01.01", "is_new_question": false }, @@ -7593,9 +7593,9 @@ "question__title": "Guess Numbers", "question__title_slug": "guess-numbers", "question__hide": false, - "total_acs": 89541, - "total_submitted": 105943, - "total_column_articles": 706, + "total_acs": 89894, + "total_submitted": 106352, + "total_column_articles": 711, "frontend_question_id": "LCP 01", "is_new_question": false }, @@ -7614,9 +7614,9 @@ "question__title": "Programmable Robot", "question__title_slug": "programmable-robot", "question__hide": false, - "total_acs": 13272, - "total_submitted": 58502, - "total_column_articles": 204, + "total_acs": 13349, + "total_submitted": 58831, + "total_column_articles": 206, "frontend_question_id": "LCP 03", "is_new_question": false }, @@ -7635,8 +7635,8 @@ "question__title": "Coin Bonus", "question__title_slug": "coin-bonus", "question__hide": false, - "total_acs": 2518, - "total_submitted": 11775, + "total_acs": 2532, + "total_submitted": 11820, "total_column_articles": 60, "frontend_question_id": "LCP 05", "is_new_question": false @@ -7656,8 +7656,8 @@ "question__title": "Broken Board Dominoes", "question__title_slug": "broken-board-dominoes", "question__hide": false, - "total_acs": 3387, - "total_submitted": 8424, + "total_acs": 3421, + "total_submitted": 8504, "total_column_articles": 78, "frontend_question_id": "LCP 04", "is_new_question": false @@ -7677,9 +7677,9 @@ "question__title": "Deep Dark Fraction", "question__title_slug": "deep-dark-fraction", "question__hide": false, - "total_acs": 16447, - "total_submitted": 23614, - "total_column_articles": 288, + "total_acs": 16605, + "total_submitted": 23838, + "total_column_articles": 291, "frontend_question_id": "LCP 02", "is_new_question": false }, @@ -7692,17 +7692,38 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2446, + "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": 61, + "total_submitted": 82, + "total_column_articles": 3, + "frontend_question_id": "2314", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2441, "question__title": "Arrange Table by Gender", "question__title_slug": "arrange-table-by-gender", "question__hide": false, - "total_acs": 45, - "total_submitted": 54, - "total_column_articles": 2, + "total_acs": 97, + "total_submitted": 115, + "total_column_articles": 3, "frontend_question_id": "2308", - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -7719,11 +7740,11 @@ "question__title": "Tasks Count in the Weekend", "question__title_slug": "tasks-count-in-the-weekend", "question__hide": false, - "total_acs": 44, - "total_submitted": 46, - "total_column_articles": 2, + "total_acs": 95, + "total_submitted": 105, + "total_column_articles": 3, "frontend_question_id": "2298", - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -7740,9 +7761,9 @@ "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": 93, - "total_submitted": 212, - "total_column_articles": 4, + "total_acs": 140, + "total_submitted": 280, + "total_column_articles": 5, "frontend_question_id": "2292", "is_new_question": false }, @@ -7761,9 +7782,9 @@ "question__title": "Maximum Profit From Trading Stocks", "question__title_slug": "maximum-profit-from-trading-stocks", "question__hide": false, - "total_acs": 78, - "total_submitted": 107, - "total_column_articles": 4, + "total_acs": 90, + "total_submitted": 126, + "total_column_articles": 5, "frontend_question_id": "2291", "is_new_question": false }, @@ -7782,8 +7803,8 @@ "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": 43, - "total_submitted": 76, + "total_acs": 52, + "total_submitted": 97, "total_column_articles": 5, "frontend_question_id": "2282", "is_new_question": false @@ -7803,9 +7824,9 @@ "question__title": "Closest Node to Path in Tree", "question__title_slug": "closest-node-to-path-in-tree", "question__hide": false, - "total_acs": 65, - "total_submitted": 90, - "total_column_articles": 7, + "total_acs": 73, + "total_submitted": 100, + "total_column_articles": 8, "frontend_question_id": "2277", "is_new_question": false }, @@ -7824,8 +7845,8 @@ "question__title": "Minimum Number of Keypresses", "question__title_slug": "minimum-number-of-keypresses", "question__hide": false, - "total_acs": 84, - "total_submitted": 106, + "total_acs": 96, + "total_submitted": 122, "total_column_articles": 7, "frontend_question_id": "2268", "is_new_question": false @@ -7839,14 +7860,182 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2404, + "question__title": "Number of Distinct Roll Sequences", + "question__title_slug": "number-of-distinct-roll-sequences", + "question__hide": false, + "total_acs": 2191, + "total_submitted": 3952, + "total_column_articles": 55, + "frontend_question_id": "2318", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2403, + "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": 3558, + "total_submitted": 10049, + "total_column_articles": 74, + "frontend_question_id": "2316", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2402, + "question__title": "Maximum XOR After Operations ", + "question__title_slug": "maximum-xor-after-operations", + "question__hide": false, + "total_acs": 2848, + "total_submitted": 3446, + "total_column_articles": 43, + "frontend_question_id": "2317", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2401, + "question__title": "Count Asterisks", + "question__title_slug": "count-asterisks", + "question__hide": false, + "total_acs": 4289, + "total_submitted": 5069, + "total_column_articles": 58, + "frontend_question_id": "2315", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2400, + "question__title": "Minimum Score After Removals on a Tree", + "question__title_slug": "minimum-score-after-removals-on-a-tree", + "question__hide": false, + "total_acs": 2063, + "total_submitted": 3786, + "total_column_articles": 45, + "frontend_question_id": "2322", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2399, + "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": 21, + "total_submitted": 31, + "total_column_articles": 3, + "frontend_question_id": "2313", + "is_new_question": true + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2398, + "question__title": "Check if Matrix Is X-Matrix", + "question__title_slug": "check-if-matrix-is-x-matrix", + "question__hide": false, + "total_acs": 6930, + "total_submitted": 9390, + "total_column_articles": 48, + "frontend_question_id": "2319", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2397, + "question__title": "Count Number of Ways to Place Houses", + "question__title_slug": "count-number-of-ways-to-place-houses", + "question__hide": false, + "total_acs": 5929, + "total_submitted": 15684, + "total_column_articles": 72, + "frontend_question_id": "2320", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2396, "question__title": "Design Video Sharing Platform", "question__title_slug": "design-video-sharing-platform", "question__hide": false, - "total_acs": 49, - "total_submitted": 67, + "total_acs": 52, + "total_submitted": 78, "total_column_articles": 4, "frontend_question_id": "2254", "is_new_question": false @@ -7860,15 +8049,36 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2395, + "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": 5513, + "total_submitted": 15708, + "total_column_articles": 101, + "frontend_question_id": "2311", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2394, "question__title": "Count Subarrays With Score Less Than K", "question__title_slug": "count-subarrays-with-score-less-than-k", "question__hide": false, - "total_acs": 3353, - "total_submitted": 6835, - "total_column_articles": 62, + "total_acs": 3620, + "total_submitted": 7322, + "total_column_articles": 66, "frontend_question_id": "2302", "is_new_question": false }, @@ -7887,9 +8097,9 @@ "question__title": "Match Substring After Replacement", "question__title_slug": "match-substring-after-replacement", "question__hide": false, - "total_acs": 3130, - "total_submitted": 7057, - "total_column_articles": 57, + "total_acs": 3311, + "total_submitted": 7471, + "total_column_articles": 59, "frontend_question_id": "2301", "is_new_question": false }, @@ -7908,9 +8118,9 @@ "question__title": "Successful Pairs of Spells and Potions", "question__title_slug": "successful-pairs-of-spells-and-potions", "question__hide": false, - "total_acs": 4295, - "total_submitted": 11607, - "total_column_articles": 70, + "total_acs": 4637, + "total_submitted": 12459, + "total_column_articles": 73, "frontend_question_id": "2300", "is_new_question": false }, @@ -7929,9 +8139,9 @@ "question__title": "Strong Password Checker II", "question__title_slug": "strong-password-checker-ii", "question__hide": false, - "total_acs": 4380, - "total_submitted": 6999, - "total_column_articles": 49, + "total_acs": 4740, + "total_submitted": 7553, + "total_column_articles": 55, "frontend_question_id": "2299", "is_new_question": false }, @@ -7950,9 +8160,9 @@ "question__title": "Naming a Company", "question__title_slug": "naming-a-company", "question__hide": false, - "total_acs": 3194, - "total_submitted": 7716, - "total_column_articles": 59, + "total_acs": 3473, + "total_submitted": 8247, + "total_column_articles": 60, "frontend_question_id": "2306", "is_new_question": false }, @@ -7971,9 +8181,9 @@ "question__title": "Design a Text Editor", "question__title_slug": "design-a-text-editor", "question__hide": false, - "total_acs": 4996, - "total_submitted": 12066, - "total_column_articles": 102, + "total_acs": 5195, + "total_submitted": 12414, + "total_column_articles": 106, "frontend_question_id": "2296", "is_new_question": false }, @@ -7992,9 +8202,9 @@ "question__title": "Replace Elements in an Array", "question__title_slug": "replace-elements-in-an-array", "question__hide": false, - "total_acs": 6648, - "total_submitted": 11719, - "total_column_articles": 96, + "total_acs": 6827, + "total_submitted": 12014, + "total_column_articles": 101, "frontend_question_id": "2295", "is_new_question": false }, @@ -8013,9 +8223,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": 6551, - "total_submitted": 9670, - "total_column_articles": 92, + "total_acs": 6694, + "total_submitted": 9867, + "total_column_articles": 94, "frontend_question_id": "2294", "is_new_question": false }, @@ -8034,9 +8244,9 @@ "question__title": "Min Max Game", "question__title_slug": "min-max-game", "question__hide": false, - "total_acs": 7245, - "total_submitted": 10484, - "total_column_articles": 84, + "total_acs": 7471, + "total_submitted": 10814, + "total_column_articles": 88, "frontend_question_id": "2293", "is_new_question": false }, @@ -8055,8 +8265,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": 144, - "total_submitted": 187, + "total_acs": 151, + "total_submitted": 197, "total_column_articles": 10, "frontend_question_id": "2237", "is_new_question": false @@ -8076,9 +8286,9 @@ "question__title": "Root Equals Sum of Children", "question__title_slug": "root-equals-sum-of-children", "question__hide": false, - "total_acs": 3287, - "total_submitted": 3756, - "total_column_articles": 28, + "total_acs": 3687, + "total_submitted": 4228, + "total_column_articles": 33, "frontend_question_id": "2236", "is_new_question": false }, @@ -8097,9 +8307,9 @@ "question__title": "Add Two Integers", "question__title_slug": "add-two-integers", "question__hide": false, - "total_acs": 7598, - "total_submitted": 8616, - "total_column_articles": 49, + "total_acs": 8568, + "total_submitted": 9751, + "total_column_articles": 54, "frontend_question_id": "2235", "is_new_question": false }, @@ -8118,8 +8328,8 @@ "question__title": "Dynamic Unpivoting of a Table", "question__title_slug": "dynamic-unpivoting-of-a-table", "question__hide": false, - "total_acs": 73, - "total_submitted": 114, + "total_acs": 81, + "total_submitted": 127, "total_column_articles": 2, "frontend_question_id": "2253", "is_new_question": false @@ -8139,8 +8349,8 @@ "question__title": "Dynamic Pivoting of a Table", "question__title_slug": "dynamic-pivoting-of-a-table", "question__hide": false, - "total_acs": 64, - "total_submitted": 111, + "total_acs": 73, + "total_submitted": 125, "total_column_articles": 1, "frontend_question_id": "2252", "is_new_question": false @@ -8160,9 +8370,9 @@ "question__title": "Booking Concert Tickets in Groups", "question__title_slug": "booking-concert-tickets-in-groups", "question__hide": false, - "total_acs": 2050, - "total_submitted": 10135, - "total_column_articles": 38, + "total_acs": 2113, + "total_submitted": 10399, + "total_column_articles": 37, "frontend_question_id": "2286", "is_new_question": false }, @@ -8181,9 +8391,9 @@ "question__title": "Maximum Total Importance of Roads", "question__title_slug": "maximum-total-importance-of-roads", "question__hide": false, - "total_acs": 4310, - "total_submitted": 7577, - "total_column_articles": 62, + "total_acs": 4486, + "total_submitted": 7890, + "total_column_articles": 63, "frontend_question_id": "2285", "is_new_question": false }, @@ -8202,9 +8412,9 @@ "question__title": "Sender With Largest Word Count", "question__title_slug": "sender-with-largest-word-count", "question__hide": false, - "total_acs": 4565, - "total_submitted": 8031, - "total_column_articles": 59, + "total_acs": 4694, + "total_submitted": 8237, + "total_column_articles": 63, "frontend_question_id": "2284", "is_new_question": false }, @@ -8223,9 +8433,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": 5299, - "total_submitted": 6659, - "total_column_articles": 67, + "total_acs": 5561, + "total_submitted": 7024, + "total_column_articles": 72, "frontend_question_id": "2283", "is_new_question": false }, @@ -8244,8 +8454,8 @@ "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": 273, - "total_submitted": 383, + "total_acs": 295, + "total_submitted": 414, "total_column_articles": 7, "frontend_question_id": "2238", "is_new_question": false @@ -8265,9 +8475,9 @@ "question__title": "Minimum Obstacle Removal to Reach Corner", "question__title_slug": "minimum-obstacle-removal-to-reach-corner", "question__hide": false, - "total_acs": 4221, - "total_submitted": 7946, - "total_column_articles": 75, + "total_acs": 4367, + "total_submitted": 8163, + "total_column_articles": 78, "frontend_question_id": "2290", "is_new_question": false }, @@ -8286,9 +8496,9 @@ "question__title": "Steps to Make Array Non-decreasing", "question__title_slug": "steps-to-make-array-non-decreasing", "question__hide": false, - "total_acs": 3512, - "total_submitted": 18264, - "total_column_articles": 75, + "total_acs": 3692, + "total_submitted": 18796, + "total_column_articles": 77, "frontend_question_id": "2289", "is_new_question": false }, @@ -8307,9 +8517,9 @@ "question__title": "Apply Discount to Prices", "question__title_slug": "apply-discount-to-prices", "question__hide": false, - "total_acs": 6807, - "total_submitted": 22270, - "total_column_articles": 93, + "total_acs": 6902, + "total_submitted": 22557, + "total_column_articles": 94, "frontend_question_id": "2288", "is_new_question": false }, @@ -8328,9 +8538,9 @@ "question__title": "Rearrange Characters to Make Target String", "question__title_slug": "rearrange-characters-to-make-target-string", "question__hide": false, - "total_acs": 7861, - "total_submitted": 12976, - "total_column_articles": 97, + "total_acs": 8020, + "total_submitted": 13238, + "total_column_articles": 100, "frontend_question_id": "2287", "is_new_question": false }, @@ -8349,8 +8559,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": 287, - "total_submitted": 556, + "total_acs": 320, + "total_submitted": 624, "total_column_articles": 6, "frontend_question_id": "2230", "is_new_question": false @@ -8370,8 +8580,8 @@ "question__title": "Users With Two Purchases Within Seven Days", "question__title_slug": "users-with-two-purchases-within-seven-days", "question__hide": false, - "total_acs": 332, - "total_submitted": 649, + "total_acs": 358, + "total_submitted": 708, "total_column_articles": 8, "frontend_question_id": "2228", "is_new_question": false @@ -8391,9 +8601,9 @@ "question__title": "Maximum Sum Score of Array", "question__title_slug": "maximum-sum-score-of-array", "question__hide": false, - "total_acs": 118, - "total_submitted": 164, - "total_column_articles": 8, + "total_acs": 128, + "total_submitted": 179, + "total_column_articles": 9, "frontend_question_id": "2219", "is_new_question": false }, @@ -8412,9 +8622,9 @@ "question__title": "Sum of Total Strength of Wizards", "question__title_slug": "sum-of-total-strength-of-wizards", "question__hide": false, - "total_acs": 2641, - "total_submitted": 11140, - "total_column_articles": 51, + "total_acs": 2697, + "total_submitted": 11406, + "total_column_articles": 52, "frontend_question_id": "2281", "is_new_question": false }, @@ -8433,9 +8643,9 @@ "question__title": "Minimum Lines to Represent a Line Chart", "question__title_slug": "minimum-lines-to-represent-a-line-chart", "question__hide": false, - "total_acs": 7855, - "total_submitted": 37661, - "total_column_articles": 141, + "total_acs": 7956, + "total_submitted": 38015, + "total_column_articles": 143, "frontend_question_id": "2280", "is_new_question": false }, @@ -8454,9 +8664,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": 8427, - "total_submitted": 12645, - "total_column_articles": 81, + "total_acs": 8653, + "total_submitted": 12993, + "total_column_articles": 84, "frontend_question_id": "2279", "is_new_question": false }, @@ -8475,9 +8685,9 @@ "question__title": "Percentage of Letter in String", "question__title_slug": "percentage-of-letter-in-string", "question__hide": false, - "total_acs": 9336, - "total_submitted": 11484, - "total_column_articles": 78, + "total_acs": 9598, + "total_submitted": 11828, + "total_column_articles": 84, "frontend_question_id": "2278", "is_new_question": false }, @@ -8496,8 +8706,8 @@ "question__title": "Longest Path With Different Adjacent Characters", "question__title_slug": "longest-path-with-different-adjacent-characters", "question__hide": false, - "total_acs": 3508, - "total_submitted": 8120, + "total_acs": 3554, + "total_submitted": 8210, "total_column_articles": 53, "frontend_question_id": "2246", "is_new_question": false @@ -8517,8 +8727,8 @@ "question__title": "Maximum Trailing Zeros in a Cornered Path", "question__title_slug": "maximum-trailing-zeros-in-a-cornered-path", "question__hide": false, - "total_acs": 3975, - "total_submitted": 11617, + "total_acs": 3998, + "total_submitted": 11666, "total_column_articles": 91, "frontend_question_id": "2245", "is_new_question": false @@ -8538,8 +8748,8 @@ "question__title": "Minimum Rounds to Complete All Tasks", "question__title_slug": "minimum-rounds-to-complete-all-tasks", "question__hide": false, - "total_acs": 8684, - "total_submitted": 15698, + "total_acs": 8765, + "total_submitted": 15835, "total_column_articles": 135, "frontend_question_id": "2244", "is_new_question": false @@ -8559,9 +8769,9 @@ "question__title": "Calculate Digit Sum of a String", "question__title_slug": "calculate-digit-sum-of-a-string", "question__hide": false, - "total_acs": 9252, - "total_submitted": 14609, - "total_column_articles": 104, + "total_acs": 9358, + "total_submitted": 14765, + "total_column_articles": 110, "frontend_question_id": "2243", "is_new_question": false }, @@ -8580,8 +8790,8 @@ "question__title": "Substring With Largest Variance", "question__title_slug": "substring-with-largest-variance", "question__hide": false, - "total_acs": 2372, - "total_submitted": 6684, + "total_acs": 2471, + "total_submitted": 6914, "total_column_articles": 35, "frontend_question_id": "2272", "is_new_question": false @@ -8601,9 +8811,9 @@ "question__title": "Maximum White Tiles Covered by a Carpet", "question__title_slug": "maximum-white-tiles-covered-by-a-carpet", "question__hide": false, - "total_acs": 4374, - "total_submitted": 14311, - "total_column_articles": 83, + "total_acs": 4486, + "total_submitted": 14621, + "total_column_articles": 84, "frontend_question_id": "2271", "is_new_question": false }, @@ -8622,9 +8832,9 @@ "question__title": "Number of Ways to Split Array", "question__title_slug": "number-of-ways-to-split-array", "question__hide": false, - "total_acs": 5191, - "total_submitted": 11219, - "total_column_articles": 66, + "total_acs": 5300, + "total_submitted": 11450, + "total_column_articles": 64, "frontend_question_id": "2270", "is_new_question": false }, @@ -8643,9 +8853,9 @@ "question__title": "Count Integers in Intervals", "question__title_slug": "count-integers-in-intervals", "question__hide": false, - "total_acs": 4816, - "total_submitted": 14239, - "total_column_articles": 89, + "total_acs": 4942, + "total_submitted": 14479, + "total_column_articles": 92, "frontend_question_id": "2276", "is_new_question": false }, @@ -8664,8 +8874,8 @@ "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": 6742, - "total_submitted": 11726, + "total_acs": 6819, + "total_submitted": 11833, "total_column_articles": 91, "frontend_question_id": "2275", "is_new_question": false @@ -8685,9 +8895,9 @@ "question__title": "Maximum Consecutive Floors Without Special Floors", "question__title_slug": "maximum-consecutive-floors-without-special-floors", "question__hide": false, - "total_acs": 8227, - "total_submitted": 15465, - "total_column_articles": 97, + "total_acs": 8323, + "total_submitted": 15679, + "total_column_articles": 99, "frontend_question_id": "2274", "is_new_question": false }, @@ -8706,8 +8916,8 @@ "question__title": "Minimum Health to Beat Game", "question__title_slug": "minimum-health-to-beat-game", "question__hide": false, - "total_acs": 120, - "total_submitted": 221, + "total_acs": 133, + "total_submitted": 244, "total_column_articles": 6, "frontend_question_id": "2214", "is_new_question": false @@ -8727,8 +8937,8 @@ "question__title": "Maximum Score of a Node Sequence", "question__title_slug": "maximum-score-of-a-node-sequence", "question__hide": false, - "total_acs": 2343, - "total_submitted": 7680, + "total_acs": 2368, + "total_submitted": 7739, "total_column_articles": 37, "frontend_question_id": "2242", "is_new_question": false @@ -8748,9 +8958,9 @@ "question__title": "Design an ATM Machine", "question__title_slug": "design-an-atm-machine", "question__hide": false, - "total_acs": 4629, - "total_submitted": 13247, - "total_column_articles": 60, + "total_acs": 4798, + "total_submitted": 13732, + "total_column_articles": 62, "frontend_question_id": "2241", "is_new_question": false }, @@ -8769,9 +8979,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": 5114, - "total_submitted": 8925, - "total_column_articles": 59, + "total_acs": 5205, + "total_submitted": 9066, + "total_column_articles": 60, "frontend_question_id": "2240", "is_new_question": false }, @@ -8790,9 +9000,9 @@ "question__title": "Find Closest Number to Zero", "question__title_slug": "find-closest-number-to-zero", "question__hide": false, - "total_acs": 6677, - "total_submitted": 12016, - "total_column_articles": 67, + "total_acs": 6830, + "total_submitted": 12321, + "total_column_articles": 73, "frontend_question_id": "2239", "is_new_question": false }, @@ -8811,8 +9021,8 @@ "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": 6643, - "total_submitted": 18186, + "total_acs": 6721, + "total_submitted": 18340, "total_column_articles": 117, "frontend_question_id": "2267", "is_new_question": false @@ -8832,9 +9042,9 @@ "question__title": "Count Number of Texts", "question__title_slug": "count-number-of-texts", "question__hide": false, - "total_acs": 6481, - "total_submitted": 15147, - "total_column_articles": 126, + "total_acs": 6564, + "total_submitted": 15334, + "total_column_articles": 125, "frontend_question_id": "2266", "is_new_question": false }, @@ -8853,9 +9063,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": 8330, - "total_submitted": 9978, - "total_column_articles": 142, + "total_acs": 8478, + "total_submitted": 10165, + "total_column_articles": 146, "frontend_question_id": "2265", "is_new_question": false }, @@ -8874,9 +9084,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": 9807, - "total_submitted": 15737, - "total_column_articles": 120, + "total_acs": 9926, + "total_submitted": 15920, + "total_column_articles": 122, "frontend_question_id": "2264", "is_new_question": false }, @@ -8895,9 +9105,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": 9482, - "total_submitted": 13699, - "total_column_articles": 117, + "total_acs": 9601, + "total_submitted": 13858, + "total_column_articles": 119, "frontend_question_id": "2224", "is_new_question": false }, @@ -8916,9 +9126,9 @@ "question__title": "Escape the Spreading Fire", "question__title_slug": "escape-the-spreading-fire", "question__hide": false, - "total_acs": 2209, - "total_submitted": 6437, - "total_column_articles": 75, + "total_acs": 2287, + "total_submitted": 6576, + "total_column_articles": 74, "frontend_question_id": "2258", "is_new_question": false }, @@ -8937,8 +9147,8 @@ "question__title": "Count Unguarded Cells in the Grid", "question__title_slug": "count-unguarded-cells-in-the-grid", "question__hide": false, - "total_acs": 3966, - "total_submitted": 7737, + "total_acs": 4031, + "total_submitted": 7840, "total_column_articles": 96, "frontend_question_id": "2257", "is_new_question": false @@ -8958,9 +9168,9 @@ "question__title": "Minimum Average Difference", "question__title_slug": "minimum-average-difference", "question__hide": false, - "total_acs": 4735, - "total_submitted": 13336, - "total_column_articles": 67, + "total_acs": 4808, + "total_submitted": 13534, + "total_column_articles": 66, "frontend_question_id": "2256", "is_new_question": false }, @@ -8979,9 +9189,9 @@ "question__title": "Count Prefixes of a Given String", "question__title_slug": "count-prefixes-of-a-given-string", "question__hide": false, - "total_acs": 5937, - "total_submitted": 7354, - "total_column_articles": 80, + "total_acs": 6101, + "total_submitted": 7569, + "total_column_articles": 81, "frontend_question_id": "2255", "is_new_question": false }, @@ -9000,9 +9210,9 @@ "question__title": "Total Appeal of A String", "question__title_slug": "total-appeal-of-a-string", "question__hide": false, - "total_acs": 5207, - "total_submitted": 9473, - "total_column_articles": 102, + "total_acs": 5285, + "total_submitted": 9584, + "total_column_articles": 103, "frontend_question_id": "2262", "is_new_question": false }, @@ -9021,9 +9231,9 @@ "question__title": "K Divisible Elements Subarrays", "question__title_slug": "k-divisible-elements-subarrays", "question__hide": false, - "total_acs": 7092, - "total_submitted": 13624, - "total_column_articles": 116, + "total_acs": 7148, + "total_submitted": 13710, + "total_column_articles": 118, "frontend_question_id": "2261", "is_new_question": false }, @@ -9042,9 +9252,9 @@ "question__title": "Minimum Consecutive Cards to Pick Up", "question__title_slug": "minimum-consecutive-cards-to-pick-up", "question__hide": false, - "total_acs": 8377, - "total_submitted": 16709, - "total_column_articles": 130, + "total_acs": 8493, + "total_submitted": 16925, + "total_column_articles": 135, "frontend_question_id": "2260", "is_new_question": false }, @@ -9063,9 +9273,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": 8934, - "total_submitted": 18175, - "total_column_articles": 115, + "total_acs": 9085, + "total_submitted": 18438, + "total_column_articles": 119, "frontend_question_id": "2259", "is_new_question": false }, @@ -9084,8 +9294,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": 386, - "total_submitted": 822, + "total_acs": 422, + "total_submitted": 897, "total_column_articles": 10, "frontend_question_id": "2205", "is_new_question": false @@ -9105,9 +9315,9 @@ "question__title": "Finding the Topic of Each Post", "question__title_slug": "finding-the-topic-of-each-post", "question__hide": false, - "total_acs": 203, - "total_submitted": 387, - "total_column_articles": 6, + "total_acs": 220, + "total_submitted": 413, + "total_column_articles": 8, "frontend_question_id": "2199", "is_new_question": false }, @@ -9126,8 +9336,8 @@ "question__title": "Number of Flowers in Full Bloom", "question__title_slug": "number-of-flowers-in-full-bloom", "question__hide": false, - "total_acs": 4663, - "total_submitted": 9658, + "total_acs": 4750, + "total_submitted": 9827, "total_column_articles": 102, "frontend_question_id": "2251", "is_new_question": false @@ -9147,9 +9357,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": 5271, - "total_submitted": 15878, - "total_column_articles": 108, + "total_acs": 5331, + "total_submitted": 16063, + "total_column_articles": 107, "frontend_question_id": "2250", "is_new_question": false }, @@ -9168,9 +9378,9 @@ "question__title": "Count Lattice Points Inside a Circle", "question__title_slug": "count-lattice-points-inside-a-circle", "question__hide": false, - "total_acs": 7776, - "total_submitted": 15005, - "total_column_articles": 106, + "total_acs": 7871, + "total_submitted": 15180, + "total_column_articles": 105, "frontend_question_id": "2249", "is_new_question": false }, @@ -9189,9 +9399,9 @@ "question__title": "Intersection of Multiple Arrays", "question__title_slug": "intersection-of-multiple-arrays", "question__hide": false, - "total_acs": 10507, - "total_submitted": 15613, - "total_column_articles": 131, + "total_acs": 10713, + "total_submitted": 15935, + "total_column_articles": 140, "frontend_question_id": "2248", "is_new_question": false }, @@ -9210,8 +9420,8 @@ "question__title": "Maximum Total Beauty of the Gardens", "question__title_slug": "maximum-total-beauty-of-the-gardens", "question__hide": false, - "total_acs": 2616, - "total_submitted": 9439, + "total_acs": 2637, + "total_submitted": 9529, "total_column_articles": 65, "frontend_question_id": "2234", "is_new_question": false @@ -9231,9 +9441,9 @@ "question__title": "Maximum Product After K Increments", "question__title_slug": "maximum-product-after-k-increments", "question__hide": false, - "total_acs": 7080, - "total_submitted": 19693, - "total_column_articles": 150, + "total_acs": 7138, + "total_submitted": 19873, + "total_column_articles": 152, "frontend_question_id": "2233", "is_new_question": false }, @@ -9252,8 +9462,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": 6353, - "total_submitted": 10425, + "total_acs": 6394, + "total_submitted": 10487, "total_column_articles": 119, "frontend_question_id": "2232", "is_new_question": false @@ -9273,9 +9483,9 @@ "question__title": "Largest Number After Digit Swaps by Parity", "question__title_slug": "largest-number-after-digit-swaps-by-parity", "question__hide": false, - "total_acs": 8811, - "total_submitted": 13910, - "total_column_articles": 147, + "total_acs": 8922, + "total_submitted": 14064, + "total_column_articles": 149, "frontend_question_id": "2231", "is_new_question": false }, @@ -9294,8 +9504,8 @@ "question__title": "Sum of Scores of Built Strings", "question__title_slug": "sum-of-scores-of-built-strings", "question__hide": false, - "total_acs": 2647, - "total_submitted": 7758, + "total_acs": 2678, + "total_submitted": 7841, "total_column_articles": 48, "frontend_question_id": "2223", "is_new_question": false @@ -9315,9 +9525,9 @@ "question__title": "Number of Ways to Select Buildings", "question__title_slug": "number-of-ways-to-select-buildings", "question__hide": false, - "total_acs": 4867, - "total_submitted": 10226, - "total_column_articles": 114, + "total_acs": 4940, + "total_submitted": 10351, + "total_column_articles": 115, "frontend_question_id": "2222", "is_new_question": false }, @@ -9336,9 +9546,9 @@ "question__title": "Find Triangular Sum of an Array", "question__title_slug": "find-triangular-sum-of-an-array", "question__hide": false, - "total_acs": 6047, - "total_submitted": 7536, - "total_column_articles": 79, + "total_acs": 6215, + "total_submitted": 7724, + "total_column_articles": 78, "frontend_question_id": "2221", "is_new_question": false }, @@ -9357,9 +9567,9 @@ "question__title": "Minimum Bit Flips to Convert Number", "question__title_slug": "minimum-bit-flips-to-convert-number", "question__hide": false, - "total_acs": 6287, - "total_submitted": 7617, - "total_column_articles": 95, + "total_acs": 6424, + "total_submitted": 7783, + "total_column_articles": 96, "frontend_question_id": "2220", "is_new_question": false }, @@ -9378,8 +9588,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": 135, - "total_submitted": 265, + "total_acs": 138, + "total_submitted": 270, "total_column_articles": 10, "frontend_question_id": "2184", "is_new_question": false @@ -9399,9 +9609,9 @@ "question__title": "Minimum Weighted Subgraph With the Required Paths", "question__title_slug": "minimum-weighted-subgraph-with-the-required-paths", "question__hide": false, - "total_acs": 3455, - "total_submitted": 9443, - "total_column_articles": 65, + "total_acs": 3476, + "total_submitted": 9481, + "total_column_articles": 64, "frontend_question_id": "2203", "is_new_question": false }, @@ -9420,9 +9630,9 @@ "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": 10145, - "total_submitted": 19509, - "total_column_articles": 121, + "total_acs": 10212, + "total_submitted": 19612, + "total_column_articles": 125, "frontend_question_id": "2200", "is_new_question": false }, @@ -9441,8 +9651,8 @@ "question__title": "Longest Substring of One Repeating Character", "question__title_slug": "longest-substring-of-one-repeating-character", "question__hide": false, - "total_acs": 2221, - "total_submitted": 5957, + "total_acs": 2241, + "total_submitted": 6004, "total_column_articles": 71, "frontend_question_id": "2213", "is_new_question": false @@ -9462,9 +9672,9 @@ "question__title": "Maximum Points in an Archery Competition", "question__title_slug": "maximum-points-in-an-archery-competition", "question__hide": false, - "total_acs": 6184, - "total_submitted": 13168, - "total_column_articles": 151, + "total_acs": 6235, + "total_submitted": 13254, + "total_column_articles": 152, "frontend_question_id": "2212", "is_new_question": false }, @@ -9483,8 +9693,8 @@ "question__title": "Count Collisions on a Road", "question__title_slug": "count-collisions-on-a-road", "question__hide": false, - "total_acs": 8122, - "total_submitted": 20832, + "total_acs": 8184, + "total_submitted": 20953, "total_column_articles": 129, "frontend_question_id": "2211", "is_new_question": false @@ -9504,9 +9714,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": 9797, - "total_submitted": 16917, - "total_column_articles": 108, + "total_acs": 9903, + "total_submitted": 17072, + "total_column_articles": 109, "frontend_question_id": "2210", "is_new_question": false }, @@ -9525,8 +9735,8 @@ "question__title": "The Change in Global Rankings", "question__title_slug": "the-change-in-global-rankings", "question__hide": false, - "total_acs": 381, - "total_submitted": 684, + "total_acs": 402, + "total_submitted": 739, "total_column_articles": 9, "frontend_question_id": "2175", "is_new_question": false @@ -9546,9 +9756,9 @@ "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": 109, - "total_submitted": 161, - "total_column_articles": 8, + "total_acs": 117, + "total_submitted": 179, + "total_column_articles": 9, "frontend_question_id": "2174", "is_new_question": false }, @@ -9567,9 +9777,9 @@ "question__title": "Longest Winning Streak", "question__title_slug": "longest-winning-streak", "question__hide": false, - "total_acs": 406, - "total_submitted": 762, - "total_column_articles": 18, + "total_acs": 441, + "total_submitted": 819, + "total_column_articles": 19, "frontend_question_id": "2173", "is_new_question": false }, @@ -9588,9 +9798,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": 6651, - "total_submitted": 11386, - "total_column_articles": 75, + "total_acs": 6750, + "total_submitted": 11546, + "total_column_articles": 77, "frontend_question_id": "2190", "is_new_question": false }, @@ -9609,8 +9819,8 @@ "question__title": "Minimum White Tiles After Covering With Carpets", "question__title_slug": "minimum-white-tiles-after-covering-with-carpets", "question__hide": false, - "total_acs": 3496, - "total_submitted": 9627, + "total_acs": 3562, + "total_submitted": 9722, "total_column_articles": 43, "frontend_question_id": "2209", "is_new_question": false @@ -9630,9 +9840,9 @@ "question__title": "Minimum Operations to Halve Array Sum", "question__title_slug": "minimum-operations-to-halve-array-sum", "question__hide": false, - "total_acs": 5186, - "total_submitted": 13237, - "total_column_articles": 83, + "total_acs": 5237, + "total_submitted": 13337, + "total_column_articles": 84, "frontend_question_id": "2208", "is_new_question": false }, @@ -9651,8 +9861,8 @@ "question__title": "Maximize Number of Subsequences in a String", "question__title_slug": "maximize-number-of-subsequences-in-a-string", "question__hide": false, - "total_acs": 5570, - "total_submitted": 18658, + "total_acs": 5616, + "total_submitted": 18773, "total_column_articles": 92, "frontend_question_id": "2207", "is_new_question": false @@ -9672,9 +9882,9 @@ "question__title": "Divide Array Into Equal Pairs", "question__title_slug": "divide-array-into-equal-pairs", "question__hide": false, - "total_acs": 8124, - "total_submitted": 10693, - "total_column_articles": 95, + "total_acs": 8279, + "total_submitted": 10932, + "total_column_articles": 96, "frontend_question_id": "2206", "is_new_question": false }, @@ -9693,8 +9903,8 @@ "question__title": "Replace Non-Coprime Numbers in Array", "question__title_slug": "replace-non-coprime-numbers-in-array", "question__hide": false, - "total_acs": 4838, - "total_submitted": 14567, + "total_acs": 4866, + "total_submitted": 14619, "total_column_articles": 85, "frontend_question_id": "2197", "is_new_question": false @@ -9714,9 +9924,9 @@ "question__title": "Create Binary Tree From Descriptions", "question__title_slug": "create-binary-tree-from-descriptions", "question__hide": false, - "total_acs": 7342, - "total_submitted": 10021, - "total_column_articles": 126, + "total_acs": 7438, + "total_submitted": 10154, + "total_column_articles": 127, "frontend_question_id": "2196", "is_new_question": false }, @@ -9735,9 +9945,9 @@ "question__title": "Append K Integers With Minimal Sum", "question__title_slug": "append-k-integers-with-minimal-sum", "question__hide": false, - "total_acs": 9623, - "total_submitted": 41803, - "total_column_articles": 200, + "total_acs": 9688, + "total_submitted": 42031, + "total_column_articles": 201, "frontend_question_id": "2195", "is_new_question": false }, @@ -9756,9 +9966,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": 10696, - "total_submitted": 12576, - "total_column_articles": 104, + "total_acs": 10803, + "total_submitted": 12705, + "total_column_articles": 107, "frontend_question_id": "2194", "is_new_question": false }, @@ -9777,8 +9987,8 @@ "question__title": "Unique Substrings With Equal Digit Frequency", "question__title_slug": "unique-substrings-with-equal-digit-frequency", "question__hide": false, - "total_acs": 213, - "total_submitted": 348, + "total_acs": 220, + "total_submitted": 370, "total_column_articles": 9, "frontend_question_id": "2168", "is_new_question": false @@ -9798,8 +10008,8 @@ "question__title": "Order Two Columns Independently", "question__title_slug": "order-two-columns-independently", "question__hide": false, - "total_acs": 454, - "total_submitted": 704, + "total_acs": 478, + "total_submitted": 739, "total_column_articles": 8, "frontend_question_id": "2159", "is_new_question": false @@ -9819,8 +10029,8 @@ "question__title": "Count Array Pairs Divisible by K", "question__title_slug": "count-array-pairs-divisible-by-k", "question__hide": false, - "total_acs": 4000, - "total_submitted": 14819, + "total_acs": 4032, + "total_submitted": 14900, "total_column_articles": 54, "frontend_question_id": "2183", "is_new_question": false @@ -9840,9 +10050,9 @@ "question__title": "Construct String With Repeat Limit", "question__title_slug": "construct-string-with-repeat-limit", "question__hide": false, - "total_acs": 6025, - "total_submitted": 12547, - "total_column_articles": 129, + "total_acs": 6073, + "total_submitted": 12621, + "total_column_articles": 130, "frontend_question_id": "2182", "is_new_question": false }, @@ -9861,9 +10071,9 @@ "question__title": "Merge Nodes in Between Zeros", "question__title_slug": "merge-nodes-in-between-zeros", "question__hide": false, - "total_acs": 9945, - "total_submitted": 11558, - "total_column_articles": 135, + "total_acs": 10193, + "total_submitted": 11838, + "total_column_articles": 138, "frontend_question_id": "2181", "is_new_question": false }, @@ -9882,9 +10092,9 @@ "question__title": "Count Integers With Even Digit Sum", "question__title_slug": "count-integers-with-even-digit-sum", "question__hide": false, - "total_acs": 9039, - "total_submitted": 13972, - "total_column_articles": 105, + "total_acs": 9152, + "total_submitted": 14134, + "total_column_articles": 108, "frontend_question_id": "2180", "is_new_question": false }, @@ -9903,8 +10113,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": 228, - "total_submitted": 408, + "total_acs": 237, + "total_submitted": 420, "total_column_articles": 10, "frontend_question_id": "2158", "is_new_question": false @@ -9924,8 +10134,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": 230, - "total_submitted": 527, + "total_acs": 242, + "total_submitted": 553, "total_column_articles": 6, "frontend_question_id": "2153", "is_new_question": false @@ -9945,8 +10155,8 @@ "question__title": "Minimum Time to Finish the Race", "question__title_slug": "minimum-time-to-finish-the-race", "question__hide": false, - "total_acs": 3639, - "total_submitted": 8562, + "total_acs": 3671, + "total_submitted": 8606, "total_column_articles": 62, "frontend_question_id": "2188", "is_new_question": false @@ -9966,8 +10176,8 @@ "question__title": "Minimum Time to Complete Trips", "question__title_slug": "minimum-time-to-complete-trips", "question__hide": false, - "total_acs": 9789, - "total_submitted": 36947, + "total_acs": 9889, + "total_submitted": 37265, "total_column_articles": 135, "frontend_question_id": "2187", "is_new_question": false @@ -9987,9 +10197,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": 9083, - "total_submitted": 12664, - "total_column_articles": 100, + "total_acs": 9145, + "total_submitted": 12734, + "total_column_articles": 101, "frontend_question_id": "2186", "is_new_question": false }, @@ -10008,9 +10218,9 @@ "question__title": "Counting Words With a Given Prefix", "question__title_slug": "counting-words-with-a-given-prefix", "question__hide": false, - "total_acs": 11167, - "total_submitted": 14017, - "total_column_articles": 111, + "total_acs": 11323, + "total_submitted": 14214, + "total_column_articles": 115, "frontend_question_id": "2185", "is_new_question": false }, @@ -10029,9 +10239,9 @@ "question__title": "Maximum AND Sum of Array", "question__title_slug": "maximum-and-sum-of-array", "question__hide": false, - "total_acs": 3387, - "total_submitted": 7059, - "total_column_articles": 62, + "total_acs": 3419, + "total_submitted": 7102, + "total_column_articles": 63, "frontend_question_id": "2172", "is_new_question": false }, @@ -10050,9 +10260,9 @@ "question__title": "Removing Minimum Number of Magic Beans", "question__title_slug": "removing-minimum-number-of-magic-beans", "question__hide": false, - "total_acs": 7465, - "total_submitted": 19029, - "total_column_articles": 161, + "total_acs": 7549, + "total_submitted": 19196, + "total_column_articles": 164, "frontend_question_id": "2171", "is_new_question": false }, @@ -10071,9 +10281,9 @@ "question__title": "Minimum Operations to Make the Array Alternating", "question__title_slug": "minimum-operations-to-make-the-array-alternating", "question__hide": false, - "total_acs": 6863, - "total_submitted": 23285, - "total_column_articles": 137, + "total_acs": 6917, + "total_submitted": 23430, + "total_column_articles": 138, "frontend_question_id": "2170", "is_new_question": false }, @@ -10092,8 +10302,8 @@ "question__title": "Count Operations to Obtain Zero", "question__title_slug": "count-operations-to-obtain-zero", "question__hide": false, - "total_acs": 11703, - "total_submitted": 15398, + "total_acs": 11849, + "total_submitted": 15589, "total_column_articles": 96, "frontend_question_id": "2169", "is_new_question": false @@ -10113,8 +10323,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": 172, - "total_submitted": 345, + "total_acs": 184, + "total_submitted": 359, "total_column_articles": 12, "frontend_question_id": "2152", "is_new_question": false @@ -10134,8 +10344,8 @@ "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": 3737, - "total_submitted": 7769, + "total_acs": 3767, + "total_submitted": 7839, "total_column_articles": 71, "frontend_question_id": "2167", "is_new_question": false @@ -10155,9 +10365,9 @@ "question__title": "Design Bitset", "question__title_slug": "design-bitset", "question__hide": false, - "total_acs": 5076, - "total_submitted": 17256, - "total_column_articles": 142, + "total_acs": 5151, + "total_submitted": 17421, + "total_column_articles": 143, "frontend_question_id": "2166", "is_new_question": false }, @@ -10176,9 +10386,9 @@ "question__title": "Smallest Value of the Rearranged Number", "question__title_slug": "smallest-value-of-the-rearranged-number", "question__hide": false, - "total_acs": 6648, - "total_submitted": 12082, - "total_column_articles": 118, + "total_acs": 6732, + "total_submitted": 12239, + "total_column_articles": 119, "frontend_question_id": "2165", "is_new_question": false }, @@ -10197,9 +10407,9 @@ "question__title": "Sort Even and Odd Indices Independently", "question__title_slug": "sort-even-and-odd-indices-independently", "question__hide": false, - "total_acs": 8116, - "total_submitted": 11680, - "total_column_articles": 102, + "total_acs": 8234, + "total_submitted": 11842, + "total_column_articles": 103, "frontend_question_id": "2164", "is_new_question": false }, @@ -10218,8 +10428,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": 90, - "total_submitted": 172, + "total_acs": 92, + "total_submitted": 176, "total_column_articles": 8, "frontend_question_id": "2143", "is_new_question": false @@ -10239,8 +10449,8 @@ "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": 569, - "total_submitted": 1110, + "total_acs": 593, + "total_submitted": 1151, "total_column_articles": 13, "frontend_question_id": "2142", "is_new_question": false @@ -10260,9 +10470,9 @@ "question__title": "Count Good Triplets in an Array", "question__title_slug": "count-good-triplets-in-an-array", "question__hide": false, - "total_acs": 2538, - "total_submitted": 7543, - "total_column_articles": 63, + "total_acs": 2558, + "total_submitted": 7591, + "total_column_articles": 64, "frontend_question_id": "2179", "is_new_question": false }, @@ -10281,9 +10491,9 @@ "question__title": "Maximum Split of Positive Even Integers", "question__title_slug": "maximum-split-of-positive-even-integers", "question__hide": false, - "total_acs": 5728, - "total_submitted": 10313, - "total_column_articles": 94, + "total_acs": 5793, + "total_submitted": 10418, + "total_column_articles": 96, "frontend_question_id": "2178", "is_new_question": false }, @@ -10302,8 +10512,8 @@ "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": 6238, - "total_submitted": 9034, + "total_acs": 6316, + "total_submitted": 9129, "total_column_articles": 61, "frontend_question_id": "2177", "is_new_question": false @@ -10323,9 +10533,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": 7128, - "total_submitted": 8882, - "total_column_articles": 79, + "total_acs": 7267, + "total_submitted": 9080, + "total_column_articles": 82, "frontend_question_id": "2176", "is_new_question": false }, @@ -10344,9 +10554,9 @@ "question__title": "Groups of Strings", "question__title_slug": "groups-of-strings", "question__hide": false, - "total_acs": 2910, - "total_submitted": 9656, - "total_column_articles": 66, + "total_acs": 2946, + "total_submitted": 9742, + "total_column_articles": 67, "frontend_question_id": "2157", "is_new_question": false }, @@ -10365,9 +10575,9 @@ "question__title": "Find Substring With Given Hash Value", "question__title_slug": "find-substring-with-given-hash-value", "question__hide": false, - "total_acs": 4804, - "total_submitted": 19964, - "total_column_articles": 79, + "total_acs": 4862, + "total_submitted": 20164, + "total_column_articles": 82, "frontend_question_id": "2156", "is_new_question": false }, @@ -10386,9 +10596,9 @@ "question__title": "Keep Multiplying Found Values by Two", "question__title_slug": "keep-multiplying-found-values-by-two", "question__hide": false, - "total_acs": 10771, - "total_submitted": 14458, - "total_column_articles": 135, + "total_acs": 10984, + "total_submitted": 14781, + "total_column_articles": 142, "frontend_question_id": "2154", "is_new_question": false }, @@ -10407,8 +10617,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": 187, - "total_submitted": 305, + "total_acs": 191, + "total_submitted": 325, "total_column_articles": 10, "frontend_question_id": "2137", "is_new_question": false @@ -10428,8 +10638,8 @@ "question__title": "Maximum Good People Based on Statements", "question__title_slug": "maximum-good-people-based-on-statements", "question__hide": false, - "total_acs": 4604, - "total_submitted": 9449, + "total_acs": 4621, + "total_submitted": 9471, "total_column_articles": 88, "frontend_question_id": "2151", "is_new_question": false @@ -10449,8 +10659,8 @@ "question__title": "Rearrange Array Elements by Sign", "question__title_slug": "rearrange-array-elements-by-sign", "question__hide": false, - "total_acs": 8718, - "total_submitted": 10815, + "total_acs": 8865, + "total_submitted": 11004, "total_column_articles": 96, "frontend_question_id": "2149", "is_new_question": false @@ -10470,9 +10680,9 @@ "question__title": "Find All Lonely Numbers in the Array", "question__title_slug": "find-all-lonely-numbers-in-the-array", "question__hide": false, - "total_acs": 7650, - "total_submitted": 12629, - "total_column_articles": 90, + "total_acs": 7708, + "total_submitted": 12742, + "total_column_articles": 91, "frontend_question_id": "2150", "is_new_question": false }, @@ -10491,9 +10701,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": 9205, - "total_submitted": 15895, - "total_column_articles": 121, + "total_acs": 9323, + "total_submitted": 16094, + "total_column_articles": 123, "frontend_question_id": "2148", "is_new_question": false }, @@ -10512,8 +10722,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": 286, - "total_submitted": 382, + "total_acs": 312, + "total_submitted": 410, "total_column_articles": 10, "frontend_question_id": "2128", "is_new_question": false @@ -10533,8 +10743,8 @@ "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": 2451, - "total_submitted": 5086, + "total_acs": 2479, + "total_submitted": 5151, "total_column_articles": 51, "frontend_question_id": "2163", "is_new_question": false @@ -10554,8 +10764,8 @@ "question__title": "Minimum Cost to Set Cooking Time", "question__title_slug": "minimum-cost-to-set-cooking-time", "question__hide": false, - "total_acs": 2821, - "total_submitted": 8686, + "total_acs": 2846, + "total_submitted": 8745, "total_column_articles": 75, "frontend_question_id": "2162", "is_new_question": false @@ -10575,9 +10785,9 @@ "question__title": "Partition Array According to Given Pivot", "question__title_slug": "partition-array-according-to-given-pivot", "question__hide": false, - "total_acs": 6001, - "total_submitted": 7129, - "total_column_articles": 91, + "total_acs": 6121, + "total_submitted": 7304, + "total_column_articles": 95, "frontend_question_id": "2161", "is_new_question": false }, @@ -10596,9 +10806,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": 8337, - "total_submitted": 9735, - "total_column_articles": 126, + "total_acs": 8561, + "total_submitted": 10013, + "total_column_articles": 129, "frontend_question_id": "2160", "is_new_question": false }, @@ -10617,9 +10827,9 @@ "question__title": "Maximum Running Time of N Computers", "question__title_slug": "maximum-running-time-of-n-computers", "question__hide": false, - "total_acs": 4294, - "total_submitted": 10842, - "total_column_articles": 66, + "total_acs": 4385, + "total_submitted": 11062, + "total_column_articles": 67, "frontend_question_id": "2141", "is_new_question": false }, @@ -10638,8 +10848,8 @@ "question__title": "Solving Questions With Brainpower", "question__title_slug": "solving-questions-with-brainpower", "question__hide": false, - "total_acs": 6876, - "total_submitted": 16419, + "total_acs": 6937, + "total_submitted": 16567, "total_column_articles": 146, "frontend_question_id": "2140", "is_new_question": false @@ -10659,9 +10869,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": 6748, - "total_submitted": 10514, - "total_column_articles": 101, + "total_acs": 6809, + "total_submitted": 10617, + "total_column_articles": 102, "frontend_question_id": "2155", "is_new_question": false }, @@ -10680,9 +10890,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": 8227, - "total_submitted": 12239, - "total_column_articles": 112, + "total_acs": 8316, + "total_submitted": 12373, + "total_column_articles": 114, "frontend_question_id": "2138", "is_new_question": false }, @@ -10701,8 +10911,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": 151, - "total_submitted": 301, + "total_acs": 155, + "total_submitted": 305, "total_column_articles": 5, "frontend_question_id": "2123", "is_new_question": false @@ -10722,8 +10932,8 @@ "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": 161, - "total_submitted": 296, + "total_acs": 173, + "total_submitted": 309, "total_column_articles": 9, "frontend_question_id": "2113", "is_new_question": false @@ -10743,9 +10953,9 @@ "question__title": "Earliest Possible Day of Full Bloom", "question__title_slug": "earliest-possible-day-of-full-bloom", "question__hide": false, - "total_acs": 3218, - "total_submitted": 5037, - "total_column_articles": 59, + "total_acs": 3278, + "total_submitted": 5116, + "total_column_articles": 60, "frontend_question_id": "2136", "is_new_question": false }, @@ -10764,8 +10974,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": 4537, - "total_submitted": 13070, + "total_acs": 4584, + "total_submitted": 13150, "total_column_articles": 91, "frontend_question_id": "2135", "is_new_question": false @@ -10785,8 +10995,8 @@ "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": 5954, - "total_submitted": 12585, + "total_acs": 6015, + "total_submitted": 12738, "total_column_articles": 156, "frontend_question_id": "2134", "is_new_question": false @@ -10806,9 +11016,9 @@ "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": 8084, - "total_submitted": 14342, - "total_column_articles": 122, + "total_acs": 8176, + "total_submitted": 14525, + "total_column_articles": 123, "frontend_question_id": "2133", "is_new_question": false }, @@ -10827,9 +11037,9 @@ "question__title": "Build the Equation", "question__title_slug": "build-the-equation", "question__hide": false, - "total_acs": 303, - "total_submitted": 542, - "total_column_articles": 10, + "total_acs": 317, + "total_submitted": 563, + "total_column_articles": 11, "frontend_question_id": "2118", "is_new_question": false }, @@ -10848,8 +11058,8 @@ "question__title": "The Airport With the Most Traffic", "question__title_slug": "the-airport-with-the-most-traffic", "question__hide": false, - "total_acs": 627, - "total_submitted": 891, + "total_acs": 654, + "total_submitted": 924, "total_column_articles": 14, "frontend_question_id": "2112", "is_new_question": false @@ -10869,8 +11079,8 @@ "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": 2871, - "total_submitted": 7175, + "total_acs": 2894, + "total_submitted": 7214, "total_column_articles": 74, "frontend_question_id": "2147", "is_new_question": false @@ -10890,8 +11100,8 @@ "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": 3275, - "total_submitted": 8429, + "total_acs": 3336, + "total_submitted": 8537, "total_column_articles": 84, "frontend_question_id": "2146", "is_new_question": false @@ -10911,9 +11121,9 @@ "question__title": "Count the Hidden Sequences", "question__title_slug": "count-the-hidden-sequences", "question__hide": false, - "total_acs": 4454, - "total_submitted": 12994, - "total_column_articles": 102, + "total_acs": 4510, + "total_submitted": 13104, + "total_column_articles": 103, "frontend_question_id": "2145", "is_new_question": false }, @@ -10932,9 +11142,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": 6735, - "total_submitted": 9925, - "total_column_articles": 114, + "total_acs": 6864, + "total_submitted": 10098, + "total_column_articles": 118, "frontend_question_id": "2144", "is_new_question": false }, @@ -10953,8 +11163,8 @@ "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": 224, - "total_submitted": 589, + "total_acs": 236, + "total_submitted": 634, "total_column_articles": 12, "frontend_question_id": "2107", "is_new_question": false @@ -10974,8 +11184,8 @@ "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": 2484, - "total_submitted": 8216, + "total_acs": 2500, + "total_submitted": 8260, "total_column_articles": 58, "frontend_question_id": "2127", "is_new_question": false @@ -10995,9 +11205,9 @@ "question__title": "Destroying Asteroids", "question__title_slug": "destroying-asteroids", "question__hide": false, - "total_acs": 7014, - "total_submitted": 14431, - "total_column_articles": 90, + "total_acs": 7084, + "total_submitted": 14562, + "total_column_articles": 91, "frontend_question_id": "2126", "is_new_question": false }, @@ -11016,9 +11226,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": 7592, - "total_submitted": 9053, - "total_column_articles": 101, + "total_acs": 7690, + "total_submitted": 9161, + "total_column_articles": 103, "frontend_question_id": "2125", "is_new_question": false }, @@ -11037,9 +11247,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": 8961, - "total_submitted": 12721, - "total_column_articles": 146, + "total_acs": 9093, + "total_submitted": 12933, + "total_column_articles": 148, "frontend_question_id": "2124", "is_new_question": false }, @@ -11058,8 +11268,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": 169, - "total_submitted": 409, + "total_acs": 176, + "total_submitted": 424, "total_column_articles": 9, "frontend_question_id": "2098", "is_new_question": false @@ -11079,8 +11289,8 @@ "question__title": "Recover the Original Array", "question__title_slug": "recover-the-original-array", "question__hide": false, - "total_acs": 3353, - "total_submitted": 8196, + "total_acs": 3370, + "total_submitted": 8221, "total_column_articles": 60, "frontend_question_id": "2122", "is_new_question": false @@ -11100,8 +11310,8 @@ "question__title": "Intervals Between Identical Elements", "question__title_slug": "intervals-between-identical-elements", "question__hide": false, - "total_acs": 5437, - "total_submitted": 14695, + "total_acs": 5490, + "total_submitted": 14841, "total_column_articles": 137, "frontend_question_id": "2121", "is_new_question": false @@ -11121,9 +11331,9 @@ "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": 6407, - "total_submitted": 7781, - "total_column_articles": 92, + "total_acs": 6469, + "total_submitted": 7869, + "total_column_articles": 93, "frontend_question_id": "2120", "is_new_question": false }, @@ -11142,8 +11352,8 @@ "question__title": "A Number After a Double Reversal", "question__title_slug": "a-number-after-a-double-reversal", "question__hide": false, - "total_acs": 10412, - "total_submitted": 13703, + "total_acs": 10554, + "total_submitted": 13904, "total_column_articles": 131, "frontend_question_id": "2119", "is_new_question": false @@ -11163,8 +11373,8 @@ "question__title": "Longest Palindrome by Concatenating Two Letter Words", "question__title_slug": "longest-palindrome-by-concatenating-two-letter-words", "question__hide": false, - "total_acs": 4327, - "total_submitted": 11213, + "total_acs": 4451, + "total_submitted": 11510, "total_column_articles": 95, "frontend_question_id": "2131", "is_new_question": false @@ -11184,9 +11394,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": 6320, - "total_submitted": 7672, - "total_column_articles": 94, + "total_acs": 6470, + "total_submitted": 7852, + "total_column_articles": 96, "frontend_question_id": "2130", "is_new_question": false }, @@ -11205,9 +11415,9 @@ "question__title": "Capitalize the Title", "question__title_slug": "capitalize-the-title", "question__hide": false, - "total_acs": 6090, - "total_submitted": 9929, - "total_column_articles": 105, + "total_acs": 6182, + "total_submitted": 10076, + "total_column_articles": 108, "frontend_question_id": "2129", "is_new_question": false }, @@ -11226,8 +11436,8 @@ "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": 3963, - "total_submitted": 11840, + "total_acs": 3983, + "total_submitted": 11868, "total_column_articles": 87, "frontend_question_id": "2111", "is_new_question": false @@ -11247,8 +11457,8 @@ "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": 7642, - "total_submitted": 14741, + "total_acs": 7718, + "total_submitted": 14880, "total_column_articles": 136, "frontend_question_id": "2110", "is_new_question": false @@ -11268,8 +11478,8 @@ "question__title": "Adding Spaces to a String", "question__title_slug": "adding-spaces-to-a-string", "question__hide": false, - "total_acs": 7802, - "total_submitted": 12780, + "total_acs": 7907, + "total_submitted": 12954, "total_column_articles": 99, "frontend_question_id": "2109", "is_new_question": false @@ -11289,9 +11499,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": 9832, - "total_submitted": 12451, - "total_column_articles": 143, + "total_acs": 9968, + "total_submitted": 12632, + "total_column_articles": 145, "frontend_question_id": "2108", "is_new_question": false }, @@ -11310,8 +11520,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": 224, - "total_submitted": 341, + "total_acs": 229, + "total_submitted": 347, "total_column_articles": 9, "frontend_question_id": "2093", "is_new_question": false @@ -11331,8 +11541,8 @@ "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": 4011, - "total_submitted": 12023, + "total_acs": 4041, + "total_submitted": 12103, "total_column_articles": 83, "frontend_question_id": "2106", "is_new_question": false @@ -11352,9 +11562,9 @@ "question__title": "Watering Plants II", "question__title_slug": "watering-plants-ii", "question__hide": false, - "total_acs": 5572, - "total_submitted": 10180, - "total_column_articles": 91, + "total_acs": 5636, + "total_submitted": 10328, + "total_column_articles": 93, "frontend_question_id": "2105", "is_new_question": false }, @@ -11373,9 +11583,9 @@ "question__title": "Sum of Subarray Ranges", "question__title_slug": "sum-of-subarray-ranges", "question__hide": false, - "total_acs": 36833, - "total_submitted": 58638, - "total_column_articles": 348, + "total_acs": 36998, + "total_submitted": 58909, + "total_column_articles": 347, "frontend_question_id": "2104", "is_new_question": false }, @@ -11394,9 +11604,9 @@ "question__title": "Rings and Rods", "question__title_slug": "rings-and-rods", "question__hide": false, - "total_acs": 8244, - "total_submitted": 10263, - "total_column_articles": 151, + "total_acs": 8343, + "total_submitted": 10401, + "total_column_articles": 152, "frontend_question_id": "2103", "is_new_question": false }, @@ -11415,8 +11625,8 @@ "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": 297, - "total_submitted": 471, + "total_acs": 320, + "total_submitted": 500, "total_column_articles": 14, "frontend_question_id": "2083", "is_new_question": false @@ -11436,8 +11646,8 @@ "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": 1056, - "total_submitted": 1283, + "total_acs": 1101, + "total_submitted": 1338, "total_column_articles": 29, "frontend_question_id": "2084", "is_new_question": false @@ -11457,9 +11667,9 @@ "question__title": "The Number of Rich Customers", "question__title_slug": "the-number-of-rich-customers", "question__hide": false, - "total_acs": 1478, - "total_submitted": 1986, - "total_column_articles": 25, + "total_acs": 1538, + "total_submitted": 2069, + "total_column_articles": 26, "frontend_question_id": "2082", "is_new_question": false }, @@ -11478,8 +11688,8 @@ "question__title": "Abbreviating the Product of a Range", "question__title_slug": "abbreviating-the-product-of-a-range", "question__hide": false, - "total_acs": 1228, - "total_submitted": 3699, + "total_acs": 1232, + "total_submitted": 3739, "total_column_articles": 18, "frontend_question_id": "2117", "is_new_question": false @@ -11499,8 +11709,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": 2922, - "total_submitted": 9539, + "total_acs": 2966, + "total_submitted": 9662, "total_column_articles": 54, "frontend_question_id": "2116", "is_new_question": false @@ -11520,9 +11730,9 @@ "question__title": "Find All Possible Recipes from Given Supplies", "question__title_slug": "find-all-possible-recipes-from-given-supplies", "question__hide": false, - "total_acs": 4371, - "total_submitted": 11161, - "total_column_articles": 97, + "total_acs": 4446, + "total_submitted": 11311, + "total_column_articles": 98, "frontend_question_id": "2115", "is_new_question": false }, @@ -11541,9 +11751,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": 11662, - "total_submitted": 13566, - "total_column_articles": 156, + "total_acs": 12001, + "total_submitted": 13969, + "total_column_articles": 162, "frontend_question_id": "2114", "is_new_question": false }, @@ -11562,8 +11772,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": 132, - "total_submitted": 222, + "total_acs": 136, + "total_submitted": 228, "total_column_articles": 6, "frontend_question_id": "2077", "is_new_question": false @@ -11583,9 +11793,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": 5656, - "total_submitted": 13261, - "total_column_articles": 174, + "total_acs": 5758, + "total_submitted": 13481, + "total_column_articles": 175, "frontend_question_id": "2096", "is_new_question": false }, @@ -11604,9 +11814,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": 9606, - "total_submitted": 16448, - "total_column_articles": 130, + "total_acs": 9784, + "total_submitted": 16755, + "total_column_articles": 132, "frontend_question_id": "2095", "is_new_question": false }, @@ -11625,9 +11835,9 @@ "question__title": "Finding 3-Digit Even Numbers", "question__title_slug": "finding-3-digit-even-numbers", "question__hide": false, - "total_acs": 8455, - "total_submitted": 15235, - "total_column_articles": 137, + "total_acs": 8574, + "total_submitted": 15442, + "total_column_articles": 139, "frontend_question_id": "2094", "is_new_question": false }, @@ -11646,8 +11856,8 @@ "question__title": "The Winner University", "question__title_slug": "the-winner-university", "question__hide": false, - "total_acs": 1355, - "total_submitted": 1964, + "total_acs": 1406, + "total_submitted": 2033, "total_column_articles": 26, "frontend_question_id": "2072", "is_new_question": false @@ -11667,9 +11877,9 @@ "question__title": "Find All People With Secret", "question__title_slug": "find-all-people-with-secret", "question__hide": false, - "total_acs": 4740, - "total_submitted": 17058, - "total_column_articles": 116, + "total_acs": 4809, + "total_submitted": 17218, + "total_column_articles": 118, "frontend_question_id": "2092", "is_new_question": false }, @@ -11688,8 +11898,8 @@ "question__title": "Removing Minimum and Maximum From Array", "question__title_slug": "removing-minimum-and-maximum-from-array", "question__hide": false, - "total_acs": 6670, - "total_submitted": 11756, + "total_acs": 6727, + "total_submitted": 11867, "total_column_articles": 129, "frontend_question_id": "2091", "is_new_question": false @@ -11709,9 +11919,9 @@ "question__title": "K Radius Subarray Averages", "question__title_slug": "k-radius-subarray-averages", "question__hide": false, - "total_acs": 6585, - "total_submitted": 18229, - "total_column_articles": 104, + "total_acs": 6640, + "total_submitted": 18381, + "total_column_articles": 105, "frontend_question_id": "2090", "is_new_question": false }, @@ -11730,9 +11940,9 @@ "question__title": "Find Target Indices After Sorting Array", "question__title_slug": "find-target-indices-after-sorting-array", "question__hide": false, - "total_acs": 12152, - "total_submitted": 15069, - "total_column_articles": 160, + "total_acs": 12385, + "total_submitted": 15379, + "total_column_articles": 162, "frontend_question_id": "2089", "is_new_question": false }, @@ -11751,8 +11961,8 @@ "question__title": "Number of Equal Count Substrings", "question__title_slug": "number-of-equal-count-substrings", "question__hide": false, - "total_acs": 118, - "total_submitted": 233, + "total_acs": 123, + "total_submitted": 242, "total_column_articles": 9, "frontend_question_id": "2067", "is_new_question": false @@ -11772,8 +11982,8 @@ "question__title": "Account Balance", "question__title_slug": "account-balance", "question__hide": false, - "total_acs": 1039, - "total_submitted": 1303, + "total_acs": 1068, + "total_submitted": 1336, "total_column_articles": 25, "frontend_question_id": "2066", "is_new_question": false @@ -11793,9 +12003,9 @@ "question__title": "Sequentially Ordinal Rank Tracker", "question__title_slug": "sequentially-ordinal-rank-tracker", "question__hide": false, - "total_acs": 2394, - "total_submitted": 4468, - "total_column_articles": 70, + "total_acs": 2428, + "total_submitted": 4530, + "total_column_articles": 72, "frontend_question_id": "2102", "is_new_question": false }, @@ -11814,9 +12024,9 @@ "question__title": "Detonate the Maximum Bombs", "question__title_slug": "detonate-the-maximum-bombs", "question__hide": false, - "total_acs": 3810, - "total_submitted": 9784, - "total_column_articles": 83, + "total_acs": 3969, + "total_submitted": 10101, + "total_column_articles": 85, "frontend_question_id": "2101", "is_new_question": false }, @@ -11835,8 +12045,8 @@ "question__title": "Find Good Days to Rob the Bank", "question__title_slug": "find-good-days-to-rob-the-bank", "question__hide": false, - "total_acs": 32528, - "total_submitted": 66849, + "total_acs": 32609, + "total_submitted": 67020, "total_column_articles": 404, "frontend_question_id": "2100", "is_new_question": false @@ -11856,9 +12066,9 @@ "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": 6184, - "total_submitted": 12693, - "total_column_articles": 134, + "total_acs": 6309, + "total_submitted": 12933, + "total_column_articles": 136, "frontend_question_id": "2099", "is_new_question": false }, @@ -11877,8 +12087,8 @@ "question__title": "Number of Spaces Cleaning Robot Cleaned", "question__title_slug": "number-of-spaces-cleaning-robot-cleaned", "question__hide": false, - "total_acs": 342, - "total_submitted": 708, + "total_acs": 348, + "total_submitted": 727, "total_column_articles": 17, "frontend_question_id": "2061", "is_new_question": false @@ -11898,9 +12108,9 @@ "question__title": "Sum of k-Mirror Numbers", "question__title_slug": "sum-of-k-mirror-numbers", "question__hide": false, - "total_acs": 2746, - "total_submitted": 6500, - "total_column_articles": 72, + "total_acs": 2770, + "total_submitted": 6561, + "total_column_articles": 73, "frontend_question_id": "2081", "is_new_question": false }, @@ -11919,8 +12129,8 @@ "question__title": "Valid Arrangement of Pairs", "question__title_slug": "valid-arrangement-of-pairs", "question__hide": false, - "total_acs": 2249, - "total_submitted": 6128, + "total_acs": 2263, + "total_submitted": 6182, "total_column_articles": 49, "frontend_question_id": "2097", "is_new_question": false @@ -11940,8 +12150,8 @@ "question__title": "Stamping the Grid", "question__title_slug": "stamping-the-grid", "question__hide": false, - "total_acs": 1938, - "total_submitted": 7431, + "total_acs": 1954, + "total_submitted": 7468, "total_column_articles": 47, "frontend_question_id": "2132", "is_new_question": false @@ -11961,9 +12171,9 @@ "question__title": "Two Furthest Houses With Different Colors", "question__title_slug": "two-furthest-houses-with-different-colors", "question__hide": false, - "total_acs": 9029, - "total_submitted": 12323, - "total_column_articles": 144, + "total_acs": 9147, + "total_submitted": 12498, + "total_column_articles": 145, "frontend_question_id": "2078", "is_new_question": false }, @@ -11982,9 +12192,9 @@ "question__title": "Process Restricted Friend Requests", "question__title_slug": "process-restricted-friend-requests", "question__hide": false, - "total_acs": 3008, - "total_submitted": 5994, - "total_column_articles": 72, + "total_acs": 3031, + "total_submitted": 6037, + "total_column_articles": 73, "frontend_question_id": "2076", "is_new_question": false }, @@ -12003,8 +12213,8 @@ "question__title": "Decode the Slanted Ciphertext", "question__title_slug": "decode-the-slanted-ciphertext", "question__hide": false, - "total_acs": 3891, - "total_submitted": 8419, + "total_acs": 3916, + "total_submitted": 8460, "total_column_articles": 72, "frontend_question_id": "2075", "is_new_question": false @@ -12024,8 +12234,8 @@ "question__title": "Reverse Nodes in Even Length Groups", "question__title_slug": "reverse-nodes-in-even-length-groups", "question__hide": false, - "total_acs": 5056, - "total_submitted": 11654, + "total_acs": 5093, + "total_submitted": 11725, "total_column_articles": 134, "frontend_question_id": "2074", "is_new_question": false @@ -12045,9 +12255,9 @@ "question__title": "Time Needed to Buy Tickets", "question__title_slug": "time-needed-to-buy-tickets", "question__hide": false, - "total_acs": 9073, - "total_submitted": 14543, - "total_column_articles": 149, + "total_acs": 9234, + "total_submitted": 14801, + "total_column_articles": 152, "frontend_question_id": "2073", "is_new_question": false }, @@ -12066,8 +12276,8 @@ "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": 756, - "total_submitted": 1133, + "total_acs": 785, + "total_submitted": 1183, "total_column_articles": 17, "frontend_question_id": "2051", "is_new_question": false @@ -12087,9 +12297,9 @@ "question__title": "Count Fertile Pyramids in a Land", "question__title_slug": "count-fertile-pyramids-in-a-land", "question__hide": false, - "total_acs": 1914, - "total_submitted": 3052, - "total_column_articles": 46, + "total_acs": 1935, + "total_submitted": 3082, + "total_column_articles": 47, "frontend_question_id": "2088", "is_new_question": false }, @@ -12108,8 +12318,8 @@ "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": 2974, - "total_submitted": 6138, + "total_acs": 3010, + "total_submitted": 6228, "total_column_articles": 66, "frontend_question_id": "2087", "is_new_question": false @@ -12129,9 +12339,9 @@ "question__title": "Minimum Number of Buckets Required to Collect Rainwater from Houses", "question__title_slug": "minimum-number-of-buckets-required-to-collect-rainwater-from-houses", "question__hide": false, - "total_acs": 3981, - "total_submitted": 8759, - "total_column_articles": 81, + "total_acs": 4037, + "total_submitted": 8865, + "total_column_articles": 82, "frontend_question_id": "2086", "is_new_question": false }, @@ -12150,8 +12360,8 @@ "question__title": "Count Common Words With One Occurrence", "question__title_slug": "count-common-words-with-one-occurrence", "question__hide": false, - "total_acs": 5829, - "total_submitted": 8051, + "total_acs": 5939, + "total_submitted": 8217, "total_column_articles": 103, "frontend_question_id": "2085", "is_new_question": false @@ -12171,8 +12381,8 @@ "question__title": "Maximum Path Quality of a Graph", "question__title_slug": "maximum-path-quality-of-a-graph", "question__hide": false, - "total_acs": 2421, - "total_submitted": 4510, + "total_acs": 2438, + "total_submitted": 4549, "total_column_articles": 63, "frontend_question_id": "2065", "is_new_question": false @@ -12192,8 +12402,8 @@ "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": 4546, - "total_submitted": 10448, + "total_acs": 4618, + "total_submitted": 10619, "total_column_articles": 87, "frontend_question_id": "2064", "is_new_question": false @@ -12213,9 +12423,9 @@ "question__title": "Vowels of All Substrings", "question__title_slug": "vowels-of-all-substrings", "question__hide": false, - "total_acs": 5235, - "total_submitted": 10369, - "total_column_articles": 114, + "total_acs": 5293, + "total_submitted": 10481, + "total_column_articles": 116, "frontend_question_id": "2063", "is_new_question": false }, @@ -12234,9 +12444,9 @@ "question__title": "Count Vowel Substrings of a String", "question__title_slug": "count-vowel-substrings-of-a-string", "question__hide": false, - "total_acs": 6687, - "total_submitted": 10866, - "total_column_articles": 116, + "total_acs": 6755, + "total_submitted": 10982, + "total_column_articles": 119, "frontend_question_id": "2062", "is_new_question": false }, @@ -12255,9 +12465,9 @@ "question__title": "Accepted Candidates From the Interviews", "question__title_slug": "accepted-candidates-from-the-interviews", "question__hide": false, - "total_acs": 1097, - "total_submitted": 1451, - "total_column_articles": 23, + "total_acs": 1151, + "total_submitted": 1522, + "total_column_articles": 24, "frontend_question_id": "2041", "is_new_question": false }, @@ -12276,8 +12486,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": 1245, - "total_submitted": 3298, + "total_acs": 1249, + "total_submitted": 3303, "total_column_articles": 23, "frontend_question_id": "2060", "is_new_question": false @@ -12297,9 +12507,9 @@ "question__title": "Minimum Operations to Convert Number", "question__title_slug": "minimum-operations-to-convert-number", "question__hide": false, - "total_acs": 5119, - "total_submitted": 11364, - "total_column_articles": 105, + "total_acs": 5180, + "total_submitted": 11476, + "total_column_articles": 106, "frontend_question_id": "2059", "is_new_question": false }, @@ -12318,8 +12528,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": 6232, - "total_submitted": 11056, + "total_acs": 6286, + "total_submitted": 11151, "total_column_articles": 87, "frontend_question_id": "2058", "is_new_question": false @@ -12339,9 +12549,9 @@ "question__title": "Smallest Index With Equal Value", "question__title_slug": "smallest-index-with-equal-value", "question__hide": false, - "total_acs": 8784, - "total_submitted": 11490, - "total_column_articles": 82, + "total_acs": 8894, + "total_submitted": 11634, + "total_column_articles": 84, "frontend_question_id": "2057", "is_new_question": false }, @@ -12360,8 +12570,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": 1607, - "total_submitted": 4483, + "total_acs": 1631, + "total_submitted": 4563, "total_column_articles": 37, "frontend_question_id": "2071", "is_new_question": false @@ -12381,8 +12591,8 @@ "question__title": "Most Beautiful Item for Each Query", "question__title_slug": "most-beautiful-item-for-each-query", "question__hide": false, - "total_acs": 3195, - "total_submitted": 7242, + "total_acs": 3236, + "total_submitted": 7343, "total_column_articles": 97, "frontend_question_id": "2070", "is_new_question": false @@ -12402,8 +12612,8 @@ "question__title": "Walking Robot Simulation II", "question__title_slug": "walking-robot-simulation-ii", "question__hide": false, - "total_acs": 3503, - "total_submitted": 16850, + "total_acs": 3572, + "total_submitted": 17141, "total_column_articles": 99, "frontend_question_id": "2069", "is_new_question": false @@ -12423,9 +12633,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": 5930, - "total_submitted": 8300, - "total_column_articles": 108, + "total_acs": 6043, + "total_submitted": 8466, + "total_column_articles": 109, "frontend_question_id": "2068", "is_new_question": false }, @@ -12444,8 +12654,8 @@ "question__title": "Parallel Courses III", "question__title_slug": "parallel-courses-iii", "question__hide": false, - "total_acs": 2835, - "total_submitted": 4918, + "total_acs": 2877, + "total_submitted": 4979, "total_column_articles": 90, "frontend_question_id": "2050", "is_new_question": false @@ -12465,9 +12675,9 @@ "question__title": "Count Nodes With the Highest Score", "question__title_slug": "count-nodes-with-the-highest-score", "question__hide": false, - "total_acs": 25424, - "total_submitted": 49172, - "total_column_articles": 298, + "total_acs": 25492, + "total_submitted": 49352, + "total_column_articles": 299, "frontend_question_id": "2049", "is_new_question": false }, @@ -12486,9 +12696,9 @@ "question__title": "Next Greater Numerically Balanced Number", "question__title_slug": "next-greater-numerically-balanced-number", "question__hide": false, - "total_acs": 4954, - "total_submitted": 11447, - "total_column_articles": 103, + "total_acs": 5011, + "total_submitted": 11532, + "total_column_articles": 104, "frontend_question_id": "2048", "is_new_question": false }, @@ -12507,9 +12717,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": 26355, - "total_submitted": 67335, - "total_column_articles": 392, + "total_acs": 26406, + "total_submitted": 67510, + "total_column_articles": 393, "frontend_question_id": "2047", "is_new_question": false }, @@ -12528,8 +12738,8 @@ "question__title": "Low-Quality Problems", "question__title_slug": "low-quality-problems", "question__hide": false, - "total_acs": 2437, - "total_submitted": 3052, + "total_acs": 2505, + "total_submitted": 3132, "total_column_articles": 30, "frontend_question_id": "2026", "is_new_question": false @@ -12549,9 +12759,9 @@ "question__title": "Second Minimum Time to Reach Destination", "question__title_slug": "second-minimum-time-to-reach-destination", "question__hide": false, - "total_acs": 15789, - "total_submitted": 29446, - "total_column_articles": 160, + "total_acs": 15883, + "total_submitted": 29632, + "total_column_articles": 161, "frontend_question_id": "2045", "is_new_question": false }, @@ -12570,8 +12780,8 @@ "question__title": "Count Number of Maximum Bitwise-OR Subsets", "question__title_slug": "count-number-of-maximum-bitwise-or-subsets", "question__hide": false, - "total_acs": 33965, - "total_submitted": 41487, + "total_acs": 34067, + "total_submitted": 41625, "total_column_articles": 371, "frontend_question_id": "2044", "is_new_question": false @@ -12591,9 +12801,9 @@ "question__title": "Simple Bank System", "question__title_slug": "simple-bank-system", "question__hide": false, - "total_acs": 32938, - "total_submitted": 48969, - "total_column_articles": 284, + "total_acs": 33176, + "total_submitted": 49431, + "total_column_articles": 285, "frontend_question_id": "2043", "is_new_question": false }, @@ -12612,9 +12822,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": 9609, - "total_submitted": 14557, - "total_column_articles": 161, + "total_acs": 9727, + "total_submitted": 14721, + "total_column_articles": 165, "frontend_question_id": "2042", "is_new_question": false }, @@ -12633,9 +12843,9 @@ "question__title": "Number of Accounts That Did Not Stream", "question__title_slug": "number-of-accounts-that-did-not-stream", "question__hide": false, - "total_acs": 981, - "total_submitted": 1374, - "total_column_articles": 24, + "total_acs": 1015, + "total_submitted": 1426, + "total_column_articles": 25, "frontend_question_id": "2020", "is_new_question": false }, @@ -12654,8 +12864,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": 836, - "total_submitted": 1368, + "total_acs": 840, + "total_submitted": 1379, "total_column_articles": 18, "frontend_question_id": "2056", "is_new_question": false @@ -12675,9 +12885,9 @@ "question__title": "Plates Between Candles", "question__title_slug": "plates-between-candles", "question__hide": false, - "total_acs": 32399, - "total_submitted": 74723, - "total_column_articles": 415, + "total_acs": 32597, + "total_submitted": 75054, + "total_column_articles": 419, "frontend_question_id": "2055", "is_new_question": false }, @@ -12696,9 +12906,9 @@ "question__title": "Two Best Non-Overlapping Events", "question__title_slug": "two-best-non-overlapping-events", "question__hide": false, - "total_acs": 3451, - "total_submitted": 9576, - "total_column_articles": 72, + "total_acs": 3492, + "total_submitted": 9666, + "total_column_articles": 73, "frontend_question_id": "2054", "is_new_question": false }, @@ -12717,9 +12927,9 @@ "question__title": "Kth Distinct String in an Array", "question__title_slug": "kth-distinct-string-in-an-array", "question__hide": false, - "total_acs": 6601, - "total_submitted": 9106, - "total_column_articles": 111, + "total_acs": 6717, + "total_submitted": 9277, + "total_column_articles": 112, "frontend_question_id": "2053", "is_new_question": false }, @@ -12738,8 +12948,8 @@ "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": 2591, - "total_submitted": 7966, + "total_acs": 2647, + "total_submitted": 8092, "total_column_articles": 55, "frontend_question_id": "2035", "is_new_question": false @@ -12759,9 +12969,9 @@ "question__title": "Stock Price Fluctuation ", "question__title_slug": "stock-price-fluctuation", "question__hide": false, - "total_acs": 21430, - "total_submitted": 46144, - "total_column_articles": 222, + "total_acs": 21504, + "total_submitted": 46465, + "total_column_articles": 224, "frontend_question_id": "2034", "is_new_question": false }, @@ -12780,9 +12990,9 @@ "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": 5278, - "total_submitted": 12830, - "total_column_articles": 102, + "total_acs": 5316, + "total_submitted": 12899, + "total_column_articles": 103, "frontend_question_id": "2033", "is_new_question": false }, @@ -12801,9 +13011,9 @@ "question__title": "Two Out of Three", "question__title_slug": "two-out-of-three", "question__hide": false, - "total_acs": 8671, - "total_submitted": 13157, - "total_column_articles": 164, + "total_acs": 8742, + "total_submitted": 13272, + "total_column_articles": 168, "frontend_question_id": "2032", "is_new_question": false }, @@ -12822,9 +13032,9 @@ "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": 669, - "total_submitted": 1027, - "total_column_articles": 24, + "total_acs": 728, + "total_submitted": 1123, + "total_column_articles": 25, "frontend_question_id": "2010", "is_new_question": false }, @@ -12843,8 +13053,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": 1661, - "total_submitted": 4776, + "total_acs": 1675, + "total_submitted": 4808, "total_column_articles": 48, "frontend_question_id": "2030", "is_new_question": false @@ -12864,8 +13074,8 @@ "question__title": "Stone Game IX", "question__title_slug": "stone-game-ix", "question__hide": false, - "total_acs": 19507, - "total_submitted": 41434, + "total_acs": 19522, + "total_submitted": 41475, "total_column_articles": 196, "frontend_question_id": "2029", "is_new_question": false @@ -12885,9 +13095,9 @@ "question__title": "Find Missing Observations", "question__title_slug": "find-missing-observations", "question__hide": false, - "total_acs": 33064, - "total_submitted": 65256, - "total_column_articles": 382, + "total_acs": 33136, + "total_submitted": 65373, + "total_column_articles": 381, "frontend_question_id": "2028", "is_new_question": false }, @@ -12906,9 +13116,9 @@ "question__title": "Minimum Moves to Convert String", "question__title_slug": "minimum-moves-to-convert-string", "question__hide": false, - "total_acs": 7309, - "total_submitted": 12702, - "total_column_articles": 98, + "total_acs": 7399, + "total_submitted": 12846, + "total_column_articles": 100, "frontend_question_id": "2027", "is_new_question": false }, @@ -12927,8 +13137,8 @@ "question__title": "Subtree Removal Game with Fibonacci Tree", "question__title_slug": "subtree-removal-game-with-fibonacci-tree", "question__hide": false, - "total_acs": 77, - "total_submitted": 146, + "total_acs": 79, + "total_submitted": 152, "total_column_articles": 8, "frontend_question_id": "2005", "is_new_question": false @@ -12948,8 +13158,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": 663, - "total_submitted": 1590, + "total_acs": 702, + "total_submitted": 1673, "total_column_articles": 26, "frontend_question_id": "2004", "is_new_question": false @@ -12969,9 +13179,9 @@ "question__title": "The Time When the Network Becomes Idle", "question__title_slug": "the-time-when-the-network-becomes-idle", "question__hide": false, - "total_acs": 19544, - "total_submitted": 35025, - "total_column_articles": 178, + "total_acs": 19563, + "total_submitted": 35083, + "total_column_articles": 177, "frontend_question_id": "2039", "is_new_question": false }, @@ -12990,8 +13200,8 @@ "question__title": "Kth Smallest Product of Two Sorted Arrays", "question__title_slug": "kth-smallest-product-of-two-sorted-arrays", "question__hide": false, - "total_acs": 1493, - "total_submitted": 4435, + "total_acs": 1507, + "total_submitted": 4534, "total_column_articles": 27, "frontend_question_id": "2040", "is_new_question": false @@ -13011,8 +13221,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": 33606, - "total_submitted": 52795, + "total_acs": 33648, + "total_submitted": 52866, "total_column_articles": 442, "frontend_question_id": "2038", "is_new_question": false @@ -13032,8 +13242,8 @@ "question__title": "Minimum Number of Moves to Seat Everyone", "question__title_slug": "minimum-number-of-moves-to-seat-everyone", "question__hide": false, - "total_acs": 6237, - "total_submitted": 7578, + "total_acs": 6353, + "total_submitted": 7733, "total_column_articles": 99, "frontend_question_id": "2037", "is_new_question": false @@ -13053,8 +13263,8 @@ "question__title": "The Score of Students Solving Math Expression", "question__title_slug": "the-score-of-students-solving-math-expression", "question__hide": false, - "total_acs": 1488, - "total_submitted": 4094, + "total_acs": 1494, + "total_submitted": 4110, "total_column_articles": 40, "frontend_question_id": "2019", "is_new_question": false @@ -13074,8 +13284,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": 2577, - "total_submitted": 6176, + "total_acs": 2599, + "total_submitted": 6243, "total_column_articles": 57, "frontend_question_id": "2018", "is_new_question": false @@ -13095,8 +13305,8 @@ "question__title": "Grid Game", "question__title_slug": "grid-game", "question__hide": false, - "total_acs": 4812, - "total_submitted": 12933, + "total_acs": 4839, + "total_submitted": 12988, "total_column_articles": 114, "frontend_question_id": "2017", "is_new_question": false @@ -13116,9 +13326,9 @@ "question__title": "Maximum Difference Between Increasing Elements", "question__title_slug": "maximum-difference-between-increasing-elements", "question__hide": false, - "total_acs": 40860, - "total_submitted": 67989, - "total_column_articles": 466, + "total_acs": 41024, + "total_submitted": 68264, + "total_column_articles": 469, "frontend_question_id": "2016", "is_new_question": false }, @@ -13137,8 +13347,8 @@ "question__title": "Count the Number of Experiments", "question__title_slug": "count-the-number-of-experiments", "question__hide": false, - "total_acs": 1445, - "total_submitted": 3103, + "total_acs": 1493, + "total_submitted": 3196, "total_column_articles": 23, "frontend_question_id": "1990", "is_new_question": false @@ -13158,9 +13368,9 @@ "question__title": "Average Height of Buildings in Each Segment", "question__title_slug": "average-height-of-buildings-in-each-segment", "question__hide": false, - "total_acs": 206, - "total_submitted": 361, - "total_column_articles": 11, + "total_acs": 219, + "total_submitted": 390, + "total_column_articles": 12, "frontend_question_id": "2015", "is_new_question": false }, @@ -13179,8 +13389,8 @@ "question__title": "Smallest Greater Multiple Made of Two Digits", "question__title_slug": "smallest-greater-multiple-made-of-two-digits", "question__hide": false, - "total_acs": 161, - "total_submitted": 369, + "total_acs": 164, + "total_submitted": 377, "total_column_articles": 11, "frontend_question_id": "1999", "is_new_question": false @@ -13200,9 +13410,9 @@ "question__title": "Longest Subsequence Repeated k Times", "question__title_slug": "longest-subsequence-repeated-k-times", "question__hide": false, - "total_acs": 1881, - "total_submitted": 3446, - "total_column_articles": 27, + "total_acs": 1897, + "total_submitted": 3472, + "total_column_articles": 28, "frontend_question_id": "2014", "is_new_question": false }, @@ -13221,8 +13431,8 @@ "question__title": "Detect Squares", "question__title_slug": "detect-squares", "question__hide": false, - "total_acs": 19995, - "total_submitted": 35382, + "total_acs": 20024, + "total_submitted": 35445, "total_column_articles": 231, "frontend_question_id": "2013", "is_new_question": false @@ -13242,8 +13452,8 @@ "question__title": "Sum of Beauty in the Array", "question__title_slug": "sum-of-beauty-in-the-array", "question__hide": false, - "total_acs": 5098, - "total_submitted": 13496, + "total_acs": 5142, + "total_submitted": 13578, "total_column_articles": 90, "frontend_question_id": "2012", "is_new_question": false @@ -13263,9 +13473,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": 15298, - "total_submitted": 17654, - "total_column_articles": 170, + "total_acs": 15578, + "total_submitted": 17997, + "total_column_articles": 175, "frontend_question_id": "2011", "is_new_question": false }, @@ -13284,9 +13494,9 @@ "question__title": "Find Cutoff Score for Each School", "question__title_slug": "find-cutoff-score-for-each-school", "question__hide": false, - "total_acs": 2026, - "total_submitted": 3035, - "total_column_articles": 35, + "total_acs": 2159, + "total_submitted": 3248, + "total_column_articles": 36, "frontend_question_id": "1988", "is_new_question": false }, @@ -13305,8 +13515,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": 1766, - "total_submitted": 6256, + "total_acs": 1793, + "total_submitted": 6329, "total_column_articles": 50, "frontend_question_id": "2025", "is_new_question": false @@ -13326,9 +13536,9 @@ "question__title": "Maximize the Confusion of an Exam", "question__title_slug": "maximize-the-confusion-of-an-exam", "question__hide": false, - "total_acs": 34748, - "total_submitted": 60734, - "total_column_articles": 400, + "total_acs": 34973, + "total_submitted": 61210, + "total_column_articles": 403, "frontend_question_id": "2024", "is_new_question": false }, @@ -13347,9 +13557,9 @@ "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": 4599, - "total_submitted": 6223, - "total_column_articles": 79, + "total_acs": 4673, + "total_submitted": 6335, + "total_column_articles": 81, "frontend_question_id": "2023", "is_new_question": false }, @@ -13368,8 +13578,8 @@ "question__title": "Convert 1D Array Into 2D Array", "question__title_slug": "convert-1d-array-into-2d-array", "question__hide": false, - "total_acs": 36390, - "total_submitted": 54670, + "total_acs": 36514, + "total_submitted": 54913, "total_column_articles": 430, "frontend_question_id": "2022", "is_new_question": false @@ -13389,8 +13599,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": 2360, - "total_submitted": 5768, + "total_acs": 2372, + "total_submitted": 5810, "total_column_articles": 51, "frontend_question_id": "2003", "is_new_question": false @@ -13410,9 +13620,9 @@ "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": 4789, - "total_submitted": 8055, - "total_column_articles": 105, + "total_acs": 4836, + "total_submitted": 8118, + "total_column_articles": 106, "frontend_question_id": "2002", "is_new_question": false }, @@ -13431,8 +13641,8 @@ "question__title": "Number of Pairs of Interchangeable Rectangles", "question__title_slug": "number-of-pairs-of-interchangeable-rectangles", "question__hide": false, - "total_acs": 7109, - "total_submitted": 19009, + "total_acs": 7160, + "total_submitted": 19113, "total_column_articles": 146, "frontend_question_id": "2001", "is_new_question": false @@ -13452,9 +13662,9 @@ "question__title": "Reverse Prefix of Word", "question__title_slug": "reverse-prefix-of-word", "question__hide": false, - "total_acs": 32456, - "total_submitted": 41027, - "total_column_articles": 399, + "total_acs": 32646, + "total_submitted": 41289, + "total_column_articles": 401, "frontend_question_id": "2000", "is_new_question": false }, @@ -13473,8 +13683,8 @@ "question__title": "Employees Whose Manager Left the Company", "question__title_slug": "employees-whose-manager-left-the-company", "question__hide": false, - "total_acs": 1695, - "total_submitted": 3257, + "total_acs": 1739, + "total_submitted": 3344, "total_column_articles": 23, "frontend_question_id": "1978", "is_new_question": false @@ -13494,9 +13704,9 @@ "question__title": "Count Nodes Equal to Sum of Descendants", "question__title_slug": "count-nodes-equal-to-sum-of-descendants", "question__hide": false, - "total_acs": 276, - "total_submitted": 445, - "total_column_articles": 15, + "total_acs": 281, + "total_submitted": 453, + "total_column_articles": 16, "frontend_question_id": "1973", "is_new_question": false }, @@ -13515,9 +13725,9 @@ "question__title": "GCD Sort of an Array", "question__title_slug": "gcd-sort-of-an-array", "question__hide": false, - "total_acs": 2122, - "total_submitted": 4887, - "total_column_articles": 38, + "total_acs": 2138, + "total_submitted": 4910, + "total_column_articles": 39, "frontend_question_id": "1998", "is_new_question": false }, @@ -13536,9 +13746,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": 2831, - "total_submitted": 8263, - "total_column_articles": 46, + "total_acs": 2848, + "total_submitted": 8314, + "total_column_articles": 47, "frontend_question_id": "1997", "is_new_question": false }, @@ -13557,8 +13767,8 @@ "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": 27213, - "total_submitted": 65572, + "total_acs": 27310, + "total_submitted": 65824, "total_column_articles": 282, "frontend_question_id": "1996", "is_new_question": false @@ -13578,9 +13788,9 @@ "question__title": "Count Special Quadruplets", "question__title_slug": "count-special-quadruplets", "question__hide": false, - "total_acs": 34434, - "total_submitted": 51951, - "total_column_articles": 254, + "total_acs": 34520, + "total_submitted": 52099, + "total_column_articles": 255, "frontend_question_id": "1995", "is_new_question": false }, @@ -13599,9 +13809,9 @@ "question__title": "Find if Path Exists in Graph", "question__title_slug": "find-if-path-exists-in-graph", "question__hide": false, - "total_acs": 4478, - "total_submitted": 10122, - "total_column_articles": 89, + "total_acs": 4687, + "total_submitted": 10553, + "total_column_articles": 90, "frontend_question_id": "1971", "is_new_question": false }, @@ -13620,9 +13830,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": 1090, - "total_submitted": 2386, - "total_column_articles": 27, + "total_acs": 1165, + "total_submitted": 2563, + "total_column_articles": 28, "frontend_question_id": "1972", "is_new_question": false }, @@ -13641,9 +13851,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": 2024, - "total_submitted": 4846, - "total_column_articles": 53, + "total_acs": 2074, + "total_submitted": 4970, + "total_column_articles": 54, "frontend_question_id": "2009", "is_new_question": false }, @@ -13662,9 +13872,9 @@ "question__title": "Maximum Earnings From Taxi", "question__title_slug": "maximum-earnings-from-taxi", "question__hide": false, - "total_acs": 4052, - "total_submitted": 9159, - "total_column_articles": 65, + "total_acs": 4126, + "total_submitted": 9362, + "total_column_articles": 67, "frontend_question_id": "2008", "is_new_question": false }, @@ -13683,8 +13893,8 @@ "question__title": "Find Original Array From Doubled Array", "question__title_slug": "find-original-array-from-doubled-array", "question__hide": false, - "total_acs": 4998, - "total_submitted": 15112, + "total_acs": 5047, + "total_submitted": 15266, "total_column_articles": 97, "frontend_question_id": "2007", "is_new_question": false @@ -13704,9 +13914,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": 45308, - "total_submitted": 53202, - "total_column_articles": 460, + "total_acs": 45538, + "total_submitted": 53489, + "total_column_articles": 463, "frontend_question_id": "2006", "is_new_question": false }, @@ -13725,9 +13935,9 @@ "question__title": "Number of Unique Good Subsequences", "question__title_slug": "number-of-unique-good-subsequences", "question__hide": false, - "total_acs": 1865, - "total_submitted": 3843, - "total_column_articles": 31, + "total_acs": 1886, + "total_submitted": 3876, + "total_column_articles": 33, "frontend_question_id": "1987", "is_new_question": false }, @@ -13746,9 +13956,9 @@ "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": 4996, - "total_submitted": 16443, - "total_column_articles": 90, + "total_acs": 5066, + "total_submitted": 16602, + "total_column_articles": 91, "frontend_question_id": "1986", "is_new_question": false }, @@ -13767,8 +13977,8 @@ "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": 8416, - "total_submitted": 20125, + "total_acs": 8507, + "total_submitted": 20373, "total_column_articles": 123, "frontend_question_id": "1985", "is_new_question": false @@ -13788,9 +13998,9 @@ "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": 40233, - "total_submitted": 64137, - "total_column_articles": 490, + "total_acs": 40467, + "total_submitted": 64544, + "total_column_articles": 494, "frontend_question_id": "1984", "is_new_question": false }, @@ -13809,8 +14019,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": 140, - "total_submitted": 222, + "total_acs": 144, + "total_submitted": 226, "total_column_articles": 10, "frontend_question_id": "1966", "is_new_question": false @@ -13830,9 +14040,9 @@ "question__title": "Employees With Missing Information", "question__title_slug": "employees-with-missing-information", "question__hide": false, - "total_acs": 12187, - "total_submitted": 16679, - "total_column_articles": 107, + "total_acs": 13585, + "total_submitted": 18616, + "total_column_articles": 116, "frontend_question_id": "1965", "is_new_question": false }, @@ -13851,8 +14061,8 @@ "question__title": "Find Array Given Subset Sums", "question__title_slug": "find-array-given-subset-sums", "question__hide": false, - "total_acs": 1126, - "total_submitted": 2443, + "total_acs": 1133, + "total_submitted": 2457, "total_column_articles": 23, "frontend_question_id": "1982", "is_new_question": false @@ -13872,8 +14082,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": 5623, - "total_submitted": 17718, + "total_acs": 5671, + "total_submitted": 17821, "total_column_articles": 96, "frontend_question_id": "1981", "is_new_question": false @@ -13893,9 +14103,9 @@ "question__title": "Find Unique Binary String", "question__title_slug": "find-unique-binary-string", "question__hide": false, - "total_acs": 7241, - "total_submitted": 12192, - "total_column_articles": 125, + "total_acs": 7299, + "total_submitted": 12314, + "total_column_articles": 128, "frontend_question_id": "1980", "is_new_question": false }, @@ -13914,9 +14124,9 @@ "question__title": "Find Greatest Common Divisor of Array", "question__title_slug": "find-greatest-common-divisor-of-array", "question__hide": false, - "total_acs": 13575, - "total_submitted": 17370, - "total_column_articles": 190, + "total_acs": 13794, + "total_submitted": 17680, + "total_column_articles": 193, "frontend_question_id": "1979", "is_new_question": false }, @@ -13935,8 +14145,8 @@ "question__title": "The Number of Good Subsets", "question__title_slug": "the-number-of-good-subsets", "question__hide": false, - "total_acs": 15464, - "total_submitted": 27170, + "total_acs": 15511, + "total_submitted": 27241, "total_column_articles": 175, "frontend_question_id": "1994", "is_new_question": false @@ -13956,8 +14166,8 @@ "question__title": "Operations on Tree", "question__title_slug": "operations-on-tree", "question__hide": false, - "total_acs": 2527, - "total_submitted": 6483, + "total_acs": 2650, + "total_submitted": 6772, "total_column_articles": 57, "frontend_question_id": "1993", "is_new_question": false @@ -13977,9 +14187,9 @@ "question__title": "Find All Groups of Farmland", "question__title_slug": "find-all-groups-of-farmland", "question__hide": false, - "total_acs": 4389, - "total_submitted": 7360, - "total_column_articles": 94, + "total_acs": 4433, + "total_submitted": 7437, + "total_column_articles": 96, "frontend_question_id": "1992", "is_new_question": false }, @@ -13998,9 +14208,9 @@ "question__title": "Find the Middle Index in Array", "question__title_slug": "find-the-middle-index-in-array", "question__hide": false, - "total_acs": 11708, - "total_submitted": 17951, - "total_column_articles": 163, + "total_acs": 12068, + "total_submitted": 18470, + "total_column_articles": 168, "frontend_question_id": "1991", "is_new_question": false }, @@ -14019,9 +14229,9 @@ "question__title": "Last Day Where You Can Still Cross", "question__title_slug": "last-day-where-you-can-still-cross", "question__hide": false, - "total_acs": 2782, - "total_submitted": 5678, - "total_column_articles": 55, + "total_acs": 2813, + "total_submitted": 5721, + "total_column_articles": 56, "frontend_question_id": "1970", "is_new_question": false }, @@ -14040,8 +14250,8 @@ "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": 3370, - "total_submitted": 11570, + "total_acs": 3381, + "total_submitted": 11604, "total_column_articles": 50, "frontend_question_id": "1969", "is_new_question": false @@ -14061,9 +14271,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": 8813, - "total_submitted": 11149, - "total_column_articles": 120, + "total_acs": 8916, + "total_submitted": 11277, + "total_column_articles": 121, "frontend_question_id": "1967", "is_new_question": false }, @@ -14082,9 +14292,9 @@ "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": 1675, - "total_submitted": 2467, - "total_column_articles": 32, + "total_acs": 1805, + "total_submitted": 2637, + "total_column_articles": 35, "frontend_question_id": "1951", "is_new_question": false }, @@ -14103,9 +14313,9 @@ "question__title": "Strong Friendship", "question__title_slug": "strong-friendship", "question__hide": false, - "total_acs": 1403, - "total_submitted": 2573, - "total_column_articles": 27, + "total_acs": 1503, + "total_submitted": 2747, + "total_column_articles": 31, "frontend_question_id": "1949", "is_new_question": false }, @@ -14124,8 +14334,8 @@ "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": 3805, - "total_submitted": 9418, + "total_acs": 3826, + "total_submitted": 9458, "total_column_articles": 55, "frontend_question_id": "1964", "is_new_question": false @@ -14145,9 +14355,9 @@ "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": 5633, - "total_submitted": 8907, - "total_column_articles": 70, + "total_acs": 5674, + "total_submitted": 8982, + "total_column_articles": 71, "frontend_question_id": "1963", "is_new_question": false }, @@ -14166,9 +14376,9 @@ "question__title": "Remove Stones to Minimize the Total", "question__title_slug": "remove-stones-to-minimize-the-total", "question__hide": false, - "total_acs": 6919, - "total_submitted": 15268, - "total_column_articles": 92, + "total_acs": 6997, + "total_submitted": 15410, + "total_column_articles": 95, "frontend_question_id": "1962", "is_new_question": false }, @@ -14187,9 +14397,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": 9484, - "total_submitted": 17756, - "total_column_articles": 103, + "total_acs": 9580, + "total_submitted": 17969, + "total_column_articles": 106, "frontend_question_id": "1961", "is_new_question": false }, @@ -14208,8 +14418,8 @@ "question__title": "Users That Actively Request Confirmation Messages", "question__title_slug": "users-that-actively-request-confirmation-messages", "question__hide": false, - "total_acs": 1689, - "total_submitted": 2812, + "total_acs": 1736, + "total_submitted": 2906, "total_column_articles": 21, "frontend_question_id": "1939", "is_new_question": false @@ -14229,8 +14439,8 @@ "question__title": "Number of Ways to Separate Numbers", "question__title_slug": "number-of-ways-to-separate-numbers", "question__hide": false, - "total_acs": 1101, - "total_submitted": 4011, + "total_acs": 1106, + "total_submitted": 4023, "total_column_articles": 22, "frontend_question_id": "1977", "is_new_question": false @@ -14250,9 +14460,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": 3568, - "total_submitted": 11053, - "total_column_articles": 70, + "total_acs": 3613, + "total_submitted": 11203, + "total_column_articles": 71, "frontend_question_id": "1976", "is_new_question": false }, @@ -14271,8 +14481,8 @@ "question__title": "Maximum Matrix Sum", "question__title_slug": "maximum-matrix-sum", "question__hide": false, - "total_acs": 3927, - "total_submitted": 9788, + "total_acs": 3955, + "total_submitted": 9847, "total_column_articles": 55, "frontend_question_id": "1975", "is_new_question": false @@ -14292,8 +14502,8 @@ "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": 6501, - "total_submitted": 8983, + "total_acs": 6579, + "total_submitted": 9106, "total_column_articles": 101, "frontend_question_id": "1974", "is_new_question": false @@ -14313,8 +14523,8 @@ "question__title": "Confirmation Rate", "question__title_slug": "confirmation-rate", "question__hide": false, - "total_acs": 1144, - "total_submitted": 1554, + "total_acs": 1178, + "total_submitted": 1594, "total_column_articles": 27, "frontend_question_id": "1934", "is_new_question": false @@ -14334,8 +14544,8 @@ "question__title": "Count Number of Special Subsequences", "question__title_slug": "count-number-of-special-subsequences", "question__hide": false, - "total_acs": 3145, - "total_submitted": 6119, + "total_acs": 3166, + "total_submitted": 6158, "total_column_articles": 48, "frontend_question_id": "1955", "is_new_question": false @@ -14355,9 +14565,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": 5509, - "total_submitted": 14641, - "total_column_articles": 80, + "total_acs": 5560, + "total_submitted": 14738, + "total_column_articles": 81, "frontend_question_id": "1968", "is_new_question": false }, @@ -14376,8 +14586,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": 5198, - "total_submitted": 14978, + "total_acs": 5245, + "total_submitted": 15061, "total_column_articles": 93, "frontend_question_id": "1953", "is_new_question": false @@ -14397,9 +14607,9 @@ "question__title": "Three Divisors", "question__title_slug": "three-divisors", "question__hide": false, - "total_acs": 9828, - "total_submitted": 17974, - "total_column_articles": 121, + "total_acs": 9931, + "total_submitted": 18198, + "total_column_articles": 124, "frontend_question_id": "1952", "is_new_question": false }, @@ -14418,8 +14628,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": 185, - "total_submitted": 402, + "total_acs": 187, + "total_submitted": 406, "total_column_articles": 14, "frontend_question_id": "2052", "is_new_question": false @@ -14439,8 +14649,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": 1926, - "total_submitted": 4412, + "total_acs": 1949, + "total_submitted": 4446, "total_column_articles": 41, "frontend_question_id": "1959", "is_new_question": false @@ -14460,8 +14670,8 @@ "question__title": "Check if Move is Legal", "question__title_slug": "check-if-move-is-legal", "question__hide": false, - "total_acs": 2982, - "total_submitted": 6914, + "total_acs": 3000, + "total_submitted": 6942, "total_column_articles": 54, "frontend_question_id": "1958", "is_new_question": false @@ -14481,9 +14691,9 @@ "question__title": "Delete Duplicate Folders in System", "question__title_slug": "delete-duplicate-folders-in-system", "question__hide": false, - "total_acs": 1231, - "total_submitted": 2407, - "total_column_articles": 21, + "total_acs": 1272, + "total_submitted": 2460, + "total_column_articles": 23, "frontend_question_id": "1948", "is_new_question": false }, @@ -14502,8 +14712,8 @@ "question__title": "Maximum Compatibility Score Sum", "question__title_slug": "maximum-compatibility-score-sum", "question__hide": false, - "total_acs": 5168, - "total_submitted": 9188, + "total_acs": 5204, + "total_submitted": 9252, "total_column_articles": 103, "frontend_question_id": "1947", "is_new_question": false @@ -14523,8 +14733,8 @@ "question__title": "Largest Number After Mutating Substring", "question__title_slug": "largest-number-after-mutating-substring", "question__hide": false, - "total_acs": 6228, - "total_submitted": 19915, + "total_acs": 6258, + "total_submitted": 20007, "total_column_articles": 90, "frontend_question_id": "1946", "is_new_question": false @@ -14544,9 +14754,9 @@ "question__title": "Sum of Digits of String After Convert", "question__title_slug": "sum-of-digits-of-string-after-convert", "question__hide": false, - "total_acs": 8805, - "total_submitted": 13475, - "total_column_articles": 119, + "total_acs": 8873, + "total_submitted": 13577, + "total_column_articles": 120, "frontend_question_id": "1945", "is_new_question": false }, @@ -14565,8 +14775,8 @@ "question__title": "Brightest Position on Street", "question__title_slug": "brightest-position-on-street", "question__hide": false, - "total_acs": 362, - "total_submitted": 603, + "total_acs": 377, + "total_submitted": 626, "total_column_articles": 17, "frontend_question_id": "2021", "is_new_question": false @@ -14608,7 +14818,7 @@ "question__title_slug": "minimum-time-for-k-virus-variants-to-spread", "question__hide": false, "total_acs": 237, - "total_submitted": 649, + "total_submitted": 651, "total_column_articles": 14, "frontend_question_id": "1956", "is_new_question": false @@ -14628,8 +14838,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": 278, - "total_submitted": 535, + "total_acs": 285, + "total_submitted": 549, "total_column_articles": 9, "frontend_question_id": "1950", "is_new_question": false @@ -14649,8 +14859,8 @@ "question__title": "Longest Common Subsequence Between Sorted Arrays", "question__title_slug": "longest-common-subsequence-between-sorted-arrays", "question__hide": false, - "total_acs": 665, - "total_submitted": 881, + "total_acs": 668, + "total_submitted": 886, "total_column_articles": 34, "frontend_question_id": "1940", "is_new_question": false @@ -14670,8 +14880,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": 787, - "total_submitted": 1588, + "total_acs": 791, + "total_submitted": 1602, "total_column_articles": 33, "frontend_question_id": "1933", "is_new_question": false @@ -14691,8 +14901,8 @@ "question__title": "Kth Smallest Subarray Sum", "question__title_slug": "kth-smallest-subarray-sum", "question__hide": false, - "total_acs": 504, - "total_submitted": 1038, + "total_acs": 512, + "total_submitted": 1051, "total_column_articles": 9, "frontend_question_id": "1918", "is_new_question": false @@ -14712,8 +14922,8 @@ "question__title": "Maximum Genetic Difference Query", "question__title_slug": "maximum-genetic-difference-query", "question__hide": false, - "total_acs": 1392, - "total_submitted": 3772, + "total_acs": 1397, + "total_submitted": 3784, "total_column_articles": 45, "frontend_question_id": "1938", "is_new_question": false @@ -14733,9 +14943,9 @@ "question__title": "Maximum Number of Points with Cost", "question__title_slug": "maximum-number-of-points-with-cost", "question__hide": false, - "total_acs": 4081, - "total_submitted": 15297, - "total_column_articles": 73, + "total_acs": 4126, + "total_submitted": 15385, + "total_column_articles": 74, "frontend_question_id": "1937", "is_new_question": false }, @@ -14754,9 +14964,9 @@ "question__title": "Add Minimum Number of Rungs", "question__title_slug": "add-minimum-number-of-rungs", "question__hide": false, - "total_acs": 6899, - "total_submitted": 15122, - "total_column_articles": 86, + "total_acs": 6951, + "total_submitted": 15215, + "total_column_articles": 87, "frontend_question_id": "1936", "is_new_question": false }, @@ -14775,11 +14985,11 @@ "question__title": "Check for Contradictions in Equations", "question__title_slug": "check-for-contradictions-in-equations", "question__hide": false, - "total_acs": 24, - "total_submitted": 51, + "total_acs": 42, + "total_submitted": 146, "total_column_articles": 1, "frontend_question_id": "2307", - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -14796,8 +15006,8 @@ "question__title": "Leetcodify Similar Friends", "question__title_slug": "leetcodify-similar-friends", "question__hide": false, - "total_acs": 1156, - "total_submitted": 2733, + "total_acs": 1194, + "total_submitted": 2789, "total_column_articles": 32, "frontend_question_id": "1919", "is_new_question": false @@ -14817,8 +15027,8 @@ "question__title": "Leetcodify Friends Recommendations", "question__title_slug": "leetcodify-friends-recommendations", "question__hide": false, - "total_acs": 1229, - "total_submitted": 3720, + "total_acs": 1270, + "total_submitted": 3839, "total_column_articles": 20, "frontend_question_id": "1917", "is_new_question": false @@ -14838,8 +15048,8 @@ "question__title": "Game of Nim", "question__title_slug": "game-of-nim", "question__hide": false, - "total_acs": 374, - "total_submitted": 602, + "total_acs": 380, + "total_submitted": 608, "total_column_articles": 14, "frontend_question_id": "1908", "is_new_question": false @@ -14859,8 +15069,8 @@ "question__title": "Painting a Grid With Three Different Colors", "question__title_slug": "painting-a-grid-with-three-different-colors", "question__hide": false, - "total_acs": 2525, - "total_submitted": 4374, + "total_acs": 2553, + "total_submitted": 4408, "total_column_articles": 72, "frontend_question_id": "1931", "is_new_question": false @@ -14880,8 +15090,8 @@ "question__title": "Merge BSTs to Create Single BST", "question__title_slug": "merge-bsts-to-create-single-bst", "question__hide": false, - "total_acs": 1592, - "total_submitted": 4712, + "total_acs": 1614, + "total_submitted": 4773, "total_column_articles": 45, "frontend_question_id": "1932", "is_new_question": false @@ -14901,8 +15111,8 @@ "question__title": "Unique Length-3 Palindromic Subsequences", "question__title_slug": "unique-length-3-palindromic-subsequences", "question__hide": false, - "total_acs": 6594, - "total_submitted": 13374, + "total_acs": 6656, + "total_submitted": 13481, "total_column_articles": 113, "frontend_question_id": "1930", "is_new_question": false @@ -14922,9 +15132,9 @@ "question__title": "Concatenation of Array", "question__title_slug": "concatenation-of-array", "question__hide": false, - "total_acs": 26737, - "total_submitted": 30632, - "total_column_articles": 241, + "total_acs": 27166, + "total_submitted": 31135, + "total_column_articles": 246, "frontend_question_id": "1929", "is_new_question": false }, @@ -14943,9 +15153,9 @@ "question__title": "Count Salary Categories", "question__title_slug": "count-salary-categories", "question__hide": false, - "total_acs": 1577, - "total_submitted": 2611, - "total_column_articles": 35, + "total_acs": 1630, + "total_submitted": 2688, + "total_column_articles": 36, "frontend_question_id": "1907", "is_new_question": false }, @@ -14961,12 +15171,12 @@ { "stat": { "question_id": 2056, - "question__title": "Jump Game IX", - "question__title_slug": "jump-game-ix", + "question__title": "Jump Game VIII", + "question__title_slug": "jump-game-viii", "question__hide": false, - "total_acs": 55, - "total_submitted": 79, - "total_column_articles": 4, + "total_acs": 66, + "total_submitted": 98, + "total_column_articles": 5, "frontend_question_id": "2297", "is_new_question": false }, @@ -14985,9 +15195,9 @@ "question__title": "Describe the Painting", "question__title_slug": "describe-the-painting", "question__hide": false, - "total_acs": 2531, - "total_submitted": 5897, - "total_column_articles": 66, + "total_acs": 2543, + "total_submitted": 5935, + "total_column_articles": 67, "frontend_question_id": "1943", "is_new_question": false }, @@ -15006,8 +15216,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": 3887, - "total_submitted": 9556, + "total_acs": 3919, + "total_submitted": 9623, "total_column_articles": 86, "frontend_question_id": "1942", "is_new_question": false @@ -15027,9 +15237,9 @@ "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": 8559, - "total_submitted": 11538, - "total_column_articles": 138, + "total_acs": 8709, + "total_submitted": 11739, + "total_column_articles": 137, "frontend_question_id": "1941", "is_new_question": false }, @@ -15048,8 +15258,8 @@ "question__title": "Depth of BST Given Insertion Order", "question__title_slug": "depth-of-bst-given-insertion-order", "question__hide": false, - "total_acs": 265, - "total_submitted": 534, + "total_acs": 277, + "total_submitted": 549, "total_column_articles": 7, "frontend_question_id": "1902", "is_new_question": false @@ -15069,8 +15279,8 @@ "question__title": "Longest Common Subpath", "question__title_slug": "longest-common-subpath", "question__hide": false, - "total_acs": 2022, - "total_submitted": 7993, + "total_acs": 2037, + "total_submitted": 8044, "total_column_articles": 38, "frontend_question_id": "1923", "is_new_question": false @@ -15090,9 +15300,9 @@ "question__title": "Count Good Numbers", "question__title_slug": "count-good-numbers", "question__hide": false, - "total_acs": 5655, - "total_submitted": 15592, - "total_column_articles": 87, + "total_acs": 5698, + "total_submitted": 15689, + "total_column_articles": 88, "frontend_question_id": "1922", "is_new_question": false }, @@ -15111,8 +15321,8 @@ "question__title": "Eliminate Maximum Number of Monsters", "question__title_slug": "eliminate-maximum-number-of-monsters", "question__hide": false, - "total_acs": 6805, - "total_submitted": 19065, + "total_acs": 6875, + "total_submitted": 19214, "total_column_articles": 111, "frontend_question_id": "1921", "is_new_question": false @@ -15132,9 +15342,9 @@ "question__title": "Build Array from Permutation", "question__title_slug": "build-array-from-permutation", "question__hide": false, - "total_acs": 23676, - "total_submitted": 27065, - "total_column_articles": 214, + "total_acs": 24062, + "total_submitted": 27519, + "total_column_articles": 220, "frontend_question_id": "1920", "is_new_question": false }, @@ -15153,9 +15363,9 @@ "question__title": "Find a Peak Element II", "question__title_slug": "find-a-peak-element-ii", "question__hide": false, - "total_acs": 4149, - "total_submitted": 6933, - "total_column_articles": 87, + "total_acs": 4302, + "total_submitted": 7263, + "total_column_articles": 89, "frontend_question_id": "1901", "is_new_question": false }, @@ -15174,8 +15384,8 @@ "question__title": "Page Recommendations II", "question__title_slug": "page-recommendations-ii", "question__hide": false, - "total_acs": 1351, - "total_submitted": 3749, + "total_acs": 1391, + "total_submitted": 3860, "total_column_articles": 26, "frontend_question_id": "1892", "is_new_question": false @@ -15195,9 +15405,9 @@ "question__title": "Cutting Ribbons", "question__title_slug": "cutting-ribbons", "question__hide": false, - "total_acs": 3410, - "total_submitted": 8313, - "total_column_articles": 40, + "total_acs": 3465, + "total_submitted": 8470, + "total_column_articles": 41, "frontend_question_id": "1891", "is_new_question": false }, @@ -15216,8 +15426,8 @@ "question__title": "Number of Wonderful Substrings", "question__title_slug": "number-of-wonderful-substrings", "question__hide": false, - "total_acs": 3508, - "total_submitted": 8561, + "total_acs": 3526, + "total_submitted": 8610, "total_column_articles": 64, "frontend_question_id": "1915", "is_new_question": false @@ -15237,8 +15447,8 @@ "question__title": "Cyclically Rotating a Grid", "question__title_slug": "cyclically-rotating-a-grid", "question__hide": false, - "total_acs": 3690, - "total_submitted": 8187, + "total_acs": 3708, + "total_submitted": 8211, "total_column_articles": 79, "frontend_question_id": "1914", "is_new_question": false @@ -15258,9 +15468,9 @@ "question__title": "Maximum Product Difference Between Two Pairs", "question__title_slug": "maximum-product-difference-between-two-pairs", "question__hide": false, - "total_acs": 13914, - "total_submitted": 16847, - "total_column_articles": 173, + "total_acs": 14107, + "total_submitted": 17081, + "total_column_articles": 175, "frontend_question_id": "1913", "is_new_question": false }, @@ -15279,9 +15489,9 @@ "question__title": "The Latest Login in 2020", "question__title_slug": "the-latest-login-in-2020", "question__hide": false, - "total_acs": 8315, - "total_submitted": 11372, - "total_column_articles": 64, + "total_acs": 9133, + "total_submitted": 12519, + "total_column_articles": 69, "frontend_question_id": "1890", "is_new_question": false }, @@ -15300,9 +15510,9 @@ "question__title": "Minimum Cost to Reach Destination in Time", "question__title_slug": "minimum-cost-to-reach-destination-in-time", "question__hide": false, - "total_acs": 3540, - "total_submitted": 8371, - "total_column_articles": 59, + "total_acs": 3597, + "total_submitted": 8501, + "total_column_articles": 61, "frontend_question_id": "1928", "is_new_question": false }, @@ -15321,8 +15531,8 @@ "question__title": "Sum Game", "question__title_slug": "sum-game", "question__hide": false, - "total_acs": 2380, - "total_submitted": 5601, + "total_acs": 2403, + "total_submitted": 5644, "total_column_articles": 50, "frontend_question_id": "1927", "is_new_question": false @@ -15342,8 +15552,8 @@ "question__title": "Nearest Exit from Entrance in Maze", "question__title_slug": "nearest-exit-from-entrance-in-maze", "question__hide": false, - "total_acs": 6699, - "total_submitted": 17423, + "total_acs": 6877, + "total_submitted": 17848, "total_column_articles": 119, "frontend_question_id": "1926", "is_new_question": false @@ -15363,8 +15573,8 @@ "question__title": "Count Square Sum Triples", "question__title_slug": "count-square-sum-triples", "question__hide": false, - "total_acs": 8289, - "total_submitted": 11900, + "total_acs": 8375, + "total_submitted": 12022, "total_column_articles": 98, "frontend_question_id": "1925", "is_new_question": false @@ -15384,8 +15594,8 @@ "question__title": "Count Pairs in Two Arrays", "question__title_slug": "count-pairs-in-two-arrays", "question__hide": false, - "total_acs": 770, - "total_submitted": 1355, + "total_acs": 804, + "total_submitted": 1422, "total_column_articles": 25, "frontend_question_id": "1885", "is_new_question": false @@ -15405,9 +15615,9 @@ "question__title": "Count Sub Islands", "question__title_slug": "count-sub-islands", "question__hide": false, - "total_acs": 14615, - "total_submitted": 22221, - "total_column_articles": 263, + "total_acs": 15114, + "total_submitted": 22908, + "total_column_articles": 271, "frontend_question_id": "1905", "is_new_question": false }, @@ -15426,8 +15636,8 @@ "question__title": "Minimum Absolute Difference Queries", "question__title_slug": "minimum-absolute-difference-queries", "question__hide": false, - "total_acs": 3069, - "total_submitted": 7168, + "total_acs": 3099, + "total_submitted": 7239, "total_column_articles": 62, "frontend_question_id": "1906", "is_new_question": false @@ -15447,9 +15657,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": 4640, - "total_submitted": 15403, - "total_column_articles": 90, + "total_acs": 4677, + "total_submitted": 15507, + "total_column_articles": 91, "frontend_question_id": "1904", "is_new_question": false }, @@ -15468,9 +15678,9 @@ "question__title": "Largest Odd Number in String", "question__title_slug": "largest-odd-number-in-string", "question__hide": false, - "total_acs": 11486, - "total_submitted": 18477, - "total_column_articles": 148, + "total_acs": 11645, + "total_submitted": 18716, + "total_column_articles": 149, "frontend_question_id": "1903", "is_new_question": false }, @@ -15489,9 +15699,9 @@ "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": 5042, - "total_submitted": 7281, - "total_column_articles": 81, + "total_acs": 5160, + "total_submitted": 7429, + "total_column_articles": 82, "frontend_question_id": "1884", "is_new_question": false }, @@ -15510,8 +15720,8 @@ "question__title": "Group Employees of the Same Salary", "question__title_slug": "group-employees-of-the-same-salary", "question__hide": false, - "total_acs": 1345, - "total_submitted": 2051, + "total_acs": 1394, + "total_submitted": 2135, "total_column_articles": 36, "frontend_question_id": "1875", "is_new_question": false @@ -15531,8 +15741,8 @@ "question__title": "Minimize Product Sum of Two Arrays", "question__title_slug": "minimize-product-sum-of-two-arrays", "question__hide": false, - "total_acs": 720, - "total_submitted": 839, + "total_acs": 738, + "total_submitted": 860, "total_column_articles": 28, "frontend_question_id": "1874", "is_new_question": false @@ -15552,8 +15762,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": 1523, - "total_submitted": 3366, + "total_acs": 1526, + "total_submitted": 3370, "total_column_articles": 42, "frontend_question_id": "1900", "is_new_question": false @@ -15573,9 +15783,9 @@ "question__title": "Maximum Number of Removable Characters", "question__title_slug": "maximum-number-of-removable-characters", "question__hide": false, - "total_acs": 5887, - "total_submitted": 17048, - "total_column_articles": 88, + "total_acs": 6009, + "total_submitted": 17350, + "total_column_articles": 89, "frontend_question_id": "1898", "is_new_question": false }, @@ -15594,8 +15804,8 @@ "question__title": "Merge Triplets to Form Target Triplet", "question__title_slug": "merge-triplets-to-form-target-triplet", "question__hide": false, - "total_acs": 4451, - "total_submitted": 6957, + "total_acs": 4475, + "total_submitted": 6999, "total_column_articles": 56, "frontend_question_id": "1899", "is_new_question": false @@ -15615,9 +15825,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": 8402, - "total_submitted": 15273, - "total_column_articles": 106, + "total_acs": 8500, + "total_submitted": 15430, + "total_column_articles": 108, "frontend_question_id": "1897", "is_new_question": false }, @@ -15636,9 +15846,9 @@ "question__title": "Calculate Special Bonus", "question__title_slug": "calculate-special-bonus", "question__hide": false, - "total_acs": 22917, - "total_submitted": 31508, - "total_column_articles": 154, + "total_acs": 25463, + "total_submitted": 36251, + "total_column_articles": 162, "frontend_question_id": "1873", "is_new_question": false }, @@ -15657,8 +15867,8 @@ "question__title": "Design Movie Rental System", "question__title_slug": "design-movie-rental-system", "question__hide": false, - "total_acs": 3171, - "total_submitted": 13564, + "total_acs": 3239, + "total_submitted": 13946, "total_column_articles": 64, "frontend_question_id": "1912", "is_new_question": false @@ -15678,8 +15888,8 @@ "question__title": "Maximum Alternating Subsequence Sum", "question__title_slug": "maximum-alternating-subsequence-sum", "question__hide": false, - "total_acs": 4908, - "total_submitted": 8550, + "total_acs": 4956, + "total_submitted": 8645, "total_column_articles": 91, "frontend_question_id": "1911", "is_new_question": false @@ -15699,9 +15909,9 @@ "question__title": "Remove All Occurrences of a Substring", "question__title_slug": "remove-all-occurrences-of-a-substring", "question__hide": false, - "total_acs": 5036, - "total_submitted": 7545, - "total_column_articles": 94, + "total_acs": 5088, + "total_submitted": 7624, + "total_column_articles": 96, "frontend_question_id": "1910", "is_new_question": false }, @@ -15720,9 +15930,9 @@ "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": 7150, - "total_submitted": 22887, - "total_column_articles": 118, + "total_acs": 7248, + "total_submitted": 23289, + "total_column_articles": 119, "frontend_question_id": "1909", "is_new_question": false }, @@ -15741,9 +15951,9 @@ "question__title": "Product of Two Run-Length Encoded Arrays", "question__title_slug": "product-of-two-run-length-encoded-arrays", "question__hide": false, - "total_acs": 1317, - "total_submitted": 2420, - "total_column_articles": 36, + "total_acs": 1484, + "total_submitted": 3094, + "total_column_articles": 37, "frontend_question_id": "1868", "is_new_question": false }, @@ -15762,8 +15972,8 @@ "question__title": "Minimum Space Wasted From Packaging", "question__title_slug": "minimum-space-wasted-from-packaging", "question__hide": false, - "total_acs": 2792, - "total_submitted": 10025, + "total_acs": 2825, + "total_submitted": 10113, "total_column_articles": 53, "frontend_question_id": "1889", "is_new_question": false @@ -15783,8 +15993,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": 3346, - "total_submitted": 9901, + "total_acs": 3374, + "total_submitted": 9965, "total_column_articles": 77, "frontend_question_id": "1888", "is_new_question": false @@ -15804,9 +16014,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": 6269, - "total_submitted": 9664, - "total_column_articles": 89, + "total_acs": 6333, + "total_submitted": 9754, + "total_column_articles": 91, "frontend_question_id": "1887", "is_new_question": false }, @@ -15825,8 +16035,8 @@ "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": 8005, - "total_submitted": 13653, + "total_acs": 8117, + "total_submitted": 13846, "total_column_articles": 130, "frontend_question_id": "1886", "is_new_question": false @@ -15846,9 +16056,9 @@ "question__title": "Orders With Maximum Quantity Above Average", "question__title_slug": "orders-with-maximum-quantity-above-average", "question__hide": false, - "total_acs": 2208, - "total_submitted": 3084, - "total_column_articles": 31, + "total_acs": 2352, + "total_submitted": 3297, + "total_column_articles": 33, "frontend_question_id": "1867", "is_new_question": false }, @@ -15867,8 +16077,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": 2043, - "total_submitted": 5226, + "total_acs": 2055, + "total_submitted": 5253, "total_column_articles": 33, "frontend_question_id": "1883", "is_new_question": false @@ -15888,8 +16098,8 @@ "question__title": "Process Tasks Using Servers", "question__title_slug": "process-tasks-using-servers", "question__hide": false, - "total_acs": 4477, - "total_submitted": 15458, + "total_acs": 4515, + "total_submitted": 15643, "total_column_articles": 130, "frontend_question_id": "1882", "is_new_question": false @@ -15909,9 +16119,9 @@ "question__title": "Maximum Value after Insertion", "question__title_slug": "maximum-value-after-insertion", "question__hide": false, - "total_acs": 7493, - "total_submitted": 20353, - "total_column_articles": 79, + "total_acs": 7543, + "total_submitted": 20512, + "total_column_articles": 80, "frontend_question_id": "1881", "is_new_question": false }, @@ -15930,9 +16140,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": 9732, - "total_submitted": 12675, - "total_column_articles": 151, + "total_acs": 9871, + "total_submitted": 12859, + "total_column_articles": 153, "frontend_question_id": "1880", "is_new_question": false }, @@ -15951,8 +16161,8 @@ "question__title": "Longest Word With All Prefixes", "question__title_slug": "longest-word-with-all-prefixes", "question__hide": false, - "total_acs": 749, - "total_submitted": 1132, + "total_acs": 769, + "total_submitted": 1162, "total_column_articles": 31, "frontend_question_id": "1858", "is_new_question": false @@ -15972,8 +16182,8 @@ "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": 1068, - "total_submitted": 2053, + "total_acs": 1078, + "total_submitted": 2067, "total_column_articles": 35, "frontend_question_id": "1896", "is_new_question": false @@ -15993,8 +16203,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": 91, - "total_submitted": 152, + "total_acs": 99, + "total_submitted": 168, "total_column_articles": 9, "frontend_question_id": "2247", "is_new_question": false @@ -16014,9 +16224,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": 42420, - "total_submitted": 92513, - "total_column_articles": 558, + "total_acs": 42914, + "total_submitted": 93517, + "total_column_articles": 562, "frontend_question_id": "1894", "is_new_question": false }, @@ -16035,9 +16245,9 @@ "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": 35203, - "total_submitted": 59574, - "total_column_articles": 464, + "total_acs": 35602, + "total_submitted": 60180, + "total_column_articles": 467, "frontend_question_id": "1893", "is_new_question": false }, @@ -16056,9 +16266,9 @@ "question__title": "Convert Date Format", "question__title_slug": "convert-date-format", "question__hide": false, - "total_acs": 2324, - "total_submitted": 3740, - "total_column_articles": 28, + "total_acs": 2372, + "total_submitted": 3805, + "total_column_articles": 29, "frontend_question_id": "1853", "is_new_question": false }, @@ -16077,8 +16287,8 @@ "question__title": "Distinct Numbers in Each Subarray", "question__title_slug": "distinct-numbers-in-each-subarray", "question__hide": false, - "total_acs": 589, - "total_submitted": 1045, + "total_acs": 604, + "total_submitted": 1064, "total_column_articles": 18, "frontend_question_id": "1852", "is_new_question": false @@ -16098,8 +16308,8 @@ "question__title": "Stone Game VIII", "question__title_slug": "stone-game-viii", "question__hide": false, - "total_acs": 2675, - "total_submitted": 4297, + "total_acs": 2688, + "total_submitted": 4326, "total_column_articles": 35, "frontend_question_id": "1872", "is_new_question": false @@ -16119,9 +16329,9 @@ "question__title": "Jump Game VII", "question__title_slug": "jump-game-vii", "question__hide": false, - "total_acs": 7604, - "total_submitted": 26877, - "total_column_articles": 147, + "total_acs": 7644, + "total_submitted": 27029, + "total_column_articles": 148, "frontend_question_id": "1871", "is_new_question": false }, @@ -16140,9 +16350,9 @@ "question__title": "Minimum Speed to Arrive on Time", "question__title_slug": "minimum-speed-to-arrive-on-time", "question__hide": false, - "total_acs": 9730, - "total_submitted": 22394, - "total_column_articles": 101, + "total_acs": 9948, + "total_submitted": 22932, + "total_column_articles": 105, "frontend_question_id": "1870", "is_new_question": false }, @@ -16161,9 +16371,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": 15012, - "total_submitted": 20033, - "total_column_articles": 191, + "total_acs": 15122, + "total_submitted": 20220, + "total_column_articles": 193, "frontend_question_id": "1869", "is_new_question": false }, @@ -16182,8 +16392,8 @@ "question__title": "Suspicious Bank Accounts", "question__title_slug": "suspicious-bank-accounts", "question__hide": false, - "total_acs": 1670, - "total_submitted": 3548, + "total_acs": 1730, + "total_submitted": 3675, "total_column_articles": 37, "frontend_question_id": "1843", "is_new_question": false @@ -16203,8 +16413,8 @@ "question__title": "Next Palindrome Using Same Digits", "question__title_slug": "next-palindrome-using-same-digits", "question__hide": false, - "total_acs": 224, - "total_submitted": 381, + "total_acs": 227, + "total_submitted": 387, "total_column_articles": 18, "frontend_question_id": "1842", "is_new_question": false @@ -16224,8 +16434,8 @@ "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": 2904, - "total_submitted": 4725, + "total_acs": 2937, + "total_submitted": 4768, "total_column_articles": 61, "frontend_question_id": "1866", "is_new_question": false @@ -16245,8 +16455,8 @@ "question__title": "Finding Pairs With a Certain Sum", "question__title_slug": "finding-pairs-with-a-certain-sum", "question__hide": false, - "total_acs": 6207, - "total_submitted": 12220, + "total_acs": 6247, + "total_submitted": 12298, "total_column_articles": 73, "frontend_question_id": "1865", "is_new_question": false @@ -16266,9 +16476,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": 5471, - "total_submitted": 13793, - "total_column_articles": 123, + "total_acs": 5539, + "total_submitted": 13934, + "total_column_articles": 124, "frontend_question_id": "1864", "is_new_question": false }, @@ -16287,9 +16497,9 @@ "question__title": "Sum of All Subset XOR Totals", "question__title_slug": "sum-of-all-subset-xor-totals", "question__hide": false, - "total_acs": 17726, - "total_submitted": 20631, - "total_column_articles": 224, + "total_acs": 17888, + "total_submitted": 20847, + "total_column_articles": 225, "frontend_question_id": "1863", "is_new_question": false }, @@ -16308,8 +16518,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": 488, - "total_submitted": 769, + "total_acs": 495, + "total_submitted": 780, "total_column_articles": 27, "frontend_question_id": "2046", "is_new_question": false @@ -16329,9 +16539,9 @@ "question__title": "League Statistics", "question__title_slug": "league-statistics", "question__hide": false, - "total_acs": 1906, - "total_submitted": 3585, - "total_column_articles": 51, + "total_acs": 1947, + "total_submitted": 3660, + "total_column_articles": 54, "frontend_question_id": "1841", "is_new_question": false }, @@ -16350,8 +16560,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": 2583, - "total_submitted": 5808, + "total_acs": 2593, + "total_submitted": 5828, "total_column_articles": 65, "frontend_question_id": "1878", "is_new_question": false @@ -16371,8 +16581,8 @@ "question__title": "Minimum XOR Sum of Two Arrays", "question__title_slug": "minimum-xor-sum-of-two-arrays", "question__hide": false, - "total_acs": 2820, - "total_submitted": 6152, + "total_acs": 2857, + "total_submitted": 6211, "total_column_articles": 50, "frontend_question_id": "1879", "is_new_question": false @@ -16392,9 +16602,9 @@ "question__title": "Minimize Maximum Pair Sum in Array", "question__title_slug": "minimize-maximum-pair-sum-in-array", "question__hide": false, - "total_acs": 34697, - "total_submitted": 42628, - "total_column_articles": 438, + "total_acs": 34830, + "total_submitted": 42781, + "total_column_articles": 439, "frontend_question_id": "1877", "is_new_question": false }, @@ -16413,9 +16623,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": 10813, - "total_submitted": 15163, - "total_column_articles": 174, + "total_acs": 11053, + "total_submitted": 15473, + "total_column_articles": 177, "frontend_question_id": "1876", "is_new_question": false }, @@ -16434,8 +16644,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": 2937, - "total_submitted": 6264, + "total_acs": 2961, + "total_submitted": 6330, "total_column_articles": 46, "frontend_question_id": "1857", "is_new_question": false @@ -16455,8 +16665,8 @@ "question__title": "Maximum Subarray Min-Product", "question__title_slug": "maximum-subarray-min-product", "question__hide": false, - "total_acs": 6454, - "total_submitted": 17752, + "total_acs": 6526, + "total_submitted": 17958, "total_column_articles": 111, "frontend_question_id": "1856", "is_new_question": false @@ -16476,9 +16686,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": 15434, - "total_submitted": 24594, - "total_column_articles": 185, + "total_acs": 15794, + "total_submitted": 25261, + "total_column_articles": 186, "frontend_question_id": "1855", "is_new_question": false }, @@ -16497,9 +16707,9 @@ "question__title": "Maximum Population Year", "question__title_slug": "maximum-population-year", "question__hide": false, - "total_acs": 14417, - "total_submitted": 19204, - "total_column_articles": 170, + "total_acs": 14577, + "total_submitted": 19450, + "total_column_articles": 174, "frontend_question_id": "1854", "is_new_question": false }, @@ -16518,9 +16728,9 @@ "question__title": "Remove Duplicates From an Unsorted Linked List", "question__title_slug": "remove-duplicates-from-an-unsorted-linked-list", "question__hide": false, - "total_acs": 1079, - "total_submitted": 1462, - "total_column_articles": 49, + "total_acs": 1121, + "total_submitted": 1513, + "total_column_articles": 51, "frontend_question_id": "1836", "is_new_question": false }, @@ -16539,9 +16749,9 @@ "question__title": "Maximum Transaction Each Day", "question__title_slug": "maximum-transaction-each-day", "question__hide": false, - "total_acs": 2273, - "total_submitted": 2923, - "total_column_articles": 41, + "total_acs": 2379, + "total_submitted": 3055, + "total_column_articles": 43, "frontend_question_id": "1831", "is_new_question": false }, @@ -16560,8 +16770,8 @@ "question__title": "Faulty Sensor", "question__title_slug": "faulty-sensor", "question__hide": false, - "total_acs": 540, - "total_submitted": 1298, + "total_acs": 554, + "total_submitted": 1335, "total_column_articles": 32, "frontend_question_id": "1826", "is_new_question": false @@ -16581,8 +16791,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": 148, - "total_submitted": 275, + "total_acs": 151, + "total_submitted": 280, "total_column_articles": 8, "frontend_question_id": "1989", "is_new_question": false @@ -16602,9 +16812,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": 2870, - "total_submitted": 4668, - "total_column_articles": 54, + "total_acs": 2898, + "total_submitted": 4708, + "total_column_articles": 56, "frontend_question_id": "1850", "is_new_question": false }, @@ -16623,9 +16833,9 @@ "question__title": "Minimum Interval to Include Each Query", "question__title_slug": "minimum-interval-to-include-each-query", "question__hide": false, - "total_acs": 2571, - "total_submitted": 6128, - "total_column_articles": 58, + "total_acs": 2601, + "total_submitted": 6181, + "total_column_articles": 59, "frontend_question_id": "1851", "is_new_question": false }, @@ -16644,9 +16854,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": 6496, - "total_submitted": 19762, - "total_column_articles": 127, + "total_acs": 6535, + "total_submitted": 19877, + "total_column_articles": 128, "frontend_question_id": "1849", "is_new_question": false }, @@ -16665,8 +16875,8 @@ "question__title": "Minimum Distance to the Target Element", "question__title_slug": "minimum-distance-to-the-target-element", "question__hide": false, - "total_acs": 10395, - "total_submitted": 15400, + "total_acs": 10533, + "total_submitted": 15587, "total_column_articles": 135, "frontend_question_id": "1848", "is_new_question": false @@ -16686,9 +16896,9 @@ "question__title": "Find Customers With Positive Revenue this Year", "question__title_slug": "find-customers-with-positive-revenue-this-year", "question__hide": false, - "total_acs": 4294, - "total_submitted": 4765, - "total_column_articles": 32, + "total_acs": 4363, + "total_submitted": 4852, + "total_column_articles": 33, "frontend_question_id": "1821", "is_new_question": false }, @@ -16707,9 +16917,9 @@ "question__title": "Rotating the Box", "question__title_slug": "rotating-the-box", "question__hide": false, - "total_acs": 4603, - "total_submitted": 7301, - "total_column_articles": 91, + "total_acs": 4688, + "total_submitted": 7443, + "total_column_articles": 93, "frontend_question_id": "1861", "is_new_question": false }, @@ -16728,9 +16938,9 @@ "question__title": "Incremental Memory Leak", "question__title_slug": "incremental-memory-leak", "question__hide": false, - "total_acs": 5216, - "total_submitted": 6805, - "total_column_articles": 101, + "total_acs": 5268, + "total_submitted": 6876, + "total_column_articles": 103, "frontend_question_id": "1860", "is_new_question": false }, @@ -16749,9 +16959,9 @@ "question__title": "Sorting the Sentence", "question__title_slug": "sorting-the-sentence", "question__hide": false, - "total_acs": 10577, - "total_submitted": 14066, - "total_column_articles": 218, + "total_acs": 10742, + "total_submitted": 14296, + "total_column_articles": 222, "frontend_question_id": "1859", "is_new_question": false }, @@ -16770,8 +16980,8 @@ "question__title": "Maximum Number of Accepted Invitations", "question__title_slug": "maximum-number-of-accepted-invitations", "question__hide": false, - "total_acs": 239, - "total_submitted": 512, + "total_acs": 246, + "total_submitted": 528, "total_column_articles": 15, "frontend_question_id": "1820", "is_new_question": false @@ -16791,9 +17001,9 @@ "question__title": "Maximum Building Height", "question__title_slug": "maximum-building-height", "question__hide": false, - "total_acs": 2339, - "total_submitted": 5915, - "total_column_articles": 55, + "total_acs": 2364, + "total_submitted": 5990, + "total_column_articles": 56, "frontend_question_id": "1840", "is_new_question": false }, @@ -16812,9 +17022,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": 8661, - "total_submitted": 16081, - "total_column_articles": 164, + "total_acs": 8808, + "total_submitted": 16477, + "total_column_articles": 167, "frontend_question_id": "1839", "is_new_question": false }, @@ -16833,9 +17043,9 @@ "question__title": "Frequency of the Most Frequent Element", "question__title_slug": "frequency-of-the-most-frequent-element", "question__hide": false, - "total_acs": 33047, - "total_submitted": 77132, - "total_column_articles": 343, + "total_acs": 33214, + "total_submitted": 77505, + "total_column_articles": 345, "frontend_question_id": "1838", "is_new_question": false }, @@ -16854,9 +17064,9 @@ "question__title": "Sum of Digits in Base K", "question__title_slug": "sum-of-digits-in-base-k", "question__hide": false, - "total_acs": 10565, - "total_submitted": 13325, - "total_column_articles": 136, + "total_acs": 10679, + "total_submitted": 13458, + "total_column_articles": 137, "frontend_question_id": "1837", "is_new_question": false }, @@ -16875,8 +17085,8 @@ "question__title": "Find Interview Candidates", "question__title_slug": "find-interview-candidates", "question__hide": false, - "total_acs": 2094, - "total_submitted": 3269, + "total_acs": 2171, + "total_submitted": 3381, "total_column_articles": 46, "frontend_question_id": "1811", "is_new_question": false @@ -16896,8 +17106,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": 4144, - "total_submitted": 7867, + "total_acs": 4171, + "total_submitted": 7908, "total_column_articles": 66, "frontend_question_id": "1835", "is_new_question": false @@ -16917,9 +17127,9 @@ "question__title": "Single-Threaded CPU", "question__title_slug": "single-threaded-cpu", "question__hide": false, - "total_acs": 7984, - "total_submitted": 21834, - "total_column_articles": 149, + "total_acs": 8099, + "total_submitted": 22105, + "total_column_articles": 150, "frontend_question_id": "1834", "is_new_question": false }, @@ -16938,9 +17148,9 @@ "question__title": "Maximum Ice Cream Bars", "question__title_slug": "maximum-ice-cream-bars", "question__hide": false, - "total_acs": 46130, - "total_submitted": 67636, - "total_column_articles": 419, + "total_acs": 46254, + "total_submitted": 67864, + "total_column_articles": 421, "frontend_question_id": "1833", "is_new_question": false }, @@ -16959,9 +17169,9 @@ "question__title": "Check if the Sentence Is Pangram", "question__title_slug": "check-if-the-sentence-is-pangram", "question__hide": false, - "total_acs": 18340, - "total_submitted": 22332, - "total_column_articles": 295, + "total_acs": 18638, + "total_submitted": 22696, + "total_column_articles": 297, "frontend_question_id": "1832", "is_new_question": false }, @@ -16980,8 +17190,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": 299, - "total_submitted": 480, + "total_acs": 300, + "total_submitted": 482, "total_column_articles": 8, "frontend_question_id": "1810", "is_new_question": false @@ -17001,9 +17211,9 @@ "question__title": "Ad-Free Sessions", "question__title_slug": "ad-free-sessions", "question__hide": false, - "total_acs": 3237, - "total_submitted": 5272, - "total_column_articles": 46, + "total_acs": 3280, + "total_submitted": 5329, + "total_column_articles": 47, "frontend_question_id": "1809", "is_new_question": false }, @@ -17022,9 +17232,9 @@ "question__title": "Closest Room", "question__title_slug": "closest-room", "question__hide": false, - "total_acs": 3058, - "total_submitted": 8078, - "total_column_articles": 53, + "total_acs": 3102, + "total_submitted": 8167, + "total_column_articles": 54, "frontend_question_id": "1847", "is_new_question": false }, @@ -17043,9 +17253,9 @@ "question__title": "Maximum Element After Decreasing and Rearranging", "question__title_slug": "maximum-element-after-decreasing-and-rearranging", "question__hide": false, - "total_acs": 29134, - "total_submitted": 46111, - "total_column_articles": 390, + "total_acs": 29208, + "total_submitted": 46232, + "total_column_articles": 391, "frontend_question_id": "1846", "is_new_question": false }, @@ -17064,9 +17274,9 @@ "question__title": "Seat Reservation Manager", "question__title_slug": "seat-reservation-manager", "question__hide": false, - "total_acs": 11098, - "total_submitted": 22906, - "total_column_articles": 112, + "total_acs": 11373, + "total_submitted": 23610, + "total_column_articles": 117, "frontend_question_id": "1845", "is_new_question": false }, @@ -17085,9 +17295,9 @@ "question__title": "Replace All Digits with Characters", "question__title_slug": "replace-all-digits-with-characters", "question__hide": false, - "total_acs": 9718, - "total_submitted": 12236, - "total_column_articles": 165, + "total_acs": 9840, + "total_submitted": 12411, + "total_column_articles": 167, "frontend_question_id": "1844", "is_new_question": false }, @@ -17106,9 +17316,9 @@ "question__title": "Finding MK Average", "question__title_slug": "finding-mk-average", "question__hide": false, - "total_acs": 3025, - "total_submitted": 10381, - "total_column_articles": 66, + "total_acs": 3048, + "total_submitted": 10444, + "total_column_articles": 67, "frontend_question_id": "1825", "is_new_question": false }, @@ -17127,9 +17337,9 @@ "question__title": "Minimum Sideway Jumps", "question__title_slug": "minimum-sideway-jumps", "question__hide": false, - "total_acs": 8852, - "total_submitted": 13776, - "total_column_articles": 173, + "total_acs": 8900, + "total_submitted": 13861, + "total_column_articles": 174, "frontend_question_id": "1824", "is_new_question": false }, @@ -17148,9 +17358,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": 45387, - "total_submitted": 57507, - "total_column_articles": 500, + "total_acs": 45790, + "total_submitted": 58022, + "total_column_articles": 503, "frontend_question_id": "1823", "is_new_question": false }, @@ -17169,9 +17379,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": 30563, - "total_submitted": 40871, - "total_column_articles": 345, + "total_acs": 31029, + "total_submitted": 41589, + "total_column_articles": 350, "frontend_question_id": "1822", "is_new_question": false }, @@ -17190,9 +17400,9 @@ "question__title": "Implement Trie II (Prefix Tree)", "question__title_slug": "implement-trie-ii-prefix-tree", "question__hide": false, - "total_acs": 1344, - "total_submitted": 2366, - "total_column_articles": 50, + "total_acs": 1382, + "total_submitted": 2428, + "total_column_articles": 51, "frontend_question_id": "1804", "is_new_question": false }, @@ -17211,9 +17421,9 @@ "question__title": "Rearrange Products Table", "question__title_slug": "rearrange-products-table", "question__hide": false, - "total_acs": 11648, - "total_submitted": 14694, - "total_column_articles": 77, + "total_acs": 12907, + "total_submitted": 16303, + "total_column_articles": 82, "frontend_question_id": "1795", "is_new_question": false }, @@ -17232,8 +17442,8 @@ "question__title": "Number of Different Subsequences GCDs", "question__title_slug": "number-of-different-subsequences-gcds", "question__hide": false, - "total_acs": 3040, - "total_submitted": 7537, + "total_acs": 3063, + "total_submitted": 7590, "total_column_articles": 37, "frontend_question_id": "1819", "is_new_question": false @@ -17253,9 +17463,9 @@ "question__title": "Minimum Absolute Sum Difference", "question__title_slug": "minimum-absolute-sum-difference", "question__hide": false, - "total_acs": 28354, - "total_submitted": 75933, - "total_column_articles": 366, + "total_acs": 28504, + "total_submitted": 76259, + "total_column_articles": 367, "frontend_question_id": "1818", "is_new_question": false }, @@ -17274,8 +17484,8 @@ "question__title": "Finding the Users Active Minutes", "question__title_slug": "finding-the-users-active-minutes", "question__hide": false, - "total_acs": 7165, - "total_submitted": 10230, + "total_acs": 7214, + "total_submitted": 10297, "total_column_articles": 119, "frontend_question_id": "1817", "is_new_question": false @@ -17295,9 +17505,9 @@ "question__title": "Truncate Sentence", "question__title_slug": "truncate-sentence", "question__hide": false, - "total_acs": 50328, - "total_submitted": 68967, - "total_column_articles": 670, + "total_acs": 50521, + "total_submitted": 69228, + "total_column_articles": 673, "frontend_question_id": "1816", "is_new_question": false }, @@ -17316,8 +17526,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": 281, - "total_submitted": 516, + "total_acs": 284, + "total_submitted": 540, "total_column_articles": 11, "frontend_question_id": "1794", "is_new_question": false @@ -17337,8 +17547,8 @@ "question__title": "Primary Department for Each Employee", "question__title_slug": "primary-department-for-each-employee", "question__hide": false, - "total_acs": 3078, - "total_submitted": 4321, + "total_acs": 3138, + "total_submitted": 4401, "total_column_articles": 41, "frontend_question_id": "1789", "is_new_question": false @@ -17358,8 +17568,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": 1083, - "total_submitted": 2137, + "total_acs": 1093, + "total_submitted": 2149, "total_column_articles": 23, "frontend_question_id": "1830", "is_new_question": false @@ -17379,9 +17589,9 @@ "question__title": "Maximum XOR for Each Query", "question__title_slug": "maximum-xor-for-each-query", "question__hide": false, - "total_acs": 5059, - "total_submitted": 7205, - "total_column_articles": 93, + "total_acs": 5107, + "total_submitted": 7263, + "total_column_articles": 94, "frontend_question_id": "1829", "is_new_question": false }, @@ -17400,9 +17610,9 @@ "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": 10940, - "total_submitted": 12624, - "total_column_articles": 153, + "total_acs": 11116, + "total_submitted": 12837, + "total_column_articles": 154, "frontend_question_id": "1828", "is_new_question": false }, @@ -17421,9 +17631,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": 14636, - "total_submitted": 18763, - "total_column_articles": 207, + "total_acs": 14800, + "total_submitted": 19007, + "total_column_articles": 208, "frontend_question_id": "1827", "is_new_question": false }, @@ -17442,8 +17652,8 @@ "question__title": "Maximize the Beauty of the Garden", "question__title_slug": "maximize-the-beauty-of-the-garden", "question__hide": false, - "total_acs": 409, - "total_submitted": 641, + "total_acs": 415, + "total_submitted": 652, "total_column_articles": 26, "frontend_question_id": "1788", "is_new_question": false @@ -17463,8 +17673,8 @@ "question__title": "Maximize Number of Nice Divisors", "question__title_slug": "maximize-number-of-nice-divisors", "question__hide": false, - "total_acs": 2778, - "total_submitted": 10097, + "total_acs": 2800, + "total_submitted": 10168, "total_column_articles": 50, "frontend_question_id": "1808", "is_new_question": false @@ -17484,9 +17694,9 @@ "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": 5782, - "total_submitted": 8697, - "total_column_articles": 89, + "total_acs": 5812, + "total_submitted": 8732, + "total_column_articles": 90, "frontend_question_id": "1806", "is_new_question": false }, @@ -17505,9 +17715,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": 6965, - "total_submitted": 11764, - "total_column_articles": 105, + "total_acs": 7015, + "total_submitted": 11828, + "total_column_articles": 107, "frontend_question_id": "1807", "is_new_question": false }, @@ -17526,9 +17736,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": 13752, - "total_submitted": 30000, - "total_column_articles": 203, + "total_acs": 13894, + "total_submitted": 30341, + "total_column_articles": 205, "frontend_question_id": "1805", "is_new_question": false }, @@ -17547,9 +17757,9 @@ "question__title": "Grand Slam Titles", "question__title_slug": "grand-slam-titles", "question__hide": false, - "total_acs": 2921, - "total_submitted": 3588, - "total_column_articles": 52, + "total_acs": 3059, + "total_submitted": 3748, + "total_column_articles": 54, "frontend_question_id": "1783", "is_new_question": false }, @@ -17568,9 +17778,9 @@ "question__title": "Shortest Path in a Hidden Grid", "question__title_slug": "shortest-path-in-a-hidden-grid", "question__hide": false, - "total_acs": 347, - "total_submitted": 687, - "total_column_articles": 15, + "total_acs": 352, + "total_submitted": 693, + "total_column_articles": 16, "frontend_question_id": "1778", "is_new_question": false }, @@ -17589,8 +17799,8 @@ "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": 3964, - "total_submitted": 7339, + "total_acs": 4017, + "total_submitted": 7401, "total_column_articles": 60, "frontend_question_id": "1798", "is_new_question": false @@ -17610,8 +17820,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": 5334, - "total_submitted": 19264, + "total_acs": 5400, + "total_submitted": 19421, "total_column_articles": 137, "frontend_question_id": "1802", "is_new_question": false @@ -17631,8 +17841,8 @@ "question__title": "Number of Orders in the Backlog", "question__title_slug": "number-of-orders-in-the-backlog", "question__hide": false, - "total_acs": 5110, - "total_submitted": 12998, + "total_acs": 5131, + "total_submitted": 13038, "total_column_articles": 128, "frontend_question_id": "1801", "is_new_question": false @@ -17652,9 +17862,9 @@ "question__title": "Maximum Ascending Subarray Sum", "question__title_slug": "maximum-ascending-subarray-sum", "question__hide": false, - "total_acs": 12589, - "total_submitted": 18686, - "total_column_articles": 208, + "total_acs": 12745, + "total_submitted": 18945, + "total_column_articles": 211, "frontend_question_id": "1800", "is_new_question": false }, @@ -17673,8 +17883,8 @@ "question__title": "Product's Price for Each Store", "question__title_slug": "products-price-for-each-store", "question__hide": false, - "total_acs": 7229, - "total_submitted": 9212, + "total_acs": 7296, + "total_submitted": 9291, "total_column_articles": 75, "frontend_question_id": "1777", "is_new_question": false @@ -17694,9 +17904,9 @@ "question__title": "Count Nice Pairs in an Array", "question__title_slug": "count-nice-pairs-in-an-array", "question__hide": false, - "total_acs": 4409, - "total_submitted": 12324, - "total_column_articles": 97, + "total_acs": 4462, + "total_submitted": 12446, + "total_column_articles": 98, "frontend_question_id": "1814", "is_new_question": false }, @@ -17715,8 +17925,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": 2157, - "total_submitted": 6977, + "total_acs": 2174, + "total_submitted": 7039, "total_column_articles": 49, "frontend_question_id": "1815", "is_new_question": false @@ -17736,9 +17946,9 @@ "question__title": "Sentence Similarity III", "question__title_slug": "sentence-similarity-iii", "question__hide": false, - "total_acs": 6274, - "total_submitted": 13043, - "total_column_articles": 96, + "total_acs": 6311, + "total_submitted": 13148, + "total_column_articles": 97, "frontend_question_id": "1813", "is_new_question": false }, @@ -17757,9 +17967,9 @@ "question__title": "Determine Color of a Chessboard Square", "question__title_slug": "determine-color-of-a-chessboard-square", "question__hide": false, - "total_acs": 11248, - "total_submitted": 14340, - "total_column_articles": 282, + "total_acs": 11374, + "total_submitted": 14498, + "total_column_articles": 285, "frontend_question_id": "1812", "is_new_question": false }, @@ -17778,8 +17988,8 @@ "question__title": "Sort Features by Popularity", "question__title_slug": "sort-features-by-popularity", "question__hide": false, - "total_acs": 615, - "total_submitted": 1290, + "total_acs": 632, + "total_submitted": 1330, "total_column_articles": 18, "frontend_question_id": "1772", "is_new_question": false @@ -17799,9 +18009,9 @@ "question__title": "Maximum Score of a Good Subarray", "question__title_slug": "maximum-score-of-a-good-subarray", "question__hide": false, - "total_acs": 4702, - "total_submitted": 10866, - "total_column_articles": 106, + "total_acs": 4758, + "total_submitted": 10956, + "total_column_articles": 110, "frontend_question_id": "1793", "is_new_question": false }, @@ -17820,9 +18030,9 @@ "question__title": "Maximum Average Pass Ratio", "question__title_slug": "maximum-average-pass-ratio", "question__hide": false, - "total_acs": 7568, - "total_submitted": 14792, - "total_column_articles": 120, + "total_acs": 7627, + "total_submitted": 14935, + "total_column_articles": 121, "frontend_question_id": "1792", "is_new_question": false }, @@ -17841,9 +18051,9 @@ "question__title": "Find Center of Star Graph", "question__title_slug": "find-center-of-star-graph", "question__hide": false, - "total_acs": 49391, - "total_submitted": 59004, - "total_column_articles": 465, + "total_acs": 49613, + "total_submitted": 59311, + "total_column_articles": 468, "frontend_question_id": "1791", "is_new_question": false }, @@ -17862,9 +18072,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": 20984, - "total_submitted": 37128, - "total_column_articles": 327, + "total_acs": 21361, + "total_submitted": 38019, + "total_column_articles": 329, "frontend_question_id": "1790", "is_new_question": false }, @@ -17883,9 +18093,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": 1764, - "total_submitted": 2206, - "total_column_articles": 37, + "total_acs": 1859, + "total_submitted": 2315, + "total_column_articles": 39, "frontend_question_id": "1767", "is_new_question": false }, @@ -17904,8 +18114,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": 12248, - "total_submitted": 18788, + "total_acs": 12273, + "total_submitted": 18828, "total_column_articles": 63, "frontend_question_id": "1787", "is_new_question": false @@ -17925,9 +18135,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": 4466, - "total_submitted": 12737, - "total_column_articles": 108, + "total_acs": 4516, + "total_submitted": 12909, + "total_column_articles": 110, "frontend_question_id": "1786", "is_new_question": false }, @@ -17946,8 +18156,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": 7299, - "total_submitted": 20292, + "total_acs": 7345, + "total_submitted": 20384, "total_column_articles": 74, "frontend_question_id": "1785", "is_new_question": false @@ -17967,9 +18177,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": 10796, - "total_submitted": 25404, - "total_column_articles": 132, + "total_acs": 10987, + "total_submitted": 25802, + "total_column_articles": 135, "frontend_question_id": "1784", "is_new_question": false }, @@ -17988,8 +18198,8 @@ "question__title": "Buildings With an Ocean View", "question__title_slug": "buildings-with-an-ocean-view", "question__hide": false, - "total_acs": 2140, - "total_submitted": 3015, + "total_acs": 2181, + "total_submitted": 3073, "total_column_articles": 42, "frontend_question_id": "1762", "is_new_question": false @@ -18009,9 +18219,9 @@ "question__title": "Recyclable and Low Fat Products", "question__title_slug": "recyclable-and-low-fat-products", "question__hide": false, - "total_acs": 32096, - "total_submitted": 36447, - "total_column_articles": 114, + "total_acs": 35917, + "total_submitted": 40833, + "total_column_articles": 123, "frontend_question_id": "1757", "is_new_question": false }, @@ -18030,9 +18240,9 @@ "question__title": "Count Pairs With XOR in a Range", "question__title_slug": "count-pairs-with-xor-in-a-range", "question__hide": false, - "total_acs": 2517, - "total_submitted": 5957, - "total_column_articles": 57, + "total_acs": 2554, + "total_submitted": 6025, + "total_column_articles": 58, "frontend_question_id": "1803", "is_new_question": false }, @@ -18051,9 +18261,9 @@ "question__title": "Maximize Score After N Operations", "question__title_slug": "maximize-score-after-n-operations", "question__hide": false, - "total_acs": 3033, - "total_submitted": 5704, - "total_column_articles": 41, + "total_acs": 3073, + "total_submitted": 5754, + "total_column_articles": 43, "frontend_question_id": "1799", "is_new_question": false }, @@ -18072,9 +18282,9 @@ "question__title": "Design Authentication Manager", "question__title_slug": "design-authentication-manager", "question__hide": false, - "total_acs": 8386, - "total_submitted": 14518, - "total_column_articles": 116, + "total_acs": 8619, + "total_submitted": 15006, + "total_column_articles": 121, "frontend_question_id": "1797", "is_new_question": false }, @@ -18093,8 +18303,8 @@ "question__title": "Second Largest Digit in a String", "question__title_slug": "second-largest-digit-in-a-string", "question__hide": false, - "total_acs": 9859, - "total_submitted": 20172, + "total_acs": 9964, + "total_submitted": 20401, "total_column_articles": 185, "frontend_question_id": "1796", "is_new_question": false @@ -18114,8 +18324,8 @@ "question__title": "Design Most Recently Used Queue", "question__title_slug": "design-most-recently-used-queue", "question__hide": false, - "total_acs": 982, - "total_submitted": 1199, + "total_acs": 996, + "total_submitted": 1215, "total_column_articles": 24, "frontend_question_id": "1756", "is_new_question": false @@ -18135,8 +18345,8 @@ "question__title": "Car Fleet II", "question__title_slug": "car-fleet-ii", "question__hide": false, - "total_acs": 2324, - "total_submitted": 4947, + "total_acs": 2345, + "total_submitted": 4984, "total_column_articles": 51, "frontend_question_id": "1776", "is_new_question": false @@ -18156,8 +18366,8 @@ "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": 5170, - "total_submitted": 10668, + "total_acs": 5211, + "total_submitted": 10749, "total_column_articles": 111, "frontend_question_id": "1775", "is_new_question": false @@ -18177,9 +18387,9 @@ "question__title": "Closest Dessert Cost", "question__title_slug": "closest-dessert-cost", "question__hide": false, - "total_acs": 7211, - "total_submitted": 13555, - "total_column_articles": 107, + "total_acs": 7265, + "total_submitted": 13683, + "total_column_articles": 108, "frontend_question_id": "1774", "is_new_question": false }, @@ -18198,9 +18408,9 @@ "question__title": "Count Items Matching a Rule", "question__title_slug": "count-items-matching-a-rule", "question__hide": false, - "total_acs": 19707, - "total_submitted": 23350, - "total_column_articles": 242, + "total_acs": 19861, + "total_submitted": 23546, + "total_column_articles": 245, "frontend_question_id": "1773", "is_new_question": false }, @@ -18219,9 +18429,9 @@ "question__title": "Leetflex Banned Accounts", "question__title_slug": "leetflex-banned-accounts", "question__hide": false, - "total_acs": 2922, - "total_submitted": 4339, - "total_column_articles": 55, + "total_acs": 3066, + "total_submitted": 4542, + "total_column_articles": 58, "frontend_question_id": "1747", "is_new_question": false }, @@ -18240,8 +18450,8 @@ "question__title": "Maximize Palindrome Length From Subsequences", "question__title_slug": "maximize-palindrome-length-from-subsequences", "question__hide": false, - "total_acs": 2718, - "total_submitted": 7280, + "total_acs": 2740, + "total_submitted": 7333, "total_column_articles": 49, "frontend_question_id": "1771", "is_new_question": false @@ -18261,9 +18471,9 @@ "question__title": "Maximum Score from Performing Multiplication Operations", "question__title_slug": "maximum-score-from-performing-multiplication-operations", "question__hide": false, - "total_acs": 4950, - "total_submitted": 13002, - "total_column_articles": 116, + "total_acs": 4986, + "total_submitted": 13095, + "total_column_articles": 115, "frontend_question_id": "1770", "is_new_question": false }, @@ -18282,9 +18492,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": 12215, - "total_submitted": 14313, - "total_column_articles": 215, + "total_acs": 12328, + "total_submitted": 14443, + "total_column_articles": 216, "frontend_question_id": "1769", "is_new_question": false }, @@ -18303,9 +18513,9 @@ "question__title": "Merge Strings Alternately", "question__title_slug": "merge-strings-alternately", "question__hide": false, - "total_acs": 18299, - "total_submitted": 24125, - "total_column_articles": 353, + "total_acs": 18601, + "total_submitted": 24552, + "total_column_articles": 356, "frontend_question_id": "1768", "is_new_question": false }, @@ -18324,8 +18534,8 @@ "question__title": "Maximum Subarray Sum After One Operation", "question__title_slug": "maximum-subarray-sum-after-one-operation", "question__hide": false, - "total_acs": 2067, - "total_submitted": 3440, + "total_acs": 2083, + "total_submitted": 3464, "total_column_articles": 64, "frontend_question_id": "1746", "is_new_question": false @@ -18345,9 +18555,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": 9277, - "total_submitted": 10892, - "total_column_articles": 67, + "total_acs": 10094, + "total_submitted": 11837, + "total_column_articles": 71, "frontend_question_id": "1741", "is_new_question": false }, @@ -18366,8 +18576,8 @@ "question__title": "Count Pairs Of Nodes", "question__title_slug": "count-pairs-of-nodes", "question__hide": false, - "total_acs": 1523, - "total_submitted": 4693, + "total_acs": 1547, + "total_submitted": 4732, "total_column_articles": 41, "frontend_question_id": "1782", "is_new_question": false @@ -18387,9 +18597,9 @@ "question__title": "Sum of Beauty of All Substrings", "question__title_slug": "sum-of-beauty-of-all-substrings", "question__hide": false, - "total_acs": 4968, - "total_submitted": 9206, - "total_column_articles": 71, + "total_acs": 5010, + "total_submitted": 9265, + "total_column_articles": 73, "frontend_question_id": "1781", "is_new_question": false }, @@ -18408,9 +18618,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": 7096, - "total_submitted": 10567, - "total_column_articles": 140, + "total_acs": 7154, + "total_submitted": 10650, + "total_column_articles": 141, "frontend_question_id": "1780", "is_new_question": false }, @@ -18429,9 +18639,9 @@ "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": 13409, - "total_submitted": 20703, - "total_column_articles": 218, + "total_acs": 13770, + "total_submitted": 21318, + "total_column_articles": 220, "frontend_question_id": "1779", "is_new_question": false }, @@ -18450,8 +18660,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": 3075, - "total_submitted": 6890, + "total_acs": 3105, + "total_submitted": 6950, "total_column_articles": 46, "frontend_question_id": "1761", "is_new_question": false @@ -18471,9 +18681,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": 7227, - "total_submitted": 12694, - "total_column_articles": 125, + "total_acs": 7434, + "total_submitted": 13001, + "total_column_articles": 127, "frontend_question_id": "1760", "is_new_question": false }, @@ -18492,8 +18702,8 @@ "question__title": "Count Number of Homogenous Substrings", "question__title_slug": "count-number-of-homogenous-substrings", "question__hide": false, - "total_acs": 5638, - "total_submitted": 12713, + "total_acs": 5672, + "total_submitted": 12776, "total_column_articles": 113, "frontend_question_id": "1759", "is_new_question": false @@ -18513,9 +18723,9 @@ "question__title": "Minimum Changes To Make Alternating Binary String", "question__title_slug": "minimum-changes-to-make-alternating-binary-string", "question__hide": false, - "total_acs": 9146, - "total_submitted": 14362, - "total_column_articles": 144, + "total_acs": 9345, + "total_submitted": 14677, + "total_column_articles": 147, "frontend_question_id": "1758", "is_new_question": false }, @@ -18534,8 +18744,8 @@ "question__title": "Find Distance in a Binary Tree", "question__title_slug": "find-distance-in-a-binary-tree", "question__hide": false, - "total_acs": 1133, - "total_submitted": 1704, + "total_acs": 1150, + "total_submitted": 1735, "total_column_articles": 39, "frontend_question_id": "1740", "is_new_question": false @@ -18555,9 +18765,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": 3893, - "total_submitted": 8363, - "total_column_articles": 48, + "total_acs": 4088, + "total_submitted": 8746, + "total_column_articles": 51, "frontend_question_id": "1731", "is_new_question": false }, @@ -18576,8 +18786,8 @@ "question__title": "Closest Subsequence Sum", "question__title_slug": "closest-subsequence-sum", "question__hide": false, - "total_acs": 4262, - "total_submitted": 9884, + "total_acs": 4339, + "total_submitted": 10049, "total_column_articles": 68, "frontend_question_id": "1755", "is_new_question": false @@ -18597,8 +18807,8 @@ "question__title": "Largest Merge Of Two Strings", "question__title_slug": "largest-merge-of-two-strings", "question__hide": false, - "total_acs": 5067, - "total_submitted": 11751, + "total_acs": 5087, + "total_submitted": 11794, "total_column_articles": 97, "frontend_question_id": "1754", "is_new_question": false @@ -18618,9 +18828,9 @@ "question__title": "Maximum Score From Removing Stones", "question__title_slug": "maximum-score-from-removing-stones", "question__hide": false, - "total_acs": 7747, - "total_submitted": 12266, - "total_column_articles": 156, + "total_acs": 7822, + "total_submitted": 12382, + "total_column_articles": 158, "frontend_question_id": "1753", "is_new_question": false }, @@ -18639,9 +18849,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": 11404, - "total_submitted": 17833, - "total_column_articles": 154, + "total_acs": 11456, + "total_submitted": 17946, + "total_column_articles": 156, "frontend_question_id": "1752", "is_new_question": false }, @@ -18660,9 +18870,9 @@ "question__title": "Find Followers Count", "question__title_slug": "find-followers-count", "question__hide": false, - "total_acs": 9628, - "total_submitted": 15352, - "total_column_articles": 56, + "total_acs": 10499, + "total_submitted": 16751, + "total_column_articles": 59, "frontend_question_id": "1729", "is_new_question": false }, @@ -18681,9 +18891,9 @@ "question__title": "Map of Highest Peak", "question__title_slug": "map-of-highest-peak", "question__hide": false, - "total_acs": 21977, - "total_submitted": 33109, - "total_column_articles": 311, + "total_acs": 22046, + "total_submitted": 33231, + "total_column_articles": 314, "frontend_question_id": "1765", "is_new_question": false }, @@ -18702,8 +18912,8 @@ "question__title": "Tree of Coprimes", "question__title_slug": "tree-of-coprimes", "question__hide": false, - "total_acs": 1790, - "total_submitted": 4603, + "total_acs": 1801, + "total_submitted": 4628, "total_column_articles": 35, "frontend_question_id": "1766", "is_new_question": false @@ -18723,9 +18933,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": 3198, - "total_submitted": 6656, - "total_column_articles": 77, + "total_acs": 3289, + "total_submitted": 6818, + "total_column_articles": 78, "frontend_question_id": "1764", "is_new_question": false }, @@ -18744,8 +18954,8 @@ "question__title": "Longest Nice Substring", "question__title_slug": "longest-nice-substring", "question__hide": false, - "total_acs": 25252, - "total_submitted": 36761, + "total_acs": 25349, + "total_submitted": 36930, "total_column_articles": 269, "frontend_question_id": "1763", "is_new_question": false @@ -18765,8 +18975,8 @@ "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": 29415, - "total_submitted": 81070, + "total_acs": 29455, + "total_submitted": 81161, "total_column_articles": 373, "frontend_question_id": "1744", "is_new_question": false @@ -18786,8 +18996,8 @@ "question__title": "Palindrome Partitioning IV", "question__title_slug": "palindrome-partitioning-iv", "question__hide": false, - "total_acs": 4189, - "total_submitted": 8527, + "total_acs": 4221, + "total_submitted": 8595, "total_column_articles": 83, "frontend_question_id": "1745", "is_new_question": false @@ -18807,9 +19017,9 @@ "question__title": "Restore the Array From Adjacent Pairs", "question__title_slug": "restore-the-array-from-adjacent-pairs", "question__hide": false, - "total_acs": 23423, - "total_submitted": 33639, - "total_column_articles": 341, + "total_acs": 23473, + "total_submitted": 33706, + "total_column_articles": 342, "frontend_question_id": "1743", "is_new_question": false }, @@ -18828,8 +19038,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": 485, - "total_submitted": 856, + "total_acs": 501, + "total_submitted": 872, "total_column_articles": 18, "frontend_question_id": "1724", "is_new_question": false @@ -18849,8 +19059,8 @@ "question__title": "Count Apples and Oranges", "question__title_slug": "count-apples-and-oranges", "question__hide": false, - "total_acs": 2831, - "total_submitted": 3922, + "total_acs": 2913, + "total_submitted": 4034, "total_column_articles": 46, "frontend_question_id": "1715", "is_new_question": false @@ -18870,9 +19080,9 @@ "question__title": "Building Boxes", "question__title_slug": "building-boxes", "question__hide": false, - "total_acs": 3255, - "total_submitted": 6714, - "total_column_articles": 72, + "total_acs": 3290, + "total_submitted": 6772, + "total_column_articles": 73, "frontend_question_id": "1739", "is_new_question": false }, @@ -18891,9 +19101,9 @@ "question__title": "Find Kth Largest XOR Coordinate Value", "question__title_slug": "find-kth-largest-xor-coordinate-value", "question__hide": false, - "total_acs": 29999, - "total_submitted": 46058, - "total_column_articles": 406, + "total_acs": 30091, + "total_submitted": 46201, + "total_column_articles": 407, "frontend_question_id": "1738", "is_new_question": false }, @@ -18912,8 +19122,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": 4700, - "total_submitted": 13814, + "total_acs": 4737, + "total_submitted": 13894, "total_column_articles": 111, "frontend_question_id": "1737", "is_new_question": false @@ -18933,9 +19143,9 @@ "question__title": "Latest Time by Replacing Hidden Digits", "question__title_slug": "latest-time-by-replacing-hidden-digits", "question__hide": false, - "total_acs": 30748, - "total_submitted": 68731, - "total_column_articles": 378, + "total_acs": 30827, + "total_submitted": 68940, + "total_column_articles": 380, "frontend_question_id": "1736", "is_new_question": false }, @@ -18954,9 +19164,9 @@ "question__title": "Biggest Window Between Visits", "question__title_slug": "biggest-window-between-visits", "question__hide": false, - "total_acs": 3063, - "total_submitted": 4222, - "total_column_articles": 59, + "total_acs": 3181, + "total_submitted": 4369, + "total_column_articles": 61, "frontend_question_id": "1709", "is_new_question": false }, @@ -18975,8 +19185,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": 4153, - "total_submitted": 8112, + "total_acs": 4246, + "total_submitted": 8266, "total_column_articles": 61, "frontend_question_id": "1751", "is_new_question": false @@ -18996,9 +19206,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": 4363, - "total_submitted": 9774, - "total_column_articles": 99, + "total_acs": 4421, + "total_submitted": 9885, + "total_column_articles": 100, "frontend_question_id": "1750", "is_new_question": false }, @@ -19017,9 +19227,9 @@ "question__title": "Maximum Absolute Sum of Any Subarray", "question__title_slug": "maximum-absolute-sum-of-any-subarray", "question__hide": false, - "total_acs": 5250, - "total_submitted": 9794, - "total_column_articles": 112, + "total_acs": 5324, + "total_submitted": 9932, + "total_column_articles": 115, "frontend_question_id": "1749", "is_new_question": false }, @@ -19038,9 +19248,9 @@ "question__title": "Sum of Unique Elements", "question__title_slug": "sum-of-unique-elements", "question__hide": false, - "total_acs": 41026, - "total_submitted": 52263, - "total_column_articles": 581, + "total_acs": 41288, + "total_submitted": 52662, + "total_column_articles": 582, "frontend_question_id": "1748", "is_new_question": false }, @@ -19059,8 +19269,8 @@ "question__title": "Largest Subarray Length K", "question__title_slug": "largest-subarray-length-k", "question__hide": false, - "total_acs": 1391, - "total_submitted": 2011, + "total_acs": 1399, + "total_submitted": 2023, "total_column_articles": 42, "frontend_question_id": "1708", "is_new_question": false @@ -19080,8 +19290,8 @@ "question__title": "Largest Submatrix With Rearrangements", "question__title_slug": "largest-submatrix-with-rearrangements", "question__hide": false, - "total_acs": 4008, - "total_submitted": 6879, + "total_acs": 4033, + "total_submitted": 6921, "total_column_articles": 86, "frontend_question_id": "1727", "is_new_question": false @@ -19101,8 +19311,8 @@ "question__title": "Maximum Number of Balls in a Box", "question__title_slug": "maximum-number-of-balls-in-a-box", "question__hide": false, - "total_acs": 10708, - "total_submitted": 15076, + "total_acs": 10788, + "total_submitted": 15197, "total_column_articles": 165, "frontend_question_id": "1742", "is_new_question": false @@ -19122,9 +19332,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": 35529, - "total_submitted": 42628, - "total_column_articles": 430, + "total_acs": 35676, + "total_submitted": 42831, + "total_column_articles": 431, "frontend_question_id": "1725", "is_new_question": false }, @@ -19143,9 +19353,9 @@ "question__title": "Number of Calls Between Two Persons", "question__title_slug": "number-of-calls-between-two-persons", "question__hide": false, - "total_acs": 5062, - "total_submitted": 6534, - "total_column_articles": 70, + "total_acs": 5318, + "total_submitted": 6878, + "total_column_articles": 72, "frontend_question_id": "1699", "is_new_question": false }, @@ -19164,9 +19374,9 @@ "question__title": "Minimize Hamming Distance After Swap Operations", "question__title_slug": "minimize-hamming-distance-after-swap-operations", "question__hide": false, - "total_acs": 5371, - "total_submitted": 10562, - "total_column_articles": 127, + "total_acs": 5406, + "total_submitted": 10653, + "total_column_articles": 128, "frontend_question_id": "1722", "is_new_question": false }, @@ -19185,9 +19395,9 @@ "question__title": "Decode XORed Array", "question__title_slug": "decode-xored-array", "question__hide": false, - "total_acs": 50583, - "total_submitted": 58368, - "total_column_articles": 531, + "total_acs": 50806, + "total_submitted": 58636, + "total_column_articles": 536, "frontend_question_id": "1720", "is_new_question": false }, @@ -19206,8 +19416,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": 744, - "total_submitted": 1431, + "total_acs": 745, + "total_submitted": 1434, "total_column_articles": 23, "frontend_question_id": "1698", "is_new_question": false @@ -19227,9 +19437,9 @@ "question__title": "Daily Leads and Partners", "question__title_slug": "daily-leads-and-partners", "question__hide": false, - "total_acs": 9348, - "total_submitted": 11425, - "total_column_articles": 80, + "total_acs": 10159, + "total_submitted": 12442, + "total_column_articles": 83, "frontend_question_id": "1693", "is_new_question": false }, @@ -19248,9 +19458,9 @@ "question__title": "Count Ways to Make Array With Product", "question__title_slug": "count-ways-to-make-array-with-product", "question__hide": false, - "total_acs": 1260, - "total_submitted": 2539, - "total_column_articles": 31, + "total_acs": 1271, + "total_submitted": 2560, + "total_column_articles": 32, "frontend_question_id": "1735", "is_new_question": false }, @@ -19269,8 +19479,8 @@ "question__title": "Decode XORed Permutation", "question__title_slug": "decode-xored-permutation", "question__hide": false, - "total_acs": 28747, - "total_submitted": 39711, + "total_acs": 28811, + "total_submitted": 39803, "total_column_articles": 373, "frontend_question_id": "1734", "is_new_question": false @@ -19290,8 +19500,8 @@ "question__title": "Minimum Number of People to Teach", "question__title_slug": "minimum-number-of-people-to-teach", "question__hide": false, - "total_acs": 2730, - "total_submitted": 5737, + "total_acs": 2744, + "total_submitted": 5755, "total_column_articles": 68, "frontend_question_id": "1733", "is_new_question": false @@ -19311,9 +19521,9 @@ "question__title": "Find the Highest Altitude", "question__title_slug": "find-the-highest-altitude", "question__hide": false, - "total_acs": 16473, - "total_submitted": 21003, - "total_column_articles": 272, + "total_acs": 16700, + "total_submitted": 21296, + "total_column_articles": 275, "frontend_question_id": "1732", "is_new_question": false }, @@ -19332,9 +19542,9 @@ "question__title": "Minimum Operations to Make a Subsequence", "question__title_slug": "minimum-operations-to-make-a-subsequence", "question__hide": false, - "total_acs": 17340, - "total_submitted": 34930, - "total_column_articles": 188, + "total_acs": 17420, + "total_submitted": 35091, + "total_column_articles": 190, "frontend_question_id": "1713", "is_new_question": false }, @@ -19353,9 +19563,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": 9321, - "total_submitted": 33833, - "total_column_articles": 138, + "total_acs": 9472, + "total_submitted": 34347, + "total_column_articles": 141, "frontend_question_id": "1712", "is_new_question": false }, @@ -19374,9 +19584,9 @@ "question__title": "Count Good Meals", "question__title_slug": "count-good-meals", "question__hide": false, - "total_acs": 31388, - "total_submitted": 87366, - "total_column_articles": 366, + "total_acs": 31434, + "total_submitted": 87504, + "total_column_articles": 367, "frontend_question_id": "1711", "is_new_question": false }, @@ -19395,9 +19605,9 @@ "question__title": "Maximum Units on a Truck", "question__title_slug": "maximum-units-on-a-truck", "question__hide": false, - "total_acs": 16339, - "total_submitted": 23487, - "total_column_articles": 246, + "total_acs": 16520, + "total_submitted": 23721, + "total_column_articles": 249, "frontend_question_id": "1710", "is_new_question": false }, @@ -19416,9 +19626,9 @@ "question__title": "Count Ways to Distribute Candies", "question__title_slug": "count-ways-to-distribute-candies", "question__hide": false, - "total_acs": 450, - "total_submitted": 685, - "total_column_articles": 15, + "total_acs": 460, + "total_submitted": 695, + "total_column_articles": 16, "frontend_question_id": "1692", "is_new_question": false }, @@ -19437,8 +19647,8 @@ "question__title": "Invalid Tweets", "question__title_slug": "invalid-tweets", "question__hide": false, - "total_acs": 5381, - "total_submitted": 5973, + "total_acs": 5455, + "total_submitted": 6057, "total_column_articles": 46, "frontend_question_id": "1683", "is_new_question": false @@ -19458,9 +19668,9 @@ "question__title": "Maximum XOR With an Element From Array", "question__title_slug": "maximum-xor-with-an-element-from-array", "question__hide": false, - "total_acs": 15223, - "total_submitted": 30170, - "total_column_articles": 161, + "total_acs": 15270, + "total_submitted": 30303, + "total_column_articles": 162, "frontend_question_id": "1707", "is_new_question": false }, @@ -19479,9 +19689,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": 26742, - "total_submitted": 52689, - "total_column_articles": 192, + "total_acs": 27010, + "total_submitted": 53181, + "total_column_articles": 194, "frontend_question_id": "1723", "is_new_question": false }, @@ -19500,9 +19710,9 @@ "question__title": "Maximum Number of Eaten Apples", "question__title_slug": "maximum-number-of-eaten-apples", "question__hide": false, - "total_acs": 26925, - "total_submitted": 59420, - "total_column_articles": 359, + "total_acs": 27056, + "total_submitted": 59752, + "total_column_articles": 360, "frontend_question_id": "1705", "is_new_question": false }, @@ -19521,9 +19731,9 @@ "question__title": "Determine if String Halves Are Alike", "question__title_slug": "determine-if-string-halves-are-alike", "question__hide": false, - "total_acs": 15138, - "total_submitted": 19522, - "total_column_articles": 238, + "total_acs": 15292, + "total_submitted": 19719, + "total_column_articles": 240, "frontend_question_id": "1704", "is_new_question": false }, @@ -19542,8 +19752,8 @@ "question__title": "Longest Palindromic Subsequence II", "question__title_slug": "longest-palindromic-subsequence-ii", "question__hide": false, - "total_acs": 745, - "total_submitted": 1306, + "total_acs": 755, + "total_submitted": 1326, "total_column_articles": 32, "frontend_question_id": "1682", "is_new_question": false @@ -19563,8 +19773,8 @@ "question__title": "Product's Worth Over Invoices", "question__title_slug": "products-worth-over-invoices", "question__hide": false, - "total_acs": 3382, - "total_submitted": 9466, + "total_acs": 3447, + "total_submitted": 9639, "total_column_articles": 49, "frontend_question_id": "1677", "is_new_question": false @@ -19584,8 +19794,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": 12693, - "total_submitted": 18201, + "total_acs": 12696, + "total_submitted": 18207, "total_column_articles": 92, "frontend_question_id": "1719", "is_new_question": false @@ -19605,8 +19815,8 @@ "question__title": "Construct the Lexicographically Largest Valid Sequence", "question__title_slug": "construct-the-lexicographically-largest-valid-sequence", "question__hide": false, - "total_acs": 2640, - "total_submitted": 5272, + "total_acs": 2694, + "total_submitted": 5372, "total_column_articles": 59, "frontend_question_id": "1718", "is_new_question": false @@ -19626,8 +19836,8 @@ "question__title": "Maximum Score From Removing Substrings", "question__title_slug": "maximum-score-from-removing-substrings", "question__hide": false, - "total_acs": 2914, - "total_submitted": 6526, + "total_acs": 2955, + "total_submitted": 6601, "total_column_articles": 61, "frontend_question_id": "1717", "is_new_question": false @@ -19647,8 +19857,8 @@ "question__title": "Calculate Money in Leetcode Bank", "question__title_slug": "calculate-money-in-leetcode-bank", "question__hide": false, - "total_acs": 38386, - "total_submitted": 54741, + "total_acs": 38503, + "total_submitted": 54959, "total_column_articles": 694, "frontend_question_id": "1716", "is_new_question": false @@ -19668,8 +19878,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": 1847, - "total_submitted": 2291, + "total_acs": 1923, + "total_submitted": 2374, "total_column_articles": 41, "frontend_question_id": "1676", "is_new_question": false @@ -19689,8 +19899,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": 2753, - "total_submitted": 5070, + "total_acs": 2790, + "total_submitted": 5132, "total_column_articles": 52, "frontend_question_id": "1697", "is_new_question": false @@ -19710,9 +19920,9 @@ "question__title": "Jump Game VI", "question__title_slug": "jump-game-vi", "question__hide": false, - "total_acs": 8988, - "total_submitted": 22630, - "total_column_articles": 142, + "total_acs": 9081, + "total_submitted": 22897, + "total_column_articles": 144, "frontend_question_id": "1696", "is_new_question": false }, @@ -19731,9 +19941,9 @@ "question__title": "Maximum Erasure Value", "question__title_slug": "maximum-erasure-value", "question__hide": false, - "total_acs": 10277, - "total_submitted": 20471, - "total_column_articles": 183, + "total_acs": 10460, + "total_submitted": 20751, + "total_column_articles": 186, "frontend_question_id": "1695", "is_new_question": false }, @@ -19752,9 +19962,9 @@ "question__title": "Reformat Phone Number", "question__title_slug": "reformat-phone-number", "question__hide": false, - "total_acs": 9832, - "total_submitted": 15635, - "total_column_articles": 170, + "total_acs": 9943, + "total_submitted": 15828, + "total_column_articles": 171, "frontend_question_id": "1694", "is_new_question": false }, @@ -19773,9 +19983,9 @@ "question__title": "Fix Names in a Table", "question__title_slug": "fix-names-in-a-table", "question__hide": false, - "total_acs": 15436, - "total_submitted": 24683, - "total_column_articles": 121, + "total_acs": 17109, + "total_submitted": 27273, + "total_column_articles": 130, "frontend_question_id": "1667", "is_new_question": false }, @@ -19794,8 +20004,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": 383, - "total_submitted": 596, + "total_acs": 388, + "total_submitted": 603, "total_column_articles": 18, "frontend_question_id": "1666", "is_new_question": false @@ -19815,8 +20025,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": 341, - "total_submitted": 588, + "total_acs": 342, + "total_submitted": 606, "total_column_articles": 11, "frontend_question_id": "1714", "is_new_question": false @@ -19836,9 +20046,9 @@ "question__title": "Stone Game VII", "question__title_slug": "stone-game-vii", "question__hide": false, - "total_acs": 5356, - "total_submitted": 9934, - "total_column_articles": 117, + "total_acs": 5391, + "total_submitted": 9988, + "total_column_articles": 118, "frontend_question_id": "1690", "is_new_question": false }, @@ -19857,8 +20067,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": 18225, - "total_submitted": 21048, + "total_acs": 18510, + "total_submitted": 21372, "total_column_articles": 243, "frontend_question_id": "1689", "is_new_question": false @@ -19878,9 +20088,9 @@ "question__title": "Count of Matches in Tournament", "question__title_slug": "count-of-matches-in-tournament", "question__hide": false, - "total_acs": 54681, - "total_submitted": 64857, - "total_column_articles": 588, + "total_acs": 54911, + "total_submitted": 65151, + "total_column_articles": 592, "frontend_question_id": "1688", "is_new_question": false }, @@ -19899,8 +20109,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": 1838, - "total_submitted": 4718, + "total_acs": 1871, + "total_submitted": 4889, "total_column_articles": 30, "frontend_question_id": "1703", "is_new_question": false @@ -19920,8 +20130,8 @@ "question__title": "Maximum Binary String After Change", "question__title_slug": "maximum-binary-string-after-change", "question__hide": false, - "total_acs": 3696, - "total_submitted": 7681, + "total_acs": 3722, + "total_submitted": 7734, "total_column_articles": 71, "frontend_question_id": "1702", "is_new_question": false @@ -19941,9 +20151,9 @@ "question__title": "Average Waiting Time", "question__title_slug": "average-waiting-time", "question__hide": false, - "total_acs": 5212, - "total_submitted": 8493, - "total_column_articles": 113, + "total_acs": 5256, + "total_submitted": 8556, + "total_column_articles": 115, "frontend_question_id": "1701", "is_new_question": false }, @@ -19962,9 +20172,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": 12524, - "total_submitted": 18085, - "total_column_articles": 260, + "total_acs": 12690, + "total_submitted": 18349, + "total_column_articles": 264, "frontend_question_id": "1700", "is_new_question": false }, @@ -19983,8 +20193,8 @@ "question__title": "Average Time of Process per Machine", "question__title_slug": "average-time-of-process-per-machine", "question__hide": false, - "total_acs": 4550, - "total_submitted": 6133, + "total_acs": 4639, + "total_submitted": 6233, "total_column_articles": 77, "frontend_question_id": "1661", "is_new_question": false @@ -20004,8 +20214,8 @@ "question__title": "Concatenation of Consecutive Binary Numbers", "question__title_slug": "concatenation-of-consecutive-binary-numbers", "question__hide": false, - "total_acs": 6448, - "total_submitted": 13435, + "total_acs": 6496, + "total_submitted": 13507, "total_column_articles": 84, "frontend_question_id": "1680", "is_new_question": false @@ -20025,8 +20235,8 @@ "question__title": "Minimum Incompatibility", "question__title_slug": "minimum-incompatibility", "question__hide": false, - "total_acs": 2959, - "total_submitted": 7215, + "total_acs": 2983, + "total_submitted": 7263, "total_column_articles": 58, "frontend_question_id": "1681", "is_new_question": false @@ -20046,8 +20256,8 @@ "question__title": "Max Number of K-Sum Pairs", "question__title_slug": "max-number-of-k-sum-pairs", "question__hide": false, - "total_acs": 8732, - "total_submitted": 17020, + "total_acs": 8810, + "total_submitted": 17139, "total_column_articles": 143, "frontend_question_id": "1679", "is_new_question": false @@ -20067,9 +20277,9 @@ "question__title": "Goal Parser Interpretation", "question__title_slug": "goal-parser-interpretation", "question__hide": false, - "total_acs": 23314, - "total_submitted": 27958, - "total_column_articles": 406, + "total_acs": 23594, + "total_submitted": 28282, + "total_column_articles": 408, "frontend_question_id": "1678", "is_new_question": false }, @@ -20088,8 +20298,8 @@ "question__title": "Correct a Binary Tree", "question__title_slug": "correct-a-binary-tree", "question__hide": false, - "total_acs": 675, - "total_submitted": 905, + "total_acs": 681, + "total_submitted": 913, "total_column_articles": 32, "frontend_question_id": "1660", "is_new_question": false @@ -20109,8 +20319,8 @@ "question__title": "Hopper Company Queries III", "question__title_slug": "hopper-company-queries-iii", "question__hide": false, - "total_acs": 1311, - "total_submitted": 1967, + "total_acs": 1360, + "total_submitted": 2034, "total_column_articles": 30, "frontend_question_id": "1651", "is_new_question": false @@ -20130,8 +20340,8 @@ "question__title": "Minimize Deviation in Array", "question__title_slug": "minimize-deviation-in-array", "question__hide": false, - "total_acs": 3394, - "total_submitted": 7823, + "total_acs": 3423, + "total_submitted": 7870, "total_column_articles": 57, "frontend_question_id": "1675", "is_new_question": false @@ -20151,9 +20361,9 @@ "question__title": "Minimum Moves to Make Array Complementary", "question__title_slug": "minimum-moves-to-make-array-complementary", "question__hide": false, - "total_acs": 3214, - "total_submitted": 8125, - "total_column_articles": 65, + "total_acs": 3258, + "total_submitted": 8212, + "total_column_articles": 66, "frontend_question_id": "1674", "is_new_question": false }, @@ -20172,8 +20382,8 @@ "question__title": "Find the Most Competitive Subsequence", "question__title_slug": "find-the-most-competitive-subsequence", "question__hide": false, - "total_acs": 9371, - "total_submitted": 25050, + "total_acs": 9483, + "total_submitted": 25266, "total_column_articles": 198, "frontend_question_id": "1673", "is_new_question": false @@ -20193,9 +20403,9 @@ "question__title": "Richest Customer Wealth", "question__title_slug": "richest-customer-wealth", "question__hide": false, - "total_acs": 89151, - "total_submitted": 101886, - "total_column_articles": 918, + "total_acs": 90924, + "total_submitted": 104062, + "total_column_articles": 928, "frontend_question_id": "1672", "is_new_question": false }, @@ -20214,8 +20424,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": 3231, - "total_submitted": 4066, + "total_acs": 3314, + "total_submitted": 4161, "total_column_articles": 51, "frontend_question_id": "1650", "is_new_question": false @@ -20235,9 +20445,9 @@ "question__title": "Delivering Boxes from Storage to Ports", "question__title_slug": "delivering-boxes-from-storage-to-ports", "question__hide": false, - "total_acs": 1456, - "total_submitted": 3312, - "total_column_articles": 30, + "total_acs": 1472, + "total_submitted": 3343, + "total_column_articles": 31, "frontend_question_id": "1687", "is_new_question": false }, @@ -20256,9 +20466,9 @@ "question__title": "Stone Game VI", "question__title_slug": "stone-game-vi", "question__hide": false, - "total_acs": 3554, - "total_submitted": 7333, - "total_column_articles": 59, + "total_acs": 3587, + "total_submitted": 7398, + "total_column_articles": 60, "frontend_question_id": "1686", "is_new_question": false }, @@ -20277,9 +20487,9 @@ "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": 5483, - "total_submitted": 8602, - "total_column_articles": 118, + "total_acs": 5539, + "total_submitted": 8697, + "total_column_articles": 120, "frontend_question_id": "1685", "is_new_question": false }, @@ -20298,9 +20508,9 @@ "question__title": "Count the Number of Consistent Strings", "question__title_slug": "count-the-number-of-consistent-strings", "question__hide": false, - "total_acs": 22013, - "total_submitted": 26752, - "total_column_articles": 444, + "total_acs": 22256, + "total_submitted": 27076, + "total_column_articles": 447, "frontend_question_id": "1684", "is_new_question": false }, @@ -20319,8 +20529,8 @@ "question__title": "Hopper Company Queries II", "question__title_slug": "hopper-company-queries-ii", "question__hide": false, - "total_acs": 1278, - "total_submitted": 3088, + "total_acs": 1300, + "total_submitted": 3142, "total_column_articles": 31, "frontend_question_id": "1645", "is_new_question": false @@ -20340,8 +20550,8 @@ "question__title": "Minimum Initial Energy to Finish Tasks", "question__title_slug": "minimum-initial-energy-to-finish-tasks", "question__hide": false, - "total_acs": 6131, - "total_submitted": 9308, + "total_acs": 6191, + "total_submitted": 9389, "total_column_articles": 96, "frontend_question_id": "1665", "is_new_question": false @@ -20361,9 +20571,9 @@ "question__title": "Ways to Make a Fair Array", "question__title_slug": "ways-to-make-a-fair-array", "question__hide": false, - "total_acs": 6432, - "total_submitted": 11551, - "total_column_articles": 124, + "total_acs": 6476, + "total_submitted": 11634, + "total_column_articles": 125, "frontend_question_id": "1664", "is_new_question": false }, @@ -20382,8 +20592,8 @@ "question__title": "Smallest String With A Given Numeric Value", "question__title_slug": "smallest-string-with-a-given-numeric-value", "question__hide": false, - "total_acs": 9174, - "total_submitted": 15959, + "total_acs": 9230, + "total_submitted": 16038, "total_column_articles": 152, "frontend_question_id": "1663", "is_new_question": false @@ -20403,9 +20613,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": 25132, - "total_submitted": 31056, - "total_column_articles": 365, + "total_acs": 25500, + "total_submitted": 31537, + "total_column_articles": 368, "frontend_question_id": "1662", "is_new_question": false }, @@ -20424,9 +20634,9 @@ "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": 2611, - "total_submitted": 4728, - "total_column_articles": 37, + "total_acs": 2718, + "total_submitted": 4919, + "total_column_articles": 39, "frontend_question_id": "1644", "is_new_question": false }, @@ -20445,9 +20655,9 @@ "question__title": "Hopper Company Queries I", "question__title_slug": "hopper-company-queries-i", "question__hide": false, - "total_acs": 1865, - "total_submitted": 3496, - "total_column_articles": 43, + "total_acs": 1906, + "total_submitted": 3556, + "total_column_articles": 44, "frontend_question_id": "1635", "is_new_question": false }, @@ -20466,9 +20676,9 @@ "question__title": "Maximize Grid Happiness", "question__title_slug": "maximize-grid-happiness", "question__hide": false, - "total_acs": 1657, - "total_submitted": 3884, - "total_column_articles": 28, + "total_acs": 1682, + "total_submitted": 3931, + "total_column_articles": 29, "frontend_question_id": "1659", "is_new_question": false }, @@ -20487,9 +20697,9 @@ "question__title": "Determine if Two Strings Are Close", "question__title_slug": "determine-if-two-strings-are-close", "question__hide": false, - "total_acs": 6547, - "total_submitted": 14027, - "total_column_articles": 95, + "total_acs": 6575, + "total_submitted": 14083, + "total_column_articles": 96, "frontend_question_id": "1657", "is_new_question": false }, @@ -20508,8 +20718,8 @@ "question__title": "Minimum Operations to Reduce X to Zero", "question__title_slug": "minimum-operations-to-reduce-x-to-zero", "question__hide": false, - "total_acs": 13009, - "total_submitted": 40922, + "total_acs": 13202, + "total_submitted": 41434, "total_column_articles": 198, "frontend_question_id": "1658", "is_new_question": false @@ -20529,9 +20739,9 @@ "question__title": "Design an Ordered Stream", "question__title_slug": "design-an-ordered-stream", "question__hide": false, - "total_acs": 9803, - "total_submitted": 12585, - "total_column_articles": 119, + "total_acs": 9887, + "total_submitted": 12711, + "total_column_articles": 121, "frontend_question_id": "1656", "is_new_question": false }, @@ -20550,9 +20760,9 @@ "question__title": "Add Two Polynomials Represented as Linked Lists", "question__title_slug": "add-two-polynomials-represented-as-linked-lists", "question__hide": false, - "total_acs": 1217, - "total_submitted": 2097, - "total_column_articles": 41, + "total_acs": 1245, + "total_submitted": 2140, + "total_column_articles": 42, "frontend_question_id": "1634", "is_new_question": false }, @@ -20571,9 +20781,9 @@ "question__title": "Percentage of Users Attended a Contest", "question__title_slug": "percentage-of-users-attended-a-contest", "question__hide": false, - "total_acs": 5124, - "total_submitted": 7840, - "total_column_articles": 41, + "total_acs": 5306, + "total_submitted": 8142, + "total_column_articles": 42, "frontend_question_id": "1633", "is_new_question": false }, @@ -20592,8 +20802,8 @@ "question__title": "Create Sorted Array through Instructions", "question__title_slug": "create-sorted-array-through-instructions", "question__hide": false, - "total_acs": 3320, - "total_submitted": 6885, + "total_acs": 3350, + "total_submitted": 6946, "total_column_articles": 81, "frontend_question_id": "1649", "is_new_question": false @@ -20613,9 +20823,9 @@ "question__title": "Sell Diminishing-Valued Colored Balls", "question__title_slug": "sell-diminishing-valued-colored-balls", "question__hide": false, - "total_acs": 5097, - "total_submitted": 17136, - "total_column_articles": 118, + "total_acs": 5156, + "total_submitted": 17294, + "total_column_articles": 120, "frontend_question_id": "1648", "is_new_question": false }, @@ -20634,9 +20844,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": 9575, - "total_submitted": 18038, - "total_column_articles": 142, + "total_acs": 9848, + "total_submitted": 18466, + "total_column_articles": 144, "frontend_question_id": "1647", "is_new_question": false }, @@ -20655,9 +20865,9 @@ "question__title": "Get Maximum in Generated Array", "question__title_slug": "get-maximum-in-generated-array", "question__hide": false, - "total_acs": 41397, - "total_submitted": 78310, - "total_column_articles": 420, + "total_acs": 41644, + "total_submitted": 78814, + "total_column_articles": 422, "frontend_question_id": "1646", "is_new_question": false }, @@ -20676,8 +20886,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": 664, - "total_submitted": 805, + "total_acs": 680, + "total_submitted": 822, "total_column_articles": 24, "frontend_question_id": "1628", "is_new_question": false @@ -20697,9 +20907,9 @@ "question__title": "Design Front Middle Back Queue", "question__title_slug": "design-front-middle-back-queue", "question__hide": false, - "total_acs": 6032, - "total_submitted": 11380, - "total_column_articles": 111, + "total_acs": 6085, + "total_submitted": 11492, + "total_column_articles": 113, "frontend_question_id": "1670", "is_new_question": false }, @@ -20718,9 +20928,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": 2703, - "total_submitted": 5778, - "total_column_articles": 53, + "total_acs": 2753, + "total_submitted": 5877, + "total_column_articles": 54, "frontend_question_id": "1671", "is_new_question": false }, @@ -20739,9 +20949,9 @@ "question__title": "Merge In Between Linked Lists", "question__title_slug": "merge-in-between-linked-lists", "question__hide": false, - "total_acs": 17967, - "total_submitted": 23845, - "total_column_articles": 315, + "total_acs": 18183, + "total_submitted": 24131, + "total_column_articles": 316, "frontend_question_id": "1669", "is_new_question": false }, @@ -20760,9 +20970,9 @@ "question__title": "Maximum Repeating Substring", "question__title_slug": "maximum-repeating-substring", "question__hide": false, - "total_acs": 9607, - "total_submitted": 21654, - "total_column_articles": 181, + "total_acs": 9697, + "total_submitted": 21849, + "total_column_articles": 182, "frontend_question_id": "1668", "is_new_question": false }, @@ -20781,8 +20991,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": 4835, - "total_submitted": 6213, + "total_acs": 4902, + "total_submitted": 6289, "total_column_articles": 57, "frontend_question_id": "1623", "is_new_question": false @@ -20802,9 +21012,9 @@ "question__title": "Furthest Building You Can Reach", "question__title_slug": "furthest-building-you-can-reach", "question__hide": false, - "total_acs": 8299, - "total_submitted": 18423, - "total_column_articles": 133, + "total_acs": 8501, + "total_submitted": 18813, + "total_column_articles": 137, "frontend_question_id": "1642", "is_new_question": false }, @@ -20823,9 +21033,9 @@ "question__title": "Count Sorted Vowel Strings", "question__title_slug": "count-sorted-vowel-strings", "question__hide": false, - "total_acs": 13846, - "total_submitted": 17862, - "total_column_articles": 319, + "total_acs": 13919, + "total_submitted": 17950, + "total_column_articles": 320, "frontend_question_id": "1641", "is_new_question": false }, @@ -20844,9 +21054,9 @@ "question__title": "Check Array Formation Through Concatenation", "question__title_slug": "check-array-formation-through-concatenation", "question__hide": false, - "total_acs": 15049, - "total_submitted": 23444, - "total_column_articles": 252, + "total_acs": 15123, + "total_submitted": 23594, + "total_column_articles": 253, "frontend_question_id": "1640", "is_new_question": false }, @@ -20865,9 +21075,9 @@ "question__title": "Find the Missing IDs", "question__title_slug": "find-the-missing-ids", "question__hide": false, - "total_acs": 3120, - "total_submitted": 4255, - "total_column_articles": 49, + "total_acs": 3241, + "total_submitted": 4402, + "total_column_articles": 51, "frontend_question_id": "1613", "is_new_question": false }, @@ -20886,8 +21096,8 @@ "question__title": "Distribute Repeating Integers", "question__title_slug": "distribute-repeating-integers", "question__hide": false, - "total_acs": 2922, - "total_submitted": 7430, + "total_acs": 2960, + "total_submitted": 7540, "total_column_articles": 46, "frontend_question_id": "1655", "is_new_question": false @@ -20907,9 +21117,9 @@ "question__title": "Minimum Jumps to Reach Home", "question__title_slug": "minimum-jumps-to-reach-home", "question__hide": false, - "total_acs": 5898, - "total_submitted": 19525, - "total_column_articles": 82, + "total_acs": 6091, + "total_submitted": 20060, + "total_column_articles": 84, "frontend_question_id": "1654", "is_new_question": false }, @@ -20928,9 +21138,9 @@ "question__title": "Minimum Deletions to Make String Balanced", "question__title_slug": "minimum-deletions-to-make-string-balanced", "question__hide": false, - "total_acs": 5172, - "total_submitted": 9705, - "total_column_articles": 116, + "total_acs": 5217, + "total_submitted": 9794, + "total_column_articles": 117, "frontend_question_id": "1653", "is_new_question": false }, @@ -20949,9 +21159,9 @@ "question__title": "Defuse the Bomb", "question__title_slug": "defuse-the-bomb", "question__hide": false, - "total_acs": 9817, - "total_submitted": 15505, - "total_column_articles": 232, + "total_acs": 9927, + "total_submitted": 15666, + "total_column_articles": 233, "frontend_question_id": "1652", "is_new_question": false }, @@ -20970,9 +21180,9 @@ "question__title": "Path With Minimum Effort", "question__title_slug": "path-with-minimum-effort", "question__hide": false, - "total_acs": 32941, - "total_submitted": 65652, - "total_column_articles": 365, + "total_acs": 33337, + "total_submitted": 66345, + "total_column_articles": 369, "frontend_question_id": "1631", "is_new_question": false }, @@ -20991,9 +21201,9 @@ "question__title": "Arithmetic Subarrays", "question__title_slug": "arithmetic-subarrays", "question__hide": false, - "total_acs": 9806, - "total_submitted": 12910, - "total_column_articles": 169, + "total_acs": 9890, + "total_submitted": 13013, + "total_column_articles": 170, "frontend_question_id": "1630", "is_new_question": false }, @@ -21012,9 +21222,9 @@ "question__title": "Slowest Key", "question__title_slug": "slowest-key", "question__hide": false, - "total_acs": 34371, - "total_submitted": 61377, - "total_column_articles": 410, + "total_acs": 34452, + "total_submitted": 61510, + "total_column_articles": 411, "frontend_question_id": "1629", "is_new_question": false }, @@ -21033,8 +21243,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": 651, - "total_submitted": 885, + "total_acs": 658, + "total_submitted": 894, "total_column_articles": 31, "frontend_question_id": "1612", "is_new_question": false @@ -21054,9 +21264,9 @@ "question__title": "Sellers With No Sales", "question__title_slug": "sellers-with-no-sales", "question__hide": false, - "total_acs": 5288, - "total_submitted": 9831, - "total_column_articles": 61, + "total_acs": 5478, + "total_submitted": 10161, + "total_column_articles": 63, "frontend_question_id": "1607", "is_new_question": false }, @@ -21075,8 +21285,8 @@ "question__title": "Best Team With No Conflicts", "question__title_slug": "best-team-with-no-conflicts", "question__hide": false, - "total_acs": 4828, - "total_submitted": 11990, + "total_acs": 4883, + "total_submitted": 12092, "total_column_articles": 101, "frontend_question_id": "1626", "is_new_question": false @@ -21096,9 +21306,9 @@ "question__title": "Lexicographically Smallest String After Applying Operations", "question__title_slug": "lexicographically-smallest-string-after-applying-operations", "question__hide": false, - "total_acs": 3413, - "total_submitted": 6171, - "total_column_articles": 72, + "total_acs": 3447, + "total_submitted": 6225, + "total_column_articles": 73, "frontend_question_id": "1625", "is_new_question": false }, @@ -21117,8 +21327,8 @@ "question__title": "Largest Substring Between Two Equal Characters", "question__title_slug": "largest-substring-between-two-equal-characters", "question__hide": false, - "total_acs": 15714, - "total_submitted": 25377, + "total_acs": 15867, + "total_submitted": 25660, "total_column_articles": 283, "frontend_question_id": "1624", "is_new_question": false @@ -21138,9 +21348,9 @@ "question__title": "Find Nearest Right Node in Binary Tree", "question__title_slug": "find-nearest-right-node-in-binary-tree", "question__hide": false, - "total_acs": 1332, - "total_submitted": 1778, - "total_column_articles": 51, + "total_acs": 1353, + "total_submitted": 1806, + "total_column_articles": 52, "frontend_question_id": "1602", "is_new_question": false }, @@ -21159,8 +21369,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": 1657, - "total_submitted": 3954, + "total_acs": 1677, + "total_submitted": 3984, "total_column_articles": 38, "frontend_question_id": "1639", "is_new_question": false @@ -21180,8 +21390,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": 3692, - "total_submitted": 5134, + "total_acs": 3732, + "total_submitted": 5185, "total_column_articles": 63, "frontend_question_id": "1638", "is_new_question": false @@ -21201,9 +21411,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": 7053, - "total_submitted": 8711, - "total_column_articles": 104, + "total_acs": 7127, + "total_submitted": 8795, + "total_column_articles": 105, "frontend_question_id": "1637", "is_new_question": false }, @@ -21222,9 +21432,9 @@ "question__title": "Sort Array by Increasing Frequency", "question__title_slug": "sort-array-by-increasing-frequency", "question__hide": false, - "total_acs": 13221, - "total_submitted": 19118, - "total_column_articles": 252, + "total_acs": 13367, + "total_submitted": 19318, + "total_column_articles": 254, "frontend_question_id": "1636", "is_new_question": false }, @@ -21243,9 +21453,9 @@ "question__title": "Count Subtrees With Max Distance Between Cities", "question__title_slug": "count-subtrees-with-max-distance-between-cities", "question__hide": false, - "total_acs": 2167, - "total_submitted": 3414, - "total_column_articles": 44, + "total_acs": 2224, + "total_submitted": 3490, + "total_column_articles": 46, "frontend_question_id": "1617", "is_new_question": false }, @@ -21264,9 +21474,9 @@ "question__title": "Split Two Strings to Make Palindrome", "question__title_slug": "split-two-strings-to-make-palindrome", "question__hide": false, - "total_acs": 5807, - "total_submitted": 20774, - "total_column_articles": 109, + "total_acs": 5838, + "total_submitted": 20883, + "total_column_articles": 110, "frontend_question_id": "1616", "is_new_question": false }, @@ -21285,8 +21495,8 @@ "question__title": "Maximal Network Rank", "question__title_slug": "maximal-network-rank", "question__hide": false, - "total_acs": 7754, - "total_submitted": 14162, + "total_acs": 7846, + "total_submitted": 14332, "total_column_articles": 92, "frontend_question_id": "1615", "is_new_question": false @@ -21306,9 +21516,9 @@ "question__title": "Maximum Nesting Depth of the Parentheses", "question__title_slug": "maximum-nesting-depth-of-the-parentheses", "question__hide": false, - "total_acs": 51726, - "total_submitted": 61473, - "total_column_articles": 720, + "total_acs": 52213, + "total_submitted": 62127, + "total_column_articles": 724, "frontend_question_id": "1614", "is_new_question": false }, @@ -21327,9 +21537,9 @@ "question__title": "Build Binary Expression Tree From Infix Expression", "question__title_slug": "build-binary-expression-tree-from-infix-expression", "question__hide": false, - "total_acs": 508, - "total_submitted": 743, - "total_column_articles": 24, + "total_acs": 521, + "total_submitted": 763, + "total_column_articles": 25, "frontend_question_id": "1597", "is_new_question": false }, @@ -21348,9 +21558,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": 4157, - "total_submitted": 5529, - "total_column_articles": 66, + "total_acs": 4303, + "total_submitted": 5717, + "total_column_articles": 70, "frontend_question_id": "1596", "is_new_question": false }, @@ -21369,9 +21579,9 @@ "question__title": "Bank Account Summary II", "question__title_slug": "bank-account-summary-ii", "question__hide": false, - "total_acs": 10060, - "total_submitted": 11956, - "total_column_articles": 82, + "total_acs": 10785, + "total_submitted": 12846, + "total_column_articles": 90, "frontend_question_id": "1587", "is_new_question": false }, @@ -21390,9 +21600,9 @@ "question__title": "Maximum Number of Visible Points", "question__title_slug": "maximum-number-of-visible-points", "question__hide": false, - "total_acs": 16695, - "total_submitted": 37710, - "total_column_articles": 157, + "total_acs": 16728, + "total_submitted": 37792, + "total_column_articles": 158, "frontend_question_id": "1610", "is_new_question": false }, @@ -21411,9 +21621,9 @@ "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": 2540, - "total_submitted": 4107, - "total_column_articles": 63, + "total_acs": 2569, + "total_submitted": 4156, + "total_column_articles": 64, "frontend_question_id": "1611", "is_new_question": false }, @@ -21432,9 +21642,9 @@ "question__title": "Even Odd Tree", "question__title_slug": "even-odd-tree", "question__hide": false, - "total_acs": 29887, - "total_submitted": 50798, - "total_column_articles": 448, + "total_acs": 30014, + "total_submitted": 51031, + "total_column_articles": 452, "frontend_question_id": "1609", "is_new_question": false }, @@ -21453,9 +21663,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": 17256, - "total_submitted": 28622, - "total_column_articles": 320, + "total_acs": 17752, + "total_submitted": 29555, + "total_column_articles": 329, "frontend_question_id": "1608", "is_new_question": false }, @@ -21474,9 +21684,9 @@ "question__title": "Binary Search Tree Iterator II", "question__title_slug": "binary-search-tree-iterator-ii", "question__hide": false, - "total_acs": 638, - "total_submitted": 1019, - "total_column_articles": 32, + "total_acs": 652, + "total_submitted": 1041, + "total_column_articles": 33, "frontend_question_id": "1586", "is_new_question": false }, @@ -21495,9 +21705,9 @@ "question__title": "Fancy Sequence", "question__title_slug": "fancy-sequence", "question__hide": false, - "total_acs": 3577, - "total_submitted": 21978, - "total_column_articles": 76, + "total_acs": 3609, + "total_submitted": 22141, + "total_column_articles": 77, "frontend_question_id": "1622", "is_new_question": false }, @@ -21516,9 +21726,9 @@ "question__title": "Cat and Mouse II", "question__title_slug": "cat-and-mouse-ii", "question__hide": false, - "total_acs": 13387, - "total_submitted": 20618, - "total_column_articles": 80, + "total_acs": 13404, + "total_submitted": 20662, + "total_column_articles": 81, "frontend_question_id": "1728", "is_new_question": false }, @@ -21537,9 +21747,9 @@ "question__title": "Coordinate With Maximum Network Quality", "question__title_slug": "coordinate-with-maximum-network-quality", "question__hide": false, - "total_acs": 3065, - "total_submitted": 8253, - "total_column_articles": 55, + "total_acs": 3096, + "total_submitted": 8319, + "total_column_articles": 56, "frontend_question_id": "1620", "is_new_question": false }, @@ -21558,8 +21768,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": 2220, - "total_submitted": 4845, + "total_acs": 2252, + "total_submitted": 4914, "total_column_articles": 40, "frontend_question_id": "1621", "is_new_question": false @@ -21579,9 +21789,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": 13565, - "total_submitted": 16562, - "total_column_articles": 130, + "total_acs": 14841, + "total_submitted": 18150, + "total_column_articles": 134, "frontend_question_id": "1581", "is_new_question": false }, @@ -21600,8 +21810,8 @@ "question__title": "Maximum Number of Achievable Transfer Requests", "question__title_slug": "maximum-number-of-achievable-transfer-requests", "question__hide": false, - "total_acs": 20802, - "total_submitted": 33699, + "total_acs": 20833, + "total_submitted": 33767, "total_column_articles": 226, "frontend_question_id": "1601", "is_new_question": false @@ -21621,8 +21831,8 @@ "question__title": "Throne Inheritance", "question__title_slug": "throne-inheritance", "question__hide": false, - "total_acs": 18003, - "total_submitted": 26944, + "total_acs": 18090, + "total_submitted": 27171, "total_column_articles": 222, "frontend_question_id": "1600", "is_new_question": false @@ -21642,9 +21852,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": 4467, - "total_submitted": 10556, - "total_column_articles": 78, + "total_acs": 4493, + "total_submitted": 10609, + "total_column_articles": 79, "frontend_question_id": "1599", "is_new_question": false }, @@ -21663,9 +21873,9 @@ "question__title": "Crawler Log Folder", "question__title_slug": "crawler-log-folder", "question__hide": false, - "total_acs": 13609, - "total_submitted": 20202, - "total_column_articles": 180, + "total_acs": 13696, + "total_submitted": 20333, + "total_column_articles": 184, "frontend_question_id": "1598", "is_new_question": false }, @@ -21684,8 +21894,8 @@ "question__title": "Put Boxes Into the Warehouse II", "question__title_slug": "put-boxes-into-the-warehouse-ii", "question__hide": false, - "total_acs": 431, - "total_submitted": 732, + "total_acs": 443, + "total_submitted": 764, "total_column_articles": 26, "frontend_question_id": "1580", "is_new_question": false @@ -21705,8 +21915,8 @@ "question__title": "Warehouse Manager", "question__title_slug": "warehouse-manager", "question__hide": false, - "total_acs": 6027, - "total_submitted": 7829, + "total_acs": 6231, + "total_submitted": 8087, "total_column_articles": 63, "frontend_question_id": "1571", "is_new_question": false @@ -21726,8 +21936,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": 2442, - "total_submitted": 4941, + "total_acs": 2458, + "total_submitted": 4960, "total_column_articles": 45, "frontend_question_id": "1595", "is_new_question": false @@ -21747,9 +21957,9 @@ "question__title": "Maximum Non Negative Product in a Matrix", "question__title_slug": "maximum-non-negative-product-in-a-matrix", "question__hide": false, - "total_acs": 4992, - "total_submitted": 15440, - "total_column_articles": 110, + "total_acs": 5058, + "total_submitted": 15589, + "total_column_articles": 111, "frontend_question_id": "1594", "is_new_question": false }, @@ -21768,9 +21978,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": 7089, - "total_submitted": 12700, - "total_column_articles": 111, + "total_acs": 7188, + "total_submitted": 12850, + "total_column_articles": 112, "frontend_question_id": "1593", "is_new_question": false }, @@ -21789,9 +21999,9 @@ "question__title": "Rearrange Spaces Between Words", "question__title_slug": "rearrange-spaces-between-words", "question__hide": false, - "total_acs": 9496, - "total_submitted": 21430, - "total_column_articles": 152, + "total_acs": 9591, + "total_submitted": 21684, + "total_column_articles": 158, "frontend_question_id": "1592", "is_new_question": false }, @@ -21810,9 +22020,9 @@ "question__title": "Dot Product of Two Sparse Vectors", "question__title_slug": "dot-product-of-two-sparse-vectors", "question__hide": false, - "total_acs": 3294, - "total_submitted": 3701, - "total_column_articles": 48, + "total_acs": 3332, + "total_submitted": 3749, + "total_column_articles": 49, "frontend_question_id": "1570", "is_new_question": false }, @@ -21831,8 +22041,8 @@ "question__title": "Unique Orders and Customers Per Month", "question__title_slug": "unique-orders-and-customers-per-month", "question__hide": false, - "total_acs": 4868, - "total_submitted": 6619, + "total_acs": 4938, + "total_submitted": 6702, "total_column_articles": 51, "frontend_question_id": "1565", "is_new_question": false @@ -21852,8 +22062,8 @@ "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": 4761, - "total_submitted": 6342, + "total_acs": 4824, + "total_submitted": 6423, "total_column_articles": 92, "frontend_question_id": "1605", "is_new_question": false @@ -21873,9 +22083,9 @@ "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": 19319, - "total_submitted": 40085, - "total_column_articles": 183, + "total_acs": 19362, + "total_submitted": 40190, + "total_column_articles": 182, "frontend_question_id": "1606", "is_new_question": false }, @@ -21894,8 +22104,8 @@ "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": 4862, - "total_submitted": 11578, + "total_acs": 4902, + "total_submitted": 11692, "total_column_articles": 86, "frontend_question_id": "1604", "is_new_question": false @@ -21915,9 +22125,9 @@ "question__title": "Design Parking System", "question__title_slug": "design-parking-system", "question__hide": false, - "total_acs": 65314, - "total_submitted": 77345, - "total_column_articles": 519, + "total_acs": 65759, + "total_submitted": 77882, + "total_column_articles": 522, "frontend_question_id": "1603", "is_new_question": false }, @@ -21936,9 +22146,9 @@ "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": 2711, - "total_submitted": 6279, - "total_column_articles": 46, + "total_acs": 2724, + "total_submitted": 6322, + "total_column_articles": 47, "frontend_question_id": "1585", "is_new_question": false }, @@ -21957,9 +22167,9 @@ "question__title": "Min Cost to Connect All Points", "question__title_slug": "min-cost-to-connect-all-points", "question__hide": false, - "total_acs": 36858, - "total_submitted": 55689, - "total_column_articles": 460, + "total_acs": 37330, + "total_submitted": 56347, + "total_column_articles": 461, "frontend_question_id": "1584", "is_new_question": false }, @@ -21978,8 +22188,8 @@ "question__title": "Count Unhappy Friends", "question__title_slug": "count-unhappy-friends", "question__hide": false, - "total_acs": 19463, - "total_submitted": 28459, + "total_acs": 19491, + "total_submitted": 28520, "total_column_articles": 247, "frontend_question_id": "1583", "is_new_question": false @@ -21999,9 +22209,9 @@ "question__title": "Special Positions in a Binary Matrix", "question__title_slug": "special-positions-in-a-binary-matrix", "question__hide": false, - "total_acs": 12189, - "total_submitted": 18148, - "total_column_articles": 152, + "total_acs": 12260, + "total_submitted": 18279, + "total_column_articles": 157, "frontend_question_id": "1582", "is_new_question": false }, @@ -22020,8 +22230,8 @@ "question__title": "Put Boxes Into the Warehouse I", "question__title_slug": "put-boxes-into-the-warehouse-i", "question__hide": false, - "total_acs": 906, - "total_submitted": 1616, + "total_acs": 914, + "total_submitted": 1628, "total_column_articles": 37, "frontend_question_id": "1564", "is_new_question": false @@ -22041,8 +22251,8 @@ "question__title": "Bank Account Summary", "question__title_slug": "bank-account-summary", "question__hide": false, - "total_acs": 4167, - "total_submitted": 9386, + "total_acs": 4232, + "total_submitted": 9577, "total_column_articles": 68, "frontend_question_id": "1555", "is_new_question": false @@ -22062,8 +22272,8 @@ "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": 17205, - "total_submitted": 27768, + "total_acs": 17249, + "total_submitted": 27842, "total_column_articles": 311, "frontend_question_id": "1579", "is_new_question": false @@ -22083,9 +22293,9 @@ "question__title": "Minimum Time to Make Rope Colorful", "question__title_slug": "minimum-time-to-make-rope-colorful", "question__hide": false, - "total_acs": 12844, - "total_submitted": 21749, - "total_column_articles": 235, + "total_acs": 12981, + "total_submitted": 21937, + "total_column_articles": 236, "frontend_question_id": "1578", "is_new_question": false }, @@ -22104,8 +22314,8 @@ "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": 5824, - "total_submitted": 17436, + "total_acs": 5870, + "total_submitted": 17551, "total_column_articles": 93, "frontend_question_id": "1577", "is_new_question": false @@ -22125,8 +22335,8 @@ "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": 49432, - "total_submitted": 96131, + "total_acs": 49522, + "total_submitted": 96335, "total_column_articles": 595, "frontend_question_id": "1576", "is_new_question": false @@ -22146,8 +22356,8 @@ "question__title": "Strings Differ by One Character", "question__title_slug": "strings-differ-by-one-character", "question__hide": false, - "total_acs": 906, - "total_submitted": 1465, + "total_acs": 911, + "total_submitted": 1500, "total_column_articles": 28, "frontend_question_id": "1554", "is_new_question": false @@ -22167,8 +22377,8 @@ "question__title": "Strange Printer II", "question__title_slug": "strange-printer-ii", "question__hide": false, - "total_acs": 1643, - "total_submitted": 2701, + "total_acs": 1657, + "total_submitted": 2721, "total_column_articles": 48, "frontend_question_id": "1591", "is_new_question": false @@ -22188,9 +22398,9 @@ "question__title": "Maximum Sum Obtained of Any Permutation", "question__title_slug": "maximum-sum-obtained-of-any-permutation", "question__hide": false, - "total_acs": 4995, - "total_submitted": 16110, - "total_column_articles": 79, + "total_acs": 5026, + "total_submitted": 16194, + "total_column_articles": 81, "frontend_question_id": "1589", "is_new_question": false }, @@ -22209,8 +22419,8 @@ "question__title": "Make Sum Divisible by P", "question__title_slug": "make-sum-divisible-by-p", "question__hide": false, - "total_acs": 4923, - "total_submitted": 17702, + "total_acs": 4989, + "total_submitted": 17869, "total_column_articles": 68, "frontend_question_id": "1590", "is_new_question": false @@ -22230,9 +22440,9 @@ "question__title": "Sum of All Odd Length Subarrays", "question__title_slug": "sum-of-all-odd-length-subarrays", "question__hide": false, - "total_acs": 54595, - "total_submitted": 65018, - "total_column_articles": 852, + "total_acs": 54964, + "total_submitted": 65449, + "total_column_articles": 854, "frontend_question_id": "1588", "is_new_question": false }, @@ -22251,9 +22461,9 @@ "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": 2469, - "total_submitted": 5192, - "total_column_articles": 52, + "total_acs": 2492, + "total_submitted": 5231, + "total_column_articles": 53, "frontend_question_id": "1569", "is_new_question": false }, @@ -22272,9 +22482,9 @@ "question__title": "Minimum Number of Days to Disconnect Island", "question__title_slug": "minimum-number-of-days-to-disconnect-island", "question__hide": false, - "total_acs": 3155, - "total_submitted": 6935, - "total_column_articles": 63, + "total_acs": 3186, + "total_submitted": 6983, + "total_column_articles": 64, "frontend_question_id": "1568", "is_new_question": false }, @@ -22293,9 +22503,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": 27258, - "total_submitted": 64645, - "total_column_articles": 375, + "total_acs": 27481, + "total_submitted": 65111, + "total_column_articles": 378, "frontend_question_id": "1567", "is_new_question": false }, @@ -22314,9 +22524,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": 9865, - "total_submitted": 22276, - "total_column_articles": 155, + "total_acs": 9930, + "total_submitted": 22456, + "total_column_articles": 157, "frontend_question_id": "1566", "is_new_question": false }, @@ -22335,9 +22545,9 @@ "question__title": "The Most Recent Orders for Each Product", "question__title_slug": "the-most-recent-orders-for-each-product", "question__hide": false, - "total_acs": 4566, - "total_submitted": 6741, - "total_column_articles": 77, + "total_acs": 4786, + "total_submitted": 7085, + "total_column_articles": 82, "frontend_question_id": "1549", "is_new_question": false }, @@ -22356,8 +22566,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": 470, - "total_submitted": 692, + "total_acs": 473, + "total_submitted": 696, "total_column_articles": 19, "frontend_question_id": "1548", "is_new_question": false @@ -22377,9 +22587,9 @@ "question__title": "Fix Product Name Format", "question__title_slug": "fix-product-name-format", "question__hide": false, - "total_acs": 4474, - "total_submitted": 8138, - "total_column_articles": 53, + "total_acs": 4529, + "total_submitted": 8226, + "total_column_articles": 54, "frontend_question_id": "1543", "is_new_question": false }, @@ -22398,8 +22608,8 @@ "question__title": "Stone Game V", "question__title_slug": "stone-game-v", "question__hide": false, - "total_acs": 4707, - "total_submitted": 12056, + "total_acs": 4749, + "total_submitted": 12129, "total_column_articles": 70, "frontend_question_id": "1563", "is_new_question": false @@ -22419,9 +22629,9 @@ "question__title": "Find Latest Group of Size M", "question__title_slug": "find-latest-group-of-size-m", "question__hide": false, - "total_acs": 5212, - "total_submitted": 15667, - "total_column_articles": 105, + "total_acs": 5260, + "total_submitted": 15751, + "total_column_articles": 106, "frontend_question_id": "1562", "is_new_question": false }, @@ -22440,9 +22650,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": 14149, - "total_submitted": 18203, - "total_column_articles": 207, + "total_acs": 14270, + "total_submitted": 18360, + "total_column_articles": 208, "frontend_question_id": "1561", "is_new_question": false }, @@ -22461,9 +22671,9 @@ "question__title": "Most Visited Sector in a Circular Track", "question__title_slug": "most-visited-sector-in-a-circular-track", "question__hide": false, - "total_acs": 9999, - "total_submitted": 17442, - "total_column_articles": 107, + "total_acs": 10076, + "total_submitted": 17581, + "total_column_articles": 111, "frontend_question_id": "1560", "is_new_question": false }, @@ -22482,8 +22692,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": 184, - "total_submitted": 325, + "total_acs": 191, + "total_submitted": 336, "total_column_articles": 10, "frontend_question_id": "1538", "is_new_question": false @@ -22503,9 +22713,9 @@ "question__title": "Count All Possible Routes", "question__title_slug": "count-all-possible-routes", "question__hide": false, - "total_acs": 7692, - "total_submitted": 13009, - "total_column_articles": 89, + "total_acs": 7797, + "total_submitted": 13183, + "total_column_articles": 90, "frontend_question_id": "1575", "is_new_question": false }, @@ -22524,9 +22734,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": 7621, - "total_submitted": 21484, - "total_column_articles": 129, + "total_acs": 7810, + "total_submitted": 21846, + "total_column_articles": 130, "frontend_question_id": "1574", "is_new_question": false }, @@ -22545,8 +22755,8 @@ "question__title": "Number of Ways to Split a String", "question__title_slug": "number-of-ways-to-split-a-string", "question__hide": false, - "total_acs": 5404, - "total_submitted": 17762, + "total_acs": 5433, + "total_submitted": 17858, "total_column_articles": 77, "frontend_question_id": "1573", "is_new_question": false @@ -22566,9 +22776,9 @@ "question__title": "Matrix Diagonal Sum", "question__title_slug": "matrix-diagonal-sum", "question__hide": false, - "total_acs": 27296, - "total_submitted": 33862, - "total_column_articles": 454, + "total_acs": 27590, + "total_submitted": 34214, + "total_column_articles": 455, "frontend_question_id": "1572", "is_new_question": false }, @@ -22587,9 +22797,9 @@ "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": 9007, - "total_submitted": 29155, - "total_column_articles": 135, + "total_acs": 9081, + "total_submitted": 29319, + "total_column_articles": 136, "frontend_question_id": "1553", "is_new_question": false }, @@ -22608,8 +22818,8 @@ "question__title": "Magnetic Force Between Two Balls", "question__title_slug": "magnetic-force-between-two-balls", "question__hide": false, - "total_acs": 12568, - "total_submitted": 23539, + "total_acs": 12792, + "total_submitted": 23891, "total_column_articles": 173, "frontend_question_id": "1552", "is_new_question": false @@ -22629,8 +22839,8 @@ "question__title": "Minimum Operations to Make Array Equal", "question__title_slug": "minimum-operations-to-make-array-equal", "question__hide": false, - "total_acs": 12883, - "total_submitted": 15746, + "total_acs": 12980, + "total_submitted": 15862, "total_column_articles": 184, "frontend_question_id": "1551", "is_new_question": false @@ -22650,8 +22860,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": 608, - "total_submitted": 1048, + "total_acs": 627, + "total_submitted": 1087, "total_column_articles": 31, "frontend_question_id": "1533", "is_new_question": false @@ -22671,9 +22881,9 @@ "question__title": "The Most Recent Three Orders", "question__title_slug": "the-most-recent-three-orders", "question__hide": false, - "total_acs": 4905, - "total_submitted": 7801, - "total_column_articles": 68, + "total_acs": 5012, + "total_submitted": 7979, + "total_column_articles": 73, "frontend_question_id": "1532", "is_new_question": false }, @@ -22692,9 +22902,9 @@ "question__title": "Patients With a Condition", "question__title_slug": "patients-with-a-condition", "question__hide": false, - "total_acs": 16885, - "total_submitted": 34636, - "total_column_articles": 121, + "total_acs": 18560, + "total_submitted": 38101, + "total_column_articles": 127, "frontend_question_id": "1527", "is_new_question": false }, @@ -22713,8 +22923,8 @@ "question__title": "Minimum Cost to Cut a Stick", "question__title_slug": "minimum-cost-to-cut-a-stick", "question__hide": false, - "total_acs": 4832, - "total_submitted": 8732, + "total_acs": 4893, + "total_submitted": 8814, "total_column_articles": 81, "frontend_question_id": "1547", "is_new_question": false @@ -22734,9 +22944,9 @@ "question__title": "Find Longest Awesome Substring", "question__title_slug": "find-longest-awesome-substring", "question__hide": false, - "total_acs": 3238, - "total_submitted": 7923, - "total_column_articles": 58, + "total_acs": 3279, + "total_submitted": 7997, + "total_column_articles": 60, "frontend_question_id": "1542", "is_new_question": false }, @@ -22755,9 +22965,9 @@ "question__title": "Find Kth Bit in Nth Binary String", "question__title_slug": "find-kth-bit-in-nth-binary-string", "question__hide": false, - "total_acs": 8535, - "total_submitted": 15311, - "total_column_articles": 111, + "total_acs": 8585, + "total_submitted": 15378, + "total_column_articles": 112, "frontend_question_id": "1545", "is_new_question": false }, @@ -22776,9 +22986,9 @@ "question__title": "Make The String Great", "question__title_slug": "make-the-string-great", "question__hide": false, - "total_acs": 23581, - "total_submitted": 42545, - "total_column_articles": 375, + "total_acs": 23732, + "total_submitted": 42809, + "total_column_articles": 378, "frontend_question_id": "1544", "is_new_question": false }, @@ -22797,9 +23007,9 @@ "question__title": "Diameter of N-Ary Tree", "question__title_slug": "diameter-of-n-ary-tree", "question__hide": false, - "total_acs": 1648, - "total_submitted": 2331, - "total_column_articles": 48, + "total_acs": 1670, + "total_submitted": 2362, + "total_column_articles": 49, "frontend_question_id": "1522", "is_new_question": false }, @@ -22818,8 +23028,8 @@ "question__title": "Find Users With Valid E-Mails", "question__title_slug": "find-users-with-valid-e-mails", "question__hide": false, - "total_acs": 4929, - "total_submitted": 8784, + "total_acs": 4994, + "total_submitted": 8938, "total_column_articles": 48, "frontend_question_id": "1517", "is_new_question": false @@ -22839,9 +23049,9 @@ "question__title": "Detect Cycles in 2D Grid", "question__title_slug": "detect-cycles-in-2d-grid", "question__hide": false, - "total_acs": 5058, - "total_submitted": 13174, - "total_column_articles": 85, + "total_acs": 5159, + "total_submitted": 13372, + "total_column_articles": 86, "frontend_question_id": "1559", "is_new_question": false }, @@ -22860,8 +23070,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": 5298, - "total_submitted": 8463, + "total_acs": 5336, + "total_submitted": 8536, "total_column_articles": 83, "frontend_question_id": "1558", "is_new_question": false @@ -22881,9 +23091,9 @@ "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": 12745, - "total_submitted": 15902, - "total_column_articles": 180, + "total_acs": 12958, + "total_submitted": 16160, + "total_column_articles": 183, "frontend_question_id": "1557", "is_new_question": false }, @@ -22902,9 +23112,9 @@ "question__title": "Thousand Separator", "question__title_slug": "thousand-separator", "question__hide": false, - "total_acs": 14808, - "total_submitted": 26036, - "total_column_articles": 236, + "total_acs": 14949, + "total_submitted": 26300, + "total_column_articles": 241, "frontend_question_id": "1556", "is_new_question": false }, @@ -22923,9 +23133,9 @@ "question__title": "Get the Maximum Score", "question__title_slug": "get-the-maximum-score", "question__hide": false, - "total_acs": 5267, - "total_submitted": 13957, - "total_column_articles": 107, + "total_acs": 5582, + "total_submitted": 14482, + "total_column_articles": 112, "frontend_question_id": "1537", "is_new_question": false }, @@ -22944,9 +23154,9 @@ "question__title": "Minimum Swaps to Arrange a Binary Grid", "question__title_slug": "minimum-swaps-to-arrange-a-binary-grid", "question__hide": false, - "total_acs": 4559, - "total_submitted": 10170, - "total_column_articles": 87, + "total_acs": 4605, + "total_submitted": 10274, + "total_column_articles": 88, "frontend_question_id": "1536", "is_new_question": false }, @@ -22965,9 +23175,9 @@ "question__title": "Find the Winner of an Array Game", "question__title_slug": "find-the-winner-of-an-array-game", "question__hide": false, - "total_acs": 14817, - "total_submitted": 32243, - "total_column_articles": 199, + "total_acs": 14908, + "total_submitted": 32416, + "total_column_articles": 201, "frontend_question_id": "1535", "is_new_question": false }, @@ -22986,9 +23196,9 @@ "question__title": "Count Good Triplets", "question__title_slug": "count-good-triplets", "question__hide": false, - "total_acs": 20477, - "total_submitted": 26245, - "total_column_articles": 196, + "total_acs": 20618, + "total_submitted": 26420, + "total_column_articles": 197, "frontend_question_id": "1534", "is_new_question": false }, @@ -23007,8 +23217,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": 302, - "total_submitted": 545, + "total_acs": 303, + "total_submitted": 549, "total_column_articles": 16, "frontend_question_id": "1516", "is_new_question": false @@ -23028,8 +23238,8 @@ "question__title": "Customer Order Frequency", "question__title_slug": "customer-order-frequency", "question__hide": false, - "total_acs": 6344, - "total_submitted": 9221, + "total_acs": 6441, + "total_submitted": 9363, "total_column_articles": 81, "frontend_question_id": "1511", "is_new_question": false @@ -23049,9 +23259,9 @@ "question__title": "Number of Good Leaf Nodes Pairs", "question__title_slug": "number-of-good-leaf-nodes-pairs", "question__hide": false, - "total_acs": 9998, - "total_submitted": 17271, - "total_column_articles": 173, + "total_acs": 10076, + "total_submitted": 17398, + "total_column_articles": 175, "frontend_question_id": "1530", "is_new_question": false }, @@ -23070,9 +23280,9 @@ "question__title": "Minimum Suffix Flips", "question__title_slug": "minimum-suffix-flips", "question__hide": false, - "total_acs": 10088, - "total_submitted": 14444, - "total_column_articles": 155, + "total_acs": 10150, + "total_submitted": 14522, + "total_column_articles": 156, "frontend_question_id": "1529", "is_new_question": false }, @@ -23091,9 +23301,9 @@ "question__title": "Shuffle String", "question__title_slug": "shuffle-string", "question__hide": false, - "total_acs": 33949, - "total_submitted": 43202, - "total_column_articles": 422, + "total_acs": 34135, + "total_submitted": 43448, + "total_column_articles": 424, "frontend_question_id": "1528", "is_new_question": false }, @@ -23112,9 +23322,9 @@ "question__title": "Find Root of N-Ary Tree", "question__title_slug": "find-root-of-n-ary-tree", "question__hide": false, - "total_acs": 815, - "total_submitted": 989, - "total_column_articles": 21, + "total_acs": 827, + "total_submitted": 1006, + "total_column_articles": 22, "frontend_question_id": "1506", "is_new_question": false }, @@ -23133,8 +23343,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": 6117, - "total_submitted": 14237, + "total_acs": 6179, + "total_submitted": 14324, "total_column_articles": 95, "frontend_question_id": "1546", "is_new_question": false @@ -23154,9 +23364,9 @@ "question__title": "Minimum Insertions to Balance a Parentheses String", "question__title_slug": "minimum-insertions-to-balance-a-parentheses-string", "question__hide": false, - "total_acs": 12082, - "total_submitted": 25069, - "total_column_articles": 145, + "total_acs": 12393, + "total_submitted": 25725, + "total_column_articles": 146, "frontend_question_id": "1541", "is_new_question": false }, @@ -23175,9 +23385,9 @@ "question__title": "Can Convert String in K Moves", "question__title_slug": "can-convert-string-in-k-moves", "question__hide": false, - "total_acs": 5560, - "total_submitted": 17228, - "total_column_articles": 95, + "total_acs": 5613, + "total_submitted": 17331, + "total_column_articles": 96, "frontend_question_id": "1540", "is_new_question": false }, @@ -23196,9 +23406,9 @@ "question__title": "Kth Missing Positive Number", "question__title_slug": "kth-missing-positive-number", "question__hide": false, - "total_acs": 27293, - "total_submitted": 50511, - "total_column_articles": 398, + "total_acs": 28042, + "total_submitted": 51874, + "total_column_articles": 403, "frontend_question_id": "1539", "is_new_question": false }, @@ -23217,9 +23427,9 @@ "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": 3099, - "total_submitted": 7704, - "total_column_articles": 62, + "total_acs": 3149, + "total_submitted": 7772, + "total_column_articles": 63, "frontend_question_id": "1521", "is_new_question": false }, @@ -23238,9 +23448,9 @@ "question__title": "Maximum Number of Non-Overlapping Substrings", "question__title_slug": "maximum-number-of-non-overlapping-substrings", "question__hide": false, - "total_acs": 2817, - "total_submitted": 8243, - "total_column_articles": 78, + "total_acs": 2834, + "total_submitted": 8280, + "total_column_articles": 79, "frontend_question_id": "1520", "is_new_question": false }, @@ -23259,9 +23469,9 @@ "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": 6273, - "total_submitted": 20137, - "total_column_articles": 132, + "total_acs": 6319, + "total_submitted": 20233, + "total_column_articles": 134, "frontend_question_id": "1519", "is_new_question": false }, @@ -23280,9 +23490,9 @@ "question__title": "Water Bottles", "question__title_slug": "water-bottles", "question__hide": false, - "total_acs": 56566, - "total_submitted": 80598, - "total_column_articles": 842, + "total_acs": 56700, + "total_submitted": 80791, + "total_column_articles": 845, "frontend_question_id": "1518", "is_new_question": false }, @@ -23301,9 +23511,9 @@ "question__title": "Countries You Can Safely Invest In", "question__title_slug": "countries-you-can-safely-invest-in", "question__hide": false, - "total_acs": 6956, - "total_submitted": 11388, - "total_column_articles": 95, + "total_acs": 7229, + "total_submitted": 11808, + "total_column_articles": 98, "frontend_question_id": "1501", "is_new_question": false }, @@ -23322,8 +23532,8 @@ "question__title": "Design a File Sharing System", "question__title_slug": "design-a-file-sharing-system", "question__hide": false, - "total_acs": 1529, - "total_submitted": 5211, + "total_acs": 1560, + "total_submitted": 5321, "total_column_articles": 41, "frontend_question_id": "1500", "is_new_question": false @@ -23343,8 +23553,8 @@ "question__title": "Friendly Movies Streamed Last Month", "question__title_slug": "friendly-movies-streamed-last-month", "question__hide": false, - "total_acs": 5655, - "total_submitted": 10562, + "total_acs": 5728, + "total_submitted": 10712, "total_column_articles": 47, "frontend_question_id": "1495", "is_new_question": false @@ -23364,9 +23574,9 @@ "question__title": "Best Position for a Service Centre", "question__title_slug": "best-position-for-a-service-centre", "question__hide": false, - "total_acs": 3736, - "total_submitted": 10696, - "total_column_articles": 67, + "total_acs": 3757, + "total_submitted": 10742, + "total_column_articles": 68, "frontend_question_id": "1515", "is_new_question": false }, @@ -23385,9 +23595,9 @@ "question__title": "String Compression II", "question__title_slug": "string-compression-ii", "question__hide": false, - "total_acs": 2376, - "total_submitted": 6595, - "total_column_articles": 44, + "total_acs": 2389, + "total_submitted": 6618, + "total_column_articles": 45, "frontend_question_id": "1531", "is_new_question": false }, @@ -23406,9 +23616,9 @@ "question__title": "Number of Substrings With Only 1s", "question__title_slug": "number-of-substrings-with-only-1s", "question__hide": false, - "total_acs": 12472, - "total_submitted": 32234, - "total_column_articles": 179, + "total_acs": 12526, + "total_submitted": 32396, + "total_column_articles": 180, "frontend_question_id": "1513", "is_new_question": false }, @@ -23427,9 +23637,9 @@ "question__title": "Number of Good Pairs", "question__title_slug": "number-of-good-pairs", "question__hide": false, - "total_acs": 65595, - "total_submitted": 77328, - "total_column_articles": 852, + "total_acs": 65851, + "total_submitted": 77644, + "total_column_articles": 854, "frontend_question_id": "1512", "is_new_question": false }, @@ -23448,8 +23658,8 @@ "question__title": "Clone N-ary Tree", "question__title_slug": "clone-n-ary-tree", "question__hide": false, - "total_acs": 1551, - "total_submitted": 1856, + "total_acs": 1567, + "total_submitted": 1874, "total_column_articles": 39, "frontend_question_id": "1490", "is_new_question": false @@ -23469,9 +23679,9 @@ "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": 3972, - "total_submitted": 6241, - "total_column_articles": 67, + "total_acs": 4000, + "total_submitted": 6281, + "total_column_articles": 70, "frontend_question_id": "1526", "is_new_question": false }, @@ -23490,9 +23700,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": 6797, - "total_submitted": 10321, - "total_column_articles": 131, + "total_acs": 6875, + "total_submitted": 10456, + "total_column_articles": 132, "frontend_question_id": "1525", "is_new_question": false }, @@ -23511,9 +23721,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": 7050, - "total_submitted": 15876, - "total_column_articles": 126, + "total_acs": 7136, + "total_submitted": 16090, + "total_column_articles": 129, "frontend_question_id": "1524", "is_new_question": false }, @@ -23532,9 +23742,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": 27248, - "total_submitted": 53486, - "total_column_articles": 438, + "total_acs": 27987, + "total_submitted": 55038, + "total_column_articles": 443, "frontend_question_id": "1523", "is_new_question": false }, @@ -23553,9 +23763,9 @@ "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": 3788, - "total_submitted": 10155, - "total_column_articles": 80, + "total_acs": 3805, + "total_submitted": 10186, + "total_column_articles": 82, "frontend_question_id": "1505", "is_new_question": false }, @@ -23574,8 +23784,8 @@ "question__title": "Count Submatrices With All Ones", "question__title_slug": "count-submatrices-with-all-ones", "question__hide": false, - "total_acs": 9353, - "total_submitted": 15308, + "total_acs": 9421, + "total_submitted": 15399, "total_column_articles": 151, "frontend_question_id": "1504", "is_new_question": false @@ -23595,9 +23805,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": 9829, - "total_submitted": 18785, - "total_column_articles": 98, + "total_acs": 9900, + "total_submitted": 18887, + "total_column_articles": 99, "frontend_question_id": "1503", "is_new_question": false }, @@ -23616,9 +23826,9 @@ "question__title": "Can Make Arithmetic Progression From Sequence", "question__title_slug": "can-make-arithmetic-progression-from-sequence", "question__hide": false, - "total_acs": 34879, - "total_submitted": 49300, - "total_column_articles": 440, + "total_acs": 35279, + "total_submitted": 49884, + "total_column_articles": 443, "frontend_question_id": "1502", "is_new_question": false }, @@ -23637,9 +23847,9 @@ "question__title": "Group Sold Products By The Date", "question__title_slug": "group-sold-products-by-the-date", "question__hide": false, - "total_acs": 16934, - "total_submitted": 24970, - "total_column_articles": 134, + "total_acs": 18611, + "total_submitted": 27514, + "total_column_articles": 142, "frontend_question_id": "1484", "is_new_question": false }, @@ -23658,9 +23868,9 @@ "question__title": "Clone Binary Tree With Random Pointer", "question__title_slug": "clone-binary-tree-with-random-pointer", "question__hide": false, - "total_acs": 1106, - "total_submitted": 1398, - "total_column_articles": 34, + "total_acs": 1121, + "total_submitted": 1415, + "total_column_articles": 35, "frontend_question_id": "1485", "is_new_question": false }, @@ -23679,8 +23889,8 @@ "question__title": "Sales by Day of the Week", "question__title_slug": "sales-by-day-of-the-week", "question__hide": false, - "total_acs": 2929, - "total_submitted": 5250, + "total_acs": 3017, + "total_submitted": 5412, "total_column_articles": 55, "frontend_question_id": "1479", "is_new_question": false @@ -23700,8 +23910,8 @@ "question__title": "Max Value of Equation", "question__title_slug": "max-value-of-equation", "question__hide": false, - "total_acs": 3664, - "total_submitted": 9383, + "total_acs": 3701, + "total_submitted": 9476, "total_column_articles": 78, "frontend_question_id": "1499", "is_new_question": false @@ -23721,9 +23931,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": 7221, - "total_submitted": 20170, - "total_column_articles": 105, + "total_acs": 7332, + "total_submitted": 20466, + "total_column_articles": 106, "frontend_question_id": "1498", "is_new_question": false }, @@ -23742,8 +23952,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": 10282, - "total_submitted": 25734, + "total_acs": 10380, + "total_submitted": 26027, "total_column_articles": 127, "frontend_question_id": "1497", "is_new_question": false @@ -23763,9 +23973,9 @@ "question__title": "Path Crossing", "question__title_slug": "path-crossing", "question__hide": false, - "total_acs": 13385, - "total_submitted": 25065, - "total_column_articles": 198, + "total_acs": 13509, + "total_submitted": 25321, + "total_column_articles": 203, "frontend_question_id": "1496", "is_new_question": false }, @@ -23784,9 +23994,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": 2596, - "total_submitted": 3665, - "total_column_articles": 83, + "total_acs": 2617, + "total_submitted": 3699, + "total_column_articles": 85, "frontend_question_id": "1474", "is_new_question": false }, @@ -23805,9 +24015,9 @@ "question__title": "Stone Game IV", "question__title_slug": "stone-game-iv", "question__hide": false, - "total_acs": 6509, - "total_submitted": 10955, - "total_column_articles": 79, + "total_acs": 6579, + "total_submitted": 11064, + "total_column_articles": 81, "frontend_question_id": "1510", "is_new_question": false }, @@ -23826,9 +24036,9 @@ "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": 6498, - "total_submitted": 11770, - "total_column_articles": 111, + "total_acs": 6550, + "total_submitted": 11879, + "total_column_articles": 112, "frontend_question_id": "1509", "is_new_question": false }, @@ -23847,9 +24057,9 @@ "question__title": "Range Sum of Sorted Subarray Sums", "question__title_slug": "range-sum-of-sorted-subarray-sums", "question__hide": false, - "total_acs": 8147, - "total_submitted": 14458, - "total_column_articles": 79, + "total_acs": 8252, + "total_submitted": 14618, + "total_column_articles": 81, "frontend_question_id": "1508", "is_new_question": false }, @@ -23868,9 +24078,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": 12353, - "total_submitted": 18070, - "total_column_articles": 137, + "total_acs": 12374, + "total_submitted": 18112, + "total_column_articles": 138, "frontend_question_id": "1489", "is_new_question": false }, @@ -23889,9 +24099,9 @@ "question__title": "Avoid Flood in The City", "question__title_slug": "avoid-flood-in-the-city", "question__hide": false, - "total_acs": 9721, - "total_submitted": 38395, - "total_column_articles": 140, + "total_acs": 9839, + "total_submitted": 38790, + "total_column_articles": 143, "frontend_question_id": "1488", "is_new_question": false }, @@ -23910,9 +24120,9 @@ "question__title": "Making File Names Unique", "question__title_slug": "making-file-names-unique", "question__hide": false, - "total_acs": 9062, - "total_submitted": 28281, - "total_column_articles": 117, + "total_acs": 9124, + "total_submitted": 28438, + "total_column_articles": 118, "frontend_question_id": "1487", "is_new_question": false }, @@ -23931,9 +24141,9 @@ "question__title": "XOR Operation in an Array", "question__title_slug": "xor-operation-in-an-array", "question__hide": false, - "total_acs": 75470, - "total_submitted": 87985, - "total_column_articles": 729, + "total_acs": 75691, + "total_submitted": 88244, + "total_column_articles": 731, "frontend_question_id": "1486", "is_new_question": false }, @@ -23952,9 +24162,9 @@ "question__title": "Find All The Lonely Nodes", "question__title_slug": "find-all-the-lonely-nodes", "question__hide": false, - "total_acs": 3853, - "total_submitted": 4708, - "total_column_articles": 117, + "total_acs": 3908, + "total_submitted": 4777, + "total_column_articles": 118, "frontend_question_id": "1469", "is_new_question": false }, @@ -23973,8 +24183,8 @@ "question__title": "Calculate Salaries", "question__title_slug": "calculate-salaries", "question__hide": false, - "total_acs": 4239, - "total_submitted": 6055, + "total_acs": 4303, + "total_submitted": 6144, "total_column_articles": 59, "frontend_question_id": "1468", "is_new_question": false @@ -23994,9 +24204,9 @@ "question__title": "Rectangles Area", "question__title_slug": "rectangles-area", "question__hide": false, - "total_acs": 3741, - "total_submitted": 6005, - "total_column_articles": 66, + "total_acs": 3863, + "total_submitted": 6235, + "total_column_articles": 67, "frontend_question_id": "1459", "is_new_question": false }, @@ -24015,9 +24225,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": 35590, - "total_submitted": 60220, - "total_column_articles": 459, + "total_acs": 35851, + "total_submitted": 60711, + "total_column_articles": 463, "frontend_question_id": "1482", "is_new_question": false }, @@ -24036,9 +24246,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": 12351, - "total_submitted": 24098, - "total_column_articles": 180, + "total_acs": 12687, + "total_submitted": 24954, + "total_column_articles": 181, "frontend_question_id": "1481", "is_new_question": false }, @@ -24057,9 +24267,9 @@ "question__title": "Running Sum of 1d Array", "question__title_slug": "running-sum-of-1d-array", "question__hide": false, - "total_acs": 153839, - "total_submitted": 179886, - "total_column_articles": 1522, + "total_acs": 162088, + "total_submitted": 190901, + "total_column_articles": 1567, "frontend_question_id": "1480", "is_new_question": false }, @@ -24078,8 +24288,8 @@ "question__title": "Parallel Courses II", "question__title_slug": "parallel-courses-ii", "question__hide": false, - "total_acs": 3159, - "total_submitted": 8215, + "total_acs": 3194, + "total_submitted": 8309, "total_column_articles": 47, "frontend_question_id": "1494", "is_new_question": false @@ -24099,9 +24309,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": 12042, - "total_submitted": 20561, - "total_column_articles": 216, + "total_acs": 12202, + "total_submitted": 20838, + "total_column_articles": 218, "frontend_question_id": "1493", "is_new_question": false }, @@ -24120,9 +24330,9 @@ "question__title": "The kth Factor of n", "question__title_slug": "the-kth-factor-of-n", "question__hide": false, - "total_acs": 10525, - "total_submitted": 16746, - "total_column_articles": 120, + "total_acs": 10621, + "total_submitted": 16900, + "total_column_articles": 121, "frontend_question_id": "1492", "is_new_question": false }, @@ -24141,9 +24351,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": 34550, - "total_submitted": 53544, - "total_column_articles": 489, + "total_acs": 35228, + "total_submitted": 54658, + "total_column_articles": 496, "frontend_question_id": "1491", "is_new_question": false }, @@ -24162,8 +24372,8 @@ "question__title": "Paint House III", "question__title_slug": "paint-house-iii", "question__hide": false, - "total_acs": 16312, - "total_submitted": 24376, + "total_acs": 16363, + "total_submitted": 24457, "total_column_articles": 172, "frontend_question_id": "1473", "is_new_question": false @@ -24183,9 +24393,9 @@ "question__title": "Design Browser History", "question__title_slug": "design-browser-history", "question__hide": false, - "total_acs": 12099, - "total_submitted": 19699, - "total_column_articles": 191, + "total_acs": 12294, + "total_submitted": 20067, + "total_column_articles": 195, "frontend_question_id": "1472", "is_new_question": false }, @@ -24204,8 +24414,8 @@ "question__title": "The k Strongest Values in an Array", "question__title_slug": "the-k-strongest-values-in-an-array", "question__hide": false, - "total_acs": 8396, - "total_submitted": 15264, + "total_acs": 8446, + "total_submitted": 15345, "total_column_articles": 123, "frontend_question_id": "1471", "is_new_question": false @@ -24225,9 +24435,9 @@ "question__title": "Shuffle the Array", "question__title_slug": "shuffle-the-array", "question__hide": false, - "total_acs": 60335, - "total_submitted": 71967, - "total_column_articles": 807, + "total_acs": 60574, + "total_submitted": 72286, + "total_column_articles": 812, "frontend_question_id": "1470", "is_new_question": false }, @@ -24246,9 +24456,9 @@ "question__title": "Active Users", "question__title_slug": "active-users", "question__hide": false, - "total_acs": 7425, - "total_submitted": 18604, - "total_column_articles": 107, + "total_acs": 7574, + "total_submitted": 18991, + "total_column_articles": 108, "frontend_question_id": "1454", "is_new_question": false }, @@ -24267,9 +24477,9 @@ "question__title": "Apples & Oranges", "question__title_slug": "apples-oranges", "question__hide": false, - "total_acs": 7001, - "total_submitted": 8154, - "total_column_articles": 80, + "total_acs": 7229, + "total_submitted": 8413, + "total_column_articles": 82, "frontend_question_id": "1445", "is_new_question": false }, @@ -24288,8 +24498,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": 1954, - "total_submitted": 3106, + "total_acs": 1957, + "total_submitted": 3110, "total_column_articles": 53, "frontend_question_id": "1467", "is_new_question": false @@ -24309,9 +24519,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": 8292, - "total_submitted": 16805, - "total_column_articles": 170, + "total_acs": 8404, + "total_submitted": 17008, + "total_column_articles": 173, "frontend_question_id": "1466", "is_new_question": false }, @@ -24330,8 +24540,8 @@ "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": 7471, - "total_submitted": 23403, + "total_acs": 7526, + "total_submitted": 23539, "total_column_articles": 90, "frontend_question_id": "1465", "is_new_question": false @@ -24351,9 +24561,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": 33983, - "total_submitted": 44475, - "total_column_articles": 473, + "total_acs": 34247, + "total_submitted": 44824, + "total_column_articles": 476, "frontend_question_id": "1464", "is_new_question": false }, @@ -24372,8 +24582,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": 6731, - "total_submitted": 22382, + "total_acs": 6798, + "total_submitted": 22604, "total_column_articles": 121, "frontend_question_id": "1477", "is_new_question": false @@ -24393,9 +24603,9 @@ "question__title": "Subrectangle Queries", "question__title_slug": "subrectangle-queries", "question__hide": false, - "total_acs": 14120, - "total_submitted": 16325, - "total_column_articles": 132, + "total_acs": 14231, + "total_submitted": 16455, + "total_column_articles": 133, "frontend_question_id": "1476", "is_new_question": false }, @@ -24414,9 +24624,9 @@ "question__title": "Allocate Mailboxes", "question__title_slug": "allocate-mailboxes", "question__hide": false, - "total_acs": 3851, - "total_submitted": 6341, - "total_column_articles": 70, + "total_acs": 3892, + "total_submitted": 6400, + "total_column_articles": 71, "frontend_question_id": "1478", "is_new_question": false }, @@ -24435,9 +24645,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": 21093, - "total_submitted": 29556, - "total_column_articles": 340, + "total_acs": 21325, + "total_submitted": 29862, + "total_column_articles": 344, "frontend_question_id": "1475", "is_new_question": false }, @@ -24456,8 +24666,8 @@ "question__title": "Max Dot Product of Two Subsequences", "question__title_slug": "max-dot-product-of-two-subsequences", "question__hide": false, - "total_acs": 6347, - "total_submitted": 14113, + "total_acs": 6385, + "total_submitted": 14185, "total_column_articles": 102, "frontend_question_id": "1458", "is_new_question": false @@ -24477,8 +24687,8 @@ "question__title": "Pseudo-Palindromic Paths in a Binary Tree", "question__title_slug": "pseudo-palindromic-paths-in-a-binary-tree", "question__hide": false, - "total_acs": 9329, - "total_submitted": 14904, + "total_acs": 9436, + "total_submitted": 15089, "total_column_articles": 159, "frontend_question_id": "1457", "is_new_question": false @@ -24498,9 +24708,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": 19691, - "total_submitted": 37048, - "total_column_articles": 285, + "total_acs": 19944, + "total_submitted": 37484, + "total_column_articles": 286, "frontend_question_id": "1456", "is_new_question": false }, @@ -24519,9 +24729,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": 14496, - "total_submitted": 23111, - "total_column_articles": 264, + "total_acs": 14600, + "total_submitted": 23269, + "total_column_articles": 267, "frontend_question_id": "1455", "is_new_question": false }, @@ -24540,9 +24750,9 @@ "question__title": "Evaluate Boolean Expression", "question__title_slug": "evaluate-boolean-expression", "question__hide": false, - "total_acs": 4576, - "total_submitted": 6496, - "total_column_articles": 57, + "total_acs": 4722, + "total_submitted": 6689, + "total_column_articles": 58, "frontend_question_id": "1440", "is_new_question": false }, @@ -24561,8 +24771,8 @@ "question__title": "Create a Session Bar Chart", "question__title_slug": "create-a-session-bar-chart", "question__hide": false, - "total_acs": 5765, - "total_submitted": 9179, + "total_acs": 5841, + "total_submitted": 9276, "total_column_articles": 55, "frontend_question_id": "1435", "is_new_question": false @@ -24582,8 +24792,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": 1900, - "total_submitted": 5090, + "total_acs": 1902, + "total_submitted": 5109, "total_column_articles": 37, "frontend_question_id": "1453", "is_new_question": false @@ -24603,8 +24813,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": 6885, - "total_submitted": 13560, + "total_acs": 6906, + "total_submitted": 13601, "total_column_articles": 105, "frontend_question_id": "1452", "is_new_question": false @@ -24624,8 +24834,8 @@ "question__title": "Rearrange Words in a Sentence", "question__title_slug": "rearrange-words-in-a-sentence", "question__hide": false, - "total_acs": 11813, - "total_submitted": 22181, + "total_acs": 11950, + "total_submitted": 22402, "total_column_articles": 181, "frontend_question_id": "1451", "is_new_question": false @@ -24645,9 +24855,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": 26907, - "total_submitted": 33485, - "total_column_articles": 384, + "total_acs": 27048, + "total_submitted": 33670, + "total_column_articles": 385, "frontend_question_id": "1450", "is_new_question": false }, @@ -24666,8 +24876,8 @@ "question__title": "Cherry Pickup II", "question__title_slug": "cherry-pickup-ii", "question__hide": false, - "total_acs": 3468, - "total_submitted": 5679, + "total_acs": 3519, + "total_submitted": 5765, "total_column_articles": 79, "frontend_question_id": "1463", "is_new_question": false @@ -24687,9 +24897,9 @@ "question__title": "Course Schedule IV", "question__title_slug": "course-schedule-iv", "question__hide": false, - "total_acs": 9204, - "total_submitted": 20526, - "total_column_articles": 178, + "total_acs": 9280, + "total_submitted": 20700, + "total_column_articles": 179, "frontend_question_id": "1462", "is_new_question": false }, @@ -24708,9 +24918,9 @@ "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": 7532, - "total_submitted": 14600, - "total_column_articles": 106, + "total_acs": 7611, + "total_submitted": 14726, + "total_column_articles": 108, "frontend_question_id": "1461", "is_new_question": false }, @@ -24729,9 +24939,9 @@ "question__title": "Make Two Arrays Equal by Reversing Sub-arrays", "question__title_slug": "make-two-arrays-equal-by-reversing-sub-arrays", "question__hide": false, - "total_acs": 18454, - "total_submitted": 24918, - "total_column_articles": 380, + "total_acs": 18567, + "total_submitted": 25071, + "total_column_articles": 383, "frontend_question_id": "1460", "is_new_question": false }, @@ -24750,9 +24960,9 @@ "question__title": "Number of Ways of Cutting a Pizza", "question__title_slug": "number-of-ways-of-cutting-a-pizza", "question__hide": false, - "total_acs": 3205, - "total_submitted": 5985, - "total_column_articles": 72, + "total_acs": 3228, + "total_submitted": 6021, + "total_column_articles": 73, "frontend_question_id": "1444", "is_new_question": false }, @@ -24771,9 +24981,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": 6584, - "total_submitted": 15681, - "total_column_articles": 161, + "total_acs": 6616, + "total_submitted": 15746, + "total_column_articles": 162, "frontend_question_id": "1443", "is_new_question": false }, @@ -24792,9 +25002,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": 36753, - "total_submitted": 46406, - "total_column_articles": 393, + "total_acs": 36840, + "total_submitted": 46499, + "total_column_articles": 394, "frontend_question_id": "1442", "is_new_question": false }, @@ -24813,9 +25023,9 @@ "question__title": "Build an Array With Stack Operations", "question__title_slug": "build-an-array-with-stack-operations", "question__hide": false, - "total_acs": 21636, - "total_submitted": 33264, - "total_column_articles": 439, + "total_acs": 21790, + "total_submitted": 33492, + "total_column_articles": 441, "frontend_question_id": "1441", "is_new_question": false }, @@ -24834,8 +25044,8 @@ "question__title": "NPV Queries", "question__title_slug": "npv-queries", "question__hide": false, - "total_acs": 4661, - "total_submitted": 6477, + "total_acs": 4732, + "total_submitted": 6579, "total_column_articles": 45, "frontend_question_id": "1421", "is_new_question": false @@ -24855,9 +25065,9 @@ "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": 6291, - "total_submitted": 11268, - "total_column_articles": 87, + "total_acs": 6339, + "total_submitted": 11370, + "total_column_articles": 89, "frontend_question_id": "1439", "is_new_question": false }, @@ -24876,9 +25086,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": 38568, - "total_submitted": 78898, - "total_column_articles": 520, + "total_acs": 38824, + "total_submitted": 79356, + "total_column_articles": 522, "frontend_question_id": "1438", "is_new_question": false }, @@ -24897,9 +25107,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": 12987, - "total_submitted": 22555, - "total_column_articles": 217, + "total_acs": 13085, + "total_submitted": 22760, + "total_column_articles": 218, "frontend_question_id": "1437", "is_new_question": false }, @@ -24918,9 +25128,9 @@ "question__title": "Destination City", "question__title_slug": "destination-city", "question__hide": false, - "total_acs": 49002, - "total_submitted": 59728, - "total_column_articles": 704, + "total_acs": 49145, + "total_submitted": 59926, + "total_column_articles": 707, "frontend_question_id": "1436", "is_new_question": false }, @@ -24939,9 +25149,9 @@ "question__title": "Find the Quiet Students in All Exams", "question__title_slug": "find-the-quiet-students-in-all-exams", "question__hide": false, - "total_acs": 4209, - "total_submitted": 7623, - "total_column_articles": 93, + "total_acs": 4381, + "total_submitted": 7868, + "total_column_articles": 97, "frontend_question_id": "1412", "is_new_question": false }, @@ -24960,8 +25170,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": 17724, - "total_submitted": 28320, + "total_acs": 17764, + "total_submitted": 28379, "total_column_articles": 216, "frontend_question_id": "1449", "is_new_question": false @@ -24981,9 +25191,9 @@ "question__title": "Count Good Nodes in Binary Tree", "question__title_slug": "count-good-nodes-in-binary-tree", "question__hide": false, - "total_acs": 14629, - "total_submitted": 20349, - "total_column_articles": 240, + "total_acs": 14789, + "total_submitted": 20556, + "total_column_articles": 243, "frontend_question_id": "1448", "is_new_question": false }, @@ -25002,8 +25212,8 @@ "question__title": "Simplified Fractions", "question__title_slug": "simplified-fractions", "question__hide": false, - "total_acs": 39832, - "total_submitted": 58791, + "total_acs": 39890, + "total_submitted": 58877, "total_column_articles": 512, "frontend_question_id": "1447", "is_new_question": false @@ -25023,9 +25233,9 @@ "question__title": "Consecutive Characters", "question__title_slug": "consecutive-characters", "question__hide": false, - "total_acs": 54148, - "total_submitted": 88776, - "total_column_articles": 722, + "total_acs": 54295, + "total_submitted": 89072, + "total_column_articles": 725, "frontend_question_id": "1446", "is_new_question": false }, @@ -25044,9 +25254,9 @@ "question__title": "Top Travellers", "question__title_slug": "top-travellers", "question__hide": false, - "total_acs": 13847, - "total_submitted": 21163, - "total_column_articles": 133, + "total_acs": 14718, + "total_submitted": 22904, + "total_column_articles": 138, "frontend_question_id": "1407", "is_new_question": false }, @@ -25065,9 +25275,9 @@ "question__title": "Diagonal Traverse II", "question__title_slug": "diagonal-traverse-ii", "question__hide": false, - "total_acs": 8493, - "total_submitted": 20598, - "total_column_articles": 177, + "total_acs": 8571, + "total_submitted": 20772, + "total_column_articles": 178, "frontend_question_id": "1424", "is_new_question": false }, @@ -25086,9 +25296,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": 41332, - "total_submitted": 74508, - "total_column_articles": 587, + "total_acs": 41743, + "total_submitted": 75273, + "total_column_articles": 588, "frontend_question_id": "1423", "is_new_question": false }, @@ -25107,9 +25317,9 @@ "question__title": "Maximum Score After Splitting a String", "question__title_slug": "maximum-score-after-splitting-a-string", "question__hide": false, - "total_acs": 12711, - "total_submitted": 23451, - "total_column_articles": 245, + "total_acs": 12803, + "total_submitted": 23618, + "total_column_articles": 246, "frontend_question_id": "1422", "is_new_question": false }, @@ -25128,9 +25338,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": 7037, - "total_submitted": 9400, - "total_column_articles": 98, + "total_acs": 7199, + "total_submitted": 9623, + "total_column_articles": 101, "frontend_question_id": "1398", "is_new_question": false }, @@ -25149,8 +25359,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": 2977, - "total_submitted": 4807, + "total_acs": 2994, + "total_submitted": 4831, "total_column_articles": 55, "frontend_question_id": "1420", "is_new_question": false @@ -25170,9 +25380,9 @@ "question__title": "Minimum Number of Frogs Croaking", "question__title_slug": "minimum-number-of-frogs-croaking", "question__hide": false, - "total_acs": 9408, - "total_submitted": 21883, - "total_column_articles": 185, + "total_acs": 9491, + "total_submitted": 22095, + "total_column_articles": 186, "frontend_question_id": "1419", "is_new_question": false }, @@ -25191,9 +25401,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": 27326, - "total_submitted": 37371, - "total_column_articles": 431, + "total_acs": 27395, + "total_submitted": 37477, + "total_column_articles": 433, "frontend_question_id": "1418", "is_new_question": false }, @@ -25212,8 +25422,8 @@ "question__title": "Reformat The String", "question__title_slug": "reformat-the-string", "question__hide": false, - "total_acs": 15130, - "total_submitted": 29055, + "total_acs": 15230, + "total_submitted": 29268, "total_column_articles": 222, "frontend_question_id": "1417", "is_new_question": false @@ -25233,9 +25443,9 @@ "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": 3198, - "total_submitted": 6513, - "total_column_articles": 55, + "total_acs": 3227, + "total_submitted": 6557, + "total_column_articles": 56, "frontend_question_id": "1434", "is_new_question": false }, @@ -25254,8 +25464,8 @@ "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": 7013, - "total_submitted": 10927, + "total_acs": 7060, + "total_submitted": 10999, "total_column_articles": 130, "frontend_question_id": "1433", "is_new_question": false @@ -25275,9 +25485,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": 5279, - "total_submitted": 13291, - "total_column_articles": 116, + "total_acs": 5318, + "total_submitted": 13404, + "total_column_articles": 119, "frontend_question_id": "1432", "is_new_question": false }, @@ -25296,9 +25506,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": 83435, - "total_submitted": 98698, - "total_column_articles": 1099, + "total_acs": 83654, + "total_submitted": 98961, + "total_column_articles": 1101, "frontend_question_id": "1431", "is_new_question": false }, @@ -25317,8 +25527,8 @@ "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": 8796, - "total_submitted": 15759, + "total_acs": 8825, + "total_submitted": 15801, "total_column_articles": 150, "frontend_question_id": "1411", "is_new_question": false @@ -25338,8 +25548,8 @@ "question__title": "HTML Entity Parser", "question__title_slug": "html-entity-parser", "question__hide": false, - "total_acs": 8322, - "total_submitted": 17481, + "total_acs": 8353, + "total_submitted": 17562, "total_column_articles": 127, "frontend_question_id": "1410", "is_new_question": false @@ -25359,9 +25569,9 @@ "question__title": "Queries on a Permutation With Key", "question__title_slug": "queries-on-a-permutation-with-key", "question__hide": false, - "total_acs": 9534, - "total_submitted": 11753, - "total_column_articles": 161, + "total_acs": 9587, + "total_submitted": 11818, + "total_column_articles": 163, "frontend_question_id": "1409", "is_new_question": false }, @@ -25380,9 +25590,9 @@ "question__title": "String Matching in an Array", "question__title_slug": "string-matching-in-an-array", "question__hide": false, - "total_acs": 16296, - "total_submitted": 26361, - "total_column_articles": 243, + "total_acs": 16406, + "total_submitted": 26535, + "total_column_articles": 244, "frontend_question_id": "1408", "is_new_question": false }, @@ -25401,9 +25611,9 @@ "question__title": "Capital Gain/Loss", "question__title_slug": "capital-gainloss", "question__hide": false, - "total_acs": 11253, - "total_submitted": 13253, - "total_column_articles": 122, + "total_acs": 12057, + "total_submitted": 14207, + "total_column_articles": 130, "frontend_question_id": "1393", "is_new_question": false }, @@ -25422,9 +25632,9 @@ "question__title": "Stone Game III", "question__title_slug": "stone-game-iii", "question__hide": false, - "total_acs": 6276, - "total_submitted": 10712, - "total_column_articles": 96, + "total_acs": 6342, + "total_submitted": 10815, + "total_column_articles": 98, "frontend_question_id": "1406", "is_new_question": false }, @@ -25443,9 +25653,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": 8368, - "total_submitted": 16726, - "total_column_articles": 173, + "total_acs": 8422, + "total_submitted": 16845, + "total_column_articles": 174, "frontend_question_id": "1404", "is_new_question": false }, @@ -25464,8 +25674,8 @@ "question__title": "Minimum Subsequence in Non-Increasing Order", "question__title_slug": "minimum-subsequence-in-non-increasing-order", "question__hide": false, - "total_acs": 24534, - "total_submitted": 35608, + "total_acs": 24646, + "total_submitted": 35754, "total_column_articles": 420, "frontend_question_id": "1403", "is_new_question": false @@ -25485,9 +25695,9 @@ "question__title": "Total Sales Amount by Year", "question__title_slug": "total-sales-amount-by-year", "question__hide": false, - "total_acs": 3072, - "total_submitted": 5407, - "total_column_articles": 69, + "total_acs": 3171, + "total_submitted": 5549, + "total_column_articles": 70, "frontend_question_id": "1384", "is_new_question": false }, @@ -25506,8 +25716,8 @@ "question__title": "Restore The Array", "question__title_slug": "restore-the-array", "question__hide": false, - "total_acs": 3293, - "total_submitted": 7902, + "total_acs": 3312, + "total_submitted": 7943, "total_column_articles": 62, "frontend_question_id": "1416", "is_new_question": false @@ -25527,9 +25737,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": 7695, - "total_submitted": 11221, - "total_column_articles": 205, + "total_acs": 7730, + "total_submitted": 11274, + "total_column_articles": 206, "frontend_question_id": "1415", "is_new_question": false }, @@ -25548,9 +25758,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": 28603, - "total_submitted": 40509, - "total_column_articles": 430, + "total_acs": 28651, + "total_submitted": 40591, + "total_column_articles": 431, "frontend_question_id": "1414", "is_new_question": false }, @@ -25569,9 +25779,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": 14265, - "total_submitted": 20482, - "total_column_articles": 303, + "total_acs": 14425, + "total_submitted": 20717, + "total_column_articles": 305, "frontend_question_id": "1413", "is_new_question": false }, @@ -25590,8 +25800,8 @@ "question__title": "Find All Good Strings", "question__title_slug": "find-all-good-strings", "question__hide": false, - "total_acs": 1297, - "total_submitted": 3178, + "total_acs": 1307, + "total_submitted": 3192, "total_column_articles": 41, "frontend_question_id": "1397", "is_new_question": false @@ -25611,9 +25821,9 @@ "question__title": "Design Underground System", "question__title_slug": "design-underground-system", "question__hide": false, - "total_acs": 16186, - "total_submitted": 39505, - "total_column_articles": 219, + "total_acs": 16508, + "total_submitted": 40372, + "total_column_articles": 222, "frontend_question_id": "1396", "is_new_question": false }, @@ -25632,9 +25842,9 @@ "question__title": "Count Number of Teams", "question__title_slug": "count-number-of-teams", "question__hide": false, - "total_acs": 16582, - "total_submitted": 22888, - "total_column_articles": 244, + "total_acs": 17091, + "total_submitted": 23540, + "total_column_articles": 246, "frontend_question_id": "1395", "is_new_question": false }, @@ -25653,9 +25863,9 @@ "question__title": "Find Lucky Integer in an Array", "question__title_slug": "find-lucky-integer-in-an-array", "question__hide": false, - "total_acs": 20818, - "total_submitted": 31472, - "total_column_articles": 349, + "total_acs": 20975, + "total_submitted": 31726, + "total_column_articles": 351, "frontend_question_id": "1394", "is_new_question": false }, @@ -25674,8 +25884,8 @@ "question__title": "Replace Employee ID With The Unique Identifier", "question__title_slug": "replace-employee-id-with-the-unique-identifier", "question__hide": false, - "total_acs": 9288, - "total_submitted": 10696, + "total_acs": 9376, + "total_submitted": 10789, "total_column_articles": 72, "frontend_question_id": "1378", "is_new_question": false @@ -25695,9 +25905,9 @@ "question__title": "Longest Happy Prefix", "question__title_slug": "longest-happy-prefix", "question__hide": false, - "total_acs": 11084, - "total_submitted": 25727, - "total_column_articles": 191, + "total_acs": 11205, + "total_submitted": 25949, + "total_column_articles": 192, "frontend_question_id": "1392", "is_new_question": false }, @@ -25716,9 +25926,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": 7591, - "total_submitted": 18600, - "total_column_articles": 233, + "total_acs": 7660, + "total_submitted": 18731, + "total_column_articles": 236, "frontend_question_id": "1391", "is_new_question": false }, @@ -25737,8 +25947,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": 31613, - "total_submitted": 38046, + "total_acs": 31717, + "total_submitted": 38167, "total_column_articles": 521, "frontend_question_id": "1389", "is_new_question": false @@ -25758,9 +25968,9 @@ "question__title": "Get the Second Most Recent Activity", "question__title_slug": "get-the-second-most-recent-activity", "question__hide": false, - "total_acs": 4216, - "total_submitted": 6937, - "total_column_articles": 65, + "total_acs": 4317, + "total_submitted": 7069, + "total_column_articles": 67, "frontend_question_id": "1369", "is_new_question": false }, @@ -25779,8 +25989,8 @@ "question__title": "Reducing Dishes", "question__title_slug": "reducing-dishes", "question__hide": false, - "total_acs": 11966, - "total_submitted": 15780, + "total_acs": 12049, + "total_submitted": 15886, "total_column_articles": 212, "frontend_question_id": "1402", "is_new_question": false @@ -25800,8 +26010,8 @@ "question__title": "Construct K Palindrome Strings", "question__title_slug": "construct-k-palindrome-strings", "question__hide": false, - "total_acs": 7727, - "total_submitted": 12654, + "total_acs": 7792, + "total_submitted": 12745, "total_column_articles": 127, "frontend_question_id": "1400", "is_new_question": false @@ -25821,9 +26031,9 @@ "question__title": "Circle and Rectangle Overlapping", "question__title_slug": "circle-and-rectangle-overlapping", "question__hide": false, - "total_acs": 4767, - "total_submitted": 11268, - "total_column_articles": 107, + "total_acs": 4814, + "total_submitted": 11340, + "total_column_articles": 108, "frontend_question_id": "1401", "is_new_question": false }, @@ -25842,9 +26052,9 @@ "question__title": "Count Largest Group", "question__title_slug": "count-largest-group", "question__hide": false, - "total_acs": 11351, - "total_submitted": 16946, - "total_column_articles": 183, + "total_acs": 11419, + "total_submitted": 17061, + "total_column_articles": 185, "frontend_question_id": "1399", "is_new_question": false }, @@ -25863,9 +26073,9 @@ "question__title": "Maximum Performance of a Team", "question__title_slug": "maximum-performance-of-a-team", "question__hide": false, - "total_acs": 5335, - "total_submitted": 16021, - "total_column_articles": 99, + "total_acs": 5370, + "total_submitted": 16096, + "total_column_articles": 100, "frontend_question_id": "1383", "is_new_question": false }, @@ -25884,9 +26094,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": 12613, - "total_submitted": 15016, - "total_column_articles": 190, + "total_acs": 12716, + "total_submitted": 15147, + "total_column_articles": 192, "frontend_question_id": "1379", "is_new_question": false }, @@ -25905,9 +26115,9 @@ "question__title": "Design a Stack With Increment Operation", "question__title_slug": "design-a-stack-with-increment-operation", "question__hide": false, - "total_acs": 14934, - "total_submitted": 20464, - "total_column_articles": 190, + "total_acs": 15027, + "total_submitted": 20585, + "total_column_articles": 191, "frontend_question_id": "1381", "is_new_question": false }, @@ -25926,9 +26136,9 @@ "question__title": "Lucky Numbers in a Matrix", "question__title_slug": "lucky-numbers-in-a-matrix", "question__hide": false, - "total_acs": 52740, - "total_submitted": 68634, - "total_column_articles": 707, + "total_acs": 52854, + "total_submitted": 68807, + "total_column_articles": 708, "frontend_question_id": "1380", "is_new_question": false }, @@ -25947,8 +26157,8 @@ "question__title": "Number of Trusted Contacts of a Customer", "question__title_slug": "number-of-trusted-contacts-of-a-customer", "question__hide": false, - "total_acs": 4860, - "total_submitted": 7074, + "total_acs": 4914, + "total_submitted": 7143, "total_column_articles": 81, "frontend_question_id": "1364", "is_new_question": false @@ -25968,8 +26178,8 @@ "question__title": "Activity Participants", "question__title_slug": "activity-participants", "question__hide": false, - "total_acs": 5629, - "total_submitted": 8406, + "total_acs": 5701, + "total_submitted": 8519, "total_column_articles": 73, "frontend_question_id": "1355", "is_new_question": false @@ -25989,9 +26199,9 @@ "question__title": "Frog Position After T Seconds", "question__title_slug": "frog-position-after-t-seconds", "question__hide": false, - "total_acs": 5017, - "total_submitted": 15088, - "total_column_articles": 146, + "total_acs": 5065, + "total_submitted": 15231, + "total_column_articles": 147, "frontend_question_id": "1377", "is_new_question": false }, @@ -26010,9 +26220,9 @@ "question__title": "Time Needed to Inform All Employees", "question__title_slug": "time-needed-to-inform-all-employees", "question__hide": false, - "total_acs": 11268, - "total_submitted": 21167, - "total_column_articles": 224, + "total_acs": 11460, + "total_submitted": 21480, + "total_column_articles": 225, "frontend_question_id": "1376", "is_new_question": false }, @@ -26031,8 +26241,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": 9601, - "total_submitted": 16404, + "total_acs": 9638, + "total_submitted": 16460, "total_column_articles": 191, "frontend_question_id": "1375", "is_new_question": false @@ -26052,8 +26262,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": 19089, - "total_submitted": 25641, + "total_acs": 19168, + "total_submitted": 25743, "total_column_articles": 254, "frontend_question_id": "1374", "is_new_question": false @@ -26073,9 +26283,9 @@ "question__title": "Pizza With 3n Slices", "question__title_slug": "pizza-with-3n-slices", "question__hide": false, - "total_acs": 5646, - "total_submitted": 10140, - "total_column_articles": 65, + "total_acs": 5705, + "total_submitted": 10227, + "total_column_articles": 66, "frontend_question_id": "1388", "is_new_question": false }, @@ -26094,9 +26304,9 @@ "question__title": "Sort Integers by The Power Value", "question__title_slug": "sort-integers-by-the-power-value", "question__hide": false, - "total_acs": 11569, - "total_submitted": 16670, - "total_column_articles": 209, + "total_acs": 11724, + "total_submitted": 16881, + "total_column_articles": 210, "frontend_question_id": "1387", "is_new_question": false }, @@ -26115,8 +26325,8 @@ "question__title": "Cinema Seat Allocation", "question__title_slug": "cinema-seat-allocation", "question__hide": false, - "total_acs": 7419, - "total_submitted": 22756, + "total_acs": 7524, + "total_submitted": 23033, "total_column_articles": 145, "frontend_question_id": "1386", "is_new_question": false @@ -26136,9 +26346,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": 24790, - "total_submitted": 37493, - "total_column_articles": 345, + "total_acs": 25597, + "total_submitted": 38929, + "total_column_articles": 350, "frontend_question_id": "1385", "is_new_question": false }, @@ -26157,9 +26367,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": 5682, - "total_submitted": 9964, - "total_column_articles": 124, + "total_acs": 5793, + "total_submitted": 10127, + "total_column_articles": 127, "frontend_question_id": "1368", "is_new_question": false }, @@ -26178,9 +26388,9 @@ "question__title": "Linked List in Binary Tree", "question__title_slug": "linked-list-in-binary-tree", "question__hide": false, - "total_acs": 19209, - "total_submitted": 44754, - "total_column_articles": 296, + "total_acs": 19429, + "total_submitted": 45226, + "total_column_articles": 297, "frontend_question_id": "1367", "is_new_question": false }, @@ -26199,9 +26409,9 @@ "question__title": "Rank Teams by Votes", "question__title_slug": "rank-teams-by-votes", "question__hide": false, - "total_acs": 8360, - "total_submitted": 15467, - "total_column_articles": 158, + "total_acs": 8450, + "total_submitted": 15600, + "total_column_articles": 160, "frontend_question_id": "1366", "is_new_question": false }, @@ -26220,9 +26430,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": 95612, - "total_submitted": 115979, - "total_column_articles": 1190, + "total_acs": 96406, + "total_submitted": 116964, + "total_column_articles": 1194, "frontend_question_id": "1365", "is_new_question": false }, @@ -26241,9 +26451,9 @@ "question__title": "Students With Invalid Departments", "question__title_slug": "students-with-invalid-departments", "question__hide": false, - "total_acs": 10766, - "total_submitted": 12683, - "total_column_articles": 96, + "total_acs": 10867, + "total_submitted": 12799, + "total_column_articles": 98, "frontend_question_id": "1350", "is_new_question": false }, @@ -26262,9 +26472,9 @@ "question__title": "Movie Rating", "question__title_slug": "movie-rating", "question__hide": false, - "total_acs": 4970, - "total_submitted": 12605, - "total_column_articles": 67, + "total_acs": 5142, + "total_submitted": 12911, + "total_column_articles": 71, "frontend_question_id": "1341", "is_new_question": false }, @@ -26283,9 +26493,9 @@ "question__title": "Construct Target Array With Multiple Sums", "question__title_slug": "construct-target-array-with-multiple-sums", "question__hide": false, - "total_acs": 3343, - "total_submitted": 11899, - "total_column_articles": 77, + "total_acs": 3476, + "total_submitted": 12223, + "total_column_articles": 78, "frontend_question_id": "1354", "is_new_question": false }, @@ -26304,9 +26514,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": 14821, - "total_submitted": 50620, - "total_column_articles": 184, + "total_acs": 14965, + "total_submitted": 51104, + "total_column_articles": 186, "frontend_question_id": "1353", "is_new_question": false }, @@ -26325,9 +26535,9 @@ "question__title": "Product of the Last K Numbers", "question__title_slug": "product-of-the-last-k-numbers", "question__hide": false, - "total_acs": 8611, - "total_submitted": 18712, - "total_column_articles": 99, + "total_acs": 8730, + "total_submitted": 18942, + "total_column_articles": 101, "frontend_question_id": "1352", "is_new_question": false }, @@ -26346,9 +26556,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": 39577, - "total_submitted": 52699, - "total_column_articles": 656, + "total_acs": 40199, + "total_submitted": 53558, + "total_column_articles": 655, "frontend_question_id": "1351", "is_new_question": false }, @@ -26367,9 +26577,9 @@ "question__title": "Maximum Sum BST in Binary Tree", "question__title_slug": "maximum-sum-bst-in-binary-tree", "question__hide": false, - "total_acs": 14477, - "total_submitted": 34445, - "total_column_articles": 267, + "total_acs": 14645, + "total_submitted": 34818, + "total_column_articles": 268, "frontend_question_id": "1373", "is_new_question": false }, @@ -26388,8 +26598,8 @@ "question__title": "Longest ZigZag Path in a Binary Tree", "question__title_slug": "longest-zigzag-path-in-a-binary-tree", "question__hide": false, - "total_acs": 10497, - "total_submitted": 19913, + "total_acs": 10621, + "total_submitted": 20135, "total_column_articles": 196, "frontend_question_id": "1372", "is_new_question": false @@ -26409,8 +26619,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": 23067, - "total_submitted": 39669, + "total_acs": 23123, + "total_submitted": 39748, "total_column_articles": 289, "frontend_question_id": "1371", "is_new_question": false @@ -26430,8 +26640,8 @@ "question__title": "Increasing Decreasing String", "question__title_slug": "increasing-decreasing-string", "question__hide": false, - "total_acs": 50459, - "total_submitted": 63906, + "total_acs": 50583, + "total_submitted": 64105, "total_column_articles": 608, "frontend_question_id": "1370", "is_new_question": false @@ -26451,8 +26661,8 @@ "question__title": "Maximum Students Taking Exam", "question__title_slug": "maximum-students-taking-exam", "question__hide": false, - "total_acs": 4100, - "total_submitted": 7823, + "total_acs": 4138, + "total_submitted": 7891, "total_column_articles": 111, "frontend_question_id": "1349", "is_new_question": false @@ -26472,8 +26682,8 @@ "question__title": "Tweet Counts Per Frequency", "question__title_slug": "tweet-counts-per-frequency", "question__hide": false, - "total_acs": 4260, - "total_submitted": 13092, + "total_acs": 4401, + "total_submitted": 13448, "total_column_articles": 68, "frontend_question_id": "1348", "is_new_question": false @@ -26493,9 +26703,9 @@ "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": 9602, - "total_submitted": 12792, - "total_column_articles": 150, + "total_acs": 9701, + "total_submitted": 12916, + "total_column_articles": 152, "frontend_question_id": "1347", "is_new_question": false }, @@ -26514,9 +26724,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": 23369, - "total_submitted": 54587, - "total_column_articles": 393, + "total_acs": 23791, + "total_submitted": 55621, + "total_column_articles": 397, "frontend_question_id": "1346", "is_new_question": false }, @@ -26535,8 +26745,8 @@ "question__title": "Number of Transactions per Visit", "question__title_slug": "number-of-transactions-per-visit", "question__hide": false, - "total_acs": 2674, - "total_submitted": 5947, + "total_acs": 2739, + "total_submitted": 6072, "total_column_articles": 65, "frontend_question_id": "1336", "is_new_question": false @@ -26556,9 +26766,9 @@ "question__title": "Jump Game V", "question__title_slug": "jump-game-v", "question__hide": false, - "total_acs": 5542, - "total_submitted": 9532, - "total_column_articles": 113, + "total_acs": 5582, + "total_submitted": 9601, + "total_column_articles": 114, "frontend_question_id": "1340", "is_new_question": false }, @@ -26577,9 +26787,9 @@ "question__title": "Maximum Product of Splitted Binary Tree", "question__title_slug": "maximum-product-of-splitted-binary-tree", "question__hide": false, - "total_acs": 10361, - "total_submitted": 25383, - "total_column_articles": 160, + "total_acs": 10480, + "total_submitted": 25670, + "total_column_articles": 163, "frontend_question_id": "1339", "is_new_question": false }, @@ -26598,9 +26808,9 @@ "question__title": "Reduce Array Size to The Half", "question__title_slug": "reduce-array-size-to-the-half", "question__hide": false, - "total_acs": 10850, - "total_submitted": 16872, - "total_column_articles": 159, + "total_acs": 10916, + "total_submitted": 16966, + "total_column_articles": 160, "frontend_question_id": "1338", "is_new_question": false }, @@ -26619,9 +26829,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": 48971, - "total_submitted": 70918, - "total_column_articles": 780, + "total_acs": 49377, + "total_submitted": 71561, + "total_column_articles": 786, "frontend_question_id": "1337", "is_new_question": false }, @@ -26640,9 +26850,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": 7608, - "total_submitted": 11068, - "total_column_articles": 70, + "total_acs": 7691, + "total_submitted": 11179, + "total_column_articles": 71, "frontend_question_id": "1327", "is_new_question": false }, @@ -26661,8 +26871,8 @@ "question__title": "Count All Valid Pickup and Delivery Options", "question__title_slug": "count-all-valid-pickup-and-delivery-options", "question__hide": false, - "total_acs": 3548, - "total_submitted": 6336, + "total_acs": 3568, + "total_submitted": 6373, "total_column_articles": 81, "frontend_question_id": "1359", "is_new_question": false @@ -26682,9 +26892,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": 8024, - "total_submitted": 15521, - "total_column_articles": 148, + "total_acs": 8133, + "total_submitted": 15703, + "total_column_articles": 150, "frontend_question_id": "1358", "is_new_question": false }, @@ -26703,9 +26913,9 @@ "question__title": "Apply Discount Every n Orders", "question__title_slug": "apply-discount-every-n-orders", "question__hide": false, - "total_acs": 5478, - "total_submitted": 10255, - "total_column_articles": 57, + "total_acs": 5558, + "total_submitted": 10408, + "total_column_articles": 58, "frontend_question_id": "1357", "is_new_question": false }, @@ -26724,9 +26934,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": 52103, - "total_submitted": 71288, - "total_column_articles": 594, + "total_acs": 52498, + "total_submitted": 71813, + "total_column_articles": 600, "frontend_question_id": "1356", "is_new_question": false }, @@ -26745,8 +26955,8 @@ "question__title": "Minimum Difficulty of a Job Schedule", "question__title_slug": "minimum-difficulty-of-a-job-schedule", "question__hide": false, - "total_acs": 4430, - "total_submitted": 7448, + "total_acs": 4476, + "total_submitted": 7544, "total_column_articles": 70, "frontend_question_id": "1335", "is_new_question": false @@ -26766,9 +26976,9 @@ "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": 8030, - "total_submitted": 15702, - "total_column_articles": 121, + "total_acs": 8101, + "total_submitted": 15845, + "total_column_articles": 123, "frontend_question_id": "1334", "is_new_question": false }, @@ -26787,8 +26997,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": 6701, - "total_submitted": 12101, + "total_acs": 6747, + "total_submitted": 12173, "total_column_articles": 138, "frontend_question_id": "1333", "is_new_question": false @@ -26808,8 +27018,8 @@ "question__title": "Remove Palindromic Subsequences", "question__title_slug": "remove-palindromic-subsequences", "question__hide": false, - "total_acs": 32187, - "total_submitted": 41274, + "total_acs": 32296, + "total_submitted": 41437, "total_column_articles": 339, "frontend_question_id": "1332", "is_new_question": false @@ -26829,9 +27039,9 @@ "question__title": "Ads Performance", "question__title_slug": "ads-performance", "question__hide": false, - "total_acs": 7519, - "total_submitted": 12646, - "total_column_articles": 78, + "total_acs": 7612, + "total_submitted": 12796, + "total_column_articles": 80, "frontend_question_id": "1322", "is_new_question": false }, @@ -26850,9 +27060,9 @@ "question__title": "Restaurant Growth", "question__title_slug": "restaurant-growth", "question__hide": false, - "total_acs": 7025, - "total_submitted": 11230, - "total_column_articles": 115, + "total_acs": 7209, + "total_submitted": 11483, + "total_column_articles": 117, "frontend_question_id": "1321", "is_new_question": false }, @@ -26871,8 +27081,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": 6914, - "total_submitted": 14490, + "total_acs": 6962, + "total_submitted": 14604, "total_column_articles": 103, "frontend_question_id": "1326", "is_new_question": false @@ -26892,9 +27102,9 @@ "question__title": "Delete Leaves With a Given Value", "question__title_slug": "delete-leaves-with-a-given-value", "question__hide": false, - "total_acs": 13259, - "total_submitted": 18148, - "total_column_articles": 221, + "total_acs": 13382, + "total_submitted": 18307, + "total_column_articles": 222, "frontend_question_id": "1325", "is_new_question": false }, @@ -26913,9 +27123,9 @@ "question__title": "Print Words Vertically", "question__title_slug": "print-words-vertically", "question__hide": false, - "total_acs": 7180, - "total_submitted": 12201, - "total_column_articles": 147, + "total_acs": 7226, + "total_submitted": 12265, + "total_column_articles": 149, "frontend_question_id": "1324", "is_new_question": false }, @@ -26934,9 +27144,9 @@ "question__title": "Maximum 69 Number", "question__title_slug": "maximum-69-number", "question__hide": false, - "total_acs": 29518, - "total_submitted": 39195, - "total_column_articles": 559, + "total_acs": 29782, + "total_submitted": 39601, + "total_column_articles": 561, "frontend_question_id": "1323", "is_new_question": false }, @@ -26955,9 +27165,9 @@ "question__title": "Jump Game IV", "question__title_slug": "jump-game-iv", "question__hide": false, - "total_acs": 25492, - "total_submitted": 54660, - "total_column_articles": 278, + "total_acs": 25560, + "total_submitted": 54863, + "total_column_articles": 279, "frontend_question_id": "1345", "is_new_question": false }, @@ -26976,8 +27186,8 @@ "question__title": "Angle Between Hands of a Clock", "question__title_slug": "angle-between-hands-of-a-clock", "question__hide": false, - "total_acs": 7829, - "total_submitted": 13063, + "total_acs": 7920, + "total_submitted": 13229, "total_column_articles": 144, "frontend_question_id": "1344", "is_new_question": false @@ -26997,9 +27207,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": 14916, - "total_submitted": 26780, - "total_column_articles": 256, + "total_acs": 15088, + "total_submitted": 27012, + "total_column_articles": 257, "frontend_question_id": "1343", "is_new_question": false }, @@ -27018,9 +27228,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": 71418, - "total_submitted": 86707, - "total_column_articles": 986, + "total_acs": 73098, + "total_submitted": 88874, + "total_column_articles": 1005, "frontend_question_id": "1342", "is_new_question": false }, @@ -27039,8 +27249,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": 2898, - "total_submitted": 4886, + "total_acs": 2918, + "total_submitted": 4929, "total_column_articles": 68, "frontend_question_id": "1320", "is_new_question": false @@ -27060,9 +27270,9 @@ "question__title": "Number of Operations to Make Network Connected", "question__title_slug": "number-of-operations-to-make-network-connected", "question__hide": false, - "total_acs": 37679, - "total_submitted": 60757, - "total_column_articles": 595, + "total_acs": 37931, + "total_submitted": 61114, + "total_column_articles": 597, "frontend_question_id": "1319", "is_new_question": false }, @@ -27081,9 +27291,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": 7486, - "total_submitted": 11344, - "total_column_articles": 133, + "total_acs": 7530, + "total_submitted": 11420, + "total_column_articles": 136, "frontend_question_id": "1318", "is_new_question": false }, @@ -27102,8 +27312,8 @@ "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": 12087, - "total_submitted": 19545, + "total_acs": 12157, + "total_submitted": 19663, "total_column_articles": 229, "frontend_question_id": "1317", "is_new_question": false @@ -27123,9 +27333,9 @@ "question__title": "Running Total for Different Genders", "question__title_slug": "running-total-for-different-genders", "question__hide": false, - "total_acs": 8098, - "total_submitted": 10799, - "total_column_articles": 79, + "total_acs": 8323, + "total_submitted": 11156, + "total_column_articles": 84, "frontend_question_id": "1308", "is_new_question": false }, @@ -27144,9 +27354,9 @@ "question__title": "Find the Team Size", "question__title_slug": "find-the-team-size", "question__hide": false, - "total_acs": 13587, - "total_submitted": 16517, - "total_column_articles": 127, + "total_acs": 13974, + "total_submitted": 16994, + "total_column_articles": 132, "frontend_question_id": "1303", "is_new_question": false }, @@ -27165,9 +27375,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": 16238, - "total_submitted": 23837, - "total_column_articles": 193, + "total_acs": 16575, + "total_submitted": 24334, + "total_column_articles": 194, "frontend_question_id": "1312", "is_new_question": false }, @@ -27186,8 +27396,8 @@ "question__title": "Get Watched Videos by Your Friends", "question__title_slug": "get-watched-videos-by-your-friends", "question__hide": false, - "total_acs": 6472, - "total_submitted": 16659, + "total_acs": 6506, + "total_submitted": 16742, "total_column_articles": 98, "frontend_question_id": "1311", "is_new_question": false @@ -27207,9 +27417,9 @@ "question__title": "XOR Queries of a Subarray", "question__title_slug": "xor-queries-of-a-subarray", "question__hide": false, - "total_acs": 39818, - "total_submitted": 55498, - "total_column_articles": 524, + "total_acs": 39918, + "total_submitted": 55634, + "total_column_articles": 525, "frontend_question_id": "1310", "is_new_question": false }, @@ -27228,9 +27438,9 @@ "question__title": "Decrypt String from Alphabet to Integer Mapping", "question__title_slug": "decrypt-string-from-alphabet-to-integer-mapping", "question__hide": false, - "total_acs": 21654, - "total_submitted": 28323, - "total_column_articles": 387, + "total_acs": 21870, + "total_submitted": 28631, + "total_column_articles": 389, "frontend_question_id": "1309", "is_new_question": false }, @@ -27249,8 +27459,8 @@ "question__title": "Encrypt and Decrypt Strings", "question__title_slug": "encrypt-and-decrypt-strings", "question__hide": false, - "total_acs": 4635, - "total_submitted": 12022, + "total_acs": 4695, + "total_submitted": 12155, "total_column_articles": 78, "frontend_question_id": "2227", "is_new_question": false @@ -27270,8 +27480,8 @@ "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": 1025, - "total_submitted": 1860, + "total_acs": 1037, + "total_submitted": 1896, "total_column_articles": 44, "frontend_question_id": "1430", "is_new_question": false @@ -27291,8 +27501,8 @@ "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": 4526, - "total_submitted": 10781, + "total_acs": 4583, + "total_submitted": 10919, "total_column_articles": 91, "frontend_question_id": "2192", "is_new_question": false @@ -27312,9 +27522,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": 5790, - "total_submitted": 8984, - "total_column_articles": 61, + "total_acs": 6028, + "total_submitted": 9408, + "total_column_articles": 65, "frontend_question_id": "2269", "is_new_question": false }, @@ -27333,8 +27543,8 @@ "question__title": "Verbal Arithmetic Puzzle", "question__title_slug": "verbal-arithmetic-puzzle", "question__hide": false, - "total_acs": 2061, - "total_submitted": 6210, + "total_acs": 2070, + "total_submitted": 6233, "total_column_articles": 62, "frontend_question_id": "1307", "is_new_question": false @@ -27354,9 +27564,9 @@ "question__title": "Jump Game III", "question__title_slug": "jump-game-iii", "question__hide": false, - "total_acs": 24156, - "total_submitted": 41496, - "total_column_articles": 371, + "total_acs": 24421, + "total_submitted": 41954, + "total_column_articles": 372, "frontend_question_id": "1306", "is_new_question": false }, @@ -27375,9 +27585,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": 47209, - "total_submitted": 60381, - "total_column_articles": 651, + "total_acs": 47360, + "total_submitted": 60596, + "total_column_articles": 650, "frontend_question_id": "1305", "is_new_question": false }, @@ -27396,9 +27606,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": 24569, - "total_submitted": 34349, - "total_column_articles": 427, + "total_acs": 24706, + "total_submitted": 34562, + "total_column_articles": 428, "frontend_question_id": "1304", "is_new_question": false }, @@ -27417,9 +27627,9 @@ "question__title": "Weather Type in Each Country", "question__title_slug": "weather-type-in-each-country", "question__hide": false, - "total_acs": 10289, - "total_submitted": 15697, - "total_column_articles": 106, + "total_acs": 10494, + "total_submitted": 16022, + "total_column_articles": 108, "frontend_question_id": "1294", "is_new_question": false }, @@ -27438,9 +27648,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": 3030, - "total_submitted": 5087, - "total_column_articles": 99, + "total_acs": 3052, + "total_submitted": 5117, + "total_column_articles": 100, "frontend_question_id": "1298", "is_new_question": false }, @@ -27459,9 +27669,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": 8224, - "total_submitted": 17523, - "total_column_articles": 108, + "total_acs": 8308, + "total_submitted": 17701, + "total_column_articles": 110, "frontend_question_id": "1297", "is_new_question": false }, @@ -27480,9 +27690,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": 10514, - "total_submitted": 21717, - "total_column_articles": 155, + "total_acs": 10594, + "total_submitted": 21893, + "total_column_articles": 156, "frontend_question_id": "1296", "is_new_question": false }, @@ -27501,9 +27711,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": 52742, - "total_submitted": 65429, - "total_column_articles": 699, + "total_acs": 52952, + "total_submitted": 65703, + "total_column_articles": 701, "frontend_question_id": "1295", "is_new_question": false }, @@ -27522,9 +27732,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": 6869, - "total_submitted": 8431, - "total_column_articles": 85, + "total_acs": 7062, + "total_submitted": 8658, + "total_column_articles": 87, "frontend_question_id": "1285", "is_new_question": false }, @@ -27543,9 +27753,9 @@ "question__title": "Make Array Non-decreasing or Non-increasing", "question__title_slug": "make-array-non-decreasing-or-non-increasing", "question__hide": false, - "total_acs": 66, - "total_submitted": 97, - "total_column_articles": 6, + "total_acs": 72, + "total_submitted": 104, + "total_column_articles": 7, "frontend_question_id": "2263", "is_new_question": false }, @@ -27564,9 +27774,9 @@ "question__title": "Fair Distribution of Cookies", "question__title_slug": "fair-distribution-of-cookies", "question__hide": false, - "total_acs": 5742, - "total_submitted": 8295, - "total_column_articles": 84, + "total_acs": 6444, + "total_submitted": 9220, + "total_column_articles": 93, "frontend_question_id": "2305", "is_new_question": false }, @@ -27585,9 +27795,9 @@ "question__title": "Check if an Array Is Consecutive", "question__title_slug": "check-if-an-array-is-consecutive", "question__hide": false, - "total_acs": 216, - "total_submitted": 314, - "total_column_articles": 14, + "total_acs": 238, + "total_submitted": 341, + "total_column_articles": 15, "frontend_question_id": "2229", "is_new_question": false }, @@ -27606,9 +27816,9 @@ "question__title": "Students and Examinations", "question__title_slug": "students-and-examinations", "question__hide": false, - "total_acs": 10058, - "total_submitted": 20158, - "total_column_articles": 96, + "total_acs": 10280, + "total_submitted": 20570, + "total_column_articles": 97, "frontend_question_id": "1280", "is_new_question": false }, @@ -27627,9 +27837,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": 17181, - "total_submitted": 45870, - "total_column_articles": 154, + "total_acs": 17368, + "total_submitted": 46280, + "total_column_articles": 155, "frontend_question_id": "1293", "is_new_question": false }, @@ -27648,9 +27858,9 @@ "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": 8398, - "total_submitted": 17176, - "total_column_articles": 129, + "total_acs": 8523, + "total_submitted": 17364, + "total_column_articles": 130, "frontend_question_id": "1292", "is_new_question": false }, @@ -27669,9 +27879,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": 66011, - "total_submitted": 81670, - "total_column_articles": 853, + "total_acs": 66479, + "total_submitted": 82257, + "total_column_articles": 855, "frontend_question_id": "1290", "is_new_question": false }, @@ -27690,9 +27900,9 @@ "question__title": "Traffic Light Controlled Intersection", "question__title_slug": "traffic-light-controlled-intersection", "question__hide": false, - "total_acs": 2042, - "total_submitted": 3220, - "total_column_articles": 21, + "total_acs": 2062, + "total_submitted": 3254, + "total_column_articles": 22, "frontend_question_id": "1279", "is_new_question": false }, @@ -27711,9 +27921,9 @@ "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": 3171, - "total_submitted": 4697, - "total_column_articles": 74, + "total_acs": 3197, + "total_submitted": 4729, + "total_column_articles": 76, "frontend_question_id": "1284", "is_new_question": false }, @@ -27732,9 +27942,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": 10182, - "total_submitted": 22335, - "total_column_articles": 138, + "total_acs": 10427, + "total_submitted": 22738, + "total_column_articles": 144, "frontend_question_id": "1283", "is_new_question": false }, @@ -27753,9 +27963,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": 14576, - "total_submitted": 17915, - "total_column_articles": 272, + "total_acs": 14654, + "total_submitted": 18011, + "total_column_articles": 276, "frontend_question_id": "1282", "is_new_question": false }, @@ -27774,9 +27984,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": 57200, - "total_submitted": 68603, - "total_column_articles": 758, + "total_acs": 57660, + "total_submitted": 69142, + "total_column_articles": 760, "frontend_question_id": "1281", "is_new_question": false }, @@ -27795,9 +28005,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": 8411, - "total_submitted": 10416, - "total_column_articles": 108, + "total_acs": 8558, + "total_submitted": 10600, + "total_column_articles": 109, "frontend_question_id": "1270", "is_new_question": false }, @@ -27816,9 +28026,9 @@ "question__title": "Print Immutable Linked List in Reverse", "question__title_slug": "print-immutable-linked-list-in-reverse", "question__hide": false, - "total_acs": 3907, - "total_submitted": 4277, - "total_column_articles": 84, + "total_acs": 3947, + "total_submitted": 4329, + "total_column_articles": 86, "frontend_question_id": "1265", "is_new_question": false }, @@ -27837,8 +28047,8 @@ "question__title": "Palindrome Partitioning III", "question__title_slug": "palindrome-partitioning-iii", "question__hide": false, - "total_acs": 4740, - "total_submitted": 7715, + "total_acs": 4790, + "total_submitted": 7781, "total_column_articles": 74, "frontend_question_id": "1278", "is_new_question": false @@ -27858,9 +28068,9 @@ "question__title": "Count Square Submatrices with All Ones", "question__title_slug": "count-square-submatrices-with-all-ones", "question__hide": false, - "total_acs": 24521, - "total_submitted": 33422, - "total_column_articles": 285, + "total_acs": 24798, + "total_submitted": 33799, + "total_column_articles": 287, "frontend_question_id": "1277", "is_new_question": false }, @@ -27879,8 +28089,8 @@ "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": 7566, - "total_submitted": 15014, + "total_acs": 7603, + "total_submitted": 15124, "total_column_articles": 114, "frontend_question_id": "1276", "is_new_question": false @@ -27900,8 +28110,8 @@ "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": 9972, - "total_submitted": 18223, + "total_acs": 10039, + "total_submitted": 18334, "total_column_articles": 199, "frontend_question_id": "1275", "is_new_question": false @@ -27921,9 +28131,9 @@ "question__title": "Page Recommendations", "question__title_slug": "page-recommendations", "question__hide": false, - "total_acs": 7786, - "total_submitted": 13644, - "total_column_articles": 116, + "total_acs": 8028, + "total_submitted": 14015, + "total_column_articles": 120, "frontend_question_id": "1264", "is_new_question": false }, @@ -27942,8 +28152,8 @@ "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": 31152, - "total_submitted": 63507, + "total_acs": 31195, + "total_submitted": 63583, "total_column_articles": 327, "frontend_question_id": "1269", "is_new_question": false @@ -27963,9 +28173,9 @@ "question__title": "Search Suggestions System", "question__title_slug": "search-suggestions-system", "question__hide": false, - "total_acs": 10910, - "total_submitted": 18509, - "total_column_articles": 182, + "total_acs": 11240, + "total_submitted": 19014, + "total_column_articles": 188, "frontend_question_id": "1268", "is_new_question": false }, @@ -27984,8 +28194,8 @@ "question__title": "Count Servers that Communicate", "question__title_slug": "count-servers-that-communicate", "question__hide": false, - "total_acs": 11126, - "total_submitted": 18199, + "total_acs": 11192, + "total_submitted": 18316, "total_column_articles": 170, "frontend_question_id": "1267", "is_new_question": false @@ -28005,9 +28215,9 @@ "question__title": "Minimum Time Visiting All Points", "question__title_slug": "minimum-time-visiting-all-points", "question__hide": false, - "total_acs": 32395, - "total_submitted": 39208, - "total_column_articles": 486, + "total_acs": 32504, + "total_submitted": 39334, + "total_column_articles": 487, "frontend_question_id": "1266", "is_new_question": false }, @@ -28026,9 +28236,9 @@ "question__title": "Minimum Path Cost in a Grid", "question__title_slug": "minimum-path-cost-in-a-grid", "question__hide": false, - "total_acs": 5313, - "total_submitted": 8618, - "total_column_articles": 100, + "total_acs": 5685, + "total_submitted": 9130, + "total_column_articles": 105, "frontend_question_id": "2304", "is_new_question": false }, @@ -28047,9 +28257,9 @@ "question__title": "Maximum Value of K Coins From Piles", "question__title_slug": "maximum-value-of-k-coins-from-piles", "question__hide": false, - "total_acs": 4747, - "total_submitted": 8906, - "total_column_articles": 75, + "total_acs": 4784, + "total_submitted": 8948, + "total_column_articles": 74, "frontend_question_id": "2218", "is_new_question": false }, @@ -28068,9 +28278,9 @@ "question__title": "Find the Difference of Two Arrays", "question__title_slug": "find-the-difference-of-two-arrays", "question__hide": false, - "total_acs": 10325, - "total_submitted": 15407, - "total_column_articles": 104, + "total_acs": 10470, + "total_submitted": 15651, + "total_column_articles": 105, "frontend_question_id": "2215", "is_new_question": false }, @@ -28089,9 +28299,9 @@ "question__title": "Counting Elements", "question__title_slug": "counting-elements", "question__hide": false, - "total_acs": 1962, - "total_submitted": 2782, - "total_column_articles": 67, + "total_acs": 1981, + "total_submitted": 2809, + "total_column_articles": 68, "frontend_question_id": "1426", "is_new_question": false }, @@ -28110,8 +28320,8 @@ "question__title": "Average Selling Price", "question__title_slug": "average-selling-price", "question__hide": false, - "total_acs": 12058, - "total_submitted": 15656, + "total_acs": 12363, + "total_submitted": 16069, "total_column_articles": 133, "frontend_question_id": "1251", "is_new_question": false @@ -28131,9 +28341,9 @@ "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": 4169, - "total_submitted": 9816, - "total_column_articles": 74, + "total_acs": 4261, + "total_submitted": 9995, + "total_column_articles": 77, "frontend_question_id": "1263", "is_new_question": false }, @@ -28152,9 +28362,9 @@ "question__title": "Greatest Sum Divisible by Three", "question__title_slug": "greatest-sum-divisible-by-three", "question__hide": false, - "total_acs": 17122, - "total_submitted": 32359, - "total_column_articles": 236, + "total_acs": 17293, + "total_submitted": 32729, + "total_column_articles": 238, "frontend_question_id": "1262", "is_new_question": false }, @@ -28173,9 +28383,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": 9648, - "total_submitted": 13148, - "total_column_articles": 141, + "total_acs": 9737, + "total_submitted": 13278, + "total_column_articles": 142, "frontend_question_id": "1261", "is_new_question": false }, @@ -28194,9 +28404,9 @@ "question__title": "Shift 2D Grid", "question__title_slug": "shift-2d-grid", "question__hide": false, - "total_acs": 15657, - "total_submitted": 25851, - "total_column_articles": 302, + "total_acs": 15768, + "total_submitted": 26041, + "total_column_articles": 303, "frontend_question_id": "1260", "is_new_question": false }, @@ -28215,8 +28425,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": 122, - "total_submitted": 210, + "total_acs": 128, + "total_submitted": 218, "total_column_articles": 11, "frontend_question_id": "2189", "is_new_question": false @@ -28236,8 +28446,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": 548, - "total_submitted": 912, + "total_acs": 568, + "total_submitted": 954, "total_column_articles": 24, "frontend_question_id": "1618", "is_new_question": false @@ -28257,8 +28467,8 @@ "question__title": "Number of Single Divisor Triplets", "question__title_slug": "number-of-single-divisor-triplets", "question__hide": false, - "total_acs": 83, - "total_submitted": 126, + "total_acs": 90, + "total_submitted": 135, "total_column_articles": 6, "frontend_question_id": "2198", "is_new_question": false @@ -28278,9 +28488,9 @@ "question__title": "Calculate Amount Paid in Taxes", "question__title_slug": "calculate-amount-paid-in-taxes", "question__hide": false, - "total_acs": 6934, - "total_submitted": 10924, - "total_column_articles": 55, + "total_acs": 7377, + "total_submitted": 11581, + "total_column_articles": 56, "frontend_question_id": "2303", "is_new_question": false }, @@ -28299,9 +28509,9 @@ "question__title": "Maximum Score Words Formed by Letters", "question__title_slug": "maximum-score-words-formed-by-letters", "question__hide": false, - "total_acs": 3851, - "total_submitted": 5489, - "total_column_articles": 86, + "total_acs": 3875, + "total_submitted": 5517, + "total_column_articles": 90, "frontend_question_id": "1255", "is_new_question": false }, @@ -28320,9 +28530,9 @@ "question__title": "Number of Closed Islands", "question__title_slug": "number-of-closed-islands", "question__hide": false, - "total_acs": 28291, - "total_submitted": 45629, - "total_column_articles": 464, + "total_acs": 28976, + "total_submitted": 46694, + "total_column_articles": 476, "frontend_question_id": "1254", "is_new_question": false }, @@ -28341,8 +28551,8 @@ "question__title": "Reconstruct a 2-Row Binary Matrix", "question__title_slug": "reconstruct-a-2-row-binary-matrix", "question__hide": false, - "total_acs": 6059, - "total_submitted": 15172, + "total_acs": 6105, + "total_submitted": 15287, "total_column_articles": 94, "frontend_question_id": "1253", "is_new_question": false @@ -28362,9 +28572,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": 20293, - "total_submitted": 27167, - "total_column_articles": 359, + "total_acs": 20369, + "total_submitted": 27291, + "total_column_articles": 360, "frontend_question_id": "1252", "is_new_question": false }, @@ -28383,9 +28593,9 @@ "question__title": "Number of Comments per Post", "question__title_slug": "number-of-comments-per-post", "question__hide": false, - "total_acs": 9046, - "total_submitted": 15198, - "total_column_articles": 79, + "total_acs": 9182, + "total_submitted": 15439, + "total_column_articles": 81, "frontend_question_id": "1241", "is_new_question": false }, @@ -28398,15 +28608,36 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 1376, + "question__title": "Selling Pieces of Wood", + "question__title_slug": "selling-pieces-of-wood", + "question__hide": false, + "total_acs": 3102, + "total_submitted": 6107, + "total_column_articles": 49, + "frontend_question_id": "2312", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 1375, "question__title": "Find Palindrome With Fixed Length", "question__title_slug": "find-palindrome-with-fixed-length", "question__hide": false, - "total_acs": 6262, - "total_submitted": 19287, - "total_column_articles": 147, + "total_acs": 6317, + "total_submitted": 19367, + "total_column_articles": 146, "frontend_question_id": "2217", "is_new_question": false }, @@ -28425,8 +28656,8 @@ "question__title": "Leftmost Column with at Least a One", "question__title_slug": "leftmost-column-with-at-least-a-one", "question__hide": false, - "total_acs": 1756, - "total_submitted": 2900, + "total_acs": 1780, + "total_submitted": 2940, "total_column_articles": 33, "frontend_question_id": "1428", "is_new_question": false @@ -28446,9 +28677,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": 3563, - "total_submitted": 6097, - "total_column_articles": 46, + "total_acs": 3601, + "total_submitted": 6152, + "total_column_articles": 47, "frontend_question_id": "1250", "is_new_question": false }, @@ -28467,9 +28698,9 @@ "question__title": "Minimum Remove to Make Valid Parentheses", "question__title_slug": "minimum-remove-to-make-valid-parentheses", "question__hide": false, - "total_acs": 33395, - "total_submitted": 56923, - "total_column_articles": 444, + "total_acs": 33816, + "total_submitted": 57553, + "total_column_articles": 447, "frontend_question_id": "1249", "is_new_question": false }, @@ -28488,8 +28719,8 @@ "question__title": "Count Number of Nice Subarrays", "question__title_slug": "count-number-of-nice-subarrays", "question__hide": false, - "total_acs": 42606, - "total_submitted": 74652, + "total_acs": 42922, + "total_submitted": 75115, "total_column_articles": 554, "frontend_question_id": "1248", "is_new_question": false @@ -28509,8 +28740,8 @@ "question__title": "Minimum Swaps to Make Strings Equal", "question__title_slug": "minimum-swaps-to-make-strings-equal", "question__hide": false, - "total_acs": 11175, - "total_submitted": 17914, + "total_acs": 11264, + "total_submitted": 18036, "total_column_articles": 192, "frontend_question_id": "1247", "is_new_question": false @@ -28530,8 +28761,8 @@ "question__title": "Web Crawler Multithreaded", "question__title_slug": "web-crawler-multithreaded", "question__hide": false, - "total_acs": 1706, - "total_submitted": 3541, + "total_acs": 1709, + "total_submitted": 3549, "total_column_articles": 24, "frontend_question_id": "1242", "is_new_question": false @@ -28551,9 +28782,9 @@ "question__title": "Maximum Height by Stacking Cuboids ", "question__title_slug": "maximum-height-by-stacking-cuboids", "question__hide": false, - "total_acs": 2921, - "total_submitted": 5877, - "total_column_articles": 70, + "total_acs": 2946, + "total_submitted": 5913, + "total_column_articles": 71, "frontend_question_id": "1691", "is_new_question": false }, @@ -28572,9 +28803,9 @@ "question__title": "First Unique Number", "question__title_slug": "first-unique-number", "question__hide": false, - "total_acs": 1883, - "total_submitted": 3682, - "total_column_articles": 56, + "total_acs": 1906, + "total_submitted": 3727, + "total_column_articles": 57, "frontend_question_id": "1429", "is_new_question": false }, @@ -28593,8 +28824,8 @@ "question__title": "Tuple with Same Product", "question__title_slug": "tuple-with-same-product", "question__hide": false, - "total_acs": 6725, - "total_submitted": 13395, + "total_acs": 6755, + "total_submitted": 13450, "total_column_articles": 127, "frontend_question_id": "1726", "is_new_question": false @@ -28608,14 +28839,35 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 1363, + "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": 7653, + "total_submitted": 11239, + "total_column_articles": 88, + "frontend_question_id": "2309", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 1362, "question__title": "Airplane Seat Assignment Probability", "question__title_slug": "airplane-seat-assignment-probability", "question__hide": false, - "total_acs": 11974, - "total_submitted": 17959, + "total_acs": 12045, + "total_submitted": 18046, "total_column_articles": 175, "frontend_question_id": "1227", "is_new_question": false @@ -28635,9 +28887,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": 3096, - "total_submitted": 6165, - "total_column_articles": 47, + "total_acs": 3169, + "total_submitted": 6279, + "total_column_articles": 48, "frontend_question_id": "1240", "is_new_question": false }, @@ -28656,9 +28908,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": 37530, - "total_submitted": 76744, - "total_column_articles": 409, + "total_acs": 37628, + "total_submitted": 76942, + "total_column_articles": 411, "frontend_question_id": "1239", "is_new_question": false }, @@ -28677,8 +28929,8 @@ "question__title": "Circular Permutation in Binary Representation", "question__title_slug": "circular-permutation-in-binary-representation", "question__hide": false, - "total_acs": 3850, - "total_submitted": 5783, + "total_acs": 3907, + "total_submitted": 5866, "total_column_articles": 89, "frontend_question_id": "1238", "is_new_question": false @@ -28698,9 +28950,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": 11370, - "total_submitted": 15920, - "total_column_articles": 164, + "total_acs": 11432, + "total_submitted": 16018, + "total_column_articles": 165, "frontend_question_id": "1237", "is_new_question": false }, @@ -28719,9 +28971,9 @@ "question__title": "Report Contiguous Dates", "question__title_slug": "report-contiguous-dates", "question__hide": false, - "total_acs": 4974, - "total_submitted": 9162, - "total_column_articles": 109, + "total_acs": 5090, + "total_submitted": 9352, + "total_column_articles": 111, "frontend_question_id": "1225", "is_new_question": false }, @@ -28740,9 +28992,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": 2438, - "total_submitted": 5161, - "total_column_articles": 48, + "total_acs": 2467, + "total_submitted": 5216, + "total_column_articles": 49, "frontend_question_id": "2193", "is_new_question": false }, @@ -28761,9 +29013,9 @@ "question__title": "Minimum Deletions to Make Array Beautiful", "question__title_slug": "minimum-deletions-to-make-array-beautiful", "question__hide": false, - "total_acs": 8108, - "total_submitted": 17186, - "total_column_articles": 152, + "total_acs": 8154, + "total_submitted": 17276, + "total_column_articles": 151, "frontend_question_id": "2216", "is_new_question": false }, @@ -28782,9 +29034,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": 8637, - "total_submitted": 13789, - "total_column_articles": 99, + "total_acs": 8720, + "total_submitted": 13903, + "total_column_articles": 98, "frontend_question_id": "2225", "is_new_question": false }, @@ -28803,9 +29055,9 @@ "question__title": "Find Resultant Array After Removing Anagrams", "question__title_slug": "find-resultant-array-after-removing-anagrams", "question__hide": false, - "total_acs": 8948, - "total_submitted": 15371, - "total_column_articles": 110, + "total_acs": 9110, + "total_submitted": 15621, + "total_column_articles": 115, "frontend_question_id": "2273", "is_new_question": false }, @@ -28824,9 +29076,9 @@ "question__title": "Maximum Profit in Job Scheduling", "question__title_slug": "maximum-profit-in-job-scheduling", "question__hide": false, - "total_acs": 8898, - "total_submitted": 18593, - "total_column_articles": 160, + "total_acs": 9039, + "total_submitted": 18849, + "total_column_articles": 163, "frontend_question_id": "1235", "is_new_question": false }, @@ -28845,8 +29097,8 @@ "question__title": "Replace the Substring for Balanced String", "question__title_slug": "replace-the-substring-for-balanced-string", "question__hide": false, - "total_acs": 7428, - "total_submitted": 21078, + "total_acs": 7501, + "total_submitted": 21272, "total_column_articles": 112, "frontend_question_id": "1234", "is_new_question": false @@ -28866,9 +29118,9 @@ "question__title": "Remove Sub-Folders from the Filesystem", "question__title_slug": "remove-sub-folders-from-the-filesystem", "question__hide": false, - "total_acs": 10342, - "total_submitted": 20622, - "total_column_articles": 150, + "total_acs": 10447, + "total_submitted": 20830, + "total_column_articles": 151, "frontend_question_id": "1233", "is_new_question": false }, @@ -28887,9 +29139,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": 39999, - "total_submitted": 86272, - "total_column_articles": 498, + "total_acs": 40272, + "total_submitted": 86960, + "total_column_articles": 502, "frontend_question_id": "1232", "is_new_question": false }, @@ -28902,14 +29154,35 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 1348, + "question__title": "Maximum Score Of Spliced Array", + "question__title_slug": "maximum-score-of-spliced-array", + "question__hide": false, + "total_acs": 4572, + "total_submitted": 9520, + "total_column_articles": 85, + "frontend_question_id": "2321", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 1347, "question__title": "Distance to a Cycle in Undirected Graph", "question__title_slug": "distance-to-a-cycle-in-undirected-graph", "question__hide": false, - "total_acs": 111, - "total_submitted": 146, + "total_acs": 119, + "total_submitted": 161, "total_column_articles": 10, "frontend_question_id": "2204", "is_new_question": false @@ -28929,9 +29202,9 @@ "question__title": "Maximize the Topmost Element After K Moves", "question__title_slug": "maximize-the-topmost-element-after-k-moves", "question__hide": false, - "total_acs": 7686, - "total_submitted": 37399, - "total_column_articles": 134, + "total_acs": 7751, + "total_submitted": 37622, + "total_column_articles": 133, "frontend_question_id": "2202", "is_new_question": false }, @@ -28950,8 +29223,8 @@ "question__title": "Perform String Shifts", "question__title_slug": "perform-string-shifts", "question__hide": false, - "total_acs": 2014, - "total_submitted": 3207, + "total_acs": 2048, + "total_submitted": 3264, "total_column_articles": 79, "frontend_question_id": "1427", "is_new_question": false @@ -28971,9 +29244,9 @@ "question__title": "Maximum Equal Frequency", "question__title_slug": "maximum-equal-frequency", "question__hide": false, - "total_acs": 5402, - "total_submitted": 16240, - "total_column_articles": 77, + "total_acs": 5436, + "total_submitted": 16329, + "total_column_articles": 78, "frontend_question_id": "1224", "is_new_question": false }, @@ -28992,9 +29265,9 @@ "question__title": "Dice Roll Simulation", "question__title_slug": "dice-roll-simulation", "question__hide": false, - "total_acs": 3860, - "total_submitted": 8005, - "total_column_articles": 66, + "total_acs": 3903, + "total_submitted": 8076, + "total_column_articles": 68, "frontend_question_id": "1223", "is_new_question": false }, @@ -29013,9 +29286,9 @@ "question__title": "Queens That Can Attack the King", "question__title_slug": "queens-that-can-attack-the-king", "question__hide": false, - "total_acs": 7241, - "total_submitted": 10577, - "total_column_articles": 167, + "total_acs": 7316, + "total_submitted": 10673, + "total_column_articles": 168, "frontend_question_id": "1222", "is_new_question": false }, @@ -29034,9 +29307,9 @@ "question__title": "Split a String in Balanced Strings", "question__title_slug": "split-a-string-in-balanced-strings", "question__hide": false, - "total_acs": 84415, - "total_submitted": 99927, - "total_column_articles": 1221, + "total_acs": 84829, + "total_submitted": 100403, + "total_column_articles": 1224, "frontend_question_id": "1221", "is_new_question": false }, @@ -29055,8 +29328,8 @@ "question__title": "The Dining Philosophers", "question__title_slug": "the-dining-philosophers", "question__hide": false, - "total_acs": 14961, - "total_submitted": 25296, + "total_acs": 15088, + "total_submitted": 25535, "total_column_articles": 162, "frontend_question_id": "1226", "is_new_question": false @@ -29076,9 +29349,9 @@ "question__title": "Team Scores in Football Tournament", "question__title_slug": "team-scores-in-football-tournament", "question__hide": false, - "total_acs": 7481, - "total_submitted": 14589, - "total_column_articles": 132, + "total_acs": 7636, + "total_submitted": 14875, + "total_column_articles": 133, "frontend_question_id": "1212", "is_new_question": false }, @@ -29097,9 +29370,9 @@ "question__title": "Queries Quality and Percentage", "question__title_slug": "queries-quality-and-percentage", "question__hide": false, - "total_acs": 11171, - "total_submitted": 16790, - "total_column_articles": 85, + "total_acs": 11428, + "total_submitted": 17141, + "total_column_articles": 87, "frontend_question_id": "1211", "is_new_question": false }, @@ -29118,9 +29391,9 @@ "question__title": "Design Skiplist", "question__title_slug": "design-skiplist", "question__hide": false, - "total_acs": 11169, - "total_submitted": 17864, - "total_column_articles": 121, + "total_acs": 11364, + "total_submitted": 18178, + "total_column_articles": 124, "frontend_question_id": "1206", "is_new_question": false }, @@ -29139,9 +29412,9 @@ "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": 910, - "total_submitted": 2997, - "total_column_articles": 27, + "total_acs": 919, + "total_submitted": 3017, + "total_column_articles": 29, "frontend_question_id": "1960", "is_new_question": false }, @@ -29160,9 +29433,9 @@ "question__title": "Maximum Candies Allocated to K Children", "question__title_slug": "maximum-candies-allocated-to-k-children", "question__hide": false, - "total_acs": 8551, - "total_submitted": 26206, - "total_column_articles": 152, + "total_acs": 8639, + "total_submitted": 26473, + "total_column_articles": 151, "frontend_question_id": "2226", "is_new_question": false }, @@ -29175,15 +29448,36 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 1334, + "question__title": "Sum of Numbers With Units Digit K", + "question__title_slug": "sum-of-numbers-with-units-digit-k", + "question__hide": false, + "total_acs": 6691, + "total_submitted": 26040, + "total_column_articles": 110, + "frontend_question_id": "2310", + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 1333, "question__title": "Sort the Jumbled Numbers", "question__title_slug": "sort-the-jumbled-numbers", "question__hide": false, - "total_acs": 5704, - "total_submitted": 13605, - "total_column_articles": 101, + "total_acs": 5786, + "total_submitted": 13761, + "total_column_articles": 102, "frontend_question_id": "2191", "is_new_question": false }, @@ -29202,8 +29496,8 @@ "question__title": "Count Vowels Permutation", "question__title_slug": "count-vowels-permutation", "question__hide": false, - "total_acs": 25282, - "total_submitted": 41681, + "total_acs": 25327, + "total_submitted": 41767, "total_column_articles": 345, "frontend_question_id": "1220", "is_new_question": false @@ -29223,9 +29517,9 @@ "question__title": "Path with Maximum Gold", "question__title_slug": "path-with-maximum-gold", "question__hide": false, - "total_acs": 36414, - "total_submitted": 52312, - "total_column_articles": 466, + "total_acs": 36596, + "total_submitted": 52588, + "total_column_articles": 467, "frontend_question_id": "1219", "is_new_question": false }, @@ -29244,8 +29538,8 @@ "question__title": "Longest Arithmetic Subsequence of Given Difference", "question__title_slug": "longest-arithmetic-subsequence-of-given-difference", "question__hide": false, - "total_acs": 40006, - "total_submitted": 77429, + "total_acs": 40169, + "total_submitted": 77691, "total_column_articles": 379, "frontend_question_id": "1218", "is_new_question": false @@ -29265,9 +29559,9 @@ "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": 26625, - "total_submitted": 38020, - "total_column_articles": 429, + "total_acs": 26837, + "total_submitted": 38314, + "total_column_articles": 433, "frontend_question_id": "1217", "is_new_question": false }, @@ -29286,9 +29580,9 @@ "question__title": "Monthly Transactions II", "question__title_slug": "monthly-transactions-ii", "question__hide": false, - "total_acs": 7309, - "total_submitted": 15779, - "total_column_articles": 97, + "total_acs": 7397, + "total_submitted": 15971, + "total_column_articles": 98, "frontend_question_id": "1205", "is_new_question": false }, @@ -29307,8 +29601,8 @@ "question__title": "Last Person to Fit in the Bus", "question__title_slug": "last-person-to-fit-in-the-bus", "question__hide": false, - "total_acs": 7906, - "total_submitted": 10760, + "total_acs": 8048, + "total_submitted": 10936, "total_column_articles": 104, "frontend_question_id": "1204", "is_new_question": false @@ -29328,8 +29622,8 @@ "question__title": "Sum of Floored Pairs", "question__title_slug": "sum-of-floored-pairs", "question__hide": false, - "total_acs": 2788, - "total_submitted": 8634, + "total_acs": 2819, + "total_submitted": 8699, "total_column_articles": 52, "frontend_question_id": "1862", "is_new_question": false @@ -29349,9 +29643,9 @@ "question__title": "Path with Maximum Probability", "question__title_slug": "path-with-maximum-probability", "question__hide": false, - "total_acs": 12938, - "total_submitted": 34844, - "total_column_articles": 202, + "total_acs": 13204, + "total_submitted": 35372, + "total_column_articles": 204, "frontend_question_id": "1514", "is_new_question": false }, @@ -29370,9 +29664,9 @@ "question__title": "Where Will the Ball Fall", "question__title_slug": "where-will-the-ball-fall", "question__hide": false, - "total_acs": 32187, - "total_submitted": 46467, - "total_column_articles": 602, + "total_acs": 32526, + "total_submitted": 46973, + "total_column_articles": 605, "frontend_question_id": "1706", "is_new_question": false }, @@ -29391,9 +29685,9 @@ "question__title": "Minimum Moves to Reach Target with Rotations", "question__title_slug": "minimum-moves-to-reach-target-with-rotations", "question__hide": false, - "total_acs": 3038, - "total_submitted": 6634, - "total_column_articles": 61, + "total_acs": 3069, + "total_submitted": 6702, + "total_column_articles": 63, "frontend_question_id": "1210", "is_new_question": false }, @@ -29412,9 +29706,9 @@ "question__title": "Get Equal Substrings Within Budget", "question__title_slug": "get-equal-substrings-within-budget", "question__hide": false, - "total_acs": 57896, - "total_submitted": 115906, - "total_column_articles": 696, + "total_acs": 58387, + "total_submitted": 116892, + "total_column_articles": 701, "frontend_question_id": "1208", "is_new_question": false }, @@ -29433,9 +29727,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": 15348, - "total_submitted": 29947, - "total_column_articles": 184, + "total_acs": 15521, + "total_submitted": 30283, + "total_column_articles": 185, "frontend_question_id": "1209", "is_new_question": false }, @@ -29454,9 +29748,9 @@ "question__title": "Unique Number of Occurrences", "question__title_slug": "unique-number-of-occurrences", "question__hide": false, - "total_acs": 65912, - "total_submitted": 90376, - "total_column_articles": 910, + "total_acs": 66463, + "total_submitted": 91165, + "total_column_articles": 916, "frontend_question_id": "1207", "is_new_question": false }, @@ -29475,9 +29769,9 @@ "question__title": "Tournament Winners", "question__title_slug": "tournament-winners", "question__hide": false, - "total_acs": 5212, - "total_submitted": 10153, - "total_column_articles": 89, + "total_acs": 5313, + "total_submitted": 10335, + "total_column_articles": 91, "frontend_question_id": "1194", "is_new_question": false }, @@ -29496,8 +29790,8 @@ "question__title": "Monthly Transactions I", "question__title_slug": "monthly-transactions-i", "question__hide": false, - "total_acs": 9155, - "total_submitted": 15071, + "total_acs": 9423, + "total_submitted": 15506, "total_column_articles": 104, "frontend_question_id": "1193", "is_new_question": false @@ -29517,8 +29811,8 @@ "question__title": "Fizz Buzz Multithreaded", "question__title_slug": "fizz-buzz-multithreaded", "question__hide": false, - "total_acs": 17390, - "total_submitted": 27031, + "total_acs": 17557, + "total_submitted": 27240, "total_column_articles": 323, "frontend_question_id": "1195", "is_new_question": false @@ -29538,9 +29832,9 @@ "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": 1474, - "total_submitted": 2620, - "total_column_articles": 19, + "total_acs": 1481, + "total_submitted": 2628, + "total_column_articles": 20, "frontend_question_id": "1916", "is_new_question": false }, @@ -29559,9 +29853,9 @@ "question__title": "Count Artifacts That Can Be Extracted", "question__title_slug": "count-artifacts-that-can-be-extracted", "question__hide": false, - "total_acs": 7578, - "total_submitted": 15670, - "total_column_articles": 116, + "total_acs": 7631, + "total_submitted": 15756, + "total_column_articles": 115, "frontend_question_id": "2201", "is_new_question": false }, @@ -29580,8 +29874,8 @@ "question__title": "Largest Magic Square", "question__title_slug": "largest-magic-square", "question__hide": false, - "total_acs": 2527, - "total_submitted": 4647, + "total_acs": 2540, + "total_submitted": 4671, "total_column_articles": 48, "frontend_question_id": "1895", "is_new_question": false @@ -29601,9 +29895,9 @@ "question__title": "Watering Plants", "question__title_slug": "watering-plants", "question__hide": false, - "total_acs": 6822, - "total_submitted": 8741, - "total_column_articles": 124, + "total_acs": 6882, + "total_submitted": 8822, + "total_column_articles": 126, "frontend_question_id": "2079", "is_new_question": false }, @@ -29622,9 +29916,9 @@ "question__title": "Sort Items by Groups Respecting Dependencies", "question__title_slug": "sort-items-by-groups-respecting-dependencies", "question__hide": false, - "total_acs": 12916, - "total_submitted": 20936, - "total_column_articles": 158, + "total_acs": 12942, + "total_submitted": 20982, + "total_column_articles": 159, "frontend_question_id": "1203", "is_new_question": false }, @@ -29643,9 +29937,9 @@ "question__title": "Smallest String With Swaps", "question__title_slug": "smallest-string-with-swaps", "question__hide": false, - "total_acs": 29285, - "total_submitted": 57789, - "total_column_articles": 323, + "total_acs": 29400, + "total_submitted": 57996, + "total_column_articles": 324, "frontend_question_id": "1202", "is_new_question": false }, @@ -29664,8 +29958,8 @@ "question__title": "Ugly Number III", "question__title_slug": "ugly-number-iii", "question__hide": false, - "total_acs": 8029, - "total_submitted": 30513, + "total_acs": 8125, + "total_submitted": 30789, "total_column_articles": 109, "frontend_question_id": "1201", "is_new_question": false @@ -29685,9 +29979,9 @@ "question__title": "Minimum Absolute Difference", "question__title_slug": "minimum-absolute-difference", "question__hide": false, - "total_acs": 22103, - "total_submitted": 32371, - "total_column_articles": 314, + "total_acs": 22286, + "total_submitted": 32624, + "total_column_articles": 318, "frontend_question_id": "1200", "is_new_question": false }, @@ -29706,8 +30000,8 @@ "question__title": "Number of Visible People in a Queue", "question__title_slug": "number-of-visible-people-in-a-queue", "question__hide": false, - "total_acs": 3748, - "total_submitted": 6063, + "total_acs": 3800, + "total_submitted": 6147, "total_column_articles": 89, "frontend_question_id": "1944", "is_new_question": false @@ -29727,9 +30021,9 @@ "question__title": "Longest Happy String", "question__title_slug": "longest-happy-string", "question__hide": false, - "total_acs": 27528, - "total_submitted": 43042, - "total_column_articles": 481, + "total_acs": 27703, + "total_submitted": 43336, + "total_column_articles": 484, "frontend_question_id": "1405", "is_new_question": false }, @@ -29748,8 +30042,8 @@ "question__title": "Minimum Moves to Reach Target Score", "question__title_slug": "minimum-moves-to-reach-target-score", "question__hide": false, - "total_acs": 7381, - "total_submitted": 14547, + "total_acs": 7460, + "total_submitted": 14693, "total_column_articles": 139, "frontend_question_id": "2139", "is_new_question": false @@ -29769,9 +30063,9 @@ "question__title": "Delete Characters to Make Fancy String", "question__title_slug": "delete-characters-to-make-fancy-string", "question__hide": false, - "total_acs": 7300, - "total_submitted": 12067, - "total_column_articles": 84, + "total_acs": 7404, + "total_submitted": 12245, + "total_column_articles": 88, "frontend_question_id": "1957", "is_new_question": false }, @@ -29790,9 +30084,9 @@ "question__title": "Reformat Department Table", "question__title_slug": "reformat-department-table", "question__hide": false, - "total_acs": 39174, - "total_submitted": 61015, - "total_column_articles": 234, + "total_acs": 39461, + "total_submitted": 61476, + "total_column_articles": 235, "frontend_question_id": "1179", "is_new_question": false }, @@ -29811,8 +30105,8 @@ "question__title": "Critical Connections in a Network", "question__title_slug": "critical-connections-in-a-network", "question__hide": false, - "total_acs": 6252, - "total_submitted": 11914, + "total_acs": 6300, + "total_submitted": 11985, "total_column_articles": 76, "frontend_question_id": "1192", "is_new_question": false @@ -29832,8 +30126,8 @@ "question__title": "K-Concatenation Maximum Sum", "question__title_slug": "k-concatenation-maximum-sum", "question__hide": false, - "total_acs": 6967, - "total_submitted": 26047, + "total_acs": 7040, + "total_submitted": 26266, "total_column_articles": 112, "frontend_question_id": "1191", "is_new_question": false @@ -29853,9 +30147,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": 51471, - "total_submitted": 79309, - "total_column_articles": 668, + "total_acs": 51823, + "total_submitted": 79933, + "total_column_articles": 673, "frontend_question_id": "1190", "is_new_question": false }, @@ -29874,9 +30168,9 @@ "question__title": "Maximum Number of Balloons", "question__title_slug": "maximum-number-of-balloons", "question__hide": false, - "total_acs": 53496, - "total_submitted": 77947, - "total_column_articles": 739, + "total_acs": 53686, + "total_submitted": 78287, + "total_column_articles": 744, "frontend_question_id": "1189", "is_new_question": false }, @@ -29895,8 +30189,8 @@ "question__title": "Kth Ancestor of a Tree Node", "question__title_slug": "kth-ancestor-of-a-tree-node", "question__hide": false, - "total_acs": 4353, - "total_submitted": 13405, + "total_acs": 4389, + "total_submitted": 13482, "total_column_articles": 90, "frontend_question_id": "1483", "is_new_question": false @@ -29916,8 +30210,8 @@ "question__title": "Minimum Garden Perimeter to Collect Enough Apples", "question__title_slug": "minimum-garden-perimeter-to-collect-enough-apples", "question__hide": false, - "total_acs": 5100, - "total_submitted": 10437, + "total_acs": 5147, + "total_submitted": 10523, "total_column_articles": 79, "frontend_question_id": "1954", "is_new_question": false @@ -29937,9 +30231,9 @@ "question__title": "Range Frequency Queries", "question__title_slug": "range-frequency-queries", "question__hide": false, - "total_acs": 6829, - "total_submitted": 23019, - "total_column_articles": 157, + "total_acs": 6916, + "total_submitted": 23310, + "total_column_articles": 158, "frontend_question_id": "2080", "is_new_question": false }, @@ -29958,8 +30252,8 @@ "question__title": "Three Consecutive Odds", "question__title_slug": "three-consecutive-odds", "question__hide": false, - "total_acs": 24660, - "total_submitted": 37606, + "total_acs": 24828, + "total_submitted": 37863, "total_column_articles": 333, "frontend_question_id": "1550", "is_new_question": false @@ -29979,9 +30273,9 @@ "question__title": "Immediate Food Delivery II", "question__title_slug": "immediate-food-delivery-ii", "question__hide": false, - "total_acs": 7296, - "total_submitted": 11592, - "total_column_articles": 80, + "total_acs": 7435, + "total_submitted": 11805, + "total_column_articles": 81, "frontend_question_id": "1174", "is_new_question": false }, @@ -30000,9 +30294,9 @@ "question__title": "Immediate Food Delivery I", "question__title_slug": "immediate-food-delivery-i", "question__hide": false, - "total_acs": 12748, - "total_submitted": 16836, - "total_column_articles": 105, + "total_acs": 13027, + "total_submitted": 17197, + "total_column_articles": 106, "frontend_question_id": "1173", "is_new_question": false }, @@ -30021,9 +30315,9 @@ "question__title": "Make Array Strictly Increasing", "question__title_slug": "make-array-strictly-increasing", "question__hide": false, - "total_acs": 2389, - "total_submitted": 5167, - "total_column_articles": 41, + "total_acs": 2419, + "total_submitted": 5229, + "total_column_articles": 42, "frontend_question_id": "1187", "is_new_question": false }, @@ -30042,9 +30336,9 @@ "question__title": "Day of the Week", "question__title_slug": "day-of-the-week", "question__hide": false, - "total_acs": 36260, - "total_submitted": 57947, - "total_column_articles": 489, + "total_acs": 36353, + "total_submitted": 58107, + "total_column_articles": 492, "frontend_question_id": "1185", "is_new_question": false }, @@ -30063,9 +30357,9 @@ "question__title": "Maximum Subarray Sum with One Deletion", "question__title_slug": "maximum-subarray-sum-with-one-deletion", "question__hide": false, - "total_acs": 9549, - "total_submitted": 23329, - "total_column_articles": 147, + "total_acs": 9687, + "total_submitted": 23602, + "total_column_articles": 148, "frontend_question_id": "1186", "is_new_question": false }, @@ -30084,8 +30378,8 @@ "question__title": "Distance Between Bus Stops", "question__title_slug": "distance-between-bus-stops", "question__hide": false, - "total_acs": 16335, - "total_submitted": 27976, + "total_acs": 16449, + "total_submitted": 28172, "total_column_articles": 319, "frontend_question_id": "1184", "is_new_question": false @@ -30105,8 +30399,8 @@ "question__title": "Constrained Subsequence Sum", "question__title_slug": "constrained-subsequence-sum", "question__hide": false, - "total_acs": 4471, - "total_submitted": 9712, + "total_acs": 4543, + "total_submitted": 9855, "total_column_articles": 90, "frontend_question_id": "1425", "is_new_question": false @@ -30126,9 +30420,9 @@ "question__title": "Balance a Binary Search Tree", "question__title_slug": "balance-a-binary-search-tree", "question__hide": false, - "total_acs": 15658, - "total_submitted": 22061, - "total_column_articles": 234, + "total_acs": 15983, + "total_submitted": 22482, + "total_column_articles": 240, "frontend_question_id": "1382", "is_new_question": false }, @@ -30147,9 +30441,9 @@ "question__title": "Four Divisors", "question__title_slug": "four-divisors", "question__hide": false, - "total_acs": 7712, - "total_submitted": 20703, - "total_column_articles": 131, + "total_acs": 7767, + "total_submitted": 20805, + "total_column_articles": 133, "frontend_question_id": "1390", "is_new_question": false }, @@ -30168,9 +30462,9 @@ "question__title": "Reformat Date", "question__title_slug": "reformat-date", "question__hide": false, - "total_acs": 12286, - "total_submitted": 20814, - "total_column_articles": 164, + "total_acs": 12403, + "total_submitted": 20998, + "total_column_articles": 168, "frontend_question_id": "1507", "is_new_question": false }, @@ -30189,9 +30483,9 @@ "question__title": "Number of Valid Words for Each Puzzle", "question__title_slug": "number-of-valid-words-for-each-puzzle", "question__hide": false, - "total_acs": 19363, - "total_submitted": 41688, - "total_column_articles": 190, + "total_acs": 19390, + "total_submitted": 41737, + "total_column_articles": 192, "frontend_question_id": "1178", "is_new_question": false }, @@ -30210,9 +30504,9 @@ "question__title": "Can Make Palindrome from Substring", "question__title_slug": "can-make-palindrome-from-substring", "question__hide": false, - "total_acs": 7076, - "total_submitted": 25413, - "total_column_articles": 112, + "total_acs": 7121, + "total_submitted": 25547, + "total_column_articles": 114, "frontend_question_id": "1177", "is_new_question": false }, @@ -30231,9 +30525,9 @@ "question__title": "Diet Plan Performance", "question__title_slug": "diet-plan-performance", "question__hide": false, - "total_acs": 5234, - "total_submitted": 11066, - "total_column_articles": 82, + "total_acs": 5282, + "total_submitted": 11141, + "total_column_articles": 83, "frontend_question_id": "1176", "is_new_question": false }, @@ -30252,8 +30546,8 @@ "question__title": "Prime Arrangements", "question__title_slug": "prime-arrangements", "question__hide": false, - "total_acs": 9511, - "total_submitted": 19261, + "total_acs": 9653, + "total_submitted": 19513, "total_column_articles": 157, "frontend_question_id": "1175", "is_new_question": false @@ -30273,9 +30567,9 @@ "question__title": "Product Price at a Given Date", "question__title_slug": "product-price-at-a-given-date", "question__hide": false, - "total_acs": 9062, - "total_submitted": 14965, - "total_column_articles": 120, + "total_acs": 9332, + "total_submitted": 15402, + "total_column_articles": 121, "frontend_question_id": "1164", "is_new_question": false }, @@ -30294,8 +30588,8 @@ "question__title": "Largest Multiple of Three", "question__title_slug": "largest-multiple-of-three", "question__hide": false, - "total_acs": 6356, - "total_submitted": 17316, + "total_acs": 6397, + "total_submitted": 17458, "total_column_articles": 116, "frontend_question_id": "1363", "is_new_question": false @@ -30315,8 +30609,8 @@ "question__title": "Closest Divisors", "question__title_slug": "closest-divisors", "question__hide": false, - "total_acs": 6526, - "total_submitted": 12181, + "total_acs": 6558, + "total_submitted": 12247, "total_column_articles": 82, "frontend_question_id": "1362", "is_new_question": false @@ -30336,9 +30630,9 @@ "question__title": "Validate Binary Tree Nodes", "question__title_slug": "validate-binary-tree-nodes", "question__hide": false, - "total_acs": 9436, - "total_submitted": 23693, - "total_column_articles": 249, + "total_acs": 9534, + "total_submitted": 23969, + "total_column_articles": 251, "frontend_question_id": "1361", "is_new_question": false }, @@ -30357,8 +30651,8 @@ "question__title": "Number of Days Between Two Dates", "question__title_slug": "number-of-days-between-two-dates", "question__hide": false, - "total_acs": 11245, - "total_submitted": 22407, + "total_acs": 11326, + "total_submitted": 22541, "total_column_articles": 185, "frontend_question_id": "1360", "is_new_question": false @@ -30378,9 +30672,9 @@ "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": 15132, - "total_submitted": 24463, - "total_column_articles": 248, + "total_acs": 15224, + "total_submitted": 24615, + "total_column_articles": 249, "frontend_question_id": "1170", "is_new_question": false }, @@ -30399,8 +30693,8 @@ "question__title": "Invalid Transactions", "question__title_slug": "invalid-transactions", "question__hide": false, - "total_acs": 7651, - "total_submitted": 23534, + "total_acs": 7691, + "total_submitted": 23679, "total_column_articles": 88, "frontend_question_id": "1169", "is_new_question": false @@ -30420,8 +30714,8 @@ "question__title": "Web Crawler", "question__title_slug": "web-crawler", "question__hide": false, - "total_acs": 1448, - "total_submitted": 2557, + "total_acs": 1456, + "total_submitted": 2577, "total_column_articles": 38, "frontend_question_id": "1236", "is_new_question": false @@ -30441,9 +30735,9 @@ "question__title": "Dinner Plate Stacks", "question__title_slug": "dinner-plate-stacks", "question__hide": false, - "total_acs": 3021, - "total_submitted": 11272, - "total_column_articles": 71, + "total_acs": 3045, + "total_submitted": 11353, + "total_column_articles": 72, "frontend_question_id": "1172", "is_new_question": false }, @@ -30462,9 +30756,9 @@ "question__title": "Market Analysis II", "question__title_slug": "market-analysis-ii", "question__hide": false, - "total_acs": 5678, - "total_submitted": 11247, - "total_column_articles": 105, + "total_acs": 5755, + "total_submitted": 11406, + "total_column_articles": 106, "frontend_question_id": "1159", "is_new_question": false }, @@ -30483,9 +30777,9 @@ "question__title": "Market Analysis I", "question__title_slug": "market-analysis-i", "question__hide": false, - "total_acs": 14027, - "total_submitted": 24995, - "total_column_articles": 128, + "total_acs": 14938, + "total_submitted": 26674, + "total_column_articles": 137, "frontend_question_id": "1158", "is_new_question": false }, @@ -30504,9 +30798,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": 16461, - "total_submitted": 34177, - "total_column_articles": 189, + "total_acs": 16572, + "total_submitted": 34359, + "total_column_articles": 191, "frontend_question_id": "1171", "is_new_question": false }, @@ -30525,9 +30819,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": 9949, - "total_submitted": 13898, - "total_column_articles": 170, + "total_acs": 10065, + "total_submitted": 14099, + "total_column_articles": 171, "frontend_question_id": "1935", "is_new_question": false }, @@ -30546,8 +30840,8 @@ "question__title": "Number of Dice Rolls With Target Sum", "question__title_slug": "number-of-dice-rolls-with-target-sum", "question__hide": false, - "total_acs": 14846, - "total_submitted": 30151, + "total_acs": 15040, + "total_submitted": 30514, "total_column_articles": 174, "frontend_question_id": "1155", "is_new_question": false @@ -30567,9 +30861,9 @@ "question__title": "Online Majority Element In Subarray", "question__title_slug": "online-majority-element-in-subarray", "question__hide": false, - "total_acs": 3710, - "total_submitted": 10903, - "total_column_articles": 59, + "total_acs": 3745, + "total_submitted": 10986, + "total_column_articles": 62, "frontend_question_id": "1157", "is_new_question": false }, @@ -30588,9 +30882,9 @@ "question__title": "Swap For Longest Repeated Character Substring", "question__title_slug": "swap-for-longest-repeated-character-substring", "question__hide": false, - "total_acs": 6776, - "total_submitted": 15752, - "total_column_articles": 144, + "total_acs": 6860, + "total_submitted": 15957, + "total_column_articles": 146, "frontend_question_id": "1156", "is_new_question": false }, @@ -30609,9 +30903,9 @@ "question__title": "Day of the Year", "question__title_slug": "day-of-the-year", "question__hide": false, - "total_acs": 48511, - "total_submitted": 75803, - "total_column_articles": 558, + "total_acs": 48747, + "total_submitted": 76259, + "total_column_articles": 559, "frontend_question_id": "1154", "is_new_question": false }, @@ -30630,9 +30924,9 @@ "question__title": "Article Views II", "question__title_slug": "article-views-ii", "question__hide": false, - "total_acs": 8127, - "total_submitted": 18281, - "total_column_articles": 61, + "total_acs": 8269, + "total_submitted": 18629, + "total_column_articles": 62, "frontend_question_id": "1149", "is_new_question": false }, @@ -30651,9 +30945,9 @@ "question__title": "Article Views I", "question__title_slug": "article-views-i", "question__hide": false, - "total_acs": 19405, - "total_submitted": 27197, - "total_column_articles": 83, + "total_acs": 20747, + "total_submitted": 29068, + "total_column_articles": 89, "frontend_question_id": "1148", "is_new_question": false }, @@ -30672,8 +30966,8 @@ "question__title": "Rank Transform of a Matrix", "question__title_slug": "rank-transform-of-a-matrix", "question__hide": false, - "total_acs": 1823, - "total_submitted": 5481, + "total_acs": 1827, + "total_submitted": 5504, "total_column_articles": 38, "frontend_question_id": "1632", "is_new_question": false @@ -30693,9 +30987,9 @@ "question__title": "Rank Transform of an Array", "question__title_slug": "rank-transform-of-an-array", "question__hide": false, - "total_acs": 15396, - "total_submitted": 29061, - "total_column_articles": 270, + "total_acs": 15514, + "total_submitted": 29307, + "total_column_articles": 272, "frontend_question_id": "1331", "is_new_question": false }, @@ -30714,8 +31008,8 @@ "question__title": "Reverse Subarray To Maximize Array Value", "question__title_slug": "reverse-subarray-to-maximize-array-value", "question__hide": false, - "total_acs": 1495, - "total_submitted": 3731, + "total_acs": 1510, + "total_submitted": 3762, "total_column_articles": 35, "frontend_question_id": "1330", "is_new_question": false @@ -30735,9 +31029,9 @@ "question__title": "Deepest Leaves Sum", "question__title_slug": "deepest-leaves-sum", "question__hide": false, - "total_acs": 24902, - "total_submitted": 30133, - "total_column_articles": 353, + "total_acs": 25130, + "total_submitted": 30382, + "total_column_articles": 357, "frontend_question_id": "1302", "is_new_question": false }, @@ -30756,9 +31050,9 @@ "question__title": "Sort the Matrix Diagonally", "question__title_slug": "sort-the-matrix-diagonally", "question__hide": false, - "total_acs": 8484, - "total_submitted": 11011, - "total_column_articles": 199, + "total_acs": 8547, + "total_submitted": 11085, + "total_column_articles": 200, "frontend_question_id": "1329", "is_new_question": false }, @@ -30777,9 +31071,9 @@ "question__title": "Break a Palindrome", "question__title_slug": "break-a-palindrome", "question__hide": false, - "total_acs": 6934, - "total_submitted": 14789, - "total_column_articles": 139, + "total_acs": 6989, + "total_submitted": 14915, + "total_column_articles": 140, "frontend_question_id": "1328", "is_new_question": false }, @@ -30798,9 +31092,9 @@ "question__title": "Longest Chunked Palindrome Decomposition", "question__title_slug": "longest-chunked-palindrome-decomposition", "question__hide": false, - "total_acs": 5438, - "total_submitted": 9591, - "total_column_articles": 102, + "total_acs": 5494, + "total_submitted": 9697, + "total_column_articles": 104, "frontend_question_id": "1147", "is_new_question": false }, @@ -30819,9 +31113,9 @@ "question__title": "Longest Common Subsequence", "question__title_slug": "longest-common-subsequence", "question__hide": false, - "total_acs": 245500, - "total_submitted": 381100, - "total_column_articles": 1503, + "total_acs": 249477, + "total_submitted": 386793, + "total_column_articles": 1522, "frontend_question_id": "1143", "is_new_question": false }, @@ -30840,9 +31134,9 @@ "question__title": "Snapshot Array", "question__title_slug": "snapshot-array", "question__hide": false, - "total_acs": 6207, - "total_submitted": 19901, - "total_column_articles": 83, + "total_acs": 6331, + "total_submitted": 20278, + "total_column_articles": 85, "frontend_question_id": "1146", "is_new_question": false }, @@ -30861,8 +31155,8 @@ "question__title": "Binary Tree Coloring Game", "question__title_slug": "binary-tree-coloring-game", "question__hide": false, - "total_acs": 7769, - "total_submitted": 16356, + "total_acs": 7816, + "total_submitted": 16443, "total_column_articles": 128, "frontend_question_id": "1145", "is_new_question": false @@ -30882,9 +31176,9 @@ "question__title": "Decrease Elements To Make Array Zigzag", "question__title_slug": "decrease-elements-to-make-array-zigzag", "question__hide": false, - "total_acs": 11458, - "total_submitted": 25733, - "total_column_articles": 158, + "total_acs": 11510, + "total_submitted": 25846, + "total_column_articles": 159, "frontend_question_id": "1144", "is_new_question": false }, @@ -30903,9 +31197,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": 9859, - "total_submitted": 26517, - "total_column_articles": 61, + "total_acs": 9979, + "total_submitted": 26833, + "total_column_articles": 62, "frontend_question_id": "1142", "is_new_question": false }, @@ -30924,9 +31218,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": 21880, - "total_submitted": 46394, - "total_column_articles": 145, + "total_acs": 23043, + "total_submitted": 49171, + "total_column_articles": 150, "frontend_question_id": "1141", "is_new_question": false }, @@ -30945,9 +31239,9 @@ "question__title": "Distinct Echo Substrings", "question__title_slug": "distinct-echo-substrings", "question__hide": false, - "total_acs": 3582, - "total_submitted": 7831, - "total_column_articles": 71, + "total_acs": 3624, + "total_submitted": 7909, + "total_column_articles": 74, "frontend_question_id": "1316", "is_new_question": false }, @@ -30966,9 +31260,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": 15182, - "total_submitted": 18655, - "total_column_articles": 323, + "total_acs": 15305, + "total_submitted": 18796, + "total_column_articles": 328, "frontend_question_id": "1315", "is_new_question": false }, @@ -30987,8 +31281,8 @@ "question__title": "Matrix Block Sum", "question__title_slug": "matrix-block-sum", "question__hide": false, - "total_acs": 18666, - "total_submitted": 24703, + "total_acs": 18820, + "total_submitted": 24901, "total_column_articles": 294, "frontend_question_id": "1314", "is_new_question": false @@ -31008,9 +31302,9 @@ "question__title": "Decompress Run-Length Encoded List", "question__title_slug": "decompress-run-length-encoded-list", "question__hide": false, - "total_acs": 38575, - "total_submitted": 46339, - "total_column_articles": 594, + "total_acs": 38736, + "total_submitted": 46571, + "total_column_articles": 595, "frontend_question_id": "1313", "is_new_question": false }, @@ -31029,8 +31323,8 @@ "question__title": "Stone Game II", "question__title_slug": "stone-game-ii", "question__hide": false, - "total_acs": 8490, - "total_submitted": 12849, + "total_acs": 8616, + "total_submitted": 13029, "total_column_articles": 113, "frontend_question_id": "1140", "is_new_question": false @@ -31050,9 +31344,9 @@ "question__title": "Largest 1-Bordered Square", "question__title_slug": "largest-1-bordered-square", "question__hide": false, - "total_acs": 11198, - "total_submitted": 22956, - "total_column_articles": 175, + "total_acs": 11319, + "total_submitted": 23166, + "total_column_articles": 176, "frontend_question_id": "1139", "is_new_question": false }, @@ -31071,9 +31365,9 @@ "question__title": "Alphabet Board Path", "question__title_slug": "alphabet-board-path", "question__hide": false, - "total_acs": 7199, - "total_submitted": 16272, - "total_column_articles": 163, + "total_acs": 7249, + "total_submitted": 16381, + "total_column_articles": 164, "frontend_question_id": "1138", "is_new_question": false }, @@ -31092,9 +31386,9 @@ "question__title": "Reported Posts II", "question__title_slug": "reported-posts-ii", "question__hide": false, - "total_acs": 6997, - "total_submitted": 18000, - "total_column_articles": 66, + "total_acs": 7107, + "total_submitted": 18300, + "total_column_articles": 67, "frontend_question_id": "1132", "is_new_question": false }, @@ -31113,9 +31407,9 @@ "question__title": "N-th Tribonacci Number", "question__title_slug": "n-th-tribonacci-number", "question__hide": false, - "total_acs": 126839, - "total_submitted": 208450, - "total_column_articles": 1211, + "total_acs": 127634, + "total_submitted": 209718, + "total_column_articles": 1216, "frontend_question_id": "1137", "is_new_question": false }, @@ -31134,9 +31428,9 @@ "question__title": "Number of Paths with Max Score", "question__title_slug": "number-of-paths-with-max-score", "question__hide": false, - "total_acs": 4944, - "total_submitted": 13238, - "total_column_articles": 104, + "total_acs": 5007, + "total_submitted": 13422, + "total_column_articles": 108, "frontend_question_id": "1301", "is_new_question": false }, @@ -31155,9 +31449,9 @@ "question__title": "Number of Ships in a Rectangle", "question__title_slug": "number-of-ships-in-a-rectangle", "question__hide": false, - "total_acs": 1184, - "total_submitted": 1905, - "total_column_articles": 28, + "total_acs": 1193, + "total_submitted": 1915, + "total_column_articles": 29, "frontend_question_id": "1274", "is_new_question": false }, @@ -31176,8 +31470,8 @@ "question__title": "Sum of Mutated Array Closest to Target", "question__title_slug": "sum-of-mutated-array-closest-to-target", "question__hide": false, - "total_acs": 27162, - "total_submitted": 58370, + "total_acs": 27313, + "total_submitted": 58744, "total_column_articles": 408, "frontend_question_id": "1300", "is_new_question": false @@ -31197,9 +31491,9 @@ "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": 34916, - "total_submitted": 44297, - "total_column_articles": 495, + "total_acs": 35105, + "total_submitted": 44541, + "total_column_articles": 499, "frontend_question_id": "1299", "is_new_question": false }, @@ -31218,8 +31512,8 @@ "question__title": "Maximum of Absolute Value Expression", "question__title_slug": "maximum-of-absolute-value-expression", "question__hide": false, - "total_acs": 3710, - "total_submitted": 7979, + "total_acs": 3736, + "total_submitted": 8030, "total_column_articles": 56, "frontend_question_id": "1131", "is_new_question": false @@ -31239,9 +31533,9 @@ "question__title": "Shortest Path with Alternating Colors", "question__title_slug": "shortest-path-with-alternating-colors", "question__hide": false, - "total_acs": 8496, - "total_submitted": 21377, - "total_column_articles": 178, + "total_acs": 8611, + "total_submitted": 21647, + "total_column_articles": 184, "frontend_question_id": "1129", "is_new_question": false }, @@ -31260,9 +31554,9 @@ "question__title": "Minimum Cost Tree From Leaf Values", "question__title_slug": "minimum-cost-tree-from-leaf-values", "question__hide": false, - "total_acs": 7429, - "total_submitted": 11587, - "total_column_articles": 129, + "total_acs": 7492, + "total_submitted": 11703, + "total_column_articles": 131, "frontend_question_id": "1130", "is_new_question": false }, @@ -31281,8 +31575,8 @@ "question__title": "Number of Equivalent Domino Pairs", "question__title_slug": "number-of-equivalent-domino-pairs", "question__hide": false, - "total_acs": 39891, - "total_submitted": 73453, + "total_acs": 40018, + "total_submitted": 73715, "total_column_articles": 503, "frontend_question_id": "1128", "is_new_question": false @@ -31302,8 +31596,8 @@ "question__title": "User Purchase Platform", "question__title_slug": "user-purchase-platform", "question__hide": false, - "total_acs": 6014, - "total_submitted": 14044, + "total_acs": 6123, + "total_submitted": 14269, "total_column_articles": 94, "frontend_question_id": "1127", "is_new_question": false @@ -31323,9 +31617,9 @@ "question__title": "Active Businesses", "question__title_slug": "active-businesses", "question__hide": false, - "total_acs": 9348, - "total_submitted": 13593, - "total_column_articles": 115, + "total_acs": 9569, + "total_submitted": 13927, + "total_column_articles": 118, "frontend_question_id": "1126", "is_new_question": false }, @@ -31344,9 +31638,9 @@ "question__title": "Minimum Falling Path Sum II", "question__title_slug": "minimum-falling-path-sum-ii", "question__hide": false, - "total_acs": 10398, - "total_submitted": 17169, - "total_column_articles": 138, + "total_acs": 10566, + "total_submitted": 17493, + "total_column_articles": 141, "frontend_question_id": "1289", "is_new_question": false }, @@ -31365,8 +31659,8 @@ "question__title": "Graph Connectivity With Threshold", "question__title_slug": "graph-connectivity-with-threshold", "question__hide": false, - "total_acs": 3077, - "total_submitted": 7741, + "total_acs": 3106, + "total_submitted": 7789, "total_column_articles": 49, "frontend_question_id": "1627", "is_new_question": false @@ -31386,9 +31680,9 @@ "question__title": "Remove Covered Intervals", "question__title_slug": "remove-covered-intervals", "question__hide": false, - "total_acs": 20116, - "total_submitted": 35757, - "total_column_articles": 230, + "total_acs": 20429, + "total_submitted": 36359, + "total_column_articles": 232, "frontend_question_id": "1288", "is_new_question": false }, @@ -31407,9 +31701,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": 19303, - "total_submitted": 32253, - "total_column_articles": 271, + "total_acs": 19508, + "total_submitted": 32631, + "total_column_articles": 273, "frontend_question_id": "1287", "is_new_question": false }, @@ -31428,9 +31722,9 @@ "question__title": "Smallest Sufficient Team", "question__title_slug": "smallest-sufficient-team", "question__hide": false, - "total_acs": 3872, - "total_submitted": 7797, - "total_column_articles": 61, + "total_acs": 3894, + "total_submitted": 7828, + "total_column_articles": 62, "frontend_question_id": "1125", "is_new_question": false }, @@ -31449,8 +31743,8 @@ "question__title": "Longest Well-Performing Interval", "question__title_slug": "longest-well-performing-interval", "question__hide": false, - "total_acs": 16381, - "total_submitted": 48912, + "total_acs": 16538, + "total_submitted": 49326, "total_column_articles": 175, "frontend_question_id": "1124", "is_new_question": false @@ -31470,9 +31764,9 @@ "question__title": "Lowest Common Ancestor of Deepest Leaves", "question__title_slug": "lowest-common-ancestor-of-deepest-leaves", "question__hide": false, - "total_acs": 10342, - "total_submitted": 14525, - "total_column_articles": 138, + "total_acs": 10462, + "total_submitted": 14680, + "total_column_articles": 139, "frontend_question_id": "1123", "is_new_question": false }, @@ -31491,9 +31785,9 @@ "question__title": "Relative Sort Array", "question__title_slug": "relative-sort-array", "question__hide": false, - "total_acs": 74812, - "total_submitted": 105591, - "total_column_articles": 989, + "total_acs": 75401, + "total_submitted": 106342, + "total_column_articles": 997, "frontend_question_id": "1122", "is_new_question": false }, @@ -31512,9 +31806,9 @@ "question__title": "Print Zero Even Odd", "question__title_slug": "print-zero-even-odd", "question__hide": false, - "total_acs": 27988, - "total_submitted": 52748, - "total_column_articles": 420, + "total_acs": 28176, + "total_submitted": 53092, + "total_column_articles": 422, "frontend_question_id": "1116", "is_new_question": false }, @@ -31533,8 +31827,8 @@ "question__title": "Reported Posts", "question__title_slug": "reported-posts", "question__hide": false, - "total_acs": 10072, - "total_submitted": 18876, + "total_acs": 10212, + "total_submitted": 19130, "total_column_articles": 66, "frontend_question_id": "1113", "is_new_question": false @@ -31554,8 +31848,8 @@ "question__title": "Highest Grade For Each Student", "question__title_slug": "highest-grade-for-each-student", "question__hide": false, - "total_acs": 11711, - "total_submitted": 17844, + "total_acs": 11996, + "total_submitted": 18277, "total_column_articles": 120, "frontend_question_id": "1112", "is_new_question": false @@ -31575,8 +31869,8 @@ "question__title": "Handshakes That Don't Cross", "question__title_slug": "handshakes-that-dont-cross", "question__hide": false, - "total_acs": 2674, - "total_submitted": 5173, + "total_acs": 2700, + "total_submitted": 5214, "total_column_articles": 55, "frontend_question_id": "1259", "is_new_question": false @@ -31596,9 +31890,9 @@ "question__title": "Sequential Digits", "question__title_slug": "sequential-digits", "question__hide": false, - "total_acs": 8808, - "total_submitted": 16713, - "total_column_articles": 197, + "total_acs": 8877, + "total_submitted": 16832, + "total_column_articles": 199, "frontend_question_id": "1291", "is_new_question": false }, @@ -31617,9 +31911,9 @@ "question__title": "Iterator for Combination", "question__title_slug": "iterator-for-combination", "question__hide": false, - "total_acs": 5826, - "total_submitted": 8937, - "total_column_articles": 117, + "total_acs": 5870, + "total_submitted": 9013, + "total_column_articles": 118, "frontend_question_id": "1286", "is_new_question": false }, @@ -31638,9 +31932,9 @@ "question__title": "Mean of Array After Removing Some Elements", "question__title_slug": "mean-of-array-after-removing-some-elements", "question__hide": false, - "total_acs": 9921, - "total_submitted": 14872, - "total_column_articles": 163, + "total_acs": 10079, + "total_submitted": 15149, + "total_column_articles": 164, "frontend_question_id": "1619", "is_new_question": false }, @@ -31659,8 +31953,8 @@ "question__title": "Design Bounded Blocking Queue", "question__title_slug": "design-bounded-blocking-queue", "question__hide": false, - "total_acs": 4333, - "total_submitted": 6156, + "total_acs": 4355, + "total_submitted": 6184, "total_column_articles": 80, "frontend_question_id": "1188", "is_new_question": false @@ -31680,9 +31974,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": 25628, - "total_submitted": 33299, - "total_column_articles": 421, + "total_acs": 25716, + "total_submitted": 33416, + "total_column_articles": 422, "frontend_question_id": "1111", "is_new_question": false }, @@ -31701,9 +31995,9 @@ "question__title": "Delete Nodes And Return Forest", "question__title_slug": "delete-nodes-and-return-forest", "question__hide": false, - "total_acs": 15703, - "total_submitted": 24416, - "total_column_articles": 269, + "total_acs": 15966, + "total_submitted": 24815, + "total_column_articles": 273, "frontend_question_id": "1110", "is_new_question": false }, @@ -31722,9 +32016,9 @@ "question__title": "Corporate Flight Bookings", "question__title_slug": "corporate-flight-bookings", "question__hide": false, - "total_acs": 83677, - "total_submitted": 136538, - "total_column_articles": 1206, + "total_acs": 85139, + "total_submitted": 138692, + "total_column_articles": 1235, "frontend_question_id": "1109", "is_new_question": false }, @@ -31743,9 +32037,9 @@ "question__title": "Defanging an IP Address", "question__title_slug": "defanging-an-ip-address", "question__hide": false, - "total_acs": 74879, - "total_submitted": 89333, - "total_column_articles": 761, + "total_acs": 102725, + "total_submitted": 119678, + "total_column_articles": 934, "frontend_question_id": "1108", "is_new_question": false }, @@ -31764,8 +32058,8 @@ "question__title": "New Users Daily Count", "question__title_slug": "new-users-daily-count", "question__hide": false, - "total_acs": 10172, - "total_submitted": 24694, + "total_acs": 10326, + "total_submitted": 25033, "total_column_articles": 124, "frontend_question_id": "1107", "is_new_question": false @@ -31785,9 +32079,9 @@ "question__title": "Print in Order", "question__title_slug": "print-in-order", "question__hide": false, - "total_acs": 93673, - "total_submitted": 143582, - "total_column_articles": 672, + "total_acs": 94259, + "total_submitted": 144486, + "total_column_articles": 676, "frontend_question_id": "1114", "is_new_question": false }, @@ -31806,9 +32100,9 @@ "question__title": "Palindrome Removal", "question__title_slug": "palindrome-removal", "question__hide": false, - "total_acs": 3460, - "total_submitted": 7023, - "total_column_articles": 47, + "total_acs": 3490, + "total_submitted": 7066, + "total_column_articles": 48, "frontend_question_id": "1246", "is_new_question": false }, @@ -31827,8 +32121,8 @@ "question__title": "Delete Tree Nodes", "question__title_slug": "delete-tree-nodes", "question__hide": false, - "total_acs": 2010, - "total_submitted": 3656, + "total_acs": 2035, + "total_submitted": 3686, "total_column_articles": 61, "frontend_question_id": "1273", "is_new_question": false @@ -31848,8 +32142,8 @@ "question__title": "Remove Interval", "question__title_slug": "remove-interval", "question__hide": false, - "total_acs": 2118, - "total_submitted": 3865, + "total_acs": 2139, + "total_submitted": 3901, "total_column_articles": 41, "frontend_question_id": "1272", "is_new_question": false @@ -31869,8 +32163,8 @@ "question__title": "Hexspeak", "question__title_slug": "hexspeak", "question__hide": false, - "total_acs": 2798, - "total_submitted": 5465, + "total_acs": 2818, + "total_submitted": 5495, "total_column_articles": 54, "frontend_question_id": "1271", "is_new_question": false @@ -31890,9 +32184,9 @@ "question__title": "Unpopular Books", "question__title_slug": "unpopular-books", "question__hide": false, - "total_acs": 10761, - "total_submitted": 22658, - "total_column_articles": 121, + "total_acs": 10965, + "total_submitted": 23046, + "total_column_articles": 122, "frontend_question_id": "1098", "is_new_question": false }, @@ -31911,9 +32205,9 @@ "question__title": "Parsing A Boolean Expression", "question__title_slug": "parsing-a-boolean-expression", "question__hide": false, - "total_acs": 5079, - "total_submitted": 8635, - "total_column_articles": 153, + "total_acs": 5124, + "total_submitted": 8702, + "total_column_articles": 156, "frontend_question_id": "1106", "is_new_question": false }, @@ -31932,8 +32226,8 @@ "question__title": "Filling Bookcase Shelves", "question__title_slug": "filling-bookcase-shelves", "question__hide": false, - "total_acs": 6267, - "total_submitted": 10987, + "total_acs": 6333, + "total_submitted": 11082, "total_column_articles": 80, "frontend_question_id": "1105", "is_new_question": false @@ -31953,9 +32247,9 @@ "question__title": "Distribute Candies to People", "question__title_slug": "distribute-candies-to-people", "question__hide": false, - "total_acs": 39361, - "total_submitted": 61709, - "total_column_articles": 1155, + "total_acs": 39532, + "total_submitted": 61992, + "total_column_articles": 1157, "frontend_question_id": "1103", "is_new_question": false }, @@ -31974,9 +32268,9 @@ "question__title": "Path In Zigzag Labelled Binary Tree", "question__title_slug": "path-in-zigzag-labelled-binary-tree", "question__hide": false, - "total_acs": 30601, - "total_submitted": 40265, - "total_column_articles": 719, + "total_acs": 30686, + "total_submitted": 40384, + "total_column_articles": 723, "frontend_question_id": "1104", "is_new_question": false }, @@ -31995,9 +32289,9 @@ "question__title": "Game Play Analysis V", "question__title_slug": "game-play-analysis-v", "question__hide": false, - "total_acs": 9173, - "total_submitted": 17547, - "total_column_articles": 150, + "total_acs": 9318, + "total_submitted": 17787, + "total_column_articles": 151, "frontend_question_id": "1097", "is_new_question": false }, @@ -32016,9 +32310,9 @@ "question__title": "Divide Chocolate", "question__title_slug": "divide-chocolate", "question__hide": false, - "total_acs": 5480, - "total_submitted": 9521, - "total_column_articles": 83, + "total_acs": 5589, + "total_submitted": 9693, + "total_column_articles": 85, "frontend_question_id": "1231", "is_new_question": false }, @@ -32037,9 +32331,9 @@ "question__title": "Synonymous Sentences", "question__title_slug": "synonymous-sentences", "question__hide": false, - "total_acs": 1647, - "total_submitted": 2897, - "total_column_articles": 63, + "total_acs": 1683, + "total_submitted": 2956, + "total_column_articles": 66, "frontend_question_id": "1258", "is_new_question": false }, @@ -32058,8 +32352,8 @@ "question__title": "Smallest Common Region", "question__title_slug": "smallest-common-region", "question__hide": false, - "total_acs": 2233, - "total_submitted": 3896, + "total_acs": 2240, + "total_submitted": 3906, "total_column_articles": 54, "frontend_question_id": "1257", "is_new_question": false @@ -32079,8 +32373,8 @@ "question__title": "Encode Number", "question__title_slug": "encode-number", "question__hide": false, - "total_acs": 1792, - "total_submitted": 2654, + "total_acs": 1802, + "total_submitted": 2668, "total_column_articles": 44, "frontend_question_id": "1256", "is_new_question": false @@ -32100,8 +32394,8 @@ "question__title": "Brace Expansion II", "question__title_slug": "brace-expansion-ii", "question__hide": false, - "total_acs": 2168, - "total_submitted": 3864, + "total_acs": 2184, + "total_submitted": 3888, "total_column_articles": 59, "frontend_question_id": "1096", "is_new_question": false @@ -32121,9 +32415,9 @@ "question__title": "Print FooBar Alternately", "question__title_slug": "print-foobar-alternately", "question__hide": false, - "total_acs": 53311, - "total_submitted": 94580, - "total_column_articles": 556, + "total_acs": 53705, + "total_submitted": 95285, + "total_column_articles": 560, "frontend_question_id": "1115", "is_new_question": false }, @@ -32142,9 +32436,9 @@ "question__title": "Building H2O", "question__title_slug": "building-h2o", "question__hide": false, - "total_acs": 21341, - "total_submitted": 40247, - "total_column_articles": 298, + "total_acs": 21495, + "total_submitted": 40491, + "total_column_articles": 300, "frontend_question_id": "1117", "is_new_question": false }, @@ -32163,9 +32457,9 @@ "question__title": "Find in Mountain Array", "question__title_slug": "find-in-mountain-array", "question__hide": false, - "total_acs": 23490, - "total_submitted": 62641, - "total_column_articles": 435, + "total_acs": 23665, + "total_submitted": 63088, + "total_column_articles": 436, "frontend_question_id": "1095", "is_new_question": false }, @@ -32184,9 +32478,9 @@ "question__title": "Car Pooling", "question__title_slug": "car-pooling", "question__hide": false, - "total_acs": 48686, - "total_submitted": 89345, - "total_column_articles": 845, + "total_acs": 49776, + "total_submitted": 91559, + "total_column_articles": 871, "frontend_question_id": "1094", "is_new_question": false }, @@ -32205,8 +32499,8 @@ "question__title": "Statistics from a Large Sample", "question__title_slug": "statistics-from-a-large-sample", "question__hide": false, - "total_acs": 4484, - "total_submitted": 12213, + "total_acs": 4528, + "total_submitted": 12322, "total_column_articles": 76, "frontend_question_id": "1093", "is_new_question": false @@ -32226,9 +32520,9 @@ "question__title": "Game Play Analysis IV", "question__title_slug": "game-play-analysis-iv", "question__hide": false, - "total_acs": 19227, - "total_submitted": 43831, - "total_column_articles": 247, + "total_acs": 19630, + "total_submitted": 44654, + "total_column_articles": 254, "frontend_question_id": "550", "is_new_question": false }, @@ -32247,9 +32541,9 @@ "question__title": "Game Play Analysis III", "question__title_slug": "game-play-analysis-iii", "question__hide": false, - "total_acs": 21804, - "total_submitted": 32010, - "total_column_articles": 173, + "total_acs": 22184, + "total_submitted": 32521, + "total_column_articles": 176, "frontend_question_id": "534", "is_new_question": false }, @@ -32268,9 +32562,9 @@ "question__title": "Game Play Analysis II", "question__title_slug": "game-play-analysis-ii", "question__hide": false, - "total_acs": 27314, - "total_submitted": 50651, - "total_column_articles": 195, + "total_acs": 27687, + "total_submitted": 51336, + "total_column_articles": 199, "frontend_question_id": "512", "is_new_question": false }, @@ -32289,9 +32583,9 @@ "question__title": "Game Play Analysis I", "question__title_slug": "game-play-analysis-i", "question__hide": false, - "total_acs": 40975, - "total_submitted": 56679, - "total_column_articles": 199, + "total_acs": 42697, + "total_submitted": 59049, + "total_column_articles": 205, "frontend_question_id": "511", "is_new_question": false }, @@ -32310,9 +32604,9 @@ "question__title": "Valid Palindrome III", "question__title_slug": "valid-palindrome-iii", "question__hide": false, - "total_acs": 2227, - "total_submitted": 3935, - "total_column_articles": 47, + "total_acs": 2239, + "total_submitted": 3953, + "total_column_articles": 48, "frontend_question_id": "1216", "is_new_question": false }, @@ -32331,8 +32625,8 @@ "question__title": "Tree Diameter", "question__title_slug": "tree-diameter", "question__hide": false, - "total_acs": 4660, - "total_submitted": 8977, + "total_acs": 4696, + "total_submitted": 9046, "total_column_articles": 89, "frontend_question_id": "1245", "is_new_question": false @@ -32352,8 +32646,8 @@ "question__title": "Design A Leaderboard", "question__title_slug": "design-a-leaderboard", "question__hide": false, - "total_acs": 3275, - "total_submitted": 5224, + "total_acs": 3311, + "total_submitted": 5280, "total_column_articles": 53, "frontend_question_id": "1244", "is_new_question": false @@ -32373,8 +32667,8 @@ "question__title": "Array Transformation", "question__title_slug": "array-transformation", "question__hide": false, - "total_acs": 3064, - "total_submitted": 5730, + "total_acs": 3077, + "total_submitted": 5759, "total_column_articles": 70, "frontend_question_id": "1243", "is_new_question": false @@ -32394,9 +32688,9 @@ "question__title": "Sales Analysis III", "question__title_slug": "sales-analysis-iii", "question__hide": false, - "total_acs": 21664, - "total_submitted": 38717, - "total_column_articles": 177, + "total_acs": 22758, + "total_submitted": 40881, + "total_column_articles": 184, "frontend_question_id": "1084", "is_new_question": false }, @@ -32415,9 +32709,9 @@ "question__title": "Sales Analysis II", "question__title_slug": "sales-analysis-ii", "question__hide": false, - "total_acs": 15030, - "total_submitted": 28522, - "total_column_articles": 135, + "total_acs": 15190, + "total_submitted": 28835, + "total_column_articles": 137, "frontend_question_id": "1083", "is_new_question": false }, @@ -32436,9 +32730,9 @@ "question__title": "Sales Analysis I", "question__title_slug": "sales-analysis-i", "question__hide": false, - "total_acs": 16187, - "total_submitted": 21255, - "total_column_articles": 122, + "total_acs": 16409, + "total_submitted": 21539, + "total_column_articles": 123, "frontend_question_id": "1082", "is_new_question": false }, @@ -32457,9 +32751,9 @@ "question__title": "Shortest Path in Binary Matrix", "question__title_slug": "shortest-path-in-binary-matrix", "question__hide": false, - "total_acs": 46540, - "total_submitted": 120589, - "total_column_articles": 471, + "total_acs": 47289, + "total_submitted": 122510, + "total_column_articles": 475, "frontend_question_id": "1091", "is_new_question": false }, @@ -32478,9 +32772,9 @@ "question__title": "Shortest Common Supersequence ", "question__title_slug": "shortest-common-supersequence", "question__hide": false, - "total_acs": 3653, - "total_submitted": 7055, - "total_column_articles": 68, + "total_acs": 3689, + "total_submitted": 7116, + "total_column_articles": 70, "frontend_question_id": "1092", "is_new_question": false }, @@ -32499,9 +32793,9 @@ "question__title": "Largest Values From Labels", "question__title_slug": "largest-values-from-labels", "question__hide": false, - "total_acs": 4870, - "total_submitted": 8716, - "total_column_articles": 104, + "total_acs": 4930, + "total_submitted": 8826, + "total_column_articles": 106, "frontend_question_id": "1090", "is_new_question": false }, @@ -32520,9 +32814,9 @@ "question__title": "Duplicate Zeros", "question__title_slug": "duplicate-zeros", "question__hide": false, - "total_acs": 49595, - "total_submitted": 81568, - "total_column_articles": 669, + "total_acs": 51749, + "total_submitted": 85174, + "total_column_articles": 691, "frontend_question_id": "1089", "is_new_question": false }, @@ -32541,8 +32835,8 @@ "question__title": "Minimum Time to Build Blocks", "question__title_slug": "minimum-time-to-build-blocks", "question__hide": false, - "total_acs": 898, - "total_submitted": 1951, + "total_acs": 901, + "total_submitted": 1954, "total_column_articles": 23, "frontend_question_id": "1199", "is_new_question": false @@ -32562,8 +32856,8 @@ "question__title": "Toss Strange Coins", "question__title_slug": "toss-strange-coins", "question__hide": false, - "total_acs": 4841, - "total_submitted": 9158, + "total_acs": 4885, + "total_submitted": 9243, "total_column_articles": 93, "frontend_question_id": "1230", "is_new_question": false @@ -32583,9 +32877,9 @@ "question__title": "Meeting Scheduler", "question__title_slug": "meeting-scheduler", "question__hide": false, - "total_acs": 4521, - "total_submitted": 10052, - "total_column_articles": 94, + "total_acs": 4605, + "total_submitted": 10204, + "total_column_articles": 96, "frontend_question_id": "1229", "is_new_question": false }, @@ -32604,9 +32898,9 @@ "question__title": "Missing Number In Arithmetic Progression", "question__title_slug": "missing-number-in-arithmetic-progression", "question__hide": false, - "total_acs": 3620, - "total_submitted": 6746, - "total_column_articles": 69, + "total_acs": 3658, + "total_submitted": 6834, + "total_column_articles": 70, "frontend_question_id": "1228", "is_new_question": false }, @@ -32625,9 +32919,9 @@ "question__title": "Project Employees III", "question__title_slug": "project-employees-iii", "question__hide": false, - "total_acs": 11411, - "total_submitted": 15819, - "total_column_articles": 115, + "total_acs": 11671, + "total_submitted": 16159, + "total_column_articles": 118, "frontend_question_id": "1077", "is_new_question": false }, @@ -32646,8 +32940,8 @@ "question__title": "Project Employees II", "question__title_slug": "project-employees-ii", "question__hide": false, - "total_acs": 14695, - "total_submitted": 29928, + "total_acs": 14908, + "total_submitted": 30323, "total_column_articles": 116, "frontend_question_id": "1076", "is_new_question": false @@ -32667,8 +32961,8 @@ "question__title": "Project Employees I", "question__title_slug": "project-employees-i", "question__hide": false, - "total_acs": 13686, - "total_submitted": 19652, + "total_acs": 13865, + "total_submitted": 19920, "total_column_articles": 95, "frontend_question_id": "1075", "is_new_question": false @@ -32688,9 +32982,9 @@ "question__title": "Letter Tile Possibilities", "question__title_slug": "letter-tile-possibilities", "question__hide": false, - "total_acs": 14234, - "total_submitted": 19378, - "total_column_articles": 230, + "total_acs": 14371, + "total_submitted": 19560, + "total_column_articles": 232, "frontend_question_id": "1079", "is_new_question": false }, @@ -32709,9 +33003,9 @@ "question__title": "Smallest Subsequence of Distinct Characters", "question__title_slug": "smallest-subsequence-of-distinct-characters", "question__hide": false, - "total_acs": 20326, - "total_submitted": 34917, - "total_column_articles": 209, + "total_acs": 20575, + "total_submitted": 35382, + "total_column_articles": 210, "frontend_question_id": "1081", "is_new_question": false }, @@ -32730,8 +33024,8 @@ "question__title": "Insufficient Nodes in Root to Leaf Paths", "question__title_slug": "insufficient-nodes-in-root-to-leaf-paths", "question__hide": false, - "total_acs": 5865, - "total_submitted": 11556, + "total_acs": 5946, + "total_submitted": 11688, "total_column_articles": 120, "frontend_question_id": "1080", "is_new_question": false @@ -32751,9 +33045,9 @@ "question__title": "Occurrences After Bigram", "question__title_slug": "occurrences-after-bigram", "question__hide": false, - "total_acs": 33948, - "total_submitted": 51749, - "total_column_articles": 465, + "total_acs": 34092, + "total_submitted": 52020, + "total_column_articles": 468, "frontend_question_id": "1078", "is_new_question": false }, @@ -32772,8 +33066,8 @@ "question__title": "Product Sales Analysis III", "question__title_slug": "product-sales-analysis-iii", "question__hide": false, - "total_acs": 11271, - "total_submitted": 23640, + "total_acs": 11412, + "total_submitted": 23957, "total_column_articles": 87, "frontend_question_id": "1070", "is_new_question": false @@ -32793,8 +33087,8 @@ "question__title": "Product Sales Analysis II", "question__title_slug": "product-sales-analysis-ii", "question__hide": false, - "total_acs": 15184, - "total_submitted": 18637, + "total_acs": 15376, + "total_submitted": 18874, "total_column_articles": 74, "frontend_question_id": "1069", "is_new_question": false @@ -32814,8 +33108,8 @@ "question__title": "Product Sales Analysis I", "question__title_slug": "product-sales-analysis-i", "question__hide": false, - "total_acs": 17588, - "total_submitted": 20335, + "total_acs": 17788, + "total_submitted": 20563, "total_column_articles": 84, "frontend_question_id": "1068", "is_new_question": false @@ -32835,8 +33129,8 @@ "question__title": "Maximum Number of Ones", "question__title_slug": "maximum-number-of-ones", "question__hide": false, - "total_acs": 767, - "total_submitted": 1277, + "total_acs": 771, + "total_submitted": 1286, "total_column_articles": 19, "frontend_question_id": "1183", "is_new_question": false @@ -32856,8 +33150,8 @@ "question__title": "Stepping Numbers", "question__title_slug": "stepping-numbers", "question__hide": false, - "total_acs": 2263, - "total_submitted": 5338, + "total_acs": 2278, + "total_submitted": 5372, "total_column_articles": 48, "frontend_question_id": "1215", "is_new_question": false @@ -32877,8 +33171,8 @@ "question__title": "Two Sum BSTs", "question__title_slug": "two-sum-bsts", "question__hide": false, - "total_acs": 4355, - "total_submitted": 6682, + "total_acs": 4380, + "total_submitted": 6717, "total_column_articles": 88, "frontend_question_id": "1214", "is_new_question": false @@ -32898,9 +33192,9 @@ "question__title": "Intersection of Three Sorted Arrays", "question__title_slug": "intersection-of-three-sorted-arrays", "question__hide": false, - "total_acs": 7439, - "total_submitted": 9523, - "total_column_articles": 161, + "total_acs": 7500, + "total_submitted": 9604, + "total_column_articles": 162, "frontend_question_id": "1213", "is_new_question": false }, @@ -32919,8 +33213,8 @@ "question__title": "Adding Two Negabinary Numbers", "question__title_slug": "adding-two-negabinary-numbers", "question__hide": false, - "total_acs": 3010, - "total_submitted": 8647, + "total_acs": 3036, + "total_submitted": 8720, "total_column_articles": 61, "frontend_question_id": "1073", "is_new_question": false @@ -32940,8 +33234,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": 4243, - "total_submitted": 7015, + "total_acs": 4323, + "total_submitted": 7114, "total_column_articles": 68, "frontend_question_id": "1072", "is_new_question": false @@ -32961,8 +33255,8 @@ "question__title": "Greatest Common Divisor of Strings", "question__title_slug": "greatest-common-divisor-of-strings", "question__hide": false, - "total_acs": 38116, - "total_submitted": 64955, + "total_acs": 38301, + "total_submitted": 65319, "total_column_articles": 706, "frontend_question_id": "1071", "is_new_question": false @@ -32982,9 +33276,9 @@ "question__title": "Number of Submatrices That Sum to Target", "question__title_slug": "number-of-submatrices-that-sum-to-target", "question__hide": false, - "total_acs": 20209, - "total_submitted": 30124, - "total_column_articles": 210, + "total_acs": 20274, + "total_submitted": 30211, + "total_column_articles": 211, "frontend_question_id": "1074", "is_new_question": false }, @@ -33003,8 +33297,8 @@ "question__title": "Optimize Water Distribution in a Village", "question__title_slug": "optimize-water-distribution-in-a-village", "question__hide": false, - "total_acs": 2180, - "total_submitted": 3634, + "total_acs": 2195, + "total_submitted": 3655, "total_column_articles": 42, "frontend_question_id": "1168", "is_new_question": false @@ -33024,8 +33318,8 @@ "question__title": "Find Smallest Common Element in All Rows", "question__title_slug": "find-smallest-common-element-in-all-rows", "question__hide": false, - "total_acs": 4690, - "total_submitted": 6355, + "total_acs": 4742, + "total_submitted": 6419, "total_column_articles": 77, "frontend_question_id": "1198", "is_new_question": false @@ -33045,8 +33339,8 @@ "question__title": "Minimum Knight Moves", "question__title_slug": "minimum-knight-moves", "question__hide": false, - "total_acs": 6080, - "total_submitted": 15844, + "total_acs": 6119, + "total_submitted": 15937, "total_column_articles": 74, "frontend_question_id": "1197", "is_new_question": false @@ -33066,8 +33360,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": 4304, - "total_submitted": 6328, + "total_acs": 4326, + "total_submitted": 6367, "total_column_articles": 73, "frontend_question_id": "1196", "is_new_question": false @@ -33087,9 +33381,9 @@ "question__title": "Distant Barcodes", "question__title_slug": "distant-barcodes", "question__hide": false, - "total_acs": 9777, - "total_submitted": 24921, - "total_column_articles": 135, + "total_acs": 9874, + "total_submitted": 25171, + "total_column_articles": 136, "frontend_question_id": "1054", "is_new_question": false }, @@ -33108,9 +33402,9 @@ "question__title": "Previous Permutation With One Swap", "question__title_slug": "previous-permutation-with-one-swap", "question__hide": false, - "total_acs": 6926, - "total_submitted": 14967, - "total_column_articles": 107, + "total_acs": 6965, + "total_submitted": 15048, + "total_column_articles": 108, "frontend_question_id": "1053", "is_new_question": false }, @@ -33129,9 +33423,9 @@ "question__title": "Grumpy Bookstore Owner", "question__title_slug": "grumpy-bookstore-owner", "question__hide": false, - "total_acs": 55977, - "total_submitted": 96451, - "total_column_articles": 849, + "total_acs": 56309, + "total_submitted": 97018, + "total_column_articles": 850, "frontend_question_id": "1052", "is_new_question": false }, @@ -33150,9 +33444,9 @@ "question__title": "Height Checker", "question__title_slug": "height-checker", "question__hide": false, - "total_acs": 61982, - "total_submitted": 77448, - "total_column_articles": 631, + "total_acs": 62532, + "total_submitted": 78112, + "total_column_articles": 634, "frontend_question_id": "1051", "is_new_question": false }, @@ -33171,9 +33465,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": 23576, - "total_submitted": 30493, - "total_column_articles": 105, + "total_acs": 24617, + "total_submitted": 31834, + "total_column_articles": 111, "frontend_question_id": "1050", "is_new_question": false }, @@ -33192,9 +33486,9 @@ "question__title": "Customers Who Bought All Products", "question__title_slug": "customers-who-bought-all-products", "question__hide": false, - "total_acs": 12747, - "total_submitted": 20012, - "total_column_articles": 147, + "total_acs": 12970, + "total_submitted": 20413, + "total_column_articles": 151, "frontend_question_id": "1045", "is_new_question": false }, @@ -33213,9 +33507,9 @@ "question__title": "Shortest Distance to Target Color", "question__title_slug": "shortest-distance-to-target-color", "question__hide": false, - "total_acs": 4144, - "total_submitted": 9124, - "total_column_articles": 79, + "total_acs": 4221, + "total_submitted": 9275, + "total_column_articles": 82, "frontend_question_id": "1182", "is_new_question": false }, @@ -33234,8 +33528,8 @@ "question__title": "Last Substring in Lexicographical Order", "question__title_slug": "last-substring-in-lexicographical-order", "question__hide": false, - "total_acs": 6781, - "total_submitted": 25216, + "total_acs": 6828, + "total_submitted": 25406, "total_column_articles": 116, "frontend_question_id": "1163", "is_new_question": false @@ -33255,8 +33549,8 @@ "question__title": "Before and After Puzzle", "question__title_slug": "before-and-after-puzzle", "question__hide": false, - "total_acs": 1689, - "total_submitted": 4429, + "total_acs": 1694, + "total_submitted": 4437, "total_column_articles": 33, "frontend_question_id": "1181", "is_new_question": false @@ -33276,8 +33570,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": 3729, - "total_submitted": 4794, + "total_acs": 3746, + "total_submitted": 4823, "total_column_articles": 87, "frontend_question_id": "1180", "is_new_question": false @@ -33297,9 +33591,9 @@ "question__title": "Last Stone Weight II", "question__title_slug": "last-stone-weight-ii", "question__hide": false, - "total_acs": 73927, - "total_submitted": 109561, - "total_column_articles": 588, + "total_acs": 75600, + "total_submitted": 111831, + "total_column_articles": 591, "frontend_question_id": "1049", "is_new_question": false }, @@ -33318,8 +33612,8 @@ "question__title": "Longest String Chain", "question__title_slug": "longest-string-chain", "question__hide": false, - "total_acs": 14203, - "total_submitted": 29668, + "total_acs": 14369, + "total_submitted": 29963, "total_column_articles": 214, "frontend_question_id": "1048", "is_new_question": false @@ -33339,9 +33633,9 @@ "question__title": "Remove All Adjacent Duplicates In String", "question__title_slug": "remove-all-adjacent-duplicates-in-string", "question__hide": false, - "total_acs": 158589, - "total_submitted": 218167, - "total_column_articles": 1253, + "total_acs": 161169, + "total_submitted": 221814, + "total_column_articles": 1264, "frontend_question_id": "1047", "is_new_question": false }, @@ -33360,9 +33654,9 @@ "question__title": "Last Stone Weight", "question__title_slug": "last-stone-weight", "question__hide": false, - "total_acs": 76099, - "total_submitted": 115770, - "total_column_articles": 1038, + "total_acs": 76565, + "total_submitted": 116500, + "total_column_articles": 1049, "frontend_question_id": "1046", "is_new_question": false }, @@ -33381,9 +33675,9 @@ "question__title": "Minimum Cost to Connect Sticks", "question__title_slug": "minimum-cost-to-connect-sticks", "question__hide": false, - "total_acs": 3127, - "total_submitted": 6547, - "total_column_articles": 43, + "total_acs": 3158, + "total_submitted": 6589, + "total_column_articles": 45, "frontend_question_id": "1167", "is_new_question": false }, @@ -33402,9 +33696,9 @@ "question__title": "Design File System", "question__title_slug": "design-file-system", "question__hide": false, - "total_acs": 3889, - "total_submitted": 7901, - "total_column_articles": 65, + "total_acs": 3965, + "total_submitted": 8086, + "total_column_articles": 67, "frontend_question_id": "1166", "is_new_question": false }, @@ -33423,8 +33717,8 @@ "question__title": "String Transforms Into Another String", "question__title_slug": "string-transforms-into-another-string", "question__hide": false, - "total_acs": 1955, - "total_submitted": 5220, + "total_acs": 1961, + "total_submitted": 5245, "total_column_articles": 26, "frontend_question_id": "1153", "is_new_question": false @@ -33444,9 +33738,9 @@ "question__title": "Single-Row Keyboard", "question__title_slug": "single-row-keyboard", "question__hide": false, - "total_acs": 8552, - "total_submitted": 10242, - "total_column_articles": 137, + "total_acs": 8588, + "total_submitted": 10284, + "total_column_articles": 139, "frontend_question_id": "1165", "is_new_question": false }, @@ -33465,8 +33759,8 @@ "question__title": "Longest Duplicate Substring", "question__title_slug": "longest-duplicate-substring", "question__hide": false, - "total_acs": 24000, - "total_submitted": 68145, + "total_acs": 24239, + "total_submitted": 68654, "total_column_articles": 211, "frontend_question_id": "1044", "is_new_question": false @@ -33486,9 +33780,9 @@ "question__title": "Partition Array for Maximum Sum", "question__title_slug": "partition-array-for-maximum-sum", "question__hide": false, - "total_acs": 9767, - "total_submitted": 13952, - "total_column_articles": 128, + "total_acs": 9904, + "total_submitted": 14131, + "total_column_articles": 130, "frontend_question_id": "1043", "is_new_question": false }, @@ -33507,9 +33801,9 @@ "question__title": "Flower Planting With No Adjacent", "question__title_slug": "flower-planting-with-no-adjacent", "question__hide": false, - "total_acs": 14303, - "total_submitted": 26125, - "total_column_articles": 190, + "total_acs": 14443, + "total_submitted": 26352, + "total_column_articles": 191, "frontend_question_id": "1042", "is_new_question": false }, @@ -33528,9 +33822,9 @@ "question__title": "Robot Bounded In Circle", "question__title_slug": "robot-bounded-in-circle", "question__hide": false, - "total_acs": 9219, - "total_submitted": 18516, - "total_column_articles": 145, + "total_acs": 9306, + "total_submitted": 18668, + "total_column_articles": 146, "frontend_question_id": "1041", "is_new_question": false }, @@ -33549,8 +33843,8 @@ "question__title": "Divide Array Into Increasing Sequences", "question__title_slug": "divide-array-into-increasing-sequences", "question__hide": false, - "total_acs": 1275, - "total_submitted": 2181, + "total_acs": 1281, + "total_submitted": 2190, "total_column_articles": 20, "frontend_question_id": "1121", "is_new_question": false @@ -33570,9 +33864,9 @@ "question__title": "As Far from Land as Possible", "question__title_slug": "as-far-from-land-as-possible", "question__hide": false, - "total_acs": 45622, - "total_submitted": 97089, - "total_column_articles": 582, + "total_acs": 45966, + "total_submitted": 97776, + "total_column_articles": 586, "frontend_question_id": "1162", "is_new_question": false }, @@ -33591,9 +33885,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": 12850, - "total_submitted": 20436, - "total_column_articles": 214, + "total_acs": 12951, + "total_submitted": 20590, + "total_column_articles": 215, "frontend_question_id": "1161", "is_new_question": false }, @@ -33612,9 +33906,9 @@ "question__title": "Valid Boomerang", "question__title_slug": "valid-boomerang", "question__hide": false, - "total_acs": 37222, - "total_submitted": 75651, - "total_column_articles": 381, + "total_acs": 37456, + "total_submitted": 76134, + "total_column_articles": 382, "frontend_question_id": "1037", "is_new_question": false }, @@ -33633,9 +33927,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": 34823, - "total_submitted": 43277, - "total_column_articles": 411, + "total_acs": 35201, + "total_submitted": 43765, + "total_column_articles": 414, "frontend_question_id": "1038", "is_new_question": false }, @@ -33654,8 +33948,8 @@ "question__title": "Moving Stones Until Consecutive II", "question__title_slug": "moving-stones-until-consecutive-ii", "question__hide": false, - "total_acs": 3107, - "total_submitted": 5914, + "total_acs": 3121, + "total_submitted": 5954, "total_column_articles": 33, "frontend_question_id": "1040", "is_new_question": false @@ -33675,9 +33969,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": 65961, - "total_submitted": 96338, - "total_column_articles": 969, + "total_acs": 66256, + "total_submitted": 96772, + "total_column_articles": 970, "frontend_question_id": "1160", "is_new_question": false }, @@ -33696,8 +33990,8 @@ "question__title": "Minimum Score Triangulation of Polygon", "question__title_slug": "minimum-score-triangulation-of-polygon", "question__hide": false, - "total_acs": 5815, - "total_submitted": 10201, + "total_acs": 5840, + "total_submitted": 10249, "total_column_articles": 74, "frontend_question_id": "1039", "is_new_question": false @@ -33717,8 +34011,8 @@ "question__title": "Analyze User Website Visit Pattern", "question__title_slug": "analyze-user-website-visit-pattern", "question__hide": false, - "total_acs": 2006, - "total_submitted": 5006, + "total_acs": 2043, + "total_submitted": 5096, "total_column_articles": 46, "frontend_question_id": "1152", "is_new_question": false @@ -33738,9 +34032,9 @@ "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": 7087, - "total_submitted": 13733, - "total_column_articles": 108, + "total_acs": 7212, + "total_submitted": 13980, + "total_column_articles": 112, "frontend_question_id": "1151", "is_new_question": false }, @@ -33759,9 +34053,9 @@ "question__title": "Escape a Large Maze", "question__title_slug": "escape-a-large-maze", "question__hide": false, - "total_acs": 19220, - "total_submitted": 41065, - "total_column_articles": 209, + "total_acs": 19243, + "total_submitted": 41131, + "total_column_articles": 210, "frontend_question_id": "1036", "is_new_question": false }, @@ -33780,9 +34074,9 @@ "question__title": "Uncrossed Lines", "question__title_slug": "uncrossed-lines", "question__hide": false, - "total_acs": 52033, - "total_submitted": 77586, - "total_column_articles": 491, + "total_acs": 52908, + "total_submitted": 78685, + "total_column_articles": 495, "frontend_question_id": "1035", "is_new_question": false }, @@ -33801,8 +34095,8 @@ "question__title": "Coloring A Border", "question__title_slug": "coloring-a-border", "question__hide": false, - "total_acs": 30485, - "total_submitted": 54987, + "total_acs": 30571, + "total_submitted": 55196, "total_column_articles": 493, "frontend_question_id": "1034", "is_new_question": false @@ -33822,9 +34116,9 @@ "question__title": "Moving Stones Until Consecutive", "question__title_slug": "moving-stones-until-consecutive", "question__hide": false, - "total_acs": 12211, - "total_submitted": 30643, - "total_column_articles": 182, + "total_acs": 12259, + "total_submitted": 30767, + "total_column_articles": 183, "frontend_question_id": "1033", "is_new_question": false }, @@ -33843,8 +34137,8 @@ "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": 5981, - "total_submitted": 10027, + "total_acs": 6027, + "total_submitted": 10102, "total_column_articles": 107, "frontend_question_id": "1150", "is_new_question": false @@ -33864,9 +34158,9 @@ "question__title": "Parallel Courses", "question__title_slug": "parallel-courses", "question__hide": false, - "total_acs": 4512, - "total_submitted": 7571, - "total_column_articles": 77, + "total_acs": 4568, + "total_submitted": 7662, + "total_column_articles": 78, "frontend_question_id": "1136", "is_new_question": false }, @@ -33885,9 +34179,9 @@ "question__title": "Connecting Cities With Minimum Cost", "question__title_slug": "connecting-cities-with-minimum-cost", "question__hide": false, - "total_acs": 9614, - "total_submitted": 17032, - "total_column_articles": 125, + "total_acs": 9773, + "total_submitted": 17276, + "total_column_articles": 130, "frontend_question_id": "1135", "is_new_question": false }, @@ -33906,9 +34200,9 @@ "question__title": "Path With Maximum Minimum Value", "question__title_slug": "path-with-maximum-minimum-value", "question__hide": false, - "total_acs": 7003, - "total_submitted": 18111, - "total_column_articles": 84, + "total_acs": 7047, + "total_submitted": 18210, + "total_column_articles": 88, "frontend_question_id": "1102", "is_new_question": false }, @@ -33927,8 +34221,8 @@ "question__title": "Largest Unique Number", "question__title_slug": "largest-unique-number", "question__hide": false, - "total_acs": 3738, - "total_submitted": 5755, + "total_acs": 3766, + "total_submitted": 5804, "total_column_articles": 81, "frontend_question_id": "1133", "is_new_question": false @@ -33948,9 +34242,9 @@ "question__title": "Stream of Characters", "question__title_slug": "stream-of-characters", "question__hide": false, - "total_acs": 3541, - "total_submitted": 8223, - "total_column_articles": 61, + "total_acs": 3576, + "total_submitted": 8293, + "total_column_articles": 64, "frontend_question_id": "1032", "is_new_question": false }, @@ -33969,9 +34263,9 @@ "question__title": "Maximum Sum of Two Non-Overlapping Subarrays", "question__title_slug": "maximum-sum-of-two-non-overlapping-subarrays", "question__hide": false, - "total_acs": 7124, - "total_submitted": 12170, - "total_column_articles": 107, + "total_acs": 7214, + "total_submitted": 12336, + "total_column_articles": 108, "frontend_question_id": "1031", "is_new_question": false }, @@ -33990,8 +34284,8 @@ "question__title": "Two City Scheduling", "question__title_slug": "two-city-scheduling", "question__hide": false, - "total_acs": 20289, - "total_submitted": 30211, + "total_acs": 20420, + "total_submitted": 30409, "total_column_articles": 228, "frontend_question_id": "1029", "is_new_question": false @@ -34011,9 +34305,9 @@ "question__title": "Matrix Cells in Distance Order", "question__title_slug": "matrix-cells-in-distance-order", "question__hide": false, - "total_acs": 43691, - "total_submitted": 61635, - "total_column_articles": 477, + "total_acs": 43829, + "total_submitted": 61831, + "total_column_articles": 478, "frontend_question_id": "1030", "is_new_question": false }, @@ -34032,9 +34326,9 @@ "question__title": "Recover a Tree From Preorder Traversal", "question__title_slug": "recover-a-tree-from-preorder-traversal", "question__hide": false, - "total_acs": 22851, - "total_submitted": 31396, - "total_column_articles": 478, + "total_acs": 22944, + "total_submitted": 31515, + "total_column_articles": 481, "frontend_question_id": "1028", "is_new_question": false }, @@ -34053,9 +34347,9 @@ "question__title": "Maximum Difference Between Node and Ancestor", "question__title_slug": "maximum-difference-between-node-and-ancestor", "question__hide": false, - "total_acs": 12433, - "total_submitted": 18130, - "total_column_articles": 220, + "total_acs": 12563, + "total_submitted": 18313, + "total_column_articles": 223, "frontend_question_id": "1026", "is_new_question": false }, @@ -34074,9 +34368,9 @@ "question__title": "Maximum Average Subtree", "question__title_slug": "maximum-average-subtree", "question__hide": false, - "total_acs": 3302, - "total_submitted": 5321, - "total_column_articles": 62, + "total_acs": 3327, + "total_submitted": 5354, + "total_column_articles": 64, "frontend_question_id": "1120", "is_new_question": false }, @@ -34095,8 +34389,8 @@ "question__title": "Armstrong Number", "question__title_slug": "armstrong-number", "question__hide": false, - "total_acs": 3801, - "total_submitted": 4911, + "total_acs": 3819, + "total_submitted": 4931, "total_column_articles": 67, "frontend_question_id": "1134", "is_new_question": false @@ -34116,8 +34410,8 @@ "question__title": "Remove Vowels from a String", "question__title_slug": "remove-vowels-from-a-string", "question__hide": false, - "total_acs": 9362, - "total_submitted": 10802, + "total_acs": 9395, + "total_submitted": 10835, "total_column_articles": 167, "frontend_question_id": "1119", "is_new_question": false @@ -34137,8 +34431,8 @@ "question__title": "Number of Days in a Month", "question__title_slug": "number-of-days-in-a-month", "question__hide": false, - "total_acs": 3081, - "total_submitted": 4816, + "total_acs": 3100, + "total_submitted": 4839, "total_column_articles": 58, "frontend_question_id": "1118", "is_new_question": false @@ -34158,9 +34452,9 @@ "question__title": "Longest Arithmetic Subsequence", "question__title_slug": "longest-arithmetic-subsequence", "question__hide": false, - "total_acs": 17733, - "total_submitted": 40658, - "total_column_articles": 160, + "total_acs": 17979, + "total_submitted": 41079, + "total_column_articles": 161, "frontend_question_id": "1027", "is_new_question": false }, @@ -34179,9 +34473,9 @@ "question__title": "Divisor Game", "question__title_slug": "divisor-game", "question__hide": false, - "total_acs": 85693, - "total_submitted": 121096, - "total_column_articles": 717, + "total_acs": 86039, + "total_submitted": 121596, + "total_column_articles": 719, "frontend_question_id": "1025", "is_new_question": false }, @@ -34200,9 +34494,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": 3255, - "total_submitted": 4782, - "total_column_articles": 84, + "total_acs": 3293, + "total_submitted": 4831, + "total_column_articles": 85, "frontend_question_id": "1101", "is_new_question": false }, @@ -34221,9 +34515,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": 7228, - "total_submitted": 10301, - "total_column_articles": 144, + "total_acs": 7311, + "total_submitted": 10439, + "total_column_articles": 146, "frontend_question_id": "1100", "is_new_question": false }, @@ -34242,9 +34536,9 @@ "question__title": "Two Sum Less Than K", "question__title_slug": "two-sum-less-than-k", "question__hide": false, - "total_acs": 6942, - "total_submitted": 11652, - "total_column_articles": 124, + "total_acs": 7036, + "total_submitted": 11785, + "total_column_articles": 126, "frontend_question_id": "1099", "is_new_question": false }, @@ -34263,8 +34557,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": 4263, - "total_submitted": 5496, + "total_acs": 4283, + "total_submitted": 5517, "total_column_articles": 94, "frontend_question_id": "1085", "is_new_question": false @@ -34284,9 +34578,9 @@ "question__title": "Video Stitching", "question__title_slug": "video-stitching", "question__hide": false, - "total_acs": 38766, - "total_submitted": 71100, - "total_column_articles": 423, + "total_acs": 39027, + "total_submitted": 71692, + "total_column_articles": 427, "frontend_question_id": "1024", "is_new_question": false }, @@ -34305,9 +34599,9 @@ "question__title": "Camelcase Matching", "question__title_slug": "camelcase-matching", "question__hide": false, - "total_acs": 8863, - "total_submitted": 15620, - "total_column_articles": 198, + "total_acs": 8941, + "total_submitted": 15758, + "total_column_articles": 200, "frontend_question_id": "1023", "is_new_question": false }, @@ -34326,9 +34620,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": 50205, - "total_submitted": 66760, - "total_column_articles": 597, + "total_acs": 50432, + "total_submitted": 67049, + "total_column_articles": 598, "frontend_question_id": "1022", "is_new_question": false }, @@ -34347,9 +34641,9 @@ "question__title": "Remove Outermost Parentheses", "question__title_slug": "remove-outermost-parentheses", "question__hide": false, - "total_acs": 89538, - "total_submitted": 109931, - "total_column_articles": 1010, + "total_acs": 89845, + "total_submitted": 110300, + "total_column_articles": 1014, "frontend_question_id": "1021", "is_new_question": false }, @@ -34368,9 +34662,9 @@ "question__title": "Confusing Number II", "question__title_slug": "confusing-number-ii", "question__hide": false, - "total_acs": 1301, - "total_submitted": 2775, - "total_column_articles": 41, + "total_acs": 1311, + "total_submitted": 2793, + "total_column_articles": 42, "frontend_question_id": "1088", "is_new_question": false }, @@ -34389,8 +34683,8 @@ "question__title": "Brace Expansion", "question__title_slug": "brace-expansion", "question__hide": false, - "total_acs": 2531, - "total_submitted": 4598, + "total_acs": 2551, + "total_submitted": 4632, "total_column_articles": 70, "frontend_question_id": "1087", "is_new_question": false @@ -34410,8 +34704,8 @@ "question__title": "Index Pairs of a String", "question__title_slug": "index-pairs-of-a-string", "question__hide": false, - "total_acs": 3014, - "total_submitted": 5427, + "total_acs": 3040, + "total_submitted": 5489, "total_column_articles": 91, "frontend_question_id": "1065", "is_new_question": false @@ -34431,8 +34725,8 @@ "question__title": "High Five", "question__title_slug": "high-five", "question__hide": false, - "total_acs": 5956, - "total_submitted": 8797, + "total_acs": 5997, + "total_submitted": 8876, "total_column_articles": 102, "frontend_question_id": "1086", "is_new_question": false @@ -34452,9 +34746,9 @@ "question__title": "Number of Enclaves", "question__title_slug": "number-of-enclaves", "question__hide": false, - "total_acs": 44984, - "total_submitted": 73174, - "total_column_articles": 631, + "total_acs": 45592, + "total_submitted": 74111, + "total_column_articles": 646, "frontend_question_id": "1020", "is_new_question": false }, @@ -34473,9 +34767,9 @@ "question__title": "Next Greater Node In Linked List", "question__title_slug": "next-greater-node-in-linked-list", "question__hide": false, - "total_acs": 25605, - "total_submitted": 42270, - "total_column_articles": 364, + "total_acs": 25818, + "total_submitted": 42641, + "total_column_articles": 367, "frontend_question_id": "1019", "is_new_question": false }, @@ -34494,9 +34788,9 @@ "question__title": "Binary Prefix Divisible By 5", "question__title_slug": "binary-prefix-divisible-by-5", "question__hide": false, - "total_acs": 46719, - "total_submitted": 90998, - "total_column_articles": 410, + "total_acs": 46854, + "total_submitted": 91266, + "total_column_articles": 411, "frontend_question_id": "1018", "is_new_question": false }, @@ -34515,8 +34809,8 @@ "question__title": "Convert to Base -2", "question__title_slug": "convert-to-base-2", "question__hide": false, - "total_acs": 4265, - "total_submitted": 7558, + "total_acs": 4299, + "total_submitted": 7621, "total_column_articles": 62, "frontend_question_id": "1017", "is_new_question": false @@ -34536,8 +34830,8 @@ "question__title": "Confusing Number", "question__title_slug": "confusing-number", "question__hide": false, - "total_acs": 4198, - "total_submitted": 9825, + "total_acs": 4236, + "total_submitted": 9925, "total_column_articles": 85, "frontend_question_id": "1056", "is_new_question": false @@ -34557,8 +34851,8 @@ "question__title": "Digit Count in Range", "question__title_slug": "digit-count-in-range", "question__hide": false, - "total_acs": 1161, - "total_submitted": 2599, + "total_acs": 1182, + "total_submitted": 2652, "total_column_articles": 29, "frontend_question_id": "1067", "is_new_question": false @@ -34578,9 +34872,9 @@ "question__title": "Campus Bikes II", "question__title_slug": "campus-bikes-ii", "question__hide": false, - "total_acs": 2671, - "total_submitted": 5399, - "total_column_articles": 55, + "total_acs": 2713, + "total_submitted": 5489, + "total_column_articles": 56, "frontend_question_id": "1066", "is_new_question": false }, @@ -34599,9 +34893,9 @@ "question__title": "Fixed Point", "question__title_slug": "fixed-point", "question__hide": false, - "total_acs": 5668, - "total_submitted": 8795, - "total_column_articles": 89, + "total_acs": 5710, + "total_submitted": 8861, + "total_column_articles": 90, "frontend_question_id": "1064", "is_new_question": false }, @@ -34620,9 +34914,9 @@ "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": 6475, - "total_submitted": 11141, - "total_column_articles": 102, + "total_acs": 6523, + "total_submitted": 11223, + "total_column_articles": 103, "frontend_question_id": "1016", "is_new_question": false }, @@ -34641,8 +34935,8 @@ "question__title": "Smallest Integer Divisible by K", "question__title_slug": "smallest-integer-divisible-by-k", "question__hide": false, - "total_acs": 5950, - "total_submitted": 16302, + "total_acs": 5980, + "total_submitted": 16396, "total_column_articles": 48, "frontend_question_id": "1015", "is_new_question": false @@ -34662,9 +34956,9 @@ "question__title": "Best Sightseeing Pair", "question__title_slug": "best-sightseeing-pair", "question__hide": false, - "total_acs": 54047, - "total_submitted": 95566, - "total_column_articles": 607, + "total_acs": 54356, + "total_submitted": 96043, + "total_column_articles": 608, "frontend_question_id": "1014", "is_new_question": false }, @@ -34683,8 +34977,8 @@ "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": 53166, - "total_submitted": 136019, + "total_acs": 53402, + "total_submitted": 136665, "total_column_articles": 980, "frontend_question_id": "1013", "is_new_question": false @@ -34704,8 +34998,8 @@ "question__title": "Number of Valid Subarrays", "question__title_slug": "number-of-valid-subarrays", "question__hide": false, - "total_acs": 2478, - "total_submitted": 3419, + "total_acs": 2508, + "total_submitted": 3458, "total_column_articles": 53, "frontend_question_id": "1063", "is_new_question": false @@ -34725,9 +35019,9 @@ "question__title": "Longest Repeating Substring", "question__title_slug": "longest-repeating-substring", "question__hide": false, - "total_acs": 4929, - "total_submitted": 8830, - "total_column_articles": 68, + "total_acs": 4994, + "total_submitted": 8932, + "total_column_articles": 69, "frontend_question_id": "1062", "is_new_question": false }, @@ -34746,9 +35040,9 @@ "question__title": "Missing Element in Sorted Array", "question__title_slug": "missing-element-in-sorted-array", "question__hide": false, - "total_acs": 8543, - "total_submitted": 16006, - "total_column_articles": 127, + "total_acs": 8683, + "total_submitted": 16271, + "total_column_articles": 128, "frontend_question_id": "1060", "is_new_question": false }, @@ -34767,9 +35061,9 @@ "question__title": "Lexicographically Smallest Equivalent String", "question__title_slug": "lexicographically-smallest-equivalent-string", "question__hide": false, - "total_acs": 3489, - "total_submitted": 5646, - "total_column_articles": 80, + "total_acs": 3519, + "total_submitted": 5684, + "total_column_articles": 81, "frontend_question_id": "1061", "is_new_question": false }, @@ -34788,8 +35082,8 @@ "question__title": "Numbers With Repeated Digits", "question__title_slug": "numbers-with-repeated-digits", "question__hide": false, - "total_acs": 4086, - "total_submitted": 11161, + "total_acs": 4121, + "total_submitted": 11237, "total_column_articles": 79, "frontend_question_id": "1012", "is_new_question": false @@ -34809,9 +35103,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": 78071, - "total_submitted": 125880, - "total_column_articles": 739, + "total_acs": 78885, + "total_submitted": 127243, + "total_column_articles": 742, "frontend_question_id": "1011", "is_new_question": false }, @@ -34830,9 +35124,9 @@ "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": 20887, - "total_submitted": 45453, - "total_column_articles": 273, + "total_acs": 21005, + "total_submitted": 45661, + "total_column_articles": 275, "frontend_question_id": "1010", "is_new_question": false }, @@ -34851,9 +35145,9 @@ "question__title": "Complement of Base 10 Integer", "question__title_slug": "complement-of-base-10-integer", "question__hide": false, - "total_acs": 19132, - "total_submitted": 32404, - "total_column_articles": 278, + "total_acs": 19267, + "total_submitted": 32627, + "total_column_articles": 282, "frontend_question_id": "1009", "is_new_question": false }, @@ -34872,9 +35166,9 @@ "question__title": "Minimize Rounding Error to Meet Target", "question__title_slug": "minimize-rounding-error-to-meet-target", "question__hide": false, - "total_acs": 1612, - "total_submitted": 4551, - "total_column_articles": 44, + "total_acs": 1618, + "total_submitted": 4569, + "total_column_articles": 45, "frontend_question_id": "1058", "is_new_question": false }, @@ -34893,8 +35187,8 @@ "question__title": "Campus Bikes", "question__title_slug": "campus-bikes", "question__hide": false, - "total_acs": 3698, - "total_submitted": 7520, + "total_acs": 3724, + "total_submitted": 7564, "total_column_articles": 48, "frontend_question_id": "1057", "is_new_question": false @@ -34914,8 +35208,8 @@ "question__title": "Shortest Way to Form String", "question__title_slug": "shortest-way-to-form-string", "question__hide": false, - "total_acs": 7110, - "total_submitted": 11762, + "total_acs": 7201, + "total_submitted": 11911, "total_column_articles": 125, "frontend_question_id": "1055", "is_new_question": false @@ -34935,9 +35229,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": 23119, - "total_submitted": 32040, - "total_column_articles": 304, + "total_acs": 23370, + "total_submitted": 32380, + "total_column_articles": 306, "frontend_question_id": "1008", "is_new_question": false }, @@ -34956,8 +35250,8 @@ "question__title": "Minimum Domino Rotations For Equal Row", "question__title_slug": "minimum-domino-rotations-for-equal-row", "question__hide": false, - "total_acs": 7609, - "total_submitted": 16113, + "total_acs": 7658, + "total_submitted": 16218, "total_column_articles": 104, "frontend_question_id": "1007", "is_new_question": false @@ -34977,9 +35271,9 @@ "question__title": "Clumsy Factorial", "question__title_slug": "clumsy-factorial", "question__hide": false, - "total_acs": 45998, - "total_submitted": 73368, - "total_column_articles": 627, + "total_acs": 46064, + "total_submitted": 73470, + "total_column_articles": 628, "frontend_question_id": "1006", "is_new_question": false }, @@ -34998,9 +35292,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": 87397, - "total_submitted": 169498, - "total_column_articles": 1193, + "total_acs": 88656, + "total_submitted": 171937, + "total_column_articles": 1204, "frontend_question_id": "1005", "is_new_question": false }, @@ -35019,9 +35313,9 @@ "question__title": "Max Consecutive Ones III", "question__title_slug": "max-consecutive-ones-iii", "question__hide": false, - "total_acs": 92421, - "total_submitted": 153981, - "total_column_articles": 897, + "total_acs": 93731, + "total_submitted": 156133, + "total_column_articles": 901, "frontend_question_id": "1004", "is_new_question": false }, @@ -35040,9 +35334,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": 14058, - "total_submitted": 24157, - "total_column_articles": 217, + "total_acs": 14126, + "total_submitted": 24281, + "total_column_articles": 219, "frontend_question_id": "1003", "is_new_question": false }, @@ -35061,9 +35355,9 @@ "question__title": "Find Common Characters", "question__title_slug": "find-common-characters", "question__hide": false, - "total_acs": 67907, - "total_submitted": 94266, - "total_column_articles": 695, + "total_acs": 68408, + "total_submitted": 95103, + "total_column_articles": 697, "frontend_question_id": "1002", "is_new_question": false }, @@ -35082,8 +35376,8 @@ "question__title": "Grid Illumination", "question__title_slug": "grid-illumination", "question__hide": false, - "total_acs": 18534, - "total_submitted": 41157, + "total_acs": 18590, + "total_submitted": 41279, "total_column_articles": 268, "frontend_question_id": "1001", "is_new_question": false @@ -35103,9 +35397,9 @@ "question__title": "Minimum Cost to Merge Stones", "question__title_slug": "minimum-cost-to-merge-stones", "question__hide": false, - "total_acs": 4958, - "total_submitted": 11374, - "total_column_articles": 54, + "total_acs": 5013, + "total_submitted": 11495, + "total_column_articles": 55, "frontend_question_id": "1000", "is_new_question": false }, @@ -35124,9 +35418,9 @@ "question__title": "Available Captures for Rook", "question__title_slug": "available-captures-for-rook", "question__hide": false, - "total_acs": 32518, - "total_submitted": 47037, - "total_column_articles": 597, + "total_acs": 32629, + "total_submitted": 47193, + "total_column_articles": 599, "frontend_question_id": "999", "is_new_question": false }, @@ -35145,9 +35439,9 @@ "question__title": "Maximum Binary Tree II", "question__title_slug": "maximum-binary-tree-ii", "question__hide": false, - "total_acs": 9038, - "total_submitted": 14520, - "total_column_articles": 143, + "total_acs": 9117, + "total_submitted": 14634, + "total_column_articles": 144, "frontend_question_id": "998", "is_new_question": false }, @@ -35166,9 +35460,9 @@ "question__title": "Find the Town Judge", "question__title_slug": "find-the-town-judge", "question__hide": false, - "total_acs": 73842, - "total_submitted": 139644, - "total_column_articles": 765, + "total_acs": 74350, + "total_submitted": 140713, + "total_column_articles": 770, "frontend_question_id": "997", "is_new_question": false }, @@ -35187,9 +35481,9 @@ "question__title": "Number of Squareful Arrays", "question__title_slug": "number-of-squareful-arrays", "question__hide": false, - "total_acs": 5456, - "total_submitted": 11105, - "total_column_articles": 107, + "total_acs": 5535, + "total_submitted": 11223, + "total_column_articles": 111, "frontend_question_id": "996", "is_new_question": false }, @@ -35208,8 +35502,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": 23654, - "total_submitted": 44142, + "total_acs": 23741, + "total_submitted": 44302, "total_column_articles": 266, "frontend_question_id": "995", "is_new_question": false @@ -35229,9 +35523,9 @@ "question__title": "Rotting Oranges", "question__title_slug": "rotting-oranges", "question__hide": false, - "total_acs": 84755, - "total_submitted": 166174, - "total_column_articles": 1805, + "total_acs": 85676, + "total_submitted": 168039, + "total_column_articles": 1819, "frontend_question_id": "994", "is_new_question": false }, @@ -35250,9 +35544,9 @@ "question__title": "Cousins in Binary Tree", "question__title_slug": "cousins-in-binary-tree", "question__hide": false, - "total_acs": 57932, - "total_submitted": 104102, - "total_column_articles": 910, + "total_acs": 58198, + "total_submitted": 104625, + "total_column_articles": 917, "frontend_question_id": "993", "is_new_question": false }, @@ -35271,8 +35565,8 @@ "question__title": "Subarrays with K Different Integers", "question__title_slug": "subarrays-with-k-different-integers", "question__hide": false, - "total_acs": 27327, - "total_submitted": 58677, + "total_acs": 27503, + "total_submitted": 58963, "total_column_articles": 308, "frontend_question_id": "992", "is_new_question": false @@ -35292,8 +35586,8 @@ "question__title": "Broken Calculator", "question__title_slug": "broken-calculator", "question__hide": false, - "total_acs": 10411, - "total_submitted": 19934, + "total_acs": 10491, + "total_submitted": 20077, "total_column_articles": 127, "frontend_question_id": "991", "is_new_question": false @@ -35313,9 +35607,9 @@ "question__title": "Satisfiability of Equality Equations", "question__title_slug": "satisfiability-of-equality-equations", "question__hide": false, - "total_acs": 42660, - "total_submitted": 81805, - "total_column_articles": 667, + "total_acs": 43070, + "total_submitted": 82476, + "total_column_articles": 685, "frontend_question_id": "990", "is_new_question": false }, @@ -35334,8 +35628,8 @@ "question__title": "Add to Array-Form of Integer", "question__title_slug": "add-to-array-form-of-integer", "question__hide": false, - "total_acs": 61768, - "total_submitted": 131613, + "total_acs": 62055, + "total_submitted": 132264, "total_column_articles": 692, "frontend_question_id": "989", "is_new_question": false @@ -35355,8 +35649,8 @@ "question__title": "Smallest String Starting From Leaf", "question__title_slug": "smallest-string-starting-from-leaf", "question__hide": false, - "total_acs": 12260, - "total_submitted": 24250, + "total_acs": 12434, + "total_submitted": 24573, "total_column_articles": 151, "frontend_question_id": "988", "is_new_question": false @@ -35376,9 +35670,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": 27263, - "total_submitted": 51055, - "total_column_articles": 457, + "total_acs": 27445, + "total_submitted": 51378, + "total_column_articles": 458, "frontend_question_id": "987", "is_new_question": false }, @@ -35397,9 +35691,9 @@ "question__title": "Interval List Intersections", "question__title_slug": "interval-list-intersections", "question__hide": false, - "total_acs": 46711, - "total_submitted": 68260, - "total_column_articles": 452, + "total_acs": 47452, + "total_submitted": 69288, + "total_column_articles": 458, "frontend_question_id": "986", "is_new_question": false }, @@ -35418,9 +35712,9 @@ "question__title": "Sum of Even Numbers After Queries", "question__title_slug": "sum-of-even-numbers-after-queries", "question__hide": false, - "total_acs": 17654, - "total_submitted": 29180, - "total_column_articles": 204, + "total_acs": 17712, + "total_submitted": 29261, + "total_column_articles": 205, "frontend_question_id": "985", "is_new_question": false }, @@ -35439,9 +35733,9 @@ "question__title": "String Without AAA or BBB", "question__title_slug": "string-without-aaa-or-bbb", "question__hide": false, - "total_acs": 10796, - "total_submitted": 25378, - "total_column_articles": 179, + "total_acs": 10875, + "total_submitted": 25569, + "total_column_articles": 180, "frontend_question_id": "984", "is_new_question": false }, @@ -35460,9 +35754,9 @@ "question__title": "Minimum Cost For Tickets", "question__title_slug": "minimum-cost-for-tickets", "question__hide": false, - "total_acs": 37121, - "total_submitted": 58558, - "total_column_articles": 493, + "total_acs": 37304, + "total_submitted": 58821, + "total_column_articles": 494, "frontend_question_id": "983", "is_new_question": false }, @@ -35481,8 +35775,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": 3176, - "total_submitted": 5653, + "total_acs": 3204, + "total_submitted": 5692, "total_column_articles": 40, "frontend_question_id": "982", "is_new_question": false @@ -35502,9 +35796,9 @@ "question__title": "Time Based Key-Value Store", "question__title_slug": "time-based-key-value-store", "question__hide": false, - "total_acs": 24591, - "total_submitted": 46293, - "total_column_articles": 348, + "total_acs": 24782, + "total_submitted": 46695, + "total_column_articles": 350, "frontend_question_id": "981", "is_new_question": false }, @@ -35523,9 +35817,9 @@ "question__title": "Unique Paths III", "question__title_slug": "unique-paths-iii", "question__hide": false, - "total_acs": 17364, - "total_submitted": 23567, - "total_column_articles": 257, + "total_acs": 17495, + "total_submitted": 23764, + "total_column_articles": 260, "frontend_question_id": "980", "is_new_question": false }, @@ -35544,9 +35838,9 @@ "question__title": "Distribute Coins in Binary Tree", "question__title_slug": "distribute-coins-in-binary-tree", "question__hide": false, - "total_acs": 10688, - "total_submitted": 14848, - "total_column_articles": 164, + "total_acs": 10783, + "total_submitted": 14967, + "total_column_articles": 166, "frontend_question_id": "979", "is_new_question": false }, @@ -35565,9 +35859,9 @@ "question__title": "Longest Turbulent Subarray", "question__title_slug": "longest-turbulent-subarray", "question__hide": false, - "total_acs": 47457, - "total_submitted": 99919, - "total_column_articles": 645, + "total_acs": 47651, + "total_submitted": 100329, + "total_column_articles": 646, "frontend_question_id": "978", "is_new_question": false }, @@ -35586,9 +35880,9 @@ "question__title": "Squares of a Sorted Array", "question__title_slug": "squares-of-a-sorted-array", "question__hide": false, - "total_acs": 349815, - "total_submitted": 507235, - "total_column_articles": 2357, + "total_acs": 356194, + "total_submitted": 516535, + "total_column_articles": 2401, "frontend_question_id": "977", "is_new_question": false }, @@ -35607,9 +35901,9 @@ "question__title": "Largest Perimeter Triangle", "question__title_slug": "largest-perimeter-triangle", "question__hide": false, - "total_acs": 68458, - "total_submitted": 116811, - "total_column_articles": 682, + "total_acs": 69066, + "total_submitted": 117983, + "total_column_articles": 686, "frontend_question_id": "976", "is_new_question": false }, @@ -35628,9 +35922,9 @@ "question__title": "Odd Even Jump", "question__title_slug": "odd-even-jump", "question__hide": false, - "total_acs": 4104, - "total_submitted": 8909, - "total_column_articles": 65, + "total_acs": 4139, + "total_submitted": 9013, + "total_column_articles": 67, "frontend_question_id": "975", "is_new_question": false }, @@ -35649,9 +35943,9 @@ "question__title": "Subarray Sums Divisible by K", "question__title_slug": "subarray-sums-divisible-by-k", "question__hide": false, - "total_acs": 47257, - "total_submitted": 99939, - "total_column_articles": 461, + "total_acs": 47761, + "total_submitted": 100905, + "total_column_articles": 464, "frontend_question_id": "974", "is_new_question": false }, @@ -35670,9 +35964,9 @@ "question__title": "K Closest Points to Origin", "question__title_slug": "k-closest-points-to-origin", "question__hide": false, - "total_acs": 81791, - "total_submitted": 126235, - "total_column_articles": 728, + "total_acs": 82396, + "total_submitted": 127108, + "total_column_articles": 730, "frontend_question_id": "973", "is_new_question": false }, @@ -35691,9 +35985,9 @@ "question__title": "Fibonacci Number", "question__title_slug": "fibonacci-number", "question__hide": false, - "total_acs": 402306, - "total_submitted": 603686, - "total_column_articles": 2498, + "total_acs": 407764, + "total_submitted": 611916, + "total_column_articles": 2509, "frontend_question_id": "509", "is_new_question": false }, @@ -35712,8 +36006,8 @@ "question__title": "Equal Rational Numbers", "question__title_slug": "equal-rational-numbers", "question__hide": false, - "total_acs": 1655, - "total_submitted": 4095, + "total_acs": 1665, + "total_submitted": 4124, "total_column_articles": 39, "frontend_question_id": "972", "is_new_question": false @@ -35733,8 +36027,8 @@ "question__title": "Flip Binary Tree To Match Preorder Traversal", "question__title_slug": "flip-binary-tree-to-match-preorder-traversal", "question__hide": false, - "total_acs": 8513, - "total_submitted": 19045, + "total_acs": 8626, + "total_submitted": 19285, "total_column_articles": 136, "frontend_question_id": "971", "is_new_question": false @@ -35754,8 +36048,8 @@ "question__title": "Powerful Integers", "question__title_slug": "powerful-integers", "question__hide": false, - "total_acs": 12331, - "total_submitted": 29938, + "total_acs": 12375, + "total_submitted": 30059, "total_column_articles": 141, "frontend_question_id": "970", "is_new_question": false @@ -35775,9 +36069,9 @@ "question__title": "Pancake Sorting", "question__title_slug": "pancake-sorting", "question__hide": false, - "total_acs": 42210, - "total_submitted": 62154, - "total_column_articles": 615, + "total_acs": 42461, + "total_submitted": 62555, + "total_column_articles": 617, "frontend_question_id": "969", "is_new_question": false }, @@ -35796,9 +36090,9 @@ "question__title": "Binary Tree Cameras", "question__title_slug": "binary-tree-cameras", "question__hide": false, - "total_acs": 39467, - "total_submitted": 76679, - "total_column_articles": 453, + "total_acs": 40205, + "total_submitted": 77970, + "total_column_articles": 459, "frontend_question_id": "968", "is_new_question": false }, @@ -35817,9 +36111,9 @@ "question__title": "Numbers With Same Consecutive Differences", "question__title_slug": "numbers-with-same-consecutive-differences", "question__hide": false, - "total_acs": 9769, - "total_submitted": 20077, - "total_column_articles": 187, + "total_acs": 9859, + "total_submitted": 20211, + "total_column_articles": 190, "frontend_question_id": "967", "is_new_question": false }, @@ -35838,9 +36132,9 @@ "question__title": "Vowel Spellchecker", "question__title_slug": "vowel-spellchecker", "question__hide": false, - "total_acs": 3695, - "total_submitted": 8900, - "total_column_articles": 59, + "total_acs": 3722, + "total_submitted": 8979, + "total_column_articles": 60, "frontend_question_id": "966", "is_new_question": false }, @@ -35859,9 +36153,9 @@ "question__title": "Univalued Binary Tree", "question__title_slug": "univalued-binary-tree", "question__hide": false, - "total_acs": 69821, - "total_submitted": 96613, - "total_column_articles": 783, + "total_acs": 70202, + "total_submitted": 97221, + "total_column_articles": 784, "frontend_question_id": "965", "is_new_question": false }, @@ -35880,8 +36174,8 @@ "question__title": "Least Operators to Express Number", "question__title_slug": "least-operators-to-express-number", "question__hide": false, - "total_acs": 1795, - "total_submitted": 4024, + "total_acs": 1803, + "total_submitted": 4040, "total_column_articles": 32, "frontend_question_id": "964", "is_new_question": false @@ -35901,8 +36195,8 @@ "question__title": "Minimum Area Rectangle II", "question__title_slug": "minimum-area-rectangle-ii", "question__hide": false, - "total_acs": 3064, - "total_submitted": 6007, + "total_acs": 3088, + "total_submitted": 6058, "total_column_articles": 38, "frontend_question_id": "963", "is_new_question": false @@ -35922,8 +36216,8 @@ "question__title": "Maximum Width Ramp", "question__title_slug": "maximum-width-ramp", "question__hide": false, - "total_acs": 17906, - "total_submitted": 39368, + "total_acs": 18163, + "total_submitted": 39964, "total_column_articles": 177, "frontend_question_id": "962", "is_new_question": false @@ -35943,9 +36237,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": 73072, - "total_submitted": 103781, - "total_column_articles": 662, + "total_acs": 73320, + "total_submitted": 104156, + "total_column_articles": 664, "frontend_question_id": "961", "is_new_question": false }, @@ -35964,8 +36258,8 @@ "question__title": "Delete Columns to Make Sorted III", "question__title_slug": "delete-columns-to-make-sorted-iii", "question__hide": false, - "total_acs": 2669, - "total_submitted": 4628, + "total_acs": 2694, + "total_submitted": 4678, "total_column_articles": 46, "frontend_question_id": "960", "is_new_question": false @@ -35985,9 +36279,9 @@ "question__title": "Regions Cut By Slashes", "question__title_slug": "regions-cut-by-slashes", "question__hide": false, - "total_acs": 21279, - "total_submitted": 28657, - "total_column_articles": 326, + "total_acs": 21335, + "total_submitted": 28748, + "total_column_articles": 328, "frontend_question_id": "959", "is_new_question": false }, @@ -36006,9 +36300,9 @@ "question__title": "Check Completeness of a Binary Tree", "question__title_slug": "check-completeness-of-a-binary-tree", "question__hide": false, - "total_acs": 37712, - "total_submitted": 69357, - "total_column_articles": 365, + "total_acs": 38266, + "total_submitted": 70385, + "total_column_articles": 368, "frontend_question_id": "958", "is_new_question": false }, @@ -36027,9 +36321,9 @@ "question__title": "Prison Cells After N Days", "question__title_slug": "prison-cells-after-n-days", "question__hide": false, - "total_acs": 16606, - "total_submitted": 45325, - "total_column_articles": 160, + "total_acs": 16770, + "total_submitted": 45721, + "total_column_articles": 163, "frontend_question_id": "957", "is_new_question": false }, @@ -36048,8 +36342,8 @@ "question__title": "Tallest Billboard", "question__title_slug": "tallest-billboard", "question__hide": false, - "total_acs": 5023, - "total_submitted": 11255, + "total_acs": 5084, + "total_submitted": 11402, "total_column_articles": 63, "frontend_question_id": "956", "is_new_question": false @@ -36069,9 +36363,9 @@ "question__title": "Delete Columns to Make Sorted II", "question__title_slug": "delete-columns-to-make-sorted-ii", "question__hide": false, - "total_acs": 4275, - "total_submitted": 12467, - "total_column_articles": 75, + "total_acs": 4339, + "total_submitted": 12627, + "total_column_articles": 76, "frontend_question_id": "955", "is_new_question": false }, @@ -36090,9 +36384,9 @@ "question__title": "Array of Doubled Pairs", "question__title_slug": "array-of-doubled-pairs", "question__hide": false, - "total_acs": 40335, - "total_submitted": 103665, - "total_column_articles": 453, + "total_acs": 40408, + "total_submitted": 103866, + "total_column_articles": 452, "frontend_question_id": "954", "is_new_question": false }, @@ -36111,9 +36405,9 @@ "question__title": "Verifying an Alien Dictionary", "question__title_slug": "verifying-an-alien-dictionary", "question__hide": false, - "total_acs": 47755, - "total_submitted": 82614, - "total_column_articles": 615, + "total_acs": 48051, + "total_submitted": 83137, + "total_column_articles": 617, "frontend_question_id": "953", "is_new_question": false }, @@ -36132,8 +36426,8 @@ "question__title": "Largest Component Size by Common Factor", "question__title_slug": "largest-component-size-by-common-factor", "question__hide": false, - "total_acs": 3964, - "total_submitted": 10626, + "total_acs": 3993, + "total_submitted": 10687, "total_column_articles": 72, "frontend_question_id": "952", "is_new_question": false @@ -36153,9 +36447,9 @@ "question__title": "Flip Equivalent Binary Trees", "question__title_slug": "flip-equivalent-binary-trees", "question__hide": false, - "total_acs": 14003, - "total_submitted": 21061, - "total_column_articles": 204, + "total_acs": 14163, + "total_submitted": 21288, + "total_column_articles": 205, "frontend_question_id": "951", "is_new_question": false }, @@ -36174,8 +36468,8 @@ "question__title": "Reveal Cards In Increasing Order", "question__title_slug": "reveal-cards-in-increasing-order", "question__hide": false, - "total_acs": 11899, - "total_submitted": 15185, + "total_acs": 12015, + "total_submitted": 15328, "total_column_articles": 189, "frontend_question_id": "950", "is_new_question": false @@ -36195,9 +36489,9 @@ "question__title": "Largest Time for Given Digits", "question__title_slug": "largest-time-for-given-digits", "question__hide": false, - "total_acs": 9872, - "total_submitted": 26316, - "total_column_articles": 152, + "total_acs": 9955, + "total_submitted": 26521, + "total_column_articles": 154, "frontend_question_id": "949", "is_new_question": false }, @@ -36216,9 +36510,9 @@ "question__title": "Bag of Tokens", "question__title_slug": "bag-of-tokens", "question__hide": false, - "total_acs": 8103, - "total_submitted": 20383, - "total_column_articles": 118, + "total_acs": 8163, + "total_submitted": 20530, + "total_column_articles": 119, "frontend_question_id": "948", "is_new_question": false }, @@ -36237,9 +36531,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": 28837, - "total_submitted": 47187, - "total_column_articles": 373, + "total_acs": 28977, + "total_submitted": 47428, + "total_column_articles": 375, "frontend_question_id": "947", "is_new_question": false }, @@ -36258,9 +36552,9 @@ "question__title": "Validate Stack Sequences", "question__title_slug": "validate-stack-sequences", "question__hide": false, - "total_acs": 37666, - "total_submitted": 59065, - "total_column_articles": 406, + "total_acs": 38253, + "total_submitted": 59885, + "total_column_articles": 407, "frontend_question_id": "946", "is_new_question": false }, @@ -36279,8 +36573,8 @@ "question__title": "Minimum Increment to Make Array Unique", "question__title_slug": "minimum-increment-to-make-array-unique", "question__hide": false, - "total_acs": 38874, - "total_submitted": 80476, + "total_acs": 38981, + "total_submitted": 80699, "total_column_articles": 570, "frontend_question_id": "945", "is_new_question": false @@ -36300,9 +36594,9 @@ "question__title": "Delete Columns to Make Sorted", "question__title_slug": "delete-columns-to-make-sorted", "question__hide": false, - "total_acs": 53085, - "total_submitted": 76623, - "total_column_articles": 466, + "total_acs": 53188, + "total_submitted": 76758, + "total_column_articles": 465, "frontend_question_id": "944", "is_new_question": false }, @@ -36321,8 +36615,8 @@ "question__title": "Find the Shortest Superstring", "question__title_slug": "find-the-shortest-superstring", "question__hide": false, - "total_acs": 2551, - "total_submitted": 5520, + "total_acs": 2562, + "total_submitted": 5554, "total_column_articles": 58, "frontend_question_id": "943", "is_new_question": false @@ -36342,9 +36636,9 @@ "question__title": "DI String Match", "question__title_slug": "di-string-match", "question__hide": false, - "total_acs": 59755, - "total_submitted": 77198, - "total_column_articles": 705, + "total_acs": 59937, + "total_submitted": 77429, + "total_column_articles": 708, "frontend_question_id": "942", "is_new_question": false }, @@ -36363,9 +36657,9 @@ "question__title": "Valid Mountain Array", "question__title_slug": "valid-mountain-array", "question__hide": false, - "total_acs": 68801, - "total_submitted": 174585, - "total_column_articles": 685, + "total_acs": 69361, + "total_submitted": 175955, + "total_column_articles": 691, "frontend_question_id": "941", "is_new_question": false }, @@ -36384,8 +36678,8 @@ "question__title": "Distinct Subsequences II", "question__title_slug": "distinct-subsequences-ii", "question__hide": false, - "total_acs": 7066, - "total_submitted": 16254, + "total_acs": 7146, + "total_submitted": 16437, "total_column_articles": 82, "frontend_question_id": "940", "is_new_question": false @@ -36405,9 +36699,9 @@ "question__title": "Minimum Area Rectangle", "question__title_slug": "minimum-area-rectangle", "question__hide": false, - "total_acs": 7154, - "total_submitted": 15184, - "total_column_articles": 80, + "total_acs": 7214, + "total_submitted": 15304, + "total_column_articles": 81, "frontend_question_id": "939", "is_new_question": false }, @@ -36426,9 +36720,9 @@ "question__title": "Range Sum of BST", "question__title_slug": "range-sum-of-bst", "question__hide": false, - "total_acs": 109576, - "total_submitted": 133462, - "total_column_articles": 914, + "total_acs": 110099, + "total_submitted": 134107, + "total_column_articles": 925, "frontend_question_id": "938", "is_new_question": false }, @@ -36447,9 +36741,9 @@ "question__title": "Reorder Data in Log Files", "question__title_slug": "reorder-data-in-log-files", "question__hide": false, - "total_acs": 38789, - "total_submitted": 60773, - "total_column_articles": 457, + "total_acs": 38974, + "total_submitted": 61062, + "total_column_articles": 456, "frontend_question_id": "937", "is_new_question": false }, @@ -36468,8 +36762,8 @@ "question__title": "Stamping The Sequence", "question__title_slug": "stamping-the-sequence", "question__hide": false, - "total_acs": 2035, - "total_submitted": 5054, + "total_acs": 2044, + "total_submitted": 5089, "total_column_articles": 33, "frontend_question_id": "936", "is_new_question": false @@ -36489,9 +36783,9 @@ "question__title": "Knight Dialer", "question__title_slug": "knight-dialer", "question__hide": false, - "total_acs": 7781, - "total_submitted": 15817, - "total_column_articles": 108, + "total_acs": 7859, + "total_submitted": 15951, + "total_column_articles": 109, "frontend_question_id": "935", "is_new_question": false }, @@ -36510,9 +36804,9 @@ "question__title": "Shortest Bridge", "question__title_slug": "shortest-bridge", "question__hide": false, - "total_acs": 33998, - "total_submitted": 70958, - "total_column_articles": 401, + "total_acs": 34510, + "total_submitted": 71981, + "total_column_articles": 404, "frontend_question_id": "934", "is_new_question": false }, @@ -36531,9 +36825,9 @@ "question__title": "Number of Recent Calls", "question__title_slug": "number-of-recent-calls", "question__hide": false, - "total_acs": 82528, - "total_submitted": 107048, - "total_column_articles": 732, + "total_acs": 83105, + "total_submitted": 107839, + "total_column_articles": 736, "frontend_question_id": "933", "is_new_question": false }, @@ -36552,9 +36846,9 @@ "question__title": "Beautiful Array", "question__title_slug": "beautiful-array", "question__hide": false, - "total_acs": 10842, - "total_submitted": 16758, - "total_column_articles": 106, + "total_acs": 10927, + "total_submitted": 16889, + "total_column_articles": 109, "frontend_question_id": "932", "is_new_question": false }, @@ -36573,9 +36867,9 @@ "question__title": "Minimum Falling Path Sum", "question__title_slug": "minimum-falling-path-sum", "question__hide": false, - "total_acs": 40520, - "total_submitted": 60385, - "total_column_articles": 572, + "total_acs": 41239, + "total_submitted": 61425, + "total_column_articles": 579, "frontend_question_id": "931", "is_new_question": false }, @@ -36594,9 +36888,9 @@ "question__title": "Binary Subarrays With Sum", "question__title_slug": "binary-subarrays-with-sum", "question__hide": false, - "total_acs": 38752, - "total_submitted": 70840, - "total_column_articles": 380, + "total_acs": 38945, + "total_submitted": 71191, + "total_column_articles": 381, "frontend_question_id": "930", "is_new_question": false }, @@ -36615,9 +36909,9 @@ "question__title": "Unique Email Addresses", "question__title_slug": "unique-email-addresses", "question__hide": false, - "total_acs": 50844, - "total_submitted": 73938, - "total_column_articles": 486, + "total_acs": 51211, + "total_submitted": 74440, + "total_column_articles": 489, "frontend_question_id": "929", "is_new_question": false }, @@ -36636,9 +36930,9 @@ "question__title": "Minimize Malware Spread II", "question__title_slug": "minimize-malware-spread-ii", "question__hide": false, - "total_acs": 2876, - "total_submitted": 6680, - "total_column_articles": 61, + "total_acs": 2907, + "total_submitted": 6757, + "total_column_articles": 63, "frontend_question_id": "928", "is_new_question": false }, @@ -36657,9 +36951,9 @@ "question__title": "Three Equal Parts", "question__title_slug": "three-equal-parts", "question__hide": false, - "total_acs": 4110, - "total_submitted": 11850, - "total_column_articles": 86, + "total_acs": 4136, + "total_submitted": 11911, + "total_column_articles": 87, "frontend_question_id": "927", "is_new_question": false }, @@ -36678,9 +36972,9 @@ "question__title": "Flip String to Monotone Increasing", "question__title_slug": "flip-string-to-monotone-increasing", "question__hide": false, - "total_acs": 31314, - "total_submitted": 49366, - "total_column_articles": 458, + "total_acs": 31853, + "total_submitted": 50231, + "total_column_articles": 462, "frontend_question_id": "926", "is_new_question": false }, @@ -36699,9 +36993,9 @@ "question__title": "Long Pressed Name", "question__title_slug": "long-pressed-name", "question__hide": false, - "total_acs": 55625, - "total_submitted": 145288, - "total_column_articles": 743, + "total_acs": 56022, + "total_submitted": 146435, + "total_column_articles": 748, "frontend_question_id": "925", "is_new_question": false }, @@ -36720,9 +37014,9 @@ "question__title": "Minimize Malware Spread", "question__title_slug": "minimize-malware-spread", "question__hide": false, - "total_acs": 8134, - "total_submitted": 22734, - "total_column_articles": 118, + "total_acs": 8233, + "total_submitted": 22971, + "total_column_articles": 122, "frontend_question_id": "924", "is_new_question": false }, @@ -36741,8 +37035,8 @@ "question__title": "3Sum With Multiplicity", "question__title_slug": "3sum-with-multiplicity", "question__hide": false, - "total_acs": 7863, - "total_submitted": 22103, + "total_acs": 7926, + "total_submitted": 22244, "total_column_articles": 94, "frontend_question_id": "923", "is_new_question": false @@ -36762,9 +37056,9 @@ "question__title": "Sort Array By Parity II", "question__title_slug": "sort-array-by-parity-ii", "question__hide": false, - "total_acs": 98976, - "total_submitted": 138763, - "total_column_articles": 940, + "total_acs": 99537, + "total_submitted": 139531, + "total_column_articles": 944, "frontend_question_id": "922", "is_new_question": false }, @@ -36783,9 +37077,9 @@ "question__title": "Minimum Add to Make Parentheses Valid", "question__title_slug": "minimum-add-to-make-parentheses-valid", "question__hide": false, - "total_acs": 31106, - "total_submitted": 41604, - "total_column_articles": 423, + "total_acs": 31507, + "total_submitted": 42163, + "total_column_articles": 426, "frontend_question_id": "921", "is_new_question": false }, @@ -36804,9 +37098,9 @@ "question__title": "Number of Music Playlists", "question__title_slug": "number-of-music-playlists", "question__hide": false, - "total_acs": 2373, - "total_submitted": 4749, - "total_column_articles": 30, + "total_acs": 2398, + "total_submitted": 4802, + "total_column_articles": 31, "frontend_question_id": "920", "is_new_question": false }, @@ -36825,9 +37119,9 @@ "question__title": "Complete Binary Tree Inserter", "question__title_slug": "complete-binary-tree-inserter", "question__hide": false, - "total_acs": 8211, - "total_submitted": 12466, - "total_column_articles": 141, + "total_acs": 8348, + "total_submitted": 12667, + "total_column_articles": 142, "frontend_question_id": "919", "is_new_question": false }, @@ -36846,9 +37140,9 @@ "question__title": "Maximum Sum Circular Subarray", "question__title_slug": "maximum-sum-circular-subarray", "question__hide": false, - "total_acs": 41852, - "total_submitted": 112779, - "total_column_articles": 398, + "total_acs": 42357, + "total_submitted": 113957, + "total_column_articles": 401, "frontend_question_id": "918", "is_new_question": false }, @@ -36867,9 +37161,9 @@ "question__title": "Reverse Only Letters", "question__title_slug": "reverse-only-letters", "question__hide": false, - "total_acs": 68999, - "total_submitted": 114829, - "total_column_articles": 958, + "total_acs": 69304, + "total_submitted": 115394, + "total_column_articles": 960, "frontend_question_id": "917", "is_new_question": false }, @@ -36888,9 +37182,9 @@ "question__title": "Word Subsets", "question__title_slug": "word-subsets", "question__hide": false, - "total_acs": 7600, - "total_submitted": 16828, - "total_column_articles": 97, + "total_acs": 7674, + "total_submitted": 16945, + "total_column_articles": 100, "frontend_question_id": "916", "is_new_question": false }, @@ -36909,8 +37203,8 @@ "question__title": "Partition Array into Disjoint Intervals", "question__title_slug": "partition-array-into-disjoint-intervals", "question__hide": false, - "total_acs": 11850, - "total_submitted": 25155, + "total_acs": 11954, + "total_submitted": 25381, "total_column_articles": 141, "frontend_question_id": "915", "is_new_question": false @@ -36930,9 +37224,9 @@ "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": 53829, - "total_submitted": 140036, - "total_column_articles": 680, + "total_acs": 53982, + "total_submitted": 140571, + "total_column_articles": 686, "frontend_question_id": "914", "is_new_question": false }, @@ -36951,8 +37245,8 @@ "question__title": "Cat and Mouse", "question__title_slug": "cat-and-mouse", "question__hide": false, - "total_acs": 17237, - "total_submitted": 30275, + "total_acs": 17269, + "total_submitted": 30374, "total_column_articles": 133, "frontend_question_id": "913", "is_new_question": false @@ -36972,9 +37266,9 @@ "question__title": "Sort an Array", "question__title_slug": "sort-an-array", "question__hide": false, - "total_acs": 386106, - "total_submitted": 693692, - "total_column_articles": 1576, + "total_acs": 392687, + "total_submitted": 705378, + "total_column_articles": 1618, "frontend_question_id": "912", "is_new_question": false }, @@ -36993,9 +37287,9 @@ "question__title": "Online Election", "question__title_slug": "online-election", "question__hide": false, - "total_acs": 28581, - "total_submitted": 52944, - "total_column_articles": 338, + "total_acs": 28802, + "total_submitted": 53385, + "total_column_articles": 340, "frontend_question_id": "911", "is_new_question": false }, @@ -37014,9 +37308,9 @@ "question__title": "Smallest Range II", "question__title_slug": "smallest-range-ii", "question__hide": false, - "total_acs": 8842, - "total_submitted": 26091, - "total_column_articles": 94, + "total_acs": 8941, + "total_submitted": 26328, + "total_column_articles": 93, "frontend_question_id": "910", "is_new_question": false }, @@ -37035,9 +37329,9 @@ "question__title": "Snakes and Ladders", "question__title_slug": "snakes-and-ladders", "question__hide": false, - "total_acs": 17507, - "total_submitted": 38381, - "total_column_articles": 210, + "total_acs": 17581, + "total_submitted": 38549, + "total_column_articles": 211, "frontend_question_id": "909", "is_new_question": false }, @@ -37056,9 +37350,9 @@ "question__title": "Smallest Range I", "question__title_slug": "smallest-range-i", "question__hide": false, - "total_acs": 50233, - "total_submitted": 67558, - "total_column_articles": 522, + "total_acs": 50390, + "total_submitted": 67757, + "total_column_articles": 521, "frontend_question_id": "908", "is_new_question": false }, @@ -37077,8 +37371,8 @@ "question__title": "Sum of Subarray Minimums", "question__title_slug": "sum-of-subarray-minimums", "question__hide": false, - "total_acs": 17655, - "total_submitted": 51737, + "total_acs": 17893, + "total_submitted": 52366, "total_column_articles": 190, "frontend_question_id": "907", "is_new_question": false @@ -37098,8 +37392,8 @@ "question__title": "Super Palindromes", "question__title_slug": "super-palindromes", "question__hide": false, - "total_acs": 2896, - "total_submitted": 9693, + "total_acs": 2917, + "total_submitted": 9737, "total_column_articles": 54, "frontend_question_id": "906", "is_new_question": false @@ -37119,9 +37413,9 @@ "question__title": "Sort Array By Parity", "question__title_slug": "sort-array-by-parity", "question__hide": false, - "total_acs": 107509, - "total_submitted": 150811, - "total_column_articles": 1304, + "total_acs": 107907, + "total_submitted": 151371, + "total_column_articles": 1307, "frontend_question_id": "905", "is_new_question": false }, @@ -37140,9 +37434,9 @@ "question__title": "Fruit Into Baskets", "question__title_slug": "fruit-into-baskets", "question__hide": false, - "total_acs": 52367, - "total_submitted": 119532, - "total_column_articles": 639, + "total_acs": 53991, + "total_submitted": 123259, + "total_column_articles": 655, "frontend_question_id": "904", "is_new_question": false }, @@ -37161,9 +37455,9 @@ "question__title": "Valid Permutations for DI Sequence", "question__title_slug": "valid-permutations-for-di-sequence", "question__hide": false, - "total_acs": 3362, - "total_submitted": 6113, - "total_column_articles": 51, + "total_acs": 3380, + "total_submitted": 6136, + "total_column_articles": 52, "frontend_question_id": "903", "is_new_question": false }, @@ -37182,9 +37476,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": 4985, - "total_submitted": 13487, - "total_column_articles": 104, + "total_acs": 5055, + "total_submitted": 13681, + "total_column_articles": 105, "frontend_question_id": "902", "is_new_question": false }, @@ -37203,9 +37497,9 @@ "question__title": "Online Stock Span", "question__title_slug": "online-stock-span", "question__hide": false, - "total_acs": 25439, - "total_submitted": 45406, - "total_column_articles": 305, + "total_acs": 25760, + "total_submitted": 45936, + "total_column_articles": 308, "frontend_question_id": "901", "is_new_question": false }, @@ -37224,8 +37518,8 @@ "question__title": "RLE Iterator", "question__title_slug": "rle-iterator", "question__hide": false, - "total_acs": 4342, - "total_submitted": 8558, + "total_acs": 4367, + "total_submitted": 8618, "total_column_articles": 71, "frontend_question_id": "900", "is_new_question": false @@ -37245,9 +37539,9 @@ "question__title": "Orderly Queue", "question__title_slug": "orderly-queue", "question__hide": false, - "total_acs": 5397, - "total_submitted": 9935, - "total_column_articles": 58, + "total_acs": 5460, + "total_submitted": 10034, + "total_column_articles": 59, "frontend_question_id": "899", "is_new_question": false }, @@ -37266,8 +37560,8 @@ "question__title": "Bitwise ORs of Subarrays", "question__title_slug": "bitwise-ors-of-subarrays", "question__hide": false, - "total_acs": 6693, - "total_submitted": 18678, + "total_acs": 6728, + "total_submitted": 18745, "total_column_articles": 48, "frontend_question_id": "898", "is_new_question": false @@ -37287,9 +37581,9 @@ "question__title": "Increasing Order Search Tree", "question__title_slug": "increasing-order-search-tree", "question__hide": false, - "total_acs": 70234, - "total_submitted": 94703, - "total_column_articles": 811, + "total_acs": 70569, + "total_submitted": 95154, + "total_column_articles": 813, "frontend_question_id": "897", "is_new_question": false }, @@ -37308,9 +37602,9 @@ "question__title": "Monotonic Array", "question__title_slug": "monotonic-array", "question__hide": false, - "total_acs": 69978, - "total_submitted": 120908, - "total_column_articles": 837, + "total_acs": 70422, + "total_submitted": 121806, + "total_column_articles": 843, "frontend_question_id": "896", "is_new_question": false }, @@ -37329,8 +37623,8 @@ "question__title": "Maximum Frequency Stack", "question__title_slug": "maximum-frequency-stack", "question__hide": false, - "total_acs": 11925, - "total_submitted": 20222, + "total_acs": 12116, + "total_submitted": 20560, "total_column_articles": 143, "frontend_question_id": "895", "is_new_question": false @@ -37350,9 +37644,9 @@ "question__title": "All Possible Full Binary Trees", "question__title_slug": "all-possible-full-binary-trees", "question__hide": false, - "total_acs": 16033, - "total_submitted": 20653, - "total_column_articles": 159, + "total_acs": 16182, + "total_submitted": 20831, + "total_column_articles": 161, "frontend_question_id": "894", "is_new_question": false }, @@ -37371,9 +37665,9 @@ "question__title": "Groups of Special-Equivalent Strings", "question__title_slug": "groups-of-special-equivalent-strings", "question__hide": false, - "total_acs": 11710, - "total_submitted": 16115, - "total_column_articles": 124, + "total_acs": 11766, + "total_submitted": 16192, + "total_column_articles": 126, "frontend_question_id": "893", "is_new_question": false }, @@ -37392,9 +37686,9 @@ "question__title": "Surface Area of 3D Shapes", "question__title_slug": "surface-area-of-3d-shapes", "question__hide": false, - "total_acs": 35477, - "total_submitted": 55478, - "total_column_articles": 716, + "total_acs": 35575, + "total_submitted": 55644, + "total_column_articles": 717, "frontend_question_id": "892", "is_new_question": false }, @@ -37413,8 +37707,8 @@ "question__title": "Sum of Subsequence Widths", "question__title_slug": "sum-of-subsequence-widths", "question__hide": false, - "total_acs": 3461, - "total_submitted": 10059, + "total_acs": 3487, + "total_submitted": 10107, "total_column_articles": 48, "frontend_question_id": "891", "is_new_question": false @@ -37434,9 +37728,9 @@ "question__title": "Find and Replace Pattern", "question__title_slug": "find-and-replace-pattern", "question__hide": false, - "total_acs": 28981, - "total_submitted": 36576, - "total_column_articles": 428, + "total_acs": 29303, + "total_submitted": 36983, + "total_column_articles": 430, "frontend_question_id": "890", "is_new_question": false }, @@ -37455,9 +37749,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": 26124, - "total_submitted": 38576, - "total_column_articles": 266, + "total_acs": 26665, + "total_submitted": 39378, + "total_column_articles": 270, "frontend_question_id": "889", "is_new_question": false }, @@ -37476,9 +37770,9 @@ "question__title": "Fair Candy Swap", "question__title_slug": "fair-candy-swap", "question__hide": false, - "total_acs": 60952, - "total_submitted": 95304, - "total_column_articles": 526, + "total_acs": 61201, + "total_submitted": 95725, + "total_column_articles": 528, "frontend_question_id": "888", "is_new_question": false }, @@ -37497,9 +37791,9 @@ "question__title": "Super Egg Drop", "question__title_slug": "super-egg-drop", "question__hide": false, - "total_acs": 64912, - "total_submitted": 217430, - "total_column_articles": 413, + "total_acs": 65570, + "total_submitted": 219122, + "total_column_articles": 417, "frontend_question_id": "887", "is_new_question": false }, @@ -37518,9 +37812,9 @@ "question__title": "Possible Bipartition", "question__title_slug": "possible-bipartition", "question__hide": false, - "total_acs": 17181, - "total_submitted": 35442, - "total_column_articles": 307, + "total_acs": 17574, + "total_submitted": 36150, + "total_column_articles": 318, "frontend_question_id": "886", "is_new_question": false }, @@ -37539,9 +37833,9 @@ "question__title": "Spiral Matrix III", "question__title_slug": "spiral-matrix-iii", "question__hide": false, - "total_acs": 6143, - "total_submitted": 8761, - "total_column_articles": 92, + "total_acs": 6201, + "total_submitted": 8829, + "total_column_articles": 94, "frontend_question_id": "885", "is_new_question": false }, @@ -37560,9 +37854,9 @@ "question__title": "Uncommon Words from Two Sentences", "question__title_slug": "uncommon-words-from-two-sentences", "question__hide": false, - "total_acs": 43692, - "total_submitted": 60811, - "total_column_articles": 554, + "total_acs": 43869, + "total_submitted": 61039, + "total_column_articles": 556, "frontend_question_id": "884", "is_new_question": false }, @@ -37581,9 +37875,9 @@ "question__title": "Projection Area of 3D Shapes", "question__title_slug": "projection-area-of-3d-shapes", "question__hide": false, - "total_acs": 42282, - "total_submitted": 55198, - "total_column_articles": 526, + "total_acs": 42392, + "total_submitted": 55351, + "total_column_articles": 525, "frontend_question_id": "883", "is_new_question": false }, @@ -37602,9 +37896,9 @@ "question__title": "Reachable Nodes In Subdivided Graph", "question__title_slug": "reachable-nodes-in-subdivided-graph", "question__hide": false, - "total_acs": 2742, - "total_submitted": 5492, - "total_column_articles": 46, + "total_acs": 2777, + "total_submitted": 5567, + "total_column_articles": 47, "frontend_question_id": "882", "is_new_question": false }, @@ -37623,9 +37917,9 @@ "question__title": "Boats to Save People", "question__title_slug": "boats-to-save-people", "question__hide": false, - "total_acs": 57971, - "total_submitted": 107672, - "total_column_articles": 677, + "total_acs": 58414, + "total_submitted": 108492, + "total_column_articles": 683, "frontend_question_id": "881", "is_new_question": false }, @@ -37644,9 +37938,9 @@ "question__title": "Decoded String at Index", "question__title_slug": "decoded-string-at-index", "question__hide": false, - "total_acs": 7130, - "total_submitted": 27397, - "total_column_articles": 89, + "total_acs": 7177, + "total_submitted": 27549, + "total_column_articles": 91, "frontend_question_id": "880", "is_new_question": false }, @@ -37665,9 +37959,9 @@ "question__title": "Generate Random Point in a Circle", "question__title_slug": "generate-random-point-in-a-circle", "question__hide": false, - "total_acs": 26570, - "total_submitted": 55203, - "total_column_articles": 171, + "total_acs": 26759, + "total_submitted": 55578, + "total_column_articles": 175, "frontend_question_id": "478", "is_new_question": false }, @@ -37686,9 +37980,9 @@ "question__title": "Random Point in Non-overlapping Rectangles", "question__title_slug": "random-point-in-non-overlapping-rectangles", "question__hide": false, - "total_acs": 21974, - "total_submitted": 52386, - "total_column_articles": 200, + "total_acs": 22194, + "total_submitted": 52984, + "total_column_articles": 203, "frontend_question_id": "497", "is_new_question": false }, @@ -37707,9 +38001,9 @@ "question__title": "Random Flip Matrix", "question__title_slug": "random-flip-matrix", "question__hide": false, - "total_acs": 20444, - "total_submitted": 43816, - "total_column_articles": 200, + "total_acs": 20538, + "total_submitted": 44061, + "total_column_articles": 201, "frontend_question_id": "519", "is_new_question": false }, @@ -37728,8 +38022,8 @@ "question__title": "Random Pick with Weight", "question__title_slug": "random-pick-with-weight", "question__hide": false, - "total_acs": 43449, - "total_submitted": 90299, + "total_acs": 44368, + "total_submitted": 92169, "total_column_articles": 335, "frontend_question_id": "528", "is_new_question": false @@ -37749,9 +38043,9 @@ "question__title": "Profitable Schemes", "question__title_slug": "profitable-schemes", "question__hide": false, - "total_acs": 24428, - "total_submitted": 44164, - "total_column_articles": 206, + "total_acs": 24552, + "total_submitted": 44453, + "total_column_articles": 209, "frontend_question_id": "879", "is_new_question": false }, @@ -37770,8 +38064,8 @@ "question__title": "Nth Magical Number", "question__title_slug": "nth-magical-number", "question__hide": false, - "total_acs": 5491, - "total_submitted": 18568, + "total_acs": 5540, + "total_submitted": 18680, "total_column_articles": 76, "frontend_question_id": "878", "is_new_question": false @@ -37791,9 +38085,9 @@ "question__title": "Stone Game", "question__title_slug": "stone-game", "question__hide": false, - "total_acs": 80955, - "total_submitted": 106341, - "total_column_articles": 552, + "total_acs": 81487, + "total_submitted": 107022, + "total_column_articles": 555, "frontend_question_id": "877", "is_new_question": false }, @@ -37812,9 +38106,9 @@ "question__title": "Middle of the Linked List", "question__title_slug": "middle-of-the-linked-list", "question__hide": false, - "total_acs": 261527, - "total_submitted": 370350, - "total_column_articles": 2619, + "total_acs": 266670, + "total_submitted": 377752, + "total_column_articles": 2657, "frontend_question_id": "876", "is_new_question": false }, @@ -37833,9 +38127,9 @@ "question__title": "Koko Eating Bananas", "question__title_slug": "koko-eating-bananas", "question__hide": false, - "total_acs": 100560, - "total_submitted": 197437, - "total_column_articles": 804, + "total_acs": 102163, + "total_submitted": 200933, + "total_column_articles": 808, "frontend_question_id": "875", "is_new_question": false }, @@ -37854,9 +38148,9 @@ "question__title": "Walking Robot Simulation", "question__title_slug": "walking-robot-simulation", "question__hide": false, - "total_acs": 23701, - "total_submitted": 56005, - "total_column_articles": 278, + "total_acs": 23823, + "total_submitted": 56311, + "total_column_articles": 281, "frontend_question_id": "874", "is_new_question": false }, @@ -37875,8 +38169,8 @@ "question__title": "Length of Longest Fibonacci Subsequence", "question__title_slug": "length-of-longest-fibonacci-subsequence", "question__hide": false, - "total_acs": 21150, - "total_submitted": 39857, + "total_acs": 21420, + "total_submitted": 40258, "total_column_articles": 158, "frontend_question_id": "873", "is_new_question": false @@ -37896,9 +38190,9 @@ "question__title": "Leaf-Similar Trees", "question__title_slug": "leaf-similar-trees", "question__hide": false, - "total_acs": 65897, - "total_submitted": 101199, - "total_column_articles": 795, + "total_acs": 66091, + "total_submitted": 101492, + "total_column_articles": 797, "frontend_question_id": "872", "is_new_question": false }, @@ -37917,9 +38211,9 @@ "question__title": "Implement Rand10() Using Rand7()", "question__title_slug": "implement-rand10-using-rand7", "question__hide": false, - "total_acs": 84261, - "total_submitted": 152754, - "total_column_articles": 406, + "total_acs": 85070, + "total_submitted": 154162, + "total_column_articles": 409, "frontend_question_id": "470", "is_new_question": false }, @@ -37938,8 +38232,8 @@ "question__title": "Minimum Number of Refueling Stops", "question__title_slug": "minimum-number-of-refueling-stops", "question__hide": false, - "total_acs": 12674, - "total_submitted": 35291, + "total_acs": 12796, + "total_submitted": 35631, "total_column_articles": 165, "frontend_question_id": "871", "is_new_question": false @@ -37959,9 +38253,9 @@ "question__title": "Advantage Shuffle", "question__title_slug": "advantage-shuffle", "question__hide": false, - "total_acs": 24937, - "total_submitted": 53434, - "total_column_articles": 286, + "total_acs": 25462, + "total_submitted": 54377, + "total_column_articles": 285, "frontend_question_id": "870", "is_new_question": false }, @@ -37980,9 +38274,9 @@ "question__title": "Reordered Power of 2", "question__title_slug": "reordered-power-of-2", "question__hide": false, - "total_acs": 34286, - "total_submitted": 53524, - "total_column_articles": 488, + "total_acs": 34369, + "total_submitted": 53672, + "total_column_articles": 489, "frontend_question_id": "869", "is_new_question": false }, @@ -38001,8 +38295,8 @@ "question__title": "Binary Gap", "question__title_slug": "binary-gap", "question__hide": false, - "total_acs": 48031, - "total_submitted": 69088, + "total_acs": 48149, + "total_submitted": 69261, "total_column_articles": 640, "frontend_question_id": "868", "is_new_question": false @@ -38022,9 +38316,9 @@ "question__title": "Transpose Matrix", "question__title_slug": "transpose-matrix", "question__hide": false, - "total_acs": 90644, - "total_submitted": 135792, - "total_column_articles": 810, + "total_acs": 90880, + "total_submitted": 136198, + "total_column_articles": 815, "frontend_question_id": "867", "is_new_question": false }, @@ -38043,9 +38337,9 @@ "question__title": "Prime Palindrome", "question__title_slug": "prime-palindrome", "question__hide": false, - "total_acs": 9179, - "total_submitted": 39617, - "total_column_articles": 109, + "total_acs": 9249, + "total_submitted": 39888, + "total_column_articles": 110, "frontend_question_id": "866", "is_new_question": false }, @@ -38064,9 +38358,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": 11883, - "total_submitted": 17587, - "total_column_articles": 179, + "total_acs": 12017, + "total_submitted": 17799, + "total_column_articles": 182, "frontend_question_id": "865", "is_new_question": false }, @@ -38085,9 +38379,9 @@ "question__title": "Shortest Path to Get All Keys", "question__title_slug": "shortest-path-to-get-all-keys", "question__hide": false, - "total_acs": 4002, - "total_submitted": 8415, - "total_column_articles": 59, + "total_acs": 4053, + "total_submitted": 8494, + "total_column_articles": 60, "frontend_question_id": "864", "is_new_question": false }, @@ -38106,9 +38400,9 @@ "question__title": "Random Pick with Blacklist", "question__title_slug": "random-pick-with-blacklist", "question__hide": false, - "total_acs": 10197, - "total_submitted": 26693, - "total_column_articles": 216, + "total_acs": 24129, + "total_submitted": 54553, + "total_column_articles": 331, "frontend_question_id": "710", "is_new_question": false }, @@ -38127,9 +38421,9 @@ "question__title": "All Nodes Distance K in Binary Tree", "question__title_slug": "all-nodes-distance-k-in-binary-tree", "question__hide": false, - "total_acs": 43916, - "total_submitted": 71884, - "total_column_articles": 652, + "total_acs": 44314, + "total_submitted": 72513, + "total_column_articles": 655, "frontend_question_id": "863", "is_new_question": false }, @@ -38148,9 +38442,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": 22802, - "total_submitted": 107088, - "total_column_articles": 196, + "total_acs": 23133, + "total_submitted": 108186, + "total_column_articles": 197, "frontend_question_id": "862", "is_new_question": false }, @@ -38169,9 +38463,9 @@ "question__title": "Score After Flipping Matrix", "question__title_slug": "score-after-flipping-matrix", "question__hide": false, - "total_acs": 33560, - "total_submitted": 41544, - "total_column_articles": 475, + "total_acs": 33676, + "total_submitted": 41697, + "total_column_articles": 479, "frontend_question_id": "861", "is_new_question": false }, @@ -38190,9 +38484,9 @@ "question__title": "Lemonade Change", "question__title_slug": "lemonade-change", "question__hide": false, - "total_acs": 124398, - "total_submitted": 212357, - "total_column_articles": 1034, + "total_acs": 125888, + "total_submitted": 214898, + "total_column_articles": 1053, "frontend_question_id": "860", "is_new_question": false }, @@ -38211,9 +38505,9 @@ "question__title": "Buddy Strings", "question__title_slug": "buddy-strings", "question__hide": false, - "total_acs": 62945, - "total_submitted": 182386, - "total_column_articles": 800, + "total_acs": 63229, + "total_submitted": 183402, + "total_column_articles": 802, "frontend_question_id": "859", "is_new_question": false }, @@ -38232,8 +38526,8 @@ "question__title": "Mirror Reflection", "question__title_slug": "mirror-reflection", "question__hide": false, - "total_acs": 3611, - "total_submitted": 6453, + "total_acs": 3645, + "total_submitted": 6515, "total_column_articles": 58, "frontend_question_id": "858", "is_new_question": false @@ -38253,9 +38547,9 @@ "question__title": "Minimum Cost to Hire K Workers", "question__title_slug": "minimum-cost-to-hire-k-workers", "question__hide": false, - "total_acs": 3877, - "total_submitted": 8050, - "total_column_articles": 63, + "total_acs": 3902, + "total_submitted": 8098, + "total_column_articles": 68, "frontend_question_id": "857", "is_new_question": false }, @@ -38274,9 +38568,9 @@ "question__title": "Score of Parentheses", "question__title_slug": "score-of-parentheses", "question__hide": false, - "total_acs": 19746, - "total_submitted": 31186, - "total_column_articles": 271, + "total_acs": 19969, + "total_submitted": 31556, + "total_column_articles": 272, "frontend_question_id": "856", "is_new_question": false }, @@ -38295,8 +38589,8 @@ "question__title": "Exam Room", "question__title_slug": "exam-room", "question__hide": false, - "total_acs": 7538, - "total_submitted": 18385, + "total_acs": 7668, + "total_submitted": 18786, "total_column_articles": 75, "frontend_question_id": "855", "is_new_question": false @@ -38316,9 +38610,9 @@ "question__title": "K-Similar Strings", "question__title_slug": "k-similar-strings", "question__hide": false, - "total_acs": 5057, - "total_submitted": 13908, - "total_column_articles": 87, + "total_acs": 5128, + "total_submitted": 14064, + "total_column_articles": 88, "frontend_question_id": "854", "is_new_question": false }, @@ -38337,9 +38631,9 @@ "question__title": "Car Fleet", "question__title_slug": "car-fleet", "question__hide": false, - "total_acs": 13567, - "total_submitted": 33991, - "total_column_articles": 163, + "total_acs": 13757, + "total_submitted": 34418, + "total_column_articles": 166, "frontend_question_id": "853", "is_new_question": false }, @@ -38358,9 +38652,9 @@ "question__title": "Peak Index in a Mountain Array", "question__title_slug": "peak-index-in-a-mountain-array", "question__hide": false, - "total_acs": 110728, - "total_submitted": 158675, - "total_column_articles": 943, + "total_acs": 112219, + "total_submitted": 161140, + "total_column_articles": 954, "frontend_question_id": "852", "is_new_question": false }, @@ -38379,8 +38673,8 @@ "question__title": "Loud and Rich", "question__title_slug": "loud-and-rich", "question__hide": false, - "total_acs": 27137, - "total_submitted": 43203, + "total_acs": 27220, + "total_submitted": 43340, "total_column_articles": 300, "frontend_question_id": "851", "is_new_question": false @@ -38400,8 +38694,8 @@ "question__title": "Rectangle Area II", "question__title_slug": "rectangle-area-ii", "question__hide": false, - "total_acs": 3304, - "total_submitted": 7220, + "total_acs": 3354, + "total_submitted": 7338, "total_column_articles": 56, "frontend_question_id": "850", "is_new_question": false @@ -38421,8 +38715,8 @@ "question__title": "Maximize Distance to Closest Person", "question__title_slug": "maximize-distance-to-closest-person", "question__hide": false, - "total_acs": 18358, - "total_submitted": 42350, + "total_acs": 18442, + "total_submitted": 42537, "total_column_articles": 234, "frontend_question_id": "849", "is_new_question": false @@ -38442,9 +38736,9 @@ "question__title": "Shifting Letters", "question__title_slug": "shifting-letters", "question__hide": false, - "total_acs": 11542, - "total_submitted": 25344, - "total_column_articles": 124, + "total_acs": 11643, + "total_submitted": 25553, + "total_column_articles": 125, "frontend_question_id": "848", "is_new_question": false }, @@ -38463,9 +38757,9 @@ "question__title": "Shortest Path Visiting All Nodes", "question__title_slug": "shortest-path-visiting-all-nodes", "question__hide": false, - "total_acs": 22039, - "total_submitted": 32481, - "total_column_articles": 192, + "total_acs": 22165, + "total_submitted": 32683, + "total_column_articles": 194, "frontend_question_id": "847", "is_new_question": false }, @@ -38484,8 +38778,8 @@ "question__title": "Hand of Straights", "question__title_slug": "hand-of-straights", "question__hide": false, - "total_acs": 36277, - "total_submitted": 63393, + "total_acs": 36403, + "total_submitted": 63642, "total_column_articles": 494, "frontend_question_id": "846", "is_new_question": false @@ -38505,9 +38799,9 @@ "question__title": "Longest Mountain in Array", "question__title_slug": "longest-mountain-in-array", "question__hide": false, - "total_acs": 42962, - "total_submitted": 101868, - "total_column_articles": 629, + "total_acs": 43258, + "total_submitted": 102449, + "total_column_articles": 630, "frontend_question_id": "845", "is_new_question": false }, @@ -38526,9 +38820,9 @@ "question__title": "Backspace String Compare", "question__title_slug": "backspace-string-compare", "question__hide": false, - "total_acs": 140421, - "total_submitted": 285425, - "total_column_articles": 1421, + "total_acs": 142527, + "total_submitted": 290032, + "total_column_articles": 1435, "frontend_question_id": "844", "is_new_question": false }, @@ -38547,9 +38841,9 @@ "question__title": "Guess the Word", "question__title_slug": "guess-the-word", "question__hide": false, - "total_acs": 3632, - "total_submitted": 9392, - "total_column_articles": 49, + "total_acs": 3677, + "total_submitted": 9513, + "total_column_articles": 52, "frontend_question_id": "843", "is_new_question": false }, @@ -38568,9 +38862,9 @@ "question__title": "Split Array into Fibonacci Sequence", "question__title_slug": "split-array-into-fibonacci-sequence", "question__hide": false, - "total_acs": 31268, - "total_submitted": 64426, - "total_column_articles": 343, + "total_acs": 31366, + "total_submitted": 64635, + "total_column_articles": 345, "frontend_question_id": "842", "is_new_question": false }, @@ -38589,9 +38883,9 @@ "question__title": "Keys and Rooms", "question__title_slug": "keys-and-rooms", "question__hide": false, - "total_acs": 68048, - "total_submitted": 102164, - "total_column_articles": 671, + "total_acs": 68691, + "total_submitted": 103044, + "total_column_articles": 676, "frontend_question_id": "841", "is_new_question": false }, @@ -38610,8 +38904,8 @@ "question__title": "Magic Squares In Grid", "question__title_slug": "magic-squares-in-grid", "question__hide": false, - "total_acs": 9931, - "total_submitted": 27309, + "total_acs": 9969, + "total_submitted": 27412, "total_column_articles": 128, "frontend_question_id": "840", "is_new_question": false @@ -38631,9 +38925,9 @@ "question__title": "Similar String Groups", "question__title_slug": "similar-string-groups", "question__hide": false, - "total_acs": 21292, - "total_submitted": 36635, - "total_column_articles": 301, + "total_acs": 21405, + "total_submitted": 36800, + "total_column_articles": 305, "frontend_question_id": "839", "is_new_question": false }, @@ -38652,9 +38946,9 @@ "question__title": "Push Dominoes", "question__title_slug": "push-dominoes", "question__hide": false, - "total_acs": 36503, - "total_submitted": 65772, - "total_column_articles": 520, + "total_acs": 36641, + "total_submitted": 65987, + "total_column_articles": 525, "frontend_question_id": "838", "is_new_question": false }, @@ -38673,8 +38967,8 @@ "question__title": "New 21 Game", "question__title_slug": "new-21-game", "question__hide": false, - "total_acs": 20674, - "total_submitted": 52278, + "total_acs": 20720, + "total_submitted": 52426, "total_column_articles": 256, "frontend_question_id": "837", "is_new_question": false @@ -38694,9 +38988,9 @@ "question__title": "Rectangle Overlap", "question__title_slug": "rectangle-overlap", "question__hide": false, - "total_acs": 43445, - "total_submitted": 89542, - "total_column_articles": 726, + "total_acs": 43655, + "total_submitted": 89933, + "total_column_articles": 732, "frontend_question_id": "836", "is_new_question": false }, @@ -38715,8 +39009,8 @@ "question__title": "Robot Room Cleaner", "question__title_slug": "robot-room-cleaner", "question__hide": false, - "total_acs": 2610, - "total_submitted": 3519, + "total_acs": 2637, + "total_submitted": 3550, "total_column_articles": 32, "frontend_question_id": "489", "is_new_question": false @@ -38736,9 +39030,9 @@ "question__title": "Image Overlap", "question__title_slug": "image-overlap", "question__hide": false, - "total_acs": 5130, - "total_submitted": 8908, - "total_column_articles": 58, + "total_acs": 5169, + "total_submitted": 8985, + "total_column_articles": 59, "frontend_question_id": "835", "is_new_question": false }, @@ -38757,8 +39051,8 @@ "question__title": "Sum of Distances in Tree", "question__title_slug": "sum-of-distances-in-tree", "question__hide": false, - "total_acs": 14798, - "total_submitted": 27827, + "total_acs": 14868, + "total_submitted": 27938, "total_column_articles": 147, "frontend_question_id": "834", "is_new_question": false @@ -38778,9 +39072,9 @@ "question__title": "Find And Replace in String", "question__title_slug": "find-and-replace-in-string", "question__hide": false, - "total_acs": 6582, - "total_submitted": 14881, - "total_column_articles": 97, + "total_acs": 6633, + "total_submitted": 15033, + "total_column_articles": 98, "frontend_question_id": "833", "is_new_question": false }, @@ -38799,9 +39093,9 @@ "question__title": "Flipping an Image", "question__title_slug": "flipping-an-image", "question__hide": false, - "total_acs": 93065, - "total_submitted": 117082, - "total_column_articles": 1025, + "total_acs": 93340, + "total_submitted": 117454, + "total_column_articles": 1027, "frontend_question_id": "832", "is_new_question": false }, @@ -38820,9 +39114,9 @@ "question__title": "Design Circular Queue", "question__title_slug": "design-circular-queue", "question__hide": false, - "total_acs": 83933, - "total_submitted": 188912, - "total_column_articles": 593, + "total_acs": 84516, + "total_submitted": 190079, + "total_column_articles": 595, "frontend_question_id": "622", "is_new_question": false }, @@ -38841,9 +39135,9 @@ "question__title": "Design Circular Deque", "question__title_slug": "design-circular-deque", "question__hide": false, - "total_acs": 28116, - "total_submitted": 53012, - "total_column_articles": 324, + "total_acs": 28372, + "total_submitted": 53512, + "total_column_articles": 329, "frontend_question_id": "641", "is_new_question": false }, @@ -38862,8 +39156,8 @@ "question__title": "Masking Personal Information", "question__title_slug": "masking-personal-information", "question__hide": false, - "total_acs": 8877, - "total_submitted": 21300, + "total_acs": 8953, + "total_submitted": 21444, "total_column_articles": 95, "frontend_question_id": "831", "is_new_question": false @@ -38883,8 +39177,8 @@ "question__title": "Positions of Large Groups", "question__title_slug": "positions-of-large-groups", "question__hide": false, - "total_acs": 55327, - "total_submitted": 101844, + "total_acs": 55482, + "total_submitted": 102118, "total_column_articles": 632, "frontend_question_id": "830", "is_new_question": false @@ -38904,9 +39198,9 @@ "question__title": "Consecutive Numbers Sum", "question__title_slug": "consecutive-numbers-sum", "question__hide": false, - "total_acs": 27790, - "total_submitted": 58782, - "total_column_articles": 338, + "total_acs": 28077, + "total_submitted": 59406, + "total_column_articles": 342, "frontend_question_id": "829", "is_new_question": false }, @@ -38925,9 +39219,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": 4970, - "total_submitted": 9061, - "total_column_articles": 79, + "total_acs": 5059, + "total_submitted": 9174, + "total_column_articles": 82, "frontend_question_id": "828", "is_new_question": false }, @@ -38946,9 +39240,9 @@ "question__title": "Making A Large Island", "question__title_slug": "making-a-large-island", "question__hide": false, - "total_acs": 13927, - "total_submitted": 35280, - "total_column_articles": 245, + "total_acs": 14147, + "total_submitted": 35801, + "total_column_articles": 255, "frontend_question_id": "827", "is_new_question": false }, @@ -38967,9 +39261,9 @@ "question__title": "Most Profit Assigning Work", "question__title_slug": "most-profit-assigning-work", "question__hide": false, - "total_acs": 11293, - "total_submitted": 28114, - "total_column_articles": 165, + "total_acs": 11556, + "total_submitted": 28666, + "total_column_articles": 168, "frontend_question_id": "826", "is_new_question": false }, @@ -38988,9 +39282,9 @@ "question__title": "Friends Of Appropriate Ages", "question__title_slug": "friends-of-appropriate-ages", "question__hide": false, - "total_acs": 34264, - "total_submitted": 74920, - "total_column_articles": 324, + "total_acs": 34340, + "total_submitted": 75106, + "total_column_articles": 325, "frontend_question_id": "825", "is_new_question": false }, @@ -39009,9 +39303,9 @@ "question__title": "Goat Latin", "question__title_slug": "goat-latin", "question__hide": false, - "total_acs": 50833, - "total_submitted": 77798, - "total_column_articles": 679, + "total_acs": 50946, + "total_submitted": 77988, + "total_column_articles": 678, "frontend_question_id": "824", "is_new_question": false }, @@ -39030,9 +39324,9 @@ "question__title": "Insert into a Sorted Circular Linked List", "question__title_slug": "insert-into-a-sorted-circular-linked-list", "question__hide": false, - "total_acs": 3857, - "total_submitted": 10389, - "total_column_articles": 76, + "total_acs": 3965, + "total_submitted": 10624, + "total_column_articles": 77, "frontend_question_id": "708", "is_new_question": false }, @@ -39051,8 +39345,8 @@ "question__title": "Binary Trees With Factors", "question__title_slug": "binary-trees-with-factors", "question__hide": false, - "total_acs": 3970, - "total_submitted": 9272, + "total_acs": 4035, + "total_submitted": 9412, "total_column_articles": 63, "frontend_question_id": "823", "is_new_question": false @@ -39072,8 +39366,8 @@ "question__title": "Card Flipping Game", "question__title_slug": "card-flipping-game", "question__hide": false, - "total_acs": 3755, - "total_submitted": 7367, + "total_acs": 3808, + "total_submitted": 7458, "total_column_articles": 54, "frontend_question_id": "822", "is_new_question": false @@ -39093,9 +39387,9 @@ "question__title": "Shortest Distance to a Character", "question__title_slug": "shortest-distance-to-a-character", "question__hide": false, - "total_acs": 66464, - "total_submitted": 90689, - "total_column_articles": 910, + "total_acs": 66721, + "total_submitted": 91042, + "total_column_articles": 911, "frontend_question_id": "821", "is_new_question": false }, @@ -39114,9 +39408,9 @@ "question__title": "Short Encoding of Words", "question__title_slug": "short-encoding-of-words", "question__hide": false, - "total_acs": 62038, - "total_submitted": 120663, - "total_column_articles": 671, + "total_acs": 62537, + "total_submitted": 121475, + "total_column_articles": 676, "frontend_question_id": "820", "is_new_question": false }, @@ -39135,9 +39429,9 @@ "question__title": "Design Linked List", "question__title_slug": "design-linked-list", "question__hide": false, - "total_acs": 123776, - "total_submitted": 366597, - "total_column_articles": 798, + "total_acs": 126384, + "total_submitted": 373827, + "total_column_articles": 809, "frontend_question_id": "707", "is_new_question": false }, @@ -39156,9 +39450,9 @@ "question__title": "Most Common Word", "question__title_slug": "most-common-word", "question__hide": false, - "total_acs": 52988, - "total_submitted": 114477, - "total_column_articles": 629, + "total_acs": 53257, + "total_submitted": 115169, + "total_column_articles": 631, "frontend_question_id": "819", "is_new_question": false }, @@ -39177,9 +39471,9 @@ "question__title": "Race Car", "question__title_slug": "race-car", "question__hide": false, - "total_acs": 4572, - "total_submitted": 10348, - "total_column_articles": 50, + "total_acs": 4622, + "total_submitted": 10460, + "total_column_articles": 51, "frontend_question_id": "818", "is_new_question": false }, @@ -39198,8 +39492,8 @@ "question__title": "Linked List Components", "question__title_slug": "linked-list-components", "question__hide": false, - "total_acs": 15793, - "total_submitted": 26587, + "total_acs": 15879, + "total_submitted": 26741, "total_column_articles": 197, "frontend_question_id": "817", "is_new_question": false @@ -39219,8 +39513,8 @@ "question__title": "Ambiguous Coordinates", "question__title_slug": "ambiguous-coordinates", "question__hide": false, - "total_acs": 4619, - "total_submitted": 9016, + "total_acs": 4678, + "total_submitted": 9282, "total_column_articles": 81, "frontend_question_id": "816", "is_new_question": false @@ -39240,9 +39534,9 @@ "question__title": "Bus Routes", "question__title_slug": "bus-routes", "question__hide": false, - "total_acs": 30542, - "total_submitted": 70388, - "total_column_articles": 345, + "total_acs": 30721, + "total_submitted": 70809, + "total_column_articles": 347, "frontend_question_id": "815", "is_new_question": false }, @@ -39261,9 +39555,9 @@ "question__title": "Binary Tree Pruning", "question__title_slug": "binary-tree-pruning", "question__hide": false, - "total_acs": 29183, - "total_submitted": 41552, - "total_column_articles": 436, + "total_acs": 29454, + "total_submitted": 41936, + "total_column_articles": 439, "frontend_question_id": "814", "is_new_question": false }, @@ -39282,9 +39576,9 @@ "question__title": "Largest Sum of Averages", "question__title_slug": "largest-sum-of-averages", "question__hide": false, - "total_acs": 9372, - "total_submitted": 16655, - "total_column_articles": 107, + "total_acs": 9486, + "total_submitted": 16872, + "total_column_articles": 108, "frontend_question_id": "813", "is_new_question": false }, @@ -39303,8 +39597,8 @@ "question__title": "Largest Triangle Area", "question__title_slug": "largest-triangle-area", "question__hide": false, - "total_acs": 32862, - "total_submitted": 47593, + "total_acs": 32969, + "total_submitted": 47770, "total_column_articles": 293, "frontend_question_id": "812", "is_new_question": false @@ -39324,9 +39618,9 @@ "question__title": "Subdomain Visit Count", "question__title_slug": "subdomain-visit-count", "question__hide": false, - "total_acs": 18010, - "total_submitted": 25280, - "total_column_articles": 236, + "total_acs": 18096, + "total_submitted": 25385, + "total_column_articles": 237, "frontend_question_id": "811", "is_new_question": false }, @@ -39345,8 +39639,8 @@ "question__title": "Chalkboard XOR Game", "question__title_slug": "chalkboard-xor-game", "question__hide": false, - "total_acs": 17763, - "total_submitted": 24429, + "total_acs": 17805, + "total_submitted": 24517, "total_column_articles": 145, "frontend_question_id": "810", "is_new_question": false @@ -39366,8 +39660,8 @@ "question__title": "Expressive Words", "question__title_slug": "expressive-words", "question__hide": false, - "total_acs": 6031, - "total_submitted": 14372, + "total_acs": 6103, + "total_submitted": 14549, "total_column_articles": 105, "frontend_question_id": "809", "is_new_question": false @@ -39387,8 +39681,8 @@ "question__title": "Soup Servings", "question__title_slug": "soup-servings", "question__hide": false, - "total_acs": 5329, - "total_submitted": 11053, + "total_acs": 5365, + "total_submitted": 11152, "total_column_articles": 46, "frontend_question_id": "808", "is_new_question": false @@ -39408,9 +39702,9 @@ "question__title": "Max Increase to Keep City Skyline", "question__title_slug": "max-increase-to-keep-city-skyline", "question__hide": false, - "total_acs": 48578, - "total_submitted": 54840, - "total_column_articles": 680, + "total_acs": 48885, + "total_submitted": 55258, + "total_column_articles": 684, "frontend_question_id": "807", "is_new_question": false }, @@ -39429,9 +39723,9 @@ "question__title": "Number of Lines To Write String", "question__title_slug": "number-of-lines-to-write-string", "question__hide": false, - "total_acs": 47807, - "total_submitted": 69220, - "total_column_articles": 585, + "total_acs": 47926, + "total_submitted": 69393, + "total_column_articles": 586, "frontend_question_id": "806", "is_new_question": false }, @@ -39450,9 +39744,9 @@ "question__title": "Split Array With Same Average", "question__title_slug": "split-array-with-same-average", "question__hide": false, - "total_acs": 3698, - "total_submitted": 12466, - "total_column_articles": 60, + "total_acs": 3740, + "total_submitted": 12615, + "total_column_articles": 61, "frontend_question_id": "805", "is_new_question": false }, @@ -39471,9 +39765,9 @@ "question__title": "Unique Morse Code Words", "question__title_slug": "unique-morse-code-words", "question__hide": false, - "total_acs": 72371, - "total_submitted": 87986, - "total_column_articles": 760, + "total_acs": 72593, + "total_submitted": 88285, + "total_column_articles": 766, "frontend_question_id": "804", "is_new_question": false }, @@ -39492,9 +39786,9 @@ "question__title": "Bricks Falling When Hit", "question__title_slug": "bricks-falling-when-hit", "question__hide": false, - "total_acs": 13225, - "total_submitted": 27736, - "total_column_articles": 140, + "total_acs": 13261, + "total_submitted": 27835, + "total_column_articles": 141, "frontend_question_id": "803", "is_new_question": false }, @@ -39513,9 +39807,9 @@ "question__title": "Find Eventual Safe States", "question__title_slug": "find-eventual-safe-states", "question__hide": false, - "total_acs": 37185, - "total_submitted": 63550, - "total_column_articles": 389, + "total_acs": 37407, + "total_submitted": 63923, + "total_column_articles": 390, "frontend_question_id": "802", "is_new_question": false }, @@ -39534,9 +39828,9 @@ "question__title": "Minimum Swaps To Make Sequences Increasing", "question__title_slug": "minimum-swaps-to-make-sequences-increasing", "question__hide": false, - "total_acs": 8907, - "total_submitted": 20713, - "total_column_articles": 112, + "total_acs": 8986, + "total_submitted": 20852, + "total_column_articles": 113, "frontend_question_id": "801", "is_new_question": false }, @@ -39555,8 +39849,8 @@ "question__title": "Similar RGB Color", "question__title_slug": "similar-rgb-color", "question__hide": false, - "total_acs": 1885, - "total_submitted": 2663, + "total_acs": 1908, + "total_submitted": 2694, "total_column_articles": 47, "frontend_question_id": "800", "is_new_question": false @@ -39576,9 +39870,9 @@ "question__title": "Design HashMap", "question__title_slug": "design-hashmap", "question__hide": false, - "total_acs": 78589, - "total_submitted": 122944, - "total_column_articles": 510, + "total_acs": 79372, + "total_submitted": 124175, + "total_column_articles": 514, "frontend_question_id": "706", "is_new_question": false }, @@ -39597,9 +39891,9 @@ "question__title": "Design HashSet", "question__title_slug": "design-hashset", "question__hide": false, - "total_acs": 85917, - "total_submitted": 134550, - "total_column_articles": 534, + "total_acs": 86641, + "total_submitted": 135692, + "total_column_articles": 536, "frontend_question_id": "705", "is_new_question": false }, @@ -39618,9 +39912,9 @@ "question__title": "Champagne Tower", "question__title_slug": "champagne-tower", "question__hide": false, - "total_acs": 7834, - "total_submitted": 18432, - "total_column_articles": 89, + "total_acs": 7949, + "total_submitted": 18640, + "total_column_articles": 91, "frontend_question_id": "799", "is_new_question": false }, @@ -39639,8 +39933,8 @@ "question__title": "Smallest Rotation with Highest Score", "question__title_slug": "smallest-rotation-with-highest-score", "question__hide": false, - "total_acs": 19916, - "total_submitted": 32372, + "total_acs": 20049, + "total_submitted": 32538, "total_column_articles": 209, "frontend_question_id": "798", "is_new_question": false @@ -39660,9 +39954,9 @@ "question__title": "All Paths From Source to Target", "question__title_slug": "all-paths-from-source-to-target", "question__hide": false, - "total_acs": 71103, - "total_submitted": 90110, - "total_column_articles": 1344, + "total_acs": 72310, + "total_submitted": 91642, + "total_column_articles": 1386, "frontend_question_id": "797", "is_new_question": false }, @@ -39681,9 +39975,9 @@ "question__title": "Rotate String", "question__title_slug": "rotate-string", "question__hide": false, - "total_acs": 69221, - "total_submitted": 109726, - "total_column_articles": 769, + "total_acs": 69657, + "total_submitted": 110347, + "total_column_articles": 772, "frontend_question_id": "796", "is_new_question": false }, @@ -39702,9 +39996,9 @@ "question__title": "Number of Subarrays with Bounded Maximum", "question__title_slug": "number-of-subarrays-with-bounded-maximum", "question__hide": false, - "total_acs": 11100, - "total_submitted": 20898, - "total_column_articles": 118, + "total_acs": 11230, + "total_submitted": 21152, + "total_column_articles": 120, "frontend_question_id": "795", "is_new_question": false }, @@ -39723,9 +40017,9 @@ "question__title": "Valid Tic-Tac-Toe State", "question__title_slug": "valid-tic-tac-toe-state", "question__hide": false, - "total_acs": 29563, - "total_submitted": 76024, - "total_column_articles": 474, + "total_acs": 29619, + "total_submitted": 76160, + "total_column_articles": 475, "frontend_question_id": "794", "is_new_question": false }, @@ -39744,9 +40038,9 @@ "question__title": "Preimage Size of Factorial Zeroes Function", "question__title_slug": "preimage-size-of-factorial-zeroes-function", "question__hide": false, - "total_acs": 8315, - "total_submitted": 20443, - "total_column_articles": 101, + "total_acs": 8531, + "total_submitted": 20919, + "total_column_articles": 104, "frontend_question_id": "793", "is_new_question": false }, @@ -39765,9 +40059,9 @@ "question__title": "Number of Matching Subsequences", "question__title_slug": "number-of-matching-subsequences", "question__hide": false, - "total_acs": 11494, - "total_submitted": 24434, - "total_column_articles": 126, + "total_acs": 11575, + "total_submitted": 24596, + "total_column_articles": 127, "frontend_question_id": "792", "is_new_question": false }, @@ -39786,9 +40080,9 @@ "question__title": "Custom Sort String", "question__title_slug": "custom-sort-string", "question__hide": false, - "total_acs": 14247, - "total_submitted": 20413, - "total_column_articles": 253, + "total_acs": 14373, + "total_submitted": 20581, + "total_column_articles": 255, "frontend_question_id": "791", "is_new_question": false }, @@ -39807,8 +40101,8 @@ "question__title": "Domino and Tromino Tiling", "question__title_slug": "domino-and-tromino-tiling", "question__hide": false, - "total_acs": 5319, - "total_submitted": 11465, + "total_acs": 5368, + "total_submitted": 11568, "total_column_articles": 88, "frontend_question_id": "790", "is_new_question": false @@ -39828,9 +40122,9 @@ "question__title": "Escape The Ghosts", "question__title_slug": "escape-the-ghosts", "question__hide": false, - "total_acs": 21978, - "total_submitted": 31939, - "total_column_articles": 312, + "total_acs": 22057, + "total_submitted": 32063, + "total_column_articles": 313, "frontend_question_id": "789", "is_new_question": false }, @@ -39849,9 +40143,9 @@ "question__title": "Rotated Digits", "question__title_slug": "rotated-digits", "question__hide": false, - "total_acs": 20103, - "total_submitted": 32817, - "total_column_articles": 213, + "total_acs": 20157, + "total_submitted": 32908, + "total_column_articles": 215, "frontend_question_id": "788", "is_new_question": false }, @@ -39870,9 +40164,9 @@ "question__title": "Cheapest Flights Within K Stops", "question__title_slug": "cheapest-flights-within-k-stops", "question__hide": false, - "total_acs": 53742, - "total_submitted": 137716, - "total_column_articles": 497, + "total_acs": 54279, + "total_submitted": 138945, + "total_column_articles": 498, "frontend_question_id": "787", "is_new_question": false }, @@ -39891,15 +40185,15 @@ "question__title": "K-th Smallest Prime Fraction", "question__title_slug": "k-th-smallest-prime-fraction", "question__hide": false, - "total_acs": 27726, - "total_submitted": 40822, - "total_column_articles": 277, + "total_acs": 27907, + "total_submitted": 41133, + "total_column_articles": 281, "frontend_question_id": "786", "is_new_question": false }, "status": null, "difficulty": { - "level": 3 + "level": 2 }, "paid_only": false, "is_favor": false, @@ -39912,9 +40206,9 @@ "question__title": "Is Graph Bipartite?", "question__title_slug": "is-graph-bipartite", "question__hide": false, - "total_acs": 58140, - "total_submitted": 109410, - "total_column_articles": 1055, + "total_acs": 58927, + "total_submitted": 110798, + "total_column_articles": 1087, "frontend_question_id": "785", "is_new_question": false }, @@ -39933,9 +40227,9 @@ "question__title": "Letter Case Permutation", "question__title_slug": "letter-case-permutation", "question__hide": false, - "total_acs": 66377, - "total_submitted": 94770, - "total_column_articles": 773, + "total_acs": 67032, + "total_submitted": 95627, + "total_column_articles": 776, "frontend_question_id": "784", "is_new_question": false }, @@ -39954,9 +40248,9 @@ "question__title": "Minimum Distance Between BST Nodes", "question__title_slug": "minimum-distance-between-bst-nodes", "question__hide": false, - "total_acs": 77555, - "total_submitted": 129500, - "total_column_articles": 750, + "total_acs": 77859, + "total_submitted": 129991, + "total_column_articles": 753, "frontend_question_id": "783", "is_new_question": false }, @@ -39975,9 +40269,9 @@ "question__title": "Transform to Chessboard", "question__title_slug": "transform-to-chessboard", "question__hide": false, - "total_acs": 1869, - "total_submitted": 4435, - "total_column_articles": 38, + "total_acs": 1886, + "total_submitted": 4483, + "total_column_articles": 39, "frontend_question_id": "782", "is_new_question": false }, @@ -39996,9 +40290,9 @@ "question__title": "Rabbits in Forest", "question__title_slug": "rabbits-in-forest", "question__hide": false, - "total_acs": 48847, - "total_submitted": 80967, - "total_column_articles": 726, + "total_acs": 49134, + "total_submitted": 81519, + "total_column_articles": 728, "frontend_question_id": "781", "is_new_question": false }, @@ -40017,8 +40311,8 @@ "question__title": "Reaching Points", "question__title_slug": "reaching-points", "question__hide": false, - "total_acs": 24672, - "total_submitted": 65104, + "total_acs": 24727, + "total_submitted": 65294, "total_column_articles": 254, "frontend_question_id": "780", "is_new_question": false @@ -40038,9 +40332,9 @@ "question__title": "K-th Symbol in Grammar", "question__title_slug": "k-th-symbol-in-grammar", "question__hide": false, - "total_acs": 20972, - "total_submitted": 47887, - "total_column_articles": 265, + "total_acs": 21093, + "total_submitted": 48143, + "total_column_articles": 269, "frontend_question_id": "779", "is_new_question": false }, @@ -40059,8 +40353,8 @@ "question__title": "Swim in Rising Water", "question__title_slug": "swim-in-rising-water", "question__hide": false, - "total_acs": 27897, - "total_submitted": 47395, + "total_acs": 28125, + "total_submitted": 47801, "total_column_articles": 390, "frontend_question_id": "778", "is_new_question": false @@ -40080,9 +40374,9 @@ "question__title": "Swap Adjacent in LR String", "question__title_slug": "swap-adjacent-in-lr-string", "question__hide": false, - "total_acs": 6722, - "total_submitted": 20674, - "total_column_articles": 76, + "total_acs": 6765, + "total_submitted": 20793, + "total_column_articles": 77, "frontend_question_id": "777", "is_new_question": false }, @@ -40101,9 +40395,9 @@ "question__title": "Binary Search", "question__title_slug": "binary-search", "question__hide": false, - "total_acs": 634041, - "total_submitted": 1165106, - "total_column_articles": 3284, + "total_acs": 648114, + "total_submitted": 1190674, + "total_column_articles": 3347, "frontend_question_id": "704", "is_new_question": false }, @@ -40122,9 +40416,9 @@ "question__title": "Split BST", "question__title_slug": "split-bst", "question__hide": false, - "total_acs": 2191, - "total_submitted": 3758, - "total_column_articles": 42, + "total_acs": 2220, + "total_submitted": 3792, + "total_column_articles": 43, "frontend_question_id": "776", "is_new_question": false }, @@ -40143,8 +40437,8 @@ "question__title": "Global and Local Inversions", "question__title_slug": "global-and-local-inversions", "question__hide": false, - "total_acs": 6193, - "total_submitted": 13536, + "total_acs": 6257, + "total_submitted": 13661, "total_column_articles": 99, "frontend_question_id": "775", "is_new_question": false @@ -40164,9 +40458,9 @@ "question__title": "Kth Largest Element in a Stream", "question__title_slug": "kth-largest-element-in-a-stream", "question__hide": false, - "total_acs": 74431, - "total_submitted": 142958, - "total_column_articles": 701, + "total_acs": 74996, + "total_submitted": 143977, + "total_column_articles": 707, "frontend_question_id": "703", "is_new_question": false }, @@ -40185,9 +40479,9 @@ "question__title": "Minimize Max Distance to Gas Station", "question__title_slug": "minimize-max-distance-to-gas-station", "question__hide": false, - "total_acs": 1655, - "total_submitted": 2664, - "total_column_articles": 28, + "total_acs": 1701, + "total_submitted": 2726, + "total_column_articles": 30, "frontend_question_id": "774", "is_new_question": false }, @@ -40206,9 +40500,9 @@ "question__title": "Sliding Puzzle", "question__title_slug": "sliding-puzzle", "question__hide": false, - "total_acs": 28584, - "total_submitted": 40530, - "total_column_articles": 407, + "total_acs": 28853, + "total_submitted": 40943, + "total_column_articles": 413, "frontend_question_id": "773", "is_new_question": false }, @@ -40227,9 +40521,9 @@ "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": 6270, - "total_submitted": 8438, - "total_column_articles": 106, + "total_acs": 6328, + "total_submitted": 8516, + "total_column_articles": 107, "frontend_question_id": "702", "is_new_question": false }, @@ -40248,9 +40542,9 @@ "question__title": "Basic Calculator III", "question__title_slug": "basic-calculator-iii", "question__hide": false, - "total_acs": 9324, - "total_submitted": 18231, - "total_column_articles": 162, + "total_acs": 9490, + "total_submitted": 18502, + "total_column_articles": 163, "frontend_question_id": "772", "is_new_question": false }, @@ -40269,9 +40563,9 @@ "question__title": "Insert into a Binary Search Tree", "question__title_slug": "insert-into-a-binary-search-tree", "question__hide": false, - "total_acs": 130233, - "total_submitted": 181204, - "total_column_articles": 997, + "total_acs": 132561, + "total_submitted": 184553, + "total_column_articles": 1001, "frontend_question_id": "701", "is_new_question": false }, @@ -40290,9 +40584,9 @@ "question__title": "Search in a Binary Search Tree", "question__title_slug": "search-in-a-binary-search-tree", "question__hide": false, - "total_acs": 177119, - "total_submitted": 228576, - "total_column_articles": 1302, + "total_acs": 179861, + "total_submitted": 232101, + "total_column_articles": 1313, "frontend_question_id": "700", "is_new_question": false }, @@ -40311,9 +40605,9 @@ "question__title": "Jewels and Stones", "question__title_slug": "jewels-and-stones", "question__hide": false, - "total_acs": 167050, - "total_submitted": 196065, - "total_column_articles": 1279, + "total_acs": 167622, + "total_submitted": 196759, + "total_column_articles": 1284, "frontend_question_id": "771", "is_new_question": false }, @@ -40332,9 +40626,9 @@ "question__title": "Basic Calculator IV", "question__title_slug": "basic-calculator-iv", "question__hide": false, - "total_acs": 1493, - "total_submitted": 2647, - "total_column_articles": 31, + "total_acs": 1509, + "total_submitted": 2674, + "total_column_articles": 32, "frontend_question_id": "770", "is_new_question": false }, @@ -40353,9 +40647,9 @@ "question__title": "Max Chunks To Make Sorted", "question__title_slug": "max-chunks-to-make-sorted", "question__hide": false, - "total_acs": 17701, - "total_submitted": 30272, - "total_column_articles": 229, + "total_acs": 17886, + "total_submitted": 30571, + "total_column_articles": 234, "frontend_question_id": "769", "is_new_question": false }, @@ -40374,9 +40668,9 @@ "question__title": "Max Chunks To Make Sorted II", "question__title_slug": "max-chunks-to-make-sorted-ii", "question__hide": false, - "total_acs": 7648, - "total_submitted": 14664, - "total_column_articles": 107, + "total_acs": 7745, + "total_submitted": 14829, + "total_column_articles": 110, "frontend_question_id": "768", "is_new_question": false }, @@ -40395,9 +40689,9 @@ "question__title": "Reorganize String", "question__title_slug": "reorganize-string", "question__hide": false, - "total_acs": 45706, - "total_submitted": 95032, - "total_column_articles": 543, + "total_acs": 46120, + "total_submitted": 95857, + "total_column_articles": 544, "frontend_question_id": "767", "is_new_question": false }, @@ -40416,9 +40710,9 @@ "question__title": "Toeplitz Matrix", "question__title_slug": "toeplitz-matrix", "question__hide": false, - "total_acs": 61266, - "total_submitted": 86826, - "total_column_articles": 699, + "total_acs": 61469, + "total_submitted": 87129, + "total_column_articles": 702, "frontend_question_id": "766", "is_new_question": false }, @@ -40437,9 +40731,9 @@ "question__title": "N-ary Tree Postorder Traversal", "question__title_slug": "n-ary-tree-postorder-traversal", "question__hide": false, - "total_acs": 108920, - "total_submitted": 139640, - "total_column_articles": 821, + "total_acs": 109700, + "total_submitted": 140557, + "total_column_articles": 822, "frontend_question_id": "590", "is_new_question": false }, @@ -40458,9 +40752,9 @@ "question__title": "N-ary Tree Preorder Traversal", "question__title_slug": "n-ary-tree-preorder-traversal", "question__hide": false, - "total_acs": 149231, - "total_submitted": 195830, - "total_column_articles": 964, + "total_acs": 150704, + "total_submitted": 197727, + "total_column_articles": 966, "frontend_question_id": "589", "is_new_question": false }, @@ -40479,9 +40773,9 @@ "question__title": "Maximum Depth of N-ary Tree", "question__title_slug": "maximum-depth-of-n-ary-tree", "question__hide": false, - "total_acs": 112517, - "total_submitted": 151036, - "total_column_articles": 914, + "total_acs": 113848, + "total_submitted": 152731, + "total_column_articles": 918, "frontend_question_id": "559", "is_new_question": false }, @@ -40500,9 +40794,9 @@ "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": 3597, - "total_submitted": 7028, - "total_column_articles": 50, + "total_acs": 3629, + "total_submitted": 7077, + "total_column_articles": 51, "frontend_question_id": "558", "is_new_question": false }, @@ -40521,9 +40815,9 @@ "question__title": "Construct Quad Tree", "question__title_slug": "construct-quad-tree", "question__hide": false, - "total_acs": 23194, - "total_submitted": 32517, - "total_column_articles": 306, + "total_acs": 23236, + "total_submitted": 32577, + "total_column_articles": 305, "frontend_question_id": "427", "is_new_question": false }, @@ -40542,9 +40836,9 @@ "question__title": "Encode N-ary Tree to Binary Tree", "question__title_slug": "encode-n-ary-tree-to-binary-tree", "question__hide": false, - "total_acs": 1353, - "total_submitted": 1831, - "total_column_articles": 37, + "total_acs": 1408, + "total_submitted": 1894, + "total_column_articles": 38, "frontend_question_id": "431", "is_new_question": false }, @@ -40563,9 +40857,9 @@ "question__title": "Couples Holding Hands", "question__title_slug": "couples-holding-hands", "question__hide": false, - "total_acs": 32888, - "total_submitted": 49610, - "total_column_articles": 500, + "total_acs": 33034, + "total_submitted": 49936, + "total_column_articles": 502, "frontend_question_id": "765", "is_new_question": false }, @@ -40584,8 +40878,8 @@ "question__title": "Largest Plus Sign", "question__title_slug": "largest-plus-sign", "question__hide": false, - "total_acs": 5175, - "total_submitted": 10476, + "total_acs": 5254, + "total_submitted": 10608, "total_column_articles": 69, "frontend_question_id": "764", "is_new_question": false @@ -40605,9 +40899,9 @@ "question__title": "Partition Labels", "question__title_slug": "partition-labels", "question__hide": false, - "total_acs": 119342, - "total_submitted": 155469, - "total_column_articles": 1271, + "total_acs": 121108, + "total_submitted": 157834, + "total_column_articles": 1283, "frontend_question_id": "763", "is_new_question": false }, @@ -40626,9 +40920,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": 51894, - "total_submitted": 68569, - "total_column_articles": 453, + "total_acs": 52020, + "total_submitted": 68736, + "total_column_articles": 452, "frontend_question_id": "762", "is_new_question": false }, @@ -40647,9 +40941,9 @@ "question__title": "Flatten a Multilevel Doubly Linked List", "question__title_slug": "flatten-a-multilevel-doubly-linked-list", "question__hide": false, - "total_acs": 52405, - "total_submitted": 88537, - "total_column_articles": 766, + "total_acs": 52815, + "total_submitted": 89230, + "total_column_articles": 773, "frontend_question_id": "430", "is_new_question": false }, @@ -40668,9 +40962,9 @@ "question__title": "Serialize and Deserialize N-ary Tree", "question__title_slug": "serialize-and-deserialize-n-ary-tree", "question__hide": false, - "total_acs": 4145, - "total_submitted": 6130, - "total_column_articles": 71, + "total_acs": 4194, + "total_submitted": 6211, + "total_column_articles": 72, "frontend_question_id": "428", "is_new_question": false }, @@ -40689,9 +40983,9 @@ "question__title": "N-ary Tree Level Order Traversal", "question__title_slug": "n-ary-tree-level-order-traversal", "question__hide": false, - "total_acs": 118813, - "total_submitted": 165101, - "total_column_articles": 954, + "total_acs": 120240, + "total_submitted": 166969, + "total_column_articles": 957, "frontend_question_id": "429", "is_new_question": false }, @@ -40710,8 +41004,8 @@ "question__title": "Special Binary String", "question__title_slug": "special-binary-string", "question__hide": false, - "total_acs": 2519, - "total_submitted": 4223, + "total_acs": 2560, + "total_submitted": 4290, "total_column_articles": 39, "frontend_question_id": "761", "is_new_question": false @@ -40731,8 +41025,8 @@ "question__title": "Find Anagram Mappings", "question__title_slug": "find-anagram-mappings", "question__hide": false, - "total_acs": 4807, - "total_submitted": 5746, + "total_acs": 4833, + "total_submitted": 5776, "total_column_articles": 111, "frontend_question_id": "760", "is_new_question": false @@ -40752,9 +41046,9 @@ "question__title": "Employee Free Time", "question__title_slug": "employee-free-time", "question__hide": false, - "total_acs": 3125, - "total_submitted": 4536, - "total_column_articles": 62, + "total_acs": 3218, + "total_submitted": 4656, + "total_column_articles": 66, "frontend_question_id": "759", "is_new_question": false }, @@ -40773,8 +41067,8 @@ "question__title": "Bold Words in String", "question__title_slug": "bold-words-in-string", "question__hide": false, - "total_acs": 3953, - "total_submitted": 8259, + "total_acs": 3975, + "total_submitted": 8302, "total_column_articles": 76, "frontend_question_id": "758", "is_new_question": false @@ -40794,9 +41088,9 @@ "question__title": "Set Intersection Size At Least Two", "question__title_slug": "set-intersection-size-at-least-two", "question__hide": false, - "total_acs": 3027, - "total_submitted": 6993, - "total_column_articles": 44, + "total_acs": 3096, + "total_submitted": 7103, + "total_column_articles": 47, "frontend_question_id": "757", "is_new_question": false }, @@ -40815,9 +41109,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": 10833, - "total_submitted": 15964, - "total_column_articles": 167, + "total_acs": 11002, + "total_submitted": 16219, + "total_column_articles": 169, "frontend_question_id": "426", "is_new_question": false }, @@ -40836,8 +41130,8 @@ "question__title": "Pyramid Transition Matrix", "question__title_slug": "pyramid-transition-matrix", "question__hide": false, - "total_acs": 5540, - "total_submitted": 10179, + "total_acs": 5562, + "total_submitted": 10226, "total_column_articles": 88, "frontend_question_id": "756", "is_new_question": false @@ -40857,9 +41151,9 @@ "question__title": "Pour Water", "question__title_slug": "pour-water", "question__hide": false, - "total_acs": 1603, - "total_submitted": 3262, - "total_column_articles": 36, + "total_acs": 1620, + "total_submitted": 3305, + "total_column_articles": 37, "frontend_question_id": "755", "is_new_question": false }, @@ -40878,8 +41172,8 @@ "question__title": "Reach a Number", "question__title_slug": "reach-a-number", "question__hide": false, - "total_acs": 10355, - "total_submitted": 23386, + "total_acs": 10432, + "total_submitted": 23552, "total_column_articles": 123, "frontend_question_id": "754", "is_new_question": false @@ -40899,8 +41193,8 @@ "question__title": "Cracking the Safe", "question__title_slug": "cracking-the-safe", "question__hide": false, - "total_acs": 4381, - "total_submitted": 7191, + "total_acs": 4417, + "total_submitted": 7240, "total_column_articles": 60, "frontend_question_id": "753", "is_new_question": false @@ -40920,9 +41214,9 @@ "question__title": "Open the Lock", "question__title_slug": "open-the-lock", "question__hide": false, - "total_acs": 94414, - "total_submitted": 178416, - "total_column_articles": 953, + "total_acs": 95504, + "total_submitted": 180513, + "total_column_articles": 967, "frontend_question_id": "752", "is_new_question": false }, @@ -40941,8 +41235,8 @@ "question__title": "IP to CIDR", "question__title_slug": "ip-to-cidr", "question__hide": false, - "total_acs": 1608, - "total_submitted": 3361, + "total_acs": 1616, + "total_submitted": 3381, "total_column_articles": 31, "frontend_question_id": "751", "is_new_question": false @@ -40962,8 +41256,8 @@ "question__title": "Number Of Corner Rectangles", "question__title_slug": "number-of-corner-rectangles", "question__hide": false, - "total_acs": 2708, - "total_submitted": 3762, + "total_acs": 2727, + "total_submitted": 3783, "total_column_articles": 48, "frontend_question_id": "750", "is_new_question": false @@ -40983,8 +41277,8 @@ "question__title": "Contain Virus", "question__title_slug": "contain-virus", "question__hide": false, - "total_acs": 2024, - "total_submitted": 4015, + "total_acs": 2048, + "total_submitted": 4053, "total_column_articles": 47, "frontend_question_id": "749", "is_new_question": false @@ -41004,8 +41298,8 @@ "question__title": "Shortest Completing Word", "question__title_slug": "shortest-completing-word", "question__hide": false, - "total_acs": 42041, - "total_submitted": 62071, + "total_acs": 42168, + "total_submitted": 62289, "total_column_articles": 518, "frontend_question_id": "748", "is_new_question": false @@ -41025,9 +41319,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": 83741, - "total_submitted": 182440, - "total_column_articles": 841, + "total_acs": 83977, + "total_submitted": 182886, + "total_column_articles": 844, "frontend_question_id": "747", "is_new_question": false }, @@ -41046,9 +41340,9 @@ "question__title": "Min Cost Climbing Stairs", "question__title_slug": "min-cost-climbing-stairs", "question__hide": false, - "total_acs": 218803, - "total_submitted": 352103, - "total_column_articles": 1863, + "total_acs": 221693, + "total_submitted": 356127, + "total_column_articles": 1896, "frontend_question_id": "746", "is_new_question": false }, @@ -41067,9 +41361,9 @@ "question__title": "Prefix and Suffix Search", "question__title_slug": "prefix-and-suffix-search", "question__hide": false, - "total_acs": 4050, - "total_submitted": 9886, - "total_column_articles": 74, + "total_acs": 4165, + "total_submitted": 10090, + "total_column_articles": 78, "frontend_question_id": "745", "is_new_question": false }, @@ -41088,9 +41382,9 @@ "question__title": "Find Smallest Letter Greater Than Target", "question__title_slug": "find-smallest-letter-greater-than-target", "question__hide": false, - "total_acs": 91078, - "total_submitted": 185624, - "total_column_articles": 798, + "total_acs": 92160, + "total_submitted": 188240, + "total_column_articles": 804, "frontend_question_id": "744", "is_new_question": false }, @@ -41109,9 +41403,9 @@ "question__title": "Network Delay Time", "question__title_slug": "network-delay-time", "question__hide": false, - "total_acs": 80813, - "total_submitted": 148623, - "total_column_articles": 681, + "total_acs": 81695, + "total_submitted": 150056, + "total_column_articles": 685, "frontend_question_id": "743", "is_new_question": false }, @@ -41130,9 +41424,9 @@ "question__title": "Closest Leaf in a Binary Tree", "question__title_slug": "closest-leaf-in-a-binary-tree", "question__hide": false, - "total_acs": 2093, - "total_submitted": 4309, - "total_column_articles": 69, + "total_acs": 2119, + "total_submitted": 4363, + "total_column_articles": 70, "frontend_question_id": "742", "is_new_question": false }, @@ -41151,9 +41445,9 @@ "question__title": "To Lower Case", "question__title_slug": "to-lower-case", "question__hide": false, - "total_acs": 108446, - "total_submitted": 140261, - "total_column_articles": 797, + "total_acs": 109030, + "total_submitted": 141012, + "total_column_articles": 798, "frontend_question_id": "709", "is_new_question": false }, @@ -41172,8 +41466,8 @@ "question__title": "Cherry Pickup", "question__title_slug": "cherry-pickup", "question__hide": false, - "total_acs": 5381, - "total_submitted": 13970, + "total_acs": 5437, + "total_submitted": 14133, "total_column_articles": 64, "frontend_question_id": "741", "is_new_question": false @@ -41193,9 +41487,9 @@ "question__title": "Delete and Earn", "question__title_slug": "delete-and-earn", "question__hide": false, - "total_acs": 80463, - "total_submitted": 128278, - "total_column_articles": 822, + "total_acs": 80986, + "total_submitted": 129116, + "total_column_articles": 825, "frontend_question_id": "740", "is_new_question": false }, @@ -41214,9 +41508,9 @@ "question__title": "Daily Temperatures", "question__title_slug": "daily-temperatures", "question__hide": false, - "total_acs": 311472, - "total_submitted": 449716, - "total_column_articles": 2106, + "total_acs": 316302, + "total_submitted": 456486, + "total_column_articles": 2139, "frontend_question_id": "739", "is_new_question": false }, @@ -41235,9 +41529,9 @@ "question__title": "Monotone Increasing Digits", "question__title_slug": "monotone-increasing-digits", "question__hide": false, - "total_acs": 61733, - "total_submitted": 123176, - "total_column_articles": 744, + "total_acs": 62742, + "total_submitted": 125128, + "total_column_articles": 757, "frontend_question_id": "738", "is_new_question": false }, @@ -41256,9 +41550,9 @@ "question__title": "Sentence Similarity II", "question__title_slug": "sentence-similarity-ii", "question__hide": false, - "total_acs": 5074, - "total_submitted": 10674, - "total_column_articles": 94, + "total_acs": 5120, + "total_submitted": 10793, + "total_column_articles": 93, "frontend_question_id": "737", "is_new_question": false }, @@ -41277,9 +41571,9 @@ "question__title": "Parse Lisp Expression", "question__title_slug": "parse-lisp-expression", "question__hide": false, - "total_acs": 1916, - "total_submitted": 4043, - "total_column_articles": 57, + "total_acs": 1975, + "total_submitted": 4137, + "total_column_articles": 58, "frontend_question_id": "736", "is_new_question": false }, @@ -41298,9 +41592,9 @@ "question__title": "Asteroid Collision", "question__title_slug": "asteroid-collision", "question__hide": false, - "total_acs": 30551, - "total_submitted": 73941, - "total_column_articles": 367, + "total_acs": 31049, + "total_submitted": 75064, + "total_column_articles": 374, "frontend_question_id": "735", "is_new_question": false }, @@ -41319,9 +41613,9 @@ "question__title": "Sentence Similarity", "question__title_slug": "sentence-similarity", "question__hide": false, - "total_acs": 2751, - "total_submitted": 5771, - "total_column_articles": 54, + "total_acs": 2773, + "total_submitted": 5820, + "total_column_articles": 53, "frontend_question_id": "734", "is_new_question": false }, @@ -41340,9 +41634,9 @@ "question__title": "Flood Fill", "question__title_slug": "flood-fill", "question__hide": false, - "total_acs": 115919, - "total_submitted": 199295, - "total_column_articles": 994, + "total_acs": 117466, + "total_submitted": 202005, + "total_column_articles": 1002, "frontend_question_id": "733", "is_new_question": false }, @@ -41361,9 +41655,9 @@ "question__title": "My Calendar III", "question__title_slug": "my-calendar-iii", "question__hide": false, - "total_acs": 19946, - "total_submitted": 27317, - "total_column_articles": 202, + "total_acs": 20458, + "total_submitted": 28118, + "total_column_articles": 207, "frontend_question_id": "732", "is_new_question": false }, @@ -41382,9 +41676,9 @@ "question__title": "My Calendar II", "question__title_slug": "my-calendar-ii", "question__hide": false, - "total_acs": 7438, - "total_submitted": 13775, - "total_column_articles": 81, + "total_acs": 7733, + "total_submitted": 14255, + "total_column_articles": 82, "frontend_question_id": "731", "is_new_question": false }, @@ -41403,9 +41697,9 @@ "question__title": "Count Different Palindromic Subsequences", "question__title_slug": "count-different-palindromic-subsequences", "question__hide": false, - "total_acs": 16220, - "total_submitted": 25060, - "total_column_articles": 110, + "total_acs": 16394, + "total_submitted": 25353, + "total_column_articles": 112, "frontend_question_id": "730", "is_new_question": false }, @@ -41424,9 +41718,9 @@ "question__title": "My Calendar I", "question__title_slug": "my-calendar-i", "question__hide": false, - "total_acs": 16769, - "total_submitted": 30320, - "total_column_articles": 194, + "total_acs": 17251, + "total_submitted": 31187, + "total_column_articles": 203, "frontend_question_id": "729", "is_new_question": false }, @@ -41445,9 +41739,9 @@ "question__title": "Self Dividing Numbers", "question__title_slug": "self-dividing-numbers", "question__hide": false, - "total_acs": 71656, - "total_submitted": 90867, - "total_column_articles": 666, + "total_acs": 71829, + "total_submitted": 91120, + "total_column_articles": 667, "frontend_question_id": "728", "is_new_question": false }, @@ -41466,9 +41760,9 @@ "question__title": "Minimum Window Subsequence", "question__title_slug": "minimum-window-subsequence", "question__hide": false, - "total_acs": 4550, - "total_submitted": 11060, - "total_column_articles": 65, + "total_acs": 4623, + "total_submitted": 11187, + "total_column_articles": 66, "frontend_question_id": "727", "is_new_question": false }, @@ -41487,8 +41781,8 @@ "question__title": "Number of Atoms", "question__title_slug": "number-of-atoms", "question__hide": false, - "total_acs": 24325, - "total_submitted": 44096, + "total_acs": 24416, + "total_submitted": 44293, "total_column_articles": 438, "frontend_question_id": "726", "is_new_question": false @@ -41508,9 +41802,9 @@ "question__title": "Split Linked List in Parts", "question__title_slug": "split-linked-list-in-parts", "question__hide": false, - "total_acs": 54800, - "total_submitted": 90311, - "total_column_articles": 685, + "total_acs": 55016, + "total_submitted": 90799, + "total_column_articles": 691, "frontend_question_id": "725", "is_new_question": false }, @@ -41529,9 +41823,9 @@ "question__title": "Find Pivot Index", "question__title_slug": "find-pivot-index", "question__hide": false, - "total_acs": 187728, - "total_submitted": 383088, - "total_column_articles": 1080, + "total_acs": 192367, + "total_submitted": 390916, + "total_column_articles": 1109, "frontend_question_id": "724", "is_new_question": false }, @@ -41550,8 +41844,8 @@ "question__title": "Candy Crush", "question__title_slug": "candy-crush", "question__hide": false, - "total_acs": 1784, - "total_submitted": 2428, + "total_acs": 1795, + "total_submitted": 2443, "total_column_articles": 46, "frontend_question_id": "723", "is_new_question": false @@ -41571,8 +41865,8 @@ "question__title": "Remove Comments", "question__title_slug": "remove-comments", "question__hide": false, - "total_acs": 6351, - "total_submitted": 19384, + "total_acs": 6413, + "total_submitted": 19592, "total_column_articles": 87, "frontend_question_id": "722", "is_new_question": false @@ -41592,9 +41886,9 @@ "question__title": "Accounts Merge", "question__title_slug": "accounts-merge", "question__hide": false, - "total_acs": 33670, - "total_submitted": 70814, - "total_column_articles": 375, + "total_acs": 33916, + "total_submitted": 71281, + "total_column_articles": 376, "frontend_question_id": "721", "is_new_question": false }, @@ -41613,9 +41907,9 @@ "question__title": "Longest Word in Dictionary", "question__title_slug": "longest-word-in-dictionary", "question__hide": false, - "total_acs": 59627, - "total_submitted": 115002, - "total_column_articles": 648, + "total_acs": 60153, + "total_submitted": 116084, + "total_column_articles": 655, "frontend_question_id": "720", "is_new_question": false }, @@ -41634,9 +41928,9 @@ "question__title": "Find K-th Smallest Pair Distance", "question__title_slug": "find-k-th-smallest-pair-distance", "question__hide": false, - "total_acs": 29387, - "total_submitted": 63407, - "total_column_articles": 248, + "total_acs": 29936, + "total_submitted": 64531, + "total_column_articles": 252, "frontend_question_id": "719", "is_new_question": false }, @@ -41655,9 +41949,9 @@ "question__title": "Maximum Length of Repeated Subarray", "question__title_slug": "maximum-length-of-repeated-subarray", "question__hide": false, - "total_acs": 131131, - "total_submitted": 230562, - "total_column_articles": 809, + "total_acs": 133609, + "total_submitted": 234818, + "total_column_articles": 815, "frontend_question_id": "718", "is_new_question": false }, @@ -41676,9 +41970,9 @@ "question__title": "1-bit and 2-bit Characters", "question__title_slug": "1-bit-and-2-bit-characters", "question__hide": false, - "total_acs": 62788, - "total_submitted": 113183, - "total_column_articles": 755, + "total_acs": 62994, + "total_submitted": 113604, + "total_column_articles": 756, "frontend_question_id": "717", "is_new_question": false }, @@ -41697,15 +41991,15 @@ "question__title": "Max Stack", "question__title_slug": "max-stack", "question__hide": false, - "total_acs": 6080, - "total_submitted": 12821, - "total_column_articles": 99, + "total_acs": 6154, + "total_submitted": 12976, + "total_column_articles": 100, "frontend_question_id": "716", "is_new_question": false }, "status": null, "difficulty": { - "level": 1 + "level": 3 }, "paid_only": true, "is_favor": false, @@ -41718,9 +42012,9 @@ "question__title": "Range Module", "question__title_slug": "range-module", "question__hide": false, - "total_acs": 4479, - "total_submitted": 10153, - "total_column_articles": 85, + "total_acs": 16377, + "total_submitted": 30517, + "total_column_articles": 176, "frontend_question_id": "715", "is_new_question": false }, @@ -41739,9 +42033,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": 154872, - "total_submitted": 209107, - "total_column_articles": 1010, + "total_acs": 157375, + "total_submitted": 212373, + "total_column_articles": 1022, "frontend_question_id": "714", "is_new_question": false }, @@ -41760,9 +42054,9 @@ "question__title": "Subarray Product Less Than K", "question__title_slug": "subarray-product-less-than-k", "question__hide": false, - "total_acs": 78736, - "total_submitted": 161731, - "total_column_articles": 730, + "total_acs": 79628, + "total_submitted": 163405, + "total_column_articles": 736, "frontend_question_id": "713", "is_new_question": false }, @@ -41781,9 +42075,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": 22693, - "total_submitted": 33379, - "total_column_articles": 251, + "total_acs": 23080, + "total_submitted": 33904, + "total_column_articles": 257, "frontend_question_id": "712", "is_new_question": false }, @@ -41802,8 +42096,8 @@ "question__title": "Number of Distinct Islands II", "question__title_slug": "number-of-distinct-islands-ii", "question__hide": false, - "total_acs": 1070, - "total_submitted": 1876, + "total_acs": 1086, + "total_submitted": 1900, "total_column_articles": 33, "frontend_question_id": "711", "is_new_question": false @@ -41823,9 +42117,9 @@ "question__title": "Falling Squares", "question__title_slug": "falling-squares", "question__hide": false, - "total_acs": 20081, - "total_submitted": 36303, - "total_column_articles": 200, + "total_acs": 20254, + "total_submitted": 36726, + "total_column_articles": 203, "frontend_question_id": "699", "is_new_question": false }, @@ -41844,9 +42138,9 @@ "question__title": "Partition to K Equal Sum Subsets", "question__title_slug": "partition-to-k-equal-sum-subsets", "question__hide": false, - "total_acs": 51863, - "total_submitted": 124275, - "total_column_articles": 865, + "total_acs": 53050, + "total_submitted": 127378, + "total_column_articles": 890, "frontend_question_id": "698", "is_new_question": false }, @@ -41865,9 +42159,9 @@ "question__title": "Degree of an Array", "question__title_slug": "degree-of-an-array", "question__hide": false, - "total_acs": 76944, - "total_submitted": 128032, - "total_column_articles": 966, + "total_acs": 77366, + "total_submitted": 128751, + "total_column_articles": 968, "frontend_question_id": "697", "is_new_question": false }, @@ -41886,9 +42180,9 @@ "question__title": "Count Binary Substrings", "question__title_slug": "count-binary-substrings", "question__hide": false, - "total_acs": 60836, - "total_submitted": 95480, - "total_column_articles": 548, + "total_acs": 61149, + "total_submitted": 95956, + "total_column_articles": 549, "frontend_question_id": "696", "is_new_question": false }, @@ -41907,9 +42201,9 @@ "question__title": "Max Area of Island", "question__title_slug": "max-area-of-island", "question__hide": false, - "total_acs": 212577, - "total_submitted": 314003, - "total_column_articles": 2057, + "total_acs": 215665, + "total_submitted": 318595, + "total_column_articles": 2080, "frontend_question_id": "695", "is_new_question": false }, @@ -41928,9 +42222,9 @@ "question__title": "Number of Distinct Islands", "question__title_slug": "number-of-distinct-islands", "question__hide": false, - "total_acs": 7489, - "total_submitted": 13426, - "total_column_articles": 136, + "total_acs": 7619, + "total_submitted": 13638, + "total_column_articles": 140, "frontend_question_id": "694", "is_new_question": false }, @@ -41949,9 +42243,9 @@ "question__title": "Binary Number with Alternating Bits", "question__title_slug": "binary-number-with-alternating-bits", "question__hide": false, - "total_acs": 69701, - "total_submitted": 106632, - "total_column_articles": 753, + "total_acs": 70009, + "total_submitted": 107088, + "total_column_articles": 754, "frontend_question_id": "693", "is_new_question": false }, @@ -41970,9 +42264,9 @@ "question__title": "Top K Frequent Words", "question__title_slug": "top-k-frequent-words", "question__hide": false, - "total_acs": 83488, - "total_submitted": 147022, - "total_column_articles": 902, + "total_acs": 84175, + "total_submitted": 148286, + "total_column_articles": 907, "frontend_question_id": "692", "is_new_question": false }, @@ -41991,9 +42285,9 @@ "question__title": "Stickers to Spell Word", "question__title_slug": "stickers-to-spell-word", "question__hide": false, - "total_acs": 20803, - "total_submitted": 33651, - "total_column_articles": 178, + "total_acs": 20896, + "total_submitted": 33877, + "total_column_articles": 182, "frontend_question_id": "691", "is_new_question": false }, @@ -42012,9 +42306,9 @@ "question__title": "Employee Importance", "question__title_slug": "employee-importance", "question__hide": false, - "total_acs": 60839, - "total_submitted": 93251, - "total_column_articles": 626, + "total_acs": 61013, + "total_submitted": 93498, + "total_column_articles": 627, "frontend_question_id": "690", "is_new_question": false }, @@ -42033,9 +42327,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": 21215, - "total_submitted": 37642, - "total_column_articles": 277, + "total_acs": 21302, + "total_submitted": 37781, + "total_column_articles": 279, "frontend_question_id": "689", "is_new_question": false }, @@ -42054,8 +42348,8 @@ "question__title": "Knight Probability in Chessboard", "question__title_slug": "knight-probability-in-chessboard", "question__hide": false, - "total_acs": 32661, - "total_submitted": 56042, + "total_acs": 32772, + "total_submitted": 56248, "total_column_articles": 363, "frontend_question_id": "688", "is_new_question": false @@ -42075,9 +42369,9 @@ "question__title": "Longest Univalue Path", "question__title_slug": "longest-univalue-path", "question__hide": false, - "total_acs": 46471, - "total_submitted": 103073, - "total_column_articles": 336, + "total_acs": 46819, + "total_submitted": 103787, + "total_column_articles": 338, "frontend_question_id": "687", "is_new_question": false }, @@ -42096,9 +42390,9 @@ "question__title": "Repeated String Match", "question__title_slug": "repeated-string-match", "question__hide": false, - "total_acs": 45488, - "total_submitted": 113447, - "total_column_articles": 590, + "total_acs": 45746, + "total_submitted": 114018, + "total_column_articles": 594, "frontend_question_id": "686", "is_new_question": false }, @@ -42117,9 +42411,9 @@ "question__title": "Redundant Connection II", "question__title_slug": "redundant-connection-ii", "question__hide": false, - "total_acs": 23192, - "total_submitted": 54847, - "total_column_articles": 297, + "total_acs": 23474, + "total_submitted": 55382, + "total_column_articles": 299, "frontend_question_id": "685", "is_new_question": false }, @@ -42138,9 +42432,9 @@ "question__title": "Redundant Connection", "question__title_slug": "redundant-connection", "question__hide": false, - "total_acs": 75936, - "total_submitted": 113076, - "total_column_articles": 773, + "total_acs": 76798, + "total_submitted": 114382, + "total_column_articles": 777, "frontend_question_id": "684", "is_new_question": false }, @@ -42159,8 +42453,8 @@ "question__title": "K Empty Slots", "question__title_slug": "k-empty-slots", "question__hide": false, - "total_acs": 3199, - "total_submitted": 7097, + "total_acs": 3228, + "total_submitted": 7141, "total_column_articles": 69, "frontend_question_id": "683", "is_new_question": false @@ -42180,9 +42474,9 @@ "question__title": "Baseball Game", "question__title_slug": "baseball-game", "question__hide": false, - "total_acs": 82065, - "total_submitted": 113829, - "total_column_articles": 896, + "total_acs": 82441, + "total_submitted": 114394, + "total_column_articles": 899, "frontend_question_id": "682", "is_new_question": false }, @@ -42201,9 +42495,9 @@ "question__title": "Next Closest Time", "question__title_slug": "next-closest-time", "question__hide": false, - "total_acs": 3429, - "total_submitted": 6878, - "total_column_articles": 82, + "total_acs": 3477, + "total_submitted": 6959, + "total_column_articles": 81, "frontend_question_id": "681", "is_new_question": false }, @@ -42222,9 +42516,9 @@ "question__title": "Valid Palindrome II", "question__title_slug": "valid-palindrome-ii", "question__hide": false, - "total_acs": 111665, - "total_submitted": 278298, - "total_column_articles": 1018, + "total_acs": 112633, + "total_submitted": 280615, + "total_column_articles": 1022, "frontend_question_id": "680", "is_new_question": false }, @@ -42243,9 +42537,9 @@ "question__title": "24 Game", "question__title_slug": "24-game", "question__hide": false, - "total_acs": 33301, - "total_submitted": 61896, - "total_column_articles": 324, + "total_acs": 33574, + "total_submitted": 62395, + "total_column_articles": 326, "frontend_question_id": "679", "is_new_question": false }, @@ -42264,9 +42558,9 @@ "question__title": "Valid Parenthesis String", "question__title_slug": "valid-parenthesis-string", "question__hide": false, - "total_acs": 55689, - "total_submitted": 142863, - "total_column_articles": 567, + "total_acs": 56107, + "total_submitted": 143938, + "total_column_articles": 571, "frontend_question_id": "678", "is_new_question": false }, @@ -42285,9 +42579,9 @@ "question__title": "Map Sum Pairs", "question__title_slug": "map-sum-pairs", "question__hide": false, - "total_acs": 41594, - "total_submitted": 62670, - "total_column_articles": 609, + "total_acs": 41882, + "total_submitted": 63103, + "total_column_articles": 613, "frontend_question_id": "677", "is_new_question": false }, @@ -42306,9 +42600,9 @@ "question__title": "Implement Magic Dictionary", "question__title_slug": "implement-magic-dictionary", "question__hide": false, - "total_acs": 11277, - "total_submitted": 18783, - "total_column_articles": 192, + "total_acs": 11473, + "total_submitted": 19092, + "total_column_articles": 196, "frontend_question_id": "676", "is_new_question": false }, @@ -42327,8 +42621,8 @@ "question__title": "Cut Off Trees for Golf Event", "question__title_slug": "cut-off-trees-for-golf-event", "question__hide": false, - "total_acs": 19761, - "total_submitted": 36718, + "total_acs": 19928, + "total_submitted": 37053, "total_column_articles": 208, "frontend_question_id": "675", "is_new_question": false @@ -42348,9 +42642,9 @@ "question__title": "Longest Continuous Increasing Subsequence", "question__title_slug": "longest-continuous-increasing-subsequence", "question__hide": false, - "total_acs": 133887, - "total_submitted": 252495, - "total_column_articles": 1046, + "total_acs": 136016, + "total_submitted": 256026, + "total_column_articles": 1049, "frontend_question_id": "674", "is_new_question": false }, @@ -42369,9 +42663,9 @@ "question__title": "Number of Longest Increasing Subsequence", "question__title_slug": "number-of-longest-increasing-subsequence", "question__hide": false, - "total_acs": 65931, - "total_submitted": 149131, - "total_column_articles": 536, + "total_acs": 66865, + "total_submitted": 151084, + "total_column_articles": 543, "frontend_question_id": "673", "is_new_question": false }, @@ -42390,8 +42684,8 @@ "question__title": "Bulb Switcher II", "question__title_slug": "bulb-switcher-ii", "question__hide": false, - "total_acs": 4824, - "total_submitted": 8936, + "total_acs": 4876, + "total_submitted": 9031, "total_column_articles": 56, "frontend_question_id": "672", "is_new_question": false @@ -42411,9 +42705,9 @@ "question__title": "Second Minimum Node In a Binary Tree", "question__title_slug": "second-minimum-node-in-a-binary-tree", "question__hide": false, - "total_acs": 61554, - "total_submitted": 127496, - "total_column_articles": 774, + "total_acs": 61910, + "total_submitted": 128270, + "total_column_articles": 780, "frontend_question_id": "671", "is_new_question": false }, @@ -42432,9 +42726,9 @@ "question__title": "Maximum Swap", "question__title_slug": "maximum-swap", "question__hide": false, - "total_acs": 26994, - "total_submitted": 58549, - "total_column_articles": 390, + "total_acs": 27382, + "total_submitted": 59338, + "total_column_articles": 393, "frontend_question_id": "670", "is_new_question": false }, @@ -42453,9 +42747,9 @@ "question__title": "Trim a Binary Search Tree", "question__title_slug": "trim-a-binary-search-tree", "question__hide": false, - "total_acs": 64255, - "total_submitted": 96282, - "total_column_articles": 486, + "total_acs": 65646, + "total_submitted": 98346, + "total_column_articles": 491, "frontend_question_id": "669", "is_new_question": false }, @@ -42474,9 +42768,9 @@ "question__title": "Kth Smallest Number in Multiplication Table", "question__title_slug": "kth-smallest-number-in-multiplication-table", "question__hide": false, - "total_acs": 27925, - "total_submitted": 47621, - "total_column_articles": 258, + "total_acs": 28065, + "total_submitted": 47860, + "total_column_articles": 259, "frontend_question_id": "668", "is_new_question": false }, @@ -42495,9 +42789,9 @@ "question__title": "Beautiful Arrangement II", "question__title_slug": "beautiful-arrangement-ii", "question__hide": false, - "total_acs": 9709, - "total_submitted": 15612, - "total_column_articles": 145, + "total_acs": 9790, + "total_submitted": 15743, + "total_column_articles": 147, "frontend_question_id": "667", "is_new_question": false }, @@ -42516,9 +42810,9 @@ "question__title": "Path Sum IV", "question__title_slug": "path-sum-iv", "question__hide": false, - "total_acs": 2807, - "total_submitted": 4555, - "total_column_articles": 94, + "total_acs": 2837, + "total_submitted": 4604, + "total_column_articles": 95, "frontend_question_id": "666", "is_new_question": false }, @@ -42537,9 +42831,9 @@ "question__title": "Non-decreasing Array", "question__title_slug": "non-decreasing-array", "question__hide": false, - "total_acs": 85909, - "total_submitted": 313022, - "total_column_articles": 1036, + "total_acs": 86547, + "total_submitted": 314869, + "total_column_articles": 1042, "frontend_question_id": "665", "is_new_question": false }, @@ -42558,9 +42852,9 @@ "question__title": "Strange Printer", "question__title_slug": "strange-printer", "question__hide": false, - "total_acs": 24124, - "total_submitted": 36882, - "total_column_articles": 204, + "total_acs": 24183, + "total_submitted": 36994, + "total_column_articles": 205, "frontend_question_id": "664", "is_new_question": false }, @@ -42579,9 +42873,9 @@ "question__title": "Equal Tree Partition", "question__title_slug": "equal-tree-partition", "question__hide": false, - "total_acs": 2318, - "total_submitted": 5084, - "total_column_articles": 50, + "total_acs": 2362, + "total_submitted": 5185, + "total_column_articles": 51, "frontend_question_id": "663", "is_new_question": false }, @@ -42600,9 +42894,9 @@ "question__title": "Maximum Width of Binary Tree", "question__title_slug": "maximum-width-of-binary-tree", "question__hide": false, - "total_acs": 47145, - "total_submitted": 114735, - "total_column_articles": 422, + "total_acs": 48037, + "total_submitted": 116834, + "total_column_articles": 429, "frontend_question_id": "662", "is_new_question": false }, @@ -42621,9 +42915,9 @@ "question__title": "Image Smoother", "question__title_slug": "image-smoother", "question__hide": false, - "total_acs": 47024, - "total_submitted": 72801, - "total_column_articles": 505, + "total_acs": 47257, + "total_submitted": 73169, + "total_column_articles": 507, "frontend_question_id": "661", "is_new_question": false }, @@ -42642,8 +42936,8 @@ "question__title": "Remove 9", "question__title_slug": "remove-9", "question__hide": false, - "total_acs": 1014, - "total_submitted": 1565, + "total_acs": 1021, + "total_submitted": 1573, "total_column_articles": 29, "frontend_question_id": "660", "is_new_question": false @@ -42663,9 +42957,9 @@ "question__title": "Split Array into Consecutive Subsequences", "question__title_slug": "split-array-into-consecutive-subsequences", "question__hide": false, - "total_acs": 31916, - "total_submitted": 58784, - "total_column_articles": 300, + "total_acs": 32117, + "total_submitted": 59122, + "total_column_articles": 302, "frontend_question_id": "659", "is_new_question": false }, @@ -42684,9 +42978,9 @@ "question__title": "Find K Closest Elements", "question__title_slug": "find-k-closest-elements", "question__hide": false, - "total_acs": 40839, - "total_submitted": 89097, - "total_column_articles": 358, + "total_acs": 41505, + "total_submitted": 90490, + "total_column_articles": 364, "frontend_question_id": "658", "is_new_question": false }, @@ -42705,9 +42999,9 @@ "question__title": "Robot Return to Origin", "question__title_slug": "robot-return-to-origin", "question__hide": false, - "total_acs": 90515, - "total_submitted": 115332, - "total_column_articles": 702, + "total_acs": 90960, + "total_submitted": 115885, + "total_column_articles": 708, "frontend_question_id": "657", "is_new_question": false }, @@ -42726,9 +43020,9 @@ "question__title": "Coin Path", "question__title_slug": "coin-path", "question__hide": false, - "total_acs": 1160, - "total_submitted": 3564, - "total_column_articles": 30, + "total_acs": 1174, + "total_submitted": 3594, + "total_column_articles": 31, "frontend_question_id": "656", "is_new_question": false }, @@ -42747,9 +43041,9 @@ "question__title": "Print Binary Tree", "question__title_slug": "print-binary-tree", "question__hide": false, - "total_acs": 11742, - "total_submitted": 19422, - "total_column_articles": 198, + "total_acs": 11866, + "total_submitted": 19658, + "total_column_articles": 199, "frontend_question_id": "655", "is_new_question": false }, @@ -42768,9 +43062,9 @@ "question__title": "Maximum Binary Tree", "question__title_slug": "maximum-binary-tree", "question__hide": false, - "total_acs": 107297, - "total_submitted": 132024, - "total_column_articles": 961, + "total_acs": 109433, + "total_submitted": 134644, + "total_column_articles": 970, "frontend_question_id": "654", "is_new_question": false }, @@ -42789,9 +43083,9 @@ "question__title": "Two Sum IV - Input is a BST", "question__title_slug": "two-sum-iv-input-is-a-bst", "question__hide": false, - "total_acs": 93186, - "total_submitted": 147505, - "total_column_articles": 833, + "total_acs": 94141, + "total_submitted": 148920, + "total_column_articles": 838, "frontend_question_id": "653", "is_new_question": false }, @@ -42810,9 +43104,9 @@ "question__title": "Find Duplicate Subtrees", "question__title_slug": "find-duplicate-subtrees", "question__hide": false, - "total_acs": 53028, - "total_submitted": 90914, - "total_column_articles": 363, + "total_acs": 53913, + "total_submitted": 92427, + "total_column_articles": 372, "frontend_question_id": "652", "is_new_question": false }, @@ -42831,8 +43125,8 @@ "question__title": "4 Keys Keyboard", "question__title_slug": "4-keys-keyboard", "question__hide": false, - "total_acs": 5141, - "total_submitted": 8725, + "total_acs": 5196, + "total_submitted": 8823, "total_column_articles": 83, "frontend_question_id": "651", "is_new_question": false @@ -42852,9 +43146,9 @@ "question__title": "2 Keys Keyboard", "question__title_slug": "2-keys-keyboard", "question__hide": false, - "total_acs": 57910, - "total_submitted": 101280, - "total_column_articles": 720, + "total_acs": 58188, + "total_submitted": 101754, + "total_column_articles": 723, "frontend_question_id": "650", "is_new_question": false }, @@ -42873,9 +43167,9 @@ "question__title": "Dota2 Senate", "question__title_slug": "dota2-senate", "question__hide": false, - "total_acs": 32375, - "total_submitted": 67588, - "total_column_articles": 340, + "total_acs": 32617, + "total_submitted": 68052, + "total_column_articles": 341, "frontend_question_id": "649", "is_new_question": false }, @@ -42894,9 +43188,9 @@ "question__title": "Replace Words", "question__title_slug": "replace-words", "question__hide": false, - "total_acs": 29084, - "total_submitted": 48421, - "total_column_articles": 377, + "total_acs": 29538, + "total_submitted": 49145, + "total_column_articles": 384, "frontend_question_id": "648", "is_new_question": false }, @@ -42915,9 +43209,9 @@ "question__title": "Palindromic Substrings", "question__title_slug": "palindromic-substrings", "question__hide": false, - "total_acs": 191903, - "total_submitted": 288773, - "total_column_articles": 1307, + "total_acs": 195458, + "total_submitted": 294003, + "total_column_articles": 1320, "frontend_question_id": "647", "is_new_question": false }, @@ -42936,9 +43230,9 @@ "question__title": "Maximum Length of Pair Chain", "question__title_slug": "maximum-length-of-pair-chain", "question__hide": false, - "total_acs": 29494, - "total_submitted": 50532, - "total_column_articles": 267, + "total_acs": 29800, + "total_submitted": 51051, + "total_column_articles": 271, "frontend_question_id": "646", "is_new_question": false }, @@ -42957,9 +43251,9 @@ "question__title": "Set Mismatch", "question__title_slug": "set-mismatch", "question__hide": false, - "total_acs": 83942, - "total_submitted": 201167, - "total_column_articles": 833, + "total_acs": 84579, + "total_submitted": 202862, + "total_column_articles": 836, "frontend_question_id": "645", "is_new_question": false }, @@ -42978,9 +43272,9 @@ "question__title": "Maximum Average Subarray II", "question__title_slug": "maximum-average-subarray-ii", "question__hide": false, - "total_acs": 1663, - "total_submitted": 3887, - "total_column_articles": 33, + "total_acs": 1685, + "total_submitted": 3952, + "total_column_articles": 34, "frontend_question_id": "644", "is_new_question": false }, @@ -42999,9 +43293,9 @@ "question__title": "Maximum Average Subarray I", "question__title_slug": "maximum-average-subarray-i", "question__hide": false, - "total_acs": 81246, - "total_submitted": 183478, - "total_column_articles": 739, + "total_acs": 82034, + "total_submitted": 185460, + "total_column_articles": 742, "frontend_question_id": "643", "is_new_question": false }, @@ -43020,9 +43314,9 @@ "question__title": "Design Search Autocomplete System", "question__title_slug": "design-search-autocomplete-system", "question__hide": false, - "total_acs": 4320, - "total_submitted": 7708, - "total_column_articles": 75, + "total_acs": 4364, + "total_submitted": 7795, + "total_column_articles": 77, "frontend_question_id": "642", "is_new_question": false }, @@ -43041,9 +43335,9 @@ "question__title": "Solve the Equation", "question__title_slug": "solve-the-equation", "question__hide": false, - "total_acs": 12693, - "total_submitted": 29892, - "total_column_articles": 255, + "total_acs": 12784, + "total_submitted": 30102, + "total_column_articles": 259, "frontend_question_id": "640", "is_new_question": false }, @@ -43062,9 +43356,9 @@ "question__title": "Decode Ways II", "question__title_slug": "decode-ways-ii", "question__hide": false, - "total_acs": 21480, - "total_submitted": 57288, - "total_column_articles": 290, + "total_acs": 21544, + "total_submitted": 57466, + "total_column_articles": 293, "frontend_question_id": "639", "is_new_question": false }, @@ -43083,9 +43377,9 @@ "question__title": "Shopping Offers", "question__title_slug": "shopping-offers", "question__hide": false, - "total_acs": 31664, - "total_submitted": 49132, - "total_column_articles": 301, + "total_acs": 31836, + "total_submitted": 49437, + "total_column_articles": 302, "frontend_question_id": "638", "is_new_question": false }, @@ -43104,9 +43398,9 @@ "question__title": "Average of Levels in Binary Tree", "question__title_slug": "average-of-levels-in-binary-tree", "question__hide": false, - "total_acs": 105747, - "total_submitted": 152078, - "total_column_articles": 857, + "total_acs": 107087, + "total_submitted": 153967, + "total_column_articles": 863, "frontend_question_id": "637", "is_new_question": false }, @@ -43125,9 +43419,9 @@ "question__title": "Exclusive Time of Functions", "question__title_slug": "exclusive-time-of-functions", "question__hide": false, - "total_acs": 12912, - "total_submitted": 22568, - "total_column_articles": 146, + "total_acs": 13005, + "total_submitted": 22724, + "total_column_articles": 147, "frontend_question_id": "636", "is_new_question": false }, @@ -43146,9 +43440,9 @@ "question__title": "Design Log Storage System", "question__title_slug": "design-log-storage-system", "question__hide": false, - "total_acs": 5419, - "total_submitted": 9616, - "total_column_articles": 87, + "total_acs": 5492, + "total_submitted": 9757, + "total_column_articles": 89, "frontend_question_id": "635", "is_new_question": false }, @@ -43167,8 +43461,8 @@ "question__title": "Find the Derangement of An Array", "question__title_slug": "find-the-derangement-of-an-array", "question__hide": false, - "total_acs": 1857, - "total_submitted": 4025, + "total_acs": 1874, + "total_submitted": 4055, "total_column_articles": 23, "frontend_question_id": "634", "is_new_question": false @@ -43188,9 +43482,9 @@ "question__title": "Sum of Square Numbers", "question__title_slug": "sum-of-square-numbers", "question__hide": false, - "total_acs": 113084, - "total_submitted": 290837, - "total_column_articles": 912, + "total_acs": 113991, + "total_submitted": 293415, + "total_column_articles": 920, "frontend_question_id": "633", "is_new_question": false }, @@ -43209,9 +43503,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": 21795, - "total_submitted": 36140, - "total_column_articles": 278, + "total_acs": 21912, + "total_submitted": 36296, + "total_column_articles": 281, "frontend_question_id": "632", "is_new_question": false }, @@ -43230,9 +43524,9 @@ "question__title": "Design Excel Sum Formula", "question__title_slug": "design-excel-sum-formula", "question__hide": false, - "total_acs": 1447, - "total_submitted": 4577, - "total_column_articles": 41, + "total_acs": 1474, + "total_submitted": 4622, + "total_column_articles": 42, "frontend_question_id": "631", "is_new_question": false }, @@ -43251,8 +43545,8 @@ "question__title": "Course Schedule III", "question__title_slug": "course-schedule-iii", "question__hide": false, - "total_acs": 26015, - "total_submitted": 56246, + "total_acs": 26159, + "total_submitted": 56518, "total_column_articles": 242, "frontend_question_id": "630", "is_new_question": false @@ -43272,8 +43566,8 @@ "question__title": "K Inverse Pairs Array", "question__title_slug": "k-inverse-pairs-array", "question__hide": false, - "total_acs": 19959, - "total_submitted": 38625, + "total_acs": 20000, + "total_submitted": 38702, "total_column_articles": 183, "frontend_question_id": "629", "is_new_question": false @@ -43293,9 +43587,9 @@ "question__title": "Maximum Product of Three Numbers", "question__title_slug": "maximum-product-of-three-numbers", "question__hide": false, - "total_acs": 95815, - "total_submitted": 183035, - "total_column_articles": 902, + "total_acs": 96519, + "total_submitted": 184429, + "total_column_articles": 906, "frontend_question_id": "628", "is_new_question": false }, @@ -43314,9 +43608,9 @@ "question__title": "Swap Salary", "question__title_slug": "swap-salary", "question__hide": false, - "total_acs": 116762, - "total_submitted": 144093, - "total_column_articles": 475, + "total_acs": 119424, + "total_submitted": 147268, + "total_column_articles": 482, "frontend_question_id": "627", "is_new_question": false }, @@ -43335,9 +43629,9 @@ "question__title": "Exchange Seats", "question__title_slug": "exchange-seats", "question__hide": false, - "total_acs": 56974, - "total_submitted": 83607, - "total_column_articles": 468, + "total_acs": 57607, + "total_submitted": 84565, + "total_column_articles": 475, "frontend_question_id": "626", "is_new_question": false }, @@ -43356,9 +43650,9 @@ "question__title": "Minimum Factorization", "question__title_slug": "minimum-factorization", "question__hide": false, - "total_acs": 2959, - "total_submitted": 8542, - "total_column_articles": 58, + "total_acs": 2976, + "total_submitted": 8594, + "total_column_articles": 59, "frontend_question_id": "625", "is_new_question": false }, @@ -43377,8 +43671,8 @@ "question__title": "Maximum Distance in Arrays", "question__title_slug": "maximum-distance-in-arrays", "question__hide": false, - "total_acs": 2761, - "total_submitted": 6331, + "total_acs": 2771, + "total_submitted": 6354, "total_column_articles": 60, "frontend_question_id": "624", "is_new_question": false @@ -43398,9 +43692,9 @@ "question__title": "Add One Row to Tree", "question__title_slug": "add-one-row-to-tree", "question__hide": false, - "total_acs": 14323, - "total_submitted": 26132, - "total_column_articles": 253, + "total_acs": 14482, + "total_submitted": 26432, + "total_column_articles": 256, "frontend_question_id": "623", "is_new_question": false }, @@ -43419,9 +43713,9 @@ "question__title": "Task Scheduler", "question__title_slug": "task-scheduler", "question__hide": false, - "total_acs": 103256, - "total_submitted": 176859, - "total_column_articles": 666, + "total_acs": 104686, + "total_submitted": 179119, + "total_column_articles": 674, "frontend_question_id": "621", "is_new_question": false }, @@ -43440,9 +43734,9 @@ "question__title": "Not Boring Movies", "question__title_slug": "not-boring-movies", "question__hide": false, - "total_acs": 112247, - "total_submitted": 145349, - "total_column_articles": 390, + "total_acs": 112827, + "total_submitted": 146108, + "total_column_articles": 391, "frontend_question_id": "620", "is_new_question": false }, @@ -43461,9 +43755,9 @@ "question__title": "Biggest Single Number", "question__title_slug": "biggest-single-number", "question__hide": false, - "total_acs": 17235, - "total_submitted": 37410, - "total_column_articles": 117, + "total_acs": 17565, + "total_submitted": 38083, + "total_column_articles": 120, "frontend_question_id": "619", "is_new_question": false }, @@ -43482,9 +43776,9 @@ "question__title": "Students Report By Geography", "question__title_slug": "students-report-by-geography", "question__hide": false, - "total_acs": 6899, - "total_submitted": 11126, - "total_column_articles": 66, + "total_acs": 7027, + "total_submitted": 11383, + "total_column_articles": 67, "frontend_question_id": "618", "is_new_question": false }, @@ -43503,9 +43797,9 @@ "question__title": "Merge Two Binary Trees", "question__title_slug": "merge-two-binary-trees", "question__hide": false, - "total_acs": 293988, - "total_submitted": 372115, - "total_column_articles": 1867, + "total_acs": 298188, + "total_submitted": 377399, + "total_column_articles": 1895, "frontend_question_id": "617", "is_new_question": false }, @@ -43524,9 +43818,9 @@ "question__title": "Add Bold Tag in String", "question__title_slug": "add-bold-tag-in-string", "question__hide": false, - "total_acs": 4760, - "total_submitted": 9836, - "total_column_articles": 76, + "total_acs": 4793, + "total_submitted": 9913, + "total_column_articles": 77, "frontend_question_id": "616", "is_new_question": false }, @@ -43545,8 +43839,8 @@ "question__title": "Average Salary: Departments VS Company", "question__title_slug": "average-salary-departments-vs-company", "question__hide": false, - "total_acs": 7947, - "total_submitted": 19192, + "total_acs": 8124, + "total_submitted": 19551, "total_column_articles": 129, "frontend_question_id": "615", "is_new_question": false @@ -43566,9 +43860,9 @@ "question__title": "Second Degree Follower", "question__title_slug": "second-degree-follower", "question__hide": false, - "total_acs": 12282, - "total_submitted": 34026, - "total_column_articles": 95, + "total_acs": 12428, + "total_submitted": 34393, + "total_column_articles": 96, "frontend_question_id": "614", "is_new_question": false }, @@ -43587,8 +43881,8 @@ "question__title": "Shortest Distance in a Line", "question__title_slug": "shortest-distance-in-a-line", "question__hide": false, - "total_acs": 16069, - "total_submitted": 20070, + "total_acs": 16249, + "total_submitted": 20315, "total_column_articles": 109, "frontend_question_id": "613", "is_new_question": false @@ -43608,9 +43902,9 @@ "question__title": "Shortest Distance in a Plane", "question__title_slug": "shortest-distance-in-a-plane", "question__hide": false, - "total_acs": 10920, - "total_submitted": 16611, - "total_column_articles": 88, + "total_acs": 11061, + "total_submitted": 16840, + "total_column_articles": 89, "frontend_question_id": "612", "is_new_question": false }, @@ -43629,9 +43923,9 @@ "question__title": "Valid Triangle Number", "question__title_slug": "valid-triangle-number", "question__hide": false, - "total_acs": 69012, - "total_submitted": 128790, - "total_column_articles": 517, + "total_acs": 69956, + "total_submitted": 130522, + "total_column_articles": 521, "frontend_question_id": "611", "is_new_question": false }, @@ -43650,8 +43944,8 @@ "question__title": "Triangle Judgement", "question__title_slug": "triangle-judgement", "question__hide": false, - "total_acs": 14917, - "total_submitted": 23249, + "total_acs": 15081, + "total_submitted": 23548, "total_column_articles": 97, "frontend_question_id": "610", "is_new_question": false @@ -43671,9 +43965,9 @@ "question__title": "Find Duplicate File in System", "question__title_slug": "find-duplicate-file-in-system", "question__hide": false, - "total_acs": 8195, - "total_submitted": 16280, - "total_column_articles": 132, + "total_acs": 8275, + "total_submitted": 16416, + "total_column_articles": 133, "frontend_question_id": "609", "is_new_question": false }, @@ -43692,9 +43986,9 @@ "question__title": "Tree Node", "question__title_slug": "tree-node", "question__hide": false, - "total_acs": 21254, - "total_submitted": 33379, - "total_column_articles": 205, + "total_acs": 22744, + "total_submitted": 35751, + "total_column_articles": 214, "frontend_question_id": "608", "is_new_question": false }, @@ -43713,9 +44007,9 @@ "question__title": "Sales Person", "question__title_slug": "sales-person", "question__hide": false, - "total_acs": 28545, - "total_submitted": 42004, - "total_column_articles": 193, + "total_acs": 30154, + "total_submitted": 44251, + "total_column_articles": 196, "frontend_question_id": "607", "is_new_question": false }, @@ -43734,9 +44028,9 @@ "question__title": "Construct String from Binary Tree", "question__title_slug": "construct-string-from-binary-tree", "question__hide": false, - "total_acs": 62693, - "total_submitted": 99429, - "total_column_articles": 670, + "total_acs": 63031, + "total_submitted": 100048, + "total_column_articles": 672, "frontend_question_id": "606", "is_new_question": false }, @@ -43755,9 +44049,9 @@ "question__title": "Can Place Flowers", "question__title_slug": "can-place-flowers", "question__hide": false, - "total_acs": 135472, - "total_submitted": 411938, - "total_column_articles": 1525, + "total_acs": 136428, + "total_submitted": 414947, + "total_column_articles": 1537, "frontend_question_id": "605", "is_new_question": false }, @@ -43776,8 +44070,8 @@ "question__title": "Design Compressed String Iterator", "question__title_slug": "design-compressed-string-iterator", "question__hide": false, - "total_acs": 3150, - "total_submitted": 8249, + "total_acs": 3161, + "total_submitted": 8279, "total_column_articles": 76, "frontend_question_id": "604", "is_new_question": false @@ -43797,9 +44091,9 @@ "question__title": "Consecutive Available Seats", "question__title_slug": "consecutive-available-seats", "question__hide": false, - "total_acs": 19172, - "total_submitted": 29537, - "total_column_articles": 176, + "total_acs": 19546, + "total_submitted": 30097, + "total_column_articles": 178, "frontend_question_id": "603", "is_new_question": false }, @@ -43818,8 +44112,8 @@ "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": 12192, - "total_submitted": 20273, + "total_acs": 12434, + "total_submitted": 20659, "total_column_articles": 118, "frontend_question_id": "602", "is_new_question": false @@ -43839,9 +44133,9 @@ "question__title": "Human Traffic of Stadium", "question__title_slug": "human-traffic-of-stadium", "question__hide": false, - "total_acs": 40245, - "total_submitted": 82905, - "total_column_articles": 483, + "total_acs": 40548, + "total_submitted": 83917, + "total_column_articles": 484, "frontend_question_id": "601", "is_new_question": false }, @@ -43860,8 +44154,8 @@ "question__title": "Non-negative Integers without Consecutive Ones", "question__title_slug": "non-negative-integers-without-consecutive-ones", "question__hide": false, - "total_acs": 21016, - "total_submitted": 43437, + "total_acs": 21086, + "total_submitted": 43562, "total_column_articles": 255, "frontend_question_id": "600", "is_new_question": false @@ -43881,8 +44175,8 @@ "question__title": "Minimum Index Sum of Two Lists", "question__title_slug": "minimum-index-sum-of-two-lists", "question__hide": false, - "total_acs": 75301, - "total_submitted": 131697, + "total_acs": 75703, + "total_submitted": 132449, "total_column_articles": 661, "frontend_question_id": "599", "is_new_question": false @@ -43902,9 +44196,9 @@ "question__title": "Range Addition II", "question__title_slug": "range-addition-ii", "question__hide": false, - "total_acs": 45934, - "total_submitted": 80146, - "total_column_articles": 538, + "total_acs": 46155, + "total_submitted": 80474, + "total_column_articles": 539, "frontend_question_id": "598", "is_new_question": false }, @@ -43923,9 +44217,9 @@ "question__title": "Friend Requests I: Overall Acceptance Rate", "question__title_slug": "friend-requests-i-overall-acceptance-rate", "question__hide": false, - "total_acs": 15008, - "total_submitted": 34176, - "total_column_articles": 110, + "total_acs": 15219, + "total_submitted": 34704, + "total_column_articles": 111, "frontend_question_id": "597", "is_new_question": false }, @@ -43944,9 +44238,9 @@ "question__title": "Classes More Than 5 Students", "question__title_slug": "classes-more-than-5-students", "question__hide": false, - "total_acs": 109491, - "total_submitted": 235525, - "total_column_articles": 384, + "total_acs": 111382, + "total_submitted": 238490, + "total_column_articles": 386, "frontend_question_id": "596", "is_new_question": false }, @@ -43965,9 +44259,9 @@ "question__title": "Big Countries", "question__title_slug": "big-countries", "question__hide": false, - "total_acs": 156334, - "total_submitted": 218054, - "total_column_articles": 368, + "total_acs": 161620, + "total_submitted": 227058, + "total_column_articles": 380, "frontend_question_id": "595", "is_new_question": false }, @@ -43986,9 +44280,9 @@ "question__title": "Longest Harmonious Subsequence", "question__title_slug": "longest-harmonious-subsequence", "question__hide": false, - "total_acs": 68554, - "total_submitted": 121152, - "total_column_articles": 605, + "total_acs": 68986, + "total_submitted": 121971, + "total_column_articles": 607, "frontend_question_id": "594", "is_new_question": false }, @@ -44007,9 +44301,9 @@ "question__title": "Valid Square", "question__title_slug": "valid-square", "question__hide": false, - "total_acs": 10829, - "total_submitted": 24522, - "total_column_articles": 173, + "total_acs": 10956, + "total_submitted": 24825, + "total_column_articles": 174, "frontend_question_id": "593", "is_new_question": false }, @@ -44028,8 +44322,8 @@ "question__title": "Fraction Addition and Subtraction", "question__title_slug": "fraction-addition-and-subtraction", "question__hide": false, - "total_acs": 6082, - "total_submitted": 11551, + "total_acs": 6147, + "total_submitted": 11664, "total_column_articles": 149, "frontend_question_id": "592", "is_new_question": false @@ -44049,8 +44343,8 @@ "question__title": "Tag Validator", "question__title_slug": "tag-validator", "question__hide": false, - "total_acs": 16509, - "total_submitted": 31560, + "total_acs": 16532, + "total_submitted": 31603, "total_column_articles": 191, "frontend_question_id": "591", "is_new_question": false @@ -44070,9 +44364,9 @@ "question__title": "Design In-Memory File System", "question__title_slug": "design-in-memory-file-system", "question__hide": false, - "total_acs": 2410, - "total_submitted": 5696, - "total_column_articles": 43, + "total_acs": 2457, + "total_submitted": 5807, + "total_column_articles": 45, "frontend_question_id": "588", "is_new_question": false }, @@ -44091,9 +44385,9 @@ "question__title": "Erect the Fence", "question__title_slug": "erect-the-fence", "question__hide": false, - "total_acs": 16456, - "total_submitted": 26706, - "total_column_articles": 128, + "total_acs": 16506, + "total_submitted": 26784, + "total_column_articles": 129, "frontend_question_id": "587", "is_new_question": false }, @@ -44112,9 +44406,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": 33060, - "total_submitted": 45453, - "total_column_articles": 171, + "total_acs": 34702, + "total_submitted": 47766, + "total_column_articles": 181, "frontend_question_id": "586", "is_new_question": false }, @@ -44133,8 +44427,8 @@ "question__title": "Investments in 2016", "question__title_slug": "investments-in-2016", "question__hide": false, - "total_acs": 12286, - "total_submitted": 24250, + "total_acs": 12457, + "total_submitted": 24861, "total_column_articles": 143, "frontend_question_id": "585", "is_new_question": false @@ -44154,9 +44448,9 @@ "question__title": "Find Customer Referee", "question__title_slug": "find-customer-referee", "question__hide": false, - "total_acs": 50154, - "total_submitted": 71615, - "total_column_articles": 193, + "total_acs": 54341, + "total_submitted": 77976, + "total_column_articles": 201, "frontend_question_id": "584", "is_new_question": false }, @@ -44175,9 +44469,9 @@ "question__title": "Delete Operation for Two Strings", "question__title_slug": "delete-operation-for-two-strings", "question__hide": false, - "total_acs": 82777, - "total_submitted": 127264, - "total_column_articles": 719, + "total_acs": 84398, + "total_submitted": 129600, + "total_column_articles": 727, "frontend_question_id": "583", "is_new_question": false }, @@ -44196,9 +44490,9 @@ "question__title": "Kill Process", "question__title_slug": "kill-process", "question__hide": false, - "total_acs": 10749, - "total_submitted": 24603, - "total_column_articles": 163, + "total_acs": 10867, + "total_submitted": 24778, + "total_column_articles": 168, "frontend_question_id": "582", "is_new_question": false }, @@ -44217,9 +44511,9 @@ "question__title": "Shortest Unsorted Continuous Subarray", "question__title_slug": "shortest-unsorted-continuous-subarray", "question__hide": false, - "total_acs": 135062, - "total_submitted": 327679, - "total_column_articles": 1104, + "total_acs": 137011, + "total_submitted": 332074, + "total_column_articles": 1116, "frontend_question_id": "581", "is_new_question": false }, @@ -44238,9 +44532,9 @@ "question__title": "Count Student Number in Departments", "question__title_slug": "count-student-number-in-departments", "question__hide": false, - "total_acs": 16316, - "total_submitted": 31099, - "total_column_articles": 115, + "total_acs": 16638, + "total_submitted": 31713, + "total_column_articles": 117, "frontend_question_id": "580", "is_new_question": false }, @@ -44259,9 +44553,9 @@ "question__title": "Find Cumulative Salary of an Employee", "question__title_slug": "find-cumulative-salary-of-an-employee", "question__hide": false, - "total_acs": 11178, - "total_submitted": 26348, - "total_column_articles": 169, + "total_acs": 11343, + "total_submitted": 26691, + "total_column_articles": 170, "frontend_question_id": "579", "is_new_question": false }, @@ -44280,8 +44574,8 @@ "question__title": "Get Highest Answer Rate Question", "question__title_slug": "get-highest-answer-rate-question", "question__hide": false, - "total_acs": 15154, - "total_submitted": 32661, + "total_acs": 15366, + "total_submitted": 33335, "total_column_articles": 160, "frontend_question_id": "578", "is_new_question": false @@ -44301,8 +44595,8 @@ "question__title": "Employee Bonus", "question__title_slug": "employee-bonus", "question__hide": false, - "total_acs": 23096, - "total_submitted": 33353, + "total_acs": 23376, + "total_submitted": 33739, "total_column_articles": 125, "frontend_question_id": "577", "is_new_question": false @@ -44322,9 +44616,9 @@ "question__title": "Out of Boundary Paths", "question__title_slug": "out-of-boundary-paths", "question__hide": false, - "total_acs": 30814, - "total_submitted": 65593, - "total_column_articles": 333, + "total_acs": 31012, + "total_submitted": 65964, + "total_column_articles": 335, "frontend_question_id": "576", "is_new_question": false }, @@ -44343,9 +44637,9 @@ "question__title": "Distribute Candies", "question__title_slug": "distribute-candies", "question__hide": false, - "total_acs": 96772, - "total_submitted": 136372, - "total_column_articles": 912, + "total_acs": 97312, + "total_submitted": 137190, + "total_column_articles": 920, "frontend_question_id": "575", "is_new_question": false }, @@ -44364,8 +44658,8 @@ "question__title": "Winning Candidate", "question__title_slug": "winning-candidate", "question__hide": false, - "total_acs": 18556, - "total_submitted": 28141, + "total_acs": 18838, + "total_submitted": 28557, "total_column_articles": 142, "frontend_question_id": "574", "is_new_question": false @@ -44385,9 +44679,9 @@ "question__title": "Squirrel Simulation", "question__title_slug": "squirrel-simulation", "question__hide": false, - "total_acs": 1401, - "total_submitted": 2159, - "total_column_articles": 40, + "total_acs": 1414, + "total_submitted": 2182, + "total_column_articles": 42, "frontend_question_id": "573", "is_new_question": false }, @@ -44406,9 +44700,9 @@ "question__title": "Subtree of Another Tree", "question__title_slug": "subtree-of-another-tree", "question__hide": false, - "total_acs": 128891, - "total_submitted": 270583, - "total_column_articles": 1055, + "total_acs": 130816, + "total_submitted": 274386, + "total_column_articles": 1066, "frontend_question_id": "572", "is_new_question": false }, @@ -44427,9 +44721,9 @@ "question__title": "Find Median Given Frequency of Numbers", "question__title_slug": "find-median-given-frequency-of-numbers", "question__hide": false, - "total_acs": 9890, - "total_submitted": 21279, - "total_column_articles": 126, + "total_acs": 10074, + "total_submitted": 21626, + "total_column_articles": 127, "frontend_question_id": "571", "is_new_question": false }, @@ -44448,9 +44742,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": 20311, - "total_submitted": 30950, - "total_column_articles": 156, + "total_acs": 20720, + "total_submitted": 31582, + "total_column_articles": 157, "frontend_question_id": "570", "is_new_question": false }, @@ -44469,9 +44763,9 @@ "question__title": "Median Employee Salary", "question__title_slug": "median-employee-salary", "question__hide": false, - "total_acs": 14769, - "total_submitted": 25971, - "total_column_articles": 208, + "total_acs": 15070, + "total_submitted": 26461, + "total_column_articles": 212, "frontend_question_id": "569", "is_new_question": false }, @@ -44490,8 +44784,8 @@ "question__title": "Maximum Vacation Days", "question__title_slug": "maximum-vacation-days", "question__hide": false, - "total_acs": 1593, - "total_submitted": 3093, + "total_acs": 1616, + "total_submitted": 3131, "total_column_articles": 32, "frontend_question_id": "568", "is_new_question": false @@ -44511,9 +44805,9 @@ "question__title": "Permutation in String", "question__title_slug": "permutation-in-string", "question__hide": false, - "total_acs": 197824, - "total_submitted": 449765, - "total_column_articles": 1859, + "total_acs": 200823, + "total_submitted": 456372, + "total_column_articles": 1884, "frontend_question_id": "567", "is_new_question": false }, @@ -44532,9 +44826,9 @@ "question__title": "Reshape the Matrix", "question__title_slug": "reshape-the-matrix", "question__hide": false, - "total_acs": 109171, - "total_submitted": 164550, - "total_column_articles": 1019, + "total_acs": 110562, + "total_submitted": 166800, + "total_column_articles": 1027, "frontend_question_id": "566", "is_new_question": false }, @@ -44553,9 +44847,9 @@ "question__title": "Array Nesting", "question__title_slug": "array-nesting", "question__hide": false, - "total_acs": 18104, - "total_submitted": 30458, - "total_column_articles": 191, + "total_acs": 18216, + "total_submitted": 30666, + "total_column_articles": 194, "frontend_question_id": "565", "is_new_question": false }, @@ -44574,8 +44868,8 @@ "question__title": "Find the Closest Palindrome", "question__title_slug": "find-the-closest-palindrome", "question__hide": false, - "total_acs": 23378, - "total_submitted": 76837, + "total_acs": 23435, + "total_submitted": 77022, "total_column_articles": 249, "frontend_question_id": "564", "is_new_question": false @@ -44595,9 +44889,9 @@ "question__title": "Binary Tree Tilt", "question__title_slug": "binary-tree-tilt", "question__hide": false, - "total_acs": 66335, - "total_submitted": 100985, - "total_column_articles": 670, + "total_acs": 66689, + "total_submitted": 101503, + "total_column_articles": 671, "frontend_question_id": "563", "is_new_question": false }, @@ -44616,8 +44910,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": 5091, - "total_submitted": 10469, + "total_acs": 5109, + "total_submitted": 10500, "total_column_articles": 87, "frontend_question_id": "562", "is_new_question": false @@ -44637,8 +44931,8 @@ "question__title": "Array Partition I", "question__title_slug": "array-partition-i", "question__hide": false, - "total_acs": 110489, - "total_submitted": 141353, + "total_acs": 111235, + "total_submitted": 142235, "total_column_articles": 916, "frontend_question_id": "561", "is_new_question": false @@ -44658,9 +44952,9 @@ "question__title": "Subarray Sum Equals K", "question__title_slug": "subarray-sum-equals-k", "question__hide": false, - "total_acs": 236284, - "total_submitted": 521648, - "total_column_articles": 1489, + "total_acs": 240073, + "total_submitted": 529335, + "total_column_articles": 1513, "frontend_question_id": "560", "is_new_question": false }, @@ -44679,9 +44973,9 @@ "question__title": "Reverse Words in a String III", "question__title_slug": "reverse-words-in-a-string-iii", "question__hide": false, - "total_acs": 246659, - "total_submitted": 332399, - "total_column_articles": 2055, + "total_acs": 248988, + "total_submitted": 335536, + "total_column_articles": 2079, "frontend_question_id": "557", "is_new_question": false }, @@ -44700,9 +44994,9 @@ "question__title": "Next Greater Element III", "question__title_slug": "next-greater-element-iii", "question__hide": false, - "total_acs": 20847, - "total_submitted": 62189, - "total_column_articles": 316, + "total_acs": 21210, + "total_submitted": 63172, + "total_column_articles": 319, "frontend_question_id": "556", "is_new_question": false }, @@ -44721,8 +45015,8 @@ "question__title": "Split Concatenated Strings", "question__title_slug": "split-concatenated-strings", "question__hide": false, - "total_acs": 1451, - "total_submitted": 3953, + "total_acs": 1460, + "total_submitted": 3975, "total_column_articles": 28, "frontend_question_id": "555", "is_new_question": false @@ -44742,9 +45036,9 @@ "question__title": "Brick Wall", "question__title_slug": "brick-wall", "question__hide": false, - "total_acs": 52104, - "total_submitted": 102423, - "total_column_articles": 532, + "total_acs": 52448, + "total_submitted": 103047, + "total_column_articles": 534, "frontend_question_id": "554", "is_new_question": false }, @@ -44763,9 +45057,9 @@ "question__title": "Optimal Division", "question__title_slug": "optimal-division", "question__hide": false, - "total_acs": 28851, - "total_submitted": 44397, - "total_column_articles": 348, + "total_acs": 28974, + "total_submitted": 44609, + "total_column_articles": 349, "frontend_question_id": "553", "is_new_question": false }, @@ -44784,8 +45078,8 @@ "question__title": "Student Attendance Record II", "question__title_slug": "student-attendance-record-ii", "question__hide": false, - "total_acs": 26012, - "total_submitted": 45121, + "total_acs": 26101, + "total_submitted": 45293, "total_column_articles": 309, "frontend_question_id": "552", "is_new_question": false @@ -44805,9 +45099,9 @@ "question__title": "Student Attendance Record I", "question__title_slug": "student-attendance-record-i", "question__hide": false, - "total_acs": 67375, - "total_submitted": 118743, - "total_column_articles": 855, + "total_acs": 67801, + "total_submitted": 119542, + "total_column_articles": 859, "frontend_question_id": "551", "is_new_question": false }, @@ -44826,8 +45120,8 @@ "question__title": "Shortest Path to Get Food", "question__title_slug": "shortest-path-to-get-food", "question__hide": false, - "total_acs": 1147, - "total_submitted": 2245, + "total_acs": 1176, + "total_submitted": 2289, "total_column_articles": 33, "frontend_question_id": "1730", "is_new_question": false @@ -44847,9 +45141,9 @@ "question__title": "Binary Tree Longest Consecutive Sequence II", "question__title_slug": "binary-tree-longest-consecutive-sequence-ii", "question__hide": false, - "total_acs": 3146, - "total_submitted": 6167, - "total_column_articles": 66, + "total_acs": 3186, + "total_submitted": 6232, + "total_column_articles": 67, "frontend_question_id": "549", "is_new_question": false }, @@ -44868,9 +45162,9 @@ "question__title": "Split Array with Equal Sum", "question__title_slug": "split-array-with-equal-sum", "question__hide": false, - "total_acs": 2028, - "total_submitted": 5494, - "total_column_articles": 48, + "total_acs": 2051, + "total_submitted": 5531, + "total_column_articles": 50, "frontend_question_id": "548", "is_new_question": false }, @@ -44889,9 +45183,9 @@ "question__title": "Number of Provinces", "question__title_slug": "number-of-provinces", "question__hide": false, - "total_acs": 216778, - "total_submitted": 348882, - "total_column_articles": 1540, + "total_acs": 219073, + "total_submitted": 352535, + "total_column_articles": 1551, "frontend_question_id": "547", "is_new_question": false }, @@ -44910,8 +45204,8 @@ "question__title": "Remove Boxes", "question__title_slug": "remove-boxes", "question__hide": false, - "total_acs": 16496, - "total_submitted": 26471, + "total_acs": 16561, + "total_submitted": 26609, "total_column_articles": 130, "frontend_question_id": "546", "is_new_question": false @@ -44931,9 +45225,9 @@ "question__title": "Boundary of Binary Tree", "question__title_slug": "boundary-of-binary-tree", "question__hide": false, - "total_acs": 4657, - "total_submitted": 10630, - "total_column_articles": 91, + "total_acs": 4705, + "total_submitted": 10723, + "total_column_articles": 92, "frontend_question_id": "545", "is_new_question": false }, @@ -44952,8 +45246,8 @@ "question__title": "Output Contest Matches", "question__title_slug": "output-contest-matches", "question__hide": false, - "total_acs": 2897, - "total_submitted": 4048, + "total_acs": 2923, + "total_submitted": 4087, "total_column_articles": 64, "frontend_question_id": "544", "is_new_question": false @@ -44973,9 +45267,9 @@ "question__title": "Diameter of Binary Tree", "question__title_slug": "diameter-of-binary-tree", "question__hide": false, - "total_acs": 228774, - "total_submitted": 400484, - "total_column_articles": 1695, + "total_acs": 232506, + "total_submitted": 406572, + "total_column_articles": 1717, "frontend_question_id": "543", "is_new_question": false }, @@ -44994,9 +45288,9 @@ "question__title": "01 Matrix", "question__title_slug": "01-matrix", "question__hide": false, - "total_acs": 106063, - "total_submitted": 229179, - "total_column_articles": 933, + "total_acs": 107216, + "total_submitted": 231607, + "total_column_articles": 935, "frontend_question_id": "542", "is_new_question": false }, @@ -45015,9 +45309,9 @@ "question__title": "Reverse String II", "question__title_slug": "reverse-string-ii", "question__hide": false, - "total_acs": 120949, - "total_submitted": 203584, - "total_column_articles": 1112, + "total_acs": 123456, + "total_submitted": 207898, + "total_column_articles": 1120, "frontend_question_id": "541", "is_new_question": false }, @@ -45036,9 +45330,9 @@ "question__title": "Single Element in a Sorted Array", "question__title_slug": "single-element-in-a-sorted-array", "question__hide": false, - "total_acs": 98415, - "total_submitted": 161814, - "total_column_articles": 955, + "total_acs": 99236, + "total_submitted": 163166, + "total_column_articles": 958, "frontend_question_id": "540", "is_new_question": false }, @@ -45057,9 +45351,9 @@ "question__title": "Minimum Time Difference", "question__title_slug": "minimum-time-difference", "question__hide": false, - "total_acs": 54092, - "total_submitted": 81336, - "total_column_articles": 614, + "total_acs": 54420, + "total_submitted": 81874, + "total_column_articles": 617, "frontend_question_id": "539", "is_new_question": false }, @@ -45078,9 +45372,9 @@ "question__title": "Convert BST to Greater Tree", "question__title_slug": "convert-bst-to-greater-tree", "question__hide": false, - "total_acs": 166010, - "total_submitted": 224064, - "total_column_articles": 1185, + "total_acs": 168787, + "total_submitted": 227435, + "total_column_articles": 1200, "frontend_question_id": "538", "is_new_question": false }, @@ -45099,9 +45393,9 @@ "question__title": "Complex Number Multiplication", "question__title_slug": "complex-number-multiplication", "question__hide": false, - "total_acs": 40725, - "total_submitted": 54408, - "total_column_articles": 625, + "total_acs": 40869, + "total_submitted": 54612, + "total_column_articles": 626, "frontend_question_id": "537", "is_new_question": false }, @@ -45120,9 +45414,9 @@ "question__title": "Construct Binary Tree from String", "question__title_slug": "construct-binary-tree-from-string", "question__hide": false, - "total_acs": 4650, - "total_submitted": 8565, - "total_column_articles": 79, + "total_acs": 4707, + "total_submitted": 8699, + "total_column_articles": 80, "frontend_question_id": "536", "is_new_question": false }, @@ -45141,9 +45435,9 @@ "question__title": "Encode and Decode TinyURL", "question__title_slug": "encode-and-decode-tinyurl", "question__hide": false, - "total_acs": 19018, - "total_submitted": 22426, - "total_column_articles": 130, + "total_acs": 36853, + "total_submitted": 42041, + "total_column_articles": 238, "frontend_question_id": "535", "is_new_question": false }, @@ -45162,8 +45456,8 @@ "question__title": "Lonely Pixel II", "question__title_slug": "lonely-pixel-ii", "question__hide": false, - "total_acs": 2187, - "total_submitted": 4128, + "total_acs": 2202, + "total_submitted": 4156, "total_column_articles": 41, "frontend_question_id": "533", "is_new_question": false @@ -45183,9 +45477,9 @@ "question__title": "K-diff Pairs in an Array", "question__title_slug": "k-diff-pairs-in-an-array", "question__hide": false, - "total_acs": 56052, - "total_submitted": 124582, - "total_column_articles": 651, + "total_acs": 57174, + "total_submitted": 126792, + "total_column_articles": 658, "frontend_question_id": "532", "is_new_question": false }, @@ -45204,8 +45498,8 @@ "question__title": "Lonely Pixel I", "question__title_slug": "lonely-pixel-i", "question__hide": false, - "total_acs": 4978, - "total_submitted": 7682, + "total_acs": 5017, + "total_submitted": 7749, "total_column_articles": 97, "frontend_question_id": "531", "is_new_question": false @@ -45225,9 +45519,9 @@ "question__title": "Minimum Absolute Difference in BST", "question__title_slug": "minimum-absolute-difference-in-bst", "question__hide": false, - "total_acs": 120245, - "total_submitted": 190882, - "total_column_articles": 866, + "total_acs": 122158, + "total_submitted": 193895, + "total_column_articles": 878, "frontend_question_id": "530", "is_new_question": false }, @@ -45246,9 +45540,9 @@ "question__title": "Minesweeper", "question__title_slug": "minesweeper", "question__hide": false, - "total_acs": 45426, - "total_submitted": 70566, - "total_column_articles": 533, + "total_acs": 45638, + "total_submitted": 70925, + "total_column_articles": 535, "frontend_question_id": "529", "is_new_question": false }, @@ -45267,9 +45561,9 @@ "question__title": "Swapping Nodes in a Linked List", "question__title_slug": "swapping-nodes-in-a-linked-list", "question__hide": false, - "total_acs": 15309, - "total_submitted": 23982, - "total_column_articles": 227, + "total_acs": 15472, + "total_submitted": 24258, + "total_column_articles": 228, "frontend_question_id": "1721", "is_new_question": false }, @@ -45288,9 +45582,9 @@ "question__title": "Word Abbreviation", "question__title_slug": "word-abbreviation", "question__hide": false, - "total_acs": 2389, - "total_submitted": 4032, - "total_column_articles": 34, + "total_acs": 2408, + "total_submitted": 4062, + "total_column_articles": 36, "frontend_question_id": "527", "is_new_question": false }, @@ -45309,9 +45603,9 @@ "question__title": "Beautiful Arrangement", "question__title_slug": "beautiful-arrangement", "question__hide": false, - "total_acs": 39752, - "total_submitted": 54189, - "total_column_articles": 446, + "total_acs": 40015, + "total_submitted": 54542, + "total_column_articles": 447, "frontend_question_id": "526", "is_new_question": false }, @@ -45330,9 +45624,9 @@ "question__title": "Contiguous Array", "question__title_slug": "contiguous-array", "question__hide": false, - "total_acs": 56963, - "total_submitted": 104683, - "total_column_articles": 614, + "total_acs": 57491, + "total_submitted": 105605, + "total_column_articles": 619, "frontend_question_id": "525", "is_new_question": false }, @@ -45351,9 +45645,9 @@ "question__title": "Longest Word in Dictionary through Deleting", "question__title_slug": "longest-word-in-dictionary-through-deleting", "question__hide": false, - "total_acs": 87734, - "total_submitted": 175782, - "total_column_articles": 867, + "total_acs": 88411, + "total_submitted": 177074, + "total_column_articles": 868, "frontend_question_id": "524", "is_new_question": false }, @@ -45372,9 +45666,9 @@ "question__title": "Continuous Subarray Sum", "question__title_slug": "continuous-subarray-sum", "question__hide": false, - "total_acs": 82177, - "total_submitted": 292647, - "total_column_articles": 700, + "total_acs": 82867, + "total_submitted": 294862, + "total_column_articles": 705, "frontend_question_id": "523", "is_new_question": false }, @@ -45393,9 +45687,9 @@ "question__title": "Longest Uncommon Subsequence II", "question__title_slug": "longest-uncommon-subsequence-ii", "question__hide": false, - "total_acs": 9725, - "total_submitted": 25956, - "total_column_articles": 146, + "total_acs": 28291, + "total_submitted": 58059, + "total_column_articles": 327, "frontend_question_id": "522", "is_new_question": false }, @@ -45414,8 +45708,8 @@ "question__title": "Longest Uncommon Subsequence I", "question__title_slug": "longest-uncommon-subsequence-i", "question__hide": false, - "total_acs": 56270, - "total_submitted": 76262, + "total_acs": 57384, + "total_submitted": 77830, "total_column_articles": 511, "frontend_question_id": "521", "is_new_question": false @@ -45435,9 +45729,9 @@ "question__title": "Detect Capital", "question__title_slug": "detect-capital", "question__hide": false, - "total_acs": 75339, - "total_submitted": 131432, - "total_column_articles": 1147, + "total_acs": 75800, + "total_submitted": 132306, + "total_column_articles": 1153, "frontend_question_id": "520", "is_new_question": false }, @@ -45456,8 +45750,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": 145, - "total_submitted": 283, + "total_acs": 155, + "total_submitted": 298, "total_column_articles": 6, "frontend_question_id": "1983", "is_new_question": false @@ -45477,9 +45771,9 @@ "question__title": "Coin Change 2", "question__title_slug": "coin-change-2", "question__hide": false, - "total_acs": 168643, - "total_submitted": 245575, - "total_column_articles": 963, + "total_acs": 171530, + "total_submitted": 249315, + "total_column_articles": 973, "frontend_question_id": "518", "is_new_question": false }, @@ -45498,8 +45792,8 @@ "question__title": "Super Washing Machines", "question__title_slug": "super-washing-machines", "question__hide": false, - "total_acs": 21480, - "total_submitted": 42042, + "total_acs": 21562, + "total_submitted": 42192, "total_column_articles": 189, "frontend_question_id": "517", "is_new_question": false @@ -45519,9 +45813,9 @@ "question__title": "Longest Palindromic Subsequence", "question__title_slug": "longest-palindromic-subsequence", "question__hide": false, - "total_acs": 128823, - "total_submitted": 193433, - "total_column_articles": 858, + "total_acs": 130934, + "total_submitted": 196618, + "total_column_articles": 867, "frontend_question_id": "516", "is_new_question": false }, @@ -45540,9 +45834,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": 65794, - "total_submitted": 100015, - "total_column_articles": 660, + "total_acs": 91004, + "total_submitted": 137448, + "total_column_articles": 928, "frontend_question_id": "515", "is_new_question": false }, @@ -45561,9 +45855,9 @@ "question__title": "Freedom Trail", "question__title_slug": "freedom-trail", "question__hide": false, - "total_acs": 23064, - "total_submitted": 45661, - "total_column_articles": 278, + "total_acs": 23243, + "total_submitted": 46001, + "total_column_articles": 279, "frontend_question_id": "514", "is_new_question": false }, @@ -45582,9 +45876,9 @@ "question__title": "Find Bottom Left Tree Value", "question__title_slug": "find-bottom-left-tree-value", "question__hide": false, - "total_acs": 95663, - "total_submitted": 130819, - "total_column_articles": 975, + "total_acs": 125102, + "total_submitted": 167909, + "total_column_articles": 1245, "frontend_question_id": "513", "is_new_question": false }, @@ -45603,8 +45897,8 @@ "question__title": "Maximum Alternating Subarray Sum", "question__title_slug": "maximum-alternating-subarray-sum", "question__hide": false, - "total_acs": 246, - "total_submitted": 581, + "total_acs": 249, + "total_submitted": 591, "total_column_articles": 17, "frontend_question_id": "2036", "is_new_question": false @@ -45624,9 +45918,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": 2961, - "total_submitted": 7891, - "total_column_articles": 43, + "total_acs": 2981, + "total_submitted": 7934, + "total_column_articles": 44, "frontend_question_id": "1059", "is_new_question": false }, @@ -45645,8 +45939,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": 429, - "total_submitted": 787, + "total_acs": 434, + "total_submitted": 794, "total_column_articles": 15, "frontend_question_id": "2031", "is_new_question": false @@ -45666,9 +45960,9 @@ "question__title": "Inorder Successor in BST II", "question__title_slug": "inorder-successor-in-bst-ii", "question__hide": false, - "total_acs": 4660, - "total_submitted": 7693, - "total_column_articles": 67, + "total_acs": 4720, + "total_submitted": 7786, + "total_column_articles": 68, "frontend_question_id": "510", "is_new_question": false }, @@ -45687,9 +45981,9 @@ "question__title": "Most Frequent Subtree Sum", "question__title_slug": "most-frequent-subtree-sum", "question__hide": false, - "total_acs": 19002, - "total_submitted": 27599, - "total_column_articles": 295, + "total_acs": 39182, + "total_submitted": 51967, + "total_column_articles": 534, "frontend_question_id": "508", "is_new_question": false }, @@ -45708,9 +46002,9 @@ "question__title": "Perfect Number", "question__title_slug": "perfect-number", "question__hide": false, - "total_acs": 66070, - "total_submitted": 134637, - "total_column_articles": 477, + "total_acs": 66437, + "total_submitted": 135393, + "total_column_articles": 479, "frontend_question_id": "507", "is_new_question": false }, @@ -45729,9 +46023,9 @@ "question__title": "Relative Ranks", "question__title_slug": "relative-ranks", "question__hide": false, - "total_acs": 64999, - "total_submitted": 99711, - "total_column_articles": 840, + "total_acs": 65477, + "total_submitted": 100491, + "total_column_articles": 844, "frontend_question_id": "506", "is_new_question": false }, @@ -45750,9 +46044,9 @@ "question__title": "The Maze II", "question__title_slug": "the-maze-ii", "question__hide": false, - "total_acs": 7557, - "total_submitted": 15083, - "total_column_articles": 91, + "total_acs": 7668, + "total_submitted": 15285, + "total_column_articles": 92, "frontend_question_id": "505", "is_new_question": false }, @@ -45771,9 +46065,9 @@ "question__title": "Base 7", "question__title_slug": "base-7", "question__hide": false, - "total_acs": 74964, - "total_submitted": 143921, - "total_column_articles": 750, + "total_acs": 75351, + "total_submitted": 144667, + "total_column_articles": 751, "frontend_question_id": "504", "is_new_question": false }, @@ -45792,9 +46086,9 @@ "question__title": "Next Greater Element II", "question__title_slug": "next-greater-element-ii", "question__hide": false, - "total_acs": 145811, - "total_submitted": 222855, - "total_column_articles": 1281, + "total_acs": 147903, + "total_submitted": 225776, + "total_column_articles": 1290, "frontend_question_id": "503", "is_new_question": false }, @@ -45813,9 +46107,9 @@ "question__title": "IPO", "question__title_slug": "ipo", "question__hide": false, - "total_acs": 32154, - "total_submitted": 72290, - "total_column_articles": 382, + "total_acs": 32308, + "total_submitted": 72572, + "total_column_articles": 384, "frontend_question_id": "502", "is_new_question": false }, @@ -45834,9 +46128,9 @@ "question__title": "Find Mode in Binary Search Tree", "question__title_slug": "find-mode-in-binary-search-tree", "question__hide": false, - "total_acs": 105008, - "total_submitted": 196548, - "total_column_articles": 780, + "total_acs": 106908, + "total_submitted": 199978, + "total_column_articles": 794, "frontend_question_id": "501", "is_new_question": false }, @@ -45855,9 +46149,9 @@ "question__title": "Keyboard Row", "question__title_slug": "keyboard-row", "question__hide": false, - "total_acs": 59345, - "total_submitted": 79761, - "total_column_articles": 858, + "total_acs": 59784, + "total_submitted": 80316, + "total_column_articles": 862, "frontend_question_id": "500", "is_new_question": false }, @@ -45876,8 +46170,8 @@ "question__title": "The Maze III", "question__title_slug": "the-maze-iii", "question__hide": false, - "total_acs": 3408, - "total_submitted": 8607, + "total_acs": 3463, + "total_submitted": 8702, "total_column_articles": 66, "frontend_question_id": "499", "is_new_question": false @@ -45897,9 +46191,9 @@ "question__title": "Diagonal Traverse", "question__title_slug": "diagonal-traverse", "question__hide": false, - "total_acs": 84776, - "total_submitted": 154346, - "total_column_articles": 943, + "total_acs": 85981, + "total_submitted": 156260, + "total_column_articles": 953, "frontend_question_id": "498", "is_new_question": false }, @@ -45918,9 +46212,9 @@ "question__title": "Next Greater Element I", "question__title_slug": "next-greater-element-i", "question__hide": false, - "total_acs": 190829, - "total_submitted": 267429, - "total_column_articles": 1835, + "total_acs": 193493, + "total_submitted": 270985, + "total_column_articles": 1841, "frontend_question_id": "496", "is_new_question": false }, @@ -45939,9 +46233,9 @@ "question__title": "Teemo Attacking", "question__title_slug": "teemo-attacking", "question__hide": false, - "total_acs": 75144, - "total_submitted": 124585, - "total_column_articles": 1050, + "total_acs": 75685, + "total_submitted": 125496, + "total_column_articles": 1053, "frontend_question_id": "495", "is_new_question": false }, @@ -45960,9 +46254,9 @@ "question__title": "Target Sum", "question__title_slug": "target-sum", "question__hide": false, - "total_acs": 238248, - "total_submitted": 485357, - "total_column_articles": 1462, + "total_acs": 242813, + "total_submitted": 494287, + "total_column_articles": 1483, "frontend_question_id": "494", "is_new_question": false }, @@ -45981,9 +46275,9 @@ "question__title": "Reverse Pairs", "question__title_slug": "reverse-pairs", "question__hide": false, - "total_acs": 31810, - "total_submitted": 89659, - "total_column_articles": 325, + "total_acs": 32153, + "total_submitted": 90504, + "total_column_articles": 327, "frontend_question_id": "493", "is_new_question": false }, @@ -46002,8 +46296,8 @@ "question__title": "Construct the Rectangle", "question__title_slug": "construct-the-rectangle", "question__hide": false, - "total_acs": 49777, - "total_submitted": 81901, + "total_acs": 50016, + "total_submitted": 82298, "total_column_articles": 471, "frontend_question_id": "492", "is_new_question": false @@ -46023,9 +46317,9 @@ "question__title": "Increasing Subsequences", "question__title_slug": "increasing-subsequences", "question__hide": false, - "total_acs": 83142, - "total_submitted": 157147, - "total_column_articles": 638, + "total_acs": 84894, + "total_submitted": 160410, + "total_column_articles": 648, "frontend_question_id": "491", "is_new_question": false }, @@ -46044,9 +46338,9 @@ "question__title": "The Maze", "question__title_slug": "the-maze", "question__hide": false, - "total_acs": 9131, - "total_submitted": 18496, - "total_column_articles": 109, + "total_acs": 9277, + "total_submitted": 18737, + "total_column_articles": 111, "frontend_question_id": "490", "is_new_question": false }, @@ -46065,9 +46359,9 @@ "question__title": "Kth Smallest Instructions", "question__title_slug": "kth-smallest-instructions", "question__hide": false, - "total_acs": 2652, - "total_submitted": 5697, - "total_column_articles": 53, + "total_acs": 2671, + "total_submitted": 5741, + "total_column_articles": 54, "frontend_question_id": "1643", "is_new_question": false }, @@ -46086,8 +46380,8 @@ "question__title": "Zuma Game", "question__title_slug": "zuma-game", "question__hide": false, - "total_acs": 18868, - "total_submitted": 37199, + "total_acs": 18948, + "total_submitted": 37356, "total_column_articles": 179, "frontend_question_id": "488", "is_new_question": false @@ -46107,9 +46401,9 @@ "question__title": "Max Consecutive Ones II", "question__title_slug": "max-consecutive-ones-ii", "question__hide": false, - "total_acs": 10181, - "total_submitted": 17539, - "total_column_articles": 187, + "total_acs": 10337, + "total_submitted": 17835, + "total_column_articles": 188, "frontend_question_id": "487", "is_new_question": false }, @@ -46128,9 +46422,9 @@ "question__title": "Predict the Winner", "question__title_slug": "predict-the-winner", "question__hide": false, - "total_acs": 56203, - "total_submitted": 95069, - "total_column_articles": 461, + "total_acs": 56681, + "total_submitted": 95791, + "total_column_articles": 465, "frontend_question_id": "486", "is_new_question": false }, @@ -46149,9 +46443,9 @@ "question__title": "Max Consecutive Ones", "question__title_slug": "max-consecutive-ones", "question__hide": false, - "total_acs": 157655, - "total_submitted": 257779, - "total_column_articles": 1260, + "total_acs": 159024, + "total_submitted": 259990, + "total_column_articles": 1266, "frontend_question_id": "485", "is_new_question": false }, @@ -46170,8 +46464,8 @@ "question__title": "Find Permutation", "question__title_slug": "find-permutation", "question__hide": false, - "total_acs": 1987, - "total_submitted": 3266, + "total_acs": 2006, + "total_submitted": 3296, "total_column_articles": 42, "frontend_question_id": "484", "is_new_question": false @@ -46191,9 +46485,9 @@ "question__title": "Smallest Good Base", "question__title_slug": "smallest-good-base", "question__hide": false, - "total_acs": 17663, - "total_submitted": 29845, - "total_column_articles": 135, + "total_acs": 17755, + "total_submitted": 29994, + "total_column_articles": 137, "frontend_question_id": "483", "is_new_question": false }, @@ -46212,9 +46506,9 @@ "question__title": "License Key Formatting", "question__title_slug": "license-key-formatting", "question__hide": false, - "total_acs": 47659, - "total_submitted": 101382, - "total_column_articles": 498, + "total_acs": 48013, + "total_submitted": 102119, + "total_column_articles": 502, "frontend_question_id": "482", "is_new_question": false }, @@ -46233,9 +46527,9 @@ "question__title": "Magical String", "question__title_slug": "magical-string", "question__hide": false, - "total_acs": 7828, - "total_submitted": 13762, - "total_column_articles": 138, + "total_acs": 7921, + "total_submitted": 13896, + "total_column_articles": 140, "frontend_question_id": "481", "is_new_question": false }, @@ -46254,8 +46548,8 @@ "question__title": "Sliding Window Median", "question__title_slug": "sliding-window-median", "question__hide": false, - "total_acs": 34506, - "total_submitted": 77327, + "total_acs": 34686, + "total_submitted": 77718, "total_column_articles": 456, "frontend_question_id": "480", "is_new_question": false @@ -46275,9 +46569,9 @@ "question__title": "Largest Palindrome Product", "question__title_slug": "largest-palindrome-product", "question__hide": false, - "total_acs": 21613, - "total_submitted": 34472, - "total_column_articles": 163, + "total_acs": 21652, + "total_submitted": 34542, + "total_column_articles": 162, "frontend_question_id": "479", "is_new_question": false }, @@ -46296,9 +46590,9 @@ "question__title": "Total Hamming Distance", "question__title_slug": "total-hamming-distance", "question__hide": false, - "total_acs": 42253, - "total_submitted": 69801, - "total_column_articles": 359, + "total_acs": 42366, + "total_submitted": 69986, + "total_column_articles": 360, "frontend_question_id": "477", "is_new_question": false }, @@ -46317,9 +46611,9 @@ "question__title": "Number Complement", "question__title_slug": "number-complement", "question__hide": false, - "total_acs": 71286, - "total_submitted": 100458, - "total_column_articles": 951, + "total_acs": 71648, + "total_submitted": 101006, + "total_column_articles": 958, "frontend_question_id": "476", "is_new_question": false }, @@ -46338,9 +46632,9 @@ "question__title": "Heaters", "question__title_slug": "heaters", "question__hide": false, - "total_acs": 59774, - "total_submitted": 146690, - "total_column_articles": 632, + "total_acs": 60268, + "total_submitted": 147926, + "total_column_articles": 637, "frontend_question_id": "475", "is_new_question": false }, @@ -46359,9 +46653,9 @@ "question__title": "Ones and Zeroes", "question__title_slug": "ones-and-zeroes", "question__hide": false, - "total_acs": 110795, - "total_submitted": 174907, - "total_column_articles": 829, + "total_acs": 112563, + "total_submitted": 177428, + "total_column_articles": 839, "frontend_question_id": "474", "is_new_question": false }, @@ -46380,9 +46674,9 @@ "question__title": "Matchsticks to Square", "question__title_slug": "matchsticks-to-square", "question__hide": false, - "total_acs": 56904, - "total_submitted": 122502, - "total_column_articles": 440, + "total_acs": 57850, + "total_submitted": 124806, + "total_column_articles": 446, "frontend_question_id": "473", "is_new_question": false }, @@ -46401,9 +46695,9 @@ "question__title": "Concatenated Words", "question__title_slug": "concatenated-words", "question__hide": false, - "total_acs": 23775, - "total_submitted": 47140, - "total_column_articles": 241, + "total_acs": 23979, + "total_submitted": 47423, + "total_column_articles": 243, "frontend_question_id": "472", "is_new_question": false }, @@ -46422,8 +46716,8 @@ "question__title": "Encode String with Shortest Length", "question__title_slug": "encode-string-with-shortest-length", "question__hide": false, - "total_acs": 2009, - "total_submitted": 3302, + "total_acs": 2043, + "total_submitted": 3371, "total_column_articles": 34, "frontend_question_id": "471", "is_new_question": false @@ -46443,8 +46737,8 @@ "question__title": "Convex Polygon", "question__title_slug": "convex-polygon", "question__hide": false, - "total_acs": 1980, - "total_submitted": 4592, + "total_acs": 1997, + "total_submitted": 4633, "total_column_articles": 26, "frontend_question_id": "469", "is_new_question": false @@ -46464,9 +46758,9 @@ "question__title": "Validate IP Address", "question__title_slug": "validate-ip-address", "question__hide": false, - "total_acs": 53023, - "total_submitted": 187882, - "total_column_articles": 635, + "total_acs": 53547, + "total_submitted": 189774, + "total_column_articles": 639, "frontend_question_id": "468", "is_new_question": false }, @@ -46485,9 +46779,9 @@ "question__title": "Unique Substrings in Wraparound String", "question__title_slug": "unique-substrings-in-wraparound-string", "question__hide": false, - "total_acs": 32568, - "total_submitted": 62906, - "total_column_articles": 341, + "total_acs": 32771, + "total_submitted": 63276, + "total_column_articles": 343, "frontend_question_id": "467", "is_new_question": false }, @@ -46506,8 +46800,8 @@ "question__title": "Count The Repetitions", "question__title_slug": "count-the-repetitions", "question__hide": false, - "total_acs": 12533, - "total_submitted": 33469, + "total_acs": 12569, + "total_submitted": 33587, "total_column_articles": 192, "frontend_question_id": "466", "is_new_question": false @@ -46527,8 +46821,8 @@ "question__title": "Optimal Account Balancing", "question__title_slug": "optimal-account-balancing", "question__hide": false, - "total_acs": 2140, - "total_submitted": 3963, + "total_acs": 2157, + "total_submitted": 3999, "total_column_articles": 30, "frontend_question_id": "465", "is_new_question": false @@ -46548,8 +46842,8 @@ "question__title": "Can I Win", "question__title_slug": "can-i-win", "question__hide": false, - "total_acs": 32555, - "total_submitted": 77252, + "total_acs": 32751, + "total_submitted": 77845, "total_column_articles": 255, "frontend_question_id": "464", "is_new_question": false @@ -46569,9 +46863,9 @@ "question__title": "Island Perimeter", "question__title_slug": "island-perimeter", "question__hide": false, - "total_acs": 100575, - "total_submitted": 143100, - "total_column_articles": 1159, + "total_acs": 101694, + "total_submitted": 144676, + "total_column_articles": 1171, "frontend_question_id": "463", "is_new_question": false }, @@ -46590,9 +46884,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": 46042, - "total_submitted": 74094, - "total_column_articles": 475, + "total_acs": 46250, + "total_submitted": 74414, + "total_column_articles": 474, "frontend_question_id": "462", "is_new_question": false }, @@ -46611,9 +46905,9 @@ "question__title": "Hamming Distance", "question__title_slug": "hamming-distance", "question__hide": false, - "total_acs": 219801, - "total_submitted": 269071, - "total_column_articles": 1701, + "total_acs": 222168, + "total_submitted": 271900, + "total_column_articles": 1731, "frontend_question_id": "461", "is_new_question": false }, @@ -46632,9 +46926,9 @@ "question__title": "LFU Cache", "question__title_slug": "lfu-cache", "question__hide": false, - "total_acs": 49461, - "total_submitted": 112320, - "total_column_articles": 526, + "total_acs": 50142, + "total_submitted": 113901, + "total_column_articles": 527, "frontend_question_id": "460", "is_new_question": false }, @@ -46653,9 +46947,9 @@ "question__title": "Repeated Substring Pattern", "question__title_slug": "repeated-substring-pattern", "question__hide": false, - "total_acs": 120450, - "total_submitted": 236837, - "total_column_articles": 908, + "total_acs": 122518, + "total_submitted": 240745, + "total_column_articles": 915, "frontend_question_id": "459", "is_new_question": false }, @@ -46674,9 +46968,9 @@ "question__title": "Poor Pigs", "question__title_slug": "poor-pigs", "question__hide": false, - "total_acs": 24768, - "total_submitted": 35461, - "total_column_articles": 223, + "total_acs": 24842, + "total_submitted": 35574, + "total_column_articles": 225, "frontend_question_id": "458", "is_new_question": false }, @@ -46695,9 +46989,9 @@ "question__title": "Circular Array Loop", "question__title_slug": "circular-array-loop", "question__hide": false, - "total_acs": 32149, - "total_submitted": 73941, - "total_column_articles": 349, + "total_acs": 32284, + "total_submitted": 74308, + "total_column_articles": 350, "frontend_question_id": "457", "is_new_question": false }, @@ -46716,9 +47010,9 @@ "question__title": "132 Pattern", "question__title_slug": "132-pattern", "question__hide": false, - "total_acs": 67049, - "total_submitted": 184225, - "total_column_articles": 543, + "total_acs": 67503, + "total_submitted": 185395, + "total_column_articles": 545, "frontend_question_id": "456", "is_new_question": false }, @@ -46737,9 +47031,9 @@ "question__title": "Assign Cookies", "question__title_slug": "assign-cookies", "question__hide": false, - "total_acs": 226443, - "total_submitted": 395452, - "total_column_articles": 1754, + "total_acs": 229563, + "total_submitted": 401098, + "total_column_articles": 1773, "frontend_question_id": "455", "is_new_question": false }, @@ -46758,9 +47052,9 @@ "question__title": "4Sum II", "question__title_slug": "4sum-ii", "question__hide": false, - "total_acs": 127125, - "total_submitted": 202047, - "total_column_articles": 789, + "total_acs": 129293, + "total_submitted": 205262, + "total_column_articles": 800, "frontend_question_id": "454", "is_new_question": false }, @@ -46779,8 +47073,8 @@ "question__title": "Minimum Moves to Equal Array Elements", "question__title_slug": "minimum-moves-to-equal-array-elements", "question__hide": false, - "total_acs": 65553, - "total_submitted": 106720, + "total_acs": 65944, + "total_submitted": 107317, "total_column_articles": 763, "frontend_question_id": "453", "is_new_question": false @@ -46800,9 +47094,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": 144325, - "total_submitted": 284950, - "total_column_articles": 1165, + "total_acs": 146449, + "total_submitted": 289122, + "total_column_articles": 1184, "frontend_question_id": "452", "is_new_question": false }, @@ -46821,9 +47115,9 @@ "question__title": "Sort Characters By Frequency", "question__title_slug": "sort-characters-by-frequency", "question__hide": false, - "total_acs": 102877, - "total_submitted": 143533, - "total_column_articles": 1145, + "total_acs": 103793, + "total_submitted": 144805, + "total_column_articles": 1156, "frontend_question_id": "451", "is_new_question": false }, @@ -46842,9 +47136,9 @@ "question__title": "Delete Node in a BST", "question__title_slug": "delete-node-in-a-bst", "question__hide": false, - "total_acs": 139148, - "total_submitted": 267575, - "total_column_articles": 1462, + "total_acs": 142021, + "total_submitted": 272997, + "total_column_articles": 1471, "frontend_question_id": "450", "is_new_question": false }, @@ -46863,9 +47157,9 @@ "question__title": "Serialize and Deserialize BST", "question__title_slug": "serialize-and-deserialize-bst", "question__hide": false, - "total_acs": 43030, - "total_submitted": 71072, - "total_column_articles": 391, + "total_acs": 43290, + "total_submitted": 71565, + "total_column_articles": 395, "frontend_question_id": "449", "is_new_question": false }, @@ -46884,9 +47178,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": 204495, - "total_submitted": 310962, - "total_column_articles": 1487, + "total_acs": 207536, + "total_submitted": 315426, + "total_column_articles": 1508, "frontend_question_id": "448", "is_new_question": false }, @@ -46905,8 +47199,8 @@ "question__title": "Number of Boomerangs", "question__title_slug": "number-of-boomerangs", "question__hide": false, - "total_acs": 52215, - "total_submitted": 78465, + "total_acs": 52342, + "total_submitted": 78636, "total_column_articles": 418, "frontend_question_id": "447", "is_new_question": false @@ -46926,9 +47220,9 @@ "question__title": "Arithmetic Slices II - Subsequence", "question__title_slug": "arithmetic-slices-ii-subsequence", "question__hide": false, - "total_acs": 21279, - "total_submitted": 38711, - "total_column_articles": 184, + "total_acs": 21353, + "total_submitted": 38847, + "total_column_articles": 185, "frontend_question_id": "446", "is_new_question": false }, @@ -46947,9 +47241,9 @@ "question__title": "Add Two Numbers II", "question__title_slug": "add-two-numbers-ii", "question__hide": false, - "total_acs": 103898, - "total_submitted": 173774, - "total_column_articles": 1157, + "total_acs": 104760, + "total_submitted": 175117, + "total_column_articles": 1163, "frontend_question_id": "445", "is_new_question": false }, @@ -46968,8 +47262,8 @@ "question__title": "Sequence Reconstruction", "question__title_slug": "sequence-reconstruction", "question__hide": false, - "total_acs": 4559, - "total_submitted": 16277, + "total_acs": 4628, + "total_submitted": 16404, "total_column_articles": 73, "frontend_question_id": "444", "is_new_question": false @@ -46989,9 +47283,9 @@ "question__title": "String Compression", "question__title_slug": "string-compression", "question__hide": false, - "total_acs": 66727, - "total_submitted": 139756, - "total_column_articles": 788, + "total_acs": 67342, + "total_submitted": 141099, + "total_column_articles": 791, "frontend_question_id": "443", "is_new_question": false }, @@ -47010,9 +47304,9 @@ "question__title": "Find All Duplicates in an Array", "question__title_slug": "find-all-duplicates-in-an-array", "question__hide": false, - "total_acs": 92249, - "total_submitted": 123237, - "total_column_articles": 885, + "total_acs": 92963, + "total_submitted": 124165, + "total_column_articles": 893, "frontend_question_id": "442", "is_new_question": false }, @@ -47031,9 +47325,9 @@ "question__title": "Arranging Coins", "question__title_slug": "arranging-coins", "question__hide": false, - "total_acs": 96522, - "total_submitted": 211108, - "total_column_articles": 920, + "total_acs": 97672, + "total_submitted": 213730, + "total_column_articles": 926, "frontend_question_id": "441", "is_new_question": false }, @@ -47052,8 +47346,8 @@ "question__title": "K-th Smallest in Lexicographical Order", "question__title_slug": "k-th-smallest-in-lexicographical-order", "question__hide": false, - "total_acs": 41465, - "total_submitted": 97311, + "total_acs": 41787, + "total_submitted": 98012, "total_column_articles": 282, "frontend_question_id": "440", "is_new_question": false @@ -47073,9 +47367,9 @@ "question__title": "Ternary Expression Parser", "question__title_slug": "ternary-expression-parser", "question__hide": false, - "total_acs": 3514, - "total_submitted": 5868, - "total_column_articles": 81, + "total_acs": 3537, + "total_submitted": 5906, + "total_column_articles": 82, "frontend_question_id": "439", "is_new_question": false }, @@ -47094,9 +47388,9 @@ "question__title": "Find All Anagrams in a String", "question__title_slug": "find-all-anagrams-in-a-string", "question__hide": false, - "total_acs": 193383, - "total_submitted": 354137, - "total_column_articles": 1602, + "total_acs": 198481, + "total_submitted": 363174, + "total_column_articles": 1627, "frontend_question_id": "438", "is_new_question": false }, @@ -47115,9 +47409,9 @@ "question__title": "Path Sum III", "question__title_slug": "path-sum-iii", "question__hide": false, - "total_acs": 171915, - "total_submitted": 304948, - "total_column_articles": 1274, + "total_acs": 174258, + "total_submitted": 309946, + "total_column_articles": 1285, "frontend_question_id": "437", "is_new_question": false }, @@ -47136,9 +47430,9 @@ "question__title": "Find Right Interval", "question__title_slug": "find-right-interval", "question__hide": false, - "total_acs": 37540, - "total_submitted": 65962, - "total_column_articles": 503, + "total_acs": 37871, + "total_submitted": 66532, + "total_column_articles": 502, "frontend_question_id": "436", "is_new_question": false }, @@ -47157,9 +47451,9 @@ "question__title": "Non-overlapping Intervals", "question__title_slug": "non-overlapping-intervals", "question__hide": false, - "total_acs": 153042, - "total_submitted": 300892, - "total_column_articles": 1238, + "total_acs": 155558, + "total_submitted": 305622, + "total_column_articles": 1255, "frontend_question_id": "435", "is_new_question": false }, @@ -47178,9 +47472,9 @@ "question__title": "Number of Segments in a String", "question__title_slug": "number-of-segments-in-a-string", "question__hide": false, - "total_acs": 74966, - "total_submitted": 189180, - "total_column_articles": 999, + "total_acs": 75459, + "total_submitted": 190680, + "total_column_articles": 1003, "frontend_question_id": "434", "is_new_question": false }, @@ -47199,9 +47493,9 @@ "question__title": "Minimum Genetic Mutation", "question__title_slug": "minimum-genetic-mutation", "question__hide": false, - "total_acs": 44812, - "total_submitted": 81267, - "total_column_articles": 662, + "total_acs": 45094, + "total_submitted": 81826, + "total_column_articles": 664, "frontend_question_id": "433", "is_new_question": false }, @@ -47220,9 +47514,9 @@ "question__title": "All O`one Data Structure", "question__title_slug": "all-oone-data-structure", "question__hide": false, - "total_acs": 26364, - "total_submitted": 55817, - "total_column_articles": 281, + "total_acs": 26458, + "total_submitted": 56020, + "total_column_articles": 280, "frontend_question_id": "432", "is_new_question": false }, @@ -47241,9 +47535,9 @@ "question__title": "Word Squares", "question__title_slug": "word-squares", "question__hide": false, - "total_acs": 2002, - "total_submitted": 3237, - "total_column_articles": 40, + "total_acs": 2036, + "total_submitted": 3291, + "total_column_articles": 41, "frontend_question_id": "425", "is_new_question": false }, @@ -47262,9 +47556,9 @@ "question__title": "Longest Repeating Character Replacement", "question__title_slug": "longest-repeating-character-replacement", "question__hide": false, - "total_acs": 67383, - "total_submitted": 125177, - "total_column_articles": 592, + "total_acs": 68357, + "total_submitted": 126824, + "total_column_articles": 595, "frontend_question_id": "424", "is_new_question": false }, @@ -47283,9 +47577,9 @@ "question__title": "Reconstruct Original Digits from English", "question__title_slug": "reconstruct-original-digits-from-english", "question__hide": false, - "total_acs": 35834, - "total_submitted": 58673, - "total_column_articles": 414, + "total_acs": 35922, + "total_submitted": 58821, + "total_column_articles": 415, "frontend_question_id": "423", "is_new_question": false }, @@ -47304,8 +47598,8 @@ "question__title": "Valid Word Square", "question__title_slug": "valid-word-square", "question__hide": false, - "total_acs": 2815, - "total_submitted": 6472, + "total_acs": 2833, + "total_submitted": 6516, "total_column_articles": 73, "frontend_question_id": "422", "is_new_question": false @@ -47325,9 +47619,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": 38545, - "total_submitted": 62147, - "total_column_articles": 363, + "total_acs": 38777, + "total_submitted": 62587, + "total_column_articles": 366, "frontend_question_id": "421", "is_new_question": false }, @@ -47346,8 +47640,8 @@ "question__title": "Strong Password Checker", "question__title_slug": "strong-password-checker", "question__hide": false, - "total_acs": 17453, - "total_submitted": 44213, + "total_acs": 17482, + "total_submitted": 44319, "total_column_articles": 154, "frontend_question_id": "420", "is_new_question": false @@ -47367,9 +47661,9 @@ "question__title": "Battleships in a Board", "question__title_slug": "battleships-in-a-board", "question__hide": false, - "total_acs": 37392, - "total_submitted": 47424, - "total_column_articles": 488, + "total_acs": 37665, + "total_submitted": 47800, + "total_column_articles": 496, "frontend_question_id": "419", "is_new_question": false }, @@ -47388,9 +47682,9 @@ "question__title": "Sentence Screen Fitting", "question__title_slug": "sentence-screen-fitting", "question__hide": false, - "total_acs": 3109, - "total_submitted": 8190, - "total_column_articles": 47, + "total_acs": 3137, + "total_submitted": 8254, + "total_column_articles": 48, "frontend_question_id": "418", "is_new_question": false }, @@ -47409,9 +47703,9 @@ "question__title": "Pacific Atlantic Water Flow", "question__title_slug": "pacific-atlantic-water-flow", "question__hide": false, - "total_acs": 64565, - "total_submitted": 117105, - "total_column_articles": 713, + "total_acs": 65208, + "total_submitted": 118262, + "total_column_articles": 719, "frontend_question_id": "417", "is_new_question": false }, @@ -47430,9 +47724,9 @@ "question__title": "Partition Equal Subset Sum", "question__title_slug": "partition-equal-subset-sum", "question__hide": false, - "total_acs": 280126, - "total_submitted": 540050, - "total_column_articles": 1512, + "total_acs": 285206, + "total_submitted": 549360, + "total_column_articles": 1522, "frontend_question_id": "416", "is_new_question": false }, @@ -47451,9 +47745,9 @@ "question__title": "Add Strings", "question__title_slug": "add-strings", "question__hide": false, - "total_acs": 210085, - "total_submitted": 382801, - "total_column_articles": 1415, + "total_acs": 212381, + "total_submitted": 386826, + "total_column_articles": 1426, "frontend_question_id": "415", "is_new_question": false }, @@ -47472,9 +47766,9 @@ "question__title": "Third Maximum Number", "question__title_slug": "third-maximum-number", "question__hide": false, - "total_acs": 110776, - "total_submitted": 280627, - "total_column_articles": 1375, + "total_acs": 111831, + "total_submitted": 283232, + "total_column_articles": 1380, "frontend_question_id": "414", "is_new_question": false }, @@ -47493,9 +47787,9 @@ "question__title": "Arithmetic Slices", "question__title_slug": "arithmetic-slices", "question__hide": false, - "total_acs": 99403, - "total_submitted": 143127, - "total_column_articles": 1262, + "total_acs": 100336, + "total_submitted": 144436, + "total_column_articles": 1273, "frontend_question_id": "413", "is_new_question": false }, @@ -47514,9 +47808,9 @@ "question__title": "Fizz Buzz", "question__title_slug": "fizz-buzz", "question__hide": false, - "total_acs": 129283, - "total_submitted": 181585, - "total_column_articles": 749, + "total_acs": 131995, + "total_submitted": 185757, + "total_column_articles": 775, "frontend_question_id": "412", "is_new_question": false }, @@ -47535,9 +47829,9 @@ "question__title": "Minimum Unique Word Abbreviation", "question__title_slug": "minimum-unique-word-abbreviation", "question__hide": false, - "total_acs": 1218, - "total_submitted": 2473, - "total_column_articles": 30, + "total_acs": 1225, + "total_submitted": 2502, + "total_column_articles": 31, "frontend_question_id": "411", "is_new_question": false }, @@ -47556,9 +47850,9 @@ "question__title": "Split Array Largest Sum", "question__title_slug": "split-array-largest-sum", "question__hide": false, - "total_acs": 51940, - "total_submitted": 89279, - "total_column_articles": 434, + "total_acs": 52569, + "total_submitted": 90282, + "total_column_articles": 441, "frontend_question_id": "410", "is_new_question": false }, @@ -47577,9 +47871,9 @@ "question__title": "Longest Palindrome", "question__title_slug": "longest-palindrome", "question__hide": false, - "total_acs": 127464, - "total_submitted": 229337, - "total_column_articles": 1670, + "total_acs": 129154, + "total_submitted": 232234, + "total_column_articles": 1694, "frontend_question_id": "409", "is_new_question": false }, @@ -47598,9 +47892,9 @@ "question__title": "Valid Word Abbreviation", "question__title_slug": "valid-word-abbreviation", "question__hide": false, - "total_acs": 5168, - "total_submitted": 14948, - "total_column_articles": 99, + "total_acs": 5218, + "total_submitted": 15072, + "total_column_articles": 100, "frontend_question_id": "408", "is_new_question": false }, @@ -47619,8 +47913,8 @@ "question__title": "Trapping Rain Water II", "question__title_slug": "trapping-rain-water-ii", "question__hide": false, - "total_acs": 28865, - "total_submitted": 49940, + "total_acs": 29042, + "total_submitted": 50229, "total_column_articles": 273, "frontend_question_id": "407", "is_new_question": false @@ -47640,9 +47934,9 @@ "question__title": "Queue Reconstruction by Height", "question__title_slug": "queue-reconstruction-by-height", "question__hide": false, - "total_acs": 175072, - "total_submitted": 232549, - "total_column_articles": 1089, + "total_acs": 178151, + "total_submitted": 236511, + "total_column_articles": 1110, "frontend_question_id": "406", "is_new_question": false }, @@ -47661,9 +47955,9 @@ "question__title": "Convert a Number to Hexadecimal", "question__title_slug": "convert-a-number-to-hexadecimal", "question__hide": false, - "total_acs": 54416, - "total_submitted": 97799, - "total_column_articles": 537, + "total_acs": 54785, + "total_submitted": 98497, + "total_column_articles": 539, "frontend_question_id": "405", "is_new_question": false }, @@ -47682,9 +47976,9 @@ "question__title": "Sum of Left Leaves", "question__title_slug": "sum-of-left-leaves", "question__hide": false, - "total_acs": 160403, - "total_submitted": 263479, - "total_column_articles": 1602, + "total_acs": 163027, + "total_submitted": 267370, + "total_column_articles": 1626, "frontend_question_id": "404", "is_new_question": false }, @@ -47703,9 +47997,9 @@ "question__title": "Frog Jump", "question__title_slug": "frog-jump", "question__hide": false, - "total_acs": 53037, - "total_submitted": 115818, - "total_column_articles": 510, + "total_acs": 53335, + "total_submitted": 116516, + "total_column_articles": 511, "frontend_question_id": "403", "is_new_question": false }, @@ -47724,9 +48018,9 @@ "question__title": "Remove K Digits", "question__title_slug": "remove-k-digits", "question__hide": false, - "total_acs": 108831, - "total_submitted": 337220, - "total_column_articles": 787, + "total_acs": 110082, + "total_submitted": 341397, + "total_column_articles": 790, "frontend_question_id": "402", "is_new_question": false }, @@ -47745,9 +48039,9 @@ "question__title": "Binary Watch", "question__title_slug": "binary-watch", "question__hide": false, - "total_acs": 62025, - "total_submitted": 100171, - "total_column_articles": 758, + "total_acs": 62340, + "total_submitted": 100627, + "total_column_articles": 764, "frontend_question_id": "401", "is_new_question": false }, @@ -47766,9 +48060,9 @@ "question__title": "Nth Digit", "question__title_slug": "nth-digit", "question__hide": false, - "total_acs": 49399, - "total_submitted": 108396, - "total_column_articles": 541, + "total_acs": 49800, + "total_submitted": 109239, + "total_column_articles": 547, "frontend_question_id": "400", "is_new_question": false }, @@ -47787,9 +48081,9 @@ "question__title": "Evaluate Division", "question__title_slug": "evaluate-division", "question__hide": false, - "total_acs": 57573, - "total_submitted": 97118, - "total_column_articles": 683, + "total_acs": 58381, + "total_submitted": 98443, + "total_column_articles": 693, "frontend_question_id": "399", "is_new_question": false }, @@ -47808,9 +48102,9 @@ "question__title": "Random Pick Index", "question__title_slug": "random-pick-index", "question__hide": false, - "total_acs": 52330, - "total_submitted": 72006, - "total_column_articles": 423, + "total_acs": 52667, + "total_submitted": 72639, + "total_column_articles": 427, "frontend_question_id": "398", "is_new_question": false }, @@ -47829,9 +48123,9 @@ "question__title": "Integer Replacement", "question__title_slug": "integer-replacement", "question__hide": false, - "total_acs": 56185, - "total_submitted": 130984, - "total_column_articles": 618, + "total_acs": 56525, + "total_submitted": 131826, + "total_column_articles": 621, "frontend_question_id": "397", "is_new_question": false }, @@ -47850,9 +48144,9 @@ "question__title": "Rotate Function", "question__title_slug": "rotate-function", "question__hide": false, - "total_acs": 42457, - "total_submitted": 79056, - "total_column_articles": 535, + "total_acs": 42671, + "total_submitted": 79433, + "total_column_articles": 536, "frontend_question_id": "396", "is_new_question": false }, @@ -47871,9 +48165,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": 67173, - "total_submitted": 127930, - "total_column_articles": 544, + "total_acs": 67852, + "total_submitted": 129203, + "total_column_articles": 552, "frontend_question_id": "395", "is_new_question": false }, @@ -47892,9 +48186,9 @@ "question__title": "Decode String", "question__title_slug": "decode-string", "question__hide": false, - "total_acs": 175273, - "total_submitted": 311730, - "total_column_articles": 1748, + "total_acs": 177979, + "total_submitted": 316240, + "total_column_articles": 1780, "frontend_question_id": "394", "is_new_question": false }, @@ -47913,9 +48207,9 @@ "question__title": "UTF-8 Validation", "question__title_slug": "utf-8-validation", "question__hide": false, - "total_acs": 34918, - "total_submitted": 79546, - "total_column_articles": 438, + "total_acs": 35065, + "total_submitted": 79875, + "total_column_articles": 440, "frontend_question_id": "393", "is_new_question": false }, @@ -47934,9 +48228,9 @@ "question__title": "Is Subsequence", "question__title_slug": "is-subsequence", "question__hide": false, - "total_acs": 205687, - "total_submitted": 393124, - "total_column_articles": 2046, + "total_acs": 209709, + "total_submitted": 400492, + "total_column_articles": 2086, "frontend_question_id": "392", "is_new_question": false }, @@ -47955,8 +48249,8 @@ "question__title": "Perfect Rectangle", "question__title_slug": "perfect-rectangle", "question__hide": false, - "total_acs": 23449, - "total_submitted": 50730, + "total_acs": 23577, + "total_submitted": 50979, "total_column_articles": 216, "frontend_question_id": "391", "is_new_question": false @@ -47976,9 +48270,9 @@ "question__title": "Elimination Game", "question__title_slug": "elimination-game", "question__hide": false, - "total_acs": 32540, - "total_submitted": 53318, - "total_column_articles": 413, + "total_acs": 32716, + "total_submitted": 53675, + "total_column_articles": 415, "frontend_question_id": "390", "is_new_question": false }, @@ -47997,9 +48291,9 @@ "question__title": "Find the Difference", "question__title_slug": "find-the-difference", "question__hide": false, - "total_acs": 129685, - "total_submitted": 190086, - "total_column_articles": 1331, + "total_acs": 130800, + "total_submitted": 192021, + "total_column_articles": 1339, "frontend_question_id": "389", "is_new_question": false }, @@ -48018,9 +48312,9 @@ "question__title": "Longest Absolute File Path", "question__title_slug": "longest-absolute-file-path", "question__hide": false, - "total_acs": 30381, - "total_submitted": 47498, - "total_column_articles": 471, + "total_acs": 30496, + "total_submitted": 47686, + "total_column_articles": 474, "frontend_question_id": "388", "is_new_question": false }, @@ -48039,9 +48333,9 @@ "question__title": "First Unique Character in a String", "question__title_slug": "first-unique-character-in-a-string", "question__hide": false, - "total_acs": 306699, - "total_submitted": 557265, - "total_column_articles": 1704, + "total_acs": 309904, + "total_submitted": 562414, + "total_column_articles": 1717, "frontend_question_id": "387", "is_new_question": false }, @@ -48060,9 +48354,9 @@ "question__title": "Lexicographical Numbers", "question__title_slug": "lexicographical-numbers", "question__hide": false, - "total_acs": 62438, - "total_submitted": 83125, - "total_column_articles": 610, + "total_acs": 62828, + "total_submitted": 83682, + "total_column_articles": 613, "frontend_question_id": "386", "is_new_question": false }, @@ -48081,8 +48375,8 @@ "question__title": "Mini Parser", "question__title_slug": "mini-parser", "question__hide": false, - "total_acs": 28582, - "total_submitted": 51952, + "total_acs": 28681, + "total_submitted": 52131, "total_column_articles": 275, "frontend_question_id": "385", "is_new_question": false @@ -48102,9 +48396,9 @@ "question__title": "Shuffle an Array", "question__title_slug": "shuffle-an-array", "question__hide": false, - "total_acs": 101974, - "total_submitted": 166728, - "total_column_articles": 482, + "total_acs": 102917, + "total_submitted": 168196, + "total_column_articles": 490, "frontend_question_id": "384", "is_new_question": false }, @@ -48123,9 +48417,9 @@ "question__title": "Ransom Note", "question__title_slug": "ransom-note", "question__hide": false, - "total_acs": 185678, - "total_submitted": 292245, - "total_column_articles": 1768, + "total_acs": 191387, + "total_submitted": 302975, + "total_column_articles": 1821, "frontend_question_id": "383", "is_new_question": false }, @@ -48144,9 +48438,9 @@ "question__title": "Linked List Random Node", "question__title_slug": "linked-list-random-node", "question__hide": false, - "total_acs": 47432, - "total_submitted": 65721, - "total_column_articles": 372, + "total_acs": 47849, + "total_submitted": 66270, + "total_column_articles": 376, "frontend_question_id": "382", "is_new_question": false }, @@ -48165,9 +48459,9 @@ "question__title": "Insert Delete GetRandom O(1) - Duplicates allowed", "question__title_slug": "insert-delete-getrandom-o1-duplicates-allowed", "question__hide": false, - "total_acs": 23710, - "total_submitted": 55023, - "total_column_articles": 211, + "total_acs": 23793, + "total_submitted": 55268, + "total_column_articles": 212, "frontend_question_id": "381", "is_new_question": false }, @@ -48186,9 +48480,9 @@ "question__title": "Insert Delete GetRandom O(1)", "question__title_slug": "insert-delete-getrandom-o1", "question__hide": false, - "total_acs": 82640, - "total_submitted": 156325, - "total_column_articles": 1085, + "total_acs": 83585, + "total_submitted": 158192, + "total_column_articles": 1090, "frontend_question_id": "380", "is_new_question": false }, @@ -48207,9 +48501,9 @@ "question__title": "Design Phone Directory", "question__title_slug": "design-phone-directory", "question__hide": false, - "total_acs": 4577, - "total_submitted": 7375, - "total_column_articles": 91, + "total_acs": 4665, + "total_submitted": 7545, + "total_column_articles": 92, "frontend_question_id": "379", "is_new_question": false }, @@ -48228,9 +48522,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": 103107, - "total_submitted": 162799, - "total_column_articles": 729, + "total_acs": 104051, + "total_submitted": 164340, + "total_column_articles": 737, "frontend_question_id": "378", "is_new_question": false }, @@ -48249,9 +48543,9 @@ "question__title": "Combination Sum IV", "question__title_slug": "combination-sum-iv", "question__hide": false, - "total_acs": 98408, - "total_submitted": 187644, - "total_column_articles": 748, + "total_acs": 100059, + "total_submitted": 190470, + "total_column_articles": 756, "frontend_question_id": "377", "is_new_question": false }, @@ -48270,9 +48564,9 @@ "question__title": "Wiggle Subsequence", "question__title_slug": "wiggle-subsequence", "question__hide": false, - "total_acs": 122687, - "total_submitted": 260040, - "total_column_articles": 1193, + "total_acs": 124967, + "total_submitted": 264780, + "total_column_articles": 1210, "frontend_question_id": "376", "is_new_question": false }, @@ -48291,8 +48585,8 @@ "question__title": "Guess Number Higher or Lower II", "question__title_slug": "guess-number-higher-or-lower-ii", "question__hide": false, - "total_acs": 38580, - "total_submitted": 63290, + "total_acs": 38793, + "total_submitted": 63597, "total_column_articles": 299, "frontend_question_id": "375", "is_new_question": false @@ -48312,9 +48606,9 @@ "question__title": "Guess Number Higher or Lower", "question__title_slug": "guess-number-higher-or-lower", "question__hide": false, - "total_acs": 119263, - "total_submitted": 228906, - "total_column_articles": 793, + "total_acs": 121300, + "total_submitted": 232879, + "total_column_articles": 802, "frontend_question_id": "374", "is_new_question": false }, @@ -48333,9 +48627,9 @@ "question__title": "Find K Pairs with Smallest Sums", "question__title_slug": "find-k-pairs-with-smallest-sums", "question__hide": false, - "total_acs": 49668, - "total_submitted": 119658, - "total_column_articles": 480, + "total_acs": 50051, + "total_submitted": 120770, + "total_column_articles": 486, "frontend_question_id": "373", "is_new_question": false }, @@ -48354,9 +48648,9 @@ "question__title": "Super Pow", "question__title_slug": "super-pow", "question__hide": false, - "total_acs": 39854, - "total_submitted": 69582, - "total_column_articles": 401, + "total_acs": 40097, + "total_submitted": 69967, + "total_column_articles": 402, "frontend_question_id": "372", "is_new_question": false }, @@ -48375,9 +48669,9 @@ "question__title": "Sum of Two Integers", "question__title_slug": "sum-of-two-integers", "question__hide": false, - "total_acs": 94398, - "total_submitted": 153538, - "total_column_articles": 600, + "total_acs": 94851, + "total_submitted": 154344, + "total_column_articles": 605, "frontend_question_id": "371", "is_new_question": false }, @@ -48396,9 +48690,9 @@ "question__title": "Range Addition", "question__title_slug": "range-addition", "question__hide": false, - "total_acs": 7889, - "total_submitted": 10473, - "total_column_articles": 200, + "total_acs": 8112, + "total_submitted": 10756, + "total_column_articles": 204, "frontend_question_id": "370", "is_new_question": false }, @@ -48417,9 +48711,9 @@ "question__title": "Plus One Linked List", "question__title_slug": "plus-one-linked-list", "question__hide": false, - "total_acs": 6417, - "total_submitted": 10237, - "total_column_articles": 181, + "total_acs": 6512, + "total_submitted": 10366, + "total_column_articles": 186, "frontend_question_id": "369", "is_new_question": false }, @@ -48438,9 +48732,9 @@ "question__title": "Largest Divisible Subset", "question__title_slug": "largest-divisible-subset", "question__hide": false, - "total_acs": 48974, - "total_submitted": 106505, - "total_column_articles": 515, + "total_acs": 49302, + "total_submitted": 107197, + "total_column_articles": 519, "frontend_question_id": "368", "is_new_question": false }, @@ -48459,9 +48753,9 @@ "question__title": "Valid Perfect Square", "question__title_slug": "valid-perfect-square", "question__hide": false, - "total_acs": 162357, - "total_submitted": 361872, - "total_column_articles": 1251, + "total_acs": 164757, + "total_submitted": 367236, + "total_column_articles": 1265, "frontend_question_id": "367", "is_new_question": false }, @@ -48480,9 +48774,9 @@ "question__title": "Find Leaves of Binary Tree", "question__title_slug": "find-leaves-of-binary-tree", "question__hide": false, - "total_acs": 6848, - "total_submitted": 8710, - "total_column_articles": 172, + "total_acs": 6981, + "total_submitted": 8863, + "total_column_articles": 174, "frontend_question_id": "366", "is_new_question": false }, @@ -48501,9 +48795,9 @@ "question__title": "Water and Jug Problem", "question__title_slug": "water-and-jug-problem", "question__hide": false, - "total_acs": 40795, - "total_submitted": 106353, - "total_column_articles": 544, + "total_acs": 41079, + "total_submitted": 106905, + "total_column_articles": 546, "frontend_question_id": "365", "is_new_question": false }, @@ -48522,8 +48816,8 @@ "question__title": "Nested List Weight Sum II", "question__title_slug": "nested-list-weight-sum-ii", "question__hide": false, - "total_acs": 2612, - "total_submitted": 3515, + "total_acs": 2638, + "total_submitted": 3546, "total_column_articles": 65, "frontend_question_id": "364", "is_new_question": false @@ -48543,9 +48837,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": 37242, - "total_submitted": 76592, - "total_column_articles": 245, + "total_acs": 37381, + "total_submitted": 76869, + "total_column_articles": 246, "frontend_question_id": "363", "is_new_question": false }, @@ -48564,9 +48858,9 @@ "question__title": "Design Hit Counter", "question__title_slug": "design-hit-counter", "question__hide": false, - "total_acs": 5197, - "total_submitted": 7535, - "total_column_articles": 94, + "total_acs": 5255, + "total_submitted": 7615, + "total_column_articles": 95, "frontend_question_id": "362", "is_new_question": false }, @@ -48585,8 +48879,8 @@ "question__title": "Bomb Enemy", "question__title_slug": "bomb-enemy", "question__hide": false, - "total_acs": 4727, - "total_submitted": 8108, + "total_acs": 4772, + "total_submitted": 8172, "total_column_articles": 92, "frontend_question_id": "361", "is_new_question": false @@ -48606,9 +48900,9 @@ "question__title": "Sort Transformed Array", "question__title_slug": "sort-transformed-array", "question__hide": false, - "total_acs": 3986, - "total_submitted": 6480, - "total_column_articles": 77, + "total_acs": 4045, + "total_submitted": 6582, + "total_column_articles": 79, "frontend_question_id": "360", "is_new_question": false }, @@ -48627,9 +48921,9 @@ "question__title": "Logger Rate Limiter", "question__title_slug": "logger-rate-limiter", "question__hide": false, - "total_acs": 6804, - "total_submitted": 9166, - "total_column_articles": 85, + "total_acs": 6888, + "total_submitted": 9271, + "total_column_articles": 86, "frontend_question_id": "359", "is_new_question": false }, @@ -48648,9 +48942,9 @@ "question__title": "Rearrange String k Distance Apart", "question__title_slug": "rearrange-string-k-distance-apart", "question__hide": false, - "total_acs": 5508, - "total_submitted": 15380, - "total_column_articles": 71, + "total_acs": 5604, + "total_submitted": 15686, + "total_column_articles": 73, "frontend_question_id": "358", "is_new_question": false }, @@ -48669,9 +48963,9 @@ "question__title": "Count Numbers with Unique Digits", "question__title_slug": "count-numbers-with-unique-digits", "question__hide": false, - "total_acs": 60999, - "total_submitted": 101718, - "total_column_articles": 861, + "total_acs": 61231, + "total_submitted": 102123, + "total_column_articles": 863, "frontend_question_id": "357", "is_new_question": false }, @@ -48690,9 +48984,9 @@ "question__title": "Line Reflection", "question__title_slug": "line-reflection", "question__hide": false, - "total_acs": 2124, - "total_submitted": 5893, - "total_column_articles": 54, + "total_acs": 2143, + "total_submitted": 5940, + "total_column_articles": 55, "frontend_question_id": "356", "is_new_question": false }, @@ -48711,9 +49005,9 @@ "question__title": "Design Twitter", "question__title_slug": "design-twitter", "question__hide": false, - "total_acs": 34863, - "total_submitted": 85142, - "total_column_articles": 569, + "total_acs": 35276, + "total_submitted": 86100, + "total_column_articles": 574, "frontend_question_id": "355", "is_new_question": false }, @@ -48732,9 +49026,9 @@ "question__title": "Russian Doll Envelopes", "question__title_slug": "russian-doll-envelopes", "question__hide": false, - "total_acs": 86636, - "total_submitted": 207790, - "total_column_articles": 692, + "total_acs": 87281, + "total_submitted": 210389, + "total_column_articles": 697, "frontend_question_id": "354", "is_new_question": false }, @@ -48753,8 +49047,8 @@ "question__title": "Design Snake Game", "question__title_slug": "design-snake-game", "question__hide": false, - "total_acs": 3351, - "total_submitted": 7725, + "total_acs": 3379, + "total_submitted": 7791, "total_column_articles": 68, "frontend_question_id": "353", "is_new_question": false @@ -48774,9 +49068,9 @@ "question__title": "Data Stream as Disjoint Intervals", "question__title_slug": "data-stream-as-disjoint-intervals", "question__hide": false, - "total_acs": 23028, - "total_submitted": 34111, - "total_column_articles": 368, + "total_acs": 23167, + "total_submitted": 34309, + "total_column_articles": 372, "frontend_question_id": "352", "is_new_question": false }, @@ -48795,9 +49089,9 @@ "question__title": "Android Unlock Patterns", "question__title_slug": "android-unlock-patterns", "question__hide": false, - "total_acs": 6371, - "total_submitted": 10598, - "total_column_articles": 118, + "total_acs": 6420, + "total_submitted": 10673, + "total_column_articles": 119, "frontend_question_id": "351", "is_new_question": false }, @@ -48816,9 +49110,9 @@ "question__title": "Intersection of Two Arrays II", "question__title_slug": "intersection-of-two-arrays-ii", "question__hide": false, - "total_acs": 366075, - "total_submitted": 650402, - "total_column_articles": 2141, + "total_acs": 370511, + "total_submitted": 657716, + "total_column_articles": 2166, "frontend_question_id": "350", "is_new_question": false }, @@ -48837,9 +49131,9 @@ "question__title": "Intersection of Two Arrays", "question__title_slug": "intersection-of-two-arrays", "question__hide": false, - "total_acs": 310426, - "total_submitted": 418141, - "total_column_articles": 2130, + "total_acs": 314373, + "total_submitted": 423295, + "total_column_articles": 2147, "frontend_question_id": "349", "is_new_question": false }, @@ -48858,8 +49152,8 @@ "question__title": "Design Tic-Tac-Toe", "question__title_slug": "design-tic-tac-toe", "question__hide": false, - "total_acs": 7376, - "total_submitted": 12257, + "total_acs": 7457, + "total_submitted": 12423, "total_column_articles": 113, "frontend_question_id": "348", "is_new_question": false @@ -48879,9 +49173,9 @@ "question__title": "Top K Frequent Elements", "question__title_slug": "top-k-frequent-elements", "question__hide": false, - "total_acs": 306577, - "total_submitted": 486302, - "total_column_articles": 2206, + "total_acs": 311451, + "total_submitted": 493710, + "total_column_articles": 2240, "frontend_question_id": "347", "is_new_question": false }, @@ -48900,8 +49194,8 @@ "question__title": "Moving Average from Data Stream", "question__title_slug": "moving-average-from-data-stream", "question__hide": false, - "total_acs": 16447, - "total_submitted": 22951, + "total_acs": 16557, + "total_submitted": 23092, "total_column_articles": 179, "frontend_question_id": "346", "is_new_question": false @@ -48921,9 +49215,9 @@ "question__title": "Reverse Vowels of a String", "question__title_slug": "reverse-vowels-of-a-string", "question__hide": false, - "total_acs": 130125, - "total_submitted": 239903, - "total_column_articles": 1203, + "total_acs": 131124, + "total_submitted": 241744, + "total_column_articles": 1212, "frontend_question_id": "345", "is_new_question": false }, @@ -48942,9 +49236,9 @@ "question__title": "Reverse String", "question__title_slug": "reverse-string", "question__hide": false, - "total_acs": 555455, - "total_submitted": 705460, - "total_column_articles": 2874, + "total_acs": 562174, + "total_submitted": 713591, + "total_column_articles": 2905, "frontend_question_id": "344", "is_new_question": false }, @@ -48963,9 +49257,9 @@ "question__title": "Integer Break", "question__title_slug": "integer-break", "question__hide": false, - "total_acs": 175083, - "total_submitted": 283052, - "total_column_articles": 1506, + "total_acs": 177931, + "total_submitted": 287441, + "total_column_articles": 1525, "frontend_question_id": "343", "is_new_question": false }, @@ -48984,9 +49278,9 @@ "question__title": "Power of Four", "question__title_slug": "power-of-four", "question__hide": false, - "total_acs": 106738, - "total_submitted": 204621, - "total_column_articles": 915, + "total_acs": 107483, + "total_submitted": 206088, + "total_column_articles": 917, "frontend_question_id": "342", "is_new_question": false }, @@ -49005,9 +49299,9 @@ "question__title": "Flatten Nested List Iterator", "question__title_slug": "flatten-nested-list-iterator", "question__hide": false, - "total_acs": 62960, - "total_submitted": 86622, - "total_column_articles": 578, + "total_acs": 63499, + "total_submitted": 87339, + "total_column_articles": 581, "frontend_question_id": "341", "is_new_question": false }, @@ -49026,9 +49320,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": 19189, - "total_submitted": 37865, - "total_column_articles": 255, + "total_acs": 19467, + "total_submitted": 38410, + "total_column_articles": 258, "frontend_question_id": "340", "is_new_question": false }, @@ -49047,8 +49341,8 @@ "question__title": "Nested List Weight Sum", "question__title_slug": "nested-list-weight-sum", "question__hide": false, - "total_acs": 5161, - "total_submitted": 6242, + "total_acs": 5215, + "total_submitted": 6305, "total_column_articles": 75, "frontend_question_id": "339", "is_new_question": false @@ -49068,9 +49362,9 @@ "question__title": "Counting Bits", "question__title_slug": "counting-bits", "question__hide": false, - "total_acs": 222882, - "total_submitted": 283373, - "total_column_articles": 1804, + "total_acs": 225577, + "total_submitted": 286728, + "total_column_articles": 1827, "frontend_question_id": "338", "is_new_question": false }, @@ -49089,9 +49383,9 @@ "question__title": "House Robber III", "question__title_slug": "house-robber-iii", "question__hide": false, - "total_acs": 194334, - "total_submitted": 319936, - "total_column_articles": 1307, + "total_acs": 197747, + "total_submitted": 325378, + "total_column_articles": 1331, "frontend_question_id": "337", "is_new_question": false }, @@ -49110,9 +49404,9 @@ "question__title": "Palindrome Pairs", "question__title_slug": "palindrome-pairs", "question__hide": false, - "total_acs": 24555, - "total_submitted": 62634, - "total_column_articles": 213, + "total_acs": 24664, + "total_submitted": 63012, + "total_column_articles": 214, "frontend_question_id": "336", "is_new_question": false }, @@ -49131,8 +49425,8 @@ "question__title": "Self Crossing", "question__title_slug": "self-crossing", "question__hide": false, - "total_acs": 17252, - "total_submitted": 40328, + "total_acs": 17292, + "total_submitted": 40469, "total_column_articles": 155, "frontend_question_id": "335", "is_new_question": false @@ -49152,9 +49446,9 @@ "question__title": "Increasing Triplet Subsequence", "question__title_slug": "increasing-triplet-subsequence", "question__hide": false, - "total_acs": 97311, - "total_submitted": 224821, - "total_column_articles": 669, + "total_acs": 98216, + "total_submitted": 226845, + "total_column_articles": 674, "frontend_question_id": "334", "is_new_question": false }, @@ -49173,9 +49467,9 @@ "question__title": "Largest BST Subtree", "question__title_slug": "largest-bst-subtree", "question__hide": false, - "total_acs": 6625, - "total_submitted": 13891, - "total_column_articles": 121, + "total_acs": 6744, + "total_submitted": 14095, + "total_column_articles": 122, "frontend_question_id": "333", "is_new_question": false }, @@ -49194,9 +49488,9 @@ "question__title": "Reconstruct Itinerary", "question__title_slug": "reconstruct-itinerary", "question__hide": false, - "total_acs": 58840, - "total_submitted": 126489, - "total_column_articles": 448, + "total_acs": 59742, + "total_submitted": 128322, + "total_column_articles": 452, "frontend_question_id": "332", "is_new_question": false }, @@ -49215,9 +49509,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": 52591, - "total_submitted": 109448, - "total_column_articles": 574, + "total_acs": 53001, + "total_submitted": 110367, + "total_column_articles": 580, "frontend_question_id": "331", "is_new_question": false }, @@ -49236,8 +49530,8 @@ "question__title": "Patching Array", "question__title_slug": "patching-array", "question__hide": false, - "total_acs": 20734, - "total_submitted": 39104, + "total_acs": 20801, + "total_submitted": 39244, "total_column_articles": 165, "frontend_question_id": "330", "is_new_question": false @@ -49257,9 +49551,9 @@ "question__title": "Longest Increasing Path in a Matrix", "question__title_slug": "longest-increasing-path-in-a-matrix", "question__hide": false, - "total_acs": 76259, - "total_submitted": 151191, - "total_column_articles": 685, + "total_acs": 77139, + "total_submitted": 152727, + "total_column_articles": 691, "frontend_question_id": "329", "is_new_question": false }, @@ -49278,9 +49572,9 @@ "question__title": "Odd Even Linked List", "question__title_slug": "odd-even-linked-list", "question__hide": false, - "total_acs": 164808, - "total_submitted": 252067, - "total_column_articles": 1328, + "total_acs": 166473, + "total_submitted": 254596, + "total_column_articles": 1338, "frontend_question_id": "328", "is_new_question": false }, @@ -49299,9 +49593,9 @@ "question__title": "Count of Range Sum", "question__title_slug": "count-of-range-sum", "question__hide": false, - "total_acs": 31029, - "total_submitted": 74835, - "total_column_articles": 270, + "total_acs": 31638, + "total_submitted": 76197, + "total_column_articles": 274, "frontend_question_id": "327", "is_new_question": false }, @@ -49320,9 +49614,9 @@ "question__title": "Power of Three", "question__title_slug": "power-of-three", "question__hide": false, - "total_acs": 169050, - "total_submitted": 333485, - "total_column_articles": 733, + "total_acs": 170403, + "total_submitted": 336049, + "total_column_articles": 740, "frontend_question_id": "326", "is_new_question": false }, @@ -49341,8 +49635,8 @@ "question__title": "Maximum Size Subarray Sum Equals k", "question__title_slug": "maximum-size-subarray-sum-equals-k", "question__hide": false, - "total_acs": 13193, - "total_submitted": 24801, + "total_acs": 13335, + "total_submitted": 25140, "total_column_articles": 158, "frontend_question_id": "325", "is_new_question": false @@ -49362,9 +49656,9 @@ "question__title": "Wiggle Sort II", "question__title_slug": "wiggle-sort-ii", "question__hide": false, - "total_acs": 34580, - "total_submitted": 89476, - "total_column_articles": 225, + "total_acs": 52824, + "total_submitted": 129933, + "total_column_articles": 340, "frontend_question_id": "324", "is_new_question": false }, @@ -49383,9 +49677,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": 16850, - "total_submitted": 25965, - "total_column_articles": 243, + "total_acs": 17154, + "total_submitted": 26435, + "total_column_articles": 247, "frontend_question_id": "323", "is_new_question": false }, @@ -49404,9 +49698,9 @@ "question__title": "Coin Change", "question__title_slug": "coin-change", "question__hide": false, - "total_acs": 459852, - "total_submitted": 1006312, - "total_column_articles": 2792, + "total_acs": 466640, + "total_submitted": 1020575, + "total_column_articles": 2808, "frontend_question_id": "322", "is_new_question": false }, @@ -49425,9 +49719,9 @@ "question__title": "Create Maximum Number", "question__title_slug": "create-maximum-number", "question__hide": false, - "total_acs": 31093, - "total_submitted": 73871, - "total_column_articles": 259, + "total_acs": 31277, + "total_submitted": 74313, + "total_column_articles": 260, "frontend_question_id": "321", "is_new_question": false }, @@ -49446,8 +49740,8 @@ "question__title": "Generalized Abbreviation", "question__title_slug": "generalized-abbreviation", "question__hide": false, - "total_acs": 3853, - "total_submitted": 5557, + "total_acs": 3897, + "total_submitted": 5619, "total_column_articles": 67, "frontend_question_id": "320", "is_new_question": false @@ -49467,8 +49761,8 @@ "question__title": "Bulb Switcher", "question__title_slug": "bulb-switcher", "question__hide": false, - "total_acs": 53114, - "total_submitted": 92588, + "total_acs": 53370, + "total_submitted": 93048, "total_column_articles": 468, "frontend_question_id": "319", "is_new_question": false @@ -49488,9 +49782,9 @@ "question__title": "Maximum Product of Word Lengths", "question__title_slug": "maximum-product-of-word-lengths", "question__hide": false, - "total_acs": 57795, - "total_submitted": 78290, - "total_column_articles": 545, + "total_acs": 58325, + "total_submitted": 79130, + "total_column_articles": 548, "frontend_question_id": "318", "is_new_question": false }, @@ -49509,8 +49803,8 @@ "question__title": "Shortest Distance from All Buildings", "question__title_slug": "shortest-distance-from-all-buildings", "question__hide": false, - "total_acs": 6065, - "total_submitted": 12728, + "total_acs": 6118, + "total_submitted": 12818, "total_column_articles": 80, "frontend_question_id": "317", "is_new_question": false @@ -49530,9 +49824,9 @@ "question__title": "Remove Duplicate Letters", "question__title_slug": "remove-duplicate-letters", "question__hide": false, - "total_acs": 90954, - "total_submitted": 189772, - "total_column_articles": 722, + "total_acs": 91989, + "total_submitted": 191934, + "total_column_articles": 726, "frontend_question_id": "316", "is_new_question": false }, @@ -49551,9 +49845,9 @@ "question__title": "Count of Smaller Numbers After Self", "question__title_slug": "count-of-smaller-numbers-after-self", "question__hide": false, - "total_acs": 64094, - "total_submitted": 150926, - "total_column_articles": 620, + "total_acs": 64913, + "total_submitted": 152730, + "total_column_articles": 628, "frontend_question_id": "315", "is_new_question": false }, @@ -49572,8 +49866,8 @@ "question__title": "Binary Tree Vertical Order Traversal", "question__title_slug": "binary-tree-vertical-order-traversal", "question__hide": false, - "total_acs": 7352, - "total_submitted": 13262, + "total_acs": 7473, + "total_submitted": 13467, "total_column_articles": 128, "frontend_question_id": "314", "is_new_question": false @@ -49593,9 +49887,9 @@ "question__title": "Super Ugly Number", "question__title_slug": "super-ugly-number", "question__hide": false, - "total_acs": 49109, - "total_submitted": 82790, - "total_column_articles": 426, + "total_acs": 49435, + "total_submitted": 83356, + "total_column_articles": 429, "frontend_question_id": "313", "is_new_question": false }, @@ -49614,9 +49908,9 @@ "question__title": "Burst Balloons", "question__title_slug": "burst-balloons", "question__hide": false, - "total_acs": 77794, - "total_submitted": 112195, - "total_column_articles": 514, + "total_acs": 78962, + "total_submitted": 113801, + "total_column_articles": 525, "frontend_question_id": "312", "is_new_question": false }, @@ -49635,9 +49929,9 @@ "question__title": "Sparse Matrix Multiplication", "question__title_slug": "sparse-matrix-multiplication", "question__hide": false, - "total_acs": 5175, - "total_submitted": 6774, - "total_column_articles": 68, + "total_acs": 5250, + "total_submitted": 6871, + "total_column_articles": 69, "frontend_question_id": "311", "is_new_question": false }, @@ -49656,9 +49950,9 @@ "question__title": "Minimum Height Trees", "question__title_slug": "minimum-height-trees", "question__hide": false, - "total_acs": 49471, - "total_submitted": 114656, - "total_column_articles": 409, + "total_acs": 49915, + "total_submitted": 115751, + "total_column_articles": 411, "frontend_question_id": "310", "is_new_question": false }, @@ -49677,9 +49971,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": 182885, - "total_submitted": 289771, - "total_column_articles": 1471, + "total_acs": 185832, + "total_submitted": 294162, + "total_column_articles": 1485, "frontend_question_id": "309", "is_new_question": false }, @@ -49698,8 +49992,8 @@ "question__title": "Range Sum Query 2D - Mutable", "question__title_slug": "range-sum-query-2d-mutable", "question__hide": false, - "total_acs": 3208, - "total_submitted": 5058, + "total_acs": 3238, + "total_submitted": 5112, "total_column_articles": 67, "frontend_question_id": "308", "is_new_question": false @@ -49719,9 +50013,9 @@ "question__title": "Range Sum Query - Mutable", "question__title_slug": "range-sum-query-mutable", "question__hide": false, - "total_acs": 54201, - "total_submitted": 106313, - "total_column_articles": 483, + "total_acs": 54975, + "total_submitted": 107631, + "total_column_articles": 490, "frontend_question_id": "307", "is_new_question": false }, @@ -49740,9 +50034,9 @@ "question__title": "Additive Number", "question__title_slug": "additive-number", "question__hide": false, - "total_acs": 42715, - "total_submitted": 111662, - "total_column_articles": 613, + "total_acs": 43012, + "total_submitted": 112550, + "total_column_articles": 620, "frontend_question_id": "306", "is_new_question": false }, @@ -49761,9 +50055,9 @@ "question__title": "Number of Islands II", "question__title_slug": "number-of-islands-ii", "question__hide": false, - "total_acs": 6726, - "total_submitted": 16264, - "total_column_articles": 103, + "total_acs": 6897, + "total_submitted": 16516, + "total_column_articles": 104, "frontend_question_id": "305", "is_new_question": false }, @@ -49782,9 +50076,9 @@ "question__title": "Range Sum Query 2D - Immutable", "question__title_slug": "range-sum-query-2d-immutable", "question__hide": false, - "total_acs": 95025, - "total_submitted": 160474, - "total_column_articles": 970, + "total_acs": 96217, + "total_submitted": 162101, + "total_column_articles": 991, "frontend_question_id": "304", "is_new_question": false }, @@ -49803,9 +50097,9 @@ "question__title": "Range Sum Query - Immutable", "question__title_slug": "range-sum-query-immutable", "question__hide": false, - "total_acs": 171595, - "total_submitted": 228422, - "total_column_articles": 1508, + "total_acs": 173321, + "total_submitted": 230517, + "total_column_articles": 1558, "frontend_question_id": "303", "is_new_question": false }, @@ -49824,9 +50118,9 @@ "question__title": "Smallest Rectangle Enclosing Black Pixels", "question__title_slug": "smallest-rectangle-enclosing-black-pixels", "question__hide": false, - "total_acs": 2917, - "total_submitted": 4390, - "total_column_articles": 53, + "total_acs": 2996, + "total_submitted": 4487, + "total_column_articles": 55, "frontend_question_id": "302", "is_new_question": false }, @@ -49845,9 +50139,9 @@ "question__title": "Remove Invalid Parentheses", "question__title_slug": "remove-invalid-parentheses", "question__hide": false, - "total_acs": 72140, - "total_submitted": 130819, - "total_column_articles": 487, + "total_acs": 73433, + "total_submitted": 133071, + "total_column_articles": 492, "frontend_question_id": "301", "is_new_question": false }, @@ -49866,9 +50160,9 @@ "question__title": "Longest Increasing Subsequence", "question__title_slug": "longest-increasing-subsequence", "question__hide": false, - "total_acs": 542659, - "total_submitted": 1012362, - "total_column_articles": 3341, + "total_acs": 550505, + "total_submitted": 1025768, + "total_column_articles": 3358, "frontend_question_id": "300", "is_new_question": false }, @@ -49887,9 +50181,9 @@ "question__title": "Bulls and Cows", "question__title_slug": "bulls-and-cows", "question__hide": false, - "total_acs": 69013, - "total_submitted": 121664, - "total_column_articles": 773, + "total_acs": 69373, + "total_submitted": 122332, + "total_column_articles": 776, "frontend_question_id": "299", "is_new_question": false }, @@ -49908,9 +50202,9 @@ "question__title": "Binary Tree Longest Consecutive Sequence", "question__title_slug": "binary-tree-longest-consecutive-sequence", "question__hide": false, - "total_acs": 7188, - "total_submitted": 12119, - "total_column_articles": 112, + "total_acs": 7286, + "total_submitted": 12244, + "total_column_articles": 114, "frontend_question_id": "298", "is_new_question": false }, @@ -49929,9 +50223,9 @@ "question__title": "Serialize and Deserialize Binary Tree", "question__title_slug": "serialize-and-deserialize-binary-tree", "question__hide": false, - "total_acs": 162022, - "total_submitted": 279905, - "total_column_articles": 1075, + "total_acs": 164459, + "total_submitted": 283842, + "total_column_articles": 1093, "frontend_question_id": "297", "is_new_question": false }, @@ -49950,9 +50244,9 @@ "question__title": "Best Meeting Point", "question__title_slug": "best-meeting-point", "question__hide": false, - "total_acs": 3395, - "total_submitted": 5508, - "total_column_articles": 57, + "total_acs": 3456, + "total_submitted": 5588, + "total_column_articles": 59, "frontend_question_id": "296", "is_new_question": false }, @@ -49971,9 +50265,9 @@ "question__title": "Find Median from Data Stream", "question__title_slug": "find-median-from-data-stream", "question__hide": false, - "total_acs": 85799, - "total_submitted": 162568, - "total_column_articles": 645, + "total_acs": 86689, + "total_submitted": 164161, + "total_column_articles": 648, "frontend_question_id": "295", "is_new_question": false }, @@ -49992,8 +50286,8 @@ "question__title": "Flip Game II", "question__title_slug": "flip-game-ii", "question__hide": false, - "total_acs": 5010, - "total_submitted": 8507, + "total_acs": 5092, + "total_submitted": 8639, "total_column_articles": 76, "frontend_question_id": "294", "is_new_question": false @@ -50013,9 +50307,9 @@ "question__title": "Flip Game", "question__title_slug": "flip-game", "question__hide": false, - "total_acs": 6518, - "total_submitted": 9055, - "total_column_articles": 106, + "total_acs": 6605, + "total_submitted": 9185, + "total_column_articles": 107, "frontend_question_id": "293", "is_new_question": false }, @@ -50034,9 +50328,9 @@ "question__title": "Nim Game", "question__title_slug": "nim-game", "question__hide": false, - "total_acs": 135562, - "total_submitted": 191741, - "total_column_articles": 902, + "total_acs": 136391, + "total_submitted": 192934, + "total_column_articles": 905, "frontend_question_id": "292", "is_new_question": false }, @@ -50055,9 +50349,9 @@ "question__title": "Word Pattern II", "question__title_slug": "word-pattern-ii", "question__hide": false, - "total_acs": 3618, - "total_submitted": 6840, - "total_column_articles": 80, + "total_acs": 3683, + "total_submitted": 6964, + "total_column_articles": 82, "frontend_question_id": "291", "is_new_question": false }, @@ -50076,9 +50370,9 @@ "question__title": "Word Pattern", "question__title_slug": "word-pattern", "question__hide": false, - "total_acs": 105822, - "total_submitted": 234226, - "total_column_articles": 1396, + "total_acs": 106753, + "total_submitted": 236468, + "total_column_articles": 1414, "frontend_question_id": "290", "is_new_question": false }, @@ -50097,9 +50391,9 @@ "question__title": "Game of Life", "question__title_slug": "game-of-life", "question__hide": false, - "total_acs": 63570, - "total_submitted": 84183, - "total_column_articles": 967, + "total_acs": 64123, + "total_submitted": 84926, + "total_column_articles": 973, "frontend_question_id": "289", "is_new_question": false }, @@ -50118,9 +50412,9 @@ "question__title": "Unique Word Abbreviation", "question__title_slug": "unique-word-abbreviation", "question__hide": false, - "total_acs": 5063, - "total_submitted": 10640, - "total_column_articles": 75, + "total_acs": 5136, + "total_submitted": 10763, + "total_column_articles": 76, "frontend_question_id": "288", "is_new_question": false }, @@ -50139,9 +50433,9 @@ "question__title": "Find the Duplicate Number", "question__title_slug": "find-the-duplicate-number", "question__hide": false, - "total_acs": 246896, - "total_submitted": 380813, - "total_column_articles": 1625, + "total_acs": 250020, + "total_submitted": 385768, + "total_column_articles": 1648, "frontend_question_id": "287", "is_new_question": false }, @@ -50160,9 +50454,9 @@ "question__title": "Walls and Gates", "question__title_slug": "walls-and-gates", "question__hide": false, - "total_acs": 15835, - "total_submitted": 29610, - "total_column_articles": 208, + "total_acs": 16008, + "total_submitted": 29912, + "total_column_articles": 209, "frontend_question_id": "286", "is_new_question": false }, @@ -50181,9 +50475,9 @@ "question__title": "Inorder Successor in BST", "question__title_slug": "inorder-successor-in-bst", "question__hide": false, - "total_acs": 12203, - "total_submitted": 18989, - "total_column_articles": 158, + "total_acs": 12358, + "total_submitted": 19256, + "total_column_articles": 160, "frontend_question_id": "285", "is_new_question": false }, @@ -50202,9 +50496,9 @@ "question__title": "Peeking Iterator", "question__title_slug": "peeking-iterator", "question__hide": false, - "total_acs": 28399, - "total_submitted": 36985, - "total_column_articles": 236, + "total_acs": 28549, + "total_submitted": 37185, + "total_column_articles": 237, "frontend_question_id": "284", "is_new_question": false }, @@ -50223,9 +50517,9 @@ "question__title": "Move Zeroes", "question__title_slug": "move-zeroes", "question__hide": false, - "total_acs": 777122, - "total_submitted": 1213907, - "total_column_articles": 4861, + "total_acs": 787821, + "total_submitted": 1230347, + "total_column_articles": 4914, "frontend_question_id": "283", "is_new_question": false }, @@ -50244,9 +50538,9 @@ "question__title": "Expression Add Operators", "question__title_slug": "expression-add-operators", "question__hide": false, - "total_acs": 22673, - "total_submitted": 47544, - "total_column_articles": 189, + "total_acs": 22844, + "total_submitted": 47967, + "total_column_articles": 191, "frontend_question_id": "282", "is_new_question": false }, @@ -50265,9 +50559,9 @@ "question__title": "Zigzag Iterator", "question__title_slug": "zigzag-iterator", "question__hide": false, - "total_acs": 4090, - "total_submitted": 5367, - "total_column_articles": 100, + "total_acs": 4148, + "total_submitted": 5436, + "total_column_articles": 102, "frontend_question_id": "281", "is_new_question": false }, @@ -50286,9 +50580,9 @@ "question__title": "Wiggle Sort", "question__title_slug": "wiggle-sort", "question__hide": false, - "total_acs": 7608, - "total_submitted": 11056, - "total_column_articles": 94, + "total_acs": 8106, + "total_submitted": 11736, + "total_column_articles": 99, "frontend_question_id": "280", "is_new_question": false }, @@ -50307,9 +50601,9 @@ "question__title": "Perfect Squares", "question__title_slug": "perfect-squares", "question__hide": false, - "total_acs": 297069, - "total_submitted": 456416, - "total_column_articles": 1645, + "total_acs": 301500, + "total_submitted": 462625, + "total_column_articles": 1652, "frontend_question_id": "279", "is_new_question": false }, @@ -50328,9 +50622,9 @@ "question__title": "First Bad Version", "question__title_slug": "first-bad-version", "question__hide": false, - "total_acs": 345441, - "total_submitted": 760825, - "total_column_articles": 1904, + "total_acs": 350230, + "total_submitted": 770776, + "total_column_articles": 1929, "frontend_question_id": "278", "is_new_question": false }, @@ -50349,8 +50643,8 @@ "question__title": "Find the Celebrity", "question__title_slug": "find-the-celebrity", "question__hide": false, - "total_acs": 11340, - "total_submitted": 19507, + "total_acs": 11489, + "total_submitted": 19741, "total_column_articles": 122, "frontend_question_id": "277", "is_new_question": false @@ -50370,8 +50664,8 @@ "question__title": "Paint Fence", "question__title_slug": "paint-fence", "question__hide": false, - "total_acs": 8954, - "total_submitted": 17337, + "total_acs": 9044, + "total_submitted": 17473, "total_column_articles": 168, "frontend_question_id": "276", "is_new_question": false @@ -50391,9 +50685,9 @@ "question__title": "H-Index II", "question__title_slug": "h-index-ii", "question__hide": false, - "total_acs": 59407, - "total_submitted": 130233, - "total_column_articles": 499, + "total_acs": 59844, + "total_submitted": 131281, + "total_column_articles": 498, "frontend_question_id": "275", "is_new_question": false }, @@ -50412,9 +50706,9 @@ "question__title": "H-Index", "question__title_slug": "h-index", "question__hide": false, - "total_acs": 63765, - "total_submitted": 144009, - "total_column_articles": 661, + "total_acs": 64244, + "total_submitted": 145207, + "total_column_articles": 662, "frontend_question_id": "274", "is_new_question": false }, @@ -50433,9 +50727,9 @@ "question__title": "Integer to English Words", "question__title_slug": "integer-to-english-words", "question__hide": false, - "total_acs": 33086, - "total_submitted": 90706, - "total_column_articles": 391, + "total_acs": 33258, + "total_submitted": 91162, + "total_column_articles": 394, "frontend_question_id": "273", "is_new_question": false }, @@ -50454,9 +50748,9 @@ "question__title": "Closest Binary Search Tree Value II", "question__title_slug": "closest-binary-search-tree-value-ii", "question__hide": false, - "total_acs": 4918, - "total_submitted": 7497, - "total_column_articles": 102, + "total_acs": 4993, + "total_submitted": 7614, + "total_column_articles": 104, "frontend_question_id": "272", "is_new_question": false }, @@ -50475,8 +50769,8 @@ "question__title": "Encode and Decode Strings", "question__title_slug": "encode-and-decode-strings", "question__hide": false, - "total_acs": 3714, - "total_submitted": 6501, + "total_acs": 3747, + "total_submitted": 6552, "total_column_articles": 61, "frontend_question_id": "271", "is_new_question": false @@ -50496,9 +50790,9 @@ "question__title": "Closest Binary Search Tree Value", "question__title_slug": "closest-binary-search-tree-value", "question__hide": false, - "total_acs": 14279, - "total_submitted": 24802, - "total_column_articles": 172, + "total_acs": 14450, + "total_submitted": 25065, + "total_column_articles": 173, "frontend_question_id": "270", "is_new_question": false }, @@ -50517,9 +50811,9 @@ "question__title": "Alien Dictionary", "question__title_slug": "alien-dictionary", "question__hide": false, - "total_acs": 9512, - "total_submitted": 26694, - "total_column_articles": 157, + "total_acs": 9633, + "total_submitted": 26966, + "total_column_articles": 158, "frontend_question_id": "269", "is_new_question": false }, @@ -50538,9 +50832,9 @@ "question__title": "Missing Number", "question__title_slug": "missing-number", "question__hide": false, - "total_acs": 239255, - "total_submitted": 363482, - "total_column_articles": 1823, + "total_acs": 241914, + "total_submitted": 367373, + "total_column_articles": 1837, "frontend_question_id": "268", "is_new_question": false }, @@ -50559,9 +50853,9 @@ "question__title": "Palindrome Permutation II", "question__title_slug": "palindrome-permutation-ii", "question__hide": false, - "total_acs": 4860, - "total_submitted": 10539, - "total_column_articles": 102, + "total_acs": 4928, + "total_submitted": 10699, + "total_column_articles": 103, "frontend_question_id": "267", "is_new_question": false }, @@ -50580,9 +50874,9 @@ "question__title": "Palindrome Permutation", "question__title_slug": "palindrome-permutation", "question__hide": false, - "total_acs": 9387, - "total_submitted": 13524, - "total_column_articles": 138, + "total_acs": 9488, + "total_submitted": 13659, + "total_column_articles": 140, "frontend_question_id": "266", "is_new_question": false }, @@ -50601,9 +50895,9 @@ "question__title": "Paint House II", "question__title_slug": "paint-house-ii", "question__hide": false, - "total_acs": 10545, - "total_submitted": 16936, - "total_column_articles": 230, + "total_acs": 10707, + "total_submitted": 17175, + "total_column_articles": 235, "frontend_question_id": "265", "is_new_question": false }, @@ -50622,9 +50916,9 @@ "question__title": "Ugly Number II", "question__title_slug": "ugly-number-ii", "question__hide": false, - "total_acs": 128666, - "total_submitted": 219861, - "total_column_articles": 804, + "total_acs": 129780, + "total_submitted": 221592, + "total_column_articles": 809, "frontend_question_id": "264", "is_new_question": false }, @@ -50643,9 +50937,9 @@ "question__title": "Ugly Number", "question__title_slug": "ugly-number", "question__hide": false, - "total_acs": 128224, - "total_submitted": 250504, - "total_column_articles": 980, + "total_acs": 129133, + "total_submitted": 252326, + "total_column_articles": 983, "frontend_question_id": "263", "is_new_question": false }, @@ -50664,9 +50958,9 @@ "question__title": "Trips and Users", "question__title_slug": "trips-and-users", "question__hide": false, - "total_acs": 50079, - "total_submitted": 118013, - "total_column_articles": 484, + "total_acs": 50599, + "total_submitted": 119252, + "total_column_articles": 491, "frontend_question_id": "262", "is_new_question": false }, @@ -50685,8 +50979,8 @@ "question__title": "Graph Valid Tree", "question__title_slug": "graph-valid-tree", "question__hide": false, - "total_acs": 13108, - "total_submitted": 25928, + "total_acs": 13318, + "total_submitted": 26325, "total_column_articles": 185, "frontend_question_id": "261", "is_new_question": false @@ -50706,9 +51000,9 @@ "question__title": "Single Number III", "question__title_slug": "single-number-iii", "question__hide": false, - "total_acs": 92737, - "total_submitted": 126126, - "total_column_articles": 809, + "total_acs": 93527, + "total_submitted": 127198, + "total_column_articles": 816, "frontend_question_id": "260", "is_new_question": false }, @@ -50727,9 +51021,9 @@ "question__title": "3Sum Smaller", "question__title_slug": "3sum-smaller", "question__hide": false, - "total_acs": 10039, - "total_submitted": 17967, - "total_column_articles": 118, + "total_acs": 10181, + "total_submitted": 18229, + "total_column_articles": 119, "frontend_question_id": "259", "is_new_question": false }, @@ -50748,9 +51042,9 @@ "question__title": "Add Digits", "question__title_slug": "add-digits", "question__hide": false, - "total_acs": 138984, - "total_submitted": 195665, - "total_column_articles": 1182, + "total_acs": 139821, + "total_submitted": 196750, + "total_column_articles": 1187, "frontend_question_id": "258", "is_new_question": false }, @@ -50769,9 +51063,9 @@ "question__title": "Binary Tree Paths", "question__title_slug": "binary-tree-paths", "question__hide": false, - "total_acs": 218777, - "total_submitted": 313311, - "total_column_articles": 1499, + "total_acs": 222456, + "total_submitted": 318314, + "total_column_articles": 1522, "frontend_question_id": "257", "is_new_question": false }, @@ -50790,9 +51084,9 @@ "question__title": "Paint House", "question__title_slug": "paint-house", "question__hide": false, - "total_acs": 16819, - "total_submitted": 24911, - "total_column_articles": 261, + "total_acs": 17243, + "total_submitted": 25425, + "total_column_articles": 264, "frontend_question_id": "256", "is_new_question": false }, @@ -50811,8 +51105,8 @@ "question__title": "Verify Preorder Sequence in Binary Search Tree", "question__title_slug": "verify-preorder-sequence-in-binary-search-tree", "question__hide": false, - "total_acs": 7409, - "total_submitted": 15237, + "total_acs": 7502, + "total_submitted": 15420, "total_column_articles": 91, "frontend_question_id": "255", "is_new_question": false @@ -50832,9 +51126,9 @@ "question__title": "Factor Combinations", "question__title_slug": "factor-combinations", "question__hide": false, - "total_acs": 7916, - "total_submitted": 13798, - "total_column_articles": 114, + "total_acs": 8059, + "total_submitted": 14064, + "total_column_articles": 115, "frontend_question_id": "254", "is_new_question": false }, @@ -50853,9 +51147,9 @@ "question__title": "Meeting Rooms II", "question__title_slug": "meeting-rooms-ii", "question__hide": false, - "total_acs": 49862, - "total_submitted": 96600, - "total_column_articles": 490, + "total_acs": 50569, + "total_submitted": 97923, + "total_column_articles": 493, "frontend_question_id": "253", "is_new_question": false }, @@ -50874,9 +51168,9 @@ "question__title": "Meeting Rooms", "question__title_slug": "meeting-rooms", "question__hide": false, - "total_acs": 18163, - "total_submitted": 31690, - "total_column_articles": 202, + "total_acs": 18411, + "total_submitted": 32144, + "total_column_articles": 205, "frontend_question_id": "252", "is_new_question": false }, @@ -50895,8 +51189,8 @@ "question__title": "Flatten 2D Vector", "question__title_slug": "flatten-2d-vector", "question__hide": false, - "total_acs": 5544, - "total_submitted": 9962, + "total_acs": 5610, + "total_submitted": 10102, "total_column_articles": 96, "frontend_question_id": "251", "is_new_question": false @@ -50916,9 +51210,9 @@ "question__title": "Count Univalue Subtrees", "question__title_slug": "count-univalue-subtrees", "question__hide": false, - "total_acs": 6208, - "total_submitted": 9790, - "total_column_articles": 120, + "total_acs": 6270, + "total_submitted": 9877, + "total_column_articles": 121, "frontend_question_id": "250", "is_new_question": false }, @@ -50937,9 +51231,9 @@ "question__title": "Group Shifted Strings", "question__title_slug": "group-shifted-strings", "question__hide": false, - "total_acs": 8382, - "total_submitted": 12905, - "total_column_articles": 147, + "total_acs": 8474, + "total_submitted": 13030, + "total_column_articles": 148, "frontend_question_id": "249", "is_new_question": false }, @@ -50958,9 +51252,9 @@ "question__title": "Strobogrammatic Number III", "question__title_slug": "strobogrammatic-number-iii", "question__hide": false, - "total_acs": 3553, - "total_submitted": 7350, - "total_column_articles": 69, + "total_acs": 3585, + "total_submitted": 7406, + "total_column_articles": 70, "frontend_question_id": "248", "is_new_question": false }, @@ -50979,9 +51273,9 @@ "question__title": "Strobogrammatic Number II", "question__title_slug": "strobogrammatic-number-ii", "question__hide": false, - "total_acs": 7019, - "total_submitted": 13062, - "total_column_articles": 122, + "total_acs": 7087, + "total_submitted": 13176, + "total_column_articles": 123, "frontend_question_id": "247", "is_new_question": false }, @@ -51000,9 +51294,9 @@ "question__title": "Strobogrammatic Number", "question__title_slug": "strobogrammatic-number", "question__hide": false, - "total_acs": 8356, - "total_submitted": 17527, - "total_column_articles": 149, + "total_acs": 8447, + "total_submitted": 17724, + "total_column_articles": 151, "frontend_question_id": "246", "is_new_question": false }, @@ -51021,8 +51315,8 @@ "question__title": "Shortest Word Distance III", "question__title_slug": "shortest-word-distance-iii", "question__hide": false, - "total_acs": 6103, - "total_submitted": 10566, + "total_acs": 6173, + "total_submitted": 10692, "total_column_articles": 82, "frontend_question_id": "245", "is_new_question": false @@ -51042,9 +51336,9 @@ "question__title": "Shortest Word Distance II", "question__title_slug": "shortest-word-distance-ii", "question__hide": false, - "total_acs": 7698, - "total_submitted": 13248, - "total_column_articles": 93, + "total_acs": 7816, + "total_submitted": 13429, + "total_column_articles": 94, "frontend_question_id": "244", "is_new_question": false }, @@ -51063,9 +51357,9 @@ "question__title": "Shortest Word Distance", "question__title_slug": "shortest-word-distance", "question__hide": false, - "total_acs": 12526, - "total_submitted": 18905, - "total_column_articles": 148, + "total_acs": 12681, + "total_submitted": 19114, + "total_column_articles": 152, "frontend_question_id": "243", "is_new_question": false }, @@ -51084,9 +51378,9 @@ "question__title": "Valid Anagram", "question__title_slug": "valid-anagram", "question__hide": false, - "total_acs": 436740, - "total_submitted": 667532, - "total_column_articles": 2475, + "total_acs": 442782, + "total_submitted": 676451, + "total_column_articles": 2510, "frontend_question_id": "242", "is_new_question": false }, @@ -51105,9 +51399,9 @@ "question__title": "Different Ways to Add Parentheses", "question__title_slug": "different-ways-to-add-parentheses", "question__hide": false, - "total_acs": 45239, - "total_submitted": 61399, - "total_column_articles": 423, + "total_acs": 45849, + "total_submitted": 62236, + "total_column_articles": 426, "frontend_question_id": "241", "is_new_question": false }, @@ -51126,9 +51420,9 @@ "question__title": "Search a 2D Matrix II", "question__title_slug": "search-a-2d-matrix-ii", "question__hide": false, - "total_acs": 283182, - "total_submitted": 550603, - "total_column_articles": 1393, + "total_acs": 286789, + "total_submitted": 556618, + "total_column_articles": 1410, "frontend_question_id": "240", "is_new_question": false }, @@ -51147,9 +51441,9 @@ "question__title": "Sliding Window Maximum", "question__title_slug": "sliding-window-maximum", "question__hide": false, - "total_acs": 307754, - "total_submitted": 616122, - "total_column_articles": 2152, + "total_acs": 313035, + "total_submitted": 626777, + "total_column_articles": 2170, "frontend_question_id": "239", "is_new_question": false }, @@ -51168,9 +51462,9 @@ "question__title": "Product of Array Except Self", "question__title_slug": "product-of-array-except-self", "question__hide": false, - "total_acs": 198831, - "total_submitted": 269631, - "total_column_articles": 1268, + "total_acs": 201616, + "total_submitted": 273014, + "total_column_articles": 1281, "frontend_question_id": "238", "is_new_question": false }, @@ -51189,9 +51483,9 @@ "question__title": "Delete Node in a Linked List", "question__title_slug": "delete-node-in-a-linked-list", "question__hide": false, - "total_acs": 296240, - "total_submitted": 344825, - "total_column_articles": 1550, + "total_acs": 298322, + "total_submitted": 347194, + "total_column_articles": 1563, "frontend_question_id": "237", "is_new_question": false }, @@ -51210,9 +51504,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": 396528, - "total_submitted": 573853, - "total_column_articles": 2078, + "total_acs": 402232, + "total_submitted": 581806, + "total_column_articles": 2101, "frontend_question_id": "236", "is_new_question": false }, @@ -51231,9 +51525,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": 249883, - "total_submitted": 370607, - "total_column_articles": 1399, + "total_acs": 253315, + "total_submitted": 375574, + "total_column_articles": 1419, "frontend_question_id": "235", "is_new_question": false }, @@ -51252,9 +51546,9 @@ "question__title": "Palindrome Linked List", "question__title_slug": "palindrome-linked-list", "question__hide": false, - "total_acs": 449640, - "total_submitted": 868103, - "total_column_articles": 2754, + "total_acs": 455480, + "total_submitted": 877933, + "total_column_articles": 2796, "frontend_question_id": "234", "is_new_question": false }, @@ -51273,9 +51567,9 @@ "question__title": "Number of Digit One", "question__title_slug": "number-of-digit-one", "question__hide": false, - "total_acs": 42883, - "total_submitted": 88740, - "total_column_articles": 511, + "total_acs": 43182, + "total_submitted": 89375, + "total_column_articles": 517, "frontend_question_id": "233", "is_new_question": false }, @@ -51294,9 +51588,9 @@ "question__title": "Implement Queue using Stacks", "question__title_slug": "implement-queue-using-stacks", "question__hide": false, - "total_acs": 248203, - "total_submitted": 360546, - "total_column_articles": 1806, + "total_acs": 251781, + "total_submitted": 365693, + "total_column_articles": 1821, "frontend_question_id": "232", "is_new_question": false }, @@ -51315,9 +51609,9 @@ "question__title": "Power of Two", "question__title_slug": "power-of-two", "question__hide": false, - "total_acs": 232364, - "total_submitted": 460421, - "total_column_articles": 1686, + "total_acs": 234475, + "total_submitted": 464538, + "total_column_articles": 1696, "frontend_question_id": "231", "is_new_question": false }, @@ -51336,9 +51630,9 @@ "question__title": "Kth Smallest Element in a BST", "question__title_slug": "kth-smallest-element-in-a-bst", "question__hide": false, - "total_acs": 215518, - "total_submitted": 285515, - "total_column_articles": 1479, + "total_acs": 217750, + "total_submitted": 288347, + "total_column_articles": 1501, "frontend_question_id": "230", "is_new_question": false }, @@ -51357,9 +51651,9 @@ "question__title": "Majority Element II", "question__title_slug": "majority-element-ii", "question__hide": false, - "total_acs": 81695, - "total_submitted": 152399, - "total_column_articles": 764, + "total_acs": 82286, + "total_submitted": 153399, + "total_column_articles": 767, "frontend_question_id": "229", "is_new_question": false }, @@ -51378,9 +51672,9 @@ "question__title": "Summary Ranges", "question__title_slug": "summary-ranges", "question__hide": false, - "total_acs": 73593, - "total_submitted": 130401, - "total_column_articles": 830, + "total_acs": 74290, + "total_submitted": 131710, + "total_column_articles": 837, "frontend_question_id": "228", "is_new_question": false }, @@ -51399,9 +51693,9 @@ "question__title": "Basic Calculator II", "question__title_slug": "basic-calculator-ii", "question__hide": false, - "total_acs": 116506, - "total_submitted": 264532, - "total_column_articles": 903, + "total_acs": 117794, + "total_submitted": 267363, + "total_column_articles": 911, "frontend_question_id": "227", "is_new_question": false }, @@ -51420,9 +51714,9 @@ "question__title": "Invert Binary Tree", "question__title_slug": "invert-binary-tree", "question__hide": false, - "total_acs": 476413, - "total_submitted": 601565, - "total_column_articles": 3123, + "total_acs": 483611, + "total_submitted": 610420, + "total_column_articles": 3156, "frontend_question_id": "226", "is_new_question": false }, @@ -51441,9 +51735,9 @@ "question__title": "Implement Stack using Queues", "question__title_slug": "implement-stack-using-queues", "question__hide": false, - "total_acs": 201164, - "total_submitted": 297656, - "total_column_articles": 5119, + "total_acs": 203879, + "total_submitted": 301634, + "total_column_articles": 5125, "frontend_question_id": "225", "is_new_question": false }, @@ -51462,9 +51756,9 @@ "question__title": "Basic Calculator", "question__title_slug": "basic-calculator", "question__hide": false, - "total_acs": 91986, - "total_submitted": 219214, - "total_column_articles": 807, + "total_acs": 93006, + "total_submitted": 221594, + "total_column_articles": 810, "frontend_question_id": "224", "is_new_question": false }, @@ -51483,9 +51777,9 @@ "question__title": "Rectangle Area", "question__title_slug": "rectangle-area", "question__hide": false, - "total_acs": 48633, - "total_submitted": 91768, - "total_column_articles": 579, + "total_acs": 48960, + "total_submitted": 92369, + "total_column_articles": 582, "frontend_question_id": "223", "is_new_question": false }, @@ -51504,9 +51798,9 @@ "question__title": "Count Complete Tree Nodes", "question__title_slug": "count-complete-tree-nodes", "question__hide": false, - "total_acs": 192073, - "total_submitted": 240406, - "total_column_articles": 1288, + "total_acs": 195616, + "total_submitted": 244674, + "total_column_articles": 1300, "frontend_question_id": "222", "is_new_question": false }, @@ -51525,9 +51819,9 @@ "question__title": "Maximal Square", "question__title_slug": "maximal-square", "question__hide": false, - "total_acs": 203622, - "total_submitted": 415905, - "total_column_articles": 1339, + "total_acs": 206552, + "total_submitted": 421514, + "total_column_articles": 1356, "frontend_question_id": "221", "is_new_question": false }, @@ -51546,9 +51840,9 @@ "question__title": "Contains Duplicate III", "question__title_slug": "contains-duplicate-iii", "question__hide": false, - "total_acs": 80781, - "total_submitted": 278489, - "total_column_articles": 529, + "total_acs": 81492, + "total_submitted": 280725, + "total_column_articles": 536, "frontend_question_id": "220", "is_new_question": false }, @@ -51567,9 +51861,9 @@ "question__title": "Contains Duplicate II", "question__title_slug": "contains-duplicate-ii", "question__hide": false, - "total_acs": 185849, - "total_submitted": 418671, - "total_column_articles": 1527, + "total_acs": 187701, + "total_submitted": 422918, + "total_column_articles": 1537, "frontend_question_id": "219", "is_new_question": false }, @@ -51588,9 +51882,9 @@ "question__title": "The Skyline Problem", "question__title_slug": "the-skyline-problem", "question__hide": false, - "total_acs": 40277, - "total_submitted": 73390, - "total_column_articles": 350, + "total_acs": 40648, + "total_submitted": 74057, + "total_column_articles": 355, "frontend_question_id": "218", "is_new_question": false }, @@ -51609,9 +51903,9 @@ "question__title": "Contains Duplicate", "question__title_slug": "contains-duplicate", "question__hide": false, - "total_acs": 591064, - "total_submitted": 1061596, - "total_column_articles": 2763, + "total_acs": 599467, + "total_submitted": 1076633, + "total_column_articles": 2803, "frontend_question_id": "217", "is_new_question": false }, @@ -51630,9 +51924,9 @@ "question__title": "Combination Sum III", "question__title_slug": "combination-sum-iii", "question__hide": false, - "total_acs": 167459, - "total_submitted": 230356, - "total_column_articles": 1469, + "total_acs": 170711, + "total_submitted": 234962, + "total_column_articles": 1485, "frontend_question_id": "216", "is_new_question": false }, @@ -51651,9 +51945,9 @@ "question__title": "Kth Largest Element in an Array", "question__title_slug": "kth-largest-element-in-an-array", "question__hide": false, - "total_acs": 652940, - "total_submitted": 1008480, - "total_column_articles": 3261, + "total_acs": 662903, + "total_submitted": 1023650, + "total_column_articles": 3294, "frontend_question_id": "215", "is_new_question": false }, @@ -51672,9 +51966,9 @@ "question__title": "Shortest Palindrome", "question__title_slug": "shortest-palindrome", "question__hide": false, - "total_acs": 37737, - "total_submitted": 98555, - "total_column_articles": 384, + "total_acs": 38052, + "total_submitted": 99223, + "total_column_articles": 386, "frontend_question_id": "214", "is_new_question": false }, @@ -51693,9 +51987,9 @@ "question__title": "House Robber II", "question__title_slug": "house-robber-ii", "question__hide": false, - "total_acs": 253414, - "total_submitted": 578834, - "total_column_articles": 2212, + "total_acs": 256793, + "total_submitted": 586359, + "total_column_articles": 2242, "frontend_question_id": "213", "is_new_question": false }, @@ -51714,9 +52008,9 @@ "question__title": "Word Search II", "question__title_slug": "word-search-ii", "question__hide": false, - "total_acs": 77024, - "total_submitted": 169021, - "total_column_articles": 675, + "total_acs": 77691, + "total_submitted": 170799, + "total_column_articles": 683, "frontend_question_id": "212", "is_new_question": false }, @@ -51735,9 +52029,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": 60349, - "total_submitted": 119095, - "total_column_articles": 634, + "total_acs": 60875, + "total_submitted": 120369, + "total_column_articles": 637, "frontend_question_id": "211", "is_new_question": false }, @@ -51756,9 +52050,9 @@ "question__title": "Course Schedule II", "question__title_slug": "course-schedule-ii", "question__hide": false, - "total_acs": 132451, - "total_submitted": 237833, - "total_column_articles": 989, + "total_acs": 134427, + "total_submitted": 241161, + "total_column_articles": 1012, "frontend_question_id": "210", "is_new_question": false }, @@ -51777,9 +52071,9 @@ "question__title": "Minimum Size Subarray Sum", "question__title_slug": "minimum-size-subarray-sum", "question__hide": false, - "total_acs": 350739, - "total_submitted": 718321, - "total_column_articles": 2360, + "total_acs": 358840, + "total_submitted": 735764, + "total_column_articles": 2386, "frontend_question_id": "209", "is_new_question": false }, @@ -51798,9 +52092,9 @@ "question__title": "Implement Trie (Prefix Tree)", "question__title_slug": "implement-trie-prefix-tree", "question__hide": false, - "total_acs": 203393, - "total_submitted": 282843, - "total_column_articles": 1311, + "total_acs": 205864, + "total_submitted": 286252, + "total_column_articles": 1330, "frontend_question_id": "208", "is_new_question": false }, @@ -51819,9 +52113,9 @@ "question__title": "Course Schedule", "question__title_slug": "course-schedule", "question__hide": false, - "total_acs": 217501, - "total_submitted": 403612, - "total_column_articles": 1469, + "total_acs": 221156, + "total_submitted": 410634, + "total_column_articles": 1513, "frontend_question_id": "207", "is_new_question": false }, @@ -51840,9 +52134,9 @@ "question__title": "Reverse Linked List", "question__title_slug": "reverse-linked-list", "question__hide": false, - "total_acs": 1080645, - "total_submitted": 1479652, - "total_column_articles": 9455, + "total_acs": 1096101, + "total_submitted": 1499934, + "total_column_articles": 9544, "frontend_question_id": "206", "is_new_question": false }, @@ -51861,9 +52155,9 @@ "question__title": "Isomorphic Strings", "question__title_slug": "isomorphic-strings", "question__hide": false, - "total_acs": 145061, - "total_submitted": 290770, - "total_column_articles": 1104, + "total_acs": 147841, + "total_submitted": 296394, + "total_column_articles": 1125, "frontend_question_id": "205", "is_new_question": false }, @@ -51882,9 +52176,9 @@ "question__title": "Count Primes", "question__title_slug": "count-primes", "question__hide": false, - "total_acs": 207474, - "total_submitted": 552700, - "total_column_articles": 888, + "total_acs": 209169, + "total_submitted": 557320, + "total_column_articles": 896, "frontend_question_id": "204", "is_new_question": false }, @@ -51903,9 +52197,9 @@ "question__title": "Remove Linked List Elements", "question__title_slug": "remove-linked-list-elements", "question__hide": false, - "total_acs": 373069, - "total_submitted": 694353, - "total_column_articles": 2426, + "total_acs": 378921, + "total_submitted": 704312, + "total_column_articles": 2448, "frontend_question_id": "203", "is_new_question": false }, @@ -51924,9 +52218,9 @@ "question__title": "Happy Number", "question__title_slug": "happy-number", "question__hide": false, - "total_acs": 259161, - "total_submitted": 411906, - "total_column_articles": 1998, + "total_acs": 263285, + "total_submitted": 418220, + "total_column_articles": 2028, "frontend_question_id": "202", "is_new_question": false }, @@ -51945,9 +52239,9 @@ "question__title": "Bitwise AND of Numbers Range", "question__title_slug": "bitwise-and-of-numbers-range", "question__hide": false, - "total_acs": 62632, - "total_submitted": 117072, - "total_column_articles": 433, + "total_acs": 63211, + "total_submitted": 118131, + "total_column_articles": 438, "frontend_question_id": "201", "is_new_question": false }, @@ -51966,9 +52260,9 @@ "question__title": "Number of Islands", "question__title_slug": "number-of-islands", "question__hide": false, - "total_acs": 490782, - "total_submitted": 847017, - "total_column_articles": 3078, + "total_acs": 497378, + "total_submitted": 857317, + "total_column_articles": 3125, "frontend_question_id": "200", "is_new_question": false }, @@ -51987,9 +52281,9 @@ "question__title": "Binary Tree Right Side View", "question__title_slug": "binary-tree-right-side-view", "question__hide": false, - "total_acs": 214242, - "total_submitted": 326840, - "total_column_articles": 2207, + "total_acs": 217248, + "total_submitted": 331295, + "total_column_articles": 2227, "frontend_question_id": "199", "is_new_question": false }, @@ -52008,9 +52302,9 @@ "question__title": "House Robber", "question__title_slug": "house-robber", "question__hide": false, - "total_acs": 569475, - "total_submitted": 1067675, - "total_column_articles": 3806, + "total_acs": 576285, + "total_submitted": 1079221, + "total_column_articles": 3837, "frontend_question_id": "198", "is_new_question": false }, @@ -52029,9 +52323,9 @@ "question__title": "Rising Temperature", "question__title_slug": "rising-temperature", "question__hide": false, - "total_acs": 127797, - "total_submitted": 238749, - "total_column_articles": 715, + "total_acs": 129667, + "total_submitted": 242002, + "total_column_articles": 725, "frontend_question_id": "197", "is_new_question": false }, @@ -52050,9 +52344,9 @@ "question__title": "Delete Duplicate Emails", "question__title_slug": "delete-duplicate-emails", "question__hide": false, - "total_acs": 143298, - "total_submitted": 212678, - "total_column_articles": 557, + "total_acs": 146039, + "total_submitted": 216492, + "total_column_articles": 570, "frontend_question_id": "196", "is_new_question": false }, @@ -52071,9 +52365,9 @@ "question__title": "Tenth Line", "question__title_slug": "tenth-line", "question__hide": false, - "total_acs": 43575, - "total_submitted": 99125, - "total_column_articles": 173, + "total_acs": 43825, + "total_submitted": 99678, + "total_column_articles": 174, "frontend_question_id": "195", "is_new_question": false }, @@ -52092,8 +52386,8 @@ "question__title": "Transpose File", "question__title_slug": "transpose-file", "question__hide": false, - "total_acs": 12654, - "total_submitted": 36400, + "total_acs": 12743, + "total_submitted": 36677, "total_column_articles": 88, "frontend_question_id": "194", "is_new_question": false @@ -52113,9 +52407,9 @@ "question__title": "Valid Phone Numbers", "question__title_slug": "valid-phone-numbers", "question__hide": false, - "total_acs": 32075, - "total_submitted": 96572, - "total_column_articles": 164, + "total_acs": 32318, + "total_submitted": 97241, + "total_column_articles": 166, "frontend_question_id": "193", "is_new_question": false }, @@ -52134,9 +52428,9 @@ "question__title": "Word Frequency", "question__title_slug": "word-frequency", "question__hide": false, - "total_acs": 26187, - "total_submitted": 73019, - "total_column_articles": 204, + "total_acs": 26353, + "total_submitted": 73547, + "total_column_articles": 207, "frontend_question_id": "192", "is_new_question": false }, @@ -52155,9 +52449,9 @@ "question__title": "Number of 1 Bits", "question__title_slug": "number-of-1-bits", "question__hide": false, - "total_acs": 260728, - "total_submitted": 343518, - "total_column_articles": 1656, + "total_acs": 263491, + "total_submitted": 347108, + "total_column_articles": 1672, "frontend_question_id": "191", "is_new_question": false }, @@ -52176,9 +52470,9 @@ "question__title": "Reverse Bits", "question__title_slug": "reverse-bits", "question__hide": false, - "total_acs": 173806, - "total_submitted": 244385, - "total_column_articles": 1086, + "total_acs": 175387, + "total_submitted": 246537, + "total_column_articles": 1096, "frontend_question_id": "190", "is_new_question": false }, @@ -52197,9 +52491,9 @@ "question__title": "Rotate Array", "question__title_slug": "rotate-array", "question__hide": false, - "total_acs": 515113, - "total_submitted": 1160673, - "total_column_articles": 2583, + "total_acs": 520492, + "total_submitted": 1172898, + "total_column_articles": 2612, "frontend_question_id": "189", "is_new_question": false }, @@ -52218,9 +52512,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": 132138, - "total_submitted": 316651, - "total_column_articles": 1026, + "total_acs": 134306, + "total_submitted": 321147, + "total_column_articles": 1037, "frontend_question_id": "188", "is_new_question": false }, @@ -52239,9 +52533,9 @@ "question__title": "Repeated DNA Sequences", "question__title_slug": "repeated-dna-sequences", "question__hide": false, - "total_acs": 103630, - "total_submitted": 196230, - "total_column_articles": 764, + "total_acs": 104928, + "total_submitted": 198659, + "total_column_articles": 768, "frontend_question_id": "187", "is_new_question": false }, @@ -52260,8 +52554,8 @@ "question__title": "Reverse Words in a String II", "question__title_slug": "reverse-words-in-a-string-ii", "question__hide": false, - "total_acs": 10389, - "total_submitted": 13677, + "total_acs": 10497, + "total_submitted": 13865, "total_column_articles": 157, "frontend_question_id": "186", "is_new_question": false @@ -52281,9 +52575,9 @@ "question__title": "Department Top Three Salaries", "question__title_slug": "department-top-three-salaries", "question__hide": false, - "total_acs": 93041, - "total_submitted": 180729, - "total_column_articles": 818, + "total_acs": 94023, + "total_submitted": 182375, + "total_column_articles": 823, "frontend_question_id": "185", "is_new_question": false }, @@ -52302,9 +52596,9 @@ "question__title": "Department Highest Salary", "question__title_slug": "department-highest-salary", "question__hide": false, - "total_acs": 133463, - "total_submitted": 269094, - "total_column_articles": 880, + "total_acs": 134767, + "total_submitted": 271244, + "total_column_articles": 891, "frontend_question_id": "184", "is_new_question": false }, @@ -52323,9 +52617,9 @@ "question__title": "Customers Who Never Order", "question__title_slug": "customers-who-never-order", "question__hide": false, - "total_acs": 217581, - "total_submitted": 325654, - "total_column_articles": 810, + "total_acs": 222344, + "total_submitted": 333085, + "total_column_articles": 816, "frontend_question_id": "183", "is_new_question": false }, @@ -52344,9 +52638,9 @@ "question__title": "Duplicate Emails", "question__title_slug": "duplicate-emails", "question__hide": false, - "total_acs": 232921, - "total_submitted": 293589, - "total_column_articles": 796, + "total_acs": 235190, + "total_submitted": 296451, + "total_column_articles": 803, "frontend_question_id": "182", "is_new_question": false }, @@ -52365,9 +52659,9 @@ "question__title": "Employees Earning More Than Their Managers", "question__title_slug": "employees-earning-more-than-their-managers", "question__hide": false, - "total_acs": 214810, - "total_submitted": 310535, - "total_column_articles": 893, + "total_acs": 216812, + "total_submitted": 313416, + "total_column_articles": 902, "frontend_question_id": "181", "is_new_question": false }, @@ -52386,9 +52680,9 @@ "question__title": "Consecutive Numbers", "question__title_slug": "consecutive-numbers", "question__hide": false, - "total_acs": 114746, - "total_submitted": 237604, - "total_column_articles": 681, + "total_acs": 115921, + "total_submitted": 240106, + "total_column_articles": 687, "frontend_question_id": "180", "is_new_question": false }, @@ -52407,9 +52701,9 @@ "question__title": "Largest Number", "question__title_slug": "largest-number", "question__hide": false, - "total_acs": 159837, - "total_submitted": 388281, - "total_column_articles": 1226, + "total_acs": 161574, + "total_submitted": 392570, + "total_column_articles": 1232, "frontend_question_id": "179", "is_new_question": false }, @@ -52428,9 +52722,9 @@ "question__title": "Rank Scores", "question__title_slug": "rank-scores", "question__hide": false, - "total_acs": 155027, - "total_submitted": 256010, - "total_column_articles": 833, + "total_acs": 156475, + "total_submitted": 258334, + "total_column_articles": 839, "frontend_question_id": "178", "is_new_question": false }, @@ -52449,9 +52743,9 @@ "question__title": "Nth Highest Salary", "question__title_slug": "nth-highest-salary", "question__hide": false, - "total_acs": 164003, - "total_submitted": 352469, - "total_column_articles": 662, + "total_acs": 165390, + "total_submitted": 355327, + "total_column_articles": 667, "frontend_question_id": "177", "is_new_question": false }, @@ -52470,9 +52764,9 @@ "question__title": "Second Highest Salary", "question__title_slug": "second-highest-salary", "question__hide": false, - "total_acs": 320182, - "total_submitted": 895664, - "total_column_articles": 1317, + "total_acs": 323420, + "total_submitted": 903815, + "total_column_articles": 1334, "frontend_question_id": "176", "is_new_question": false }, @@ -52491,9 +52785,9 @@ "question__title": "Combine Two Tables", "question__title_slug": "combine-two-tables", "question__hide": false, - "total_acs": 390730, - "total_submitted": 530348, - "total_column_articles": 1811, + "total_acs": 394368, + "total_submitted": 535136, + "total_column_articles": 1822, "frontend_question_id": "175", "is_new_question": false }, @@ -52512,9 +52806,9 @@ "question__title": "Dungeon Game", "question__title_slug": "dungeon-game", "question__hide": false, - "total_acs": 49663, - "total_submitted": 102548, - "total_column_articles": 1011, + "total_acs": 50206, + "total_submitted": 103629, + "total_column_articles": 1017, "frontend_question_id": "174", "is_new_question": false }, @@ -52533,9 +52827,9 @@ "question__title": "Binary Search Tree Iterator", "question__title_slug": "binary-search-tree-iterator", "question__hide": false, - "total_acs": 95086, - "total_submitted": 117274, - "total_column_articles": 778, + "total_acs": 95907, + "total_submitted": 118234, + "total_column_articles": 784, "frontend_question_id": "173", "is_new_question": false }, @@ -52554,9 +52848,9 @@ "question__title": "Factorial Trailing Zeroes", "question__title_slug": "factorial-trailing-zeroes", "question__hide": false, - "total_acs": 144094, - "total_submitted": 296697, - "total_column_articles": 969, + "total_acs": 145042, + "total_submitted": 298261, + "total_column_articles": 971, "frontend_question_id": "172", "is_new_question": false }, @@ -52575,9 +52869,9 @@ "question__title": "Excel Sheet Column Number", "question__title_slug": "excel-sheet-column-number", "question__hide": false, - "total_acs": 134147, - "total_submitted": 187233, - "total_column_articles": 1127, + "total_acs": 135246, + "total_submitted": 188783, + "total_column_articles": 1133, "frontend_question_id": "171", "is_new_question": false }, @@ -52596,9 +52890,9 @@ "question__title": "Two Sum III - Data structure design", "question__title_slug": "two-sum-iii-data-structure-design", "question__hide": false, - "total_acs": 13062, - "total_submitted": 30523, - "total_column_articles": 126, + "total_acs": 13200, + "total_submitted": 30860, + "total_column_articles": 129, "frontend_question_id": "170", "is_new_question": false }, @@ -52617,9 +52911,9 @@ "question__title": "Majority Element", "question__title_slug": "majority-element", "question__hide": false, - "total_acs": 537710, - "total_submitted": 804439, - "total_column_articles": 2954, + "total_acs": 543467, + "total_submitted": 812711, + "total_column_articles": 2984, "frontend_question_id": "169", "is_new_question": false }, @@ -52638,9 +52932,9 @@ "question__title": "Excel Sheet Column Title", "question__title_slug": "excel-sheet-column-title", "question__hide": false, - "total_acs": 109620, - "total_submitted": 250913, - "total_column_articles": 945, + "total_acs": 110622, + "total_submitted": 252961, + "total_column_articles": 953, "frontend_question_id": "168", "is_new_question": false }, @@ -52659,9 +52953,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": 443881, - "total_submitted": 756867, - "total_column_articles": 2855, + "total_acs": 448972, + "total_submitted": 764909, + "total_column_articles": 2884, "frontend_question_id": "167", "is_new_question": false }, @@ -52680,9 +52974,9 @@ "question__title": "Fraction to Recurring Decimal", "question__title_slug": "fraction-to-recurring-decimal", "question__hide": false, - "total_acs": 52442, - "total_submitted": 157231, - "total_column_articles": 452, + "total_acs": 52954, + "total_submitted": 158689, + "total_column_articles": 454, "frontend_question_id": "166", "is_new_question": false }, @@ -52701,9 +52995,9 @@ "question__title": "Compare Version Numbers", "question__title_slug": "compare-version-numbers", "question__hide": false, - "total_acs": 115645, - "total_submitted": 222422, - "total_column_articles": 1108, + "total_acs": 117040, + "total_submitted": 225162, + "total_column_articles": 1115, "frontend_question_id": "165", "is_new_question": false }, @@ -52722,9 +53016,9 @@ "question__title": "Maximum Gap", "question__title_slug": "maximum-gap", "question__hide": false, - "total_acs": 71718, - "total_submitted": 118171, - "total_column_articles": 584, + "total_acs": 72141, + "total_submitted": 118880, + "total_column_articles": 586, "frontend_question_id": "164", "is_new_question": false }, @@ -52743,9 +53037,9 @@ "question__title": "Missing Ranges", "question__title_slug": "missing-ranges", "question__hide": false, - "total_acs": 14073, - "total_submitted": 40569, - "total_column_articles": 207, + "total_acs": 14277, + "total_submitted": 41096, + "total_column_articles": 210, "frontend_question_id": "163", "is_new_question": false }, @@ -52764,9 +53058,9 @@ "question__title": "Find Peak Element", "question__title_slug": "find-peak-element", "question__hide": false, - "total_acs": 234617, - "total_submitted": 474153, - "total_column_articles": 1564, + "total_acs": 237599, + "total_submitted": 480106, + "total_column_articles": 1576, "frontend_question_id": "162", "is_new_question": false }, @@ -52785,9 +53079,9 @@ "question__title": "One Edit Distance", "question__title_slug": "one-edit-distance", "question__hide": false, - "total_acs": 10514, - "total_submitted": 30998, - "total_column_articles": 135, + "total_acs": 10653, + "total_submitted": 31386, + "total_column_articles": 136, "frontend_question_id": "161", "is_new_question": false }, @@ -52806,9 +53100,9 @@ "question__title": "Intersection of Two Linked Lists", "question__title_slug": "intersection-of-two-linked-lists", "question__hide": false, - "total_acs": 494932, - "total_submitted": 786796, - "total_column_articles": 2914, + "total_acs": 501238, + "total_submitted": 796252, + "total_column_articles": 2943, "frontend_question_id": "160", "is_new_question": false }, @@ -52827,9 +53121,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": 23911, - "total_submitted": 42983, - "total_column_articles": 272, + "total_acs": 24204, + "total_submitted": 43508, + "total_column_articles": 274, "frontend_question_id": "159", "is_new_question": false }, @@ -52848,9 +53142,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": 3978, - "total_submitted": 6624, - "total_column_articles": 86, + "total_acs": 4030, + "total_submitted": 6726, + "total_column_articles": 87, "frontend_question_id": "158", "is_new_question": false }, @@ -52869,9 +53163,9 @@ "question__title": "Read N Characters Given Read4", "question__title_slug": "read-n-characters-given-read4", "question__hide": false, - "total_acs": 7925, - "total_submitted": 14577, - "total_column_articles": 111, + "total_acs": 8019, + "total_submitted": 14751, + "total_column_articles": 113, "frontend_question_id": "157", "is_new_question": false }, @@ -52890,9 +53184,9 @@ "question__title": "Binary Tree Upside Down", "question__title_slug": "binary-tree-upside-down", "question__hide": false, - "total_acs": 10089, - "total_submitted": 13921, - "total_column_articles": 186, + "total_acs": 10195, + "total_submitted": 14081, + "total_column_articles": 187, "frontend_question_id": "156", "is_new_question": false }, @@ -52911,15 +53205,15 @@ "question__title": "Min Stack", "question__title_slug": "min-stack", "question__hide": false, - "total_acs": 391362, - "total_submitted": 671873, - "total_column_articles": 2141, + "total_acs": 395637, + "total_submitted": 678753, + "total_column_articles": 2156, "frontend_question_id": "155", "is_new_question": false }, "status": null, "difficulty": { - "level": 1 + "level": 2 }, "paid_only": false, "is_favor": false, @@ -52932,9 +53226,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": 144382, - "total_submitted": 272810, - "total_column_articles": 1107, + "total_acs": 145617, + "total_submitted": 275175, + "total_column_articles": 1112, "frontend_question_id": "154", "is_new_question": false }, @@ -52953,9 +53247,9 @@ "question__title": "Find Minimum in Rotated Sorted Array", "question__title_slug": "find-minimum-in-rotated-sorted-array", "question__hide": false, - "total_acs": 296075, - "total_submitted": 519895, - "total_column_articles": 2029, + "total_acs": 299333, + "total_submitted": 525586, + "total_column_articles": 2047, "frontend_question_id": "153", "is_new_question": false }, @@ -52974,9 +53268,9 @@ "question__title": "Maximum Product Subarray", "question__title_slug": "maximum-product-subarray", "question__hide": false, - "total_acs": 275104, - "total_submitted": 644043, - "total_column_articles": 1730, + "total_acs": 278867, + "total_submitted": 652451, + "total_column_articles": 1747, "frontend_question_id": "152", "is_new_question": false }, @@ -52995,9 +53289,9 @@ "question__title": "Reverse Words in a String", "question__title_slug": "reverse-words-in-a-string", "question__hide": false, - "total_acs": 263061, - "total_submitted": 521233, - "total_column_articles": 2085, + "total_acs": 267489, + "total_submitted": 529379, + "total_column_articles": 2100, "frontend_question_id": "151", "is_new_question": false }, @@ -53016,9 +53310,9 @@ "question__title": "Evaluate Reverse Polish Notation", "question__title_slug": "evaluate-reverse-polish-notation", "question__hide": false, - "total_acs": 193966, - "total_submitted": 361063, - "total_column_articles": 1478, + "total_acs": 196615, + "total_submitted": 365947, + "total_column_articles": 1502, "frontend_question_id": "150", "is_new_question": false }, @@ -53037,9 +53331,9 @@ "question__title": "Max Points on a Line", "question__title_slug": "max-points-on-a-line", "question__hide": false, - "total_acs": 63138, - "total_submitted": 169442, - "total_column_articles": 651, + "total_acs": 63800, + "total_submitted": 170622, + "total_column_articles": 655, "frontend_question_id": "149", "is_new_question": false }, @@ -53058,9 +53352,9 @@ "question__title": "Sort List", "question__title_slug": "sort-list", "question__hide": false, - "total_acs": 306457, - "total_submitted": 461324, - "total_column_articles": 1752, + "total_acs": 311040, + "total_submitted": 468499, + "total_column_articles": 1775, "frontend_question_id": "148", "is_new_question": false }, @@ -53079,9 +53373,9 @@ "question__title": "Insertion Sort List", "question__title_slug": "insertion-sort-list", "question__hide": false, - "total_acs": 124715, - "total_submitted": 180938, - "total_column_articles": 950, + "total_acs": 125797, + "total_submitted": 182351, + "total_column_articles": 958, "frontend_question_id": "147", "is_new_question": false }, @@ -53100,9 +53394,9 @@ "question__title": "LRU Cache", "question__title_slug": "lru-cache", "question__hide": false, - "total_acs": 362528, - "total_submitted": 685047, - "total_column_articles": 2606, + "total_acs": 367649, + "total_submitted": 694520, + "total_column_articles": 2637, "frontend_question_id": "146", "is_new_question": false }, @@ -53121,9 +53415,9 @@ "question__title": "Binary Tree Postorder Traversal", "question__title_slug": "binary-tree-postorder-traversal", "question__hide": false, - "total_acs": 457114, - "total_submitted": 602177, - "total_column_articles": 2162, + "total_acs": 463352, + "total_submitted": 610040, + "total_column_articles": 2174, "frontend_question_id": "145", "is_new_question": false }, @@ -53142,9 +53436,9 @@ "question__title": "Binary Tree Preorder Traversal", "question__title_slug": "binary-tree-preorder-traversal", "question__hide": false, - "total_acs": 626049, - "total_submitted": 880473, - "total_column_articles": 2713, + "total_acs": 634958, + "total_submitted": 892696, + "total_column_articles": 2734, "frontend_question_id": "144", "is_new_question": false }, @@ -53163,9 +53457,9 @@ "question__title": "Reorder List", "question__title_slug": "reorder-list", "question__hide": false, - "total_acs": 186964, - "total_submitted": 292437, - "total_column_articles": 1457, + "total_acs": 189709, + "total_submitted": 296438, + "total_column_articles": 1472, "frontend_question_id": "143", "is_new_question": false }, @@ -53184,9 +53478,9 @@ "question__title": "Linked List Cycle II", "question__title_slug": "linked-list-cycle-ii", "question__hide": false, - "total_acs": 467500, - "total_submitted": 832109, - "total_column_articles": 2728, + "total_acs": 475077, + "total_submitted": 845118, + "total_column_articles": 2762, "frontend_question_id": "142", "is_new_question": false }, @@ -53205,9 +53499,9 @@ "question__title": "Linked List Cycle", "question__title_slug": "linked-list-cycle", "question__hide": false, - "total_acs": 763347, - "total_submitted": 1483583, - "total_column_articles": 3926, + "total_acs": 772484, + "total_submitted": 1500970, + "total_column_articles": 3964, "frontend_question_id": "141", "is_new_question": false }, @@ -53226,9 +53520,9 @@ "question__title": "Word Break II", "question__title_slug": "word-break-ii", "question__hide": false, - "total_acs": 69684, - "total_submitted": 130505, - "total_column_articles": 760, + "total_acs": 70574, + "total_submitted": 131666, + "total_column_articles": 768, "frontend_question_id": "140", "is_new_question": false }, @@ -53247,9 +53541,9 @@ "question__title": "Word Break", "question__title_slug": "word-break", "question__hide": false, - "total_acs": 311762, - "total_submitted": 585348, - "total_column_articles": 1862, + "total_acs": 317266, + "total_submitted": 595503, + "total_column_articles": 1892, "frontend_question_id": "139", "is_new_question": false }, @@ -53268,9 +53562,9 @@ "question__title": "Copy List with Random Pointer", "question__title_slug": "copy-list-with-random-pointer", "question__hide": false, - "total_acs": 154774, - "total_submitted": 231152, - "total_column_articles": 1124, + "total_acs": 156419, + "total_submitted": 233572, + "total_column_articles": 1127, "frontend_question_id": "138", "is_new_question": false }, @@ -53289,9 +53583,9 @@ "question__title": "Single Number II", "question__title_slug": "single-number-ii", "question__hide": false, - "total_acs": 126316, - "total_submitted": 175064, - "total_column_articles": 937, + "total_acs": 127294, + "total_submitted": 176438, + "total_column_articles": 939, "frontend_question_id": "137", "is_new_question": false }, @@ -53310,9 +53604,9 @@ "question__title": "Single Number", "question__title_slug": "single-number", "question__hide": false, - "total_acs": 707700, - "total_submitted": 979919, - "total_column_articles": 3206, + "total_acs": 715633, + "total_submitted": 990741, + "total_column_articles": 3243, "frontend_question_id": "136", "is_new_question": false }, @@ -53331,9 +53625,9 @@ "question__title": "Candy", "question__title_slug": "candy", "question__hide": false, - "total_acs": 150494, - "total_submitted": 305637, - "total_column_articles": 1143, + "total_acs": 152652, + "total_submitted": 309873, + "total_column_articles": 1158, "frontend_question_id": "135", "is_new_question": false }, @@ -53352,9 +53646,9 @@ "question__title": "Gas Station", "question__title_slug": "gas-station", "question__hide": false, - "total_acs": 183063, - "total_submitted": 340314, - "total_column_articles": 1302, + "total_acs": 185597, + "total_submitted": 345789, + "total_column_articles": 1318, "frontend_question_id": "134", "is_new_question": false }, @@ -53373,9 +53667,9 @@ "question__title": "Clone Graph", "question__title_slug": "clone-graph", "question__hide": false, - "total_acs": 93934, - "total_submitted": 137345, - "total_column_articles": 665, + "total_acs": 94794, + "total_submitted": 138531, + "total_column_articles": 675, "frontend_question_id": "133", "is_new_question": false }, @@ -53394,9 +53688,9 @@ "question__title": "Palindrome Partitioning II", "question__title_slug": "palindrome-partitioning-ii", "question__hide": false, - "total_acs": 61102, - "total_submitted": 123255, - "total_column_articles": 525, + "total_acs": 61682, + "total_submitted": 124370, + "total_column_articles": 527, "frontend_question_id": "132", "is_new_question": false }, @@ -53415,9 +53709,9 @@ "question__title": "Palindrome Partitioning", "question__title_slug": "palindrome-partitioning", "question__hide": false, - "total_acs": 203627, - "total_submitted": 278873, - "total_column_articles": 1287, + "total_acs": 206876, + "total_submitted": 283192, + "total_column_articles": 1297, "frontend_question_id": "131", "is_new_question": false }, @@ -53436,9 +53730,9 @@ "question__title": "Surrounded Regions", "question__title_slug": "surrounded-regions", "question__hide": false, - "total_acs": 180953, - "total_submitted": 395918, - "total_column_articles": 1668, + "total_acs": 182953, + "total_submitted": 399938, + "total_column_articles": 1698, "frontend_question_id": "130", "is_new_question": false }, @@ -53457,9 +53751,9 @@ "question__title": "Sum Root to Leaf Numbers", "question__title_slug": "sum-root-to-leaf-numbers", "question__hide": false, - "total_acs": 167104, - "total_submitted": 240644, - "total_column_articles": 1473, + "total_acs": 169073, + "total_submitted": 243320, + "total_column_articles": 1481, "frontend_question_id": "129", "is_new_question": false }, @@ -53478,9 +53772,9 @@ "question__title": "Longest Consecutive Sequence", "question__title_slug": "longest-consecutive-sequence", "question__hide": false, - "total_acs": 277763, - "total_submitted": 505114, - "total_column_articles": 1760, + "total_acs": 282637, + "total_submitted": 513672, + "total_column_articles": 1788, "frontend_question_id": "128", "is_new_question": false }, @@ -53499,9 +53793,9 @@ "question__title": "Word Ladder", "question__title_slug": "word-ladder", "question__hide": false, - "total_acs": 153903, - "total_submitted": 322928, - "total_column_articles": 838, + "total_acs": 155243, + "total_submitted": 325449, + "total_column_articles": 851, "frontend_question_id": "127", "is_new_question": false }, @@ -53520,9 +53814,9 @@ "question__title": "Word Ladder II", "question__title_slug": "word-ladder-ii", "question__hide": false, - "total_acs": 46874, - "total_submitted": 114810, - "total_column_articles": 422, + "total_acs": 47277, + "total_submitted": 116164, + "total_column_articles": 421, "frontend_question_id": "126", "is_new_question": false }, @@ -53541,9 +53835,9 @@ "question__title": "Valid Palindrome", "question__title_slug": "valid-palindrome", "question__hide": false, - "total_acs": 370564, - "total_submitted": 789694, - "total_column_articles": 2357, + "total_acs": 374383, + "total_submitted": 797866, + "total_column_articles": 2373, "frontend_question_id": "125", "is_new_question": false }, @@ -53562,9 +53856,9 @@ "question__title": "Binary Tree Maximum Path Sum", "question__title_slug": "binary-tree-maximum-path-sum", "question__hide": false, - "total_acs": 240801, - "total_submitted": 534417, - "total_column_articles": 1557, + "total_acs": 244106, + "total_submitted": 541342, + "total_column_articles": 1574, "frontend_question_id": "124", "is_new_question": false }, @@ -53583,9 +53877,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": 187609, - "total_submitted": 332467, - "total_column_articles": 1155, + "total_acs": 190437, + "total_submitted": 336682, + "total_column_articles": 1170, "frontend_question_id": "123", "is_new_question": false }, @@ -53604,9 +53898,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": 661239, - "total_submitted": 936378, - "total_column_articles": 3674, + "total_acs": 669082, + "total_submitted": 946641, + "total_column_articles": 3704, "frontend_question_id": "122", "is_new_question": false }, @@ -53625,9 +53919,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": 819905, - "total_submitted": 1415545, - "total_column_articles": 4828, + "total_acs": 830284, + "total_submitted": 1432556, + "total_column_articles": 4864, "frontend_question_id": "121", "is_new_question": false }, @@ -53646,9 +53940,9 @@ "question__title": "Triangle", "question__title_slug": "triangle", "question__hide": false, - "total_acs": 240240, - "total_submitted": 350048, - "total_column_articles": 2053, + "total_acs": 242404, + "total_submitted": 353006, + "total_column_articles": 2066, "frontend_question_id": "120", "is_new_question": false }, @@ -53667,9 +53961,9 @@ "question__title": "Pascal's Triangle II", "question__title_slug": "pascals-triangle-ii", "question__hide": false, - "total_acs": 207839, - "total_submitted": 303541, - "total_column_articles": 1660, + "total_acs": 210037, + "total_submitted": 306645, + "total_column_articles": 1686, "frontend_question_id": "119", "is_new_question": false }, @@ -53688,9 +53982,9 @@ "question__title": "Pascal's Triangle", "question__title_slug": "pascals-triangle", "question__hide": false, - "total_acs": 313382, - "total_submitted": 417825, - "total_column_articles": 2501, + "total_acs": 316786, + "total_submitted": 422081, + "total_column_articles": 2534, "frontend_question_id": "118", "is_new_question": false }, @@ -53709,9 +54003,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": 139909, - "total_submitted": 217781, - "total_column_articles": 1095, + "total_acs": 141771, + "total_submitted": 220423, + "total_column_articles": 1108, "frontend_question_id": "117", "is_new_question": false }, @@ -53730,9 +54024,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": 261398, - "total_submitted": 364296, - "total_column_articles": 2065, + "total_acs": 265261, + "total_submitted": 369471, + "total_column_articles": 2085, "frontend_question_id": "116", "is_new_question": false }, @@ -53751,9 +54045,9 @@ "question__title": "Distinct Subsequences", "question__title_slug": "distinct-subsequences", "question__hide": false, - "total_acs": 92637, - "total_submitted": 177810, - "total_column_articles": 931, + "total_acs": 94224, + "total_submitted": 180791, + "total_column_articles": 940, "frontend_question_id": "115", "is_new_question": false }, @@ -53772,9 +54066,9 @@ "question__title": "Flatten Binary Tree to Linked List", "question__title_slug": "flatten-binary-tree-to-linked-list", "question__hide": false, - "total_acs": 269271, - "total_submitted": 369583, - "total_column_articles": 2167, + "total_acs": 272997, + "total_submitted": 374688, + "total_column_articles": 2196, "frontend_question_id": "114", "is_new_question": false }, @@ -53793,9 +54087,9 @@ "question__title": "Path Sum II", "question__title_slug": "path-sum-ii", "question__hide": false, - "total_acs": 264268, - "total_submitted": 418559, - "total_column_articles": 1813, + "total_acs": 268093, + "total_submitted": 424533, + "total_column_articles": 1836, "frontend_question_id": "113", "is_new_question": false }, @@ -53814,9 +54108,9 @@ "question__title": "Path Sum", "question__title_slug": "path-sum", "question__hide": false, - "total_acs": 403627, - "total_submitted": 756759, - "total_column_articles": 2439, + "total_acs": 409163, + "total_submitted": 766789, + "total_column_articles": 2466, "frontend_question_id": "112", "is_new_question": false }, @@ -53835,9 +54129,9 @@ "question__title": "Minimum Depth of Binary Tree", "question__title_slug": "minimum-depth-of-binary-tree", "question__hide": false, - "total_acs": 407468, - "total_submitted": 806032, - "total_column_articles": 2936, + "total_acs": 413206, + "total_submitted": 816334, + "total_column_articles": 2974, "frontend_question_id": "111", "is_new_question": false }, @@ -53856,9 +54150,9 @@ "question__title": "Balanced Binary Tree", "question__title_slug": "balanced-binary-tree", "question__hide": false, - "total_acs": 372627, - "total_submitted": 652508, - "total_column_articles": 2024, + "total_acs": 377688, + "total_submitted": 661060, + "total_column_articles": 2052, "frontend_question_id": "110", "is_new_question": false }, @@ -53877,9 +54171,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": 120980, - "total_submitted": 158577, - "total_column_articles": 947, + "total_acs": 122232, + "total_submitted": 160177, + "total_column_articles": 954, "frontend_question_id": "109", "is_new_question": false }, @@ -53898,9 +54192,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": 269558, - "total_submitted": 350546, - "total_column_articles": 1625, + "total_acs": 272866, + "total_submitted": 354643, + "total_column_articles": 1648, "frontend_question_id": "108", "is_new_question": false }, @@ -53919,9 +54213,9 @@ "question__title": "Binary Tree Level Order Traversal II", "question__title_slug": "binary-tree-level-order-traversal-ii", "question__hide": false, - "total_acs": 216832, - "total_submitted": 303416, - "total_column_articles": 1662, + "total_acs": 219140, + "total_submitted": 306439, + "total_column_articles": 1683, "frontend_question_id": "107", "is_new_question": false }, @@ -53940,9 +54234,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": 203646, - "total_submitted": 281155, - "total_column_articles": 1301, + "total_acs": 206691, + "total_submitted": 285328, + "total_column_articles": 1316, "frontend_question_id": "106", "is_new_question": false }, @@ -53961,9 +54255,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": 372657, - "total_submitted": 523972, - "total_column_articles": 2080, + "total_acs": 377884, + "total_submitted": 531119, + "total_column_articles": 2111, "frontend_question_id": "105", "is_new_question": false }, @@ -53982,9 +54276,9 @@ "question__title": "Maximum Depth of Binary Tree", "question__title_slug": "maximum-depth-of-binary-tree", "question__hide": false, - "total_acs": 756244, - "total_submitted": 981709, - "total_column_articles": 3739, + "total_acs": 766536, + "total_submitted": 994722, + "total_column_articles": 3779, "frontend_question_id": "104", "is_new_question": false }, @@ -54003,9 +54297,9 @@ "question__title": "Binary Tree Zigzag Level Order Traversal", "question__title_slug": "binary-tree-zigzag-level-order-traversal", "question__hide": false, - "total_acs": 243590, - "total_submitted": 425026, - "total_column_articles": 2092, + "total_acs": 246297, + "total_submitted": 429750, + "total_column_articles": 2113, "frontend_question_id": "103", "is_new_question": false }, @@ -54024,9 +54318,9 @@ "question__title": "Binary Tree Level Order Traversal", "question__title_slug": "binary-tree-level-order-traversal", "question__hide": false, - "total_acs": 595532, - "total_submitted": 918291, - "total_column_articles": 3541, + "total_acs": 604257, + "total_submitted": 931227, + "total_column_articles": 3576, "frontend_question_id": "102", "is_new_question": false }, @@ -54045,9 +54339,9 @@ "question__title": "Symmetric Tree", "question__title_slug": "symmetric-tree", "question__hide": false, - "total_acs": 615753, - "total_submitted": 1064641, - "total_column_articles": 3284, + "total_acs": 624114, + "total_submitted": 1077998, + "total_column_articles": 3325, "frontend_question_id": "101", "is_new_question": false }, @@ -54066,9 +54360,9 @@ "question__title": "Same Tree", "question__title_slug": "same-tree", "question__hide": false, - "total_acs": 351072, - "total_submitted": 587113, - "total_column_articles": 2536, + "total_acs": 355030, + "total_submitted": 593602, + "total_column_articles": 2557, "frontend_question_id": "100", "is_new_question": false }, @@ -54087,9 +54381,9 @@ "question__title": "Recover Binary Search Tree", "question__title_slug": "recover-binary-search-tree", "question__hide": false, - "total_acs": 105557, - "total_submitted": 174673, - "total_column_articles": 850, + "total_acs": 106850, + "total_submitted": 176898, + "total_column_articles": 864, "frontend_question_id": "99", "is_new_question": false }, @@ -54108,9 +54402,9 @@ "question__title": "Validate Binary Search Tree", "question__title_slug": "validate-binary-search-tree", "question__hide": false, - "total_acs": 529647, - "total_submitted": 1463369, - "total_column_articles": 2993, + "total_acs": 537117, + "total_submitted": 1482142, + "total_column_articles": 3023, "frontend_question_id": "98", "is_new_question": false }, @@ -54129,9 +54423,9 @@ "question__title": "Interleaving String", "question__title_slug": "interleaving-string", "question__hide": false, - "total_acs": 87923, - "total_submitted": 195049, - "total_column_articles": 710, + "total_acs": 89034, + "total_submitted": 197461, + "total_column_articles": 718, "frontend_question_id": "97", "is_new_question": false }, @@ -54150,9 +54444,9 @@ "question__title": "Unique Binary Search Trees", "question__title_slug": "unique-binary-search-trees", "question__hide": false, - "total_acs": 258864, - "total_submitted": 367728, - "total_column_articles": 1914, + "total_acs": 263052, + "total_submitted": 373463, + "total_column_articles": 1946, "frontend_question_id": "96", "is_new_question": false }, @@ -54171,9 +54465,9 @@ "question__title": "Unique Binary Search Trees II", "question__title_slug": "unique-binary-search-trees-ii", "question__hide": false, - "total_acs": 135588, - "total_submitted": 187606, - "total_column_articles": 847, + "total_acs": 136894, + "total_submitted": 189288, + "total_column_articles": 856, "frontend_question_id": "95", "is_new_question": false }, @@ -54192,9 +54486,9 @@ "question__title": "Binary Tree Inorder Traversal", "question__title_slug": "binary-tree-inorder-traversal", "question__hide": false, - "total_acs": 854217, - "total_submitted": 1125211, - "total_column_articles": 3339, + "total_acs": 865600, + "total_submitted": 1139606, + "total_column_articles": 3370, "frontend_question_id": "94", "is_new_question": false }, @@ -54213,9 +54507,9 @@ "question__title": "Restore IP Addresses", "question__title_slug": "restore-ip-addresses", "question__hide": false, - "total_acs": 236640, - "total_submitted": 418299, - "total_column_articles": 1895, + "total_acs": 240641, + "total_submitted": 424735, + "total_column_articles": 1927, "frontend_question_id": "93", "is_new_question": false }, @@ -54234,9 +54528,9 @@ "question__title": "Reverse Linked List II", "question__title_slug": "reverse-linked-list-ii", "question__hide": false, - "total_acs": 305449, - "total_submitted": 551491, - "total_column_articles": 2923, + "total_acs": 309403, + "total_submitted": 558332, + "total_column_articles": 2961, "frontend_question_id": "92", "is_new_question": false }, @@ -54255,9 +54549,9 @@ "question__title": "Decode Ways", "question__title_slug": "decode-ways", "question__hide": false, - "total_acs": 219972, - "total_submitted": 681220, - "total_column_articles": 1941, + "total_acs": 222024, + "total_submitted": 686687, + "total_column_articles": 1967, "frontend_question_id": "91", "is_new_question": false }, @@ -54276,9 +54570,9 @@ "question__title": "Subsets II", "question__title_slug": "subsets-ii", "question__hide": false, - "total_acs": 211854, - "total_submitted": 333296, - "total_column_articles": 1767, + "total_acs": 215273, + "total_submitted": 338558, + "total_column_articles": 1796, "frontend_question_id": "90", "is_new_question": false }, @@ -54297,9 +54591,9 @@ "question__title": "Gray Code", "question__title_slug": "gray-code", "question__hide": false, - "total_acs": 97430, - "total_submitted": 130341, - "total_column_articles": 795, + "total_acs": 98186, + "total_submitted": 131346, + "total_column_articles": 805, "frontend_question_id": "89", "is_new_question": false }, @@ -54318,9 +54612,9 @@ "question__title": "Merge Sorted Array", "question__title_slug": "merge-sorted-array", "question__hide": false, - "total_acs": 682086, - "total_submitted": 1302736, - "total_column_articles": 4593, + "total_acs": 690235, + "total_submitted": 1318076, + "total_column_articles": 4645, "frontend_question_id": "88", "is_new_question": false }, @@ -54339,9 +54633,9 @@ "question__title": "Scramble String", "question__title_slug": "scramble-string", "question__hide": false, - "total_acs": 48939, - "total_submitted": 102101, - "total_column_articles": 378, + "total_acs": 49276, + "total_submitted": 102860, + "total_column_articles": 382, "frontend_question_id": "87", "is_new_question": false }, @@ -54360,9 +54654,9 @@ "question__title": "Partition List", "question__title_slug": "partition-list", "question__hide": false, - "total_acs": 155863, - "total_submitted": 246209, - "total_column_articles": 1433, + "total_acs": 158330, + "total_submitted": 249873, + "total_column_articles": 1473, "frontend_question_id": "86", "is_new_question": false }, @@ -54381,9 +54675,9 @@ "question__title": "Maximal Rectangle", "question__title_slug": "maximal-rectangle", "question__hide": false, - "total_acs": 134192, - "total_submitted": 252023, - "total_column_articles": 968, + "total_acs": 135911, + "total_submitted": 254909, + "total_column_articles": 978, "frontend_question_id": "85", "is_new_question": false }, @@ -54402,9 +54696,9 @@ "question__title": "Largest Rectangle in Histogram", "question__title_slug": "largest-rectangle-in-histogram", "question__hide": false, - "total_acs": 258690, - "total_submitted": 583438, - "total_column_articles": 1571, + "total_acs": 262003, + "total_submitted": 590880, + "total_column_articles": 1586, "frontend_question_id": "84", "is_new_question": false }, @@ -54423,9 +54717,9 @@ "question__title": "Remove Duplicates from Sorted List", "question__title_slug": "remove-duplicates-from-sorted-list", "question__hide": false, - "total_acs": 443397, - "total_submitted": 827970, - "total_column_articles": 2772, + "total_acs": 448319, + "total_submitted": 837398, + "total_column_articles": 2817, "frontend_question_id": "83", "is_new_question": false }, @@ -54444,9 +54738,9 @@ "question__title": "Remove Duplicates from Sorted List II", "question__title_slug": "remove-duplicates-from-sorted-list-ii", "question__hide": false, - "total_acs": 265002, - "total_submitted": 496703, - "total_column_articles": 2289, + "total_acs": 268208, + "total_submitted": 502444, + "total_column_articles": 2322, "frontend_question_id": "82", "is_new_question": false }, @@ -54465,9 +54759,9 @@ "question__title": "Search in Rotated Sorted Array II", "question__title_slug": "search-in-rotated-sorted-array-ii", "question__hide": false, - "total_acs": 161827, - "total_submitted": 392040, - "total_column_articles": 1256, + "total_acs": 163486, + "total_submitted": 396189, + "total_column_articles": 1263, "frontend_question_id": "81", "is_new_question": false }, @@ -54486,9 +54780,9 @@ "question__title": "Remove Duplicates from Sorted Array II", "question__title_slug": "remove-duplicates-from-sorted-array-ii", "question__hide": false, - "total_acs": 185860, - "total_submitted": 299551, - "total_column_articles": 1607, + "total_acs": 187618, + "total_submitted": 302243, + "total_column_articles": 1625, "frontend_question_id": "80", "is_new_question": false }, @@ -54507,9 +54801,9 @@ "question__title": "Word Search", "question__title_slug": "word-search", "question__hide": false, - "total_acs": 327937, - "total_submitted": 707281, - "total_column_articles": 2023, + "total_acs": 332437, + "total_submitted": 716890, + "total_column_articles": 2045, "frontend_question_id": "79", "is_new_question": false }, @@ -54528,9 +54822,9 @@ "question__title": "Subsets", "question__title_slug": "subsets", "question__hide": false, - "total_acs": 464629, - "total_submitted": 576505, - "total_column_articles": 3378, + "total_acs": 471123, + "total_submitted": 584441, + "total_column_articles": 3414, "frontend_question_id": "78", "is_new_question": false }, @@ -54549,9 +54843,9 @@ "question__title": "Combinations", "question__title_slug": "combinations", "question__hide": false, - "total_acs": 368663, - "total_submitted": 478029, - "total_column_articles": 2163, + "total_acs": 374803, + "total_submitted": 485894, + "total_column_articles": 2189, "frontend_question_id": "77", "is_new_question": false }, @@ -54570,9 +54864,9 @@ "question__title": "Minimum Window Substring", "question__title_slug": "minimum-window-substring", "question__hide": false, - "total_acs": 299979, - "total_submitted": 676992, - "total_column_articles": 2434, + "total_acs": 305312, + "total_submitted": 688000, + "total_column_articles": 2476, "frontend_question_id": "76", "is_new_question": false }, @@ -54591,9 +54885,9 @@ "question__title": "Sort Colors", "question__title_slug": "sort-colors", "question__hide": false, - "total_acs": 397788, - "total_submitted": 661840, - "total_column_articles": 2733, + "total_acs": 403632, + "total_submitted": 671331, + "total_column_articles": 2769, "frontend_question_id": "75", "is_new_question": false }, @@ -54612,9 +54906,9 @@ "question__title": "Search a 2D Matrix", "question__title_slug": "search-a-2d-matrix", "question__hide": false, - "total_acs": 242637, - "total_submitted": 509462, - "total_column_articles": 2414, + "total_acs": 245689, + "total_submitted": 515194, + "total_column_articles": 2433, "frontend_question_id": "74", "is_new_question": false }, @@ -54633,9 +54927,9 @@ "question__title": "Set Matrix Zeroes", "question__title_slug": "set-matrix-zeroes", "question__hide": false, - "total_acs": 192266, - "total_submitted": 310147, - "total_column_articles": 1441, + "total_acs": 194448, + "total_submitted": 313350, + "total_column_articles": 1456, "frontend_question_id": "73", "is_new_question": false }, @@ -54654,9 +54948,9 @@ "question__title": "Edit Distance", "question__title_slug": "edit-distance", "question__hide": false, - "total_acs": 266845, - "total_submitted": 427923, - "total_column_articles": 2298, + "total_acs": 270860, + "total_submitted": 433976, + "total_column_articles": 2319, "frontend_question_id": "72", "is_new_question": false }, @@ -54675,9 +54969,9 @@ "question__title": "Simplify Path", "question__title_slug": "simplify-path", "question__hide": false, - "total_acs": 150479, - "total_submitted": 340121, - "total_column_articles": 1428, + "total_acs": 151826, + "total_submitted": 343156, + "total_column_articles": 1436, "frontend_question_id": "71", "is_new_question": false }, @@ -54696,9 +54990,9 @@ "question__title": "Climbing Stairs", "question__title_slug": "climbing-stairs", "question__hide": false, - "total_acs": 858553, - "total_submitted": 1597266, - "total_column_articles": 4978, + "total_acs": 869248, + "total_submitted": 1616353, + "total_column_articles": 5018, "frontend_question_id": "70", "is_new_question": false }, @@ -54717,9 +55011,9 @@ "question__title": "Sqrt(x)", "question__title_slug": "sqrtx", "question__hide": false, - "total_acs": 557308, - "total_submitted": 1435452, - "total_column_articles": 2783, + "total_acs": 564414, + "total_submitted": 1454345, + "total_column_articles": 2806, "frontend_question_id": "69", "is_new_question": false }, @@ -54738,9 +55032,9 @@ "question__title": "Text Justification", "question__title_slug": "text-justification", "question__hide": false, - "total_acs": 45260, - "total_submitted": 86798, - "total_column_articles": 678, + "total_acs": 45574, + "total_submitted": 87407, + "total_column_articles": 680, "frontend_question_id": "68", "is_new_question": false }, @@ -54759,9 +55053,9 @@ "question__title": "Add Binary", "question__title_slug": "add-binary", "question__hide": false, - "total_acs": 254125, - "total_submitted": 471934, - "total_column_articles": 2305, + "total_acs": 256579, + "total_submitted": 476723, + "total_column_articles": 2329, "frontend_question_id": "67", "is_new_question": false }, @@ -54780,9 +55074,9 @@ "question__title": "Plus One", "question__title_slug": "plus-one", "question__hide": false, - "total_acs": 501836, - "total_submitted": 1093683, - "total_column_articles": 4499, + "total_acs": 506613, + "total_submitted": 1104596, + "total_column_articles": 4545, "frontend_question_id": "66", "is_new_question": false }, @@ -54801,9 +55095,9 @@ "question__title": "Valid Number", "question__title_slug": "valid-number", "question__hide": false, - "total_acs": 55629, - "total_submitted": 202748, - "total_column_articles": 792, + "total_acs": 55992, + "total_submitted": 204084, + "total_column_articles": 801, "frontend_question_id": "65", "is_new_question": false }, @@ -54822,9 +55116,9 @@ "question__title": "Minimum Path Sum", "question__title_slug": "minimum-path-sum", "question__hide": false, - "total_acs": 377495, - "total_submitted": 545228, - "total_column_articles": 2771, + "total_acs": 381871, + "total_submitted": 551453, + "total_column_articles": 2790, "frontend_question_id": "64", "is_new_question": false }, @@ -54843,9 +55137,9 @@ "question__title": "Unique Paths II", "question__title_slug": "unique-paths-ii", "question__hide": false, - "total_acs": 268109, - "total_submitted": 664284, - "total_column_articles": 2365, + "total_acs": 271825, + "total_submitted": 672471, + "total_column_articles": 2385, "frontend_question_id": "63", "is_new_question": false }, @@ -54864,9 +55158,9 @@ "question__title": "Unique Paths", "question__title_slug": "unique-paths", "question__hide": false, - "total_acs": 455924, - "total_submitted": 679088, - "total_column_articles": 3320, + "total_acs": 461874, + "total_submitted": 687476, + "total_column_articles": 3342, "frontend_question_id": "62", "is_new_question": false }, @@ -54885,9 +55179,9 @@ "question__title": "Rotate List", "question__title_slug": "rotate-list", "question__hide": false, - "total_acs": 255816, - "total_submitted": 614008, - "total_column_articles": 2547, + "total_acs": 258465, + "total_submitted": 620308, + "total_column_articles": 2568, "frontend_question_id": "61", "is_new_question": false }, @@ -54906,9 +55200,9 @@ "question__title": "Permutation Sequence", "question__title_slug": "permutation-sequence", "question__hide": false, - "total_acs": 108846, - "total_submitted": 205140, - "total_column_articles": 1207, + "total_acs": 109614, + "total_submitted": 206427, + "total_column_articles": 1210, "frontend_question_id": "60", "is_new_question": false }, @@ -54927,9 +55221,9 @@ "question__title": "Spiral Matrix II", "question__title_slug": "spiral-matrix-ii", "question__hide": false, - "total_acs": 207049, - "total_submitted": 271704, - "total_column_articles": 2488, + "total_acs": 210699, + "total_submitted": 276759, + "total_column_articles": 2522, "frontend_question_id": "59", "is_new_question": false }, @@ -54948,9 +55242,9 @@ "question__title": "Length of Last Word", "question__title_slug": "length-of-last-word", "question__hide": false, - "total_acs": 329868, - "total_submitted": 815257, - "total_column_articles": 3494, + "total_acs": 333221, + "total_submitted": 821504, + "total_column_articles": 3535, "frontend_question_id": "58", "is_new_question": false }, @@ -54969,9 +55263,9 @@ "question__title": "Insert Interval", "question__title_slug": "insert-interval", "question__hide": false, - "total_acs": 113386, - "total_submitted": 272883, - "total_column_articles": 1166, + "total_acs": 114743, + "total_submitted": 275878, + "total_column_articles": 1175, "frontend_question_id": "57", "is_new_question": false }, @@ -54990,9 +55284,9 @@ "question__title": "Merge Intervals", "question__title_slug": "merge-intervals", "question__hide": false, - "total_acs": 465451, - "total_submitted": 955425, - "total_column_articles": 3291, + "total_acs": 472261, + "total_submitted": 968428, + "total_column_articles": 3332, "frontend_question_id": "56", "is_new_question": false }, @@ -55011,9 +55305,9 @@ "question__title": "Jump Game", "question__title_slug": "jump-game", "question__hide": false, - "total_acs": 518215, - "total_submitted": 1189919, - "total_column_articles": 3769, + "total_acs": 525896, + "total_submitted": 1206907, + "total_column_articles": 3814, "frontend_question_id": "55", "is_new_question": false }, @@ -55032,9 +55326,9 @@ "question__title": "Spiral Matrix", "question__title_slug": "spiral-matrix", "question__hide": false, - "total_acs": 272413, - "total_submitted": 557775, - "total_column_articles": 2938, + "total_acs": 276418, + "total_submitted": 565416, + "total_column_articles": 2980, "frontend_question_id": "54", "is_new_question": false }, @@ -55053,9 +55347,9 @@ "question__title": "Maximum Subarray", "question__title_slug": "maximum-subarray", "question__hide": false, - "total_acs": 1069835, - "total_submitted": 1951320, - "total_column_articles": 5466, + "total_acs": 1084874, + "total_submitted": 1979349, + "total_column_articles": 5515, "frontend_question_id": "53", "is_new_question": false }, @@ -55074,9 +55368,9 @@ "question__title": "N-Queens II", "question__title_slug": "n-queens-ii", "question__hide": false, - "total_acs": 95284, - "total_submitted": 115837, - "total_column_articles": 769, + "total_acs": 96249, + "total_submitted": 117007, + "total_column_articles": 775, "frontend_question_id": "52", "is_new_question": false }, @@ -55095,9 +55389,9 @@ "question__title": "N-Queens", "question__title_slug": "n-queens", "question__hide": false, - "total_acs": 224663, - "total_submitted": 303542, - "total_column_articles": 2325, + "total_acs": 227874, + "total_submitted": 307826, + "total_column_articles": 2365, "frontend_question_id": "51", "is_new_question": false }, @@ -55116,9 +55410,9 @@ "question__title": "Pow(x, n)", "question__title_slug": "powx-n", "question__hide": false, - "total_acs": 296595, - "total_submitted": 783418, - "total_column_articles": 1757, + "total_acs": 299529, + "total_submitted": 790672, + "total_column_articles": 1767, "frontend_question_id": "50", "is_new_question": false }, @@ -55137,9 +55431,9 @@ "question__title": "Group Anagrams", "question__title_slug": "group-anagrams", "question__hide": false, - "total_acs": 340106, - "total_submitted": 504921, - "total_column_articles": 1933, + "total_acs": 345044, + "total_submitted": 511863, + "total_column_articles": 1951, "frontend_question_id": "49", "is_new_question": false }, @@ -55158,9 +55452,9 @@ "question__title": "Rotate Image", "question__title_slug": "rotate-image", "question__hide": false, - "total_acs": 336008, - "total_submitted": 452570, - "total_column_articles": 3288, + "total_acs": 340938, + "total_submitted": 459321, + "total_column_articles": 3344, "frontend_question_id": "48", "is_new_question": false }, @@ -55179,9 +55473,9 @@ "question__title": "Permutations II", "question__title_slug": "permutations-ii", "question__hide": false, - "total_acs": 332420, - "total_submitted": 512700, - "total_column_articles": 2215, + "total_acs": 337414, + "total_submitted": 520113, + "total_column_articles": 2250, "frontend_question_id": "47", "is_new_question": false }, @@ -55200,9 +55494,9 @@ "question__title": "Permutations", "question__title_slug": "permutations", "question__hide": false, - "total_acs": 642277, - "total_submitted": 817301, - "total_column_articles": 4489, + "total_acs": 651135, + "total_submitted": 828242, + "total_column_articles": 4556, "frontend_question_id": "46", "is_new_question": false }, @@ -55221,9 +55515,9 @@ "question__title": "Jump Game II", "question__title_slug": "jump-game-ii", "question__hide": false, - "total_acs": 348013, - "total_submitted": 777694, - "total_column_articles": 2520, + "total_acs": 353823, + "total_submitted": 789584, + "total_column_articles": 2563, "frontend_question_id": "45", "is_new_question": false }, @@ -55242,9 +55536,9 @@ "question__title": "Wildcard Matching", "question__title_slug": "wildcard-matching", "question__hide": false, - "total_acs": 109758, - "total_submitted": 328803, - "total_column_articles": 721, + "total_acs": 110948, + "total_submitted": 331901, + "total_column_articles": 727, "frontend_question_id": "44", "is_new_question": false }, @@ -55263,9 +55557,9 @@ "question__title": "Multiply Strings", "question__title_slug": "multiply-strings", "question__hide": false, - "total_acs": 232436, - "total_submitted": 518651, - "total_column_articles": 1563, + "total_acs": 235497, + "total_submitted": 525348, + "total_column_articles": 1585, "frontend_question_id": "43", "is_new_question": false }, @@ -55284,9 +55578,9 @@ "question__title": "Trapping Rain Water", "question__title_slug": "trapping-rain-water", "question__hide": false, - "total_acs": 503894, - "total_submitted": 823029, - "total_column_articles": 3376, + "total_acs": 511335, + "total_submitted": 834037, + "total_column_articles": 3403, "frontend_question_id": "42", "is_new_question": false }, @@ -55305,9 +55599,9 @@ "question__title": "First Missing Positive", "question__title_slug": "first-missing-positive", "question__hide": false, - "total_acs": 230983, - "total_submitted": 541154, - "total_column_articles": 1808, + "total_acs": 233620, + "total_submitted": 546990, + "total_column_articles": 1822, "frontend_question_id": "41", "is_new_question": false }, @@ -55326,9 +55620,9 @@ "question__title": "Combination Sum II", "question__title_slug": "combination-sum-ii", "question__hide": false, - "total_acs": 306467, - "total_submitted": 505039, - "total_column_articles": 2068, + "total_acs": 311310, + "total_submitted": 513332, + "total_column_articles": 2096, "frontend_question_id": "40", "is_new_question": false }, @@ -55347,9 +55641,9 @@ "question__title": "Combination Sum", "question__title_slug": "combination-sum", "question__hide": false, - "total_acs": 528059, - "total_submitted": 725681, - "total_column_articles": 2982, + "total_acs": 536553, + "total_submitted": 737634, + "total_column_articles": 3035, "frontend_question_id": "39", "is_new_question": false }, @@ -55368,9 +55662,9 @@ "question__title": "Count and Say", "question__title_slug": "count-and-say", "question__hide": false, - "total_acs": 289426, - "total_submitted": 481986, - "total_column_articles": 2905, + "total_acs": 291533, + "total_submitted": 485300, + "total_column_articles": 2928, "frontend_question_id": "38", "is_new_question": false }, @@ -55389,9 +55683,9 @@ "question__title": "Sudoku Solver", "question__title_slug": "sudoku-solver", "question__hide": false, - "total_acs": 150524, - "total_submitted": 222811, - "total_column_articles": 1218, + "total_acs": 152802, + "total_submitted": 226174, + "total_column_articles": 1229, "frontend_question_id": "37", "is_new_question": false }, @@ -55410,9 +55704,9 @@ "question__title": "Valid Sudoku", "question__title_slug": "valid-sudoku", "question__hide": false, - "total_acs": 290427, - "total_submitted": 457294, - "total_column_articles": 2057, + "total_acs": 293911, + "total_submitted": 462973, + "total_column_articles": 2080, "frontend_question_id": "36", "is_new_question": false }, @@ -55431,9 +55725,9 @@ "question__title": "Search Insert Position", "question__title_slug": "search-insert-position", "question__hide": false, - "total_acs": 833957, - "total_submitted": 1842536, - "total_column_articles": 5782, + "total_acs": 846209, + "total_submitted": 1870246, + "total_column_articles": 5837, "frontend_question_id": "35", "is_new_question": false }, @@ -55452,9 +55746,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": 564784, - "total_submitted": 1336106, - "total_column_articles": 5418, + "total_acs": 574093, + "total_submitted": 1357468, + "total_column_articles": 5513, "frontend_question_id": "34", "is_new_question": false }, @@ -55473,9 +55767,9 @@ "question__title": "Search in Rotated Sorted Array", "question__title_slug": "search-in-rotated-sorted-array", "question__hide": false, - "total_acs": 556897, - "total_submitted": 1275352, - "total_column_articles": 3644, + "total_acs": 564396, + "total_submitted": 1292004, + "total_column_articles": 3690, "frontend_question_id": "33", "is_new_question": false }, @@ -55494,9 +55788,9 @@ "question__title": "Longest Valid Parentheses", "question__title_slug": "longest-valid-parentheses", "question__hide": false, - "total_acs": 279062, - "total_submitted": 762738, - "total_column_articles": 1797, + "total_acs": 282982, + "total_submitted": 772399, + "total_column_articles": 1818, "frontend_question_id": "32", "is_new_question": false }, @@ -55515,9 +55809,9 @@ "question__title": "Next Permutation", "question__title_slug": "next-permutation", "question__hide": false, - "total_acs": 319787, - "total_submitted": 848889, - "total_column_articles": 2505, + "total_acs": 324511, + "total_submitted": 860689, + "total_column_articles": 2539, "frontend_question_id": "31", "is_new_question": false }, @@ -55536,9 +55830,9 @@ "question__title": "Substring with Concatenation of All Words", "question__title_slug": "substring-with-concatenation-of-all-words", "question__hide": false, - "total_acs": 111120, - "total_submitted": 298748, - "total_column_articles": 890, + "total_acs": 129438, + "total_submitted": 330535, + "total_column_articles": 1051, "frontend_question_id": "30", "is_new_question": false }, @@ -55557,9 +55851,9 @@ "question__title": "Divide Two Integers", "question__title_slug": "divide-two-integers", "question__hide": false, - "total_acs": 169465, - "total_submitted": 763920, - "total_column_articles": 1322, + "total_acs": 171198, + "total_submitted": 771029, + "total_column_articles": 1328, "frontend_question_id": "29", "is_new_question": false }, @@ -55578,9 +55872,9 @@ "question__title": "Implement strStr()", "question__title_slug": "implement-strstr", "question__hide": false, - "total_acs": 665527, - "total_submitted": 1631691, - "total_column_articles": 4543, + "total_acs": 673286, + "total_submitted": 1647493, + "total_column_articles": 4598, "frontend_question_id": "28", "is_new_question": false }, @@ -55599,9 +55893,9 @@ "question__title": "Remove Element", "question__title_slug": "remove-element", "question__hide": false, - "total_acs": 729325, - "total_submitted": 1226520, - "total_column_articles": 5768, + "total_acs": 740349, + "total_submitted": 1244779, + "total_column_articles": 5827, "frontend_question_id": "27", "is_new_question": false }, @@ -55620,9 +55914,9 @@ "question__title": "Remove Duplicates from Sorted Array", "question__title_slug": "remove-duplicates-from-sorted-array", "question__hide": false, - "total_acs": 1143609, - "total_submitted": 2111583, - "total_column_articles": 6280, + "total_acs": 1156673, + "total_submitted": 2134584, + "total_column_articles": 6363, "frontend_question_id": "26", "is_new_question": false }, @@ -55641,9 +55935,9 @@ "question__title": "Reverse Nodes in k-Group", "question__title_slug": "reverse-nodes-in-k-group", "question__hide": false, - "total_acs": 355226, - "total_submitted": 525976, - "total_column_articles": 3058, + "total_acs": 359689, + "total_submitted": 532470, + "total_column_articles": 3111, "frontend_question_id": "25", "is_new_question": false }, @@ -55662,9 +55956,9 @@ "question__title": "Swap Nodes in Pairs", "question__title_slug": "swap-nodes-in-pairs", "question__hide": false, - "total_acs": 459779, - "total_submitted": 648008, - "total_column_articles": 3480, + "total_acs": 466026, + "total_submitted": 656507, + "total_column_articles": 3518, "frontend_question_id": "24", "is_new_question": false }, @@ -55683,9 +55977,9 @@ "question__title": "Merge k Sorted Lists", "question__title_slug": "merge-k-sorted-lists", "question__hide": false, - "total_acs": 484547, - "total_submitted": 850437, - "total_column_articles": 3249, + "total_acs": 491161, + "total_submitted": 861594, + "total_column_articles": 3298, "frontend_question_id": "23", "is_new_question": false }, @@ -55704,9 +55998,9 @@ "question__title": "Generate Parentheses", "question__title_slug": "generate-parentheses", "question__hide": false, - "total_acs": 526865, - "total_submitted": 680102, - "total_column_articles": 3752, + "total_acs": 534122, + "total_submitted": 689415, + "total_column_articles": 3794, "frontend_question_id": "22", "is_new_question": false }, @@ -55725,9 +56019,9 @@ "question__title": "Merge Two Sorted Lists", "question__title_slug": "merge-two-sorted-lists", "question__hide": false, - "total_acs": 1044965, - "total_submitted": 1566820, - "total_column_articles": 5443, + "total_acs": 1058454, + "total_submitted": 1586593, + "total_column_articles": 5527, "frontend_question_id": "21", "is_new_question": false }, @@ -55746,9 +56040,9 @@ "question__title": "Valid Parentheses", "question__title_slug": "valid-parentheses", "question__hide": false, - "total_acs": 1123194, - "total_submitted": 2518047, - "total_column_articles": 7616, + "total_acs": 1136699, + "total_submitted": 2547549, + "total_column_articles": 7690, "frontend_question_id": "20", "is_new_question": false }, @@ -55767,9 +56061,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": 818737, - "total_submitted": 1852937, - "total_column_articles": 5992, + "total_acs": 830514, + "total_submitted": 1877474, + "total_column_articles": 6085, "frontend_question_id": "19", "is_new_question": false }, @@ -55788,9 +56082,9 @@ "question__title": "4Sum", "question__title_slug": "4sum", "question__hide": false, - "total_acs": 330031, - "total_submitted": 839826, - "total_column_articles": 2198, + "total_acs": 334416, + "total_submitted": 855915, + "total_column_articles": 2227, "frontend_question_id": "18", "is_new_question": false }, @@ -55809,9 +56103,9 @@ "question__title": "Letter Combinations of a Phone Number", "question__title_slug": "letter-combinations-of-a-phone-number", "question__hide": false, - "total_acs": 505841, - "total_submitted": 874732, - "total_column_articles": 4361, + "total_acs": 513174, + "total_submitted": 887559, + "total_column_articles": 4418, "frontend_question_id": "17", "is_new_question": false }, @@ -55830,9 +56124,9 @@ "question__title": "3Sum Closest", "question__title_slug": "3sum-closest", "question__hide": false, - "total_acs": 363034, - "total_submitted": 796358, - "total_column_articles": 1987, + "total_acs": 368607, + "total_submitted": 808581, + "total_column_articles": 2005, "frontend_question_id": "16", "is_new_question": false }, @@ -55851,9 +56145,9 @@ "question__title": "3Sum", "question__title_slug": "3sum", "question__hide": false, - "total_acs": 1008634, - "total_submitted": 2829148, - "total_column_articles": 4566, + "total_acs": 1022991, + "total_submitted": 2864818, + "total_column_articles": 4617, "frontend_question_id": "15", "is_new_question": false }, @@ -55872,9 +56166,9 @@ "question__title": "Longest Common Prefix", "question__title_slug": "longest-common-prefix", "question__hide": false, - "total_acs": 855783, - "total_submitted": 2013105, - "total_column_articles": 5291, + "total_acs": 864938, + "total_submitted": 2031654, + "total_column_articles": 5337, "frontend_question_id": "14", "is_new_question": false }, @@ -55893,9 +56187,9 @@ "question__title": "Roman to Integer", "question__title_slug": "roman-to-integer", "question__hide": false, - "total_acs": 649497, - "total_submitted": 1039114, - "total_column_articles": 5273, + "total_acs": 656089, + "total_submitted": 1049827, + "total_column_articles": 5318, "frontend_question_id": "13", "is_new_question": false }, @@ -55914,9 +56208,9 @@ "question__title": "Integer to Roman", "question__title_slug": "integer-to-roman", "question__hide": false, - "total_acs": 303042, - "total_submitted": 457582, - "total_column_articles": 2356, + "total_acs": 306203, + "total_submitted": 462465, + "total_column_articles": 2385, "frontend_question_id": "12", "is_new_question": false }, @@ -55935,9 +56229,9 @@ "question__title": "Container With Most Water", "question__title_slug": "container-with-most-water", "question__hide": false, - "total_acs": 753204, - "total_submitted": 1228595, - "total_column_articles": 4262, + "total_acs": 762411, + "total_submitted": 1244323, + "total_column_articles": 4310, "frontend_question_id": "11", "is_new_question": false }, @@ -55956,9 +56250,9 @@ "question__title": "Regular Expression Matching", "question__title_slug": "regular-expression-matching", "question__hide": false, - "total_acs": 285647, - "total_submitted": 901968, - "total_column_articles": 1702, + "total_acs": 289010, + "total_submitted": 912549, + "total_column_articles": 1716, "frontend_question_id": "10", "is_new_question": false }, @@ -55977,9 +56271,9 @@ "question__title": "Palindrome Number", "question__title_slug": "palindrome-number", "question__hide": false, - "total_acs": 1061375, - "total_submitted": 1854880, - "total_column_articles": 6614, + "total_acs": 1072492, + "total_submitted": 1875296, + "total_column_articles": 6677, "frontend_question_id": "9", "is_new_question": false }, @@ -55998,9 +56292,9 @@ "question__title": "String to Integer (atoi)", "question__title_slug": "string-to-integer-atoi", "question__hide": false, - "total_acs": 463767, - "total_submitted": 2145166, - "total_column_articles": 3492, + "total_acs": 468108, + "total_submitted": 2166343, + "total_column_articles": 3528, "frontend_question_id": "8", "is_new_question": false }, @@ -56019,9 +56313,9 @@ "question__title": "Reverse Integer", "question__title_slug": "reverse-integer", "question__hide": false, - "total_acs": 1032351, - "total_submitted": 2923522, - "total_column_articles": 6345, + "total_acs": 1038790, + "total_submitted": 2940508, + "total_column_articles": 6378, "frontend_question_id": "7", "is_new_question": false }, @@ -56040,9 +56334,9 @@ "question__title": "ZigZag Conversion", "question__title_slug": "zigzag-conversion", "question__hide": false, - "total_acs": 445767, - "total_submitted": 857988, - "total_column_articles": 3700, + "total_acs": 450611, + "total_submitted": 866903, + "total_column_articles": 3733, "frontend_question_id": "6", "is_new_question": false }, @@ -56061,9 +56355,9 @@ "question__title": "Longest Palindromic Substring", "question__title_slug": "longest-palindromic-substring", "question__hide": false, - "total_acs": 1071979, - "total_submitted": 2914883, - "total_column_articles": 5814, + "total_acs": 1086474, + "total_submitted": 2951015, + "total_column_articles": 5896, "frontend_question_id": "5", "is_new_question": false }, @@ -56082,9 +56376,9 @@ "question__title": "Median of Two Sorted Arrays", "question__title_slug": "median-of-two-sorted-arrays", "question__hide": false, - "total_acs": 733264, - "total_submitted": 1769585, - "total_column_articles": 5383, + "total_acs": 741756, + "total_submitted": 1789366, + "total_column_articles": 5441, "frontend_question_id": "4", "is_new_question": false }, @@ -56103,9 +56397,9 @@ "question__title": "Longest Substring Without Repeating Characters", "question__title_slug": "longest-substring-without-repeating-characters", "question__hide": false, - "total_acs": 1796621, - "total_submitted": 4626369, - "total_column_articles": 10763, + "total_acs": 1818462, + "total_submitted": 4680332, + "total_column_articles": 10873, "frontend_question_id": "3", "is_new_question": false }, @@ -56124,9 +56418,9 @@ "question__title": "Add Two Numbers", "question__title_slug": "add-two-numbers", "question__hide": false, - "total_acs": 1375516, - "total_submitted": 3286864, - "total_column_articles": 9774, + "total_acs": 1390141, + "total_submitted": 3318582, + "total_column_articles": 9882, "frontend_question_id": "2", "is_new_question": false }, @@ -56145,9 +56439,9 @@ "question__title": "Two Sum", "question__title_slug": "two-sum", "question__hide": false, - "total_acs": 3489371, - "total_submitted": 6633732, - "total_column_articles": 18038, + "total_acs": 3527479, + "total_submitted": 6703238, + "total_column_articles": 18177, "frontend_question_id": "1", "is_new_question": false }, diff --git a/leetcode-cn/originData/[no content]jump-game-viii.json b/leetcode-cn/originData/[no content]jump-game-viii.json new file mode 100644 index 00000000..b85446ea --- /dev/null +++ b/leetcode-cn/originData/[no content]jump-game-viii.json @@ -0,0 +1,87 @@ +{ + "data": { + "question": { + "questionId": "2056", + "questionFrontendId": "2297", + "categoryTitle": "Algorithms", + "boundTopicId": 1543154, + "title": "Jump Game VIII", + "titleSlug": "jump-game-viii", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 2, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [ + { + "name": "Stack", + "slug": "stack", + "translatedName": "栈", + "__typename": "TopicTagNode" + }, + { + "name": "Graph", + "slug": "graph", + "translatedName": "图", + "__typename": "TopicTagNode" + }, + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": "动态规划", + "__typename": "TopicTagNode" + }, + { + "name": "Shortest Path", + "slug": "shortest-path", + "translatedName": "最短路", + "__typename": "TopicTagNode" + }, + { + "name": "Monotonic Stack", + "slug": "monotonic-stack", + "translatedName": "单调栈", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"66\", \"totalSubmission\": \"98\", \"totalAcceptedRaw\": 66, \"totalSubmissionRaw\": 98, \"acRate\": \"67.3%\"}", + "hints": [ + "For each index, find the indexes that you can jump to.", + "We can do this by using a monotonic stack and iterating through the array backwards.", + "Create another integer array of length n called dp where dp[i] is the minimum cost of getting to index i." + ], + "solution": null, + "status": null, + "sampleTestCase": "[3,2,4,4,1]\n[3,7,6,4,2]", + "metaData": "{\n \"name\": \"minCost\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"costs\"\n }\n ],\n \"return\": {\n \"type\": \"long\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

\\u7248\\u672c\\uff1aclang 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 17\\u6807\\u51c6\\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 17<\\/code>\\u3002\\u53ef\\u4ee5\\u4f7f\\u7528Java 8\\u7684\\u7279\\u6027\\u4f8b\\u5982\\uff0clambda expressions \\u548c stream API\\u3002<\\/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 8.2<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n

\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O1<\\/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# 10<\\/a> \\u8fd0\\u884c\\u5728 .NET 6 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"

\\u7248\\u672c\\uff1aNode.js 16.13.2<\\/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<\\/a> \\u548c datastructures-js\\/queue<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/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.5.2<\\/code><\\/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.17<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/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 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

TypeScript 4.5.4<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2020<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/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 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[3,2,4,4,1]\n[3,7,6,4,2]\n[0,1,2]\n[1,1,1]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/[no content]minimum-flips-in-binary-tree-to-get-result.json b/leetcode-cn/originData/[no content]minimum-flips-in-binary-tree-to-get-result.json new file mode 100644 index 00000000..bb33437a --- /dev/null +++ b/leetcode-cn/originData/[no content]minimum-flips-in-binary-tree-to-get-result.json @@ -0,0 +1,75 @@ +{ + "data": { + "question": { + "questionId": "2399", + "questionFrontendId": "2313", + "categoryTitle": "Algorithms", + "boundTopicId": 1618963, + "title": "Minimum Flips in Binary Tree to Get Result", + "titleSlug": "minimum-flips-in-binary-tree-to-get-result", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Hard", + "likes": 1, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [ + { + "name": "Tree", + "slug": "tree", + "translatedName": "树", + "__typename": "TopicTagNode" + }, + { + "name": "Depth-First Search", + "slug": "depth-first-search", + "translatedName": "深度优先搜索", + "__typename": "TopicTagNode" + }, + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": "动态规划", + "__typename": "TopicTagNode" + }, + { + "name": "Binary Tree", + "slug": "binary-tree", + "translatedName": "二叉树", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"21\", \"totalSubmission\": \"31\", \"totalAcceptedRaw\": 21, \"totalSubmissionRaw\": 31, \"acRate\": \"67.7%\"}", + "hints": [ + "Try using tree DP to solve this problem.", + "Find the minimum operations to change each subtree to true and to false separately.", + "For nodes representing boolean operations, find the minimum operations by trying all combinations of values to which the child nodes can evaluate." + ], + "solution": null, + "status": null, + "sampleTestCase": "[3,5,4,2,null,1,1,1,0]\ntrue", + "metaData": "{\n \"name\": \"minimumFlips\",\n \"params\": [\n {\n \"name\": \"root\",\n \"type\": \"TreeNode\"\n },\n {\n \"type\": \"boolean\",\n \"name\": \"result\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

\\u7248\\u672c\\uff1aclang 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 17\\u6807\\u51c6\\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 17<\\/code>\\u3002\\u53ef\\u4ee5\\u4f7f\\u7528Java 8\\u7684\\u7279\\u6027\\u4f8b\\u5982\\uff0clambda expressions \\u548c stream API\\u3002<\\/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 8.2<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n

\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O1<\\/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# 10<\\/a> \\u8fd0\\u884c\\u5728 .NET 6 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"

\\u7248\\u672c\\uff1aNode.js 16.13.2<\\/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<\\/a> \\u548c datastructures-js\\/queue<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/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.5.2<\\/code><\\/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.17<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/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 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

TypeScript 4.5.4<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2020<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/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 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[3,5,4,2,null,1,1,1,0]\ntrue\n[0]\nfalse", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/[no content]the-first-day-of-the-maximum-recorded-degree-in-each-city.json b/leetcode-cn/originData/[no content]the-first-day-of-the-maximum-recorded-degree-in-each-city.json new file mode 100644 index 00000000..e4d4ddf6 --- /dev/null +++ b/leetcode-cn/originData/[no content]the-first-day-of-the-maximum-recorded-degree-in-each-city.json @@ -0,0 +1,63 @@ +{ + "data": { + "question": { + "questionId": "2446", + "questionFrontendId": "2314", + "categoryTitle": "Database", + "boundTopicId": 1620675, + "title": "The First Day of the Maximum Recorded Degree in Each City", + "titleSlug": "the-first-day-of-the-maximum-recorded-degree-in-each-city", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 1, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[]", + "contributors": [], + "langToValidPlayground": null, + "topicTags": [ + { + "name": "Database", + "slug": "database", + "translatedName": "数据库", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"61\", \"totalSubmission\": \"82\", \"totalAcceptedRaw\": 61, \"totalSubmissionRaw\": 82, \"acRate\": \"74.4%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\": {\"Weather\": [\"city_id\", \"day\", \"degree\"]}, \"rows\": {\"Weather\": [[1, \"2022-01-07\", -12], [1, \"2022-03-07\", 5], [1, \"2022-07-07\", 24], [2, \"2022-08-07\", 37], [2, \"2022-08-17\", 37], [3, \"2022-02-07\", -7], [3, \"2022-12-07\", -6]]}}", + "metaData": "{\n \"mysql\": [\n \"Create table If Not Exists Weather (city_id int, day date, degree int)\"\n ],\n \"mssql\": [\n \"Create table Weather (city_id int, day date, degree int)\"\n ],\n \"oraclesql\": [\n \"Create table Weather (city_id int, day date, degree int)\",\n \"ALTER SESSION SET nls_date_format='YYYY-MM-DD'\"\n ],\n \"database\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "Create table If Not Exists Weather (city_id int, day date, degree int)", + "Truncate table Weather", + "insert into Weather (city_id, day, degree) values ('1', '2022-01-07', '-12')", + "insert into Weather (city_id, day, degree) values ('1', '2022-03-07', '5')", + "insert into Weather (city_id, day, degree) values ('1', '2022-07-07', '24')", + "insert into Weather (city_id, day, degree) values ('2', '2022-08-07', '37')", + "insert into Weather (city_id, day, degree) values ('2', '2022-08-17', '37')", + "insert into Weather (city_id, day, degree) values ('3', '2022-02-07', '-7')", + "insert into Weather (city_id, day, degree) values ('3', '2022-12-07', '-6')" + ], + "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>\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "{\"headers\": {\"Weather\": [\"city_id\", \"day\", \"degree\"]}, \"rows\": {\"Weather\": [[1, \"2022-01-07\", -12], [1, \"2022-03-07\", 5], [1, \"2022-07-07\", 24], [2, \"2022-08-07\", 37], [2, \"2022-08-17\", 37], [3, \"2022-02-07\", -7], [3, \"2022-12-07\", -6]]}}", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/check-if-matrix-is-x-matrix.json b/leetcode-cn/originData/check-if-matrix-is-x-matrix.json new file mode 100644 index 00000000..c1ee1ae3 --- /dev/null +++ b/leetcode-cn/originData/check-if-matrix-is-x-matrix.json @@ -0,0 +1,171 @@ +{ + "data": { + "question": { + "questionId": "2398", + "questionFrontendId": "2319", + "categoryTitle": "Algorithms", + "boundTopicId": 1621112, + "title": "Check if Matrix Is X-Matrix", + "titleSlug": "check-if-matrix-is-x-matrix", + "content": "

A square matrix is said to be an X-Matrix if both of the following conditions hold:

\n\n
    \n\t
  1. All the elements in the diagonals of the matrix are non-zero.
  2. \n\t
  3. All other elements are 0.
  4. \n
\n\n

Given a 2D integer array grid of size n x n representing a square matrix, return true if grid is an X-Matrix. Otherwise, return false.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: grid = [[2,0,0,1],[0,3,1,0],[0,5,2,0],[4,0,0,2]]\nOutput: true\nExplanation: Refer to the diagram above. \nAn X-Matrix should have the green elements (diagonals) be non-zero and the red elements be 0.\nThus, grid is an X-Matrix.\n
\n\n

Example 2:

\n\"\"\n
\nInput: grid = [[5,7,0],[0,3,1],[0,5,0]]\nOutput: false\nExplanation: Refer to the diagram above.\nAn X-Matrix should have the green elements (diagonals) be non-zero and the red elements be 0.\nThus, grid is not an X-Matrix.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • n == grid.length == grid[i].length
  • \n\t
  • 3 <= n <= 100
  • \n\t
  • 0 <= grid[i][j] <= 105
  • \n
\n", + "translatedTitle": "判断矩阵是否是一个 X 矩阵", + "translatedContent": "

如果一个正方形矩阵满足下述 全部 条件,则称之为一个 X 矩阵

\n\n
    \n\t
  1. 矩阵对角线上的所有元素都 不是 0
  2. \n\t
  3. 矩阵中所有其他元素都是 0
  4. \n
\n\n

给你一个大小为 n x n 的二维整数数组 grid ,表示一个正方形矩阵。如果 grid 是一个 X 矩阵 ,返回 true ;否则,返回 false

\n\n

 

\n\n

示例 1:

\n\"\"\n
输入:grid = [[2,0,0,1],[0,3,1,0],[0,5,2,0],[4,0,0,2]]\n输出:true\n解释:矩阵如上图所示。\nX 矩阵应该满足:绿色元素(对角线上)都不是 0 ,红色元素都是 0 。\n因此,grid 是一个 X 矩阵。\n
\n\n

示例 2:

\n\"\"\n
输入:grid = [[5,7,0],[0,3,1],[0,5,0]]\n输出:false\n解释:矩阵如上图所示。\nX 矩阵应该满足:绿色元素(对角线上)都不是 0 ,红色元素都是 0 。\n因此,grid 不是一个 X 矩阵。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • n == grid.length == grid[i].length
  • \n\t
  • 3 <= n <= 100
  • \n\t
  • 0 <= grid[i][j] <= 105
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 1, + "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, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false}", + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": "数组", + "__typename": "TopicTagNode" + }, + { + "name": "Matrix", + "slug": "matrix", + "translatedName": "矩阵", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n bool checkXMatrix(vector>& grid) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public boolean checkXMatrix(int[][] grid) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def checkXMatrix(self, grid):\n \"\"\"\n :type grid: List[List[int]]\n :rtype: bool\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def checkXMatrix(self, grid: List[List[int]]) -> bool:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nbool checkXMatrix(int** grid, int gridSize, int* gridColSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public bool CheckXMatrix(int[][] grid) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[][]} grid\n * @return {boolean}\n */\nvar checkXMatrix = function(grid) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[][]} grid\n# @return {Boolean}\ndef check_x_matrix(grid)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func checkXMatrix(_ grid: [[Int]]) -> Bool {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func checkXMatrix(grid [][]int) bool {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def checkXMatrix(grid: Array[Array[Int]]): Boolean = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun checkXMatrix(grid: Array): Boolean {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn check_x_matrix(grid: Vec>) -> bool {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[][] $grid\n * @return Boolean\n */\n function checkXMatrix($grid) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function checkXMatrix(grid: number[][]): boolean {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (check-x-matrix grid)\n (-> (listof (listof exact-integer?)) boolean?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec check_x_matrix(Grid :: [[integer()]]) -> boolean().\ncheck_x_matrix(Grid) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec check_x_matrix(grid :: [[integer]]) :: boolean\n def check_x_matrix(grid) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"6.9K\", \"totalSubmission\": \"9.4K\", \"totalAcceptedRaw\": 6930, \"totalSubmissionRaw\": 9390, \"acRate\": \"73.8%\"}", + "hints": [ + "Assuming a 0-indexed matrix, for a given cell on row i and column j, it is in a diagonal if and only if i == j or i == n - 1 - j.", + "We can then iterate through the elements in the matrix to check if all the elements in the diagonals are non-zero and all other elements are zero." + ], + "solution": null, + "status": null, + "sampleTestCase": "[[2,0,0,1],[0,3,1,0],[0,5,2,0],[4,0,0,2]]", + "metaData": "{\n \"name\": \"checkXMatrix\",\n \"params\": [\n {\n \"name\": \"grid\",\n \"type\": \"integer[][]\"\n }\n ],\n \"return\": {\n \"type\": \"boolean\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

\\u7248\\u672c\\uff1aclang 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 17\\u6807\\u51c6\\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 17<\\/code>\\u3002\\u53ef\\u4ee5\\u4f7f\\u7528Java 8\\u7684\\u7279\\u6027\\u4f8b\\u5982\\uff0clambda expressions \\u548c stream API\\u3002<\\/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 8.2<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n

\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O1<\\/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# 10<\\/a> \\u8fd0\\u884c\\u5728 .NET 6 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"

\\u7248\\u672c\\uff1aNode.js 16.13.2<\\/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<\\/a> \\u548c datastructures-js\\/queue<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/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.5.2<\\/code><\\/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.17<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/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 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

TypeScript 4.5.4<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2020<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/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 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[[2,0,0,1],[0,3,1,0],[0,5,2,0],[4,0,0,2]]\n[[5,7,0],[0,3,1],[0,5,0]]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/count-asterisks.json b/leetcode-cn/originData/count-asterisks.json new file mode 100644 index 00000000..3666f8e2 --- /dev/null +++ b/leetcode-cn/originData/count-asterisks.json @@ -0,0 +1,165 @@ +{ + "data": { + "question": { + "questionId": "2401", + "questionFrontendId": "2315", + "categoryTitle": "Algorithms", + "boundTopicId": 1621162, + "title": "Count Asterisks", + "titleSlug": "count-asterisks", + "content": "

You are given a string s, where every two consecutive vertical bars '|' are grouped into a pair. In other words, the 1st and 2nd '|' make a pair, the 3rd and 4th '|' make a pair, and so forth.

\n\n

Return the number of '*' in s, excluding the '*' between each pair of '|'.

\n\n

Note that each '|' will belong to exactly one pair.

\n\n

 

\n

Example 1:

\n\n
\nInput: s = "l|*e*et|c**o|*de|"\nOutput: 2\nExplanation: The considered characters are underlined: "l|*e*et|c**o|*de|".\nThe characters between the first and second '|' are excluded from the answer.\nAlso, the characters between the third and fourth '|' are excluded from the answer.\nThere are 2 asterisks considered. Therefore, we return 2.
\n\n

Example 2:

\n\n
\nInput: s = "iamprogrammer"\nOutput: 0\nExplanation: In this example, there are no asterisks in s. Therefore, we return 0.\n
\n\n

Example 3:

\n\n
\nInput: s = "yo|uar|e**|b|e***au|tifu|l"\nOutput: 5\nExplanation: The considered characters are underlined: "yo|uar|e**|b|e***au|tifu|l". There are 5 asterisks considered. Therefore, we return 5.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= s.length <= 1000
  • \n\t
  • s consists of lowercase English letters, vertical bars '|', and asterisks '*'.
  • \n\t
  • s contains an even number of vertical bars '|'.
  • \n
\n", + "translatedTitle": "统计星号", + "translatedContent": "

给你一个字符串 s ,每 两个 连续竖线 '|' 为 一对 。换言之,第一个和第二个 '|' 为一对,第三个和第四个 '|' 为一对,以此类推。

\n\n

请你返回 不在 竖线对之间,s 中 '*' 的数目。

\n\n

注意,每个竖线 '|' 都会 恰好 属于一个对。

\n\n

 

\n\n

示例 1:

\n\n
输入:s = \"l|*e*et|c**o|*de|\"\n输出:2\n解释:不在竖线对之间的字符加粗加斜体后,得到字符串:\"l|*e*et|c**o|*de|\" 。\n第一和第二条竖线 '|' 之间的字符不计入答案。\n同时,第三条和第四条竖线 '|' 之间的字符也不计入答案。\n不在竖线对之间总共有 2 个星号,所以我们返回 2 。
\n\n

示例 2:

\n\n
输入:s = \"iamprogrammer\"\n输出:0\n解释:在这个例子中,s 中没有星号。所以返回 0 。\n
\n\n

示例 3:

\n\n
输入:s = \"yo|uar|e**|b|e***au|tifu|l\"\n输出:5\n解释:需要考虑的字符加粗加斜体后:\"yo|uar|e**|b|e***au|tifu|l\" 。不在竖线对之间总共有 5 个星号。所以我们返回 5 。
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= s.length <= 1000
  • \n\t
  • s 只包含小写英文字母,竖线 '|' 和星号 '*' 。
  • \n\t
  • s 包含 偶数 个竖线 '|'
  • \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, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false}", + "topicTags": [ + { + "name": "String", + "slug": "string", + "translatedName": "字符串", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int countAsterisks(string s) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int countAsterisks(String s) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def countAsterisks(self, s):\n \"\"\"\n :type s: str\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def countAsterisks(self, s: str) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint countAsterisks(char * s){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int CountAsterisks(string s) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string} s\n * @return {number}\n */\nvar countAsterisks = function(s) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String} s\n# @return {Integer}\ndef count_asterisks(s)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func countAsterisks(_ s: String) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func countAsterisks(s string) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def countAsterisks(s: String): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun countAsterisks(s: String): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn count_asterisks(s: String) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String $s\n * @return Integer\n */\n function countAsterisks($s) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function countAsterisks(s: string): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (count-asterisks s)\n (-> string? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec count_asterisks(S :: unicode:unicode_binary()) -> integer().\ncount_asterisks(S) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec count_asterisks(s :: String.t) :: integer\n def count_asterisks(s) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"5.1K\", \"totalAcceptedRaw\": 4289, \"totalSubmissionRaw\": 5069, \"acRate\": \"84.6%\"}", + "hints": [ + "Iterate through each character, while maintaining whether we are currently between a pair of ‘|’ or not.", + "If we are not in between a pair of ‘|’ and there is a ‘*’, increment the answer by 1." + ], + "solution": null, + "status": null, + "sampleTestCase": "\"l|*e*et|c**o|*de|\"", + "metaData": "{\n \"name\": \"countAsterisks\",\n \"params\": [\n {\n \"name\": \"s\",\n \"type\": \"string\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

\\u7248\\u672c\\uff1aclang 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 17\\u6807\\u51c6\\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 17<\\/code>\\u3002\\u53ef\\u4ee5\\u4f7f\\u7528Java 8\\u7684\\u7279\\u6027\\u4f8b\\u5982\\uff0clambda expressions \\u548c stream API\\u3002<\\/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 8.2<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n

\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O1<\\/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# 10<\\/a> \\u8fd0\\u884c\\u5728 .NET 6 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"

\\u7248\\u672c\\uff1aNode.js 16.13.2<\\/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<\\/a> \\u548c datastructures-js\\/queue<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/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.5.2<\\/code><\\/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.17<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/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 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

TypeScript 4.5.4<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2020<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/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 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "\"l|*e*et|c**o|*de|\"\n\"iamprogrammer\"\n\"yo|uar|e**|b|e***au|tifu|l\"", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/count-number-of-ways-to-place-houses.json b/leetcode-cn/originData/count-number-of-ways-to-place-houses.json new file mode 100644 index 00000000..53990006 --- /dev/null +++ b/leetcode-cn/originData/count-number-of-ways-to-place-houses.json @@ -0,0 +1,166 @@ +{ + "data": { + "question": { + "questionId": "2397", + "questionFrontendId": "2320", + "categoryTitle": "Algorithms", + "boundTopicId": 1621114, + "title": "Count Number of Ways to Place Houses", + "titleSlug": "count-number-of-ways-to-place-houses", + "content": "

There is a street with n * 2 plots, where there are n plots on each side of the street. The plots on each side are numbered from 1 to n. On each plot, a house can be placed.

\n\n

Return the number of ways houses can be placed such that no two houses are adjacent to each other on the same side of the street. Since the answer may be very large, return it modulo 109 + 7.

\n\n

Note that if a house is placed on the ith plot on one side of the street, a house can also be placed on the ith plot on the other side of the street.

\n\n

 

\n

Example 1:

\n\n
\nInput: n = 1\nOutput: 4\nExplanation: \nPossible arrangements:\n1. All plots are empty.\n2. A house is placed on one side of the street.\n3. A house is placed on the other side of the street.\n4. Two houses are placed, one on each side of the street.\n
\n\n

Example 2:

\n\"\"\n
\nInput: n = 2\nOutput: 9\nExplanation: The 9 possible arrangements are shown in the diagram above.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n <= 104
  • \n
\n", + "translatedTitle": "统计放置房子的方式数", + "translatedContent": "

一条街道上共有 n * 2地块 ,街道的两侧各有 n 个地块。每一边的地块都按从 1n 编号。每个地块上都可以放置一所房子。

\n\n

现要求街道同一侧不能存在两所房子相邻的情况,请你计算并返回放置房屋的方式数目。由于答案可能很大,需要对 109 + 7 取余后再返回。

\n\n

注意,如果一所房子放置在这条街某一侧上的第 i 个地块,不影响在另一侧的第 i 个地块放置房子。

\n\n

 

\n\n

示例 1:

\n\n
输入:n = 1\n输出:4\n解释:\n可能的放置方式:\n1. 所有地块都不放置房子。\n2. 一所房子放在街道的某一侧。\n3. 一所房子放在街道的另一侧。\n4. 放置两所房子,街道两侧各放置一所。\n
\n\n

示例 2:

\n\"\"\n
输入:n = 2\n输出:9\n解释:如上图所示,共有 9 种可能的放置方式。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= n <= 104
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 16, + "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, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false}", + "topicTags": [ + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": "动态规划", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int countHousePlacements(int n) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int countHousePlacements(int n) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def countHousePlacements(self, n):\n \"\"\"\n :type n: int\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def countHousePlacements(self, n: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint countHousePlacements(int n){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int CountHousePlacements(int n) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @return {number}\n */\nvar countHousePlacements = function(n) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @return {Integer}\ndef count_house_placements(n)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func countHousePlacements(_ n: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func countHousePlacements(n int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def countHousePlacements(n: Int): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun countHousePlacements(n: Int): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn count_house_placements(n: i32) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @return Integer\n */\n function countHousePlacements($n) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function countHousePlacements(n: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (count-house-placements n)\n (-> exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec count_house_placements(N :: integer()) -> integer().\ncount_house_placements(N) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec count_house_placements(n :: integer) :: integer\n def count_house_placements(n) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"5.9K\", \"totalSubmission\": \"15.7K\", \"totalAcceptedRaw\": 5929, \"totalSubmissionRaw\": 15684, \"acRate\": \"37.8%\"}", + "hints": [ + "Try coming up with a DP solution for one side of the street.", + "The DP for one side of the street will bear resemblance to the Fibonacci sequence.", + "The number of different arrangements on both side of the street is the same." + ], + "solution": null, + "status": null, + "sampleTestCase": "1", + "metaData": "{\n \"name\": \"countHousePlacements\",\n \"params\": [\n {\n \"name\": \"n\",\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 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 17\\u6807\\u51c6\\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 17<\\/code>\\u3002\\u53ef\\u4ee5\\u4f7f\\u7528Java 8\\u7684\\u7279\\u6027\\u4f8b\\u5982\\uff0clambda expressions \\u548c stream API\\u3002<\\/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 8.2<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n

\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O1<\\/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# 10<\\/a> \\u8fd0\\u884c\\u5728 .NET 6 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"

\\u7248\\u672c\\uff1aNode.js 16.13.2<\\/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<\\/a> \\u548c datastructures-js\\/queue<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/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.5.2<\\/code><\\/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.17<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/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 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

TypeScript 4.5.4<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2020<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/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 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "1\n2", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/count-unreachable-pairs-of-nodes-in-an-undirected-graph.json b/leetcode-cn/originData/count-unreachable-pairs-of-nodes-in-an-undirected-graph.json new file mode 100644 index 00000000..ef736e97 --- /dev/null +++ b/leetcode-cn/originData/count-unreachable-pairs-of-nodes-in-an-undirected-graph.json @@ -0,0 +1,184 @@ +{ + "data": { + "question": { + "questionId": "2403", + "questionFrontendId": "2316", + "categoryTitle": "Algorithms", + "boundTopicId": 1621165, + "title": "Count Unreachable Pairs of Nodes in an Undirected Graph", + "titleSlug": "count-unreachable-pairs-of-nodes-in-an-undirected-graph", + "content": "

You are given an integer n. There is an undirected graph with n nodes, numbered from 0 to n - 1. You are given a 2D integer array edges where edges[i] = [ai, bi] denotes that there exists an undirected edge connecting nodes ai and bi.

\n\n

Return the number of pairs of different nodes that are unreachable from each other.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: n = 3, edges = [[0,1],[0,2],[1,2]]\nOutput: 0\nExplanation: There are no pairs of nodes that are unreachable from each other. Therefore, we return 0.\n
\n\n

Example 2:

\n\"\"\n
\nInput: n = 7, edges = [[0,2],[0,5],[2,4],[1,6],[5,4]]\nOutput: 14\nExplanation: There are 14 pairs of nodes that are unreachable from each other:\n[[0,1],[0,3],[0,6],[1,2],[1,3],[1,4],[1,5],[2,3],[2,6],[3,4],[3,5],[3,6],[4,6],[5,6]].\nTherefore, we return 14.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n <= 105
  • \n\t
  • 0 <= edges.length <= 2 * 105
  • \n\t
  • edges[i].length == 2
  • \n\t
  • 0 <= ai, bi < n
  • \n\t
  • ai != bi
  • \n\t
  • There are no repeated edges.
  • \n
\n", + "translatedTitle": "统计无向图中无法互相到达点对数", + "translatedContent": "

给你一个整数 n ,表示一张 无向图 中有 n 个节点,编号为 0 到 n - 1 。同时给你一个二维整数数组 edges ,其中 edges[i] = [ai, bi] 表示节点 ai 和 bi 之间有一条 无向 边。

\n\n

请你返回 无法互相到达 的不同 点对数目 。

\n\n

 

\n\n

示例 1:

\n\n

\"\"

\n\n
输入:n = 3, edges = [[0,1],[0,2],[1,2]]\n输出:0\n解释:所有点都能互相到达,意味着没有点对无法互相到达,所以我们返回 0 。\n
\n\n

示例 2:

\n\n

\"\"

\n\n
输入:n = 7, edges = [[0,2],[0,5],[2,4],[1,6],[5,4]]\n输出:14\n解释:总共有 14 个点对互相无法到达:\n[[0,1],[0,3],[0,6],[1,2],[1,3],[1,4],[1,5],[2,3],[2,6],[3,4],[3,5],[3,6],[4,6],[5,6]]\n所以我们返回 14 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= n <= 105
  • \n\t
  • 0 <= edges.length <= 2 * 105
  • \n\t
  • edges[i].length == 2
  • \n\t
  • 0 <= ai, bi < n
  • \n\t
  • ai != bi
  • \n\t
  • 不会有重复边。
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 2, + "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, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false}", + "topicTags": [ + { + "name": "Depth-First Search", + "slug": "depth-first-search", + "translatedName": "深度优先搜索", + "__typename": "TopicTagNode" + }, + { + "name": "Breadth-First Search", + "slug": "breadth-first-search", + "translatedName": "广度优先搜索", + "__typename": "TopicTagNode" + }, + { + "name": "Union Find", + "slug": "union-find", + "translatedName": "并查集", + "__typename": "TopicTagNode" + }, + { + "name": "Graph", + "slug": "graph", + "translatedName": "图", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n long long countPairs(int n, vector>& edges) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long countPairs(int n, int[][] edges) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def countPairs(self, n, edges):\n \"\"\"\n :type n: int\n :type edges: List[List[int]]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def countPairs(self, n: int, edges: List[List[int]]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nlong long countPairs(int n, int** edges, int edgesSize, int* edgesColSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long CountPairs(int n, int[][] edges) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number[][]} edges\n * @return {number}\n */\nvar countPairs = function(n, edges) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer[][]} edges\n# @return {Integer}\ndef count_pairs(n, edges)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func countPairs(_ n: Int, _ edges: [[Int]]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func countPairs(n int, edges [][]int) int64 {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def countPairs(n: Int, edges: Array[Array[Int]]): Long = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun countPairs(n: Int, edges: Array): Long {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn count_pairs(n: i32, edges: Vec>) -> i64 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer[][] $edges\n * @return Integer\n */\n function countPairs($n, $edges) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function countPairs(n: number, edges: number[][]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (count-pairs n edges)\n (-> exact-integer? (listof (listof exact-integer?)) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec count_pairs(N :: integer(), Edges :: [[integer()]]) -> integer().\ncount_pairs(N, Edges) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec count_pairs(n :: integer, edges :: [[integer]]) :: integer\n def count_pairs(n, edges) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"3.6K\", \"totalSubmission\": \"10K\", \"totalAcceptedRaw\": 3558, \"totalSubmissionRaw\": 10049, \"acRate\": \"35.4%\"}", + "hints": [ + "Find the connected components of the graph. To find connected components, you can use Union Find (Disjoint Sets), BFS, or DFS.", + "For a node u, the number of nodes that are unreachable from u is the number of nodes that are not in the same connected component as u.", + "The number of unreachable nodes from node u will be the same for the number of nodes that are unreachable from node v if nodes u and v belong to the same connected component." + ], + "solution": null, + "status": null, + "sampleTestCase": "3\n[[0,1],[0,2],[1,2]]", + "metaData": "{\n \"name\": \"countPairs\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\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 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 17\\u6807\\u51c6\\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 17<\\/code>\\u3002\\u53ef\\u4ee5\\u4f7f\\u7528Java 8\\u7684\\u7279\\u6027\\u4f8b\\u5982\\uff0clambda expressions \\u548c stream API\\u3002<\\/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 8.2<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n

\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O1<\\/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# 10<\\/a> \\u8fd0\\u884c\\u5728 .NET 6 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"

\\u7248\\u672c\\uff1aNode.js 16.13.2<\\/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<\\/a> \\u548c datastructures-js\\/queue<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/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.5.2<\\/code><\\/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.17<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/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 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

TypeScript 4.5.4<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2020<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/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 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "3\n[[0,1],[0,2],[1,2]]\n7\n[[0,2],[0,5],[2,4],[1,6],[5,4]]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/greatest-english-letter-in-upper-and-lower-case.json b/leetcode-cn/originData/greatest-english-letter-in-upper-and-lower-case.json new file mode 100644 index 00000000..899cf129 --- /dev/null +++ b/leetcode-cn/originData/greatest-english-letter-in-upper-and-lower-case.json @@ -0,0 +1,177 @@ +{ + "data": { + "question": { + "questionId": "1363", + "questionFrontendId": "2309", + "categoryTitle": "Algorithms", + "boundTopicId": 403669, + "title": "Greatest English Letter in Upper and Lower Case", + "titleSlug": "greatest-english-letter-in-upper-and-lower-case", + "content": "

Given a string of English letters s, return the greatest English letter which occurs as both a lowercase and uppercase letter in s. The returned letter should be in uppercase. If no such letter exists, return an empty string.

\n\n

An English letter b is greater than another letter a if b appears after a in the English alphabet.

\n\n

 

\n

Example 1:

\n\n
\nInput: s = "lEeTcOdE"\nOutput: "E"\nExplanation:\nThe letter 'E' is the only letter to appear in both lower and upper case.\n
\n\n

Example 2:

\n\n
\nInput: s = "arRAzFif"\nOutput: "R"\nExplanation:\nThe letter 'R' is the greatest letter to appear in both lower and upper case.\nNote that 'A' and 'F' also appear in both lower and upper case, but 'R' is greater than 'F' or 'A'.\n
\n\n

Example 3:

\n\n
\nInput: s = "AbCdEfGhIjK"\nOutput: ""\nExplanation:\nThere is no letter that appears in both lower and upper case.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= s.length <= 1000
  • \n\t
  • s consists of lowercase and uppercase English letters.
  • \n
\n", + "translatedTitle": "兼具大小写的最好英文字母", + "translatedContent": "

给你一个由英文字母组成的字符串 s ,请你找出并返回 s 中的 最好 英文字母。返回的字母必须为大写形式。如果不存在满足条件的字母,则返回一个空字符串。

\n\n

最好 英文字母的大写和小写形式必须 s 中出现。

\n\n

英文字母 b 比另一个英文字母 a 更好 的前提是:英文字母表中,ba 出现。

\n\n

 

\n\n

示例 1:

\n\n
\n输入:s = \"lEeTcOdE\"\n输出:\"E\"\n解释:\n字母 'E' 是唯一一个大写和小写形式都出现的字母。
\n\n

示例 2:

\n\n
\n输入:s = \"arRAzFif\"\n输出:\"R\"\n解释:\n字母 'R' 是大写和小写形式都出现的最好英文字母。\n注意 'A' 和 'F' 的大写和小写形式也都出现了,但是 'R' 比 'F' 和 'A' 更好。\n
\n\n

示例 3:

\n\n
\n输入:s = \"AbCdEfGhIjK\"\n输出:\"\"\n解释:\n不存在大写和小写形式都出现的字母。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= s.length <= 1000
  • \n\t
  • s 由小写和大写英文字母组成
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 1, + "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, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false}", + "topicTags": [ + { + "name": "Hash Table", + "slug": "hash-table", + "translatedName": "哈希表", + "__typename": "TopicTagNode" + }, + { + "name": "String", + "slug": "string", + "translatedName": "字符串", + "__typename": "TopicTagNode" + }, + { + "name": "Enumeration", + "slug": "enumeration", + "translatedName": "枚举", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n string greatestLetter(string s) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public String greatestLetter(String s) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def greatestLetter(self, s):\n \"\"\"\n :type s: str\n :rtype: str\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def greatestLetter(self, s: str) -> str:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nchar * greatestLetter(char * s){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public string GreatestLetter(string s) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string} s\n * @return {string}\n */\nvar greatestLetter = function(s) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String} s\n# @return {String}\ndef greatest_letter(s)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func greatestLetter(_ s: String) -> String {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func greatestLetter(s string) string {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def greatestLetter(s: String): String = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun greatestLetter(s: String): String {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn greatest_letter(s: String) -> String {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String $s\n * @return String\n */\n function greatestLetter($s) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function greatestLetter(s: string): string {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (greatest-letter s)\n (-> string? string?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec greatest_letter(S :: unicode:unicode_binary()) -> unicode:unicode_binary().\ngreatest_letter(S) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec greatest_letter(s :: String.t) :: String.t\n def greatest_letter(s) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"7.7K\", \"totalSubmission\": \"11.2K\", \"totalAcceptedRaw\": 7653, \"totalSubmissionRaw\": 11239, \"acRate\": \"68.1%\"}", + "hints": [ + "Consider iterating through the string and storing each unique character that occurs in a set.", + "From Z to A, check whether both the uppercase and lowercase version occur in the set." + ], + "solution": null, + "status": null, + "sampleTestCase": "\"lEeTcOdE\"", + "metaData": "{\n \"name\": \"greatestLetter\",\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 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 17\\u6807\\u51c6\\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 17<\\/code>\\u3002\\u53ef\\u4ee5\\u4f7f\\u7528Java 8\\u7684\\u7279\\u6027\\u4f8b\\u5982\\uff0clambda expressions \\u548c stream API\\u3002<\\/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 8.2<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n

\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O1<\\/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# 10<\\/a> \\u8fd0\\u884c\\u5728 .NET 6 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"

\\u7248\\u672c\\uff1aNode.js 16.13.2<\\/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<\\/a> \\u548c datastructures-js\\/queue<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/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.5.2<\\/code><\\/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.17<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/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 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

TypeScript 4.5.4<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2020<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/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 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "\"lEeTcOdE\"\n\"arRAzFif\"\n\"AbCdEfGhIjK\"", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/longest-binary-subsequence-less-than-or-equal-to-k.json b/leetcode-cn/originData/longest-binary-subsequence-less-than-or-equal-to-k.json new file mode 100644 index 00000000..23315ae9 --- /dev/null +++ b/leetcode-cn/originData/longest-binary-subsequence-less-than-or-equal-to-k.json @@ -0,0 +1,183 @@ +{ + "data": { + "question": { + "questionId": "2395", + "questionFrontendId": "2311", + "categoryTitle": "Algorithms", + "boundTopicId": 1607140, + "title": "Longest Binary Subsequence Less Than or Equal to K", + "titleSlug": "longest-binary-subsequence-less-than-or-equal-to-k", + "content": "

You are given a binary string s and a positive integer k.

\n\n

Return the length of the longest subsequence of s that makes up a binary number less than or equal to k.

\n\n

Note:

\n\n
    \n\t
  • The subsequence can contain leading zeroes.
  • \n\t
  • The empty string is considered to be equal to 0.
  • \n\t
  • A subsequence is a string that can be derived from another string by deleting some or no characters without changing the order of the remaining characters.
  • \n
\n\n

 

\n

Example 1:

\n\n
\nInput: s = "1001010", k = 5\nOutput: 5\nExplanation: The longest subsequence of s that makes up a binary number less than or equal to 5 is "00010", as this number is equal to 2 in decimal.\nNote that "00100" and "00101" are also possible, which are equal to 4 and 5 in decimal, respectively.\nThe length of this subsequence is 5, so 5 is returned.\n
\n\n

Example 2:

\n\n
\nInput: s = "00101001", k = 1\nOutput: 6\nExplanation: "000001" is the longest subsequence of s that makes up a binary number less than or equal to 1, as this number is equal to 1 in decimal.\nThe length of this subsequence is 6, so 6 is returned.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= s.length <= 1000
  • \n\t
  • s[i] is either '0' or '1'.
  • \n\t
  • 1 <= k <= 109
  • \n
\n", + "translatedTitle": "小于等于 K 的最长二进制子序列", + "translatedContent": "

给你一个二进制字符串 s 和一个正整数 k 。

\n\n

请你返回 s 的 最长 子序列,且该子序列对应的 二进制 数字小于等于 k 。

\n\n

注意:

\n\n
    \n\t
  • 子序列可以有 前导 0 。
  • \n\t
  • 空字符串视为 0 。
  • \n\t
  • 子序列 是指从一个字符串中删除零个或者多个字符后,不改变顺序得到的剩余字符序列。
  • \n
\n\n

 

\n\n

示例 1:

\n\n
输入:s = \"1001010\", k = 5\n输出:5\n解释:s 中小于等于 5 的最长子序列是 \"00010\" ,对应的十进制数字是 2 。\n注意 \"00100\" 和 \"00101\" 也是可行的最长子序列,十进制分别对应 4 和 5 。\n最长子序列的长度为 5 ,所以返回 5 。\n
\n\n

示例 2:

\n\n
输入:s = \"00101001\", k = 1\n输出:6\n解释:\"000001\" 是 s 中小于等于 1 的最长子序列,对应的十进制数字是 1 。\n最长子序列的长度为 6 ,所以返回 6 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= s.length <= 1000
  • \n\t
  • s[i] 要么是 '0' ,要么是 '1'
  • \n\t
  • 1 <= k <= 109
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 21, + "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, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false}", + "topicTags": [ + { + "name": "Greedy", + "slug": "greedy", + "translatedName": "贪心", + "__typename": "TopicTagNode" + }, + { + "name": "Memoization", + "slug": "memoization", + "translatedName": "记忆化搜索", + "__typename": "TopicTagNode" + }, + { + "name": "String", + "slug": "string", + "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 longestSubsequence(string s, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int longestSubsequence(String s, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def longestSubsequence(self, s, k):\n \"\"\"\n :type s: str\n :type k: int\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def longestSubsequence(self, s: str, k: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint longestSubsequence(char * s, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int LongestSubsequence(string s, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string} s\n * @param {number} k\n * @return {number}\n */\nvar longestSubsequence = function(s, k) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String} s\n# @param {Integer} k\n# @return {Integer}\ndef longest_subsequence(s, k)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func longestSubsequence(_ s: String, _ k: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func longestSubsequence(s string, k int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def longestSubsequence(s: String, k: Int): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun longestSubsequence(s: String, k: Int): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn longest_subsequence(s: String, k: i32) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String $s\n * @param Integer $k\n * @return Integer\n */\n function longestSubsequence($s, $k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function longestSubsequence(s: string, k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (longest-subsequence s k)\n (-> string? exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec longest_subsequence(S :: unicode:unicode_binary(), K :: integer()) -> integer().\nlongest_subsequence(S, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec longest_subsequence(s :: String.t, k :: integer) :: integer\n def longest_subsequence(s, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"5.5K\", \"totalSubmission\": \"15.7K\", \"totalAcceptedRaw\": 5513, \"totalSubmissionRaw\": 15708, \"acRate\": \"35.1%\"}", + "hints": [ + "Choosing a subsequence from the string is equivalent to deleting all the other digits.", + "If you were to remove a digit, which one should you remove to reduce the value of the string?" + ], + "solution": null, + "status": null, + "sampleTestCase": "\"1001010\"\n5", + "metaData": "{\n \"name\": \"longestSubsequence\",\n \"params\": [\n {\n \"name\": \"s\",\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 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 17\\u6807\\u51c6\\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 17<\\/code>\\u3002\\u53ef\\u4ee5\\u4f7f\\u7528Java 8\\u7684\\u7279\\u6027\\u4f8b\\u5982\\uff0clambda expressions \\u548c stream API\\u3002<\\/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 8.2<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n

\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O1<\\/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# 10<\\/a> \\u8fd0\\u884c\\u5728 .NET 6 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"

\\u7248\\u672c\\uff1aNode.js 16.13.2<\\/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<\\/a> \\u548c datastructures-js\\/queue<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/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.5.2<\\/code><\\/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.17<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/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 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

TypeScript 4.5.4<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2020<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/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 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "\"1001010\"\n5\n\"00101001\"\n1", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/maximum-score-of-spliced-array.json b/leetcode-cn/originData/maximum-score-of-spliced-array.json new file mode 100644 index 00000000..7c4a9c95 --- /dev/null +++ b/leetcode-cn/originData/maximum-score-of-spliced-array.json @@ -0,0 +1,172 @@ +{ + "data": { + "question": { + "questionId": "1348", + "questionFrontendId": "2321", + "categoryTitle": "Algorithms", + "boundTopicId": 52457, + "title": "Maximum Score Of Spliced Array", + "titleSlug": "maximum-score-of-spliced-array", + "content": "

You are given two 0-indexed integer arrays nums1 and nums2, both of length n.

\n\n

You can choose two integers left and right where 0 <= left <= right < n and swap the subarray nums1[left...right] with the subarray nums2[left...right].

\n\n
    \n\t
  • For example, if nums1 = [1,2,3,4,5] and nums2 = [11,12,13,14,15] and you choose left = 1 and right = 2, nums1 becomes [1,12,13,4,5] and nums2 becomes [11,2,3,14,15].
  • \n
\n\n

You may choose to apply the mentioned operation once or not do anything.

\n\n

The score of the arrays is the maximum of sum(nums1) and sum(nums2), where sum(arr) is the sum of all the elements in the array arr.

\n\n

Return the maximum possible score.

\n\n

A subarray is a contiguous sequence of elements within an array. arr[left...right] denotes the subarray that contains the elements of nums between indices left and right (inclusive).

\n\n

 

\n

Example 1:

\n\n
\nInput: nums1 = [60,60,60], nums2 = [10,90,10]\nOutput: 210\nExplanation: Choosing left = 1 and right = 1, we have nums1 = [60,90,60] and nums2 = [10,60,10].\nThe score is max(sum(nums1), sum(nums2)) = max(210, 80) = 210.
\n\n

Example 2:

\n\n
\nInput: nums1 = [20,40,20,70,30], nums2 = [50,20,50,40,20]\nOutput: 220\nExplanation: Choosing left = 3, right = 4, we have nums1 = [20,40,20,40,20] and nums2 = [50,20,50,70,30].\nThe score is max(sum(nums1), sum(nums2)) = max(140, 220) = 220.\n
\n\n

Example 3:

\n\n
\nInput: nums1 = [7,11,13], nums2 = [1,1,1]\nOutput: 31\nExplanation: We choose not to swap any subarray.\nThe score is max(sum(nums1), sum(nums2)) = max(31, 3) = 31.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • n == nums1.length == nums2.length
  • \n\t
  • 1 <= n <= 105
  • \n\t
  • 1 <= nums1[i], nums2[i] <= 104
  • \n
\n", + "translatedTitle": "拼接数组的最大分数", + "translatedContent": "

给你两个下标从 0 开始的整数数组 nums1nums2 ,长度都是 n

\n\n

你可以选择两个整数 leftright ,其中 0 <= left <= right < n ,接着 交换 两个子数组 nums1[left...right]nums2[left...right]

\n\n
    \n\t
  • 例如,设 nums1 = [1,2,3,4,5]nums2 = [11,12,13,14,15] ,整数选择 left = 1right = 2,那么 nums1 会变为 [1,12,13,4,5]nums2 会变为 [11,2,3,14,15]
  • \n
\n\n

你可以选择执行上述操作 一次 或不执行任何操作。

\n\n

数组的 分数sum(nums1)sum(nums2) 中的最大值,其中 sum(arr) 是数组 arr 中所有元素之和。

\n\n

返回 可能的最大分数

\n\n

子数组 是数组中连续的一个元素序列。arr[left...right] 表示子数组包含 nums 中下标 leftright 之间的元素(含 下标 leftright 对应元素

\n\n

 

\n\n

示例 1:

\n\n
\n输入:nums1 = [60,60,60], nums2 = [10,90,10]\n输出:210\n解释:选择 left = 1 和 right = 1 ,得到 nums1 = [60,90,60] 和 nums2 = [10,60,10] 。\n分数为 max(sum(nums1), sum(nums2)) = max(210, 80) = 210 。
\n\n

示例 2:

\n\n
\n输入:nums1 = [20,40,20,70,30], nums2 = [50,20,50,40,20]\n输出:220\n解释:选择 left = 3 和 right = 4 ,得到 nums1 = [20,40,20,40,20] 和 nums2 = [50,20,50,70,30] 。\n分数为 max(sum(nums1), sum(nums2)) = max(140, 220) = 220 。\n
\n\n

示例 3:

\n\n
\n输入:nums1 = [7,11,13], nums2 = [1,1,1]\n输出:31\n解释:选择不交换任何子数组。\n分数为 max(sum(nums1), sum(nums2)) = max(31, 3) = 31 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • n == nums1.length == nums2.length
  • \n\t
  • 1 <= n <= 105
  • \n\t
  • 1 <= nums1[i], nums2[i] <= 104
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 18, + "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, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": 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 maximumsSplicedArray(vector& nums1, vector& nums2) {\n\n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int maximumsSplicedArray(int[] nums1, int[] nums2) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def maximumsSplicedArray(self, nums1, nums2):\n \"\"\"\n :type nums1: List[int]\n :type nums2: List[int]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def maximumsSplicedArray(self, nums1: List[int], nums2: List[int]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint maximumsSplicedArray(int* nums1, int nums1Size, int* nums2, int nums2Size){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MaximumsSplicedArray(int[] nums1, int[] nums2) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums1\n * @param {number[]} nums2\n * @return {number}\n */\nvar maximumsSplicedArray = function(nums1, nums2) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums1\n# @param {Integer[]} nums2\n# @return {Integer}\ndef maximums_spliced_array(nums1, nums2)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func maximumsSplicedArray(_ nums1: [Int], _ nums2: [Int]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func maximumsSplicedArray(nums1 []int, nums2 []int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def maximumsSplicedArray(nums1: Array[Int], nums2: Array[Int]): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun maximumsSplicedArray(nums1: IntArray, nums2: IntArray): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn maximums_spliced_array(nums1: Vec, nums2: Vec) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums1\n * @param Integer[] $nums2\n * @return Integer\n */\n function maximumsSplicedArray($nums1, $nums2) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function maximumsSplicedArray(nums1: number[], nums2: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (maximums-spliced-array nums1 nums2)\n (-> (listof exact-integer?) (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec maximums_spliced_array(Nums1 :: [integer()], Nums2 :: [integer()]) -> integer().\nmaximums_spliced_array(Nums1, Nums2) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec maximums_spliced_array(nums1 :: [integer], nums2 :: [integer]) :: integer\n def maximums_spliced_array(nums1, nums2) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"4.6K\", \"totalSubmission\": \"9.5K\", \"totalAcceptedRaw\": 4572, \"totalSubmissionRaw\": 9520, \"acRate\": \"48.0%\"}", + "hints": [ + "Think on Dynamic Programming.", + "First assume you will be taking the array a and choose some subarray from b", + "Suppose the DP is DP(pos, state). pos is the current position you are in. state is one of {0,1,2}, where 0 means taking the array a, 1 means we are taking the subarray b, and 2 means we are again taking the array a. We need to handle the transitions carefully." + ], + "solution": null, + "status": null, + "sampleTestCase": "[60,60,60]\n[10,90,10]", + "metaData": "{\n \"name\": \"maximumsSplicedArray\",\n \"params\": [\n {\n \"name\": \"nums1\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"nums2\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

\\u7248\\u672c\\uff1aclang 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 17\\u6807\\u51c6\\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 17<\\/code>\\u3002\\u53ef\\u4ee5\\u4f7f\\u7528Java 8\\u7684\\u7279\\u6027\\u4f8b\\u5982\\uff0clambda expressions \\u548c stream API\\u3002<\\/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 8.2<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n

\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O1<\\/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# 10<\\/a> \\u8fd0\\u884c\\u5728 .NET 6 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"

\\u7248\\u672c\\uff1aNode.js 16.13.2<\\/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<\\/a> \\u548c datastructures-js\\/queue<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/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.5.2<\\/code><\\/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.17<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/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 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

TypeScript 4.5.4<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2020<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/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 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[60,60,60]\n[10,90,10]\n[20,40,20,70,30]\n[50,20,50,40,20]\n[7,11,13]\n[1,1,1]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/maximum-xor-after-operations.json b/leetcode-cn/originData/maximum-xor-after-operations.json new file mode 100644 index 00000000..4ee85345 --- /dev/null +++ b/leetcode-cn/originData/maximum-xor-after-operations.json @@ -0,0 +1,179 @@ +{ + "data": { + "question": { + "questionId": "2402", + "questionFrontendId": "2317", + "categoryTitle": "Algorithms", + "boundTopicId": 1621174, + "title": "Maximum XOR After Operations ", + "titleSlug": "maximum-xor-after-operations", + "content": "

You are given a 0-indexed integer array nums. In one operation, select any non-negative integer x and an index i, then update nums[i] to be equal to nums[i] AND (nums[i] XOR x).

\n\n

Note that AND is the bitwise AND operation and XOR is the bitwise XOR operation.

\n\n

Return the maximum possible bitwise XOR of all elements of nums after applying the operation any number of times.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [3,2,4,6]\nOutput: 7\nExplanation: Apply the operation with x = 4 and i = 3, num[3] = 6 AND (6 XOR 4) = 6 AND 2 = 2.\nNow, nums = [3, 2, 4, 2] and the bitwise XOR of all the elements = 3 XOR 2 XOR 4 XOR 2 = 7.\nIt can be shown that 7 is the maximum possible bitwise XOR.\nNote that other operations may be used to achieve a bitwise XOR of 7.
\n\n

Example 2:

\n\n
\nInput: nums = [1,2,3,9,2]\nOutput: 11\nExplanation: Apply the operation zero times.\nThe bitwise XOR of all the elements = 1 XOR 2 XOR 3 XOR 9 XOR 2 = 11.\nIt can be shown that 11 is the maximum possible bitwise XOR.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 0 <= nums[i] <= 108
  • \n
\n", + "translatedTitle": "操作后的最大异或和", + "translatedContent": "

给你一个下标从 0 开始的整数数组 nums 。一次操作中,选择 任意 非负整数 x 和一个下标 i ,更新 nums[i] 为 nums[i] AND (nums[i] XOR x) 。

\n\n

注意,AND 是逐位与运算,XOR 是逐位异或运算。

\n\n

请你执行 任意次 更新操作,并返回 nums 中所有元素 最大 逐位异或和。

\n\n

 

\n\n

示例 1:

\n\n
输入:nums = [3,2,4,6]\n输出:7\n解释:选择 x = 4 和 i = 3 进行操作,num[3] = 6 AND (6 XOR 4) = 6 AND 2 = 2 。\n现在,nums = [3, 2, 4, 2] 且所有元素逐位异或得到 3 XOR 2 XOR 4 XOR 2 = 7 。\n可知 7 是能得到的最大逐位异或和。\n注意,其他操作可能也能得到逐位异或和 7 。
\n\n

示例 2:

\n\n
输入:nums = [1,2,3,9,2]\n输出:11\n解释:执行 0 次操作。\n所有元素的逐位异或和为 1 XOR 2 XOR 3 XOR 9 XOR 2 = 11 。\n可知 11 是能得到的最大逐位异或和。
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 0 <= nums[i] <= 108
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "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, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false}", + "topicTags": [ + { + "name": "Bit Manipulation", + "slug": "bit-manipulation", + "translatedName": "位运算", + "__typename": "TopicTagNode" + }, + { + "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 maximumXOR(vector& nums) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int maximumXOR(int[] nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def maximumXOR(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def maximumXOR(self, nums: List[int]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint maximumXOR(int* nums, int numsSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MaximumXOR(int[] nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @return {number}\n */\nvar maximumXOR = function(nums) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @return {Integer}\ndef maximum_xor(nums)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func maximumXOR(_ nums: [Int]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func maximumXOR(nums []int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def maximumXOR(nums: Array[Int]): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun maximumXOR(nums: IntArray): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn maximum_xor(nums: Vec) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @return Integer\n */\n function maximumXOR($nums) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function maximumXOR(nums: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (maximum-xor nums)\n (-> (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec maximum_xor(Nums :: [integer()]) -> integer().\nmaximum_xor(Nums) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec maximum_xor(nums :: [integer]) :: integer\n def maximum_xor(nums) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"2.8K\", \"totalSubmission\": \"3.4K\", \"totalAcceptedRaw\": 2848, \"totalSubmissionRaw\": 3446, \"acRate\": \"82.6%\"}", + "hints": [ + "Consider what it means to be able to choose any x for the operation and which integers could be obtained from a given nums[i].", + "The given operation can unset any bit in nums[i].", + "The nth bit of the XOR of all the elements is 1 if the nth bit is 1 for an odd number of elements. When can we ensure it is odd?", + "Try to set every bit of the result to 1 if possible." + ], + "solution": null, + "status": null, + "sampleTestCase": "[3,2,4,6]", + "metaData": "{\n \"name\": \"maximumXOR\",\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 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 17\\u6807\\u51c6\\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 17<\\/code>\\u3002\\u53ef\\u4ee5\\u4f7f\\u7528Java 8\\u7684\\u7279\\u6027\\u4f8b\\u5982\\uff0clambda expressions \\u548c stream API\\u3002<\\/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 8.2<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n

\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O1<\\/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# 10<\\/a> \\u8fd0\\u884c\\u5728 .NET 6 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"

\\u7248\\u672c\\uff1aNode.js 16.13.2<\\/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<\\/a> \\u548c datastructures-js\\/queue<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/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.5.2<\\/code><\\/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.17<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/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 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

TypeScript 4.5.4<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2020<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/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 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[3,2,4,6]\n[1,2,3,9,2]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/minimum-score-after-removals-on-a-tree.json b/leetcode-cn/originData/minimum-score-after-removals-on-a-tree.json new file mode 100644 index 00000000..8c5ce80c --- /dev/null +++ b/leetcode-cn/originData/minimum-score-after-removals-on-a-tree.json @@ -0,0 +1,183 @@ +{ + "data": { + "question": { + "questionId": "2400", + "questionFrontendId": "2322", + "categoryTitle": "Algorithms", + "boundTopicId": 1621121, + "title": "Minimum Score After Removals on a Tree", + "titleSlug": "minimum-score-after-removals-on-a-tree", + "content": "

There is an undirected connected tree with n nodes labeled from 0 to n - 1 and n - 1 edges.

\n\n

You are given a 0-indexed integer array nums of length n where nums[i] represents the value of the ith node. You are also given a 2D integer array edges of length n - 1 where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the tree.

\n\n

Remove two distinct edges of the tree to form three connected components. For a pair of removed edges, the following steps are defined:

\n\n
    \n\t
  1. Get the XOR of all the values of the nodes for each of the three components respectively.
  2. \n\t
  3. The difference between the largest XOR value and the smallest XOR value is the score of the pair.
  4. \n
\n\n
    \n\t
  • For example, say the three components have the node values: [4,5,7], [1,9], and [3,3,3]. The three XOR values are 4 ^ 5 ^ 7 = 6, 1 ^ 9 = 8, and 3 ^ 3 ^ 3 = 3. The largest XOR value is 8 and the smallest XOR value is 3. The score is then 8 - 3 = 5.
  • \n
\n\n

Return the minimum score of any possible pair of edge removals on the given tree.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: nums = [1,5,5,4,11], edges = [[0,1],[1,2],[1,3],[3,4]]\nOutput: 9\nExplanation: The diagram above shows a way to make a pair of removals.\n- The 1st component has nodes [1,3,4] with values [5,4,11]. Its XOR value is 5 ^ 4 ^ 11 = 10.\n- The 2nd component has node [0] with value [1]. Its XOR value is 1 = 1.\n- The 3rd component has node [2] with value [5]. Its XOR value is 5 = 5.\nThe score is the difference between the largest and smallest XOR value which is 10 - 1 = 9.\nIt can be shown that no other pair of removals will obtain a smaller score than 9.\n
\n\n

Example 2:

\n\"\"\n
\nInput: nums = [5,5,2,4,4,2], edges = [[0,1],[1,2],[5,2],[4,3],[1,3]]\nOutput: 0\nExplanation: The diagram above shows a way to make a pair of removals.\n- The 1st component has nodes [3,4] with values [4,4]. Its XOR value is 4 ^ 4 = 0.\n- The 2nd component has nodes [1,0] with values [5,5]. Its XOR value is 5 ^ 5 = 0.\n- The 3rd component has nodes [2,5] with values [2,2]. Its XOR value is 2 ^ 2 = 0.\nThe score is the difference between the largest and smallest XOR value which is 0 - 0 = 0.\nWe cannot obtain a smaller score than 0.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • n == nums.length
  • \n\t
  • 3 <= n <= 1000
  • \n\t
  • 1 <= nums[i] <= 108
  • \n\t
  • edges.length == n - 1
  • \n\t
  • edges[i].length == 2
  • \n\t
  • 0 <= ai, bi < n
  • \n\t
  • ai != bi
  • \n\t
  • edges represents a valid tree.
  • \n
\n", + "translatedTitle": "从树中删除边的最小分数", + "translatedContent": "

存在一棵无向连通树,树中有编号从 0n - 1n 个节点, 以及 n - 1 条边。

\n\n

给你一个下标从 0 开始的整数数组 nums ,长度为 n ,其中 nums[i] 表示第 i 个节点的值。另给你一个二维整数数组 edges ,长度为 n - 1 ,其中 edges[i] = [ai, bi] 表示树中存在一条位于节点 aibi 之间的边。

\n\n

删除树中两条 不同 的边以形成三个连通组件。对于一种删除边方案,定义如下步骤以计算其分数:

\n\n
    \n\t
  1. 分别获取三个组件 每个 组件中所有节点值的异或值。
  2. \n\t
  3. 最大 异或值和 最小 异或值的 差值 就是这一种删除边方案的分数。
  4. \n
\n\n
    \n\t
  • 例如,三个组件的节点值分别是:[4,5,7][1,9][3,3,3] 。三个异或值分别是 4 ^ 5 ^ 7 = 61 ^ 9 = 83 ^ 3 ^ 3 = 3 。最大异或值是 8 ,最小异或值是 3 ,分数是 8 - 3 = 5
  • \n
\n\n

返回在给定树上执行任意删除边方案可能的 最小 分数。

\n\n

 

\n\n

示例 1:

\n\"\"\n
输入:nums = [1,5,5,4,11], edges = [[0,1],[1,2],[1,3],[3,4]]\n输出:9\n解释:上图展示了一种删除边方案。\n- 第 1 个组件的节点是 [1,3,4] ,值是 [5,4,11] 。异或值是 5 ^ 4 ^ 11 = 10 。\n- 第 2 个组件的节点是 [0] ,值是 [1] 。异或值是 1 = 1 。\n- 第 3 个组件的节点是 [2] ,值是 [5] 。异或值是 5 = 5 。\n分数是最大异或值和最小异或值的差值,10 - 1 = 9 。\n可以证明不存在分数比 9 小的删除边方案。\n
\n\n

示例 2:

\n\"\"\n
输入:nums = [5,5,2,4,4,2], edges = [[0,1],[1,2],[5,2],[4,3],[1,3]]\n输出:0\n解释:上图展示了一种删除边方案。\n- 第 1 个组件的节点是 [3,4] ,值是 [4,4] 。异或值是 4 ^ 4 = 0 。\n- 第 2 个组件的节点是 [1,0] ,值是 [5,5] 。异或值是 5 ^ 5 = 0 。\n- 第 3 个组件的节点是 [2,5] ,值是 [2,2] 。异或值是 2 ^ 2 = 0 。\n分数是最大异或值和最小异或值的差值,0 - 0 = 0 。\n无法获得比 0 更小的分数 0 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • n == nums.length
  • \n\t
  • 3 <= n <= 1000
  • \n\t
  • 1 <= nums[i] <= 108
  • \n\t
  • edges.length == n - 1
  • \n\t
  • edges[i].length == 2
  • \n\t
  • 0 <= ai, bi < n
  • \n\t
  • ai != bi
  • \n\t
  • edges 表示一棵有效的树
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 14, + "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, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false}", + "topicTags": [ + { + "name": "Bit Manipulation", + "slug": "bit-manipulation", + "translatedName": "位运算", + "__typename": "TopicTagNode" + }, + { + "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 int minimumScore(vector& nums, vector>& edges) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int minimumScore(int[] nums, int[][] edges) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def minimumScore(self, nums, edges):\n \"\"\"\n :type nums: List[int]\n :type edges: List[List[int]]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def minimumScore(self, nums: List[int], edges: List[List[int]]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint minimumScore(int* nums, int numsSize, int** edges, int edgesSize, int* edgesColSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MinimumScore(int[] nums, int[][] edges) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @param {number[][]} edges\n * @return {number}\n */\nvar minimumScore = function(nums, edges) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @param {Integer[][]} edges\n# @return {Integer}\ndef minimum_score(nums, edges)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func minimumScore(_ nums: [Int], _ edges: [[Int]]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func minimumScore(nums []int, edges [][]int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def minimumScore(nums: Array[Int], edges: Array[Array[Int]]): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun minimumScore(nums: IntArray, edges: Array): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn minimum_score(nums: Vec, edges: Vec>) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @param Integer[][] $edges\n * @return Integer\n */\n function minimumScore($nums, $edges) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function minimumScore(nums: number[], edges: number[][]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (minimum-score nums edges)\n (-> (listof exact-integer?) (listof (listof exact-integer?)) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec minimum_score(Nums :: [integer()], Edges :: [[integer()]]) -> integer().\nminimum_score(Nums, Edges) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec minimum_score(nums :: [integer], edges :: [[integer]]) :: integer\n def minimum_score(nums, edges) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"2.1K\", \"totalSubmission\": \"3.8K\", \"totalAcceptedRaw\": 2063, \"totalSubmissionRaw\": 3786, \"acRate\": \"54.5%\"}", + "hints": [ + "Consider iterating over the first edge to remove, and then doing some precalculations on the 2 resulting connected components.", + "Will calculating the XOR of each subtree help?" + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,5,5,4,11]\n[[0,1],[1,2],[1,3],[3,4]]", + "metaData": "{\n \"name\": \"minimumScore\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"edges\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

\\u7248\\u672c\\uff1aclang 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 17\\u6807\\u51c6\\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 17<\\/code>\\u3002\\u53ef\\u4ee5\\u4f7f\\u7528Java 8\\u7684\\u7279\\u6027\\u4f8b\\u5982\\uff0clambda expressions \\u548c stream API\\u3002<\\/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 8.2<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n

\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O1<\\/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# 10<\\/a> \\u8fd0\\u884c\\u5728 .NET 6 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"

\\u7248\\u672c\\uff1aNode.js 16.13.2<\\/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<\\/a> \\u548c datastructures-js\\/queue<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/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.5.2<\\/code><\\/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.17<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/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 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

TypeScript 4.5.4<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2020<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/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 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "[1,5,5,4,11]\n[[0,1],[1,2],[1,3],[3,4]]\n[5,5,2,4,4,2]\n[[0,1],[1,2],[5,2],[4,3],[1,3]]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/number-of-distinct-roll-sequences.json b/leetcode-cn/originData/number-of-distinct-roll-sequences.json new file mode 100644 index 00000000..c17bc1b6 --- /dev/null +++ b/leetcode-cn/originData/number-of-distinct-roll-sequences.json @@ -0,0 +1,172 @@ +{ + "data": { + "question": { + "questionId": "2404", + "questionFrontendId": "2318", + "categoryTitle": "Algorithms", + "boundTopicId": 1621184, + "title": "Number of Distinct Roll Sequences", + "titleSlug": "number-of-distinct-roll-sequences", + "content": "

You are given an integer n. You roll a fair 6-sided dice n times. Determine the total number of distinct sequences of rolls possible such that the following conditions are satisfied:

\n\n
    \n\t
  1. The greatest common divisor of any adjacent values in the sequence is equal to 1.
  2. \n\t
  3. There is at least a gap of 2 rolls between equal valued rolls. More formally, if the value of the ith roll is equal to the value of the jth roll, then abs(i - j) > 2.
  4. \n
\n\n

Return the total number of distinct sequences possible. Since the answer may be very large, return it modulo 109 + 7.

\n\n

Two sequences are considered distinct if at least one element is different.

\n\n

 

\n

Example 1:

\n\n
\nInput: n = 4\nOutput: 184\nExplanation: Some of the possible sequences are (1, 2, 3, 4), (6, 1, 2, 3), (1, 2, 3, 1), etc.\nSome invalid sequences are (1, 2, 1, 3), (1, 2, 3, 6).\n(1, 2, 1, 3) is invalid since the first and third roll have an equal value and abs(1 - 3) = 2 (i and j are 1-indexed).\n(1, 2, 3, 6) is invalid since the greatest common divisor of 3 and 6 = 3.\nThere are a total of 184 distinct sequences possible, so we return 184.
\n\n

Example 2:

\n\n
\nInput: n = 2\nOutput: 22\nExplanation: Some of the possible sequences are (1, 2), (2, 1), (3, 2).\nSome invalid sequences are (3, 6), (2, 4) since the greatest common divisor is not equal to 1.\nThere are a total of 22 distinct sequences possible, so we return 22.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n <= 104
  • \n
\n", + "translatedTitle": "不同骰子序列的数目", + "translatedContent": "

给你一个整数 n 。你需要掷一个 6 面的骰子 n 次。请你在满足以下要求的前提下,求出 不同 骰子序列的数目:

\n\n
    \n\t
  1. 序列中任意 相邻 数字的 最大公约数 为 1 。
  2. \n\t
  3. 序列中 相等 的值之间,至少有 2 个其他值的数字。正式地,如果第 i 次掷骰子的值 等于 第 j 次的值,那么 abs(i - j) > 2 。
  4. \n
\n\n

请你返回不同序列的 总数目 。由于答案可能很大,请你将答案对 109 + 7 取余 后返回。

\n\n

如果两个序列中至少有一个元素不同,那么它们被视为不同的序列。

\n\n

 

\n\n

示例 1:

\n\n
\n输入:n = 4\n输出:184\n解释:一些可行的序列为 (1, 2, 3, 4) ,(6, 1, 2, 3) ,(1, 2, 3, 1) 等等。\n一些不可行的序列为 (1, 2, 1, 3) ,(1, 2, 3, 6) 。\n(1, 2, 1, 3) 是不可行的,因为第一个和第三个骰子值相等且 abs(1 - 3) = 2 (下标从 1 开始表示)。\n(1, 2, 3, 6) i是不可行的,因为 3 和 6 的最大公约数是 3 。\n总共有 184 个不同的可行序列,所以我们返回 184 。
\n\n

示例 2:

\n\n
\n输入:n = 2\n输出:22\n解释:一些可行的序列为 (1, 2) ,(2, 1) ,(3, 2) 。\n一些不可行的序列为 (3, 6) ,(2, 4) ,因为最大公约数不为 1 。\n总共有 22 个不同的可行序列,所以我们返回 22 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= n <= 104
  • \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, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false}", + "topicTags": [ + { + "name": "Memoization", + "slug": "memoization", + "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 distinctSequences(int n) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int distinctSequences(int n) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def distinctSequences(self, n):\n \"\"\"\n :type n: int\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def distinctSequences(self, n: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint distinctSequences(int n){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int DistinctSequences(int n) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @return {number}\n */\nvar distinctSequences = function(n) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @return {Integer}\ndef distinct_sequences(n)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func distinctSequences(_ n: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func distinctSequences(n int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def distinctSequences(n: Int): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun distinctSequences(n: Int): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn distinct_sequences(n: i32) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @return Integer\n */\n function distinctSequences($n) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function distinctSequences(n: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (distinct-sequences n)\n (-> exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec distinct_sequences(N :: integer()) -> integer().\ndistinct_sequences(N) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec distinct_sequences(n :: integer) :: integer\n def distinct_sequences(n) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"2.2K\", \"totalSubmission\": \"4K\", \"totalAcceptedRaw\": 2191, \"totalSubmissionRaw\": 3952, \"acRate\": \"55.4%\"}", + "hints": [ + "Can you think of a DP solution?", + "Consider a state that remembers the last 1 or 2 rolls.", + "Do you need to consider the last 3 rolls?" + ], + "solution": null, + "status": null, + "sampleTestCase": "4", + "metaData": "{\n \"name\": \"distinctSequences\",\n \"params\": [\n {\n \"name\": \"n\",\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 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 17\\u6807\\u51c6\\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 17<\\/code>\\u3002\\u53ef\\u4ee5\\u4f7f\\u7528Java 8\\u7684\\u7279\\u6027\\u4f8b\\u5982\\uff0clambda expressions \\u548c stream API\\u3002<\\/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 8.2<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n

\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O1<\\/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# 10<\\/a> \\u8fd0\\u884c\\u5728 .NET 6 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"

\\u7248\\u672c\\uff1aNode.js 16.13.2<\\/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<\\/a> \\u548c datastructures-js\\/queue<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/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.5.2<\\/code><\\/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.17<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/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 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

TypeScript 4.5.4<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2020<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/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 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "4\n2", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/selling-pieces-of-wood.json b/leetcode-cn/originData/selling-pieces-of-wood.json new file mode 100644 index 00000000..22e33ff1 --- /dev/null +++ b/leetcode-cn/originData/selling-pieces-of-wood.json @@ -0,0 +1,178 @@ +{ + "data": { + "question": { + "questionId": "1376", + "questionFrontendId": "2312", + "categoryTitle": "Algorithms", + "boundTopicId": 1607257, + "title": "Selling Pieces of Wood", + "titleSlug": "selling-pieces-of-wood", + "content": "

You are given two integers m and n that represent the height and width of a rectangular piece of wood. You are also given a 2D integer array prices, where prices[i] = [hi, wi, pricei] indicates you can sell a rectangular piece of wood of height hi and width wi for pricei dollars.

\n\n

To cut a piece of wood, you must make a vertical or horizontal cut across the entire height or width of the piece to split it into two smaller pieces. After cutting a piece of wood into some number of smaller pieces, you can sell pieces according to prices. You may sell multiple pieces of the same shape, and you do not have to sell all the shapes. The grain of the wood makes a difference, so you cannot rotate a piece to swap its height and width.

\n\n

Return the maximum money you can earn after cutting an m x n piece of wood.

\n\n

Note that you can cut the piece of wood as many times as you want.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: m = 3, n = 5, prices = [[1,4,2],[2,2,7],[2,1,3]]\nOutput: 19\nExplanation: The diagram above shows a possible scenario. It consists of:\n- 2 pieces of wood shaped 2 x 2, selling for a price of 2 * 7 = 14.\n- 1 piece of wood shaped 2 x 1, selling for a price of 1 * 3 = 3.\n- 1 piece of wood shaped 1 x 4, selling for a price of 1 * 2 = 2.\nThis obtains a total of 14 + 3 + 2 = 19 money earned.\nIt can be shown that 19 is the maximum amount of money that can be earned.\n
\n\n

Example 2:

\n\"\"\n
\nInput: m = 4, n = 6, prices = [[3,2,10],[1,4,2],[4,1,3]]\nOutput: 32\nExplanation: The diagram above shows a possible scenario. It consists of:\n- 3 pieces of wood shaped 3 x 2, selling for a price of 3 * 10 = 30.\n- 1 piece of wood shaped 1 x 4, selling for a price of 1 * 2 = 2.\nThis obtains a total of 30 + 2 = 32 money earned.\nIt can be shown that 32 is the maximum amount of money that can be earned.\nNotice that we cannot rotate the 1 x 4 piece of wood to obtain a 4 x 1 piece of wood.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= m, n <= 200
  • \n\t
  • 1 <= prices.length <= 2 * 104
  • \n\t
  • prices[i].length == 3
  • \n\t
  • 1 <= hi <= m
  • \n\t
  • 1 <= wi <= n
  • \n\t
  • 1 <= pricei <= 106
  • \n\t
  • All the shapes of wood (hi, wi) are pairwise distinct.
  • \n
\n", + "translatedTitle": "卖木头块", + "translatedContent": "

给你两个整数 m 和 n ,分别表示一块矩形木块的高和宽。同时给你一个二维整数数组 prices ,其中 prices[i] = [hi, wi, pricei] 表示你可以以 pricei 元的价格卖一块高为 hi 宽为 wi 的矩形木块。

\n\n

每一次操作中,你必须按下述方式之一执行切割操作,以得到两块更小的矩形木块:

\n\n
    \n\t
  • 沿垂直方向按高度 完全 切割木块,或
  • \n\t
  • 沿水平方向按宽度 完全 切割木块
  • \n
\n\n

在将一块木块切成若干小木块后,你可以根据 prices 卖木块。你可以卖多块同样尺寸的木块。你不需要将所有小木块都卖出去。你 不能 旋转切好后木块的高和宽。

\n\n

请你返回切割一块大小为 m x n 的木块后,能得到的 最多 钱数。

\n\n

注意你可以切割木块任意次。

\n\n

 

\n\n

示例 1:

\n\n

\"\"

\n\n
\n输入:m = 3, n = 5, prices = [[1,4,2],[2,2,7],[2,1,3]]\n输出:19\n解释:上图展示了一个可行的方案。包括:\n- 2 块 2 x 2 的小木块,售出 2 * 7 = 14 元。\n- 1 块 2 x 1 的小木块,售出 1 * 3 = 3 元。\n- 1 块 1 x 4 的小木块,售出 1 * 2 = 2 元。\n总共售出 14 + 3 + 2 = 19 元。\n19 元是最多能得到的钱数。\n
\n\n

示例 2:

\n\n

\"\"

\n\n
\n输入:m = 4, n = 6, prices = [[3,2,10],[1,4,2],[4,1,3]]\n输出:32\n解释:上图展示了一个可行的方案。包括:\n- 3 块 3 x 2 的小木块,售出 3 * 10 = 30 元。\n- 1 块 1 x 4 的小木块,售出 1 * 2 = 2 元。\n总共售出 30 + 2 = 32 元。\n32 元是最多能得到的钱数。\n注意我们不能旋转 1 x 4 的木块来得到 4 x 1 的木块。
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 1 <= m, n <= 200
  • \n\t
  • 1 <= prices.length <= 2 * 104
  • \n\t
  • prices[i].length == 3
  • \n\t
  • 1 <= hi <= m
  • \n\t
  • 1 <= wi <= n
  • \n\t
  • 1 <= pricei <= 106
  • \n\t
  • 所有 (hi, wi) 互不相同 。
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 37, + "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, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false}", + "topicTags": [ + { + "name": "Memoization", + "slug": "memoization", + "translatedName": "记忆化搜索", + "__typename": "TopicTagNode" + }, + { + "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 long long sellingWood(int m, int n, vector>& prices) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long sellingWood(int m, int n, int[][] prices) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def sellingWood(self, m, n, prices):\n \"\"\"\n :type m: int\n :type n: int\n :type prices: List[List[int]]\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def sellingWood(self, m: int, n: int, prices: List[List[int]]) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nlong long sellingWood(int m, int n, int** prices, int pricesSize, int* pricesColSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long SellingWood(int m, int n, int[][] prices) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} m\n * @param {number} n\n * @param {number[][]} prices\n * @return {number}\n */\nvar sellingWood = function(m, n, prices) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} m\n# @param {Integer} n\n# @param {Integer[][]} prices\n# @return {Integer}\ndef selling_wood(m, n, prices)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func sellingWood(_ m: Int, _ n: Int, _ prices: [[Int]]) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func sellingWood(m int, n int, prices [][]int) int64 {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def sellingWood(m: Int, n: Int, prices: Array[Array[Int]]): Long = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun sellingWood(m: Int, n: Int, prices: Array): Long {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn selling_wood(m: i32, n: i32, prices: Vec>) -> i64 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $m\n * @param Integer $n\n * @param Integer[][] $prices\n * @return Integer\n */\n function sellingWood($m, $n, $prices) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function sellingWood(m: number, n: number, prices: number[][]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (selling-wood m n prices)\n (-> exact-integer? exact-integer? (listof (listof exact-integer?)) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec selling_wood(M :: integer(), N :: integer(), Prices :: [[integer()]]) -> integer().\nselling_wood(M, N, Prices) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec selling_wood(m :: integer, n :: integer, prices :: [[integer]]) :: integer\n def selling_wood(m, n, prices) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"3.1K\", \"totalSubmission\": \"6.1K\", \"totalAcceptedRaw\": 3102, \"totalSubmissionRaw\": 6107, \"acRate\": \"50.8%\"}", + "hints": [ + "Note down the different actions that can be done on a piece of wood with dimensions m x n. What do you notice?", + "If possible, we could sell the m x n piece. We could also cut the piece vertically creating two pieces of size m x n1 and m x n2 where n1 + n2 = n, or horizontally creating two pieces of size m1 x n and m2 x n where m1 + m2 = m.", + "Notice that cutting a piece breaks the problem down into smaller subproblems, and selling the piece when available is also a case that terminates the process. Thus, we can use DP to efficiently solve this." + ], + "solution": null, + "status": null, + "sampleTestCase": "3\n5\n[[1,4,2],[2,2,7],[2,1,3]]", + "metaData": "{\n \"name\": \"sellingWood\",\n \"params\": [\n {\n \"name\": \"m\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"n\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"prices\"\n }\n ],\n \"return\": {\n \"type\": \"long\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "envInfo": "{\"cpp\":[\"C++\",\"

\\u7248\\u672c\\uff1aclang 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 17\\u6807\\u51c6\\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 17<\\/code>\\u3002\\u53ef\\u4ee5\\u4f7f\\u7528Java 8\\u7684\\u7279\\u6027\\u4f8b\\u5982\\uff0clambda expressions \\u548c stream API\\u3002<\\/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 8.2<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n

\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O1<\\/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# 10<\\/a> \\u8fd0\\u884c\\u5728 .NET 6 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"

\\u7248\\u672c\\uff1aNode.js 16.13.2<\\/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<\\/a> \\u548c datastructures-js\\/queue<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/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.5.2<\\/code><\\/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.17<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/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 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

TypeScript 4.5.4<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2020<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/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 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "3\n5\n[[1,4,2],[2,2,7],[2,1,3]]\n4\n6\n[[3,2,10],[1,4,2],[4,1,3]]", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/originData/sum-of-numbers-with-units-digit-k.json b/leetcode-cn/originData/sum-of-numbers-with-units-digit-k.json new file mode 100644 index 00000000..f8f2258f --- /dev/null +++ b/leetcode-cn/originData/sum-of-numbers-with-units-digit-k.json @@ -0,0 +1,183 @@ +{ + "data": { + "question": { + "questionId": "1334", + "questionFrontendId": "2310", + "categoryTitle": "Algorithms", + "boundTopicId": 1607128, + "title": "Sum of Numbers With Units Digit K", + "titleSlug": "sum-of-numbers-with-units-digit-k", + "content": "

Given two integers num and k, consider a set of positive integers with the following properties:

\n\n
    \n\t
  • The units digit of each integer is k.
  • \n\t
  • The sum of the integers is num.
  • \n
\n\n

Return the minimum possible size of such a set, or -1 if no such set exists.

\n\n

Note:

\n\n
    \n\t
  • The set can contain multiple instances of the same integer, and the sum of an empty set is considered 0.
  • \n\t
  • The units digit of a number is the rightmost digit of the number.
  • \n
\n\n

 

\n

Example 1:

\n\n
\nInput: num = 58, k = 9\nOutput: 2\nExplanation:\nOne valid set is [9,49], as the sum is 58 and each integer has a units digit of 9.\nAnother valid set is [19,39].\nIt can be shown that 2 is the minimum possible size of a valid set.\n
\n\n

Example 2:

\n\n
\nInput: num = 37, k = 2\nOutput: -1\nExplanation: It is not possible to obtain a sum of 37 using only integers that have a units digit of 2.\n
\n\n

Example 3:

\n\n
\nInput: num = 0, k = 7\nOutput: 0\nExplanation: The sum of an empty set is considered 0.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 0 <= num <= 3000
  • \n\t
  • 0 <= k <= 9
  • \n
\n", + "translatedTitle": "个位数字为 K 的整数之和", + "translatedContent": "

给你两个整数 numk ,考虑具有以下属性的正整数多重集:

\n\n
    \n\t
  • 每个整数个位数字都是 k
  • \n\t
  • 所有整数之和是 num
  • \n
\n\n

返回该多重集的最小大小,如果不存在这样的多重集,返回 -1

\n\n

注意:

\n\n
    \n\t
  • 多重集与集合类似,但多重集可以包含多个同一整数,空多重集的和为 0
  • \n\t
  • 个位数字 是数字最右边的数位。
  • \n
\n\n

 

\n\n

示例 1:

\n\n
\n输入:num = 58, k = 9\n输出:2\n解释:\n多重集 [9,49] 满足题目条件,和为 58 且每个整数的个位数字是 9 。\n另一个满足条件的多重集是 [19,39] 。\n可以证明 2 是满足题目条件的多重集的最小长度。\n
\n\n

示例 2:

\n\n
\n输入:num = 37, k = 2\n输出:-1\n解释:个位数字为 2 的整数无法相加得到 37 。
\n\n

示例 3:

\n\n
\n输入:num = 0, k = 7\n输出:0\n解释:空多重集的和为 0 。\n
\n\n

 

\n\n

提示:

\n\n
    \n\t
  • 0 <= num <= 3000
  • \n\t
  • 0 <= k <= 9
  • \n
\n", + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 13, + "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, \"ruby\": false, \"bash\": false, \"swift\": false, \"golang\": false, \"scala\": false, \"html\": false, \"pythonml\": false, \"kotlin\": false, \"rust\": false, \"php\": false, \"typescript\": false, \"racket\": false, \"erlang\": false, \"elixir\": false}", + "topicTags": [ + { + "name": "Greedy", + "slug": "greedy", + "translatedName": "贪心", + "__typename": "TopicTagNode" + }, + { + "name": "Math", + "slug": "math", + "translatedName": "数学", + "__typename": "TopicTagNode" + }, + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": "动态规划", + "__typename": "TopicTagNode" + }, + { + "name": "Enumeration", + "slug": "enumeration", + "translatedName": "枚举", + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int minimumNumbers(int num, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int minimumNumbers(int num, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def minimumNumbers(self, num, k):\n \"\"\"\n :type num: int\n :type k: int\n :rtype: int\n \"\"\"", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def minimumNumbers(self, num: int, k: int) -> int:", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint minimumNumbers(int num, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MinimumNumbers(int num, int k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} num\n * @param {number} k\n * @return {number}\n */\nvar minimumNumbers = function(num, k) {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} num\n# @param {Integer} k\n# @return {Integer}\ndef minimum_numbers(num, k)\n\nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func minimumNumbers(_ num: Int, _ k: Int) -> Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func minimumNumbers(num int, k int) int {\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def minimumNumbers(num: Int, k: Int): Int = {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun minimumNumbers(num: Int, k: Int): Int {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn minimum_numbers(num: i32, k: i32) -> i32 {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $num\n * @param Integer $k\n * @return Integer\n */\n function minimumNumbers($num, $k) {\n\n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function minimumNumbers(num: number, k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (minimum-numbers num k)\n (-> exact-integer? exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec minimum_numbers(Num :: integer(), K :: integer()) -> integer().\nminimum_numbers(Num, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec minimum_numbers(num :: integer, k :: integer) :: integer\n def minimum_numbers(num, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"6.7K\", \"totalSubmission\": \"26K\", \"totalAcceptedRaw\": 6691, \"totalSubmissionRaw\": 26040, \"acRate\": \"25.7%\"}", + "hints": [ + "Try solving this recursively.", + "Create a method that takes an integer x as a parameter. This method returns the minimum possible size of a set where each number has units digit k and the sum of the numbers in the set is x." + ], + "solution": null, + "status": null, + "sampleTestCase": "58\n9", + "metaData": "{\n \"name\": \"minimumNumbers\",\n \"params\": [\n {\n \"name\": \"num\",\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 11<\\/code> \\u91c7\\u7528\\u6700\\u65b0C++ 17\\u6807\\u51c6\\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 17<\\/code>\\u3002\\u53ef\\u4ee5\\u4f7f\\u7528Java 8\\u7684\\u7279\\u6027\\u4f8b\\u5982\\uff0clambda expressions \\u548c stream API\\u3002<\\/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 8.2<\\/code>\\uff0c\\u91c7\\u7528GNU11\\u6807\\u51c6\\u3002<\\/p>\\r\\n\\r\\n

\\u7f16\\u8bd1\\u65f6\\uff0c\\u5c06\\u4f1a\\u91c7\\u7528-O1<\\/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# 10<\\/a> \\u8fd0\\u884c\\u5728 .NET 6 \\u4e0a<\\/p>\"],\"javascript\":[\"JavaScript\",\"

\\u7248\\u672c\\uff1aNode.js 16.13.2<\\/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<\\/a> \\u548c datastructures-js\\/queue<\\/a>\\u3002<\\/p>\"],\"ruby\":[\"Ruby\",\"

\\u4f7f\\u7528Ruby 3.1<\\/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.5.2<\\/code><\\/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.17<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 https:\\/\\/godoc.org\\/github.com\\/emirpasic\\/gods<\\/a> \\u7b2c\\u4e09\\u65b9\\u5e93\\u3002<\\/p>\"],\"python3\":[\"Python3\",\"

\\u7248\\u672c\\uff1aPython 3.10<\\/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 2.13<\\/code><\\/p>\"],\"kotlin\":[\"Kotlin\",\"

\\u7248\\u672c\\uff1aKotlin 1.3.10<\\/code><\\/p>\"],\"rust\":[\"Rust\",\"

\\u7248\\u672c\\uff1arust 1.58.1<\\/code><\\/p>\\r\\n\\r\\n

\\u652f\\u6301 crates.io \\u7684 rand<\\/a><\\/p>\"],\"php\":[\"PHP\",\"

PHP 8.1<\\/code>.<\\/p>\\r\\n\\r\\n

With bcmath module.<\\/p>\"],\"typescript\":[\"TypeScript\",\"

TypeScript 4.5.4<\\/p>\\r\\n\\r\\n

Compile Options: --alwaysStrict --strictBindCallApply --strictFunctionTypes --target ES2020<\\/p>\"],\"racket\":[\"Racket\",\"

Racket CS<\\/a> v8.3<\\/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 24.2\"],\"elixir\":[\"Elixir\",\"Elixir 1.13.0 with Erlang\\/OTP 24.2\"]}", + "book": null, + "isSubscribed": false, + "isDailyQuestion": false, + "dailyRecordStatus": null, + "editorType": "CKEDITOR", + "ugcQuestionId": null, + "style": "LEETCODE", + "exampleTestcases": "58\n9\n37\n2\n0\n7", + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode-cn/problem (Chinese)/不同骰子序列的数目 [number-of-distinct-roll-sequences].html b/leetcode-cn/problem (Chinese)/不同骰子序列的数目 [number-of-distinct-roll-sequences].html new file mode 100644 index 00000000..ad9df3b7 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/不同骰子序列的数目 [number-of-distinct-roll-sequences].html @@ -0,0 +1,41 @@ +

给你一个整数 n 。你需要掷一个 6 面的骰子 n 次。请你在满足以下要求的前提下,求出 不同 骰子序列的数目:

+ +
    +
  1. 序列中任意 相邻 数字的 最大公约数 为 1 。
  2. +
  3. 序列中 相等 的值之间,至少有 2 个其他值的数字。正式地,如果第 i 次掷骰子的值 等于 第 j 次的值,那么 abs(i - j) > 2 。
  4. +
+ +

请你返回不同序列的 总数目 。由于答案可能很大,请你将答案对 109 + 7 取余 后返回。

+ +

如果两个序列中至少有一个元素不同,那么它们被视为不同的序列。

+ +

 

+ +

示例 1:

+ +
+输入:n = 4
+输出:184
+解释:一些可行的序列为 (1, 2, 3, 4) ,(6, 1, 2, 3) ,(1, 2, 3, 1) 等等。
+一些不可行的序列为 (1, 2, 1, 3) ,(1, 2, 3, 6) 。
+(1, 2, 1, 3) 是不可行的,因为第一个和第三个骰子值相等且 abs(1 - 3) = 2 (下标从 1 开始表示)。
+(1, 2, 3, 6) i是不可行的,因为 3 和 6 的最大公约数是 3 。
+总共有 184 个不同的可行序列,所以我们返回 184 。
+ +

示例 2:

+ +
+输入:n = 2
+输出:22
+解释:一些可行的序列为 (1, 2) ,(2, 1) ,(3, 2) 。
+一些不可行的序列为 (3, 6) ,(2, 4) ,因为最大公约数不为 1 。
+总共有 22 个不同的可行序列,所以我们返回 22 。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= n <= 104
  • +
diff --git a/leetcode-cn/problem (Chinese)/个位数字为 K 的整数之和 [sum-of-numbers-with-units-digit-k].html b/leetcode-cn/problem (Chinese)/个位数字为 K 的整数之和 [sum-of-numbers-with-units-digit-k].html new file mode 100644 index 00000000..fbcc1919 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/个位数字为 K 的整数之和 [sum-of-numbers-with-units-digit-k].html @@ -0,0 +1,52 @@ +

给你两个整数 numk ,考虑具有以下属性的正整数多重集:

+ +
    +
  • 每个整数个位数字都是 k
  • +
  • 所有整数之和是 num
  • +
+ +

返回该多重集的最小大小,如果不存在这样的多重集,返回 -1

+ +

注意:

+ +
    +
  • 多重集与集合类似,但多重集可以包含多个同一整数,空多重集的和为 0
  • +
  • 个位数字 是数字最右边的数位。
  • +
+ +

 

+ +

示例 1:

+ +
+输入:num = 58, k = 9
+输出:2
+解释:
+多重集 [9,49] 满足题目条件,和为 58 且每个整数的个位数字是 9 。
+另一个满足条件的多重集是 [19,39] 。
+可以证明 2 是满足题目条件的多重集的最小长度。
+
+ +

示例 2:

+ +
+输入:num = 37, k = 2
+输出:-1
+解释:个位数字为 2 的整数无法相加得到 37 。
+ +

示例 3:

+ +
+输入:num = 0, k = 7
+输出:0
+解释:空多重集的和为 0 。
+
+ +

 

+ +

提示:

+ +
    +
  • 0 <= num <= 3000
  • +
  • 0 <= k <= 9
  • +
diff --git a/leetcode-cn/problem (Chinese)/从树中删除边的最小分数 [minimum-score-after-removals-on-a-tree].html b/leetcode-cn/problem (Chinese)/从树中删除边的最小分数 [minimum-score-after-removals-on-a-tree].html new file mode 100644 index 00000000..713a614d --- /dev/null +++ b/leetcode-cn/problem (Chinese)/从树中删除边的最小分数 [minimum-score-after-removals-on-a-tree].html @@ -0,0 +1,57 @@ +

存在一棵无向连通树,树中有编号从 0n - 1n 个节点, 以及 n - 1 条边。

+ +

给你一个下标从 0 开始的整数数组 nums ,长度为 n ,其中 nums[i] 表示第 i 个节点的值。另给你一个二维整数数组 edges ,长度为 n - 1 ,其中 edges[i] = [ai, bi] 表示树中存在一条位于节点 aibi 之间的边。

+ +

删除树中两条 不同 的边以形成三个连通组件。对于一种删除边方案,定义如下步骤以计算其分数:

+ +
    +
  1. 分别获取三个组件 每个 组件中所有节点值的异或值。
  2. +
  3. 最大 异或值和 最小 异或值的 差值 就是这一种删除边方案的分数。
  4. +
+ +
    +
  • 例如,三个组件的节点值分别是:[4,5,7][1,9][3,3,3] 。三个异或值分别是 4 ^ 5 ^ 7 = 61 ^ 9 = 83 ^ 3 ^ 3 = 3 。最大异或值是 8 ,最小异或值是 3 ,分数是 8 - 3 = 5
  • +
+ +

返回在给定树上执行任意删除边方案可能的 最小 分数。

+ +

 

+ +

示例 1:

+ +
输入:nums = [1,5,5,4,11], edges = [[0,1],[1,2],[1,3],[3,4]]
+输出:9
+解释:上图展示了一种删除边方案。
+- 第 1 个组件的节点是 [1,3,4] ,值是 [5,4,11] 。异或值是 5 ^ 4 ^ 11 = 10 。
+- 第 2 个组件的节点是 [0] ,值是 [1] 。异或值是 1 = 1 。
+- 第 3 个组件的节点是 [2] ,值是 [5] 。异或值是 5 = 5 。
+分数是最大异或值和最小异或值的差值,10 - 1 = 9 。
+可以证明不存在分数比 9 小的删除边方案。
+
+ +

示例 2:

+ +
输入:nums = [5,5,2,4,4,2], edges = [[0,1],[1,2],[5,2],[4,3],[1,3]]
+输出:0
+解释:上图展示了一种删除边方案。
+- 第 1 个组件的节点是 [3,4] ,值是 [4,4] 。异或值是 4 ^ 4 = 0 。
+- 第 2 个组件的节点是 [1,0] ,值是 [5,5] 。异或值是 5 ^ 5 = 0 。
+- 第 3 个组件的节点是 [2,5] ,值是 [2,2] 。异或值是 2 ^ 2 = 0 。
+分数是最大异或值和最小异或值的差值,0 - 0 = 0 。
+无法获得比 0 更小的分数 0 。
+
+ +

 

+ +

提示:

+ +
    +
  • n == nums.length
  • +
  • 3 <= n <= 1000
  • +
  • 1 <= nums[i] <= 108
  • +
  • edges.length == n - 1
  • +
  • edges[i].length == 2
  • +
  • 0 <= ai, bi < n
  • +
  • ai != bi
  • +
  • edges 表示一棵有效的树
  • +
diff --git a/leetcode-cn/problem (Chinese)/兼具大小写的最好英文字母 [greatest-english-letter-in-upper-and-lower-case].html b/leetcode-cn/problem (Chinese)/兼具大小写的最好英文字母 [greatest-english-letter-in-upper-and-lower-case].html new file mode 100644 index 00000000..2f240e56 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/兼具大小写的最好英文字母 [greatest-english-letter-in-upper-and-lower-case].html @@ -0,0 +1,43 @@ +

给你一个由英文字母组成的字符串 s ,请你找出并返回 s 中的 最好 英文字母。返回的字母必须为大写形式。如果不存在满足条件的字母,则返回一个空字符串。

+ +

最好 英文字母的大写和小写形式必须 s 中出现。

+ +

英文字母 b 比另一个英文字母 a 更好 的前提是:英文字母表中,ba 出现。

+ +

 

+ +

示例 1:

+ +
+输入:s = "lEeTcOdE"
+输出:"E"
+解释:
+字母 'E' 是唯一一个大写和小写形式都出现的字母。
+ +

示例 2:

+ +
+输入:s = "arRAzFif"
+输出:"R"
+解释:
+字母 'R' 是大写和小写形式都出现的最好英文字母。
+注意 'A' 和 'F' 的大写和小写形式也都出现了,但是 'R' 比 'F' 和 'A' 更好。
+
+ +

示例 3:

+ +
+输入:s = "AbCdEfGhIjK"
+输出:""
+解释:
+不存在大写和小写形式都出现的字母。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= s.length <= 1000
  • +
  • s 由小写和大写英文字母组成
  • +
diff --git a/leetcode-cn/problem (Chinese)/判断矩阵是否是一个 X 矩阵 [check-if-matrix-is-x-matrix].html b/leetcode-cn/problem (Chinese)/判断矩阵是否是一个 X 矩阵 [check-if-matrix-is-x-matrix].html new file mode 100644 index 00000000..0bea056c --- /dev/null +++ b/leetcode-cn/problem (Chinese)/判断矩阵是否是一个 X 矩阵 [check-if-matrix-is-x-matrix].html @@ -0,0 +1,38 @@ +

如果一个正方形矩阵满足下述 全部 条件,则称之为一个 X 矩阵

+ +
    +
  1. 矩阵对角线上的所有元素都 不是 0
  2. +
  3. 矩阵中所有其他元素都是 0
  4. +
+ +

给你一个大小为 n x n 的二维整数数组 grid ,表示一个正方形矩阵。如果 grid 是一个 X 矩阵 ,返回 true ;否则,返回 false

+ +

 

+ +

示例 1:

+ +
输入:grid = [[2,0,0,1],[0,3,1,0],[0,5,2,0],[4,0,0,2]]
+输出:true
+解释:矩阵如上图所示。
+X 矩阵应该满足:绿色元素(对角线上)都不是 0 ,红色元素都是 0 。
+因此,grid 是一个 X 矩阵。
+
+ +

示例 2:

+ +
输入:grid = [[5,7,0],[0,3,1],[0,5,0]]
+输出:false
+解释:矩阵如上图所示。
+X 矩阵应该满足:绿色元素(对角线上)都不是 0 ,红色元素都是 0 。
+因此,grid 不是一个 X 矩阵。
+
+ +

 

+ +

提示:

+ +
    +
  • n == grid.length == grid[i].length
  • +
  • 3 <= n <= 100
  • +
  • 0 <= grid[i][j] <= 105
  • +
diff --git a/leetcode-cn/problem (Chinese)/卖木头块 [selling-pieces-of-wood].html b/leetcode-cn/problem (Chinese)/卖木头块 [selling-pieces-of-wood].html new file mode 100644 index 00000000..da3c58f9 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/卖木头块 [selling-pieces-of-wood].html @@ -0,0 +1,59 @@ +

给你两个整数 m 和 n ,分别表示一块矩形木块的高和宽。同时给你一个二维整数数组 prices ,其中 prices[i] = [hi, wi, pricei] 表示你可以以 pricei 元的价格卖一块高为 hi 宽为 wi 的矩形木块。

+ +

每一次操作中,你必须按下述方式之一执行切割操作,以得到两块更小的矩形木块:

+ +
    +
  • 沿垂直方向按高度 完全 切割木块,或
  • +
  • 沿水平方向按宽度 完全 切割木块
  • +
+ +

在将一块木块切成若干小木块后,你可以根据 prices 卖木块。你可以卖多块同样尺寸的木块。你不需要将所有小木块都卖出去。你 不能 旋转切好后木块的高和宽。

+ +

请你返回切割一块大小为 m x n 的木块后,能得到的 最多 钱数。

+ +

注意你可以切割木块任意次。

+ +

 

+ +

示例 1:

+ +

+ +
+输入:m = 3, n = 5, prices = [[1,4,2],[2,2,7],[2,1,3]]
+输出:19
+解释:上图展示了一个可行的方案。包括:
+- 2 块 2 x 2 的小木块,售出 2 * 7 = 14 元。
+- 1 块 2 x 1 的小木块,售出 1 * 3 = 3 元。
+- 1 块 1 x 4 的小木块,售出 1 * 2 = 2 元。
+总共售出 14 + 3 + 2 = 19 元。
+19 元是最多能得到的钱数。
+
+ +

示例 2:

+ +

+ +
+输入:m = 4, n = 6, prices = [[3,2,10],[1,4,2],[4,1,3]]
+输出:32
+解释:上图展示了一个可行的方案。包括:
+- 3 块 3 x 2 的小木块,售出 3 * 10 = 30 元。
+- 1 块 1 x 4 的小木块,售出 1 * 2 = 2 元。
+总共售出 30 + 2 = 32 元。
+32 元是最多能得到的钱数。
+注意我们不能旋转 1 x 4 的木块来得到 4 x 1 的木块。
+ +

 

+ +

提示:

+ +
    +
  • 1 <= m, n <= 200
  • +
  • 1 <= prices.length <= 2 * 104
  • +
  • prices[i].length == 3
  • +
  • 1 <= hi <= m
  • +
  • 1 <= wi <= n
  • +
  • 1 <= pricei <= 106
  • +
  • 所有 (hi, wi) 互不相同 。
  • +
diff --git a/leetcode-cn/problem (Chinese)/小于等于 K 的最长二进制子序列 [longest-binary-subsequence-less-than-or-equal-to-k].html b/leetcode-cn/problem (Chinese)/小于等于 K 的最长二进制子序列 [longest-binary-subsequence-less-than-or-equal-to-k].html new file mode 100644 index 00000000..69bb9d83 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/小于等于 K 的最长二进制子序列 [longest-binary-subsequence-less-than-or-equal-to-k].html @@ -0,0 +1,40 @@ +

给你一个二进制字符串 s 和一个正整数 k 。

+ +

请你返回 s 的 最长 子序列,且该子序列对应的 二进制 数字小于等于 k 。

+ +

注意:

+ +
    +
  • 子序列可以有 前导 0 。
  • +
  • 空字符串视为 0 。
  • +
  • 子序列 是指从一个字符串中删除零个或者多个字符后,不改变顺序得到的剩余字符序列。
  • +
+ +

 

+ +

示例 1:

+ +
输入:s = "1001010", k = 5
+输出:5
+解释:s 中小于等于 5 的最长子序列是 "00010" ,对应的十进制数字是 2 。
+注意 "00100" 和 "00101" 也是可行的最长子序列,十进制分别对应 4 和 5 。
+最长子序列的长度为 5 ,所以返回 5 。
+
+ +

示例 2:

+ +
输入:s = "00101001", k = 1
+输出:6
+解释:"000001" 是 s 中小于等于 1 的最长子序列,对应的十进制数字是 1 。
+最长子序列的长度为 6 ,所以返回 6 。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= s.length <= 1000
  • +
  • s[i] 要么是 '0' ,要么是 '1'
  • +
  • 1 <= k <= 109
  • +
diff --git a/leetcode-cn/problem (Chinese)/拼接数组的最大分数 [maximum-score-of-spliced-array].html b/leetcode-cn/problem (Chinese)/拼接数组的最大分数 [maximum-score-of-spliced-array].html new file mode 100644 index 00000000..a9ad290a --- /dev/null +++ b/leetcode-cn/problem (Chinese)/拼接数组的最大分数 [maximum-score-of-spliced-array].html @@ -0,0 +1,53 @@ +

给你两个下标从 0 开始的整数数组 nums1nums2 ,长度都是 n

+ +

你可以选择两个整数 leftright ,其中 0 <= left <= right < n ,接着 交换 两个子数组 nums1[left...right]nums2[left...right]

+ +
    +
  • 例如,设 nums1 = [1,2,3,4,5]nums2 = [11,12,13,14,15] ,整数选择 left = 1right = 2,那么 nums1 会变为 [1,12,13,4,5]nums2 会变为 [11,2,3,14,15]
  • +
+ +

你可以选择执行上述操作 一次 或不执行任何操作。

+ +

数组的 分数sum(nums1)sum(nums2) 中的最大值,其中 sum(arr) 是数组 arr 中所有元素之和。

+ +

返回 可能的最大分数

+ +

子数组 是数组中连续的一个元素序列。arr[left...right] 表示子数组包含 nums 中下标 leftright 之间的元素(含 下标 leftright 对应元素

+ +

 

+ +

示例 1:

+ +
+输入:nums1 = [60,60,60], nums2 = [10,90,10]
+输出:210
+解释:选择 left = 1 和 right = 1 ,得到 nums1 = [60,90,60] 和 nums2 = [10,60,10] 。
+分数为 max(sum(nums1), sum(nums2)) = max(210, 80) = 210 。
+ +

示例 2:

+ +
+输入:nums1 = [20,40,20,70,30], nums2 = [50,20,50,40,20]
+输出:220
+解释:选择 left = 3 和 right = 4 ,得到 nums1 = [20,40,20,40,20] 和 nums2 = [50,20,50,70,30] 。
+分数为 max(sum(nums1), sum(nums2)) = max(140, 220) = 220 。
+
+ +

示例 3:

+ +
+输入:nums1 = [7,11,13], nums2 = [1,1,1]
+输出:31
+解释:选择不交换任何子数组。
+分数为 max(sum(nums1), sum(nums2)) = max(31, 3) = 31 。
+
+ +

 

+ +

提示:

+ +
    +
  • n == nums1.length == nums2.length
  • +
  • 1 <= n <= 105
  • +
  • 1 <= nums1[i], nums2[i] <= 104
  • +
diff --git a/leetcode-cn/problem (Chinese)/操作后的最大异或和 [maximum-xor-after-operations].html b/leetcode-cn/problem (Chinese)/操作后的最大异或和 [maximum-xor-after-operations].html new file mode 100644 index 00000000..bf2ffa32 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/操作后的最大异或和 [maximum-xor-after-operations].html @@ -0,0 +1,33 @@ +

给你一个下标从 0 开始的整数数组 nums 。一次操作中,选择 任意 非负整数 x 和一个下标 i ,更新 nums[i] 为 nums[i] AND (nums[i] XOR x) 。

+ +

注意,AND 是逐位与运算,XOR 是逐位异或运算。

+ +

请你执行 任意次 更新操作,并返回 nums 中所有元素 最大 逐位异或和。

+ +

 

+ +

示例 1:

+ +
输入:nums = [3,2,4,6]
+输出:7
+解释:选择 x = 4 和 i = 3 进行操作,num[3] = 6 AND (6 XOR 4) = 6 AND 2 = 2 。
+现在,nums = [3, 2, 4, 2] 且所有元素逐位异或得到 3 XOR 2 XOR 4 XOR 2 = 7 。
+可知 7 是能得到的最大逐位异或和。
+注意,其他操作可能也能得到逐位异或和 7 。
+ +

示例 2:

+ +
输入:nums = [1,2,3,9,2]
+输出:11
+解释:执行 0 次操作。
+所有元素的逐位异或和为 1 XOR 2 XOR 3 XOR 9 XOR 2 = 11 。
+可知 11 是能得到的最大逐位异或和。
+ +

 

+ +

提示:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 0 <= nums[i] <= 108
  • +
diff --git a/leetcode-cn/problem (Chinese)/统计放置房子的方式数 [count-number-of-ways-to-place-houses].html b/leetcode-cn/problem (Chinese)/统计放置房子的方式数 [count-number-of-ways-to-place-houses].html new file mode 100644 index 00000000..59bd965b --- /dev/null +++ b/leetcode-cn/problem (Chinese)/统计放置房子的方式数 [count-number-of-ways-to-place-houses].html @@ -0,0 +1,34 @@ +

一条街道上共有 n * 2地块 ,街道的两侧各有 n 个地块。每一边的地块都按从 1n 编号。每个地块上都可以放置一所房子。

+ +

现要求街道同一侧不能存在两所房子相邻的情况,请你计算并返回放置房屋的方式数目。由于答案可能很大,需要对 109 + 7 取余后再返回。

+ +

注意,如果一所房子放置在这条街某一侧上的第 i 个地块,不影响在另一侧的第 i 个地块放置房子。

+ +

 

+ +

示例 1:

+ +
输入:n = 1
+输出:4
+解释:
+可能的放置方式:
+1. 所有地块都不放置房子。
+2. 一所房子放在街道的某一侧。
+3. 一所房子放在街道的另一侧。
+4. 放置两所房子,街道两侧各放置一所。
+
+ +

示例 2:

+ +
输入:n = 2
+输出:9
+解释:如上图所示,共有 9 种可能的放置方式。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= n <= 104
  • +
diff --git a/leetcode-cn/problem (Chinese)/统计无向图中无法互相到达点对数 [count-unreachable-pairs-of-nodes-in-an-undirected-graph].html b/leetcode-cn/problem (Chinese)/统计无向图中无法互相到达点对数 [count-unreachable-pairs-of-nodes-in-an-undirected-graph].html new file mode 100644 index 00000000..c7d53c98 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/统计无向图中无法互相到达点对数 [count-unreachable-pairs-of-nodes-in-an-undirected-graph].html @@ -0,0 +1,38 @@ +

给你一个整数 n ,表示一张 无向图 中有 n 个节点,编号为 0 到 n - 1 。同时给你一个二维整数数组 edges ,其中 edges[i] = [ai, bi] 表示节点 ai 和 bi 之间有一条 无向 边。

+ +

请你返回 无法互相到达 的不同 点对数目 。

+ +

 

+ +

示例 1:

+ +

+ +
输入:n = 3, edges = [[0,1],[0,2],[1,2]]
+输出:0
+解释:所有点都能互相到达,意味着没有点对无法互相到达,所以我们返回 0 。
+
+ +

示例 2:

+ +

+ +
输入:n = 7, edges = [[0,2],[0,5],[2,4],[1,6],[5,4]]
+输出:14
+解释:总共有 14 个点对互相无法到达:
+[[0,1],[0,3],[0,6],[1,2],[1,3],[1,4],[1,5],[2,3],[2,6],[3,4],[3,5],[3,6],[4,6],[5,6]]
+所以我们返回 14 。
+
+ +

 

+ +

提示:

+ +
    +
  • 1 <= n <= 105
  • +
  • 0 <= edges.length <= 2 * 105
  • +
  • edges[i].length == 2
  • +
  • 0 <= ai, bi < n
  • +
  • ai != bi
  • +
  • 不会有重复边。
  • +
diff --git a/leetcode-cn/problem (Chinese)/统计星号 [count-asterisks].html b/leetcode-cn/problem (Chinese)/统计星号 [count-asterisks].html new file mode 100644 index 00000000..a3cf8b22 --- /dev/null +++ b/leetcode-cn/problem (Chinese)/统计星号 [count-asterisks].html @@ -0,0 +1,39 @@ +

给你一个字符串 s ,每 两个 连续竖线 '|' 为 一对 。换言之,第一个和第二个 '|' 为一对,第三个和第四个 '|' 为一对,以此类推。

+ +

请你返回 不在 竖线对之间,s 中 '*' 的数目。

+ +

注意,每个竖线 '|' 都会 恰好 属于一个对。

+ +

 

+ +

示例 1:

+ +
输入:s = "l|*e*et|c**o|*de|"
+输出:2
+解释:不在竖线对之间的字符加粗加斜体后,得到字符串:"l|*e*et|c**o|*de|" 。
+第一和第二条竖线 '|' 之间的字符不计入答案。
+同时,第三条和第四条竖线 '|' 之间的字符也不计入答案。
+不在竖线对之间总共有 2 个星号,所以我们返回 2 。
+ +

示例 2:

+ +
输入:s = "iamprogrammer"
+输出:0
+解释:在这个例子中,s 中没有星号。所以返回 0 。
+
+ +

示例 3:

+ +
输入:s = "yo|uar|e**|b|e***au|tifu|l"
+输出:5
+解释:需要考虑的字符加粗加斜体后:"yo|uar|e**|b|e***au|tifu|l" 。不在竖线对之间总共有 5 个星号。所以我们返回 5 。
+ +

 

+ +

提示:

+ +
    +
  • 1 <= s.length <= 1000
  • +
  • s 只包含小写英文字母,竖线 '|' 和星号 '*' 。
  • +
  • s 包含 偶数 个竖线 '|'
  • +
diff --git a/leetcode-cn/problem (English)/不同骰子序列的数目(English) [number-of-distinct-roll-sequences].html b/leetcode-cn/problem (English)/不同骰子序列的数目(English) [number-of-distinct-roll-sequences].html new file mode 100644 index 00000000..ea75360f --- /dev/null +++ b/leetcode-cn/problem (English)/不同骰子序列的数目(English) [number-of-distinct-roll-sequences].html @@ -0,0 +1,39 @@ +

You are given an integer n. You roll a fair 6-sided dice n times. Determine the total number of distinct sequences of rolls possible such that the following conditions are satisfied:

+ +
    +
  1. The greatest common divisor of any adjacent values in the sequence is equal to 1.
  2. +
  3. There is at least a gap of 2 rolls between equal valued rolls. More formally, if the value of the ith roll is equal to the value of the jth roll, then abs(i - j) > 2.
  4. +
+ +

Return the total number of distinct sequences possible. Since the answer may be very large, return it modulo 109 + 7.

+ +

Two sequences are considered distinct if at least one element is different.

+ +

 

+

Example 1:

+ +
+Input: n = 4
+Output: 184
+Explanation: Some of the possible sequences are (1, 2, 3, 4), (6, 1, 2, 3), (1, 2, 3, 1), etc.
+Some invalid sequences are (1, 2, 1, 3), (1, 2, 3, 6).
+(1, 2, 1, 3) is invalid since the first and third roll have an equal value and abs(1 - 3) = 2 (i and j are 1-indexed).
+(1, 2, 3, 6) is invalid since the greatest common divisor of 3 and 6 = 3.
+There are a total of 184 distinct sequences possible, so we return 184.
+ +

Example 2:

+ +
+Input: n = 2
+Output: 22
+Explanation: Some of the possible sequences are (1, 2), (2, 1), (3, 2).
+Some invalid sequences are (3, 6), (2, 4) since the greatest common divisor is not equal to 1.
+There are a total of 22 distinct sequences possible, so we return 22.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 104
  • +
diff --git a/leetcode-cn/problem (English)/个位数字为 K 的整数之和(English) [sum-of-numbers-with-units-digit-k].html b/leetcode-cn/problem (English)/个位数字为 K 的整数之和(English) [sum-of-numbers-with-units-digit-k].html new file mode 100644 index 00000000..4c64c408 --- /dev/null +++ b/leetcode-cn/problem (English)/个位数字为 K 的整数之和(English) [sum-of-numbers-with-units-digit-k].html @@ -0,0 +1,51 @@ +

Given two integers num and k, consider a set of positive integers with the following properties:

+ +
    +
  • The units digit of each integer is k.
  • +
  • The sum of the integers is num.
  • +
+ +

Return the minimum possible size of such a set, or -1 if no such set exists.

+ +

Note:

+ +
    +
  • The set can contain multiple instances of the same integer, and the sum of an empty set is considered 0.
  • +
  • The units digit of a number is the rightmost digit of the number.
  • +
+ +

 

+

Example 1:

+ +
+Input: num = 58, k = 9
+Output: 2
+Explanation:
+One valid set is [9,49], as the sum is 58 and each integer has a units digit of 9.
+Another valid set is [19,39].
+It can be shown that 2 is the minimum possible size of a valid set.
+
+ +

Example 2:

+ +
+Input: num = 37, k = 2
+Output: -1
+Explanation: It is not possible to obtain a sum of 37 using only integers that have a units digit of 2.
+
+ +

Example 3:

+ +
+Input: num = 0, k = 7
+Output: 0
+Explanation: The sum of an empty set is considered 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= num <= 3000
  • +
  • 0 <= k <= 9
  • +
diff --git a/leetcode-cn/problem (English)/从树中删除边的最小分数(English) [minimum-score-after-removals-on-a-tree].html b/leetcode-cn/problem (English)/从树中删除边的最小分数(English) [minimum-score-after-removals-on-a-tree].html new file mode 100644 index 00000000..3f9427e2 --- /dev/null +++ b/leetcode-cn/problem (English)/从树中删除边的最小分数(English) [minimum-score-after-removals-on-a-tree].html @@ -0,0 +1,57 @@ +

There is an undirected connected tree with n nodes labeled from 0 to n - 1 and n - 1 edges.

+ +

You are given a 0-indexed integer array nums of length n where nums[i] represents the value of the ith node. You are also given a 2D integer array edges of length n - 1 where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the tree.

+ +

Remove two distinct edges of the tree to form three connected components. For a pair of removed edges, the following steps are defined:

+ +
    +
  1. Get the XOR of all the values of the nodes for each of the three components respectively.
  2. +
  3. The difference between the largest XOR value and the smallest XOR value is the score of the pair.
  4. +
+ +
    +
  • For example, say the three components have the node values: [4,5,7], [1,9], and [3,3,3]. The three XOR values are 4 ^ 5 ^ 7 = 6, 1 ^ 9 = 8, and 3 ^ 3 ^ 3 = 3. The largest XOR value is 8 and the smallest XOR value is 3. The score is then 8 - 3 = 5.
  • +
+ +

Return the minimum score of any possible pair of edge removals on the given tree.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,5,5,4,11], edges = [[0,1],[1,2],[1,3],[3,4]]
+Output: 9
+Explanation: The diagram above shows a way to make a pair of removals.
+- The 1st component has nodes [1,3,4] with values [5,4,11]. Its XOR value is 5 ^ 4 ^ 11 = 10.
+- The 2nd component has node [0] with value [1]. Its XOR value is 1 = 1.
+- The 3rd component has node [2] with value [5]. Its XOR value is 5 = 5.
+The score is the difference between the largest and smallest XOR value which is 10 - 1 = 9.
+It can be shown that no other pair of removals will obtain a smaller score than 9.
+
+ +

Example 2:

+ +
+Input: nums = [5,5,2,4,4,2], edges = [[0,1],[1,2],[5,2],[4,3],[1,3]]
+Output: 0
+Explanation: The diagram above shows a way to make a pair of removals.
+- The 1st component has nodes [3,4] with values [4,4]. Its XOR value is 4 ^ 4 = 0.
+- The 2nd component has nodes [1,0] with values [5,5]. Its XOR value is 5 ^ 5 = 0.
+- The 3rd component has nodes [2,5] with values [2,2]. Its XOR value is 2 ^ 2 = 0.
+The score is the difference between the largest and smallest XOR value which is 0 - 0 = 0.
+We cannot obtain a smaller score than 0.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
  • +
  • 3 <= n <= 1000
  • +
  • 1 <= nums[i] <= 108
  • +
  • edges.length == n - 1
  • +
  • edges[i].length == 2
  • +
  • 0 <= ai, bi < n
  • +
  • ai != bi
  • +
  • edges represents a valid tree.
  • +
diff --git a/leetcode-cn/problem (English)/兼具大小写的最好英文字母(English) [greatest-english-letter-in-upper-and-lower-case].html b/leetcode-cn/problem (English)/兼具大小写的最好英文字母(English) [greatest-english-letter-in-upper-and-lower-case].html new file mode 100644 index 00000000..be730375 --- /dev/null +++ b/leetcode-cn/problem (English)/兼具大小写的最好英文字母(English) [greatest-english-letter-in-upper-and-lower-case].html @@ -0,0 +1,40 @@ +

Given a string of English letters s, return the greatest English letter which occurs as both a lowercase and uppercase letter in s. The returned letter should be in uppercase. If no such letter exists, return an empty string.

+ +

An English letter b is greater than another letter a if b appears after a in the English alphabet.

+ +

 

+

Example 1:

+ +
+Input: s = "lEeTcOdE"
+Output: "E"
+Explanation:
+The letter 'E' is the only letter to appear in both lower and upper case.
+
+ +

Example 2:

+ +
+Input: s = "arRAzFif"
+Output: "R"
+Explanation:
+The letter 'R' is the greatest letter to appear in both lower and upper case.
+Note that 'A' and 'F' also appear in both lower and upper case, but 'R' is greater than 'F' or 'A'.
+
+ +

Example 3:

+ +
+Input: s = "AbCdEfGhIjK"
+Output: ""
+Explanation:
+There is no letter that appears in both lower and upper case.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 1000
  • +
  • s consists of lowercase and uppercase English letters.
  • +
diff --git a/leetcode-cn/problem (English)/判断矩阵是否是一个 X 矩阵(English) [check-if-matrix-is-x-matrix].html b/leetcode-cn/problem (English)/判断矩阵是否是一个 X 矩阵(English) [check-if-matrix-is-x-matrix].html new file mode 100644 index 00000000..1712e040 --- /dev/null +++ b/leetcode-cn/problem (English)/判断矩阵是否是一个 X 矩阵(English) [check-if-matrix-is-x-matrix].html @@ -0,0 +1,38 @@ +

A square matrix is said to be an X-Matrix if both of the following conditions hold:

+ +
    +
  1. All the elements in the diagonals of the matrix are non-zero.
  2. +
  3. All other elements are 0.
  4. +
+ +

Given a 2D integer array grid of size n x n representing a square matrix, return true if grid is an X-Matrix. Otherwise, return false.

+ +

 

+

Example 1:

+ +
+Input: grid = [[2,0,0,1],[0,3,1,0],[0,5,2,0],[4,0,0,2]]
+Output: true
+Explanation: Refer to the diagram above. 
+An X-Matrix should have the green elements (diagonals) be non-zero and the red elements be 0.
+Thus, grid is an X-Matrix.
+
+ +

Example 2:

+ +
+Input: grid = [[5,7,0],[0,3,1],[0,5,0]]
+Output: false
+Explanation: Refer to the diagram above.
+An X-Matrix should have the green elements (diagonals) be non-zero and the red elements be 0.
+Thus, grid is not an X-Matrix.
+
+ +

 

+

Constraints:

+ +
    +
  • n == grid.length == grid[i].length
  • +
  • 3 <= n <= 100
  • +
  • 0 <= grid[i][j] <= 105
  • +
diff --git a/leetcode-cn/problem (English)/卖木头块(English) [selling-pieces-of-wood].html b/leetcode-cn/problem (English)/卖木头块(English) [selling-pieces-of-wood].html new file mode 100644 index 00000000..46ae87f0 --- /dev/null +++ b/leetcode-cn/problem (English)/卖木头块(English) [selling-pieces-of-wood].html @@ -0,0 +1,46 @@ +

You are given two integers m and n that represent the height and width of a rectangular piece of wood. You are also given a 2D integer array prices, where prices[i] = [hi, wi, pricei] indicates you can sell a rectangular piece of wood of height hi and width wi for pricei dollars.

+ +

To cut a piece of wood, you must make a vertical or horizontal cut across the entire height or width of the piece to split it into two smaller pieces. After cutting a piece of wood into some number of smaller pieces, you can sell pieces according to prices. You may sell multiple pieces of the same shape, and you do not have to sell all the shapes. The grain of the wood makes a difference, so you cannot rotate a piece to swap its height and width.

+ +

Return the maximum money you can earn after cutting an m x n piece of wood.

+ +

Note that you can cut the piece of wood as many times as you want.

+ +

 

+

Example 1:

+ +
+Input: m = 3, n = 5, prices = [[1,4,2],[2,2,7],[2,1,3]]
+Output: 19
+Explanation: The diagram above shows a possible scenario. It consists of:
+- 2 pieces of wood shaped 2 x 2, selling for a price of 2 * 7 = 14.
+- 1 piece of wood shaped 2 x 1, selling for a price of 1 * 3 = 3.
+- 1 piece of wood shaped 1 x 4, selling for a price of 1 * 2 = 2.
+This obtains a total of 14 + 3 + 2 = 19 money earned.
+It can be shown that 19 is the maximum amount of money that can be earned.
+
+ +

Example 2:

+ +
+Input: m = 4, n = 6, prices = [[3,2,10],[1,4,2],[4,1,3]]
+Output: 32
+Explanation: The diagram above shows a possible scenario. It consists of:
+- 3 pieces of wood shaped 3 x 2, selling for a price of 3 * 10 = 30.
+- 1 piece of wood shaped 1 x 4, selling for a price of 1 * 2 = 2.
+This obtains a total of 30 + 2 = 32 money earned.
+It can be shown that 32 is the maximum amount of money that can be earned.
+Notice that we cannot rotate the 1 x 4 piece of wood to obtain a 4 x 1 piece of wood.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= m, n <= 200
  • +
  • 1 <= prices.length <= 2 * 104
  • +
  • prices[i].length == 3
  • +
  • 1 <= hi <= m
  • +
  • 1 <= wi <= n
  • +
  • 1 <= pricei <= 106
  • +
  • All the shapes of wood (hi, wi) are pairwise distinct.
  • +
diff --git a/leetcode-cn/problem (English)/小于等于 K 的最长二进制子序列(English) [longest-binary-subsequence-less-than-or-equal-to-k].html b/leetcode-cn/problem (English)/小于等于 K 的最长二进制子序列(English) [longest-binary-subsequence-less-than-or-equal-to-k].html new file mode 100644 index 00000000..476d053f --- /dev/null +++ b/leetcode-cn/problem (English)/小于等于 K 的最长二进制子序列(English) [longest-binary-subsequence-less-than-or-equal-to-k].html @@ -0,0 +1,40 @@ +

You are given a binary string s and a positive integer k.

+ +

Return the length of the longest subsequence of s that makes up a binary number less than or equal to k.

+ +

Note:

+ +
    +
  • The subsequence can contain leading zeroes.
  • +
  • The empty string is considered to be equal to 0.
  • +
  • A subsequence is a string that can be derived from another string by deleting some or no characters without changing the order of the remaining characters.
  • +
+ +

 

+

Example 1:

+ +
+Input: s = "1001010", k = 5
+Output: 5
+Explanation: The longest subsequence of s that makes up a binary number less than or equal to 5 is "00010", as this number is equal to 2 in decimal.
+Note that "00100" and "00101" are also possible, which are equal to 4 and 5 in decimal, respectively.
+The length of this subsequence is 5, so 5 is returned.
+
+ +

Example 2:

+ +
+Input: s = "00101001", k = 1
+Output: 6
+Explanation: "000001" is the longest subsequence of s that makes up a binary number less than or equal to 1, as this number is equal to 1 in decimal.
+The length of this subsequence is 6, so 6 is returned.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 1000
  • +
  • s[i] is either '0' or '1'.
  • +
  • 1 <= k <= 109
  • +
diff --git a/leetcode-cn/problem (English)/拼接数组的最大分数(English) [maximum-score-of-spliced-array].html b/leetcode-cn/problem (English)/拼接数组的最大分数(English) [maximum-score-of-spliced-array].html new file mode 100644 index 00000000..29cb1afb --- /dev/null +++ b/leetcode-cn/problem (English)/拼接数组的最大分数(English) [maximum-score-of-spliced-array].html @@ -0,0 +1,51 @@ +

You are given two 0-indexed integer arrays nums1 and nums2, both of length n.

+ +

You can choose two integers left and right where 0 <= left <= right < n and swap the subarray nums1[left...right] with the subarray nums2[left...right].

+ +
    +
  • For example, if nums1 = [1,2,3,4,5] and nums2 = [11,12,13,14,15] and you choose left = 1 and right = 2, nums1 becomes [1,12,13,4,5] and nums2 becomes [11,2,3,14,15].
  • +
+ +

You may choose to apply the mentioned operation once or not do anything.

+ +

The score of the arrays is the maximum of sum(nums1) and sum(nums2), where sum(arr) is the sum of all the elements in the array arr.

+ +

Return the maximum possible score.

+ +

A subarray is a contiguous sequence of elements within an array. arr[left...right] denotes the subarray that contains the elements of nums between indices left and right (inclusive).

+ +

 

+

Example 1:

+ +
+Input: nums1 = [60,60,60], nums2 = [10,90,10]
+Output: 210
+Explanation: Choosing left = 1 and right = 1, we have nums1 = [60,90,60] and nums2 = [10,60,10].
+The score is max(sum(nums1), sum(nums2)) = max(210, 80) = 210.
+ +

Example 2:

+ +
+Input: nums1 = [20,40,20,70,30], nums2 = [50,20,50,40,20]
+Output: 220
+Explanation: Choosing left = 3, right = 4, we have nums1 = [20,40,20,40,20] and nums2 = [50,20,50,70,30].
+The score is max(sum(nums1), sum(nums2)) = max(140, 220) = 220.
+
+ +

Example 3:

+ +
+Input: nums1 = [7,11,13], nums2 = [1,1,1]
+Output: 31
+Explanation: We choose not to swap any subarray.
+The score is max(sum(nums1), sum(nums2)) = max(31, 3) = 31.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums1.length == nums2.length
  • +
  • 1 <= n <= 105
  • +
  • 1 <= nums1[i], nums2[i] <= 104
  • +
diff --git a/leetcode-cn/problem (English)/操作后的最大异或和(English) [maximum-xor-after-operations].html b/leetcode-cn/problem (English)/操作后的最大异或和(English) [maximum-xor-after-operations].html new file mode 100644 index 00000000..015fa764 --- /dev/null +++ b/leetcode-cn/problem (English)/操作后的最大异或和(English) [maximum-xor-after-operations].html @@ -0,0 +1,33 @@ +

You are given a 0-indexed integer array nums. In one operation, select any non-negative integer x and an index i, then update nums[i] to be equal to nums[i] AND (nums[i] XOR x).

+ +

Note that AND is the bitwise AND operation and XOR is the bitwise XOR operation.

+ +

Return the maximum possible bitwise XOR of all elements of nums after applying the operation any number of times.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,2,4,6]
+Output: 7
+Explanation: Apply the operation with x = 4 and i = 3, num[3] = 6 AND (6 XOR 4) = 6 AND 2 = 2.
+Now, nums = [3, 2, 4, 2] and the bitwise XOR of all the elements = 3 XOR 2 XOR 4 XOR 2 = 7.
+It can be shown that 7 is the maximum possible bitwise XOR.
+Note that other operations may be used to achieve a bitwise XOR of 7.
+ +

Example 2:

+ +
+Input: nums = [1,2,3,9,2]
+Output: 11
+Explanation: Apply the operation zero times.
+The bitwise XOR of all the elements = 1 XOR 2 XOR 3 XOR 9 XOR 2 = 11.
+It can be shown that 11 is the maximum possible bitwise XOR.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 0 <= nums[i] <= 108
  • +
diff --git a/leetcode-cn/problem (English)/统计放置房子的方式数(English) [count-number-of-ways-to-place-houses].html b/leetcode-cn/problem (English)/统计放置房子的方式数(English) [count-number-of-ways-to-place-houses].html new file mode 100644 index 00000000..2230d4f7 --- /dev/null +++ b/leetcode-cn/problem (English)/统计放置房子的方式数(English) [count-number-of-ways-to-place-houses].html @@ -0,0 +1,34 @@ +

There is a street with n * 2 plots, where there are n plots on each side of the street. The plots on each side are numbered from 1 to n. On each plot, a house can be placed.

+ +

Return the number of ways houses can be placed such that no two houses are adjacent to each other on the same side of the street. Since the answer may be very large, return it modulo 109 + 7.

+ +

Note that if a house is placed on the ith plot on one side of the street, a house can also be placed on the ith plot on the other side of the street.

+ +

 

+

Example 1:

+ +
+Input: n = 1
+Output: 4
+Explanation: 
+Possible arrangements:
+1. All plots are empty.
+2. A house is placed on one side of the street.
+3. A house is placed on the other side of the street.
+4. Two houses are placed, one on each side of the street.
+
+ +

Example 2:

+ +
+Input: n = 2
+Output: 9
+Explanation: The 9 possible arrangements are shown in the diagram above.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 104
  • +
diff --git a/leetcode-cn/problem (English)/统计无向图中无法互相到达点对数(English) [count-unreachable-pairs-of-nodes-in-an-undirected-graph].html b/leetcode-cn/problem (English)/统计无向图中无法互相到达点对数(English) [count-unreachable-pairs-of-nodes-in-an-undirected-graph].html new file mode 100644 index 00000000..4af467bb --- /dev/null +++ b/leetcode-cn/problem (English)/统计无向图中无法互相到达点对数(English) [count-unreachable-pairs-of-nodes-in-an-undirected-graph].html @@ -0,0 +1,34 @@ +

You are given an integer n. There is an undirected graph with n nodes, numbered from 0 to n - 1. You are given a 2D integer array edges where edges[i] = [ai, bi] denotes that there exists an undirected edge connecting nodes ai and bi.

+ +

Return the number of pairs of different nodes that are unreachable from each other.

+ +

 

+

Example 1:

+ +
+Input: n = 3, edges = [[0,1],[0,2],[1,2]]
+Output: 0
+Explanation: There are no pairs of nodes that are unreachable from each other. Therefore, we return 0.
+
+ +

Example 2:

+ +
+Input: n = 7, edges = [[0,2],[0,5],[2,4],[1,6],[5,4]]
+Output: 14
+Explanation: There are 14 pairs of nodes that are unreachable from each other:
+[[0,1],[0,3],[0,6],[1,2],[1,3],[1,4],[1,5],[2,3],[2,6],[3,4],[3,5],[3,6],[4,6],[5,6]].
+Therefore, we return 14.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
  • +
  • 0 <= edges.length <= 2 * 105
  • +
  • edges[i].length == 2
  • +
  • 0 <= ai, bi < n
  • +
  • ai != bi
  • +
  • There are no repeated edges.
  • +
diff --git a/leetcode-cn/problem (English)/统计星号(English) [count-asterisks].html b/leetcode-cn/problem (English)/统计星号(English) [count-asterisks].html new file mode 100644 index 00000000..dcc8bac7 --- /dev/null +++ b/leetcode-cn/problem (English)/统计星号(English) [count-asterisks].html @@ -0,0 +1,40 @@ +

You are given a string s, where every two consecutive vertical bars '|' are grouped into a pair. In other words, the 1st and 2nd '|' make a pair, the 3rd and 4th '|' make a pair, and so forth.

+ +

Return the number of '*' in s, excluding the '*' between each pair of '|'.

+ +

Note that each '|' will belong to exactly one pair.

+ +

 

+

Example 1:

+ +
+Input: s = "l|*e*et|c**o|*de|"
+Output: 2
+Explanation: The considered characters are underlined: "l|*e*et|c**o|*de|".
+The characters between the first and second '|' are excluded from the answer.
+Also, the characters between the third and fourth '|' are excluded from the answer.
+There are 2 asterisks considered. Therefore, we return 2.
+ +

Example 2:

+ +
+Input: s = "iamprogrammer"
+Output: 0
+Explanation: In this example, there are no asterisks in s. Therefore, we return 0.
+
+ +

Example 3:

+ +
+Input: s = "yo|uar|e**|b|e***au|tifu|l"
+Output: 5
+Explanation: The considered characters are underlined: "yo|uar|e**|b|e***au|tifu|l". There are 5 asterisks considered. Therefore, we return 5.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 1000
  • +
  • s consists of lowercase English letters, vertical bars '|', and asterisks '*'.
  • +
  • s contains an even number of vertical bars '|'.
  • +
diff --git a/leetcode/origin-data.json b/leetcode/origin-data.json index f68fb233..6d182c9a 100644 --- a/leetcode/origin-data.json +++ b/leetcode/origin-data.json @@ -1,11 +1,34 @@ { "user_name": "", "num_solved": 0, - "num_total": 2308, + "num_total": 2322, "ac_easy": 0, "ac_medium": 0, "ac_hard": 0, "stat_status_pairs": [ + { + "stat": { + "question_id": 2446, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "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": 241, + "total_submitted": 305, + "frontend_question_id": 2314, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2441, @@ -15,10 +38,10 @@ "question__title": "Arrange Table by Gender", "question__title_slug": "arrange-table-by-gender", "question__hide": false, - "total_acs": 121, - "total_submitted": 160, + "total_acs": 371, + "total_submitted": 487, "frontend_question_id": 2308, - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -38,10 +61,10 @@ "question__title": "Tasks Count in the Weekend", "question__title_slug": "tasks-count-in-the-weekend", "question__hide": false, - "total_acs": 249, - "total_submitted": 308, + "total_acs": 498, + "total_submitted": 577, "frontend_question_id": 2298, - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -61,8 +84,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": 410, - "total_submitted": 1023, + "total_acs": 657, + "total_submitted": 1644, "frontend_question_id": 2292, "is_new_question": false }, @@ -84,8 +107,8 @@ "question__title": "Maximum Profit From Trading Stocks", "question__title_slug": "maximum-profit-from-trading-stocks", "question__hide": false, - "total_acs": 810, - "total_submitted": 1549, + "total_acs": 938, + "total_submitted": 1880, "frontend_question_id": 2291, "is_new_question": false }, @@ -107,8 +130,8 @@ "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": 458, - "total_submitted": 874, + "total_acs": 509, + "total_submitted": 999, "frontend_question_id": 2282, "is_new_question": false }, @@ -130,8 +153,8 @@ "question__title": "Closest Node to Path in Tree", "question__title_slug": "closest-node-to-path-in-tree", "question__hide": false, - "total_acs": 545, - "total_submitted": 803, + "total_acs": 683, + "total_submitted": 989, "frontend_question_id": 2277, "is_new_question": false }, @@ -153,8 +176,8 @@ "question__title": "Minimum Number of Keypresses", "question__title_slug": "minimum-number-of-keypresses", "question__hide": false, - "total_acs": 1459, - "total_submitted": 1842, + "total_acs": 1729, + "total_submitted": 2208, "frontend_question_id": 2268, "is_new_question": false }, @@ -167,6 +190,190 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2404, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Number of Distinct Roll Sequences", + "question__title_slug": "number-of-distinct-roll-sequences", + "question__hide": false, + "total_acs": 4633, + "total_submitted": 8568, + "frontend_question_id": 2318, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2403, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "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": 11225, + "total_submitted": 30335, + "frontend_question_id": 2316, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2402, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Maximum XOR After Operations ", + "question__title_slug": "maximum-xor-after-operations", + "question__hide": false, + "total_acs": 8984, + "total_submitted": 12050, + "frontend_question_id": 2317, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2401, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Count Asterisks", + "question__title_slug": "count-asterisks", + "question__hide": false, + "total_acs": 16708, + "total_submitted": 20754, + "frontend_question_id": 2315, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2400, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Minimum Score After Removals on a Tree", + "question__title_slug": "minimum-score-after-removals-on-a-tree", + "question__hide": false, + "total_acs": 2850, + "total_submitted": 6112, + "frontend_question_id": 2322, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2399, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "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": 337, + "total_submitted": 453, + "frontend_question_id": 2313, + "is_new_question": true + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": true, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2398, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Check if Matrix Is X-Matrix", + "question__title_slug": "check-if-matrix-is-x-matrix", + "question__hide": false, + "total_acs": 18844, + "total_submitted": 28130, + "frontend_question_id": 2319, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, + { + "stat": { + "question_id": 2397, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Count Number of Ways to Place Houses", + "question__title_slug": "count-number-of-ways-to-place-houses", + "question__hide": false, + "total_acs": 12928, + "total_submitted": 35022, + "frontend_question_id": 2320, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2396, @@ -176,8 +383,8 @@ "question__title": "Design Video Sharing Platform", "question__title_slug": "design-video-sharing-platform", "question__hide": false, - "total_acs": 633, - "total_submitted": 989, + "total_acs": 662, + "total_submitted": 1030, "frontend_question_id": 2254, "is_new_question": false }, @@ -190,6 +397,29 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 2395, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "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": 11992, + "total_submitted": 34680, + "frontend_question_id": 2311, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 2394, @@ -199,8 +429,8 @@ "question__title": "Count Subarrays With Score Less Than K", "question__title_slug": "count-subarrays-with-score-less-than-k", "question__hide": false, - "total_acs": 8737, - "total_submitted": 17662, + "total_acs": 9792, + "total_submitted": 19498, "frontend_question_id": 2302, "is_new_question": false }, @@ -222,8 +452,8 @@ "question__title": "Match Substring After Replacement", "question__title_slug": "match-substring-after-replacement", "question__hide": false, - "total_acs": 7990, - "total_submitted": 21106, + "total_acs": 8696, + "total_submitted": 22484, "frontend_question_id": 2301, "is_new_question": false }, @@ -245,8 +475,8 @@ "question__title": "Successful Pairs of Spells and Potions", "question__title_slug": "successful-pairs-of-spells-and-potions", "question__hide": false, - "total_acs": 14522, - "total_submitted": 49508, + "total_acs": 15682, + "total_submitted": 52499, "frontend_question_id": 2300, "is_new_question": false }, @@ -268,8 +498,8 @@ "question__title": "Strong Password Checker II", "question__title_slug": "strong-password-checker-ii", "question__hide": false, - "total_acs": 17911, - "total_submitted": 31832, + "total_acs": 19427, + "total_submitted": 34437, "frontend_question_id": 2299, "is_new_question": false }, @@ -291,8 +521,8 @@ "question__title": "Naming a Company", "question__title_slug": "naming-a-company", "question__hide": false, - "total_acs": 5289, - "total_submitted": 16615, + "total_acs": 6072, + "total_submitted": 18457, "frontend_question_id": 2306, "is_new_question": false }, @@ -314,8 +544,8 @@ "question__title": "Design a Text Editor", "question__title_slug": "design-a-text-editor", "question__hide": false, - "total_acs": 9205, - "total_submitted": 25885, + "total_acs": 9707, + "total_submitted": 26760, "frontend_question_id": 2296, "is_new_question": false }, @@ -337,8 +567,8 @@ "question__title": "Replace Elements in an Array", "question__title_slug": "replace-elements-in-an-array", "question__hide": false, - "total_acs": 19061, - "total_submitted": 33641, + "total_acs": 19956, + "total_submitted": 35161, "frontend_question_id": 2295, "is_new_question": false }, @@ -360,8 +590,8 @@ "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": 18418, - "total_submitted": 25944, + "total_acs": 19337, + "total_submitted": 27183, "frontend_question_id": 2294, "is_new_question": false }, @@ -383,8 +613,8 @@ "question__title": "Min Max Game", "question__title_slug": "min-max-game", "question__hide": false, - "total_acs": 22650, - "total_submitted": 35713, + "total_acs": 23865, + "total_submitted": 37503, "frontend_question_id": 2293, "is_new_question": false }, @@ -406,8 +636,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": 1053, - "total_submitted": 1490, + "total_acs": 1128, + "total_submitted": 1610, "frontend_question_id": 2237, "is_new_question": false }, @@ -429,8 +659,8 @@ "question__title": "Root Equals Sum of Children", "question__title_slug": "root-equals-sum-of-children", "question__hide": false, - "total_acs": 23682, - "total_submitted": 26369, + "total_acs": 27044, + "total_submitted": 30033, "frontend_question_id": 2236, "is_new_question": false }, @@ -452,8 +682,8 @@ "question__title": "Add Two Integers", "question__title_slug": "add-two-integers", "question__hide": false, - "total_acs": 43115, - "total_submitted": 46495, + "total_acs": 49972, + "total_submitted": 54095, "frontend_question_id": 2235, "is_new_question": false }, @@ -475,8 +705,8 @@ "question__title": "Dynamic Unpivoting of a Table", "question__title_slug": "dynamic-unpivoting-of-a-table", "question__hide": false, - "total_acs": 147, - "total_submitted": 234, + "total_acs": 167, + "total_submitted": 264, "frontend_question_id": 2253, "is_new_question": false }, @@ -498,8 +728,8 @@ "question__title": "Dynamic Pivoting of a Table", "question__title_slug": "dynamic-pivoting-of-a-table", "question__hide": false, - "total_acs": 161, - "total_submitted": 301, + "total_acs": 194, + "total_submitted": 350, "frontend_question_id": 2252, "is_new_question": false }, @@ -521,8 +751,8 @@ "question__title": "Booking Concert Tickets in Groups", "question__title_slug": "booking-concert-tickets-in-groups", "question__hide": false, - "total_acs": 2648, - "total_submitted": 18594, + "total_acs": 2792, + "total_submitted": 19202, "frontend_question_id": 2286, "is_new_question": false }, @@ -544,8 +774,8 @@ "question__title": "Maximum Total Importance of Roads", "question__title_slug": "maximum-total-importance-of-roads", "question__hide": false, - "total_acs": 14124, - "total_submitted": 23707, + "total_acs": 15035, + "total_submitted": 25208, "frontend_question_id": 2285, "is_new_question": false }, @@ -567,8 +797,8 @@ "question__title": "Sender With Largest Word Count", "question__title_slug": "sender-with-largest-word-count", "question__hide": false, - "total_acs": 17478, - "total_submitted": 31853, + "total_acs": 18238, + "total_submitted": 33142, "frontend_question_id": 2284, "is_new_question": false }, @@ -590,8 +820,8 @@ "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": 20604, - "total_submitted": 27698, + "total_acs": 21854, + "total_submitted": 29346, "frontend_question_id": 2283, "is_new_question": false }, @@ -613,8 +843,8 @@ "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": 1465, - "total_submitted": 1897, + "total_acs": 1615, + "total_submitted": 2115, "frontend_question_id": 2238, "is_new_question": false }, @@ -636,8 +866,8 @@ "question__title": "Minimum Obstacle Removal to Reach Corner", "question__title_slug": "minimum-obstacle-removal-to-reach-corner", "question__hide": false, - "total_acs": 8471, - "total_submitted": 17900, + "total_acs": 9261, + "total_submitted": 19235, "frontend_question_id": 2290, "is_new_question": false }, @@ -659,8 +889,8 @@ "question__title": "Steps to Make Array Non-decreasing", "question__title_slug": "steps-to-make-array-non-decreasing", "question__hide": false, - "total_acs": 7350, - "total_submitted": 37995, + "total_acs": 8099, + "total_submitted": 40321, "frontend_question_id": 2289, "is_new_question": false }, @@ -682,8 +912,8 @@ "question__title": "Apply Discount to Prices", "question__title_slug": "apply-discount-to-prices", "question__hide": false, - "total_acs": 12246, - "total_submitted": 46870, + "total_acs": 12641, + "total_submitted": 48082, "frontend_question_id": 2288, "is_new_question": false }, @@ -705,8 +935,8 @@ "question__title": "Rearrange Characters to Make Target String", "question__title_slug": "rearrange-characters-to-make-target-string", "question__hide": false, - "total_acs": 19987, - "total_submitted": 34736, + "total_acs": 20835, + "total_submitted": 36144, "frontend_question_id": 2287, "is_new_question": false }, @@ -728,8 +958,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": 1176, - "total_submitted": 2354, + "total_acs": 1311, + "total_submitted": 2599, "frontend_question_id": 2230, "is_new_question": false }, @@ -751,8 +981,8 @@ "question__title": "Users With Two Purchases Within Seven Days", "question__title_slug": "users-with-two-purchases-within-seven-days", "question__hide": false, - "total_acs": 1682, - "total_submitted": 3733, + "total_acs": 1898, + "total_submitted": 4238, "frontend_question_id": 2228, "is_new_question": false }, @@ -774,8 +1004,8 @@ "question__title": "Maximum Sum Score of Array", "question__title_slug": "maximum-sum-score-of-array", "question__hide": false, - "total_acs": 1250, - "total_submitted": 1926, + "total_acs": 1346, + "total_submitted": 2125, "frontend_question_id": 2219, "is_new_question": false }, @@ -797,8 +1027,8 @@ "question__title": "Sum of Total Strength of Wizards", "question__title_slug": "sum-of-total-strength-of-wizards", "question__hide": false, - "total_acs": 3805, - "total_submitted": 16844, + "total_acs": 4277, + "total_submitted": 18316, "frontend_question_id": 2281, "is_new_question": false }, @@ -820,8 +1050,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": 15945, - "total_submitted": 70718, + "total_acs": 16409, + "total_submitted": 72204, "frontend_question_id": 2280, "is_new_question": false }, @@ -843,8 +1073,8 @@ "question__title": "Maximum Bags With Full Capacity of Rocks", "question__title_slug": "maximum-bags-with-full-capacity-of-rocks", "question__hide": false, - "total_acs": 20838, - "total_submitted": 34309, + "total_acs": 21589, + "total_submitted": 35412, "frontend_question_id": 2279, "is_new_question": false }, @@ -866,8 +1096,8 @@ "question__title": "Percentage of Letter in String", "question__title_slug": "percentage-of-letter-in-string", "question__hide": false, - "total_acs": 25173, - "total_submitted": 34511, + "total_acs": 26498, + "total_submitted": 36204, "frontend_question_id": 2278, "is_new_question": false }, @@ -889,8 +1119,8 @@ "question__title": "Longest Path With Different Adjacent Characters", "question__title_slug": "longest-path-with-different-adjacent-characters", "question__hide": false, - "total_acs": 7385, - "total_submitted": 16906, + "total_acs": 7728, + "total_submitted": 17625, "frontend_question_id": 2246, "is_new_question": false }, @@ -912,8 +1142,8 @@ "question__title": "Maximum Trailing Zeros in a Cornered Path", "question__title_slug": "maximum-trailing-zeros-in-a-cornered-path", "question__hide": false, - "total_acs": 5643, - "total_submitted": 16454, + "total_acs": 5744, + "total_submitted": 16657, "frontend_question_id": 2245, "is_new_question": false }, @@ -935,8 +1165,8 @@ "question__title": "Minimum Rounds to Complete All Tasks", "question__title_slug": "minimum-rounds-to-complete-all-tasks", "question__hide": false, - "total_acs": 20124, - "total_submitted": 36533, + "total_acs": 20722, + "total_submitted": 37524, "frontend_question_id": 2244, "is_new_question": false }, @@ -958,8 +1188,8 @@ "question__title": "Calculate Digit Sum of a String", "question__title_slug": "calculate-digit-sum-of-a-string", "question__hide": false, - "total_acs": 19757, - "total_submitted": 29886, + "total_acs": 20272, + "total_submitted": 30566, "frontend_question_id": 2243, "is_new_question": false }, @@ -981,8 +1211,8 @@ "question__title": "Substring With Largest Variance", "question__title_slug": "substring-with-largest-variance", "question__hide": false, - "total_acs": 4324, - "total_submitted": 13720, + "total_acs": 5078, + "total_submitted": 15762, "frontend_question_id": 2272, "is_new_question": false }, @@ -1004,8 +1234,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": 8184, - "total_submitted": 27314, + "total_acs": 8673, + "total_submitted": 28673, "frontend_question_id": 2271, "is_new_question": false }, @@ -1027,8 +1257,8 @@ "question__title": "Number of Ways to Split Array", "question__title_slug": "number-of-ways-to-split-array", "question__hide": false, - "total_acs": 15189, - "total_submitted": 35372, + "total_acs": 15811, + "total_submitted": 36736, "frontend_question_id": 2270, "is_new_question": false }, @@ -1050,8 +1280,8 @@ "question__title": "Count Integers in Intervals", "question__title_slug": "count-integers-in-intervals", "question__hide": false, - "total_acs": 7579, - "total_submitted": 24507, + "total_acs": 7821, + "total_submitted": 25035, "frontend_question_id": 2276, "is_new_question": false }, @@ -1073,8 +1303,8 @@ "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": 14488, - "total_submitted": 20328, + "total_acs": 14946, + "total_submitted": 20922, "frontend_question_id": 2275, "is_new_question": false }, @@ -1096,8 +1326,8 @@ "question__title": "Maximum Consecutive Floors Without Special Floors", "question__title_slug": "maximum-consecutive-floors-without-special-floors", "question__hide": false, - "total_acs": 18547, - "total_submitted": 35543, + "total_acs": 19068, + "total_submitted": 36518, "frontend_question_id": 2274, "is_new_question": false }, @@ -1119,8 +1349,8 @@ "question__title": "Minimum Health to Beat Game", "question__title_slug": "minimum-health-to-beat-game", "question__hide": false, - "total_acs": 4531, - "total_submitted": 8001, + "total_acs": 5126, + "total_submitted": 9095, "frontend_question_id": 2214, "is_new_question": false }, @@ -1142,8 +1372,8 @@ "question__title": "Maximum Score of a Node Sequence", "question__title_slug": "maximum-score-of-a-node-sequence", "question__hide": false, - "total_acs": 5371, - "total_submitted": 15706, + "total_acs": 5764, + "total_submitted": 16595, "frontend_question_id": 2242, "is_new_question": false }, @@ -1165,8 +1395,8 @@ "question__title": "Design an ATM Machine", "question__title_slug": "design-an-atm-machine", "question__hide": false, - "total_acs": 9842, - "total_submitted": 26209, + "total_acs": 10066, + "total_submitted": 26726, "frontend_question_id": 2241, "is_new_question": false }, @@ -1188,8 +1418,8 @@ "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": 14251, - "total_submitted": 25576, + "total_acs": 14617, + "total_submitted": 26141, "frontend_question_id": 2240, "is_new_question": false }, @@ -1211,8 +1441,8 @@ "question__title": "Find Closest Number to Zero", "question__title_slug": "find-closest-number-to-zero", "question__hide": false, - "total_acs": 20876, - "total_submitted": 45304, + "total_acs": 21595, + "total_submitted": 46989, "frontend_question_id": 2239, "is_new_question": false }, @@ -1234,8 +1464,8 @@ "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": 8924, - "total_submitted": 24024, + "total_acs": 9243, + "total_submitted": 24904, "frontend_question_id": 2267, "is_new_question": false }, @@ -1257,8 +1487,8 @@ "question__title": "Count Number of Texts", "question__title_slug": "count-number-of-texts", "question__hide": false, - "total_acs": 9934, - "total_submitted": 20700, + "total_acs": 10370, + "total_submitted": 21706, "frontend_question_id": 2266, "is_new_question": false }, @@ -1280,8 +1510,8 @@ "question__title": "Count Nodes Equal to Average of Subtree", "question__title_slug": "count-nodes-equal-to-average-of-subtree", "question__hide": false, - "total_acs": 17342, - "total_submitted": 20303, + "total_acs": 18676, + "total_submitted": 21876, "frontend_question_id": 2265, "is_new_question": false }, @@ -1303,8 +1533,8 @@ "question__title": "Largest 3-Same-Digit Number in String", "question__title_slug": "largest-3-same-digit-number-in-string", "question__hide": false, - "total_acs": 20014, - "total_submitted": 34047, + "total_acs": 20864, + "total_submitted": 35484, "frontend_question_id": 2264, "is_new_question": false }, @@ -1326,8 +1556,8 @@ "question__title": "Minimum Number of Operations to Convert Time", "question__title_slug": "minimum-number-of-operations-to-convert-time", "question__hide": false, - "total_acs": 21447, - "total_submitted": 33821, + "total_acs": 22068, + "total_submitted": 34694, "frontend_question_id": 2224, "is_new_question": false }, @@ -1349,8 +1579,8 @@ "question__title": "Escape the Spreading Fire", "question__title_slug": "escape-the-spreading-fire", "question__hide": false, - "total_acs": 4021, - "total_submitted": 11903, + "total_acs": 4442, + "total_submitted": 12721, "frontend_question_id": 2258, "is_new_question": false }, @@ -1372,8 +1602,8 @@ "question__title": "Count Unguarded Cells in the Grid", "question__title_slug": "count-unguarded-cells-in-the-grid", "question__hide": false, - "total_acs": 9440, - "total_submitted": 18338, + "total_acs": 9703, + "total_submitted": 18851, "frontend_question_id": 2257, "is_new_question": false }, @@ -1395,8 +1625,8 @@ "question__title": "Minimum Average Difference", "question__title_slug": "minimum-average-difference", "question__hide": false, - "total_acs": 12814, - "total_submitted": 36443, + "total_acs": 13153, + "total_submitted": 37350, "frontend_question_id": 2256, "is_new_question": false }, @@ -1418,8 +1648,8 @@ "question__title": "Count Prefixes of a Given String", "question__title_slug": "count-prefixes-of-a-given-string", "question__hide": false, - "total_acs": 19605, - "total_submitted": 26917, + "total_acs": 20713, + "total_submitted": 28364, "frontend_question_id": 2255, "is_new_question": false }, @@ -1441,8 +1671,8 @@ "question__title": "Total Appeal of A String", "question__title_slug": "total-appeal-of-a-string", "question__hide": false, - "total_acs": 9973, - "total_submitted": 18529, + "total_acs": 10886, + "total_submitted": 19950, "frontend_question_id": 2262, "is_new_question": false }, @@ -1464,8 +1694,8 @@ "question__title": "K Divisible Elements Subarrays", "question__title_slug": "k-divisible-elements-subarrays", "question__hide": false, - "total_acs": 13215, - "total_submitted": 29107, + "total_acs": 13681, + "total_submitted": 29989, "frontend_question_id": 2261, "is_new_question": false }, @@ -1487,8 +1717,8 @@ "question__title": "Minimum Consecutive Cards to Pick Up", "question__title_slug": "minimum-consecutive-cards-to-pick-up", "question__hide": false, - "total_acs": 20798, - "total_submitted": 38986, + "total_acs": 21860, + "total_submitted": 41145, "frontend_question_id": 2260, "is_new_question": false }, @@ -1510,8 +1740,8 @@ "question__title": "Remove Digit From Number to Maximize Result", "question__title_slug": "remove-digit-from-number-to-maximize-result", "question__hide": false, - "total_acs": 23037, - "total_submitted": 49306, + "total_acs": 24527, + "total_submitted": 52265, "frontend_question_id": 2259, "is_new_question": false }, @@ -1533,8 +1763,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": 1658, - "total_submitted": 3395, + "total_acs": 1789, + "total_submitted": 3638, "frontend_question_id": 2205, "is_new_question": false }, @@ -1556,8 +1786,8 @@ "question__title": "Finding the Topic of Each Post", "question__title_slug": "finding-the-topic-of-each-post", "question__hide": false, - "total_acs": 667, - "total_submitted": 1530, + "total_acs": 728, + "total_submitted": 1647, "frontend_question_id": 2199, "is_new_question": false }, @@ -1579,8 +1809,8 @@ "question__title": "Number of Flowers in Full Bloom", "question__title_slug": "number-of-flowers-in-full-bloom", "question__hide": false, - "total_acs": 8133, - "total_submitted": 15876, + "total_acs": 8457, + "total_submitted": 16455, "frontend_question_id": 2251, "is_new_question": false }, @@ -1602,8 +1832,8 @@ "question__title": "Count Number of Rectangles Containing Each Point", "question__title_slug": "count-number-of-rectangles-containing-each-point", "question__hide": false, - "total_acs": 8288, - "total_submitted": 25811, + "total_acs": 8607, + "total_submitted": 26474, "frontend_question_id": 2250, "is_new_question": false }, @@ -1625,8 +1855,8 @@ "question__title": "Count Lattice Points Inside a Circle", "question__title_slug": "count-lattice-points-inside-a-circle", "question__hide": false, - "total_acs": 13694, - "total_submitted": 27178, + "total_acs": 14008, + "total_submitted": 27822, "frontend_question_id": 2249, "is_new_question": false }, @@ -1648,8 +1878,8 @@ "question__title": "Intersection of Multiple Arrays", "question__title_slug": "intersection-of-multiple-arrays", "question__hide": false, - "total_acs": 23874, - "total_submitted": 34262, + "total_acs": 25000, + "total_submitted": 35858, "frontend_question_id": 2248, "is_new_question": false }, @@ -1671,8 +1901,8 @@ "question__title": "Maximum Total Beauty of the Gardens", "question__title_slug": "maximum-total-beauty-of-the-gardens", "question__hide": false, - "total_acs": 3664, - "total_submitted": 13669, + "total_acs": 3732, + "total_submitted": 13892, "frontend_question_id": 2234, "is_new_question": false }, @@ -1694,8 +1924,8 @@ "question__title": "Maximum Product After K Increments", "question__title_slug": "maximum-product-after-k-increments", "question__hide": false, - "total_acs": 15820, - "total_submitted": 39235, + "total_acs": 16302, + "total_submitted": 40254, "frontend_question_id": 2233, "is_new_question": false }, @@ -1717,8 +1947,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": 10985, - "total_submitted": 17267, + "total_acs": 11147, + "total_submitted": 17513, "frontend_question_id": 2232, "is_new_question": false }, @@ -1740,8 +1970,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": 20242, - "total_submitted": 34592, + "total_acs": 20903, + "total_submitted": 35598, "frontend_question_id": 2231, "is_new_question": false }, @@ -1763,8 +1993,8 @@ "question__title": "Sum of Scores of Built Strings", "question__title_slug": "sum-of-scores-of-built-strings", "question__hide": false, - "total_acs": 3683, - "total_submitted": 10728, + "total_acs": 3775, + "total_submitted": 10918, "frontend_question_id": 2223, "is_new_question": false }, @@ -1786,8 +2016,8 @@ "question__title": "Number of Ways to Select Buildings", "question__title_slug": "number-of-ways-to-select-buildings", "question__hide": false, - "total_acs": 12273, - "total_submitted": 26451, + "total_acs": 12702, + "total_submitted": 27164, "frontend_question_id": 2222, "is_new_question": false }, @@ -1809,8 +2039,8 @@ "question__title": "Find Triangular Sum of an Array", "question__title_slug": "find-triangular-sum-of-an-array", "question__hide": false, - "total_acs": 21081, - "total_submitted": 26614, + "total_acs": 22357, + "total_submitted": 28213, "frontend_question_id": 2221, "is_new_question": false }, @@ -1832,8 +2062,8 @@ "question__title": "Minimum Bit Flips to Convert Number", "question__title_slug": "minimum-bit-flips-to-convert-number", "question__hide": false, - "total_acs": 19048, - "total_submitted": 23321, + "total_acs": 19781, + "total_submitted": 24178, "frontend_question_id": 2220, "is_new_question": false }, @@ -1855,8 +2085,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": 1552, - "total_submitted": 2790, + "total_acs": 1727, + "total_submitted": 3152, "frontend_question_id": 2184, "is_new_question": false }, @@ -1878,8 +2108,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": 6601, - "total_submitted": 18501, + "total_acs": 6732, + "total_submitted": 18814, "frontend_question_id": 2203, "is_new_question": false }, @@ -1901,8 +2131,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": 24079, - "total_submitted": 37572, + "total_acs": 24521, + "total_submitted": 38249, "frontend_question_id": 2200, "is_new_question": false }, @@ -1924,8 +2154,8 @@ "question__title": "Longest Substring of One Repeating Character", "question__title_slug": "longest-substring-of-one-repeating-character", "question__hide": false, - "total_acs": 2452, - "total_submitted": 8128, + "total_acs": 2498, + "total_submitted": 8281, "frontend_question_id": 2213, "is_new_question": false }, @@ -1947,8 +2177,8 @@ "question__title": "Maximum Points in an Archery Competition", "question__title_slug": "maximum-points-in-an-archery-competition", "question__hide": false, - "total_acs": 9205, - "total_submitted": 19263, + "total_acs": 9400, + "total_submitted": 19657, "frontend_question_id": 2212, "is_new_question": false }, @@ -1970,8 +2200,8 @@ "question__title": "Count Collisions on a Road", "question__title_slug": "count-collisions-on-a-road", "question__hide": false, - "total_acs": 14200, - "total_submitted": 34918, + "total_acs": 14513, + "total_submitted": 35519, "frontend_question_id": 2211, "is_new_question": false }, @@ -1993,8 +2223,8 @@ "question__title": "Count Hills and Valleys in an Array", "question__title_slug": "count-hills-and-valleys-in-an-array", "question__hide": false, - "total_acs": 20183, - "total_submitted": 35561, + "total_acs": 20692, + "total_submitted": 36346, "frontend_question_id": 2210, "is_new_question": false }, @@ -2016,8 +2246,8 @@ "question__title": "The Change in Global Rankings", "question__title_slug": "the-change-in-global-rankings", "question__hide": false, - "total_acs": 1729, - "total_submitted": 2621, + "total_acs": 1842, + "total_submitted": 2781, "frontend_question_id": 2175, "is_new_question": false }, @@ -2039,8 +2269,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": 2175, - "total_submitted": 3111, + "total_acs": 2442, + "total_submitted": 3504, "frontend_question_id": 2174, "is_new_question": false }, @@ -2062,8 +2292,8 @@ "question__title": "Longest Winning Streak", "question__title_slug": "longest-winning-streak", "question__hide": false, - "total_acs": 1118, - "total_submitted": 2035, + "total_acs": 1223, + "total_submitted": 2191, "frontend_question_id": 2173, "is_new_question": false }, @@ -2085,8 +2315,8 @@ "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": 18653, - "total_submitted": 30826, + "total_acs": 19052, + "total_submitted": 31482, "frontend_question_id": 2190, "is_new_question": false }, @@ -2108,8 +2338,8 @@ "question__title": "Minimum White Tiles After Covering With Carpets", "question__title_slug": "minimum-white-tiles-after-covering-with-carpets", "question__hide": false, - "total_acs": 7153, - "total_submitted": 22106, + "total_acs": 7353, + "total_submitted": 22554, "frontend_question_id": 2209, "is_new_question": false }, @@ -2131,8 +2361,8 @@ "question__title": "Minimum Operations to Halve Array Sum", "question__title_slug": "minimum-operations-to-halve-array-sum", "question__hide": false, - "total_acs": 12902, - "total_submitted": 29196, + "total_acs": 13234, + "total_submitted": 29885, "frontend_question_id": 2208, "is_new_question": false }, @@ -2154,8 +2384,8 @@ "question__title": "Maximize Number of Subsequences in a String", "question__title_slug": "maximize-number-of-subsequences-in-a-string", "question__hide": false, - "total_acs": 11856, - "total_submitted": 37343, + "total_acs": 12092, + "total_submitted": 37970, "frontend_question_id": 2207, "is_new_question": false }, @@ -2177,8 +2407,8 @@ "question__title": "Divide Array Into Equal Pairs", "question__title_slug": "divide-array-into-equal-pairs", "question__hide": false, - "total_acs": 27056, - "total_submitted": 35464, + "total_acs": 28352, + "total_submitted": 37156, "frontend_question_id": 2206, "is_new_question": false }, @@ -2200,8 +2430,8 @@ "question__title": "Replace Non-Coprime Numbers in Array", "question__title_slug": "replace-non-coprime-numbers-in-array", "question__hide": false, - "total_acs": 8227, - "total_submitted": 22743, + "total_acs": 8333, + "total_submitted": 23005, "frontend_question_id": 2197, "is_new_question": false }, @@ -2223,8 +2453,8 @@ "question__title": "Create Binary Tree From Descriptions", "question__title_slug": "create-binary-tree-from-descriptions", "question__hide": false, - "total_acs": 16725, - "total_submitted": 23663, + "total_acs": 17240, + "total_submitted": 24352, "frontend_question_id": 2196, "is_new_question": false }, @@ -2246,8 +2476,8 @@ "question__title": "Append K Integers With Minimal Sum", "question__title_slug": "append-k-integers-with-minimal-sum", "question__hide": false, - "total_acs": 16992, - "total_submitted": 72962, + "total_acs": 17341, + "total_submitted": 74101, "frontend_question_id": 2195, "is_new_question": false }, @@ -2269,8 +2499,8 @@ "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": 25832, - "total_submitted": 30177, + "total_acs": 26784, + "total_submitted": 31274, "frontend_question_id": 2194, "is_new_question": false }, @@ -2292,8 +2522,8 @@ "question__title": "Unique Substrings With Equal Digit Frequency", "question__title_slug": "unique-substrings-with-equal-digit-frequency", "question__hide": false, - "total_acs": 1062, - "total_submitted": 1795, + "total_acs": 1089, + "total_submitted": 1841, "frontend_question_id": 2168, "is_new_question": false }, @@ -2315,8 +2545,8 @@ "question__title": "Order Two Columns Independently", "question__title_slug": "order-two-columns-independently", "question__hide": false, - "total_acs": 1930, - "total_submitted": 3045, + "total_acs": 2056, + "total_submitted": 3232, "frontend_question_id": 2159, "is_new_question": false }, @@ -2338,8 +2568,8 @@ "question__title": "Count Array Pairs Divisible by K", "question__title_slug": "count-array-pairs-divisible-by-k", "question__hide": false, - "total_acs": 8411, - "total_submitted": 31048, + "total_acs": 8541, + "total_submitted": 31474, "frontend_question_id": 2183, "is_new_question": false }, @@ -2361,8 +2591,8 @@ "question__title": "Construct String With Repeat Limit", "question__title_slug": "construct-string-with-repeat-limit", "question__hide": false, - "total_acs": 13618, - "total_submitted": 26602, + "total_acs": 13810, + "total_submitted": 26913, "frontend_question_id": 2182, "is_new_question": false }, @@ -2384,8 +2614,8 @@ "question__title": "Merge Nodes in Between Zeros", "question__title_slug": "merge-nodes-in-between-zeros", "question__hide": false, - "total_acs": 35581, - "total_submitted": 41001, + "total_acs": 37210, + "total_submitted": 42930, "frontend_question_id": 2181, "is_new_question": false }, @@ -2407,8 +2637,8 @@ "question__title": "Count Integers With Even Digit Sum", "question__title_slug": "count-integers-with-even-digit-sum", "question__hide": false, - "total_acs": 26762, - "total_submitted": 41660, + "total_acs": 27324, + "total_submitted": 42515, "frontend_question_id": 2180, "is_new_question": false }, @@ -2430,8 +2660,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": 8828, - "total_submitted": 14802, + "total_acs": 10152, + "total_submitted": 17247, "frontend_question_id": 2158, "is_new_question": false }, @@ -2453,8 +2683,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": 656, - "total_submitted": 1296, + "total_acs": 730, + "total_submitted": 1416, "frontend_question_id": 2153, "is_new_question": false }, @@ -2476,8 +2706,8 @@ "question__title": "Minimum Time to Finish the Race", "question__title_slug": "minimum-time-to-finish-the-race", "question__hide": false, - "total_acs": 6579, - "total_submitted": 16130, + "total_acs": 6716, + "total_submitted": 16409, "frontend_question_id": 2188, "is_new_question": false }, @@ -2499,8 +2729,8 @@ "question__title": "Minimum Time to Complete Trips", "question__title_slug": "minimum-time-to-complete-trips", "question__hide": false, - "total_acs": 21905, - "total_submitted": 71724, + "total_acs": 22467, + "total_submitted": 73259, "frontend_question_id": 2187, "is_new_question": false }, @@ -2522,8 +2752,8 @@ "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": 23106, - "total_submitted": 32501, + "total_acs": 23527, + "total_submitted": 33047, "frontend_question_id": 2186, "is_new_question": false }, @@ -2545,8 +2775,8 @@ "question__title": "Counting Words With a Given Prefix", "question__title_slug": "counting-words-with-a-given-prefix", "question__hide": false, - "total_acs": 33644, - "total_submitted": 43479, + "total_acs": 34918, + "total_submitted": 45143, "frontend_question_id": 2185, "is_new_question": false }, @@ -2568,8 +2798,8 @@ "question__title": "Maximum AND Sum of Array", "question__title_slug": "maximum-and-sum-of-array", "question__hide": false, - "total_acs": 5677, - "total_submitted": 13037, + "total_acs": 5749, + "total_submitted": 13171, "frontend_question_id": 2172, "is_new_question": false }, @@ -2591,8 +2821,8 @@ "question__title": "Removing Minimum Number of Magic Beans", "question__title_slug": "removing-minimum-number-of-magic-beans", "question__hide": false, - "total_acs": 15678, - "total_submitted": 37920, + "total_acs": 15935, + "total_submitted": 38479, "frontend_question_id": 2171, "is_new_question": false }, @@ -2614,8 +2844,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": 16069, - "total_submitted": 48872, + "total_acs": 16399, + "total_submitted": 49727, "frontend_question_id": 2170, "is_new_question": false }, @@ -2637,8 +2867,8 @@ "question__title": "Count Operations to Obtain Zero", "question__title_slug": "count-operations-to-obtain-zero", "question__hide": false, - "total_acs": 33539, - "total_submitted": 44390, + "total_acs": 34361, + "total_submitted": 45473, "frontend_question_id": 2169, "is_new_question": false }, @@ -2660,8 +2890,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": 967, - "total_submitted": 2039, + "total_acs": 984, + "total_submitted": 2091, "frontend_question_id": 2152, "is_new_question": false }, @@ -2683,8 +2913,8 @@ "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": 8291, - "total_submitted": 21057, + "total_acs": 8409, + "total_submitted": 21296, "frontend_question_id": 2167, "is_new_question": false }, @@ -2706,8 +2936,8 @@ "question__title": "Design Bitset", "question__title_slug": "design-bitset", "question__hide": false, - "total_acs": 14743, - "total_submitted": 48594, + "total_acs": 15273, + "total_submitted": 49607, "frontend_question_id": 2166, "is_new_question": false }, @@ -2729,8 +2959,8 @@ "question__title": "Smallest Value of the Rearranged Number", "question__title_slug": "smallest-value-of-the-rearranged-number", "question__hide": false, - "total_acs": 21541, - "total_submitted": 42387, + "total_acs": 21896, + "total_submitted": 43053, "frontend_question_id": 2165, "is_new_question": false }, @@ -2752,8 +2982,8 @@ "question__title": "Sort Even and Odd Indices Independently", "question__title_slug": "sort-even-and-odd-indices-independently", "question__hide": false, - "total_acs": 28847, - "total_submitted": 42957, + "total_acs": 29458, + "total_submitted": 43869, "frontend_question_id": 2164, "is_new_question": false }, @@ -2775,8 +3005,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": 504, - "total_submitted": 989, + "total_acs": 510, + "total_submitted": 998, "frontend_question_id": 2143, "is_new_question": false }, @@ -2798,8 +3028,8 @@ "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": 2893, - "total_submitted": 5706, + "total_acs": 3083, + "total_submitted": 6114, "frontend_question_id": 2142, "is_new_question": false }, @@ -2821,8 +3051,8 @@ "question__title": "Count Good Triplets in an Array", "question__title_slug": "count-good-triplets-in-an-array", "question__hide": false, - "total_acs": 3822, - "total_submitted": 10968, + "total_acs": 3883, + "total_submitted": 11114, "frontend_question_id": 2179, "is_new_question": false }, @@ -2844,8 +3074,8 @@ "question__title": "Maximum Split of Positive Even Integers", "question__title_slug": "maximum-split-of-positive-even-integers", "question__hide": false, - "total_acs": 22282, - "total_submitted": 38633, + "total_acs": 23827, + "total_submitted": 41094, "frontend_question_id": 2178, "is_new_question": false }, @@ -2867,8 +3097,8 @@ "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": 21164, - "total_submitted": 34413, + "total_acs": 21634, + "total_submitted": 35092, "frontend_question_id": 2177, "is_new_question": false }, @@ -2890,8 +3120,8 @@ "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": 27710, - "total_submitted": 34485, + "total_acs": 28743, + "total_submitted": 35758, "frontend_question_id": 2176, "is_new_question": false }, @@ -2913,8 +3143,8 @@ "question__title": "Groups of Strings", "question__title_slug": "groups-of-strings", "question__hide": false, - "total_acs": 5839, - "total_submitted": 23640, + "total_acs": 5953, + "total_submitted": 24000, "frontend_question_id": 2157, "is_new_question": false }, @@ -2936,8 +3166,8 @@ "question__title": "Find Substring With Given Hash Value", "question__title_slug": "find-substring-with-given-hash-value", "question__hide": false, - "total_acs": 9416, - "total_submitted": 44180, + "total_acs": 9535, + "total_submitted": 44628, "frontend_question_id": 2156, "is_new_question": false }, @@ -2959,8 +3189,8 @@ "question__title": "Keep Multiplying Found Values by Two", "question__title_slug": "keep-multiplying-found-values-by-two", "question__hide": false, - "total_acs": 39106, - "total_submitted": 53118, + "total_acs": 40355, + "total_submitted": 54880, "frontend_question_id": 2154, "is_new_question": false }, @@ -2982,8 +3212,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": 1092, - "total_submitted": 1596, + "total_acs": 1133, + "total_submitted": 1654, "frontend_question_id": 2137, "is_new_question": false }, @@ -3005,8 +3235,8 @@ "question__title": "Maximum Good People Based on Statements", "question__title_slug": "maximum-good-people-based-on-statements", "question__hide": false, - "total_acs": 8783, - "total_submitted": 18799, + "total_acs": 8868, + "total_submitted": 18949, "frontend_question_id": 2151, "is_new_question": false }, @@ -3028,8 +3258,8 @@ "question__title": "Rearrange Array Elements by Sign", "question__title_slug": "rearrange-array-elements-by-sign", "question__hide": false, - "total_acs": 33145, - "total_submitted": 40451, + "total_acs": 34335, + "total_submitted": 41960, "frontend_question_id": 2149, "is_new_question": false }, @@ -3051,8 +3281,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": 24793, - "total_submitted": 40970, + "total_acs": 25284, + "total_submitted": 41804, "frontend_question_id": 2150, "is_new_question": false }, @@ -3074,8 +3304,8 @@ "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": 28587, - "total_submitted": 47400, + "total_acs": 29246, + "total_submitted": 48497, "frontend_question_id": 2148, "is_new_question": false }, @@ -3097,8 +3327,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": 20039, - "total_submitted": 26292, + "total_acs": 21456, + "total_submitted": 28134, "frontend_question_id": 2128, "is_new_question": false }, @@ -3120,8 +3350,8 @@ "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": 5073, - "total_submitted": 11100, + "total_acs": 5149, + "total_submitted": 11249, "frontend_question_id": 2163, "is_new_question": false }, @@ -3143,8 +3373,8 @@ "question__title": "Minimum Cost to Set Cooking Time", "question__title_slug": "minimum-cost-to-set-cooking-time", "question__hide": false, - "total_acs": 8222, - "total_submitted": 23079, + "total_acs": 8746, + "total_submitted": 24143, "frontend_question_id": 2162, "is_new_question": false }, @@ -3166,8 +3396,8 @@ "question__title": "Partition Array According to Given Pivot", "question__title_slug": "partition-array-according-to-given-pivot", "question__hide": false, - "total_acs": 23041, - "total_submitted": 27732, + "total_acs": 23937, + "total_submitted": 28765, "frontend_question_id": 2161, "is_new_question": false }, @@ -3189,8 +3419,8 @@ "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": 36250, - "total_submitted": 41112, + "total_acs": 38206, + "total_submitted": 43306, "frontend_question_id": 2160, "is_new_question": false }, @@ -3212,8 +3442,8 @@ "question__title": "Maximum Running Time of N Computers", "question__title_slug": "maximum-running-time-of-n-computers", "question__hide": false, - "total_acs": 8539, - "total_submitted": 22252, + "total_acs": 8676, + "total_submitted": 22588, "frontend_question_id": 2141, "is_new_question": false }, @@ -3235,8 +3465,8 @@ "question__title": "Solving Questions With Brainpower", "question__title_slug": "solving-questions-with-brainpower", "question__hide": false, - "total_acs": 19239, - "total_submitted": 42904, + "total_acs": 19596, + "total_submitted": 43654, "frontend_question_id": 2140, "is_new_question": false }, @@ -3258,8 +3488,8 @@ "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": 20583, - "total_submitted": 32933, + "total_acs": 20840, + "total_submitted": 33301, "frontend_question_id": 2155, "is_new_question": false }, @@ -3281,8 +3511,8 @@ "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": 26237, - "total_submitted": 40106, + "total_acs": 26734, + "total_submitted": 40852, "frontend_question_id": 2138, "is_new_question": false }, @@ -3304,8 +3534,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": 466, - "total_submitted": 1147, + "total_acs": 477, + "total_submitted": 1181, "frontend_question_id": 2123, "is_new_question": false }, @@ -3327,8 +3557,8 @@ "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": 1033, - "total_submitted": 1406, + "total_acs": 1056, + "total_submitted": 1436, "frontend_question_id": 2113, "is_new_question": false }, @@ -3350,8 +3580,8 @@ "question__title": "Earliest Possible Day of Full Bloom", "question__title_slug": "earliest-possible-day-of-full-bloom", "question__hide": false, - "total_acs": 7504, - "total_submitted": 11079, + "total_acs": 7615, + "total_submitted": 11241, "frontend_question_id": 2136, "is_new_question": false }, @@ -3373,8 +3603,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": 19693, - "total_submitted": 48307, + "total_acs": 20738, + "total_submitted": 50485, "frontend_question_id": 2135, "is_new_question": false }, @@ -3396,8 +3626,8 @@ "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": 14631, - "total_submitted": 30138, + "total_acs": 14923, + "total_submitted": 30658, "frontend_question_id": 2134, "is_new_question": false }, @@ -3419,8 +3649,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": 31288, - "total_submitted": 59499, + "total_acs": 32338, + "total_submitted": 61573, "frontend_question_id": 2133, "is_new_question": false }, @@ -3442,8 +3672,8 @@ "question__title": "Build the Equation", "question__title_slug": "build-the-equation", "question__hide": false, - "total_acs": 817, - "total_submitted": 1434, + "total_acs": 872, + "total_submitted": 1519, "frontend_question_id": 2118, "is_new_question": false }, @@ -3465,8 +3695,8 @@ "question__title": "The Airport With the Most Traffic", "question__title_slug": "the-airport-with-the-most-traffic", "question__hide": false, - "total_acs": 2999, - "total_submitted": 4264, + "total_acs": 3130, + "total_submitted": 4428, "frontend_question_id": 2112, "is_new_question": false }, @@ -3488,8 +3718,8 @@ "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": 7113, - "total_submitted": 17836, + "total_acs": 7261, + "total_submitted": 18256, "frontend_question_id": 2147, "is_new_question": false }, @@ -3511,8 +3741,8 @@ "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": 9140, - "total_submitted": 22553, + "total_acs": 9401, + "total_submitted": 23091, "frontend_question_id": 2146, "is_new_question": false }, @@ -3534,8 +3764,8 @@ "question__title": "Count the Hidden Sequences", "question__title_slug": "count-the-hidden-sequences", "question__hide": false, - "total_acs": 12174, - "total_submitted": 34128, + "total_acs": 12342, + "total_submitted": 34475, "frontend_question_id": 2145, "is_new_question": false }, @@ -3557,8 +3787,8 @@ "question__title": "Minimum Cost of Buying Candies With Discount", "question__title_slug": "minimum-cost-of-buying-candies-with-discount", "question__hide": false, - "total_acs": 23623, - "total_submitted": 38792, + "total_acs": 24271, + "total_submitted": 39848, "frontend_question_id": 2144, "is_new_question": false }, @@ -3580,8 +3810,8 @@ "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": 1477, - "total_submitted": 2545, + "total_acs": 1509, + "total_submitted": 2616, "frontend_question_id": 2107, "is_new_question": false }, @@ -3603,8 +3833,8 @@ "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": 5073, - "total_submitted": 16608, + "total_acs": 5197, + "total_submitted": 16942, "frontend_question_id": 2127, "is_new_question": false }, @@ -3626,8 +3856,8 @@ "question__title": "Destroying Asteroids", "question__title_slug": "destroying-asteroids", "question__hide": false, - "total_acs": 19711, - "total_submitted": 40419, + "total_acs": 20033, + "total_submitted": 40982, "frontend_question_id": 2126, "is_new_question": false }, @@ -3649,8 +3879,8 @@ "question__title": "Number of Laser Beams in a Bank", "question__title_slug": "number-of-laser-beams-in-a-bank", "question__hide": false, - "total_acs": 28822, - "total_submitted": 34629, + "total_acs": 29706, + "total_submitted": 35681, "frontend_question_id": 2125, "is_new_question": false }, @@ -3672,8 +3902,8 @@ "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": 32306, - "total_submitted": 44558, + "total_acs": 33208, + "total_submitted": 45937, "frontend_question_id": 2124, "is_new_question": false }, @@ -3695,8 +3925,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": 1353, - "total_submitted": 3516, + "total_acs": 1382, + "total_submitted": 3602, "frontend_question_id": 2098, "is_new_question": false }, @@ -3718,8 +3948,8 @@ "question__title": "Recover the Original Array", "question__title_slug": "recover-the-original-array", "question__hide": false, - "total_acs": 6741, - "total_submitted": 17913, + "total_acs": 6821, + "total_submitted": 18122, "frontend_question_id": 2122, "is_new_question": false }, @@ -3741,8 +3971,8 @@ "question__title": "Intervals Between Identical Elements", "question__title_slug": "intervals-between-identical-elements", "question__hide": false, - "total_acs": 11727, - "total_submitted": 27702, + "total_acs": 11915, + "total_submitted": 28093, "frontend_question_id": 2121, "is_new_question": false }, @@ -3764,8 +3994,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": 16124, - "total_submitted": 19288, + "total_acs": 16467, + "total_submitted": 19688, "frontend_question_id": 2120, "is_new_question": false }, @@ -3787,8 +4017,8 @@ "question__title": "A Number After a Double Reversal", "question__title_slug": "a-number-after-a-double-reversal", "question__hide": false, - "total_acs": 31621, - "total_submitted": 41490, + "total_acs": 32540, + "total_submitted": 42687, "frontend_question_id": 2119, "is_new_question": false }, @@ -3810,8 +4040,8 @@ "question__title": "Longest Palindrome by Concatenating Two Letter Words", "question__title_slug": "longest-palindrome-by-concatenating-two-letter-words", "question__hide": false, - "total_acs": 14700, - "total_submitted": 37673, + "total_acs": 15665, + "total_submitted": 39976, "frontend_question_id": 2131, "is_new_question": false }, @@ -3833,8 +4063,8 @@ "question__title": "Maximum Twin Sum of a Linked List", "question__title_slug": "maximum-twin-sum-of-a-linked-list", "question__hide": false, - "total_acs": 41199, - "total_submitted": 50202, + "total_acs": 43715, + "total_submitted": 53283, "frontend_question_id": 2130, "is_new_question": false }, @@ -3856,8 +4086,8 @@ "question__title": "Capitalize the Title", "question__title_slug": "capitalize-the-title", "question__hide": false, - "total_acs": 25230, - "total_submitted": 41969, + "total_acs": 25888, + "total_submitted": 43105, "frontend_question_id": 2129, "is_new_question": false }, @@ -3879,8 +4109,8 @@ "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": 8984, - "total_submitted": 24375, + "total_acs": 9116, + "total_submitted": 24635, "frontend_question_id": 2111, "is_new_question": false }, @@ -3902,8 +4132,8 @@ "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": 19971, - "total_submitted": 35734, + "total_acs": 20391, + "total_submitted": 36360, "frontend_question_id": 2110, "is_new_question": false }, @@ -3925,8 +4155,8 @@ "question__title": "Adding Spaces to a String", "question__title_slug": "adding-spaces-to-a-string", "question__hide": false, - "total_acs": 22435, - "total_submitted": 39931, + "total_acs": 22785, + "total_submitted": 40614, "frontend_question_id": 2109, "is_new_question": false }, @@ -3948,8 +4178,8 @@ "question__title": "Find First Palindromic String in the Array", "question__title_slug": "find-first-palindromic-string-in-the-array", "question__hide": false, - "total_acs": 48921, - "total_submitted": 61956, + "total_acs": 50338, + "total_submitted": 63816, "frontend_question_id": 2108, "is_new_question": false }, @@ -3971,8 +4201,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": 2495, - "total_submitted": 4357, + "total_acs": 2560, + "total_submitted": 4475, "frontend_question_id": 2093, "is_new_question": false }, @@ -3994,8 +4224,8 @@ "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": 6555, - "total_submitted": 18615, + "total_acs": 6627, + "total_submitted": 18843, "frontend_question_id": 2106, "is_new_question": false }, @@ -4017,8 +4247,8 @@ "question__title": "Watering Plants II", "question__title_slug": "watering-plants-ii", "question__hide": false, - "total_acs": 11666, - "total_submitted": 22878, + "total_acs": 11880, + "total_submitted": 23326, "frontend_question_id": 2105, "is_new_question": false }, @@ -4040,8 +4270,8 @@ "question__title": "Sum of Subarray Ranges", "question__title_slug": "sum-of-subarray-ranges", "question__hide": false, - "total_acs": 35966, - "total_submitted": 59533, + "total_acs": 38279, + "total_submitted": 63298, "frontend_question_id": 2104, "is_new_question": false }, @@ -4063,8 +4293,8 @@ "question__title": "Rings and Rods", "question__title_slug": "rings-and-rods", "question__hide": false, - "total_acs": 34469, - "total_submitted": 42217, + "total_acs": 35462, + "total_submitted": 43442, "frontend_question_id": 2103, "is_new_question": false }, @@ -4086,8 +4316,8 @@ "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": 3985, - "total_submitted": 5831, + "total_acs": 4072, + "total_submitted": 5985, "frontend_question_id": 2083, "is_new_question": false }, @@ -4109,8 +4339,8 @@ "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": 3838, - "total_submitted": 4202, + "total_acs": 4014, + "total_submitted": 4389, "frontend_question_id": 2084, "is_new_question": false }, @@ -4132,8 +4362,8 @@ "question__title": "The Number of Rich Customers", "question__title_slug": "the-number-of-rich-customers", "question__hide": false, - "total_acs": 4697, - "total_submitted": 5785, + "total_acs": 4857, + "total_submitted": 5992, "frontend_question_id": 2082, "is_new_question": false }, @@ -4155,8 +4385,8 @@ "question__title": "Abbreviating the Product of a Range", "question__title_slug": "abbreviating-the-product-of-a-range", "question__hide": false, - "total_acs": 2004, - "total_submitted": 7106, + "total_acs": 2046, + "total_submitted": 7232, "frontend_question_id": 2117, "is_new_question": false }, @@ -4178,8 +4408,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": 9903, - "total_submitted": 31793, + "total_acs": 10259, + "total_submitted": 32945, "frontend_question_id": 2116, "is_new_question": false }, @@ -4201,8 +4431,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": 33998, - "total_submitted": 73791, + "total_acs": 36702, + "total_submitted": 78902, "frontend_question_id": 2115, "is_new_question": false }, @@ -4224,8 +4454,8 @@ "question__title": "Maximum Number of Words Found in Sentences", "question__title_slug": "maximum-number-of-words-found-in-sentences", "question__hide": false, - "total_acs": 80344, - "total_submitted": 90676, + "total_acs": 84240, + "total_submitted": 95159, "frontend_question_id": 2114, "is_new_question": false }, @@ -4247,8 +4477,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": 1937, - "total_submitted": 3389, + "total_acs": 1982, + "total_submitted": 3484, "frontend_question_id": 2077, "is_new_question": false }, @@ -4270,8 +4500,8 @@ "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": 44547, - "total_submitted": 91780, + "total_acs": 47404, + "total_submitted": 97717, "frontend_question_id": 2096, "is_new_question": false }, @@ -4293,8 +4523,8 @@ "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": 53163, - "total_submitted": 94237, + "total_acs": 55694, + "total_submitted": 99038, "frontend_question_id": 2095, "is_new_question": false }, @@ -4316,8 +4546,8 @@ "question__title": "Finding 3-Digit Even Numbers", "question__title_slug": "finding-3-digit-even-numbers", "question__hide": false, - "total_acs": 16375, - "total_submitted": 28928, + "total_acs": 16699, + "total_submitted": 29433, "frontend_question_id": 2094, "is_new_question": false }, @@ -4339,8 +4569,8 @@ "question__title": "The Winner University", "question__title_slug": "the-winner-university", "question__hide": false, - "total_acs": 4553, - "total_submitted": 6223, + "total_acs": 4699, + "total_submitted": 6434, "frontend_question_id": 2072, "is_new_question": false }, @@ -4362,8 +4592,8 @@ "question__title": "Find All People With Secret", "question__title_slug": "find-all-people-with-secret", "question__hide": false, - "total_acs": 16004, - "total_submitted": 47249, + "total_acs": 16324, + "total_submitted": 48108, "frontend_question_id": 2092, "is_new_question": false }, @@ -4385,8 +4615,8 @@ "question__title": "Removing Minimum and Maximum From Array", "question__title_slug": "removing-minimum-and-maximum-from-array", "question__hide": false, - "total_acs": 18360, - "total_submitted": 32177, + "total_acs": 20836, + "total_submitted": 36096, "frontend_question_id": 2091, "is_new_question": false }, @@ -4408,8 +4638,8 @@ "question__title": "K Radius Subarray Averages", "question__title_slug": "k-radius-subarray-averages", "question__hide": false, - "total_acs": 16134, - "total_submitted": 38707, + "total_acs": 16514, + "total_submitted": 39523, "frontend_question_id": 2090, "is_new_question": false }, @@ -4431,8 +4661,8 @@ "question__title": "Find Target Indices After Sorting Array", "question__title_slug": "find-target-indices-after-sorting-array", "question__hide": false, - "total_acs": 61844, - "total_submitted": 79093, + "total_acs": 64314, + "total_submitted": 82473, "frontend_question_id": 2089, "is_new_question": false }, @@ -4454,8 +4684,8 @@ "question__title": "Number of Equal Count Substrings", "question__title_slug": "number-of-equal-count-substrings", "question__hide": false, - "total_acs": 1251, - "total_submitted": 2474, + "total_acs": 1293, + "total_submitted": 2552, "frontend_question_id": 2067, "is_new_question": false }, @@ -4477,8 +4707,8 @@ "question__title": "Account Balance", "question__title_slug": "account-balance", "question__hide": false, - "total_acs": 3810, - "total_submitted": 4474, + "total_acs": 3940, + "total_submitted": 4624, "frontend_question_id": 2066, "is_new_question": false }, @@ -4500,8 +4730,8 @@ "question__title": "Sequentially Ordinal Rank Tracker", "question__title_slug": "sequentially-ordinal-rank-tracker", "question__hide": false, - "total_acs": 6049, - "total_submitted": 9470, + "total_acs": 6364, + "total_submitted": 9901, "frontend_question_id": 2102, "is_new_question": false }, @@ -4523,8 +4753,8 @@ "question__title": "Detonate the Maximum Bombs", "question__title_slug": "detonate-the-maximum-bombs", "question__hide": false, - "total_acs": 12501, - "total_submitted": 31168, + "total_acs": 13205, + "total_submitted": 32622, "frontend_question_id": 2101, "is_new_question": false }, @@ -4546,8 +4776,8 @@ "question__title": "Find Good Days to Rob the Bank", "question__title_slug": "find-good-days-to-rob-the-bank", "question__hide": false, - "total_acs": 11206, - "total_submitted": 23630, + "total_acs": 12129, + "total_submitted": 25417, "frontend_question_id": 2100, "is_new_question": false }, @@ -4569,8 +4799,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": 18352, - "total_submitted": 42392, + "total_acs": 19387, + "total_submitted": 44701, "frontend_question_id": 2099, "is_new_question": false }, @@ -4592,8 +4822,8 @@ "question__title": "Number of Spaces Cleaning Robot Cleaned", "question__title_slug": "number-of-spaces-cleaning-robot-cleaned", "question__hide": false, - "total_acs": 2814, - "total_submitted": 5120, + "total_acs": 2859, + "total_submitted": 5202, "frontend_question_id": 2061, "is_new_question": false }, @@ -4615,8 +4845,8 @@ "question__title": "Sum of k-Mirror Numbers", "question__title_slug": "sum-of-k-mirror-numbers", "question__hide": false, - "total_acs": 5350, - "total_submitted": 12925, + "total_acs": 5387, + "total_submitted": 13042, "frontend_question_id": 2081, "is_new_question": false }, @@ -4638,8 +4868,8 @@ "question__title": "Valid Arrangement of Pairs", "question__title_slug": "valid-arrangement-of-pairs", "question__hide": false, - "total_acs": 4845, - "total_submitted": 12122, + "total_acs": 4968, + "total_submitted": 12359, "frontend_question_id": 2097, "is_new_question": false }, @@ -4661,8 +4891,8 @@ "question__title": "Stamping the Grid", "question__title_slug": "stamping-the-grid", "question__hide": false, - "total_acs": 3879, - "total_submitted": 13075, + "total_acs": 3962, + "total_submitted": 13266, "frontend_question_id": 2132, "is_new_question": false }, @@ -4684,8 +4914,8 @@ "question__title": "Two Furthest Houses With Different Colors", "question__title_slug": "two-furthest-houses-with-different-colors", "question__hide": false, - "total_acs": 27032, - "total_submitted": 39635, + "total_acs": 27738, + "total_submitted": 40750, "frontend_question_id": 2078, "is_new_question": false }, @@ -4707,8 +4937,8 @@ "question__title": "Process Restricted Friend Requests", "question__title_slug": "process-restricted-friend-requests", "question__hide": false, - "total_acs": 10677, - "total_submitted": 19773, + "total_acs": 10812, + "total_submitted": 20083, "frontend_question_id": 2076, "is_new_question": false }, @@ -4730,8 +4960,8 @@ "question__title": "Decode the Slanted Ciphertext", "question__title_slug": "decode-the-slanted-ciphertext", "question__hide": false, - "total_acs": 8295, - "total_submitted": 16648, + "total_acs": 8457, + "total_submitted": 16915, "frontend_question_id": 2075, "is_new_question": false }, @@ -4753,8 +4983,8 @@ "question__title": "Reverse Nodes in Even Length Groups", "question__title_slug": "reverse-nodes-in-even-length-groups", "question__hide": false, - "total_acs": 10382, - "total_submitted": 20418, + "total_acs": 10590, + "total_submitted": 20786, "frontend_question_id": 2074, "is_new_question": false }, @@ -4776,8 +5006,8 @@ "question__title": "Time Needed to Buy Tickets", "question__title_slug": "time-needed-to-buy-tickets", "question__hide": false, - "total_acs": 24691, - "total_submitted": 39737, + "total_acs": 25415, + "total_submitted": 40916, "frontend_question_id": 2073, "is_new_question": false }, @@ -4799,8 +5029,8 @@ "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": 3246, - "total_submitted": 4422, + "total_acs": 3375, + "total_submitted": 4595, "frontend_question_id": 2051, "is_new_question": false }, @@ -4822,8 +5052,8 @@ "question__title": "Count Fertile Pyramids in a Land", "question__title_slug": "count-fertile-pyramids-in-a-land", "question__hide": false, - "total_acs": 4103, - "total_submitted": 6525, + "total_acs": 4194, + "total_submitted": 6647, "frontend_question_id": 2088, "is_new_question": false }, @@ -4845,8 +5075,8 @@ "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": 9266, - "total_submitted": 18381, + "total_acs": 9496, + "total_submitted": 18829, "frontend_question_id": 2087, "is_new_question": false }, @@ -4868,8 +5098,8 @@ "question__title": "Minimum Number of Buckets Required to Collect Rainwater from Houses", "question__title_slug": "minimum-number-of-buckets-required-to-collect-rainwater-from-houses", "question__hide": false, - "total_acs": 10616, - "total_submitted": 23562, + "total_acs": 10841, + "total_submitted": 24017, "frontend_question_id": 2086, "is_new_question": false }, @@ -4891,8 +5121,8 @@ "question__title": "Count Common Words With One Occurrence", "question__title_slug": "count-common-words-with-one-occurrence", "question__hide": false, - "total_acs": 26204, - "total_submitted": 37434, + "total_acs": 26961, + "total_submitted": 38552, "frontend_question_id": 2085, "is_new_question": false }, @@ -4914,8 +5144,8 @@ "question__title": "Maximum Path Quality of a Graph", "question__title_slug": "maximum-path-quality-of-a-graph", "question__hide": false, - "total_acs": 9285, - "total_submitted": 15984, + "total_acs": 9625, + "total_submitted": 16575, "frontend_question_id": 2065, "is_new_question": false }, @@ -4937,8 +5167,8 @@ "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": 13008, - "total_submitted": 26414, + "total_acs": 13324, + "total_submitted": 26978, "frontend_question_id": 2064, "is_new_question": false }, @@ -4960,8 +5190,8 @@ "question__title": "Vowels of All Substrings", "question__title_slug": "vowels-of-all-substrings", "question__hide": false, - "total_acs": 14843, - "total_submitted": 27157, + "total_acs": 15193, + "total_submitted": 27786, "frontend_question_id": 2063, "is_new_question": false }, @@ -4983,8 +5213,8 @@ "question__title": "Count Vowel Substrings of a String", "question__title_slug": "count-vowel-substrings-of-a-string", "question__hide": false, - "total_acs": 18252, - "total_submitted": 27742, + "total_acs": 18623, + "total_submitted": 28306, "frontend_question_id": 2062, "is_new_question": false }, @@ -5006,8 +5236,8 @@ "question__title": "Accepted Candidates From the Interviews", "question__title_slug": "accepted-candidates-from-the-interviews", "question__hide": false, - "total_acs": 3626, - "total_submitted": 4634, + "total_acs": 3735, + "total_submitted": 4778, "frontend_question_id": 2041, "is_new_question": false }, @@ -5029,8 +5259,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": 6619, - "total_submitted": 16362, + "total_acs": 6751, + "total_submitted": 16664, "frontend_question_id": 2060, "is_new_question": false }, @@ -5052,8 +5282,8 @@ "question__title": "Minimum Operations to Convert Number", "question__title_slug": "minimum-operations-to-convert-number", "question__hide": false, - "total_acs": 10514, - "total_submitted": 22491, + "total_acs": 10647, + "total_submitted": 22727, "frontend_question_id": 2059, "is_new_question": false }, @@ -5075,8 +5305,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": 16738, - "total_submitted": 29088, + "total_acs": 17103, + "total_submitted": 29738, "frontend_question_id": 2058, "is_new_question": false }, @@ -5098,8 +5328,8 @@ "question__title": "Smallest Index With Equal Value", "question__title_slug": "smallest-index-with-equal-value", "question__hide": false, - "total_acs": 26852, - "total_submitted": 37025, + "total_acs": 27566, + "total_submitted": 38091, "frontend_question_id": 2057, "is_new_question": false }, @@ -5121,8 +5351,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": 5167, - "total_submitted": 14280, + "total_acs": 5239, + "total_submitted": 14529, "frontend_question_id": 2071, "is_new_question": false }, @@ -5144,8 +5374,8 @@ "question__title": "Most Beautiful Item for Each Query", "question__title_slug": "most-beautiful-item-for-each-query", "question__hide": false, - "total_acs": 8840, - "total_submitted": 18173, + "total_acs": 9032, + "total_submitted": 18495, "frontend_question_id": 2070, "is_new_question": false }, @@ -5167,8 +5397,8 @@ "question__title": "Walking Robot Simulation II", "question__title_slug": "walking-robot-simulation-ii", "question__hide": false, - "total_acs": 6053, - "total_submitted": 27613, + "total_acs": 6173, + "total_submitted": 28047, "frontend_question_id": 2069, "is_new_question": false }, @@ -5190,8 +5420,8 @@ "question__title": "Check Whether Two Strings are Almost Equivalent", "question__title_slug": "check-whether-two-strings-are-almost-equivalent", "question__hide": false, - "total_acs": 18725, - "total_submitted": 28495, + "total_acs": 19151, + "total_submitted": 29169, "frontend_question_id": 2068, "is_new_question": false }, @@ -5213,8 +5443,8 @@ "question__title": "Parallel Courses III", "question__title_slug": "parallel-courses-iii", "question__hide": false, - "total_acs": 10813, - "total_submitted": 18107, + "total_acs": 11553, + "total_submitted": 19312, "frontend_question_id": 2050, "is_new_question": false }, @@ -5236,8 +5466,8 @@ "question__title": "Count Nodes With the Highest Score", "question__title_slug": "count-nodes-with-the-highest-score", "question__hide": false, - "total_acs": 11016, - "total_submitted": 23568, + "total_acs": 11323, + "total_submitted": 24174, "frontend_question_id": 2049, "is_new_question": false }, @@ -5259,8 +5489,8 @@ "question__title": "Next Greater Numerically Balanced Number", "question__title_slug": "next-greater-numerically-balanced-number", "question__hide": false, - "total_acs": 8847, - "total_submitted": 18970, + "total_acs": 8948, + "total_submitted": 19171, "frontend_question_id": 2048, "is_new_question": false }, @@ -5282,8 +5512,8 @@ "question__title": "Number of Valid Words in a Sentence", "question__title_slug": "number-of-valid-words-in-a-sentence", "question__hide": false, - "total_acs": 15520, - "total_submitted": 52695, + "total_acs": 15849, + "total_submitted": 53648, "frontend_question_id": 2047, "is_new_question": false }, @@ -5305,8 +5535,8 @@ "question__title": "Low-Quality Problems", "question__title_slug": "low-quality-problems", "question__hide": false, - "total_acs": 5331, - "total_submitted": 6231, + "total_acs": 5499, + "total_submitted": 6427, "frontend_question_id": 2026, "is_new_question": false }, @@ -5328,8 +5558,8 @@ "question__title": "Second Minimum Time to Reach Destination", "question__title_slug": "second-minimum-time-to-reach-destination", "question__hide": false, - "total_acs": 6403, - "total_submitted": 17288, + "total_acs": 6728, + "total_submitted": 17846, "frontend_question_id": 2045, "is_new_question": false }, @@ -5351,8 +5581,8 @@ "question__title": "Count Number of Maximum Bitwise-OR Subsets", "question__title_slug": "count-number-of-maximum-bitwise-or-subsets", "question__hide": false, - "total_acs": 14504, - "total_submitted": 19458, + "total_acs": 14792, + "total_submitted": 19917, "frontend_question_id": 2044, "is_new_question": false }, @@ -5374,8 +5604,8 @@ "question__title": "Simple Bank System", "question__title_slug": "simple-bank-system", "question__hide": false, - "total_acs": 13527, - "total_submitted": 20616, + "total_acs": 13671, + "total_submitted": 20844, "frontend_question_id": 2043, "is_new_question": false }, @@ -5397,8 +5627,8 @@ "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": 26626, - "total_submitted": 39652, + "total_acs": 27298, + "total_submitted": 40738, "frontend_question_id": 2042, "is_new_question": false }, @@ -5420,8 +5650,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": 4499, - "total_submitted": 6165, + "total_acs": 4676, + "total_submitted": 6452, "frontend_question_id": 2020, "is_new_question": false }, @@ -5443,8 +5673,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": 2747, - "total_submitted": 4698, + "total_acs": 2770, + "total_submitted": 4736, "frontend_question_id": 2056, "is_new_question": false }, @@ -5466,8 +5696,8 @@ "question__title": "Plates Between Candles", "question__title_slug": "plates-between-candles", "question__hide": false, - "total_acs": 12373, - "total_submitted": 27614, + "total_acs": 12928, + "total_submitted": 28922, "frontend_question_id": 2055, "is_new_question": false }, @@ -5489,8 +5719,8 @@ "question__title": "Two Best Non-Overlapping Events", "question__title_slug": "two-best-non-overlapping-events", "question__hide": false, - "total_acs": 9348, - "total_submitted": 21346, + "total_acs": 9619, + "total_submitted": 21919, "frontend_question_id": 2054, "is_new_question": false }, @@ -5512,8 +5742,8 @@ "question__title": "Kth Distinct String in an Array", "question__title_slug": "kth-distinct-string-in-an-array", "question__hide": false, - "total_acs": 25826, - "total_submitted": 35527, + "total_acs": 26612, + "total_submitted": 36679, "frontend_question_id": 2053, "is_new_question": false }, @@ -5535,8 +5765,8 @@ "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": 6422, - "total_submitted": 31711, + "total_acs": 6645, + "total_submitted": 33715, "frontend_question_id": 2035, "is_new_question": false }, @@ -5552,14 +5782,14 @@ { "stat": { "question_id": 2161, - "question__article__live": null, - "question__article__slug": null, - "question__article__has_video_solution": null, + "question__article__live": true, + "question__article__slug": "stock-price-fluctuation", + "question__article__has_video_solution": false, "question__title": "Stock Price Fluctuation ", "question__title_slug": "stock-price-fluctuation", "question__hide": false, - "total_acs": 32756, - "total_submitted": 67374, + "total_acs": 34395, + "total_submitted": 70536, "frontend_question_id": 2034, "is_new_question": false }, @@ -5581,8 +5811,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": 14559, - "total_submitted": 28501, + "total_acs": 14726, + "total_submitted": 28793, "frontend_question_id": 2033, "is_new_question": false }, @@ -5604,8 +5834,8 @@ "question__title": "Two Out of Three", "question__title_slug": "two-out-of-three", "question__hide": false, - "total_acs": 29435, - "total_submitted": 40391, + "total_acs": 30197, + "total_submitted": 41425, "frontend_question_id": 2032, "is_new_question": false }, @@ -5627,8 +5857,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": 2116, - "total_submitted": 3710, + "total_acs": 2212, + "total_submitted": 3889, "frontend_question_id": 2010, "is_new_question": false }, @@ -5650,8 +5880,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": 4802, - "total_submitted": 12300, + "total_acs": 4863, + "total_submitted": 12457, "frontend_question_id": 2030, "is_new_question": false }, @@ -5673,8 +5903,8 @@ "question__title": "Stone Game IX", "question__title_slug": "stone-game-ix", "question__hide": false, - "total_acs": 5109, - "total_submitted": 20282, + "total_acs": 5169, + "total_submitted": 20485, "frontend_question_id": 2029, "is_new_question": false }, @@ -5696,8 +5926,8 @@ "question__title": "Find Missing Observations", "question__title_slug": "find-missing-observations", "question__hide": false, - "total_acs": 14011, - "total_submitted": 32897, + "total_acs": 14237, + "total_submitted": 33312, "frontend_question_id": 2028, "is_new_question": false }, @@ -5719,8 +5949,8 @@ "question__title": "Minimum Moves to Convert String", "question__title_slug": "minimum-moves-to-convert-string", "question__hide": false, - "total_acs": 19500, - "total_submitted": 36398, + "total_acs": 19864, + "total_submitted": 37075, "frontend_question_id": 2027, "is_new_question": false }, @@ -5742,8 +5972,8 @@ "question__title": "Subtree Removal Game with Fibonacci Tree", "question__title_slug": "subtree-removal-game-with-fibonacci-tree", "question__hide": false, - "total_acs": 319, - "total_submitted": 505, + "total_acs": 329, + "total_submitted": 516, "frontend_question_id": 2005, "is_new_question": false }, @@ -5765,8 +5995,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": 3861, - "total_submitted": 10072, + "total_acs": 3994, + "total_submitted": 10430, "frontend_question_id": 2004, "is_new_question": false }, @@ -5788,8 +6018,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": 7353, - "total_submitted": 14837, + "total_acs": 7534, + "total_submitted": 15214, "frontend_question_id": 2039, "is_new_question": false }, @@ -5811,8 +6041,8 @@ "question__title": "Kth Smallest Product of Two Sorted Arrays", "question__title_slug": "kth-smallest-product-of-two-sorted-arrays", "question__hide": false, - "total_acs": 6915, - "total_submitted": 23534, + "total_acs": 7266, + "total_submitted": 24472, "frontend_question_id": 2040, "is_new_question": false }, @@ -5834,8 +6064,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": 13223, - "total_submitted": 23294, + "total_acs": 13585, + "total_submitted": 23883, "frontend_question_id": 2038, "is_new_question": false }, @@ -5857,8 +6087,8 @@ "question__title": "Minimum Number of Moves to Seat Everyone", "question__title_slug": "minimum-number-of-moves-to-seat-everyone", "question__hide": false, - "total_acs": 26805, - "total_submitted": 32415, + "total_acs": 27649, + "total_submitted": 33456, "frontend_question_id": 2037, "is_new_question": false }, @@ -5880,8 +6110,8 @@ "question__title": "The Score of Students Solving Math Expression", "question__title_slug": "the-score-of-students-solving-math-expression", "question__hide": false, - "total_acs": 4512, - "total_submitted": 13350, + "total_acs": 4569, + "total_submitted": 13539, "frontend_question_id": 2019, "is_new_question": false }, @@ -5903,8 +6133,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": 10373, - "total_submitted": 21487, + "total_acs": 10979, + "total_submitted": 22641, "frontend_question_id": 2018, "is_new_question": false }, @@ -5926,8 +6156,8 @@ "question__title": "Grid Game", "question__title_slug": "grid-game", "question__hide": false, - "total_acs": 10813, - "total_submitted": 25780, + "total_acs": 10983, + "total_submitted": 26134, "frontend_question_id": 2017, "is_new_question": false }, @@ -5949,8 +6179,8 @@ "question__title": "Maximum Difference Between Increasing Elements", "question__title_slug": "maximum-difference-between-increasing-elements", "question__hide": false, - "total_acs": 35188, - "total_submitted": 65118, + "total_acs": 36266, + "total_submitted": 67208, "frontend_question_id": 2016, "is_new_question": false }, @@ -5972,8 +6202,8 @@ "question__title": "Count the Number of Experiments", "question__title_slug": "count-the-number-of-experiments", "question__hide": false, - "total_acs": 2983, - "total_submitted": 5812, + "total_acs": 3062, + "total_submitted": 6013, "frontend_question_id": 1990, "is_new_question": false }, @@ -5995,8 +6225,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": 1169, - "total_submitted": 1942, + "total_acs": 1185, + "total_submitted": 1969, "frontend_question_id": 2015, "is_new_question": false }, @@ -6018,8 +6248,8 @@ "question__title": "Smallest Greater Multiple Made of Two Digits", "question__title_slug": "smallest-greater-multiple-made-of-two-digits", "question__hide": false, - "total_acs": 973, - "total_submitted": 1911, + "total_acs": 979, + "total_submitted": 1932, "frontend_question_id": 1999, "is_new_question": false }, @@ -6041,8 +6271,8 @@ "question__title": "Longest Subsequence Repeated k Times", "question__title_slug": "longest-subsequence-repeated-k-times", "question__hide": false, - "total_acs": 4311, - "total_submitted": 7829, + "total_acs": 4386, + "total_submitted": 7951, "frontend_question_id": 2014, "is_new_question": false }, @@ -6064,8 +6294,8 @@ "question__title": "Detect Squares", "question__title_slug": "detect-squares", "question__hide": false, - "total_acs": 25705, - "total_submitted": 53302, + "total_acs": 27004, + "total_submitted": 55727, "frontend_question_id": 2013, "is_new_question": false }, @@ -6087,8 +6317,8 @@ "question__title": "Sum of Beauty in the Array", "question__title_slug": "sum-of-beauty-in-the-array", "question__hide": false, - "total_acs": 14665, - "total_submitted": 31835, + "total_acs": 14881, + "total_submitted": 32226, "frontend_question_id": 2012, "is_new_question": false }, @@ -6110,8 +6340,8 @@ "question__title": "Final Value of Variable After Performing Operations", "question__title_slug": "final-value-of-variable-after-performing-operations", "question__hide": false, - "total_acs": 112711, - "total_submitted": 126449, + "total_acs": 116614, + "total_submitted": 130862, "frontend_question_id": 2011, "is_new_question": false }, @@ -6133,8 +6363,8 @@ "question__title": "Find Cutoff Score for Each School", "question__title_slug": "find-cutoff-score-for-each-school", "question__hide": false, - "total_acs": 4118, - "total_submitted": 5949, + "total_acs": 4327, + "total_submitted": 6262, "frontend_question_id": 1988, "is_new_question": false }, @@ -6156,8 +6386,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": 5353, - "total_submitted": 16898, + "total_acs": 5437, + "total_submitted": 17161, "frontend_question_id": 2025, "is_new_question": false }, @@ -6179,8 +6409,8 @@ "question__title": "Maximize the Confusion of an Exam", "question__title_slug": "maximize-the-confusion-of-an-exam", "question__hide": false, - "total_acs": 15404, - "total_submitted": 26627, + "total_acs": 15857, + "total_submitted": 27308, "frontend_question_id": 2024, "is_new_question": false }, @@ -6202,8 +6432,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": 19816, - "total_submitted": 27229, + "total_acs": 20445, + "total_submitted": 28095, "frontend_question_id": 2023, "is_new_question": false }, @@ -6225,8 +6455,8 @@ "question__title": "Convert 1D Array Into 2D Array", "question__title_slug": "convert-1d-array-into-2d-array", "question__hide": false, - "total_acs": 35097, - "total_submitted": 59658, + "total_acs": 36333, + "total_submitted": 61738, "frontend_question_id": 2022, "is_new_question": false }, @@ -6248,8 +6478,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": 5118, - "total_submitted": 11950, + "total_acs": 5192, + "total_submitted": 12093, "frontend_question_id": 2003, "is_new_question": false }, @@ -6271,8 +6501,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": 12344, - "total_submitted": 23299, + "total_acs": 12545, + "total_submitted": 23676, "frontend_question_id": 2002, "is_new_question": false }, @@ -6294,8 +6524,8 @@ "question__title": "Number of Pairs of Interchangeable Rectangles", "question__title_slug": "number-of-pairs-of-interchangeable-rectangles", "question__hide": false, - "total_acs": 16876, - "total_submitted": 38728, + "total_acs": 17072, + "total_submitted": 39100, "frontend_question_id": 2001, "is_new_question": false }, @@ -6317,8 +6547,8 @@ "question__title": "Reverse Prefix of Word", "question__title_slug": "reverse-prefix-of-word", "question__hide": false, - "total_acs": 36950, - "total_submitted": 47500, + "total_acs": 37851, + "total_submitted": 48655, "frontend_question_id": 2000, "is_new_question": false }, @@ -6340,8 +6570,8 @@ "question__title": "Employees Whose Manager Left the Company", "question__title_slug": "employees-whose-manager-left-the-company", "question__hide": false, - "total_acs": 5522, - "total_submitted": 11008, + "total_acs": 5691, + "total_submitted": 11339, "frontend_question_id": 1978, "is_new_question": false }, @@ -6363,8 +6593,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": 6055, - "total_submitted": 8055, + "total_acs": 6186, + "total_submitted": 8224, "frontend_question_id": 1973, "is_new_question": false }, @@ -6386,8 +6616,8 @@ "question__title": "GCD Sort of an Array", "question__title_slug": "gcd-sort-of-an-array", "question__hide": false, - "total_acs": 4964, - "total_submitted": 10915, + "total_acs": 5063, + "total_submitted": 11091, "frontend_question_id": 1998, "is_new_question": false }, @@ -6409,8 +6639,8 @@ "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": 6003, - "total_submitted": 16853, + "total_acs": 6068, + "total_submitted": 17061, "frontend_question_id": 1997, "is_new_question": false }, @@ -6432,8 +6662,8 @@ "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": 19494, - "total_submitted": 56168, + "total_acs": 20787, + "total_submitted": 58625, "frontend_question_id": 1996, "is_new_question": false }, @@ -6455,8 +6685,8 @@ "question__title": "Count Special Quadruplets", "question__title_slug": "count-special-quadruplets", "question__hide": false, - "total_acs": 20883, - "total_submitted": 35825, + "total_acs": 21191, + "total_submitted": 36347, "frontend_question_id": 1995, "is_new_question": false }, @@ -6478,8 +6708,8 @@ "question__title": "Find if Path Exists in Graph", "question__title_slug": "find-if-path-exists-in-graph", "question__hide": false, - "total_acs": 104283, - "total_submitted": 206112, + "total_acs": 108333, + "total_submitted": 214082, "frontend_question_id": 1971, "is_new_question": false }, @@ -6501,8 +6731,8 @@ "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": 4055, - "total_submitted": 7561, + "total_acs": 4254, + "total_submitted": 7876, "frontend_question_id": 1972, "is_new_question": false }, @@ -6524,8 +6754,8 @@ "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": 7179, - "total_submitted": 15735, + "total_acs": 7366, + "total_submitted": 16117, "frontend_question_id": 2009, "is_new_question": false }, @@ -6547,8 +6777,8 @@ "question__title": "Maximum Earnings From Taxi", "question__title_slug": "maximum-earnings-from-taxi", "question__hide": false, - "total_acs": 13720, - "total_submitted": 32022, + "total_acs": 14172, + "total_submitted": 33105, "frontend_question_id": 2008, "is_new_question": false }, @@ -6570,8 +6800,8 @@ "question__title": "Find Original Array From Doubled Array", "question__title_slug": "find-original-array-from-doubled-array", "question__hide": false, - "total_acs": 45795, - "total_submitted": 119366, + "total_acs": 46584, + "total_submitted": 121226, "frontend_question_id": 2007, "is_new_question": false }, @@ -6593,8 +6823,8 @@ "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": 54876, - "total_submitted": 66533, + "total_acs": 56603, + "total_submitted": 68662, "frontend_question_id": 2006, "is_new_question": false }, @@ -6616,8 +6846,8 @@ "question__title": "Number of Unique Good Subsequences", "question__title_slug": "number-of-unique-good-subsequences", "question__hide": false, - "total_acs": 7335, - "total_submitted": 14032, + "total_acs": 7458, + "total_submitted": 14254, "frontend_question_id": 1987, "is_new_question": false }, @@ -6639,8 +6869,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": 12983, - "total_submitted": 40404, + "total_acs": 13336, + "total_submitted": 41265, "frontend_question_id": 1986, "is_new_question": false }, @@ -6662,8 +6892,8 @@ "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": 30710, - "total_submitted": 68747, + "total_acs": 32267, + "total_submitted": 72058, "frontend_question_id": 1985, "is_new_question": false }, @@ -6685,8 +6915,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": 24567, - "total_submitted": 45974, + "total_acs": 25248, + "total_submitted": 47266, "frontend_question_id": 1984, "is_new_question": false }, @@ -6708,8 +6938,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": 1594, - "total_submitted": 2406, + "total_acs": 1625, + "total_submitted": 2452, "frontend_question_id": 1966, "is_new_question": false }, @@ -6731,8 +6961,8 @@ "question__title": "Employees With Missing Information", "question__title_slug": "employees-with-missing-information", "question__hide": false, - "total_acs": 21898, - "total_submitted": 26938, + "total_acs": 24795, + "total_submitted": 30396, "frontend_question_id": 1965, "is_new_question": false }, @@ -6754,8 +6984,8 @@ "question__title": "Find Array Given Subset Sums", "question__title_slug": "find-array-given-subset-sums", "question__hide": false, - "total_acs": 3264, - "total_submitted": 6673, + "total_acs": 3296, + "total_submitted": 6761, "frontend_question_id": 1982, "is_new_question": false }, @@ -6777,8 +7007,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": 15841, - "total_submitted": 48638, + "total_acs": 16082, + "total_submitted": 49445, "frontend_question_id": 1981, "is_new_question": false }, @@ -6800,8 +7030,8 @@ "question__title": "Find Unique Binary String", "question__title_slug": "find-unique-binary-string", "question__hide": false, - "total_acs": 25128, - "total_submitted": 39562, + "total_acs": 25536, + "total_submitted": 40221, "frontend_question_id": 1980, "is_new_question": false }, @@ -6823,8 +7053,8 @@ "question__title": "Find Greatest Common Divisor of Array", "question__title_slug": "find-greatest-common-divisor-of-array", "question__hide": false, - "total_acs": 45259, - "total_submitted": 58303, + "total_acs": 46571, + "total_submitted": 60032, "frontend_question_id": 1979, "is_new_question": false }, @@ -6846,8 +7076,8 @@ "question__title": "The Number of Good Subsets", "question__title_slug": "the-number-of-good-subsets", "question__hide": false, - "total_acs": 3834, - "total_submitted": 11200, + "total_acs": 3870, + "total_submitted": 11343, "frontend_question_id": 1994, "is_new_question": false }, @@ -6869,8 +7099,8 @@ "question__title": "Operations on Tree", "question__title_slug": "operations-on-tree", "question__hide": false, - "total_acs": 7369, - "total_submitted": 17262, + "total_acs": 7502, + "total_submitted": 17535, "frontend_question_id": 1993, "is_new_question": false }, @@ -6892,8 +7122,8 @@ "question__title": "Find All Groups of Farmland", "question__title_slug": "find-all-groups-of-farmland", "question__hide": false, - "total_acs": 14811, - "total_submitted": 21928, + "total_acs": 15136, + "total_submitted": 22365, "frontend_question_id": 1992, "is_new_question": false }, @@ -6915,8 +7145,8 @@ "question__title": "Find the Middle Index in Array", "question__title_slug": "find-the-middle-index-in-array", "question__hide": false, - "total_acs": 30856, - "total_submitted": 46573, + "total_acs": 32657, + "total_submitted": 49013, "frontend_question_id": 1991, "is_new_question": false }, @@ -6938,8 +7168,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": 8890, - "total_submitted": 18076, + "total_acs": 9015, + "total_submitted": 18295, "frontend_question_id": 1970, "is_new_question": false }, @@ -6961,8 +7191,8 @@ "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": 7211, - "total_submitted": 21882, + "total_acs": 7321, + "total_submitted": 22202, "frontend_question_id": 1969, "is_new_question": false }, @@ -6984,8 +7214,8 @@ "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": 31041, - "total_submitted": 38963, + "total_acs": 31717, + "total_submitted": 39773, "frontend_question_id": 1967, "is_new_question": false }, @@ -7007,8 +7237,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": 4499, - "total_submitted": 6232, + "total_acs": 4693, + "total_submitted": 6477, "frontend_question_id": 1951, "is_new_question": false }, @@ -7030,8 +7260,8 @@ "question__title": "Strong Friendship", "question__title_slug": "strong-friendship", "question__hide": false, - "total_acs": 5452, - "total_submitted": 9251, + "total_acs": 5630, + "total_submitted": 9563, "frontend_question_id": 1949, "is_new_question": false }, @@ -7053,8 +7283,8 @@ "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": 8651, - "total_submitted": 18813, + "total_acs": 8719, + "total_submitted": 18936, "frontend_question_id": 1964, "is_new_question": false }, @@ -7076,8 +7306,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": 29257, - "total_submitted": 43207, + "total_acs": 29871, + "total_submitted": 44061, "frontend_question_id": 1963, "is_new_question": false }, @@ -7099,8 +7329,8 @@ "question__title": "Remove Stones to Minimize the Total", "question__title_slug": "remove-stones-to-minimize-the-total", "question__hide": false, - "total_acs": 19095, - "total_submitted": 33489, + "total_acs": 19409, + "total_submitted": 34003, "frontend_question_id": 1962, "is_new_question": false }, @@ -7122,8 +7352,8 @@ "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": 26987, - "total_submitted": 49616, + "total_acs": 27368, + "total_submitted": 50322, "frontend_question_id": 1961, "is_new_question": false }, @@ -7145,8 +7375,8 @@ "question__title": "Users That Actively Request Confirmation Messages", "question__title_slug": "users-that-actively-request-confirmation-messages", "question__hide": false, - "total_acs": 5505, - "total_submitted": 8979, + "total_acs": 5639, + "total_submitted": 9185, "frontend_question_id": 1939, "is_new_question": false }, @@ -7168,8 +7398,8 @@ "question__title": "Number of Ways to Separate Numbers", "question__title_slug": "number-of-ways-to-separate-numbers", "question__hide": false, - "total_acs": 3019, - "total_submitted": 13615, + "total_acs": 3062, + "total_submitted": 13972, "frontend_question_id": 1977, "is_new_question": false }, @@ -7191,8 +7421,8 @@ "question__title": "Number of Ways to Arrive at Destination", "question__title_slug": "number-of-ways-to-arrive-at-destination", "question__hide": false, - "total_acs": 15685, - "total_submitted": 47601, + "total_acs": 16104, + "total_submitted": 48974, "frontend_question_id": 1976, "is_new_question": false }, @@ -7214,8 +7444,8 @@ "question__title": "Maximum Matrix Sum", "question__title_slug": "maximum-matrix-sum", "question__hide": false, - "total_acs": 10555, - "total_submitted": 23436, + "total_acs": 10668, + "total_submitted": 23637, "frontend_question_id": 1975, "is_new_question": false }, @@ -7237,8 +7467,8 @@ "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": 21267, - "total_submitted": 29776, + "total_acs": 21721, + "total_submitted": 30416, "frontend_question_id": 1974, "is_new_question": false }, @@ -7260,8 +7490,8 @@ "question__title": "Confirmation Rate", "question__title_slug": "confirmation-rate", "question__hide": false, - "total_acs": 7219, - "total_submitted": 9344, + "total_acs": 7375, + "total_submitted": 9530, "frontend_question_id": 1934, "is_new_question": false }, @@ -7283,8 +7513,8 @@ "question__title": "Count Number of Special Subsequences", "question__title_slug": "count-number-of-special-subsequences", "question__hide": false, - "total_acs": 7717, - "total_submitted": 15159, + "total_acs": 7792, + "total_submitted": 15327, "frontend_question_id": 1955, "is_new_question": false }, @@ -7306,8 +7536,8 @@ "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": 17224, - "total_submitted": 35352, + "total_acs": 17449, + "total_submitted": 35762, "frontend_question_id": 1968, "is_new_question": false }, @@ -7329,8 +7559,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": 15245, - "total_submitted": 40234, + "total_acs": 15470, + "total_submitted": 40748, "frontend_question_id": 1953, "is_new_question": false }, @@ -7352,8 +7582,8 @@ "question__title": "Three Divisors", "question__title_slug": "three-divisors", "question__hide": false, - "total_acs": 27992, - "total_submitted": 49439, + "total_acs": 28425, + "total_submitted": 50178, "frontend_question_id": 1952, "is_new_question": false }, @@ -7375,8 +7605,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": 1037, - "total_submitted": 1995, + "total_acs": 1050, + "total_submitted": 2034, "frontend_question_id": 2052, "is_new_question": false }, @@ -7398,8 +7628,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": 5585, - "total_submitted": 13385, + "total_acs": 5625, + "total_submitted": 13496, "frontend_question_id": 1959, "is_new_question": false }, @@ -7421,8 +7651,8 @@ "question__title": "Check if Move is Legal", "question__title_slug": "check-if-move-is-legal", "question__hide": false, - "total_acs": 7268, - "total_submitted": 16592, + "total_acs": 7320, + "total_submitted": 16708, "frontend_question_id": 1958, "is_new_question": false }, @@ -7444,8 +7674,8 @@ "question__title": "Delete Duplicate Folders in System", "question__title_slug": "delete-duplicate-folders-in-system", "question__hide": false, - "total_acs": 5308, - "total_submitted": 8989, + "total_acs": 5420, + "total_submitted": 9186, "frontend_question_id": 1948, "is_new_question": false }, @@ -7467,8 +7697,8 @@ "question__title": "Maximum Compatibility Score Sum", "question__title_slug": "maximum-compatibility-score-sum", "question__hide": false, - "total_acs": 14952, - "total_submitted": 24796, + "total_acs": 15160, + "total_submitted": 25153, "frontend_question_id": 1947, "is_new_question": false }, @@ -7490,8 +7720,8 @@ "question__title": "Largest Number After Mutating Substring", "question__title_slug": "largest-number-after-mutating-substring", "question__hide": false, - "total_acs": 14695, - "total_submitted": 42979, + "total_acs": 14838, + "total_submitted": 43375, "frontend_question_id": 1946, "is_new_question": false }, @@ -7513,8 +7743,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": 27453, - "total_submitted": 44807, + "total_acs": 27918, + "total_submitted": 45597, "frontend_question_id": 1945, "is_new_question": false }, @@ -7536,8 +7766,8 @@ "question__title": "Brightest Position on Street", "question__title_slug": "brightest-position-on-street", "question__hide": false, - "total_acs": 2880, - "total_submitted": 4574, + "total_acs": 2921, + "total_submitted": 4636, "frontend_question_id": 2021, "is_new_question": false }, @@ -7559,8 +7789,8 @@ "question__title": "Erect the Fence II", "question__title_slug": "erect-the-fence-ii", "question__hide": false, - "total_acs": 449, - "total_submitted": 828, + "total_acs": 454, + "total_submitted": 837, "frontend_question_id": 1924, "is_new_question": false }, @@ -7582,8 +7812,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": 488, - "total_submitted": 1075, + "total_acs": 502, + "total_submitted": 1098, "frontend_question_id": 1956, "is_new_question": false }, @@ -7605,8 +7835,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": 1755, - "total_submitted": 3477, + "total_acs": 1813, + "total_submitted": 3596, "frontend_question_id": 1950, "is_new_question": false }, @@ -7628,8 +7858,8 @@ "question__title": "Longest Common Subsequence Between Sorted Arrays", "question__title_slug": "longest-common-subsequence-between-sorted-arrays", "question__hide": false, - "total_acs": 3692, - "total_submitted": 4669, + "total_acs": 3760, + "total_submitted": 4751, "frontend_question_id": 1940, "is_new_question": false }, @@ -7651,8 +7881,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": 2150, - "total_submitted": 4244, + "total_acs": 2196, + "total_submitted": 4348, "frontend_question_id": 1933, "is_new_question": false }, @@ -7674,8 +7904,8 @@ "question__title": "Kth Smallest Subarray Sum", "question__title_slug": "kth-smallest-subarray-sum", "question__hide": false, - "total_acs": 2280, - "total_submitted": 4278, + "total_acs": 2324, + "total_submitted": 4383, "frontend_question_id": 1918, "is_new_question": false }, @@ -7697,8 +7927,8 @@ "question__title": "Maximum Genetic Difference Query", "question__title_slug": "maximum-genetic-difference-query", "question__hide": false, - "total_acs": 3414, - "total_submitted": 8791, + "total_acs": 3493, + "total_submitted": 8923, "frontend_question_id": 1938, "is_new_question": false }, @@ -7720,8 +7950,8 @@ "question__title": "Maximum Number of Points with Cost", "question__title_slug": "maximum-number-of-points-with-cost", "question__hide": false, - "total_acs": 41717, - "total_submitted": 116631, + "total_acs": 42952, + "total_submitted": 119874, "frontend_question_id": 1937, "is_new_question": false }, @@ -7743,8 +7973,8 @@ "question__title": "Add Minimum Number of Rungs", "question__title_slug": "add-minimum-number-of-rungs", "question__hide": false, - "total_acs": 19347, - "total_submitted": 45482, + "total_acs": 19552, + "total_submitted": 45932, "frontend_question_id": 1936, "is_new_question": false }, @@ -7766,10 +7996,10 @@ "question__title": "Check for Contradictions in Equations", "question__title_slug": "check-for-contradictions-in-equations", "question__hide": false, - "total_acs": 184, - "total_submitted": 385, + "total_acs": 320, + "total_submitted": 905, "frontend_question_id": 2307, - "is_new_question": true + "is_new_question": false }, "status": null, "difficulty": { @@ -7789,8 +8019,8 @@ "question__title": "Leetcodify Similar Friends", "question__title_slug": "leetcodify-similar-friends", "question__hide": false, - "total_acs": 2868, - "total_submitted": 6702, + "total_acs": 2955, + "total_submitted": 6894, "frontend_question_id": 1919, "is_new_question": false }, @@ -7812,8 +8042,8 @@ "question__title": "Leetcodify Friends Recommendations", "question__title_slug": "leetcodify-friends-recommendations", "question__hide": false, - "total_acs": 3654, - "total_submitted": 12176, + "total_acs": 3733, + "total_submitted": 12444, "frontend_question_id": 1917, "is_new_question": false }, @@ -7835,8 +8065,8 @@ "question__title": "Game of Nim", "question__title_slug": "game-of-nim", "question__hide": false, - "total_acs": 1013, - "total_submitted": 1753, + "total_acs": 1024, + "total_submitted": 1767, "frontend_question_id": 1908, "is_new_question": false }, @@ -7858,8 +8088,8 @@ "question__title": "Painting a Grid With Three Different Colors", "question__title_slug": "painting-a-grid-with-three-different-colors", "question__hide": false, - "total_acs": 6502, - "total_submitted": 11360, + "total_acs": 6551, + "total_submitted": 11450, "frontend_question_id": 1931, "is_new_question": false }, @@ -7881,8 +8111,8 @@ "question__title": "Merge BSTs to Create Single BST", "question__title_slug": "merge-bsts-to-create-single-bst", "question__hide": false, - "total_acs": 4765, - "total_submitted": 13577, + "total_acs": 4851, + "total_submitted": 13822, "frontend_question_id": 1932, "is_new_question": false }, @@ -7904,8 +8134,8 @@ "question__title": "Unique Length-3 Palindromic Subsequences", "question__title_slug": "unique-length-3-palindromic-subsequences", "question__hide": false, - "total_acs": 16365, - "total_submitted": 31894, + "total_acs": 16528, + "total_submitted": 32183, "frontend_question_id": 1930, "is_new_question": false }, @@ -7927,8 +8157,8 @@ "question__title": "Concatenation of Array", "question__title_slug": "concatenation-of-array", "question__hide": false, - "total_acs": 200765, - "total_submitted": 219293, + "total_acs": 207351, + "total_submitted": 226473, "frontend_question_id": 1929, "is_new_question": false }, @@ -7950,8 +8180,8 @@ "question__title": "Count Salary Categories", "question__title_slug": "count-salary-categories", "question__hide": false, - "total_acs": 5743, - "total_submitted": 8834, + "total_acs": 5894, + "total_submitted": 9116, "frontend_question_id": 1907, "is_new_question": false }, @@ -7973,8 +8203,8 @@ "question__title": "Jump Game VIII", "question__title_slug": "jump-game-viii", "question__hide": false, - "total_acs": 301, - "total_submitted": 472, + "total_acs": 425, + "total_submitted": 662, "frontend_question_id": 2297, "is_new_question": false }, @@ -7996,8 +8226,8 @@ "question__title": "Describe the Painting", "question__title_slug": "describe-the-painting", "question__hide": false, - "total_acs": 7953, - "total_submitted": 16858, + "total_acs": 8042, + "total_submitted": 17029, "frontend_question_id": 1943, "is_new_question": false }, @@ -8019,8 +8249,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": 11472, - "total_submitted": 29204, + "total_acs": 11592, + "total_submitted": 29426, "frontend_question_id": 1942, "is_new_question": false }, @@ -8042,8 +8272,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": 38047, - "total_submitted": 49367, + "total_acs": 38914, + "total_submitted": 50468, "frontend_question_id": 1941, "is_new_question": false }, @@ -8065,8 +8295,8 @@ "question__title": "Depth of BST Given Insertion Order", "question__title_slug": "depth-of-bst-given-insertion-order", "question__hide": false, - "total_acs": 1469, - "total_submitted": 3234, + "total_acs": 1477, + "total_submitted": 3268, "frontend_question_id": 1902, "is_new_question": false }, @@ -8088,8 +8318,8 @@ "question__title": "Longest Common Subpath", "question__title_slug": "longest-common-subpath", "question__hide": false, - "total_acs": 4998, - "total_submitted": 17675, + "total_acs": 5048, + "total_submitted": 17864, "frontend_question_id": 1923, "is_new_question": false }, @@ -8111,8 +8341,8 @@ "question__title": "Count Good Numbers", "question__title_slug": "count-good-numbers", "question__hide": false, - "total_acs": 15948, - "total_submitted": 41748, + "total_acs": 16177, + "total_submitted": 42310, "frontend_question_id": 1922, "is_new_question": false }, @@ -8134,8 +8364,8 @@ "question__title": "Eliminate Maximum Number of Monsters", "question__title_slug": "eliminate-maximum-number-of-monsters", "question__hide": false, - "total_acs": 16738, - "total_submitted": 44392, + "total_acs": 16910, + "total_submitted": 44801, "frontend_question_id": 1921, "is_new_question": false }, @@ -8157,8 +8387,8 @@ "question__title": "Build Array from Permutation", "question__title_slug": "build-array-from-permutation", "question__hide": false, - "total_acs": 173181, - "total_submitted": 189185, + "total_acs": 178300, + "total_submitted": 194797, "frontend_question_id": 1920, "is_new_question": false }, @@ -8180,8 +8410,8 @@ "question__title": "Find a Peak Element II", "question__title_slug": "find-a-peak-element-ii", "question__hide": false, - "total_acs": 22247, - "total_submitted": 41386, + "total_acs": 22857, + "total_submitted": 42525, "frontend_question_id": 1901, "is_new_question": false }, @@ -8203,8 +8433,8 @@ "question__title": "Page Recommendations II", "question__title_slug": "page-recommendations-ii", "question__hide": false, - "total_acs": 3858, - "total_submitted": 8643, + "total_acs": 3927, + "total_submitted": 8783, "frontend_question_id": 1892, "is_new_question": false }, @@ -8226,8 +8456,8 @@ "question__title": "Cutting Ribbons", "question__title_slug": "cutting-ribbons", "question__hide": false, - "total_acs": 42329, - "total_submitted": 87907, + "total_acs": 42972, + "total_submitted": 89306, "frontend_question_id": 1891, "is_new_question": false }, @@ -8249,8 +8479,8 @@ "question__title": "Number of Wonderful Substrings", "question__title_slug": "number-of-wonderful-substrings", "question__hide": false, - "total_acs": 8932, - "total_submitted": 20340, + "total_acs": 9016, + "total_submitted": 20498, "frontend_question_id": 1915, "is_new_question": false }, @@ -8272,8 +8502,8 @@ "question__title": "Cyclically Rotating a Grid", "question__title_slug": "cyclically-rotating-a-grid", "question__hide": false, - "total_acs": 9663, - "total_submitted": 20421, + "total_acs": 9700, + "total_submitted": 20478, "frontend_question_id": 1914, "is_new_question": false }, @@ -8295,8 +8525,8 @@ "question__title": "Maximum Product Difference Between Two Pairs", "question__title_slug": "maximum-product-difference-between-two-pairs", "question__hide": false, - "total_acs": 53803, - "total_submitted": 66191, + "total_acs": 55100, + "total_submitted": 67791, "frontend_question_id": 1913, "is_new_question": false }, @@ -8318,8 +8548,8 @@ "question__title": "The Latest Login in 2020", "question__title_slug": "the-latest-login-in-2020", "question__hide": false, - "total_acs": 16845, - "total_submitted": 20480, + "total_acs": 18727, + "total_submitted": 22781, "frontend_question_id": 1890, "is_new_question": false }, @@ -8341,8 +8571,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": 10861, - "total_submitted": 28950, + "total_acs": 11041, + "total_submitted": 29376, "frontend_question_id": 1928, "is_new_question": false }, @@ -8364,8 +8594,8 @@ "question__title": "Sum Game", "question__title_slug": "sum-game", "question__hide": false, - "total_acs": 6886, - "total_submitted": 14569, + "total_acs": 6955, + "total_submitted": 14714, "frontend_question_id": 1927, "is_new_question": false }, @@ -8387,8 +8617,8 @@ "question__title": "Nearest Exit from Entrance in Maze", "question__title_slug": "nearest-exit-from-entrance-in-maze", "question__hide": false, - "total_acs": 21459, - "total_submitted": 51604, + "total_acs": 22348, + "total_submitted": 53343, "frontend_question_id": 1926, "is_new_question": false }, @@ -8410,8 +8640,8 @@ "question__title": "Count Square Sum Triples", "question__title_slug": "count-square-sum-triples", "question__hide": false, - "total_acs": 22985, - "total_submitted": 33910, + "total_acs": 23322, + "total_submitted": 34433, "frontend_question_id": 1925, "is_new_question": false }, @@ -8433,8 +8663,8 @@ "question__title": "Count Pairs in Two Arrays", "question__title_slug": "count-pairs-in-two-arrays", "question__hide": false, - "total_acs": 2293, - "total_submitted": 3921, + "total_acs": 2325, + "total_submitted": 3977, "frontend_question_id": 1885, "is_new_question": false }, @@ -8456,8 +8686,8 @@ "question__title": "Count Sub Islands", "question__title_slug": "count-sub-islands", "question__hide": false, - "total_acs": 37437, - "total_submitted": 55988, + "total_acs": 39107, + "total_submitted": 58323, "frontend_question_id": 1905, "is_new_question": false }, @@ -8479,8 +8709,8 @@ "question__title": "Minimum Absolute Difference Queries", "question__title_slug": "minimum-absolute-difference-queries", "question__hide": false, - "total_acs": 8066, - "total_submitted": 18550, + "total_acs": 8194, + "total_submitted": 18757, "frontend_question_id": 1906, "is_new_question": false }, @@ -8502,8 +8732,8 @@ "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": 16614, - "total_submitted": 35738, + "total_acs": 16742, + "total_submitted": 36074, "frontend_question_id": 1904, "is_new_question": false }, @@ -8525,8 +8755,8 @@ "question__title": "Largest Odd Number in String", "question__title_slug": "largest-odd-number-in-string", "question__hide": false, - "total_acs": 34266, - "total_submitted": 60740, + "total_acs": 34856, + "total_submitted": 61828, "frontend_question_id": 1903, "is_new_question": false }, @@ -8548,8 +8778,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": 22361, - "total_submitted": 31961, + "total_acs": 22936, + "total_submitted": 32726, "frontend_question_id": 1884, "is_new_question": false }, @@ -8571,8 +8801,8 @@ "question__title": "Group Employees of the Same Salary", "question__title_slug": "group-employees-of-the-same-salary", "question__hide": false, - "total_acs": 5957, - "total_submitted": 7876, + "total_acs": 6100, + "total_submitted": 8068, "frontend_question_id": 1875, "is_new_question": false }, @@ -8594,8 +8824,8 @@ "question__title": "Minimize Product Sum of Two Arrays", "question__title_slug": "minimize-product-sum-of-two-arrays", "question__hide": false, - "total_acs": 12463, - "total_submitted": 13715, + "total_acs": 12629, + "total_submitted": 13897, "frontend_question_id": 1874, "is_new_question": false }, @@ -8617,8 +8847,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": 4029, - "total_submitted": 7798, + "total_acs": 4062, + "total_submitted": 7865, "frontend_question_id": 1900, "is_new_question": false }, @@ -8640,8 +8870,8 @@ "question__title": "Maximum Number of Removable Characters", "question__title_slug": "maximum-number-of-removable-characters", "question__hide": false, - "total_acs": 14798, - "total_submitted": 39175, + "total_acs": 15141, + "total_submitted": 39810, "frontend_question_id": 1898, "is_new_question": false }, @@ -8663,8 +8893,8 @@ "question__title": "Merge Triplets to Form Target Triplet", "question__title_slug": "merge-triplets-to-form-target-triplet", "question__hide": false, - "total_acs": 15684, - "total_submitted": 25259, + "total_acs": 16285, + "total_submitted": 26148, "frontend_question_id": 1899, "is_new_question": false }, @@ -8686,8 +8916,8 @@ "question__title": "Redistribute Characters to Make All Strings Equal", "question__title_slug": "redistribute-characters-to-make-all-strings-equal", "question__hide": false, - "total_acs": 22989, - "total_submitted": 38291, + "total_acs": 23250, + "total_submitted": 38706, "frontend_question_id": 1897, "is_new_question": false }, @@ -8709,8 +8939,8 @@ "question__title": "Calculate Special Bonus", "question__title_slug": "calculate-special-bonus", "question__hide": false, - "total_acs": 39945, - "total_submitted": 49901, + "total_acs": 44895, + "total_submitted": 58980, "frontend_question_id": 1873, "is_new_question": false }, @@ -8732,8 +8962,8 @@ "question__title": "Design Movie Rental System", "question__title_slug": "design-movie-rental-system", "question__hide": false, - "total_acs": 4078, - "total_submitted": 9850, + "total_acs": 4110, + "total_submitted": 9943, "frontend_question_id": 1912, "is_new_question": false }, @@ -8755,8 +8985,8 @@ "question__title": "Maximum Alternating Subsequence Sum", "question__title_slug": "maximum-alternating-subsequence-sum", "question__hide": false, - "total_acs": 16951, - "total_submitted": 28655, + "total_acs": 17342, + "total_submitted": 29312, "frontend_question_id": 1911, "is_new_question": false }, @@ -8778,8 +9008,8 @@ "question__title": "Remove All Occurrences of a Substring", "question__title_slug": "remove-all-occurrences-of-a-substring", "question__hide": false, - "total_acs": 29971, - "total_submitted": 41395, + "total_acs": 30770, + "total_submitted": 42456, "frontend_question_id": 1910, "is_new_question": false }, @@ -8801,8 +9031,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": 28944, - "total_submitted": 108141, + "total_acs": 29695, + "total_submitted": 111243, "frontend_question_id": 1909, "is_new_question": false }, @@ -8824,8 +9054,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": 21567, - "total_submitted": 37246, + "total_acs": 21867, + "total_submitted": 37789, "frontend_question_id": 1868, "is_new_question": false }, @@ -8847,8 +9077,8 @@ "question__title": "Minimum Space Wasted From Packaging", "question__title_slug": "minimum-space-wasted-from-packaging", "question__hide": false, - "total_acs": 8023, - "total_submitted": 26453, + "total_acs": 8122, + "total_submitted": 26728, "frontend_question_id": 1889, "is_new_question": false }, @@ -8870,8 +9100,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": 12775, - "total_submitted": 34316, + "total_acs": 12930, + "total_submitted": 34717, "frontend_question_id": 1888, "is_new_question": false }, @@ -8893,8 +9123,8 @@ "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": 17315, - "total_submitted": 28004, + "total_acs": 17507, + "total_submitted": 28271, "frontend_question_id": 1887, "is_new_question": false }, @@ -8916,8 +9146,8 @@ "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": 33350, - "total_submitted": 60142, + "total_acs": 34237, + "total_submitted": 61735, "frontend_question_id": 1886, "is_new_question": false }, @@ -8939,8 +9169,8 @@ "question__title": "Orders With Maximum Quantity Above Average", "question__title_slug": "orders-with-maximum-quantity-above-average", "question__hide": false, - "total_acs": 7866, - "total_submitted": 10391, + "total_acs": 8146, + "total_submitted": 10831, "frontend_question_id": 1867, "is_new_question": false }, @@ -8962,8 +9192,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": 4801, - "total_submitted": 12414, + "total_acs": 4835, + "total_submitted": 12544, "frontend_question_id": 1883, "is_new_question": false }, @@ -8985,8 +9215,8 @@ "question__title": "Process Tasks Using Servers", "question__title_slug": "process-tasks-using-servers", "question__hide": false, - "total_acs": 18505, - "total_submitted": 48500, + "total_acs": 19068, + "total_submitted": 49601, "frontend_question_id": 1882, "is_new_question": false }, @@ -9008,8 +9238,8 @@ "question__title": "Maximum Value after Insertion", "question__title_slug": "maximum-value-after-insertion", "question__hide": false, - "total_acs": 18739, - "total_submitted": 52064, + "total_acs": 18923, + "total_submitted": 52465, "frontend_question_id": 1881, "is_new_question": false }, @@ -9031,8 +9261,8 @@ "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": 41197, - "total_submitted": 56101, + "total_acs": 41581, + "total_submitted": 56606, "frontend_question_id": 1880, "is_new_question": false }, @@ -9054,8 +9284,8 @@ "question__title": "Longest Word With All Prefixes", "question__title_slug": "longest-word-with-all-prefixes", "question__hide": false, - "total_acs": 4242, - "total_submitted": 6412, + "total_acs": 4335, + "total_submitted": 6575, "frontend_question_id": 1858, "is_new_question": false }, @@ -9077,8 +9307,8 @@ "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": 2718, - "total_submitted": 5039, + "total_acs": 2746, + "total_submitted": 5086, "frontend_question_id": 1896, "is_new_question": false }, @@ -9100,8 +9330,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": 617, - "total_submitted": 1221, + "total_acs": 668, + "total_submitted": 1308, "frontend_question_id": 2247, "is_new_question": false }, @@ -9123,8 +9353,8 @@ "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": 20148, - "total_submitted": 47602, + "total_acs": 20643, + "total_submitted": 48589, "frontend_question_id": 1894, "is_new_question": false }, @@ -9146,8 +9376,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": 22627, - "total_submitted": 44291, + "total_acs": 22910, + "total_submitted": 44878, "frontend_question_id": 1893, "is_new_question": false }, @@ -9169,8 +9399,8 @@ "question__title": "Convert Date Format", "question__title_slug": "convert-date-format", "question__hide": false, - "total_acs": 7291, - "total_submitted": 8329, + "total_acs": 7425, + "total_submitted": 8470, "frontend_question_id": 1853, "is_new_question": false }, @@ -9192,8 +9422,8 @@ "question__title": "Distinct Numbers in Each Subarray", "question__title_slug": "distinct-numbers-in-each-subarray", "question__hide": false, - "total_acs": 4037, - "total_submitted": 5580, + "total_acs": 4101, + "total_submitted": 5675, "frontend_question_id": 1852, "is_new_question": false }, @@ -9215,8 +9445,8 @@ "question__title": "Stone Game VIII", "question__title_slug": "stone-game-viii", "question__hide": false, - "total_acs": 5745, - "total_submitted": 10994, + "total_acs": 5797, + "total_submitted": 11115, "frontend_question_id": 1872, "is_new_question": false }, @@ -9238,8 +9468,8 @@ "question__title": "Jump Game VII", "question__title_slug": "jump-game-vii", "question__hide": false, - "total_acs": 24151, - "total_submitted": 96665, + "total_acs": 24592, + "total_submitted": 98195, "frontend_question_id": 1871, "is_new_question": false }, @@ -9261,8 +9491,8 @@ "question__title": "Minimum Speed to Arrive on Time", "question__title_slug": "minimum-speed-to-arrive-on-time", "question__hide": false, - "total_acs": 20146, - "total_submitted": 55002, + "total_acs": 20555, + "total_submitted": 56075, "frontend_question_id": 1870, "is_new_question": false }, @@ -9284,8 +9514,8 @@ "question__title": "Longer Contiguous Segments of Ones than Zeros", "question__title_slug": "longer-contiguous-segments-of-ones-than-zeros", "question__hide": false, - "total_acs": 29950, - "total_submitted": 49586, + "total_acs": 30331, + "total_submitted": 50234, "frontend_question_id": 1869, "is_new_question": false }, @@ -9307,8 +9537,8 @@ "question__title": "Suspicious Bank Accounts", "question__title_slug": "suspicious-bank-accounts", "question__hide": false, - "total_acs": 5878, - "total_submitted": 12282, + "total_acs": 6033, + "total_submitted": 12605, "frontend_question_id": 1843, "is_new_question": false }, @@ -9330,8 +9560,8 @@ "question__title": "Next Palindrome Using Same Digits", "question__title_slug": "next-palindrome-using-same-digits", "question__hide": false, - "total_acs": 2437, - "total_submitted": 4508, + "total_acs": 2604, + "total_submitted": 4812, "frontend_question_id": 1842, "is_new_question": false }, @@ -9353,8 +9583,8 @@ "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": 8406, - "total_submitted": 15158, + "total_acs": 8511, + "total_submitted": 15377, "frontend_question_id": 1866, "is_new_question": false }, @@ -9376,8 +9606,8 @@ "question__title": "Finding Pairs With a Certain Sum", "question__title_slug": "finding-pairs-with-a-certain-sum", "question__hide": false, - "total_acs": 16181, - "total_submitted": 32614, + "total_acs": 16391, + "total_submitted": 33010, "frontend_question_id": 1865, "is_new_question": false }, @@ -9399,8 +9629,8 @@ "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": 14216, - "total_submitted": 36101, + "total_acs": 14452, + "total_submitted": 36696, "frontend_question_id": 1864, "is_new_question": false }, @@ -9422,8 +9652,8 @@ "question__title": "Sum of All Subset XOR Totals", "question__title_slug": "sum-of-all-subset-xor-totals", "question__hide": false, - "total_acs": 35588, - "total_submitted": 45230, + "total_acs": 36304, + "total_submitted": 46153, "frontend_question_id": 1863, "is_new_question": false }, @@ -9445,8 +9675,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": 2964, - "total_submitted": 4300, + "total_acs": 3033, + "total_submitted": 4404, "frontend_question_id": 2046, "is_new_question": false }, @@ -9468,8 +9698,8 @@ "question__title": "League Statistics", "question__title_slug": "league-statistics", "question__hide": false, - "total_acs": 7045, - "total_submitted": 12258, + "total_acs": 7267, + "total_submitted": 12661, "frontend_question_id": 1841, "is_new_question": false }, @@ -9491,8 +9721,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": 9918, - "total_submitted": 21632, + "total_acs": 10015, + "total_submitted": 21844, "frontend_question_id": 1878, "is_new_question": false }, @@ -9514,8 +9744,8 @@ "question__title": "Minimum XOR Sum of Two Arrays", "question__title_slug": "minimum-xor-sum-of-two-arrays", "question__hide": false, - "total_acs": 8132, - "total_submitted": 18963, + "total_acs": 8234, + "total_submitted": 19147, "frontend_question_id": 1879, "is_new_question": false }, @@ -9537,8 +9767,8 @@ "question__title": "Minimize Maximum Pair Sum in Array", "question__title_slug": "minimize-maximum-pair-sum-in-array", "question__hide": false, - "total_acs": 51450, - "total_submitted": 63828, + "total_acs": 52273, + "total_submitted": 64832, "frontend_question_id": 1877, "is_new_question": false }, @@ -9560,8 +9790,8 @@ "question__title": "Substrings of Size Three with Distinct Characters", "question__title_slug": "substrings-of-size-three-with-distinct-characters", "question__hide": false, - "total_acs": 45925, - "total_submitted": 65833, + "total_acs": 47106, + "total_submitted": 67473, "frontend_question_id": 1876, "is_new_question": false }, @@ -9583,8 +9813,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": 11599, - "total_submitted": 29099, + "total_acs": 11775, + "total_submitted": 29504, "frontend_question_id": 1857, "is_new_question": false }, @@ -9606,8 +9836,8 @@ "question__title": "Maximum Subarray Min-Product", "question__title_slug": "maximum-subarray-min-product", "question__hide": false, - "total_acs": 13985, - "total_submitted": 38521, + "total_acs": 14359, + "total_submitted": 39418, "frontend_question_id": 1856, "is_new_question": false }, @@ -9629,8 +9859,8 @@ "question__title": "Maximum Distance Between a Pair of Values", "question__title_slug": "maximum-distance-between-a-pair-of-values", "question__hide": false, - "total_acs": 27082, - "total_submitted": 52539, + "total_acs": 28243, + "total_submitted": 54443, "frontend_question_id": 1855, "is_new_question": false }, @@ -9652,8 +9882,8 @@ "question__title": "Maximum Population Year", "question__title_slug": "maximum-population-year", "question__hide": false, - "total_acs": 32196, - "total_submitted": 54590, + "total_acs": 32811, + "total_submitted": 55527, "frontend_question_id": 1854, "is_new_question": false }, @@ -9675,8 +9905,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": 14279, - "total_submitted": 20652, + "total_acs": 14694, + "total_submitted": 21285, "frontend_question_id": 1836, "is_new_question": false }, @@ -9698,8 +9928,8 @@ "question__title": "Maximum Transaction Each Day", "question__title_slug": "maximum-transaction-each-day", "question__hide": false, - "total_acs": 8203, - "total_submitted": 9874, + "total_acs": 8410, + "total_submitted": 10105, "frontend_question_id": 1831, "is_new_question": false }, @@ -9721,8 +9951,8 @@ "question__title": "Faulty Sensor", "question__title_slug": "faulty-sensor", "question__hide": false, - "total_acs": 2806, - "total_submitted": 5685, + "total_acs": 2832, + "total_submitted": 5740, "frontend_question_id": 1826, "is_new_question": false }, @@ -9744,8 +9974,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": 1170, - "total_submitted": 2181, + "total_acs": 1192, + "total_submitted": 2234, "frontend_question_id": 1989, "is_new_question": false }, @@ -9767,8 +9997,8 @@ "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": 14507, - "total_submitted": 20171, + "total_acs": 14628, + "total_submitted": 20373, "frontend_question_id": 1850, "is_new_question": false }, @@ -9790,8 +10020,8 @@ "question__title": "Minimum Interval to Include Each Query", "question__title_slug": "minimum-interval-to-include-each-query", "question__hide": false, - "total_acs": 7961, - "total_submitted": 17276, + "total_acs": 8432, + "total_submitted": 18117, "frontend_question_id": 1851, "is_new_question": false }, @@ -9813,8 +10043,8 @@ "question__title": "Splitting a String Into Descending Consecutive Values", "question__title_slug": "splitting-a-string-into-descending-consecutive-values", "question__hide": false, - "total_acs": 14931, - "total_submitted": 47253, + "total_acs": 15095, + "total_submitted": 47729, "frontend_question_id": 1849, "is_new_question": false }, @@ -9836,8 +10066,8 @@ "question__title": "Minimum Distance to the Target Element", "question__title_slug": "minimum-distance-to-the-target-element", "question__hide": false, - "total_acs": 26118, - "total_submitted": 43875, + "total_acs": 26440, + "total_submitted": 44448, "frontend_question_id": 1848, "is_new_question": false }, @@ -9859,8 +10089,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": 10498, - "total_submitted": 11704, + "total_acs": 10685, + "total_submitted": 11921, "frontend_question_id": 1821, "is_new_question": false }, @@ -9882,8 +10112,8 @@ "question__title": "Rotating the Box", "question__title_slug": "rotating-the-box", "question__hide": false, - "total_acs": 28327, - "total_submitted": 43723, + "total_acs": 28897, + "total_submitted": 44565, "frontend_question_id": 1861, "is_new_question": false }, @@ -9905,8 +10135,8 @@ "question__title": "Incremental Memory Leak", "question__title_slug": "incremental-memory-leak", "question__hide": false, - "total_acs": 12736, - "total_submitted": 17873, + "total_acs": 12829, + "total_submitted": 17997, "frontend_question_id": 1860, "is_new_question": false }, @@ -9928,8 +10158,8 @@ "question__title": "Sorting the Sentence", "question__title_slug": "sorting-the-sentence", "question__hide": false, - "total_acs": 69794, - "total_submitted": 82711, + "total_acs": 71454, + "total_submitted": 84654, "frontend_question_id": 1859, "is_new_question": false }, @@ -9951,8 +10181,8 @@ "question__title": "Maximum Number of Accepted Invitations", "question__title_slug": "maximum-number-of-accepted-invitations", "question__hide": false, - "total_acs": 2280, - "total_submitted": 4766, + "total_acs": 2568, + "total_submitted": 5297, "frontend_question_id": 1820, "is_new_question": false }, @@ -9974,8 +10204,8 @@ "question__title": "Maximum Building Height", "question__title_slug": "maximum-building-height", "question__hide": false, - "total_acs": 5180, - "total_submitted": 14754, + "total_acs": 5213, + "total_submitted": 14830, "frontend_question_id": 1840, "is_new_question": false }, @@ -9997,8 +10227,8 @@ "question__title": "Longest Substring Of All Vowels in Order", "question__title_slug": "longest-substring-of-all-vowels-in-order", "question__hide": false, - "total_acs": 19125, - "total_submitted": 39803, + "total_acs": 19354, + "total_submitted": 40220, "frontend_question_id": 1839, "is_new_question": false }, @@ -10020,8 +10250,8 @@ "question__title": "Frequency of the Most Frequent Element", "question__title_slug": "frequency-of-the-most-frequent-element", "question__hide": false, - "total_acs": 23931, - "total_submitted": 63860, + "total_acs": 24566, + "total_submitted": 65450, "frontend_question_id": 1838, "is_new_question": false }, @@ -10043,8 +10273,8 @@ "question__title": "Sum of Digits in Base K", "question__title_slug": "sum-of-digits-in-base-k", "question__hide": false, - "total_acs": 29110, - "total_submitted": 38055, + "total_acs": 29521, + "total_submitted": 38549, "frontend_question_id": 1837, "is_new_question": false }, @@ -10066,8 +10296,8 @@ "question__title": "Find Interview Candidates", "question__title_slug": "find-interview-candidates", "question__hide": false, - "total_acs": 9296, - "total_submitted": 14326, + "total_acs": 9521, + "total_submitted": 14713, "frontend_question_id": 1811, "is_new_question": false }, @@ -10089,8 +10319,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": 10901, - "total_submitted": 18433, + "total_acs": 11046, + "total_submitted": 18652, "frontend_question_id": 1835, "is_new_question": false }, @@ -10112,8 +10342,8 @@ "question__title": "Single-Threaded CPU", "question__title_slug": "single-threaded-cpu", "question__hide": false, - "total_acs": 37467, - "total_submitted": 90545, + "total_acs": 38144, + "total_submitted": 91904, "frontend_question_id": 1834, "is_new_question": false }, @@ -10135,8 +10365,8 @@ "question__title": "Maximum Ice Cream Bars", "question__title_slug": "maximum-ice-cream-bars", "question__hide": false, - "total_acs": 32947, - "total_submitted": 50647, + "total_acs": 33240, + "total_submitted": 51038, "frontend_question_id": 1833, "is_new_question": false }, @@ -10158,8 +10388,8 @@ "question__title": "Check if the Sentence Is Pangram", "question__title_slug": "check-if-the-sentence-is-pangram", "question__hide": false, - "total_acs": 89553, - "total_submitted": 110032, + "total_acs": 91353, + "total_submitted": 112259, "frontend_question_id": 1832, "is_new_question": false }, @@ -10181,8 +10411,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": 1927, - "total_submitted": 3553, + "total_acs": 1941, + "total_submitted": 3581, "frontend_question_id": 1810, "is_new_question": false }, @@ -10204,8 +10434,8 @@ "question__title": "Ad-Free Sessions", "question__title_slug": "ad-free-sessions", "question__hide": false, - "total_acs": 9600, - "total_submitted": 16037, + "total_acs": 9768, + "total_submitted": 16316, "frontend_question_id": 1809, "is_new_question": false }, @@ -10227,8 +10457,8 @@ "question__title": "Closest Room", "question__title_slug": "closest-room", "question__hide": false, - "total_acs": 5705, - "total_submitted": 16783, + "total_acs": 5774, + "total_submitted": 16904, "frontend_question_id": 1847, "is_new_question": false }, @@ -10250,8 +10480,8 @@ "question__title": "Maximum Element After Decreasing and Rearranging", "question__title_slug": "maximum-element-after-decreasing-and-rearranging", "question__hide": false, - "total_acs": 14518, - "total_submitted": 24928, + "total_acs": 14675, + "total_submitted": 25187, "frontend_question_id": 1846, "is_new_question": false }, @@ -10273,8 +10503,8 @@ "question__title": "Seat Reservation Manager", "question__title_slug": "seat-reservation-manager", "question__hide": false, - "total_acs": 20419, - "total_submitted": 32836, + "total_acs": 20955, + "total_submitted": 33553, "frontend_question_id": 1845, "is_new_question": false }, @@ -10296,8 +10526,8 @@ "question__title": "Replace All Digits with Characters", "question__title_slug": "replace-all-digits-with-characters", "question__hide": false, - "total_acs": 42433, - "total_submitted": 53149, + "total_acs": 43129, + "total_submitted": 54038, "frontend_question_id": 1844, "is_new_question": false }, @@ -10319,8 +10549,8 @@ "question__title": "Finding MK Average", "question__title_slug": "finding-mk-average", "question__hide": false, - "total_acs": 7500, - "total_submitted": 21947, + "total_acs": 7702, + "total_submitted": 22553, "frontend_question_id": 1825, "is_new_question": false }, @@ -10342,8 +10572,8 @@ "question__title": "Minimum Sideway Jumps", "question__title_slug": "minimum-sideway-jumps", "question__hide": false, - "total_acs": 16864, - "total_submitted": 34211, + "total_acs": 17108, + "total_submitted": 34643, "frontend_question_id": 1824, "is_new_question": false }, @@ -10365,8 +10595,8 @@ "question__title": "Find the Winner of the Circular Game", "question__title_slug": "find-the-winner-of-the-circular-game", "question__hide": false, - "total_acs": 50303, - "total_submitted": 65633, + "total_acs": 51998, + "total_submitted": 67742, "frontend_question_id": 1823, "is_new_question": false }, @@ -10388,8 +10618,8 @@ "question__title": "Sign of the Product of an Array", "question__title_slug": "sign-of-the-product-of-an-array", "question__hide": false, - "total_acs": 107270, - "total_submitted": 159915, + "total_acs": 110481, + "total_submitted": 164828, "frontend_question_id": 1822, "is_new_question": false }, @@ -10411,8 +10641,8 @@ "question__title": "Implement Trie II (Prefix Tree)", "question__title_slug": "implement-trie-ii-prefix-tree", "question__hide": false, - "total_acs": 8340, - "total_submitted": 14003, + "total_acs": 8562, + "total_submitted": 14357, "frontend_question_id": 1804, "is_new_question": false }, @@ -10434,8 +10664,8 @@ "question__title": "Rearrange Products Table", "question__title_slug": "rearrange-products-table", "question__hide": false, - "total_acs": 25036, - "total_submitted": 27601, + "total_acs": 27773, + "total_submitted": 30653, "frontend_question_id": 1795, "is_new_question": false }, @@ -10457,8 +10687,8 @@ "question__title": "Number of Different Subsequences GCDs", "question__title_slug": "number-of-different-subsequences-gcds", "question__hide": false, - "total_acs": 5836, - "total_submitted": 15683, + "total_acs": 5870, + "total_submitted": 15766, "frontend_question_id": 1819, "is_new_question": false }, @@ -10480,8 +10710,8 @@ "question__title": "Minimum Absolute Sum Difference", "question__title_slug": "minimum-absolute-sum-difference", "question__hide": false, - "total_acs": 15316, - "total_submitted": 51653, + "total_acs": 15647, + "total_submitted": 52570, "frontend_question_id": 1818, "is_new_question": false }, @@ -10503,8 +10733,8 @@ "question__title": "Finding the Users Active Minutes", "question__title_slug": "finding-the-users-active-minutes", "question__hide": false, - "total_acs": 35455, - "total_submitted": 43964, + "total_acs": 35893, + "total_submitted": 44504, "frontend_question_id": 1817, "is_new_question": false }, @@ -10526,8 +10756,8 @@ "question__title": "Truncate Sentence", "question__title_slug": "truncate-sentence", "question__hide": false, - "total_acs": 65208, - "total_submitted": 80102, + "total_acs": 66552, + "total_submitted": 81683, "frontend_question_id": 1816, "is_new_question": false }, @@ -10549,8 +10779,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": 1309, - "total_submitted": 2006, + "total_acs": 1321, + "total_submitted": 2025, "frontend_question_id": 1794, "is_new_question": false }, @@ -10572,8 +10802,8 @@ "question__title": "Primary Department for Each Employee", "question__title_slug": "primary-department-for-each-employee", "question__hide": false, - "total_acs": 10945, - "total_submitted": 13741, + "total_acs": 11246, + "total_submitted": 14125, "frontend_question_id": 1789, "is_new_question": false }, @@ -10595,8 +10825,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": 2304, - "total_submitted": 4779, + "total_acs": 2323, + "total_submitted": 4812, "frontend_question_id": 1830, "is_new_question": false }, @@ -10618,8 +10848,8 @@ "question__title": "Maximum XOR for Each Query", "question__title_slug": "maximum-xor-for-each-query", "question__hide": false, - "total_acs": 16820, - "total_submitted": 22073, + "total_acs": 17059, + "total_submitted": 22358, "frontend_question_id": 1829, "is_new_question": false }, @@ -10641,8 +10871,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": 41427, - "total_submitted": 47924, + "total_acs": 42177, + "total_submitted": 48821, "frontend_question_id": 1828, "is_new_question": false }, @@ -10664,8 +10894,8 @@ "question__title": "Minimum Operations to Make the Array Increasing", "question__title_slug": "minimum-operations-to-make-the-array-increasing", "question__hide": false, - "total_acs": 44869, - "total_submitted": 57367, + "total_acs": 45750, + "total_submitted": 58496, "frontend_question_id": 1827, "is_new_question": false }, @@ -10687,8 +10917,8 @@ "question__title": "Maximize the Beauty of the Garden", "question__title_slug": "maximize-the-beauty-of-the-garden", "question__hide": false, - "total_acs": 1480, - "total_submitted": 2191, + "total_acs": 1492, + "total_submitted": 2207, "frontend_question_id": 1788, "is_new_question": false }, @@ -10710,8 +10940,8 @@ "question__title": "Maximize Number of Nice Divisors", "question__title_slug": "maximize-number-of-nice-divisors", "question__hide": false, - "total_acs": 4748, - "total_submitted": 15534, + "total_acs": 4778, + "total_submitted": 15581, "frontend_question_id": 1808, "is_new_question": false }, @@ -10733,8 +10963,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": 13465, - "total_submitted": 18966, + "total_acs": 13538, + "total_submitted": 19055, "frontend_question_id": 1806, "is_new_question": false }, @@ -10756,8 +10986,8 @@ "question__title": "Evaluate the Bracket Pairs of a String", "question__title_slug": "evaluate-the-bracket-pairs-of-a-string", "question__hide": false, - "total_acs": 19760, - "total_submitted": 29632, + "total_acs": 19934, + "total_submitted": 29974, "frontend_question_id": 1807, "is_new_question": false }, @@ -10779,8 +11009,8 @@ "question__title": "Number of Different Integers in a String", "question__title_slug": "number-of-different-integers-in-a-string", "question__hide": false, - "total_acs": 27388, - "total_submitted": 76401, + "total_acs": 27821, + "total_submitted": 77465, "frontend_question_id": 1805, "is_new_question": false }, @@ -10802,8 +11032,8 @@ "question__title": "Grand Slam Titles", "question__title_slug": "grand-slam-titles", "question__hide": false, - "total_acs": 11834, - "total_submitted": 13289, + "total_acs": 12197, + "total_submitted": 13696, "frontend_question_id": 1783, "is_new_question": false }, @@ -10825,8 +11055,8 @@ "question__title": "Shortest Path in a Hidden Grid", "question__title_slug": "shortest-path-in-a-hidden-grid", "question__hide": false, - "total_acs": 4091, - "total_submitted": 9944, + "total_acs": 4127, + "total_submitted": 10049, "frontend_question_id": 1778, "is_new_question": false }, @@ -10848,8 +11078,8 @@ "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": 10407, - "total_submitted": 19754, + "total_acs": 10557, + "total_submitted": 19965, "frontend_question_id": 1798, "is_new_question": false }, @@ -10871,8 +11101,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": 11176, - "total_submitted": 36151, + "total_acs": 11406, + "total_submitted": 36786, "frontend_question_id": 1802, "is_new_question": false }, @@ -10894,8 +11124,8 @@ "question__title": "Number of Orders in the Backlog", "question__title_slug": "number-of-orders-in-the-backlog", "question__hide": false, - "total_acs": 12592, - "total_submitted": 27182, + "total_acs": 12707, + "total_submitted": 27384, "frontend_question_id": 1801, "is_new_question": false }, @@ -10917,8 +11147,8 @@ "question__title": "Maximum Ascending Subarray Sum", "question__title_slug": "maximum-ascending-subarray-sum", "question__hide": false, - "total_acs": 31166, - "total_submitted": 48530, + "total_acs": 31698, + "total_submitted": 49360, "frontend_question_id": 1800, "is_new_question": false }, @@ -10940,8 +11170,8 @@ "question__title": "Product's Price for Each Store", "question__title_slug": "products-price-for-each-store", "question__hide": false, - "total_acs": 12205, - "total_submitted": 14228, + "total_acs": 12409, + "total_submitted": 14471, "frontend_question_id": 1777, "is_new_question": false }, @@ -10963,8 +11193,8 @@ "question__title": "Count Nice Pairs in an Array", "question__title_slug": "count-nice-pairs-in-an-array", "question__hide": false, - "total_acs": 15929, - "total_submitted": 39051, + "total_acs": 16196, + "total_submitted": 39623, "frontend_question_id": 1814, "is_new_question": false }, @@ -10986,8 +11216,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": 4419, - "total_submitted": 11064, + "total_acs": 4440, + "total_submitted": 11116, "frontend_question_id": 1815, "is_new_question": false }, @@ -11009,8 +11239,8 @@ "question__title": "Sentence Similarity III", "question__title_slug": "sentence-similarity-iii", "question__hide": false, - "total_acs": 10214, - "total_submitted": 31235, + "total_acs": 10369, + "total_submitted": 31697, "frontend_question_id": 1813, "is_new_question": false }, @@ -11032,8 +11262,8 @@ "question__title": "Determine Color of a Chessboard Square", "question__title_slug": "determine-color-of-a-chessboard-square", "question__hide": false, - "total_acs": 39043, - "total_submitted": 50257, + "total_acs": 39760, + "total_submitted": 51193, "frontend_question_id": 1812, "is_new_question": false }, @@ -11055,8 +11285,8 @@ "question__title": "Sort Features by Popularity", "question__title_slug": "sort-features-by-popularity", "question__hide": false, - "total_acs": 3999, - "total_submitted": 6100, + "total_acs": 4043, + "total_submitted": 6167, "frontend_question_id": 1772, "is_new_question": false }, @@ -11078,8 +11308,8 @@ "question__title": "Maximum Score of a Good Subarray", "question__title_slug": "maximum-score-of-a-good-subarray", "question__hide": false, - "total_acs": 14668, - "total_submitted": 28130, + "total_acs": 14937, + "total_submitted": 28573, "frontend_question_id": 1793, "is_new_question": false }, @@ -11101,8 +11331,8 @@ "question__title": "Maximum Average Pass Ratio", "question__title_slug": "maximum-average-pass-ratio", "question__hide": false, - "total_acs": 15697, - "total_submitted": 30655, + "total_acs": 15880, + "total_submitted": 30973, "frontend_question_id": 1792, "is_new_question": false }, @@ -11124,8 +11354,8 @@ "question__title": "Find Center of Star Graph", "question__title_slug": "find-center-of-star-graph", "question__hide": false, - "total_acs": 89299, - "total_submitted": 106762, + "total_acs": 91345, + "total_submitted": 109255, "frontend_question_id": 1791, "is_new_question": false }, @@ -11147,8 +11377,8 @@ "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": 47114, - "total_submitted": 103118, + "total_acs": 48674, + "total_submitted": 106586, "frontend_question_id": 1790, "is_new_question": false }, @@ -11170,8 +11400,8 @@ "question__title": "Find the Subtasks That Did Not Execute", "question__title_slug": "find-the-subtasks-that-did-not-execute", "question__hide": false, - "total_acs": 5217, - "total_submitted": 6206, + "total_acs": 5370, + "total_submitted": 6388, "frontend_question_id": 1767, "is_new_question": false }, @@ -11193,8 +11423,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": 3761, - "total_submitted": 9443, + "total_acs": 3787, + "total_submitted": 9547, "frontend_question_id": 1787, "is_new_question": false }, @@ -11216,8 +11446,8 @@ "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": 13842, - "total_submitted": 35481, + "total_acs": 14057, + "total_submitted": 35980, "frontend_question_id": 1786, "is_new_question": false }, @@ -11239,8 +11469,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": 14739, - "total_submitted": 35208, + "total_acs": 14878, + "total_submitted": 35471, "frontend_question_id": 1785, "is_new_question": false }, @@ -11262,8 +11492,8 @@ "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": 25112, - "total_submitted": 61613, + "total_acs": 25468, + "total_submitted": 62460, "frontend_question_id": 1784, "is_new_question": false }, @@ -11285,8 +11515,8 @@ "question__title": "Buildings With an Ocean View", "question__title_slug": "buildings-with-an-ocean-view", "question__hide": false, - "total_acs": 115269, - "total_submitted": 144584, + "total_acs": 117096, + "total_submitted": 146947, "frontend_question_id": 1762, "is_new_question": false }, @@ -11308,8 +11538,8 @@ "question__title": "Recyclable and Low Fat Products", "question__title_slug": "recyclable-and-low-fat-products", "question__hide": false, - "total_acs": 86767, - "total_submitted": 92284, + "total_acs": 95397, + "total_submitted": 101446, "frontend_question_id": 1757, "is_new_question": false }, @@ -11331,8 +11561,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": 4788, - "total_submitted": 10327, + "total_acs": 4830, + "total_submitted": 10428, "frontend_question_id": 1803, "is_new_question": false }, @@ -11354,8 +11584,8 @@ "question__title": "Maximize Score After N Operations", "question__title_slug": "maximize-score-after-n-operations", "question__hide": false, - "total_acs": 12710, - "total_submitted": 27509, + "total_acs": 12894, + "total_submitted": 28000, "frontend_question_id": 1799, "is_new_question": false }, @@ -11377,8 +11607,8 @@ "question__title": "Design Authentication Manager", "question__title_slug": "design-authentication-manager", "question__hide": false, - "total_acs": 11638, - "total_submitted": 21295, + "total_acs": 11894, + "total_submitted": 21700, "frontend_question_id": 1797, "is_new_question": false }, @@ -11400,8 +11630,8 @@ "question__title": "Second Largest Digit in a String", "question__title_slug": "second-largest-digit-in-a-string", "question__hide": false, - "total_acs": 27407, - "total_submitted": 55883, + "total_acs": 27883, + "total_submitted": 56862, "frontend_question_id": 1796, "is_new_question": false }, @@ -11423,8 +11653,8 @@ "question__title": "Design Most Recently Used Queue", "question__title_slug": "design-most-recently-used-queue", "question__hide": false, - "total_acs": 6044, - "total_submitted": 7664, + "total_acs": 6128, + "total_submitted": 7759, "frontend_question_id": 1756, "is_new_question": false }, @@ -11446,8 +11676,8 @@ "question__title": "Car Fleet II", "question__title_slug": "car-fleet-ii", "question__hide": false, - "total_acs": 18926, - "total_submitted": 35827, + "total_acs": 19076, + "total_submitted": 36081, "frontend_question_id": 1776, "is_new_question": false }, @@ -11469,8 +11699,8 @@ "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": 16341, - "total_submitted": 31428, + "total_acs": 16767, + "total_submitted": 32246, "frontend_question_id": 1775, "is_new_question": false }, @@ -11492,8 +11722,8 @@ "question__title": "Closest Dessert Cost", "question__title_slug": "closest-dessert-cost", "question__hide": false, - "total_acs": 17110, - "total_submitted": 37124, + "total_acs": 17543, + "total_submitted": 38020, "frontend_question_id": 1774, "is_new_question": false }, @@ -11515,8 +11745,8 @@ "question__title": "Count Items Matching a Rule", "question__title_slug": "count-items-matching-a-rule", "question__hide": false, - "total_acs": 107120, - "total_submitted": 126916, + "total_acs": 109047, + "total_submitted": 129218, "frontend_question_id": 1773, "is_new_question": false }, @@ -11538,8 +11768,8 @@ "question__title": "Leetflex Banned Accounts", "question__title_slug": "leetflex-banned-accounts", "question__hide": false, - "total_acs": 8919, - "total_submitted": 13252, + "total_acs": 9283, + "total_submitted": 13723, "frontend_question_id": 1747, "is_new_question": false }, @@ -11561,8 +11791,8 @@ "question__title": "Maximize Palindrome Length From Subsequences", "question__title_slug": "maximize-palindrome-length-from-subsequences", "question__hide": false, - "total_acs": 7671, - "total_submitted": 22039, + "total_acs": 7770, + "total_submitted": 22319, "frontend_question_id": 1771, "is_new_question": false }, @@ -11584,8 +11814,8 @@ "question__title": "Maximum Score from Performing Multiplication Operations", "question__title_slug": "maximum-score-from-performing-multiplication-operations", "question__hide": false, - "total_acs": 35545, - "total_submitted": 100102, + "total_acs": 36701, + "total_submitted": 104515, "frontend_question_id": 1770, "is_new_question": false }, @@ -11607,8 +11837,8 @@ "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": 78007, - "total_submitted": 91126, + "total_acs": 79087, + "total_submitted": 92416, "frontend_question_id": 1769, "is_new_question": false }, @@ -11630,8 +11860,8 @@ "question__title": "Merge Strings Alternately", "question__title_slug": "merge-strings-alternately", "question__hide": false, - "total_acs": 62218, - "total_submitted": 82070, + "total_acs": 63914, + "total_submitted": 84313, "frontend_question_id": 1768, "is_new_question": false }, @@ -11653,8 +11883,8 @@ "question__title": "Maximum Subarray Sum After One Operation", "question__title_slug": "maximum-subarray-sum-after-one-operation", "question__hide": false, - "total_acs": 5978, - "total_submitted": 9688, + "total_acs": 6082, + "total_submitted": 9842, "frontend_question_id": 1746, "is_new_question": false }, @@ -11676,8 +11906,8 @@ "question__title": "Find Total Time Spent by Each Employee", "question__title_slug": "find-total-time-spent-by-each-employee", "question__hide": false, - "total_acs": 29177, - "total_submitted": 31826, + "total_acs": 31403, + "total_submitted": 34218, "frontend_question_id": 1741, "is_new_question": false }, @@ -11699,8 +11929,8 @@ "question__title": "Count Pairs Of Nodes", "question__title_slug": "count-pairs-of-nodes", "question__hide": false, - "total_acs": 4519, - "total_submitted": 12009, + "total_acs": 4551, + "total_submitted": 12083, "frontend_question_id": 1782, "is_new_question": false }, @@ -11722,8 +11952,8 @@ "question__title": "Sum of Beauty of All Substrings", "question__title_slug": "sum-of-beauty-of-all-substrings", "question__hide": false, - "total_acs": 13745, - "total_submitted": 22891, + "total_acs": 13929, + "total_submitted": 23180, "frontend_question_id": 1781, "is_new_question": false }, @@ -11745,8 +11975,8 @@ "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": 22697, - "total_submitted": 34885, + "total_acs": 22995, + "total_submitted": 35300, "frontend_question_id": 1780, "is_new_question": false }, @@ -11768,8 +11998,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": 55556, - "total_submitted": 82286, + "total_acs": 57740, + "total_submitted": 85489, "frontend_question_id": 1779, "is_new_question": false }, @@ -11791,8 +12021,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": 16317, - "total_submitted": 39323, + "total_acs": 16518, + "total_submitted": 39747, "frontend_question_id": 1761, "is_new_question": false }, @@ -11814,8 +12044,8 @@ "question__title": "Minimum Limit of Balls in a Bag", "question__title_slug": "minimum-limit-of-balls-in-a-bag", "question__hide": false, - "total_acs": 19793, - "total_submitted": 33690, + "total_acs": 20403, + "total_submitted": 34579, "frontend_question_id": 1760, "is_new_question": false }, @@ -11837,8 +12067,8 @@ "question__title": "Count Number of Homogenous Substrings", "question__title_slug": "count-number-of-homogenous-substrings", "question__hide": false, - "total_acs": 19107, - "total_submitted": 40802, + "total_acs": 19339, + "total_submitted": 41172, "frontend_question_id": 1759, "is_new_question": false }, @@ -11860,8 +12090,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": 28228, - "total_submitted": 47741, + "total_acs": 28502, + "total_submitted": 48256, "frontend_question_id": 1758, "is_new_question": false }, @@ -11883,8 +12113,8 @@ "question__title": "Find Distance in a Binary Tree", "question__title_slug": "find-distance-in-a-binary-tree", "question__hide": false, - "total_acs": 12129, - "total_submitted": 17691, + "total_acs": 12418, + "total_submitted": 18135, "frontend_question_id": 1740, "is_new_question": false }, @@ -11906,8 +12136,8 @@ "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": 11040, - "total_submitted": 22327, + "total_acs": 11395, + "total_submitted": 22982, "frontend_question_id": 1731, "is_new_question": false }, @@ -11929,8 +12159,8 @@ "question__title": "Closest Subsequence Sum", "question__title_slug": "closest-subsequence-sum", "question__hide": false, - "total_acs": 9144, - "total_submitted": 25181, + "total_acs": 9256, + "total_submitted": 25424, "frontend_question_id": 1755, "is_new_question": false }, @@ -11952,8 +12182,8 @@ "question__title": "Largest Merge Of Two Strings", "question__title_slug": "largest-merge-of-two-strings", "question__hide": false, - "total_acs": 14706, - "total_submitted": 33145, + "total_acs": 14838, + "total_submitted": 33376, "frontend_question_id": 1754, "is_new_question": false }, @@ -11975,8 +12205,8 @@ "question__title": "Maximum Score From Removing Stones", "question__title_slug": "maximum-score-from-removing-stones", "question__hide": false, - "total_acs": 22737, - "total_submitted": 34734, + "total_acs": 23167, + "total_submitted": 35318, "frontend_question_id": 1753, "is_new_question": false }, @@ -11998,8 +12228,8 @@ "question__title": "Check if Array Is Sorted and Rotated", "question__title_slug": "check-if-array-is-sorted-and-rotated", "question__hide": false, - "total_acs": 37634, - "total_submitted": 78003, + "total_acs": 38622, + "total_submitted": 79842, "frontend_question_id": 1752, "is_new_question": false }, @@ -12021,8 +12251,8 @@ "question__title": "Find Followers Count", "question__title_slug": "find-followers-count", "question__hide": false, - "total_acs": 20234, - "total_submitted": 28164, + "total_acs": 22100, + "total_submitted": 30710, "frontend_question_id": 1729, "is_new_question": false }, @@ -12044,8 +12274,8 @@ "question__title": "Map of Highest Peak", "question__title_slug": "map-of-highest-peak", "question__hide": false, - "total_acs": 17092, - "total_submitted": 28501, + "total_acs": 17263, + "total_submitted": 28737, "frontend_question_id": 1765, "is_new_question": false }, @@ -12067,8 +12297,8 @@ "question__title": "Tree of Coprimes", "question__title_slug": "tree-of-coprimes", "question__hide": false, - "total_acs": 5753, - "total_submitted": 15046, + "total_acs": 5824, + "total_submitted": 15199, "frontend_question_id": 1766, "is_new_question": false }, @@ -12090,8 +12320,8 @@ "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": 10699, - "total_submitted": 20163, + "total_acs": 10799, + "total_submitted": 20363, "frontend_question_id": 1764, "is_new_question": false }, @@ -12113,8 +12343,8 @@ "question__title": "Longest Nice Substring", "question__title_slug": "longest-nice-substring", "question__hide": false, - "total_acs": 25575, - "total_submitted": 41302, + "total_acs": 26023, + "total_submitted": 42058, "frontend_question_id": 1763, "is_new_question": false }, @@ -12136,8 +12366,8 @@ "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": 8104, - "total_submitted": 24933, + "total_acs": 8130, + "total_submitted": 25001, "frontend_question_id": 1744, "is_new_question": false }, @@ -12159,8 +12389,8 @@ "question__title": "Palindrome Partitioning IV", "question__title_slug": "palindrome-partitioning-iv", "question__hide": false, - "total_acs": 15425, - "total_submitted": 31874, + "total_acs": 15644, + "total_submitted": 32476, "frontend_question_id": 1745, "is_new_question": false }, @@ -12182,8 +12412,8 @@ "question__title": "Restore the Array From Adjacent Pairs", "question__title_slug": "restore-the-array-from-adjacent-pairs", "question__hide": false, - "total_acs": 26784, - "total_submitted": 39304, + "total_acs": 27133, + "total_submitted": 39783, "frontend_question_id": 1743, "is_new_question": false }, @@ -12205,8 +12435,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": 1728, - "total_submitted": 3375, + "total_acs": 1774, + "total_submitted": 3433, "frontend_question_id": 1724, "is_new_question": false }, @@ -12228,8 +12458,8 @@ "question__title": "Count Apples and Oranges", "question__title_slug": "count-apples-and-oranges", "question__hide": false, - "total_acs": 9121, - "total_submitted": 11694, + "total_acs": 9246, + "total_submitted": 11859, "frontend_question_id": 1715, "is_new_question": false }, @@ -12251,8 +12481,8 @@ "question__title": "Building Boxes", "question__title_slug": "building-boxes", "question__hide": false, - "total_acs": 5000, - "total_submitted": 9763, + "total_acs": 5029, + "total_submitted": 9817, "frontend_question_id": 1739, "is_new_question": false }, @@ -12274,8 +12504,8 @@ "question__title": "Find Kth Largest XOR Coordinate Value", "question__title_slug": "find-kth-largest-xor-coordinate-value", "question__hide": false, - "total_acs": 14924, - "total_submitted": 24115, + "total_acs": 15125, + "total_submitted": 24420, "frontend_question_id": 1738, "is_new_question": false }, @@ -12297,8 +12527,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": 9858, - "total_submitted": 28434, + "total_acs": 9953, + "total_submitted": 28654, "frontend_question_id": 1737, "is_new_question": false }, @@ -12320,8 +12550,8 @@ "question__title": "Latest Time by Replacing Hidden Digits", "question__title_slug": "latest-time-by-replacing-hidden-digits", "question__hide": false, - "total_acs": 23153, - "total_submitted": 54962, + "total_acs": 23366, + "total_submitted": 55474, "frontend_question_id": 1736, "is_new_question": false }, @@ -12343,8 +12573,8 @@ "question__title": "Biggest Window Between Visits", "question__title_slug": "biggest-window-between-visits", "question__hide": false, - "total_acs": 11223, - "total_submitted": 14442, + "total_acs": 11535, + "total_submitted": 14891, "frontend_question_id": 1709, "is_new_question": false }, @@ -12366,8 +12596,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": 15560, - "total_submitted": 28226, + "total_acs": 15857, + "total_submitted": 28641, "frontend_question_id": 1751, "is_new_question": false }, @@ -12389,8 +12619,8 @@ "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": 14439, - "total_submitted": 33273, + "total_acs": 14630, + "total_submitted": 33700, "frontend_question_id": 1750, "is_new_question": false }, @@ -12412,8 +12642,8 @@ "question__title": "Maximum Absolute Sum of Any Subarray", "question__title_slug": "maximum-absolute-sum-of-any-subarray", "question__hide": false, - "total_acs": 22998, - "total_submitted": 40051, + "total_acs": 23417, + "total_submitted": 40719, "frontend_question_id": 1749, "is_new_question": false }, @@ -12435,8 +12665,8 @@ "question__title": "Sum of Unique Elements", "question__title_slug": "sum-of-unique-elements", "question__hide": false, - "total_acs": 79379, - "total_submitted": 104937, + "total_acs": 80677, + "total_submitted": 106634, "frontend_question_id": 1748, "is_new_question": false }, @@ -12458,8 +12688,8 @@ "question__title": "Largest Subarray Length K", "question__title_slug": "largest-subarray-length-k", "question__hide": false, - "total_acs": 5805, - "total_submitted": 9104, + "total_acs": 5886, + "total_submitted": 9224, "frontend_question_id": 1708, "is_new_question": false }, @@ -12481,8 +12711,8 @@ "question__title": "Largest Submatrix With Rearrangements", "question__title_slug": "largest-submatrix-with-rearrangements", "question__hide": false, - "total_acs": 12218, - "total_submitted": 20181, + "total_acs": 12355, + "total_submitted": 20405, "frontend_question_id": 1727, "is_new_question": false }, @@ -12504,8 +12734,8 @@ "question__title": "Maximum Number of Balls in a Box", "question__title_slug": "maximum-number-of-balls-in-a-box", "question__hide": false, - "total_acs": 40084, - "total_submitted": 54316, + "total_acs": 40586, + "total_submitted": 55016, "frontend_question_id": 1742, "is_new_question": false }, @@ -12527,8 +12757,8 @@ "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": 43598, - "total_submitted": 55285, + "total_acs": 44165, + "total_submitted": 55980, "frontend_question_id": 1725, "is_new_question": false }, @@ -12550,8 +12780,8 @@ "question__title": "Number of Calls Between Two Persons", "question__title_slug": "number-of-calls-between-two-persons", "question__hide": false, - "total_acs": 19617, - "total_submitted": 22831, + "total_acs": 20280, + "total_submitted": 23594, "frontend_question_id": 1699, "is_new_question": false }, @@ -12573,8 +12803,8 @@ "question__title": "Minimize Hamming Distance After Swap Operations", "question__title_slug": "minimize-hamming-distance-after-swap-operations", "question__hide": false, - "total_acs": 12926, - "total_submitted": 26762, + "total_acs": 13063, + "total_submitted": 27085, "frontend_question_id": 1722, "is_new_question": false }, @@ -12596,8 +12826,8 @@ "question__title": "Decode XORed Array", "question__title_slug": "decode-xored-array", "question__hide": false, - "total_acs": 74666, - "total_submitted": 86914, + "total_acs": 76071, + "total_submitted": 88563, "frontend_question_id": 1720, "is_new_question": false }, @@ -12619,8 +12849,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": 4673, - "total_submitted": 7572, + "total_acs": 4722, + "total_submitted": 7661, "frontend_question_id": 1698, "is_new_question": false }, @@ -12642,8 +12872,8 @@ "question__title": "Daily Leads and Partners", "question__title_slug": "daily-leads-and-partners", "question__hide": false, - "total_acs": 26439, - "total_submitted": 28797, + "total_acs": 28868, + "total_submitted": 31420, "frontend_question_id": 1693, "is_new_question": false }, @@ -12665,8 +12895,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": 3291, - "total_submitted": 6671, + "total_acs": 3330, + "total_submitted": 6742, "frontend_question_id": 1735, "is_new_question": false }, @@ -12688,8 +12918,8 @@ "question__title": "Decode XORed Permutation", "question__title_slug": "decode-xored-permutation", "question__hide": false, - "total_acs": 9621, - "total_submitted": 15683, + "total_acs": 9732, + "total_submitted": 15821, "frontend_question_id": 1734, "is_new_question": false }, @@ -12711,8 +12941,8 @@ "question__title": "Minimum Number of People to Teach", "question__title_slug": "minimum-number-of-people-to-teach", "question__hide": false, - "total_acs": 6301, - "total_submitted": 15380, + "total_acs": 6325, + "total_submitted": 15428, "frontend_question_id": 1733, "is_new_question": false }, @@ -12734,8 +12964,8 @@ "question__title": "Find the Highest Altitude", "question__title_slug": "find-the-highest-altitude", "question__hide": false, - "total_acs": 75518, - "total_submitted": 95796, + "total_acs": 76768, + "total_submitted": 97401, "frontend_question_id": 1732, "is_new_question": false }, @@ -12757,8 +12987,8 @@ "question__title": "Minimum Operations to Make a Subsequence", "question__title_slug": "minimum-operations-to-make-a-subsequence", "question__hide": false, - "total_acs": 7548, - "total_submitted": 15420, + "total_acs": 7671, + "total_submitted": 15620, "frontend_question_id": 1713, "is_new_question": false }, @@ -12780,8 +13010,8 @@ "question__title": "Ways to Split Array Into Three Subarrays", "question__title_slug": "ways-to-split-array-into-three-subarrays", "question__hide": false, - "total_acs": 20907, - "total_submitted": 65661, + "total_acs": 21270, + "total_submitted": 66627, "frontend_question_id": 1712, "is_new_question": false }, @@ -12803,8 +13033,8 @@ "question__title": "Count Good Meals", "question__title_slug": "count-good-meals", "question__hide": false, - "total_acs": 25928, - "total_submitted": 90727, + "total_acs": 26153, + "total_submitted": 91511, "frontend_question_id": 1711, "is_new_question": false }, @@ -12826,8 +13056,8 @@ "question__title": "Maximum Units on a Truck", "question__title_slug": "maximum-units-on-a-truck", "question__hide": false, - "total_acs": 147401, - "total_submitted": 204560, + "total_acs": 149896, + "total_submitted": 207899, "frontend_question_id": 1710, "is_new_question": false }, @@ -12849,8 +13079,8 @@ "question__title": "Count Ways to Distribute Candies", "question__title_slug": "count-ways-to-distribute-candies", "question__hide": false, - "total_acs": 1602, - "total_submitted": 2603, + "total_acs": 1626, + "total_submitted": 2641, "frontend_question_id": 1692, "is_new_question": false }, @@ -12872,8 +13102,8 @@ "question__title": "Invalid Tweets", "question__title_slug": "invalid-tweets", "question__hide": false, - "total_acs": 18258, - "total_submitted": 20059, + "total_acs": 18464, + "total_submitted": 20293, "frontend_question_id": 1683, "is_new_question": false }, @@ -12895,8 +13125,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": 9468, - "total_submitted": 21804, + "total_acs": 9840, + "total_submitted": 22486, "frontend_question_id": 1707, "is_new_question": false }, @@ -12918,8 +13148,8 @@ "question__title": "Find Minimum Time to Finish All Jobs", "question__title_slug": "find-minimum-time-to-finish-all-jobs", "question__hide": false, - "total_acs": 15331, - "total_submitted": 35911, + "total_acs": 15764, + "total_submitted": 36899, "frontend_question_id": 1723, "is_new_question": false }, @@ -12941,8 +13171,8 @@ "question__title": "Maximum Number of Eaten Apples", "question__title_slug": "maximum-number-of-eaten-apples", "question__hide": false, - "total_acs": 14760, - "total_submitted": 40246, + "total_acs": 14938, + "total_submitted": 40605, "frontend_question_id": 1705, "is_new_question": false }, @@ -12964,8 +13194,8 @@ "question__title": "Determine if String Halves Are Alike", "question__title_slug": "determine-if-string-halves-are-alike", "question__hide": false, - "total_acs": 87133, - "total_submitted": 111890, + "total_acs": 87968, + "total_submitted": 113086, "frontend_question_id": 1704, "is_new_question": false }, @@ -12987,8 +13217,8 @@ "question__title": "Longest Palindromic Subsequence II", "question__title_slug": "longest-palindromic-subsequence-ii", "question__hide": false, - "total_acs": 3524, - "total_submitted": 6987, + "total_acs": 3567, + "total_submitted": 7068, "frontend_question_id": 1682, "is_new_question": false }, @@ -13010,8 +13240,8 @@ "question__title": "Product's Worth Over Invoices", "question__title_slug": "products-worth-over-invoices", "question__hide": false, - "total_acs": 10972, - "total_submitted": 27171, + "total_acs": 11160, + "total_submitted": 27720, "frontend_question_id": 1677, "is_new_question": false }, @@ -13033,8 +13263,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": 2591, - "total_submitted": 6143, + "total_acs": 2642, + "total_submitted": 6243, "frontend_question_id": 1719, "is_new_question": false }, @@ -13056,8 +13286,8 @@ "question__title": "Construct the Lexicographically Largest Valid Sequence", "question__title_slug": "construct-the-lexicographically-largest-valid-sequence", "question__hide": false, - "total_acs": 9040, - "total_submitted": 17547, + "total_acs": 9107, + "total_submitted": 17663, "frontend_question_id": 1718, "is_new_question": false }, @@ -13079,8 +13309,8 @@ "question__title": "Maximum Score From Removing Substrings", "question__title_slug": "maximum-score-from-removing-substrings", "question__hide": false, - "total_acs": 10005, - "total_submitted": 22013, + "total_acs": 10145, + "total_submitted": 22242, "frontend_question_id": 1717, "is_new_question": false }, @@ -13102,8 +13332,8 @@ "question__title": "Calculate Money in Leetcode Bank", "question__title_slug": "calculate-money-in-leetcode-bank", "question__hide": false, - "total_acs": 30775, - "total_submitted": 47317, + "total_acs": 31012, + "total_submitted": 47752, "frontend_question_id": 1716, "is_new_question": false }, @@ -13125,8 +13355,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": 22591, - "total_submitted": 28440, + "total_acs": 22968, + "total_submitted": 28913, "frontend_question_id": 1676, "is_new_question": false }, @@ -13148,8 +13378,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": 8350, - "total_submitted": 16977, + "total_acs": 8464, + "total_submitted": 17164, "frontend_question_id": 1697, "is_new_question": false }, @@ -13171,8 +13401,8 @@ "question__title": "Jump Game VI", "question__title_slug": "jump-game-vi", "question__hide": false, - "total_acs": 44656, - "total_submitted": 104419, + "total_acs": 45245, + "total_submitted": 105719, "frontend_question_id": 1696, "is_new_question": false }, @@ -13194,8 +13424,8 @@ "question__title": "Maximum Erasure Value", "question__title_slug": "maximum-erasure-value", "question__hide": false, - "total_acs": 96013, - "total_submitted": 166105, + "total_acs": 97310, + "total_submitted": 168258, "frontend_question_id": 1695, "is_new_question": false }, @@ -13217,8 +13447,8 @@ "question__title": "Reformat Phone Number", "question__title_slug": "reformat-phone-number", "question__hide": false, - "total_acs": 25288, - "total_submitted": 38888, + "total_acs": 25534, + "total_submitted": 39273, "frontend_question_id": 1694, "is_new_question": false }, @@ -13240,8 +13470,8 @@ "question__title": "Fix Names in a Table", "question__title_slug": "fix-names-in-a-table", "question__hide": false, - "total_acs": 29825, - "total_submitted": 46235, + "total_acs": 33189, + "total_submitted": 51219, "frontend_question_id": 1667, "is_new_question": false }, @@ -13263,8 +13493,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": 2458, - "total_submitted": 3578, + "total_acs": 2478, + "total_submitted": 3607, "frontend_question_id": 1666, "is_new_question": false }, @@ -13286,8 +13516,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": 999, - "total_submitted": 1947, + "total_acs": 1006, + "total_submitted": 1977, "frontend_question_id": 1714, "is_new_question": false }, @@ -13309,8 +13539,8 @@ "question__title": "Stone Game VII", "question__title_slug": "stone-game-vii", "question__hide": false, - "total_acs": 26805, - "total_submitted": 45575, + "total_acs": 27021, + "total_submitted": 45939, "frontend_question_id": 1690, "is_new_question": false }, @@ -13332,8 +13562,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": 81452, - "total_submitted": 92789, + "total_acs": 136121, + "total_submitted": 151107, "frontend_question_id": 1689, "is_new_question": false }, @@ -13355,8 +13585,8 @@ "question__title": "Count of Matches in Tournament", "question__title_slug": "count-of-matches-in-tournament", "question__hide": false, - "total_acs": 70331, - "total_submitted": 84853, + "total_acs": 71181, + "total_submitted": 85846, "frontend_question_id": 1688, "is_new_question": false }, @@ -13378,8 +13608,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": 6383, - "total_submitted": 15384, + "total_acs": 6441, + "total_submitted": 15522, "frontend_question_id": 1703, "is_new_question": false }, @@ -13401,8 +13631,8 @@ "question__title": "Maximum Binary String After Change", "question__title_slug": "maximum-binary-string-after-change", "question__hide": false, - "total_acs": 8812, - "total_submitted": 19405, + "total_acs": 9034, + "total_submitted": 19799, "frontend_question_id": 1702, "is_new_question": false }, @@ -13424,8 +13654,8 @@ "question__title": "Average Waiting Time", "question__title_slug": "average-waiting-time", "question__hide": false, - "total_acs": 19837, - "total_submitted": 32047, + "total_acs": 19999, + "total_submitted": 32319, "frontend_question_id": 1701, "is_new_question": false }, @@ -13447,8 +13677,8 @@ "question__title": "Number of Students Unable to Eat Lunch", "question__title_slug": "number-of-students-unable-to-eat-lunch", "question__hide": false, - "total_acs": 41592, - "total_submitted": 61502, + "total_acs": 42380, + "total_submitted": 62650, "frontend_question_id": 1700, "is_new_question": false }, @@ -13470,8 +13700,8 @@ "question__title": "Average Time of Process per Machine", "question__title_slug": "average-time-of-process-per-machine", "question__hide": false, - "total_acs": 16600, - "total_submitted": 20825, + "total_acs": 16803, + "total_submitted": 21113, "frontend_question_id": 1661, "is_new_question": false }, @@ -13493,8 +13723,8 @@ "question__title": "Concatenation of Consecutive Binary Numbers", "question__title_slug": "concatenation-of-consecutive-binary-numbers", "question__hide": false, - "total_acs": 34287, - "total_submitted": 65207, + "total_acs": 34421, + "total_submitted": 65454, "frontend_question_id": 1680, "is_new_question": false }, @@ -13516,8 +13746,8 @@ "question__title": "Minimum Incompatibility", "question__title_slug": "minimum-incompatibility", "question__hide": false, - "total_acs": 5969, - "total_submitted": 16060, + "total_acs": 6006, + "total_submitted": 16139, "frontend_question_id": 1681, "is_new_question": false }, @@ -13539,8 +13769,8 @@ "question__title": "Max Number of K-Sum Pairs", "question__title_slug": "max-number-of-k-sum-pairs", "question__hide": false, - "total_acs": 110359, - "total_submitted": 191676, + "total_acs": 110915, + "total_submitted": 192835, "frontend_question_id": 1679, "is_new_question": false }, @@ -13562,8 +13792,8 @@ "question__title": "Goal Parser Interpretation", "question__title_slug": "goal-parser-interpretation", "question__hide": false, - "total_acs": 115315, - "total_submitted": 134312, + "total_acs": 117782, + "total_submitted": 137176, "frontend_question_id": 1678, "is_new_question": false }, @@ -13585,8 +13815,8 @@ "question__title": "Correct a Binary Tree", "question__title_slug": "correct-a-binary-tree", "question__hide": false, - "total_acs": 11278, - "total_submitted": 15536, + "total_acs": 11412, + "total_submitted": 15723, "frontend_question_id": 1660, "is_new_question": false }, @@ -13608,8 +13838,8 @@ "question__title": "Hopper Company Queries III", "question__title_slug": "hopper-company-queries-iii", "question__hide": false, - "total_acs": 4294, - "total_submitted": 6388, + "total_acs": 4348, + "total_submitted": 6464, "frontend_question_id": 1651, "is_new_question": false }, @@ -13631,8 +13861,8 @@ "question__title": "Minimize Deviation in Array", "question__title_slug": "minimize-deviation-in-array", "question__hide": false, - "total_acs": 43668, - "total_submitted": 83257, + "total_acs": 43828, + "total_submitted": 83654, "frontend_question_id": 1675, "is_new_question": false }, @@ -13654,8 +13884,8 @@ "question__title": "Minimum Moves to Make Array Complementary", "question__title_slug": "minimum-moves-to-make-array-complementary", "question__hide": false, - "total_acs": 6304, - "total_submitted": 16444, + "total_acs": 6338, + "total_submitted": 16531, "frontend_question_id": 1674, "is_new_question": false }, @@ -13677,8 +13907,8 @@ "question__title": "Find the Most Competitive Subsequence", "question__title_slug": "find-the-most-competitive-subsequence", "question__hide": false, - "total_acs": 43754, - "total_submitted": 89894, + "total_acs": 44233, + "total_submitted": 90775, "frontend_question_id": 1673, "is_new_question": false }, @@ -13700,8 +13930,8 @@ "question__title": "Richest Customer Wealth", "question__title_slug": "richest-customer-wealth", "question__hide": false, - "total_acs": 312910, - "total_submitted": 351176, + "total_acs": 320470, + "total_submitted": 359922, "frontend_question_id": 1672, "is_new_question": false }, @@ -13723,8 +13953,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": 130362, - "total_submitted": 168370, + "total_acs": 132531, + "total_submitted": 171212, "frontend_question_id": 1650, "is_new_question": false }, @@ -13746,8 +13976,8 @@ "question__title": "Delivering Boxes from Storage to Ports", "question__title_slug": "delivering-boxes-from-storage-to-ports", "question__hide": false, - "total_acs": 3959, - "total_submitted": 10390, + "total_acs": 4002, + "total_submitted": 10502, "frontend_question_id": 1687, "is_new_question": false }, @@ -13769,8 +13999,8 @@ "question__title": "Stone Game VI", "question__title_slug": "stone-game-vi", "question__hide": false, - "total_acs": 11377, - "total_submitted": 21151, + "total_acs": 11548, + "total_submitted": 21421, "frontend_question_id": 1686, "is_new_question": false }, @@ -13792,8 +14022,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": 20939, - "total_submitted": 31910, + "total_acs": 21284, + "total_submitted": 32436, "frontend_question_id": 1685, "is_new_question": false }, @@ -13815,8 +14045,8 @@ "question__title": "Count the Number of Consistent Strings", "question__title_slug": "count-the-number-of-consistent-strings", "question__hide": false, - "total_acs": 91853, - "total_submitted": 112125, + "total_acs": 93339, + "total_submitted": 113985, "frontend_question_id": 1684, "is_new_question": false }, @@ -13838,8 +14068,8 @@ "question__title": "Hopper Company Queries II", "question__title_slug": "hopper-company-queries-ii", "question__hide": false, - "total_acs": 4142, - "total_submitted": 10665, + "total_acs": 4191, + "total_submitted": 10809, "frontend_question_id": 1645, "is_new_question": false }, @@ -13861,8 +14091,8 @@ "question__title": "Minimum Initial Energy to Finish Tasks", "question__title_slug": "minimum-initial-energy-to-finish-tasks", "question__hide": false, - "total_acs": 11793, - "total_submitted": 21151, + "total_acs": 11880, + "total_submitted": 21309, "frontend_question_id": 1665, "is_new_question": false }, @@ -13884,8 +14114,8 @@ "question__title": "Ways to Make a Fair Array", "question__title_slug": "ways-to-make-a-fair-array", "question__hide": false, - "total_acs": 24637, - "total_submitted": 38873, + "total_acs": 24891, + "total_submitted": 39243, "frontend_question_id": 1664, "is_new_question": false }, @@ -13907,8 +14137,8 @@ "question__title": "Smallest String With A Given Numeric Value", "question__title_slug": "smallest-string-with-a-given-numeric-value", "question__hide": false, - "total_acs": 80914, - "total_submitted": 120690, + "total_acs": 81323, + "total_submitted": 121292, "frontend_question_id": 1663, "is_new_question": false }, @@ -13930,8 +14160,8 @@ "question__title": "Check If Two String Arrays are Equivalent", "question__title_slug": "check-if-two-string-arrays-are-equivalent", "question__hide": false, - "total_acs": 148826, - "total_submitted": 181673, + "total_acs": 150730, + "total_submitted": 184029, "frontend_question_id": 1662, "is_new_question": false }, @@ -13953,8 +14183,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": 46066, - "total_submitted": 78073, + "total_acs": 46745, + "total_submitted": 79221, "frontend_question_id": 1644, "is_new_question": false }, @@ -13976,8 +14206,8 @@ "question__title": "Hopper Company Queries I", "question__title_slug": "hopper-company-queries-i", "question__hide": false, - "total_acs": 5494, - "total_submitted": 10304, + "total_acs": 5565, + "total_submitted": 10426, "frontend_question_id": 1635, "is_new_question": false }, @@ -13999,8 +14229,8 @@ "question__title": "Maximize Grid Happiness", "question__title_slug": "maximize-grid-happiness", "question__hide": false, - "total_acs": 3731, - "total_submitted": 9882, + "total_acs": 3785, + "total_submitted": 9975, "frontend_question_id": 1659, "is_new_question": false }, @@ -14022,8 +14252,8 @@ "question__title": "Determine if Two Strings Are Close", "question__title_slug": "determine-if-two-strings-are-close", "question__hide": false, - "total_acs": 40427, - "total_submitted": 74248, + "total_acs": 40656, + "total_submitted": 74716, "frontend_question_id": 1657, "is_new_question": false }, @@ -14045,8 +14275,8 @@ "question__title": "Minimum Operations to Reduce X to Zero", "question__title_slug": "minimum-operations-to-reduce-x-to-zero", "question__hide": false, - "total_acs": 96224, - "total_submitted": 255476, + "total_acs": 97562, + "total_submitted": 259176, "frontend_question_id": 1658, "is_new_question": false }, @@ -14068,8 +14298,8 @@ "question__title": "Design an Ordered Stream", "question__title_slug": "design-an-ordered-stream", "question__hide": false, - "total_acs": 39797, - "total_submitted": 47312, + "total_acs": 40617, + "total_submitted": 48233, "frontend_question_id": 1656, "is_new_question": false }, @@ -14091,8 +14321,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": 6284, - "total_submitted": 11718, + "total_acs": 6394, + "total_submitted": 11920, "frontend_question_id": 1634, "is_new_question": false }, @@ -14114,8 +14344,8 @@ "question__title": "Percentage of Users Attended a Contest", "question__title_slug": "percentage-of-users-attended-a-contest", "question__hide": false, - "total_acs": 13944, - "total_submitted": 20206, + "total_acs": 14412, + "total_submitted": 20882, "frontend_question_id": 1633, "is_new_question": false }, @@ -14137,8 +14367,8 @@ "question__title": "Create Sorted Array through Instructions", "question__title_slug": "create-sorted-array-through-instructions", "question__hide": false, - "total_acs": 20088, - "total_submitted": 53888, + "total_acs": 20195, + "total_submitted": 54173, "frontend_question_id": 1649, "is_new_question": false }, @@ -14160,8 +14390,8 @@ "question__title": "Sell Diminishing-Valued Colored Balls", "question__title_slug": "sell-diminishing-valued-colored-balls", "question__hide": false, - "total_acs": 30505, - "total_submitted": 98608, + "total_acs": 30793, + "total_submitted": 99569, "frontend_question_id": 1648, "is_new_question": false }, @@ -14183,8 +14413,8 @@ "question__title": "Minimum Deletions to Make Character Frequencies Unique", "question__title_slug": "minimum-deletions-to-make-character-frequencies-unique", "question__hide": false, - "total_acs": 90300, - "total_submitted": 160172, + "total_acs": 145017, + "total_submitted": 243992, "frontend_question_id": 1647, "is_new_question": false }, @@ -14206,8 +14436,8 @@ "question__title": "Get Maximum in Generated Array", "question__title_slug": "get-maximum-in-generated-array", "question__hide": false, - "total_acs": 62600, - "total_submitted": 123551, + "total_acs": 63577, + "total_submitted": 125543, "frontend_question_id": 1646, "is_new_question": false }, @@ -14229,8 +14459,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": 17621, - "total_submitted": 21477, + "total_acs": 17953, + "total_submitted": 21882, "frontend_question_id": 1628, "is_new_question": false }, @@ -14252,8 +14482,8 @@ "question__title": "Design Front Middle Back Queue", "question__title_slug": "design-front-middle-back-queue", "question__hide": false, - "total_acs": 15405, - "total_submitted": 27549, + "total_acs": 15610, + "total_submitted": 27933, "frontend_question_id": 1670, "is_new_question": false }, @@ -14275,8 +14505,8 @@ "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": 14317, - "total_submitted": 33305, + "total_acs": 14802, + "total_submitted": 34432, "frontend_question_id": 1671, "is_new_question": false }, @@ -14298,8 +14528,8 @@ "question__title": "Merge In Between Linked Lists", "question__title_slug": "merge-in-between-linked-lists", "question__hide": false, - "total_acs": 51827, - "total_submitted": 69538, + "total_acs": 52699, + "total_submitted": 70737, "frontend_question_id": 1669, "is_new_question": false }, @@ -14321,8 +14551,8 @@ "question__title": "Maximum Repeating Substring", "question__title_slug": "maximum-repeating-substring", "question__hide": false, - "total_acs": 25498, - "total_submitted": 64487, + "total_acs": 25927, + "total_submitted": 65490, "frontend_question_id": 1668, "is_new_question": false }, @@ -14344,8 +14574,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": 13719, - "total_submitted": 15515, + "total_acs": 13879, + "total_submitted": 15704, "frontend_question_id": 1623, "is_new_question": false }, @@ -14367,8 +14597,8 @@ "question__title": "Furthest Building You Can Reach", "question__title_slug": "furthest-building-you-can-reach", "question__hide": false, - "total_acs": 51229, - "total_submitted": 113085, + "total_acs": 96382, + "total_submitted": 200205, "frontend_question_id": 1642, "is_new_question": false }, @@ -14390,8 +14620,8 @@ "question__title": "Count Sorted Vowel Strings", "question__title_slug": "count-sorted-vowel-strings", "question__hide": false, - "total_acs": 133923, - "total_submitted": 172611, + "total_acs": 134941, + "total_submitted": 173943, "frontend_question_id": 1641, "is_new_question": false }, @@ -14413,8 +14643,8 @@ "question__title": "Check Array Formation Through Concatenation", "question__title_slug": "check-array-formation-through-concatenation", "question__hide": false, - "total_acs": 68441, - "total_submitted": 122392, + "total_acs": 68717, + "total_submitted": 122870, "frontend_question_id": 1640, "is_new_question": false }, @@ -14436,8 +14666,8 @@ "question__title": "Find the Missing IDs", "question__title_slug": "find-the-missing-ids", "question__hide": false, - "total_acs": 11132, - "total_submitted": 14682, + "total_acs": 11339, + "total_submitted": 14947, "frontend_question_id": 1613, "is_new_question": false }, @@ -14459,8 +14689,8 @@ "question__title": "Distribute Repeating Integers", "question__title_slug": "distribute-repeating-integers", "question__hide": false, - "total_acs": 8257, - "total_submitted": 20553, + "total_acs": 8340, + "total_submitted": 20810, "frontend_question_id": 1655, "is_new_question": false }, @@ -14482,8 +14712,8 @@ "question__title": "Minimum Jumps to Reach Home", "question__title_slug": "minimum-jumps-to-reach-home", "question__hide": false, - "total_acs": 23448, - "total_submitted": 85354, + "total_acs": 24339, + "total_submitted": 87790, "frontend_question_id": 1654, "is_new_question": false }, @@ -14505,8 +14735,8 @@ "question__title": "Minimum Deletions to Make String Balanced", "question__title_slug": "minimum-deletions-to-make-string-balanced", "question__hide": false, - "total_acs": 23115, - "total_submitted": 40134, + "total_acs": 23792, + "total_submitted": 41200, "frontend_question_id": 1653, "is_new_question": false }, @@ -14528,8 +14758,8 @@ "question__title": "Defuse the Bomb", "question__title_slug": "defuse-the-bomb", "question__hide": false, - "total_acs": 23861, - "total_submitted": 39174, + "total_acs": 24165, + "total_submitted": 39609, "frontend_question_id": 1652, "is_new_question": false }, @@ -14551,8 +14781,8 @@ "question__title": "Path With Minimum Effort", "question__title_slug": "path-with-minimum-effort", "question__hide": false, - "total_acs": 111552, - "total_submitted": 202356, + "total_acs": 113325, + "total_submitted": 205472, "frontend_question_id": 1631, "is_new_question": false }, @@ -14574,8 +14804,8 @@ "question__title": "Arithmetic Subarrays", "question__title_slug": "arithmetic-subarrays", "question__hide": false, - "total_acs": 35168, - "total_submitted": 44451, + "total_acs": 35756, + "total_submitted": 45170, "frontend_question_id": 1630, "is_new_question": false }, @@ -14597,8 +14827,8 @@ "question__title": "Slowest Key", "question__title_slug": "slowest-key", "question__hide": false, - "total_acs": 77976, - "total_submitted": 130901, + "total_acs": 78532, + "total_submitted": 131822, "frontend_question_id": 1629, "is_new_question": false }, @@ -14620,8 +14850,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": 5109, - "total_submitted": 7339, + "total_acs": 5160, + "total_submitted": 7413, "frontend_question_id": 1612, "is_new_question": false }, @@ -14643,8 +14873,8 @@ "question__title": "Sellers With No Sales", "question__title_slug": "sellers-with-no-sales", "question__hide": false, - "total_acs": 15221, - "total_submitted": 27816, + "total_acs": 15735, + "total_submitted": 28687, "frontend_question_id": 1607, "is_new_question": false }, @@ -14666,8 +14896,8 @@ "question__title": "Best Team With No Conflicts", "question__title_slug": "best-team-with-no-conflicts", "question__hide": false, - "total_acs": 19232, - "total_submitted": 47067, + "total_acs": 19466, + "total_submitted": 47575, "frontend_question_id": 1626, "is_new_question": false }, @@ -14689,8 +14919,8 @@ "question__title": "Lexicographically Smallest String After Applying Operations", "question__title_slug": "lexicographically-smallest-string-after-applying-operations", "question__hide": false, - "total_acs": 10655, - "total_submitted": 16181, + "total_acs": 10729, + "total_submitted": 16296, "frontend_question_id": 1625, "is_new_question": false }, @@ -14712,8 +14942,8 @@ "question__title": "Largest Substring Between Two Equal Characters", "question__title_slug": "largest-substring-between-two-equal-characters", "question__hide": false, - "total_acs": 33303, - "total_submitted": 56109, + "total_acs": 33605, + "total_submitted": 56621, "frontend_question_id": 1624, "is_new_question": false }, @@ -14735,8 +14965,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": 18742, - "total_submitted": 24881, + "total_acs": 18882, + "total_submitted": 25059, "frontend_question_id": 1602, "is_new_question": false }, @@ -14758,8 +14988,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": 6935, - "total_submitted": 16263, + "total_acs": 7022, + "total_submitted": 16476, "frontend_question_id": 1639, "is_new_question": false }, @@ -14781,8 +15011,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": 18423, - "total_submitted": 25629, + "total_acs": 18725, + "total_submitted": 26063, "frontend_question_id": 1638, "is_new_question": false }, @@ -14804,8 +15034,8 @@ "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": 30081, - "total_submitted": 35791, + "total_acs": 30469, + "total_submitted": 36263, "frontend_question_id": 1637, "is_new_question": false }, @@ -14827,8 +15057,8 @@ "question__title": "Sort Array by Increasing Frequency", "question__title_slug": "sort-array-by-increasing-frequency", "question__hide": false, - "total_acs": 64226, - "total_submitted": 93828, + "total_acs": 65414, + "total_submitted": 95537, "frontend_question_id": 1636, "is_new_question": false }, @@ -14850,8 +15080,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": 6375, - "total_submitted": 9784, + "total_acs": 6621, + "total_submitted": 10086, "frontend_question_id": 1617, "is_new_question": false }, @@ -14873,8 +15103,8 @@ "question__title": "Split Two Strings to Make Palindrome", "question__title_slug": "split-two-strings-to-make-palindrome", "question__hide": false, - "total_acs": 17114, - "total_submitted": 54636, + "total_acs": 17271, + "total_submitted": 55120, "frontend_question_id": 1616, "is_new_question": false }, @@ -14896,8 +15126,8 @@ "question__title": "Maximal Network Rank", "question__title_slug": "maximal-network-rank", "question__hide": false, - "total_acs": 42183, - "total_submitted": 73576, + "total_acs": 43428, + "total_submitted": 75575, "frontend_question_id": 1615, "is_new_question": false }, @@ -14919,8 +15149,8 @@ "question__title": "Maximum Nesting Depth of the Parentheses", "question__title_slug": "maximum-nesting-depth-of-the-parentheses", "question__hide": false, - "total_acs": 89850, - "total_submitted": 108677, + "total_acs": 91189, + "total_submitted": 110305, "frontend_question_id": 1614, "is_new_question": false }, @@ -14942,8 +15172,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": 8189, - "total_submitted": 13452, + "total_acs": 8453, + "total_submitted": 13848, "frontend_question_id": 1597, "is_new_question": false }, @@ -14965,8 +15195,8 @@ "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": 19923, - "total_submitted": 23428, + "total_acs": 20248, + "total_submitted": 23826, "frontend_question_id": 1596, "is_new_question": false }, @@ -14988,8 +15218,8 @@ "question__title": "Bank Account Summary II", "question__title_slug": "bank-account-summary-ii", "question__hide": false, - "total_acs": 28744, - "total_submitted": 31959, + "total_acs": 30487, + "total_submitted": 33868, "frontend_question_id": 1587, "is_new_question": false }, @@ -15011,8 +15241,8 @@ "question__title": "Maximum Number of Visible Points", "question__title_slug": "maximum-number-of-visible-points", "question__hide": false, - "total_acs": 28787, - "total_submitted": 77661, + "total_acs": 29335, + "total_submitted": 78938, "frontend_question_id": 1610, "is_new_question": false }, @@ -15034,8 +15264,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": 10496, - "total_submitted": 16803, + "total_acs": 10594, + "total_submitted": 16963, "frontend_question_id": 1611, "is_new_question": false }, @@ -15057,8 +15287,8 @@ "question__title": "Even Odd Tree", "question__title_slug": "even-odd-tree", "question__hide": false, - "total_acs": 33555, - "total_submitted": 63082, + "total_acs": 33957, + "total_submitted": 63783, "frontend_question_id": 1609, "is_new_question": false }, @@ -15080,8 +15310,8 @@ "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": 43342, - "total_submitted": 71758, + "total_acs": 44772, + "total_submitted": 74036, "frontend_question_id": 1608, "is_new_question": false }, @@ -15103,8 +15333,8 @@ "question__title": "Binary Search Tree Iterator II", "question__title_slug": "binary-search-tree-iterator-ii", "question__hide": false, - "total_acs": 11026, - "total_submitted": 15608, + "total_acs": 11110, + "total_submitted": 15727, "frontend_question_id": 1586, "is_new_question": false }, @@ -15126,8 +15356,8 @@ "question__title": "Fancy Sequence", "question__title_slug": "fancy-sequence", "question__hide": false, - "total_acs": 7427, - "total_submitted": 47634, + "total_acs": 7513, + "total_submitted": 48229, "frontend_question_id": 1622, "is_new_question": false }, @@ -15149,8 +15379,8 @@ "question__title": "Cat and Mouse II", "question__title_slug": "cat-and-mouse-ii", "question__hide": false, - "total_acs": 4890, - "total_submitted": 11878, + "total_acs": 4933, + "total_submitted": 11963, "frontend_question_id": 1728, "is_new_question": false }, @@ -15172,8 +15402,8 @@ "question__title": "Coordinate With Maximum Network Quality", "question__title_slug": "coordinate-with-maximum-network-quality", "question__hide": false, - "total_acs": 6517, - "total_submitted": 17543, + "total_acs": 6542, + "total_submitted": 17611, "frontend_question_id": 1620, "is_new_question": false }, @@ -15195,8 +15425,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": 6970, - "total_submitted": 16452, + "total_acs": 7028, + "total_submitted": 16588, "frontend_question_id": 1621, "is_new_question": false }, @@ -15218,8 +15448,8 @@ "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": 32109, - "total_submitted": 35621, + "total_acs": 34677, + "total_submitted": 38435, "frontend_question_id": 1581, "is_new_question": false }, @@ -15241,8 +15471,8 @@ "question__title": "Maximum Number of Achievable Transfer Requests", "question__title_slug": "maximum-number-of-achievable-transfer-requests", "question__hide": false, - "total_acs": 8103, - "total_submitted": 15914, + "total_acs": 8151, + "total_submitted": 16000, "frontend_question_id": 1601, "is_new_question": false }, @@ -15264,8 +15494,8 @@ "question__title": "Throne Inheritance", "question__title_slug": "throne-inheritance", "question__hide": false, - "total_acs": 11995, - "total_submitted": 18906, + "total_acs": 12109, + "total_submitted": 19053, "frontend_question_id": 1600, "is_new_question": false }, @@ -15287,8 +15517,8 @@ "question__title": "Maximum Profit of Operating a Centennial Wheel", "question__title_slug": "maximum-profit-of-operating-a-centennial-wheel", "question__hide": false, - "total_acs": 9845, - "total_submitted": 22420, + "total_acs": 9875, + "total_submitted": 22481, "frontend_question_id": 1599, "is_new_question": false }, @@ -15310,8 +15540,8 @@ "question__title": "Crawler Log Folder", "question__title_slug": "crawler-log-folder", "question__hide": false, - "total_acs": 43592, - "total_submitted": 67728, + "total_acs": 44230, + "total_submitted": 68716, "frontend_question_id": 1598, "is_new_question": false }, @@ -15333,8 +15563,8 @@ "question__title": "Put Boxes Into the Warehouse II", "question__title_slug": "put-boxes-into-the-warehouse-ii", "question__hide": false, - "total_acs": 3263, - "total_submitted": 5137, + "total_acs": 3354, + "total_submitted": 5273, "frontend_question_id": 1580, "is_new_question": false }, @@ -15356,8 +15586,8 @@ "question__title": "Warehouse Manager", "question__title_slug": "warehouse-manager", "question__hide": false, - "total_acs": 22489, - "total_submitted": 24997, + "total_acs": 23073, + "total_submitted": 25637, "frontend_question_id": 1571, "is_new_question": false }, @@ -15379,8 +15609,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": 6387, - "total_submitted": 13895, + "total_acs": 6430, + "total_submitted": 13966, "frontend_question_id": 1595, "is_new_question": false }, @@ -15402,8 +15632,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": 17005, - "total_submitted": 51292, + "total_acs": 17151, + "total_submitted": 51742, "frontend_question_id": 1594, "is_new_question": false }, @@ -15425,8 +15655,8 @@ "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": 21233, - "total_submitted": 38868, + "total_acs": 21466, + "total_submitted": 39232, "frontend_question_id": 1593, "is_new_question": false }, @@ -15448,8 +15678,8 @@ "question__title": "Rearrange Spaces Between Words", "question__title_slug": "rearrange-spaces-between-words", "question__hide": false, - "total_acs": 37517, - "total_submitted": 85548, + "total_acs": 38184, + "total_submitted": 86965, "frontend_question_id": 1592, "is_new_question": false }, @@ -15471,8 +15701,8 @@ "question__title": "Dot Product of Two Sparse Vectors", "question__title_slug": "dot-product-of-two-sparse-vectors", "question__hide": false, - "total_acs": 153518, - "total_submitted": 170109, + "total_acs": 155142, + "total_submitted": 171885, "frontend_question_id": 1570, "is_new_question": false }, @@ -15494,8 +15724,8 @@ "question__title": "Unique Orders and Customers Per Month", "question__title_slug": "unique-orders-and-customers-per-month", "question__hide": false, - "total_acs": 15020, - "total_submitted": 18015, + "total_acs": 15203, + "total_submitted": 18234, "frontend_question_id": 1565, "is_new_question": false }, @@ -15517,8 +15747,8 @@ "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": 26571, - "total_submitted": 33997, + "total_acs": 26945, + "total_submitted": 34505, "frontend_question_id": 1605, "is_new_question": false }, @@ -15540,8 +15770,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": 8450, - "total_submitted": 20504, + "total_acs": 8732, + "total_submitted": 21005, "frontend_question_id": 1606, "is_new_question": false }, @@ -15563,8 +15793,8 @@ "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": 21962, - "total_submitted": 46600, + "total_acs": 22455, + "total_submitted": 47580, "frontend_question_id": 1604, "is_new_question": false }, @@ -15586,8 +15816,8 @@ "question__title": "Design Parking System", "question__title_slug": "design-parking-system", "question__hide": false, - "total_acs": 123943, - "total_submitted": 141371, + "total_acs": 126334, + "total_submitted": 144001, "frontend_question_id": 1603, "is_new_question": false }, @@ -15609,8 +15839,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": 6120, - "total_submitted": 12635, + "total_acs": 6148, + "total_submitted": 12679, "frontend_question_id": 1585, "is_new_question": false }, @@ -15632,8 +15862,8 @@ "question__title": "Min Cost to Connect All Points", "question__title_slug": "min-cost-to-connect-all-points", "question__hide": false, - "total_acs": 101423, - "total_submitted": 157607, + "total_acs": 104353, + "total_submitted": 162057, "frontend_question_id": 1584, "is_new_question": false }, @@ -15655,8 +15885,8 @@ "question__title": "Count Unhappy Friends", "question__title_slug": "count-unhappy-friends", "question__hide": false, - "total_acs": 17134, - "total_submitted": 29342, + "total_acs": 17331, + "total_submitted": 29659, "frontend_question_id": 1583, "is_new_question": false }, @@ -15678,8 +15908,8 @@ "question__title": "Special Positions in a Binary Matrix", "question__title_slug": "special-positions-in-a-binary-matrix", "question__hide": false, - "total_acs": 32269, - "total_submitted": 49534, + "total_acs": 32571, + "total_submitted": 49954, "frontend_question_id": 1582, "is_new_question": false }, @@ -15701,8 +15931,8 @@ "question__title": "Put Boxes Into the Warehouse I", "question__title_slug": "put-boxes-into-the-warehouse-i", "question__hide": false, - "total_acs": 10508, - "total_submitted": 16260, + "total_acs": 11447, + "total_submitted": 17431, "frontend_question_id": 1564, "is_new_question": false }, @@ -15724,8 +15954,8 @@ "question__title": "Bank Account Summary", "question__title_slug": "bank-account-summary", "question__hide": false, - "total_acs": 11201, - "total_submitted": 21079, + "total_acs": 11342, + "total_submitted": 21332, "frontend_question_id": 1555, "is_new_question": false }, @@ -15747,8 +15977,8 @@ "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": 13409, - "total_submitted": 26011, + "total_acs": 13682, + "total_submitted": 26472, "frontend_question_id": 1579, "is_new_question": false }, @@ -15770,8 +16000,8 @@ "question__title": "Minimum Time to Make Rope Colorful", "question__title_slug": "minimum-time-to-make-rope-colorful", "question__hide": false, - "total_acs": 65340, - "total_submitted": 106659, + "total_acs": 66364, + "total_submitted": 108329, "frontend_question_id": 1578, "is_new_question": false }, @@ -15793,8 +16023,8 @@ "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": 15712, - "total_submitted": 39867, + "total_acs": 15813, + "total_submitted": 40091, "frontend_question_id": 1577, "is_new_question": false }, @@ -15816,8 +16046,8 @@ "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": 45252, - "total_submitted": 91429, + "total_acs": 45590, + "total_submitted": 92140, "frontend_question_id": 1576, "is_new_question": false }, @@ -15839,8 +16069,8 @@ "question__title": "Strings Differ by One Character", "question__title_slug": "strings-differ-by-one-character", "question__hide": false, - "total_acs": 16502, - "total_submitted": 34241, + "total_acs": 17154, + "total_submitted": 36292, "frontend_question_id": 1554, "is_new_question": false }, @@ -15862,8 +16092,8 @@ "question__title": "Strange Printer II", "question__title_slug": "strange-printer-ii", "question__hide": false, - "total_acs": 6345, - "total_submitted": 11108, + "total_acs": 6464, + "total_submitted": 11279, "frontend_question_id": 1591, "is_new_question": false }, @@ -15885,8 +16115,8 @@ "question__title": "Maximum Sum Obtained of Any Permutation", "question__title_slug": "maximum-sum-obtained-of-any-permutation", "question__hide": false, - "total_acs": 12944, - "total_submitted": 35224, + "total_acs": 13043, + "total_submitted": 35465, "frontend_question_id": 1589, "is_new_question": false }, @@ -15908,8 +16138,8 @@ "question__title": "Make Sum Divisible by P", "question__title_slug": "make-sum-divisible-by-p", "question__hide": false, - "total_acs": 16599, - "total_submitted": 58973, + "total_acs": 16786, + "total_submitted": 59646, "frontend_question_id": 1590, "is_new_question": false }, @@ -15931,8 +16161,8 @@ "question__title": "Sum of All Odd Length Subarrays", "question__title_slug": "sum-of-all-odd-length-subarrays", "question__hide": false, - "total_acs": 103626, - "total_submitted": 124047, + "total_acs": 105852, + "total_submitted": 126642, "frontend_question_id": 1588, "is_new_question": false }, @@ -15954,8 +16184,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": 9830, - "total_submitted": 20067, + "total_acs": 9982, + "total_submitted": 20373, "frontend_question_id": 1569, "is_new_question": false }, @@ -15977,8 +16207,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": 8696, - "total_submitted": 18020, + "total_acs": 8811, + "total_submitted": 18293, "frontend_question_id": 1568, "is_new_question": false }, @@ -16000,8 +16230,8 @@ "question__title": "Maximum Length of Subarray With Positive Product", "question__title_slug": "maximum-length-of-subarray-with-positive-product", "question__hide": false, - "total_acs": 54304, - "total_submitted": 125644, + "total_acs": 56356, + "total_submitted": 130321, "frontend_question_id": 1567, "is_new_question": false }, @@ -16023,8 +16253,8 @@ "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": 24817, - "total_submitted": 56973, + "total_acs": 24992, + "total_submitted": 57407, "frontend_question_id": 1566, "is_new_question": false }, @@ -16046,8 +16276,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": 14333, - "total_submitted": 21199, + "total_acs": 14726, + "total_submitted": 21753, "frontend_question_id": 1549, "is_new_question": false }, @@ -16069,8 +16299,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": 13789, - "total_submitted": 24245, + "total_acs": 13860, + "total_submitted": 24366, "frontend_question_id": 1548, "is_new_question": false }, @@ -16092,8 +16322,8 @@ "question__title": "Fix Product Name Format", "question__title_slug": "fix-product-name-format", "question__hide": false, - "total_acs": 13951, - "total_submitted": 22173, + "total_acs": 14145, + "total_submitted": 22495, "frontend_question_id": 1543, "is_new_question": false }, @@ -16115,8 +16345,8 @@ "question__title": "Stone Game V", "question__title_slug": "stone-game-v", "question__hide": false, - "total_acs": 13145, - "total_submitted": 32311, + "total_acs": 13273, + "total_submitted": 32601, "frontend_question_id": 1563, "is_new_question": false }, @@ -16138,8 +16368,8 @@ "question__title": "Find Latest Group of Size M", "question__title_slug": "find-latest-group-of-size-m", "question__hide": false, - "total_acs": 13246, - "total_submitted": 31999, + "total_acs": 13403, + "total_submitted": 32285, "frontend_question_id": 1562, "is_new_question": false }, @@ -16161,8 +16391,8 @@ "question__title": "Maximum Number of Coins You Can Get", "question__title_slug": "maximum-number-of-coins-you-can-get", "question__hide": false, - "total_acs": 48657, - "total_submitted": 62092, + "total_acs": 49472, + "total_submitted": 63079, "frontend_question_id": 1561, "is_new_question": false }, @@ -16184,8 +16414,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": 22002, - "total_submitted": 37757, + "total_acs": 22195, + "total_submitted": 38057, "frontend_question_id": 1560, "is_new_question": false }, @@ -16207,8 +16437,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": 1445, - "total_submitted": 2303, + "total_acs": 1460, + "total_submitted": 2330, "frontend_question_id": 1538, "is_new_question": false }, @@ -16230,8 +16460,8 @@ "question__title": "Count All Possible Routes", "question__title_slug": "count-all-possible-routes", "question__hide": false, - "total_acs": 10280, - "total_submitted": 17934, + "total_acs": 10428, + "total_submitted": 18221, "frontend_question_id": 1575, "is_new_question": false }, @@ -16253,8 +16483,8 @@ "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": 19445, - "total_submitted": 54193, + "total_acs": 19734, + "total_submitted": 54796, "frontend_question_id": 1574, "is_new_question": false }, @@ -16276,8 +16506,8 @@ "question__title": "Number of Ways to Split a String", "question__title_slug": "number-of-ways-to-split-a-string", "question__hide": false, - "total_acs": 20071, - "total_submitted": 62484, + "total_acs": 20237, + "total_submitted": 62947, "frontend_question_id": 1573, "is_new_question": false }, @@ -16299,8 +16529,8 @@ "question__title": "Matrix Diagonal Sum", "question__title_slug": "matrix-diagonal-sum", "question__hide": false, - "total_acs": 113506, - "total_submitted": 143073, + "total_acs": 116220, + "total_submitted": 146375, "frontend_question_id": 1572, "is_new_question": false }, @@ -16322,8 +16552,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": 22969, - "total_submitted": 69092, + "total_acs": 23255, + "total_submitted": 69731, "frontend_question_id": 1553, "is_new_question": false }, @@ -16345,8 +16575,8 @@ "question__title": "Magnetic Force Between Two Balls", "question__title_slug": "magnetic-force-between-two-balls", "question__hide": false, - "total_acs": 29157, - "total_submitted": 52463, + "total_acs": 29800, + "total_submitted": 53446, "frontend_question_id": 1552, "is_new_question": false }, @@ -16368,8 +16598,8 @@ "question__title": "Minimum Operations to Make Array Equal", "question__title_slug": "minimum-operations-to-make-array-equal", "question__hide": false, - "total_acs": 67257, - "total_submitted": 83101, + "total_acs": 67771, + "total_submitted": 83712, "frontend_question_id": 1551, "is_new_question": false }, @@ -16391,8 +16621,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": 4690, - "total_submitted": 9294, + "total_acs": 4753, + "total_submitted": 9442, "frontend_question_id": 1533, "is_new_question": false }, @@ -16414,8 +16644,8 @@ "question__title": "The Most Recent Three Orders", "question__title_slug": "the-most-recent-three-orders", "question__hide": false, - "total_acs": 16538, - "total_submitted": 23300, + "total_acs": 16837, + "total_submitted": 23694, "frontend_question_id": 1532, "is_new_question": false }, @@ -16437,8 +16667,8 @@ "question__title": "Patients With a Condition", "question__title_slug": "patients-with-a-condition", "question__hide": false, - "total_acs": 33927, - "total_submitted": 75719, + "total_acs": 37044, + "total_submitted": 83308, "frontend_question_id": 1527, "is_new_question": false }, @@ -16460,8 +16690,8 @@ "question__title": "Minimum Cost to Cut a Stick", "question__title_slug": "minimum-cost-to-cut-a-stick", "question__hide": false, - "total_acs": 25726, - "total_submitted": 46360, + "total_acs": 26963, + "total_submitted": 48471, "frontend_question_id": 1547, "is_new_question": false }, @@ -16483,8 +16713,8 @@ "question__title": "Find Longest Awesome Substring", "question__title_slug": "find-longest-awesome-substring", "question__hide": false, - "total_acs": 9284, - "total_submitted": 22588, + "total_acs": 9360, + "total_submitted": 22723, "frontend_question_id": 1542, "is_new_question": false }, @@ -16506,8 +16736,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": 25094, - "total_submitted": 43123, + "total_acs": 25435, + "total_submitted": 43704, "frontend_question_id": 1545, "is_new_question": false }, @@ -16529,8 +16759,8 @@ "question__title": "Make The String Great", "question__title_slug": "make-the-string-great", "question__hide": false, - "total_acs": 50435, - "total_submitted": 89076, + "total_acs": 50965, + "total_submitted": 89996, "frontend_question_id": 1544, "is_new_question": false }, @@ -16552,8 +16782,8 @@ "question__title": "Diameter of N-Ary Tree", "question__title_slug": "diameter-of-n-ary-tree", "question__hide": false, - "total_acs": 32933, - "total_submitted": 44969, + "total_acs": 33281, + "total_submitted": 45426, "frontend_question_id": 1522, "is_new_question": false }, @@ -16575,8 +16805,8 @@ "question__title": "Find Users With Valid E-Mails", "question__title_slug": "find-users-with-valid-e-mails", "question__hide": false, - "total_acs": 18996, - "total_submitted": 31860, + "total_acs": 19210, + "total_submitted": 32344, "frontend_question_id": 1517, "is_new_question": false }, @@ -16598,8 +16828,8 @@ "question__title": "Detect Cycles in 2D Grid", "question__title_slug": "detect-cycles-in-2d-grid", "question__hide": false, - "total_acs": 25117, - "total_submitted": 52278, + "total_acs": 25448, + "total_submitted": 52907, "frontend_question_id": 1559, "is_new_question": false }, @@ -16621,8 +16851,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": 15730, - "total_submitted": 24493, + "total_acs": 15844, + "total_submitted": 24666, "frontend_question_id": 1558, "is_new_question": false }, @@ -16644,8 +16874,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": 63423, - "total_submitted": 80230, + "total_acs": 64925, + "total_submitted": 82045, "frontend_question_id": 1557, "is_new_question": false }, @@ -16667,8 +16897,8 @@ "question__title": "Thousand Separator", "question__title_slug": "thousand-separator", "question__hide": false, - "total_acs": 34372, - "total_submitted": 61838, + "total_acs": 34633, + "total_submitted": 62301, "frontend_question_id": 1556, "is_new_question": false }, @@ -16690,8 +16920,8 @@ "question__title": "Get the Maximum Score", "question__title_slug": "get-the-maximum-score", "question__hide": false, - "total_acs": 17366, - "total_submitted": 44237, + "total_acs": 17555, + "total_submitted": 44646, "frontend_question_id": 1537, "is_new_question": false }, @@ -16713,8 +16943,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": 11504, - "total_submitted": 24995, + "total_acs": 11574, + "total_submitted": 25125, "frontend_question_id": 1536, "is_new_question": false }, @@ -16736,8 +16966,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": 24994, - "total_submitted": 51214, + "total_acs": 25154, + "total_submitted": 51542, "frontend_question_id": 1535, "is_new_question": false }, @@ -16759,8 +16989,8 @@ "question__title": "Count Good Triplets", "question__title_slug": "count-good-triplets", "question__hide": false, - "total_acs": 77353, - "total_submitted": 95911, + "total_acs": 78130, + "total_submitted": 96847, "frontend_question_id": 1534, "is_new_question": false }, @@ -16782,8 +17012,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": 1775, - "total_submitted": 2755, + "total_acs": 1799, + "total_submitted": 2792, "frontend_question_id": 1516, "is_new_question": false }, @@ -16805,8 +17035,8 @@ "question__title": "Customer Order Frequency", "question__title_slug": "customer-order-frequency", "question__hide": false, - "total_acs": 29150, - "total_submitted": 39751, + "total_acs": 29513, + "total_submitted": 40262, "frontend_question_id": 1511, "is_new_question": false }, @@ -16828,8 +17058,8 @@ "question__title": "Number of Good Leaf Nodes Pairs", "question__title_slug": "number-of-good-leaf-nodes-pairs", "question__hide": false, - "total_acs": 27055, - "total_submitted": 45153, + "total_acs": 27507, + "total_submitted": 45808, "frontend_question_id": 1530, "is_new_question": false }, @@ -16851,8 +17081,8 @@ "question__title": "Minimum Suffix Flips", "question__title_slug": "minimum-suffix-flips", "question__hide": false, - "total_acs": 33174, - "total_submitted": 45865, + "total_acs": 33450, + "total_submitted": 46236, "frontend_question_id": 1529, "is_new_question": false }, @@ -16874,8 +17104,8 @@ "question__title": "Shuffle String", "question__title_slug": "shuffle-string", "question__hide": false, - "total_acs": 213000, - "total_submitted": 248428, + "total_acs": 215981, + "total_submitted": 251907, "frontend_question_id": 1528, "is_new_question": false }, @@ -16897,8 +17127,8 @@ "question__title": "Find Root of N-Ary Tree", "question__title_slug": "find-root-of-n-ary-tree", "question__hide": false, - "total_acs": 22137, - "total_submitted": 28438, + "total_acs": 22429, + "total_submitted": 28835, "frontend_question_id": 1506, "is_new_question": false }, @@ -16920,8 +17150,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": 20593, - "total_submitted": 43931, + "total_acs": 20831, + "total_submitted": 44396, "frontend_question_id": 1546, "is_new_question": false }, @@ -16943,8 +17173,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": 30829, - "total_submitted": 62387, + "total_acs": 31337, + "total_submitted": 63317, "frontend_question_id": 1541, "is_new_question": false }, @@ -16966,8 +17196,8 @@ "question__title": "Can Convert String in K Moves", "question__title_slug": "can-convert-string-in-k-moves", "question__hide": false, - "total_acs": 13785, - "total_submitted": 42133, + "total_acs": 13875, + "total_submitted": 42340, "frontend_question_id": 1540, "is_new_question": false }, @@ -16989,8 +17219,8 @@ "question__title": "Kth Missing Positive Number", "question__title_slug": "kth-missing-positive-number", "question__hide": false, - "total_acs": 173980, - "total_submitted": 312737, + "total_acs": 176561, + "total_submitted": 317209, "frontend_question_id": 1539, "is_new_question": false }, @@ -17012,8 +17242,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": 7629, - "total_submitted": 17521, + "total_acs": 7673, + "total_submitted": 17690, "frontend_question_id": 1521, "is_new_question": false }, @@ -17035,8 +17265,8 @@ "question__title": "Maximum Number of Non-Overlapping Substrings", "question__title_slug": "maximum-number-of-non-overlapping-substrings", "question__hide": false, - "total_acs": 11092, - "total_submitted": 29625, + "total_acs": 11239, + "total_submitted": 29959, "frontend_question_id": 1520, "is_new_question": false }, @@ -17058,8 +17288,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": 17424, - "total_submitted": 43335, + "total_acs": 17642, + "total_submitted": 43749, "frontend_question_id": 1519, "is_new_question": false }, @@ -17081,8 +17311,8 @@ "question__title": "Water Bottles", "question__title_slug": "water-bottles", "question__hide": false, - "total_acs": 50748, - "total_submitted": 84042, + "total_acs": 51176, + "total_submitted": 84728, "frontend_question_id": 1518, "is_new_question": false }, @@ -17104,8 +17334,8 @@ "question__title": "Countries You Can Safely Invest In", "question__title_slug": "countries-you-can-safely-invest-in", "question__hide": false, - "total_acs": 19615, - "total_submitted": 34007, + "total_acs": 20272, + "total_submitted": 35064, "frontend_question_id": 1501, "is_new_question": false }, @@ -17127,8 +17357,8 @@ "question__title": "Design a File Sharing System", "question__title_slug": "design-a-file-sharing-system", "question__hide": false, - "total_acs": 2960, - "total_submitted": 6606, + "total_acs": 2991, + "total_submitted": 6671, "frontend_question_id": 1500, "is_new_question": false }, @@ -17150,8 +17380,8 @@ "question__title": "Friendly Movies Streamed Last Month", "question__title_slug": "friendly-movies-streamed-last-month", "question__hide": false, - "total_acs": 19625, - "total_submitted": 39016, + "total_acs": 19907, + "total_submitted": 39629, "frontend_question_id": 1495, "is_new_question": false }, @@ -17173,8 +17403,8 @@ "question__title": "Best Position for a Service Centre", "question__title_slug": "best-position-for-a-service-centre", "question__hide": false, - "total_acs": 9678, - "total_submitted": 25141, + "total_acs": 9770, + "total_submitted": 25387, "frontend_question_id": 1515, "is_new_question": false }, @@ -17196,8 +17426,8 @@ "question__title": "String Compression II", "question__title_slug": "string-compression-ii", "question__hide": false, - "total_acs": 11568, - "total_submitted": 30176, + "total_acs": 11652, + "total_submitted": 30359, "frontend_question_id": 1531, "is_new_question": false }, @@ -17219,8 +17449,8 @@ "question__title": "Number of Substrings With Only 1s", "question__title_slug": "number-of-substrings-with-only-1s", "question__hide": false, - "total_acs": 30365, - "total_submitted": 68124, + "total_acs": 30629, + "total_submitted": 68612, "frontend_question_id": 1513, "is_new_question": false }, @@ -17242,8 +17472,8 @@ "question__title": "Number of Good Pairs", "question__title_slug": "number-of-good-pairs", "question__hide": false, - "total_acs": 306596, - "total_submitted": 348345, + "total_acs": 310743, + "total_submitted": 352948, "frontend_question_id": 1512, "is_new_question": false }, @@ -17265,8 +17495,8 @@ "question__title": "Clone N-ary Tree", "question__title_slug": "clone-n-ary-tree", "question__hide": false, - "total_acs": 21763, - "total_submitted": 25972, + "total_acs": 21923, + "total_submitted": 26177, "frontend_question_id": 1490, "is_new_question": false }, @@ -17288,8 +17518,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": 25430, - "total_submitted": 37293, + "total_acs": 25664, + "total_submitted": 37613, "frontend_question_id": 1526, "is_new_question": false }, @@ -17311,8 +17541,8 @@ "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": 73155, - "total_submitted": 104673, + "total_acs": 74028, + "total_submitted": 105991, "frontend_question_id": 1525, "is_new_question": false }, @@ -17334,8 +17564,8 @@ "question__title": "Number of Sub-arrays With Odd Sum", "question__title_slug": "number-of-sub-arrays-with-odd-sum", "question__hide": false, - "total_acs": 24399, - "total_submitted": 56245, + "total_acs": 24693, + "total_submitted": 56902, "frontend_question_id": 1524, "is_new_question": false }, @@ -17357,8 +17587,8 @@ "question__title": "Count Odd Numbers in an Interval Range", "question__title_slug": "count-odd-numbers-in-an-interval-range", "question__hide": false, - "total_acs": 99236, - "total_submitted": 212274, + "total_acs": 103985, + "total_submitted": 222673, "frontend_question_id": 1523, "is_new_question": false }, @@ -17380,8 +17610,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": 7620, - "total_submitted": 20098, + "total_acs": 7668, + "total_submitted": 20264, "frontend_question_id": 1505, "is_new_question": false }, @@ -17403,8 +17633,8 @@ "question__title": "Count Submatrices With All Ones", "question__title_slug": "count-submatrices-with-all-ones", "question__hide": false, - "total_acs": 36766, - "total_submitted": 63031, + "total_acs": 37150, + "total_submitted": 63724, "frontend_question_id": 1504, "is_new_question": false }, @@ -17426,8 +17656,8 @@ "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": 15733, - "total_submitted": 28604, + "total_acs": 15817, + "total_submitted": 28737, "frontend_question_id": 1503, "is_new_question": false }, @@ -17449,8 +17679,8 @@ "question__title": "Can Make Arithmetic Progression From Sequence", "question__title_slug": "can-make-arithmetic-progression-from-sequence", "question__hide": false, - "total_acs": 88068, - "total_submitted": 127161, + "total_acs": 90049, + "total_submitted": 130210, "frontend_question_id": 1502, "is_new_question": false }, @@ -17472,8 +17702,8 @@ "question__title": "Group Sold Products By The Date", "question__title_slug": "group-sold-products-by-the-date", "question__hide": false, - "total_acs": 39819, - "total_submitted": 47371, + "total_acs": 43254, + "total_submitted": 51416, "frontend_question_id": 1484, "is_new_question": false }, @@ -17495,8 +17725,8 @@ "question__title": "Clone Binary Tree With Random Pointer", "question__title_slug": "clone-binary-tree-with-random-pointer", "question__hide": false, - "total_acs": 17185, - "total_submitted": 21562, + "total_acs": 17327, + "total_submitted": 21752, "frontend_question_id": 1485, "is_new_question": false }, @@ -17518,8 +17748,8 @@ "question__title": "Sales by Day of the Week", "question__title_slug": "sales-by-day-of-the-week", "question__hide": false, - "total_acs": 13083, - "total_submitted": 15849, + "total_acs": 13216, + "total_submitted": 16041, "frontend_question_id": 1479, "is_new_question": false }, @@ -17541,8 +17771,8 @@ "question__title": "Max Value of Equation", "question__title_slug": "max-value-of-equation", "question__hide": false, - "total_acs": 31354, - "total_submitted": 67152, + "total_acs": 31762, + "total_submitted": 68038, "frontend_question_id": 1499, "is_new_question": false }, @@ -17564,8 +17794,8 @@ "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": 30778, - "total_submitted": 78663, + "total_acs": 31308, + "total_submitted": 80150, "frontend_question_id": 1498, "is_new_question": false }, @@ -17587,8 +17817,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": 32159, - "total_submitted": 79889, + "total_acs": 32512, + "total_submitted": 80926, "frontend_question_id": 1497, "is_new_question": false }, @@ -17610,8 +17840,8 @@ "question__title": "Path Crossing", "question__title_slug": "path-crossing", "question__hide": false, - "total_acs": 36819, - "total_submitted": 66021, + "total_acs": 37149, + "total_submitted": 66595, "frontend_question_id": 1496, "is_new_question": false }, @@ -17633,8 +17863,8 @@ "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": 20624, - "total_submitted": 28073, + "total_acs": 20878, + "total_submitted": 28399, "frontend_question_id": 1474, "is_new_question": false }, @@ -17656,8 +17886,8 @@ "question__title": "Stone Game IV", "question__title_slug": "stone-game-iv", "question__hide": false, - "total_acs": 59547, - "total_submitted": 98069, + "total_acs": 59884, + "total_submitted": 98654, "frontend_question_id": 1510, "is_new_question": false }, @@ -17679,8 +17909,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": 64622, - "total_submitted": 117083, + "total_acs": 65441, + "total_submitted": 118600, "frontend_question_id": 1509, "is_new_question": false }, @@ -17702,8 +17932,8 @@ "question__title": "Range Sum of Sorted Subarray Sums", "question__title_slug": "range-sum-of-sorted-subarray-sums", "question__hide": false, - "total_acs": 26102, - "total_submitted": 44046, + "total_acs": 26465, + "total_submitted": 44639, "frontend_question_id": 1508, "is_new_question": false }, @@ -17725,8 +17955,8 @@ "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": 8145, - "total_submitted": 15395, + "total_acs": 8305, + "total_submitted": 15664, "frontend_question_id": 1489, "is_new_question": false }, @@ -17748,8 +17978,8 @@ "question__title": "Avoid Flood in The City", "question__title_slug": "avoid-flood-in-the-city", "question__hide": false, - "total_acs": 24723, - "total_submitted": 96424, + "total_acs": 25065, + "total_submitted": 97535, "frontend_question_id": 1488, "is_new_question": false }, @@ -17771,8 +18001,8 @@ "question__title": "Making File Names Unique", "question__title_slug": "making-file-names-unique", "question__hide": false, - "total_acs": 24458, - "total_submitted": 69694, + "total_acs": 24754, + "total_submitted": 70365, "frontend_question_id": 1487, "is_new_question": false }, @@ -17794,8 +18024,8 @@ "question__title": "XOR Operation in an Array", "question__title_slug": "xor-operation-in-an-array", "question__hide": false, - "total_acs": 124348, - "total_submitted": 147718, + "total_acs": 125653, + "total_submitted": 149382, "frontend_question_id": 1486, "is_new_question": false }, @@ -17817,8 +18047,8 @@ "question__title": "Find All The Lonely Nodes", "question__title_slug": "find-all-the-lonely-nodes", "question__hide": false, - "total_acs": 35845, - "total_submitted": 43853, + "total_acs": 36295, + "total_submitted": 44401, "frontend_question_id": 1469, "is_new_question": false }, @@ -17840,8 +18070,8 @@ "question__title": "Calculate Salaries", "question__title_slug": "calculate-salaries", "question__hide": false, - "total_acs": 16276, - "total_submitted": 19830, + "total_acs": 16475, + "total_submitted": 20119, "frontend_question_id": 1468, "is_new_question": false }, @@ -17863,8 +18093,8 @@ "question__title": "Rectangles Area", "question__title_slug": "rectangles-area", "question__hide": false, - "total_acs": 9866, - "total_submitted": 14317, + "total_acs": 10094, + "total_submitted": 14585, "frontend_question_id": 1459, "is_new_question": false }, @@ -17886,8 +18116,8 @@ "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": 40397, - "total_submitted": 71478, + "total_acs": 41221, + "total_submitted": 72785, "frontend_question_id": 1482, "is_new_question": false }, @@ -17909,8 +18139,8 @@ "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": 72575, - "total_submitted": 120278, + "total_acs": 73449, + "total_submitted": 122383, "frontend_question_id": 1481, "is_new_question": false }, @@ -17932,8 +18162,8 @@ "question__title": "Running Sum of 1d Array", "question__title_slug": "running-sum-of-1d-array", "question__hide": false, - "total_acs": 611650, - "total_submitted": 676326, + "total_acs": 654473, + "total_submitted": 723374, "frontend_question_id": 1480, "is_new_question": false }, @@ -17955,8 +18185,8 @@ "question__title": "Parallel Courses II", "question__title_slug": "parallel-courses-ii", "question__hide": false, - "total_acs": 11241, - "total_submitted": 35585, + "total_acs": 11366, + "total_submitted": 36008, "frontend_question_id": 1494, "is_new_question": false }, @@ -17978,8 +18208,8 @@ "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": 42296, - "total_submitted": 70342, + "total_acs": 42889, + "total_submitted": 71298, "frontend_question_id": 1493, "is_new_question": false }, @@ -18001,8 +18231,8 @@ "question__title": "The kth Factor of n", "question__title_slug": "the-kth-factor-of-n", "question__hide": false, - "total_acs": 95342, - "total_submitted": 153580, + "total_acs": 96586, + "total_submitted": 155516, "frontend_question_id": 1492, "is_new_question": false }, @@ -18024,8 +18254,8 @@ "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": 115823, - "total_submitted": 180298, + "total_acs": 119802, + "total_submitted": 186706, "frontend_question_id": 1491, "is_new_question": false }, @@ -18047,8 +18277,8 @@ "question__title": "Paint House III", "question__title_slug": "paint-house-iii", "question__hide": false, - "total_acs": 16637, - "total_submitted": 32599, + "total_acs": 16845, + "total_submitted": 32954, "frontend_question_id": 1473, "is_new_question": false }, @@ -18070,8 +18300,8 @@ "question__title": "Design Browser History", "question__title_slug": "design-browser-history", "question__hide": false, - "total_acs": 80684, - "total_submitted": 107313, + "total_acs": 82127, + "total_submitted": 109185, "frontend_question_id": 1472, "is_new_question": false }, @@ -18093,8 +18323,8 @@ "question__title": "The k Strongest Values in an Array", "question__title_slug": "the-k-strongest-values-in-an-array", "question__hide": false, - "total_acs": 27984, - "total_submitted": 46759, + "total_acs": 28144, + "total_submitted": 47011, "frontend_question_id": 1471, "is_new_question": false }, @@ -18116,8 +18346,8 @@ "question__title": "Shuffle the Array", "question__title_slug": "shuffle-the-array", "question__hide": false, - "total_acs": 324549, - "total_submitted": 367183, + "total_acs": 328146, + "total_submitted": 371158, "frontend_question_id": 1470, "is_new_question": false }, @@ -18139,8 +18369,8 @@ "question__title": "Active Users", "question__title_slug": "active-users", "question__hide": false, - "total_acs": 24250, - "total_submitted": 63243, + "total_acs": 24624, + "total_submitted": 64291, "frontend_question_id": 1454, "is_new_question": false }, @@ -18162,8 +18392,8 @@ "question__title": "Apples & Oranges", "question__title_slug": "apples-oranges", "question__hide": false, - "total_acs": 29014, - "total_submitted": 31706, + "total_acs": 29732, + "total_submitted": 32486, "frontend_question_id": 1445, "is_new_question": false }, @@ -18185,8 +18415,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": 6097, - "total_submitted": 9977, + "total_acs": 6129, + "total_submitted": 10025, "frontend_question_id": 1467, "is_new_question": false }, @@ -18208,8 +18438,8 @@ "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": 56109, - "total_submitted": 91658, + "total_acs": 57155, + "total_submitted": 93195, "frontend_question_id": 1466, "is_new_question": false }, @@ -18231,8 +18461,8 @@ "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": 93789, - "total_submitted": 251999, + "total_acs": 94342, + "total_submitted": 253421, "frontend_question_id": 1465, "is_new_question": false }, @@ -18254,8 +18484,8 @@ "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": 136900, - "total_submitted": 174027, + "total_acs": 139094, + "total_submitted": 176598, "frontend_question_id": 1464, "is_new_question": false }, @@ -18277,8 +18507,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": 38622, - "total_submitted": 104602, + "total_acs": 38986, + "total_submitted": 105523, "frontend_question_id": 1477, "is_new_question": false }, @@ -18300,8 +18530,8 @@ "question__title": "Subrectangle Queries", "question__title_slug": "subrectangle-queries", "question__hide": false, - "total_acs": 72344, - "total_submitted": 81981, + "total_acs": 73022, + "total_submitted": 82732, "frontend_question_id": 1476, "is_new_question": false }, @@ -18323,8 +18553,8 @@ "question__title": "Allocate Mailboxes", "question__title_slug": "allocate-mailboxes", "question__hide": false, - "total_acs": 16077, - "total_submitted": 29034, + "total_acs": 16219, + "total_submitted": 29326, "frontend_question_id": 1478, "is_new_question": false }, @@ -18346,8 +18576,8 @@ "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": 79781, - "total_submitted": 106017, + "total_acs": 80918, + "total_submitted": 107502, "frontend_question_id": 1475, "is_new_question": false }, @@ -18369,8 +18599,8 @@ "question__title": "Max Dot Product of Two Subsequences", "question__title_slug": "max-dot-product-of-two-subsequences", "question__hide": false, - "total_acs": 16942, - "total_submitted": 37259, + "total_acs": 17061, + "total_submitted": 37482, "frontend_question_id": 1458, "is_new_question": false }, @@ -18392,8 +18622,8 @@ "question__title": "Pseudo-Palindromic Paths in a Binary Tree", "question__title_slug": "pseudo-palindromic-paths-in-a-binary-tree", "question__hide": false, - "total_acs": 52296, - "total_submitted": 78055, + "total_acs": 52658, + "total_submitted": 78695, "frontend_question_id": 1457, "is_new_question": false }, @@ -18415,8 +18645,8 @@ "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": 44815, - "total_submitted": 77795, + "total_acs": 45243, + "total_submitted": 78468, "frontend_question_id": 1456, "is_new_question": false }, @@ -18438,8 +18668,8 @@ "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": 51423, - "total_submitted": 79677, + "total_acs": 51962, + "total_submitted": 80561, "frontend_question_id": 1455, "is_new_question": false }, @@ -18461,8 +18691,8 @@ "question__title": "Evaluate Boolean Expression", "question__title_slug": "evaluate-boolean-expression", "question__hide": false, - "total_acs": 13889, - "total_submitted": 18324, + "total_acs": 14303, + "total_submitted": 18839, "frontend_question_id": 1440, "is_new_question": false }, @@ -18484,8 +18714,8 @@ "question__title": "Create a Session Bar Chart", "question__title_slug": "create-a-session-bar-chart", "question__hide": false, - "total_acs": 16580, - "total_submitted": 21192, + "total_acs": 16762, + "total_submitted": 21470, "frontend_question_id": 1435, "is_new_question": false }, @@ -18507,8 +18737,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": 4682, - "total_submitted": 12749, + "total_acs": 4699, + "total_submitted": 12815, "frontend_question_id": 1453, "is_new_question": false }, @@ -18530,8 +18760,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": 19042, - "total_submitted": 33608, + "total_acs": 19157, + "total_submitted": 33757, "frontend_question_id": 1452, "is_new_question": false }, @@ -18553,8 +18783,8 @@ "question__title": "Rearrange Words in a Sentence", "question__title_slug": "rearrange-words-in-a-sentence", "question__hide": false, - "total_acs": 38241, - "total_submitted": 61599, + "total_acs": 38490, + "total_submitted": 61952, "frontend_question_id": 1451, "is_new_question": false }, @@ -18576,8 +18806,8 @@ "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": 85551, - "total_submitted": 112093, + "total_acs": 86175, + "total_submitted": 112961, "frontend_question_id": 1450, "is_new_question": false }, @@ -18599,8 +18829,8 @@ "question__title": "Cherry Pickup II", "question__title_slug": "cherry-pickup-ii", "question__hide": false, - "total_acs": 61297, - "total_submitted": 86760, + "total_acs": 62413, + "total_submitted": 88354, "frontend_question_id": 1463, "is_new_question": false }, @@ -18622,8 +18852,8 @@ "question__title": "Course Schedule IV", "question__title_slug": "course-schedule-iv", "question__hide": false, - "total_acs": 32810, - "total_submitted": 68183, + "total_acs": 33404, + "total_submitted": 69301, "frontend_question_id": 1462, "is_new_question": false }, @@ -18645,8 +18875,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": 99382, - "total_submitted": 174834, + "total_acs": 99853, + "total_submitted": 175693, "frontend_question_id": 1461, "is_new_question": false }, @@ -18668,8 +18898,8 @@ "question__title": "Make Two Arrays Equal by Reversing Sub-arrays", "question__title_slug": "make-two-arrays-equal-by-reversing-sub-arrays", "question__hide": false, - "total_acs": 88421, - "total_submitted": 122144, + "total_acs": 89250, + "total_submitted": 123327, "frontend_question_id": 1460, "is_new_question": false }, @@ -18691,8 +18921,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": 11818, - "total_submitted": 21382, + "total_acs": 11954, + "total_submitted": 21593, "frontend_question_id": 1444, "is_new_question": false }, @@ -18714,8 +18944,8 @@ "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": 29886, - "total_submitted": 53645, + "total_acs": 30118, + "total_submitted": 54036, "frontend_question_id": 1443, "is_new_question": false }, @@ -18737,8 +18967,8 @@ "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": 26417, - "total_submitted": 35254, + "total_acs": 26689, + "total_submitted": 35578, "frontend_question_id": 1442, "is_new_question": false }, @@ -18760,8 +18990,8 @@ "question__title": "Build an Array With Stack Operations", "question__title_slug": "build-an-array-with-stack-operations", "question__hide": false, - "total_acs": 61721, - "total_submitted": 86840, + "total_acs": 62505, + "total_submitted": 87874, "frontend_question_id": 1441, "is_new_question": false }, @@ -18783,8 +19013,8 @@ "question__title": "NPV Queries", "question__title_slug": "npv-queries", "question__hide": false, - "total_acs": 17726, - "total_submitted": 21173, + "total_acs": 18001, + "total_submitted": 21486, "frontend_question_id": 1421, "is_new_question": false }, @@ -18806,8 +19036,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": 25451, - "total_submitted": 41416, + "total_acs": 25655, + "total_submitted": 41741, "frontend_question_id": 1439, "is_new_question": false }, @@ -18829,8 +19059,8 @@ "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": 86612, - "total_submitted": 184737, + "total_acs": 88033, + "total_submitted": 187303, "frontend_question_id": 1438, "is_new_question": false }, @@ -18852,8 +19082,8 @@ "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": 58850, - "total_submitted": 98536, + "total_acs": 59196, + "total_submitted": 99248, "frontend_question_id": 1437, "is_new_question": false }, @@ -18875,8 +19105,8 @@ "question__title": "Destination City", "question__title_slug": "destination-city", "question__hide": false, - "total_acs": 102027, - "total_submitted": 131278, + "total_acs": 103037, + "total_submitted": 132527, "frontend_question_id": 1436, "is_new_question": false }, @@ -18898,8 +19128,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": 17117, - "total_submitted": 27263, + "total_acs": 17332, + "total_submitted": 27605, "frontend_question_id": 1412, "is_new_question": false }, @@ -18921,8 +19151,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": 12419, - "total_submitted": 26571, + "total_acs": 12508, + "total_submitted": 26728, "frontend_question_id": 1449, "is_new_question": false }, @@ -18944,8 +19174,8 @@ "question__title": "Count Good Nodes in Binary Tree", "question__title_slug": "count-good-nodes-in-binary-tree", "question__hide": false, - "total_acs": 175657, - "total_submitted": 240614, + "total_acs": 179620, + "total_submitted": 245941, "frontend_question_id": 1448, "is_new_question": false }, @@ -18967,8 +19197,8 @@ "question__title": "Simplified Fractions", "question__title_slug": "simplified-fractions", "question__hide": false, - "total_acs": 21469, - "total_submitted": 33461, + "total_acs": 21708, + "total_submitted": 33786, "frontend_question_id": 1447, "is_new_question": false }, @@ -18990,8 +19220,8 @@ "question__title": "Consecutive Characters", "question__title_slug": "consecutive-characters", "question__hide": false, - "total_acs": 122418, - "total_submitted": 197747, + "total_acs": 123205, + "total_submitted": 199162, "frontend_question_id": 1446, "is_new_question": false }, @@ -19013,8 +19243,8 @@ "question__title": "Top Travellers", "question__title_slug": "top-travellers", "question__hide": false, - "total_acs": 36165, - "total_submitted": 45196, + "total_acs": 38179, + "total_submitted": 48734, "frontend_question_id": 1407, "is_new_question": false }, @@ -19036,8 +19266,8 @@ "question__title": "Diagonal Traverse II", "question__title_slug": "diagonal-traverse-ii", "question__hide": false, - "total_acs": 42000, - "total_submitted": 83814, + "total_acs": 42318, + "total_submitted": 84428, "frontend_question_id": 1424, "is_new_question": false }, @@ -19059,8 +19289,8 @@ "question__title": "Maximum Points You Can Obtain from Cards", "question__title_slug": "maximum-points-you-can-obtain-from-cards", "question__hide": false, - "total_acs": 138144, - "total_submitted": 275492, + "total_acs": 187762, + "total_submitted": 358511, "frontend_question_id": 1423, "is_new_question": false }, @@ -19082,8 +19312,8 @@ "question__title": "Maximum Score After Splitting a String", "question__title_slug": "maximum-score-after-splitting-a-string", "question__hide": false, - "total_acs": 39452, - "total_submitted": 68308, + "total_acs": 39744, + "total_submitted": 68808, "frontend_question_id": 1422, "is_new_question": false }, @@ -19105,8 +19335,8 @@ "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": 30055, - "total_submitted": 38491, + "total_acs": 30587, + "total_submitted": 39179, "frontend_question_id": 1398, "is_new_question": false }, @@ -19128,8 +19358,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": 9804, - "total_submitted": 15275, + "total_acs": 9871, + "total_submitted": 15404, "frontend_question_id": 1420, "is_new_question": false }, @@ -19151,8 +19381,8 @@ "question__title": "Minimum Number of Frogs Croaking", "question__title_slug": "minimum-number-of-frogs-croaking", "question__hide": false, - "total_acs": 25724, - "total_submitted": 51744, + "total_acs": 25912, + "total_submitted": 52058, "frontend_question_id": 1419, "is_new_question": false }, @@ -19174,8 +19404,8 @@ "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": 19417, - "total_submitted": 26643, + "total_acs": 19523, + "total_submitted": 26774, "frontend_question_id": 1418, "is_new_question": false }, @@ -19197,8 +19427,8 @@ "question__title": "Reformat The String", "question__title_slug": "reformat-the-string", "question__hide": false, - "total_acs": 43493, - "total_submitted": 77415, + "total_acs": 43737, + "total_submitted": 77898, "frontend_question_id": 1417, "is_new_question": false }, @@ -19220,8 +19450,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": 9451, - "total_submitted": 22323, + "total_acs": 9570, + "total_submitted": 22583, "frontend_question_id": 1434, "is_new_question": false }, @@ -19243,8 +19473,8 @@ "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": 30431, - "total_submitted": 44400, + "total_acs": 30666, + "total_submitted": 44723, "frontend_question_id": 1433, "is_new_question": false }, @@ -19266,8 +19496,8 @@ "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": 12575, - "total_submitted": 29141, + "total_acs": 12653, + "total_submitted": 29346, "frontend_question_id": 1432, "is_new_question": false }, @@ -19289,8 +19519,8 @@ "question__title": "Kids With the Greatest Number of Candies", "question__title_slug": "kids-with-the-greatest-number-of-candies", "question__hide": false, - "total_acs": 316200, - "total_submitted": 360558, + "total_acs": 318925, + "total_submitted": 363690, "frontend_question_id": 1431, "is_new_question": false }, @@ -19312,8 +19542,8 @@ "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": 25291, - "total_submitted": 40836, + "total_acs": 25480, + "total_submitted": 41124, "frontend_question_id": 1411, "is_new_question": false }, @@ -19335,8 +19565,8 @@ "question__title": "HTML Entity Parser", "question__title_slug": "html-entity-parser", "question__hide": false, - "total_acs": 19195, - "total_submitted": 36555, + "total_acs": 19276, + "total_submitted": 36744, "frontend_question_id": 1410, "is_new_question": false }, @@ -19358,8 +19588,8 @@ "question__title": "Queries on a Permutation With Key", "question__title_slug": "queries-on-a-permutation-with-key", "question__hide": false, - "total_acs": 38116, - "total_submitted": 45942, + "total_acs": 38337, + "total_submitted": 46191, "frontend_question_id": 1409, "is_new_question": false }, @@ -19381,8 +19611,8 @@ "question__title": "String Matching in an Array", "question__title_slug": "string-matching-in-an-array", "question__hide": false, - "total_acs": 56115, - "total_submitted": 87812, + "total_acs": 56544, + "total_submitted": 88525, "frontend_question_id": 1408, "is_new_question": false }, @@ -19404,8 +19634,8 @@ "question__title": "Capital Gain/Loss", "question__title_slug": "capital-gainloss", "question__hide": false, - "total_acs": 34147, - "total_submitted": 37721, + "total_acs": 36170, + "total_submitted": 39952, "frontend_question_id": 1393, "is_new_question": false }, @@ -19427,8 +19657,8 @@ "question__title": "Stone Game III", "question__title_slug": "stone-game-iii", "question__hide": false, - "total_acs": 36960, - "total_submitted": 61447, + "total_acs": 37266, + "total_submitted": 61989, "frontend_question_id": 1406, "is_new_question": false }, @@ -19450,8 +19680,8 @@ "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": 24847, - "total_submitted": 48771, + "total_acs": 25265, + "total_submitted": 49501, "frontend_question_id": 1404, "is_new_question": false }, @@ -19473,8 +19703,8 @@ "question__title": "Minimum Subsequence in Non-Increasing Order", "question__title_slug": "minimum-subsequence-in-non-increasing-order", "question__hide": false, - "total_acs": 51404, - "total_submitted": 71226, + "total_acs": 51880, + "total_submitted": 71867, "frontend_question_id": 1403, "is_new_question": false }, @@ -19496,8 +19726,8 @@ "question__title": "Total Sales Amount by Year", "question__title_slug": "total-sales-amount-by-year", "question__hide": false, - "total_acs": 10516, - "total_submitted": 15831, + "total_acs": 10776, + "total_submitted": 16192, "frontend_question_id": 1384, "is_new_question": false }, @@ -19519,8 +19749,8 @@ "question__title": "Restore The Array", "question__title_slug": "restore-the-array", "question__hide": false, - "total_acs": 12429, - "total_submitted": 32693, + "total_acs": 12514, + "total_submitted": 32886, "frontend_question_id": 1416, "is_new_question": false }, @@ -19542,8 +19772,8 @@ "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": 26392, - "total_submitted": 36913, + "total_acs": 26638, + "total_submitted": 37218, "frontend_question_id": 1415, "is_new_question": false }, @@ -19565,8 +19795,8 @@ "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": 31401, - "total_submitted": 48139, + "total_acs": 31723, + "total_submitted": 48603, "frontend_question_id": 1414, "is_new_question": false }, @@ -19588,8 +19818,8 @@ "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": 72124, - "total_submitted": 105081, + "total_acs": 72692, + "total_submitted": 105911, "frontend_question_id": 1413, "is_new_question": false }, @@ -19611,8 +19841,8 @@ "question__title": "Find All Good Strings", "question__title_slug": "find-all-good-strings", "question__hide": false, - "total_acs": 4345, - "total_submitted": 10393, + "total_acs": 4387, + "total_submitted": 10488, "frontend_question_id": 1397, "is_new_question": false }, @@ -19634,8 +19864,8 @@ "question__title": "Design Underground System", "question__title_slug": "design-underground-system", "question__hide": false, - "total_acs": 136459, - "total_submitted": 185508, + "total_acs": 137535, + "total_submitted": 186975, "frontend_question_id": 1396, "is_new_question": false }, @@ -19657,8 +19887,8 @@ "question__title": "Count Number of Teams", "question__title_slug": "count-number-of-teams", "question__hide": false, - "total_acs": 88224, - "total_submitted": 127542, + "total_acs": 88920, + "total_submitted": 128728, "frontend_question_id": 1395, "is_new_question": false }, @@ -19680,8 +19910,8 @@ "question__title": "Find Lucky Integer in an Array", "question__title_slug": "find-lucky-integer-in-an-array", "question__hide": false, - "total_acs": 71616, - "total_submitted": 112583, + "total_acs": 72414, + "total_submitted": 113805, "frontend_question_id": 1394, "is_new_question": false }, @@ -19703,8 +19933,8 @@ "question__title": "Replace Employee ID With The Unique Identifier", "question__title_slug": "replace-employee-id-with-the-unique-identifier", "question__hide": false, - "total_acs": 29638, - "total_submitted": 32495, + "total_acs": 29939, + "total_submitted": 32819, "frontend_question_id": 1378, "is_new_question": false }, @@ -19726,8 +19956,8 @@ "question__title": "Longest Happy Prefix", "question__title_slug": "longest-happy-prefix", "question__hide": false, - "total_acs": 21693, - "total_submitted": 48727, + "total_acs": 21998, + "total_submitted": 49375, "frontend_question_id": 1392, "is_new_question": false }, @@ -19749,8 +19979,8 @@ "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": 21237, - "total_submitted": 45405, + "total_acs": 21344, + "total_submitted": 45617, "frontend_question_id": 1391, "is_new_question": false }, @@ -19772,8 +20002,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": 146891, - "total_submitted": 171576, + "total_acs": 148402, + "total_submitted": 173269, "frontend_question_id": 1389, "is_new_question": false }, @@ -19795,8 +20025,8 @@ "question__title": "Get the Second Most Recent Activity", "question__title_slug": "get-the-second-most-recent-activity", "question__hide": false, - "total_acs": 14168, - "total_submitted": 20453, + "total_acs": 14399, + "total_submitted": 20775, "frontend_question_id": 1369, "is_new_question": false }, @@ -19818,8 +20048,8 @@ "question__title": "Reducing Dishes", "question__title_slug": "reducing-dishes", "question__hide": false, - "total_acs": 38637, - "total_submitted": 53376, + "total_acs": 39221, + "total_submitted": 54190, "frontend_question_id": 1402, "is_new_question": false }, @@ -19841,8 +20071,8 @@ "question__title": "Construct K Palindrome Strings", "question__title_slug": "construct-k-palindrome-strings", "question__hide": false, - "total_acs": 37993, - "total_submitted": 59672, + "total_acs": 38403, + "total_submitted": 60343, "frontend_question_id": 1400, "is_new_question": false }, @@ -19864,8 +20094,8 @@ "question__title": "Circle and Rectangle Overlapping", "question__title_slug": "circle-and-rectangle-overlapping", "question__hide": false, - "total_acs": 10089, - "total_submitted": 23000, + "total_acs": 10164, + "total_submitted": 23157, "frontend_question_id": 1401, "is_new_question": false }, @@ -19887,8 +20117,8 @@ "question__title": "Count Largest Group", "question__title_slug": "count-largest-group", "question__hide": false, - "total_acs": 31558, - "total_submitted": 47150, + "total_acs": 31843, + "total_submitted": 47574, "frontend_question_id": 1399, "is_new_question": false }, @@ -19910,8 +20140,8 @@ "question__title": "Maximum Performance of a Team", "question__title_slug": "maximum-performance-of-a-team", "question__hide": false, - "total_acs": 39329, - "total_submitted": 94666, + "total_acs": 39571, + "total_submitted": 95159, "frontend_question_id": 1383, "is_new_question": false }, @@ -19933,8 +20163,8 @@ "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": 153301, - "total_submitted": 175467, + "total_acs": 155070, + "total_submitted": 177592, "frontend_question_id": 1379, "is_new_question": false }, @@ -19956,8 +20186,8 @@ "question__title": "Design a Stack With Increment Operation", "question__title_slug": "design-a-stack-with-increment-operation", "question__hide": false, - "total_acs": 71534, - "total_submitted": 92696, + "total_acs": 72378, + "total_submitted": 93754, "frontend_question_id": 1381, "is_new_question": false }, @@ -19979,8 +20209,8 @@ "question__title": "Lucky Numbers in a Matrix", "question__title_slug": "lucky-numbers-in-a-matrix", "question__hide": false, - "total_acs": 66253, - "total_submitted": 93440, + "total_acs": 66816, + "total_submitted": 94285, "frontend_question_id": 1380, "is_new_question": false }, @@ -20002,8 +20232,8 @@ "question__title": "Number of Trusted Contacts of a Customer", "question__title_slug": "number-of-trusted-contacts-of-a-customer", "question__hide": false, - "total_acs": 13670, - "total_submitted": 17316, + "total_acs": 13820, + "total_submitted": 17523, "frontend_question_id": 1364, "is_new_question": false }, @@ -20025,8 +20255,8 @@ "question__title": "Activity Participants", "question__title_slug": "activity-participants", "question__hide": false, - "total_acs": 21394, - "total_submitted": 28689, + "total_acs": 21587, + "total_submitted": 28934, "frontend_question_id": 1355, "is_new_question": false }, @@ -20048,8 +20278,8 @@ "question__title": "Frog Position After T Seconds", "question__title_slug": "frog-position-after-t-seconds", "question__hide": false, - "total_acs": 20161, - "total_submitted": 55685, + "total_acs": 20352, + "total_submitted": 56263, "frontend_question_id": 1377, "is_new_question": false }, @@ -20071,8 +20301,8 @@ "question__title": "Time Needed to Inform All Employees", "question__title_slug": "time-needed-to-inform-all-employees", "question__hide": false, - "total_acs": 98308, - "total_submitted": 168841, + "total_acs": 100837, + "total_submitted": 172956, "frontend_question_id": 1376, "is_new_question": false }, @@ -20094,8 +20324,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": 40682, - "total_submitted": 61906, + "total_acs": 40920, + "total_submitted": 62278, "frontend_question_id": 1375, "is_new_question": false }, @@ -20117,8 +20347,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": 67263, - "total_submitted": 86874, + "total_acs": 67645, + "total_submitted": 87365, "frontend_question_id": 1374, "is_new_question": false }, @@ -20140,8 +20370,8 @@ "question__title": "Pizza With 3n Slices", "question__title_slug": "pizza-with-3n-slices", "question__hide": false, - "total_acs": 8433, - "total_submitted": 17228, + "total_acs": 8522, + "total_submitted": 17396, "frontend_question_id": 1388, "is_new_question": false }, @@ -20163,8 +20393,8 @@ "question__title": "Sort Integers by The Power Value", "question__title_slug": "sort-integers-by-the-power-value", "question__hide": false, - "total_acs": 53916, - "total_submitted": 77297, + "total_acs": 54513, + "total_submitted": 78186, "frontend_question_id": 1387, "is_new_question": false }, @@ -20186,8 +20416,8 @@ "question__title": "Cinema Seat Allocation", "question__title_slug": "cinema-seat-allocation", "question__hide": false, - "total_acs": 27367, - "total_submitted": 68348, + "total_acs": 28066, + "total_submitted": 69817, "frontend_question_id": 1386, "is_new_question": false }, @@ -20209,8 +20439,8 @@ "question__title": "Find the Distance Value Between Two Arrays", "question__title_slug": "find-the-distance-value-between-two-arrays", "question__hide": false, - "total_acs": 54332, - "total_submitted": 83125, + "total_acs": 55874, + "total_submitted": 85515, "frontend_question_id": 1385, "is_new_question": false }, @@ -20232,8 +20462,8 @@ "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": 32420, - "total_submitted": 53209, + "total_acs": 32832, + "total_submitted": 53819, "frontend_question_id": 1368, "is_new_question": false }, @@ -20255,8 +20485,8 @@ "question__title": "Linked List in Binary Tree", "question__title_slug": "linked-list-in-binary-tree", "question__hide": false, - "total_acs": 50675, - "total_submitted": 117964, + "total_acs": 51443, + "total_submitted": 119588, "frontend_question_id": 1367, "is_new_question": false }, @@ -20278,8 +20508,8 @@ "question__title": "Rank Teams by Votes", "question__title_slug": "rank-teams-by-votes", "question__hide": false, - "total_acs": 39498, - "total_submitted": 67463, + "total_acs": 40044, + "total_submitted": 68463, "frontend_question_id": 1366, "is_new_question": false }, @@ -20301,8 +20531,8 @@ "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": 319037, - "total_submitted": 369199, + "total_acs": 323046, + "total_submitted": 373749, "frontend_question_id": 1365, "is_new_question": false }, @@ -20324,8 +20554,8 @@ "question__title": "Students With Invalid Departments", "question__title_slug": "students-with-invalid-departments", "question__hide": false, - "total_acs": 40818, - "total_submitted": 45099, + "total_acs": 41133, + "total_submitted": 45447, "frontend_question_id": 1350, "is_new_question": false }, @@ -20347,8 +20577,8 @@ "question__title": "Movie Rating", "question__title_slug": "movie-rating", "question__hide": false, - "total_acs": 20169, - "total_submitted": 34734, + "total_acs": 20482, + "total_submitted": 35279, "frontend_question_id": 1341, "is_new_question": false }, @@ -20370,8 +20600,8 @@ "question__title": "Construct Target Array With Multiple Sums", "question__title_slug": "construct-target-array-with-multiple-sums", "question__hide": false, - "total_acs": 25643, - "total_submitted": 82215, + "total_acs": 59546, + "total_submitted": 164055, "frontend_question_id": 1354, "is_new_question": false }, @@ -20393,8 +20623,8 @@ "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": 56771, - "total_submitted": 169928, + "total_acs": 57312, + "total_submitted": 171793, "frontend_question_id": 1353, "is_new_question": false }, @@ -20416,8 +20646,8 @@ "question__title": "Product of the Last K Numbers", "question__title_slug": "product-of-the-last-k-numbers", "question__hide": false, - "total_acs": 50810, - "total_submitted": 105024, + "total_acs": 51525, + "total_submitted": 106281, "frontend_question_id": 1352, "is_new_question": false }, @@ -20439,8 +20669,8 @@ "question__title": "Count Negative Numbers in a Sorted Matrix", "question__title_slug": "count-negative-numbers-in-a-sorted-matrix", "question__hide": false, - "total_acs": 183291, - "total_submitted": 243875, + "total_acs": 186297, + "total_submitted": 247824, "frontend_question_id": 1351, "is_new_question": false }, @@ -20462,8 +20692,8 @@ "question__title": "Maximum Sum BST in Binary Tree", "question__title_slug": "maximum-sum-bst-in-binary-tree", "question__hide": false, - "total_acs": 34859, - "total_submitted": 89882, + "total_acs": 35916, + "total_submitted": 92331, "frontend_question_id": 1373, "is_new_question": false }, @@ -20485,8 +20715,8 @@ "question__title": "Longest ZigZag Path in a Binary Tree", "question__title_slug": "longest-zigzag-path-in-a-binary-tree", "question__hide": false, - "total_acs": 36684, - "total_submitted": 62349, + "total_acs": 37251, + "total_submitted": 63173, "frontend_question_id": 1372, "is_new_question": false }, @@ -20508,8 +20738,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": 18974, - "total_submitted": 30281, + "total_acs": 19117, + "total_submitted": 30480, "frontend_question_id": 1371, "is_new_question": false }, @@ -20531,8 +20761,8 @@ "question__title": "Increasing Decreasing String", "question__title_slug": "increasing-decreasing-string", "question__hide": false, - "total_acs": 55743, - "total_submitted": 71713, + "total_acs": 56133, + "total_submitted": 72196, "frontend_question_id": 1370, "is_new_question": false }, @@ -20554,8 +20784,8 @@ "question__title": "Maximum Students Taking Exam", "question__title_slug": "maximum-students-taking-exam", "question__hide": false, - "total_acs": 10414, - "total_submitted": 22099, + "total_acs": 10514, + "total_submitted": 22270, "frontend_question_id": 1349, "is_new_question": false }, @@ -20577,8 +20807,8 @@ "question__title": "Tweet Counts Per Frequency", "question__title_slug": "tweet-counts-per-frequency", "question__hide": false, - "total_acs": 27632, - "total_submitted": 64004, + "total_acs": 27728, + "total_submitted": 64182, "frontend_question_id": 1348, "is_new_question": false }, @@ -20600,8 +20830,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": 94043, - "total_submitted": 122946, + "total_acs": 95297, + "total_submitted": 124482, "frontend_question_id": 1347, "is_new_question": false }, @@ -20623,8 +20853,8 @@ "question__title": "Check If N and Its Double Exist", "question__title_slug": "check-if-n-and-its-double-exist", "question__hide": false, - "total_acs": 206958, - "total_submitted": 578270, + "total_acs": 210524, + "total_submitted": 587836, "frontend_question_id": 1346, "is_new_question": false }, @@ -20646,8 +20876,8 @@ "question__title": "Number of Transactions per Visit", "question__title_slug": "number-of-transactions-per-visit", "question__hide": false, - "total_acs": 9111, - "total_submitted": 17735, + "total_acs": 9188, + "total_submitted": 17890, "frontend_question_id": 1336, "is_new_question": false }, @@ -20669,8 +20899,8 @@ "question__title": "Jump Game V", "question__title_slug": "jump-game-v", "question__hide": false, - "total_acs": 19482, - "total_submitted": 31280, + "total_acs": 19684, + "total_submitted": 31591, "frontend_question_id": 1340, "is_new_question": false }, @@ -20692,8 +20922,8 @@ "question__title": "Maximum Product of Splitted Binary Tree", "question__title_slug": "maximum-product-of-splitted-binary-tree", "question__hide": false, - "total_acs": 58197, - "total_submitted": 135243, + "total_acs": 58673, + "total_submitted": 136345, "frontend_question_id": 1339, "is_new_question": false }, @@ -20715,8 +20945,8 @@ "question__title": "Reduce Array Size to The Half", "question__title_slug": "reduce-array-size-to-the-half", "question__hide": false, - "total_acs": 86494, - "total_submitted": 126577, + "total_acs": 87469, + "total_submitted": 128037, "frontend_question_id": 1338, "is_new_question": false }, @@ -20738,8 +20968,8 @@ "question__title": "The K Weakest Rows in a Matrix", "question__title_slug": "the-k-weakest-rows-in-a-matrix", "question__hide": false, - "total_acs": 173054, - "total_submitted": 233879, + "total_acs": 176917, + "total_submitted": 239430, "frontend_question_id": 1337, "is_new_question": false }, @@ -20761,8 +20991,8 @@ "question__title": "List the Products Ordered in a Period", "question__title_slug": "list-the-products-ordered-in-a-period", "question__hide": false, - "total_acs": 29233, - "total_submitted": 37940, + "total_acs": 29544, + "total_submitted": 38339, "frontend_question_id": 1327, "is_new_question": false }, @@ -20784,8 +21014,8 @@ "question__title": "Count All Valid Pickup and Delivery Options", "question__title_slug": "count-all-valid-pickup-and-delivery-options", "question__hide": false, - "total_acs": 52520, - "total_submitted": 82976, + "total_acs": 52795, + "total_submitted": 83527, "frontend_question_id": 1359, "is_new_question": false }, @@ -20807,8 +21037,8 @@ "question__title": "Number of Substrings Containing All Three Characters", "question__title_slug": "number-of-substrings-containing-all-three-characters", "question__hide": false, - "total_acs": 38465, - "total_submitted": 61854, + "total_acs": 39090, + "total_submitted": 62785, "frontend_question_id": 1358, "is_new_question": false }, @@ -20830,8 +21060,8 @@ "question__title": "Apply Discount Every n Orders", "question__title_slug": "apply-discount-every-n-orders", "question__hide": false, - "total_acs": 14935, - "total_submitted": 21587, + "total_acs": 15076, + "total_submitted": 21757, "frontend_question_id": 1357, "is_new_question": false }, @@ -20853,8 +21083,8 @@ "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": 71120, - "total_submitted": 99493, + "total_acs": 72507, + "total_submitted": 101310, "frontend_question_id": 1356, "is_new_question": false }, @@ -20876,8 +21106,8 @@ "question__title": "Minimum Difficulty of a Job Schedule", "question__title_slug": "minimum-difficulty-of-a-job-schedule", "question__hide": false, - "total_acs": 72067, - "total_submitted": 128145, + "total_acs": 72997, + "total_submitted": 130018, "frontend_question_id": 1335, "is_new_question": false }, @@ -20899,8 +21129,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": 41194, - "total_submitted": 79712, + "total_acs": 42062, + "total_submitted": 81165, "frontend_question_id": 1334, "is_new_question": false }, @@ -20922,8 +21152,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": 22864, - "total_submitted": 38759, + "total_acs": 23022, + "total_submitted": 39013, "frontend_question_id": 1333, "is_new_question": false }, @@ -20945,8 +21175,8 @@ "question__title": "Remove Palindromic Subsequences", "question__title_slug": "remove-palindromic-subsequences", "question__hide": false, - "total_acs": 106186, - "total_submitted": 139886, + "total_acs": 107069, + "total_submitted": 141049, "frontend_question_id": 1332, "is_new_question": false }, @@ -20968,8 +21198,8 @@ "question__title": "Ads Performance", "question__title_slug": "ads-performance", "question__hide": false, - "total_acs": 29655, - "total_submitted": 49085, + "total_acs": 29952, + "total_submitted": 49568, "frontend_question_id": 1322, "is_new_question": false }, @@ -20991,8 +21221,8 @@ "question__title": "Restaurant Growth", "question__title_slug": "restaurant-growth", "question__hide": false, - "total_acs": 22473, - "total_submitted": 31061, + "total_acs": 22884, + "total_submitted": 31618, "frontend_question_id": 1321, "is_new_question": false }, @@ -21014,8 +21244,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": 57383, - "total_submitted": 119667, + "total_acs": 57937, + "total_submitted": 120914, "frontend_question_id": 1326, "is_new_question": false }, @@ -21037,8 +21267,8 @@ "question__title": "Delete Leaves With a Given Value", "question__title_slug": "delete-leaves-with-a-given-value", "question__hide": false, - "total_acs": 70003, - "total_submitted": 93612, + "total_acs": 70876, + "total_submitted": 94757, "frontend_question_id": 1325, "is_new_question": false }, @@ -21060,8 +21290,8 @@ "question__title": "Print Words Vertically", "question__title_slug": "print-words-vertically", "question__hide": false, - "total_acs": 27038, - "total_submitted": 45283, + "total_acs": 27196, + "total_submitted": 45525, "frontend_question_id": 1324, "is_new_question": false }, @@ -21083,8 +21313,8 @@ "question__title": "Maximum 69 Number", "question__title_slug": "maximum-69-number", "question__hide": false, - "total_acs": 113109, - "total_submitted": 143278, + "total_acs": 114148, + "total_submitted": 144532, "frontend_question_id": 1323, "is_new_question": false }, @@ -21106,8 +21336,8 @@ "question__title": "Jump Game IV", "question__title_slug": "jump-game-iv", "question__hide": false, - "total_acs": 74036, - "total_submitted": 167163, + "total_acs": 74626, + "total_submitted": 168598, "frontend_question_id": 1345, "is_new_question": false }, @@ -21129,8 +21359,8 @@ "question__title": "Angle Between Hands of a Clock", "question__title_slug": "angle-between-hands-of-a-clock", "question__hide": false, - "total_acs": 93342, - "total_submitted": 147283, + "total_acs": 94146, + "total_submitted": 148517, "frontend_question_id": 1344, "is_new_question": false }, @@ -21152,8 +21382,8 @@ "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": 35631, - "total_submitted": 52455, + "total_acs": 36250, + "total_submitted": 53388, "frontend_question_id": 1343, "is_new_question": false }, @@ -21175,8 +21405,8 @@ "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": 324403, - "total_submitted": 377191, + "total_acs": 328843, + "total_submitted": 382550, "frontend_question_id": 1342, "is_new_question": false }, @@ -21198,8 +21428,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": 24702, - "total_submitted": 41077, + "total_acs": 24898, + "total_submitted": 41388, "frontend_question_id": 1320, "is_new_question": false }, @@ -21221,8 +21451,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": 82445, - "total_submitted": 142252, + "total_acs": 84777, + "total_submitted": 146141, "frontend_question_id": 1319, "is_new_question": false }, @@ -21244,8 +21474,8 @@ "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": 24969, - "total_submitted": 38086, + "total_acs": 25214, + "total_submitted": 38414, "frontend_question_id": 1318, "is_new_question": false }, @@ -21267,8 +21497,8 @@ "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": 30965, - "total_submitted": 54620, + "total_acs": 31211, + "total_submitted": 55091, "frontend_question_id": 1317, "is_new_question": false }, @@ -21290,8 +21520,8 @@ "question__title": "Running Total for Different Genders", "question__title_slug": "running-total-for-different-genders", "question__hide": false, - "total_acs": 25877, - "total_submitted": 29343, + "total_acs": 26356, + "total_submitted": 29892, "frontend_question_id": 1308, "is_new_question": false }, @@ -21313,8 +21543,8 @@ "question__title": "Find the Team Size", "question__title_slug": "find-the-team-size", "question__hide": false, - "total_acs": 43927, - "total_submitted": 48348, + "total_acs": 44762, + "total_submitted": 49259, "frontend_question_id": 1303, "is_new_question": false }, @@ -21336,8 +21566,8 @@ "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": 50607, - "total_submitted": 78767, + "total_acs": 52078, + "total_submitted": 80828, "frontend_question_id": 1312, "is_new_question": false }, @@ -21359,8 +21589,8 @@ "question__title": "Get Watched Videos by Your Friends", "question__title_slug": "get-watched-videos-by-your-friends", "question__hide": false, - "total_acs": 15341, - "total_submitted": 33849, + "total_acs": 15452, + "total_submitted": 34039, "frontend_question_id": 1311, "is_new_question": false }, @@ -21382,8 +21612,8 @@ "question__title": "XOR Queries of a Subarray", "question__title_slug": "xor-queries-of-a-subarray", "question__hide": false, - "total_acs": 37606, - "total_submitted": 52618, + "total_acs": 38053, + "total_submitted": 53181, "frontend_question_id": 1310, "is_new_question": false }, @@ -21405,8 +21635,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": 82124, - "total_submitted": 104068, + "total_acs": 83300, + "total_submitted": 105467, "frontend_question_id": 1309, "is_new_question": false }, @@ -21428,8 +21658,8 @@ "question__title": "Encrypt and Decrypt Strings", "question__title_slug": "encrypt-and-decrypt-strings", "question__hide": false, - "total_acs": 7603, - "total_submitted": 20126, + "total_acs": 7950, + "total_submitted": 20768, "frontend_question_id": 2227, "is_new_question": false }, @@ -21451,8 +21681,8 @@ "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": 40124, - "total_submitted": 87545, + "total_acs": 40305, + "total_submitted": 87853, "frontend_question_id": 1430, "is_new_question": false }, @@ -21474,8 +21704,8 @@ "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": 11892, - "total_submitted": 24781, + "total_acs": 12391, + "total_submitted": 25645, "frontend_question_id": 2192, "is_new_question": false }, @@ -21497,8 +21727,8 @@ "question__title": "Find the K-Beauty of a Number", "question__title_slug": "find-the-k-beauty-of-a-number", "question__hide": false, - "total_acs": 17543, - "total_submitted": 30532, + "total_acs": 18552, + "total_submitted": 32338, "frontend_question_id": 2269, "is_new_question": false }, @@ -21520,8 +21750,8 @@ "question__title": "Verbal Arithmetic Puzzle", "question__title_slug": "verbal-arithmetic-puzzle", "question__hide": false, - "total_acs": 6944, - "total_submitted": 20098, + "total_acs": 6988, + "total_submitted": 20253, "frontend_question_id": 1307, "is_new_question": false }, @@ -21543,8 +21773,8 @@ "question__title": "Jump Game III", "question__title_slug": "jump-game-iii", "question__hide": false, - "total_acs": 150022, - "total_submitted": 238660, + "total_acs": 151916, + "total_submitted": 241505, "frontend_question_id": 1306, "is_new_question": false }, @@ -21566,8 +21796,8 @@ "question__title": "All Elements in Two Binary Search Trees", "question__title_slug": "all-elements-in-two-binary-search-trees", "question__hide": false, - "total_acs": 165655, - "total_submitted": 208001, + "total_acs": 166817, + "total_submitted": 209432, "frontend_question_id": 1305, "is_new_question": false }, @@ -21589,8 +21819,8 @@ "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": 145148, - "total_submitted": 188466, + "total_acs": 146959, + "total_submitted": 190696, "frontend_question_id": 1304, "is_new_question": false }, @@ -21612,8 +21842,8 @@ "question__title": "Weather Type in Each Country", "question__title_slug": "weather-type-in-each-country", "question__hide": false, - "total_acs": 25283, - "total_submitted": 37417, + "total_acs": 25739, + "total_submitted": 38059, "frontend_question_id": 1294, "is_new_question": false }, @@ -21635,8 +21865,8 @@ "question__title": "Maximum Candies You Can Get from Boxes", "question__title_slug": "maximum-candies-you-can-get-from-boxes", "question__hide": false, - "total_acs": 10454, - "total_submitted": 17139, + "total_acs": 10553, + "total_submitted": 17304, "frontend_question_id": 1298, "is_new_question": false }, @@ -21658,8 +21888,8 @@ "question__title": "Maximum Number of Occurrences of a Substring", "question__title_slug": "maximum-number-of-occurrences-of-a-substring", "question__hide": false, - "total_acs": 34267, - "total_submitted": 65519, + "total_acs": 34576, + "total_submitted": 66172, "frontend_question_id": 1297, "is_new_question": false }, @@ -21681,8 +21911,8 @@ "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": 61225, - "total_submitted": 108420, + "total_acs": 61687, + "total_submitted": 109208, "frontend_question_id": 1296, "is_new_question": false }, @@ -21704,8 +21934,8 @@ "question__title": "Find Numbers with Even Number of Digits", "question__title_slug": "find-numbers-with-even-number-of-digits", "question__hide": false, - "total_acs": 446594, - "total_submitted": 579980, + "total_acs": 451436, + "total_submitted": 586355, "frontend_question_id": 1295, "is_new_question": false }, @@ -21727,8 +21957,8 @@ "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": 23077, - "total_submitted": 26162, + "total_acs": 23491, + "total_submitted": 26634, "frontend_question_id": 1285, "is_new_question": false }, @@ -21750,8 +21980,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": 430, - "total_submitted": 674, + "total_acs": 511, + "total_submitted": 786, "frontend_question_id": 2263, "is_new_question": false }, @@ -21773,8 +22003,8 @@ "question__title": "Fair Distribution of Cookies", "question__title_slug": "fair-distribution-of-cookies", "question__hide": false, - "total_acs": 10915, - "total_submitted": 17413, + "total_acs": 12900, + "total_submitted": 20168, "frontend_question_id": 2305, "is_new_question": false }, @@ -21796,8 +22026,8 @@ "question__title": "Check if an Array Is Consecutive", "question__title_slug": "check-if-an-array-is-consecutive", "question__hide": false, - "total_acs": 1795, - "total_submitted": 2892, + "total_acs": 1899, + "total_submitted": 3061, "frontend_question_id": 2229, "is_new_question": false }, @@ -21819,8 +22049,8 @@ "question__title": "Students and Examinations", "question__title_slug": "students-and-examinations", "question__hide": false, - "total_acs": 25579, - "total_submitted": 34459, + "total_acs": 26078, + "total_submitted": 35053, "frontend_question_id": 1280, "is_new_question": false }, @@ -21842,8 +22072,8 @@ "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": 106829, - "total_submitted": 245162, + "total_acs": 109839, + "total_submitted": 252004, "frontend_question_id": 1293, "is_new_question": false }, @@ -21865,8 +22095,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": 25289, - "total_submitted": 47906, + "total_acs": 25554, + "total_submitted": 48386, "frontend_question_id": 1292, "is_new_question": false }, @@ -21888,8 +22118,8 @@ "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": 298237, - "total_submitted": 360854, + "total_acs": 301865, + "total_submitted": 365342, "frontend_question_id": 1290, "is_new_question": false }, @@ -21911,8 +22141,8 @@ "question__title": "Traffic Light Controlled Intersection", "question__title_slug": "traffic-light-controlled-intersection", "question__hide": false, - "total_acs": 8977, - "total_submitted": 11971, + "total_acs": 9041, + "total_submitted": 12069, "frontend_question_id": 1279, "is_new_question": false }, @@ -21934,8 +22164,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": 24224, - "total_submitted": 33600, + "total_acs": 24666, + "total_submitted": 34232, "frontend_question_id": 1284, "is_new_question": false }, @@ -21957,8 +22187,8 @@ "question__title": "Find the Smallest Divisor Given a Threshold", "question__title_slug": "find-the-smallest-divisor-given-a-threshold", "question__hide": false, - "total_acs": 86123, - "total_submitted": 158562, + "total_acs": 86971, + "total_submitted": 159808, "frontend_question_id": 1283, "is_new_question": false }, @@ -21980,8 +22210,8 @@ "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": 81578, - "total_submitted": 95595, + "total_acs": 82277, + "total_submitted": 96387, "frontend_question_id": 1282, "is_new_question": false }, @@ -22003,8 +22233,8 @@ "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": 246301, - "total_submitted": 284822, + "total_acs": 251153, + "total_submitted": 290231, "frontend_question_id": 1281, "is_new_question": false }, @@ -22026,8 +22256,8 @@ "question__title": "All People Report to the Given Manager", "question__title_slug": "all-people-report-to-the-given-manager", "question__hide": false, - "total_acs": 39502, - "total_submitted": 44888, + "total_acs": 39963, + "total_submitted": 45425, "frontend_question_id": 1270, "is_new_question": false }, @@ -22049,8 +22279,8 @@ "question__title": "Print Immutable Linked List in Reverse", "question__title_slug": "print-immutable-linked-list-in-reverse", "question__hide": false, - "total_acs": 41970, - "total_submitted": 44509, + "total_acs": 42392, + "total_submitted": 44953, "frontend_question_id": 1265, "is_new_question": false }, @@ -22072,8 +22302,8 @@ "question__title": "Palindrome Partitioning III", "question__title_slug": "palindrome-partitioning-iii", "question__hide": false, - "total_acs": 19132, - "total_submitted": 31431, + "total_acs": 19333, + "total_submitted": 31773, "frontend_question_id": 1278, "is_new_question": false }, @@ -22095,8 +22325,8 @@ "question__title": "Count Square Submatrices with All Ones", "question__title_slug": "count-square-submatrices-with-all-ones", "question__hide": false, - "total_acs": 167518, - "total_submitted": 225565, + "total_acs": 169086, + "total_submitted": 227636, "frontend_question_id": 1277, "is_new_question": false }, @@ -22118,8 +22348,8 @@ "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": 18477, - "total_submitted": 36525, + "total_acs": 18632, + "total_submitted": 36828, "frontend_question_id": 1276, "is_new_question": false }, @@ -22141,8 +22371,8 @@ "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": 81527, - "total_submitted": 149418, + "total_acs": 82805, + "total_submitted": 151930, "frontend_question_id": 1275, "is_new_question": false }, @@ -22164,8 +22394,8 @@ "question__title": "Page Recommendations", "question__title_slug": "page-recommendations", "question__hide": false, - "total_acs": 24673, - "total_submitted": 36477, + "total_acs": 25122, + "total_submitted": 37069, "frontend_question_id": 1264, "is_new_question": false }, @@ -22187,8 +22417,8 @@ "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": 28230, - "total_submitted": 64963, + "total_acs": 28409, + "total_submitted": 65338, "frontend_question_id": 1269, "is_new_question": false }, @@ -22210,8 +22440,8 @@ "question__title": "Search Suggestions System", "question__title_slug": "search-suggestions-system", "question__hide": false, - "total_acs": 163193, - "total_submitted": 249882, + "total_acs": 207898, + "total_submitted": 310106, "frontend_question_id": 1268, "is_new_question": false }, @@ -22233,8 +22463,8 @@ "question__title": "Count Servers that Communicate", "question__title_slug": "count-servers-that-communicate", "question__hide": false, - "total_acs": 43733, - "total_submitted": 74529, + "total_acs": 44242, + "total_submitted": 75315, "frontend_question_id": 1267, "is_new_question": false }, @@ -22256,8 +22486,8 @@ "question__title": "Minimum Time Visiting All Points", "question__title_slug": "minimum-time-visiting-all-points", "question__hide": false, - "total_acs": 118526, - "total_submitted": 149730, + "total_acs": 119261, + "total_submitted": 150689, "frontend_question_id": 1266, "is_new_question": false }, @@ -22279,8 +22509,8 @@ "question__title": "Minimum Path Cost in a Grid", "question__title_slug": "minimum-path-cost-in-a-grid", "question__hide": false, - "total_acs": 11312, - "total_submitted": 18051, + "total_acs": 12902, + "total_submitted": 20273, "frontend_question_id": 2304, "is_new_question": false }, @@ -22302,8 +22532,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": 9434, - "total_submitted": 19218, + "total_acs": 9763, + "total_submitted": 19870, "frontend_question_id": 2218, "is_new_question": false }, @@ -22325,8 +22555,8 @@ "question__title": "Find the Difference of Two Arrays", "question__title_slug": "find-the-difference-of-two-arrays", "question__hide": false, - "total_acs": 28315, - "total_submitted": 40845, + "total_acs": 29390, + "total_submitted": 42395, "frontend_question_id": 2215, "is_new_question": false }, @@ -22348,8 +22578,8 @@ "question__title": "Counting Elements", "question__title_slug": "counting-elements", "question__hide": false, - "total_acs": 90036, - "total_submitted": 151325, + "total_acs": 90120, + "total_submitted": 151458, "frontend_question_id": 1426, "is_new_question": false }, @@ -22371,8 +22601,8 @@ "question__title": "Average Selling Price", "question__title_slug": "average-selling-price", "question__hide": false, - "total_acs": 37288, - "total_submitted": 44780, + "total_acs": 38020, + "total_submitted": 45614, "frontend_question_id": 1251, "is_new_question": false }, @@ -22394,8 +22624,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": 21518, - "total_submitted": 44369, + "total_acs": 21918, + "total_submitted": 44959, "frontend_question_id": 1263, "is_new_question": false }, @@ -22417,8 +22647,8 @@ "question__title": "Greatest Sum Divisible by Three", "question__title_slug": "greatest-sum-divisible-by-three", "question__hide": false, - "total_acs": 39189, - "total_submitted": 76958, + "total_acs": 39481, + "total_submitted": 77561, "frontend_question_id": 1262, "is_new_question": false }, @@ -22440,8 +22670,8 @@ "question__title": "Find Elements in a Contaminated Binary Tree", "question__title_slug": "find-elements-in-a-contaminated-binary-tree", "question__hide": false, - "total_acs": 45476, - "total_submitted": 60073, + "total_acs": 45927, + "total_submitted": 60719, "frontend_question_id": 1261, "is_new_question": false }, @@ -22463,8 +22693,8 @@ "question__title": "Shift 2D Grid", "question__title_slug": "shift-2d-grid", "question__hide": false, - "total_acs": 85379, - "total_submitted": 125411, + "total_acs": 85789, + "total_submitted": 126003, "frontend_question_id": 1260, "is_new_question": false }, @@ -22486,8 +22716,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": 889, - "total_submitted": 1369, + "total_acs": 921, + "total_submitted": 1426, "frontend_question_id": 2189, "is_new_question": false }, @@ -22509,8 +22739,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": 5220, - "total_submitted": 8935, + "total_acs": 5278, + "total_submitted": 9012, "frontend_question_id": 1618, "is_new_question": false }, @@ -22532,8 +22762,8 @@ "question__title": "Number of Single Divisor Triplets", "question__title_slug": "number-of-single-divisor-triplets", "question__hide": false, - "total_acs": 534, - "total_submitted": 958, + "total_acs": 542, + "total_submitted": 972, "frontend_question_id": 2198, "is_new_question": false }, @@ -22555,8 +22785,8 @@ "question__title": "Calculate Amount Paid in Taxes", "question__title_slug": "calculate-amount-paid-in-taxes", "question__hide": false, - "total_acs": 18050, - "total_submitted": 29314, + "total_acs": 19911, + "total_submitted": 32100, "frontend_question_id": 2303, "is_new_question": false }, @@ -22578,8 +22808,8 @@ "question__title": "Maximum Score Words Formed by Letters", "question__title_slug": "maximum-score-words-formed-by-letters", "question__hide": false, - "total_acs": 22224, - "total_submitted": 30757, + "total_acs": 22518, + "total_submitted": 31133, "frontend_question_id": 1255, "is_new_question": false }, @@ -22601,8 +22831,8 @@ "question__title": "Number of Closed Islands", "question__title_slug": "number-of-closed-islands", "question__hide": false, - "total_acs": 94541, - "total_submitted": 148721, + "total_acs": 96731, + "total_submitted": 151977, "frontend_question_id": 1254, "is_new_question": false }, @@ -22624,8 +22854,8 @@ "question__title": "Reconstruct a 2-Row Binary Matrix", "question__title_slug": "reconstruct-a-2-row-binary-matrix", "question__hide": false, - "total_acs": 19760, - "total_submitted": 45427, + "total_acs": 19881, + "total_submitted": 45670, "frontend_question_id": 1253, "is_new_question": false }, @@ -22647,8 +22877,8 @@ "question__title": "Cells with Odd Values in a Matrix", "question__title_slug": "cells-with-odd-values-in-a-matrix", "question__hide": false, - "total_acs": 81076, - "total_submitted": 103309, + "total_acs": 81664, + "total_submitted": 104051, "frontend_question_id": 1252, "is_new_question": false }, @@ -22670,8 +22900,8 @@ "question__title": "Number of Comments per Post", "question__title_slug": "number-of-comments-per-post", "question__hide": false, - "total_acs": 26554, - "total_submitted": 39130, + "total_acs": 26779, + "total_submitted": 39458, "frontend_question_id": 1241, "is_new_question": false }, @@ -22684,6 +22914,29 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 1376, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Selling Pieces of Wood", + "question__title_slug": "selling-pieces-of-wood", + "question__hide": false, + "total_acs": 4889, + "total_submitted": 10607, + "frontend_question_id": 2312, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 1375, @@ -22693,8 +22946,8 @@ "question__title": "Find Palindrome With Fixed Length", "question__title_slug": "find-palindrome-with-fixed-length", "question__hide": false, - "total_acs": 11148, - "total_submitted": 32460, + "total_acs": 11380, + "total_submitted": 33053, "frontend_question_id": 2217, "is_new_question": false }, @@ -22716,8 +22969,8 @@ "question__title": "Leftmost Column with at Least a One", "question__title_slug": "leftmost-column-with-at-least-a-one", "question__hide": false, - "total_acs": 150285, - "total_submitted": 285376, + "total_acs": 151065, + "total_submitted": 286599, "frontend_question_id": 1428, "is_new_question": false }, @@ -22739,8 +22992,8 @@ "question__title": "Check If It Is a Good Array", "question__title_slug": "check-if-it-is-a-good-array", "question__hide": false, - "total_acs": 13784, - "total_submitted": 23689, + "total_acs": 13916, + "total_submitted": 23899, "frontend_question_id": 1250, "is_new_question": false }, @@ -22762,8 +23015,8 @@ "question__title": "Minimum Remove to Make Valid Parentheses", "question__title_slug": "minimum-remove-to-make-valid-parentheses", "question__hide": false, - "total_acs": 437176, - "total_submitted": 665682, + "total_acs": 440806, + "total_submitted": 671410, "frontend_question_id": 1249, "is_new_question": false }, @@ -22785,8 +23038,8 @@ "question__title": "Count Number of Nice Subarrays", "question__title_slug": "count-number-of-nice-subarrays", "question__hide": false, - "total_acs": 56649, - "total_submitted": 96297, + "total_acs": 57402, + "total_submitted": 97489, "frontend_question_id": 1248, "is_new_question": false }, @@ -22808,8 +23061,8 @@ "question__title": "Minimum Swaps to Make Strings Equal", "question__title_slug": "minimum-swaps-to-make-strings-equal", "question__hide": false, - "total_acs": 28526, - "total_submitted": 44779, + "total_acs": 28727, + "total_submitted": 45112, "frontend_question_id": 1247, "is_new_question": false }, @@ -22831,8 +23084,8 @@ "question__title": "Web Crawler Multithreaded", "question__title_slug": "web-crawler-multithreaded", "question__hide": false, - "total_acs": 34671, - "total_submitted": 71053, + "total_acs": 35011, + "total_submitted": 71685, "frontend_question_id": 1242, "is_new_question": false }, @@ -22854,8 +23107,8 @@ "question__title": "Maximum Height by Stacking Cuboids ", "question__title_slug": "maximum-height-by-stacking-cuboids", "question__hide": false, - "total_acs": 11689, - "total_submitted": 21632, + "total_acs": 11899, + "total_submitted": 21992, "frontend_question_id": 1691, "is_new_question": false }, @@ -22877,8 +23130,8 @@ "question__title": "First Unique Number", "question__title_slug": "first-unique-number", "question__hide": false, - "total_acs": 72588, - "total_submitted": 138434, + "total_acs": 72844, + "total_submitted": 138842, "frontend_question_id": 1429, "is_new_question": false }, @@ -22900,8 +23153,8 @@ "question__title": "Tuple with Same Product", "question__title_slug": "tuple-with-same-product", "question__hide": false, - "total_acs": 19165, - "total_submitted": 31672, + "total_acs": 19319, + "total_submitted": 31923, "frontend_question_id": 1726, "is_new_question": false }, @@ -22914,6 +23167,29 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 1363, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "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": 23137, + "total_submitted": 33068, + "frontend_question_id": 2309, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 1 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 1362, @@ -22923,8 +23199,8 @@ "question__title": "Airplane Seat Assignment Probability", "question__title_slug": "airplane-seat-assignment-probability", "question__hide": false, - "total_acs": 26101, - "total_submitted": 40582, + "total_acs": 26373, + "total_submitted": 40937, "frontend_question_id": 1227, "is_new_question": false }, @@ -22946,8 +23222,8 @@ "question__title": "Tiling a Rectangle with the Fewest Squares", "question__title_slug": "tiling-a-rectangle-with-the-fewest-squares", "question__hide": false, - "total_acs": 18031, - "total_submitted": 33558, + "total_acs": 18439, + "total_submitted": 34326, "frontend_question_id": 1240, "is_new_question": false }, @@ -22969,8 +23245,8 @@ "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": 108821, - "total_submitted": 215438, + "total_acs": 109428, + "total_submitted": 216742, "frontend_question_id": 1239, "is_new_question": false }, @@ -22992,8 +23268,8 @@ "question__title": "Circular Permutation in Binary Representation", "question__title_slug": "circular-permutation-in-binary-representation", "question__hide": false, - "total_acs": 12523, - "total_submitted": 18318, + "total_acs": 12641, + "total_submitted": 18472, "frontend_question_id": 1238, "is_new_question": false }, @@ -23015,8 +23291,8 @@ "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": 50136, - "total_submitted": 72409, + "total_acs": 50458, + "total_submitted": 72872, "frontend_question_id": 1237, "is_new_question": false }, @@ -23038,8 +23314,8 @@ "question__title": "Report Contiguous Dates", "question__title_slug": "report-contiguous-dates", "question__hide": false, - "total_acs": 14428, - "total_submitted": 22738, + "total_acs": 14653, + "total_submitted": 23076, "frontend_question_id": 1225, "is_new_question": false }, @@ -23061,8 +23337,8 @@ "question__title": "Minimum Number of Moves to Make Palindrome", "question__title_slug": "minimum-number-of-moves-to-make-palindrome", "question__hide": false, - "total_acs": 5915, - "total_submitted": 13630, + "total_acs": 6344, + "total_submitted": 14455, "frontend_question_id": 2193, "is_new_question": false }, @@ -23084,8 +23360,8 @@ "question__title": "Minimum Deletions to Make Array Beautiful", "question__title_slug": "minimum-deletions-to-make-array-beautiful", "question__hide": false, - "total_acs": 18114, - "total_submitted": 40400, + "total_acs": 19431, + "total_submitted": 42853, "frontend_question_id": 2216, "is_new_question": false }, @@ -23107,8 +23383,8 @@ "question__title": "Find Players With Zero or One Losses", "question__title_slug": "find-players-with-zero-or-one-losses", "question__hide": false, - "total_acs": 20215, - "total_submitted": 29625, + "total_acs": 20735, + "total_submitted": 30330, "frontend_question_id": 2225, "is_new_question": false }, @@ -23130,8 +23406,8 @@ "question__title": "Find Resultant Array After Removing Anagrams", "question__title_slug": "find-resultant-array-after-removing-anagrams", "question__hide": false, - "total_acs": 21341, - "total_submitted": 37741, + "total_acs": 22318, + "total_submitted": 39270, "frontend_question_id": 2273, "is_new_question": false }, @@ -23153,8 +23429,8 @@ "question__title": "Maximum Profit in Job Scheduling", "question__title_slug": "maximum-profit-in-job-scheduling", "question__hide": false, - "total_acs": 118374, - "total_submitted": 232425, + "total_acs": 120190, + "total_submitted": 235943, "frontend_question_id": 1235, "is_new_question": false }, @@ -23176,8 +23452,8 @@ "question__title": "Replace the Substring for Balanced String", "question__title_slug": "replace-the-substring-for-balanced-string", "question__hide": false, - "total_acs": 23428, - "total_submitted": 64322, + "total_acs": 23687, + "total_submitted": 64819, "frontend_question_id": 1234, "is_new_question": false }, @@ -23199,8 +23475,8 @@ "question__title": "Remove Sub-Folders from the Filesystem", "question__title_slug": "remove-sub-folders-from-the-filesystem", "question__hide": false, - "total_acs": 43325, - "total_submitted": 66438, + "total_acs": 43567, + "total_submitted": 66789, "frontend_question_id": 1233, "is_new_question": false }, @@ -23222,8 +23498,8 @@ "question__title": "Check If It Is a Straight Line", "question__title_slug": "check-if-it-is-a-straight-line", "question__hide": false, - "total_acs": 119329, - "total_submitted": 286328, + "total_acs": 120679, + "total_submitted": 290085, "frontend_question_id": 1232, "is_new_question": false }, @@ -23236,6 +23512,29 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 1348, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Maximum Score Of Spliced Array", + "question__title_slug": "maximum-score-of-spliced-array", + "question__hide": false, + "total_acs": 9643, + "total_submitted": 18440, + "frontend_question_id": 2321, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 3 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 1347, @@ -23245,8 +23544,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": 884, - "total_submitted": 1223, + "total_acs": 935, + "total_submitted": 1301, "frontend_question_id": 2204, "is_new_question": false }, @@ -23268,8 +23567,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": 16250, - "total_submitted": 73089, + "total_acs": 16572, + "total_submitted": 74197, "frontend_question_id": 2202, "is_new_question": false }, @@ -23291,8 +23590,8 @@ "question__title": "Perform String Shifts", "question__title_slug": "perform-string-shifts", "question__hide": false, - "total_acs": 70606, - "total_submitted": 130561, + "total_acs": 70753, + "total_submitted": 130810, "frontend_question_id": 1427, "is_new_question": false }, @@ -23314,8 +23613,8 @@ "question__title": "Maximum Equal Frequency", "question__title_slug": "maximum-equal-frequency", "question__hide": false, - "total_acs": 10982, - "total_submitted": 29998, + "total_acs": 11067, + "total_submitted": 30228, "frontend_question_id": 1224, "is_new_question": false }, @@ -23337,8 +23636,8 @@ "question__title": "Dice Roll Simulation", "question__title_slug": "dice-roll-simulation", "question__hide": false, - "total_acs": 22265, - "total_submitted": 46380, + "total_acs": 22422, + "total_submitted": 46698, "frontend_question_id": 1223, "is_new_question": false }, @@ -23360,8 +23659,8 @@ "question__title": "Queens That Can Attack the King", "question__title_slug": "queens-that-can-attack-the-king", "question__hide": false, - "total_acs": 32919, - "total_submitted": 46166, + "total_acs": 33105, + "total_submitted": 46414, "frontend_question_id": 1222, "is_new_question": false }, @@ -23383,8 +23682,8 @@ "question__title": "Split a String in Balanced Strings", "question__title_slug": "split-a-string-in-balanced-strings", "question__hide": false, - "total_acs": 202885, - "total_submitted": 239985, + "total_acs": 204383, + "total_submitted": 241852, "frontend_question_id": 1221, "is_new_question": false }, @@ -23406,8 +23705,8 @@ "question__title": "The Dining Philosophers", "question__title_slug": "the-dining-philosophers", "question__hide": false, - "total_acs": 19816, - "total_submitted": 34660, + "total_acs": 19972, + "total_submitted": 34982, "frontend_question_id": 1226, "is_new_question": false }, @@ -23429,8 +23728,8 @@ "question__title": "Team Scores in Football Tournament", "question__title_slug": "team-scores-in-football-tournament", "question__hide": false, - "total_acs": 26165, - "total_submitted": 45552, + "total_acs": 26422, + "total_submitted": 45956, "frontend_question_id": 1212, "is_new_question": false }, @@ -23452,8 +23751,8 @@ "question__title": "Queries Quality and Percentage", "question__title_slug": "queries-quality-and-percentage", "question__hide": false, - "total_acs": 26490, - "total_submitted": 37269, + "total_acs": 26986, + "total_submitted": 37908, "frontend_question_id": 1211, "is_new_question": false }, @@ -23475,8 +23774,8 @@ "question__title": "Design Skiplist", "question__title_slug": "design-skiplist", "question__hide": false, - "total_acs": 13288, - "total_submitted": 22181, + "total_acs": 13477, + "total_submitted": 22478, "frontend_question_id": 1206, "is_new_question": false }, @@ -23498,8 +23797,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": 2101, - "total_submitted": 7152, + "total_acs": 2129, + "total_submitted": 7243, "frontend_question_id": 1960, "is_new_question": false }, @@ -23521,8 +23820,8 @@ "question__title": "Maximum Candies Allocated to K Children", "question__title_slug": "maximum-candies-allocated-to-k-children", "question__hide": false, - "total_acs": 16536, - "total_submitted": 47176, + "total_acs": 17006, + "total_submitted": 48342, "frontend_question_id": 2226, "is_new_question": false }, @@ -23535,6 +23834,29 @@ "frequency": 0, "progress": 0 }, + { + "stat": { + "question_id": 1334, + "question__article__live": null, + "question__article__slug": null, + "question__article__has_video_solution": null, + "question__title": "Sum of Numbers With Units Digit K", + "question__title_slug": "sum-of-numbers-with-units-digit-k", + "question__hide": false, + "total_acs": 15968, + "total_submitted": 65161, + "frontend_question_id": 2310, + "is_new_question": false + }, + "status": null, + "difficulty": { + "level": 2 + }, + "paid_only": false, + "is_favor": false, + "frequency": 0, + "progress": 0 + }, { "stat": { "question_id": 1333, @@ -23544,8 +23866,8 @@ "question__title": "Sort the Jumbled Numbers", "question__title_slug": "sort-the-jumbled-numbers", "question__hide": false, - "total_acs": 12997, - "total_submitted": 29491, + "total_acs": 13181, + "total_submitted": 29851, "frontend_question_id": 2191, "is_new_question": false }, @@ -23567,8 +23889,8 @@ "question__title": "Count Vowels Permutation", "question__title_slug": "count-vowels-permutation", "question__hide": false, - "total_acs": 48264, - "total_submitted": 85808, + "total_acs": 48554, + "total_submitted": 86384, "frontend_question_id": 1220, "is_new_question": false }, @@ -23590,8 +23912,8 @@ "question__title": "Path with Maximum Gold", "question__title_slug": "path-with-maximum-gold", "question__hide": false, - "total_acs": 84921, - "total_submitted": 129863, + "total_acs": 85743, + "total_submitted": 131261, "frontend_question_id": 1219, "is_new_question": false }, @@ -23613,8 +23935,8 @@ "question__title": "Longest Arithmetic Subsequence of Given Difference", "question__title_slug": "longest-arithmetic-subsequence-of-given-difference", "question__hide": false, - "total_acs": 50648, - "total_submitted": 97877, + "total_acs": 51201, + "total_submitted": 98923, "frontend_question_id": 1218, "is_new_question": false }, @@ -23636,8 +23958,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": 97502, - "total_submitted": 134427, + "total_acs": 98088, + "total_submitted": 135270, "frontend_question_id": 1217, "is_new_question": false }, @@ -23659,8 +23981,8 @@ "question__title": "Monthly Transactions II", "question__title_slug": "monthly-transactions-ii", "question__hide": false, - "total_acs": 16114, - "total_submitted": 36277, + "total_acs": 16298, + "total_submitted": 36687, "frontend_question_id": 1205, "is_new_question": false }, @@ -23682,8 +24004,8 @@ "question__title": "Last Person to Fit in the Bus", "question__title_slug": "last-person-to-fit-in-the-bus", "question__hide": false, - "total_acs": 30216, - "total_submitted": 40957, + "total_acs": 30490, + "total_submitted": 41307, "frontend_question_id": 1204, "is_new_question": false }, @@ -23705,8 +24027,8 @@ "question__title": "Sum of Floored Pairs", "question__title_slug": "sum-of-floored-pairs", "question__hide": false, - "total_acs": 6200, - "total_submitted": 22111, + "total_acs": 6278, + "total_submitted": 22351, "frontend_question_id": 1862, "is_new_question": false }, @@ -23728,8 +24050,8 @@ "question__title": "Path with Maximum Probability", "question__title_slug": "path-with-maximum-probability", "question__hide": false, - "total_acs": 46419, - "total_submitted": 98484, + "total_acs": 47318, + "total_submitted": 100064, "frontend_question_id": 1514, "is_new_question": false }, @@ -23751,8 +24073,8 @@ "question__title": "Where Will the Ball Fall", "question__title_slug": "where-will-the-ball-fall", "question__hide": false, - "total_acs": 28431, - "total_submitted": 42647, + "total_acs": 30305, + "total_submitted": 45524, "frontend_question_id": 1706, "is_new_question": false }, @@ -23774,8 +24096,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": 7400, - "total_submitted": 15320, + "total_acs": 7446, + "total_submitted": 15406, "frontend_question_id": 1210, "is_new_question": false }, @@ -23797,8 +24119,8 @@ "question__title": "Get Equal Substrings Within Budget", "question__title_slug": "get-equal-substrings-within-budget", "question__hide": false, - "total_acs": 29833, - "total_submitted": 63743, + "total_acs": 30057, + "total_submitted": 64152, "frontend_question_id": 1208, "is_new_question": false }, @@ -23820,8 +24142,8 @@ "question__title": "Remove All Adjacent Duplicates in String II", "question__title_slug": "remove-all-adjacent-duplicates-in-string-ii", "question__hide": false, - "total_acs": 212656, - "total_submitted": 378752, + "total_acs": 214536, + "total_submitted": 382394, "frontend_question_id": 1209, "is_new_question": false }, @@ -23843,8 +24165,8 @@ "question__title": "Unique Number of Occurrences", "question__title_slug": "unique-number-of-occurrences", "question__hide": false, - "total_acs": 134189, - "total_submitted": 186772, + "total_acs": 136739, + "total_submitted": 190418, "frontend_question_id": 1207, "is_new_question": false }, @@ -23866,8 +24188,8 @@ "question__title": "Tournament Winners", "question__title_slug": "tournament-winners", "question__hide": false, - "total_acs": 13726, - "total_submitted": 26439, + "total_acs": 13914, + "total_submitted": 26812, "frontend_question_id": 1194, "is_new_question": false }, @@ -23889,8 +24211,8 @@ "question__title": "Monthly Transactions I", "question__title_slug": "monthly-transactions-i", "question__hide": false, - "total_acs": 24649, - "total_submitted": 36662, + "total_acs": 25233, + "total_submitted": 37498, "frontend_question_id": 1193, "is_new_question": false }, @@ -23912,8 +24234,8 @@ "question__title": "Fizz Buzz Multithreaded", "question__title_slug": "fizz-buzz-multithreaded", "question__hide": false, - "total_acs": 29212, - "total_submitted": 40410, + "total_acs": 29449, + "total_submitted": 40745, "frontend_question_id": 1195, "is_new_question": false }, @@ -23935,8 +24257,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": 3830, - "total_submitted": 7928, + "total_acs": 3874, + "total_submitted": 8023, "frontend_question_id": 1916, "is_new_question": false }, @@ -23958,8 +24280,8 @@ "question__title": "Count Artifacts That Can Be Extracted", "question__title_slug": "count-artifacts-that-can-be-extracted", "question__hide": false, - "total_acs": 14656, - "total_submitted": 26988, + "total_acs": 14789, + "total_submitted": 27187, "frontend_question_id": 2201, "is_new_question": false }, @@ -23981,8 +24303,8 @@ "question__title": "Largest Magic Square", "question__title_slug": "largest-magic-square", "question__hide": false, - "total_acs": 7791, - "total_submitted": 15080, + "total_acs": 7882, + "total_submitted": 15230, "frontend_question_id": 1895, "is_new_question": false }, @@ -24004,8 +24326,8 @@ "question__title": "Watering Plants", "question__title_slug": "watering-plants", "question__hide": false, - "total_acs": 21702, - "total_submitted": 27003, + "total_acs": 22259, + "total_submitted": 27695, "frontend_question_id": 2079, "is_new_question": false }, @@ -24027,8 +24349,8 @@ "question__title": "Sort Items by Groups Respecting Dependencies", "question__title_slug": "sort-items-by-groups-respecting-dependencies", "question__hide": false, - "total_acs": 12397, - "total_submitted": 24933, + "total_acs": 12510, + "total_submitted": 25131, "frontend_question_id": 1203, "is_new_question": false }, @@ -24050,8 +24372,8 @@ "question__title": "Smallest String With Swaps", "question__title_slug": "smallest-string-with-swaps", "question__hide": false, - "total_acs": 82547, - "total_submitted": 144367, + "total_acs": 83516, + "total_submitted": 146002, "frontend_question_id": 1202, "is_new_question": false }, @@ -24073,8 +24395,8 @@ "question__title": "Ugly Number III", "question__title_slug": "ugly-number-iii", "question__hide": false, - "total_acs": 21084, - "total_submitted": 74550, + "total_acs": 21375, + "total_submitted": 75441, "frontend_question_id": 1201, "is_new_question": false }, @@ -24096,8 +24418,8 @@ "question__title": "Minimum Absolute Difference", "question__title_slug": "minimum-absolute-difference", "question__hide": false, - "total_acs": 124662, - "total_submitted": 178400, + "total_acs": 125671, + "total_submitted": 179822, "frontend_question_id": 1200, "is_new_question": false }, @@ -24119,8 +24441,8 @@ "question__title": "Number of Visible People in a Queue", "question__title_slug": "number-of-visible-people-in-a-queue", "question__hide": false, - "total_acs": 21132, - "total_submitted": 30204, + "total_acs": 21745, + "total_submitted": 31069, "frontend_question_id": 1944, "is_new_question": false }, @@ -24142,8 +24464,8 @@ "question__title": "Longest Happy String", "question__title_slug": "longest-happy-string", "question__hide": false, - "total_acs": 48235, - "total_submitted": 84870, + "total_acs": 49280, + "total_submitted": 86644, "frontend_question_id": 1405, "is_new_question": false }, @@ -24165,8 +24487,8 @@ "question__title": "Minimum Moves to Reach Target Score", "question__title_slug": "minimum-moves-to-reach-target-score", "question__hide": false, - "total_acs": 24535, - "total_submitted": 50548, + "total_acs": 24964, + "total_submitted": 51490, "frontend_question_id": 2139, "is_new_question": false }, @@ -24188,8 +24510,8 @@ "question__title": "Delete Characters to Make Fancy String", "question__title_slug": "delete-characters-to-make-fancy-string", "question__hide": false, - "total_acs": 20091, - "total_submitted": 35296, + "total_acs": 20393, + "total_submitted": 35890, "frontend_question_id": 1957, "is_new_question": false }, @@ -24211,8 +24533,8 @@ "question__title": "Reformat Department Table", "question__title_slug": "reformat-department-table", "question__hide": false, - "total_acs": 72294, - "total_submitted": 87650, + "total_acs": 73190, + "total_submitted": 88751, "frontend_question_id": 1179, "is_new_question": false }, @@ -24234,8 +24556,8 @@ "question__title": "Critical Connections in a Network", "question__title_slug": "critical-connections-in-a-network", "question__hide": false, - "total_acs": 176078, - "total_submitted": 324344, + "total_acs": 177340, + "total_submitted": 326444, "frontend_question_id": 1192, "is_new_question": false }, @@ -24257,8 +24579,8 @@ "question__title": "K-Concatenation Maximum Sum", "question__title_slug": "k-concatenation-maximum-sum", "question__hide": false, - "total_acs": 25131, - "total_submitted": 104239, + "total_acs": 25368, + "total_submitted": 105295, "frontend_question_id": 1191, "is_new_question": false }, @@ -24280,8 +24602,8 @@ "question__title": "Reverse Substrings Between Each Pair of Parentheses", "question__title_slug": "reverse-substrings-between-each-pair-of-parentheses", "question__hide": false, - "total_acs": 50362, - "total_submitted": 76521, + "total_acs": 50869, + "total_submitted": 77309, "frontend_question_id": 1190, "is_new_question": false }, @@ -24303,8 +24625,8 @@ "question__title": "Maximum Number of Balloons", "question__title_slug": "maximum-number-of-balloons", "question__hide": false, - "total_acs": 113604, - "total_submitted": 181958, + "total_acs": 114286, + "total_submitted": 183070, "frontend_question_id": 1189, "is_new_question": false }, @@ -24326,8 +24648,8 @@ "question__title": "Kth Ancestor of a Tree Node", "question__title_slug": "kth-ancestor-of-a-tree-node", "question__hide": false, - "total_acs": 21056, - "total_submitted": 62915, + "total_acs": 21353, + "total_submitted": 63747, "frontend_question_id": 1483, "is_new_question": false }, @@ -24349,8 +24671,8 @@ "question__title": "Minimum Garden Perimeter to Collect Enough Apples", "question__title_slug": "minimum-garden-perimeter-to-collect-enough-apples", "question__hide": false, - "total_acs": 11481, - "total_submitted": 21792, + "total_acs": 11600, + "total_submitted": 22018, "frontend_question_id": 1954, "is_new_question": false }, @@ -24372,8 +24694,8 @@ "question__title": "Range Frequency Queries", "question__title_slug": "range-frequency-queries", "question__hide": false, - "total_acs": 11640, - "total_submitted": 31654, + "total_acs": 11882, + "total_submitted": 32197, "frontend_question_id": 2080, "is_new_question": false }, @@ -24395,8 +24717,8 @@ "question__title": "Three Consecutive Odds", "question__title_slug": "three-consecutive-odds", "question__hide": false, - "total_acs": 51992, - "total_submitted": 81237, + "total_acs": 52610, + "total_submitted": 82201, "frontend_question_id": 1550, "is_new_question": false }, @@ -24418,8 +24740,8 @@ "question__title": "Immediate Food Delivery II", "question__title_slug": "immediate-food-delivery-ii", "question__hide": false, - "total_acs": 23671, - "total_submitted": 37116, + "total_acs": 24021, + "total_submitted": 37668, "frontend_question_id": 1174, "is_new_question": false }, @@ -24441,8 +24763,8 @@ "question__title": "Immediate Food Delivery I", "question__title_slug": "immediate-food-delivery-i", "question__hide": false, - "total_acs": 40411, - "total_submitted": 48576, + "total_acs": 41092, + "total_submitted": 49367, "frontend_question_id": 1173, "is_new_question": false }, @@ -24464,8 +24786,8 @@ "question__title": "Make Array Strictly Increasing", "question__title_slug": "make-array-strictly-increasing", "question__hide": false, - "total_acs": 11798, - "total_submitted": 26336, + "total_acs": 11903, + "total_submitted": 26521, "frontend_question_id": 1187, "is_new_question": false }, @@ -24487,8 +24809,8 @@ "question__title": "Day of the Week", "question__title_slug": "day-of-the-week", "question__hide": false, - "total_acs": 44608, - "total_submitted": 76587, + "total_acs": 44959, + "total_submitted": 77253, "frontend_question_id": 1185, "is_new_question": false }, @@ -24510,8 +24832,8 @@ "question__title": "Maximum Subarray Sum with One Deletion", "question__title_slug": "maximum-subarray-sum-with-one-deletion", "question__hide": false, - "total_acs": 32813, - "total_submitted": 80579, + "total_acs": 33078, + "total_submitted": 81157, "frontend_question_id": 1186, "is_new_question": false }, @@ -24533,8 +24855,8 @@ "question__title": "Distance Between Bus Stops", "question__title_slug": "distance-between-bus-stops", "question__hide": false, - "total_acs": 42791, - "total_submitted": 78973, + "total_acs": 43054, + "total_submitted": 79483, "frontend_question_id": 1184, "is_new_question": false }, @@ -24556,8 +24878,8 @@ "question__title": "Constrained Subsequence Sum", "question__title_slug": "constrained-subsequence-sum", "question__hide": false, - "total_acs": 19187, - "total_submitted": 40893, + "total_acs": 19413, + "total_submitted": 41401, "frontend_question_id": 1425, "is_new_question": false }, @@ -24579,8 +24901,8 @@ "question__title": "Balance a Binary Search Tree", "question__title_slug": "balance-a-binary-search-tree", "question__hide": false, - "total_acs": 95927, - "total_submitted": 119430, + "total_acs": 97062, + "total_submitted": 120863, "frontend_question_id": 1382, "is_new_question": false }, @@ -24602,8 +24924,8 @@ "question__title": "Four Divisors", "question__title_slug": "four-divisors", "question__hide": false, - "total_acs": 21022, - "total_submitted": 51380, + "total_acs": 21179, + "total_submitted": 51783, "frontend_question_id": 1390, "is_new_question": false }, @@ -24625,8 +24947,8 @@ "question__title": "Reformat Date", "question__title_slug": "reformat-date", "question__hide": false, - "total_acs": 42258, - "total_submitted": 68119, + "total_acs": 42876, + "total_submitted": 69072, "frontend_question_id": 1507, "is_new_question": false }, @@ -24648,8 +24970,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": 27052, - "total_submitted": 57890, + "total_acs": 27144, + "total_submitted": 58121, "frontend_question_id": 1178, "is_new_question": false }, @@ -24671,8 +24993,8 @@ "question__title": "Can Make Palindrome from Substring", "question__title_slug": "can-make-palindrome-from-substring", "question__hide": false, - "total_acs": 20470, - "total_submitted": 54709, + "total_acs": 20594, + "total_submitted": 55005, "frontend_question_id": 1177, "is_new_question": false }, @@ -24694,8 +25016,8 @@ "question__title": "Diet Plan Performance", "question__title_slug": "diet-plan-performance", "question__hide": false, - "total_acs": 25270, - "total_submitted": 48071, + "total_acs": 25467, + "total_submitted": 48483, "frontend_question_id": 1176, "is_new_question": false }, @@ -24717,8 +25039,8 @@ "question__title": "Prime Arrangements", "question__title_slug": "prime-arrangements", "question__hide": false, - "total_acs": 20577, - "total_submitted": 38788, + "total_acs": 20713, + "total_submitted": 39049, "frontend_question_id": 1175, "is_new_question": false }, @@ -24740,8 +25062,8 @@ "question__title": "Product Price at a Given Date", "question__title_slug": "product-price-at-a-given-date", "question__hide": false, - "total_acs": 31819, - "total_submitted": 46566, + "total_acs": 32408, + "total_submitted": 47409, "frontend_question_id": 1164, "is_new_question": false }, @@ -24763,8 +25085,8 @@ "question__title": "Largest Multiple of Three", "question__title_slug": "largest-multiple-of-three", "question__hide": false, - "total_acs": 14224, - "total_submitted": 41860, + "total_acs": 14334, + "total_submitted": 42233, "frontend_question_id": 1363, "is_new_question": false }, @@ -24786,8 +25108,8 @@ "question__title": "Closest Divisors", "question__title_slug": "closest-divisors", "question__hide": false, - "total_acs": 15974, - "total_submitted": 26948, + "total_acs": 16080, + "total_submitted": 27101, "frontend_question_id": 1362, "is_new_question": false }, @@ -24809,8 +25131,8 @@ "question__title": "Validate Binary Tree Nodes", "question__title_slug": "validate-binary-tree-nodes", "question__hide": false, - "total_acs": 35916, - "total_submitted": 87296, + "total_acs": 36228, + "total_submitted": 88330, "frontend_question_id": 1361, "is_new_question": false }, @@ -24832,8 +25154,8 @@ "question__title": "Number of Days Between Two Dates", "question__title_slug": "number-of-days-between-two-dates", "question__hide": false, - "total_acs": 30212, - "total_submitted": 64445, + "total_acs": 30499, + "total_submitted": 65047, "frontend_question_id": 1360, "is_new_question": false }, @@ -24855,8 +25177,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": 66208, - "total_submitted": 108289, + "total_acs": 66414, + "total_submitted": 108610, "frontend_question_id": 1170, "is_new_question": false }, @@ -24878,8 +25200,8 @@ "question__title": "Invalid Transactions", "question__title_slug": "invalid-transactions", "question__hide": false, - "total_acs": 42768, - "total_submitted": 141856, + "total_acs": 43213, + "total_submitted": 143401, "frontend_question_id": 1169, "is_new_question": false }, @@ -24901,8 +25223,8 @@ "question__title": "Web Crawler", "question__title_slug": "web-crawler", "question__hide": false, - "total_acs": 23212, - "total_submitted": 35288, + "total_acs": 23434, + "total_submitted": 35587, "frontend_question_id": 1236, "is_new_question": false }, @@ -24924,8 +25246,8 @@ "question__title": "Dinner Plate Stacks", "question__title_slug": "dinner-plate-stacks", "question__hide": false, - "total_acs": 13978, - "total_submitted": 40992, + "total_acs": 14077, + "total_submitted": 41339, "frontend_question_id": 1172, "is_new_question": false }, @@ -24947,8 +25269,8 @@ "question__title": "Market Analysis II", "question__title_slug": "market-analysis-ii", "question__hide": false, - "total_acs": 14000, - "total_submitted": 24049, + "total_acs": 14114, + "total_submitted": 24237, "frontend_question_id": 1159, "is_new_question": false }, @@ -24970,8 +25292,8 @@ "question__title": "Market Analysis I", "question__title_slug": "market-analysis-i", "question__hide": false, - "total_acs": 32589, - "total_submitted": 49715, + "total_acs": 34405, + "total_submitted": 52537, "frontend_question_id": 1158, "is_new_question": false }, @@ -24993,8 +25315,8 @@ "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": 36804, - "total_submitted": 86274, + "total_acs": 37267, + "total_submitted": 87225, "frontend_question_id": 1171, "is_new_question": false }, @@ -25016,8 +25338,8 @@ "question__title": "Maximum Number of Words You Can Type", "question__title_slug": "maximum-number-of-words-you-can-type", "question__hide": false, - "total_acs": 31010, - "total_submitted": 43526, + "total_acs": 31469, + "total_submitted": 44171, "frontend_question_id": 1935, "is_new_question": false }, @@ -25039,8 +25361,8 @@ "question__title": "Number of Dice Rolls With Target Sum", "question__title_slug": "number-of-dice-rolls-with-target-sum", "question__hide": false, - "total_acs": 106584, - "total_submitted": 223153, + "total_acs": 107712, + "total_submitted": 225276, "frontend_question_id": 1155, "is_new_question": false }, @@ -25062,8 +25384,8 @@ "question__title": "Online Majority Element In Subarray", "question__title_slug": "online-majority-element-in-subarray", "question__hide": false, - "total_acs": 13086, - "total_submitted": 30892, + "total_acs": 13137, + "total_submitted": 31047, "frontend_question_id": 1157, "is_new_question": false }, @@ -25085,8 +25407,8 @@ "question__title": "Swap For Longest Repeated Character Substring", "question__title_slug": "swap-for-longest-repeated-character-substring", "question__hide": false, - "total_acs": 23498, - "total_submitted": 51100, + "total_acs": 23657, + "total_submitted": 51566, "frontend_question_id": 1156, "is_new_question": false }, @@ -25108,8 +25430,8 @@ "question__title": "Day of the Year", "question__title_slug": "day-of-the-year", "question__hide": false, - "total_acs": 34255, - "total_submitted": 67451, + "total_acs": 34569, + "total_submitted": 68099, "frontend_question_id": 1154, "is_new_question": false }, @@ -25131,8 +25453,8 @@ "question__title": "Article Views II", "question__title_slug": "article-views-ii", "question__hide": false, - "total_acs": 26042, - "total_submitted": 54600, + "total_acs": 26417, + "total_submitted": 55416, "frontend_question_id": 1149, "is_new_question": false }, @@ -25154,8 +25476,8 @@ "question__title": "Article Views I", "question__title_slug": "article-views-i", "question__hide": false, - "total_acs": 48244, - "total_submitted": 62800, + "total_acs": 50901, + "total_submitted": 66269, "frontend_question_id": 1148, "is_new_question": false }, @@ -25177,8 +25499,8 @@ "question__title": "Rank Transform of a Matrix", "question__title_slug": "rank-transform-of-a-matrix", "question__hide": false, - "total_acs": 17470, - "total_submitted": 42784, + "total_acs": 17627, + "total_submitted": 43185, "frontend_question_id": 1632, "is_new_question": false }, @@ -25200,8 +25522,8 @@ "question__title": "Rank Transform of an Array", "question__title_slug": "rank-transform-of-an-array", "question__hide": false, - "total_acs": 61882, - "total_submitted": 105596, + "total_acs": 62697, + "total_submitted": 107004, "frontend_question_id": 1331, "is_new_question": false }, @@ -25223,8 +25545,8 @@ "question__title": "Reverse Subarray To Maximize Array Value", "question__title_slug": "reverse-subarray-to-maximize-array-value", "question__hide": false, - "total_acs": 3963, - "total_submitted": 10104, + "total_acs": 3995, + "total_submitted": 10170, "frontend_question_id": 1330, "is_new_question": false }, @@ -25246,8 +25568,8 @@ "question__title": "Deepest Leaves Sum", "question__title_slug": "deepest-leaves-sum", "question__hide": false, - "total_acs": 221824, - "total_submitted": 254771, + "total_acs": 224052, + "total_submitted": 257347, "frontend_question_id": 1302, "is_new_question": false }, @@ -25269,8 +25591,8 @@ "question__title": "Sort the Matrix Diagonally", "question__title_slug": "sort-the-matrix-diagonally", "question__hide": false, - "total_acs": 86138, - "total_submitted": 105825, + "total_acs": 86739, + "total_submitted": 106578, "frontend_question_id": 1329, "is_new_question": false }, @@ -25292,8 +25614,8 @@ "question__title": "Break a Palindrome", "question__title_slug": "break-a-palindrome", "question__hide": false, - "total_acs": 69546, - "total_submitted": 133062, + "total_acs": 69947, + "total_submitted": 133807, "frontend_question_id": 1328, "is_new_question": false }, @@ -25315,8 +25637,8 @@ "question__title": "Longest Chunked Palindrome Decomposition", "question__title_slug": "longest-chunked-palindrome-decomposition", "question__hide": false, - "total_acs": 16920, - "total_submitted": 28128, + "total_acs": 17060, + "total_submitted": 28387, "frontend_question_id": 1147, "is_new_question": false }, @@ -25338,8 +25660,8 @@ "question__title": "Longest Common Subsequence", "question__title_slug": "longest-common-subsequence", "question__hide": false, - "total_acs": 436856, - "total_submitted": 740877, + "total_acs": 446708, + "total_submitted": 757372, "frontend_question_id": 1143, "is_new_question": false }, @@ -25361,8 +25683,8 @@ "question__title": "Snapshot Array", "question__title_slug": "snapshot-array", "question__hide": false, - "total_acs": 116741, - "total_submitted": 314679, + "total_acs": 118567, + "total_submitted": 319311, "frontend_question_id": 1146, "is_new_question": false }, @@ -25384,8 +25706,8 @@ "question__title": "Binary Tree Coloring Game", "question__title_slug": "binary-tree-coloring-game", "question__hide": false, - "total_acs": 36083, - "total_submitted": 70300, + "total_acs": 36357, + "total_submitted": 70849, "frontend_question_id": 1145, "is_new_question": false }, @@ -25407,8 +25729,8 @@ "question__title": "Decrease Elements To Make Array Zigzag", "question__title_slug": "decrease-elements-to-make-array-zigzag", "question__hide": false, - "total_acs": 15019, - "total_submitted": 31950, + "total_acs": 15120, + "total_submitted": 32156, "frontend_question_id": 1144, "is_new_question": false }, @@ -25430,8 +25752,8 @@ "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": 31782, - "total_submitted": 88443, + "total_acs": 32029, + "total_submitted": 89108, "frontend_question_id": 1142, "is_new_question": false }, @@ -25453,8 +25775,8 @@ "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": 44545, - "total_submitted": 86986, + "total_acs": 46822, + "total_submitted": 91918, "frontend_question_id": 1141, "is_new_question": false }, @@ -25476,8 +25798,8 @@ "question__title": "Distinct Echo Substrings", "question__title_slug": "distinct-echo-substrings", "question__hide": false, - "total_acs": 11817, - "total_submitted": 23767, + "total_acs": 11903, + "total_submitted": 23943, "frontend_question_id": 1316, "is_new_question": false }, @@ -25499,8 +25821,8 @@ "question__title": "Sum of Nodes with Even-Valued Grandparent", "question__title_slug": "sum-of-nodes-with-even-valued-grandparent", "question__hide": false, - "total_acs": 103847, - "total_submitted": 121668, + "total_acs": 105107, + "total_submitted": 123110, "frontend_question_id": 1315, "is_new_question": false }, @@ -25522,8 +25844,8 @@ "question__title": "Matrix Block Sum", "question__title_slug": "matrix-block-sum", "question__hide": false, - "total_acs": 62283, - "total_submitted": 82721, + "total_acs": 63104, + "total_submitted": 83783, "frontend_question_id": 1314, "is_new_question": false }, @@ -25545,8 +25867,8 @@ "question__title": "Decompress Run-Length Encoded List", "question__title_slug": "decompress-run-length-encoded-list", "question__hide": false, - "total_acs": 184436, - "total_submitted": 214705, + "total_acs": 186093, + "total_submitted": 216687, "frontend_question_id": 1313, "is_new_question": false }, @@ -25568,8 +25890,8 @@ "question__title": "Stone Game II", "question__title_slug": "stone-game-ii", "question__hide": false, - "total_acs": 40150, - "total_submitted": 61984, + "total_acs": 40482, + "total_submitted": 62455, "frontend_question_id": 1140, "is_new_question": false }, @@ -25591,8 +25913,8 @@ "question__title": "Largest 1-Bordered Square", "question__title_slug": "largest-1-bordered-square", "question__hide": false, - "total_acs": 18859, - "total_submitted": 37964, + "total_acs": 19049, + "total_submitted": 38342, "frontend_question_id": 1139, "is_new_question": false }, @@ -25614,8 +25936,8 @@ "question__title": "Alphabet Board Path", "question__title_slug": "alphabet-board-path", "question__hide": false, - "total_acs": 40727, - "total_submitted": 77842, + "total_acs": 41010, + "total_submitted": 78389, "frontend_question_id": 1138, "is_new_question": false }, @@ -25637,8 +25959,8 @@ "question__title": "Reported Posts II", "question__title_slug": "reported-posts-ii", "question__hide": false, - "total_acs": 27929, - "total_submitted": 82857, + "total_acs": 28245, + "total_submitted": 83795, "frontend_question_id": 1132, "is_new_question": false }, @@ -25660,8 +25982,8 @@ "question__title": "N-th Tribonacci Number", "question__title_slug": "n-th-tribonacci-number", "question__hide": false, - "total_acs": 287782, - "total_submitted": 456090, + "total_acs": 293759, + "total_submitted": 465100, "frontend_question_id": 1137, "is_new_question": false }, @@ -25683,8 +26005,8 @@ "question__title": "Number of Paths with Max Score", "question__title_slug": "number-of-paths-with-max-score", "question__hide": false, - "total_acs": 9420, - "total_submitted": 24259, + "total_acs": 9492, + "total_submitted": 24453, "frontend_question_id": 1301, "is_new_question": false }, @@ -25706,8 +26028,8 @@ "question__title": "Number of Ships in a Rectangle", "question__title_slug": "number-of-ships-in-a-rectangle", "question__hide": false, - "total_acs": 18339, - "total_submitted": 26660, + "total_acs": 18540, + "total_submitted": 26925, "frontend_question_id": 1274, "is_new_question": false }, @@ -25729,8 +26051,8 @@ "question__title": "Sum of Mutated Array Closest to Target", "question__title_slug": "sum-of-mutated-array-closest-to-target", "question__hide": false, - "total_acs": 26396, - "total_submitted": 61332, + "total_acs": 26699, + "total_submitted": 61988, "frontend_question_id": 1300, "is_new_question": false }, @@ -25752,8 +26074,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": 214367, - "total_submitted": 287750, + "total_acs": 216736, + "total_submitted": 290914, "frontend_question_id": 1299, "is_new_question": false }, @@ -25775,8 +26097,8 @@ "question__title": "Maximum of Absolute Value Expression", "question__title_slug": "maximum-of-absolute-value-expression", "question__hide": false, - "total_acs": 16606, - "total_submitted": 33370, + "total_acs": 16682, + "total_submitted": 33604, "frontend_question_id": 1131, "is_new_question": false }, @@ -25798,8 +26120,8 @@ "question__title": "Shortest Path with Alternating Colors", "question__title_slug": "shortest-path-with-alternating-colors", "question__hide": false, - "total_acs": 37543, - "total_submitted": 88609, + "total_acs": 38351, + "total_submitted": 90470, "frontend_question_id": 1129, "is_new_question": false }, @@ -25821,8 +26143,8 @@ "question__title": "Minimum Cost Tree From Leaf Values", "question__title_slug": "minimum-cost-tree-from-leaf-values", "question__hide": false, - "total_acs": 73190, - "total_submitted": 106886, + "total_acs": 73731, + "total_submitted": 107686, "frontend_question_id": 1130, "is_new_question": false }, @@ -25844,8 +26166,8 @@ "question__title": "Number of Equivalent Domino Pairs", "question__title_slug": "number-of-equivalent-domino-pairs", "question__hide": false, - "total_acs": 48511, - "total_submitted": 104551, + "total_acs": 48809, + "total_submitted": 105205, "frontend_question_id": 1128, "is_new_question": false }, @@ -25867,8 +26189,8 @@ "question__title": "User Purchase Platform", "question__title_slug": "user-purchase-platform", "question__hide": false, - "total_acs": 11430, - "total_submitted": 22289, + "total_acs": 11513, + "total_submitted": 22475, "frontend_question_id": 1127, "is_new_question": false }, @@ -25890,8 +26212,8 @@ "question__title": "Active Businesses", "question__title_slug": "active-businesses", "question__hide": false, - "total_acs": 31250, - "total_submitted": 46200, + "total_acs": 31658, + "total_submitted": 46796, "frontend_question_id": 1126, "is_new_question": false }, @@ -25913,8 +26235,8 @@ "question__title": "Minimum Falling Path Sum II", "question__title_slug": "minimum-falling-path-sum-ii", "question__hide": false, - "total_acs": 29599, - "total_submitted": 48761, + "total_acs": 30163, + "total_submitted": 49817, "frontend_question_id": 1289, "is_new_question": false }, @@ -25936,8 +26258,8 @@ "question__title": "Graph Connectivity With Threshold", "question__title_slug": "graph-connectivity-with-threshold", "question__hide": false, - "total_acs": 10898, - "total_submitted": 24265, + "total_acs": 11007, + "total_submitted": 24508, "frontend_question_id": 1627, "is_new_question": false }, @@ -25959,8 +26281,8 @@ "question__title": "Remove Covered Intervals", "question__title_slug": "remove-covered-intervals", "question__hide": false, - "total_acs": 98066, - "total_submitted": 170851, + "total_acs": 98503, + "total_submitted": 171673, "frontend_question_id": 1288, "is_new_question": false }, @@ -25982,8 +26304,8 @@ "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": 64386, - "total_submitted": 108151, + "total_acs": 64881, + "total_submitted": 108948, "frontend_question_id": 1287, "is_new_question": false }, @@ -26005,8 +26327,8 @@ "question__title": "Smallest Sufficient Team", "question__title_slug": "smallest-sufficient-team", "question__hide": false, - "total_acs": 16424, - "total_submitted": 34649, + "total_acs": 16536, + "total_submitted": 34938, "frontend_question_id": 1125, "is_new_question": false }, @@ -26028,8 +26350,8 @@ "question__title": "Longest Well-Performing Interval", "question__title_slug": "longest-well-performing-interval", "question__hide": false, - "total_acs": 22405, - "total_submitted": 65295, + "total_acs": 22604, + "total_submitted": 65763, "frontend_question_id": 1124, "is_new_question": false }, @@ -26051,8 +26373,8 @@ "question__title": "Lowest Common Ancestor of Deepest Leaves", "question__title_slug": "lowest-common-ancestor-of-deepest-leaves", "question__hide": false, - "total_acs": 77658, - "total_submitted": 110537, + "total_acs": 78280, + "total_submitted": 111387, "frontend_question_id": 1123, "is_new_question": false }, @@ -26074,8 +26396,8 @@ "question__title": "Relative Sort Array", "question__title_slug": "relative-sort-array", "question__hide": false, - "total_acs": 128640, - "total_submitted": 188615, + "total_acs": 129964, + "total_submitted": 190425, "frontend_question_id": 1122, "is_new_question": false }, @@ -26097,8 +26419,8 @@ "question__title": "Print Zero Even Odd", "question__title_slug": "print-zero-even-odd", "question__hide": false, - "total_acs": 32728, - "total_submitted": 54871, + "total_acs": 32968, + "total_submitted": 55235, "frontend_question_id": 1116, "is_new_question": false }, @@ -26120,8 +26442,8 @@ "question__title": "Reported Posts", "question__title_slug": "reported-posts", "question__hide": false, - "total_acs": 33978, - "total_submitted": 51354, + "total_acs": 34327, + "total_submitted": 51888, "frontend_question_id": 1113, "is_new_question": false }, @@ -26143,8 +26465,8 @@ "question__title": "Highest Grade For Each Student", "question__title_slug": "highest-grade-for-each-student", "question__hide": false, - "total_acs": 36381, - "total_submitted": 49317, + "total_acs": 37040, + "total_submitted": 50186, "frontend_question_id": 1112, "is_new_question": false }, @@ -26166,8 +26488,8 @@ "question__title": "Handshakes That Don't Cross", "question__title_slug": "handshakes-that-dont-cross", "question__hide": false, - "total_acs": 5268, - "total_submitted": 9377, + "total_acs": 5331, + "total_submitted": 9503, "frontend_question_id": 1259, "is_new_question": false }, @@ -26189,8 +26511,8 @@ "question__title": "Sequential Digits", "question__title_slug": "sequential-digits", "question__hide": false, - "total_acs": 78329, - "total_submitted": 128540, + "total_acs": 79067, + "total_submitted": 129661, "frontend_question_id": 1291, "is_new_question": false }, @@ -26212,8 +26534,8 @@ "question__title": "Iterator for Combination", "question__title_slug": "iterator-for-combination", "question__hide": false, - "total_acs": 63396, - "total_submitted": 86444, + "total_acs": 63613, + "total_submitted": 86743, "frontend_question_id": 1286, "is_new_question": false }, @@ -26235,8 +26557,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": 33950, - "total_submitted": 52652, + "total_acs": 34384, + "total_submitted": 53345, "frontend_question_id": 1619, "is_new_question": false }, @@ -26258,8 +26580,8 @@ "question__title": "Design Bounded Blocking Queue", "question__title_slug": "design-bounded-blocking-queue", "question__hide": false, - "total_acs": 37431, - "total_submitted": 51342, + "total_acs": 37725, + "total_submitted": 51757, "frontend_question_id": 1188, "is_new_question": false }, @@ -26281,8 +26603,8 @@ "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": 20318, - "total_submitted": 27723, + "total_acs": 20475, + "total_submitted": 27939, "frontend_question_id": 1111, "is_new_question": false }, @@ -26304,8 +26626,8 @@ "question__title": "Delete Nodes And Return Forest", "question__title_slug": "delete-nodes-and-return-forest", "question__hide": false, - "total_acs": 161605, - "total_submitted": 233167, + "total_acs": 162632, + "total_submitted": 234623, "frontend_question_id": 1110, "is_new_question": false }, @@ -26327,8 +26649,8 @@ "question__title": "Corporate Flight Bookings", "question__title_slug": "corporate-flight-bookings", "question__hide": false, - "total_acs": 40677, - "total_submitted": 68744, + "total_acs": 41047, + "total_submitted": 69267, "frontend_question_id": 1109, "is_new_question": false }, @@ -26350,8 +26672,8 @@ "question__title": "Defanging an IP Address", "question__title_slug": "defanging-an-ip-address", "question__hide": false, - "total_acs": 416070, - "total_submitted": 467039, + "total_acs": 419535, + "total_submitted": 470713, "frontend_question_id": 1108, "is_new_question": false }, @@ -26373,8 +26695,8 @@ "question__title": "New Users Daily Count", "question__title_slug": "new-users-daily-count", "question__hide": false, - "total_acs": 25947, - "total_submitted": 56802, + "total_acs": 26225, + "total_submitted": 57395, "frontend_question_id": 1107, "is_new_question": false }, @@ -26396,8 +26718,8 @@ "question__title": "Print in Order", "question__title_slug": "print-in-order", "question__hide": false, - "total_acs": 108248, - "total_submitted": 158622, + "total_acs": 108997, + "total_submitted": 159757, "frontend_question_id": 1114, "is_new_question": false }, @@ -26419,8 +26741,8 @@ "question__title": "Palindrome Removal", "question__title_slug": "palindrome-removal", "question__hide": false, - "total_acs": 9092, - "total_submitted": 19812, + "total_acs": 9137, + "total_submitted": 19917, "frontend_question_id": 1246, "is_new_question": false }, @@ -26442,8 +26764,8 @@ "question__title": "Delete Tree Nodes", "question__title_slug": "delete-tree-nodes", "question__hide": false, - "total_acs": 8507, - "total_submitted": 13941, + "total_acs": 8545, + "total_submitted": 14002, "frontend_question_id": 1273, "is_new_question": false }, @@ -26465,8 +26787,8 @@ "question__title": "Remove Interval", "question__title_slug": "remove-interval", "question__hide": false, - "total_acs": 20505, - "total_submitted": 33307, + "total_acs": 20633, + "total_submitted": 33497, "frontend_question_id": 1272, "is_new_question": false }, @@ -26488,8 +26810,8 @@ "question__title": "Hexspeak", "question__title_slug": "hexspeak", "question__hide": false, - "total_acs": 8030, - "total_submitted": 14210, + "total_acs": 8099, + "total_submitted": 14312, "frontend_question_id": 1271, "is_new_question": false }, @@ -26511,8 +26833,8 @@ "question__title": "Unpopular Books", "question__title_slug": "unpopular-books", "question__hide": false, - "total_acs": 28382, - "total_submitted": 62831, + "total_acs": 28714, + "total_submitted": 63555, "frontend_question_id": 1098, "is_new_question": false }, @@ -26534,8 +26856,8 @@ "question__title": "Parsing A Boolean Expression", "question__title_slug": "parsing-a-boolean-expression", "question__hide": false, - "total_acs": 18917, - "total_submitted": 32219, + "total_acs": 19144, + "total_submitted": 32569, "frontend_question_id": 1106, "is_new_question": false }, @@ -26557,8 +26879,8 @@ "question__title": "Filling Bookcase Shelves", "question__title_slug": "filling-bookcase-shelves", "question__hide": false, - "total_acs": 34058, - "total_submitted": 58526, + "total_acs": 34412, + "total_submitted": 59067, "frontend_question_id": 1105, "is_new_question": false }, @@ -26580,8 +26902,8 @@ "question__title": "Distribute Candies to People", "question__title_slug": "distribute-candies-to-people", "question__hide": false, - "total_acs": 68130, - "total_submitted": 106804, + "total_acs": 68392, + "total_submitted": 107194, "frontend_question_id": 1103, "is_new_question": false }, @@ -26603,8 +26925,8 @@ "question__title": "Path In Zigzag Labelled Binary Tree", "question__title_slug": "path-in-zigzag-labelled-binary-tree", "question__hide": false, - "total_acs": 33781, - "total_submitted": 45278, + "total_acs": 34026, + "total_submitted": 45590, "frontend_question_id": 1104, "is_new_question": false }, @@ -26626,8 +26948,8 @@ "question__title": "Game Play Analysis V", "question__title_slug": "game-play-analysis-v", "question__hide": false, - "total_acs": 15861, - "total_submitted": 28654, + "total_acs": 16036, + "total_submitted": 28995, "frontend_question_id": 1097, "is_new_question": false }, @@ -26649,8 +26971,8 @@ "question__title": "Divide Chocolate", "question__title_slug": "divide-chocolate", "question__hide": false, - "total_acs": 38274, - "total_submitted": 67701, + "total_acs": 38562, + "total_submitted": 68200, "frontend_question_id": 1231, "is_new_question": false }, @@ -26672,8 +26994,8 @@ "question__title": "Synonymous Sentences", "question__title_slug": "synonymous-sentences", "question__hide": false, - "total_acs": 14673, - "total_submitted": 25874, + "total_acs": 14923, + "total_submitted": 26292, "frontend_question_id": 1258, "is_new_question": false }, @@ -26695,8 +27017,8 @@ "question__title": "Smallest Common Region", "question__title_slug": "smallest-common-region", "question__hide": false, - "total_acs": 15455, - "total_submitted": 24314, + "total_acs": 15679, + "total_submitted": 24639, "frontend_question_id": 1257, "is_new_question": false }, @@ -26718,8 +27040,8 @@ "question__title": "Encode Number", "question__title_slug": "encode-number", "question__hide": false, - "total_acs": 6550, - "total_submitted": 9399, + "total_acs": 6590, + "total_submitted": 9446, "frontend_question_id": 1256, "is_new_question": false }, @@ -26741,8 +27063,8 @@ "question__title": "Brace Expansion II", "question__title_slug": "brace-expansion-ii", "question__hide": false, - "total_acs": 19965, - "total_submitted": 31671, + "total_acs": 20145, + "total_submitted": 31909, "frontend_question_id": 1096, "is_new_question": false }, @@ -26764,8 +27086,8 @@ "question__title": "Print FooBar Alternately", "question__title_slug": "print-foobar-alternately", "question__hide": false, - "total_acs": 54373, - "total_submitted": 89132, + "total_acs": 54786, + "total_submitted": 89686, "frontend_question_id": 1115, "is_new_question": false }, @@ -26787,8 +27109,8 @@ "question__title": "Building H2O", "question__title_slug": "building-h2o", "question__hide": false, - "total_acs": 31855, - "total_submitted": 58054, + "total_acs": 32111, + "total_submitted": 58547, "frontend_question_id": 1117, "is_new_question": false }, @@ -26810,8 +27132,8 @@ "question__title": "Find in Mountain Array", "question__title_slug": "find-in-mountain-array", "question__hide": false, - "total_acs": 45408, - "total_submitted": 126597, + "total_acs": 46120, + "total_submitted": 128523, "frontend_question_id": 1095, "is_new_question": false }, @@ -26833,8 +27155,8 @@ "question__title": "Car Pooling", "question__title_slug": "car-pooling", "question__hide": false, - "total_acs": 158860, - "total_submitted": 274233, + "total_acs": 160654, + "total_submitted": 277715, "frontend_question_id": 1094, "is_new_question": false }, @@ -26856,8 +27178,8 @@ "question__title": "Statistics from a Large Sample", "question__title_slug": "statistics-from-a-large-sample", "question__hide": false, - "total_acs": 13686, - "total_submitted": 30091, + "total_acs": 13785, + "total_submitted": 30395, "frontend_question_id": 1093, "is_new_question": false }, @@ -26879,8 +27201,8 @@ "question__title": "Game Play Analysis IV", "question__title_slug": "game-play-analysis-iv", "question__hide": false, - "total_acs": 41743, - "total_submitted": 94839, + "total_acs": 42303, + "total_submitted": 96145, "frontend_question_id": 550, "is_new_question": false }, @@ -26902,8 +27224,8 @@ "question__title": "Game Play Analysis III", "question__title_slug": "game-play-analysis-iii", "question__hide": false, - "total_acs": 50069, - "total_submitted": 60875, + "total_acs": 50759, + "total_submitted": 61725, "frontend_question_id": 534, "is_new_question": false }, @@ -26925,8 +27247,8 @@ "question__title": "Game Play Analysis II", "question__title_slug": "game-play-analysis-ii", "question__hide": false, - "total_acs": 57348, - "total_submitted": 105389, + "total_acs": 58185, + "total_submitted": 106965, "frontend_question_id": 512, "is_new_question": false }, @@ -26948,8 +27270,8 @@ "question__title": "Game Play Analysis I", "question__title_slug": "game-play-analysis-i", "question__hide": false, - "total_acs": 79646, - "total_submitted": 99157, + "total_acs": 83546, + "total_submitted": 104249, "frontend_question_id": 511, "is_new_question": false }, @@ -26971,8 +27293,8 @@ "question__title": "Valid Palindrome III", "question__title_slug": "valid-palindrome-iii", "question__hide": false, - "total_acs": 35756, - "total_submitted": 70673, + "total_acs": 36058, + "total_submitted": 71322, "frontend_question_id": 1216, "is_new_question": false }, @@ -26994,8 +27316,8 @@ "question__title": "Tree Diameter", "question__title_slug": "tree-diameter", "question__hide": false, - "total_acs": 26541, - "total_submitted": 42793, + "total_acs": 26735, + "total_submitted": 43160, "frontend_question_id": 1245, "is_new_question": false }, @@ -27017,8 +27339,8 @@ "question__title": "Design A Leaderboard", "question__title_slug": "design-a-leaderboard", "question__hide": false, - "total_acs": 42707, - "total_submitted": 62607, + "total_acs": 43355, + "total_submitted": 63557, "frontend_question_id": 1244, "is_new_question": false }, @@ -27040,8 +27362,8 @@ "question__title": "Array Transformation", "question__title_slug": "array-transformation", "question__hide": false, - "total_acs": 10313, - "total_submitted": 20441, + "total_acs": 10368, + "total_submitted": 20527, "frontend_question_id": 1243, "is_new_question": false }, @@ -27063,8 +27385,8 @@ "question__title": "Sales Analysis III", "question__title_slug": "sales-analysis-iii", "question__hide": false, - "total_acs": 51038, - "total_submitted": 94403, + "total_acs": 53151, + "total_submitted": 98812, "frontend_question_id": 1084, "is_new_question": false }, @@ -27086,8 +27408,8 @@ "question__title": "Sales Analysis II", "question__title_slug": "sales-analysis-ii", "question__hide": false, - "total_acs": 42991, - "total_submitted": 85238, + "total_acs": 43487, + "total_submitted": 86214, "frontend_question_id": 1083, "is_new_question": false }, @@ -27109,8 +27431,8 @@ "question__title": "Sales Analysis I", "question__title_slug": "sales-analysis-i", "question__hide": false, - "total_acs": 42776, - "total_submitted": 56911, + "total_acs": 43282, + "total_submitted": 57590, "frontend_question_id": 1082, "is_new_question": false }, @@ -27132,8 +27454,8 @@ "question__title": "Shortest Path in Binary Matrix", "question__title_slug": "shortest-path-in-binary-matrix", "question__hide": false, - "total_acs": 236563, - "total_submitted": 532862, + "total_acs": 240188, + "total_submitted": 540622, "frontend_question_id": 1091, "is_new_question": false }, @@ -27155,8 +27477,8 @@ "question__title": "Shortest Common Supersequence ", "question__title_slug": "shortest-common-supersequence", "question__hide": false, - "total_acs": 48856, - "total_submitted": 86268, + "total_acs": 50315, + "total_submitted": 88652, "frontend_question_id": 1092, "is_new_question": false }, @@ -27178,8 +27500,8 @@ "question__title": "Largest Values From Labels", "question__title_slug": "largest-values-from-labels", "question__hide": false, - "total_acs": 28598, - "total_submitted": 47132, + "total_acs": 28807, + "total_submitted": 47508, "frontend_question_id": 1090, "is_new_question": false }, @@ -27201,8 +27523,8 @@ "question__title": "Duplicate Zeros", "question__title_slug": "duplicate-zeros", "question__hide": false, - "total_acs": 279203, - "total_submitted": 544624, + "total_acs": 282465, + "total_submitted": 550853, "frontend_question_id": 1089, "is_new_question": false }, @@ -27224,8 +27546,8 @@ "question__title": "Minimum Time to Build Blocks", "question__title_slug": "minimum-time-to-build-blocks", "question__hide": false, - "total_acs": 3446, - "total_submitted": 8505, + "total_acs": 3458, + "total_submitted": 8532, "frontend_question_id": 1199, "is_new_question": false }, @@ -27247,8 +27569,8 @@ "question__title": "Toss Strange Coins", "question__title_slug": "toss-strange-coins", "question__hide": false, - "total_acs": 10513, - "total_submitted": 19892, + "total_acs": 10620, + "total_submitted": 20058, "frontend_question_id": 1230, "is_new_question": false }, @@ -27270,8 +27592,8 @@ "question__title": "Meeting Scheduler", "question__title_slug": "meeting-scheduler", "question__hide": false, - "total_acs": 54623, - "total_submitted": 99630, + "total_acs": 58615, + "total_submitted": 105963, "frontend_question_id": 1229, "is_new_question": false }, @@ -27293,8 +27615,8 @@ "question__title": "Missing Number In Arithmetic Progression", "question__title_slug": "missing-number-in-arithmetic-progression", "question__hide": false, - "total_acs": 21144, - "total_submitted": 41297, + "total_acs": 21282, + "total_submitted": 41569, "frontend_question_id": 1228, "is_new_question": false }, @@ -27316,8 +27638,8 @@ "question__title": "Project Employees III", "question__title_slug": "project-employees-iii", "question__hide": false, - "total_acs": 36766, - "total_submitted": 46855, + "total_acs": 37324, + "total_submitted": 47528, "frontend_question_id": 1077, "is_new_question": false }, @@ -27339,8 +27661,8 @@ "question__title": "Project Employees II", "question__title_slug": "project-employees-ii", "question__hide": false, - "total_acs": 41377, - "total_submitted": 80872, + "total_acs": 41852, + "total_submitted": 81799, "frontend_question_id": 1076, "is_new_question": false }, @@ -27362,8 +27684,8 @@ "question__title": "Project Employees I", "question__title_slug": "project-employees-i", "question__hide": false, - "total_acs": 38921, - "total_submitted": 58024, + "total_acs": 39307, + "total_submitted": 58580, "frontend_question_id": 1075, "is_new_question": false }, @@ -27385,8 +27707,8 @@ "question__title": "Letter Tile Possibilities", "question__title_slug": "letter-tile-possibilities", "question__hide": false, - "total_acs": 70381, - "total_submitted": 92356, + "total_acs": 71033, + "total_submitted": 93262, "frontend_question_id": 1079, "is_new_question": false }, @@ -27408,8 +27730,8 @@ "question__title": "Smallest Subsequence of Distinct Characters", "question__title_slug": "smallest-subsequence-of-distinct-characters", "question__hide": false, - "total_acs": 40274, - "total_submitted": 70644, + "total_acs": 40717, + "total_submitted": 71360, "frontend_question_id": 1081, "is_new_question": false }, @@ -27431,8 +27753,8 @@ "question__title": "Insufficient Nodes in Root to Leaf Paths", "question__title_slug": "insufficient-nodes-in-root-to-leaf-paths", "question__hide": false, - "total_acs": 26366, - "total_submitted": 50518, + "total_acs": 26628, + "total_submitted": 50995, "frontend_question_id": 1080, "is_new_question": false }, @@ -27454,8 +27776,8 @@ "question__title": "Occurrences After Bigram", "question__title_slug": "occurrences-after-bigram", "question__hide": false, - "total_acs": 53063, - "total_submitted": 82776, + "total_acs": 53477, + "total_submitted": 83416, "frontend_question_id": 1078, "is_new_question": false }, @@ -27477,8 +27799,8 @@ "question__title": "Product Sales Analysis III", "question__title_slug": "product-sales-analysis-iii", "question__hide": false, - "total_acs": 31660, - "total_submitted": 63983, + "total_acs": 31998, + "total_submitted": 64706, "frontend_question_id": 1070, "is_new_question": false }, @@ -27500,8 +27822,8 @@ "question__title": "Product Sales Analysis II", "question__title_slug": "product-sales-analysis-ii", "question__hide": false, - "total_acs": 40727, - "total_submitted": 49498, + "total_acs": 41066, + "total_submitted": 49933, "frontend_question_id": 1069, "is_new_question": false }, @@ -27523,8 +27845,8 @@ "question__title": "Product Sales Analysis I", "question__title_slug": "product-sales-analysis-i", "question__hide": false, - "total_acs": 50184, - "total_submitted": 62094, + "total_acs": 50670, + "total_submitted": 62730, "frontend_question_id": 1068, "is_new_question": false }, @@ -27546,8 +27868,8 @@ "question__title": "Maximum Number of Ones", "question__title_slug": "maximum-number-of-ones", "question__hide": false, - "total_acs": 2223, - "total_submitted": 3672, + "total_acs": 2236, + "total_submitted": 3688, "frontend_question_id": 1183, "is_new_question": false }, @@ -27569,8 +27891,8 @@ "question__title": "Stepping Numbers", "question__title_slug": "stepping-numbers", "question__hide": false, - "total_acs": 7639, - "total_submitted": 16766, + "total_acs": 7674, + "total_submitted": 16833, "frontend_question_id": 1215, "is_new_question": false }, @@ -27592,8 +27914,8 @@ "question__title": "Two Sum BSTs", "question__title_slug": "two-sum-bsts", "question__hide": false, - "total_acs": 34026, - "total_submitted": 51197, + "total_acs": 34276, + "total_submitted": 51587, "frontend_question_id": 1214, "is_new_question": false }, @@ -27615,8 +27937,8 @@ "question__title": "Intersection of Three Sorted Arrays", "question__title_slug": "intersection-of-three-sorted-arrays", "question__hide": false, - "total_acs": 67993, - "total_submitted": 85012, + "total_acs": 68506, + "total_submitted": 85660, "frontend_question_id": 1213, "is_new_question": false }, @@ -27638,8 +27960,8 @@ "question__title": "Adding Two Negabinary Numbers", "question__title_slug": "adding-two-negabinary-numbers", "question__hide": false, - "total_acs": 12429, - "total_submitted": 34448, + "total_acs": 12578, + "total_submitted": 34756, "frontend_question_id": 1073, "is_new_question": false }, @@ -27661,8 +27983,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": 17124, - "total_submitted": 27089, + "total_acs": 17255, + "total_submitted": 27276, "frontend_question_id": 1072, "is_new_question": false }, @@ -27684,8 +28006,8 @@ "question__title": "Greatest Common Divisor of Strings", "question__title_slug": "greatest-common-divisor-of-strings", "question__hide": false, - "total_acs": 74481, - "total_submitted": 145383, + "total_acs": 75202, + "total_submitted": 146784, "frontend_question_id": 1071, "is_new_question": false }, @@ -27707,8 +28029,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": 49111, - "total_submitted": 73990, + "total_acs": 49412, + "total_submitted": 74448, "frontend_question_id": 1074, "is_new_question": false }, @@ -27730,8 +28052,8 @@ "question__title": "Optimize Water Distribution in a Village", "question__title_slug": "optimize-water-distribution-in-a-village", "question__hide": false, - "total_acs": 32145, - "total_submitted": 50112, + "total_acs": 32586, + "total_submitted": 50755, "frontend_question_id": 1168, "is_new_question": false }, @@ -27753,8 +28075,8 @@ "question__title": "Find Smallest Common Element in All Rows", "question__title_slug": "find-smallest-common-element-in-all-rows", "question__hide": false, - "total_acs": 28403, - "total_submitted": 37327, + "total_acs": 28580, + "total_submitted": 37572, "frontend_question_id": 1198, "is_new_question": false }, @@ -27776,8 +28098,8 @@ "question__title": "Minimum Knight Moves", "question__title_slug": "minimum-knight-moves", "question__hide": false, - "total_acs": 118484, - "total_submitted": 296931, + "total_acs": 119684, + "total_submitted": 299673, "frontend_question_id": 1197, "is_new_question": false }, @@ -27799,8 +28121,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": 19736, - "total_submitted": 29312, + "total_acs": 19866, + "total_submitted": 29546, "frontend_question_id": 1196, "is_new_question": false }, @@ -27822,8 +28144,8 @@ "question__title": "Distant Barcodes", "question__title_slug": "distant-barcodes", "question__hide": false, - "total_acs": 30661, - "total_submitted": 67750, + "total_acs": 30937, + "total_submitted": 68302, "frontend_question_id": 1054, "is_new_question": false }, @@ -27845,8 +28167,8 @@ "question__title": "Previous Permutation With One Swap", "question__title_slug": "previous-permutation-with-one-swap", "question__hide": false, - "total_acs": 31733, - "total_submitted": 61741, + "total_acs": 31960, + "total_submitted": 62297, "frontend_question_id": 1053, "is_new_question": false }, @@ -27868,8 +28190,8 @@ "question__title": "Grumpy Bookstore Owner", "question__title_slug": "grumpy-bookstore-owner", "question__hide": false, - "total_acs": 54197, - "total_submitted": 95503, + "total_acs": 54642, + "total_submitted": 96213, "frontend_question_id": 1052, "is_new_question": false }, @@ -27891,8 +28213,8 @@ "question__title": "Height Checker", "question__title_slug": "height-checker", "question__hide": false, - "total_acs": 207264, - "total_submitted": 278104, + "total_acs": 209624, + "total_submitted": 281135, "frontend_question_id": 1051, "is_new_question": false }, @@ -27914,8 +28236,8 @@ "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": 55356, - "total_submitted": 76035, + "total_acs": 57776, + "total_submitted": 79301, "frontend_question_id": 1050, "is_new_question": false }, @@ -27937,8 +28259,8 @@ "question__title": "Customers Who Bought All Products", "question__title_slug": "customers-who-bought-all-products", "question__hide": false, - "total_acs": 38623, - "total_submitted": 57216, + "total_acs": 39262, + "total_submitted": 58213, "frontend_question_id": 1045, "is_new_question": false }, @@ -27960,8 +28282,8 @@ "question__title": "Shortest Distance to Target Color", "question__title_slug": "shortest-distance-to-target-color", "question__hide": false, - "total_acs": 24564, - "total_submitted": 45321, + "total_acs": 24885, + "total_submitted": 45981, "frontend_question_id": 1182, "is_new_question": false }, @@ -27983,8 +28305,8 @@ "question__title": "Last Substring in Lexicographical Order", "question__title_slug": "last-substring-in-lexicographical-order", "question__hide": false, - "total_acs": 29776, - "total_submitted": 83922, + "total_acs": 29867, + "total_submitted": 84272, "frontend_question_id": 1163, "is_new_question": false }, @@ -28006,8 +28328,8 @@ "question__title": "Before and After Puzzle", "question__title_slug": "before-and-after-puzzle", "question__hide": false, - "total_acs": 8977, - "total_submitted": 19950, + "total_acs": 8989, + "total_submitted": 19966, "frontend_question_id": 1181, "is_new_question": false }, @@ -28029,8 +28351,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": 21073, - "total_submitted": 26740, + "total_acs": 21202, + "total_submitted": 26892, "frontend_question_id": 1180, "is_new_question": false }, @@ -28052,8 +28374,8 @@ "question__title": "Last Stone Weight II", "question__title_slug": "last-stone-weight-ii", "question__hide": false, - "total_acs": 55601, - "total_submitted": 108002, + "total_acs": 56332, + "total_submitted": 109202, "frontend_question_id": 1049, "is_new_question": false }, @@ -28075,8 +28397,8 @@ "question__title": "Longest String Chain", "question__title_slug": "longest-string-chain", "question__hide": false, - "total_acs": 255501, - "total_submitted": 430542, + "total_acs": 259521, + "total_submitted": 437435, "frontend_question_id": 1048, "is_new_question": false }, @@ -28098,8 +28420,8 @@ "question__title": "Remove All Adjacent Duplicates In String", "question__title_slug": "remove-all-adjacent-duplicates-in-string", "question__hide": false, - "total_acs": 298757, - "total_submitted": 421276, + "total_acs": 301864, + "total_submitted": 425868, "frontend_question_id": 1047, "is_new_question": false }, @@ -28121,8 +28443,8 @@ "question__title": "Last Stone Weight", "question__title_slug": "last-stone-weight", "question__hide": false, - "total_acs": 294044, - "total_submitted": 456531, + "total_acs": 297908, + "total_submitted": 462557, "frontend_question_id": 1046, "is_new_question": false }, @@ -28144,8 +28466,8 @@ "question__title": "Minimum Cost to Connect Sticks", "question__title_slug": "minimum-cost-to-connect-sticks", "question__hide": false, - "total_acs": 88913, - "total_submitted": 131997, + "total_acs": 89546, + "total_submitted": 132925, "frontend_question_id": 1167, "is_new_question": false }, @@ -28167,8 +28489,8 @@ "question__title": "Design File System", "question__title_slug": "design-file-system", "question__hide": false, - "total_acs": 29053, - "total_submitted": 47030, + "total_acs": 29829, + "total_submitted": 48191, "frontend_question_id": 1166, "is_new_question": false }, @@ -28190,8 +28512,8 @@ "question__title": "String Transforms Into Another String", "question__title_slug": "string-transforms-into-another-string", "question__hide": false, - "total_acs": 48265, - "total_submitted": 136267, + "total_acs": 48426, + "total_submitted": 136772, "frontend_question_id": 1153, "is_new_question": false }, @@ -28213,8 +28535,8 @@ "question__title": "Single-Row Keyboard", "question__title_slug": "single-row-keyboard", "question__hide": false, - "total_acs": 60017, - "total_submitted": 70032, + "total_acs": 60341, + "total_submitted": 70415, "frontend_question_id": 1165, "is_new_question": false }, @@ -28236,8 +28558,8 @@ "question__title": "Longest Duplicate Substring", "question__title_slug": "longest-duplicate-substring", "question__hide": false, - "total_acs": 54271, - "total_submitted": 175190, + "total_acs": 54595, + "total_submitted": 176508, "frontend_question_id": 1044, "is_new_question": false }, @@ -28259,8 +28581,8 @@ "question__title": "Partition Array for Maximum Sum", "question__title_slug": "partition-array-for-maximum-sum", "question__hide": false, - "total_acs": 50838, - "total_submitted": 72048, + "total_acs": 51821, + "total_submitted": 73319, "frontend_question_id": 1043, "is_new_question": false }, @@ -28282,8 +28604,8 @@ "question__title": "Flower Planting With No Adjacent", "question__title_slug": "flower-planting-with-no-adjacent", "question__hide": false, - "total_acs": 56599, - "total_submitted": 113179, + "total_acs": 57022, + "total_submitted": 113973, "frontend_question_id": 1042, "is_new_question": false }, @@ -28305,8 +28627,8 @@ "question__title": "Robot Bounded In Circle", "question__title_slug": "robot-bounded-in-circle", "question__hide": false, - "total_acs": 188692, - "total_submitted": 340643, + "total_acs": 190049, + "total_submitted": 343090, "frontend_question_id": 1041, "is_new_question": false }, @@ -28328,8 +28650,8 @@ "question__title": "Divide Array Into Increasing Sequences", "question__title_slug": "divide-array-into-increasing-sequences", "question__hide": false, - "total_acs": 3956, - "total_submitted": 6606, + "total_acs": 3978, + "total_submitted": 6639, "frontend_question_id": 1121, "is_new_question": false }, @@ -28351,8 +28673,8 @@ "question__title": "As Far from Land as Possible", "question__title_slug": "as-far-from-land-as-possible", "question__hide": false, - "total_acs": 64798, - "total_submitted": 134636, + "total_acs": 66376, + "total_submitted": 137792, "frontend_question_id": 1162, "is_new_question": false }, @@ -28374,8 +28696,8 @@ "question__title": "Maximum Level Sum of a Binary Tree", "question__title_slug": "maximum-level-sum-of-a-binary-tree", "question__hide": false, - "total_acs": 106810, - "total_submitted": 160770, + "total_acs": 107733, + "total_submitted": 162224, "frontend_question_id": 1161, "is_new_question": false }, @@ -28397,8 +28719,8 @@ "question__title": "Valid Boomerang", "question__title_slug": "valid-boomerang", "question__hide": false, - "total_acs": 32430, - "total_submitted": 86421, + "total_acs": 32753, + "total_submitted": 87241, "frontend_question_id": 1037, "is_new_question": false }, @@ -28420,8 +28742,8 @@ "question__title": "Binary Search Tree to Greater Sum Tree", "question__title_slug": "binary-search-tree-to-greater-sum-tree", "question__hide": false, - "total_acs": 124202, - "total_submitted": 146299, + "total_acs": 125477, + "total_submitted": 147737, "frontend_question_id": 1038, "is_new_question": false }, @@ -28443,8 +28765,8 @@ "question__title": "Moving Stones Until Consecutive II", "question__title_slug": "moving-stones-until-consecutive-ii", "question__hide": false, - "total_acs": 7823, - "total_submitted": 14069, + "total_acs": 7842, + "total_submitted": 14115, "frontend_question_id": 1040, "is_new_question": false }, @@ -28466,8 +28788,8 @@ "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": 118763, - "total_submitted": 175413, + "total_acs": 119963, + "total_submitted": 177147, "frontend_question_id": 1160, "is_new_question": false }, @@ -28489,8 +28811,8 @@ "question__title": "Minimum Score Triangulation of Polygon", "question__title_slug": "minimum-score-triangulation-of-polygon", "question__hide": false, - "total_acs": 23168, - "total_submitted": 43939, + "total_acs": 23605, + "total_submitted": 44550, "frontend_question_id": 1039, "is_new_question": false }, @@ -28512,8 +28834,8 @@ "question__title": "Analyze User Website Visit Pattern", "question__title_slug": "analyze-user-website-visit-pattern", "question__hide": false, - "total_acs": 66549, - "total_submitted": 153805, + "total_acs": 68189, + "total_submitted": 156913, "frontend_question_id": 1152, "is_new_question": false }, @@ -28535,8 +28857,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": 45876, - "total_submitted": 75734, + "total_acs": 46883, + "total_submitted": 77336, "frontend_question_id": 1151, "is_new_question": false }, @@ -28558,8 +28880,8 @@ "question__title": "Escape a Large Maze", "question__title_slug": "escape-a-large-maze", "question__hide": false, - "total_acs": 16062, - "total_submitted": 46813, + "total_acs": 16159, + "total_submitted": 47113, "frontend_question_id": 1036, "is_new_question": false }, @@ -28581,8 +28903,8 @@ "question__title": "Uncrossed Lines", "question__title_slug": "uncrossed-lines", "question__hide": false, - "total_acs": 69144, - "total_submitted": 118857, + "total_acs": 69600, + "total_submitted": 119531, "frontend_question_id": 1035, "is_new_question": false }, @@ -28604,8 +28926,8 @@ "question__title": "Coloring A Border", "question__title_slug": "coloring-a-border", "question__hide": false, - "total_acs": 23750, - "total_submitted": 48867, + "total_acs": 24161, + "total_submitted": 49620, "frontend_question_id": 1034, "is_new_question": false }, @@ -28627,8 +28949,8 @@ "question__title": "Moving Stones Until Consecutive", "question__title_slug": "moving-stones-until-consecutive", "question__hide": false, - "total_acs": 19864, - "total_submitted": 43993, + "total_acs": 19937, + "total_submitted": 44120, "frontend_question_id": 1033, "is_new_question": false }, @@ -28650,8 +28972,8 @@ "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": 33181, - "total_submitted": 58501, + "total_acs": 33457, + "total_submitted": 58999, "frontend_question_id": 1150, "is_new_question": false }, @@ -28673,8 +28995,8 @@ "question__title": "Parallel Courses", "question__title_slug": "parallel-courses", "question__hide": false, - "total_acs": 43706, - "total_submitted": 70632, + "total_acs": 44292, + "total_submitted": 71547, "frontend_question_id": 1136, "is_new_question": false }, @@ -28696,8 +29018,8 @@ "question__title": "Connecting Cities With Minimum Cost", "question__title_slug": "connecting-cities-with-minimum-cost", "question__hide": false, - "total_acs": 57950, - "total_submitted": 95305, + "total_acs": 58375, + "total_submitted": 95923, "frontend_question_id": 1135, "is_new_question": false }, @@ -28719,8 +29041,8 @@ "question__title": "Path With Maximum Minimum Value", "question__title_slug": "path-with-maximum-minimum-value", "question__hide": false, - "total_acs": 48568, - "total_submitted": 91489, + "total_acs": 48985, + "total_submitted": 92193, "frontend_question_id": 1102, "is_new_question": false }, @@ -28742,8 +29064,8 @@ "question__title": "Largest Unique Number", "question__title_slug": "largest-unique-number", "question__hide": false, - "total_acs": 29720, - "total_submitted": 44078, + "total_acs": 29835, + "total_submitted": 44238, "frontend_question_id": 1133, "is_new_question": false }, @@ -28765,8 +29087,8 @@ "question__title": "Stream of Characters", "question__title_slug": "stream-of-characters", "question__hide": false, - "total_acs": 75587, - "total_submitted": 147226, + "total_acs": 75931, + "total_submitted": 147810, "frontend_question_id": 1032, "is_new_question": false }, @@ -28788,8 +29110,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": 51059, - "total_submitted": 86175, + "total_acs": 51609, + "total_submitted": 87062, "frontend_question_id": 1031, "is_new_question": false }, @@ -28811,8 +29133,8 @@ "question__title": "Two City Scheduling", "question__title_slug": "two-city-scheduling", "question__hide": false, - "total_acs": 181045, - "total_submitted": 283919, + "total_acs": 181944, + "total_submitted": 285195, "frontend_question_id": 1029, "is_new_question": false }, @@ -28834,8 +29156,8 @@ "question__title": "Matrix Cells in Distance Order", "question__title_slug": "matrix-cells-in-distance-order", "question__hide": false, - "total_acs": 43004, - "total_submitted": 62194, + "total_acs": 43325, + "total_submitted": 62608, "frontend_question_id": 1030, "is_new_question": false }, @@ -28857,8 +29179,8 @@ "question__title": "Recover a Tree From Preorder Traversal", "question__title_slug": "recover-a-tree-from-preorder-traversal", "question__hide": false, - "total_acs": 35783, - "total_submitted": 49289, + "total_acs": 36094, + "total_submitted": 49679, "frontend_question_id": 1028, "is_new_question": false }, @@ -28880,8 +29202,8 @@ "question__title": "Maximum Difference Between Node and Ancestor", "question__title_slug": "maximum-difference-between-node-and-ancestor", "question__hide": false, - "total_acs": 132922, - "total_submitted": 181396, + "total_acs": 133707, + "total_submitted": 182416, "frontend_question_id": 1026, "is_new_question": false }, @@ -28903,8 +29225,8 @@ "question__title": "Maximum Average Subtree", "question__title_slug": "maximum-average-subtree", "question__hide": false, - "total_acs": 55367, - "total_submitted": 84812, + "total_acs": 55628, + "total_submitted": 85170, "frontend_question_id": 1120, "is_new_question": false }, @@ -28926,8 +29248,8 @@ "question__title": "Armstrong Number", "question__title_slug": "armstrong-number", "question__hide": false, - "total_acs": 28511, - "total_submitted": 36448, + "total_acs": 28655, + "total_submitted": 36622, "frontend_question_id": 1134, "is_new_question": false }, @@ -28949,8 +29271,8 @@ "question__title": "Remove Vowels from a String", "question__title_slug": "remove-vowels-from-a-string", "question__hide": false, - "total_acs": 84093, - "total_submitted": 92669, + "total_acs": 84525, + "total_submitted": 93133, "frontend_question_id": 1119, "is_new_question": false }, @@ -28972,8 +29294,8 @@ "question__title": "Number of Days in a Month", "question__title_slug": "number-of-days-in-a-month", "question__hide": false, - "total_acs": 6538, - "total_submitted": 11551, + "total_acs": 6567, + "total_submitted": 11616, "frontend_question_id": 1118, "is_new_question": false }, @@ -28995,8 +29317,8 @@ "question__title": "Longest Arithmetic Subsequence", "question__title_slug": "longest-arithmetic-subsequence", "question__hide": false, - "total_acs": 87626, - "total_submitted": 182633, + "total_acs": 88478, + "total_submitted": 184610, "frontend_question_id": 1027, "is_new_question": false }, @@ -29018,8 +29340,8 @@ "question__title": "Divisor Game", "question__title_slug": "divisor-game", "question__hide": false, - "total_acs": 159568, - "total_submitted": 239164, + "total_acs": 161411, + "total_submitted": 241827, "frontend_question_id": 1025, "is_new_question": false }, @@ -29041,8 +29363,8 @@ "question__title": "The Earliest Moment When Everyone Become Friends", "question__title_slug": "the-earliest-moment-when-everyone-become-friends", "question__hide": false, - "total_acs": 38116, - "total_submitted": 59229, + "total_acs": 39181, + "total_submitted": 60955, "frontend_question_id": 1101, "is_new_question": false }, @@ -29064,8 +29386,8 @@ "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": 30550, - "total_submitted": 40886, + "total_acs": 30788, + "total_submitted": 41205, "frontend_question_id": 1100, "is_new_question": false }, @@ -29087,8 +29409,8 @@ "question__title": "Two Sum Less Than K", "question__title_slug": "two-sum-less-than-k", "question__hide": false, - "total_acs": 92857, - "total_submitted": 153410, + "total_acs": 93576, + "total_submitted": 154637, "frontend_question_id": 1099, "is_new_question": false }, @@ -29110,8 +29432,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": 20297, - "total_submitted": 26804, + "total_acs": 20404, + "total_submitted": 26930, "frontend_question_id": 1085, "is_new_question": false }, @@ -29133,8 +29455,8 @@ "question__title": "Video Stitching", "question__title_slug": "video-stitching", "question__hide": false, - "total_acs": 48189, - "total_submitted": 96218, + "total_acs": 48696, + "total_submitted": 97153, "frontend_question_id": 1024, "is_new_question": false }, @@ -29156,8 +29478,8 @@ "question__title": "Camelcase Matching", "question__title_slug": "camelcase-matching", "question__hide": false, - "total_acs": 32601, - "total_submitted": 54752, + "total_acs": 32902, + "total_submitted": 55181, "frontend_question_id": 1023, "is_new_question": false }, @@ -29179,8 +29501,8 @@ "question__title": "Sum of Root To Leaf Binary Numbers", "question__title_slug": "sum-of-root-to-leaf-binary-numbers", "question__hide": false, - "total_acs": 165517, - "total_submitted": 224148, + "total_acs": 166743, + "total_submitted": 225778, "frontend_question_id": 1022, "is_new_question": false }, @@ -29202,8 +29524,8 @@ "question__title": "Remove Outermost Parentheses", "question__title_slug": "remove-outermost-parentheses", "question__hide": false, - "total_acs": 176211, - "total_submitted": 220458, + "total_acs": 177522, + "total_submitted": 222008, "frontend_question_id": 1021, "is_new_question": false }, @@ -29225,8 +29547,8 @@ "question__title": "Confusing Number II", "question__title_slug": "confusing-number-ii", "question__hide": false, - "total_acs": 30230, - "total_submitted": 65002, + "total_acs": 30540, + "total_submitted": 65672, "frontend_question_id": 1088, "is_new_question": false }, @@ -29248,8 +29570,8 @@ "question__title": "Brace Expansion", "question__title_slug": "brace-expansion", "question__hide": false, - "total_acs": 43776, - "total_submitted": 66368, + "total_acs": 44043, + "total_submitted": 66752, "frontend_question_id": 1087, "is_new_question": false }, @@ -29271,8 +29593,8 @@ "question__title": "Index Pairs of a String", "question__title_slug": "index-pairs-of-a-string", "question__hide": false, - "total_acs": 17645, - "total_submitted": 28177, + "total_acs": 17796, + "total_submitted": 28404, "frontend_question_id": 1065, "is_new_question": false }, @@ -29294,8 +29616,8 @@ "question__title": "High Five", "question__title_slug": "high-five", "question__hide": false, - "total_acs": 84400, - "total_submitted": 111952, + "total_acs": 84881, + "total_submitted": 112596, "frontend_question_id": 1086, "is_new_question": false }, @@ -29317,8 +29639,8 @@ "question__title": "Number of Enclaves", "question__title_slug": "number-of-enclaves", "question__hide": false, - "total_acs": 59951, - "total_submitted": 94481, + "total_acs": 61719, + "total_submitted": 97034, "frontend_question_id": 1020, "is_new_question": false }, @@ -29340,8 +29662,8 @@ "question__title": "Next Greater Node In Linked List", "question__title_slug": "next-greater-node-in-linked-list", "question__hide": false, - "total_acs": 105306, - "total_submitted": 176400, + "total_acs": 106336, + "total_submitted": 178150, "frontend_question_id": 1019, "is_new_question": false }, @@ -29363,8 +29685,8 @@ "question__title": "Binary Prefix Divisible By 5", "question__title_slug": "binary-prefix-divisible-by-5", "question__hide": false, - "total_acs": 39709, - "total_submitted": 83569, + "total_acs": 39967, + "total_submitted": 84082, "frontend_question_id": 1018, "is_new_question": false }, @@ -29386,8 +29708,8 @@ "question__title": "Convert to Base -2", "question__title_slug": "convert-to-base-2", "question__hide": false, - "total_acs": 18940, - "total_submitted": 31312, + "total_acs": 19139, + "total_submitted": 31588, "frontend_question_id": 1017, "is_new_question": false }, @@ -29409,8 +29731,8 @@ "question__title": "Confusing Number", "question__title_slug": "confusing-number", "question__hide": false, - "total_acs": 25996, - "total_submitted": 56511, + "total_acs": 26196, + "total_submitted": 56954, "frontend_question_id": 1056, "is_new_question": false }, @@ -29432,8 +29754,8 @@ "question__title": "Digit Count in Range", "question__title_slug": "digit-count-in-range", "question__hide": false, - "total_acs": 2779, - "total_submitted": 6426, + "total_acs": 2815, + "total_submitted": 6482, "frontend_question_id": 1067, "is_new_question": false }, @@ -29455,8 +29777,8 @@ "question__title": "Campus Bikes II", "question__title_slug": "campus-bikes-ii", "question__hide": false, - "total_acs": 38783, - "total_submitted": 70944, + "total_acs": 38991, + "total_submitted": 71312, "frontend_question_id": 1066, "is_new_question": false }, @@ -29478,8 +29800,8 @@ "question__title": "Fixed Point", "question__title_slug": "fixed-point", "question__hide": false, - "total_acs": 35775, - "total_submitted": 56140, + "total_acs": 36005, + "total_submitted": 56514, "frontend_question_id": 1064, "is_new_question": false }, @@ -29501,8 +29823,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": 29411, - "total_submitted": 50824, + "total_acs": 29595, + "total_submitted": 51196, "frontend_question_id": 1016, "is_new_question": false }, @@ -29524,8 +29846,8 @@ "question__title": "Smallest Integer Divisible by K", "question__title_slug": "smallest-integer-divisible-by-k", "question__hide": false, - "total_acs": 55946, - "total_submitted": 118922, + "total_acs": 56088, + "total_submitted": 119238, "frontend_question_id": 1015, "is_new_question": false }, @@ -29547,8 +29869,8 @@ "question__title": "Best Sightseeing Pair", "question__title_slug": "best-sightseeing-pair", "question__hide": false, - "total_acs": 61110, - "total_submitted": 103670, + "total_acs": 62622, + "total_submitted": 106014, "frontend_question_id": 1014, "is_new_question": false }, @@ -29570,8 +29892,8 @@ "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": 65519, - "total_submitted": 148148, + "total_acs": 66227, + "total_submitted": 149956, "frontend_question_id": 1013, "is_new_question": false }, @@ -29593,8 +29915,8 @@ "question__title": "Number of Valid Subarrays", "question__title_slug": "number-of-valid-subarrays", "question__hide": false, - "total_acs": 6432, - "total_submitted": 8719, + "total_acs": 6500, + "total_submitted": 8802, "frontend_question_id": 1063, "is_new_question": false }, @@ -29616,8 +29938,8 @@ "question__title": "Longest Repeating Substring", "question__title_slug": "longest-repeating-substring", "question__hide": false, - "total_acs": 27730, - "total_submitted": 46910, + "total_acs": 28015, + "total_submitted": 47405, "frontend_question_id": 1062, "is_new_question": false }, @@ -29639,8 +29961,8 @@ "question__title": "Missing Element in Sorted Array", "question__title_slug": "missing-element-in-sorted-array", "question__hide": false, - "total_acs": 98870, - "total_submitted": 180412, + "total_acs": 99733, + "total_submitted": 182003, "frontend_question_id": 1060, "is_new_question": false }, @@ -29662,8 +29984,8 @@ "question__title": "Lexicographically Smallest Equivalent String", "question__title_slug": "lexicographically-smallest-equivalent-string", "question__hide": false, - "total_acs": 8508, - "total_submitted": 12237, + "total_acs": 8778, + "total_submitted": 12620, "frontend_question_id": 1061, "is_new_question": false }, @@ -29685,8 +30007,8 @@ "question__title": "Numbers With Repeated Digits", "question__title_slug": "numbers-with-repeated-digits", "question__hide": false, - "total_acs": 9282, - "total_submitted": 24177, + "total_acs": 9347, + "total_submitted": 24359, "frontend_question_id": 1012, "is_new_question": false }, @@ -29708,8 +30030,8 @@ "question__title": "Capacity To Ship Packages Within D Days", "question__title_slug": "capacity-to-ship-packages-within-d-days", "question__hide": false, - "total_acs": 154675, - "total_submitted": 242352, + "total_acs": 156895, + "total_submitted": 245639, "frontend_question_id": 1011, "is_new_question": false }, @@ -29727,12 +30049,12 @@ "question_id": 1055, "question__article__live": true, "question__article__slug": "pairs-of-songs-with-total-durations-divisible-by-60", - "question__article__has_video_solution": false, + "question__article__has_video_solution": true, "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": 197370, - "total_submitted": 368980, + "total_acs": 198841, + "total_submitted": 372213, "frontend_question_id": 1010, "is_new_question": false }, @@ -29754,8 +30076,8 @@ "question__title": "Complement of Base 10 Integer", "question__title_slug": "complement-of-base-10-integer", "question__hide": false, - "total_acs": 131231, - "total_submitted": 211039, + "total_acs": 132630, + "total_submitted": 213328, "frontend_question_id": 1009, "is_new_question": false }, @@ -29777,8 +30099,8 @@ "question__title": "Minimize Rounding Error to Meet Target", "question__title_slug": "minimize-rounding-error-to-meet-target", "question__hide": false, - "total_acs": 7627, - "total_submitted": 17023, + "total_acs": 7654, + "total_submitted": 17096, "frontend_question_id": 1058, "is_new_question": false }, @@ -29800,8 +30122,8 @@ "question__title": "Campus Bikes", "question__title_slug": "campus-bikes", "question__hide": false, - "total_acs": 61162, - "total_submitted": 105522, + "total_acs": 61380, + "total_submitted": 105958, "frontend_question_id": 1057, "is_new_question": false }, @@ -29823,8 +30145,8 @@ "question__title": "Shortest Way to Form String", "question__title_slug": "shortest-way-to-form-string", "question__hide": false, - "total_acs": 59328, - "total_submitted": 101624, + "total_acs": 60221, + "total_submitted": 103050, "frontend_question_id": 1055, "is_new_question": false }, @@ -29846,8 +30168,8 @@ "question__title": "Construct Binary Search Tree from Preorder Traversal", "question__title_slug": "construct-binary-search-tree-from-preorder-traversal", "question__hide": false, - "total_acs": 241288, - "total_submitted": 300115, + "total_acs": 244291, + "total_submitted": 303558, "frontend_question_id": 1008, "is_new_question": false }, @@ -29869,8 +30191,8 @@ "question__title": "Minimum Domino Rotations For Equal Row", "question__title_slug": "minimum-domino-rotations-for-equal-row", "question__hide": false, - "total_acs": 181216, - "total_submitted": 344756, + "total_acs": 181823, + "total_submitted": 345992, "frontend_question_id": 1007, "is_new_question": false }, @@ -29892,8 +30214,8 @@ "question__title": "Clumsy Factorial", "question__title_slug": "clumsy-factorial", "question__hide": false, - "total_acs": 20485, - "total_submitted": 37449, + "total_acs": 20610, + "total_submitted": 37680, "frontend_question_id": 1006, "is_new_question": false }, @@ -29915,8 +30237,8 @@ "question__title": "Maximize Sum Of Array After K Negations", "question__title_slug": "maximize-sum-of-array-after-k-negations", "question__hide": false, - "total_acs": 56223, - "total_submitted": 109616, + "total_acs": 56995, + "total_submitted": 111099, "frontend_question_id": 1005, "is_new_question": false }, @@ -29938,8 +30260,8 @@ "question__title": "Max Consecutive Ones III", "question__title_slug": "max-consecutive-ones-iii", "question__hide": false, - "total_acs": 216656, - "total_submitted": 343052, + "total_acs": 220039, + "total_submitted": 348027, "frontend_question_id": 1004, "is_new_question": false }, @@ -29961,8 +30283,8 @@ "question__title": "Check If Word Is Valid After Substitutions", "question__title_slug": "check-if-word-is-valid-after-substitutions", "question__hide": false, - "total_acs": 42273, - "total_submitted": 73000, + "total_acs": 42627, + "total_submitted": 73613, "frontend_question_id": 1003, "is_new_question": false }, @@ -29984,8 +30306,8 @@ "question__title": "Find Common Characters", "question__title_slug": "find-common-characters", "question__hide": false, - "total_acs": 147863, - "total_submitted": 216075, + "total_acs": 148930, + "total_submitted": 217713, "frontend_question_id": 1002, "is_new_question": false }, @@ -30007,8 +30329,8 @@ "question__title": "Grid Illumination", "question__title_slug": "grid-illumination", "question__hide": false, - "total_acs": 15712, - "total_submitted": 43429, + "total_acs": 15835, + "total_submitted": 43687, "frontend_question_id": 1001, "is_new_question": false }, @@ -30030,8 +30352,8 @@ "question__title": "Minimum Cost to Merge Stones", "question__title_slug": "minimum-cost-to-merge-stones", "question__hide": false, - "total_acs": 28747, - "total_submitted": 68259, + "total_acs": 29029, + "total_submitted": 68934, "frontend_question_id": 1000, "is_new_question": false }, @@ -30053,8 +30375,8 @@ "question__title": "Available Captures for Rook", "question__title_slug": "available-captures-for-rook", "question__hide": false, - "total_acs": 51065, - "total_submitted": 75511, + "total_acs": 51310, + "total_submitted": 75868, "frontend_question_id": 999, "is_new_question": false }, @@ -30076,8 +30398,8 @@ "question__title": "Maximum Binary Tree II", "question__title_slug": "maximum-binary-tree-ii", "question__hide": false, - "total_acs": 27129, - "total_submitted": 41239, + "total_acs": 27302, + "total_submitted": 41476, "frontend_question_id": 998, "is_new_question": false }, @@ -30099,8 +30421,8 @@ "question__title": "Find the Town Judge", "question__title_slug": "find-the-town-judge", "question__hide": false, - "total_acs": 283135, - "total_submitted": 569895, + "total_acs": 286035, + "total_submitted": 576075, "frontend_question_id": 997, "is_new_question": false }, @@ -30122,8 +30444,8 @@ "question__title": "Number of Squareful Arrays", "question__title_slug": "number-of-squareful-arrays", "question__hide": false, - "total_acs": 26067, - "total_submitted": 53123, + "total_acs": 26238, + "total_submitted": 53474, "frontend_question_id": 996, "is_new_question": false }, @@ -30145,8 +30467,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": 26563, - "total_submitted": 52103, + "total_acs": 26765, + "total_submitted": 52474, "frontend_question_id": 995, "is_new_question": false }, @@ -30168,8 +30490,8 @@ "question__title": "Rotting Oranges", "question__title_slug": "rotting-oranges", "question__hide": false, - "total_acs": 405062, - "total_submitted": 781129, + "total_acs": 413586, + "total_submitted": 796736, "frontend_question_id": 994, "is_new_question": false }, @@ -30191,8 +30513,8 @@ "question__title": "Cousins in Binary Tree", "question__title_slug": "cousins-in-binary-tree", "question__hide": false, - "total_acs": 211126, - "total_submitted": 391806, + "total_acs": 212505, + "total_submitted": 394271, "frontend_question_id": 993, "is_new_question": false }, @@ -30214,8 +30536,8 @@ "question__title": "Subarrays with K Different Integers", "question__title_slug": "subarrays-with-k-different-integers", "question__hide": false, - "total_acs": 71701, - "total_submitted": 133994, + "total_acs": 72528, + "total_submitted": 135489, "frontend_question_id": 992, "is_new_question": false }, @@ -30237,8 +30559,8 @@ "question__title": "Broken Calculator", "question__title_slug": "broken-calculator", "question__hide": false, - "total_acs": 87028, - "total_submitted": 160785, + "total_acs": 87367, + "total_submitted": 161410, "frontend_question_id": 991, "is_new_question": false }, @@ -30260,8 +30582,8 @@ "question__title": "Satisfiability of Equality Equations", "question__title_slug": "satisfiability-of-equality-equations", "question__hide": false, - "total_acs": 52713, - "total_submitted": 104855, + "total_acs": 53598, + "total_submitted": 106462, "frontend_question_id": 990, "is_new_question": false }, @@ -30283,8 +30605,8 @@ "question__title": "Add to Array-Form of Integer", "question__title_slug": "add-to-array-form-of-integer", "question__hide": false, - "total_acs": 115142, - "total_submitted": 252818, + "total_acs": 116659, + "total_submitted": 255950, "frontend_question_id": 989, "is_new_question": false }, @@ -30306,8 +30628,8 @@ "question__title": "Smallest String Starting From Leaf", "question__title_slug": "smallest-string-starting-from-leaf", "question__hide": false, - "total_acs": 54757, - "total_submitted": 111943, + "total_acs": 55333, + "total_submitted": 112875, "frontend_question_id": 988, "is_new_question": false }, @@ -30329,8 +30651,8 @@ "question__title": "Vertical Order Traversal of a Binary Tree", "question__title_slug": "vertical-order-traversal-of-a-binary-tree", "question__hide": false, - "total_acs": 230006, - "total_submitted": 550417, + "total_acs": 233174, + "total_submitted": 556993, "frontend_question_id": 987, "is_new_question": false }, @@ -30352,8 +30674,8 @@ "question__title": "Interval List Intersections", "question__title_slug": "interval-list-intersections", "question__hide": false, - "total_acs": 308300, - "total_submitted": 432701, + "total_acs": 310792, + "total_submitted": 436036, "frontend_question_id": 986, "is_new_question": false }, @@ -30375,8 +30697,8 @@ "question__title": "Sum of Even Numbers After Queries", "question__title_slug": "sum-of-even-numbers-after-queries", "question__hide": false, - "total_acs": 63715, - "total_submitted": 104369, + "total_acs": 63914, + "total_submitted": 104674, "frontend_question_id": 985, "is_new_question": false }, @@ -30398,8 +30720,8 @@ "question__title": "String Without AAA or BBB", "question__title_slug": "string-without-aaa-or-bbb", "question__hide": false, - "total_acs": 34753, - "total_submitted": 81643, + "total_acs": 35074, + "total_submitted": 82318, "frontend_question_id": 984, "is_new_question": false }, @@ -30421,8 +30743,8 @@ "question__title": "Minimum Cost For Tickets", "question__title_slug": "minimum-cost-for-tickets", "question__hide": false, - "total_acs": 158299, - "total_submitted": 246533, + "total_acs": 159827, + "total_submitted": 248915, "frontend_question_id": 983, "is_new_question": false }, @@ -30444,8 +30766,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": 12586, - "total_submitted": 21849, + "total_acs": 12660, + "total_submitted": 21969, "frontend_question_id": 982, "is_new_question": false }, @@ -30467,8 +30789,8 @@ "question__title": "Time Based Key-Value Store", "question__title_slug": "time-based-key-value-store", "question__hide": false, - "total_acs": 189077, - "total_submitted": 359509, + "total_acs": 192633, + "total_submitted": 366553, "frontend_question_id": 981, "is_new_question": false }, @@ -30490,8 +30812,8 @@ "question__title": "Unique Paths III", "question__title_slug": "unique-paths-iii", "question__hide": false, - "total_acs": 118382, - "total_submitted": 148886, + "total_acs": 119332, + "total_submitted": 150109, "frontend_question_id": 980, "is_new_question": false }, @@ -30513,8 +30835,8 @@ "question__title": "Distribute Coins in Binary Tree", "question__title_slug": "distribute-coins-in-binary-tree", "question__hide": false, - "total_acs": 88072, - "total_submitted": 122731, + "total_acs": 89032, + "total_submitted": 124001, "frontend_question_id": 979, "is_new_question": false }, @@ -30536,8 +30858,8 @@ "question__title": "Longest Turbulent Subarray", "question__title_slug": "longest-turbulent-subarray", "question__hide": false, - "total_acs": 72971, - "total_submitted": 153582, + "total_acs": 73427, + "total_submitted": 154497, "frontend_question_id": 978, "is_new_question": false }, @@ -30559,8 +30881,8 @@ "question__title": "Squares of a Sorted Array", "question__title_slug": "squares-of-a-sorted-array", "question__hide": false, - "total_acs": 1038500, - "total_submitted": 1448430, + "total_acs": 1055482, + "total_submitted": 1471891, "frontend_question_id": 977, "is_new_question": false }, @@ -30582,8 +30904,8 @@ "question__title": "Largest Perimeter Triangle", "question__title_slug": "largest-perimeter-triangle", "question__hide": false, - "total_acs": 90093, - "total_submitted": 166200, + "total_acs": 92538, + "total_submitted": 171808, "frontend_question_id": 976, "is_new_question": false }, @@ -30605,8 +30927,8 @@ "question__title": "Odd Even Jump", "question__title_slug": "odd-even-jump", "question__hide": false, - "total_acs": 61509, - "total_submitted": 158386, + "total_acs": 62223, + "total_submitted": 160583, "frontend_question_id": 975, "is_new_question": false }, @@ -30628,8 +30950,8 @@ "question__title": "Subarray Sums Divisible by K", "question__title_slug": "subarray-sums-divisible-by-k", "question__hide": false, - "total_acs": 101085, - "total_submitted": 190092, + "total_acs": 102624, + "total_submitted": 192989, "frontend_question_id": 974, "is_new_question": false }, @@ -30651,8 +30973,8 @@ "question__title": "K Closest Points to Origin", "question__title_slug": "k-closest-points-to-origin", "question__hide": false, - "total_acs": 784930, - "total_submitted": 1190441, + "total_acs": 795729, + "total_submitted": 1206524, "frontend_question_id": 973, "is_new_question": false }, @@ -30674,8 +30996,8 @@ "question__title": "Fibonacci Number", "question__title_slug": "fibonacci-number", "question__hide": false, - "total_acs": 808713, - "total_submitted": 1184685, + "total_acs": 826510, + "total_submitted": 1210110, "frontend_question_id": 509, "is_new_question": false }, @@ -30697,8 +31019,8 @@ "question__title": "Equal Rational Numbers", "question__title_slug": "equal-rational-numbers", "question__hide": false, - "total_acs": 5507, - "total_submitted": 12896, + "total_acs": 5543, + "total_submitted": 12951, "frontend_question_id": 972, "is_new_question": false }, @@ -30720,8 +31042,8 @@ "question__title": "Flip Binary Tree To Match Preorder Traversal", "question__title_slug": "flip-binary-tree-to-match-preorder-traversal", "question__hide": false, - "total_acs": 35503, - "total_submitted": 71182, + "total_acs": 35649, + "total_submitted": 71485, "frontend_question_id": 971, "is_new_question": false }, @@ -30743,8 +31065,8 @@ "question__title": "Powerful Integers", "question__title_slug": "powerful-integers", "question__hide": false, - "total_acs": 46805, - "total_submitted": 107391, + "total_acs": 46940, + "total_submitted": 107738, "frontend_question_id": 970, "is_new_question": false }, @@ -30766,8 +31088,8 @@ "question__title": "Pancake Sorting", "question__title_slug": "pancake-sorting", "question__hide": false, - "total_acs": 75087, - "total_submitted": 107613, + "total_acs": 75498, + "total_submitted": 108144, "frontend_question_id": 969, "is_new_question": false }, @@ -30789,8 +31111,8 @@ "question__title": "Binary Tree Cameras", "question__title_slug": "binary-tree-cameras", "question__hide": false, - "total_acs": 100414, - "total_submitted": 215520, + "total_acs": 104466, + "total_submitted": 223225, "frontend_question_id": 968, "is_new_question": false }, @@ -30812,8 +31134,8 @@ "question__title": "Numbers With Same Consecutive Differences", "question__title_slug": "numbers-with-same-consecutive-differences", "question__hide": false, - "total_acs": 50956, - "total_submitted": 107190, + "total_acs": 51163, + "total_submitted": 107521, "frontend_question_id": 967, "is_new_question": false }, @@ -30835,8 +31157,8 @@ "question__title": "Vowel Spellchecker", "question__title_slug": "vowel-spellchecker", "question__hide": false, - "total_acs": 36070, - "total_submitted": 69938, + "total_acs": 36181, + "total_submitted": 70191, "frontend_question_id": 966, "is_new_question": false }, @@ -30858,8 +31180,8 @@ "question__title": "Univalued Binary Tree", "question__title_slug": "univalued-binary-tree", "question__hide": false, - "total_acs": 163883, - "total_submitted": 237597, + "total_acs": 165225, + "total_submitted": 239467, "frontend_question_id": 965, "is_new_question": false }, @@ -30881,8 +31203,8 @@ "question__title": "Least Operators to Express Number", "question__title_slug": "least-operators-to-express-number", "question__hide": false, - "total_acs": 8076, - "total_submitted": 17020, + "total_acs": 8138, + "total_submitted": 17121, "frontend_question_id": 964, "is_new_question": false }, @@ -30904,8 +31226,8 @@ "question__title": "Minimum Area Rectangle II", "question__title_slug": "minimum-area-rectangle-ii", "question__hide": false, - "total_acs": 23442, - "total_submitted": 42910, + "total_acs": 23517, + "total_submitted": 43085, "frontend_question_id": 963, "is_new_question": false }, @@ -30927,8 +31249,8 @@ "question__title": "Maximum Width Ramp", "question__title_slug": "maximum-width-ramp", "question__hide": false, - "total_acs": 34083, - "total_submitted": 70414, + "total_acs": 34348, + "total_submitted": 70868, "frontend_question_id": 962, "is_new_question": false }, @@ -30950,8 +31272,8 @@ "question__title": "N-Repeated Element in Size 2N Array", "question__title_slug": "n-repeated-element-in-size-2n-array", "question__hide": false, - "total_acs": 179881, - "total_submitted": 238051, + "total_acs": 180755, + "total_submitted": 239167, "frontend_question_id": 961, "is_new_question": false }, @@ -30973,8 +31295,8 @@ "question__title": "Delete Columns to Make Sorted III", "question__title_slug": "delete-columns-to-make-sorted-iii", "question__hide": false, - "total_acs": 10546, - "total_submitted": 18604, + "total_acs": 10638, + "total_submitted": 18756, "frontend_question_id": 960, "is_new_question": false }, @@ -30996,8 +31318,8 @@ "question__title": "Regions Cut By Slashes", "question__title_slug": "regions-cut-by-slashes", "question__hide": false, - "total_acs": 37834, - "total_submitted": 55021, + "total_acs": 38279, + "total_submitted": 55610, "frontend_question_id": 959, "is_new_question": false }, @@ -31019,8 +31341,8 @@ "question__title": "Check Completeness of a Binary Tree", "question__title_slug": "check-completeness-of-a-binary-tree", "question__hide": false, - "total_acs": 118716, - "total_submitted": 221020, + "total_acs": 119488, + "total_submitted": 222454, "frontend_question_id": 958, "is_new_question": false }, @@ -31042,8 +31364,8 @@ "question__title": "Prison Cells After N Days", "question__title_slug": "prison-cells-after-n-days", "question__hide": false, - "total_acs": 143040, - "total_submitted": 363924, + "total_acs": 143559, + "total_submitted": 365247, "frontend_question_id": 957, "is_new_question": false }, @@ -31065,8 +31387,8 @@ "question__title": "Tallest Billboard", "question__title_slug": "tallest-billboard", "question__hide": false, - "total_acs": 13519, - "total_submitted": 33883, + "total_acs": 13640, + "total_submitted": 34171, "frontend_question_id": 956, "is_new_question": false }, @@ -31088,8 +31410,8 @@ "question__title": "Delete Columns to Make Sorted II", "question__title_slug": "delete-columns-to-make-sorted-ii", "question__hide": false, - "total_acs": 15700, - "total_submitted": 45758, + "total_acs": 15823, + "total_submitted": 46059, "frontend_question_id": 955, "is_new_question": false }, @@ -31111,8 +31433,8 @@ "question__title": "Array of Doubled Pairs", "question__title_slug": "array-of-doubled-pairs", "question__hide": false, - "total_acs": 72084, - "total_submitted": 186019, + "total_acs": 72476, + "total_submitted": 186948, "frontend_question_id": 954, "is_new_question": false }, @@ -31134,8 +31456,8 @@ "question__title": "Verifying an Alien Dictionary", "question__title_slug": "verifying-an-alien-dictionary", "question__hide": false, - "total_acs": 356075, - "total_submitted": 677594, + "total_acs": 357840, + "total_submitted": 680761, "frontend_question_id": 953, "is_new_question": false }, @@ -31157,8 +31479,8 @@ "question__title": "Largest Component Size by Common Factor", "question__title_slug": "largest-component-size-by-common-factor", "question__hide": false, - "total_acs": 44762, - "total_submitted": 111181, + "total_acs": 44946, + "total_submitted": 111652, "frontend_question_id": 952, "is_new_question": false }, @@ -31180,8 +31502,8 @@ "question__title": "Flip Equivalent Binary Trees", "question__title_slug": "flip-equivalent-binary-trees", "question__hide": false, - "total_acs": 112513, - "total_submitted": 168602, + "total_acs": 113512, + "total_submitted": 170048, "frontend_question_id": 951, "is_new_question": false }, @@ -31203,8 +31525,8 @@ "question__title": "Reveal Cards In Increasing Order", "question__title_slug": "reveal-cards-in-increasing-order", "question__hide": false, - "total_acs": 58571, - "total_submitted": 75826, + "total_acs": 58961, + "total_submitted": 76264, "frontend_question_id": 950, "is_new_question": false }, @@ -31226,8 +31548,8 @@ "question__title": "Largest Time for Given Digits", "question__title_slug": "largest-time-for-given-digits", "question__hide": false, - "total_acs": 72096, - "total_submitted": 203752, + "total_acs": 72412, + "total_submitted": 204656, "frontend_question_id": 949, "is_new_question": false }, @@ -31249,8 +31571,8 @@ "question__title": "Bag of Tokens", "question__title_slug": "bag-of-tokens", "question__hide": false, - "total_acs": 39996, - "total_submitted": 86434, + "total_acs": 40244, + "total_submitted": 86921, "frontend_question_id": 948, "is_new_question": false }, @@ -31272,8 +31594,8 @@ "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": 105310, - "total_submitted": 186729, + "total_acs": 106498, + "total_submitted": 188853, "frontend_question_id": 947, "is_new_question": false }, @@ -31295,8 +31617,8 @@ "question__title": "Validate Stack Sequences", "question__title_slug": "validate-stack-sequences", "question__hide": false, - "total_acs": 179920, - "total_submitted": 266131, + "total_acs": 180769, + "total_submitted": 267436, "frontend_question_id": 946, "is_new_question": false }, @@ -31318,8 +31640,8 @@ "question__title": "Minimum Increment to Make Array Unique", "question__title_slug": "minimum-increment-to-make-array-unique", "question__hide": false, - "total_acs": 54453, - "total_submitted": 110720, + "total_acs": 55173, + "total_submitted": 111969, "frontend_question_id": 945, "is_new_question": false }, @@ -31341,8 +31663,8 @@ "question__title": "Delete Columns to Make Sorted", "question__title_slug": "delete-columns-to-make-sorted", "question__hide": false, - "total_acs": 67927, - "total_submitted": 97172, + "total_acs": 68319, + "total_submitted": 97734, "frontend_question_id": 944, "is_new_question": false }, @@ -31364,8 +31686,8 @@ "question__title": "Find the Shortest Superstring", "question__title_slug": "find-the-shortest-superstring", "question__hide": false, - "total_acs": 23880, - "total_submitted": 52762, + "total_acs": 24010, + "total_submitted": 53053, "frontend_question_id": 943, "is_new_question": false }, @@ -31387,8 +31709,8 @@ "question__title": "DI String Match", "question__title_slug": "di-string-match", "question__hide": false, - "total_acs": 109368, - "total_submitted": 143799, + "total_acs": 110176, + "total_submitted": 144779, "frontend_question_id": 942, "is_new_question": false }, @@ -31410,8 +31732,8 @@ "question__title": "Valid Mountain Array", "question__title_slug": "valid-mountain-array", "question__hide": false, - "total_acs": 301303, - "total_submitted": 894530, + "total_acs": 303986, + "total_submitted": 902976, "frontend_question_id": 941, "is_new_question": false }, @@ -31433,8 +31755,8 @@ "question__title": "Distinct Subsequences II", "question__title_slug": "distinct-subsequences-ii", "question__hide": false, - "total_acs": 27734, - "total_submitted": 62569, + "total_acs": 28041, + "total_submitted": 63271, "frontend_question_id": 940, "is_new_question": false }, @@ -31456,8 +31778,8 @@ "question__title": "Minimum Area Rectangle", "question__title_slug": "minimum-area-rectangle", "question__hide": false, - "total_acs": 108291, - "total_submitted": 202279, + "total_acs": 109606, + "total_submitted": 204866, "frontend_question_id": 939, "is_new_question": false }, @@ -31479,8 +31801,8 @@ "question__title": "Range Sum of BST", "question__title_slug": "range-sum-of-bst", "question__hide": false, - "total_acs": 628404, - "total_submitted": 737894, + "total_acs": 633202, + "total_submitted": 743382, "frontend_question_id": 938, "is_new_question": false }, @@ -31502,8 +31824,8 @@ "question__title": "Reorder Data in Log Files", "question__title_slug": "reorder-data-in-log-files", "question__hide": false, - "total_acs": 304959, - "total_submitted": 543655, + "total_acs": 307325, + "total_submitted": 547690, "frontend_question_id": 937, "is_new_question": false }, @@ -31525,8 +31847,8 @@ "question__title": "Stamping The Sequence", "question__title_slug": "stamping-the-sequence", "question__hide": false, - "total_acs": 24278, - "total_submitted": 45213, + "total_acs": 24336, + "total_submitted": 45292, "frontend_question_id": 936, "is_new_question": false }, @@ -31548,8 +31870,8 @@ "question__title": "Knight Dialer", "question__title_slug": "knight-dialer", "question__hide": false, - "total_acs": 81428, - "total_submitted": 165348, + "total_acs": 82384, + "total_submitted": 167089, "frontend_question_id": 935, "is_new_question": false }, @@ -31571,8 +31893,8 @@ "question__title": "Shortest Bridge", "question__title_slug": "shortest-bridge", "question__hide": false, - "total_acs": 97281, - "total_submitted": 183246, + "total_acs": 99051, + "total_submitted": 186095, "frontend_question_id": 934, "is_new_question": false }, @@ -31594,8 +31916,8 @@ "question__title": "Number of Recent Calls", "question__title_slug": "number-of-recent-calls", "question__hide": false, - "total_acs": 123632, - "total_submitted": 169103, + "total_acs": 124342, + "total_submitted": 169991, "frontend_question_id": 933, "is_new_question": false }, @@ -31617,8 +31939,8 @@ "question__title": "Beautiful Array", "question__title_slug": "beautiful-array", "question__hide": false, - "total_acs": 36425, - "total_submitted": 56150, + "total_acs": 36562, + "total_submitted": 56343, "frontend_question_id": 932, "is_new_question": false }, @@ -31640,8 +31962,8 @@ "question__title": "Minimum Falling Path Sum", "question__title_slug": "minimum-falling-path-sum", "question__hide": false, - "total_acs": 132677, - "total_submitted": 195982, + "total_acs": 135632, + "total_submitted": 200029, "frontend_question_id": 931, "is_new_question": false }, @@ -31663,8 +31985,8 @@ "question__title": "Binary Subarrays With Sum", "question__title_slug": "binary-subarrays-with-sum", "question__hide": false, - "total_acs": 47851, - "total_submitted": 97116, + "total_acs": 48594, + "total_submitted": 98342, "frontend_question_id": 930, "is_new_question": false }, @@ -31686,8 +32008,8 @@ "question__title": "Unique Email Addresses", "question__title_slug": "unique-email-addresses", "question__hide": false, - "total_acs": 365714, - "total_submitted": 543652, + "total_acs": 368353, + "total_submitted": 547678, "frontend_question_id": 929, "is_new_question": false }, @@ -31709,8 +32031,8 @@ "question__title": "Minimize Malware Spread II", "question__title_slug": "minimize-malware-spread-ii", "question__hide": false, - "total_acs": 15780, - "total_submitted": 37258, + "total_acs": 15925, + "total_submitted": 37618, "frontend_question_id": 928, "is_new_question": false }, @@ -31732,8 +32054,8 @@ "question__title": "Three Equal Parts", "question__title_slug": "three-equal-parts", "question__hide": false, - "total_acs": 26030, - "total_submitted": 66026, + "total_acs": 26076, + "total_submitted": 66126, "frontend_question_id": 927, "is_new_question": false }, @@ -31755,8 +32077,8 @@ "question__title": "Flip String to Monotone Increasing", "question__title_slug": "flip-string-to-monotone-increasing", "question__hide": false, - "total_acs": 96984, - "total_submitted": 164069, + "total_acs": 98506, + "total_submitted": 166401, "frontend_question_id": 926, "is_new_question": false }, @@ -31778,8 +32100,8 @@ "question__title": "Long Pressed Name", "question__title_slug": "long-pressed-name", "question__hide": false, - "total_acs": 96188, - "total_submitted": 279424, + "total_acs": 97043, + "total_submitted": 282411, "frontend_question_id": 925, "is_new_question": false }, @@ -31801,8 +32123,8 @@ "question__title": "Minimize Malware Spread", "question__title_slug": "minimize-malware-spread", "question__hide": false, - "total_acs": 37978, - "total_submitted": 90554, + "total_acs": 38267, + "total_submitted": 91208, "frontend_question_id": 924, "is_new_question": false }, @@ -31824,8 +32146,8 @@ "question__title": "3Sum With Multiplicity", "question__title_slug": "3sum-with-multiplicity", "question__hide": false, - "total_acs": 88292, - "total_submitted": 194209, + "total_acs": 88858, + "total_submitted": 195319, "frontend_question_id": 923, "is_new_question": false }, @@ -31847,8 +32169,8 @@ "question__title": "Sort Array By Parity II", "question__title_slug": "sort-array-by-parity-ii", "question__hide": false, - "total_acs": 188422, - "total_submitted": 266590, + "total_acs": 189584, + "total_submitted": 268205, "frontend_question_id": 922, "is_new_question": false }, @@ -31870,8 +32192,8 @@ "question__title": "Minimum Add to Make Parentheses Valid", "question__title_slug": "minimum-add-to-make-parentheses-valid", "question__hide": false, - "total_acs": 216046, - "total_submitted": 280955, + "total_acs": 218368, + "total_submitted": 284169, "frontend_question_id": 921, "is_new_question": false }, @@ -31893,8 +32215,8 @@ "question__title": "Number of Music Playlists", "question__title_slug": "number-of-music-playlists", "question__hide": false, - "total_acs": 19919, - "total_submitted": 39701, + "total_acs": 20107, + "total_submitted": 40049, "frontend_question_id": 920, "is_new_question": false }, @@ -31916,8 +32238,8 @@ "question__title": "Complete Binary Tree Inserter", "question__title_slug": "complete-binary-tree-inserter", "question__hide": false, - "total_acs": 39658, - "total_submitted": 61631, + "total_acs": 39897, + "total_submitted": 61953, "frontend_question_id": 919, "is_new_question": false }, @@ -31939,8 +32261,8 @@ "question__title": "Maximum Sum Circular Subarray", "question__title_slug": "maximum-sum-circular-subarray", "question__hide": false, - "total_acs": 122398, - "total_submitted": 327297, + "total_acs": 124203, + "total_submitted": 331308, "frontend_question_id": 918, "is_new_question": false }, @@ -31962,8 +32284,8 @@ "question__title": "Reverse Only Letters", "question__title_slug": "reverse-only-letters", "question__hide": false, - "total_acs": 136405, - "total_submitted": 223176, + "total_acs": 137300, + "total_submitted": 224516, "frontend_question_id": 917, "is_new_question": false }, @@ -31985,8 +32307,8 @@ "question__title": "Word Subsets", "question__title_slug": "word-subsets", "question__hide": false, - "total_acs": 50912, - "total_submitted": 97069, + "total_acs": 51109, + "total_submitted": 97524, "frontend_question_id": 916, "is_new_question": false }, @@ -32008,8 +32330,8 @@ "question__title": "Partition Array into Disjoint Intervals", "question__title_slug": "partition-array-into-disjoint-intervals", "question__hide": false, - "total_acs": 67260, - "total_submitted": 138844, + "total_acs": 67578, + "total_submitted": 139410, "frontend_question_id": 915, "is_new_question": false }, @@ -32031,8 +32353,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": 88334, - "total_submitted": 269451, + "total_acs": 89099, + "total_submitted": 272343, "frontend_question_id": 914, "is_new_question": false }, @@ -32054,8 +32376,8 @@ "question__title": "Cat and Mouse", "question__title_slug": "cat-and-mouse", "question__hide": false, - "total_acs": 15277, - "total_submitted": 42726, + "total_acs": 15333, + "total_submitted": 42965, "frontend_question_id": 913, "is_new_question": false }, @@ -32077,8 +32399,8 @@ "question__title": "Sort an Array", "question__title_slug": "sort-an-array", "question__hide": false, - "total_acs": 278817, - "total_submitted": 455152, + "total_acs": 283948, + "total_submitted": 463977, "frontend_question_id": 912, "is_new_question": false }, @@ -32100,8 +32422,8 @@ "question__title": "Online Election", "question__title_slug": "online-election", "question__hide": false, - "total_acs": 40860, - "total_submitted": 78964, + "total_acs": 41226, + "total_submitted": 79664, "frontend_question_id": 911, "is_new_question": false }, @@ -32123,8 +32445,8 @@ "question__title": "Smallest Range II", "question__title_slug": "smallest-range-ii", "question__hide": false, - "total_acs": 34724, - "total_submitted": 105036, + "total_acs": 35146, + "total_submitted": 105940, "frontend_question_id": 910, "is_new_question": false }, @@ -32146,8 +32468,8 @@ "question__title": "Snakes and Ladders", "question__title_slug": "snakes-and-ladders", "question__hide": false, - "total_acs": 77365, - "total_submitted": 190501, + "total_acs": 78274, + "total_submitted": 192610, "frontend_question_id": 909, "is_new_question": false }, @@ -32169,8 +32491,8 @@ "question__title": "Smallest Range I", "question__title_slug": "smallest-range-i", "question__hide": false, - "total_acs": 61356, - "total_submitted": 91037, + "total_acs": 61754, + "total_submitted": 91619, "frontend_question_id": 908, "is_new_question": false }, @@ -32192,8 +32514,8 @@ "question__title": "Sum of Subarray Minimums", "question__title_slug": "sum-of-subarray-minimums", "question__hide": false, - "total_acs": 82984, - "total_submitted": 244010, + "total_acs": 84885, + "total_submitted": 249522, "frontend_question_id": 907, "is_new_question": false }, @@ -32215,8 +32537,8 @@ "question__title": "Super Palindromes", "question__title_slug": "super-palindromes", "question__hide": false, - "total_acs": 21581, - "total_submitted": 54918, + "total_acs": 21638, + "total_submitted": 55027, "frontend_question_id": 906, "is_new_question": false }, @@ -32238,8 +32560,8 @@ "question__title": "Sort Array By Parity", "question__title_slug": "sort-array-by-parity", "question__hide": false, - "total_acs": 515121, - "total_submitted": 680157, + "total_acs": 518566, + "total_submitted": 684830, "frontend_question_id": 905, "is_new_question": false }, @@ -32261,8 +32583,8 @@ "question__title": "Fruit Into Baskets", "question__title_slug": "fruit-into-baskets", "question__hide": false, - "total_acs": 211793, - "total_submitted": 496114, + "total_acs": 214759, + "total_submitted": 503480, "frontend_question_id": 904, "is_new_question": false }, @@ -32284,8 +32606,8 @@ "question__title": "Valid Permutations for DI Sequence", "question__title_slug": "valid-permutations-for-di-sequence", "question__hide": false, - "total_acs": 10855, - "total_submitted": 19033, + "total_acs": 10904, + "total_submitted": 19114, "frontend_question_id": 903, "is_new_question": false }, @@ -32307,8 +32629,8 @@ "question__title": "Numbers At Most N Given Digit Set", "question__title_slug": "numbers-at-most-n-given-digit-set", "question__hide": false, - "total_acs": 35946, - "total_submitted": 87816, + "total_acs": 36148, + "total_submitted": 88226, "frontend_question_id": 902, "is_new_question": false }, @@ -32330,8 +32652,8 @@ "question__title": "Online Stock Span", "question__title_slug": "online-stock-span", "question__hide": false, - "total_acs": 130191, - "total_submitted": 205749, + "total_acs": 132239, + "total_submitted": 208759, "frontend_question_id": 901, "is_new_question": false }, @@ -32353,8 +32675,8 @@ "question__title": "RLE Iterator", "question__title_slug": "rle-iterator", "question__hide": false, - "total_acs": 53054, - "total_submitted": 90104, + "total_acs": 53805, + "total_submitted": 91269, "frontend_question_id": 900, "is_new_question": false }, @@ -32376,8 +32698,8 @@ "question__title": "Orderly Queue", "question__title_slug": "orderly-queue", "question__hide": false, - "total_acs": 26186, - "total_submitted": 44684, + "total_acs": 26287, + "total_submitted": 44819, "frontend_question_id": 899, "is_new_question": false }, @@ -32399,8 +32721,8 @@ "question__title": "Bitwise ORs of Subarrays", "question__title_slug": "bitwise-ors-of-subarrays", "question__hide": false, - "total_acs": 26691, - "total_submitted": 73544, + "total_acs": 26903, + "total_submitted": 73972, "frontend_question_id": 898, "is_new_question": false }, @@ -32422,8 +32744,8 @@ "question__title": "Increasing Order Search Tree", "question__title_slug": "increasing-order-search-tree", "question__hide": false, - "total_acs": 217991, - "total_submitted": 278306, + "total_acs": 219476, + "total_submitted": 280197, "frontend_question_id": 897, "is_new_question": false }, @@ -32445,8 +32767,8 @@ "question__title": "Monotonic Array", "question__title_slug": "monotonic-array", "question__hide": false, - "total_acs": 213474, - "total_submitted": 365918, + "total_acs": 215571, + "total_submitted": 369557, "frontend_question_id": 896, "is_new_question": false }, @@ -32468,8 +32790,8 @@ "question__title": "Maximum Frequency Stack", "question__title_slug": "maximum-frequency-stack", "question__hide": false, - "total_acs": 129404, - "total_submitted": 194537, + "total_acs": 130572, + "total_submitted": 196128, "frontend_question_id": 895, "is_new_question": false }, @@ -32491,8 +32813,8 @@ "question__title": "All Possible Full Binary Trees", "question__title_slug": "all-possible-full-binary-trees", "question__hide": false, - "total_acs": 87500, - "total_submitted": 109951, + "total_acs": 88481, + "total_submitted": 111104, "frontend_question_id": 894, "is_new_question": false }, @@ -32514,8 +32836,8 @@ "question__title": "Groups of Special-Equivalent Strings", "question__title_slug": "groups-of-special-equivalent-strings", "question__hide": false, - "total_acs": 41696, - "total_submitted": 59046, + "total_acs": 41819, + "total_submitted": 59215, "frontend_question_id": 893, "is_new_question": false }, @@ -32537,8 +32859,8 @@ "question__title": "Surface Area of 3D Shapes", "question__title_slug": "surface-area-of-3d-shapes", "question__hide": false, - "total_acs": 29491, - "total_submitted": 47338, + "total_acs": 29702, + "total_submitted": 47629, "frontend_question_id": 892, "is_new_question": false }, @@ -32560,8 +32882,8 @@ "question__title": "Sum of Subsequence Widths", "question__title_slug": "sum-of-subsequence-widths", "question__hide": false, - "total_acs": 15920, - "total_submitted": 44405, + "total_acs": 16042, + "total_submitted": 44663, "frontend_question_id": 891, "is_new_question": false }, @@ -32583,8 +32905,8 @@ "question__title": "Find and Replace Pattern", "question__title_slug": "find-and-replace-pattern", "question__hide": false, - "total_acs": 99562, - "total_submitted": 131698, + "total_acs": 100044, + "total_submitted": 132357, "frontend_question_id": 890, "is_new_question": false }, @@ -32606,8 +32928,8 @@ "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": 73333, - "total_submitted": 104501, + "total_acs": 74134, + "total_submitted": 105557, "frontend_question_id": 889, "is_new_question": false }, @@ -32629,8 +32951,8 @@ "question__title": "Fair Candy Swap", "question__title_slug": "fair-candy-swap", "question__hide": false, - "total_acs": 83879, - "total_submitted": 138989, + "total_acs": 84586, + "total_submitted": 140071, "frontend_question_id": 888, "is_new_question": false }, @@ -32652,8 +32974,8 @@ "question__title": "Super Egg Drop", "question__title_slug": "super-egg-drop", "question__hide": false, - "total_acs": 47471, - "total_submitted": 174265, + "total_acs": 48247, + "total_submitted": 177338, "frontend_question_id": 887, "is_new_question": false }, @@ -32675,8 +32997,8 @@ "question__title": "Possible Bipartition", "question__title_slug": "possible-bipartition", "question__hide": false, - "total_acs": 111040, - "total_submitted": 233015, + "total_acs": 112598, + "total_submitted": 235856, "frontend_question_id": 886, "is_new_question": false }, @@ -32698,8 +33020,8 @@ "question__title": "Spiral Matrix III", "question__title_slug": "spiral-matrix-iii", "question__hide": false, - "total_acs": 35213, - "total_submitted": 48535, + "total_acs": 35417, + "total_submitted": 48832, "frontend_question_id": 885, "is_new_question": false }, @@ -32721,8 +33043,8 @@ "question__title": "Uncommon Words from Two Sentences", "question__title_slug": "uncommon-words-from-two-sentences", "question__hide": false, - "total_acs": 99921, - "total_submitted": 152094, + "total_acs": 100601, + "total_submitted": 153120, "frontend_question_id": 884, "is_new_question": false }, @@ -32744,8 +33066,8 @@ "question__title": "Projection Area of 3D Shapes", "question__title_slug": "projection-area-of-3d-shapes", "question__hide": false, - "total_acs": 41489, - "total_submitted": 59100, + "total_acs": 41747, + "total_submitted": 59434, "frontend_question_id": 883, "is_new_question": false }, @@ -32767,8 +33089,8 @@ "question__title": "Reachable Nodes In Subdivided Graph", "question__title_slug": "reachable-nodes-in-subdivided-graph", "question__hide": false, - "total_acs": 20855, - "total_submitted": 41565, + "total_acs": 20983, + "total_submitted": 41824, "frontend_question_id": 882, "is_new_question": false }, @@ -32790,8 +33112,8 @@ "question__title": "Boats to Save People", "question__title_slug": "boats-to-save-people", "question__hide": false, - "total_acs": 147492, - "total_submitted": 280849, + "total_acs": 148542, + "total_submitted": 282743, "frontend_question_id": 881, "is_new_question": false }, @@ -32813,8 +33135,8 @@ "question__title": "Decoded String at Index", "question__title_slug": "decoded-string-at-index", "question__hide": false, - "total_acs": 33782, - "total_submitted": 119293, + "total_acs": 33909, + "total_submitted": 119745, "frontend_question_id": 880, "is_new_question": false }, @@ -32836,8 +33158,8 @@ "question__title": "Generate Random Point in a Circle", "question__title_slug": "generate-random-point-in-a-circle", "question__hide": false, - "total_acs": 34038, - "total_submitted": 86252, + "total_acs": 34146, + "total_submitted": 86537, "frontend_question_id": 478, "is_new_question": false }, @@ -32859,8 +33181,8 @@ "question__title": "Random Point in Non-overlapping Rectangles", "question__title_slug": "random-point-in-non-overlapping-rectangles", "question__hide": false, - "total_acs": 34556, - "total_submitted": 88220, + "total_acs": 34690, + "total_submitted": 88507, "frontend_question_id": 497, "is_new_question": false }, @@ -32882,8 +33204,8 @@ "question__title": "Random Flip Matrix", "question__title_slug": "random-flip-matrix", "question__hide": false, - "total_acs": 13880, - "total_submitted": 35274, + "total_acs": 13995, + "total_submitted": 35486, "frontend_question_id": 519, "is_new_question": false }, @@ -32905,8 +33227,8 @@ "question__title": "Random Pick with Weight", "question__title_slug": "random-pick-with-weight", "question__hide": false, - "total_acs": 309081, - "total_submitted": 669637, + "total_acs": 312542, + "total_submitted": 676868, "frontend_question_id": 528, "is_new_question": false }, @@ -32928,8 +33250,8 @@ "question__title": "Profitable Schemes", "question__title_slug": "profitable-schemes", "question__hide": false, - "total_acs": 15249, - "total_submitted": 37554, + "total_acs": 15354, + "total_submitted": 37811, "frontend_question_id": 879, "is_new_question": false }, @@ -32951,8 +33273,8 @@ "question__title": "Nth Magical Number", "question__title_slug": "nth-magical-number", "question__hide": false, - "total_acs": 30028, - "total_submitted": 83640, + "total_acs": 30175, + "total_submitted": 84037, "frontend_question_id": 878, "is_new_question": false }, @@ -32974,8 +33296,8 @@ "question__title": "Stone Game", "question__title_slug": "stone-game", "question__hide": false, - "total_acs": 157609, - "total_submitted": 227666, + "total_acs": 158914, + "total_submitted": 229348, "frontend_question_id": 877, "is_new_question": false }, @@ -32997,8 +33319,8 @@ "question__title": "Middle of the Linked List", "question__title_slug": "middle-of-the-linked-list", "question__hide": false, - "total_acs": 702497, - "total_submitted": 963337, + "total_acs": 727490, + "total_submitted": 995538, "frontend_question_id": 876, "is_new_question": false }, @@ -33020,8 +33342,8 @@ "question__title": "Koko Eating Bananas", "question__title_slug": "koko-eating-bananas", "question__hide": false, - "total_acs": 186997, - "total_submitted": 344738, + "total_acs": 191325, + "total_submitted": 353800, "frontend_question_id": 875, "is_new_question": false }, @@ -33043,8 +33365,8 @@ "question__title": "Walking Robot Simulation", "question__title_slug": "walking-robot-simulation", "question__hide": false, - "total_acs": 32409, - "total_submitted": 85354, + "total_acs": 32550, + "total_submitted": 85672, "frontend_question_id": 874, "is_new_question": false }, @@ -33066,8 +33388,8 @@ "question__title": "Length of Longest Fibonacci Subsequence", "question__title_slug": "length-of-longest-fibonacci-subsequence", "question__hide": false, - "total_acs": 48748, - "total_submitted": 100307, + "total_acs": 49006, + "total_submitted": 100826, "frontend_question_id": 873, "is_new_question": false }, @@ -33089,8 +33411,8 @@ "question__title": "Leaf-Similar Trees", "question__title_slug": "leaf-similar-trees", "question__hide": false, - "total_acs": 168485, - "total_submitted": 259230, + "total_acs": 169800, + "total_submitted": 261122, "frontend_question_id": 872, "is_new_question": false }, @@ -33112,8 +33434,8 @@ "question__title": "Implement Rand10() Using Rand7()", "question__title_slug": "implement-rand10-using-rand7", "question__hide": false, - "total_acs": 63840, - "total_submitted": 136546, + "total_acs": 64219, + "total_submitted": 137394, "frontend_question_id": 470, "is_new_question": false }, @@ -33135,8 +33457,8 @@ "question__title": "Minimum Number of Refueling Stops", "question__title_slug": "minimum-number-of-refueling-stops", "question__hide": false, - "total_acs": 72345, - "total_submitted": 201892, + "total_acs": 73060, + "total_submitted": 203704, "frontend_question_id": 871, "is_new_question": false }, @@ -33158,8 +33480,8 @@ "question__title": "Advantage Shuffle", "question__title_slug": "advantage-shuffle", "question__hide": false, - "total_acs": 54028, - "total_submitted": 105228, + "total_acs": 54290, + "total_submitted": 105652, "frontend_question_id": 870, "is_new_question": false }, @@ -33181,8 +33503,8 @@ "question__title": "Reordered Power of 2", "question__title_slug": "reordered-power-of-2", "question__hide": false, - "total_acs": 41535, - "total_submitted": 67891, + "total_acs": 41677, + "total_submitted": 68123, "frontend_question_id": 869, "is_new_question": false }, @@ -33204,8 +33526,8 @@ "question__title": "Binary Gap", "question__title_slug": "binary-gap", "question__hide": false, - "total_acs": 59982, - "total_submitted": 97072, + "total_acs": 60332, + "total_submitted": 97622, "frontend_question_id": 868, "is_new_question": false }, @@ -33227,8 +33549,8 @@ "question__title": "Transpose Matrix", "question__title_slug": "transpose-matrix", "question__hide": false, - "total_acs": 200945, - "total_submitted": 314083, + "total_acs": 203178, + "total_submitted": 317937, "frontend_question_id": 867, "is_new_question": false }, @@ -33250,8 +33572,8 @@ "question__title": "Prime Palindrome", "question__title_slug": "prime-palindrome", "question__hide": false, - "total_acs": 25935, - "total_submitted": 100193, + "total_acs": 26046, + "total_submitted": 100558, "frontend_question_id": 866, "is_new_question": false }, @@ -33273,8 +33595,8 @@ "question__title": "Smallest Subtree with all the Deepest Nodes", "question__title_slug": "smallest-subtree-with-all-the-deepest-nodes", "question__hide": false, - "total_acs": 105152, - "total_submitted": 154544, + "total_acs": 105756, + "total_submitted": 155286, "frontend_question_id": 865, "is_new_question": false }, @@ -33296,8 +33618,8 @@ "question__title": "Shortest Path to Get All Keys", "question__title_slug": "shortest-path-to-get-all-keys", "question__hide": false, - "total_acs": 24383, - "total_submitted": 54237, + "total_acs": 24681, + "total_submitted": 54779, "frontend_question_id": 864, "is_new_question": false }, @@ -33319,8 +33641,8 @@ "question__title": "Random Pick with Blacklist", "question__title_slug": "random-pick-with-blacklist", "question__hide": false, - "total_acs": 29796, - "total_submitted": 89299, + "total_acs": 30255, + "total_submitted": 90433, "frontend_question_id": 710, "is_new_question": false }, @@ -33342,8 +33664,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": 240669, - "total_submitted": 391992, + "total_acs": 244477, + "total_submitted": 397574, "frontend_question_id": 863, "is_new_question": false }, @@ -33365,8 +33687,8 @@ "question__title": "Shortest Subarray with Sum at Least K", "question__title_slug": "shortest-subarray-with-sum-at-least-k", "question__hide": false, - "total_acs": 72231, - "total_submitted": 276382, + "total_acs": 72884, + "total_submitted": 279091, "frontend_question_id": 862, "is_new_question": false }, @@ -33388,8 +33710,8 @@ "question__title": "Score After Flipping Matrix", "question__title_slug": "score-after-flipping-matrix", "question__hide": false, - "total_acs": 35648, - "total_submitted": 47620, + "total_acs": 35927, + "total_submitted": 47992, "frontend_question_id": 861, "is_new_question": false }, @@ -33411,8 +33733,8 @@ "question__title": "Lemonade Change", "question__title_slug": "lemonade-change", "question__hide": false, - "total_acs": 99714, - "total_submitted": 189481, + "total_acs": 100812, + "total_submitted": 191481, "frontend_question_id": 860, "is_new_question": false }, @@ -33434,8 +33756,8 @@ "question__title": "Buddy Strings", "question__title_slug": "buddy-strings", "question__hide": false, - "total_acs": 122838, - "total_submitted": 426130, + "total_acs": 123841, + "total_submitted": 429306, "frontend_question_id": 859, "is_new_question": false }, @@ -33457,8 +33779,8 @@ "question__title": "Mirror Reflection", "question__title_slug": "mirror-reflection", "question__hide": false, - "total_acs": 26550, - "total_submitted": 44549, + "total_acs": 26606, + "total_submitted": 44643, "frontend_question_id": 858, "is_new_question": false }, @@ -33480,8 +33802,8 @@ "question__title": "Minimum Cost to Hire K Workers", "question__title_slug": "minimum-cost-to-hire-k-workers", "question__hide": false, - "total_acs": 51726, - "total_submitted": 99962, + "total_acs": 52138, + "total_submitted": 100739, "frontend_question_id": 857, "is_new_question": false }, @@ -33503,8 +33825,8 @@ "question__title": "Score of Parentheses", "question__title_slug": "score-of-parentheses", "question__hide": false, - "total_acs": 140234, - "total_submitted": 214681, + "total_acs": 141144, + "total_submitted": 216108, "frontend_question_id": 856, "is_new_question": false }, @@ -33526,8 +33848,8 @@ "question__title": "Exam Room", "question__title_slug": "exam-room", "question__hide": false, - "total_acs": 48137, - "total_submitted": 110410, + "total_acs": 48386, + "total_submitted": 111018, "frontend_question_id": 855, "is_new_question": false }, @@ -33549,8 +33871,8 @@ "question__title": "K-Similar Strings", "question__title_slug": "k-similar-strings", "question__hide": false, - "total_acs": 33736, - "total_submitted": 85884, + "total_acs": 34163, + "total_submitted": 86791, "frontend_question_id": 854, "is_new_question": false }, @@ -33572,8 +33894,8 @@ "question__title": "Car Fleet", "question__title_slug": "car-fleet", "question__hide": false, - "total_acs": 86226, - "total_submitted": 177252, + "total_acs": 88267, + "total_submitted": 180856, "frontend_question_id": 853, "is_new_question": false }, @@ -33595,8 +33917,8 @@ "question__title": "Peak Index in a Mountain Array", "question__title_slug": "peak-index-in-a-mountain-array", "question__hide": false, - "total_acs": 395747, - "total_submitted": 566334, + "total_acs": 403094, + "total_submitted": 577256, "frontend_question_id": 852, "is_new_question": false }, @@ -33618,8 +33940,8 @@ "question__title": "Loud and Rich", "question__title_slug": "loud-and-rich", "question__hide": false, - "total_acs": 25011, - "total_submitted": 43867, + "total_acs": 25414, + "total_submitted": 44468, "frontend_question_id": 851, "is_new_question": false }, @@ -33641,8 +33963,8 @@ "question__title": "Rectangle Area II", "question__title_slug": "rectangle-area-ii", "question__hide": false, - "total_acs": 29783, - "total_submitted": 55805, + "total_acs": 29885, + "total_submitted": 55946, "frontend_question_id": 850, "is_new_question": false }, @@ -33664,8 +33986,8 @@ "question__title": "Maximize Distance to Closest Person", "question__title_slug": "maximize-distance-to-closest-person", "question__hide": false, - "total_acs": 177033, - "total_submitted": 373047, + "total_acs": 178212, + "total_submitted": 375456, "frontend_question_id": 849, "is_new_question": false }, @@ -33687,8 +34009,8 @@ "question__title": "Shifting Letters", "question__title_slug": "shifting-letters", "question__hide": false, - "total_acs": 73589, - "total_submitted": 162033, + "total_acs": 74127, + "total_submitted": 163274, "frontend_question_id": 848, "is_new_question": false }, @@ -33710,8 +34032,8 @@ "question__title": "Shortest Path Visiting All Nodes", "question__title_slug": "shortest-path-visiting-all-nodes", "question__hide": false, - "total_acs": 58440, - "total_submitted": 95243, + "total_acs": 59130, + "total_submitted": 96403, "frontend_question_id": 847, "is_new_question": false }, @@ -33733,8 +34055,8 @@ "question__title": "Hand of Straights", "question__title_slug": "hand-of-straights", "question__hide": false, - "total_acs": 90721, - "total_submitted": 161169, + "total_acs": 91722, + "total_submitted": 162926, "frontend_question_id": 846, "is_new_question": false }, @@ -33756,8 +34078,8 @@ "question__title": "Longest Mountain in Array", "question__title_slug": "longest-mountain-in-array", "question__hide": false, - "total_acs": 92974, - "total_submitted": 232918, + "total_acs": 94043, + "total_submitted": 235268, "frontend_question_id": 845, "is_new_question": false }, @@ -33779,8 +34101,8 @@ "question__title": "Backspace String Compare", "question__title_slug": "backspace-string-compare", "question__hide": false, - "total_acs": 486018, - "total_submitted": 1013120, + "total_acs": 491720, + "total_submitted": 1025243, "frontend_question_id": 844, "is_new_question": false }, @@ -33802,8 +34124,8 @@ "question__title": "Guess the Word", "question__title_slug": "guess-the-word", "question__hide": false, - "total_acs": 119063, - "total_submitted": 278233, + "total_acs": 120034, + "total_submitted": 281026, "frontend_question_id": 843, "is_new_question": false }, @@ -33825,8 +34147,8 @@ "question__title": "Split Array into Fibonacci Sequence", "question__title_slug": "split-array-into-fibonacci-sequence", "question__hide": false, - "total_acs": 31186, - "total_submitted": 82414, + "total_acs": 31365, + "total_submitted": 82834, "frontend_question_id": 842, "is_new_question": false }, @@ -33848,8 +34170,8 @@ "question__title": "Keys and Rooms", "question__title_slug": "keys-and-rooms", "question__hide": false, - "total_acs": 203485, - "total_submitted": 293427, + "total_acs": 206849, + "total_submitted": 297834, "frontend_question_id": 841, "is_new_question": false }, @@ -33871,8 +34193,8 @@ "question__title": "Magic Squares In Grid", "question__title_slug": "magic-squares-in-grid", "question__hide": false, - "total_acs": 32564, - "total_submitted": 84792, + "total_acs": 32674, + "total_submitted": 85051, "frontend_question_id": 840, "is_new_question": false }, @@ -33894,8 +34216,8 @@ "question__title": "Similar String Groups", "question__title_slug": "similar-string-groups", "question__hide": false, - "total_acs": 53485, - "total_submitted": 115997, + "total_acs": 54370, + "total_submitted": 117445, "frontend_question_id": 839, "is_new_question": false }, @@ -33917,8 +34239,8 @@ "question__title": "Push Dominoes", "question__title_slug": "push-dominoes", "question__hide": false, - "total_acs": 58907, - "total_submitted": 112391, + "total_acs": 59248, + "total_submitted": 112966, "frontend_question_id": 838, "is_new_question": false }, @@ -33940,8 +34262,8 @@ "question__title": "New 21 Game", "question__title_slug": "new-21-game", "question__hide": false, - "total_acs": 31859, - "total_submitted": 88431, + "total_acs": 32018, + "total_submitted": 88844, "frontend_question_id": 837, "is_new_question": false }, @@ -33963,8 +34285,8 @@ "question__title": "Rectangle Overlap", "question__title_slug": "rectangle-overlap", "question__hide": false, - "total_acs": 103975, - "total_submitted": 240711, + "total_acs": 104690, + "total_submitted": 242287, "frontend_question_id": 836, "is_new_question": false }, @@ -33986,8 +34308,8 @@ "question__title": "Robot Room Cleaner", "question__title_slug": "robot-room-cleaner", "question__hide": false, - "total_acs": 125498, - "total_submitted": 164825, + "total_acs": 126788, + "total_submitted": 166407, "frontend_question_id": 489, "is_new_question": false }, @@ -34009,8 +34331,8 @@ "question__title": "Image Overlap", "question__title_slug": "image-overlap", "question__hide": false, - "total_acs": 47774, - "total_submitted": 78107, + "total_acs": 47861, + "total_submitted": 78260, "frontend_question_id": 835, "is_new_question": false }, @@ -34032,8 +34354,8 @@ "question__title": "Sum of Distances in Tree", "question__title_slug": "sum-of-distances-in-tree", "question__hide": false, - "total_acs": 42461, - "total_submitted": 79609, + "total_acs": 42890, + "total_submitted": 80318, "frontend_question_id": 834, "is_new_question": false }, @@ -34055,8 +34377,8 @@ "question__title": "Find And Replace in String", "question__title_slug": "find-and-replace-in-string", "question__hide": false, - "total_acs": 115489, - "total_submitted": 212734, + "total_acs": 116998, + "total_submitted": 215527, "frontend_question_id": 833, "is_new_question": false }, @@ -34078,8 +34400,8 @@ "question__title": "Flipping an Image", "question__title_slug": "flipping-an-image", "question__hide": false, - "total_acs": 302936, - "total_submitted": 379297, + "total_acs": 305234, + "total_submitted": 381978, "frontend_question_id": 832, "is_new_question": false }, @@ -34101,8 +34423,8 @@ "question__title": "Design Circular Queue", "question__title_slug": "design-circular-queue", "question__hide": false, - "total_acs": 180439, - "total_submitted": 369900, + "total_acs": 182461, + "total_submitted": 373908, "frontend_question_id": 622, "is_new_question": false }, @@ -34124,8 +34446,8 @@ "question__title": "Design Circular Deque", "question__title_slug": "design-circular-deque", "question__hide": false, - "total_acs": 44530, - "total_submitted": 77563, + "total_acs": 45017, + "total_submitted": 78381, "frontend_question_id": 641, "is_new_question": false }, @@ -34147,8 +34469,8 @@ "question__title": "Masking Personal Information", "question__title_slug": "masking-personal-information", "question__hide": false, - "total_acs": 14606, - "total_submitted": 31596, + "total_acs": 14672, + "total_submitted": 31706, "frontend_question_id": 831, "is_new_question": false }, @@ -34170,8 +34492,8 @@ "question__title": "Positions of Large Groups", "question__title_slug": "positions-of-large-groups", "question__hide": false, - "total_acs": 72882, - "total_submitted": 141437, + "total_acs": 73328, + "total_submitted": 142301, "frontend_question_id": 830, "is_new_question": false }, @@ -34193,8 +34515,8 @@ "question__title": "Consecutive Numbers Sum", "question__title_slug": "consecutive-numbers-sum", "question__hide": false, - "total_acs": 69709, - "total_submitted": 169379, + "total_acs": 70082, + "total_submitted": 170265, "frontend_question_id": 829, "is_new_question": false }, @@ -34216,8 +34538,8 @@ "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": 47291, - "total_submitted": 94209, + "total_acs": 48718, + "total_submitted": 97037, "frontend_question_id": 828, "is_new_question": false }, @@ -34239,8 +34561,8 @@ "question__title": "Making A Large Island", "question__title_slug": "making-a-large-island", "question__hide": false, - "total_acs": 111151, - "total_submitted": 248110, + "total_acs": 112025, + "total_submitted": 250093, "frontend_question_id": 827, "is_new_question": false }, @@ -34262,8 +34584,8 @@ "question__title": "Most Profit Assigning Work", "question__title_slug": "most-profit-assigning-work", "question__hide": false, - "total_acs": 39541, - "total_submitted": 92531, + "total_acs": 40358, + "total_submitted": 94071, "frontend_question_id": 826, "is_new_question": false }, @@ -34285,8 +34607,8 @@ "question__title": "Friends Of Appropriate Ages", "question__title_slug": "friends-of-appropriate-ages", "question__hide": false, - "total_acs": 65489, - "total_submitted": 142031, + "total_acs": 65791, + "total_submitted": 142679, "frontend_question_id": 825, "is_new_question": false }, @@ -34308,8 +34630,8 @@ "question__title": "Goat Latin", "question__title_slug": "goat-latin", "question__hide": false, - "total_acs": 144337, - "total_submitted": 213380, + "total_acs": 144845, + "total_submitted": 214060, "frontend_question_id": 824, "is_new_question": false }, @@ -34331,8 +34653,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": 116235, - "total_submitted": 337421, + "total_acs": 117132, + "total_submitted": 339904, "frontend_question_id": 708, "is_new_question": false }, @@ -34354,8 +34676,8 @@ "question__title": "Binary Trees With Factors", "question__title_slug": "binary-trees-with-factors", "question__hide": false, - "total_acs": 37149, - "total_submitted": 85074, + "total_acs": 37284, + "total_submitted": 85407, "frontend_question_id": 823, "is_new_question": false }, @@ -34377,8 +34699,8 @@ "question__title": "Card Flipping Game", "question__title_slug": "card-flipping-game", "question__hide": false, - "total_acs": 13339, - "total_submitted": 29708, + "total_acs": 13419, + "total_submitted": 29864, "frontend_question_id": 822, "is_new_question": false }, @@ -34400,8 +34722,8 @@ "question__title": "Shortest Distance to a Character", "question__title_slug": "shortest-distance-to-a-character", "question__hide": false, - "total_acs": 134743, - "total_submitted": 189637, + "total_acs": 135640, + "total_submitted": 190839, "frontend_question_id": 821, "is_new_question": false }, @@ -34423,8 +34745,8 @@ "question__title": "Short Encoding of Words", "question__title_slug": "short-encoding-of-words", "question__hide": false, - "total_acs": 45693, - "total_submitted": 82534, + "total_acs": 87458, + "total_submitted": 144140, "frontend_question_id": 820, "is_new_question": false }, @@ -34446,8 +34768,8 @@ "question__title": "Design Linked List", "question__title_slug": "design-linked-list", "question__hide": false, - "total_acs": 197833, - "total_submitted": 730081, + "total_acs": 200566, + "total_submitted": 739408, "frontend_question_id": 707, "is_new_question": false }, @@ -34469,8 +34791,8 @@ "question__title": "Most Common Word", "question__title_slug": "most-common-word", "question__hide": false, - "total_acs": 292492, - "total_submitted": 647350, + "total_acs": 294070, + "total_submitted": 651183, "frontend_question_id": 819, "is_new_question": false }, @@ -34492,8 +34814,8 @@ "question__title": "Race Car", "question__title_slug": "race-car", "question__hide": false, - "total_acs": 45479, - "total_submitted": 105269, + "total_acs": 47696, + "total_submitted": 110446, "frontend_question_id": 818, "is_new_question": false }, @@ -34515,8 +34837,8 @@ "question__title": "Linked List Components", "question__title_slug": "linked-list-components", "question__hide": false, - "total_acs": 70515, - "total_submitted": 121404, + "total_acs": 70928, + "total_submitted": 122128, "frontend_question_id": 817, "is_new_question": false }, @@ -34538,8 +34860,8 @@ "question__title": "Ambiguous Coordinates", "question__title_slug": "ambiguous-coordinates", "question__hide": false, - "total_acs": 25839, - "total_submitted": 46141, + "total_acs": 25899, + "total_submitted": 46255, "frontend_question_id": 816, "is_new_question": false }, @@ -34561,8 +34883,8 @@ "question__title": "Bus Routes", "question__title_slug": "bus-routes", "question__hide": false, - "total_acs": 90004, - "total_submitted": 198714, + "total_acs": 91679, + "total_submitted": 202150, "frontend_question_id": 815, "is_new_question": false }, @@ -34584,8 +34906,8 @@ "question__title": "Binary Tree Pruning", "question__title_slug": "binary-tree-pruning", "question__hide": false, - "total_acs": 143871, - "total_submitted": 202824, + "total_acs": 145148, + "total_submitted": 204781, "frontend_question_id": 814, "is_new_question": false }, @@ -34607,8 +34929,8 @@ "question__title": "Largest Sum of Averages", "question__title_slug": "largest-sum-of-averages", "question__hide": false, - "total_acs": 40957, - "total_submitted": 77802, + "total_acs": 41234, + "total_submitted": 78253, "frontend_question_id": 813, "is_new_question": false }, @@ -34630,8 +34952,8 @@ "question__title": "Largest Triangle Area", "question__title_slug": "largest-triangle-area", "question__hide": false, - "total_acs": 33473, - "total_submitted": 56126, + "total_acs": 33719, + "total_submitted": 56531, "frontend_question_id": 812, "is_new_question": false }, @@ -34653,8 +34975,8 @@ "question__title": "Subdomain Visit Count", "question__title_slug": "subdomain-visit-count", "question__hide": false, - "total_acs": 176920, - "total_submitted": 237669, + "total_acs": 178320, + "total_submitted": 239381, "frontend_question_id": 811, "is_new_question": false }, @@ -34676,8 +34998,8 @@ "question__title": "Chalkboard XOR Game", "question__title_slug": "chalkboard-xor-game", "question__hide": false, - "total_acs": 6709, - "total_submitted": 12469, + "total_acs": 6746, + "total_submitted": 12519, "frontend_question_id": 810, "is_new_question": false }, @@ -34699,8 +35021,8 @@ "question__title": "Expressive Words", "question__title_slug": "expressive-words", "question__hide": false, - "total_acs": 97702, - "total_submitted": 210657, + "total_acs": 98304, + "total_submitted": 211960, "frontend_question_id": 809, "is_new_question": false }, @@ -34722,8 +35044,8 @@ "question__title": "Soup Servings", "question__title_slug": "soup-servings", "question__hide": false, - "total_acs": 15134, - "total_submitted": 35527, + "total_acs": 15240, + "total_submitted": 35760, "frontend_question_id": 808, "is_new_question": false }, @@ -34745,8 +35067,8 @@ "question__title": "Max Increase to Keep City Skyline", "question__title_slug": "max-increase-to-keep-city-skyline", "question__hide": false, - "total_acs": 126393, - "total_submitted": 147606, + "total_acs": 127308, + "total_submitted": 148614, "frontend_question_id": 807, "is_new_question": false }, @@ -34768,8 +35090,8 @@ "question__title": "Number of Lines To Write String", "question__title_slug": "number-of-lines-to-write-string", "question__hide": false, - "total_acs": 55219, - "total_submitted": 83584, + "total_acs": 55576, + "total_submitted": 84121, "frontend_question_id": 806, "is_new_question": false }, @@ -34791,8 +35113,8 @@ "question__title": "Split Array With Same Average", "question__title_slug": "split-array-with-same-average", "question__hide": false, - "total_acs": 26093, - "total_submitted": 99109, + "total_acs": 26267, + "total_submitted": 99978, "frontend_question_id": 805, "is_new_question": false }, @@ -34814,8 +35136,8 @@ "question__title": "Unique Morse Code Words", "question__title_slug": "unique-morse-code-words", "question__hide": false, - "total_acs": 221006, - "total_submitted": 275877, + "total_acs": 222046, + "total_submitted": 277103, "frontend_question_id": 804, "is_new_question": false }, @@ -34837,8 +35159,8 @@ "question__title": "Bricks Falling When Hit", "question__title_slug": "bricks-falling-when-hit", "question__hide": false, - "total_acs": 25325, - "total_submitted": 74475, + "total_acs": 25489, + "total_submitted": 74927, "frontend_question_id": 803, "is_new_question": false }, @@ -34860,8 +35182,8 @@ "question__title": "Find Eventual Safe States", "question__title_slug": "find-eventual-safe-states", "question__hide": false, - "total_acs": 83567, - "total_submitted": 157362, + "total_acs": 85335, + "total_submitted": 160420, "frontend_question_id": 802, "is_new_question": false }, @@ -34883,8 +35205,8 @@ "question__title": "Minimum Swaps To Make Sequences Increasing", "question__title_slug": "minimum-swaps-to-make-sequences-increasing", "question__hide": false, - "total_acs": 53900, - "total_submitted": 137674, + "total_acs": 54236, + "total_submitted": 138553, "frontend_question_id": 801, "is_new_question": false }, @@ -34906,8 +35228,8 @@ "question__title": "Similar RGB Color", "question__title_slug": "similar-rgb-color", "question__hide": false, - "total_acs": 12710, - "total_submitted": 19907, + "total_acs": 12732, + "total_submitted": 19941, "frontend_question_id": 800, "is_new_question": false }, @@ -34929,8 +35251,8 @@ "question__title": "Design HashMap", "question__title_slug": "design-hashmap", "question__hide": false, - "total_acs": 340338, - "total_submitted": 521803, + "total_acs": 343873, + "total_submitted": 527256, "frontend_question_id": 706, "is_new_question": false }, @@ -34952,8 +35274,8 @@ "question__title": "Design HashSet", "question__title_slug": "design-hashset", "question__hide": false, - "total_acs": 234498, - "total_submitted": 353914, + "total_acs": 237169, + "total_submitted": 358624, "frontend_question_id": 705, "is_new_question": false }, @@ -34975,8 +35297,8 @@ "question__title": "Champagne Tower", "question__title_slug": "champagne-tower", "question__hide": false, - "total_acs": 77623, - "total_submitted": 151433, + "total_acs": 78085, + "total_submitted": 152380, "frontend_question_id": 799, "is_new_question": false }, @@ -34998,8 +35320,8 @@ "question__title": "Smallest Rotation with Highest Score", "question__title_slug": "smallest-rotation-with-highest-score", "question__hide": false, - "total_acs": 9584, - "total_submitted": 19749, + "total_acs": 9727, + "total_submitted": 19997, "frontend_question_id": 798, "is_new_question": false }, @@ -35021,8 +35343,8 @@ "question__title": "All Paths From Source to Target", "question__title_slug": "all-paths-from-source-to-target", "question__hide": false, - "total_acs": 295965, - "total_submitted": 365321, + "total_acs": 300808, + "total_submitted": 371096, "frontend_question_id": 797, "is_new_question": false }, @@ -35044,8 +35366,8 @@ "question__title": "Rotate String", "question__title_slug": "rotate-string", "question__hide": false, - "total_acs": 153951, - "total_submitted": 291793, + "total_acs": 155760, + "total_submitted": 294632, "frontend_question_id": 796, "is_new_question": false }, @@ -35067,8 +35389,8 @@ "question__title": "Number of Subarrays with Bounded Maximum", "question__title_slug": "number-of-subarrays-with-bounded-maximum", "question__hide": false, - "total_acs": 53575, - "total_submitted": 102261, + "total_acs": 53880, + "total_submitted": 102801, "frontend_question_id": 795, "is_new_question": false }, @@ -35090,8 +35412,8 @@ "question__title": "Valid Tic-Tac-Toe State", "question__title_slug": "valid-tic-tac-toe-state", "question__hide": false, - "total_acs": 48764, - "total_submitted": 138441, + "total_acs": 49201, + "total_submitted": 139676, "frontend_question_id": 794, "is_new_question": false }, @@ -35113,8 +35435,8 @@ "question__title": "Preimage Size of Factorial Zeroes Function", "question__title_slug": "preimage-size-of-factorial-zeroes-function", "question__hide": false, - "total_acs": 12641, - "total_submitted": 30068, + "total_acs": 12757, + "total_submitted": 30301, "frontend_question_id": 793, "is_new_question": false }, @@ -35136,8 +35458,8 @@ "question__title": "Number of Matching Subsequences", "question__title_slug": "number-of-matching-subsequences", "question__hide": false, - "total_acs": 135081, - "total_submitted": 266738, + "total_acs": 136265, + "total_submitted": 268972, "frontend_question_id": 792, "is_new_question": false }, @@ -35159,8 +35481,8 @@ "question__title": "Custom Sort String", "question__title_slug": "custom-sort-string", "question__hide": false, - "total_acs": 185176, - "total_submitted": 267272, + "total_acs": 186607, + "total_submitted": 269254, "frontend_question_id": 791, "is_new_question": false }, @@ -35182,8 +35504,8 @@ "question__title": "Domino and Tromino Tiling", "question__title_slug": "domino-and-tromino-tiling", "question__hide": false, - "total_acs": 48874, - "total_submitted": 101768, + "total_acs": 49361, + "total_submitted": 102659, "frontend_question_id": 790, "is_new_question": false }, @@ -35205,8 +35527,8 @@ "question__title": "Escape The Ghosts", "question__title_slug": "escape-the-ghosts", "question__hide": false, - "total_acs": 21654, - "total_submitted": 35926, + "total_acs": 21768, + "total_submitted": 36114, "frontend_question_id": 789, "is_new_question": false }, @@ -35228,8 +35550,8 @@ "question__title": "Rotated Digits", "question__title_slug": "rotated-digits", "question__hide": false, - "total_acs": 86483, - "total_submitted": 151506, + "total_acs": 86882, + "total_submitted": 152251, "frontend_question_id": 788, "is_new_question": false }, @@ -35251,8 +35573,8 @@ "question__title": "Cheapest Flights Within K Stops", "question__title_slug": "cheapest-flights-within-k-stops", "question__hide": false, - "total_acs": 243485, - "total_submitted": 678106, + "total_acs": 247235, + "total_submitted": 688961, "frontend_question_id": 787, "is_new_question": false }, @@ -35274,14 +35596,14 @@ "question__title": "K-th Smallest Prime Fraction", "question__title_slug": "k-th-smallest-prime-fraction", "question__hide": false, - "total_acs": 27021, - "total_submitted": 55150, + "total_acs": 27566, + "total_submitted": 55926, "frontend_question_id": 786, "is_new_question": false }, "status": null, "difficulty": { - "level": 3 + "level": 2 }, "paid_only": false, "is_favor": false, @@ -35297,8 +35619,8 @@ "question__title": "Is Graph Bipartite?", "question__title_slug": "is-graph-bipartite", "question__hide": false, - "total_acs": 323815, - "total_submitted": 623724, + "total_acs": 328391, + "total_submitted": 631305, "frontend_question_id": 785, "is_new_question": false }, @@ -35320,8 +35642,8 @@ "question__title": "Letter Case Permutation", "question__title_slug": "letter-case-permutation", "question__hide": false, - "total_acs": 222169, - "total_submitted": 305440, + "total_acs": 224998, + "total_submitted": 308962, "frontend_question_id": 784, "is_new_question": false }, @@ -35343,8 +35665,8 @@ "question__title": "Minimum Distance Between BST Nodes", "question__title_slug": "minimum-distance-between-bst-nodes", "question__hide": false, - "total_acs": 124465, - "total_submitted": 220961, + "total_acs": 125607, + "total_submitted": 222864, "frontend_question_id": 783, "is_new_question": false }, @@ -35366,8 +35688,8 @@ "question__title": "Transform to Chessboard", "question__title_slug": "transform-to-chessboard", "question__hide": false, - "total_acs": 15135, - "total_submitted": 29168, + "total_acs": 15160, + "total_submitted": 29222, "frontend_question_id": 782, "is_new_question": false }, @@ -35389,8 +35711,8 @@ "question__title": "Rabbits in Forest", "question__title_slug": "rabbits-in-forest", "question__hide": false, - "total_acs": 37860, - "total_submitted": 68111, + "total_acs": 38294, + "total_submitted": 68918, "frontend_question_id": 781, "is_new_question": false }, @@ -35412,8 +35734,8 @@ "question__title": "Reaching Points", "question__title_slug": "reaching-points", "question__hide": false, - "total_acs": 42926, - "total_submitted": 135317, + "total_acs": 43473, + "total_submitted": 136750, "frontend_question_id": 780, "is_new_question": false }, @@ -35435,8 +35757,8 @@ "question__title": "K-th Symbol in Grammar", "question__title_slug": "k-th-symbol-in-grammar", "question__hide": false, - "total_acs": 88848, - "total_submitted": 221747, + "total_acs": 90343, + "total_submitted": 225007, "frontend_question_id": 779, "is_new_question": false }, @@ -35458,8 +35780,8 @@ "question__title": "Swim in Rising Water", "question__title_slug": "swim-in-rising-water", "question__hide": false, - "total_acs": 83833, - "total_submitted": 141733, + "total_acs": 86170, + "total_submitted": 145461, "frontend_question_id": 778, "is_new_question": false }, @@ -35481,8 +35803,8 @@ "question__title": "Swap Adjacent in LR String", "question__title_slug": "swap-adjacent-in-lr-string", "question__hide": false, - "total_acs": 57613, - "total_submitted": 157446, + "total_acs": 58523, + "total_submitted": 159820, "frontend_question_id": 777, "is_new_question": false }, @@ -35504,8 +35826,8 @@ "question__title": "Binary Search", "question__title_slug": "binary-search", "question__hide": false, - "total_acs": 980567, - "total_submitted": 1776662, + "total_acs": 1012908, + "total_submitted": 1835116, "frontend_question_id": 704, "is_new_question": false }, @@ -35527,8 +35849,8 @@ "question__title": "Split BST", "question__title_slug": "split-bst", "question__hide": false, - "total_acs": 27312, - "total_submitted": 46669, + "total_acs": 27400, + "total_submitted": 46817, "frontend_question_id": 776, "is_new_question": false }, @@ -35550,8 +35872,8 @@ "question__title": "Global and Local Inversions", "question__title_slug": "global-and-local-inversions", "question__hide": false, - "total_acs": 57974, - "total_submitted": 129226, + "total_acs": 58326, + "total_submitted": 130269, "frontend_question_id": 775, "is_new_question": false }, @@ -35573,8 +35895,8 @@ "question__title": "Kth Largest Element in a Stream", "question__title_slug": "kth-largest-element-in-a-stream", "question__hide": false, - "total_acs": 261320, - "total_submitted": 475401, + "total_acs": 266034, + "total_submitted": 483425, "frontend_question_id": 703, "is_new_question": false }, @@ -35596,8 +35918,8 @@ "question__title": "Minimize Max Distance to Gas Station", "question__title_slug": "minimize-max-distance-to-gas-station", "question__hide": false, - "total_acs": 25850, - "total_submitted": 51061, + "total_acs": 25960, + "total_submitted": 51214, "frontend_question_id": 774, "is_new_question": false }, @@ -35619,8 +35941,8 @@ "question__title": "Sliding Puzzle", "question__title_slug": "sliding-puzzle", "question__hide": false, - "total_acs": 73272, - "total_submitted": 115652, + "total_acs": 73763, + "total_submitted": 116361, "frontend_question_id": 773, "is_new_question": false }, @@ -35642,8 +35964,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": 73593, - "total_submitted": 103650, + "total_acs": 74358, + "total_submitted": 104688, "frontend_question_id": 702, "is_new_question": false }, @@ -35665,8 +35987,8 @@ "question__title": "Basic Calculator III", "question__title_slug": "basic-calculator-iii", "question__hide": false, - "total_acs": 88090, - "total_submitted": 184296, + "total_acs": 88806, + "total_submitted": 185495, "frontend_question_id": 772, "is_new_question": false }, @@ -35688,8 +36010,8 @@ "question__title": "Insert into a Binary Search Tree", "question__title_slug": "insert-into-a-binary-search-tree", "question__hide": false, - "total_acs": 317068, - "total_submitted": 423617, + "total_acs": 321305, + "total_submitted": 429390, "frontend_question_id": 701, "is_new_question": false }, @@ -35711,8 +36033,8 @@ "question__title": "Search in a Binary Search Tree", "question__title_slug": "search-in-a-binary-search-tree", "question__hide": false, - "total_acs": 500378, - "total_submitted": 653289, + "total_acs": 507314, + "total_submitted": 661809, "frontend_question_id": 700, "is_new_question": false }, @@ -35734,8 +36056,8 @@ "question__title": "Jewels and Stones", "question__title_slug": "jewels-and-stones", "question__hide": false, - "total_acs": 749116, - "total_submitted": 853323, + "total_acs": 752892, + "total_submitted": 857468, "frontend_question_id": 771, "is_new_question": false }, @@ -35757,8 +36079,8 @@ "question__title": "Basic Calculator IV", "question__title_slug": "basic-calculator-iv", "question__hide": false, - "total_acs": 8285, - "total_submitted": 14811, + "total_acs": 8307, + "total_submitted": 14873, "frontend_question_id": 770, "is_new_question": false }, @@ -35780,8 +36102,8 @@ "question__title": "Max Chunks To Make Sorted", "question__title_slug": "max-chunks-to-make-sorted", "question__hide": false, - "total_acs": 73787, - "total_submitted": 127777, + "total_acs": 74454, + "total_submitted": 128822, "frontend_question_id": 769, "is_new_question": false }, @@ -35803,8 +36125,8 @@ "question__title": "Max Chunks To Make Sorted II", "question__title_slug": "max-chunks-to-make-sorted-ii", "question__hide": false, - "total_acs": 42713, - "total_submitted": 81830, + "total_acs": 43085, + "total_submitted": 82477, "frontend_question_id": 768, "is_new_question": false }, @@ -35826,8 +36148,8 @@ "question__title": "Reorganize String", "question__title_slug": "reorganize-string", "question__hide": false, - "total_acs": 217649, - "total_submitted": 416662, + "total_acs": 220166, + "total_submitted": 420866, "frontend_question_id": 767, "is_new_question": false }, @@ -35849,8 +36171,8 @@ "question__title": "Toeplitz Matrix", "question__title_slug": "toeplitz-matrix", "question__hide": false, - "total_acs": 191555, - "total_submitted": 281236, + "total_acs": 193464, + "total_submitted": 284075, "frontend_question_id": 766, "is_new_question": false }, @@ -35872,8 +36194,8 @@ "question__title": "N-ary Tree Postorder Traversal", "question__title_slug": "n-ary-tree-postorder-traversal", "question__hide": false, - "total_acs": 186438, - "total_submitted": 244177, + "total_acs": 188357, + "total_submitted": 246405, "frontend_question_id": 590, "is_new_question": false }, @@ -35895,8 +36217,8 @@ "question__title": "N-ary Tree Preorder Traversal", "question__title_slug": "n-ary-tree-preorder-traversal", "question__hide": false, - "total_acs": 238610, - "total_submitted": 312803, + "total_acs": 246126, + "total_submitted": 322313, "frontend_question_id": 589, "is_new_question": false }, @@ -35918,8 +36240,8 @@ "question__title": "Maximum Depth of N-ary Tree", "question__title_slug": "maximum-depth-of-n-ary-tree", "question__hide": false, - "total_acs": 215382, - "total_submitted": 302475, + "total_acs": 217109, + "total_submitted": 304696, "frontend_question_id": 559, "is_new_question": false }, @@ -35941,8 +36263,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": 11389, - "total_submitted": 24059, + "total_acs": 11441, + "total_submitted": 24144, "frontend_question_id": 558, "is_new_question": false }, @@ -35964,8 +36286,8 @@ "question__title": "Construct Quad Tree", "question__title_slug": "construct-quad-tree", "question__hide": false, - "total_acs": 44548, - "total_submitted": 67918, + "total_acs": 45081, + "total_submitted": 68622, "frontend_question_id": 427, "is_new_question": false }, @@ -35987,8 +36309,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": 17303, - "total_submitted": 22129, + "total_acs": 17403, + "total_submitted": 22246, "frontend_question_id": 431, "is_new_question": false }, @@ -36010,8 +36332,8 @@ "question__title": "Couples Holding Hands", "question__title_slug": "couples-holding-hands", "question__hide": false, - "total_acs": 45077, - "total_submitted": 79561, + "total_acs": 45530, + "total_submitted": 80323, "frontend_question_id": 765, "is_new_question": false }, @@ -36033,8 +36355,8 @@ "question__title": "Largest Plus Sign", "question__title_slug": "largest-plus-sign", "question__hide": false, - "total_acs": 48956, - "total_submitted": 100850, + "total_acs": 49185, + "total_submitted": 101309, "frontend_question_id": 764, "is_new_question": false }, @@ -36056,8 +36378,8 @@ "question__title": "Partition Labels", "question__title_slug": "partition-labels", "question__hide": false, - "total_acs": 393731, - "total_submitted": 494509, + "total_acs": 397108, + "total_submitted": 498555, "frontend_question_id": 763, "is_new_question": false }, @@ -36079,8 +36401,8 @@ "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": 70579, - "total_submitted": 105310, + "total_acs": 71027, + "total_submitted": 105884, "frontend_question_id": 762, "is_new_question": false }, @@ -36102,8 +36424,8 @@ "question__title": "Flatten a Multilevel Doubly Linked List", "question__title_slug": "flatten-a-multilevel-doubly-linked-list", "question__hide": false, - "total_acs": 238879, - "total_submitted": 404758, + "total_acs": 241104, + "total_submitted": 408295, "frontend_question_id": 430, "is_new_question": false }, @@ -36125,8 +36447,8 @@ "question__title": "Serialize and Deserialize N-ary Tree", "question__title_slug": "serialize-and-deserialize-n-ary-tree", "question__hide": false, - "total_acs": 67268, - "total_submitted": 104111, + "total_acs": 67819, + "total_submitted": 104870, "frontend_question_id": 428, "is_new_question": false }, @@ -36148,8 +36470,8 @@ "question__title": "N-ary Tree Level Order Traversal", "question__title_slug": "n-ary-tree-level-order-traversal", "question__hide": false, - "total_acs": 182186, - "total_submitted": 264145, + "total_acs": 184269, + "total_submitted": 266998, "frontend_question_id": 429, "is_new_question": false }, @@ -36171,8 +36493,8 @@ "question__title": "Special Binary String", "question__title_slug": "special-binary-string", "question__hide": false, - "total_acs": 13580, - "total_submitted": 22661, + "total_acs": 13662, + "total_submitted": 22769, "frontend_question_id": 761, "is_new_question": false }, @@ -36194,8 +36516,8 @@ "question__title": "Find Anagram Mappings", "question__title_slug": "find-anagram-mappings", "question__hide": false, - "total_acs": 82231, - "total_submitted": 99415, + "total_acs": 82526, + "total_submitted": 99747, "frontend_question_id": 760, "is_new_question": false }, @@ -36217,8 +36539,8 @@ "question__title": "Employee Free Time", "question__title_slug": "employee-free-time", "question__hide": false, - "total_acs": 111441, - "total_submitted": 156388, + "total_acs": 112677, + "total_submitted": 157955, "frontend_question_id": 759, "is_new_question": false }, @@ -36240,8 +36562,8 @@ "question__title": "Bold Words in String", "question__title_slug": "bold-words-in-string", "question__hide": false, - "total_acs": 16838, - "total_submitted": 33408, + "total_acs": 16876, + "total_submitted": 33479, "frontend_question_id": 758, "is_new_question": false }, @@ -36263,8 +36585,8 @@ "question__title": "Set Intersection Size At Least Two", "question__title_slug": "set-intersection-size-at-least-two", "question__hide": false, - "total_acs": 15835, - "total_submitted": 36660, + "total_acs": 15921, + "total_submitted": 36810, "frontend_question_id": 757, "is_new_question": false }, @@ -36286,8 +36608,8 @@ "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": 216294, - "total_submitted": 335479, + "total_acs": 217742, + "total_submitted": 337707, "frontend_question_id": 426, "is_new_question": false }, @@ -36309,8 +36631,8 @@ "question__title": "Pyramid Transition Matrix", "question__title_slug": "pyramid-transition-matrix", "question__hide": false, - "total_acs": 27563, - "total_submitted": 50735, + "total_acs": 27766, + "total_submitted": 51206, "frontend_question_id": 756, "is_new_question": false }, @@ -36332,8 +36654,8 @@ "question__title": "Pour Water", "question__title_slug": "pour-water", "question__hide": false, - "total_acs": 30973, - "total_submitted": 67677, + "total_acs": 31100, + "total_submitted": 67913, "frontend_question_id": 755, "is_new_question": false }, @@ -36355,8 +36677,8 @@ "question__title": "Reach a Number", "question__title_slug": "reach-a-number", "question__hide": false, - "total_acs": 39355, - "total_submitted": 93743, + "total_acs": 39625, + "total_submitted": 94309, "frontend_question_id": 754, "is_new_question": false }, @@ -36378,8 +36700,8 @@ "question__title": "Cracking the Safe", "question__title_slug": "cracking-the-safe", "question__hide": false, - "total_acs": 47163, - "total_submitted": 85969, + "total_acs": 47423, + "total_submitted": 86403, "frontend_question_id": 753, "is_new_question": false }, @@ -36401,8 +36723,8 @@ "question__title": "Open the Lock", "question__title_slug": "open-the-lock", "question__hide": false, - "total_acs": 167520, - "total_submitted": 302488, + "total_acs": 169336, + "total_submitted": 305666, "frontend_question_id": 752, "is_new_question": false }, @@ -36424,8 +36746,8 @@ "question__title": "IP to CIDR", "question__title_slug": "ip-to-cidr", "question__hide": false, - "total_acs": 14550, - "total_submitted": 26577, + "total_acs": 14670, + "total_submitted": 26812, "frontend_question_id": 751, "is_new_question": false }, @@ -36447,8 +36769,8 @@ "question__title": "Number Of Corner Rectangles", "question__title_slug": "number-of-corner-rectangles", "question__hide": false, - "total_acs": 35909, - "total_submitted": 53166, + "total_acs": 35958, + "total_submitted": 53233, "frontend_question_id": 750, "is_new_question": false }, @@ -36470,8 +36792,8 @@ "question__title": "Contain Virus", "question__title_slug": "contain-virus", "question__hide": false, - "total_acs": 8477, - "total_submitted": 16851, + "total_acs": 8542, + "total_submitted": 16965, "frontend_question_id": 749, "is_new_question": false }, @@ -36493,8 +36815,8 @@ "question__title": "Shortest Completing Word", "question__title_slug": "shortest-completing-word", "question__hide": false, - "total_acs": 51341, - "total_submitted": 87016, + "total_acs": 51687, + "total_submitted": 87564, "frontend_question_id": 748, "is_new_question": false }, @@ -36516,8 +36838,8 @@ "question__title": "Largest Number At Least Twice of Others", "question__title_slug": "largest-number-at-least-twice-of-others", "question__hide": false, - "total_acs": 163392, - "total_submitted": 359551, + "total_acs": 164979, + "total_submitted": 362632, "frontend_question_id": 747, "is_new_question": false }, @@ -36539,8 +36861,8 @@ "question__title": "Min Cost Climbing Stairs", "question__title_slug": "min-cost-climbing-stairs", "question__hide": false, - "total_acs": 495798, - "total_submitted": 835003, + "total_acs": 507326, + "total_submitted": 851375, "frontend_question_id": 746, "is_new_question": false }, @@ -36562,8 +36884,8 @@ "question__title": "Prefix and Suffix Search", "question__title_slug": "prefix-and-suffix-search", "question__hide": false, - "total_acs": 52645, - "total_submitted": 142312, + "total_acs": 84445, + "total_submitted": 203994, "frontend_question_id": 745, "is_new_question": false }, @@ -36585,8 +36907,8 @@ "question__title": "Find Smallest Letter Greater Than Target", "question__title_slug": "find-smallest-letter-greater-than-target", "question__hide": false, - "total_acs": 205923, - "total_submitted": 458713, + "total_acs": 210656, + "total_submitted": 469649, "frontend_question_id": 744, "is_new_question": false }, @@ -36608,8 +36930,8 @@ "question__title": "Network Delay Time", "question__title_slug": "network-delay-time", "question__hide": false, - "total_acs": 287815, - "total_submitted": 571095, + "total_acs": 292330, + "total_submitted": 578727, "frontend_question_id": 743, "is_new_question": false }, @@ -36631,8 +36953,8 @@ "question__title": "Closest Leaf in a Binary Tree", "question__title_slug": "closest-leaf-in-a-binary-tree", "question__hide": false, - "total_acs": 38818, - "total_submitted": 84918, + "total_acs": 38964, + "total_submitted": 85220, "frontend_question_id": 742, "is_new_question": false }, @@ -36654,8 +36976,8 @@ "question__title": "To Lower Case", "question__title_slug": "to-lower-case", "question__hide": false, - "total_acs": 349058, - "total_submitted": 428248, + "total_acs": 351693, + "total_submitted": 431329, "frontend_question_id": 709, "is_new_question": false }, @@ -36677,8 +36999,8 @@ "question__title": "Cherry Pickup", "question__title_slug": "cherry-pickup", "question__hide": false, - "total_acs": 54462, - "total_submitted": 150230, + "total_acs": 55000, + "total_submitted": 151779, "frontend_question_id": 741, "is_new_question": false }, @@ -36700,8 +37022,8 @@ "question__title": "Delete and Earn", "question__title_slug": "delete-and-earn", "question__hide": false, - "total_acs": 198082, - "total_submitted": 344749, + "total_acs": 201918, + "total_submitted": 351338, "frontend_question_id": 740, "is_new_question": false }, @@ -36723,8 +37045,8 @@ "question__title": "Daily Temperatures", "question__title_slug": "daily-temperatures", "question__hide": false, - "total_acs": 406394, - "total_submitted": 603545, + "total_acs": 413337, + "total_submitted": 613145, "frontend_question_id": 739, "is_new_question": false }, @@ -36746,8 +37068,8 @@ "question__title": "Monotone Increasing Digits", "question__title_slug": "monotone-increasing-digits", "question__hide": false, - "total_acs": 38623, - "total_submitted": 82428, + "total_acs": 38924, + "total_submitted": 83039, "frontend_question_id": 738, "is_new_question": false }, @@ -36769,8 +37091,8 @@ "question__title": "Sentence Similarity II", "question__title_slug": "sentence-similarity-ii", "question__hide": false, - "total_acs": 60289, - "total_submitted": 124770, + "total_acs": 60602, + "total_submitted": 125293, "frontend_question_id": 737, "is_new_question": false }, @@ -36792,8 +37114,8 @@ "question__title": "Parse Lisp Expression", "question__title_slug": "parse-lisp-expression", "question__hide": false, - "total_acs": 18754, - "total_submitted": 36553, + "total_acs": 18817, + "total_submitted": 36680, "frontend_question_id": 736, "is_new_question": false }, @@ -36815,8 +37137,8 @@ "question__title": "Asteroid Collision", "question__title_slug": "asteroid-collision", "question__hide": false, - "total_acs": 204435, - "total_submitted": 461236, + "total_acs": 207123, + "total_submitted": 467283, "frontend_question_id": 735, "is_new_question": false }, @@ -36838,8 +37160,8 @@ "question__title": "Sentence Similarity", "question__title_slug": "sentence-similarity", "question__hide": false, - "total_acs": 51395, - "total_submitted": 119468, + "total_acs": 51585, + "total_submitted": 119947, "frontend_question_id": 734, "is_new_question": false }, @@ -36861,8 +37183,8 @@ "question__title": "Flood Fill", "question__title_slug": "flood-fill", "question__hide": false, - "total_acs": 441203, - "total_submitted": 754516, + "total_acs": 454227, + "total_submitted": 773680, "frontend_question_id": 733, "is_new_question": false }, @@ -36884,8 +37206,8 @@ "question__title": "My Calendar III", "question__title_slug": "my-calendar-iii", "question__hide": false, - "total_acs": 41453, - "total_submitted": 62040, + "total_acs": 41780, + "total_submitted": 62471, "frontend_question_id": 732, "is_new_question": false }, @@ -36907,8 +37229,8 @@ "question__title": "My Calendar II", "question__title_slug": "my-calendar-ii", "question__hide": false, - "total_acs": 75227, - "total_submitted": 140154, + "total_acs": 75835, + "total_submitted": 141126, "frontend_question_id": 731, "is_new_question": false }, @@ -36930,8 +37252,8 @@ "question__title": "Count Different Palindromic Subsequences", "question__title_slug": "count-different-palindromic-subsequences", "question__hide": false, - "total_acs": 27787, - "total_submitted": 62369, + "total_acs": 28120, + "total_submitted": 63157, "frontend_question_id": 730, "is_new_question": false }, @@ -36953,8 +37275,8 @@ "question__title": "My Calendar I", "question__title_slug": "my-calendar-i", "question__hide": false, - "total_acs": 150358, - "total_submitted": 271947, + "total_acs": 152171, + "total_submitted": 274981, "frontend_question_id": 729, "is_new_question": false }, @@ -36976,8 +37298,8 @@ "question__title": "Self Dividing Numbers", "question__title_slug": "self-dividing-numbers", "question__hide": false, - "total_acs": 178568, - "total_submitted": 231496, + "total_acs": 179389, + "total_submitted": 232446, "frontend_question_id": 728, "is_new_question": false }, @@ -36999,8 +37321,8 @@ "question__title": "Minimum Window Subsequence", "question__title_slug": "minimum-window-subsequence", "question__hide": false, - "total_acs": 78025, - "total_submitted": 182076, + "total_acs": 78296, + "total_submitted": 182755, "frontend_question_id": 727, "is_new_question": false }, @@ -37022,8 +37344,8 @@ "question__title": "Number of Atoms", "question__title_slug": "number-of-atoms", "question__hide": false, - "total_acs": 45913, - "total_submitted": 88543, + "total_acs": 46199, + "total_submitted": 89031, "frontend_question_id": 726, "is_new_question": false }, @@ -37045,8 +37367,8 @@ "question__title": "Split Linked List in Parts", "question__title_slug": "split-linked-list-in-parts", "question__hide": false, - "total_acs": 97910, - "total_submitted": 172014, + "total_acs": 98552, + "total_submitted": 173083, "frontend_question_id": 725, "is_new_question": false }, @@ -37068,8 +37390,8 @@ "question__title": "Find Pivot Index", "question__title_slug": "find-pivot-index", "question__hide": false, - "total_acs": 320773, - "total_submitted": 617429, + "total_acs": 351466, + "total_submitted": 671690, "frontend_question_id": 724, "is_new_question": false }, @@ -37091,8 +37413,8 @@ "question__title": "Candy Crush", "question__title_slug": "candy-crush", "question__hide": false, - "total_acs": 51755, - "total_submitted": 68608, + "total_acs": 52205, + "total_submitted": 69149, "frontend_question_id": 723, "is_new_question": false }, @@ -37114,8 +37436,8 @@ "question__title": "Remove Comments", "question__title_slug": "remove-comments", "question__hide": false, - "total_acs": 55491, - "total_submitted": 148100, + "total_acs": 55922, + "total_submitted": 148984, "frontend_question_id": 722, "is_new_question": false }, @@ -37137,8 +37459,8 @@ "question__title": "Accounts Merge", "question__title_slug": "accounts-merge", "question__hide": false, - "total_acs": 255657, - "total_submitted": 456245, + "total_acs": 258422, + "total_submitted": 460977, "frontend_question_id": 721, "is_new_question": false }, @@ -37160,8 +37482,8 @@ "question__title": "Longest Word in Dictionary", "question__title_slug": "longest-word-in-dictionary", "question__hide": false, - "total_acs": 117621, - "total_submitted": 229660, + "total_acs": 119240, + "total_submitted": 232362, "frontend_question_id": 720, "is_new_question": false }, @@ -37183,8 +37505,8 @@ "question__title": "Find K-th Smallest Pair Distance", "question__title_slug": "find-k-th-smallest-pair-distance", "question__hide": false, - "total_acs": 60721, - "total_submitted": 171692, + "total_acs": 61271, + "total_submitted": 173021, "frontend_question_id": 719, "is_new_question": false }, @@ -37206,8 +37528,8 @@ "question__title": "Maximum Length of Repeated Subarray", "question__title_slug": "maximum-length-of-repeated-subarray", "question__hide": false, - "total_acs": 176210, - "total_submitted": 342969, + "total_acs": 177994, + "total_submitted": 346367, "frontend_question_id": 718, "is_new_question": false }, @@ -37229,8 +37551,8 @@ "question__title": "1-bit and 2-bit Characters", "question__title_slug": "1-bit-and-2-bit-characters", "question__hide": false, - "total_acs": 105113, - "total_submitted": 227820, + "total_acs": 105532, + "total_submitted": 228799, "frontend_question_id": 717, "is_new_question": false }, @@ -37252,14 +37574,14 @@ "question__title": "Max Stack", "question__title_slug": "max-stack", "question__hide": false, - "total_acs": 125499, - "total_submitted": 277388, + "total_acs": 126874, + "total_submitted": 280148, "frontend_question_id": 716, "is_new_question": false }, "status": null, "difficulty": { - "level": 1 + "level": 3 }, "paid_only": true, "is_favor": false, @@ -37275,8 +37597,8 @@ "question__title": "Range Module", "question__title_slug": "range-module", "question__hide": false, - "total_acs": 46099, - "total_submitted": 104973, + "total_acs": 46932, + "total_submitted": 106553, "frontend_question_id": 715, "is_new_question": false }, @@ -37298,8 +37620,8 @@ "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": 172540, - "total_submitted": 275123, + "total_acs": 175228, + "total_submitted": 278663, "frontend_question_id": 714, "is_new_question": false }, @@ -37321,8 +37643,8 @@ "question__title": "Subarray Product Less Than K", "question__title_slug": "subarray-product-less-than-k", "question__hide": false, - "total_acs": 173931, - "total_submitted": 393733, + "total_acs": 176557, + "total_submitted": 398955, "frontend_question_id": 713, "is_new_question": false }, @@ -37344,8 +37666,8 @@ "question__title": "Minimum ASCII Delete Sum for Two Strings", "question__title_slug": "minimum-ascii-delete-sum-for-two-strings", "question__hide": false, - "total_acs": 64555, - "total_submitted": 104543, + "total_acs": 65243, + "total_submitted": 105578, "frontend_question_id": 712, "is_new_question": false }, @@ -37367,8 +37689,8 @@ "question__title": "Number of Distinct Islands II", "question__title_slug": "number-of-distinct-islands-ii", "question__hide": false, - "total_acs": 8392, - "total_submitted": 16360, + "total_acs": 8512, + "total_submitted": 16510, "frontend_question_id": 711, "is_new_question": false }, @@ -37390,8 +37712,8 @@ "question__title": "Falling Squares", "question__title_slug": "falling-squares", "question__hide": false, - "total_acs": 20183, - "total_submitted": 45740, + "total_acs": 20322, + "total_submitted": 46052, "frontend_question_id": 699, "is_new_question": false }, @@ -37413,8 +37735,8 @@ "question__title": "Partition to K Equal Sum Subsets", "question__title_slug": "partition-to-k-equal-sum-subsets", "question__hide": false, - "total_acs": 202211, - "total_submitted": 468144, + "total_acs": 204125, + "total_submitted": 475207, "frontend_question_id": 698, "is_new_question": false }, @@ -37436,8 +37758,8 @@ "question__title": "Degree of an Array", "question__title_slug": "degree-of-an-array", "question__hide": false, - "total_acs": 153538, - "total_submitted": 275608, + "total_acs": 154871, + "total_submitted": 277804, "frontend_question_id": 697, "is_new_question": false }, @@ -37459,8 +37781,8 @@ "question__title": "Count Binary Substrings", "question__title_slug": "count-binary-substrings", "question__hide": false, - "total_acs": 157036, - "total_submitted": 241233, + "total_acs": 158722, + "total_submitted": 243637, "frontend_question_id": 696, "is_new_question": false }, @@ -37482,8 +37804,8 @@ "question__title": "Max Area of Island", "question__title_slug": "max-area-of-island", "question__hide": false, - "total_acs": 492412, - "total_submitted": 702655, + "total_acs": 500881, + "total_submitted": 713908, "frontend_question_id": 695, "is_new_question": false }, @@ -37505,8 +37827,8 @@ "question__title": "Number of Distinct Islands", "question__title_slug": "number-of-distinct-islands", "question__hide": false, - "total_acs": 128033, - "total_submitted": 212942, + "total_acs": 129027, + "total_submitted": 214398, "frontend_question_id": 694, "is_new_question": false }, @@ -37528,8 +37850,8 @@ "question__title": "Binary Number with Alternating Bits", "question__title_slug": "binary-number-with-alternating-bits", "question__hide": false, - "total_acs": 94853, - "total_submitted": 155535, + "total_acs": 95556, + "total_submitted": 156651, "frontend_question_id": 693, "is_new_question": false }, @@ -37551,8 +37873,8 @@ "question__title": "Top K Frequent Words", "question__title_slug": "top-k-frequent-words", "question__hide": false, - "total_acs": 387578, - "total_submitted": 711298, + "total_acs": 391470, + "total_submitted": 717899, "frontend_question_id": 692, "is_new_question": false }, @@ -37574,8 +37896,8 @@ "question__title": "Stickers to Spell Word", "question__title_slug": "stickers-to-spell-word", "question__hide": false, - "total_acs": 31237, - "total_submitted": 66918, + "total_acs": 31421, + "total_submitted": 67364, "frontend_question_id": 691, "is_new_question": false }, @@ -37597,8 +37919,8 @@ "question__title": "Employee Importance", "question__title_slug": "employee-importance", "question__hide": false, - "total_acs": 176808, - "total_submitted": 274674, + "total_acs": 177869, + "total_submitted": 275900, "frontend_question_id": 690, "is_new_question": false }, @@ -37620,8 +37942,8 @@ "question__title": "Maximum Sum of 3 Non-Overlapping Subarrays", "question__title_slug": "maximum-sum-of-3-non-overlapping-subarrays", "question__hide": false, - "total_acs": 63224, - "total_submitted": 130005, + "total_acs": 63397, + "total_submitted": 130408, "frontend_question_id": 689, "is_new_question": false }, @@ -37643,8 +37965,8 @@ "question__title": "Knight Probability in Chessboard", "question__title_slug": "knight-probability-in-chessboard", "question__hide": false, - "total_acs": 82002, - "total_submitted": 158740, + "total_acs": 82594, + "total_submitted": 159863, "frontend_question_id": 688, "is_new_question": false }, @@ -37666,8 +37988,8 @@ "question__title": "Longest Univalue Path", "question__title_slug": "longest-univalue-path", "question__hide": false, - "total_acs": 144716, - "total_submitted": 365615, + "total_acs": 145670, + "total_submitted": 367536, "frontend_question_id": 687, "is_new_question": false }, @@ -37689,8 +38011,8 @@ "question__title": "Repeated String Match", "question__title_slug": "repeated-string-match", "question__hide": false, - "total_acs": 123412, - "total_submitted": 366382, + "total_acs": 124271, + "total_submitted": 368425, "frontend_question_id": 686, "is_new_question": false }, @@ -37712,8 +38034,8 @@ "question__title": "Redundant Connection II", "question__title_slug": "redundant-connection-ii", "question__hide": false, - "total_acs": 53361, - "total_submitted": 157493, + "total_acs": 53782, + "total_submitted": 158703, "frontend_question_id": 685, "is_new_question": false }, @@ -37735,8 +38057,8 @@ "question__title": "Redundant Connection", "question__title_slug": "redundant-connection", "question__hide": false, - "total_acs": 208266, - "total_submitted": 339184, + "total_acs": 211559, + "total_submitted": 344214, "frontend_question_id": 684, "is_new_question": false }, @@ -37758,8 +38080,8 @@ "question__title": "K Empty Slots", "question__title_slug": "k-empty-slots", "question__hide": false, - "total_acs": 56758, - "total_submitted": 154363, + "total_acs": 56895, + "total_submitted": 154659, "frontend_question_id": 683, "is_new_question": false }, @@ -37781,8 +38103,8 @@ "question__title": "Baseball Game", "question__title_slug": "baseball-game", "question__hide": false, - "total_acs": 200059, - "total_submitted": 273094, + "total_acs": 201545, + "total_submitted": 274948, "frontend_question_id": 682, "is_new_question": false }, @@ -37804,8 +38126,8 @@ "question__title": "Next Closest Time", "question__title_slug": "next-closest-time", "question__hide": false, - "total_acs": 95998, - "total_submitted": 206775, + "total_acs": 96363, + "total_submitted": 207599, "frontend_question_id": 681, "is_new_question": false }, @@ -37827,8 +38149,8 @@ "question__title": "Valid Palindrome II", "question__title_slug": "valid-palindrome-ii", "question__hide": false, - "total_acs": 509598, - "total_submitted": 1293073, + "total_acs": 513685, + "total_submitted": 1303155, "frontend_question_id": 680, "is_new_question": false }, @@ -37850,8 +38172,8 @@ "question__title": "24 Game", "question__title_slug": "24-game", "question__hide": false, - "total_acs": 64607, - "total_submitted": 132203, + "total_acs": 64928, + "total_submitted": 132800, "frontend_question_id": 679, "is_new_question": false }, @@ -37873,8 +38195,8 @@ "question__title": "Valid Parenthesis String", "question__title_slug": "valid-parenthesis-string", "question__hide": false, - "total_acs": 174150, - "total_submitted": 520556, + "total_acs": 175671, + "total_submitted": 524286, "frontend_question_id": 678, "is_new_question": false }, @@ -37896,8 +38218,8 @@ "question__title": "Map Sum Pairs", "question__title_slug": "map-sum-pairs", "question__hide": false, - "total_acs": 90153, - "total_submitted": 158207, + "total_acs": 90913, + "total_submitted": 159559, "frontend_question_id": 677, "is_new_question": false }, @@ -37919,8 +38241,8 @@ "question__title": "Implement Magic Dictionary", "question__title_slug": "implement-magic-dictionary", "question__hide": false, - "total_acs": 64433, - "total_submitted": 113814, + "total_acs": 64897, + "total_submitted": 114574, "frontend_question_id": 676, "is_new_question": false }, @@ -37942,8 +38264,8 @@ "question__title": "Cut Off Trees for Golf Event", "question__title_slug": "cut-off-trees-for-golf-event", "question__hide": false, - "total_acs": 56273, - "total_submitted": 160051, + "total_acs": 56579, + "total_submitted": 161110, "frontend_question_id": 675, "is_new_question": false }, @@ -37965,8 +38287,8 @@ "question__title": "Longest Continuous Increasing Subsequence", "question__title_slug": "longest-continuous-increasing-subsequence", "question__hide": false, - "total_acs": 197233, - "total_submitted": 405724, + "total_acs": 198439, + "total_submitted": 407774, "frontend_question_id": 674, "is_new_question": false }, @@ -37988,8 +38310,8 @@ "question__title": "Number of Longest Increasing Subsequence", "question__title_slug": "number-of-longest-increasing-subsequence", "question__hide": false, - "total_acs": 115413, - "total_submitted": 279992, + "total_acs": 116959, + "total_submitted": 283006, "frontend_question_id": 673, "is_new_question": false }, @@ -38011,8 +38333,8 @@ "question__title": "Bulb Switcher II", "question__title_slug": "bulb-switcher-ii", "question__hide": false, - "total_acs": 17252, - "total_submitted": 34013, + "total_acs": 17354, + "total_submitted": 34205, "frontend_question_id": 672, "is_new_question": false }, @@ -38034,8 +38356,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": 145269, - "total_submitted": 331556, + "total_acs": 146783, + "total_submitted": 334795, "frontend_question_id": 671, "is_new_question": false }, @@ -38057,8 +38379,8 @@ "question__title": "Maximum Swap", "question__title_slug": "maximum-swap", "question__hide": false, - "total_acs": 172567, - "total_submitted": 362133, + "total_acs": 173759, + "total_submitted": 364363, "frontend_question_id": 670, "is_new_question": false }, @@ -38080,8 +38402,8 @@ "question__title": "Trim a Binary Search Tree", "question__title_slug": "trim-a-binary-search-tree", "question__hide": false, - "total_acs": 237352, - "total_submitted": 357967, + "total_acs": 238813, + "total_submitted": 360103, "frontend_question_id": 669, "is_new_question": false }, @@ -38103,8 +38425,8 @@ "question__title": "Kth Smallest Number in Multiplication Table", "question__title_slug": "kth-smallest-number-in-multiplication-table", "question__hide": false, - "total_acs": 49570, - "total_submitted": 96723, + "total_acs": 49900, + "total_submitted": 97292, "frontend_question_id": 668, "is_new_question": false }, @@ -38126,8 +38448,8 @@ "question__title": "Beautiful Arrangement II", "question__title_slug": "beautiful-arrangement-ii", "question__hide": false, - "total_acs": 47689, - "total_submitted": 80228, + "total_acs": 47808, + "total_submitted": 80409, "frontend_question_id": 667, "is_new_question": false }, @@ -38149,8 +38471,8 @@ "question__title": "Path Sum IV", "question__title_slug": "path-sum-iv", "question__hide": false, - "total_acs": 19740, - "total_submitted": 33633, + "total_acs": 19810, + "total_submitted": 33753, "frontend_question_id": 666, "is_new_question": false }, @@ -38172,8 +38494,8 @@ "question__title": "Non-decreasing Array", "question__title_slug": "non-decreasing-array", "question__hide": false, - "total_acs": 174796, - "total_submitted": 807763, + "total_acs": 220377, + "total_submitted": 924946, "frontend_question_id": 665, "is_new_question": false }, @@ -38195,8 +38517,8 @@ "question__title": "Strange Printer", "question__title_slug": "strange-printer", "question__hide": false, - "total_acs": 28491, - "total_submitted": 61300, + "total_acs": 28663, + "total_submitted": 61601, "frontend_question_id": 664, "is_new_question": false }, @@ -38218,8 +38540,8 @@ "question__title": "Equal Tree Partition", "question__title_slug": "equal-tree-partition", "question__hide": false, - "total_acs": 27826, - "total_submitted": 67389, + "total_acs": 27928, + "total_submitted": 67627, "frontend_question_id": 663, "is_new_question": false }, @@ -38241,8 +38563,8 @@ "question__title": "Maximum Width of Binary Tree", "question__title_slug": "maximum-width-of-binary-tree", "question__hide": false, - "total_acs": 191024, - "total_submitted": 473989, + "total_acs": 194256, + "total_submitted": 481872, "frontend_question_id": 662, "is_new_question": false }, @@ -38264,8 +38586,8 @@ "question__title": "Image Smoother", "question__title_slug": "image-smoother", "question__hide": false, - "total_acs": 65473, - "total_submitted": 120067, + "total_acs": 65792, + "total_submitted": 120515, "frontend_question_id": 661, "is_new_question": false }, @@ -38287,8 +38609,8 @@ "question__title": "Remove 9", "question__title_slug": "remove-9", "question__hide": false, - "total_acs": 9544, - "total_submitted": 16883, + "total_acs": 9588, + "total_submitted": 16953, "frontend_question_id": 660, "is_new_question": false }, @@ -38310,8 +38632,8 @@ "question__title": "Split Array into Consecutive Subsequences", "question__title_slug": "split-array-into-consecutive-subsequences", "question__hide": false, - "total_acs": 70764, - "total_submitted": 154527, + "total_acs": 71192, + "total_submitted": 155362, "frontend_question_id": 659, "is_new_question": false }, @@ -38333,8 +38655,8 @@ "question__title": "Find K Closest Elements", "question__title_slug": "find-k-closest-elements", "question__hide": false, - "total_acs": 297597, - "total_submitted": 666284, + "total_acs": 301275, + "total_submitted": 673964, "frontend_question_id": 658, "is_new_question": false }, @@ -38356,8 +38678,8 @@ "question__title": "Robot Return to Origin", "question__title_slug": "robot-return-to-origin", "question__hide": false, - "total_acs": 333768, - "total_submitted": 444370, + "total_acs": 335237, + "total_submitted": 446279, "frontend_question_id": 657, "is_new_question": false }, @@ -38379,8 +38701,8 @@ "question__title": "Coin Path", "question__title_slug": "coin-path", "question__hide": false, - "total_acs": 12582, - "total_submitted": 40187, + "total_acs": 12622, + "total_submitted": 40276, "frontend_question_id": 656, "is_new_question": false }, @@ -38402,8 +38724,8 @@ "question__title": "Print Binary Tree", "question__title_slug": "print-binary-tree", "question__hide": false, - "total_acs": 52544, - "total_submitted": 87065, + "total_acs": 52954, + "total_submitted": 87584, "frontend_question_id": 655, "is_new_question": false }, @@ -38425,8 +38747,8 @@ "question__title": "Maximum Binary Tree", "question__title_slug": "maximum-binary-tree", "question__hide": false, - "total_acs": 217920, - "total_submitted": 259993, + "total_acs": 219726, + "total_submitted": 261971, "frontend_question_id": 654, "is_new_question": false }, @@ -38448,8 +38770,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": 322074, - "total_submitted": 546194, + "total_acs": 326499, + "total_submitted": 553184, "frontend_question_id": 653, "is_new_question": false }, @@ -38471,8 +38793,8 @@ "question__title": "Find Duplicate Subtrees", "question__title_slug": "find-duplicate-subtrees", "question__hide": false, - "total_acs": 156776, - "total_submitted": 279628, + "total_acs": 158839, + "total_submitted": 283055, "frontend_question_id": 652, "is_new_question": false }, @@ -38494,8 +38816,8 @@ "question__title": "4 Keys Keyboard", "question__title_slug": "4-keys-keyboard", "question__hide": false, - "total_acs": 22065, - "total_submitted": 40751, + "total_acs": 22115, + "total_submitted": 40838, "frontend_question_id": 651, "is_new_question": false }, @@ -38517,8 +38839,8 @@ "question__title": "2 Keys Keyboard", "question__title_slug": "2-keys-keyboard", "question__hide": false, - "total_acs": 101946, - "total_submitted": 193799, + "total_acs": 102645, + "total_submitted": 194919, "frontend_question_id": 650, "is_new_question": false }, @@ -38540,8 +38862,8 @@ "question__title": "Dota2 Senate", "question__title_slug": "dota2-senate", "question__hide": false, - "total_acs": 19575, - "total_submitted": 48773, + "total_acs": 19733, + "total_submitted": 49172, "frontend_question_id": 649, "is_new_question": false }, @@ -38563,8 +38885,8 @@ "question__title": "Replace Words", "question__title_slug": "replace-words", "question__hide": false, - "total_acs": 98927, - "total_submitted": 159026, + "total_acs": 99998, + "total_submitted": 160468, "frontend_question_id": 648, "is_new_question": false }, @@ -38586,8 +38908,8 @@ "question__title": "Palindromic Substrings", "question__title_slug": "palindromic-substrings", "question__hide": false, - "total_acs": 458185, - "total_submitted": 696838, + "total_acs": 463217, + "total_submitted": 704044, "frontend_question_id": 647, "is_new_question": false }, @@ -38609,8 +38931,8 @@ "question__title": "Maximum Length of Pair Chain", "question__title_slug": "maximum-length-of-pair-chain", "question__hide": false, - "total_acs": 111698, - "total_submitted": 199836, + "total_acs": 112984, + "total_submitted": 201924, "frontend_question_id": 646, "is_new_question": false }, @@ -38632,8 +38954,8 @@ "question__title": "Set Mismatch", "question__title_slug": "set-mismatch", "question__hide": false, - "total_acs": 172198, - "total_submitted": 417494, + "total_acs": 173638, + "total_submitted": 420902, "frontend_question_id": 645, "is_new_question": false }, @@ -38655,8 +38977,8 @@ "question__title": "Maximum Average Subarray II", "question__title_slug": "maximum-average-subarray-ii", "question__hide": false, - "total_acs": 17502, - "total_submitted": 49447, + "total_acs": 17597, + "total_submitted": 49659, "frontend_question_id": 644, "is_new_question": false }, @@ -38678,8 +39000,8 @@ "question__title": "Maximum Average Subarray I", "question__title_slug": "maximum-average-subarray-i", "question__hide": false, - "total_acs": 148520, - "total_submitted": 340374, + "total_acs": 150290, + "total_submitted": 344105, "frontend_question_id": 643, "is_new_question": false }, @@ -38701,8 +39023,8 @@ "question__title": "Design Search Autocomplete System", "question__title_slug": "design-search-autocomplete-system", "question__hide": false, - "total_acs": 116772, - "total_submitted": 241191, + "total_acs": 117783, + "total_submitted": 243036, "frontend_question_id": 642, "is_new_question": false }, @@ -38724,8 +39046,8 @@ "question__title": "Solve the Equation", "question__title_slug": "solve-the-equation", "question__hide": false, - "total_acs": 32682, - "total_submitted": 75582, + "total_acs": 32768, + "total_submitted": 75763, "frontend_question_id": 640, "is_new_question": false }, @@ -38747,8 +39069,8 @@ "question__title": "Decode Ways II", "question__title_slug": "decode-ways-ii", "question__hide": false, - "total_acs": 61480, - "total_submitted": 202386, + "total_acs": 61728, + "total_submitted": 203334, "frontend_question_id": 639, "is_new_question": false }, @@ -38770,8 +39092,8 @@ "question__title": "Shopping Offers", "question__title_slug": "shopping-offers", "question__hide": false, - "total_acs": 46865, - "total_submitted": 85627, + "total_acs": 47123, + "total_submitted": 86059, "frontend_question_id": 638, "is_new_question": false }, @@ -38793,8 +39115,8 @@ "question__title": "Average of Levels in Binary Tree", "question__title_slug": "average-of-levels-in-binary-tree", "question__hide": false, - "total_acs": 276750, - "total_submitted": 401504, + "total_acs": 279397, + "total_submitted": 404989, "frontend_question_id": 637, "is_new_question": false }, @@ -38816,8 +39138,8 @@ "question__title": "Exclusive Time of Functions", "question__title_slug": "exclusive-time-of-functions", "question__hide": false, - "total_acs": 174543, - "total_submitted": 288288, + "total_acs": 175593, + "total_submitted": 289746, "frontend_question_id": 636, "is_new_question": false }, @@ -38839,8 +39161,8 @@ "question__title": "Design Log Storage System", "question__title_slug": "design-log-storage-system", "question__hide": false, - "total_acs": 30921, - "total_submitted": 49482, + "total_acs": 31043, + "total_submitted": 49666, "frontend_question_id": 635, "is_new_question": false }, @@ -38862,8 +39184,8 @@ "question__title": "Find the Derangement of An Array", "question__title_slug": "find-the-derangement-of-an-array", "question__hide": false, - "total_acs": 8670, - "total_submitted": 20985, + "total_acs": 8742, + "total_submitted": 21162, "frontend_question_id": 634, "is_new_question": false }, @@ -38885,8 +39207,8 @@ "question__title": "Sum of Square Numbers", "question__title_slug": "sum-of-square-numbers", "question__hide": false, - "total_acs": 141175, - "total_submitted": 406459, + "total_acs": 142868, + "total_submitted": 411011, "frontend_question_id": 633, "is_new_question": false }, @@ -38908,8 +39230,8 @@ "question__title": "Smallest Range Covering Elements from K Lists", "question__title_slug": "smallest-range-covering-elements-from-k-lists", "question__hide": false, - "total_acs": 67670, - "total_submitted": 114718, + "total_acs": 68573, + "total_submitted": 115955, "frontend_question_id": 632, "is_new_question": false }, @@ -38931,8 +39253,8 @@ "question__title": "Design Excel Sum Formula", "question__title_slug": "design-excel-sum-formula", "question__hide": false, - "total_acs": 11786, - "total_submitted": 27719, + "total_acs": 12000, + "total_submitted": 28109, "frontend_question_id": 631, "is_new_question": false }, @@ -38954,8 +39276,8 @@ "question__title": "Course Schedule III", "question__title_slug": "course-schedule-iii", "question__hide": false, - "total_acs": 58075, - "total_submitted": 162313, + "total_acs": 93539, + "total_submitted": 233087, "frontend_question_id": 630, "is_new_question": false }, @@ -38977,8 +39299,8 @@ "question__title": "K Inverse Pairs Array", "question__title_slug": "k-inverse-pairs-array", "question__hide": false, - "total_acs": 25113, - "total_submitted": 67366, + "total_acs": 25202, + "total_submitted": 67601, "frontend_question_id": 629, "is_new_question": false }, @@ -39000,8 +39322,8 @@ "question__title": "Maximum Product of Three Numbers", "question__title_slug": "maximum-product-of-three-numbers", "question__hide": false, - "total_acs": 214623, - "total_submitted": 459807, + "total_acs": 216672, + "total_submitted": 464315, "frontend_question_id": 628, "is_new_question": false }, @@ -39023,8 +39345,8 @@ "question__title": "Swap Salary", "question__title_slug": "swap-salary", "question__hide": false, - "total_acs": 210705, - "total_submitted": 260875, + "total_acs": 215971, + "total_submitted": 266588, "frontend_question_id": 627, "is_new_question": false }, @@ -39046,8 +39368,8 @@ "question__title": "Exchange Seats", "question__title_slug": "exchange-seats", "question__hide": false, - "total_acs": 105445, - "total_submitted": 151357, + "total_acs": 106579, + "total_submitted": 152804, "frontend_question_id": 626, "is_new_question": false }, @@ -39069,8 +39391,8 @@ "question__title": "Minimum Factorization", "question__title_slug": "minimum-factorization", "question__hide": false, - "total_acs": 10211, - "total_submitted": 30676, + "total_acs": 10224, + "total_submitted": 30705, "frontend_question_id": 625, "is_new_question": false }, @@ -39092,8 +39414,8 @@ "question__title": "Maximum Distance in Arrays", "question__title_slug": "maximum-distance-in-arrays", "question__hide": false, - "total_acs": 35778, - "total_submitted": 86003, + "total_acs": 35831, + "total_submitted": 86085, "frontend_question_id": 624, "is_new_question": false }, @@ -39115,8 +39437,8 @@ "question__title": "Add One Row to Tree", "question__title_slug": "add-one-row-to-tree", "question__hide": false, - "total_acs": 84900, - "total_submitted": 157149, + "total_acs": 85400, + "total_submitted": 157966, "frontend_question_id": 623, "is_new_question": false }, @@ -39138,8 +39460,8 @@ "question__title": "Task Scheduler", "question__title_slug": "task-scheduler", "question__hide": false, - "total_acs": 344151, - "total_submitted": 628726, + "total_acs": 347513, + "total_submitted": 633692, "frontend_question_id": 621, "is_new_question": false }, @@ -39161,8 +39483,8 @@ "question__title": "Not Boring Movies", "question__title_slug": "not-boring-movies", "question__hide": false, - "total_acs": 189932, - "total_submitted": 261076, + "total_acs": 191475, + "total_submitted": 263023, "frontend_question_id": 620, "is_new_question": false }, @@ -39184,8 +39506,8 @@ "question__title": "Biggest Single Number", "question__title_slug": "biggest-single-number", "question__hide": false, - "total_acs": 48046, - "total_submitted": 100483, + "total_acs": 48653, + "total_submitted": 101525, "frontend_question_id": 619, "is_new_question": false }, @@ -39207,8 +39529,8 @@ "question__title": "Students Report By Geography", "question__title_slug": "students-report-by-geography", "question__hide": false, - "total_acs": 17029, - "total_submitted": 26757, + "total_acs": 17218, + "total_submitted": 27063, "frontend_question_id": 618, "is_new_question": false }, @@ -39230,8 +39552,8 @@ "question__title": "Merge Two Binary Trees", "question__title_slug": "merge-two-binary-trees", "question__hide": false, - "total_acs": 577783, - "total_submitted": 739945, + "total_acs": 583485, + "total_submitted": 746750, "frontend_question_id": 617, "is_new_question": false }, @@ -39253,8 +39575,8 @@ "question__title": "Add Bold Tag in String", "question__title_slug": "add-bold-tag-in-string", "question__hide": false, - "total_acs": 77307, - "total_submitted": 159692, + "total_acs": 77674, + "total_submitted": 160358, "frontend_question_id": 616, "is_new_question": false }, @@ -39276,8 +39598,8 @@ "question__title": "Average Salary: Departments VS Company", "question__title_slug": "average-salary-departments-vs-company", "question__hide": false, - "total_acs": 27190, - "total_submitted": 48062, + "total_acs": 27491, + "total_submitted": 48485, "frontend_question_id": 615, "is_new_question": false }, @@ -39299,8 +39621,8 @@ "question__title": "Second Degree Follower", "question__title_slug": "second-degree-follower", "question__hide": false, - "total_acs": 40701, - "total_submitted": 113217, + "total_acs": 41052, + "total_submitted": 113904, "frontend_question_id": 614, "is_new_question": false }, @@ -39322,8 +39644,8 @@ "question__title": "Shortest Distance in a Line", "question__title_slug": "shortest-distance-in-a-line", "question__hide": false, - "total_acs": 52510, - "total_submitted": 64619, + "total_acs": 52954, + "total_submitted": 65136, "frontend_question_id": 613, "is_new_question": false }, @@ -39345,8 +39667,8 @@ "question__title": "Shortest Distance in a Plane", "question__title_slug": "shortest-distance-in-a-plane", "question__hide": false, - "total_acs": 31085, - "total_submitted": 49296, + "total_acs": 31377, + "total_submitted": 49742, "frontend_question_id": 612, "is_new_question": false }, @@ -39368,8 +39690,8 @@ "question__title": "Valid Triangle Number", "question__title_slug": "valid-triangle-number", "question__hide": false, - "total_acs": 141042, - "total_submitted": 282909, + "total_acs": 142276, + "total_submitted": 285259, "frontend_question_id": 611, "is_new_question": false }, @@ -39391,8 +39713,8 @@ "question__title": "Triangle Judgement", "question__title_slug": "triangle-judgement", "question__hide": false, - "total_acs": 51828, - "total_submitted": 73098, + "total_acs": 52283, + "total_submitted": 73714, "frontend_question_id": 610, "is_new_question": false }, @@ -39414,8 +39736,8 @@ "question__title": "Find Duplicate File in System", "question__title_slug": "find-duplicate-file-in-system", "question__hide": false, - "total_acs": 97027, - "total_submitted": 151934, + "total_acs": 97331, + "total_submitted": 152374, "frontend_question_id": 609, "is_new_question": false }, @@ -39437,8 +39759,8 @@ "question__title": "Tree Node", "question__title_slug": "tree-node", "question__hide": false, - "total_acs": 59029, - "total_submitted": 80158, + "total_acs": 62011, + "total_submitted": 84000, "frontend_question_id": 608, "is_new_question": false }, @@ -39460,8 +39782,8 @@ "question__title": "Sales Person", "question__title_slug": "sales-person", "question__hide": false, - "total_acs": 67696, - "total_submitted": 96363, + "total_acs": 71007, + "total_submitted": 100565, "frontend_question_id": 607, "is_new_question": false }, @@ -39483,8 +39805,8 @@ "question__title": "Construct String from Binary Tree", "question__title_slug": "construct-string-from-binary-tree", "question__hide": false, - "total_acs": 131631, - "total_submitted": 227382, + "total_acs": 132507, + "total_submitted": 228702, "frontend_question_id": 606, "is_new_question": false }, @@ -39506,8 +39828,8 @@ "question__title": "Can Place Flowers", "question__title_slug": "can-place-flowers", "question__hide": false, - "total_acs": 301978, - "total_submitted": 911783, + "total_acs": 304453, + "total_submitted": 919377, "frontend_question_id": 605, "is_new_question": false }, @@ -39529,8 +39851,8 @@ "question__title": "Design Compressed String Iterator", "question__title_slug": "design-compressed-string-iterator", "question__hide": false, - "total_acs": 26832, - "total_submitted": 68401, + "total_acs": 26921, + "total_submitted": 68591, "frontend_question_id": 604, "is_new_question": false }, @@ -39552,8 +39874,8 @@ "question__title": "Consecutive Available Seats", "question__title_slug": "consecutive-available-seats", "question__hide": false, - "total_acs": 58821, - "total_submitted": 86658, + "total_acs": 59651, + "total_submitted": 87857, "frontend_question_id": 603, "is_new_question": false }, @@ -39575,8 +39897,8 @@ "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": 50381, - "total_submitted": 82712, + "total_acs": 50707, + "total_submitted": 83170, "frontend_question_id": 602, "is_new_question": false }, @@ -39598,8 +39920,8 @@ "question__title": "Human Traffic of Stadium", "question__title_slug": "human-traffic-of-stadium", "question__hide": false, - "total_acs": 63626, - "total_submitted": 127566, + "total_acs": 64234, + "total_submitted": 128550, "frontend_question_id": 601, "is_new_question": false }, @@ -39621,8 +39943,8 @@ "question__title": "Non-negative Integers without Consecutive Ones", "question__title_slug": "non-negative-integers-without-consecutive-ones", "question__hide": false, - "total_acs": 31073, - "total_submitted": 80067, + "total_acs": 31226, + "total_submitted": 80408, "frontend_question_id": 600, "is_new_question": false }, @@ -39644,8 +39966,8 @@ "question__title": "Minimum Index Sum of Two Lists", "question__title_slug": "minimum-index-sum-of-two-lists", "question__hide": false, - "total_acs": 155884, - "total_submitted": 295943, + "total_acs": 157363, + "total_submitted": 298931, "frontend_question_id": 599, "is_new_question": false }, @@ -39667,8 +39989,8 @@ "question__title": "Range Addition II", "question__title_slug": "range-addition-ii", "question__hide": false, - "total_acs": 79134, - "total_submitted": 144494, + "total_acs": 79508, + "total_submitted": 145085, "frontend_question_id": 598, "is_new_question": false }, @@ -39690,8 +40012,8 @@ "question__title": "Friend Requests I: Overall Acceptance Rate", "question__title_slug": "friend-requests-i-overall-acceptance-rate", "question__hide": false, - "total_acs": 59607, - "total_submitted": 139757, + "total_acs": 60046, + "total_submitted": 140782, "frontend_question_id": 597, "is_new_question": false }, @@ -39713,8 +40035,8 @@ "question__title": "Classes More Than 5 Students", "question__title_slug": "classes-more-than-5-students", "question__hide": false, - "total_acs": 172667, - "total_submitted": 394003, + "total_acs": 175747, + "total_submitted": 398644, "frontend_question_id": 596, "is_new_question": false }, @@ -39736,8 +40058,8 @@ "question__title": "Big Countries", "question__title_slug": "big-countries", "question__hide": false, - "total_acs": 332738, - "total_submitted": 440942, + "total_acs": 342989, + "total_submitted": 455462, "frontend_question_id": 595, "is_new_question": false }, @@ -39759,8 +40081,8 @@ "question__title": "Longest Harmonious Subsequence", "question__title_slug": "longest-harmonious-subsequence", "question__hide": false, - "total_acs": 117985, - "total_submitted": 223411, + "total_acs": 118672, + "total_submitted": 224623, "frontend_question_id": 594, "is_new_question": false }, @@ -39782,8 +40104,8 @@ "question__title": "Valid Square", "question__title_slug": "valid-square", "question__hide": false, - "total_acs": 84460, - "total_submitted": 192365, + "total_acs": 85111, + "total_submitted": 193659, "frontend_question_id": 593, "is_new_question": false }, @@ -39805,8 +40127,8 @@ "question__title": "Fraction Addition and Subtraction", "question__title_slug": "fraction-addition-and-subtraction", "question__hide": false, - "total_acs": 29309, - "total_submitted": 56556, + "total_acs": 29434, + "total_submitted": 56777, "frontend_question_id": 592, "is_new_question": false }, @@ -39828,8 +40150,8 @@ "question__title": "Tag Validator", "question__title_slug": "tag-validator", "question__hide": false, - "total_acs": 11507, - "total_submitted": 31421, + "total_acs": 11604, + "total_submitted": 31602, "frontend_question_id": 591, "is_new_question": false }, @@ -39851,8 +40173,8 @@ "question__title": "Design In-Memory File System", "question__title_slug": "design-in-memory-file-system", "question__hide": false, - "total_acs": 69399, - "total_submitted": 143129, + "total_acs": 70516, + "total_submitted": 145379, "frontend_question_id": 588, "is_new_question": false }, @@ -39874,8 +40196,8 @@ "question__title": "Erect the Fence", "question__title_slug": "erect-the-fence", "question__hide": false, - "total_acs": 24487, - "total_submitted": 56668, + "total_acs": 24540, + "total_submitted": 56794, "frontend_question_id": 587, "is_new_question": false }, @@ -39897,8 +40219,8 @@ "question__title": "Customer Placing the Largest Number of Orders", "question__title_slug": "customer-placing-the-largest-number-of-orders", "question__hide": false, - "total_acs": 84444, - "total_submitted": 114484, + "total_acs": 88028, + "total_submitted": 119412, "frontend_question_id": 586, "is_new_question": false }, @@ -39920,8 +40242,8 @@ "question__title": "Investments in 2016", "question__title_slug": "investments-in-2016", "question__hide": false, - "total_acs": 33557, - "total_submitted": 61673, + "total_acs": 33854, + "total_submitted": 62348, "frontend_question_id": 585, "is_new_question": false }, @@ -39943,8 +40265,8 @@ "question__title": "Find Customer Referee", "question__title_slug": "find-customer-referee", "question__hide": false, - "total_acs": 103039, - "total_submitted": 134680, + "total_acs": 110894, + "total_submitted": 144405, "frontend_question_id": 584, "is_new_question": false }, @@ -39966,8 +40288,8 @@ "question__title": "Delete Operation for Two Strings", "question__title_slug": "delete-operation-for-two-strings", "question__hide": false, - "total_acs": 168222, - "total_submitted": 288776, + "total_acs": 170611, + "total_submitted": 292221, "frontend_question_id": 583, "is_new_question": false }, @@ -39989,8 +40311,8 @@ "question__title": "Kill Process", "question__title_slug": "kill-process", "question__hide": false, - "total_acs": 68921, - "total_submitted": 102325, + "total_acs": 69434, + "total_submitted": 102984, "frontend_question_id": 582, "is_new_question": false }, @@ -40012,8 +40334,8 @@ "question__title": "Shortest Unsorted Continuous Subarray", "question__title_slug": "shortest-unsorted-continuous-subarray", "question__hide": false, - "total_acs": 272614, - "total_submitted": 756122, + "total_acs": 273945, + "total_submitted": 759614, "frontend_question_id": 581, "is_new_question": false }, @@ -40035,8 +40357,8 @@ "question__title": "Count Student Number in Departments", "question__title_slug": "count-student-number-in-departments", "question__hide": false, - "total_acs": 47059, - "total_submitted": 82245, + "total_acs": 47731, + "total_submitted": 83229, "frontend_question_id": 580, "is_new_question": false }, @@ -40058,8 +40380,8 @@ "question__title": "Find Cumulative Salary of an Employee", "question__title_slug": "find-cumulative-salary-of-an-employee", "question__hide": false, - "total_acs": 26749, - "total_submitted": 61267, + "total_acs": 27009, + "total_submitted": 61630, "frontend_question_id": 579, "is_new_question": false }, @@ -40081,8 +40403,8 @@ "question__title": "Get Highest Answer Rate Question", "question__title_slug": "get-highest-answer-rate-question", "question__hide": false, - "total_acs": 41315, - "total_submitted": 97137, + "total_acs": 41666, + "total_submitted": 98246, "frontend_question_id": 578, "is_new_question": false }, @@ -40104,8 +40426,8 @@ "question__title": "Employee Bonus", "question__title_slug": "employee-bonus", "question__hide": false, - "total_acs": 60754, - "total_submitted": 81104, + "total_acs": 61273, + "total_submitted": 81788, "frontend_question_id": 577, "is_new_question": false }, @@ -40127,8 +40449,8 @@ "question__title": "Out of Boundary Paths", "question__title_slug": "out-of-boundary-paths", "question__hide": false, - "total_acs": 65068, - "total_submitted": 161740, + "total_acs": 65467, + "total_submitted": 162608, "frontend_question_id": 576, "is_new_question": false }, @@ -40150,8 +40472,8 @@ "question__title": "Distribute Candies", "question__title_slug": "distribute-candies", "question__hide": false, - "total_acs": 208636, - "total_submitted": 317364, + "total_acs": 209986, + "total_submitted": 319300, "frontend_question_id": 575, "is_new_question": false }, @@ -40173,8 +40495,8 @@ "question__title": "Winning Candidate", "question__title_slug": "winning-candidate", "question__hide": false, - "total_acs": 47732, - "total_submitted": 81262, + "total_acs": 48158, + "total_submitted": 81864, "frontend_question_id": 574, "is_new_question": false }, @@ -40196,8 +40518,8 @@ "question__title": "Squirrel Simulation", "question__title_slug": "squirrel-simulation", "question__hide": false, - "total_acs": 17134, - "total_submitted": 31308, + "total_acs": 17175, + "total_submitted": 31368, "frontend_question_id": 573, "is_new_question": false }, @@ -40219,8 +40541,8 @@ "question__title": "Subtree of Another Tree", "question__title_slug": "subtree-of-another-tree", "question__hide": false, - "total_acs": 488890, - "total_submitted": 1074613, + "total_acs": 497521, + "total_submitted": 1092371, "frontend_question_id": 572, "is_new_question": false }, @@ -40242,8 +40564,8 @@ "question__title": "Find Median Given Frequency of Numbers", "question__title_slug": "find-median-given-frequency-of-numbers", "question__hide": false, - "total_acs": 19755, - "total_submitted": 44454, + "total_acs": 20016, + "total_submitted": 45034, "frontend_question_id": 571, "is_new_question": false }, @@ -40265,8 +40587,8 @@ "question__title": "Managers with at Least 5 Direct Reports", "question__title_slug": "managers-with-at-least-5-direct-reports", "question__hide": false, - "total_acs": 61366, - "total_submitted": 91467, + "total_acs": 62219, + "total_submitted": 92732, "frontend_question_id": 570, "is_new_question": false }, @@ -40288,8 +40610,8 @@ "question__title": "Median Employee Salary", "question__title_slug": "median-employee-salary", "question__hide": false, - "total_acs": 28433, - "total_submitted": 42282, + "total_acs": 28747, + "total_submitted": 42694, "frontend_question_id": 569, "is_new_question": false }, @@ -40311,8 +40633,8 @@ "question__title": "Maximum Vacation Days", "question__title_slug": "maximum-vacation-days", "question__hide": false, - "total_acs": 34363, - "total_submitted": 77131, + "total_acs": 34464, + "total_submitted": 77301, "frontend_question_id": 568, "is_new_question": false }, @@ -40334,8 +40656,8 @@ "question__title": "Permutation in String", "question__title_slug": "permutation-in-string", "question__hide": false, - "total_acs": 408974, - "total_submitted": 920991, + "total_acs": 417568, + "total_submitted": 941790, "frontend_question_id": 567, "is_new_question": false }, @@ -40357,8 +40679,8 @@ "question__title": "Reshape the Matrix", "question__title_slug": "reshape-the-matrix", "question__hide": false, - "total_acs": 250712, - "total_submitted": 400818, + "total_acs": 255513, + "total_submitted": 408479, "frontend_question_id": 566, "is_new_question": false }, @@ -40380,8 +40702,8 @@ "question__title": "Array Nesting", "question__title_slug": "array-nesting", "question__hide": false, - "total_acs": 114461, - "total_submitted": 203210, + "total_acs": 114847, + "total_submitted": 203822, "frontend_question_id": 565, "is_new_question": false }, @@ -40403,8 +40725,8 @@ "question__title": "Find the Closest Palindrome", "question__title_slug": "find-the-closest-palindrome", "question__hide": false, - "total_acs": 32516, - "total_submitted": 150878, + "total_acs": 32824, + "total_submitted": 152072, "frontend_question_id": 564, "is_new_question": false }, @@ -40426,8 +40748,8 @@ "question__title": "Binary Tree Tilt", "question__title_slug": "binary-tree-tilt", "question__hide": false, - "total_acs": 169708, - "total_submitted": 288985, + "total_acs": 170643, + "total_submitted": 290308, "frontend_question_id": 563, "is_new_question": false }, @@ -40449,8 +40771,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": 60761, - "total_submitted": 123075, + "total_acs": 61266, + "total_submitted": 124029, "frontend_question_id": 562, "is_new_question": false }, @@ -40472,8 +40794,8 @@ "question__title": "Array Partition I", "question__title_slug": "array-partition-i", "question__hide": false, - "total_acs": 334097, - "total_submitted": 440351, + "total_acs": 336590, + "total_submitted": 443234, "frontend_question_id": 561, "is_new_question": false }, @@ -40495,8 +40817,8 @@ "question__title": "Subarray Sum Equals K", "question__title_slug": "subarray-sum-equals-k", "question__hide": false, - "total_acs": 797221, - "total_submitted": 1802394, + "total_acs": 804389, + "total_submitted": 1819374, "frontend_question_id": 560, "is_new_question": false }, @@ -40518,8 +40840,8 @@ "question__title": "Reverse Words in a String III", "question__title_slug": "reverse-words-in-a-string-iii", "question__hide": false, - "total_acs": 467655, - "total_submitted": 590194, + "total_acs": 474686, + "total_submitted": 598047, "frontend_question_id": 557, "is_new_question": false }, @@ -40541,8 +40863,8 @@ "question__title": "Next Greater Element III", "question__title_slug": "next-greater-element-iii", "question__hide": false, - "total_acs": 102718, - "total_submitted": 302949, + "total_acs": 103928, + "total_submitted": 306394, "frontend_question_id": 556, "is_new_question": false }, @@ -40564,8 +40886,8 @@ "question__title": "Split Concatenated Strings", "question__title_slug": "split-concatenated-strings", "question__hide": false, - "total_acs": 6017, - "total_submitted": 13874, + "total_acs": 6038, + "total_submitted": 13916, "frontend_question_id": 555, "is_new_question": false }, @@ -40587,8 +40909,8 @@ "question__title": "Brick Wall", "question__title_slug": "brick-wall", "question__hide": false, - "total_acs": 102282, - "total_submitted": 194031, + "total_acs": 102746, + "total_submitted": 194751, "frontend_question_id": 554, "is_new_question": false }, @@ -40610,8 +40932,8 @@ "question__title": "Optimal Division", "question__title_slug": "optimal-division", "question__hide": false, - "total_acs": 32248, - "total_submitted": 54411, + "total_acs": 32391, + "total_submitted": 54610, "frontend_question_id": 553, "is_new_question": false }, @@ -40633,8 +40955,8 @@ "question__title": "Student Attendance Record II", "question__title_slug": "student-attendance-record-ii", "question__hide": false, - "total_acs": 49789, - "total_submitted": 122314, + "total_acs": 50465, + "total_submitted": 123894, "frontend_question_id": 552, "is_new_question": false }, @@ -40656,8 +40978,8 @@ "question__title": "Student Attendance Record I", "question__title_slug": "student-attendance-record-i", "question__hide": false, - "total_acs": 147821, - "total_submitted": 309584, + "total_acs": 149197, + "total_submitted": 311982, "frontend_question_id": 551, "is_new_question": false }, @@ -40679,8 +41001,8 @@ "question__title": "Shortest Path to Get Food", "question__title_slug": "shortest-path-to-get-food", "question__hide": false, - "total_acs": 35203, - "total_submitted": 64829, + "total_acs": 36422, + "total_submitted": 67111, "frontend_question_id": 1730, "is_new_question": false }, @@ -40702,8 +41024,8 @@ "question__title": "Binary Tree Longest Consecutive Sequence II", "question__title_slug": "binary-tree-longest-consecutive-sequence-ii", "question__hide": false, - "total_acs": 43577, - "total_submitted": 89415, + "total_acs": 43837, + "total_submitted": 89916, "frontend_question_id": 549, "is_new_question": false }, @@ -40725,8 +41047,8 @@ "question__title": "Split Array with Equal Sum", "question__title_slug": "split-array-with-equal-sum", "question__hide": false, - "total_acs": 22369, - "total_submitted": 44799, + "total_acs": 22404, + "total_submitted": 44854, "frontend_question_id": 548, "is_new_question": false }, @@ -40748,8 +41070,8 @@ "question__title": "Number of Provinces", "question__title_slug": "number-of-provinces", "question__hide": false, - "total_acs": 478449, - "total_submitted": 763102, + "total_acs": 484861, + "total_submitted": 773142, "frontend_question_id": 547, "is_new_question": false }, @@ -40771,8 +41093,8 @@ "question__title": "Remove Boxes", "question__title_slug": "remove-boxes", "question__hide": false, - "total_acs": 34555, - "total_submitted": 72908, + "total_acs": 34772, + "total_submitted": 73316, "frontend_question_id": 546, "is_new_question": false }, @@ -40794,8 +41116,8 @@ "question__title": "Boundary of Binary Tree", "question__title_slug": "boundary-of-binary-tree", "question__hide": false, - "total_acs": 104165, - "total_submitted": 239328, + "total_acs": 105229, + "total_submitted": 241258, "frontend_question_id": 545, "is_new_question": false }, @@ -40817,8 +41139,8 @@ "question__title": "Output Contest Matches", "question__title_slug": "output-contest-matches", "question__hide": false, - "total_acs": 25027, - "total_submitted": 32685, + "total_acs": 25071, + "total_submitted": 32740, "frontend_question_id": 544, "is_new_question": false }, @@ -40840,8 +41162,8 @@ "question__title": "Diameter of Binary Tree", "question__title_slug": "diameter-of-binary-tree", "question__hide": false, - "total_acs": 763211, - "total_submitted": 1396127, + "total_acs": 776200, + "total_submitted": 1416369, "frontend_question_id": 543, "is_new_question": false }, @@ -40863,8 +41185,8 @@ "question__title": "01 Matrix", "question__title_slug": "01-matrix", "question__hide": false, - "total_acs": 258554, - "total_submitted": 589294, + "total_acs": 264594, + "total_submitted": 601833, "frontend_question_id": 542, "is_new_question": false }, @@ -40886,8 +41208,8 @@ "question__title": "Reverse String II", "question__title_slug": "reverse-string-ii", "question__hide": false, - "total_acs": 156168, - "total_submitted": 311025, + "total_acs": 157566, + "total_submitted": 313897, "frontend_question_id": 541, "is_new_question": false }, @@ -40909,8 +41231,8 @@ "question__title": "Single Element in a Sorted Array", "question__title_slug": "single-element-in-a-sorted-array", "question__hide": false, - "total_acs": 300291, - "total_submitted": 512062, + "total_acs": 304379, + "total_submitted": 519069, "frontend_question_id": 540, "is_new_question": false }, @@ -40932,8 +41254,8 @@ "question__title": "Minimum Time Difference", "question__title_slug": "minimum-time-difference", "question__hide": false, - "total_acs": 95654, - "total_submitted": 172079, + "total_acs": 97908, + "total_submitted": 175702, "frontend_question_id": 539, "is_new_question": false }, @@ -40955,8 +41277,8 @@ "question__title": "Convert BST to Greater Tree", "question__title_slug": "convert-bst-to-greater-tree", "question__hide": false, - "total_acs": 243378, - "total_submitted": 365722, + "total_acs": 244543, + "total_submitted": 367046, "frontend_question_id": 538, "is_new_question": false }, @@ -40978,8 +41300,8 @@ "question__title": "Complex Number Multiplication", "question__title_slug": "complex-number-multiplication", "question__hide": false, - "total_acs": 81888, - "total_submitted": 115085, + "total_acs": 82104, + "total_submitted": 115353, "frontend_question_id": 537, "is_new_question": false }, @@ -41001,8 +41323,8 @@ "question__title": "Construct Binary Tree from String", "question__title_slug": "construct-binary-tree-from-string", "question__hide": false, - "total_acs": 77791, - "total_submitted": 139111, + "total_acs": 78139, + "total_submitted": 139723, "frontend_question_id": 536, "is_new_question": false }, @@ -41024,8 +41346,8 @@ "question__title": "Encode and Decode TinyURL", "question__title_slug": "encode-and-decode-tinyurl", "question__hide": false, - "total_acs": 206726, - "total_submitted": 241797, + "total_acs": 207569, + "total_submitted": 242711, "frontend_question_id": 535, "is_new_question": false }, @@ -41047,8 +41369,8 @@ "question__title": "Lonely Pixel II", "question__title_slug": "lonely-pixel-ii", "question__hide": false, - "total_acs": 12086, - "total_submitted": 25009, + "total_acs": 12103, + "total_submitted": 25041, "frontend_question_id": 533, "is_new_question": false }, @@ -41070,8 +41392,8 @@ "question__title": "K-diff Pairs in an Array", "question__title_slug": "k-diff-pairs-in-an-array", "question__hide": false, - "total_acs": 258590, - "total_submitted": 641411, + "total_acs": 260035, + "total_submitted": 644390, "frontend_question_id": 532, "is_new_question": false }, @@ -41093,8 +41415,8 @@ "question__title": "Lonely Pixel I", "question__title_slug": "lonely-pixel-i", "question__hide": false, - "total_acs": 31135, - "total_submitted": 51264, + "total_acs": 31195, + "total_submitted": 51357, "frontend_question_id": 531, "is_new_question": false }, @@ -41116,8 +41438,8 @@ "question__title": "Minimum Absolute Difference in BST", "question__title_slug": "minimum-absolute-difference-in-bst", "question__hide": false, - "total_acs": 162016, - "total_submitted": 287618, + "total_acs": 163969, + "total_submitted": 290938, "frontend_question_id": 530, "is_new_question": false }, @@ -41139,8 +41461,8 @@ "question__title": "Minesweeper", "question__title_slug": "minesweeper", "question__hide": false, - "total_acs": 119306, - "total_submitted": 183770, + "total_acs": 120077, + "total_submitted": 184821, "frontend_question_id": 529, "is_new_question": false }, @@ -41162,8 +41484,8 @@ "question__title": "Swapping Nodes in a Linked List", "question__title_slug": "swapping-nodes-in-a-linked-list", "question__hide": false, - "total_acs": 166012, - "total_submitted": 243400, + "total_acs": 167953, + "total_submitted": 246525, "frontend_question_id": 1721, "is_new_question": false }, @@ -41185,8 +41507,8 @@ "question__title": "Word Abbreviation", "question__title_slug": "word-abbreviation", "question__hide": false, - "total_acs": 23454, - "total_submitted": 39550, + "total_acs": 24554, + "total_submitted": 40993, "frontend_question_id": 527, "is_new_question": false }, @@ -41208,8 +41530,8 @@ "question__title": "Beautiful Arrangement", "question__title_slug": "beautiful-arrangement", "question__hide": false, - "total_acs": 132304, - "total_submitted": 205409, + "total_acs": 133240, + "total_submitted": 206716, "frontend_question_id": 526, "is_new_question": false }, @@ -41231,8 +41553,8 @@ "question__title": "Contiguous Array", "question__title_slug": "contiguous-array", "question__hide": false, - "total_acs": 265036, - "total_submitted": 570529, + "total_acs": 266620, + "total_submitted": 573462, "frontend_question_id": 525, "is_new_question": false }, @@ -41254,8 +41576,8 @@ "question__title": "Longest Word in Dictionary through Deleting", "question__title_slug": "longest-word-in-dictionary-through-deleting", "question__hide": false, - "total_acs": 128494, - "total_submitted": 252066, + "total_acs": 129224, + "total_submitted": 253396, "frontend_question_id": 524, "is_new_question": false }, @@ -41277,8 +41599,8 @@ "question__title": "Continuous Subarray Sum", "question__title_slug": "continuous-subarray-sum", "question__hide": false, - "total_acs": 297337, - "total_submitted": 1086100, + "total_acs": 299307, + "total_submitted": 1092035, "frontend_question_id": 523, "is_new_question": false }, @@ -41300,8 +41622,8 @@ "question__title": "Longest Uncommon Subsequence II", "question__title_slug": "longest-uncommon-subsequence-ii", "question__hide": false, - "total_acs": 43627, - "total_submitted": 108656, + "total_acs": 43886, + "total_submitted": 109122, "frontend_question_id": 522, "is_new_question": false }, @@ -41323,8 +41645,8 @@ "question__title": "Longest Uncommon Subsequence I", "question__title_slug": "longest-uncommon-subsequence-i", "question__hide": false, - "total_acs": 85283, - "total_submitted": 141744, + "total_acs": 85671, + "total_submitted": 142340, "frontend_question_id": 521, "is_new_question": false }, @@ -41346,8 +41668,8 @@ "question__title": "Detect Capital", "question__title_slug": "detect-capital", "question__hide": false, - "total_acs": 266333, - "total_submitted": 478112, + "total_acs": 267274, + "total_submitted": 479943, "frontend_question_id": 520, "is_new_question": false }, @@ -41369,8 +41691,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": 1261, - "total_submitted": 2318, + "total_acs": 1273, + "total_submitted": 2339, "frontend_question_id": 1983, "is_new_question": false }, @@ -41392,8 +41714,8 @@ "question__title": "Coin Change 2", "question__title_slug": "coin-change-2", "question__hide": false, - "total_acs": 306826, - "total_submitted": 528133, + "total_acs": 311883, + "total_submitted": 535049, "frontend_question_id": 518, "is_new_question": false }, @@ -41415,8 +41737,8 @@ "question__title": "Super Washing Machines", "question__title_slug": "super-washing-machines", "question__hide": false, - "total_acs": 22481, - "total_submitted": 56772, + "total_acs": 22630, + "total_submitted": 57092, "frontend_question_id": 517, "is_new_question": false }, @@ -41438,8 +41760,8 @@ "question__title": "Longest Palindromic Subsequence", "question__title_slug": "longest-palindromic-subsequence", "question__hide": false, - "total_acs": 264072, - "total_submitted": 442001, + "total_acs": 267829, + "total_submitted": 447558, "frontend_question_id": 516, "is_new_question": false }, @@ -41461,8 +41783,8 @@ "question__title": "Find Largest Value in Each Tree Row", "question__title_slug": "find-largest-value-in-each-tree-row", "question__hide": false, - "total_acs": 195702, - "total_submitted": 303239, + "total_acs": 197482, + "total_submitted": 305954, "frontend_question_id": 515, "is_new_question": false }, @@ -41484,8 +41806,8 @@ "question__title": "Freedom Trail", "question__title_slug": "freedom-trail", "question__hide": false, - "total_acs": 28024, - "total_submitted": 60358, + "total_acs": 28188, + "total_submitted": 60666, "frontend_question_id": 514, "is_new_question": false }, @@ -41507,8 +41829,8 @@ "question__title": "Find Bottom Left Tree Value", "question__title_slug": "find-bottom-left-tree-value", "question__hide": false, - "total_acs": 176645, - "total_submitted": 269725, + "total_acs": 178552, + "total_submitted": 272209, "frontend_question_id": 513, "is_new_question": false }, @@ -41530,8 +41852,8 @@ "question__title": "Maximum Alternating Subarray Sum", "question__title_slug": "maximum-alternating-subarray-sum", "question__hide": false, - "total_acs": 1306, - "total_submitted": 3192, + "total_acs": 1346, + "total_submitted": 3319, "frontend_question_id": 2036, "is_new_question": false }, @@ -41553,8 +41875,8 @@ "question__title": "All Paths from Source Lead to Destination", "question__title_slug": "all-paths-from-source-lead-to-destination", "question__hide": false, - "total_acs": 39640, - "total_submitted": 95838, + "total_acs": 40288, + "total_submitted": 97517, "frontend_question_id": 1059, "is_new_question": false }, @@ -41576,8 +41898,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": 1788, - "total_submitted": 3358, + "total_acs": 1836, + "total_submitted": 3466, "frontend_question_id": 2031, "is_new_question": false }, @@ -41599,8 +41921,8 @@ "question__title": "Inorder Successor in BST II", "question__title_slug": "inorder-successor-in-bst-ii", "question__hide": false, - "total_acs": 49838, - "total_submitted": 81242, + "total_acs": 50181, + "total_submitted": 81874, "frontend_question_id": 510, "is_new_question": false }, @@ -41622,8 +41944,8 @@ "question__title": "Most Frequent Subtree Sum", "question__title_slug": "most-frequent-subtree-sum", "question__hide": false, - "total_acs": 110415, - "total_submitted": 174785, + "total_acs": 111505, + "total_submitted": 176083, "frontend_question_id": 508, "is_new_question": false }, @@ -41645,8 +41967,8 @@ "question__title": "Perfect Number", "question__title_slug": "perfect-number", "question__hide": false, - "total_acs": 105693, - "total_submitted": 280769, + "total_acs": 106485, + "total_submitted": 282813, "frontend_question_id": 507, "is_new_question": false }, @@ -41668,8 +41990,8 @@ "question__title": "Relative Ranks", "question__title_slug": "relative-ranks", "question__hide": false, - "total_acs": 93129, - "total_submitted": 162601, + "total_acs": 94358, + "total_submitted": 164297, "frontend_question_id": 506, "is_new_question": false }, @@ -41691,8 +42013,8 @@ "question__title": "The Maze II", "question__title_slug": "the-maze-ii", "question__hide": false, - "total_acs": 83118, - "total_submitted": 161312, + "total_acs": 83659, + "total_submitted": 162218, "frontend_question_id": 505, "is_new_question": false }, @@ -41714,8 +42036,8 @@ "question__title": "Base 7", "question__title_slug": "base-7", "question__hide": false, - "total_acs": 87684, - "total_submitted": 184194, + "total_acs": 88270, + "total_submitted": 185345, "frontend_question_id": 504, "is_new_question": false }, @@ -41737,8 +42059,8 @@ "question__title": "Next Greater Element II", "question__title_slug": "next-greater-element-ii", "question__hide": false, - "total_acs": 226620, - "total_submitted": 363427, + "total_acs": 229744, + "total_submitted": 367892, "frontend_question_id": 503, "is_new_question": false }, @@ -41760,8 +42082,8 @@ "question__title": "IPO", "question__title_slug": "ipo", "question__hide": false, - "total_acs": 33616, - "total_submitted": 75897, + "total_acs": 33959, + "total_submitted": 76558, "frontend_question_id": 502, "is_new_question": false }, @@ -41783,8 +42105,8 @@ "question__title": "Find Mode in Binary Search Tree", "question__title_slug": "find-mode-in-binary-search-tree", "question__hide": false, - "total_acs": 155916, - "total_submitted": 327841, + "total_acs": 157560, + "total_submitted": 330613, "frontend_question_id": 501, "is_new_question": false }, @@ -41806,8 +42128,8 @@ "question__title": "Keyboard Row", "question__title_slug": "keyboard-row", "question__hide": false, - "total_acs": 154854, - "total_submitted": 226702, + "total_acs": 155875, + "total_submitted": 227997, "frontend_question_id": 500, "is_new_question": false }, @@ -41829,8 +42151,8 @@ "question__title": "The Maze III", "question__title_slug": "the-maze-iii", "question__hide": false, - "total_acs": 23841, - "total_submitted": 51870, + "total_acs": 24040, + "total_submitted": 52199, "frontend_question_id": 499, "is_new_question": false }, @@ -41852,8 +42174,8 @@ "question__title": "Diagonal Traverse", "question__title_slug": "diagonal-traverse", "question__hide": false, - "total_acs": 206805, - "total_submitted": 361709, + "total_acs": 208661, + "total_submitted": 364326, "frontend_question_id": 498, "is_new_question": false }, @@ -41875,8 +42197,8 @@ "question__title": "Next Greater Element I", "question__title_slug": "next-greater-element-i", "question__hide": false, - "total_acs": 376613, - "total_submitted": 534524, + "total_acs": 383198, + "total_submitted": 542960, "frontend_question_id": 496, "is_new_question": false }, @@ -41898,8 +42220,8 @@ "question__title": "Teemo Attacking", "question__title_slug": "teemo-attacking", "question__hide": false, - "total_acs": 101678, - "total_submitted": 178599, + "total_acs": 102503, + "total_submitted": 180110, "frontend_question_id": 495, "is_new_question": false }, @@ -41921,8 +42243,8 @@ "question__title": "Target Sum", "question__title_slug": "target-sum", "question__hide": false, - "total_acs": 362106, - "total_submitted": 798009, + "total_acs": 367244, + "total_submitted": 809557, "frontend_question_id": 494, "is_new_question": false }, @@ -41944,8 +42266,8 @@ "question__title": "Reverse Pairs", "question__title_slug": "reverse-pairs", "question__hide": false, - "total_acs": 88309, - "total_submitted": 292848, + "total_acs": 90253, + "total_submitted": 298327, "frontend_question_id": 493, "is_new_question": false }, @@ -41967,8 +42289,8 @@ "question__title": "Construct the Rectangle", "question__title_slug": "construct-the-rectangle", "question__hide": false, - "total_acs": 80074, - "total_submitted": 151321, + "total_acs": 80557, + "total_submitted": 152063, "frontend_question_id": 492, "is_new_question": false }, @@ -41990,8 +42312,8 @@ "question__title": "Increasing Subsequences", "question__title_slug": "increasing-subsequences", "question__hide": false, - "total_acs": 76670, - "total_submitted": 149762, + "total_acs": 77327, + "total_submitted": 150852, "frontend_question_id": 491, "is_new_question": false }, @@ -42013,8 +42335,8 @@ "question__title": "The Maze", "question__title_slug": "the-maze", "question__hide": false, - "total_acs": 122105, - "total_submitted": 222422, + "total_acs": 123169, + "total_submitted": 224088, "frontend_question_id": 490, "is_new_question": false }, @@ -42036,8 +42358,8 @@ "question__title": "Kth Smallest Instructions", "question__title_slug": "kth-smallest-instructions", "question__hide": false, - "total_acs": 7931, - "total_submitted": 17301, + "total_acs": 8007, + "total_submitted": 17456, "frontend_question_id": 1643, "is_new_question": false }, @@ -42059,8 +42381,8 @@ "question__title": "Zuma Game", "question__title_slug": "zuma-game", "question__hide": false, - "total_acs": 20104, - "total_submitted": 56231, + "total_acs": 20149, + "total_submitted": 56512, "frontend_question_id": 488, "is_new_question": false }, @@ -42082,8 +42404,8 @@ "question__title": "Max Consecutive Ones II", "question__title_slug": "max-consecutive-ones-ii", "question__hide": false, - "total_acs": 96300, - "total_submitted": 196486, + "total_acs": 97385, + "total_submitted": 198569, "frontend_question_id": 487, "is_new_question": false }, @@ -42105,8 +42427,8 @@ "question__title": "Predict the Winner", "question__title_slug": "predict-the-winner", "question__hide": false, - "total_acs": 115391, - "total_submitted": 228954, + "total_acs": 116401, + "total_submitted": 230624, "frontend_question_id": 486, "is_new_question": false }, @@ -42128,8 +42450,8 @@ "question__title": "Max Consecutive Ones", "question__title_slug": "max-consecutive-ones", "question__hide": false, - "total_acs": 678356, - "total_submitted": 1227023, + "total_acs": 686537, + "total_submitted": 1240504, "frontend_question_id": 485, "is_new_question": false }, @@ -42151,8 +42473,8 @@ "question__title": "Find Permutation", "question__title_slug": "find-permutation", "question__hide": false, - "total_acs": 31535, - "total_submitted": 48081, + "total_acs": 31602, + "total_submitted": 48203, "frontend_question_id": 484, "is_new_question": false }, @@ -42174,8 +42496,8 @@ "question__title": "Smallest Good Base", "question__title_slug": "smallest-good-base", "question__hide": false, - "total_acs": 17119, - "total_submitted": 45048, + "total_acs": 17162, + "total_submitted": 45118, "frontend_question_id": 483, "is_new_question": false }, @@ -42197,8 +42519,8 @@ "question__title": "License Key Formatting", "question__title_slug": "license-key-formatting", "question__hide": false, - "total_acs": 217856, - "total_submitted": 505755, + "total_acs": 219293, + "total_submitted": 509330, "frontend_question_id": 482, "is_new_question": false }, @@ -42220,8 +42542,8 @@ "question__title": "Magical String", "question__title_slug": "magical-string", "question__hide": false, - "total_acs": 28247, - "total_submitted": 56707, + "total_acs": 28341, + "total_submitted": 56861, "frontend_question_id": 481, "is_new_question": false }, @@ -42243,8 +42565,8 @@ "question__title": "Sliding Window Median", "question__title_slug": "sliding-window-median", "question__hide": false, - "total_acs": 108073, - "total_submitted": 262877, + "total_acs": 108982, + "total_submitted": 264975, "frontend_question_id": 480, "is_new_question": false }, @@ -42266,8 +42588,8 @@ "question__title": "Largest Palindrome Product", "question__title_slug": "largest-palindrome-product", "question__hide": false, - "total_acs": 20524, - "total_submitted": 65647, + "total_acs": 20564, + "total_submitted": 65711, "frontend_question_id": 479, "is_new_question": false }, @@ -42289,8 +42611,8 @@ "question__title": "Total Hamming Distance", "question__title_slug": "total-hamming-distance", "question__hide": false, - "total_acs": 89246, - "total_submitted": 171620, + "total_acs": 89648, + "total_submitted": 172276, "frontend_question_id": 477, "is_new_question": false }, @@ -42312,8 +42634,8 @@ "question__title": "Number Complement", "question__title_slug": "number-complement", "question__hide": false, - "total_acs": 267553, - "total_submitted": 400172, + "total_acs": 268503, + "total_submitted": 401427, "frontend_question_id": 476, "is_new_question": false }, @@ -42335,8 +42657,8 @@ "question__title": "Heaters", "question__title_slug": "heaters", "question__hide": false, - "total_acs": 90092, - "total_submitted": 253501, + "total_acs": 90651, + "total_submitted": 254589, "frontend_question_id": 475, "is_new_question": false }, @@ -42358,8 +42680,8 @@ "question__title": "Ones and Zeroes", "question__title_slug": "ones-and-zeroes", "question__hide": false, - "total_acs": 144736, - "total_submitted": 310975, + "total_acs": 146317, + "total_submitted": 313981, "frontend_question_id": 474, "is_new_question": false }, @@ -42381,8 +42703,8 @@ "question__title": "Matchsticks to Square", "question__title_slug": "matchsticks-to-square", "question__hide": false, - "total_acs": 78613, - "total_submitted": 195252, + "total_acs": 79086, + "total_submitted": 196559, "frontend_question_id": 473, "is_new_question": false }, @@ -42404,8 +42726,8 @@ "question__title": "Concatenated Words", "question__title_slug": "concatenated-words", "question__hide": false, - "total_acs": 136649, - "total_submitted": 314377, + "total_acs": 138120, + "total_submitted": 316550, "frontend_question_id": 472, "is_new_question": false }, @@ -42427,8 +42749,8 @@ "question__title": "Encode String with Shortest Length", "question__title_slug": "encode-string-with-shortest-length", "question__hide": false, - "total_acs": 28325, - "total_submitted": 55893, + "total_acs": 28555, + "total_submitted": 56281, "frontend_question_id": 471, "is_new_question": false }, @@ -42450,8 +42772,8 @@ "question__title": "Convex Polygon", "question__title_slug": "convex-polygon", "question__hide": false, - "total_acs": 9591, - "total_submitted": 25019, + "total_acs": 9601, + "total_submitted": 25038, "frontend_question_id": 469, "is_new_question": false }, @@ -42473,8 +42795,8 @@ "question__title": "Validate IP Address", "question__title_slug": "validate-ip-address", "question__hide": false, - "total_acs": 127910, - "total_submitted": 486551, + "total_acs": 128460, + "total_submitted": 488355, "frontend_question_id": 468, "is_new_question": false }, @@ -42496,8 +42818,8 @@ "question__title": "Unique Substrings in Wraparound String", "question__title_slug": "unique-substrings-in-wraparound-string", "question__hide": false, - "total_acs": 35769, - "total_submitted": 94716, + "total_acs": 35939, + "total_submitted": 95087, "frontend_question_id": 467, "is_new_question": false }, @@ -42519,8 +42841,8 @@ "question__title": "Count The Repetitions", "question__title_slug": "count-the-repetitions", "question__hide": false, - "total_acs": 14392, - "total_submitted": 49393, + "total_acs": 14455, + "total_submitted": 49621, "frontend_question_id": 466, "is_new_question": false }, @@ -42542,8 +42864,8 @@ "question__title": "Optimal Account Balancing", "question__title_slug": "optimal-account-balancing", "question__hide": false, - "total_acs": 71536, - "total_submitted": 145894, + "total_acs": 72063, + "total_submitted": 146823, "frontend_question_id": 465, "is_new_question": false }, @@ -42565,8 +42887,8 @@ "question__title": "Can I Win", "question__title_slug": "can-i-win", "question__hide": false, - "total_acs": 76559, - "total_submitted": 256575, + "total_acs": 76888, + "total_submitted": 257646, "frontend_question_id": 464, "is_new_question": false }, @@ -42588,8 +42910,8 @@ "question__title": "Island Perimeter", "question__title_slug": "island-perimeter", "question__hide": false, - "total_acs": 371563, - "total_submitted": 537809, + "total_acs": 373974, + "total_submitted": 541036, "frontend_question_id": 463, "is_new_question": false }, @@ -42611,8 +42933,8 @@ "question__title": "Minimum Moves to Equal Array Elements II", "question__title_slug": "minimum-moves-to-equal-array-elements-ii", "question__hide": false, - "total_acs": 91790, - "total_submitted": 160416, + "total_acs": 92458, + "total_submitted": 161432, "frontend_question_id": 462, "is_new_question": false }, @@ -42634,8 +42956,8 @@ "question__title": "Hamming Distance", "question__title_slug": "hamming-distance", "question__hide": false, - "total_acs": 479006, - "total_submitted": 642190, + "total_acs": 480592, + "total_submitted": 644125, "frontend_question_id": 461, "is_new_question": false }, @@ -42657,8 +42979,8 @@ "question__title": "LFU Cache", "question__title_slug": "lfu-cache", "question__hide": false, - "total_acs": 157280, - "total_submitted": 396367, + "total_acs": 158655, + "total_submitted": 399079, "frontend_question_id": 460, "is_new_question": false }, @@ -42680,8 +43002,8 @@ "question__title": "Repeated Substring Pattern", "question__title_slug": "repeated-substring-pattern", "question__hide": false, - "total_acs": 247759, - "total_submitted": 567967, + "total_acs": 249723, + "total_submitted": 572281, "frontend_question_id": 459, "is_new_question": false }, @@ -42703,8 +43025,8 @@ "question__title": "Poor Pigs", "question__title_slug": "poor-pigs", "question__hide": false, - "total_acs": 33862, - "total_submitted": 60811, + "total_acs": 33973, + "total_submitted": 60958, "frontend_question_id": 458, "is_new_question": false }, @@ -42726,8 +43048,8 @@ "question__title": "Circular Array Loop", "question__title_slug": "circular-array-loop", "question__hide": false, - "total_acs": 60339, - "total_submitted": 189759, + "total_acs": 60795, + "total_submitted": 190996, "frontend_question_id": 457, "is_new_question": false }, @@ -42749,8 +43071,8 @@ "question__title": "132 Pattern", "question__title_slug": "132-pattern", "question__hide": false, - "total_acs": 147821, - "total_submitted": 456366, + "total_acs": 148727, + "total_submitted": 459080, "frontend_question_id": 456, "is_new_question": false }, @@ -42772,8 +43094,8 @@ "question__title": "Assign Cookies", "question__title_slug": "assign-cookies", "question__hide": false, - "total_acs": 170273, - "total_submitted": 335632, + "total_acs": 172080, + "total_submitted": 339316, "frontend_question_id": 455, "is_new_question": false }, @@ -42795,8 +43117,8 @@ "question__title": "4Sum II", "question__title_slug": "4sum-ii", "question__hide": false, - "total_acs": 257414, - "total_submitted": 450480, + "total_acs": 258939, + "total_submitted": 453060, "frontend_question_id": 454, "is_new_question": false }, @@ -42818,8 +43140,8 @@ "question__title": "Minimum Moves to Equal Array Elements", "question__title_slug": "minimum-moves-to-equal-array-elements", "question__hide": false, - "total_acs": 125835, - "total_submitted": 231346, + "total_acs": 126714, + "total_submitted": 232690, "frontend_question_id": 453, "is_new_question": false }, @@ -42841,8 +43163,8 @@ "question__title": "Minimum Number of Arrows to Burst Balloons", "question__title_slug": "minimum-number-of-arrows-to-burst-balloons", "question__hide": false, - "total_acs": 192932, - "total_submitted": 363986, + "total_acs": 194418, + "total_submitted": 366706, "frontend_question_id": 452, "is_new_question": false }, @@ -42864,8 +43186,8 @@ "question__title": "Sort Characters By Frequency", "question__title_slug": "sort-characters-by-frequency", "question__hide": false, - "total_acs": 369778, - "total_submitted": 543904, + "total_acs": 373093, + "total_submitted": 548298, "frontend_question_id": 451, "is_new_question": false }, @@ -42887,8 +43209,8 @@ "question__title": "Delete Node in a BST", "question__title_slug": "delete-node-in-a-bst", "question__hide": false, - "total_acs": 283830, - "total_submitted": 576303, + "total_acs": 287719, + "total_submitted": 583483, "frontend_question_id": 450, "is_new_question": false }, @@ -42910,8 +43232,8 @@ "question__title": "Serialize and Deserialize BST", "question__title_slug": "serialize-and-deserialize-bst", "question__hide": false, - "total_acs": 197471, - "total_submitted": 350274, + "total_acs": 198710, + "total_submitted": 352290, "frontend_question_id": 449, "is_new_question": false }, @@ -42933,8 +43255,8 @@ "question__title": "Find All Numbers Disappeared in an Array", "question__title_slug": "find-all-numbers-disappeared-in-an-array", "question__hide": false, - "total_acs": 589462, - "total_submitted": 995293, + "total_acs": 594915, + "total_submitted": 1004164, "frontend_question_id": 448, "is_new_question": false }, @@ -42956,8 +43278,8 @@ "question__title": "Number of Boomerangs", "question__title_slug": "number-of-boomerangs", "question__hide": false, - "total_acs": 86640, - "total_submitted": 159379, + "total_acs": 86957, + "total_submitted": 159840, "frontend_question_id": 447, "is_new_question": false }, @@ -42979,8 +43301,8 @@ "question__title": "Arithmetic Slices II - Subsequence", "question__title_slug": "arithmetic-slices-ii-subsequence", "question__hide": false, - "total_acs": 44288, - "total_submitted": 112092, + "total_acs": 44547, + "total_submitted": 112666, "frontend_question_id": 446, "is_new_question": false }, @@ -43002,8 +43324,8 @@ "question__title": "Add Two Numbers II", "question__title_slug": "add-two-numbers-ii", "question__hide": false, - "total_acs": 318253, - "total_submitted": 540713, + "total_acs": 320665, + "total_submitted": 544297, "frontend_question_id": 445, "is_new_question": false }, @@ -43025,8 +43347,8 @@ "question__title": "Sequence Reconstruction", "question__title_slug": "sequence-reconstruction", "question__hide": false, - "total_acs": 45375, - "total_submitted": 178622, + "total_acs": 45786, + "total_submitted": 179361, "frontend_question_id": 444, "is_new_question": false }, @@ -43048,8 +43370,8 @@ "question__title": "String Compression", "question__title_slug": "string-compression", "question__hide": false, - "total_acs": 254430, - "total_submitted": 532714, + "total_acs": 256732, + "total_submitted": 536794, "frontend_question_id": 443, "is_new_question": false }, @@ -43071,8 +43393,8 @@ "question__title": "Find All Duplicates in an Array", "question__title_slug": "find-all-duplicates-in-an-array", "question__hide": false, - "total_acs": 411867, - "total_submitted": 566868, + "total_acs": 416186, + "total_submitted": 572217, "frontend_question_id": 442, "is_new_question": false }, @@ -43094,8 +43416,8 @@ "question__title": "Arranging Coins", "question__title_slug": "arranging-coins", "question__hide": false, - "total_acs": 288252, - "total_submitted": 632207, + "total_acs": 291131, + "total_submitted": 637776, "frontend_question_id": 441, "is_new_question": false }, @@ -43117,8 +43439,8 @@ "question__title": "K-th Smallest in Lexicographical Order", "question__title_slug": "k-th-smallest-in-lexicographical-order", "question__hide": false, - "total_acs": 17738, - "total_submitted": 57998, + "total_acs": 17808, + "total_submitted": 58209, "frontend_question_id": 440, "is_new_question": false }, @@ -43140,8 +43462,8 @@ "question__title": "Ternary Expression Parser", "question__title_slug": "ternary-expression-parser", "question__hide": false, - "total_acs": 24989, - "total_submitted": 43106, + "total_acs": 25018, + "total_submitted": 43152, "frontend_question_id": 439, "is_new_question": false }, @@ -43163,8 +43485,8 @@ "question__title": "Find All Anagrams in a String", "question__title_slug": "find-all-anagrams-in-a-string", "question__hide": false, - "total_acs": 544142, - "total_submitted": 1122989, + "total_acs": 550116, + "total_submitted": 1133789, "frontend_question_id": 438, "is_new_question": false }, @@ -43186,8 +43508,8 @@ "question__title": "Path Sum III", "question__title_slug": "path-sum-iii", "question__hide": false, - "total_acs": 371947, - "total_submitted": 743182, + "total_acs": 375796, + "total_submitted": 751332, "frontend_question_id": 437, "is_new_question": false }, @@ -43209,8 +43531,8 @@ "question__title": "Find Right Interval", "question__title_slug": "find-right-interval", "question__hide": false, - "total_acs": 79689, - "total_submitted": 159842, + "total_acs": 80368, + "total_submitted": 160945, "frontend_question_id": 436, "is_new_question": false }, @@ -43232,8 +43554,8 @@ "question__title": "Non-overlapping Intervals", "question__title_slug": "non-overlapping-intervals", "question__hide": false, - "total_acs": 259710, - "total_submitted": 533745, + "total_acs": 264761, + "total_submitted": 542694, "frontend_question_id": 435, "is_new_question": false }, @@ -43255,8 +43577,8 @@ "question__title": "Number of Segments in a String", "question__title_slug": "number-of-segments-in-a-string", "question__hide": false, - "total_acs": 118322, - "total_submitted": 312519, + "total_acs": 119168, + "total_submitted": 314774, "frontend_question_id": 434, "is_new_question": false }, @@ -43278,8 +43600,8 @@ "question__title": "Minimum Genetic Mutation", "question__title_slug": "minimum-genetic-mutation", "question__hide": false, - "total_acs": 55812, - "total_submitted": 118281, + "total_acs": 56498, + "total_submitted": 119402, "frontend_question_id": 433, "is_new_question": false }, @@ -43301,8 +43623,8 @@ "question__title": "All O`one Data Structure", "question__title_slug": "all-oone-data-structure", "question__hide": false, - "total_acs": 60122, - "total_submitted": 165772, + "total_acs": 60848, + "total_submitted": 167284, "frontend_question_id": 432, "is_new_question": false }, @@ -43324,8 +43646,8 @@ "question__title": "Word Squares", "question__title_slug": "word-squares", "question__hide": false, - "total_acs": 63894, - "total_submitted": 121880, + "total_acs": 64258, + "total_submitted": 122558, "frontend_question_id": 425, "is_new_question": false }, @@ -43347,8 +43669,8 @@ "question__title": "Longest Repeating Character Replacement", "question__title_slug": "longest-repeating-character-replacement", "question__hide": false, - "total_acs": 241968, - "total_submitted": 474657, + "total_acs": 250056, + "total_submitted": 490223, "frontend_question_id": 424, "is_new_question": false }, @@ -43370,8 +43692,8 @@ "question__title": "Reconstruct Original Digits from English", "question__title_slug": "reconstruct-original-digits-from-english", "question__hide": false, - "total_acs": 64482, - "total_submitted": 125725, + "total_acs": 64846, + "total_submitted": 126407, "frontend_question_id": 423, "is_new_question": false }, @@ -43393,8 +43715,8 @@ "question__title": "Valid Word Square", "question__title_slug": "valid-word-square", "question__hide": false, - "total_acs": 40804, - "total_submitted": 105500, + "total_acs": 40947, + "total_submitted": 105855, "frontend_question_id": 422, "is_new_question": false }, @@ -43416,8 +43738,8 @@ "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": 124952, - "total_submitted": 229709, + "total_acs": 125961, + "total_submitted": 231438, "frontend_question_id": 421, "is_new_question": false }, @@ -43439,8 +43761,8 @@ "question__title": "Strong Password Checker", "question__title_slug": "strong-password-checker", "question__hide": false, - "total_acs": 25259, - "total_submitted": 177182, + "total_acs": 25495, + "total_submitted": 178719, "frontend_question_id": 420, "is_new_question": false }, @@ -43462,8 +43784,8 @@ "question__title": "Battleships in a Board", "question__title_slug": "battleships-in-a-board", "question__hide": false, - "total_acs": 153176, - "total_submitted": 207112, + "total_acs": 154987, + "total_submitted": 209319, "frontend_question_id": 419, "is_new_question": false }, @@ -43485,8 +43807,8 @@ "question__title": "Sentence Screen Fitting", "question__title_slug": "sentence-screen-fitting", "question__hide": false, - "total_acs": 83722, - "total_submitted": 236258, + "total_acs": 84362, + "total_submitted": 238033, "frontend_question_id": 418, "is_new_question": false }, @@ -43508,8 +43830,8 @@ "question__title": "Pacific Atlantic Water Flow", "question__title_slug": "pacific-atlantic-water-flow", "question__hide": false, - "total_acs": 213358, - "total_submitted": 427144, + "total_acs": 218365, + "total_submitted": 435298, "frontend_question_id": 417, "is_new_question": false }, @@ -43531,8 +43853,8 @@ "question__title": "Partition Equal Subset Sum", "question__title_slug": "partition-equal-subset-sum", "question__hide": false, - "total_acs": 459215, - "total_submitted": 986530, + "total_acs": 466804, + "total_submitted": 1001974, "frontend_question_id": 416, "is_new_question": false }, @@ -43554,8 +43876,8 @@ "question__title": "Add Strings", "question__title_slug": "add-strings", "question__hide": false, - "total_acs": 482960, - "total_submitted": 923040, + "total_acs": 486365, + "total_submitted": 929255, "frontend_question_id": 415, "is_new_question": false }, @@ -43577,8 +43899,8 @@ "question__title": "Third Maximum Number", "question__title_slug": "third-maximum-number", "question__hide": false, - "total_acs": 336914, - "total_submitted": 1053976, + "total_acs": 341247, + "total_submitted": 1065250, "frontend_question_id": 414, "is_new_question": false }, @@ -43600,8 +43922,8 @@ "question__title": "Arithmetic Slices", "question__title_slug": "arithmetic-slices", "question__hide": false, - "total_acs": 234164, - "total_submitted": 362321, + "total_acs": 236240, + "total_submitted": 365119, "frontend_question_id": 413, "is_new_question": false }, @@ -43623,8 +43945,8 @@ "question__title": "Fizz Buzz", "question__title_slug": "fizz-buzz", "question__hide": false, - "total_acs": 645997, - "total_submitted": 962567, + "total_acs": 654255, + "total_submitted": 973194, "frontend_question_id": 412, "is_new_question": false }, @@ -43646,8 +43968,8 @@ "question__title": "Minimum Unique Word Abbreviation", "question__title_slug": "minimum-unique-word-abbreviation", "question__hide": false, - "total_acs": 13430, - "total_submitted": 34808, + "total_acs": 13773, + "total_submitted": 35236, "frontend_question_id": 411, "is_new_question": false }, @@ -43669,8 +43991,8 @@ "question__title": "Split Array Largest Sum", "question__title_slug": "split-array-largest-sum", "question__hide": false, - "total_acs": 214774, - "total_submitted": 410159, + "total_acs": 217025, + "total_submitted": 413538, "frontend_question_id": 410, "is_new_question": false }, @@ -43692,8 +44014,8 @@ "question__title": "Longest Palindrome", "question__title_slug": "longest-palindrome", "question__hide": false, - "total_acs": 286640, - "total_submitted": 532755, + "total_acs": 297584, + "total_submitted": 551344, "frontend_question_id": 409, "is_new_question": false }, @@ -43715,8 +44037,8 @@ "question__title": "Valid Word Abbreviation", "question__title_slug": "valid-word-abbreviation", "question__hide": false, - "total_acs": 101717, - "total_submitted": 292072, + "total_acs": 102947, + "total_submitted": 295468, "frontend_question_id": 408, "is_new_question": false }, @@ -43738,8 +44060,8 @@ "question__title": "Trapping Rain Water II", "question__title_slug": "trapping-rain-water-ii", "question__hide": false, - "total_acs": 70399, - "total_submitted": 149318, + "total_acs": 70845, + "total_submitted": 150112, "frontend_question_id": 407, "is_new_question": false }, @@ -43761,8 +44083,8 @@ "question__title": "Queue Reconstruction by Height", "question__title_slug": "queue-reconstruction-by-height", "question__hide": false, - "total_acs": 224950, - "total_submitted": 320025, + "total_acs": 243203, + "total_submitted": 340714, "frontend_question_id": 406, "is_new_question": false }, @@ -43784,8 +44106,8 @@ "question__title": "Convert a Number to Hexadecimal", "question__title_slug": "convert-a-number-to-hexadecimal", "question__hide": false, - "total_acs": 100560, - "total_submitted": 219328, + "total_acs": 101206, + "total_submitted": 220716, "frontend_question_id": 405, "is_new_question": false }, @@ -43807,8 +44129,8 @@ "question__title": "Sum of Left Leaves", "question__title_slug": "sum-of-left-leaves", "question__hide": false, - "total_acs": 358420, - "total_submitted": 646684, + "total_acs": 361995, + "total_submitted": 652145, "frontend_question_id": 404, "is_new_question": false }, @@ -43830,8 +44152,8 @@ "question__title": "Frog Jump", "question__title_slug": "frog-jump", "question__hide": false, - "total_acs": 156904, - "total_submitted": 364630, + "total_acs": 158126, + "total_submitted": 367257, "frontend_question_id": 403, "is_new_question": false }, @@ -43853,8 +44175,8 @@ "question__title": "Remove K Digits", "question__title_slug": "remove-k-digits", "question__hide": false, - "total_acs": 267874, - "total_submitted": 878401, + "total_acs": 269670, + "total_submitted": 884464, "frontend_question_id": 402, "is_new_question": false }, @@ -43876,8 +44198,8 @@ "question__title": "Binary Watch", "question__title_slug": "binary-watch", "question__hide": false, - "total_acs": 111518, - "total_submitted": 219545, + "total_acs": 112014, + "total_submitted": 220256, "frontend_question_id": 401, "is_new_question": false }, @@ -43899,8 +44221,8 @@ "question__title": "Nth Digit", "question__title_slug": "nth-digit", "question__hide": false, - "total_acs": 76741, - "total_submitted": 228187, + "total_acs": 77194, + "total_submitted": 229278, "frontend_question_id": 400, "is_new_question": false }, @@ -43922,8 +44244,8 @@ "question__title": "Evaluate Division", "question__title_slug": "evaluate-division", "question__hide": false, - "total_acs": 284708, - "total_submitted": 483924, + "total_acs": 287498, + "total_submitted": 488055, "frontend_question_id": 399, "is_new_question": false }, @@ -43945,8 +44267,8 @@ "question__title": "Random Pick Index", "question__title_slug": "random-pick-index", "question__hide": false, - "total_acs": 172700, - "total_submitted": 272275, + "total_acs": 173548, + "total_submitted": 273810, "frontend_question_id": 398, "is_new_question": false }, @@ -43968,8 +44290,8 @@ "question__title": "Integer Replacement", "question__title_slug": "integer-replacement", "question__hide": false, - "total_acs": 83486, - "total_submitted": 239991, + "total_acs": 84108, + "total_submitted": 241556, "frontend_question_id": 397, "is_new_question": false }, @@ -43991,8 +44313,8 @@ "question__title": "Rotate Function", "question__title_slug": "rotate-function", "question__hide": false, - "total_acs": 62431, - "total_submitted": 157761, + "total_acs": 62794, + "total_submitted": 158384, "frontend_question_id": 396, "is_new_question": false }, @@ -44014,8 +44336,8 @@ "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": 159853, - "total_submitted": 358202, + "total_acs": 161031, + "total_submitted": 360590, "frontend_question_id": 395, "is_new_question": false }, @@ -44037,8 +44359,8 @@ "question__title": "Decode String", "question__title_slug": "decode-string", "question__hide": false, - "total_acs": 505711, - "total_submitted": 894243, + "total_acs": 511041, + "total_submitted": 902652, "frontend_question_id": 394, "is_new_question": false }, @@ -44060,8 +44382,8 @@ "question__title": "UTF-8 Validation", "question__title_slug": "utf-8-validation", "question__hide": false, - "total_acs": 68211, - "total_submitted": 173752, + "total_acs": 68453, + "total_submitted": 174310, "frontend_question_id": 393, "is_new_question": false }, @@ -44083,8 +44405,8 @@ "question__title": "Is Subsequence", "question__title_slug": "is-subsequence", "question__hide": false, - "total_acs": 473338, - "total_submitted": 928180, + "total_acs": 491988, + "total_submitted": 967559, "frontend_question_id": 392, "is_new_question": false }, @@ -44106,8 +44428,8 @@ "question__title": "Perfect Rectangle", "question__title_slug": "perfect-rectangle", "question__hide": false, - "total_acs": 34720, - "total_submitted": 107926, + "total_acs": 34904, + "total_submitted": 108329, "frontend_question_id": 391, "is_new_question": false }, @@ -44129,8 +44451,8 @@ "question__title": "Elimination Game", "question__title_slug": "elimination-game", "question__hide": false, - "total_acs": 46238, - "total_submitted": 99796, + "total_acs": 46705, + "total_submitted": 100648, "frontend_question_id": 390, "is_new_question": false }, @@ -44152,8 +44474,8 @@ "question__title": "Find the Difference", "question__title_slug": "find-the-difference", "question__hide": false, - "total_acs": 402843, - "total_submitted": 665543, + "total_acs": 406362, + "total_submitted": 671259, "frontend_question_id": 389, "is_new_question": false }, @@ -44175,8 +44497,8 @@ "question__title": "Longest Absolute File Path", "question__title_slug": "longest-absolute-file-path", "question__hide": false, - "total_acs": 131394, - "total_submitted": 285049, + "total_acs": 132379, + "total_submitted": 286753, "frontend_question_id": 388, "is_new_question": false }, @@ -44198,8 +44520,8 @@ "question__title": "First Unique Character in a String", "question__title_slug": "first-unique-character-in-a-string", "question__hide": false, - "total_acs": 1077305, - "total_submitted": 1877467, + "total_acs": 1087814, + "total_submitted": 1893553, "frontend_question_id": 387, "is_new_question": false }, @@ -44221,8 +44543,8 @@ "question__title": "Lexicographical Numbers", "question__title_slug": "lexicographical-numbers", "question__hide": false, - "total_acs": 85709, - "total_submitted": 144458, + "total_acs": 86408, + "total_submitted": 145306, "frontend_question_id": 386, "is_new_question": false }, @@ -44244,8 +44566,8 @@ "question__title": "Mini Parser", "question__title_slug": "mini-parser", "question__hide": false, - "total_acs": 48564, - "total_submitted": 134641, + "total_acs": 48740, + "total_submitted": 135021, "frontend_question_id": 385, "is_new_question": false }, @@ -44267,8 +44589,8 @@ "question__title": "Shuffle an Array", "question__title_slug": "shuffle-an-array", "question__hide": false, - "total_acs": 266228, - "total_submitted": 465572, + "total_acs": 267848, + "total_submitted": 468096, "frontend_question_id": 384, "is_new_question": false }, @@ -44290,8 +44612,8 @@ "question__title": "Ransom Note", "question__title_slug": "ransom-note", "question__hide": false, - "total_acs": 410830, - "total_submitted": 732875, + "total_acs": 420901, + "total_submitted": 749844, "frontend_question_id": 383, "is_new_question": false }, @@ -44313,8 +44635,8 @@ "question__title": "Linked List Random Node", "question__title_slug": "linked-list-random-node", "question__hide": false, - "total_acs": 153730, - "total_submitted": 260149, + "total_acs": 154299, + "total_submitted": 260957, "frontend_question_id": 382, "is_new_question": false }, @@ -44336,8 +44658,8 @@ "question__title": "Insert Delete GetRandom O(1) - Duplicates allowed", "question__title_slug": "insert-delete-getrandom-o1-duplicates-allowed", "question__hide": false, - "total_acs": 110950, - "total_submitted": 312025, + "total_acs": 111569, + "total_submitted": 313736, "frontend_question_id": 381, "is_new_question": false }, @@ -44359,8 +44681,8 @@ "question__title": "Insert Delete GetRandom O(1)", "question__title_slug": "insert-delete-getrandom-o1", "question__hide": false, - "total_acs": 489051, - "total_submitted": 949142, + "total_acs": 492879, + "total_submitted": 955755, "frontend_question_id": 380, "is_new_question": false }, @@ -44382,8 +44704,8 @@ "question__title": "Design Phone Directory", "question__title_slug": "design-phone-directory", "question__hide": false, - "total_acs": 56179, - "total_submitted": 111244, + "total_acs": 56504, + "total_submitted": 111774, "frontend_question_id": 379, "is_new_question": false }, @@ -44405,8 +44727,8 @@ "question__title": "Kth Smallest Element in a Sorted Matrix", "question__title_slug": "kth-smallest-element-in-a-sorted-matrix", "question__hide": false, - "total_acs": 394619, - "total_submitted": 658685, + "total_acs": 398381, + "total_submitted": 664160, "frontend_question_id": 378, "is_new_question": false }, @@ -44428,8 +44750,8 @@ "question__title": "Combination Sum IV", "question__title_slug": "combination-sum-iv", "question__hide": false, - "total_acs": 250718, - "total_submitted": 504776, + "total_acs": 253692, + "total_submitted": 509985, "frontend_question_id": 377, "is_new_question": false }, @@ -44451,8 +44773,8 @@ "question__title": "Wiggle Subsequence", "question__title_slug": "wiggle-subsequence", "question__hide": false, - "total_acs": 141243, - "total_submitted": 312498, + "total_acs": 142656, + "total_submitted": 314970, "frontend_question_id": 376, "is_new_question": false }, @@ -44474,8 +44796,8 @@ "question__title": "Guess Number Higher or Lower II", "question__title_slug": "guess-number-higher-or-lower-ii", "question__hide": false, - "total_acs": 94364, - "total_submitted": 206818, + "total_acs": 94773, + "total_submitted": 207420, "frontend_question_id": 375, "is_new_question": false }, @@ -44497,8 +44819,8 @@ "question__title": "Guess Number Higher or Lower", "question__title_slug": "guess-number-higher-or-lower", "question__hide": false, - "total_acs": 338321, - "total_submitted": 682084, + "total_acs": 342586, + "total_submitted": 689314, "frontend_question_id": 374, "is_new_question": false }, @@ -44520,8 +44842,8 @@ "question__title": "Find K Pairs with Smallest Sums", "question__title_slug": "find-k-pairs-with-smallest-sums", "question__hide": false, - "total_acs": 174229, - "total_submitted": 451403, + "total_acs": 175636, + "total_submitted": 455145, "frontend_question_id": 373, "is_new_question": false }, @@ -44543,8 +44865,8 @@ "question__title": "Super Pow", "question__title_slug": "super-pow", "question__hide": false, - "total_acs": 50228, - "total_submitted": 133907, + "total_acs": 50507, + "total_submitted": 134754, "frontend_question_id": 372, "is_new_question": false }, @@ -44566,8 +44888,8 @@ "question__title": "Sum of Two Integers", "question__title_slug": "sum-of-two-integers", "question__hide": false, - "total_acs": 306805, - "total_submitted": 606287, + "total_acs": 309788, + "total_submitted": 612206, "frontend_question_id": 371, "is_new_question": false }, @@ -44589,8 +44911,8 @@ "question__title": "Range Addition", "question__title_slug": "range-addition", "question__hide": false, - "total_acs": 72420, - "total_submitted": 103572, + "total_acs": 73083, + "total_submitted": 104391, "frontend_question_id": 370, "is_new_question": false }, @@ -44612,8 +44934,8 @@ "question__title": "Plus One Linked List", "question__title_slug": "plus-one-linked-list", "question__hide": false, - "total_acs": 68720, - "total_submitted": 113403, + "total_acs": 69044, + "total_submitted": 113860, "frontend_question_id": 369, "is_new_question": false }, @@ -44635,8 +44957,8 @@ "question__title": "Largest Divisible Subset", "question__title_slug": "largest-divisible-subset", "question__hide": false, - "total_acs": 153779, - "total_submitted": 377621, + "total_acs": 154935, + "total_submitted": 379941, "frontend_question_id": 368, "is_new_question": false }, @@ -44658,8 +44980,8 @@ "question__title": "Valid Perfect Square", "question__title_slug": "valid-perfect-square", "question__hide": false, - "total_acs": 380955, - "total_submitted": 883534, + "total_acs": 385428, + "total_submitted": 893413, "frontend_question_id": 367, "is_new_question": false }, @@ -44681,8 +45003,8 @@ "question__title": "Find Leaves of Binary Tree", "question__title_slug": "find-leaves-of-binary-tree", "question__hide": false, - "total_acs": 188507, - "total_submitted": 238478, + "total_acs": 192361, + "total_submitted": 242941, "frontend_question_id": 366, "is_new_question": false }, @@ -44704,8 +45026,8 @@ "question__title": "Water and Jug Problem", "question__title_slug": "water-and-jug-problem", "question__hide": false, - "total_acs": 65307, - "total_submitted": 185999, + "total_acs": 66066, + "total_submitted": 187317, "frontend_question_id": 365, "is_new_question": false }, @@ -44727,8 +45049,8 @@ "question__title": "Nested List Weight Sum II", "question__title_slug": "nested-list-weight-sum-ii", "question__hide": false, - "total_acs": 118506, - "total_submitted": 172244, + "total_acs": 119633, + "total_submitted": 173636, "frontend_question_id": 364, "is_new_question": false }, @@ -44750,8 +45072,8 @@ "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": 79927, - "total_submitted": 198910, + "total_acs": 80265, + "total_submitted": 199713, "frontend_question_id": 363, "is_new_question": false }, @@ -44773,8 +45095,8 @@ "question__title": "Design Hit Counter", "question__title_slug": "design-hit-counter", "question__hide": false, - "total_acs": 168448, - "total_submitted": 249079, + "total_acs": 169980, + "total_submitted": 251151, "frontend_question_id": 362, "is_new_question": false }, @@ -44796,8 +45118,8 @@ "question__title": "Bomb Enemy", "question__title_slug": "bomb-enemy", "question__hide": false, - "total_acs": 66614, - "total_submitted": 132462, + "total_acs": 66989, + "total_submitted": 133123, "frontend_question_id": 361, "is_new_question": false }, @@ -44819,8 +45141,8 @@ "question__title": "Sort Transformed Array", "question__title_slug": "sort-transformed-array", "question__hide": false, - "total_acs": 56204, - "total_submitted": 103946, + "total_acs": 56815, + "total_submitted": 104824, "frontend_question_id": 360, "is_new_question": false }, @@ -44842,8 +45164,8 @@ "question__title": "Logger Rate Limiter", "question__title_slug": "logger-rate-limiter", "question__hide": false, - "total_acs": 232530, - "total_submitted": 309384, + "total_acs": 235205, + "total_submitted": 312845, "frontend_question_id": 359, "is_new_question": false }, @@ -44865,8 +45187,8 @@ "question__title": "Rearrange String k Distance Apart", "question__title_slug": "rearrange-string-k-distance-apart", "question__hide": false, - "total_acs": 53206, - "total_submitted": 142926, + "total_acs": 53524, + "total_submitted": 143675, "frontend_question_id": 358, "is_new_question": false }, @@ -44888,8 +45210,8 @@ "question__title": "Count Numbers with Unique Digits", "question__title_slug": "count-numbers-with-unique-digits", "question__hide": false, - "total_acs": 103881, - "total_submitted": 204480, + "total_acs": 104427, + "total_submitted": 205304, "frontend_question_id": 357, "is_new_question": false }, @@ -44911,8 +45233,8 @@ "question__title": "Line Reflection", "question__title_slug": "line-reflection", "question__hide": false, - "total_acs": 32329, - "total_submitted": 93846, + "total_acs": 32380, + "total_submitted": 93977, "frontend_question_id": 356, "is_new_question": false }, @@ -44934,8 +45256,8 @@ "question__title": "Design Twitter", "question__title_slug": "design-twitter", "question__hide": false, - "total_acs": 90252, - "total_submitted": 257380, + "total_acs": 91667, + "total_submitted": 260216, "frontend_question_id": 355, "is_new_question": false }, @@ -44957,8 +45279,8 @@ "question__title": "Russian Doll Envelopes", "question__title_slug": "russian-doll-envelopes", "question__hide": false, - "total_acs": 167155, - "total_submitted": 430720, + "total_acs": 168134, + "total_submitted": 433845, "frontend_question_id": 354, "is_new_question": false }, @@ -44980,8 +45302,8 @@ "question__title": "Design Snake Game", "question__title_slug": "design-snake-game", "question__hide": false, - "total_acs": 61883, - "total_submitted": 161191, + "total_acs": 62333, + "total_submitted": 162068, "frontend_question_id": 353, "is_new_question": false }, @@ -45003,8 +45325,8 @@ "question__title": "Data Stream as Disjoint Intervals", "question__title_slug": "data-stream-as-disjoint-intervals", "question__hide": false, - "total_acs": 51978, - "total_submitted": 102182, + "total_acs": 52260, + "total_submitted": 102619, "frontend_question_id": 352, "is_new_question": false }, @@ -45026,8 +45348,8 @@ "question__title": "Android Unlock Patterns", "question__title_slug": "android-unlock-patterns", "question__hide": false, - "total_acs": 65139, - "total_submitted": 127423, + "total_acs": 65416, + "total_submitted": 127912, "frontend_question_id": 351, "is_new_question": false }, @@ -45049,8 +45371,8 @@ "question__title": "Intersection of Two Arrays II", "question__title_slug": "intersection-of-two-arrays-ii", "question__hide": false, - "total_acs": 826307, - "total_submitted": 1498626, + "total_acs": 837406, + "total_submitted": 1517297, "frontend_question_id": 350, "is_new_question": false }, @@ -45072,8 +45394,8 @@ "question__title": "Intersection of Two Arrays", "question__title_slug": "intersection-of-two-arrays", "question__hide": false, - "total_acs": 682064, - "total_submitted": 983099, + "total_acs": 688992, + "total_submitted": 991808, "frontend_question_id": 349, "is_new_question": false }, @@ -45095,8 +45417,8 @@ "question__title": "Design Tic-Tac-Toe", "question__title_slug": "design-tic-tac-toe", "question__hide": false, - "total_acs": 187082, - "total_submitted": 326237, + "total_acs": 188343, + "total_submitted": 328308, "frontend_question_id": 348, "is_new_question": false }, @@ -45118,8 +45440,8 @@ "question__title": "Top K Frequent Elements", "question__title_slug": "top-k-frequent-elements", "question__hide": false, - "total_acs": 1003842, - "total_submitted": 1543897, + "total_acs": 1022051, + "total_submitted": 1572091, "frontend_question_id": 347, "is_new_question": false }, @@ -45141,8 +45463,8 @@ "question__title": "Moving Average from Data Stream", "question__title_slug": "moving-average-from-data-stream", "question__hide": false, - "total_acs": 267639, - "total_submitted": 349604, + "total_acs": 270021, + "total_submitted": 352464, "frontend_question_id": 346, "is_new_question": false }, @@ -45164,8 +45486,8 @@ "question__title": "Reverse Vowels of a String", "question__title_slug": "reverse-vowels-of-a-string", "question__hide": false, - "total_acs": 358062, - "total_submitted": 760102, + "total_acs": 360392, + "total_submitted": 764451, "frontend_question_id": 345, "is_new_question": false }, @@ -45187,8 +45509,8 @@ "question__title": "Reverse String", "question__title_slug": "reverse-string", "question__hide": false, - "total_acs": 1646634, - "total_submitted": 2189416, + "total_acs": 1665127, + "total_submitted": 2211503, "frontend_question_id": 344, "is_new_question": false }, @@ -45210,8 +45532,8 @@ "question__title": "Integer Break", "question__title_slug": "integer-break", "question__hide": false, - "total_acs": 191056, - "total_submitted": 351038, + "total_acs": 192947, + "total_submitted": 353772, "frontend_question_id": 343, "is_new_question": false }, @@ -45233,8 +45555,8 @@ "question__title": "Power of Four", "question__title_slug": "power-of-four", "question__hide": false, - "total_acs": 305668, - "total_submitted": 690162, + "total_acs": 308533, + "total_submitted": 695423, "frontend_question_id": 342, "is_new_question": false }, @@ -45256,8 +45578,8 @@ "question__title": "Flatten Nested List Iterator", "question__title_slug": "flatten-nested-list-iterator", "question__hide": false, - "total_acs": 327855, - "total_submitted": 538574, + "total_acs": 329827, + "total_submitted": 541064, "frontend_question_id": 341, "is_new_question": false }, @@ -45279,8 +45601,8 @@ "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": 280057, - "total_submitted": 590011, + "total_acs": 281771, + "total_submitted": 593176, "frontend_question_id": 340, "is_new_question": false }, @@ -45302,8 +45624,8 @@ "question__title": "Nested List Weight Sum", "question__title_slug": "nested-list-weight-sum", "question__hide": false, - "total_acs": 199045, - "total_submitted": 244145, + "total_acs": 200786, + "total_submitted": 246089, "frontend_question_id": 339, "is_new_question": false }, @@ -45325,8 +45647,8 @@ "question__title": "Counting Bits", "question__title_slug": "counting-bits", "question__hide": false, - "total_acs": 598169, - "total_submitted": 802704, + "total_acs": 606026, + "total_submitted": 812554, "frontend_question_id": 338, "is_new_question": false }, @@ -45348,8 +45670,8 @@ "question__title": "House Robber III", "question__title_slug": "house-robber-iii", "question__hide": false, - "total_acs": 292013, - "total_submitted": 544669, + "total_acs": 294070, + "total_submitted": 548325, "frontend_question_id": 337, "is_new_question": false }, @@ -45371,8 +45693,8 @@ "question__title": "Palindrome Pairs", "question__title_slug": "palindrome-pairs", "question__hide": false, - "total_acs": 149524, - "total_submitted": 420378, + "total_acs": 150071, + "total_submitted": 422580, "frontend_question_id": 336, "is_new_question": false }, @@ -45394,8 +45716,8 @@ "question__title": "Self Crossing", "question__title_slug": "self-crossing", "question__hide": false, - "total_acs": 27878, - "total_submitted": 95716, + "total_acs": 27948, + "total_submitted": 95884, "frontend_question_id": 335, "is_new_question": false }, @@ -45417,8 +45739,8 @@ "question__title": "Increasing Triplet Subsequence", "question__title_slug": "increasing-triplet-subsequence", "question__hide": false, - "total_acs": 277484, - "total_submitted": 667279, + "total_acs": 279734, + "total_submitted": 672448, "frontend_question_id": 334, "is_new_question": false }, @@ -45440,8 +45762,8 @@ "question__title": "Largest BST Subtree", "question__title_slug": "largest-bst-subtree", "question__hide": false, - "total_acs": 84387, - "total_submitted": 203235, + "total_acs": 84925, + "total_submitted": 204244, "frontend_question_id": 333, "is_new_question": false }, @@ -45463,8 +45785,8 @@ "question__title": "Reconstruct Itinerary", "question__title_slug": "reconstruct-itinerary", "question__hide": false, - "total_acs": 286980, - "total_submitted": 711185, + "total_acs": 289210, + "total_submitted": 715699, "frontend_question_id": 332, "is_new_question": false }, @@ -45486,8 +45808,8 @@ "question__title": "Verify Preorder Serialization of a Binary Tree", "question__title_slug": "verify-preorder-serialization-of-a-binary-tree", "question__hide": false, - "total_acs": 115331, - "total_submitted": 263265, + "total_acs": 115884, + "total_submitted": 264330, "frontend_question_id": 331, "is_new_question": false }, @@ -45509,8 +45831,8 @@ "question__title": "Patching Array", "question__title_slug": "patching-array", "question__hide": false, - "total_acs": 56804, - "total_submitted": 143316, + "total_acs": 56995, + "total_submitted": 143652, "frontend_question_id": 330, "is_new_question": false }, @@ -45532,8 +45854,8 @@ "question__title": "Longest Increasing Path in a Matrix", "question__title_slug": "longest-increasing-path-in-a-matrix", "question__hide": false, - "total_acs": 367842, - "total_submitted": 716571, + "total_acs": 371910, + "total_submitted": 723237, "frontend_question_id": 329, "is_new_question": false }, @@ -45555,8 +45877,8 @@ "question__title": "Odd Even Linked List", "question__title_slug": "odd-even-linked-list", "question__hide": false, - "total_acs": 538329, - "total_submitted": 902381, + "total_acs": 543406, + "total_submitted": 910095, "frontend_question_id": 328, "is_new_question": false }, @@ -45578,8 +45900,8 @@ "question__title": "Count of Range Sum", "question__title_slug": "count-of-range-sum", "question__hide": false, - "total_acs": 60655, - "total_submitted": 168113, + "total_acs": 61068, + "total_submitted": 169165, "frontend_question_id": 327, "is_new_question": false }, @@ -45601,8 +45923,8 @@ "question__title": "Power of Three", "question__title_slug": "power-of-three", "question__hide": false, - "total_acs": 476194, - "total_submitted": 1091265, + "total_acs": 480834, + "total_submitted": 1100783, "frontend_question_id": 326, "is_new_question": false }, @@ -45624,8 +45946,8 @@ "question__title": "Maximum Size Subarray Sum Equals k", "question__title_slug": "maximum-size-subarray-sum-equals-k", "question__hide": false, - "total_acs": 158543, - "total_submitted": 321779, + "total_acs": 159236, + "total_submitted": 323182, "frontend_question_id": 325, "is_new_question": false }, @@ -45647,8 +45969,8 @@ "question__title": "Wiggle Sort II", "question__title_slug": "wiggle-sort-ii", "question__hide": false, - "total_acs": 123501, - "total_submitted": 381686, + "total_acs": 124751, + "total_submitted": 384655, "frontend_question_id": 324, "is_new_question": false }, @@ -45670,8 +45992,8 @@ "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": 261947, - "total_submitted": 426606, + "total_acs": 265342, + "total_submitted": 431803, "frontend_question_id": 323, "is_new_question": false }, @@ -45693,8 +46015,8 @@ "question__title": "Coin Change", "question__title_slug": "coin-change", "question__hide": false, - "total_acs": 1052664, - "total_submitted": 2583273, + "total_acs": 1068161, + "total_submitted": 2617090, "frontend_question_id": 322, "is_new_question": false }, @@ -45716,8 +46038,8 @@ "question__title": "Create Maximum Number", "question__title_slug": "create-maximum-number", "question__hide": false, - "total_acs": 50267, - "total_submitted": 176306, + "total_acs": 50499, + "total_submitted": 176926, "frontend_question_id": 321, "is_new_question": false }, @@ -45739,8 +46061,8 @@ "question__title": "Generalized Abbreviation", "question__title_slug": "generalized-abbreviation", "question__hide": false, - "total_acs": 61522, - "total_submitted": 108605, + "total_acs": 61750, + "total_submitted": 108871, "frontend_question_id": 320, "is_new_question": false }, @@ -45762,8 +46084,8 @@ "question__title": "Bulb Switcher", "question__title_slug": "bulb-switcher", "question__hide": false, - "total_acs": 116678, - "total_submitted": 245845, + "total_acs": 117345, + "total_submitted": 246867, "frontend_question_id": 319, "is_new_question": false }, @@ -45785,8 +46107,8 @@ "question__title": "Maximum Product of Word Lengths", "question__title_slug": "maximum-product-of-word-lengths", "question__hide": false, - "total_acs": 188972, - "total_submitted": 313766, + "total_acs": 189620, + "total_submitted": 314845, "frontend_question_id": 318, "is_new_question": false }, @@ -45808,8 +46130,8 @@ "question__title": "Shortest Distance from All Buildings", "question__title_slug": "shortest-distance-from-all-buildings", "question__hide": false, - "total_acs": 140878, - "total_submitted": 325947, + "total_acs": 141596, + "total_submitted": 327726, "frontend_question_id": 317, "is_new_question": false }, @@ -45831,8 +46153,8 @@ "question__title": "Remove Duplicate Letters", "question__title_slug": "remove-duplicate-letters", "question__hide": false, - "total_acs": 196849, - "total_submitted": 446907, + "total_acs": 198219, + "total_submitted": 449719, "frontend_question_id": 316, "is_new_question": false }, @@ -45854,8 +46176,8 @@ "question__title": "Count of Smaller Numbers After Self", "question__title_slug": "count-of-smaller-numbers-after-self", "question__hide": false, - "total_acs": 230135, - "total_submitted": 547523, + "total_acs": 231788, + "total_submitted": 551581, "frontend_question_id": 315, "is_new_question": false }, @@ -45877,8 +46199,8 @@ "question__title": "Binary Tree Vertical Order Traversal", "question__title_slug": "binary-tree-vertical-order-traversal", "question__hide": false, - "total_acs": 279774, - "total_submitted": 544047, + "total_acs": 282183, + "total_submitted": 548238, "frontend_question_id": 314, "is_new_question": false }, @@ -45900,8 +46222,8 @@ "question__title": "Super Ugly Number", "question__title_slug": "super-ugly-number", "question__hide": false, - "total_acs": 106236, - "total_submitted": 231793, + "total_acs": 106796, + "total_submitted": 232844, "frontend_question_id": 313, "is_new_question": false }, @@ -45923,8 +46245,8 @@ "question__title": "Burst Balloons", "question__title_slug": "burst-balloons", "question__hide": false, - "total_acs": 190849, - "total_submitted": 337801, + "total_acs": 192698, + "total_submitted": 340658, "frontend_question_id": 312, "is_new_question": false }, @@ -45946,8 +46268,8 @@ "question__title": "Sparse Matrix Multiplication", "question__title_slug": "sparse-matrix-multiplication", "question__hide": false, - "total_acs": 156628, - "total_submitted": 235447, + "total_acs": 157221, + "total_submitted": 236181, "frontend_question_id": 311, "is_new_question": false }, @@ -45969,8 +46291,8 @@ "question__title": "Minimum Height Trees", "question__title_slug": "minimum-height-trees", "question__hide": false, - "total_acs": 202295, - "total_submitted": 530028, + "total_acs": 204619, + "total_submitted": 535468, "frontend_question_id": 310, "is_new_question": false }, @@ -45992,8 +46314,8 @@ "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": 287956, - "total_submitted": 544052, + "total_acs": 291887, + "total_submitted": 549886, "frontend_question_id": 309, "is_new_question": false }, @@ -46015,8 +46337,8 @@ "question__title": "Range Sum Query 2D - Mutable", "question__title_slug": "range-sum-query-2d-mutable", "question__hide": false, - "total_acs": 66501, - "total_submitted": 160501, + "total_acs": 66877, + "total_submitted": 160949, "frontend_question_id": 308, "is_new_question": false }, @@ -46038,8 +46360,8 @@ "question__title": "Range Sum Query - Mutable", "question__title_slug": "range-sum-query-mutable", "question__hide": false, - "total_acs": 185474, - "total_submitted": 477721, + "total_acs": 186584, + "total_submitted": 480099, "frontend_question_id": 307, "is_new_question": false }, @@ -46061,8 +46383,8 @@ "question__title": "Additive Number", "question__title_slug": "additive-number", "question__hide": false, - "total_acs": 70435, - "total_submitted": 229874, + "total_acs": 70728, + "total_submitted": 230724, "frontend_question_id": 306, "is_new_question": false }, @@ -46084,8 +46406,8 @@ "question__title": "Number of Islands II", "question__title_slug": "number-of-islands-ii", "question__hide": false, - "total_acs": 115937, - "total_submitted": 294318, + "total_acs": 117011, + "total_submitted": 296394, "frontend_question_id": 305, "is_new_question": false }, @@ -46107,8 +46429,8 @@ "question__title": "Range Sum Query 2D - Immutable", "question__title_slug": "range-sum-query-2d-immutable", "question__hide": false, - "total_acs": 282031, - "total_submitted": 551948, + "total_acs": 284179, + "total_submitted": 554959, "frontend_question_id": 304, "is_new_question": false }, @@ -46130,8 +46452,8 @@ "question__title": "Range Sum Query - Immutable", "question__title_slug": "range-sum-query-immutable", "question__hide": false, - "total_acs": 364370, - "total_submitted": 647623, + "total_acs": 367414, + "total_submitted": 651026, "frontend_question_id": 303, "is_new_question": false }, @@ -46153,8 +46475,8 @@ "question__title": "Smallest Rectangle Enclosing Black Pixels", "question__title_slug": "smallest-rectangle-enclosing-black-pixels", "question__hide": false, - "total_acs": 43383, - "total_submitted": 75506, + "total_acs": 43634, + "total_submitted": 75826, "frontend_question_id": 302, "is_new_question": false }, @@ -46176,8 +46498,8 @@ "question__title": "Remove Invalid Parentheses", "question__title_slug": "remove-invalid-parentheses", "question__hide": false, - "total_acs": 353550, - "total_submitted": 753329, + "total_acs": 355070, + "total_submitted": 756663, "frontend_question_id": 301, "is_new_question": false }, @@ -46199,8 +46521,8 @@ "question__title": "Longest Increasing Subsequence", "question__title_slug": "longest-increasing-subsequence", "question__hide": false, - "total_acs": 889764, - "total_submitted": 1787741, + "total_acs": 902434, + "total_submitted": 1808775, "frontend_question_id": 300, "is_new_question": false }, @@ -46222,8 +46544,8 @@ "question__title": "Bulls and Cows", "question__title_slug": "bulls-and-cows", "question__hide": false, - "total_acs": 274397, - "total_submitted": 578021, + "total_acs": 275981, + "total_submitted": 580772, "frontend_question_id": 299, "is_new_question": false }, @@ -46245,8 +46567,8 @@ "question__title": "Binary Tree Longest Consecutive Sequence", "question__title_slug": "binary-tree-longest-consecutive-sequence", "question__hide": false, - "total_acs": 122838, - "total_submitted": 238901, + "total_acs": 123344, + "total_submitted": 239669, "frontend_question_id": 298, "is_new_question": false }, @@ -46268,8 +46590,8 @@ "question__title": "Serialize and Deserialize Binary Tree", "question__title_slug": "serialize-and-deserialize-binary-tree", "question__hide": false, - "total_acs": 625171, - "total_submitted": 1156530, + "total_acs": 631721, + "total_submitted": 1166757, "frontend_question_id": 297, "is_new_question": false }, @@ -46291,8 +46613,8 @@ "question__title": "Best Meeting Point", "question__title_slug": "best-meeting-point", "question__hide": false, - "total_acs": 59504, - "total_submitted": 100074, + "total_acs": 59787, + "total_submitted": 100542, "frontend_question_id": 296, "is_new_question": false }, @@ -46314,8 +46636,8 @@ "question__title": "Find Median from Data Stream", "question__title_slug": "find-median-from-data-stream", "question__hide": false, - "total_acs": 473515, - "total_submitted": 937038, + "total_acs": 479660, + "total_submitted": 947919, "frontend_question_id": 295, "is_new_question": false }, @@ -46337,8 +46659,8 @@ "question__title": "Flip Game II", "question__title_slug": "flip-game-ii", "question__hide": false, - "total_acs": 64271, - "total_submitted": 124557, + "total_acs": 64412, + "total_submitted": 124827, "frontend_question_id": 294, "is_new_question": false }, @@ -46360,8 +46682,8 @@ "question__title": "Flip Game", "question__title_slug": "flip-game", "question__hide": false, - "total_acs": 59936, - "total_submitted": 95639, + "total_acs": 60099, + "total_submitted": 95860, "frontend_question_id": 293, "is_new_question": false }, @@ -46383,8 +46705,8 @@ "question__title": "Nim Game", "question__title_slug": "nim-game", "question__hide": false, - "total_acs": 282325, - "total_submitted": 507878, + "total_acs": 283777, + "total_submitted": 510174, "frontend_question_id": 292, "is_new_question": false }, @@ -46406,8 +46728,8 @@ "question__title": "Word Pattern II", "question__title_slug": "word-pattern-ii", "question__hide": false, - "total_acs": 62073, - "total_submitted": 133499, + "total_acs": 62427, + "total_submitted": 134093, "frontend_question_id": 291, "is_new_question": false }, @@ -46429,8 +46751,8 @@ "question__title": "Word Pattern", "question__title_slug": "word-pattern", "question__hide": false, - "total_acs": 368523, - "total_submitted": 915907, + "total_acs": 371555, + "total_submitted": 922993, "frontend_question_id": 290, "is_new_question": false }, @@ -46452,8 +46774,8 @@ "question__title": "Game of Life", "question__title_slug": "game-of-life", "question__hide": false, - "total_acs": 346702, - "total_submitted": 528185, + "total_acs": 348571, + "total_submitted": 530462, "frontend_question_id": 289, "is_new_question": false }, @@ -46475,8 +46797,8 @@ "question__title": "Unique Word Abbreviation", "question__title_slug": "unique-word-abbreviation", "question__hide": false, - "total_acs": 65215, - "total_submitted": 262099, + "total_acs": 65394, + "total_submitted": 262518, "frontend_question_id": 288, "is_new_question": false }, @@ -46498,8 +46820,8 @@ "question__title": "Find the Duplicate Number", "question__title_slug": "find-the-duplicate-number", "question__hide": false, - "total_acs": 881145, - "total_submitted": 1496432, + "total_acs": 894817, + "total_submitted": 1519540, "frontend_question_id": 287, "is_new_question": false }, @@ -46521,8 +46843,8 @@ "question__title": "Walls and Gates", "question__title_slug": "walls-and-gates", "question__hide": false, - "total_acs": 226043, - "total_submitted": 379494, + "total_acs": 228264, + "total_submitted": 382883, "frontend_question_id": 286, "is_new_question": false }, @@ -46544,8 +46866,8 @@ "question__title": "Inorder Successor in BST", "question__title_slug": "inorder-successor-in-bst", "question__hide": false, - "total_acs": 269868, - "total_submitted": 568516, + "total_acs": 271536, + "total_submitted": 571319, "frontend_question_id": 285, "is_new_question": false }, @@ -46567,8 +46889,8 @@ "question__title": "Peeking Iterator", "question__title_slug": "peeking-iterator", "question__hide": false, - "total_acs": 193533, - "total_submitted": 335218, + "total_acs": 193965, + "total_submitted": 335727, "frontend_question_id": 284, "is_new_question": false }, @@ -46590,8 +46912,8 @@ "question__title": "Move Zeroes", "question__title_slug": "move-zeroes", "question__hide": false, - "total_acs": 1722855, - "total_submitted": 2832094, + "total_acs": 1743140, + "total_submitted": 2863155, "frontend_question_id": 283, "is_new_question": false }, @@ -46613,8 +46935,8 @@ "question__title": "Expression Add Operators", "question__title_slug": "expression-add-operators", "question__hide": false, - "total_acs": 184396, - "total_submitted": 470531, + "total_acs": 184910, + "total_submitted": 471980, "frontend_question_id": 282, "is_new_question": false }, @@ -46636,8 +46958,8 @@ "question__title": "Zigzag Iterator", "question__title_slug": "zigzag-iterator", "question__hide": false, - "total_acs": 81273, - "total_submitted": 131582, + "total_acs": 81544, + "total_submitted": 131918, "frontend_question_id": 281, "is_new_question": false }, @@ -46659,8 +46981,8 @@ "question__title": "Wiggle Sort", "question__title_slug": "wiggle-sort", "question__hide": false, - "total_acs": 115685, - "total_submitted": 175024, + "total_acs": 116105, + "total_submitted": 175612, "frontend_question_id": 280, "is_new_question": false }, @@ -46682,8 +47004,8 @@ "question__title": "Perfect Squares", "question__title_slug": "perfect-squares", "question__hide": false, - "total_acs": 536525, - "total_submitted": 1031907, + "total_acs": 540140, + "total_submitted": 1038357, "frontend_question_id": 279, "is_new_question": false }, @@ -46705,8 +47027,8 @@ "question__title": "First Bad Version", "question__title_slug": "first-bad-version", "question__hide": false, - "total_acs": 1050259, - "total_submitted": 2499524, + "total_acs": 1071175, + "total_submitted": 2541130, "frontend_question_id": 278, "is_new_question": false }, @@ -46728,8 +47050,8 @@ "question__title": "Find the Celebrity", "question__title_slug": "find-the-celebrity", "question__hide": false, - "total_acs": 227971, - "total_submitted": 486321, + "total_acs": 229352, + "total_submitted": 489085, "frontend_question_id": 277, "is_new_question": false }, @@ -46751,8 +47073,8 @@ "question__title": "Paint Fence", "question__title_slug": "paint-fence", "question__hide": false, - "total_acs": 87223, - "total_submitted": 201869, + "total_acs": 87873, + "total_submitted": 202888, "frontend_question_id": 276, "is_new_question": false }, @@ -46774,8 +47096,8 @@ "question__title": "H-Index II", "question__title_slug": "h-index-ii", "question__hide": false, - "total_acs": 160906, - "total_submitted": 433301, + "total_acs": 161585, + "total_submitted": 434760, "frontend_question_id": 275, "is_new_question": false }, @@ -46797,8 +47119,8 @@ "question__title": "H-Index", "question__title_slug": "h-index", "question__hide": false, - "total_acs": 237890, - "total_submitted": 629608, + "total_acs": 239016, + "total_submitted": 631927, "frontend_question_id": 274, "is_new_question": false }, @@ -46820,8 +47142,8 @@ "question__title": "Integer to English Words", "question__title_slug": "integer-to-english-words", "question__hide": false, - "total_acs": 307918, - "total_submitted": 1037995, + "total_acs": 309633, + "total_submitted": 1043462, "frontend_question_id": 273, "is_new_question": false }, @@ -46843,8 +47165,8 @@ "question__title": "Closest Binary Search Tree Value II", "question__title_slug": "closest-binary-search-tree-value-ii", "question__hide": false, - "total_acs": 100829, - "total_submitted": 175414, + "total_acs": 101742, + "total_submitted": 176710, "frontend_question_id": 272, "is_new_question": false }, @@ -46866,8 +47188,8 @@ "question__title": "Encode and Decode Strings", "question__title_slug": "encode-and-decode-strings", "question__hide": false, - "total_acs": 101231, - "total_submitted": 260717, + "total_acs": 102792, + "total_submitted": 263222, "frontend_question_id": 271, "is_new_question": false }, @@ -46889,8 +47211,8 @@ "question__title": "Closest Binary Search Tree Value", "question__title_slug": "closest-binary-search-tree-value", "question__hide": false, - "total_acs": 257493, - "total_submitted": 476258, + "total_acs": 259077, + "total_submitted": 478766, "frontend_question_id": 270, "is_new_question": false }, @@ -46912,8 +47234,8 @@ "question__title": "Alien Dictionary", "question__title_slug": "alien-dictionary", "question__hide": false, - "total_acs": 295800, - "total_submitted": 845735, + "total_acs": 298220, + "total_submitted": 851891, "frontend_question_id": 269, "is_new_question": false }, @@ -46935,8 +47257,8 @@ "question__title": "Missing Number", "question__title_slug": "missing-number", "question__hide": false, - "total_acs": 1100900, - "total_submitted": 1816961, + "total_acs": 1115661, + "total_submitted": 1838653, "frontend_question_id": 268, "is_new_question": false }, @@ -46958,8 +47280,8 @@ "question__title": "Palindrome Permutation II", "question__title_slug": "palindrome-permutation-ii", "question__hide": false, - "total_acs": 55859, - "total_submitted": 139845, + "total_acs": 56122, + "total_submitted": 140340, "frontend_question_id": 267, "is_new_question": false }, @@ -46981,8 +47303,8 @@ "question__title": "Palindrome Permutation", "question__title_slug": "palindrome-permutation", "question__hide": false, - "total_acs": 167053, - "total_submitted": 254832, + "total_acs": 167747, + "total_submitted": 255749, "frontend_question_id": 266, "is_new_question": false }, @@ -47004,8 +47326,8 @@ "question__title": "Paint House II", "question__title_slug": "paint-house-ii", "question__hide": false, - "total_acs": 97411, - "total_submitted": 190118, + "total_acs": 98039, + "total_submitted": 191006, "frontend_question_id": 265, "is_new_question": false }, @@ -47027,8 +47349,8 @@ "question__title": "Ugly Number II", "question__title_slug": "ugly-number-ii", "question__hide": false, - "total_acs": 263642, - "total_submitted": 579705, + "total_acs": 265901, + "total_submitted": 583601, "frontend_question_id": 264, "is_new_question": false }, @@ -47050,8 +47372,8 @@ "question__title": "Ugly Number", "question__title_slug": "ugly-number", "question__hide": false, - "total_acs": 303303, - "total_submitted": 725069, + "total_acs": 305566, + "total_submitted": 730450, "frontend_question_id": 263, "is_new_question": false }, @@ -47073,8 +47395,8 @@ "question__title": "Trips and Users", "question__title_slug": "trips-and-users", "question__hide": false, - "total_acs": 118934, - "total_submitted": 312807, + "total_acs": 120128, + "total_submitted": 315423, "frontend_question_id": 262, "is_new_question": false }, @@ -47096,8 +47418,8 @@ "question__title": "Graph Valid Tree", "question__title_slug": "graph-valid-tree", "question__hide": false, - "total_acs": 272802, - "total_submitted": 591644, + "total_acs": 276523, + "total_submitted": 598809, "frontend_question_id": 261, "is_new_question": false }, @@ -47119,8 +47441,8 @@ "question__title": "Single Number III", "question__title_slug": "single-number-iii", "question__hide": false, - "total_acs": 257751, - "total_submitted": 383507, + "total_acs": 259229, + "total_submitted": 385614, "frontend_question_id": 260, "is_new_question": false }, @@ -47142,8 +47464,8 @@ "question__title": "3Sum Smaller", "question__title_slug": "3sum-smaller", "question__hide": false, - "total_acs": 118638, - "total_submitted": 235294, + "total_acs": 119453, + "total_submitted": 236785, "frontend_question_id": 259, "is_new_question": false }, @@ -47165,8 +47487,8 @@ "question__title": "Add Digits", "question__title_slug": "add-digits", "question__hide": false, - "total_acs": 476935, - "total_submitted": 760890, + "total_acs": 479525, + "total_submitted": 764349, "frontend_question_id": 258, "is_new_question": false }, @@ -47188,8 +47510,8 @@ "question__title": "Binary Tree Paths", "question__title_slug": "binary-tree-paths", "question__hide": false, - "total_acs": 522148, - "total_submitted": 883002, + "total_acs": 526617, + "total_submitted": 888482, "frontend_question_id": 257, "is_new_question": false }, @@ -47211,8 +47533,8 @@ "question__title": "Paint House", "question__title_slug": "paint-house", "question__hide": false, - "total_acs": 160020, - "total_submitted": 270322, + "total_acs": 161300, + "total_submitted": 271913, "frontend_question_id": 256, "is_new_question": false }, @@ -47234,8 +47556,8 @@ "question__title": "Verify Preorder Sequence in Binary Search Tree", "question__title_slug": "verify-preorder-sequence-in-binary-search-tree", "question__hide": false, - "total_acs": 65463, - "total_submitted": 137214, + "total_acs": 65703, + "total_submitted": 137650, "frontend_question_id": 255, "is_new_question": false }, @@ -47257,8 +47579,8 @@ "question__title": "Factor Combinations", "question__title_slug": "factor-combinations", "question__hide": false, - "total_acs": 109469, - "total_submitted": 224707, + "total_acs": 110108, + "total_submitted": 225855, "frontend_question_id": 254, "is_new_question": false }, @@ -47280,8 +47602,8 @@ "question__title": "Meeting Rooms II", "question__title_slug": "meeting-rooms-ii", "question__hide": false, - "total_acs": 655165, - "total_submitted": 1312791, + "total_acs": 661093, + "total_submitted": 1323543, "frontend_question_id": 253, "is_new_question": false }, @@ -47303,8 +47625,8 @@ "question__title": "Meeting Rooms", "question__title_slug": "meeting-rooms", "question__hide": false, - "total_acs": 277416, - "total_submitted": 488421, + "total_acs": 280182, + "total_submitted": 493139, "frontend_question_id": 252, "is_new_question": false }, @@ -47326,8 +47648,8 @@ "question__title": "Flatten 2D Vector", "question__title_slug": "flatten-2d-vector", "question__hide": false, - "total_acs": 105835, - "total_submitted": 219829, + "total_acs": 106329, + "total_submitted": 220685, "frontend_question_id": 251, "is_new_question": false }, @@ -47349,8 +47671,8 @@ "question__title": "Count Univalue Subtrees", "question__title_slug": "count-univalue-subtrees", "question__hide": false, - "total_acs": 123328, - "total_submitted": 224610, + "total_acs": 124297, + "total_submitted": 226339, "frontend_question_id": 250, "is_new_question": false }, @@ -47372,8 +47694,8 @@ "question__title": "Group Shifted Strings", "question__title_slug": "group-shifted-strings", "question__hide": false, - "total_acs": 172777, - "total_submitted": 270707, + "total_acs": 173776, + "total_submitted": 272101, "frontend_question_id": 249, "is_new_question": false }, @@ -47395,8 +47717,8 @@ "question__title": "Strobogrammatic Number III", "question__title_slug": "strobogrammatic-number-iii", "question__hide": false, - "total_acs": 33974, - "total_submitted": 81906, + "total_acs": 34085, + "total_submitted": 82093, "frontend_question_id": 248, "is_new_question": false }, @@ -47418,8 +47740,8 @@ "question__title": "Strobogrammatic Number II", "question__title_slug": "strobogrammatic-number-ii", "question__hide": false, - "total_acs": 120789, - "total_submitted": 236168, + "total_acs": 121305, + "total_submitted": 237029, "frontend_question_id": 247, "is_new_question": false }, @@ -47441,8 +47763,8 @@ "question__title": "Strobogrammatic Number", "question__title_slug": "strobogrammatic-number", "question__hide": false, - "total_acs": 141952, - "total_submitted": 298346, + "total_acs": 142887, + "total_submitted": 300342, "frontend_question_id": 246, "is_new_question": false }, @@ -47464,8 +47786,8 @@ "question__title": "Shortest Word Distance III", "question__title_slug": "shortest-word-distance-iii", "question__hide": false, - "total_acs": 68936, - "total_submitted": 120325, + "total_acs": 69371, + "total_submitted": 120999, "frontend_question_id": 245, "is_new_question": false }, @@ -47487,8 +47809,8 @@ "question__title": "Shortest Word Distance II", "question__title_slug": "shortest-word-distance-ii", "question__hide": false, - "total_acs": 131675, - "total_submitted": 219523, + "total_acs": 133131, + "total_submitted": 221525, "frontend_question_id": 244, "is_new_question": false }, @@ -47510,8 +47832,8 @@ "question__title": "Shortest Word Distance", "question__title_slug": "shortest-word-distance", "question__hide": false, - "total_acs": 180753, - "total_submitted": 279943, + "total_acs": 182104, + "total_submitted": 281751, "frontend_question_id": 243, "is_new_question": false }, @@ -47533,8 +47855,8 @@ "question__title": "Valid Anagram", "question__title_slug": "valid-anagram", "question__hide": false, - "total_acs": 1344047, - "total_submitted": 2178875, + "total_acs": 1375534, + "total_submitted": 2227647, "frontend_question_id": 242, "is_new_question": false }, @@ -47556,8 +47878,8 @@ "question__title": "Different Ways to Add Parentheses", "question__title_slug": "different-ways-to-add-parentheses", "question__hide": false, - "total_acs": 166890, - "total_submitted": 268805, + "total_acs": 168313, + "total_submitted": 270634, "frontend_question_id": 241, "is_new_question": false }, @@ -47579,8 +47901,8 @@ "question__title": "Search a 2D Matrix II", "question__title_slug": "search-a-2d-matrix-ii", "question__hide": false, - "total_acs": 614089, - "total_submitted": 1259566, + "total_acs": 619629, + "total_submitted": 1268496, "frontend_question_id": 240, "is_new_question": false }, @@ -47602,8 +47924,8 @@ "question__title": "Sliding Window Maximum", "question__title_slug": "sliding-window-maximum", "question__hide": false, - "total_acs": 589480, - "total_submitted": 1272837, + "total_acs": 597287, + "total_submitted": 1288662, "frontend_question_id": 239, "is_new_question": false }, @@ -47625,8 +47947,8 @@ "question__title": "Product of Array Except Self", "question__title_slug": "product-of-array-except-self", "question__hide": false, - "total_acs": 1205574, - "total_submitted": 1878712, + "total_acs": 1224059, + "total_submitted": 1906108, "frontend_question_id": 238, "is_new_question": false }, @@ -47648,8 +47970,8 @@ "question__title": "Delete Node in a Linked List", "question__title_slug": "delete-node-in-a-linked-list", "question__hide": false, - "total_acs": 823516, - "total_submitted": 1136721, + "total_acs": 831820, + "total_submitted": 1145880, "frontend_question_id": 237, "is_new_question": false }, @@ -47671,8 +47993,8 @@ "question__title": "Lowest Common Ancestor of a Binary Tree", "question__title_slug": "lowest-common-ancestor-of-a-binary-tree", "question__hide": false, - "total_acs": 1024633, - "total_submitted": 1834492, + "total_acs": 1036776, + "total_submitted": 1851434, "frontend_question_id": 236, "is_new_question": false }, @@ -47694,8 +48016,8 @@ "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": 791325, - "total_submitted": 1374858, + "total_acs": 808746, + "total_submitted": 1400119, "frontend_question_id": 235, "is_new_question": false }, @@ -47717,8 +48039,8 @@ "question__title": "Palindrome Linked List", "question__title_slug": "palindrome-linked-list", "question__hide": false, - "total_acs": 1005366, - "total_submitted": 2134785, + "total_acs": 1021845, + "total_submitted": 2163114, "frontend_question_id": 234, "is_new_question": false }, @@ -47740,8 +48062,8 @@ "question__title": "Number of Digit One", "question__title_slug": "number-of-digit-one", "question__hide": false, - "total_acs": 65904, - "total_submitted": 195221, + "total_acs": 66297, + "total_submitted": 196072, "frontend_question_id": 233, "is_new_question": false }, @@ -47763,8 +48085,8 @@ "question__title": "Implement Queue using Stacks", "question__title_slug": "implement-queue-using-stacks", "question__hide": false, - "total_acs": 432432, - "total_submitted": 732606, + "total_acs": 440795, + "total_submitted": 743912, "frontend_question_id": 232, "is_new_question": false }, @@ -47786,8 +48108,8 @@ "question__title": "Power of Two", "question__title_slug": "power-of-two", "question__hide": false, - "total_acs": 648963, - "total_submitted": 1438533, + "total_acs": 657034, + "total_submitted": 1455179, "frontend_question_id": 231, "is_new_question": false }, @@ -47809,8 +48131,8 @@ "question__title": "Kth Smallest Element in a BST", "question__title_slug": "kth-smallest-element-in-a-bst", "question__hide": false, - "total_acs": 829146, - "total_submitted": 1218327, + "total_acs": 840765, + "total_submitted": 1233211, "frontend_question_id": 230, "is_new_question": false }, @@ -47832,8 +48154,8 @@ "question__title": "Majority Element II", "question__title_slug": "majority-element-ii", "question__hide": false, - "total_acs": 302362, - "total_submitted": 706372, + "total_acs": 306915, + "total_submitted": 715302, "frontend_question_id": 229, "is_new_question": false }, @@ -47855,8 +48177,8 @@ "question__title": "Summary Ranges", "question__title_slug": "summary-ranges", "question__hide": false, - "total_acs": 299087, - "total_submitted": 643706, + "total_acs": 300612, + "total_submitted": 646551, "frontend_question_id": 228, "is_new_question": false }, @@ -47878,8 +48200,8 @@ "question__title": "Basic Calculator II", "question__title_slug": "basic-calculator-ii", "question__hide": false, - "total_acs": 438866, - "total_submitted": 1051267, + "total_acs": 442403, + "total_submitted": 1058730, "frontend_question_id": 227, "is_new_question": false }, @@ -47901,8 +48223,8 @@ "question__title": "Invert Binary Tree", "question__title_slug": "invert-binary-tree", "question__hide": false, - "total_acs": 1076974, - "total_submitted": 1495782, + "total_acs": 1097043, + "total_submitted": 1521089, "frontend_question_id": 226, "is_new_question": false }, @@ -47924,8 +48246,8 @@ "question__title": "Implement Stack using Queues", "question__title_slug": "implement-stack-using-queues", "question__hide": false, - "total_acs": 349842, - "total_submitted": 627144, + "total_acs": 353977, + "total_submitted": 632605, "frontend_question_id": 225, "is_new_question": false }, @@ -47947,8 +48269,8 @@ "question__title": "Basic Calculator", "question__title_slug": "basic-calculator", "question__hide": false, - "total_acs": 300181, - "total_submitted": 738165, + "total_acs": 302690, + "total_submitted": 743400, "frontend_question_id": 224, "is_new_question": false }, @@ -47970,8 +48292,8 @@ "question__title": "Rectangle Area", "question__title_slug": "rectangle-area", "question__hide": false, - "total_acs": 137956, - "total_submitted": 342289, + "total_acs": 138490, + "total_submitted": 343196, "frontend_question_id": 223, "is_new_question": false }, @@ -47993,8 +48315,8 @@ "question__title": "Count Complete Tree Nodes", "question__title_slug": "count-complete-tree-nodes", "question__hide": false, - "total_acs": 414376, - "total_submitted": 742381, + "total_acs": 418426, + "total_submitted": 747288, "frontend_question_id": 222, "is_new_question": false }, @@ -48016,8 +48338,8 @@ "question__title": "Maximal Square", "question__title_slug": "maximal-square", "question__hide": false, - "total_acs": 501990, - "total_submitted": 1148811, + "total_acs": 505968, + "total_submitted": 1156039, "frontend_question_id": 221, "is_new_question": false }, @@ -48039,8 +48361,8 @@ "question__title": "Contains Duplicate III", "question__title_slug": "contains-duplicate-iii", "question__hide": false, - "total_acs": 205401, - "total_submitted": 945227, + "total_acs": 206488, + "total_submitted": 950519, "frontend_question_id": 220, "is_new_question": false }, @@ -48062,8 +48384,8 @@ "question__title": "Contains Duplicate II", "question__title_slug": "contains-duplicate-ii", "question__hide": false, - "total_acs": 476403, - "total_submitted": 1169203, + "total_acs": 481906, + "total_submitted": 1182052, "frontend_question_id": 219, "is_new_question": false }, @@ -48085,8 +48407,8 @@ "question__title": "The Skyline Problem", "question__title_slug": "the-skyline-problem", "question__hide": false, - "total_acs": 210209, - "total_submitted": 540122, + "total_acs": 211316, + "total_submitted": 542185, "frontend_question_id": 218, "is_new_question": false }, @@ -48108,8 +48430,8 @@ "question__title": "Contains Duplicate", "question__title_slug": "contains-duplicate", "question__hide": false, - "total_acs": 1695596, - "total_submitted": 2780215, + "total_acs": 1742379, + "total_submitted": 2855379, "frontend_question_id": 217, "is_new_question": false }, @@ -48131,8 +48453,8 @@ "question__title": "Combination Sum III", "question__title_slug": "combination-sum-iii", "question__hide": false, - "total_acs": 337603, - "total_submitted": 509665, + "total_acs": 340268, + "total_submitted": 513095, "frontend_question_id": 216, "is_new_question": false }, @@ -48154,8 +48476,8 @@ "question__title": "Kth Largest Element in an Array", "question__title_slug": "kth-largest-element-in-an-array", "question__hide": false, - "total_acs": 1353832, - "total_submitted": 2117769, + "total_acs": 1430859, + "total_submitted": 2208661, "frontend_question_id": 215, "is_new_question": false }, @@ -48177,8 +48499,8 @@ "question__title": "Shortest Palindrome", "question__title_slug": "shortest-palindrome", "question__hide": false, - "total_acs": 138689, - "total_submitted": 435046, + "total_acs": 139394, + "total_submitted": 437147, "frontend_question_id": 214, "is_new_question": false }, @@ -48200,8 +48522,8 @@ "question__title": "House Robber II", "question__title_slug": "house-robber-ii", "question__hide": false, - "total_acs": 415675, - "total_submitted": 1036982, + "total_acs": 423664, + "total_submitted": 1054864, "frontend_question_id": 213, "is_new_question": false }, @@ -48223,8 +48545,8 @@ "question__title": "Word Search II", "question__title_slug": "word-search-ii", "question__hide": false, - "total_acs": 447341, - "total_submitted": 1187216, + "total_acs": 451252, + "total_submitted": 1200510, "frontend_question_id": 212, "is_new_question": false }, @@ -48246,8 +48568,8 @@ "question__title": "Design Add and Search Words Data Structure", "question__title_slug": "design-add-and-search-words-data-structure", "question__hide": false, - "total_acs": 410302, - "total_submitted": 935496, + "total_acs": 414421, + "total_submitted": 945860, "frontend_question_id": 211, "is_new_question": false }, @@ -48269,8 +48591,8 @@ "question__title": "Course Schedule II", "question__title_slug": "course-schedule-ii", "question__hide": false, - "total_acs": 643031, - "total_submitted": 1370805, + "total_acs": 651825, + "total_submitted": 1386168, "frontend_question_id": 210, "is_new_question": false }, @@ -48292,8 +48614,8 @@ "question__title": "Minimum Size Subarray Sum", "question__title_slug": "minimum-size-subarray-sum", "question__hide": false, - "total_acs": 544337, - "total_submitted": 1245037, + "total_acs": 551839, + "total_submitted": 1259383, "frontend_question_id": 209, "is_new_question": false }, @@ -48315,8 +48637,8 @@ "question__title": "Implement Trie (Prefix Tree)", "question__title_slug": "implement-trie-prefix-tree", "question__hide": false, - "total_acs": 601669, - "total_submitted": 1022757, + "total_acs": 610872, + "total_submitted": 1034376, "frontend_question_id": 208, "is_new_question": false }, @@ -48338,8 +48660,8 @@ "question__title": "Course Schedule", "question__title_slug": "course-schedule", "question__hide": false, - "total_acs": 898365, - "total_submitted": 1990578, + "total_acs": 912671, + "total_submitted": 2021296, "frontend_question_id": 207, "is_new_question": false }, @@ -48361,8 +48683,8 @@ "question__title": "Reverse Linked List", "question__title_slug": "reverse-linked-list", "question__hide": false, - "total_acs": 2201749, - "total_submitted": 3111509, + "total_acs": 2243331, + "total_submitted": 3161869, "frontend_question_id": 206, "is_new_question": false }, @@ -48384,8 +48706,8 @@ "question__title": "Isomorphic Strings", "question__title_slug": "isomorphic-strings", "question__hide": false, - "total_acs": 508104, - "total_submitted": 1204660, + "total_acs": 527661, + "total_submitted": 1249195, "frontend_question_id": 205, "is_new_question": false }, @@ -48407,8 +48729,8 @@ "question__title": "Count Primes", "question__title_slug": "count-primes", "question__hide": false, - "total_acs": 618646, - "total_submitted": 1873654, + "total_acs": 622398, + "total_submitted": 1884949, "frontend_question_id": 204, "is_new_question": false }, @@ -48430,8 +48752,8 @@ "question__title": "Remove Linked List Elements", "question__title_slug": "remove-linked-list-elements", "question__hide": false, - "total_acs": 726295, - "total_submitted": 1657441, + "total_acs": 735072, + "total_submitted": 1673797, "frontend_question_id": 203, "is_new_question": false }, @@ -48453,8 +48775,8 @@ "question__title": "Happy Number", "question__title_slug": "happy-number", "question__hide": false, - "total_acs": 841398, - "total_submitted": 1572726, + "total_acs": 853173, + "total_submitted": 1592082, "frontend_question_id": 202, "is_new_question": false }, @@ -48476,8 +48798,8 @@ "question__title": "Bitwise AND of Numbers Range", "question__title_slug": "bitwise-and-of-numbers-range", "question__hide": false, - "total_acs": 218027, - "total_submitted": 520205, + "total_acs": 219041, + "total_submitted": 522107, "frontend_question_id": 201, "is_new_question": false }, @@ -48499,8 +48821,8 @@ "question__title": "Number of Islands", "question__title_slug": "number-of-islands", "question__hide": false, - "total_acs": 1619312, - "total_submitted": 2978311, + "total_acs": 1641668, + "total_submitted": 3011455, "frontend_question_id": 200, "is_new_question": false }, @@ -48522,8 +48844,8 @@ "question__title": "Binary Tree Right Side View", "question__title_slug": "binary-tree-right-side-view", "question__hide": false, - "total_acs": 695202, - "total_submitted": 1161168, + "total_acs": 704386, + "total_submitted": 1175056, "frontend_question_id": 199, "is_new_question": false }, @@ -48545,8 +48867,8 @@ "question__title": "House Robber", "question__title_slug": "house-robber", "question__hide": false, - "total_acs": 1176593, - "total_submitted": 2473214, + "total_acs": 1194176, + "total_submitted": 2504469, "frontend_question_id": 198, "is_new_question": false }, @@ -48568,8 +48890,8 @@ "question__title": "Rising Temperature", "question__title_slug": "rising-temperature", "question__hide": false, - "total_acs": 233573, - "total_submitted": 542835, + "total_acs": 237233, + "total_submitted": 549563, "frontend_question_id": 197, "is_new_question": false }, @@ -48591,8 +48913,8 @@ "question__title": "Delete Duplicate Emails", "question__title_slug": "delete-duplicate-emails", "question__hide": false, - "total_acs": 239199, - "total_submitted": 441372, + "total_acs": 244621, + "total_submitted": 447714, "frontend_question_id": 196, "is_new_question": false }, @@ -48614,8 +48936,8 @@ "question__title": "Tenth Line", "question__title_slug": "tenth-line", "question__hide": false, - "total_acs": 74512, - "total_submitted": 226851, + "total_acs": 74957, + "total_submitted": 228283, "frontend_question_id": 195, "is_new_question": false }, @@ -48637,8 +48959,8 @@ "question__title": "Transpose File", "question__title_slug": "transpose-file", "question__hide": false, - "total_acs": 18608, - "total_submitted": 74212, + "total_acs": 18708, + "total_submitted": 74592, "frontend_question_id": 194, "is_new_question": false }, @@ -48660,8 +48982,8 @@ "question__title": "Valid Phone Numbers", "question__title_slug": "valid-phone-numbers", "question__hide": false, - "total_acs": 56904, - "total_submitted": 220329, + "total_acs": 57294, + "total_submitted": 222009, "frontend_question_id": 193, "is_new_question": false }, @@ -48683,8 +49005,8 @@ "question__title": "Word Frequency", "question__title_slug": "word-frequency", "question__hide": false, - "total_acs": 37777, - "total_submitted": 147467, + "total_acs": 37966, + "total_submitted": 148135, "frontend_question_id": 192, "is_new_question": false }, @@ -48706,8 +49028,8 @@ "question__title": "Number of 1 Bits", "question__title_slug": "number-of-1-bits", "question__hide": false, - "total_acs": 799392, - "total_submitted": 1280201, + "total_acs": 811692, + "total_submitted": 1295615, "frontend_question_id": 191, "is_new_question": false }, @@ -48729,8 +49051,8 @@ "question__title": "Reverse Bits", "question__title_slug": "reverse-bits", "question__hide": false, - "total_acs": 487301, - "total_submitted": 979633, + "total_acs": 493311, + "total_submitted": 987042, "frontend_question_id": 190, "is_new_question": false }, @@ -48752,8 +49074,8 @@ "question__title": "Rotate Array", "question__title_slug": "rotate-array", "question__hide": false, - "total_acs": 1147525, - "total_submitted": 2963119, + "total_acs": 1162208, + "total_submitted": 2997597, "frontend_question_id": 189, "is_new_question": false }, @@ -48775,8 +49097,8 @@ "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": 252707, - "total_submitted": 740045, + "total_acs": 255580, + "total_submitted": 745212, "frontend_question_id": 188, "is_new_question": false }, @@ -48798,8 +49120,8 @@ "question__title": "Repeated DNA Sequences", "question__title_slug": "repeated-dna-sequences", "question__hide": false, - "total_acs": 272967, - "total_submitted": 605063, + "total_acs": 275291, + "total_submitted": 608766, "frontend_question_id": 187, "is_new_question": false }, @@ -48821,8 +49143,8 @@ "question__title": "Reverse Words in a String II", "question__title_slug": "reverse-words-in-a-string-ii", "question__hide": false, - "total_acs": 135779, - "total_submitted": 264168, + "total_acs": 136415, + "total_submitted": 264939, "frontend_question_id": 186, "is_new_question": false }, @@ -48844,8 +49166,8 @@ "question__title": "Department Top Three Salaries", "question__title_slug": "department-top-three-salaries", "question__hide": false, - "total_acs": 172793, - "total_submitted": 360628, + "total_acs": 174576, + "total_submitted": 362863, "frontend_question_id": 185, "is_new_question": false }, @@ -48867,8 +49189,8 @@ "question__title": "Department Highest Salary", "question__title_slug": "department-highest-salary", "question__hide": false, - "total_acs": 229770, - "total_submitted": 482490, + "total_acs": 232425, + "total_submitted": 486253, "frontend_question_id": 184, "is_new_question": false }, @@ -48890,8 +49212,8 @@ "question__title": "Customers Who Never Order", "question__title_slug": "customers-who-never-order", "question__hide": false, - "total_acs": 380748, - "total_submitted": 589029, + "total_acs": 389949, + "total_submitted": 600230, "frontend_question_id": 183, "is_new_question": false }, @@ -48913,8 +49235,8 @@ "question__title": "Duplicate Emails", "question__title_slug": "duplicate-emails", "question__hide": false, - "total_acs": 366302, - "total_submitted": 528143, + "total_acs": 370967, + "total_submitted": 533994, "frontend_question_id": 182, "is_new_question": false }, @@ -48936,8 +49258,8 @@ "question__title": "Employees Earning More Than Their Managers", "question__title_slug": "employees-earning-more-than-their-managers", "question__hide": false, - "total_acs": 370296, - "total_submitted": 553743, + "total_acs": 374574, + "total_submitted": 558955, "frontend_question_id": 181, "is_new_question": false }, @@ -48959,8 +49281,8 @@ "question__title": "Consecutive Numbers", "question__title_slug": "consecutive-numbers", "question__hide": false, - "total_acs": 194864, - "total_submitted": 424784, + "total_acs": 197086, + "total_submitted": 428837, "frontend_question_id": 180, "is_new_question": false }, @@ -48982,8 +49304,8 @@ "question__title": "Largest Number", "question__title_slug": "largest-number", "question__hide": false, - "total_acs": 324626, - "total_submitted": 978807, + "total_acs": 327233, + "total_submitted": 984736, "frontend_question_id": 179, "is_new_question": false }, @@ -49005,8 +49327,8 @@ "question__title": "Rank Scores", "question__title_slug": "rank-scores", "question__hide": false, - "total_acs": 232179, - "total_submitted": 400232, + "total_acs": 234646, + "total_submitted": 403420, "frontend_question_id": 178, "is_new_question": false }, @@ -49028,8 +49350,8 @@ "question__title": "Nth Highest Salary", "question__title_slug": "nth-highest-salary", "question__hide": false, - "total_acs": 244392, - "total_submitted": 671907, + "total_acs": 246809, + "total_submitted": 676913, "frontend_question_id": 177, "is_new_question": false }, @@ -49051,8 +49373,8 @@ "question__title": "Second Highest Salary", "question__title_slug": "second-highest-salary", "question__hide": false, - "total_acs": 490889, - "total_submitted": 1380089, + "total_acs": 496731, + "total_submitted": 1393545, "frontend_question_id": 176, "is_new_question": false }, @@ -49074,8 +49396,8 @@ "question__title": "Combine Two Tables", "question__title_slug": "combine-two-tables", "question__hide": false, - "total_acs": 554902, - "total_submitted": 783193, + "total_acs": 562049, + "total_submitted": 791271, "frontend_question_id": 175, "is_new_question": false }, @@ -49097,8 +49419,8 @@ "question__title": "Dungeon Game", "question__title_slug": "dungeon-game", "question__hide": false, - "total_acs": 175194, - "total_submitted": 477317, + "total_acs": 176346, + "total_submitted": 479636, "frontend_question_id": 174, "is_new_question": false }, @@ -49120,8 +49442,8 @@ "question__title": "Binary Search Tree Iterator", "question__title_slug": "binary-search-tree-iterator", "question__hide": false, - "total_acs": 585368, - "total_submitted": 864801, + "total_acs": 589570, + "total_submitted": 869440, "frontend_question_id": 173, "is_new_question": false }, @@ -49143,8 +49465,8 @@ "question__title": "Factorial Trailing Zeroes", "question__title_slug": "factorial-trailing-zeroes", "question__hide": false, - "total_acs": 321260, - "total_submitted": 783752, + "total_acs": 322971, + "total_submitted": 786614, "frontend_question_id": 172, "is_new_question": false }, @@ -49166,8 +49488,8 @@ "question__title": "Excel Sheet Column Number", "question__title_slug": "excel-sheet-column-number", "question__hide": false, - "total_acs": 511015, - "total_submitted": 840211, + "total_acs": 514159, + "total_submitted": 844621, "frontend_question_id": 171, "is_new_question": false }, @@ -49189,8 +49511,8 @@ "question__title": "Two Sum III - Data structure design", "question__title_slug": "two-sum-iii-data-structure-design", "question__hide": false, - "total_acs": 127100, - "total_submitted": 344345, + "total_acs": 127696, + "total_submitted": 345691, "frontend_question_id": 170, "is_new_question": false }, @@ -49212,8 +49534,8 @@ "question__title": "Majority Element", "question__title_slug": "majority-element", "question__hide": false, - "total_acs": 1275916, - "total_submitted": 2019017, + "total_acs": 1293313, + "total_submitted": 2044202, "frontend_question_id": 169, "is_new_question": false }, @@ -49235,8 +49557,8 @@ "question__title": "Excel Sheet Column Title", "question__title_slug": "excel-sheet-column-title", "question__hide": false, - "total_acs": 320298, - "total_submitted": 938107, + "total_acs": 322561, + "total_submitted": 942891, "frontend_question_id": 168, "is_new_question": false }, @@ -49258,8 +49580,8 @@ "question__title": "Two Sum II - Input Array Is Sorted", "question__title_slug": "two-sum-ii-input-array-is-sorted", "question__hide": false, - "total_acs": 1075143, - "total_submitted": 1803580, + "total_acs": 1092924, + "total_submitted": 1831489, "frontend_question_id": 167, "is_new_question": false }, @@ -49281,8 +49603,8 @@ "question__title": "Fraction to Recurring Decimal", "question__title_slug": "fraction-to-recurring-decimal", "question__hide": false, - "total_acs": 185991, - "total_submitted": 784260, + "total_acs": 186965, + "total_submitted": 787229, "frontend_question_id": 166, "is_new_question": false }, @@ -49304,8 +49626,8 @@ "question__title": "Compare Version Numbers", "question__title_slug": "compare-version-numbers", "question__hide": false, - "total_acs": 320492, - "total_submitted": 921931, + "total_acs": 321958, + "total_submitted": 924714, "frontend_question_id": 165, "is_new_question": false }, @@ -49327,8 +49649,8 @@ "question__title": "Maximum Gap", "question__title_slug": "maximum-gap", "question__hide": false, - "total_acs": 142308, - "total_submitted": 341294, + "total_acs": 143248, + "total_submitted": 342977, "frontend_question_id": 164, "is_new_question": false }, @@ -49350,8 +49672,8 @@ "question__title": "Missing Ranges", "question__title_slug": "missing-ranges", "question__hide": false, - "total_acs": 173088, - "total_submitted": 550473, + "total_acs": 174146, + "total_submitted": 553179, "frontend_question_id": 163, "is_new_question": false }, @@ -49373,8 +49695,8 @@ "question__title": "Find Peak Element", "question__title_slug": "find-peak-element", "question__hide": false, - "total_acs": 811545, - "total_submitted": 1763178, + "total_acs": 820889, + "total_submitted": 1782907, "frontend_question_id": 162, "is_new_question": false }, @@ -49396,8 +49718,8 @@ "question__title": "One Edit Distance", "question__title_slug": "one-edit-distance", "question__hide": false, - "total_acs": 175782, - "total_submitted": 517106, + "total_acs": 176456, + "total_submitted": 518919, "frontend_question_id": 161, "is_new_question": false }, @@ -49419,8 +49741,8 @@ "question__title": "Intersection of Two Linked Lists", "question__title_slug": "intersection-of-two-linked-lists", "question__hide": false, - "total_acs": 1018516, - "total_submitted": 1974087, + "total_acs": 1029732, + "total_submitted": 1990063, "frontend_question_id": 160, "is_new_question": false }, @@ -49442,8 +49764,8 @@ "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": 196656, - "total_submitted": 372019, + "total_acs": 197966, + "total_submitted": 374177, "frontend_question_id": 159, "is_new_question": false }, @@ -49465,8 +49787,8 @@ "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": 167722, - "total_submitted": 408542, + "total_acs": 168240, + "total_submitted": 409322, "frontend_question_id": 158, "is_new_question": false }, @@ -49488,8 +49810,8 @@ "question__title": "Read N Characters Given Read4", "question__title_slug": "read-n-characters-given-read4", "question__hide": false, - "total_acs": 171261, - "total_submitted": 423219, + "total_acs": 171700, + "total_submitted": 424026, "frontend_question_id": 157, "is_new_question": false }, @@ -49511,8 +49833,8 @@ "question__title": "Binary Tree Upside Down", "question__title_slug": "binary-tree-upside-down", "question__hide": false, - "total_acs": 89585, - "total_submitted": 147196, + "total_acs": 90337, + "total_submitted": 148120, "frontend_question_id": 156, "is_new_question": false }, @@ -49534,14 +49856,14 @@ "question__title": "Min Stack", "question__title_slug": "min-stack", "question__hide": false, - "total_acs": 1013128, - "total_submitted": 2000573, + "total_acs": 1026521, + "total_submitted": 2022138, "frontend_question_id": 155, "is_new_question": false }, "status": null, "difficulty": { - "level": 1 + "level": 2 }, "paid_only": false, "is_favor": false, @@ -49557,8 +49879,8 @@ "question__title": "Find Minimum in Rotated Sorted Array II", "question__title_slug": "find-minimum-in-rotated-sorted-array-ii", "question__hide": false, - "total_acs": 333642, - "total_submitted": 770569, + "total_acs": 335892, + "total_submitted": 775700, "frontend_question_id": 154, "is_new_question": false }, @@ -49580,8 +49902,8 @@ "question__title": "Find Minimum in Rotated Sorted Array", "question__title_slug": "find-minimum-in-rotated-sorted-array", "question__hide": false, - "total_acs": 966647, - "total_submitted": 2010518, + "total_acs": 981736, + "total_submitted": 2040412, "frontend_question_id": 153, "is_new_question": false }, @@ -49603,8 +49925,8 @@ "question__title": "Maximum Product Subarray", "question__title_slug": "maximum-product-subarray", "question__hide": false, - "total_acs": 769496, - "total_submitted": 2221457, + "total_acs": 780632, + "total_submitted": 2252261, "frontend_question_id": 152, "is_new_question": false }, @@ -49626,8 +49948,8 @@ "question__title": "Reverse Words in a String", "question__title_slug": "reverse-words-in-a-string", "question__hide": false, - "total_acs": 719140, - "total_submitted": 2483498, + "total_acs": 724936, + "total_submitted": 2493492, "frontend_question_id": 151, "is_new_question": false }, @@ -49649,8 +49971,8 @@ "question__title": "Evaluate Reverse Polish Notation", "question__title_slug": "evaluate-reverse-polish-notation", "question__hide": false, - "total_acs": 436250, - "total_submitted": 1011600, + "total_acs": 444762, + "total_submitted": 1027991, "frontend_question_id": 150, "is_new_question": false }, @@ -49672,8 +49994,8 @@ "question__title": "Max Points on a Line", "question__title_slug": "max-points-on-a-line", "question__hide": false, - "total_acs": 236422, - "total_submitted": 1134921, + "total_acs": 238266, + "total_submitted": 1138943, "frontend_question_id": 149, "is_new_question": false }, @@ -49695,8 +50017,8 @@ "question__title": "Sort List", "question__title_slug": "sort-list", "question__hide": false, - "total_acs": 504135, - "total_submitted": 959643, + "total_acs": 509228, + "total_submitted": 966876, "frontend_question_id": 148, "is_new_question": false }, @@ -49718,8 +50040,8 @@ "question__title": "Insertion Sort List", "question__title_slug": "insertion-sort-list", "question__hide": false, - "total_acs": 288277, - "total_submitted": 586194, + "total_acs": 289414, + "total_submitted": 587610, "frontend_question_id": 147, "is_new_question": false }, @@ -49741,8 +50063,8 @@ "question__title": "LRU Cache", "question__title_slug": "lru-cache", "question__hide": false, - "total_acs": 1094033, - "total_submitted": 2725833, + "total_acs": 1103666, + "total_submitted": 2746182, "frontend_question_id": 146, "is_new_question": false }, @@ -49764,8 +50086,8 @@ "question__title": "Binary Tree Postorder Traversal", "question__title_slug": "binary-tree-postorder-traversal", "question__hide": false, - "total_acs": 743476, - "total_submitted": 1148767, + "total_acs": 753409, + "total_submitted": 1160917, "frontend_question_id": 145, "is_new_question": false }, @@ -49787,8 +50109,8 @@ "question__title": "Binary Tree Preorder Traversal", "question__title_slug": "binary-tree-preorder-traversal", "question__hide": false, - "total_acs": 976705, - "total_submitted": 1549578, + "total_acs": 989952, + "total_submitted": 1566483, "frontend_question_id": 144, "is_new_question": false }, @@ -49810,8 +50132,8 @@ "question__title": "Reorder List", "question__title_slug": "reorder-list", "question__hide": false, - "total_acs": 502724, - "total_submitted": 1032121, + "total_acs": 510798, + "total_submitted": 1043540, "frontend_question_id": 143, "is_new_question": false }, @@ -49833,8 +50155,8 @@ "question__title": "Linked List Cycle II", "question__title_slug": "linked-list-cycle-ii", "question__hide": false, - "total_acs": 694361, - "total_submitted": 1556511, + "total_acs": 710093, + "total_submitted": 1584278, "frontend_question_id": 142, "is_new_question": false }, @@ -49856,8 +50178,8 @@ "question__title": "Linked List Cycle", "question__title_slug": "linked-list-cycle", "question__hide": false, - "total_acs": 1505710, - "total_submitted": 3263468, + "total_acs": 1530573, + "total_submitted": 3311791, "frontend_question_id": 141, "is_new_question": false }, @@ -49879,8 +50201,8 @@ "question__title": "Word Break II", "question__title_slug": "word-break-ii", "question__hide": false, - "total_acs": 449460, - "total_submitted": 1053886, + "total_acs": 452581, + "total_submitted": 1057645, "frontend_question_id": 140, "is_new_question": false }, @@ -49902,8 +50224,8 @@ "question__title": "Word Break", "question__title_slug": "word-break", "question__hide": false, - "total_acs": 1103888, - "total_submitted": 2465695, + "total_acs": 1115370, + "total_submitted": 2487989, "frontend_question_id": 139, "is_new_question": false }, @@ -49925,8 +50247,8 @@ "question__title": "Copy List with Random Pointer", "question__title_slug": "copy-list-with-random-pointer", "question__hide": false, - "total_acs": 806830, - "total_submitted": 1655347, + "total_acs": 814102, + "total_submitted": 1664743, "frontend_question_id": 138, "is_new_question": false }, @@ -49948,8 +50270,8 @@ "question__title": "Single Number II", "question__title_slug": "single-number-ii", "question__hide": false, - "total_acs": 352871, - "total_submitted": 620343, + "total_acs": 354933, + "total_submitted": 623209, "frontend_question_id": 137, "is_new_question": false }, @@ -49971,8 +50293,8 @@ "question__title": "Single Number", "question__title_slug": "single-number", "question__hide": false, - "total_acs": 1690345, - "total_submitted": 2430199, + "total_acs": 1709032, + "total_submitted": 2454689, "frontend_question_id": 136, "is_new_question": false }, @@ -49994,8 +50316,8 @@ "question__title": "Candy", "question__title_slug": "candy", "question__hide": false, - "total_acs": 218033, - "total_submitted": 584032, + "total_acs": 219564, + "total_submitted": 586932, "frontend_question_id": 135, "is_new_question": false }, @@ -50017,8 +50339,8 @@ "question__title": "Gas Station", "question__title_slug": "gas-station", "question__hide": false, - "total_acs": 418914, - "total_submitted": 940330, + "total_acs": 423663, + "total_submitted": 949819, "frontend_question_id": 134, "is_new_question": false }, @@ -50040,8 +50362,8 @@ "question__title": "Clone Graph", "question__title_slug": "clone-graph", "question__hide": false, - "total_acs": 745860, - "total_submitted": 1539142, + "total_acs": 756469, + "total_submitted": 1553576, "frontend_question_id": 133, "is_new_question": false }, @@ -50063,8 +50385,8 @@ "question__title": "Palindrome Partitioning II", "question__title_slug": "palindrome-partitioning-ii", "question__hide": false, - "total_acs": 207755, - "total_submitted": 624155, + "total_acs": 209613, + "total_submitted": 629206, "frontend_question_id": 132, "is_new_question": false }, @@ -50086,8 +50408,8 @@ "question__title": "Palindrome Partitioning", "question__title_slug": "palindrome-partitioning", "question__hide": false, - "total_acs": 468147, - "total_submitted": 777273, + "total_acs": 474385, + "total_submitted": 784844, "frontend_question_id": 131, "is_new_question": false }, @@ -50109,8 +50431,8 @@ "question__title": "Surrounded Regions", "question__title_slug": "surrounded-regions", "question__hide": false, - "total_acs": 425282, - "total_submitted": 1234008, + "total_acs": 429971, + "total_submitted": 1242909, "frontend_question_id": 130, "is_new_question": false }, @@ -50132,8 +50454,8 @@ "question__title": "Sum Root to Leaf Numbers", "question__title_slug": "sum-root-to-leaf-numbers", "question__hide": false, - "total_acs": 469759, - "total_submitted": 818528, + "total_acs": 473461, + "total_submitted": 823233, "frontend_question_id": 129, "is_new_question": false }, @@ -50155,8 +50477,8 @@ "question__title": "Longest Consecutive Sequence", "question__title_slug": "longest-consecutive-sequence", "question__hide": false, - "total_acs": 710863, - "total_submitted": 1457491, + "total_acs": 725841, + "total_submitted": 1488251, "frontend_question_id": 128, "is_new_question": false }, @@ -50178,8 +50500,8 @@ "question__title": "Word Ladder", "question__title_slug": "word-ladder", "question__hide": false, - "total_acs": 782639, - "total_submitted": 2190950, + "total_acs": 788763, + "total_submitted": 2203758, "frontend_question_id": 127, "is_new_question": false }, @@ -50201,8 +50523,8 @@ "question__title": "Word Ladder II", "question__title_slug": "word-ladder-ii", "question__hide": false, - "total_acs": 293849, - "total_submitted": 1079118, + "total_acs": 294515, + "total_submitted": 1083859, "frontend_question_id": 126, "is_new_question": false }, @@ -50224,8 +50546,8 @@ "question__title": "Valid Palindrome", "question__title_slug": "valid-palindrome", "question__hide": false, - "total_acs": 1333322, - "total_submitted": 3162096, + "total_acs": 1356939, + "total_submitted": 3207791, "frontend_question_id": 125, "is_new_question": false }, @@ -50247,8 +50569,8 @@ "question__title": "Binary Tree Maximum Path Sum", "question__title_slug": "binary-tree-maximum-path-sum", "question__hide": false, - "total_acs": 755377, - "total_submitted": 1995767, + "total_acs": 764763, + "total_submitted": 2018210, "frontend_question_id": 124, "is_new_question": false }, @@ -50270,8 +50592,8 @@ "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": 391119, - "total_submitted": 898672, + "total_acs": 394886, + "total_submitted": 905067, "frontend_question_id": 123, "is_new_question": false }, @@ -50293,8 +50615,8 @@ "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": 1174517, - "total_submitted": 1884109, + "total_acs": 1186143, + "total_submitted": 1900243, "frontend_question_id": 122, "is_new_question": false }, @@ -50316,8 +50638,8 @@ "question__title": "Best Time to Buy and Sell Stock", "question__title_slug": "best-time-to-buy-and-sell-stock", "question__hide": false, - "total_acs": 2273802, - "total_submitted": 4194611, + "total_acs": 2320287, + "total_submitted": 4274808, "frontend_question_id": 121, "is_new_question": false }, @@ -50339,8 +50661,8 @@ "question__title": "Triangle", "question__title_slug": "triangle", "question__hide": false, - "total_acs": 483541, - "total_submitted": 917154, + "total_acs": 488897, + "total_submitted": 924983, "frontend_question_id": 120, "is_new_question": false }, @@ -50362,8 +50684,8 @@ "question__title": "Pascal's Triangle II", "question__title_slug": "pascals-triangle-ii", "question__hide": false, - "total_acs": 537791, - "total_submitted": 926247, + "total_acs": 543674, + "total_submitted": 934288, "frontend_question_id": 119, "is_new_question": false }, @@ -50385,8 +50707,8 @@ "question__title": "Pascal's Triangle", "question__title_slug": "pascals-triangle", "question__hide": false, - "total_acs": 832377, - "total_submitted": 1269824, + "total_acs": 845818, + "total_submitted": 1285265, "frontend_question_id": 118, "is_new_question": false }, @@ -50408,8 +50730,8 @@ "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": 484642, - "total_submitted": 996043, + "total_acs": 488058, + "total_submitted": 1001081, "frontend_question_id": 117, "is_new_question": false }, @@ -50431,8 +50753,8 @@ "question__title": "Populating Next Right Pointers in Each Node", "question__title_slug": "populating-next-right-pointers-in-each-node", "question__hide": false, - "total_acs": 770264, - "total_submitted": 1333984, + "total_acs": 778852, + "total_submitted": 1344625, "frontend_question_id": 116, "is_new_question": false }, @@ -50454,8 +50776,8 @@ "question__title": "Distinct Subsequences", "question__title_slug": "distinct-subsequences", "question__hide": false, - "total_acs": 226200, - "total_submitted": 530968, + "total_acs": 229343, + "total_submitted": 537060, "frontend_question_id": 115, "is_new_question": false }, @@ -50477,8 +50799,8 @@ "question__title": "Flatten Binary Tree to Linked List", "question__title_slug": "flatten-binary-tree-to-linked-list", "question__hide": false, - "total_acs": 616134, - "total_submitted": 1056822, + "total_acs": 622217, + "total_submitted": 1064333, "frontend_question_id": 114, "is_new_question": false }, @@ -50500,8 +50822,8 @@ "question__title": "Path Sum II", "question__title_slug": "path-sum-ii", "question__hide": false, - "total_acs": 591030, - "total_submitted": 1086488, + "total_acs": 596569, + "total_submitted": 1094244, "frontend_question_id": 113, "is_new_question": false }, @@ -50523,8 +50845,8 @@ "question__title": "Path Sum", "question__title_slug": "path-sum", "question__hide": false, - "total_acs": 902492, - "total_submitted": 1967827, + "total_acs": 912646, + "total_submitted": 1986137, "frontend_question_id": 112, "is_new_question": false }, @@ -50546,8 +50868,8 @@ "question__title": "Minimum Depth of Binary Tree", "question__title_slug": "minimum-depth-of-binary-tree", "question__hide": false, - "total_acs": 772465, - "total_submitted": 1806144, + "total_acs": 780210, + "total_submitted": 1820941, "frontend_question_id": 111, "is_new_question": false }, @@ -50569,8 +50891,8 @@ "question__title": "Balanced Binary Tree", "question__title_slug": "balanced-binary-tree", "question__hide": false, - "total_acs": 798904, - "total_submitted": 1695743, + "total_acs": 813886, + "total_submitted": 1723366, "frontend_question_id": 110, "is_new_question": false }, @@ -50592,8 +50914,8 @@ "question__title": "Convert Sorted List to Binary Search Tree", "question__title_slug": "convert-sorted-list-to-binary-search-tree", "question__hide": false, - "total_acs": 379056, - "total_submitted": 677132, + "total_acs": 381355, + "total_submitted": 679780, "frontend_question_id": 109, "is_new_question": false }, @@ -50615,8 +50937,8 @@ "question__title": "Convert Sorted Array to Binary Search Tree", "question__title_slug": "convert-sorted-array-to-binary-search-tree", "question__hide": false, - "total_acs": 755546, - "total_submitted": 1136040, + "total_acs": 763812, + "total_submitted": 1145859, "frontend_question_id": 108, "is_new_question": false }, @@ -50638,8 +50960,8 @@ "question__title": "Binary Tree Level Order Traversal II", "question__title_slug": "binary-tree-level-order-traversal-ii", "question__hide": false, - "total_acs": 508374, - "total_submitted": 860386, + "total_acs": 511614, + "total_submitted": 864292, "frontend_question_id": 107, "is_new_question": false }, @@ -50661,8 +50983,8 @@ "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": 406172, - "total_submitted": 727486, + "total_acs": 409949, + "total_submitted": 732159, "frontend_question_id": 106, "is_new_question": false }, @@ -50684,8 +51006,8 @@ "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": 728743, - "total_submitted": 1252201, + "total_acs": 738533, + "total_submitted": 1265505, "frontend_question_id": 105, "is_new_question": false }, @@ -50707,8 +51029,8 @@ "question__title": "Maximum Depth of Binary Tree", "question__title_slug": "maximum-depth-of-binary-tree", "question__hide": false, - "total_acs": 1732069, - "total_submitted": 2399868, + "total_acs": 1757314, + "total_submitted": 2431532, "frontend_question_id": 104, "is_new_question": false }, @@ -50730,8 +51052,8 @@ "question__title": "Binary Tree Zigzag Level Order Traversal", "question__title_slug": "binary-tree-zigzag-level-order-traversal", "question__hide": false, - "total_acs": 732521, - "total_submitted": 1356992, + "total_acs": 741043, + "total_submitted": 1369946, "frontend_question_id": 103, "is_new_question": false }, @@ -50753,8 +51075,8 @@ "question__title": "Binary Tree Level Order Traversal", "question__title_slug": "binary-tree-level-order-traversal", "question__hide": false, - "total_acs": 1284085, - "total_submitted": 2094331, + "total_acs": 1306139, + "total_submitted": 2124916, "frontend_question_id": 102, "is_new_question": false }, @@ -50776,8 +51098,8 @@ "question__title": "Symmetric Tree", "question__title_slug": "symmetric-tree", "question__hide": false, - "total_acs": 1270237, - "total_submitted": 2447271, + "total_acs": 1285130, + "total_submitted": 2470714, "frontend_question_id": 101, "is_new_question": false }, @@ -50799,8 +51121,8 @@ "question__title": "Same Tree", "question__title_slug": "same-tree", "question__hide": false, - "total_acs": 1080463, - "total_submitted": 1939148, + "total_acs": 1096647, + "total_submitted": 1966041, "frontend_question_id": 100, "is_new_question": false }, @@ -50822,8 +51144,8 @@ "question__title": "Recover Binary Search Tree", "question__title_slug": "recover-binary-search-tree", "question__hide": false, - "total_acs": 333181, - "total_submitted": 679363, + "total_acs": 336394, + "total_submitted": 684059, "frontend_question_id": 99, "is_new_question": false }, @@ -50845,8 +51167,8 @@ "question__title": "Validate Binary Search Tree", "question__title_slug": "validate-binary-search-tree", "question__hide": false, - "total_acs": 1447221, - "total_submitted": 4711747, + "total_acs": 1467566, + "total_submitted": 4767853, "frontend_question_id": 98, "is_new_question": false }, @@ -50868,8 +51190,8 @@ "question__title": "Interleaving String", "question__title_slug": "interleaving-string", "question__hide": false, - "total_acs": 270983, - "total_submitted": 774851, + "total_acs": 273428, + "total_submitted": 780376, "frontend_question_id": 97, "is_new_question": false }, @@ -50891,8 +51213,8 @@ "question__title": "Unique Binary Search Trees", "question__title_slug": "unique-binary-search-trees", "question__hide": false, - "total_acs": 491948, - "total_submitted": 840209, + "total_acs": 495627, + "total_submitted": 845668, "frontend_question_id": 96, "is_new_question": false }, @@ -50914,8 +51236,8 @@ "question__title": "Unique Binary Search Trees II", "question__title_slug": "unique-binary-search-trees-ii", "question__hide": false, - "total_acs": 311966, - "total_submitted": 623943, + "total_acs": 314113, + "total_submitted": 626417, "frontend_question_id": 95, "is_new_question": false }, @@ -50937,8 +51259,8 @@ "question__title": "Binary Tree Inorder Traversal", "question__title_slug": "binary-tree-inorder-traversal", "question__hide": false, - "total_acs": 1515865, - "total_submitted": 2129593, + "total_acs": 1534802, + "total_submitted": 2152309, "frontend_question_id": 94, "is_new_question": false }, @@ -50960,8 +51282,8 @@ "question__title": "Restore IP Addresses", "question__title_slug": "restore-ip-addresses", "question__hide": false, - "total_acs": 304445, - "total_submitted": 720584, + "total_acs": 306562, + "total_submitted": 723727, "frontend_question_id": 93, "is_new_question": false }, @@ -50983,8 +51305,8 @@ "question__title": "Reverse Linked List II", "question__title_slug": "reverse-linked-list-ii", "question__hide": false, - "total_acs": 491851, - "total_submitted": 1127429, + "total_acs": 496304, + "total_submitted": 1136012, "frontend_question_id": 92, "is_new_question": false }, @@ -51006,8 +51328,8 @@ "question__title": "Decode Ways", "question__title_slug": "decode-ways", "question__hide": false, - "total_acs": 800177, - "total_submitted": 2618687, + "total_acs": 808139, + "total_submitted": 2637003, "frontend_question_id": 91, "is_new_question": false }, @@ -51029,8 +51351,8 @@ "question__title": "Subsets II", "question__title_slug": "subsets-ii", "question__hide": false, - "total_acs": 525105, - "total_submitted": 976058, + "total_acs": 533850, + "total_submitted": 989246, "frontend_question_id": 90, "is_new_question": false }, @@ -51052,8 +51374,8 @@ "question__title": "Gray Code", "question__title_slug": "gray-code", "question__hide": false, - "total_acs": 236007, - "total_submitted": 424705, + "total_acs": 237224, + "total_submitted": 426217, "frontend_question_id": 89, "is_new_question": false }, @@ -51075,8 +51397,8 @@ "question__title": "Merge Sorted Array", "question__title_slug": "merge-sorted-array", "question__hide": false, - "total_acs": 1500691, - "total_submitted": 3344941, + "total_acs": 1521100, + "total_submitted": 3384427, "frontend_question_id": 88, "is_new_question": false }, @@ -51098,8 +51420,8 @@ "question__title": "Scramble String", "question__title_slug": "scramble-string", "question__hide": false, - "total_acs": 146849, - "total_submitted": 411171, + "total_acs": 148030, + "total_submitted": 413897, "frontend_question_id": 87, "is_new_question": false }, @@ -51121,8 +51443,8 @@ "question__title": "Partition List", "question__title_slug": "partition-list", "question__hide": false, - "total_acs": 347460, - "total_submitted": 720134, + "total_acs": 349934, + "total_submitted": 723772, "frontend_question_id": 86, "is_new_question": false }, @@ -51144,8 +51466,8 @@ "question__title": "Maximal Rectangle", "question__title_slug": "maximal-rectangle", "question__hide": false, - "total_acs": 300585, - "total_submitted": 697618, + "total_acs": 302730, + "total_submitted": 700978, "frontend_question_id": 85, "is_new_question": false }, @@ -51167,8 +51489,8 @@ "question__title": "Largest Rectangle in Histogram", "question__title_slug": "largest-rectangle-in-histogram", "question__hide": false, - "total_acs": 524315, - "total_submitted": 1275525, + "total_acs": 531141, + "total_submitted": 1288908, "frontend_question_id": 84, "is_new_question": false }, @@ -51190,8 +51512,8 @@ "question__title": "Remove Duplicates from Sorted List", "question__title_slug": "remove-duplicates-from-sorted-list", "question__hide": false, - "total_acs": 891301, - "total_submitted": 1810029, + "total_acs": 902679, + "total_submitted": 1830362, "frontend_question_id": 83, "is_new_question": false }, @@ -51213,8 +51535,8 @@ "question__title": "Remove Duplicates from Sorted List II", "question__title_slug": "remove-duplicates-from-sorted-list-ii", "question__hide": false, - "total_acs": 502468, - "total_submitted": 1125632, + "total_acs": 507132, + "total_submitted": 1133958, "frontend_question_id": 82, "is_new_question": false }, @@ -51236,8 +51558,8 @@ "question__title": "Search in Rotated Sorted Array II", "question__title_slug": "search-in-rotated-sorted-array-ii", "question__hide": false, - "total_acs": 434477, - "total_submitted": 1219196, + "total_acs": 437581, + "total_submitted": 1227442, "frontend_question_id": 81, "is_new_question": false }, @@ -51259,8 +51581,8 @@ "question__title": "Remove Duplicates from Sorted Array II", "question__title_slug": "remove-duplicates-from-sorted-array-ii", "question__hide": false, - "total_acs": 439320, - "total_submitted": 865192, + "total_acs": 441662, + "total_submitted": 868769, "frontend_question_id": 80, "is_new_question": false }, @@ -51282,8 +51604,8 @@ "question__title": "Word Search", "question__title_slug": "word-search", "question__hide": false, - "total_acs": 996501, - "total_submitted": 2502224, + "total_acs": 1007697, + "total_submitted": 2528797, "frontend_question_id": 79, "is_new_question": false }, @@ -51305,8 +51627,8 @@ "question__title": "Subsets", "question__title_slug": "subsets", "question__hide": false, - "total_acs": 1125465, - "total_submitted": 1562666, + "total_acs": 1139221, + "total_submitted": 1577823, "frontend_question_id": 78, "is_new_question": false }, @@ -51328,8 +51650,8 @@ "question__title": "Combinations", "question__title_slug": "combinations", "question__hide": false, - "total_acs": 540333, - "total_submitted": 837178, + "total_acs": 546547, + "total_submitted": 844712, "frontend_question_id": 77, "is_new_question": false }, @@ -51351,8 +51673,8 @@ "question__title": "Minimum Window Substring", "question__title_slug": "minimum-window-substring", "question__hide": false, - "total_acs": 778003, - "total_submitted": 1981584, + "total_acs": 786975, + "total_submitted": 2001032, "frontend_question_id": 76, "is_new_question": false }, @@ -51374,8 +51696,8 @@ "question__title": "Sort Colors", "question__title_slug": "sort-colors", "question__hide": false, - "total_acs": 1051805, - "total_submitted": 1897345, + "total_acs": 1066989, + "total_submitted": 1919138, "frontend_question_id": 75, "is_new_question": false }, @@ -51397,8 +51719,8 @@ "question__title": "Search a 2D Matrix", "question__title_slug": "search-a-2d-matrix", "question__hide": false, - "total_acs": 834190, - "total_submitted": 1850497, + "total_acs": 851488, + "total_submitted": 1880981, "frontend_question_id": 74, "is_new_question": false }, @@ -51420,8 +51742,8 @@ "question__title": "Set Matrix Zeroes", "question__title_slug": "set-matrix-zeroes", "question__hide": false, - "total_acs": 726254, - "total_submitted": 1489042, + "total_acs": 738265, + "total_submitted": 1510422, "frontend_question_id": 73, "is_new_question": false }, @@ -51443,8 +51765,8 @@ "question__title": "Edit Distance", "question__title_slug": "edit-distance", "question__hide": false, - "total_acs": 484952, - "total_submitted": 945581, + "total_acs": 490582, + "total_submitted": 953986, "frontend_question_id": 72, "is_new_question": false }, @@ -51466,8 +51788,8 @@ "question__title": "Simplify Path", "question__title_slug": "simplify-path", "question__hide": false, - "total_acs": 437043, - "total_submitted": 1122421, + "total_acs": 440061, + "total_submitted": 1129073, "frontend_question_id": 71, "is_new_question": false }, @@ -51489,8 +51811,8 @@ "question__title": "Climbing Stairs", "question__title_slug": "climbing-stairs", "question__hide": false, - "total_acs": 1624656, - "total_submitted": 3170499, + "total_acs": 1652451, + "total_submitted": 3220674, "frontend_question_id": 70, "is_new_question": false }, @@ -51512,8 +51834,8 @@ "question__title": "Sqrt(x)", "question__title_slug": "sqrtx", "question__hide": false, - "total_acs": 1081578, - "total_submitted": 2952536, + "total_acs": 1095031, + "total_submitted": 2986270, "frontend_question_id": 69, "is_new_question": false }, @@ -51535,8 +51857,8 @@ "question__title": "Text Justification", "question__title_slug": "text-justification", "question__hide": false, - "total_acs": 253130, - "total_submitted": 710876, + "total_acs": 255336, + "total_submitted": 714825, "frontend_question_id": 68, "is_new_question": false }, @@ -51558,8 +51880,8 @@ "question__title": "Add Binary", "question__title_slug": "add-binary", "question__hide": false, - "total_acs": 858466, - "total_submitted": 1693379, + "total_acs": 866532, + "total_submitted": 1707316, "frontend_question_id": 67, "is_new_question": false }, @@ -51581,8 +51903,8 @@ "question__title": "Plus One", "question__title_slug": "plus-one", "question__hide": false, - "total_acs": 1235028, - "total_submitted": 2872292, + "total_acs": 1250225, + "total_submitted": 2904102, "frontend_question_id": 66, "is_new_question": false }, @@ -51604,8 +51926,8 @@ "question__title": "Valid Number", "question__title_slug": "valid-number", "question__hide": false, - "total_acs": 277237, - "total_submitted": 1514221, + "total_acs": 278562, + "total_submitted": 1519018, "frontend_question_id": 65, "is_new_question": false }, @@ -51627,8 +51949,8 @@ "question__title": "Minimum Path Sum", "question__title_slug": "minimum-path-sum", "question__hide": false, - "total_acs": 724696, - "total_submitted": 1214399, + "total_acs": 731690, + "total_submitted": 1224169, "frontend_question_id": 64, "is_new_question": false }, @@ -51650,8 +51972,8 @@ "question__title": "Unique Paths II", "question__title_slug": "unique-paths-ii", "question__hide": false, - "total_acs": 557281, - "total_submitted": 1445391, + "total_acs": 562442, + "total_submitted": 1456427, "frontend_question_id": 63, "is_new_question": false }, @@ -51673,8 +51995,8 @@ "question__title": "Unique Paths", "question__title_slug": "unique-paths", "question__hide": false, - "total_acs": 974001, - "total_submitted": 1612595, + "total_acs": 988333, + "total_submitted": 1633352, "frontend_question_id": 62, "is_new_question": false }, @@ -51696,8 +52018,8 @@ "question__title": "Rotate List", "question__title_slug": "rotate-list", "question__hide": false, - "total_acs": 575063, - "total_submitted": 1637206, + "total_acs": 582197, + "total_submitted": 1654538, "frontend_question_id": 61, "is_new_question": false }, @@ -51719,8 +52041,8 @@ "question__title": "Permutation Sequence", "question__title_slug": "permutation-sequence", "question__hide": false, - "total_acs": 276511, - "total_submitted": 650313, + "total_acs": 279322, + "total_submitted": 654876, "frontend_question_id": 60, "is_new_question": false }, @@ -51742,8 +52064,8 @@ "question__title": "Spiral Matrix II", "question__title_slug": "spiral-matrix-ii", "question__hide": false, - "total_acs": 369502, - "total_submitted": 565884, + "total_acs": 372255, + "total_submitted": 569214, "frontend_question_id": 59, "is_new_question": false }, @@ -51765,8 +52087,8 @@ "question__title": "Length of Last Word", "question__title_slug": "length-of-last-word", "question__hide": false, - "total_acs": 766075, - "total_submitted": 2000577, + "total_acs": 776121, + "total_submitted": 2017791, "frontend_question_id": 58, "is_new_question": false }, @@ -51788,8 +52110,8 @@ "question__title": "Insert Interval", "question__title_slug": "insert-interval", "question__hide": false, - "total_acs": 527022, - "total_submitted": 1403259, + "total_acs": 534952, + "total_submitted": 1422669, "frontend_question_id": 57, "is_new_question": false }, @@ -51811,8 +52133,8 @@ "question__title": "Merge Intervals", "question__title_slug": "merge-intervals", "question__hide": false, - "total_acs": 1483820, - "total_submitted": 3284734, + "total_acs": 1502233, + "total_submitted": 3320611, "frontend_question_id": 56, "is_new_question": false }, @@ -51834,8 +52156,8 @@ "question__title": "Jump Game", "question__title_slug": "jump-game", "question__hide": false, - "total_acs": 1036653, - "total_submitted": 2728534, + "total_acs": 1050824, + "total_submitted": 2761554, "frontend_question_id": 55, "is_new_question": false }, @@ -51857,8 +52179,8 @@ "question__title": "Spiral Matrix", "question__title_slug": "spiral-matrix", "question__hide": false, - "total_acs": 757214, - "total_submitted": 1806380, + "total_acs": 767981, + "total_submitted": 1825245, "frontend_question_id": 54, "is_new_question": false }, @@ -51880,14 +52202,14 @@ "question__title": "Maximum Subarray", "question__title_slug": "maximum-subarray", "question__hide": false, - "total_acs": 2439608, - "total_submitted": 4917912, + "total_acs": 2479191, + "total_submitted": 4995033, "frontend_question_id": 53, "is_new_question": false }, "status": null, "difficulty": { - "level": 1 + "level": 2 }, "paid_only": false, "is_favor": false, @@ -51903,8 +52225,8 @@ "question__title": "N-Queens II", "question__title_slug": "n-queens-ii", "question__hide": false, - "total_acs": 264973, - "total_submitted": 379767, + "total_acs": 267071, + "total_submitted": 382125, "frontend_question_id": 52, "is_new_question": false }, @@ -51926,8 +52248,8 @@ "question__title": "N-Queens", "question__title_slug": "n-queens", "question__hide": false, - "total_acs": 422641, - "total_submitted": 697603, + "total_acs": 428242, + "total_submitted": 704085, "frontend_question_id": 51, "is_new_question": false }, @@ -51949,8 +52271,8 @@ "question__title": "Pow(x, n)", "question__title_slug": "powx-n", "question__hide": false, - "total_acs": 938642, - "total_submitted": 2888425, + "total_acs": 949682, + "total_submitted": 2919587, "frontend_question_id": 50, "is_new_question": false }, @@ -51972,8 +52294,8 @@ "question__title": "Group Anagrams", "question__title_slug": "group-anagrams", "question__hide": false, - "total_acs": 1405917, - "total_submitted": 2175884, + "total_acs": 1427128, + "total_submitted": 2204167, "frontend_question_id": 49, "is_new_question": false }, @@ -51995,8 +52317,8 @@ "question__title": "Rotate Image", "question__title_slug": "rotate-image", "question__hide": false, - "total_acs": 924021, - "total_submitted": 1373338, + "total_acs": 937099, + "total_submitted": 1389191, "frontend_question_id": 48, "is_new_question": false }, @@ -52018,8 +52340,8 @@ "question__title": "Permutations II", "question__title_slug": "permutations-ii", "question__hide": false, - "total_acs": 662451, - "total_submitted": 1190037, + "total_acs": 667943, + "total_submitted": 1197983, "frontend_question_id": 47, "is_new_question": false }, @@ -52041,8 +52363,8 @@ "question__title": "Permutations", "question__title_slug": "permutations", "question__hide": false, - "total_acs": 1210436, - "total_submitted": 1659799, + "total_acs": 1226817, + "total_submitted": 1678313, "frontend_question_id": 46, "is_new_question": false }, @@ -52064,8 +52386,8 @@ "question__title": "Jump Game II", "question__title_slug": "jump-game-ii", "question__hide": false, - "total_acs": 625668, - "total_submitted": 1667424, + "total_acs": 634661, + "total_submitted": 1686185, "frontend_question_id": 45, "is_new_question": false }, @@ -52087,8 +52409,8 @@ "question__title": "Wildcard Matching", "question__title_slug": "wildcard-matching", "question__hide": false, - "total_acs": 394562, - "total_submitted": 1481469, + "total_acs": 397897, + "total_submitted": 1492822, "frontend_question_id": 44, "is_new_question": false }, @@ -52110,8 +52432,8 @@ "question__title": "Multiply Strings", "question__title_slug": "multiply-strings", "question__hide": false, - "total_acs": 525697, - "total_submitted": 1384501, + "total_acs": 530964, + "total_submitted": 1395631, "frontend_question_id": 43, "is_new_question": false }, @@ -52133,8 +52455,8 @@ "question__title": "Trapping Rain Water", "question__title_slug": "trapping-rain-water", "question__hide": false, - "total_acs": 1161239, - "total_submitted": 2037505, + "total_acs": 1176571, + "total_submitted": 2059690, "frontend_question_id": 42, "is_new_question": false }, @@ -52156,8 +52478,8 @@ "question__title": "First Missing Positive", "question__title_slug": "first-missing-positive", "question__hide": false, - "total_acs": 699384, - "total_submitted": 1935356, + "total_acs": 706469, + "total_submitted": 1952764, "frontend_question_id": 41, "is_new_question": false }, @@ -52179,8 +52501,8 @@ "question__title": "Combination Sum II", "question__title_slug": "combination-sum-ii", "question__hide": false, - "total_acs": 576221, - "total_submitted": 1095399, + "total_acs": 584114, + "total_submitted": 1108751, "frontend_question_id": 40, "is_new_question": false }, @@ -52202,8 +52524,8 @@ "question__title": "Combination Sum", "question__title_slug": "combination-sum", "question__hide": false, - "total_acs": 1125818, - "total_submitted": 1703510, + "total_acs": 1141359, + "total_submitted": 1723427, "frontend_question_id": 39, "is_new_question": false }, @@ -52225,8 +52547,8 @@ "question__title": "Count and Say", "question__title_slug": "count-and-say", "question__hide": false, - "total_acs": 635320, - "total_submitted": 1297671, + "total_acs": 639846, + "total_submitted": 1304473, "frontend_question_id": 38, "is_new_question": false }, @@ -52248,8 +52570,8 @@ "question__title": "Sudoku Solver", "question__title_slug": "sudoku-solver", "question__hide": false, - "total_acs": 361625, - "total_submitted": 661086, + "total_acs": 366259, + "total_submitted": 666964, "frontend_question_id": 37, "is_new_question": false }, @@ -52271,8 +52593,8 @@ "question__title": "Valid Sudoku", "question__title_slug": "valid-sudoku", "question__hide": false, - "total_acs": 766359, - "total_submitted": 1380315, + "total_acs": 778534, + "total_submitted": 1398996, "frontend_question_id": 36, "is_new_question": false }, @@ -52294,8 +52616,8 @@ "question__title": "Search Insert Position", "question__title_slug": "search-insert-position", "question__hide": false, - "total_acs": 1506252, - "total_submitted": 3563269, + "total_acs": 1530501, + "total_submitted": 3622046, "frontend_question_id": 35, "is_new_question": false }, @@ -52317,8 +52639,8 @@ "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": 1134406, - "total_submitted": 2815091, + "total_acs": 1148904, + "total_submitted": 2846338, "frontend_question_id": 34, "is_new_question": false }, @@ -52340,8 +52662,8 @@ "question__title": "Search in Rotated Sorted Array", "question__title_slug": "search-in-rotated-sorted-array", "question__hide": false, - "total_acs": 1534361, - "total_submitted": 4037552, + "total_acs": 1556625, + "total_submitted": 4089101, "frontend_question_id": 33, "is_new_question": false }, @@ -52363,8 +52685,8 @@ "question__title": "Longest Valid Parentheses", "question__title_slug": "longest-valid-parentheses", "question__hide": false, - "total_acs": 528429, - "total_submitted": 1633767, + "total_acs": 532012, + "total_submitted": 1643475, "frontend_question_id": 32, "is_new_question": false }, @@ -52386,8 +52708,8 @@ "question__title": "Next Permutation", "question__title_slug": "next-permutation", "question__hide": false, - "total_acs": 835048, - "total_submitted": 2282879, + "total_acs": 844498, + "total_submitted": 2305696, "frontend_question_id": 31, "is_new_question": false }, @@ -52409,8 +52731,8 @@ "question__title": "Substring with Concatenation of All Words", "question__title_slug": "substring-with-concatenation-of-all-words", "question__hide": false, - "total_acs": 260159, - "total_submitted": 918532, + "total_acs": 262207, + "total_submitted": 923966, "frontend_question_id": 30, "is_new_question": false }, @@ -52432,8 +52754,8 @@ "question__title": "Divide Two Integers", "question__title_slug": "divide-two-integers", "question__hide": false, - "total_acs": 511694, - "total_submitted": 2923447, + "total_acs": 514764, + "total_submitted": 2942840, "frontend_question_id": 29, "is_new_question": false }, @@ -52455,8 +52777,8 @@ "question__title": "Implement strStr()", "question__title_slug": "implement-strstr", "question__hide": false, - "total_acs": 1287118, - "total_submitted": 3545402, + "total_acs": 1302555, + "total_submitted": 3576002, "frontend_question_id": 28, "is_new_question": false }, @@ -52478,8 +52800,8 @@ "question__title": "Remove Element", "question__title_slug": "remove-element", "question__hide": false, - "total_acs": 1322884, - "total_submitted": 2571872, + "total_acs": 1338723, + "total_submitted": 2599278, "frontend_question_id": 27, "is_new_question": false }, @@ -52501,8 +52823,8 @@ "question__title": "Remove Duplicates from Sorted Array", "question__title_slug": "remove-duplicates-from-sorted-array", "question__hide": false, - "total_acs": 2203545, - "total_submitted": 4472728, + "total_acs": 2230258, + "total_submitted": 4518244, "frontend_question_id": 26, "is_new_question": false }, @@ -52524,8 +52846,8 @@ "question__title": "Reverse Nodes in k-Group", "question__title_slug": "reverse-nodes-in-k-group", "question__hide": false, - "total_acs": 532009, - "total_submitted": 1029535, + "total_acs": 539481, + "total_submitted": 1040441, "frontend_question_id": 25, "is_new_question": false }, @@ -52547,8 +52869,8 @@ "question__title": "Swap Nodes in Pairs", "question__title_slug": "swap-nodes-in-pairs", "question__hide": false, - "total_acs": 892277, - "total_submitted": 1508575, + "total_acs": 900875, + "total_submitted": 1520255, "frontend_question_id": 24, "is_new_question": false }, @@ -52570,8 +52892,8 @@ "question__title": "Merge k Sorted Lists", "question__title_slug": "merge-k-sorted-lists", "question__hide": false, - "total_acs": 1298012, - "total_submitted": 2738598, + "total_acs": 1311209, + "total_submitted": 2761233, "frontend_question_id": 23, "is_new_question": false }, @@ -52593,8 +52915,8 @@ "question__title": "Generate Parentheses", "question__title_slug": "generate-parentheses", "question__hide": false, - "total_acs": 1094434, - "total_submitted": 1551408, + "total_acs": 1107034, + "total_submitted": 1566451, "frontend_question_id": 22, "is_new_question": false }, @@ -52616,8 +52938,8 @@ "question__title": "Merge Two Sorted Lists", "question__title_slug": "merge-two-sorted-lists", "question__hide": false, - "total_acs": 2279334, - "total_submitted": 3757373, + "total_acs": 2322184, + "total_submitted": 3818653, "frontend_question_id": 21, "is_new_question": false }, @@ -52639,8 +52961,8 @@ "question__title": "Valid Parentheses", "question__title_slug": "valid-parentheses", "question__hide": false, - "total_acs": 2334247, - "total_submitted": 5713429, + "total_acs": 2371323, + "total_submitted": 5804145, "frontend_question_id": 20, "is_new_question": false }, @@ -52662,8 +52984,8 @@ "question__title": "Remove Nth Node From End of List", "question__title_slug": "remove-nth-node-from-end-of-list", "question__hide": false, - "total_acs": 1447343, - "total_submitted": 3751132, + "total_acs": 1471027, + "total_submitted": 3803963, "frontend_question_id": 19, "is_new_question": false }, @@ -52685,8 +53007,8 @@ "question__title": "4Sum", "question__title_slug": "4sum", "question__hide": false, - "total_acs": 600601, - "total_submitted": 1604061, + "total_acs": 606468, + "total_submitted": 1625086, "frontend_question_id": 18, "is_new_question": false }, @@ -52708,8 +53030,8 @@ "question__title": "Letter Combinations of a Phone Number", "question__title_slug": "letter-combinations-of-a-phone-number", "question__hide": false, - "total_acs": 1247878, - "total_submitted": 2288314, + "total_acs": 1260560, + "total_submitted": 2307628, "frontend_question_id": 17, "is_new_question": false }, @@ -52731,8 +53053,8 @@ "question__title": "3Sum Closest", "question__title_slug": "3sum-closest", "question__hide": false, - "total_acs": 819091, - "total_submitted": 1741330, + "total_acs": 826349, + "total_submitted": 1762830, "frontend_question_id": 16, "is_new_question": false }, @@ -52754,8 +53076,8 @@ "question__title": "3Sum", "question__title_slug": "3sum", "question__hide": false, - "total_acs": 2020370, - "total_submitted": 6439563, + "total_acs": 2048032, + "total_submitted": 6511640, "frontend_question_id": 15, "is_new_question": false }, @@ -52777,8 +53099,8 @@ "question__title": "Longest Common Prefix", "question__title_slug": "longest-common-prefix", "question__hide": false, - "total_acs": 1645315, - "total_submitted": 4140946, + "total_acs": 1670842, + "total_submitted": 4194076, "frontend_question_id": 14, "is_new_question": false }, @@ -52800,8 +53122,8 @@ "question__title": "Roman to Integer", "question__title_slug": "roman-to-integer", "question__hide": false, - "total_acs": 1677751, - "total_submitted": 2898580, + "total_acs": 1711926, + "total_submitted": 2957281, "frontend_question_id": 13, "is_new_question": false }, @@ -52823,8 +53145,8 @@ "question__title": "Integer to Roman", "question__title_slug": "integer-to-roman", "question__hide": false, - "total_acs": 719632, - "total_submitted": 1204539, + "total_acs": 728842, + "total_submitted": 1218374, "frontend_question_id": 12, "is_new_question": false }, @@ -52846,8 +53168,8 @@ "question__title": "Container With Most Water", "question__title_slug": "container-with-most-water", "question__hide": false, - "total_acs": 1549967, - "total_submitted": 2868519, + "total_acs": 1572994, + "total_submitted": 2909555, "frontend_question_id": 11, "is_new_question": false }, @@ -52869,8 +53191,8 @@ "question__title": "Regular Expression Matching", "question__title_slug": "regular-expression-matching", "question__hide": false, - "total_acs": 695510, - "total_submitted": 2459073, + "total_acs": 700411, + "total_submitted": 2476697, "frontend_question_id": 10, "is_new_question": false }, @@ -52892,8 +53214,8 @@ "question__title": "Palindrome Number", "question__title_slug": "palindrome-number", "question__hide": false, - "total_acs": 2169444, - "total_submitted": 4129840, + "total_acs": 2202022, + "total_submitted": 4189233, "frontend_question_id": 9, "is_new_question": false }, @@ -52915,8 +53237,8 @@ "question__title": "String to Integer (atoi)", "question__title_slug": "string-to-integer-atoi", "question__hide": false, - "total_acs": 1028146, - "total_submitted": 6211155, + "total_acs": 1037031, + "total_submitted": 6261821, "frontend_question_id": 8, "is_new_question": false }, @@ -52938,8 +53260,8 @@ "question__title": "Reverse Integer", "question__title_slug": "reverse-integer", "question__hide": false, - "total_acs": 2101953, - "total_submitted": 7837910, + "total_acs": 2118266, + "total_submitted": 7888856, "frontend_question_id": 7, "is_new_question": false }, @@ -52961,8 +53283,8 @@ "question__title": "Zigzag Conversion", "question__title_slug": "zigzag-conversion", "question__hide": false, - "total_acs": 782672, - "total_submitted": 1867471, + "total_acs": 789500, + "total_submitted": 1879603, "frontend_question_id": 6, "is_new_question": false }, @@ -52984,8 +53306,8 @@ "question__title": "Longest Palindromic Substring", "question__title_slug": "longest-palindromic-substring", "question__hide": false, - "total_acs": 1925136, - "total_submitted": 5982100, + "total_acs": 1945538, + "total_submitted": 6041710, "frontend_question_id": 5, "is_new_question": false }, @@ -53007,8 +53329,8 @@ "question__title": "Median of Two Sorted Arrays", "question__title_slug": "median-of-two-sorted-arrays", "question__hide": false, - "total_acs": 1429028, - "total_submitted": 4158459, + "total_acs": 1446766, + "total_submitted": 4201728, "frontend_question_id": 4, "is_new_question": false }, @@ -53030,8 +53352,8 @@ "question__title": "Longest Substring Without Repeating Characters", "question__title_slug": "longest-substring-without-repeating-characters", "question__hide": false, - "total_acs": 3451060, - "total_submitted": 10324731, + "total_acs": 3494676, + "total_submitted": 10444065, "frontend_question_id": 3, "is_new_question": false }, @@ -53053,8 +53375,8 @@ "question__title": "Add Two Numbers", "question__title_slug": "add-two-numbers", "question__hide": false, - "total_acs": 2842945, - "total_submitted": 7312355, + "total_acs": 2873583, + "total_submitted": 7376239, "frontend_question_id": 2, "is_new_question": false }, @@ -53076,8 +53398,8 @@ "question__title": "Two Sum", "question__title_slug": "two-sum", "question__hide": false, - "total_acs": 6901514, - "total_submitted": 14164067, + "total_acs": 7001872, + "total_submitted": 14356547, "frontend_question_id": 1, "is_new_question": false }, diff --git a/leetcode/originData/[no content]minimum-flips-in-binary-tree-to-get-result.json b/leetcode/originData/[no content]minimum-flips-in-binary-tree-to-get-result.json new file mode 100644 index 00000000..ba39a020 --- /dev/null +++ b/leetcode/originData/[no content]minimum-flips-in-binary-tree-to-get-result.json @@ -0,0 +1,72 @@ +{ + "data": { + "question": { + "questionId": "2399", + "questionFrontendId": "2313", + "boundTopicId": null, + "title": "Minimum Flips in Binary Tree to Get Result", + "titleSlug": "minimum-flips-in-binary-tree-to-get-result", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Hard", + "likes": 10, + "dislikes": 0, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Check If Two Expression Trees are Equivalent\", \"titleSlug\": \"check-if-two-expression-trees-are-equivalent\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Design an Expression Tree With Evaluate Function\", \"titleSlug\": \"design-an-expression-tree-with-evaluate-function\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "[3,5,4,2,null,1,1,1,0]\ntrue\n[0]\nfalse", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Tree", + "slug": "tree", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Depth-First Search", + "slug": "depth-first-search", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Binary Tree", + "slug": "binary-tree", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"337\", \"totalSubmission\": \"453\", \"totalAcceptedRaw\": 337, \"totalSubmissionRaw\": 453, \"acRate\": \"74.4%\"}", + "hints": [ + "Try using tree DP to solve this problem.", + "Find the minimum operations to change each subtree to true and to false separately.", + "For nodes representing boolean operations, find the minimum operations by trying all combinations of values to which the child nodes can evaluate." + ], + "solution": null, + "status": null, + "sampleTestCase": "[3,5,4,2,null,1,1,1,0]\ntrue", + "metaData": "{\n \"name\": \"minimumFlips\",\n \"params\": [\n {\n \"name\": \"root\",\n \"type\": \"TreeNode\"\n },\n {\n \"type\": \"boolean\",\n \"name\": \"result\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17 . Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\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
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\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
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

\\r\\n\\r\\n

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/[no content]the-first-day-of-the-maximum-recorded-degree-in-each-city.json b/leetcode/originData/[no content]the-first-day-of-the-maximum-recorded-degree-in-each-city.json new file mode 100644 index 00000000..282ad0e4 --- /dev/null +++ b/leetcode/originData/[no content]the-first-day-of-the-maximum-recorded-degree-in-each-city.json @@ -0,0 +1,60 @@ +{ + "data": { + "question": { + "questionId": "2446", + "questionFrontendId": "2314", + "boundTopicId": null, + "title": "The First Day of the Maximum Recorded Degree in Each City", + "titleSlug": "the-first-day-of-the-maximum-recorded-degree-in-each-city", + "content": null, + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": true, + "difficulty": "Medium", + "likes": 5, + "dislikes": 1, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "{\"headers\": {\"Weather\": [\"city_id\", \"day\", \"degree\"]}, \"rows\": {\"Weather\": [[1, \"2022-01-07\", -12], [1, \"2022-03-07\", 5], [1, \"2022-07-07\", 24], [2, \"2022-08-07\", 37], [2, \"2022-08-17\", 37], [3, \"2022-02-07\", -7], [3, \"2022-12-07\", -6]]}}", + "categoryTitle": "Database", + "contributors": [], + "topicTags": [ + { + "name": "Database", + "slug": "database", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": null, + "stats": "{\"totalAccepted\": \"242\", \"totalSubmission\": \"306\", \"totalAcceptedRaw\": 242, \"totalSubmissionRaw\": 306, \"acRate\": \"79.1%\"}", + "hints": [], + "solution": null, + "status": null, + "sampleTestCase": "{\"headers\": {\"Weather\": [\"city_id\", \"day\", \"degree\"]}, \"rows\": {\"Weather\": [[1, \"2022-01-07\", -12], [1, \"2022-03-07\", 5], [1, \"2022-07-07\", 24], [2, \"2022-08-07\", 37], [2, \"2022-08-17\", 37], [3, \"2022-02-07\", -7], [3, \"2022-12-07\", -6]]}}", + "metaData": "{\n \"mysql\": [\n \"Create table If Not Exists Weather (city_id int, day date, degree int)\"\n ],\n \"mssql\": [\n \"Create table Weather (city_id int, day date, degree int)\"\n ],\n \"oraclesql\": [\n \"Create table Weather (city_id int, day date, degree int)\",\n \"ALTER SESSION SET nls_date_format='YYYY-MM-DD'\"\n ],\n \"database\": true\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [ + "Create table If Not Exists Weather (city_id int, day date, degree int)", + "Truncate table Weather", + "insert into Weather (city_id, day, degree) values ('1', '2022-01-07', '-12')", + "insert into Weather (city_id, day, degree) values ('1', '2022-03-07', '5')", + "insert into Weather (city_id, day, degree) values ('1', '2022-07-07', '24')", + "insert into Weather (city_id, day, degree) values ('2', '2022-08-07', '37')", + "insert into Weather (city_id, day, degree) values ('2', '2022-08-17', '37')", + "insert into Weather (city_id, day, degree) values ('3', '2022-02-07', '-7')", + "insert into Weather (city_id, day, degree) values ('3', '2022-12-07', '-6')" + ], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": false, + "envInfo": "{\"mysql\": [\"MySQL\", \"

MySQL 8.0.

\"], \"mssql\": [\"MS SQL Server\", \"

mssql server 2019.

\"], \"oraclesql\": [\"Oracle\", \"

Oracle Sql 11.2.

\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/check-if-matrix-is-x-matrix.json b/leetcode/originData/check-if-matrix-is-x-matrix.json new file mode 100644 index 00000000..372ea4bc --- /dev/null +++ b/leetcode/originData/check-if-matrix-is-x-matrix.json @@ -0,0 +1,168 @@ +{ + "data": { + "question": { + "questionId": "2398", + "questionFrontendId": "2319", + "boundTopicId": null, + "title": "Check if Matrix Is X-Matrix", + "titleSlug": "check-if-matrix-is-x-matrix", + "content": "

A square matrix is said to be an X-Matrix if both of the following conditions hold:

\n\n
    \n\t
  1. All the elements in the diagonals of the matrix are non-zero.
  2. \n\t
  3. All other elements are 0.
  4. \n
\n\n

Given a 2D integer array grid of size n x n representing a square matrix, return true if grid is an X-Matrix. Otherwise, return false.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: grid = [[2,0,0,1],[0,3,1,0],[0,5,2,0],[4,0,0,2]]\nOutput: true\nExplanation: Refer to the diagram above. \nAn X-Matrix should have the green elements (diagonals) be non-zero and the red elements be 0.\nThus, grid is an X-Matrix.\n
\n\n

Example 2:

\n\"\"\n
\nInput: grid = [[5,7,0],[0,3,1],[0,5,0]]\nOutput: false\nExplanation: Refer to the diagram above.\nAn X-Matrix should have the green elements (diagonals) be non-zero and the red elements be 0.\nThus, grid is not an X-Matrix.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • n == grid.length == grid[i].length
  • \n\t
  • 3 <= n <= 100
  • \n\t
  • 0 <= grid[i][j] <= 105
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 92, + "dislikes": 4, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Matrix Diagonal Sum\", \"titleSlug\": \"matrix-diagonal-sum\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]", + "exampleTestcases": "[[2,0,0,1],[0,3,1,0],[0,5,2,0],[4,0,0,2]]\n[[5,7,0],[0,3,1],[0,5,0]]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Matrix", + "slug": "matrix", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n bool checkXMatrix(vector>& grid) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public boolean checkXMatrix(int[][] grid) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def checkXMatrix(self, grid):\n \"\"\"\n :type grid: List[List[int]]\n :rtype: bool\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def checkXMatrix(self, grid: List[List[int]]) -> bool:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nbool checkXMatrix(int** grid, int gridSize, int* gridColSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public bool CheckXMatrix(int[][] grid) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[][]} grid\n * @return {boolean}\n */\nvar checkXMatrix = function(grid) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[][]} grid\n# @return {Boolean}\ndef check_x_matrix(grid)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func checkXMatrix(_ grid: [[Int]]) -> Bool {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func checkXMatrix(grid [][]int) bool {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def checkXMatrix(grid: Array[Array[Int]]): Boolean = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun checkXMatrix(grid: Array): Boolean {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn check_x_matrix(grid: Vec>) -> bool {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[][] $grid\n * @return Boolean\n */\n function checkXMatrix($grid) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function checkXMatrix(grid: number[][]): boolean {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (check-x-matrix grid)\n (-> (listof (listof exact-integer?)) boolean?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec check_x_matrix(Grid :: [[integer()]]) -> boolean().\ncheck_x_matrix(Grid) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec check_x_matrix(grid :: [[integer]]) :: boolean\n def check_x_matrix(grid) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"19K\", \"totalSubmission\": \"28.3K\", \"totalAcceptedRaw\": 18980, \"totalSubmissionRaw\": 28321, \"acRate\": \"67.0%\"}", + "hints": [ + "Assuming a 0-indexed matrix, for a given cell on row i and column j, it is in a diagonal if and only if i == j or i == n - 1 - j.", + "We can then iterate through the elements in the matrix to check if all the elements in the diagonals are non-zero and all other elements are zero." + ], + "solution": null, + "status": null, + "sampleTestCase": "[[2,0,0,1],[0,3,1,0],[0,5,2,0],[4,0,0,2]]", + "metaData": "{\n \"name\": \"checkXMatrix\",\n \"params\": [\n {\n \"name\": \"grid\",\n \"type\": \"integer[][]\"\n }\n ],\n \"return\": {\n \"type\": \"boolean\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17 . Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\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
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\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
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

\\r\\n\\r\\n

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/count-asterisks.json b/leetcode/originData/count-asterisks.json new file mode 100644 index 00000000..b0b0d579 --- /dev/null +++ b/leetcode/originData/count-asterisks.json @@ -0,0 +1,162 @@ +{ + "data": { + "question": { + "questionId": "2401", + "questionFrontendId": "2315", + "boundTopicId": null, + "title": "Count Asterisks", + "titleSlug": "count-asterisks", + "content": "

You are given a string s, where every two consecutive vertical bars '|' are grouped into a pair. In other words, the 1st and 2nd '|' make a pair, the 3rd and 4th '|' make a pair, and so forth.

\n\n

Return the number of '*' in s, excluding the '*' between each pair of '|'.

\n\n

Note that each '|' will belong to exactly one pair.

\n\n

 

\n

Example 1:

\n\n
\nInput: s = "l|*e*et|c**o|*de|"\nOutput: 2\nExplanation: The considered characters are underlined: "l|*e*et|c**o|*de|".\nThe characters between the first and second '|' are excluded from the answer.\nAlso, the characters between the third and fourth '|' are excluded from the answer.\nThere are 2 asterisks considered. Therefore, we return 2.
\n\n

Example 2:

\n\n
\nInput: s = "iamprogrammer"\nOutput: 0\nExplanation: In this example, there are no asterisks in s. Therefore, we return 0.\n
\n\n

Example 3:

\n\n
\nInput: s = "yo|uar|e**|b|e***au|tifu|l"\nOutput: 5\nExplanation: The considered characters are underlined: "yo|uar|e**|b|e***au|tifu|l". There are 5 asterisks considered. Therefore, we return 5.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= s.length <= 1000
  • \n\t
  • s consists of lowercase English letters, vertical bars '|', and asterisks '*'.
  • \n\t
  • s contains an even number of vertical bars '|'.
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 120, + "dislikes": 17, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "\"l|*e*et|c**o|*de|\"\n\"iamprogrammer\"\n\"yo|uar|e**|b|e***au|tifu|l\"", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "String", + "slug": "string", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int countAsterisks(string s) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int countAsterisks(String s) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def countAsterisks(self, s):\n \"\"\"\n :type s: str\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def countAsterisks(self, s: str) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint countAsterisks(char * s){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int CountAsterisks(string s) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string} s\n * @return {number}\n */\nvar countAsterisks = function(s) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String} s\n# @return {Integer}\ndef count_asterisks(s)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func countAsterisks(_ s: String) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func countAsterisks(s string) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def countAsterisks(s: String): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun countAsterisks(s: String): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn count_asterisks(s: String) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String $s\n * @return Integer\n */\n function countAsterisks($s) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function countAsterisks(s: string): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (count-asterisks s)\n (-> string? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec count_asterisks(S :: unicode:unicode_binary()) -> integer().\ncount_asterisks(S) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec count_asterisks(s :: String.t) :: integer\n def count_asterisks(s) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"16.8K\", \"totalSubmission\": \"20.9K\", \"totalAcceptedRaw\": 16804, \"totalSubmissionRaw\": 20862, \"acRate\": \"80.5%\"}", + "hints": [ + "Iterate through each character, while maintaining whether we are currently between a pair of ‘|’ or not.", + "If we are not in between a pair of ‘|’ and there is a ‘*’, increment the answer by 1." + ], + "solution": null, + "status": null, + "sampleTestCase": "\"l|*e*et|c**o|*de|\"", + "metaData": "{\n \"name\": \"countAsterisks\",\n \"params\": [\n {\n \"name\": \"s\",\n \"type\": \"string\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17 . Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\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
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\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
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

\\r\\n\\r\\n

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/count-number-of-ways-to-place-houses.json b/leetcode/originData/count-number-of-ways-to-place-houses.json new file mode 100644 index 00000000..7ebd6819 --- /dev/null +++ b/leetcode/originData/count-number-of-ways-to-place-houses.json @@ -0,0 +1,163 @@ +{ + "data": { + "question": { + "questionId": "2397", + "questionFrontendId": "2320", + "boundTopicId": null, + "title": "Count Number of Ways to Place Houses", + "titleSlug": "count-number-of-ways-to-place-houses", + "content": "

There is a street with n * 2 plots, where there are n plots on each side of the street. The plots on each side are numbered from 1 to n. On each plot, a house can be placed.

\n\n

Return the number of ways houses can be placed such that no two houses are adjacent to each other on the same side of the street. Since the answer may be very large, return it modulo 109 + 7.

\n\n

Note that if a house is placed on the ith plot on one side of the street, a house can also be placed on the ith plot on the other side of the street.

\n\n

 

\n

Example 1:

\n\n
\nInput: n = 1\nOutput: 4\nExplanation: \nPossible arrangements:\n1. All plots are empty.\n2. A house is placed on one side of the street.\n3. A house is placed on the other side of the street.\n4. Two houses are placed, one on each side of the street.\n
\n\n

Example 2:

\n\"\"\n
\nInput: n = 2\nOutput: 9\nExplanation: The 9 possible arrangements are shown in the diagram above.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n <= 104
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 198, + "dislikes": 147, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Climbing Stairs\", \"titleSlug\": \"climbing-stairs\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"House Robber\", \"titleSlug\": \"house-robber\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "1\n2", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int countHousePlacements(int n) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int countHousePlacements(int n) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def countHousePlacements(self, n):\n \"\"\"\n :type n: int\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def countHousePlacements(self, n: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint countHousePlacements(int n){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int CountHousePlacements(int n) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @return {number}\n */\nvar countHousePlacements = function(n) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @return {Integer}\ndef count_house_placements(n)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func countHousePlacements(_ n: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func countHousePlacements(n int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def countHousePlacements(n: Int): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun countHousePlacements(n: Int): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn count_house_placements(n: i32) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @return Integer\n */\n function countHousePlacements($n) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function countHousePlacements(n: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (count-house-placements n)\n (-> exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec count_house_placements(N :: integer()) -> integer().\ncount_house_placements(N) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec count_house_placements(n :: integer) :: integer\n def count_house_placements(n) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"13K\", \"totalSubmission\": \"35.2K\", \"totalAcceptedRaw\": 13020, \"totalSubmissionRaw\": 35215, \"acRate\": \"37.0%\"}", + "hints": [ + "Try coming up with a DP solution for one side of the street.", + "The DP for one side of the street will bear resemblance to the Fibonacci sequence.", + "The number of different arrangements on both side of the street is the same." + ], + "solution": null, + "status": null, + "sampleTestCase": "1", + "metaData": "{\n \"name\": \"countHousePlacements\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17 . Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\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
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\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
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

\\r\\n\\r\\n

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/count-unreachable-pairs-of-nodes-in-an-undirected-graph.json b/leetcode/originData/count-unreachable-pairs-of-nodes-in-an-undirected-graph.json new file mode 100644 index 00000000..94c91bfc --- /dev/null +++ b/leetcode/originData/count-unreachable-pairs-of-nodes-in-an-undirected-graph.json @@ -0,0 +1,181 @@ +{ + "data": { + "question": { + "questionId": "2403", + "questionFrontendId": "2316", + "boundTopicId": null, + "title": "Count Unreachable Pairs of Nodes in an Undirected Graph", + "titleSlug": "count-unreachable-pairs-of-nodes-in-an-undirected-graph", + "content": "

You are given an integer n. There is an undirected graph with n nodes, numbered from 0 to n - 1. You are given a 2D integer array edges where edges[i] = [ai, bi] denotes that there exists an undirected edge connecting nodes ai and bi.

\n\n

Return the number of pairs of different nodes that are unreachable from each other.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: n = 3, edges = [[0,1],[0,2],[1,2]]\nOutput: 0\nExplanation: There are no pairs of nodes that are unreachable from each other. Therefore, we return 0.\n
\n\n

Example 2:

\n\"\"\n
\nInput: n = 7, edges = [[0,2],[0,5],[2,4],[1,6],[5,4]]\nOutput: 14\nExplanation: There are 14 pairs of nodes that are unreachable from each other:\n[[0,1],[0,3],[0,6],[1,2],[1,3],[1,4],[1,5],[2,3],[2,6],[3,4],[3,5],[3,6],[4,6],[5,6]].\nTherefore, we return 14.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n <= 105
  • \n\t
  • 0 <= edges.length <= 2 * 105
  • \n\t
  • edges[i].length == 2
  • \n\t
  • 0 <= ai, bi < n
  • \n\t
  • ai != bi
  • \n\t
  • There are no repeated edges.
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 252, + "dislikes": 3, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Number of Islands\", \"titleSlug\": \"number-of-islands\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "3\n[[0,1],[0,2],[1,2]]\n7\n[[0,2],[0,5],[2,4],[1,6],[5,4]]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Depth-First Search", + "slug": "depth-first-search", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Breadth-First Search", + "slug": "breadth-first-search", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Union Find", + "slug": "union-find", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Graph", + "slug": "graph", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n long long countPairs(int n, vector>& edges) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long countPairs(int n, int[][] edges) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def countPairs(self, n, edges):\n \"\"\"\n :type n: int\n :type edges: List[List[int]]\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def countPairs(self, n: int, edges: List[List[int]]) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nlong long countPairs(int n, int** edges, int edgesSize, int* edgesColSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long CountPairs(int n, int[][] edges) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @param {number[][]} edges\n * @return {number}\n */\nvar countPairs = function(n, edges) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @param {Integer[][]} edges\n# @return {Integer}\ndef count_pairs(n, edges)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func countPairs(_ n: Int, _ edges: [[Int]]) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func countPairs(n int, edges [][]int) int64 {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def countPairs(n: Int, edges: Array[Array[Int]]): Long = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun countPairs(n: Int, edges: Array): Long {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn count_pairs(n: i32, edges: Vec>) -> i64 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @param Integer[][] $edges\n * @return Integer\n */\n function countPairs($n, $edges) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function countPairs(n: number, edges: number[][]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (count-pairs n edges)\n (-> exact-integer? (listof (listof exact-integer?)) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec count_pairs(N :: integer(), Edges :: [[integer()]]) -> integer().\ncount_pairs(N, Edges) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec count_pairs(n :: integer, edges :: [[integer]]) :: integer\n def count_pairs(n, edges) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"11.3K\", \"totalSubmission\": \"30.5K\", \"totalAcceptedRaw\": 11292, \"totalSubmissionRaw\": 30483, \"acRate\": \"37.0%\"}", + "hints": [ + "Find the connected components of the graph. To find connected components, you can use Union Find (Disjoint Sets), BFS, or DFS.", + "For a node u, the number of nodes that are unreachable from u is the number of nodes that are not in the same connected component as u.", + "The number of unreachable nodes from node u will be the same for the number of nodes that are unreachable from node v if nodes u and v belong to the same connected component." + ], + "solution": null, + "status": null, + "sampleTestCase": "3\n[[0,1],[0,2],[1,2]]", + "metaData": "{\n \"name\": \"countPairs\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"edges\"\n }\n ],\n \"return\": {\n \"type\": \"long\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17 . Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\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
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\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
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

\\r\\n\\r\\n

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/greatest-english-letter-in-upper-and-lower-case.json b/leetcode/originData/greatest-english-letter-in-upper-and-lower-case.json new file mode 100644 index 00000000..edf86734 --- /dev/null +++ b/leetcode/originData/greatest-english-letter-in-upper-and-lower-case.json @@ -0,0 +1,174 @@ +{ + "data": { + "question": { + "questionId": "1363", + "questionFrontendId": "2309", + "boundTopicId": null, + "title": "Greatest English Letter in Upper and Lower Case", + "titleSlug": "greatest-english-letter-in-upper-and-lower-case", + "content": "

Given a string of English letters s, return the greatest English letter which occurs as both a lowercase and uppercase letter in s. The returned letter should be in uppercase. If no such letter exists, return an empty string.

\n\n

An English letter b is greater than another letter a if b appears after a in the English alphabet.

\n\n

 

\n

Example 1:

\n\n
\nInput: s = "lEeTcOdE"\nOutput: "E"\nExplanation:\nThe letter 'E' is the only letter to appear in both lower and upper case.\n
\n\n

Example 2:

\n\n
\nInput: s = "arRAzFif"\nOutput: "R"\nExplanation:\nThe letter 'R' is the greatest letter to appear in both lower and upper case.\nNote that 'A' and 'F' also appear in both lower and upper case, but 'R' is greater than 'F' or 'A'.\n
\n\n

Example 3:

\n\n
\nInput: s = "AbCdEfGhIjK"\nOutput: ""\nExplanation:\nThere is no letter that appears in both lower and upper case.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= s.length <= 1000
  • \n\t
  • s consists of lowercase and uppercase English letters.
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Easy", + "likes": 172, + "dislikes": 11, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "\"lEeTcOdE\"\n\"arRAzFif\"\n\"AbCdEfGhIjK\"", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Hash Table", + "slug": "hash-table", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "String", + "slug": "string", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Enumeration", + "slug": "enumeration", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n string greatestLetter(string s) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public String greatestLetter(String s) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def greatestLetter(self, s):\n \"\"\"\n :type s: str\n :rtype: str\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def greatestLetter(self, s: str) -> str:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nchar * greatestLetter(char * s){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public string GreatestLetter(string s) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string} s\n * @return {string}\n */\nvar greatestLetter = function(s) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String} s\n# @return {String}\ndef greatest_letter(s)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func greatestLetter(_ s: String) -> String {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func greatestLetter(s string) string {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def greatestLetter(s: String): String = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun greatestLetter(s: String): String {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn greatest_letter(s: String) -> String {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String $s\n * @return String\n */\n function greatestLetter($s) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function greatestLetter(s: string): string {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (greatest-letter s)\n (-> string? string?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec greatest_letter(S :: unicode:unicode_binary()) -> unicode:unicode_binary().\ngreatest_letter(S) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec greatest_letter(s :: String.t) :: String.t\n def greatest_letter(s) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"23.2K\", \"totalSubmission\": \"33.1K\", \"totalAcceptedRaw\": 23178, \"totalSubmissionRaw\": 33112, \"acRate\": \"70.0%\"}", + "hints": [ + "Consider iterating through the string and storing each unique character that occurs in a set.", + "From Z to A, check whether both the uppercase and lowercase version occur in the set." + ], + "solution": null, + "status": null, + "sampleTestCase": "\"lEeTcOdE\"", + "metaData": "{\n \"name\": \"greatestLetter\",\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, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17 . Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\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
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\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
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

\\r\\n\\r\\n

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/longest-binary-subsequence-less-than-or-equal-to-k.json b/leetcode/originData/longest-binary-subsequence-less-than-or-equal-to-k.json new file mode 100644 index 00000000..8b9a3d8c --- /dev/null +++ b/leetcode/originData/longest-binary-subsequence-less-than-or-equal-to-k.json @@ -0,0 +1,180 @@ +{ + "data": { + "question": { + "questionId": "2395", + "questionFrontendId": "2311", + "boundTopicId": null, + "title": "Longest Binary Subsequence Less Than or Equal to K", + "titleSlug": "longest-binary-subsequence-less-than-or-equal-to-k", + "content": "

You are given a binary string s and a positive integer k.

\n\n

Return the length of the longest subsequence of s that makes up a binary number less than or equal to k.

\n\n

Note:

\n\n
    \n\t
  • The subsequence can contain leading zeroes.
  • \n\t
  • The empty string is considered to be equal to 0.
  • \n\t
  • A subsequence is a string that can be derived from another string by deleting some or no characters without changing the order of the remaining characters.
  • \n
\n\n

 

\n

Example 1:

\n\n
\nInput: s = "1001010", k = 5\nOutput: 5\nExplanation: The longest subsequence of s that makes up a binary number less than or equal to 5 is "00010", as this number is equal to 2 in decimal.\nNote that "00100" and "00101" are also possible, which are equal to 4 and 5 in decimal, respectively.\nThe length of this subsequence is 5, so 5 is returned.\n
\n\n

Example 2:

\n\n
\nInput: s = "00101001", k = 1\nOutput: 6\nExplanation: "000001" is the longest subsequence of s that makes up a binary number less than or equal to 1, as this number is equal to 1 in decimal.\nThe length of this subsequence is 6, so 6 is returned.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= s.length <= 1000
  • \n\t
  • s[i] is either '0' or '1'.
  • \n\t
  • 1 <= k <= 109
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 378, + "dislikes": 31, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Maximum Binary String After Change\", \"titleSlug\": \"maximum-binary-string-after-change\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "\"1001010\"\n5\n\"00101001\"\n1", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "String", + "slug": "string", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Greedy", + "slug": "greedy", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Memoization", + "slug": "memoization", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int longestSubsequence(string s, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int longestSubsequence(String s, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def longestSubsequence(self, s, k):\n \"\"\"\n :type s: str\n :type k: int\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def longestSubsequence(self, s: str, k: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint longestSubsequence(char * s, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int LongestSubsequence(string s, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {string} s\n * @param {number} k\n * @return {number}\n */\nvar longestSubsequence = function(s, k) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {String} s\n# @param {Integer} k\n# @return {Integer}\ndef longest_subsequence(s, k)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func longestSubsequence(_ s: String, _ k: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func longestSubsequence(s string, k int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def longestSubsequence(s: String, k: Int): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun longestSubsequence(s: String, k: Int): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn longest_subsequence(s: String, k: i32) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param String $s\n * @param Integer $k\n * @return Integer\n */\n function longestSubsequence($s, $k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function longestSubsequence(s: string, k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (longest-subsequence s k)\n (-> string? exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec longest_subsequence(S :: unicode:unicode_binary(), K :: integer()) -> integer().\nlongest_subsequence(S, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec longest_subsequence(s :: String.t, k :: integer) :: integer\n def longest_subsequence(s, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"12K\", \"totalSubmission\": \"34.7K\", \"totalAcceptedRaw\": 12005, \"totalSubmissionRaw\": 34728, \"acRate\": \"34.6%\"}", + "hints": [ + "Choosing a subsequence from the string is equivalent to deleting all the other digits.", + "If you were to remove a digit, which one should you remove to reduce the value of the string?" + ], + "solution": null, + "status": null, + "sampleTestCase": "\"1001010\"\n5", + "metaData": "{\n \"name\": \"longestSubsequence\",\n \"params\": [\n {\n \"name\": \"s\",\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, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17 . Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\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
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\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
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

\\r\\n\\r\\n

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/maximum-score-of-spliced-array.json b/leetcode/originData/maximum-score-of-spliced-array.json new file mode 100644 index 00000000..860c83f4 --- /dev/null +++ b/leetcode/originData/maximum-score-of-spliced-array.json @@ -0,0 +1,169 @@ +{ + "data": { + "question": { + "questionId": "1348", + "questionFrontendId": "2321", + "boundTopicId": null, + "title": "Maximum Score Of Spliced Array", + "titleSlug": "maximum-score-of-spliced-array", + "content": "

You are given two 0-indexed integer arrays nums1 and nums2, both of length n.

\n\n

You can choose two integers left and right where 0 <= left <= right < n and swap the subarray nums1[left...right] with the subarray nums2[left...right].

\n\n
    \n\t
  • For example, if nums1 = [1,2,3,4,5] and nums2 = [11,12,13,14,15] and you choose left = 1 and right = 2, nums1 becomes [1,12,13,4,5] and nums2 becomes [11,2,3,14,15].
  • \n
\n\n

You may choose to apply the mentioned operation once or not do anything.

\n\n

The score of the arrays is the maximum of sum(nums1) and sum(nums2), where sum(arr) is the sum of all the elements in the array arr.

\n\n

Return the maximum possible score.

\n\n

A subarray is a contiguous sequence of elements within an array. arr[left...right] denotes the subarray that contains the elements of nums between indices left and right (inclusive).

\n\n

 

\n

Example 1:

\n\n
\nInput: nums1 = [60,60,60], nums2 = [10,90,10]\nOutput: 210\nExplanation: Choosing left = 1 and right = 1, we have nums1 = [60,90,60] and nums2 = [10,60,10].\nThe score is max(sum(nums1), sum(nums2)) = max(210, 80) = 210.
\n\n

Example 2:

\n\n
\nInput: nums1 = [20,40,20,70,30], nums2 = [50,20,50,40,20]\nOutput: 220\nExplanation: Choosing left = 3, right = 4, we have nums1 = [20,40,20,40,20] and nums2 = [50,20,50,70,30].\nThe score is max(sum(nums1), sum(nums2)) = max(140, 220) = 220.\n
\n\n

Example 3:

\n\n
\nInput: nums1 = [7,11,13], nums2 = [1,1,1]\nOutput: 31\nExplanation: We choose not to swap any subarray.\nThe score is max(sum(nums1), sum(nums2)) = max(31, 3) = 31.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • n == nums1.length == nums2.length
  • \n\t
  • 1 <= n <= 105
  • \n\t
  • 1 <= nums1[i], nums2[i] <= 104
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 407, + "dislikes": 5, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Maximum Subarray\", \"titleSlug\": \"maximum-subarray\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "[60,60,60]\n[10,90,10]\n[20,40,20,70,30]\n[50,20,50,40,20]\n[7,11,13]\n[1,1,1]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int maximumsSplicedArray(vector& nums1, vector& nums2) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int maximumsSplicedArray(int[] nums1, int[] nums2) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def maximumsSplicedArray(self, nums1, nums2):\n \"\"\"\n :type nums1: List[int]\n :type nums2: List[int]\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def maximumsSplicedArray(self, nums1: List[int], nums2: List[int]) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint maximumsSplicedArray(int* nums1, int nums1Size, int* nums2, int nums2Size){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MaximumsSplicedArray(int[] nums1, int[] nums2) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums1\n * @param {number[]} nums2\n * @return {number}\n */\nvar maximumsSplicedArray = function(nums1, nums2) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums1\n# @param {Integer[]} nums2\n# @return {Integer}\ndef maximums_spliced_array(nums1, nums2)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func maximumsSplicedArray(_ nums1: [Int], _ nums2: [Int]) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func maximumsSplicedArray(nums1 []int, nums2 []int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def maximumsSplicedArray(nums1: Array[Int], nums2: Array[Int]): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun maximumsSplicedArray(nums1: IntArray, nums2: IntArray): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn maximums_spliced_array(nums1: Vec, nums2: Vec) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums1\n * @param Integer[] $nums2\n * @return Integer\n */\n function maximumsSplicedArray($nums1, $nums2) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function maximumsSplicedArray(nums1: number[], nums2: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (maximums-spliced-array nums1 nums2)\n (-> (listof exact-integer?) (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec maximums_spliced_array(Nums1 :: [integer()], Nums2 :: [integer()]) -> integer().\nmaximums_spliced_array(Nums1, Nums2) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec maximums_spliced_array(nums1 :: [integer], nums2 :: [integer]) :: integer\n def maximums_spliced_array(nums1, nums2) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"9.7K\", \"totalSubmission\": \"18.6K\", \"totalAcceptedRaw\": 9736, \"totalSubmissionRaw\": 18585, \"acRate\": \"52.4%\"}", + "hints": [ + "Think on Dynamic Programming.", + "First assume you will be taking the array a and choose some subarray from b", + "Suppose the DP is DP(pos, state). pos is the current position you are in. state is one of {0,1,2}, where 0 means taking the array a, 1 means we are taking the subarray b, and 2 means we are again taking the array a. We need to handle the transitions carefully." + ], + "solution": null, + "status": null, + "sampleTestCase": "[60,60,60]\n[10,90,10]", + "metaData": "{\n \"name\": \"maximumsSplicedArray\",\n \"params\": [\n {\n \"name\": \"nums1\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[]\",\n \"name\": \"nums2\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17 . Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\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
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\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
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

\\r\\n\\r\\n

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/maximum-xor-after-operations.json b/leetcode/originData/maximum-xor-after-operations.json new file mode 100644 index 00000000..7b1c5656 --- /dev/null +++ b/leetcode/originData/maximum-xor-after-operations.json @@ -0,0 +1,176 @@ +{ + "data": { + "question": { + "questionId": "2402", + "questionFrontendId": "2317", + "boundTopicId": null, + "title": "Maximum XOR After Operations ", + "titleSlug": "maximum-xor-after-operations", + "content": "

You are given a 0-indexed integer array nums. In one operation, select any non-negative integer x and an index i, then update nums[i] to be equal to nums[i] AND (nums[i] XOR x).

\n\n

Note that AND is the bitwise AND operation and XOR is the bitwise XOR operation.

\n\n

Return the maximum possible bitwise XOR of all elements of nums after applying the operation any number of times.

\n\n

 

\n

Example 1:

\n\n
\nInput: nums = [3,2,4,6]\nOutput: 7\nExplanation: Apply the operation with x = 4 and i = 3, num[3] = 6 AND (6 XOR 4) = 6 AND 2 = 2.\nNow, nums = [3, 2, 4, 2] and the bitwise XOR of all the elements = 3 XOR 2 XOR 4 XOR 2 = 7.\nIt can be shown that 7 is the maximum possible bitwise XOR.\nNote that other operations may be used to achieve a bitwise XOR of 7.
\n\n

Example 2:

\n\n
\nInput: nums = [1,2,3,9,2]\nOutput: 11\nExplanation: Apply the operation zero times.\nThe bitwise XOR of all the elements = 1 XOR 2 XOR 3 XOR 9 XOR 2 = 11.\nIt can be shown that 11 is the maximum possible bitwise XOR.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= nums.length <= 105
  • \n\t
  • 0 <= nums[i] <= 108
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 162, + "dislikes": 98, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Maximum XOR of Two Numbers in an Array\", \"titleSlug\": \"maximum-xor-of-two-numbers-in-an-array\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]", + "exampleTestcases": "[3,2,4,6]\n[1,2,3,9,2]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Math", + "slug": "math", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Bit Manipulation", + "slug": "bit-manipulation", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int maximumXOR(vector& nums) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int maximumXOR(int[] nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def maximumXOR(self, nums):\n \"\"\"\n :type nums: List[int]\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def maximumXOR(self, nums: List[int]) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint maximumXOR(int* nums, int numsSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MaximumXOR(int[] nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @return {number}\n */\nvar maximumXOR = function(nums) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @return {Integer}\ndef maximum_xor(nums)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func maximumXOR(_ nums: [Int]) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func maximumXOR(nums []int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def maximumXOR(nums: Array[Int]): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun maximumXOR(nums: IntArray): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn maximum_xor(nums: Vec) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @return Integer\n */\n function maximumXOR($nums) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function maximumXOR(nums: number[]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (maximum-xor nums)\n (-> (listof exact-integer?) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec maximum_xor(Nums :: [integer()]) -> integer().\nmaximum_xor(Nums) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec maximum_xor(nums :: [integer]) :: integer\n def maximum_xor(nums) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"9K\", \"totalSubmission\": \"12.1K\", \"totalAcceptedRaw\": 9022, \"totalSubmissionRaw\": 12096, \"acRate\": \"74.6%\"}", + "hints": [ + "Consider what it means to be able to choose any x for the operation and which integers could be obtained from a given nums[i].", + "The given operation can unset any bit in nums[i].", + "The nth bit of the XOR of all the elements is 1 if the nth bit is 1 for an odd number of elements. When can we ensure it is odd?", + "Try to set every bit of the result to 1 if possible." + ], + "solution": null, + "status": null, + "sampleTestCase": "[3,2,4,6]", + "metaData": "{\n \"name\": \"maximumXOR\",\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, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17 . Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\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
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\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
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

\\r\\n\\r\\n

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/minimum-score-after-removals-on-a-tree.json b/leetcode/originData/minimum-score-after-removals-on-a-tree.json new file mode 100644 index 00000000..5b845ac1 --- /dev/null +++ b/leetcode/originData/minimum-score-after-removals-on-a-tree.json @@ -0,0 +1,180 @@ +{ + "data": { + "question": { + "questionId": "2400", + "questionFrontendId": "2322", + "boundTopicId": null, + "title": "Minimum Score After Removals on a Tree", + "titleSlug": "minimum-score-after-removals-on-a-tree", + "content": "

There is an undirected connected tree with n nodes labeled from 0 to n - 1 and n - 1 edges.

\n\n

You are given a 0-indexed integer array nums of length n where nums[i] represents the value of the ith node. You are also given a 2D integer array edges of length n - 1 where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the tree.

\n\n

Remove two distinct edges of the tree to form three connected components. For a pair of removed edges, the following steps are defined:

\n\n
    \n\t
  1. Get the XOR of all the values of the nodes for each of the three components respectively.
  2. \n\t
  3. The difference between the largest XOR value and the smallest XOR value is the score of the pair.
  4. \n
\n\n
    \n\t
  • For example, say the three components have the node values: [4,5,7], [1,9], and [3,3,3]. The three XOR values are 4 ^ 5 ^ 7 = 6, 1 ^ 9 = 8, and 3 ^ 3 ^ 3 = 3. The largest XOR value is 8 and the smallest XOR value is 3. The score is then 8 - 3 = 5.
  • \n
\n\n

Return the minimum score of any possible pair of edge removals on the given tree.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: nums = [1,5,5,4,11], edges = [[0,1],[1,2],[1,3],[3,4]]\nOutput: 9\nExplanation: The diagram above shows a way to make a pair of removals.\n- The 1st component has nodes [1,3,4] with values [5,4,11]. Its XOR value is 5 ^ 4 ^ 11 = 10.\n- The 2nd component has node [0] with value [1]. Its XOR value is 1 = 1.\n- The 3rd component has node [2] with value [5]. Its XOR value is 5 = 5.\nThe score is the difference between the largest and smallest XOR value which is 10 - 1 = 9.\nIt can be shown that no other pair of removals will obtain a smaller score than 9.\n
\n\n

Example 2:

\n\"\"\n
\nInput: nums = [5,5,2,4,4,2], edges = [[0,1],[1,2],[5,2],[4,3],[1,3]]\nOutput: 0\nExplanation: The diagram above shows a way to make a pair of removals.\n- The 1st component has nodes [3,4] with values [4,4]. Its XOR value is 4 ^ 4 = 0.\n- The 2nd component has nodes [1,0] with values [5,5]. Its XOR value is 5 ^ 5 = 0.\n- The 3rd component has nodes [2,5] with values [2,2]. Its XOR value is 2 ^ 2 = 0.\nThe score is the difference between the largest and smallest XOR value which is 0 - 0 = 0.\nWe cannot obtain a smaller score than 0.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • n == nums.length
  • \n\t
  • 3 <= n <= 1000
  • \n\t
  • 1 <= nums[i] <= 108
  • \n\t
  • edges.length == n - 1
  • \n\t
  • edges[i].length == 2
  • \n\t
  • 0 <= ai, bi < n
  • \n\t
  • ai != bi
  • \n\t
  • edges represents a valid tree.
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 190, + "dislikes": 7, + "isLiked": null, + "similarQuestions": "[]", + "exampleTestcases": "[1,5,5,4,11]\n[[0,1],[1,2],[1,3],[3,4]]\n[5,5,2,4,4,2]\n[[0,1],[1,2],[5,2],[4,3],[1,3]]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Bit Manipulation", + "slug": "bit-manipulation", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Tree", + "slug": "tree", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Depth-First Search", + "slug": "depth-first-search", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int minimumScore(vector& nums, vector>& edges) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int minimumScore(int[] nums, int[][] edges) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def minimumScore(self, nums, edges):\n \"\"\"\n :type nums: List[int]\n :type edges: List[List[int]]\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def minimumScore(self, nums: List[int], edges: List[List[int]]) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint minimumScore(int* nums, int numsSize, int** edges, int edgesSize, int* edgesColSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MinimumScore(int[] nums, int[][] edges) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number[]} nums\n * @param {number[][]} edges\n * @return {number}\n */\nvar minimumScore = function(nums, edges) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer[]} nums\n# @param {Integer[][]} edges\n# @return {Integer}\ndef minimum_score(nums, edges)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func minimumScore(_ nums: [Int], _ edges: [[Int]]) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func minimumScore(nums []int, edges [][]int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def minimumScore(nums: Array[Int], edges: Array[Array[Int]]): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun minimumScore(nums: IntArray, edges: Array): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn minimum_score(nums: Vec, edges: Vec>) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer[] $nums\n * @param Integer[][] $edges\n * @return Integer\n */\n function minimumScore($nums, $edges) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function minimumScore(nums: number[], edges: number[][]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (minimum-score nums edges)\n (-> (listof exact-integer?) (listof (listof exact-integer?)) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec minimum_score(Nums :: [integer()], Edges :: [[integer()]]) -> integer().\nminimum_score(Nums, Edges) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec minimum_score(nums :: [integer], edges :: [[integer]]) :: integer\n def minimum_score(nums, edges) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"6.2K\", \"totalAcceptedRaw\": 2870, \"totalSubmissionRaw\": 6158, \"acRate\": \"46.6%\"}", + "hints": [ + "Consider iterating over the first edge to remove, and then doing some precalculations on the 2 resulting connected components.", + "Will calculating the XOR of each subtree help?" + ], + "solution": null, + "status": null, + "sampleTestCase": "[1,5,5,4,11]\n[[0,1],[1,2],[1,3],[3,4]]", + "metaData": "{\n \"name\": \"minimumScore\",\n \"params\": [\n {\n \"name\": \"nums\",\n \"type\": \"integer[]\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"edges\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17 . Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\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
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\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
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

\\r\\n\\r\\n

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/number-of-distinct-roll-sequences.json b/leetcode/originData/number-of-distinct-roll-sequences.json new file mode 100644 index 00000000..ec172c25 --- /dev/null +++ b/leetcode/originData/number-of-distinct-roll-sequences.json @@ -0,0 +1,169 @@ +{ + "data": { + "question": { + "questionId": "2404", + "questionFrontendId": "2318", + "boundTopicId": null, + "title": "Number of Distinct Roll Sequences", + "titleSlug": "number-of-distinct-roll-sequences", + "content": "

You are given an integer n. You roll a fair 6-sided dice n times. Determine the total number of distinct sequences of rolls possible such that the following conditions are satisfied:

\n\n
    \n\t
  1. The greatest common divisor of any adjacent values in the sequence is equal to 1.
  2. \n\t
  3. There is at least a gap of 2 rolls between equal valued rolls. More formally, if the value of the ith roll is equal to the value of the jth roll, then abs(i - j) > 2.
  4. \n
\n\n

Return the total number of distinct sequences possible. Since the answer may be very large, return it modulo 109 + 7.

\n\n

Two sequences are considered distinct if at least one element is different.

\n\n

 

\n

Example 1:

\n\n
\nInput: n = 4\nOutput: 184\nExplanation: Some of the possible sequences are (1, 2, 3, 4), (6, 1, 2, 3), (1, 2, 3, 1), etc.\nSome invalid sequences are (1, 2, 1, 3), (1, 2, 3, 6).\n(1, 2, 1, 3) is invalid since the first and third roll have an equal value and abs(1 - 3) = 2 (i and j are 1-indexed).\n(1, 2, 3, 6) is invalid since the greatest common divisor of 3 and 6 = 3.\nThere are a total of 184 distinct sequences possible, so we return 184.
\n\n

Example 2:

\n\n
\nInput: n = 2\nOutput: 22\nExplanation: Some of the possible sequences are (1, 2), (2, 1), (3, 2).\nSome invalid sequences are (3, 6), (2, 4) since the greatest common divisor is not equal to 1.\nThere are a total of 22 distinct sequences possible, so we return 22.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= n <= 104
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 205, + "dislikes": 6, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Dice Roll Simulation\", \"titleSlug\": \"dice-roll-simulation\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Paint House III\", \"titleSlug\": \"paint-house-iii\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]", + "exampleTestcases": "4\n2", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Memoization", + "slug": "memoization", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int distinctSequences(int n) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int distinctSequences(int n) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def distinctSequences(self, n):\n \"\"\"\n :type n: int\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def distinctSequences(self, n: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint distinctSequences(int n){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int DistinctSequences(int n) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} n\n * @return {number}\n */\nvar distinctSequences = function(n) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} n\n# @return {Integer}\ndef distinct_sequences(n)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func distinctSequences(_ n: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func distinctSequences(n int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def distinctSequences(n: Int): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun distinctSequences(n: Int): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn distinct_sequences(n: i32) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $n\n * @return Integer\n */\n function distinctSequences($n) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function distinctSequences(n: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (distinct-sequences n)\n (-> exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec distinct_sequences(N :: integer()) -> integer().\ndistinct_sequences(N) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec distinct_sequences(n :: integer) :: integer\n def distinct_sequences(n) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"4.7K\", \"totalSubmission\": \"8.6K\", \"totalAcceptedRaw\": 4658, \"totalSubmissionRaw\": 8611, \"acRate\": \"54.1%\"}", + "hints": [ + "Can you think of a DP solution?", + "Consider a state that remembers the last 1 or 2 rolls.", + "Do you need to consider the last 3 rolls?" + ], + "solution": null, + "status": null, + "sampleTestCase": "4", + "metaData": "{\n \"name\": \"distinctSequences\",\n \"params\": [\n {\n \"name\": \"n\",\n \"type\": \"integer\"\n }\n ],\n \"return\": {\n \"type\": \"integer\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17 . Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\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
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\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
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

\\r\\n\\r\\n

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/selling-pieces-of-wood.json b/leetcode/originData/selling-pieces-of-wood.json new file mode 100644 index 00000000..e1d8b153 --- /dev/null +++ b/leetcode/originData/selling-pieces-of-wood.json @@ -0,0 +1,175 @@ +{ + "data": { + "question": { + "questionId": "1376", + "questionFrontendId": "2312", + "boundTopicId": null, + "title": "Selling Pieces of Wood", + "titleSlug": "selling-pieces-of-wood", + "content": "

You are given two integers m and n that represent the height and width of a rectangular piece of wood. You are also given a 2D integer array prices, where prices[i] = [hi, wi, pricei] indicates you can sell a rectangular piece of wood of height hi and width wi for pricei dollars.

\n\n

To cut a piece of wood, you must make a vertical or horizontal cut across the entire height or width of the piece to split it into two smaller pieces. After cutting a piece of wood into some number of smaller pieces, you can sell pieces according to prices. You may sell multiple pieces of the same shape, and you do not have to sell all the shapes. The grain of the wood makes a difference, so you cannot rotate a piece to swap its height and width.

\n\n

Return the maximum money you can earn after cutting an m x n piece of wood.

\n\n

Note that you can cut the piece of wood as many times as you want.

\n\n

 

\n

Example 1:

\n\"\"\n
\nInput: m = 3, n = 5, prices = [[1,4,2],[2,2,7],[2,1,3]]\nOutput: 19\nExplanation: The diagram above shows a possible scenario. It consists of:\n- 2 pieces of wood shaped 2 x 2, selling for a price of 2 * 7 = 14.\n- 1 piece of wood shaped 2 x 1, selling for a price of 1 * 3 = 3.\n- 1 piece of wood shaped 1 x 4, selling for a price of 1 * 2 = 2.\nThis obtains a total of 14 + 3 + 2 = 19 money earned.\nIt can be shown that 19 is the maximum amount of money that can be earned.\n
\n\n

Example 2:

\n\"\"\n
\nInput: m = 4, n = 6, prices = [[3,2,10],[1,4,2],[4,1,3]]\nOutput: 32\nExplanation: The diagram above shows a possible scenario. It consists of:\n- 3 pieces of wood shaped 3 x 2, selling for a price of 3 * 10 = 30.\n- 1 piece of wood shaped 1 x 4, selling for a price of 1 * 2 = 2.\nThis obtains a total of 30 + 2 = 32 money earned.\nIt can be shown that 32 is the maximum amount of money that can be earned.\nNotice that we cannot rotate the 1 x 4 piece of wood to obtain a 4 x 1 piece of wood.
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 1 <= m, n <= 200
  • \n\t
  • 1 <= prices.length <= 2 * 104
  • \n\t
  • prices[i].length == 3
  • \n\t
  • 1 <= hi <= m
  • \n\t
  • 1 <= wi <= n
  • \n\t
  • 1 <= pricei <= 106
  • \n\t
  • All the shapes of wood (hi, wi) are pairwise distinct.
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Hard", + "likes": 290, + "dislikes": 7, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Tiling a Rectangle with the Fewest Squares\", \"titleSlug\": \"tiling-a-rectangle-with-the-fewest-squares\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Number of Ways of Cutting a Pizza\", \"titleSlug\": \"number-of-ways-of-cutting-a-pizza\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]", + "exampleTestcases": "3\n5\n[[1,4,2],[2,2,7],[2,1,3]]\n4\n6\n[[3,2,10],[1,4,2],[4,1,3]]", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Array", + "slug": "array", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Memoization", + "slug": "memoization", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n long long sellingWood(int m, int n, vector>& prices) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public long sellingWood(int m, int n, int[][] prices) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def sellingWood(self, m, n, prices):\n \"\"\"\n :type m: int\n :type n: int\n :type prices: List[List[int]]\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def sellingWood(self, m: int, n: int, prices: List[List[int]]) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nlong long sellingWood(int m, int n, int** prices, int pricesSize, int* pricesColSize){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public long SellingWood(int m, int n, int[][] prices) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} m\n * @param {number} n\n * @param {number[][]} prices\n * @return {number}\n */\nvar sellingWood = function(m, n, prices) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} m\n# @param {Integer} n\n# @param {Integer[][]} prices\n# @return {Integer}\ndef selling_wood(m, n, prices)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func sellingWood(_ m: Int, _ n: Int, _ prices: [[Int]]) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func sellingWood(m int, n int, prices [][]int) int64 {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def sellingWood(m: Int, n: Int, prices: Array[Array[Int]]): Long = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun sellingWood(m: Int, n: Int, prices: Array): Long {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn selling_wood(m: i32, n: i32, prices: Vec>) -> i64 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $m\n * @param Integer $n\n * @param Integer[][] $prices\n * @return Integer\n */\n function sellingWood($m, $n, $prices) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function sellingWood(m: number, n: number, prices: number[][]): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (selling-wood m n prices)\n (-> exact-integer? exact-integer? (listof (listof exact-integer?)) exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec selling_wood(M :: integer(), N :: integer(), Prices :: [[integer()]]) -> integer().\nselling_wood(M, N, Prices) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec selling_wood(m :: integer, n :: integer, prices :: [[integer]]) :: integer\n def selling_wood(m, n, prices) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"4.9K\", \"totalSubmission\": \"10.6K\", \"totalAcceptedRaw\": 4899, \"totalSubmissionRaw\": 10628, \"acRate\": \"46.1%\"}", + "hints": [ + "Note down the different actions that can be done on a piece of wood with dimensions m x n. What do you notice?", + "If possible, we could sell the m x n piece. We could also cut the piece vertically creating two pieces of size m x n1 and m x n2 where n1 + n2 = n, or horizontally creating two pieces of size m1 x n and m2 x n where m1 + m2 = m.", + "Notice that cutting a piece breaks the problem down into smaller subproblems, and selling the piece when available is also a case that terminates the process. Thus, we can use DP to efficiently solve this." + ], + "solution": null, + "status": null, + "sampleTestCase": "3\n5\n[[1,4,2],[2,2,7],[2,1,3]]", + "metaData": "{\n \"name\": \"sellingWood\",\n \"params\": [\n {\n \"name\": \"m\",\n \"type\": \"integer\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"n\"\n },\n {\n \"type\": \"integer[][]\",\n \"name\": \"prices\"\n }\n ],\n \"return\": {\n \"type\": \"long\"\n }\n}", + "judgerAvailable": true, + "judgeType": "large", + "mysqlSchemas": [], + "enableRunCode": true, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17 . Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\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
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\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
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

\\r\\n\\r\\n

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/originData/sum-of-numbers-with-units-digit-k.json b/leetcode/originData/sum-of-numbers-with-units-digit-k.json new file mode 100644 index 00000000..4f78e72b --- /dev/null +++ b/leetcode/originData/sum-of-numbers-with-units-digit-k.json @@ -0,0 +1,180 @@ +{ + "data": { + "question": { + "questionId": "1334", + "questionFrontendId": "2310", + "boundTopicId": null, + "title": "Sum of Numbers With Units Digit K", + "titleSlug": "sum-of-numbers-with-units-digit-k", + "content": "

Given two integers num and k, consider a set of positive integers with the following properties:

\n\n
    \n\t
  • The units digit of each integer is k.
  • \n\t
  • The sum of the integers is num.
  • \n
\n\n

Return the minimum possible size of such a set, or -1 if no such set exists.

\n\n

Note:

\n\n
    \n\t
  • The set can contain multiple instances of the same integer, and the sum of an empty set is considered 0.
  • \n\t
  • The units digit of a number is the rightmost digit of the number.
  • \n
\n\n

 

\n

Example 1:

\n\n
\nInput: num = 58, k = 9\nOutput: 2\nExplanation:\nOne valid set is [9,49], as the sum is 58 and each integer has a units digit of 9.\nAnother valid set is [19,39].\nIt can be shown that 2 is the minimum possible size of a valid set.\n
\n\n

Example 2:

\n\n
\nInput: num = 37, k = 2\nOutput: -1\nExplanation: It is not possible to obtain a sum of 37 using only integers that have a units digit of 2.\n
\n\n

Example 3:

\n\n
\nInput: num = 0, k = 7\nOutput: 0\nExplanation: The sum of an empty set is considered 0.\n
\n\n

 

\n

Constraints:

\n\n
    \n\t
  • 0 <= num <= 3000
  • \n\t
  • 0 <= k <= 9
  • \n
\n", + "translatedTitle": null, + "translatedContent": null, + "isPaidOnly": false, + "difficulty": "Medium", + "likes": 198, + "dislikes": 233, + "isLiked": null, + "similarQuestions": "[{\"title\": \"Digit Count in Range\", \"titleSlug\": \"digit-count-in-range\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Count Integers With Even Digit Sum\", \"titleSlug\": \"count-integers-with-even-digit-sum\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]", + "exampleTestcases": "58\n9\n37\n2\n0\n7", + "categoryTitle": "Algorithms", + "contributors": [], + "topicTags": [ + { + "name": "Math", + "slug": "math", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Dynamic Programming", + "slug": "dynamic-programming", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Greedy", + "slug": "greedy", + "translatedName": null, + "__typename": "TopicTagNode" + }, + { + "name": "Enumeration", + "slug": "enumeration", + "translatedName": null, + "__typename": "TopicTagNode" + } + ], + "companyTagStats": null, + "codeSnippets": [ + { + "lang": "C++", + "langSlug": "cpp", + "code": "class Solution {\npublic:\n int minimumNumbers(int num, int k) {\n \n }\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Java", + "langSlug": "java", + "code": "class Solution {\n public int minimumNumbers(int num, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python", + "langSlug": "python", + "code": "class Solution(object):\n def minimumNumbers(self, num, k):\n \"\"\"\n :type num: int\n :type k: int\n :rtype: int\n \"\"\"\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Python3", + "langSlug": "python3", + "code": "class Solution:\n def minimumNumbers(self, num: int, k: int) -> int:\n ", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C", + "langSlug": "c", + "code": "\n\nint minimumNumbers(int num, int k){\n\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "C#", + "langSlug": "csharp", + "code": "public class Solution {\n public int MinimumNumbers(int num, int k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "JavaScript", + "langSlug": "javascript", + "code": "/**\n * @param {number} num\n * @param {number} k\n * @return {number}\n */\nvar minimumNumbers = function(num, k) {\n \n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Ruby", + "langSlug": "ruby", + "code": "# @param {Integer} num\n# @param {Integer} k\n# @return {Integer}\ndef minimum_numbers(num, k)\n \nend", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Swift", + "langSlug": "swift", + "code": "class Solution {\n func minimumNumbers(_ num: Int, _ k: Int) -> Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Go", + "langSlug": "golang", + "code": "func minimumNumbers(num int, k int) int {\n \n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Scala", + "langSlug": "scala", + "code": "object Solution {\n def minimumNumbers(num: Int, k: Int): Int = {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Kotlin", + "langSlug": "kotlin", + "code": "class Solution {\n fun minimumNumbers(num: Int, k: Int): Int {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Rust", + "langSlug": "rust", + "code": "impl Solution {\n pub fn minimum_numbers(num: i32, k: i32) -> i32 {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "PHP", + "langSlug": "php", + "code": "class Solution {\n\n /**\n * @param Integer $num\n * @param Integer $k\n * @return Integer\n */\n function minimumNumbers($num, $k) {\n \n }\n}", + "__typename": "CodeSnippetNode" + }, + { + "lang": "TypeScript", + "langSlug": "typescript", + "code": "function minimumNumbers(num: number, k: number): number {\n\n};", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Racket", + "langSlug": "racket", + "code": "(define/contract (minimum-numbers num k)\n (-> exact-integer? exact-integer? exact-integer?)\n\n )", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Erlang", + "langSlug": "erlang", + "code": "-spec minimum_numbers(Num :: integer(), K :: integer()) -> integer().\nminimum_numbers(Num, K) ->\n .", + "__typename": "CodeSnippetNode" + }, + { + "lang": "Elixir", + "langSlug": "elixir", + "code": "defmodule Solution do\n @spec minimum_numbers(num :: integer, k :: integer) :: integer\n def minimum_numbers(num, k) do\n\n end\nend", + "__typename": "CodeSnippetNode" + } + ], + "stats": "{\"totalAccepted\": \"16K\", \"totalSubmission\": \"65.2K\", \"totalAcceptedRaw\": 15987, \"totalSubmissionRaw\": 65217, \"acRate\": \"24.5%\"}", + "hints": [ + "Try solving this recursively.", + "Create a method that takes an integer x as a parameter. This method returns the minimum possible size of a set where each number has units digit k and the sum of the numbers in the set is x." + ], + "solution": null, + "status": null, + "sampleTestCase": "58\n9", + "metaData": "{\n \"name\": \"minimumNumbers\",\n \"params\": [\n {\n \"name\": \"num\",\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, + "enableTestMode": false, + "enableDebugger": true, + "envInfo": "{\"cpp\": [\"C++\", \"

Compiled with clang 11 using the latest C++ 17 standard.

\\r\\n\\r\\n

Your code is compiled with level two optimization (-O2). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\"], \"java\": [\"Java\", \"

OpenJDK 17 . Java 8 features such as lambda expressions and stream API can be used.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n

Includes Pair class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.

\"], \"python\": [\"Python\", \"

Python 2.7.12.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\\r\\n\\r\\n

Note that Python 2.7 will not be maintained past 2020. For the latest Python, please choose Python3 instead.

\"], \"c\": [\"C\", \"

Compiled with gcc 8.2 using the gnu11 standard.

\\r\\n\\r\\n

Your code is compiled with level one optimization (-O1). AddressSanitizer is also enabled to help detect out-of-bounds and use-after-free bugs.

\\r\\n\\r\\n

Most standard library headers are already included automatically for your convenience.

\\r\\n\\r\\n

For hash table operations, you may use uthash. \\\"uthash.h\\\" is included by default. Below are some examples:

\\r\\n\\r\\n

1. Adding an item to a hash.\\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
\\r\\n

\\r\\n\\r\\n

2. Looking up an item in a hash:\\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
\\r\\n

\\r\\n\\r\\n

3. Deleting an item in a hash:\\r\\n

\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n    HASH_DEL(users, user);  \\r\\n}\\r\\n
\\r\\n

\"], \"csharp\": [\"C#\", \"

C# 10 with .NET 6 runtime

\"], \"javascript\": [\"JavaScript\", \"

Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES6 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\\r\\n\\r\\n

For Priority Queue / Queue data structures, you may use datastructures-js/priority-queue and datastructures-js/queue.

\"], \"ruby\": [\"Ruby\", \"

Ruby 3.1

\\r\\n\\r\\n

Some common data structure implementations are provided in the Algorithms module: https://www.rubydoc.info/github/kanwei/algorithms/Algorithms

\"], \"swift\": [\"Swift\", \"

Swift 5.5.2.

\"], \"golang\": [\"Go\", \"

Go 1.17.6.

\\r\\n\\r\\n

Support https://godoc.org/github.com/emirpasic/gods library.

\"], \"python3\": [\"Python3\", \"

Python 3.10.

\\r\\n\\r\\n

Most libraries are already imported automatically for your convenience, such as array, bisect, collections. If you need more libraries, you can import it yourself.

\\r\\n\\r\\n

For Map/TreeMap data structure, you may use sortedcontainers library.

\"], \"scala\": [\"Scala\", \"

Scala 2.13.7.

\"], \"kotlin\": [\"Kotlin\", \"

Kotlin 1.3.10.

\"], \"rust\": [\"Rust\", \"

Rust 1.58.1

\\r\\n\\r\\n

Supports rand v0.6\\u00a0from crates.io

\"], \"php\": [\"PHP\", \"

PHP 8.1.

\\r\\n

With bcmath module

\"], \"typescript\": [\"Typescript\", \"

TypeScript 4.5.4, Node.js 16.13.2.

\\r\\n\\r\\n

Your code is run with --harmony flag, enabling new ES2020 features.

\\r\\n\\r\\n

lodash.js library is included by default.

\"], \"racket\": [\"Racket\", \"

Run with Racket 8.3.

\"], \"erlang\": [\"Erlang\", \"Erlang/OTP 24.2\"], \"elixir\": [\"Elixir\", \"Elixir 1.13.0 with Erlang/OTP 24.2\"]}", + "libraryUrl": null, + "adminUrl": null, + "challengeQuestion": null, + "__typename": "QuestionNode" + } + } +} \ No newline at end of file diff --git a/leetcode/problem/check-if-matrix-is-x-matrix.html b/leetcode/problem/check-if-matrix-is-x-matrix.html new file mode 100644 index 00000000..1712e040 --- /dev/null +++ b/leetcode/problem/check-if-matrix-is-x-matrix.html @@ -0,0 +1,38 @@ +

A square matrix is said to be an X-Matrix if both of the following conditions hold:

+ +
    +
  1. All the elements in the diagonals of the matrix are non-zero.
  2. +
  3. All other elements are 0.
  4. +
+ +

Given a 2D integer array grid of size n x n representing a square matrix, return true if grid is an X-Matrix. Otherwise, return false.

+ +

 

+

Example 1:

+ +
+Input: grid = [[2,0,0,1],[0,3,1,0],[0,5,2,0],[4,0,0,2]]
+Output: true
+Explanation: Refer to the diagram above. 
+An X-Matrix should have the green elements (diagonals) be non-zero and the red elements be 0.
+Thus, grid is an X-Matrix.
+
+ +

Example 2:

+ +
+Input: grid = [[5,7,0],[0,3,1],[0,5,0]]
+Output: false
+Explanation: Refer to the diagram above.
+An X-Matrix should have the green elements (diagonals) be non-zero and the red elements be 0.
+Thus, grid is not an X-Matrix.
+
+ +

 

+

Constraints:

+ +
    +
  • n == grid.length == grid[i].length
  • +
  • 3 <= n <= 100
  • +
  • 0 <= grid[i][j] <= 105
  • +
diff --git a/leetcode/problem/count-asterisks.html b/leetcode/problem/count-asterisks.html new file mode 100644 index 00000000..dcc8bac7 --- /dev/null +++ b/leetcode/problem/count-asterisks.html @@ -0,0 +1,40 @@ +

You are given a string s, where every two consecutive vertical bars '|' are grouped into a pair. In other words, the 1st and 2nd '|' make a pair, the 3rd and 4th '|' make a pair, and so forth.

+ +

Return the number of '*' in s, excluding the '*' between each pair of '|'.

+ +

Note that each '|' will belong to exactly one pair.

+ +

 

+

Example 1:

+ +
+Input: s = "l|*e*et|c**o|*de|"
+Output: 2
+Explanation: The considered characters are underlined: "l|*e*et|c**o|*de|".
+The characters between the first and second '|' are excluded from the answer.
+Also, the characters between the third and fourth '|' are excluded from the answer.
+There are 2 asterisks considered. Therefore, we return 2.
+ +

Example 2:

+ +
+Input: s = "iamprogrammer"
+Output: 0
+Explanation: In this example, there are no asterisks in s. Therefore, we return 0.
+
+ +

Example 3:

+ +
+Input: s = "yo|uar|e**|b|e***au|tifu|l"
+Output: 5
+Explanation: The considered characters are underlined: "yo|uar|e**|b|e***au|tifu|l". There are 5 asterisks considered. Therefore, we return 5.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 1000
  • +
  • s consists of lowercase English letters, vertical bars '|', and asterisks '*'.
  • +
  • s contains an even number of vertical bars '|'.
  • +
diff --git a/leetcode/problem/count-number-of-ways-to-place-houses.html b/leetcode/problem/count-number-of-ways-to-place-houses.html new file mode 100644 index 00000000..2230d4f7 --- /dev/null +++ b/leetcode/problem/count-number-of-ways-to-place-houses.html @@ -0,0 +1,34 @@ +

There is a street with n * 2 plots, where there are n plots on each side of the street. The plots on each side are numbered from 1 to n. On each plot, a house can be placed.

+ +

Return the number of ways houses can be placed such that no two houses are adjacent to each other on the same side of the street. Since the answer may be very large, return it modulo 109 + 7.

+ +

Note that if a house is placed on the ith plot on one side of the street, a house can also be placed on the ith plot on the other side of the street.

+ +

 

+

Example 1:

+ +
+Input: n = 1
+Output: 4
+Explanation: 
+Possible arrangements:
+1. All plots are empty.
+2. A house is placed on one side of the street.
+3. A house is placed on the other side of the street.
+4. Two houses are placed, one on each side of the street.
+
+ +

Example 2:

+ +
+Input: n = 2
+Output: 9
+Explanation: The 9 possible arrangements are shown in the diagram above.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 104
  • +
diff --git a/leetcode/problem/count-unreachable-pairs-of-nodes-in-an-undirected-graph.html b/leetcode/problem/count-unreachable-pairs-of-nodes-in-an-undirected-graph.html new file mode 100644 index 00000000..4af467bb --- /dev/null +++ b/leetcode/problem/count-unreachable-pairs-of-nodes-in-an-undirected-graph.html @@ -0,0 +1,34 @@ +

You are given an integer n. There is an undirected graph with n nodes, numbered from 0 to n - 1. You are given a 2D integer array edges where edges[i] = [ai, bi] denotes that there exists an undirected edge connecting nodes ai and bi.

+ +

Return the number of pairs of different nodes that are unreachable from each other.

+ +

 

+

Example 1:

+ +
+Input: n = 3, edges = [[0,1],[0,2],[1,2]]
+Output: 0
+Explanation: There are no pairs of nodes that are unreachable from each other. Therefore, we return 0.
+
+ +

Example 2:

+ +
+Input: n = 7, edges = [[0,2],[0,5],[2,4],[1,6],[5,4]]
+Output: 14
+Explanation: There are 14 pairs of nodes that are unreachable from each other:
+[[0,1],[0,3],[0,6],[1,2],[1,3],[1,4],[1,5],[2,3],[2,6],[3,4],[3,5],[3,6],[4,6],[5,6]].
+Therefore, we return 14.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 105
  • +
  • 0 <= edges.length <= 2 * 105
  • +
  • edges[i].length == 2
  • +
  • 0 <= ai, bi < n
  • +
  • ai != bi
  • +
  • There are no repeated edges.
  • +
diff --git a/leetcode/problem/greatest-english-letter-in-upper-and-lower-case.html b/leetcode/problem/greatest-english-letter-in-upper-and-lower-case.html new file mode 100644 index 00000000..be730375 --- /dev/null +++ b/leetcode/problem/greatest-english-letter-in-upper-and-lower-case.html @@ -0,0 +1,40 @@ +

Given a string of English letters s, return the greatest English letter which occurs as both a lowercase and uppercase letter in s. The returned letter should be in uppercase. If no such letter exists, return an empty string.

+ +

An English letter b is greater than another letter a if b appears after a in the English alphabet.

+ +

 

+

Example 1:

+ +
+Input: s = "lEeTcOdE"
+Output: "E"
+Explanation:
+The letter 'E' is the only letter to appear in both lower and upper case.
+
+ +

Example 2:

+ +
+Input: s = "arRAzFif"
+Output: "R"
+Explanation:
+The letter 'R' is the greatest letter to appear in both lower and upper case.
+Note that 'A' and 'F' also appear in both lower and upper case, but 'R' is greater than 'F' or 'A'.
+
+ +

Example 3:

+ +
+Input: s = "AbCdEfGhIjK"
+Output: ""
+Explanation:
+There is no letter that appears in both lower and upper case.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 1000
  • +
  • s consists of lowercase and uppercase English letters.
  • +
diff --git a/leetcode/problem/longest-binary-subsequence-less-than-or-equal-to-k.html b/leetcode/problem/longest-binary-subsequence-less-than-or-equal-to-k.html new file mode 100644 index 00000000..476d053f --- /dev/null +++ b/leetcode/problem/longest-binary-subsequence-less-than-or-equal-to-k.html @@ -0,0 +1,40 @@ +

You are given a binary string s and a positive integer k.

+ +

Return the length of the longest subsequence of s that makes up a binary number less than or equal to k.

+ +

Note:

+ +
    +
  • The subsequence can contain leading zeroes.
  • +
  • The empty string is considered to be equal to 0.
  • +
  • A subsequence is a string that can be derived from another string by deleting some or no characters without changing the order of the remaining characters.
  • +
+ +

 

+

Example 1:

+ +
+Input: s = "1001010", k = 5
+Output: 5
+Explanation: The longest subsequence of s that makes up a binary number less than or equal to 5 is "00010", as this number is equal to 2 in decimal.
+Note that "00100" and "00101" are also possible, which are equal to 4 and 5 in decimal, respectively.
+The length of this subsequence is 5, so 5 is returned.
+
+ +

Example 2:

+ +
+Input: s = "00101001", k = 1
+Output: 6
+Explanation: "000001" is the longest subsequence of s that makes up a binary number less than or equal to 1, as this number is equal to 1 in decimal.
+The length of this subsequence is 6, so 6 is returned.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= s.length <= 1000
  • +
  • s[i] is either '0' or '1'.
  • +
  • 1 <= k <= 109
  • +
diff --git a/leetcode/problem/maximum-score-of-spliced-array.html b/leetcode/problem/maximum-score-of-spliced-array.html new file mode 100644 index 00000000..29cb1afb --- /dev/null +++ b/leetcode/problem/maximum-score-of-spliced-array.html @@ -0,0 +1,51 @@ +

You are given two 0-indexed integer arrays nums1 and nums2, both of length n.

+ +

You can choose two integers left and right where 0 <= left <= right < n and swap the subarray nums1[left...right] with the subarray nums2[left...right].

+ +
    +
  • For example, if nums1 = [1,2,3,4,5] and nums2 = [11,12,13,14,15] and you choose left = 1 and right = 2, nums1 becomes [1,12,13,4,5] and nums2 becomes [11,2,3,14,15].
  • +
+ +

You may choose to apply the mentioned operation once or not do anything.

+ +

The score of the arrays is the maximum of sum(nums1) and sum(nums2), where sum(arr) is the sum of all the elements in the array arr.

+ +

Return the maximum possible score.

+ +

A subarray is a contiguous sequence of elements within an array. arr[left...right] denotes the subarray that contains the elements of nums between indices left and right (inclusive).

+ +

 

+

Example 1:

+ +
+Input: nums1 = [60,60,60], nums2 = [10,90,10]
+Output: 210
+Explanation: Choosing left = 1 and right = 1, we have nums1 = [60,90,60] and nums2 = [10,60,10].
+The score is max(sum(nums1), sum(nums2)) = max(210, 80) = 210.
+ +

Example 2:

+ +
+Input: nums1 = [20,40,20,70,30], nums2 = [50,20,50,40,20]
+Output: 220
+Explanation: Choosing left = 3, right = 4, we have nums1 = [20,40,20,40,20] and nums2 = [50,20,50,70,30].
+The score is max(sum(nums1), sum(nums2)) = max(140, 220) = 220.
+
+ +

Example 3:

+ +
+Input: nums1 = [7,11,13], nums2 = [1,1,1]
+Output: 31
+Explanation: We choose not to swap any subarray.
+The score is max(sum(nums1), sum(nums2)) = max(31, 3) = 31.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums1.length == nums2.length
  • +
  • 1 <= n <= 105
  • +
  • 1 <= nums1[i], nums2[i] <= 104
  • +
diff --git a/leetcode/problem/maximum-xor-after-operations.html b/leetcode/problem/maximum-xor-after-operations.html new file mode 100644 index 00000000..015fa764 --- /dev/null +++ b/leetcode/problem/maximum-xor-after-operations.html @@ -0,0 +1,33 @@ +

You are given a 0-indexed integer array nums. In one operation, select any non-negative integer x and an index i, then update nums[i] to be equal to nums[i] AND (nums[i] XOR x).

+ +

Note that AND is the bitwise AND operation and XOR is the bitwise XOR operation.

+ +

Return the maximum possible bitwise XOR of all elements of nums after applying the operation any number of times.

+ +

 

+

Example 1:

+ +
+Input: nums = [3,2,4,6]
+Output: 7
+Explanation: Apply the operation with x = 4 and i = 3, num[3] = 6 AND (6 XOR 4) = 6 AND 2 = 2.
+Now, nums = [3, 2, 4, 2] and the bitwise XOR of all the elements = 3 XOR 2 XOR 4 XOR 2 = 7.
+It can be shown that 7 is the maximum possible bitwise XOR.
+Note that other operations may be used to achieve a bitwise XOR of 7.
+ +

Example 2:

+ +
+Input: nums = [1,2,3,9,2]
+Output: 11
+Explanation: Apply the operation zero times.
+The bitwise XOR of all the elements = 1 XOR 2 XOR 3 XOR 9 XOR 2 = 11.
+It can be shown that 11 is the maximum possible bitwise XOR.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= nums.length <= 105
  • +
  • 0 <= nums[i] <= 108
  • +
diff --git a/leetcode/problem/minimum-score-after-removals-on-a-tree.html b/leetcode/problem/minimum-score-after-removals-on-a-tree.html new file mode 100644 index 00000000..3f9427e2 --- /dev/null +++ b/leetcode/problem/minimum-score-after-removals-on-a-tree.html @@ -0,0 +1,57 @@ +

There is an undirected connected tree with n nodes labeled from 0 to n - 1 and n - 1 edges.

+ +

You are given a 0-indexed integer array nums of length n where nums[i] represents the value of the ith node. You are also given a 2D integer array edges of length n - 1 where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the tree.

+ +

Remove two distinct edges of the tree to form three connected components. For a pair of removed edges, the following steps are defined:

+ +
    +
  1. Get the XOR of all the values of the nodes for each of the three components respectively.
  2. +
  3. The difference between the largest XOR value and the smallest XOR value is the score of the pair.
  4. +
+ +
    +
  • For example, say the three components have the node values: [4,5,7], [1,9], and [3,3,3]. The three XOR values are 4 ^ 5 ^ 7 = 6, 1 ^ 9 = 8, and 3 ^ 3 ^ 3 = 3. The largest XOR value is 8 and the smallest XOR value is 3. The score is then 8 - 3 = 5.
  • +
+ +

Return the minimum score of any possible pair of edge removals on the given tree.

+ +

 

+

Example 1:

+ +
+Input: nums = [1,5,5,4,11], edges = [[0,1],[1,2],[1,3],[3,4]]
+Output: 9
+Explanation: The diagram above shows a way to make a pair of removals.
+- The 1st component has nodes [1,3,4] with values [5,4,11]. Its XOR value is 5 ^ 4 ^ 11 = 10.
+- The 2nd component has node [0] with value [1]. Its XOR value is 1 = 1.
+- The 3rd component has node [2] with value [5]. Its XOR value is 5 = 5.
+The score is the difference between the largest and smallest XOR value which is 10 - 1 = 9.
+It can be shown that no other pair of removals will obtain a smaller score than 9.
+
+ +

Example 2:

+ +
+Input: nums = [5,5,2,4,4,2], edges = [[0,1],[1,2],[5,2],[4,3],[1,3]]
+Output: 0
+Explanation: The diagram above shows a way to make a pair of removals.
+- The 1st component has nodes [3,4] with values [4,4]. Its XOR value is 4 ^ 4 = 0.
+- The 2nd component has nodes [1,0] with values [5,5]. Its XOR value is 5 ^ 5 = 0.
+- The 3rd component has nodes [2,5] with values [2,2]. Its XOR value is 2 ^ 2 = 0.
+The score is the difference between the largest and smallest XOR value which is 0 - 0 = 0.
+We cannot obtain a smaller score than 0.
+
+ +

 

+

Constraints:

+ +
    +
  • n == nums.length
  • +
  • 3 <= n <= 1000
  • +
  • 1 <= nums[i] <= 108
  • +
  • edges.length == n - 1
  • +
  • edges[i].length == 2
  • +
  • 0 <= ai, bi < n
  • +
  • ai != bi
  • +
  • edges represents a valid tree.
  • +
diff --git a/leetcode/problem/number-of-distinct-roll-sequences.html b/leetcode/problem/number-of-distinct-roll-sequences.html new file mode 100644 index 00000000..ea75360f --- /dev/null +++ b/leetcode/problem/number-of-distinct-roll-sequences.html @@ -0,0 +1,39 @@ +

You are given an integer n. You roll a fair 6-sided dice n times. Determine the total number of distinct sequences of rolls possible such that the following conditions are satisfied:

+ +
    +
  1. The greatest common divisor of any adjacent values in the sequence is equal to 1.
  2. +
  3. There is at least a gap of 2 rolls between equal valued rolls. More formally, if the value of the ith roll is equal to the value of the jth roll, then abs(i - j) > 2.
  4. +
+ +

Return the total number of distinct sequences possible. Since the answer may be very large, return it modulo 109 + 7.

+ +

Two sequences are considered distinct if at least one element is different.

+ +

 

+

Example 1:

+ +
+Input: n = 4
+Output: 184
+Explanation: Some of the possible sequences are (1, 2, 3, 4), (6, 1, 2, 3), (1, 2, 3, 1), etc.
+Some invalid sequences are (1, 2, 1, 3), (1, 2, 3, 6).
+(1, 2, 1, 3) is invalid since the first and third roll have an equal value and abs(1 - 3) = 2 (i and j are 1-indexed).
+(1, 2, 3, 6) is invalid since the greatest common divisor of 3 and 6 = 3.
+There are a total of 184 distinct sequences possible, so we return 184.
+ +

Example 2:

+ +
+Input: n = 2
+Output: 22
+Explanation: Some of the possible sequences are (1, 2), (2, 1), (3, 2).
+Some invalid sequences are (3, 6), (2, 4) since the greatest common divisor is not equal to 1.
+There are a total of 22 distinct sequences possible, so we return 22.
+
+ +

 

+

Constraints:

+ +
    +
  • 1 <= n <= 104
  • +
diff --git a/leetcode/problem/selling-pieces-of-wood.html b/leetcode/problem/selling-pieces-of-wood.html new file mode 100644 index 00000000..46ae87f0 --- /dev/null +++ b/leetcode/problem/selling-pieces-of-wood.html @@ -0,0 +1,46 @@ +

You are given two integers m and n that represent the height and width of a rectangular piece of wood. You are also given a 2D integer array prices, where prices[i] = [hi, wi, pricei] indicates you can sell a rectangular piece of wood of height hi and width wi for pricei dollars.

+ +

To cut a piece of wood, you must make a vertical or horizontal cut across the entire height or width of the piece to split it into two smaller pieces. After cutting a piece of wood into some number of smaller pieces, you can sell pieces according to prices. You may sell multiple pieces of the same shape, and you do not have to sell all the shapes. The grain of the wood makes a difference, so you cannot rotate a piece to swap its height and width.

+ +

Return the maximum money you can earn after cutting an m x n piece of wood.

+ +

Note that you can cut the piece of wood as many times as you want.

+ +

 

+

Example 1:

+ +
+Input: m = 3, n = 5, prices = [[1,4,2],[2,2,7],[2,1,3]]
+Output: 19
+Explanation: The diagram above shows a possible scenario. It consists of:
+- 2 pieces of wood shaped 2 x 2, selling for a price of 2 * 7 = 14.
+- 1 piece of wood shaped 2 x 1, selling for a price of 1 * 3 = 3.
+- 1 piece of wood shaped 1 x 4, selling for a price of 1 * 2 = 2.
+This obtains a total of 14 + 3 + 2 = 19 money earned.
+It can be shown that 19 is the maximum amount of money that can be earned.
+
+ +

Example 2:

+ +
+Input: m = 4, n = 6, prices = [[3,2,10],[1,4,2],[4,1,3]]
+Output: 32
+Explanation: The diagram above shows a possible scenario. It consists of:
+- 3 pieces of wood shaped 3 x 2, selling for a price of 3 * 10 = 30.
+- 1 piece of wood shaped 1 x 4, selling for a price of 1 * 2 = 2.
+This obtains a total of 30 + 2 = 32 money earned.
+It can be shown that 32 is the maximum amount of money that can be earned.
+Notice that we cannot rotate the 1 x 4 piece of wood to obtain a 4 x 1 piece of wood.
+ +

 

+

Constraints:

+ +
    +
  • 1 <= m, n <= 200
  • +
  • 1 <= prices.length <= 2 * 104
  • +
  • prices[i].length == 3
  • +
  • 1 <= hi <= m
  • +
  • 1 <= wi <= n
  • +
  • 1 <= pricei <= 106
  • +
  • All the shapes of wood (hi, wi) are pairwise distinct.
  • +
diff --git a/leetcode/problem/sum-of-numbers-with-units-digit-k.html b/leetcode/problem/sum-of-numbers-with-units-digit-k.html new file mode 100644 index 00000000..4c64c408 --- /dev/null +++ b/leetcode/problem/sum-of-numbers-with-units-digit-k.html @@ -0,0 +1,51 @@ +

Given two integers num and k, consider a set of positive integers with the following properties:

+ +
    +
  • The units digit of each integer is k.
  • +
  • The sum of the integers is num.
  • +
+ +

Return the minimum possible size of such a set, or -1 if no such set exists.

+ +

Note:

+ +
    +
  • The set can contain multiple instances of the same integer, and the sum of an empty set is considered 0.
  • +
  • The units digit of a number is the rightmost digit of the number.
  • +
+ +

 

+

Example 1:

+ +
+Input: num = 58, k = 9
+Output: 2
+Explanation:
+One valid set is [9,49], as the sum is 58 and each integer has a units digit of 9.
+Another valid set is [19,39].
+It can be shown that 2 is the minimum possible size of a valid set.
+
+ +

Example 2:

+ +
+Input: num = 37, k = 2
+Output: -1
+Explanation: It is not possible to obtain a sum of 37 using only integers that have a units digit of 2.
+
+ +

Example 3:

+ +
+Input: num = 0, k = 7
+Output: 0
+Explanation: The sum of an empty set is considered 0.
+
+ +

 

+

Constraints:

+ +
    +
  • 0 <= num <= 3000
  • +
  • 0 <= k <= 9
  • +

\\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